mirror of
https://github.com/AdaCore/why3.git
synced 2026-02-12 12:34:55 -08:00
111 lines
5.4 KiB
XML
111 lines
5.4 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.0.0" timelimit="10" steplimit="0" memlimit="1000"/>
|
|
<prover id="1" name="Z3" version="4.8.6" timelimit="1" steplimit="0" memlimit="1000"/>
|
|
<prover id="2" name="CVC4" version="1.7" timelimit="1" steplimit="0" memlimit="1000"/>
|
|
<prover id="3" name="Alt-Ergo" version="2.3.0" timelimit="1" steplimit="0" memlimit="1000"/>
|
|
<file format="whyml" proved="true">
|
|
<path name=".."/><path name="binary_search.mlw"/>
|
|
<theory name="BinarySearch" proved="true">
|
|
<goal name="binary_search'vc" expl="VC for binary_search" proved="true">
|
|
<proof prover="0"><result status="valid" time="0.05" steps="132"/></proof>
|
|
</goal>
|
|
</theory>
|
|
<theory name="BinarySearchAnyMidPoint" proved="true">
|
|
<goal name="binary_search'vc" expl="VC for binary_search" proved="true">
|
|
<proof prover="0"><result status="valid" time="0.01" steps="63"/></proof>
|
|
</goal>
|
|
</theory>
|
|
<theory name="BinarySearchBranchless" proved="true">
|
|
<goal name="binary_search'vc" expl="VC for binary_search" proved="true">
|
|
<proof prover="0" timelimit="5"><result status="valid" time="0.06" steps="219"/></proof>
|
|
</goal>
|
|
</theory>
|
|
<theory name="BinarySearchInt32" proved="true">
|
|
<goal name="binary_search'vc" expl="VC for binary_search" proved="true">
|
|
<proof prover="0"><result status="valid" time="1.31" steps="3156"/></proof>
|
|
</goal>
|
|
</theory>
|
|
<theory name="BinarySearchBoolean" proved="true">
|
|
<goal name="binary_search'vc" expl="VC for binary_search" proved="true">
|
|
<proof prover="0"><result status="valid" time="0.08" steps="246"/></proof>
|
|
</goal>
|
|
</theory>
|
|
<theory name="Complexity" proved="true">
|
|
<goal name="log2'vc" expl="VC for log2" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.02" steps="4"/></proof>
|
|
</goal>
|
|
<goal name="log2_monotone'vc" expl="VC for log2_monotone" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.06" steps="104"/></proof>
|
|
</goal>
|
|
<goal name="upper_bound" proved="true">
|
|
<proof prover="1"><result status="valid" time="0.03" steps="49855"/></proof>
|
|
</goal>
|
|
<goal name="binary_search'vc" expl="VC for binary_search" proved="true">
|
|
<transf name="split_vc" proved="true" >
|
|
<goal name="binary_search'vc.0" expl="loop invariant init" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.00" steps="4"/></proof>
|
|
</goal>
|
|
<goal name="binary_search'vc.1" expl="loop invariant init" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.00" steps="8"/></proof>
|
|
</goal>
|
|
<goal name="binary_search'vc.2" expl="loop invariant init" proved="true">
|
|
<transf name="compute_in_goal" proved="true" >
|
|
<goal name="binary_search'vc.2.0" expl="loop invariant init" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.00" steps="10"/></proof>
|
|
</goal>
|
|
</transf>
|
|
</goal>
|
|
<goal name="binary_search'vc.3" expl="precondition" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.00" steps="14"/></proof>
|
|
</goal>
|
|
<goal name="binary_search'vc.4" expl="index in array bounds" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.01" steps="25"/></proof>
|
|
</goal>
|
|
<goal name="binary_search'vc.5" expl="loop variant decrease" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.01" steps="24"/></proof>
|
|
</goal>
|
|
<goal name="binary_search'vc.6" expl="loop invariant preservation" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.01" steps="35"/></proof>
|
|
</goal>
|
|
<goal name="binary_search'vc.7" expl="loop invariant preservation" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.01" steps="68"/></proof>
|
|
</goal>
|
|
<goal name="binary_search'vc.8" expl="loop invariant preservation" proved="true">
|
|
<proof prover="1"><result status="valid" time="0.03" steps="32462"/></proof>
|
|
</goal>
|
|
<goal name="binary_search'vc.9" expl="index in array bounds" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.01" steps="30"/></proof>
|
|
</goal>
|
|
<goal name="binary_search'vc.10" expl="loop variant decrease" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.01" steps="28"/></proof>
|
|
</goal>
|
|
<goal name="binary_search'vc.11" expl="loop invariant preservation" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.01" steps="39"/></proof>
|
|
</goal>
|
|
<goal name="binary_search'vc.12" expl="loop invariant preservation" proved="true">
|
|
<proof prover="2"><result status="valid" time="0.10" steps="7209"/></proof>
|
|
</goal>
|
|
<goal name="binary_search'vc.13" expl="loop invariant preservation" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.05" steps="104"/></proof>
|
|
</goal>
|
|
<goal name="binary_search'vc.14" expl="postcondition" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.01" steps="48"/></proof>
|
|
</goal>
|
|
<goal name="binary_search'vc.15" expl="postcondition" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.01" steps="65"/></proof>
|
|
</goal>
|
|
<goal name="binary_search'vc.16" expl="postcondition" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.00" steps="21"/></proof>
|
|
</goal>
|
|
<goal name="binary_search'vc.17" expl="postcondition" proved="true">
|
|
<proof prover="3"><result status="valid" time="0.02" steps="18"/></proof>
|
|
</goal>
|
|
</transf>
|
|
</goal>
|
|
</theory>
|
|
</file>
|
|
</why3session>
|