mirror of
https://github.com/AdaCore/why3.git
synced 2026-02-12 12:34:55 -08:00
113 lines
5.6 KiB
XML
113 lines
5.6 KiB
XML
<?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.4.1" timelimit="5" steplimit="0" memlimit="1000"/>
|
|
<prover id="2" name="Alt-Ergo" version="2.2.0" timelimit="5" steplimit="0" memlimit="2000"/>
|
|
<prover id="3" name="CVC4" version="1.6" timelimit="1" steplimit="0" memlimit="1000"/>
|
|
<file format="whyml" proved="true">
|
|
<path name=".."/><path name="tree_of_array.mlw"/>
|
|
<theory name="TreeOfArray" proved="true">
|
|
<goal name="tree_of_array_aux'vc" expl="VC for tree_of_array_aux" proved="true">
|
|
<transf name="split_vc" proved="true" >
|
|
<goal name="tree_of_array_aux'vc.0" expl="precondition" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.03" steps="8028"/></proof>
|
|
</goal>
|
|
<goal name="tree_of_array_aux'vc.1" expl="variant decrease" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.07" steps="11445"/></proof>
|
|
</goal>
|
|
<goal name="tree_of_array_aux'vc.2" expl="precondition" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.06" steps="11122"/></proof>
|
|
</goal>
|
|
<goal name="tree_of_array_aux'vc.3" expl="variant decrease" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.04" steps="13181"/></proof>
|
|
</goal>
|
|
<goal name="tree_of_array_aux'vc.4" expl="precondition" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.10" steps="17701"/></proof>
|
|
</goal>
|
|
<goal name="tree_of_array_aux'vc.5" expl="index in array bounds" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.07" steps="14412"/></proof>
|
|
</goal>
|
|
<goal name="tree_of_array_aux'vc.6" expl="postcondition" proved="true">
|
|
<transf name="split_all_full" proved="true" >
|
|
<goal name="tree_of_array_aux'vc.6.0" expl="VC for tree_of_array_aux" proved="true">
|
|
<proof prover="2" timelimit="1" memlimit="1000"><result status="valid" time="0.02" steps="45"/></proof>
|
|
</goal>
|
|
<goal name="tree_of_array_aux'vc.6.1" expl="VC for tree_of_array_aux" proved="true">
|
|
<transf name="split_all_full" proved="true" >
|
|
<goal name="tree_of_array_aux'vc.6.1.0" expl="VC for tree_of_array_aux" proved="true">
|
|
<proof prover="2"><result status="valid" time="0.31" steps="583"/></proof>
|
|
</goal>
|
|
</transf>
|
|
</goal>
|
|
<goal name="tree_of_array_aux'vc.6.2" expl="VC for tree_of_array_aux" proved="true">
|
|
<transf name="case" proved="true" arg1="hi=lo">
|
|
<goal name="tree_of_array_aux'vc.6.2.0" expl="true case" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.04" steps="12949"/></proof>
|
|
</goal>
|
|
<goal name="tree_of_array_aux'vc.6.2.1" expl="false case" proved="true">
|
|
<transf name="case" proved="true" arg1="hi=lo+1">
|
|
<goal name="tree_of_array_aux'vc.6.2.1.0" expl="false case (true case)" proved="true">
|
|
<transf name="split_all_full" proved="true" >
|
|
<goal name="tree_of_array_aux'vc.6.2.1.0.0" expl="false case (true case)" proved="true">
|
|
<proof prover="0"><result status="valid" time="0.32" steps="3540"/></proof>
|
|
</goal>
|
|
</transf>
|
|
</goal>
|
|
<goal name="tree_of_array_aux'vc.6.2.1.1" expl="false case" proved="true">
|
|
<transf name="split_all_full" proved="true" >
|
|
<goal name="tree_of_array_aux'vc.6.2.1.1.0" expl="false case" proved="true">
|
|
<proof prover="2"><result status="valid" time="0.81" steps="928"/></proof>
|
|
</goal>
|
|
</transf>
|
|
</goal>
|
|
</transf>
|
|
</goal>
|
|
</transf>
|
|
</goal>
|
|
<goal name="tree_of_array_aux'vc.6.3" expl="VC for tree_of_array_aux" proved="true">
|
|
<transf name="case" proved="true" arg1="hi=lo">
|
|
<goal name="tree_of_array_aux'vc.6.3.0" expl="true case" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.04" steps="12949"/></proof>
|
|
</goal>
|
|
<goal name="tree_of_array_aux'vc.6.3.1" expl="false case" proved="true">
|
|
<transf name="case" proved="true" arg1="hi=lo+1">
|
|
<goal name="tree_of_array_aux'vc.6.3.1.0" expl="false case (true case)" proved="true">
|
|
<transf name="assert" proved="true" arg1="left=Empty">
|
|
<goal name="tree_of_array_aux'vc.6.3.1.0.0" expl="asserted formula" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.08" steps="16910"/></proof>
|
|
</goal>
|
|
<goal name="tree_of_array_aux'vc.6.3.1.0.1" expl="false case (true case)" proved="true">
|
|
<transf name="assert" proved="true" arg1="right=Empty">
|
|
<goal name="tree_of_array_aux'vc.6.3.1.0.1.0" expl="asserted formula" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.06" steps="16879"/></proof>
|
|
</goal>
|
|
<goal name="tree_of_array_aux'vc.6.3.1.0.1.1" expl="false case (true case)" proved="true">
|
|
<proof prover="2" timelimit="1" memlimit="1000"><result status="valid" time="0.03" steps="105"/></proof>
|
|
</goal>
|
|
</transf>
|
|
</goal>
|
|
</transf>
|
|
</goal>
|
|
<goal name="tree_of_array_aux'vc.6.3.1.1" expl="false case" proved="true">
|
|
<transf name="split_all_full" proved="true" >
|
|
<goal name="tree_of_array_aux'vc.6.3.1.1.0" expl="false case" proved="true">
|
|
<proof prover="2"><result status="valid" time="2.06" steps="1103"/></proof>
|
|
</goal>
|
|
</transf>
|
|
</goal>
|
|
</transf>
|
|
</goal>
|
|
</transf>
|
|
</goal>
|
|
</transf>
|
|
</goal>
|
|
</transf>
|
|
</goal>
|
|
<goal name="tree_of_array'vc" expl="VC for tree_of_array" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.04" steps="9723"/></proof>
|
|
</goal>
|
|
</theory>
|
|
</file>
|
|
</why3session>
|