<?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.1.0" timelimit="5" steplimit="0" memlimit="1000"/>
<prover id="2" name="Z3" version="4.12.2" timelimit="5" steplimit="0" memlimit="1000"/>
<prover id="4" name="CVC3" version="2.4.1" timelimit="5" steplimit="0" memlimit="1000"/>
<prover id="5" name="CVC4" version="1.5" timelimit="5" steplimit="0" memlimit="1000"/>
<file format="whyml" proved="true">
<path name=".."/><path name="verifythis_2017_pair_insertion_sort.mlw"/>
<theory name="Challenge1" proved="true">
 <goal name="pair_insertion_sort&#39;vc" expl="VC for pair_insertion_sort" proved="true">
 <transf name="split_goal_right" proved="true" >
  <goal name="pair_insertion_sort&#39;vc.0" expl="loop invariant init" proved="true">
  <proof prover="0"><result status="valid" time="0.000000" steps="2"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.1" expl="loop invariant init" proved="true">
  <proof prover="0"><result status="valid" time="0.000000" steps="3"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.2" expl="loop invariant init" proved="true">
  <proof prover="0"><result status="valid" time="0.010000" steps="7"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.3" expl="index in array bounds" proved="true">
  <proof prover="0"><result status="valid" time="0.000000" steps="10"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.4" expl="index in array bounds" proved="true">
  <proof prover="0"><result status="valid" time="0.000000" steps="10"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.5" expl="loop invariant init" proved="true">
  <proof prover="0"><result status="valid" time="0.000000" steps="16"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.6" expl="loop invariant init" proved="true">
  <proof prover="0"><result status="valid" time="0.000000" steps="26"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.7" expl="loop invariant init" proved="true">
  <proof prover="0"><result status="valid" time="0.010000" steps="22"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.8" expl="loop invariant init" proved="true">
  <proof prover="0"><result status="valid" time="0.000000" steps="18"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.9" expl="loop invariant init" proved="true">
  <proof prover="0"><result status="valid" time="0.000000" steps="18"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.10" expl="loop invariant init" proved="true">
  <proof prover="0"><result status="valid" time="0.150000" steps="314"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.11" expl="index in array bounds" proved="true">
  <proof prover="0"><result status="valid" time="0.000000" steps="26"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.12" expl="index in array bounds" proved="true">
  <proof prover="0"><result status="valid" time="0.000000" steps="30"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.13" expl="index in array bounds" proved="true">
  <proof prover="0"><result status="valid" time="0.000000" steps="30"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.14" expl="assertion" proved="true">
  <proof prover="0"><result status="valid" time="0.010000" steps="117"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.15" expl="assertion" proved="true">
  <proof prover="0"><result status="valid" time="0.050000" steps="220"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.16" expl="assertion" proved="true">
  <proof prover="0"><result status="valid" time="0.100000" steps="389"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.17" expl="loop variant decrease" proved="true">
  <proof prover="0"><result status="valid" time="0.000000" steps="44"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.18" expl="loop invariant preservation" proved="true">
  <proof prover="0"><result status="valid" time="0.000000" steps="44"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.19" expl="loop invariant preservation" proved="true">
  <proof prover="0"><result status="valid" time="0.070000" steps="311"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.20" expl="loop invariant preservation" proved="true">
  <proof prover="0"><result status="valid" time="0.160000" steps="381"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.21" expl="loop invariant preservation" proved="true">
  <proof prover="0"><result status="valid" time="0.240000" steps="380"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.22" expl="loop invariant preservation" proved="true">
  <proof prover="0"><result status="valid" time="0.020000" steps="125"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.23" expl="loop invariant preservation" proved="true">
  <proof prover="4"><result status="valid" time="0.100000"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.24" expl="index in array bounds" proved="true">
  <proof prover="0"><result status="valid" time="0.010000" steps="26"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.25" expl="loop invariant init" proved="true">
  <proof prover="0"><result status="valid" time="0.010000" steps="32"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.26" expl="loop invariant init" proved="true">
  <proof prover="0"><result status="valid" time="0.030000" steps="126"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.27" expl="loop invariant init" proved="true">
  <proof prover="0"><result status="valid" time="0.040000" steps="145"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.28" expl="loop invariant init" proved="true">
  <proof prover="0"><result status="valid" time="0.080000" steps="190"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.29" expl="loop invariant init" proved="true">
  <proof prover="0"><result status="valid" time="0.010000" steps="69"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.30" expl="loop invariant init" proved="true">
  <proof prover="0"><result status="valid" time="3.340000" steps="2040"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.31" expl="index in array bounds" proved="true">
  <proof prover="0"><result status="valid" time="0.010000" steps="42"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.32" expl="index in array bounds" proved="true">
  <proof prover="0"><result status="valid" time="0.010000" steps="46"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.33" expl="index in array bounds" proved="true">
  <proof prover="0"><result status="valid" time="0.010000" steps="46"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.34" expl="assertion" proved="true">
  <proof prover="0"><result status="valid" time="0.020000" steps="163"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.35" expl="loop variant decrease" proved="true">
  <proof prover="0"><result status="valid" time="0.010000" steps="56"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.36" expl="loop invariant preservation" proved="true">
  <proof prover="0"><result status="valid" time="0.010000" steps="56"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.37" expl="loop invariant preservation" proved="true">
  <proof prover="0"><result status="valid" time="0.050000" steps="236"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.38" expl="loop invariant preservation" proved="true">
  <proof prover="0"><result status="valid" time="0.080000" steps="294"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.39" expl="loop invariant preservation" proved="true">
  <proof prover="0"><result status="valid" time="0.140000" steps="283"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.40" expl="loop invariant preservation" proved="true">
  <proof prover="0"><result status="valid" time="0.020000" steps="119"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.41" expl="loop invariant preservation" proved="true">
  <proof prover="2"><result status="valid" time="0.020000" steps="63939"/></proof>
  <proof prover="5"><result status="valid" time="0.090000" steps="27205"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.42" expl="index in array bounds" proved="true">
  <proof prover="0"><result status="valid" time="0.010000" steps="42"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.43" expl="loop variant decrease" proved="true">
  <proof prover="0"><result status="valid" time="0.010000" steps="50"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.44" expl="loop invariant preservation" proved="true">
  <proof prover="0"><result status="valid" time="0.010000" steps="50"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.45" expl="loop invariant preservation" proved="true">
  <proof prover="0"><result status="valid" time="0.330000" steps="1437"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.46" expl="loop invariant preservation" proved="true">
  <proof prover="0"><result status="valid" time="0.020000" steps="52"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.47" expl="assertion" proved="true">
  <proof prover="0"><result status="valid" time="0.020000" steps="74"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.48" expl="loop invariant init" proved="true">
  <proof prover="0"><result status="valid" time="0.000000" steps="14"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.49" expl="loop invariant init" proved="true">
  <proof prover="0"><result status="valid" time="0.000000" steps="24"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.50" expl="loop invariant init" proved="true">
  <proof prover="0"><result status="valid" time="0.010000" steps="20"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.51" expl="loop invariant init" proved="true">
  <proof prover="0"><result status="valid" time="0.000000" steps="16"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.52" expl="loop invariant init" proved="true">
  <proof prover="0"><result status="valid" time="0.000000" steps="16"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.53" expl="loop invariant init" proved="true">
  <proof prover="0"><result status="valid" time="0.020000" steps="80"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.54" expl="index in array bounds" proved="true">
  <proof prover="0"><result status="valid" time="0.000000" steps="24"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.55" expl="index in array bounds" proved="true">
  <proof prover="0"><result status="valid" time="0.000000" steps="28"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.56" expl="index in array bounds" proved="true">
  <proof prover="0"><result status="valid" time="0.000000" steps="28"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.57" expl="assertion" proved="true">
  <proof prover="0"><result status="valid" time="0.010000" steps="158"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.58" expl="assertion" proved="true">
  <proof prover="0"><result status="valid" time="0.040000" steps="309"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.59" expl="assertion" proved="true">
  <proof prover="0"><result status="valid" time="0.130000" steps="494"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.60" expl="loop variant decrease" proved="true">
  <proof prover="0"><result status="valid" time="0.000000" steps="42"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.61" expl="loop invariant preservation" proved="true">
  <proof prover="0"><result status="valid" time="0.010000" steps="42"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.62" expl="loop invariant preservation" proved="true">
  <proof prover="0"><result status="valid" time="0.080000" steps="364"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.63" expl="loop invariant preservation" proved="true">
  <proof prover="0"><result status="valid" time="0.280000" steps="458"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.64" expl="loop invariant preservation" proved="true">
  <proof prover="0"><result status="valid" time="0.320000" steps="457"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.65" expl="loop invariant preservation" proved="true">
  <proof prover="0"><result status="valid" time="0.120000" steps="133"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.66" expl="loop invariant preservation" proved="true">
  <proof prover="4"><result status="valid" time="0.110000"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.67" expl="index in array bounds" proved="true">
  <proof prover="0"><result status="valid" time="0.010000" steps="24"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.68" expl="loop invariant init" proved="true">
  <proof prover="0"><result status="valid" time="0.000000" steps="30"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.69" expl="loop invariant init" proved="true">
  <proof prover="0"><result status="valid" time="0.040000" steps="179"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.70" expl="loop invariant init" proved="true">
  <proof prover="0"><result status="valid" time="0.020000" steps="222"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.71" expl="loop invariant init" proved="true">
  <proof prover="0"><result status="valid" time="0.200000" steps="289"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.72" expl="loop invariant init" proved="true">
  <proof prover="0"><result status="valid" time="0.020000" steps="77"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.73" expl="loop invariant init" proved="true">
  <proof prover="0"><result status="valid" time="4.520000" steps="2352"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.74" expl="index in array bounds" proved="true">
  <proof prover="0"><result status="valid" time="0.010000" steps="40"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.75" expl="index in array bounds" proved="true">
  <proof prover="0"><result status="valid" time="0.000000" steps="44"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.76" expl="index in array bounds" proved="true">
  <proof prover="0"><result status="valid" time="0.010000" steps="44"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.77" expl="assertion" proved="true">
  <proof prover="0"><result status="valid" time="0.020000" steps="204"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.78" expl="loop variant decrease" proved="true">
  <proof prover="0"><result status="valid" time="0.010000" steps="54"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.79" expl="loop invariant preservation" proved="true">
  <proof prover="0"><result status="valid" time="0.010000" steps="54"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.80" expl="loop invariant preservation" proved="true">
  <proof prover="0"><result status="valid" time="0.160000" steps="289"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.81" expl="loop invariant preservation" proved="true">
  <proof prover="0"><result status="valid" time="0.100000" steps="366"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.82" expl="loop invariant preservation" proved="true">
  <proof prover="0"><result status="valid" time="0.160000" steps="360"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.83" expl="loop invariant preservation" proved="true">
  <proof prover="0"><result status="valid" time="0.040000" steps="127"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.84" expl="loop invariant preservation" proved="true">
  <proof prover="0"><result status="valid" time="0.050000" steps="204"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.85" expl="index in array bounds" proved="true">
  <proof prover="0"><result status="valid" time="0.010000" steps="40"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.86" expl="loop variant decrease" proved="true">
  <proof prover="0"><result status="valid" time="0.000000" steps="48"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.87" expl="loop invariant preservation" proved="true">
  <proof prover="0"><result status="valid" time="0.010000" steps="48"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.88" expl="loop invariant preservation" proved="true">
  <proof prover="0"><result status="valid" time="0.430000" steps="2094"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.89" expl="loop invariant preservation" proved="true">
  <proof prover="0"><result status="valid" time="0.020000" steps="50"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.90" expl="index in array bounds" proved="true">
  <proof prover="0"><result status="valid" time="0.000000" steps="12"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.91" expl="loop invariant init" proved="true">
  <proof prover="0"><result status="valid" time="0.000000" steps="12"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.92" expl="loop invariant init" proved="true">
  <proof prover="0"><result status="valid" time="0.000000" steps="22"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.93" expl="loop invariant init" proved="true">
  <proof prover="0"><result status="valid" time="0.000000" steps="18"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.94" expl="loop invariant init" proved="true">
  <proof prover="0"><result status="valid" time="0.000000" steps="14"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.95" expl="loop invariant init" proved="true">
  <proof prover="0"><result status="valid" time="0.000000" steps="14"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.96" expl="loop invariant init" proved="true">
  <proof prover="0"><result status="valid" time="0.170000" steps="251"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.97" expl="index in array bounds" proved="true">
  <proof prover="0"><result status="valid" time="0.000000" steps="22"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.98" expl="index in array bounds" proved="true">
  <proof prover="0"><result status="valid" time="0.000000" steps="26"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.99" expl="index in array bounds" proved="true">
  <proof prover="0"><result status="valid" time="0.000000" steps="26"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.100" expl="assertion" proved="true">
  <proof prover="0"><result status="valid" time="0.010000" steps="85"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.101" expl="loop variant decrease" proved="true">
  <proof prover="0"><result status="valid" time="0.010000" steps="36"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.102" expl="loop invariant preservation" proved="true">
  <proof prover="0"><result status="valid" time="0.000000" steps="36"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.103" expl="loop invariant preservation" proved="true">
  <proof prover="0"><result status="valid" time="0.050000" steps="157"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.104" expl="loop invariant preservation" proved="true">
  <proof prover="0"><result status="valid" time="0.060000" steps="215"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.105" expl="loop invariant preservation" proved="true">
  <proof prover="0"><result status="valid" time="0.100000" steps="211"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.106" expl="loop invariant preservation" proved="true">
  <proof prover="0"><result status="valid" time="0.010000" steps="79"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.107" expl="loop invariant preservation" proved="true">
  <proof prover="0"><result status="valid" time="0.030000" steps="116"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.108" expl="index in array bounds" proved="true">
  <proof prover="0"><result status="valid" time="0.000000" steps="22"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.109" expl="postcondition" proved="true">
  <proof prover="0"><result status="valid" time="0.070000" steps="199"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.110" expl="postcondition" proved="true">
  <proof prover="0"><result status="valid" time="0.010000" steps="28"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.111" expl="postcondition" proved="true">
  <proof prover="0"><result status="valid" time="0.000000" steps="20"/></proof>
  </goal>
  <goal name="pair_insertion_sort&#39;vc.112" expl="postcondition" proved="true">
  <proof prover="0"><result status="valid" time="0.010000" steps="12"/></proof>
  </goal>
 </transf>
 </goal>
</theory>
</file>
</why3session>
