<?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="Z3" version="4.12.2" timelimit="36" steplimit="0" memlimit="1000"/>
<prover id="5" name="CVC4" version="1.5" timelimit="36" steplimit="0" memlimit="1000"/>
<file format="whyml" proved="true">
<path name=".."/><path name="induction.mlw"/>
<theory name="Induction1" proved="true">
 <goal name="SimpleInduction.base" proved="true">
 <proof prover="0"><result status="valid" time="0.010000" steps="127"/></proof>
 </goal>
 <goal name="SimpleInduction.induction_step" proved="true">
 <proof prover="0"><result status="valid" time="0.010000" steps="1081"/></proof>
 </goal>
 <goal name="G" proved="true">
 <proof prover="5"><result status="valid" time="0.000000" steps="822"/></proof>
 </goal>
</theory>
<theory name="Induction2" proved="true">
 <goal name="G" proved="true">
 <proof prover="0"><result status="valid" time="0.020000" steps="34086"/></proof>
 </goal>
</theory>
<theory name="LemmaFunction1" proved="true">
 <goal name="ind&#39;vc" expl="VC for ind" proved="true">
 <proof prover="0"><result status="valid" time="0.010000" steps="1906"/></proof>
 </goal>
 <goal name="G" proved="true">
 <proof prover="0"><result status="valid" time="0.010000" steps="78"/></proof>
 </goal>
</theory>
<theory name="LemmaFunction2" proved="true">
 <goal name="ind&#39;vc" expl="VC for ind" proved="true">
 <proof prover="0"><result status="valid" time="0.010000" steps="2233"/></proof>
 </goal>
 <goal name="G" proved="true">
 <proof prover="0"><result status="valid" time="0.010000" steps="78"/></proof>
 </goal>
</theory>
<theory name="LemmaFunction3" proved="true">
 <goal name="ind&#39;vc" expl="VC for ind" proved="true">
 <proof prover="0"><result status="valid" time="0.010000" steps="5785"/></proof>
 </goal>
 <goal name="G" proved="true">
 <proof prover="0"><result status="valid" time="0.010000" steps="78"/></proof>
 </goal>
</theory>
</file>
</why3session>
