mirror of
https://github.com/AdaCore/why3.git
synced 2026-02-12 12:34:55 -08:00
77 lines
3.6 KiB
XML
77 lines
3.6 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.7" timelimit="1" steplimit="0" memlimit="1000"/>
|
|
<prover id="2" name="Alt-Ergo" version="2.6.2" timelimit="5" steplimit="0" memlimit="1000"/>
|
|
<file format="whyml" proved="true">
|
|
<path name=".."/><path name="pairing_heap_bin.mlw"/>
|
|
<theory name="Heap" proved="true">
|
|
<goal name="empty'vc" expl="VC for empty" proved="true">
|
|
<proof prover="2" timelimit="1"><result status="valid" time="0.000000" steps="0"/></proof>
|
|
</goal>
|
|
</theory>
|
|
<theory name="Size" proved="true">
|
|
<goal name="size_nonneg'vc" expl="VC for size_nonneg" proved="true">
|
|
<proof prover="2"><result status="valid" time="0.000000" steps="47"/></proof>
|
|
</goal>
|
|
<goal name="size_empty" proved="true">
|
|
<proof prover="2"><result status="valid" time="0.000000" steps="42"/></proof>
|
|
</goal>
|
|
</theory>
|
|
<theory name="Occ" proved="true">
|
|
<goal name="occ_nonneg'vc" expl="VC for occ_nonneg" proved="true">
|
|
<proof prover="0" timelimit="5"><result status="valid" time="0.010000" steps="3165"/></proof>
|
|
</goal>
|
|
</theory>
|
|
<theory name="PairingHeap" proved="true">
|
|
<goal name="le_root_trans" proved="true">
|
|
<proof prover="2"><result status="valid" time="0.000000" steps="38"/></proof>
|
|
</goal>
|
|
<goal name="le_root_tree_trans" proved="true">
|
|
<transf name="induction_ty_lex" proved="true" >
|
|
<goal name="le_root_tree_trans.0" proved="true">
|
|
<proof prover="2"><result status="valid" time="0.010000" steps="62"/></proof>
|
|
</goal>
|
|
</transf>
|
|
</goal>
|
|
<goal name="mem_heap_tree'vc" expl="VC for mem_heap_tree" proved="true">
|
|
<proof prover="2"><result status="valid" time="0.030000" steps="396"/></proof>
|
|
</goal>
|
|
<goal name="mem_heap'vc" expl="VC for mem_heap" proved="true">
|
|
<proof prover="0" timelimit="5"><result status="valid" time="0.040000" steps="7016"/></proof>
|
|
</goal>
|
|
<goal name="root_is_minimum" proved="true">
|
|
<proof prover="2"><result status="valid" time="0.030000" steps="271"/></proof>
|
|
</goal>
|
|
<goal name="empty'vc" expl="VC for empty" proved="true">
|
|
<proof prover="0" timelimit="5"><result status="valid" time="0.010000" steps="4540"/></proof>
|
|
</goal>
|
|
<goal name="is_empty'vc" expl="VC for is_empty" proved="true">
|
|
<proof prover="2"><result status="valid" time="0.000000" steps="67"/></proof>
|
|
</goal>
|
|
<goal name="size'vc" expl="VC for size" proved="true">
|
|
<proof prover="0"><result status="valid" time="0.050000" steps="3841"/></proof>
|
|
<proof prover="2"><result status="valid" time="0.000000" steps="10"/></proof>
|
|
</goal>
|
|
<goal name="merge'vc" expl="VC for merge" proved="true">
|
|
<proof prover="0"><result status="valid" time="0.100000" steps="20654"/></proof>
|
|
</goal>
|
|
<goal name="insert'vc" expl="VC for insert" proved="true">
|
|
<proof prover="0"><result status="valid" time="0.090000" steps="7616"/></proof>
|
|
</goal>
|
|
<goal name="find_min'vc" expl="VC for find_min" proved="true">
|
|
<proof prover="0"><result status="valid" time="0.050000" steps="4600"/></proof>
|
|
<proof prover="2"><result status="valid" time="0.000000" steps="64"/></proof>
|
|
</goal>
|
|
<goal name="merge_pairs'vc" expl="VC for merge_pairs" proved="true">
|
|
<proof prover="0"><result status="valid" time="0.340000" steps="54341"/></proof>
|
|
</goal>
|
|
<goal name="delete_min'vc" expl="VC for delete_min" proved="true">
|
|
<proof prover="0"><result status="valid" time="0.080000" steps="7615"/></proof>
|
|
<proof prover="2"><result status="valid" time="0.020000" steps="324"/></proof>
|
|
</goal>
|
|
</theory>
|
|
</file>
|
|
</why3session>
|