mirror of
https://github.com/AdaCore/why3.git
synced 2026-02-12 12:34:55 -08:00
272 lines
12 KiB
XML
272 lines
12 KiB
XML
<?xml version="1.0" encoding="UTF-8"?>
|
|
<!DOCTYPE why3session PUBLIC "-//Why3//proof session v5//EN"
|
|
"https://www.why3.org/why3session.dtd">
|
|
<why3session shape_version="6">
|
|
<prover id="0" name="CVC4" version="1.4" timelimit="10" steplimit="0" memlimit="1000"/>
|
|
<prover id="3" name="Alt-Ergo" version="2.6.2" timelimit="10" steplimit="0" memlimit="1000"/>
|
|
<prover id="4" name="Z3" version="4.12.2" timelimit="10" steplimit="0" memlimit="1000"/>
|
|
<file format="whyml" proved="true">
|
|
<path name=".."/><path name="binomial_heap.mlw"/>
|
|
<theory name="BinomialHeap" proved="true">
|
|
<goal name="size_nonnneg'vc" expl="VC for size_nonnneg" proved="true">
|
|
<proof prover="4"><result status="valid" time="0.010000" steps="20749"/></proof>
|
|
</goal>
|
|
<goal name="le_roots_trans" proved="true">
|
|
<transf name="induction_ty_lex" proved="true" >
|
|
<goal name="le_roots_trans.0" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.010000" steps="50"/></proof>
|
|
</goal>
|
|
</transf>
|
|
</goal>
|
|
<goal name="heaps_append" proved="true">
|
|
<transf name="induction_ty_lex" proved="true" >
|
|
<goal name="heaps_append.0" proved="true">
|
|
<transf name="split_goal_right" proved="true" >
|
|
<goal name="heaps_append.0.0" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.010000" steps="10"/></proof>
|
|
</goal>
|
|
<goal name="heaps_append.0.1" proved="true">
|
|
<proof prover="3" timelimit="5"><result status="valid" time="0.809262" steps="18500"/></proof>
|
|
</goal>
|
|
</transf>
|
|
</goal>
|
|
</transf>
|
|
</goal>
|
|
<goal name="heaps_reverse" proved="true">
|
|
<transf name="induction_ty_lex" proved="true" >
|
|
<goal name="heaps_reverse.0" proved="true">
|
|
<transf name="split_goal_right" proved="true" >
|
|
<goal name="heaps_reverse.0.0" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.010000" steps="8"/></proof>
|
|
</goal>
|
|
<goal name="heaps_reverse.0.1" proved="true">
|
|
<proof prover="3" timelimit="5"><result status="valid" time="0.601089" steps="16393"/></proof>
|
|
</goal>
|
|
</transf>
|
|
</goal>
|
|
</transf>
|
|
</goal>
|
|
<goal name="occ_nonneg'vc" expl="VC for occ_nonneg" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.020000" steps="169"/></proof>
|
|
</goal>
|
|
<goal name="occ_append" proved="true">
|
|
<transf name="induction_ty_lex" proved="true" >
|
|
<goal name="occ_append.0" proved="true">
|
|
<transf name="split_goal_right" proved="true" >
|
|
<goal name="occ_append.0.0" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.000000" steps="14"/></proof>
|
|
</goal>
|
|
<goal name="occ_append.0.1" proved="true">
|
|
<transf name="compute_in_goal" proved="true" >
|
|
<goal name="occ_append.0.1.0" proved="true">
|
|
<proof prover="0"><result status="valid" time="0.370000"/></proof>
|
|
</goal>
|
|
</transf>
|
|
</goal>
|
|
</transf>
|
|
</goal>
|
|
</transf>
|
|
</goal>
|
|
<goal name="occ_reverse" proved="true">
|
|
<transf name="induction_ty_lex" proved="true" >
|
|
<goal name="occ_reverse.0" proved="true">
|
|
<proof prover="0"><result status="valid" time="0.250000"/></proof>
|
|
</goal>
|
|
</transf>
|
|
</goal>
|
|
<goal name="heaps_mem'vc" expl="VC for heaps_mem" proved="true">
|
|
<proof prover="0"><result status="valid" time="0.080000"/></proof>
|
|
</goal>
|
|
<goal name="has_order_length" proved="true">
|
|
<transf name="induction_ty_lex" proved="true" >
|
|
<goal name="has_order_length.0" proved="true">
|
|
<transf name="split_goal_right" proved="true" >
|
|
<goal name="has_order_length.0.0" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.010000" steps="13"/></proof>
|
|
</goal>
|
|
<goal name="has_order_length.0.1" proved="true">
|
|
<transf name="compute_in_goal" proved="true" >
|
|
<goal name="has_order_length.0.1.0" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.479446" steps="3195"/></proof>
|
|
</goal>
|
|
</transf>
|
|
</goal>
|
|
</transf>
|
|
</goal>
|
|
</transf>
|
|
</goal>
|
|
<goal name="inv_trans" proved="true">
|
|
<transf name="induction_ty_lex" proved="true" >
|
|
<goal name="inv_trans.0" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.000000" steps="49"/></proof>
|
|
</goal>
|
|
</transf>
|
|
</goal>
|
|
<goal name="inv_reverse'vc" expl="VC for inv_reverse" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.043232" steps="490"/></proof>
|
|
</goal>
|
|
<goal name="empty'vc" expl="VC for empty" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.000000" steps="39"/></proof>
|
|
</goal>
|
|
<goal name="is_empty'vc" expl="VC for is_empty" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.000000" steps="17"/></proof>
|
|
</goal>
|
|
<goal name="get_min'vc" expl="VC for get_min" proved="true">
|
|
<transf name="split_goal_right" proved="true" >
|
|
<goal name="get_min'vc.0" expl="unreachable point" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.010000" steps="6"/></proof>
|
|
</goal>
|
|
<goal name="get_min'vc.1" expl="variant decrease" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.010000" steps="141"/></proof>
|
|
</goal>
|
|
<goal name="get_min'vc.2" expl="precondition" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.010000" steps="35"/></proof>
|
|
</goal>
|
|
<goal name="get_min'vc.3" expl="postcondition" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.050000" steps="548"/></proof>
|
|
</goal>
|
|
<goal name="get_min'vc.4" expl="postcondition" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.010000" steps="199"/></proof>
|
|
</goal>
|
|
<goal name="get_min'vc.5" expl="postcondition" proved="true">
|
|
<proof prover="0"><result status="valid" time="0.307355"/></proof>
|
|
</goal>
|
|
<goal name="get_min'vc.6" expl="precondition" proved="true">
|
|
<proof prover="3" timelimit="5"><result status="valid" time="0.859224" steps="26225"/></proof>
|
|
</goal>
|
|
<goal name="get_min'vc.7" expl="postcondition" proved="true">
|
|
<proof prover="0"><result status="valid" time="0.040000"/></proof>
|
|
</goal>
|
|
<goal name="get_min'vc.8" expl="postcondition" proved="true">
|
|
<proof prover="0"><result status="valid" time="0.070000"/></proof>
|
|
</goal>
|
|
</transf>
|
|
</goal>
|
|
<goal name="add_tree'vc" expl="VC for add_tree" proved="true">
|
|
<transf name="split_goal_right" proved="true" >
|
|
<goal name="add_tree'vc.0" expl="assertion" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.010000" steps="24"/></proof>
|
|
</goal>
|
|
<goal name="add_tree'vc.1" expl="variant decrease" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.010000" steps="139"/></proof>
|
|
</goal>
|
|
<goal name="add_tree'vc.2" expl="precondition" proved="true">
|
|
<proof prover="0"><result status="valid" time="0.548958"/></proof>
|
|
</goal>
|
|
<goal name="add_tree'vc.3" expl="precondition" proved="true">
|
|
<proof prover="0"><result status="valid" time="0.100000"/></proof>
|
|
</goal>
|
|
<goal name="add_tree'vc.4" expl="precondition" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.010000" steps="133"/></proof>
|
|
</goal>
|
|
<goal name="add_tree'vc.5" expl="precondition" proved="true">
|
|
<proof prover="0"><result status="valid" time="0.040000"/></proof>
|
|
</goal>
|
|
<goal name="add_tree'vc.6" expl="postcondition" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.020000" steps="106"/></proof>
|
|
</goal>
|
|
<goal name="add_tree'vc.7" expl="postcondition" proved="true">
|
|
<proof prover="0"><result status="valid" time="0.343989"/></proof>
|
|
</goal>
|
|
<goal name="add_tree'vc.8" expl="postcondition" proved="true">
|
|
<proof prover="0"><result status="valid" time="0.592290"/></proof>
|
|
</goal>
|
|
</transf>
|
|
</goal>
|
|
<goal name="add'vc" expl="VC for add" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.040000" steps="484"/></proof>
|
|
</goal>
|
|
<goal name="merge'vc" expl="VC for merge" proved="true">
|
|
<transf name="split_goal_right" proved="true" >
|
|
<goal name="merge'vc.0" expl="variant decrease" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.010000" steps="147"/></proof>
|
|
</goal>
|
|
<goal name="merge'vc.1" expl="precondition" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.010000" steps="109"/></proof>
|
|
</goal>
|
|
<goal name="merge'vc.2" expl="precondition" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.010000" steps="30"/></proof>
|
|
</goal>
|
|
<goal name="merge'vc.3" expl="precondition" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.000000" steps="22"/></proof>
|
|
</goal>
|
|
<goal name="merge'vc.4" expl="precondition" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.000000" steps="34"/></proof>
|
|
</goal>
|
|
<goal name="merge'vc.5" expl="variant decrease" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.010000" steps="150"/></proof>
|
|
</goal>
|
|
<goal name="merge'vc.6" expl="precondition" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.010000" steps="22"/></proof>
|
|
</goal>
|
|
<goal name="merge'vc.7" expl="precondition" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.010000" steps="30"/></proof>
|
|
</goal>
|
|
<goal name="merge'vc.8" expl="precondition" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.010000" steps="114"/></proof>
|
|
</goal>
|
|
<goal name="merge'vc.9" expl="precondition" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.010000" steps="36"/></proof>
|
|
</goal>
|
|
<goal name="merge'vc.10" expl="variant decrease" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.010000" steps="170"/></proof>
|
|
</goal>
|
|
<goal name="merge'vc.11" expl="precondition" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.010000" steps="117"/></proof>
|
|
</goal>
|
|
<goal name="merge'vc.12" expl="precondition" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.010000" steps="32"/></proof>
|
|
</goal>
|
|
<goal name="merge'vc.13" expl="precondition" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.020000" steps="123"/></proof>
|
|
</goal>
|
|
<goal name="merge'vc.14" expl="precondition" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.010000" steps="39"/></proof>
|
|
</goal>
|
|
<goal name="merge'vc.15" expl="precondition" proved="true">
|
|
<proof prover="0"><result status="valid" time="0.380000"/></proof>
|
|
</goal>
|
|
<goal name="merge'vc.16" expl="precondition" proved="true">
|
|
<proof prover="0"><result status="valid" time="0.100000"/></proof>
|
|
</goal>
|
|
<goal name="merge'vc.17" expl="precondition" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.000000" steps="30"/></proof>
|
|
</goal>
|
|
<goal name="merge'vc.18" expl="precondition" proved="true">
|
|
<proof prover="0"><result status="valid" time="0.040000"/></proof>
|
|
</goal>
|
|
<goal name="merge'vc.19" expl="postcondition" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.030000" steps="831"/></proof>
|
|
</goal>
|
|
<goal name="merge'vc.20" expl="postcondition" proved="true">
|
|
<proof prover="0"><result status="valid" time="0.170000"/></proof>
|
|
</goal>
|
|
<goal name="merge'vc.21" expl="postcondition" proved="true">
|
|
<proof prover="0"><result status="valid" time="1.849330"/></proof>
|
|
</goal>
|
|
</transf>
|
|
</goal>
|
|
<goal name="extract_min_tree'vc" expl="VC for extract_min_tree" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.335471" steps="2805"/></proof>
|
|
</goal>
|
|
<goal name="extract_min'vc" expl="VC for extract_min" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.100000" steps="1192"/></proof>
|
|
</goal>
|
|
<goal name="has_order_size'vc" expl="VC for has_order_size" proved="true">
|
|
<proof prover="0"><result status="valid" time="0.100000"/></proof>
|
|
</goal>
|
|
<goal name="binomial_tree_size" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.010000" steps="61"/></proof>
|
|
<proof prover="4"><result status="valid" time="0.010000" steps="28045"/></proof>
|
|
</goal>
|
|
<goal name="inv_size'vc" expl="VC for inv_size" proved="true">
|
|
<proof prover="0"><result status="valid" time="1.300000"/></proof>
|
|
</goal>
|
|
<goal name="heap_size" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.010000" steps="37"/></proof>
|
|
<proof prover="4"><result status="valid" time="0.020000" steps="31038"/></proof>
|
|
</goal>
|
|
</theory>
|
|
</file>
|
|
</why3session>
|