why3session.xml 4.15 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168
<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE why3session PUBLIC "-//Why3//proof session v2//EN" "http://why3.lri.fr/why3session.dtd">
<why3session shape_version="4">
 <prover
  id="0"
  name="Alt-Ergo"
  version="0.95.2"/>
 <file
  name="../bintree.why"
  verified="true"
  expanded="false">
  <theory
   name="Tree"
   locfile="../bintree.why"
   loclnum="4" loccnumb="7" loccnume="11"
   verified="true"
   expanded="false">
  </theory>
  <theory
   name="Size"
   locfile="../bintree.why"
   loclnum="10" loccnumb="7" loccnume="11"
   verified="true"
   expanded="false">
   <label
    name="number of nodes"/>
   <goal
    name="size_nonneg"
    locfile="../bintree.why"
    loclnum="20" loccnumb="8" loccnume="19"
    sum="cb8c289d9686ccc4e3509e0890619661"
    proved="true"
    expanded="false"
    shape="ainfix &lt;=c0asizeV0F">
    <transf
     name="induction_ty_lex"
     proved="true"
     expanded="false">
     <goal
      name="size_nonneg.1"
      locfile="../bintree.why"
      loclnum="20" loccnumb="8" loccnume="19"
      expl="1."
      sum="12d53d1b4d232aed7f7f83d7cb5e3f42"
      proved="true"
      expanded="false"
      shape="Cainfix &lt;=c0asizeV0aEmptyainfix &lt;=c0asizeV0Iainfix &lt;=c0asizeV1Iainfix &lt;=c0asizeV3aNodeVVVV0F">
      <proof
       prover="0"
       timelimit="6"
       memlimit="1000"
       obsolete="false"
       archived="false">
       <result status="valid" time="0.01"/>
      </proof>
     </goal>
    </transf>
   </goal>
  </theory>
  <theory
   name="Occ"
   locfile="../bintree.why"
   loclnum="24" loccnumb="7" loccnume="10"
   verified="true"
   expanded="false">
   <label
    name="occurrences in a binary tree"/>
   <goal
    name="occ_nonneg"
    locfile="../bintree.why"
    loclnum="38" loccnumb="8" loccnume="18"
    sum="f2106ad0f6afef73c8d8659379f4e159"
    proved="true"
    expanded="false"
    shape="ainfix &lt;=c0aoccV0V1F">
    <transf
     name="induction_ty_lex"
     proved="true"
     expanded="false">
     <goal
      name="occ_nonneg.1"
      locfile="../bintree.why"
      loclnum="38" loccnumb="8" loccnume="18"
      expl="1."
      sum="6ad4875c535741780c16685271aaf9e3"
      proved="true"
      expanded="false"
      shape="Cainfix &lt;=c0aoccV0V1aEmptyainfix &lt;=c0aoccV0V1Iainfix &lt;=c0aoccV0V2Iainfix &lt;=c0aoccV0V4aNodeVVVV1F">
      <proof
       prover="0"
       timelimit="6"
       memlimit="1000"
       obsolete="false"
       archived="false">
       <result status="valid" time="0.01"/>
      </proof>
     </goal>
    </transf>
   </goal>
  </theory>
  <theory
   name="Inorder"
   locfile="../bintree.why"
   loclnum="46" loccnumb="7" loccnume="14"
   verified="true"
   expanded="false">
   <label
    name="inorder traversal"/>
  </theory>
  <theory
   name="Preorder"
   locfile="../bintree.why"
   loclnum="58" loccnumb="7" loccnume="15"
   verified="true"
   expanded="false">
   <label
    name="preorder traversal"/>
  </theory>
  <theory
   name="InorderLength"
   locfile="../bintree.why"
   loclnum="70" loccnumb="7" loccnume="20"
   verified="true"
   expanded="false">
   <goal
    name="inorder_length"
    locfile="../bintree.why"
    loclnum="76" loccnumb="8" loccnume="22"
    sum="35f8a02ac76b338b12bc12823565d6c2"
    proved="true"
    expanded="false"
    shape="ainfix =alengthainorderV0asizeV0F">
    <transf
     name="induction_ty_lex"
     proved="true"
     expanded="false">
     <goal
      name="inorder_length.1"
      locfile="../bintree.why"
      loclnum="76" loccnumb="8" loccnume="22"
      expl="1."
      sum="a14cd8e33cdb1250c6764bf6b3d4c8b8"
      proved="true"
      expanded="false"
      shape="Cainfix =alengthainorderV0asizeV0aEmptyainfix =alengthainorderV0asizeV0Iainfix =alengthainorderV1asizeV1Iainfix =alengthainorderV3asizeV3aNodeVVVV0F">
      <proof
       prover="0"
       timelimit="6"
       memlimit="1000"
       obsolete="false"
       archived="false">
       <result status="valid" time="0.01"/>
      </proof>
     </goal>
    </transf>
   </goal>
  </theory>
  <theory
   name="Zipper"
   locfile="../bintree.why"
   loclnum="80" loccnumb="7" loccnume="13"
   verified="true"
   expanded="false">
   <label
    name="Huet&apos;s zipper"/>
  </theory>
 </file>
</why3session>