<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE why3session PUBLIC "-//Why3//proof session v5//EN"
"http://why3.lri.fr/why3session.dtd">
<why3session shape_version="6">
<prover id="0" name="Alt-Ergo" version="2.1.0" timelimit="1" steplimit="0" memlimit="1000"/>
<prover id="1" name="CVC5" version="1.0.5" timelimit="1" steplimit="0" memlimit="1000"/>
<prover id="3" name="CVC4" version="1.5" timelimit="1" steplimit="0" memlimit="1000"/>
<file format="whyml" proved="true">
<path name=".."/><path name="generate_all_trees.mlw"/>
<theory name="GenerateAllTrees" proved="true">
 <goal name="size_nonneg" proved="true">
 <transf name="induction_ty_lex" proved="true" >
  <goal name="size_nonneg.0" proved="true">
  <proof prover="3"><result status="valid" time="0.010000" steps="4593"/></proof>
  </goal>
 </transf>
 </goal>
 <goal name="size_left" proved="true">
 <proof prover="1"><result status="valid" time="0.020000" steps="3069"/></proof>
 </goal>
 <goal name="all_trees_0" proved="true">
 <proof prover="1"><result status="valid" time="0.030000" steps="7545"/></proof>
 </goal>
 <goal name="tree_diff" proved="true">
 <proof prover="3"><result status="valid" time="0.040000" steps="5876"/></proof>
 </goal>
 <goal name="combine&#39;vc" expl="VC for combine" proved="true">
 <transf name="split_goal_right" proved="true" >
  <goal name="combine&#39;vc.0" expl="variant decrease" proved="true">
  <proof prover="3"><result status="valid" time="0.040000" steps="8401"/></proof>
  </goal>
  <goal name="combine&#39;vc.1" expl="precondition" proved="true">
  <proof prover="0"><result status="valid" time="0.020000" steps="177"/></proof>
  </goal>
  <goal name="combine&#39;vc.2" expl="postcondition" proved="true">
  <proof prover="0"><result status="valid" time="0.160000" steps="1891"/></proof>
  </goal>
  <goal name="combine&#39;vc.3" expl="postcondition" proved="true">
  <proof prover="3"><result status="valid" time="0.110000" steps="29125"/></proof>
  </goal>
  <goal name="combine&#39;vc.4" expl="variant decrease" proved="true">
  <proof prover="3"><result status="valid" time="0.020000" steps="8050"/></proof>
  </goal>
  <goal name="combine&#39;vc.5" expl="precondition" proved="true">
  <proof prover="0"><result status="valid" time="0.020000" steps="119"/></proof>
  </goal>
  <goal name="combine&#39;vc.6" expl="precondition" proved="true">
  <proof prover="3"><result status="valid" time="0.020000" steps="7085"/></proof>
  </goal>
  <goal name="combine&#39;vc.7" expl="postcondition" proved="true">
  <proof prover="0"><result status="valid" time="0.120000" steps="1222"/></proof>
  </goal>
  <goal name="combine&#39;vc.8" expl="postcondition" proved="true">
  <proof prover="3"><result status="valid" time="0.140000" steps="27931"/></proof>
  </goal>
  <goal name="combine&#39;vc.9" expl="precondition" proved="true">
  <proof prover="3"><result status="valid" time="0.020000" steps="5696"/></proof>
  </goal>
  <goal name="combine&#39;vc.10" expl="postcondition" proved="true">
  <proof prover="3"><result status="valid" time="0.010000" steps="5715"/></proof>
  </goal>
  <goal name="combine&#39;vc.11" expl="postcondition" proved="true">
  <proof prover="3"><result status="valid" time="0.070000" steps="15345"/></proof>
  </goal>
 </transf>
 </goal>
 <goal name="all_trees&#39;vc" expl="VC for all_trees" proved="true">
 <transf name="split_goal_right" proved="true" >
  <goal name="all_trees&#39;vc.0" expl="array creation size" proved="true">
  <proof prover="3"><result status="valid" time="0.020000" steps="5051"/></proof>
  </goal>
  <goal name="all_trees&#39;vc.1" expl="index in array bounds" proved="true">
  <proof prover="3"><result status="valid" time="0.020000" steps="6763"/></proof>
  </goal>
  <goal name="all_trees&#39;vc.2" expl="loop invariant init" proved="true">
  <proof prover="0"><result status="valid" time="0.020000" steps="23"/></proof>
  </goal>
  <goal name="all_trees&#39;vc.3" expl="index in array bounds" proved="true">
  <proof prover="3"><result status="valid" time="0.020000" steps="8680"/></proof>
  </goal>
  <goal name="all_trees&#39;vc.4" expl="loop invariant init" proved="true">
  <proof prover="0"><result status="valid" time="0.000000" steps="116"/></proof>
  </goal>
  <goal name="all_trees&#39;vc.5" expl="loop invariant init" proved="true">
  <proof prover="0"><result status="valid" time="0.000000" steps="32"/></proof>
  </goal>
  <goal name="all_trees&#39;vc.6" expl="loop invariant init" proved="true">
  <proof prover="0"><result status="valid" time="0.010000" steps="96"/></proof>
  </goal>
  <goal name="all_trees&#39;vc.7" expl="index in array bounds" proved="true">
  <proof prover="3"><result status="valid" time="0.020000" steps="11044"/></proof>
  </goal>
  <goal name="all_trees&#39;vc.8" expl="index in array bounds" proved="true">
  <proof prover="3"><result status="valid" time="0.030000" steps="11083"/></proof>
  </goal>
  <goal name="all_trees&#39;vc.9" expl="index in array bounds" proved="true">
  <proof prover="3"><result status="valid" time="0.020000" steps="11051"/></proof>
  </goal>
  <goal name="all_trees&#39;vc.10" expl="precondition" proved="true">
  <proof prover="3"><result status="valid" time="0.040000" steps="12244"/></proof>
  </goal>
  <goal name="all_trees&#39;vc.11" expl="index in array bounds" proved="true">
  <proof prover="3"><result status="valid" time="0.020000" steps="11789"/></proof>
  </goal>
  <goal name="all_trees&#39;vc.12" expl="loop invariant preservation" proved="true">
  <proof prover="0"><result status="valid" time="0.040000" steps="221"/></proof>
  </goal>
  <goal name="all_trees&#39;vc.13" expl="loop invariant preservation" proved="true">
  <proof prover="0"><result status="valid" time="0.050000" steps="380"/></proof>
  </goal>
  <goal name="all_trees&#39;vc.14" expl="loop invariant preservation" proved="true">
  <proof prover="3"><result status="valid" time="0.370000" steps="71317"/></proof>
  </goal>
  <goal name="all_trees&#39;vc.15" expl="loop invariant preservation" proved="true">
  <proof prover="3"><result status="valid" time="0.020000" steps="17413"/></proof>
  </goal>
  <goal name="all_trees&#39;vc.16" expl="loop invariant preservation" proved="true">
  <proof prover="3"><result status="valid" time="0.060000" steps="9495"/></proof>
  </goal>
  <goal name="all_trees&#39;vc.17" expl="postcondition" proved="true">
  <proof prover="3"><result status="valid" time="0.020000" steps="9372"/></proof>
  </goal>
  <goal name="all_trees&#39;vc.18" expl="out of loop bounds" proved="true">
  <proof prover="3"><result status="valid" time="0.010000" steps="7313"/></proof>
  </goal>
 </transf>
 </goal>
</theory>
</file>
</why3session>
