Commit 579ea58c authored by MARCHE Claude's avatar MARCHE Claude
Browse files

fix small bug in why3replay, updated sessions

parent 47852eec
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
......@@ -219,7 +219,7 @@
</transf>
</goal>
</theory>
<theory name="BitCounting32" proved="true" sum="b5bb23cfdbeddba673e2913aa853d26a">
<theory name="BitCounting32" proved="true" sum="d5ad1e97cb81202bd50a599e10f3e7ab">
<goal name="WP_parameter proof0" expl="VC for proof0" proved="true">
<transf name="split_goal_wp" proved="true" >
<goal name="WP_parameter proof0.0" expl="assertion" proved="true">
......@@ -235,12 +235,7 @@
<goal name="WP_parameter proof0.2" expl="assertion" proved="true">
<transf name="split_goal_wp" proved="true" >
<goal name="WP_parameter proof0.2.0" expl="VC for proof0" proved="true">
<transf name="introduce_premises" proved="true" >
<goal name="WP_parameter proof0.2.0.0" expl="VC for proof0" proved="true">
<proof prover="2"><result status="valid" time="0.19"/></proof>
<proof prover="4"><result status="valid" time="0.12"/></proof>
</goal>
</transf>
<proof prover="7"><result status="valid" time="0.12"/></proof>
</goal>
<goal name="WP_parameter proof0.2.1" expl="VC for proof0" proved="true">
<proof prover="1"><result status="valid" time="0.41" steps="348"/></proof>
......
......@@ -8,7 +8,7 @@
<prover id="3" name="Z3" version="4.5.0" timelimit="1" steplimit="0" memlimit="1000"/>
<prover id="4" name="CVC4" version="1.5" timelimit="1" steplimit="0" memlimit="1000"/>
<file name="../dijkstra.mlw" proved="true">
<theory name="DijkstraShortestPath" proved="true" sum="b4a2739dd87f01c10b91469adbe3aa50">
<theory name="DijkstraShortestPath" proved="true" sum="4d2b897a0ad84be2f910318d0c53a763">
<goal name="WP_parameter relax" expl="VC for relax" proved="true">
<proof prover="1"><result status="valid" time="0.01" steps="11"/></proof>
</goal>
......@@ -28,16 +28,12 @@
<goal name="Path_shortest_path" proved="true">
<transf name="assert" proved="true" arg1="(forall sn. forall d. 0 &lt;= d &lt; sn -&gt; forall v. path src v d -&gt; exists d&apos;:int. shortest_path src v d&apos; /\ d&apos; &lt;= d)">
<goal name="Path_shortest_path.0" proved="true">
<transf name="intros" proved="true" arg1="sn">
<transf name="induction" proved="true" arg1="sn">
<goal name="Path_shortest_path.0.0" proved="true">
<transf name="induction" proved="true" arg1="sn" arg2="0">
<goal name="Path_shortest_path.0.0.0" proved="true">
<proof prover="1" timelimit="60"><result status="valid" time="0.00" steps="3"/></proof>
</goal>
<goal name="Path_shortest_path.0.0.1" proved="true">
<proof prover="4" timelimit="5"><result status="valid" time="0.04"/></proof>
</goal>
</transf>
<proof prover="4"><result status="valid" time="0.02"/></proof>
</goal>
<goal name="Path_shortest_path.0.1" proved="true">
<proof prover="4"><result status="valid" time="0.05"/></proof>
</goal>
</transf>
</goal>
......@@ -140,48 +136,12 @@
<proof prover="1"><result status="valid" time="0.17" steps="495"/></proof>
</goal>
<goal name="WP_parameter shortest_path_code.11.0.6" expl="VC for shortest_path_code" proved="true">
<transf name="introduce_premises" proved="true" >
<transf name="case" proved="true" arg1="(v = v1)">
<goal name="WP_parameter shortest_path_code.11.0.6.0" expl="VC for shortest_path_code" proved="true">
<transf name="destruct" proved="true" arg1="H22">
<goal name="WP_parameter shortest_path_code.11.0.6.0.0" expl="VC for shortest_path_code" proved="true">
<proof prover="1"><result status="valid" time="0.03" steps="57"/></proof>
</goal>
<goal name="WP_parameter shortest_path_code.11.0.6.0.1" expl="VC for shortest_path_code" proved="true">
<transf name="destruct" proved="true" arg1="H">
<goal name="WP_parameter shortest_path_code.11.0.6.0.1.0" expl="VC for shortest_path_code" proved="true">
<proof prover="1"><result status="valid" time="0.02" steps="58"/></proof>
</goal>
<goal name="WP_parameter shortest_path_code.11.0.6.0.1.1" expl="VC for shortest_path_code" proved="true">
<transf name="destruct" proved="true" arg1="H">
<goal name="WP_parameter shortest_path_code.11.0.6.0.1.1.0" expl="VC for shortest_path_code" proved="true">
<transf name="destruct" proved="true" arg1="H23">
<goal name="WP_parameter shortest_path_code.11.0.6.0.1.1.0.0" expl="VC for shortest_path_code" proved="true">
<proof prover="1"><result status="valid" time="0.01" steps="30"/></proof>
</goal>
<goal name="WP_parameter shortest_path_code.11.0.6.0.1.1.0.1" expl="VC for shortest_path_code" proved="true">
<transf name="destruct" proved="true" arg1="H12">
<goal name="WP_parameter shortest_path_code.11.0.6.0.1.1.0.1.0" expl="VC for shortest_path_code" proved="true">
<transf name="case" proved="true" arg1="(v = v1)">
<goal name="WP_parameter shortest_path_code.11.0.6.0.1.1.0.1.0.0" expl="VC for shortest_path_code" proved="true">
<proof prover="1"><result status="valid" time="1.03" steps="1296"/></proof>
</goal>
<goal name="WP_parameter shortest_path_code.11.0.6.0.1.1.0.1.0.1" expl="VC for shortest_path_code" proved="true">
<proof prover="1"><result status="valid" time="0.02" steps="59"/></proof>
</goal>
</transf>
</goal>
</transf>
</goal>
</transf>
</goal>
<goal name="WP_parameter shortest_path_code.11.0.6.0.1.1.1" expl="VC for shortest_path_code" proved="true">
<proof prover="1"><result status="valid" time="0.85" steps="1248"/></proof>
</goal>
</transf>
</goal>
</transf>
</goal>
</transf>
<proof prover="3"><result status="valid" time="0.70"/></proof>
</goal>
<goal name="WP_parameter shortest_path_code.11.0.6.1" expl="VC for shortest_path_code" proved="true">
<proof prover="4"><result status="valid" time="0.12"/></proof>
</goal>
</transf>
</goal>
......@@ -208,71 +168,15 @@
<goal name="WP_parameter shortest_path_code.16.0.0" expl="loop invariant preservation" proved="true">
<transf name="cut" proved="true" arg1="(inv_succ src visited q d)">
<goal name="WP_parameter shortest_path_code.16.0.0.0" expl="loop invariant preservation" proved="true">
<transf name="cut" proved="true" arg1="(mem src visited)">
<goal name="WP_parameter shortest_path_code.16.0.0.0.0" expl="loop invariant preservation" proved="true">
<transf name="instantiate" proved="true" arg1="inside_or_exit" arg2="visited">
<goal name="WP_parameter shortest_path_code.16.0.0.0.0.0" expl="loop invariant preservation" proved="true">
<transf name="instantiate" proved="true" arg1="inside_or_exit" arg2="src">
<goal name="WP_parameter shortest_path_code.16.0.0.0.0.0.0" expl="loop invariant preservation" proved="true">
<transf name="instantiate" proved="true" arg1="inside_or_exit" arg2="x">
<goal name="WP_parameter shortest_path_code.16.0.0.0.0.0.0.0" expl="loop invariant preservation" proved="true">
<transf name="instantiate" proved="true" arg1="inside_or_exit" arg2="dx">
<goal name="WP_parameter shortest_path_code.16.0.0.0.0.0.0.0.0" expl="loop invariant preservation" proved="true">
<transf name="cut" proved="true" arg1="(mem x visited \/ (exists y:vertex. exists z: vertex. exists dy:int. mem y visited /\ not mem z visited /\ mem z (g_succ y) /\ path src y dy /\ ((dy + weight y z) &lt;= dx)))">
<goal name="WP_parameter shortest_path_code.16.0.0.0.0.0.0.0.0.0" expl="loop invariant preservation" proved="true">
<transf name="destruct" proved="true" arg1="h">
<goal name="WP_parameter shortest_path_code.16.0.0.0.0.0.0.0.0.0.0" expl="loop invariant preservation" proved="true">
<proof prover="1"><result status="valid" time="0.01" steps="25"/></proof>
</goal>
<goal name="WP_parameter shortest_path_code.16.0.0.0.0.0.0.0.0.0.1" expl="loop invariant preservation" proved="true">
<transf name="destruct" proved="true" arg1="h">
<goal name="WP_parameter shortest_path_code.16.0.0.0.0.0.0.0.0.0.1.0" expl="loop invariant preservation" proved="true">
<transf name="destruct" proved="true" arg1="h">
<goal name="WP_parameter shortest_path_code.16.0.0.0.0.0.0.0.0.0.1.0.0" expl="loop invariant preservation" proved="true">
<transf name="destruct" proved="true" arg1="h">
<goal name="WP_parameter shortest_path_code.16.0.0.0.0.0.0.0.0.0.1.0.0.0" expl="loop invariant preservation" proved="true">
<transf name="cut" proved="true" arg1="(mem z q)">
<goal name="WP_parameter shortest_path_code.16.0.0.0.0.0.0.0.0.0.1.0.0.0.0" expl="loop invariant preservation" proved="true">
<proof prover="1"><result status="valid" time="0.30" steps="405"/></proof>
</goal>
<goal name="WP_parameter shortest_path_code.16.0.0.0.0.0.0.0.0.0.1.0.0.0.1" proved="true">
<proof prover="1"><result status="valid" time="0.20" steps="355"/></proof>
</goal>
</transf>
</goal>
</transf>
</goal>
</transf>
</goal>
</transf>
</goal>
</transf>
</goal>
<goal name="WP_parameter shortest_path_code.16.0.0.0.0.0.0.0.0.1" proved="true">
<proof prover="1"><result status="valid" time="0.01" steps="68"/></proof>
</goal>
</transf>
</goal>
</transf>
</goal>
</transf>
</goal>
</transf>
</goal>
</transf>
</goal>
<goal name="WP_parameter shortest_path_code.16.0.0.0.1" proved="true">
<proof prover="1"><result status="valid" time="0.01" steps="54"/></proof>
</goal>
</transf>
<proof prover="3"><result status="valid" time="0.39"/></proof>
</goal>
<goal name="WP_parameter shortest_path_code.16.0.0.1" proved="true">
<proof prover="1"><result status="valid" time="0.09" steps="268"/></proof>
<proof prover="4"><result status="valid" time="0.08"/></proof>
</goal>
</transf>
</goal>
<goal name="WP_parameter shortest_path_code.16.0.1" proved="true">
<proof prover="1"><result status="valid" time="0.00" steps="22"/></proof>
<proof prover="4"><result status="valid" time="0.02"/></proof>
</goal>
</transf>
</goal>
......
......@@ -4,36 +4,38 @@
<why3session shape_version="4">
<prover id="0" name="CVC3" version="2.4.1" timelimit="30" steplimit="0" memlimit="1500"/>
<prover id="1" name="Coq" version="8.6.1" timelimit="1" steplimit="0" memlimit="0"/>
<prover id="2" name="Alt-Ergo" version="1.30" timelimit="5" steplimit="0" memlimit="1500"/>
<prover id="3" name="Z3" version="3.2" timelimit="30" steplimit="0" memlimit="1500"/>
<prover id="4" name="Z3" version="4.5.0" timelimit="5" steplimit="0" memlimit="1500"/>
<prover id="5" name="Eprover" version="1.8-001" timelimit="2" steplimit="0" memlimit="1000"/>
<prover id="2" name="Eprover" version="2.0" timelimit="1" steplimit="0" memlimit="1000"/>
<prover id="3" name="Alt-Ergo" version="1.30" timelimit="5" steplimit="0" memlimit="1500"/>
<prover id="4" name="Z3" version="3.2" timelimit="30" steplimit="0" memlimit="1500"/>
<prover id="5" name="Z3" version="4.5.0" timelimit="5" steplimit="0" memlimit="1500"/>
<prover id="6" name="Eprover" version="1.8-001" timelimit="2" steplimit="0" memlimit="1000"/>
<prover id="7" name="CVC4" version="1.5" timelimit="1" steplimit="0" memlimit="1000"/>
<file name="../euler001.mlw" proved="true">
<theory name="DivModHints" proved="true" sum="e642cfeb618ea5dc52fb68666e06d303">
<theory name="DivModHints" proved="true" sum="85d2840a9bc90f1571e3822f8c831780">
<goal name="mod_div_unique" proved="true">
<transf name="assert" proved="true" arg1="(q - div x y) * y + (r - mod x y) = 0">
<goal name="mod_div_unique.0" proved="true">
<proof prover="4" timelimit="1" memlimit="1000"><result status="valid" time="0.01"/></proof>
<proof prover="5" timelimit="1" memlimit="1000"><result status="valid" time="0.01"/></proof>
</goal>
<goal name="mod_div_unique.1" proved="true">
<transf name="case" proved="true" arg1="q - div x y &gt;= 1">
<goal name="mod_div_unique.1.0" proved="true">
<proof prover="5"><result status="valid" time="0.11"/></proof>
<proof prover="6"><result status="valid" time="0.11"/></proof>
</goal>
<goal name="mod_div_unique.1.1" proved="true">
<transf name="case" proved="true" arg1="q - div x y &lt;= -1">
<goal name="mod_div_unique.1.1.0" proved="true">
<transf name="assert" proved="true" arg1="(q - div x y) * y &lt;= -y">
<transf name="assert" proved="true" arg1="(y * (q - div x y) &lt;= - y)">
<goal name="mod_div_unique.1.1.0.0" proved="true">
<proof prover="5"><result status="valid" time="0.74"/></proof>
<proof prover="2"><result status="valid" time="0.66"/></proof>
</goal>
<goal name="mod_div_unique.1.1.0.1" proved="true">
<proof prover="4" timelimit="1" memlimit="1000"><result status="valid" time="0.01"/></proof>
<proof prover="7"><result status="valid" time="0.01"/></proof>
</goal>
</transf>
</goal>
<goal name="mod_div_unique.1.1.1" proved="true">
<proof prover="4" timelimit="1" memlimit="1000"><result status="valid" time="0.03"/></proof>
<proof prover="7"><result status="valid" time="0.02"/></proof>
</goal>
</transf>
</goal>
......@@ -46,7 +48,7 @@
<goal name="mod_succ_1.0" proved="true">
<transf name="case" proved="true" arg1="(x &lt; y)">
<goal name="mod_succ_1.0.0" proved="true">
<proof prover="4"><result status="valid" time="0.03"/></proof>
<proof prover="5"><result status="valid" time="0.03"/></proof>
</goal>
<goal name="mod_succ_1.0.1" proved="true">
<transf name="assert" proved="true" arg1="(exists q:int. exists r:int. (x + 1 = y * q + r) /\ (r &lt; y) /\ (r &gt;= 0))">
......@@ -55,7 +57,7 @@
<goal name="mod_succ_1.0.1.0.0" proved="true">
<transf name="exists" proved="true" arg1="(mod (x + 1) y)">
<goal name="mod_succ_1.0.1.0.0.0" proved="true">
<proof prover="4"><result status="valid" time="0.01"/></proof>
<proof prover="5"><result status="valid" time="0.01"/></proof>
</goal>
</transf>
</goal>
......@@ -72,33 +74,15 @@
<goal name="mod_succ_1.0.1.1.0.0.0.0" proved="true">
<transf name="case" proved="true" arg1="(r = 0)">
<goal name="mod_succ_1.0.1.1.0.0.0.0.0" proved="true">
<proof prover="4"><result status="valid" time="0.03"/></proof>
<proof prover="5" memlimit="1000"><result status="valid" time="0.03"/></proof>
</goal>
<goal name="mod_succ_1.0.1.1.0.0.0.0.1" proved="true">
<transf name="assert" proved="true" arg1="(x = y * q + (r - 1))">
<transf name="assert" proved="true" arg1="(x = y * q + (r-1))">
<goal name="mod_succ_1.0.1.1.0.0.0.0.1.0" proved="true">
<proof prover="4"><result status="valid" time="0.00"/></proof>
<proof prover="7"><result status="valid" time="0.01"/></proof>
</goal>
<goal name="mod_succ_1.0.1.1.0.0.0.0.1.1" proved="true">
<transf name="rewrite" proved="true" arg1="h">
<goal name="mod_succ_1.0.1.1.0.0.0.0.1.1.0" proved="true">
<transf name="replace" proved="true" arg1="(mod (y * q + r) y)" arg2="(mod r y)" arg3="mod_succ_1">
<goal name="mod_succ_1.0.1.1.0.0.0.0.1.1.0.0" proved="true">
<transf name="replace" proved="true" arg1="(mod (y * q + (r - 1)) y)" arg2="(mod (r - 1) y)" arg3="mod_succ_1">
<goal name="mod_succ_1.0.1.1.0.0.0.0.1.1.0.0.0" proved="true">
<proof prover="4"><result status="valid" time="0.01"/></proof>
</goal>
<goal name="mod_succ_1.0.1.1.0.0.0.0.1.1.0.0.1" proved="true">
<proof prover="4"><result status="valid" time="0.04"/></proof>
</goal>
</transf>
</goal>
<goal name="mod_succ_1.0.1.1.0.0.0.0.1.1.0.1" proved="true">
<proof prover="4"><result status="valid" time="0.04"/></proof>
</goal>
</transf>
</goal>
</transf>
<proof prover="3" memlimit="2000"><result status="valid" time="2.19" steps="53"/></proof>
</goal>
</transf>
</goal>
......@@ -126,41 +110,41 @@
</goal>
<goal name="div_succ_2" proved="true">
<proof prover="0"><result status="valid" time="0.10"/></proof>
<proof prover="2" timelimit="30"><result status="valid" time="0.18" steps="52"/></proof>
<proof prover="3"><result status="valid" time="0.80"/></proof>
<proof prover="3" timelimit="30"><result status="valid" time="0.18" steps="52"/></proof>
<proof prover="4"><result status="valid" time="0.80"/></proof>
</goal>
<goal name="mod2_mul2" proved="true">
<proof prover="0" timelimit="5"><result status="valid" time="0.01"/></proof>
<proof prover="2"><result status="valid" time="0.05" steps="10"/></proof>
<proof prover="3" timelimit="5"><result status="valid" time="0.01"/></proof>
<proof prover="3"><result status="valid" time="0.05" steps="10"/></proof>
<proof prover="4" timelimit="5"><result status="valid" time="0.01"/></proof>
</goal>
<goal name="mod2_mul2_aux" proved="true">
<proof prover="0"><result status="valid" time="0.02"/></proof>
<proof prover="2"><result status="valid" time="0.02" steps="12"/></proof>
<proof prover="3"><result status="valid" time="0.02"/></proof>
<proof prover="3"><result status="valid" time="0.02" steps="12"/></proof>
<proof prover="4"><result status="valid" time="0.02"/></proof>
</goal>
<goal name="mod2_mul2_aux2" proved="true">
<proof prover="0" timelimit="35"><result status="valid" time="0.02"/></proof>
<proof prover="2"><result status="valid" time="0.03" steps="15"/></proof>
<proof prover="3"><result status="valid" time="0.07"/></proof>
<proof prover="3"><result status="valid" time="0.03" steps="15"/></proof>
<proof prover="4"><result status="valid" time="0.07"/></proof>
</goal>
<goal name="div2_mul2" proved="true">
<proof prover="0" timelimit="5"><result status="valid" time="0.06"/></proof>
<proof prover="2"><result status="valid" time="0.01" steps="3"/></proof>
<proof prover="3" timelimit="5"><result status="valid" time="0.02"/></proof>
<proof prover="3"><result status="valid" time="0.01" steps="3"/></proof>
<proof prover="4" timelimit="5"><result status="valid" time="0.02"/></proof>
</goal>
<goal name="div2_mul2_aux" proved="true">
<proof prover="0" timelimit="5"><result status="valid" time="0.08"/></proof>
<proof prover="2"><result status="valid" time="0.01" steps="5"/></proof>
<proof prover="3" timelimit="5"><result status="valid" time="0.01"/></proof>
<proof prover="3"><result status="valid" time="0.01" steps="5"/></proof>
<proof prover="4" timelimit="5"><result status="valid" time="0.01"/></proof>
</goal>
<goal name="div2_add" proved="true">
<proof prover="0" timelimit="5"><result status="valid" time="0.04"/></proof>
<proof prover="3" timelimit="5"><result status="valid" time="0.02"/></proof>
<proof prover="4" timelimit="5"><result status="valid" time="0.02"/></proof>
</goal>
<goal name="div2_sub" proved="true">
<proof prover="0" timelimit="5"><result status="valid" time="0.04"/></proof>
<proof prover="3" timelimit="5"><result status="valid" time="0.02"/></proof>
<proof prover="4" timelimit="5"><result status="valid" time="0.02"/></proof>
</goal>
</theory>
<theory name="TriangularNumbers" proved="true" sum="5dd3402674ce736b7bf98870de3440c5">
......@@ -168,28 +152,28 @@
<proof prover="1" edited="euler001_TriangularNumbers_tr_mod_2_1.v"><result status="valid" time="0.31"/></proof>
</goal>
<goal name="tr_repr" proved="true">
<proof prover="2"><result status="valid" time="0.01" steps="7"/></proof>
<proof prover="3" timelimit="5"><result status="valid" time="0.02"/></proof>
<proof prover="3"><result status="valid" time="0.01" steps="7"/></proof>
<proof prover="4" timelimit="5"><result status="valid" time="0.02"/></proof>
</goal>
<goal name="tr_succ" proved="true">
<proof prover="0" timelimit="5"><result status="valid" time="0.02"/></proof>
<proof prover="2"><result status="valid" time="0.01" steps="5"/></proof>
<proof prover="3" timelimit="5"><result status="valid" time="0.02"/></proof>
<proof prover="3"><result status="valid" time="0.01" steps="5"/></proof>
<proof prover="4" timelimit="5"><result status="valid" time="0.02"/></proof>
</goal>
</theory>
<theory name="SumMultiple" proved="true" sum="2cf339916c4ccc3d2e62d08da52c4e58">
<goal name="mod_15" proved="true">
<proof prover="0"><result status="valid" time="0.13"/></proof>
<proof prover="2"><result status="valid" time="0.13" steps="76"/></proof>
<proof prover="3"><result status="valid" time="0.13" steps="76"/></proof>
</goal>
<goal name="Closed_formula_0" proved="true">
<proof prover="0"><result status="valid" time="0.02"/></proof>
<proof prover="2"><result status="valid" time="0.05" steps="85"/></proof>
<proof prover="3"><result status="valid" time="0.14"/></proof>
<proof prover="3"><result status="valid" time="0.05" steps="85"/></proof>
<proof prover="4"><result status="valid" time="0.14"/></proof>
</goal>
<goal name="Closed_formula_n" proved="true">
<proof prover="0" timelimit="10"><result status="valid" time="1.42"/></proof>
<proof prover="2" timelimit="10"><result status="valid" time="0.22" steps="55"/></proof>
<proof prover="3" timelimit="10"><result status="valid" time="0.22" steps="55"/></proof>
</goal>
<goal name="Closed_formula_n_3" proved="true">
<proof prover="0" timelimit="10"><result status="valid" time="2.36"/></proof>
......@@ -205,18 +189,18 @@
</goal>
<goal name="div_15" proved="true">
<proof prover="0"><result status="valid" time="0.01"/></proof>
<proof prover="2"><result status="valid" time="0.01" steps="8"/></proof>
<proof prover="3"><result status="valid" time="0.02"/></proof>
<proof prover="3"><result status="valid" time="0.01" steps="8"/></proof>
<proof prover="4"><result status="valid" time="0.02"/></proof>
</goal>
<goal name="div_5" proved="true">
<proof prover="0"><result status="valid" time="0.01"/></proof>
<proof prover="2"><result status="valid" time="0.01" steps="8"/></proof>
<proof prover="3"><result status="valid" time="0.02"/></proof>
<proof prover="3"><result status="valid" time="0.01" steps="8"/></proof>
<proof prover="4"><result status="valid" time="0.02"/></proof>
</goal>
<goal name="div_3" proved="true">
<proof prover="0"><result status="valid" time="0.02"/></proof>
<proof prover="2"><result status="valid" time="0.01" steps="8"/></proof>
<proof prover="3"><result status="valid" time="0.02"/></proof>
<proof prover="3"><result status="valid" time="0.01" steps="8"/></proof>
<proof prover="4"><result status="valid" time="0.02"/></proof>
</goal>
<goal name="Closed_Formula" proved="true">
<proof prover="1" edited="euler001_SumMultiple_Closed_Formula_1.v"><result status="valid" time="0.36"/></proof>
......@@ -225,16 +209,16 @@
<theory name="Euler001" proved="true" sum="ac5e739bc4723e5c8ba7bae0a1b7655c">
<goal name="WP_parameter solve" expl="VC for solve" proved="true">
<proof prover="0"><result status="valid" time="0.06"/></proof>
<proof prover="3"><result status="valid" time="0.02"/></proof>
<proof prover="4"><result status="valid" time="0.02"/></proof>
</goal>
<goal name="WP_parameter run" expl="VC for run" proved="true">
<proof prover="2"><result status="valid" time="0.01" steps="3"/></proof>
<proof prover="3"><result status="valid" time="0.01" steps="3"/></proof>
</goal>
<goal name="WP_parameter bench" expl="VC for bench" proved="true">
<proof prover="2" memlimit="6000"><result status="valid" time="0.01" steps="3"/></proof>
<proof prover="3" memlimit="6000"><result status="valid" time="0.01" steps="3"/></proof>
</goal>
<goal name="WP_parameter go" expl="VC for go" proved="true">
<proof prover="2"><result status="valid" time="0.02" steps="31"/></proof>
<proof prover="3"><result status="valid" time="0.02" steps="31"/></proof>
</goal>
</theory>
</file>
......
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment