why3session.xml 5.04 KB
Newer Older
1 2 3 4 5 6 7 8 9 10
<?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"
11
  expanded="true">
12 13 14 15 16 17 18 19 20 21 22 23
  <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"
24
   expanded="true">
25 26 27 28 29 30 31 32
   <label
    name="number of nodes"/>
   <goal
    name="size_nonneg"
    locfile="../bintree.why"
    loclnum="20" loccnumb="8" loccnume="19"
    sum="cb8c289d9686ccc4e3509e0890619661"
    proved="true"
33
    expanded="true"
34 35 36 37
    shape="ainfix &lt;=c0asizeV0F">
    <transf
     name="induction_ty_lex"
     proved="true"
38
     expanded="true">
39 40 41 42 43 44 45
     <goal
      name="size_nonneg.1"
      locfile="../bintree.why"
      loclnum="20" loccnumb="8" loccnume="19"
      expl="1."
      sum="12d53d1b4d232aed7f7f83d7cb5e3f42"
      proved="true"
46
      expanded="true"
47 48 49 50 51 52 53 54 55 56 57 58
      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>
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
   <goal
    name="size_empty"
    locfile="../bintree.why"
    loclnum="22" loccnumb="8" loccnume="18"
    sum="b31540d42a20b62d3b95f5df6a1117e7"
    proved="true"
    expanded="true"
    shape="ainfix =V0aEmptyqainfix =c0asizeV0F">
    <transf
     name="induction_ty_lex"
     proved="true"
     expanded="true">
     <goal
      name="size_empty.1"
      locfile="../bintree.why"
      loclnum="22" loccnumb="8" loccnume="18"
      expl="1."
      sum="c50dc79fc1bbfb85ca3062b724b8de5e"
      proved="true"
      expanded="false"
      shape="Cainfix =V0aEmptyqainfix =c0asizeV0aEmptyainfix =V0aEmptyqainfix =c0asizeV0Iainfix =V1aEmptyqainfix =c0asizeV1Iainfix =V3aEmptyqainfix =c0asizeV3aNodeVVVV0F">
      <proof
       prover="0"
       timelimit="6"
       memlimit="1000"
       obsolete="false"
       archived="false">
       <result status="valid" time="0.01"/>
      </proof>
     </goal>
    </transf>
   </goal>
91 92 93 94
  </theory>
  <theory
   name="Occ"
   locfile="../bintree.why"
95
   loclnum="26" loccnumb="7" loccnume="10"
96
   verified="true"
97
   expanded="true">
98 99 100 101 102
   <label
    name="occurrences in a binary tree"/>
   <goal
    name="occ_nonneg"
    locfile="../bintree.why"
103 104
    loclnum="36" loccnumb="8" loccnume="18"
    sum="717594c52723f5c7e9666ab1ab6810b6"
105
    proved="true"
106
    expanded="true"
107 108 109 110
    shape="ainfix &lt;=c0aoccV0V1F">
    <transf
     name="induction_ty_lex"
     proved="true"
111
     expanded="true">
112 113 114
     <goal
      name="occ_nonneg.1"
      locfile="../bintree.why"
115
      loclnum="36" loccnumb="8" loccnume="18"
116
      expl="1."
117
      sum="63d90ff251110ddb7e30c27b8bb421b1"
118
      proved="true"
119
      expanded="true"
120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135
      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"
136
   loclnum="44" loccnumb="7" loccnume="14"
137 138 139 140 141 142 143 144
   verified="true"
   expanded="false">
   <label
    name="inorder traversal"/>
  </theory>
  <theory
   name="Preorder"
   locfile="../bintree.why"
145
   loclnum="56" loccnumb="7" loccnume="15"
146 147 148 149 150 151 152 153
   verified="true"
   expanded="false">
   <label
    name="preorder traversal"/>
  </theory>
  <theory
   name="InorderLength"
   locfile="../bintree.why"
154
   loclnum="68" loccnumb="7" loccnume="20"
155
   verified="true"
156
   expanded="true">
157 158 159
   <goal
    name="inorder_length"
    locfile="../bintree.why"
160 161
    loclnum="74" loccnumb="8" loccnume="22"
    sum="e81c509b7e9a14f0ce5eba170b717974"
162
    proved="true"
163
    expanded="true"
164 165 166 167
    shape="ainfix =alengthainorderV0asizeV0F">
    <transf
     name="induction_ty_lex"
     proved="true"
168
     expanded="true">
169 170 171
     <goal
      name="inorder_length.1"
      locfile="../bintree.why"
172
      loclnum="74" loccnumb="8" loccnume="22"
173
      expl="1."
174
      sum="76c4ea67fd68f44ff3811c278c699051"
175
      proved="true"
176
      expanded="true"
177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192
      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"
193
   loclnum="78" loccnumb="7" loccnume="13"
194 195 196 197 198 199 200
   verified="true"
   expanded="false">
   <label
    name="Huet&apos;s zipper"/>
  </theory>
 </file>
</why3session>