1 <?xml version="1.0" encoding="UTF-8"?>
2 <!DOCTYPE why3session PUBLIC "-//Why3//proof session v5//EN"
3 "http://why3.lri.fr/why3session.dtd">
4 <why3session shape_version="6">
5 <prover id="0" name="Alt-Ergo" version="2.1.0" timelimit="1" steplimit="0" memlimit="1000"/>
6 <prover id="1" name="CVC5" version="1.0.5" timelimit="1" steplimit="0" memlimit="1000"/>
7 <prover id="3" name="CVC4" version="1.5" timelimit="1" steplimit="0" memlimit="1000"/>
8 <file format="whyml" proved="true">
9 <path name=".."/><path name="generate_all_trees.mlw"/>
10 <theory name="GenerateAllTrees" proved="true">
11 <goal name="size_nonneg" proved="true">
12 <transf name="induction_ty_lex" proved="true" >
13 <goal name="size_nonneg.0" proved="true">
14 <proof prover="3"><result status="valid" time="0.010000" steps="4593"/></proof>
18 <goal name="size_left" proved="true">
19 <proof prover="1"><result status="valid" time="0.020000" steps="3069"/></proof>
21 <goal name="all_trees_0" proved="true">
22 <proof prover="1"><result status="valid" time="0.030000" steps="7545"/></proof>
24 <goal name="tree_diff" proved="true">
25 <proof prover="3"><result status="valid" time="0.040000" steps="5876"/></proof>
27 <goal name="combine'vc" expl="VC for combine" proved="true">
28 <transf name="split_goal_right" proved="true" >
29 <goal name="combine'vc.0" expl="variant decrease" proved="true">
30 <proof prover="3"><result status="valid" time="0.040000" steps="8401"/></proof>
32 <goal name="combine'vc.1" expl="precondition" proved="true">
33 <proof prover="0"><result status="valid" time="0.020000" steps="177"/></proof>
35 <goal name="combine'vc.2" expl="postcondition" proved="true">
36 <proof prover="0"><result status="valid" time="0.160000" steps="1891"/></proof>
38 <goal name="combine'vc.3" expl="postcondition" proved="true">
39 <proof prover="3"><result status="valid" time="0.110000" steps="29125"/></proof>
41 <goal name="combine'vc.4" expl="variant decrease" proved="true">
42 <proof prover="3"><result status="valid" time="0.020000" steps="8050"/></proof>
44 <goal name="combine'vc.5" expl="precondition" proved="true">
45 <proof prover="0"><result status="valid" time="0.020000" steps="119"/></proof>
47 <goal name="combine'vc.6" expl="precondition" proved="true">
48 <proof prover="3"><result status="valid" time="0.020000" steps="7085"/></proof>
50 <goal name="combine'vc.7" expl="postcondition" proved="true">
51 <proof prover="0"><result status="valid" time="0.120000" steps="1222"/></proof>
53 <goal name="combine'vc.8" expl="postcondition" proved="true">
54 <proof prover="3"><result status="valid" time="0.140000" steps="27931"/></proof>
56 <goal name="combine'vc.9" expl="precondition" proved="true">
57 <proof prover="3"><result status="valid" time="0.020000" steps="5696"/></proof>
59 <goal name="combine'vc.10" expl="postcondition" proved="true">
60 <proof prover="3"><result status="valid" time="0.010000" steps="5715"/></proof>
62 <goal name="combine'vc.11" expl="postcondition" proved="true">
63 <proof prover="3"><result status="valid" time="0.070000" steps="15345"/></proof>
67 <goal name="all_trees'vc" expl="VC for all_trees" proved="true">
68 <transf name="split_goal_right" proved="true" >
69 <goal name="all_trees'vc.0" expl="array creation size" proved="true">
70 <proof prover="3"><result status="valid" time="0.020000" steps="5051"/></proof>
72 <goal name="all_trees'vc.1" expl="index in array bounds" proved="true">
73 <proof prover="3"><result status="valid" time="0.020000" steps="6763"/></proof>
75 <goal name="all_trees'vc.2" expl="loop invariant init" proved="true">
76 <proof prover="0"><result status="valid" time="0.020000" steps="23"/></proof>
78 <goal name="all_trees'vc.3" expl="index in array bounds" proved="true">
79 <proof prover="3"><result status="valid" time="0.020000" steps="8680"/></proof>
81 <goal name="all_trees'vc.4" expl="loop invariant init" proved="true">
82 <proof prover="0"><result status="valid" time="0.000000" steps="116"/></proof>
84 <goal name="all_trees'vc.5" expl="loop invariant init" proved="true">
85 <proof prover="0"><result status="valid" time="0.000000" steps="32"/></proof>
87 <goal name="all_trees'vc.6" expl="loop invariant init" proved="true">
88 <proof prover="0"><result status="valid" time="0.010000" steps="96"/></proof>
90 <goal name="all_trees'vc.7" expl="index in array bounds" proved="true">
91 <proof prover="3"><result status="valid" time="0.020000" steps="11044"/></proof>
93 <goal name="all_trees'vc.8" expl="index in array bounds" proved="true">
94 <proof prover="3"><result status="valid" time="0.030000" steps="11083"/></proof>
96 <goal name="all_trees'vc.9" expl="index in array bounds" proved="true">
97 <proof prover="3"><result status="valid" time="0.020000" steps="11051"/></proof>
99 <goal name="all_trees'vc.10" expl="precondition" proved="true">
100 <proof prover="3"><result status="valid" time="0.040000" steps="12244"/></proof>
102 <goal name="all_trees'vc.11" expl="index in array bounds" proved="true">
103 <proof prover="3"><result status="valid" time="0.020000" steps="11789"/></proof>
105 <goal name="all_trees'vc.12" expl="loop invariant preservation" proved="true">
106 <proof prover="0"><result status="valid" time="0.040000" steps="221"/></proof>
108 <goal name="all_trees'vc.13" expl="loop invariant preservation" proved="true">
109 <proof prover="0"><result status="valid" time="0.050000" steps="380"/></proof>
111 <goal name="all_trees'vc.14" expl="loop invariant preservation" proved="true">
112 <proof prover="3"><result status="valid" time="0.370000" steps="71317"/></proof>
114 <goal name="all_trees'vc.15" expl="loop invariant preservation" proved="true">
115 <proof prover="3"><result status="valid" time="0.020000" steps="17413"/></proof>
117 <goal name="all_trees'vc.16" expl="loop invariant preservation" proved="true">
118 <proof prover="3"><result status="valid" time="0.060000" steps="9495"/></proof>
120 <goal name="all_trees'vc.17" expl="postcondition" proved="true">
121 <proof prover="3"><result status="valid" time="0.020000" steps="9372"/></proof>
123 <goal name="all_trees'vc.18" expl="out of loop bounds" proved="true">
124 <proof prover="3"><result status="valid" time="0.010000" steps="7313"/></proof>