examples/min_max/why3session.xml

   1 <?xml version="1.0" encoding="UTF-8"?>
   2 <!DOCTYPE why3session PUBLIC "-//Why3//proof session v5//EN"
   3 "https://www.why3.org/why3session.dtd">
   4 <why3session shape_version="6">
   5 <prover id="1" name="CVC5" version="1.0.5" timelimit="1" steplimit="0" memlimit="1000"/>
   6 <prover id="2" name="Alt-Ergo" version="2.3.0" timelimit="1" steplimit="0" memlimit="1000"/>
   7 <prover id="3" name="Z3" version="4.12.2" timelimit="1" steplimit="0" memlimit="1000"/>
   8 <file format="whyml" proved="true">
   9 <path name=".."/><path name="min_max.mlw"/>
  10 <theory name="Top" proved="true">
  11  <goal name="min_max&#39;vc" expl="VC for min_max" proved="true">
  12  <proof prover="2"><result status="valid" time="0.080000" steps="291"/></proof>
  13  </goal>
  14  <goal name="a_better_min_max&#39;vc" expl="VC for a_better_min_max" proved="true">
  15  <transf name="split_vc" proved="true" >
  16   <goal name="a_better_min_max&#39;vc.0" expl="index in array bounds" proved="true">
  17   <proof prover="2"><result status="valid" time="0.010000" steps="2"/></proof>
  18   </goal>
  19   <goal name="a_better_min_max&#39;vc.1" expl="index in array bounds" proved="true">
  20   <proof prover="2"><result status="valid" time="0.010000" steps="2"/></proof>
  21   </goal>
  22   <goal name="a_better_min_max&#39;vc.2" expl="check modulo by zero" proved="true">
  23   <proof prover="2"><result status="valid" time="0.030000" steps="2"/></proof>
  24   </goal>
  25   <goal name="a_better_min_max&#39;vc.3" expl="index in array bounds" proved="true">
  26   <proof prover="2"><result status="valid" time="0.010000" steps="6"/></proof>
  27   </goal>
  28   <goal name="a_better_min_max&#39;vc.4" expl="index in array bounds" proved="true">
  29   <proof prover="2"><result status="valid" time="0.000000" steps="4"/></proof>
  30   </goal>
  31   <goal name="a_better_min_max&#39;vc.5" expl="index in array bounds" proved="true">
  32   <proof prover="2"><result status="valid" time="0.010000" steps="8"/></proof>
  33   </goal>
  34   <goal name="a_better_min_max&#39;vc.6" expl="index in array bounds" proved="true">
  35   <proof prover="2"><result status="valid" time="0.000000" steps="8"/></proof>
  36   </goal>
  37   <goal name="a_better_min_max&#39;vc.7" expl="loop invariant init" proved="true">
  38   <proof prover="2"><result status="valid" time="0.010000" steps="54"/></proof>
  39   </goal>
  40   <goal name="a_better_min_max&#39;vc.8" expl="loop invariant init" proved="true">
  41   <proof prover="2"><result status="valid" time="0.120000" steps="543"/></proof>
  42   </goal>
  43   <goal name="a_better_min_max&#39;vc.9" expl="index in array bounds" proved="true">
  44   <proof prover="2"><result status="valid" time="0.000000" steps="62"/></proof>
  45   </goal>
  46   <goal name="a_better_min_max&#39;vc.10" expl="index in array bounds" proved="true">
  47   <proof prover="2"><result status="valid" time="0.000000" steps="55"/></proof>
  48   </goal>
  49   <goal name="a_better_min_max&#39;vc.11" expl="index in array bounds" proved="true">
  50   <proof prover="2"><result status="valid" time="0.010000" steps="68"/></proof>
  51   </goal>
  52   <goal name="a_better_min_max&#39;vc.12" expl="index in array bounds" proved="true">
  53   <proof prover="2"><result status="valid" time="0.000000" steps="61"/></proof>
  54   </goal>
  55   <goal name="a_better_min_max&#39;vc.13" expl="index in array bounds" proved="true">
  56   <proof prover="2"><result status="valid" time="0.010000" steps="61"/></proof>
  57   </goal>
  58   <goal name="a_better_min_max&#39;vc.14" expl="index in array bounds" proved="true">
  59   <proof prover="2"><result status="valid" time="0.040000" steps="68"/></proof>
  60   </goal>
  61   <goal name="a_better_min_max&#39;vc.15" expl="loop variant decrease" proved="true">
  62   <proof prover="3"><result status="valid" time="0.010000" steps="21655"/></proof>
  63   </goal>
  64   <goal name="a_better_min_max&#39;vc.16" expl="loop invariant preservation" proved="true">
  65   <proof prover="2"><result status="valid" time="0.010000" steps="120"/></proof>
  66   </goal>
  67   <goal name="a_better_min_max&#39;vc.17" expl="loop invariant preservation" proved="true">
  68   <proof prover="1"><result status="valid" time="0.408187" steps="39182"/></proof>
  69   </goal>
  70   <goal name="a_better_min_max&#39;vc.18" expl="postcondition" proved="true">
  71   <proof prover="2"><result status="valid" time="0.010000" steps="126"/></proof>
  72   </goal>
  73  </transf>
  74  </goal>
  75  <goal name="divide_and_conquer&#39;vc" expl="VC for divide_and_conquer" proved="true">
  76  <proof prover="2"><result status="valid" time="0.370000" steps="989"/></proof>
  77  </goal>
  78  <goal name="a_similar_min_max&#39;vc" expl="VC for a_similar_min_max" proved="true">
  79  <proof prover="2"><result status="valid" time="0.020000" steps="11"/></proof>
  80  </goal>
  81 </theory>
  82 </file>
  83 </why3session>