File: why3session.xml

package info (click to toggle)
why3 1.8.2-3
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 45,028 kB
  • sloc: xml: 185,443; ml: 111,224; ansic: 3,998; sh: 2,578; makefile: 2,568; java: 865; python: 720; javascript: 290; lisp: 205; pascal: 173
file content (81 lines) | stat: -rw-r--r-- 4,012 bytes parent folder | download | duplicates (2) 
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
 
<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE why3session PUBLIC "-//Why3//proof session v5//EN"
"https://www.why3.org/why3session.dtd">
<why3session shape_version="6">
<prover id="0" name="CVC4" version="1.7" timelimit="1" steplimit="0" memlimit="1000"/>
<prover id="2" name="Alt-Ergo" version="2.3.0" timelimit="1" steplimit="0" memlimit="1000"/>
<prover id="3" name="CVC4" version="1.5" timelimit="5" steplimit="0" memlimit="1000"/>
<prover id="4" name="Alt-Ergo" version="2.1.0" timelimit="5" steplimit="0" memlimit="1000"/>
<file format="whyml" proved="true">
<path name=".."/><path name="pairing_heap_bin.mlw"/>
<theory name="Heap" proved="true">
 <goal name="empty&#39;vc" expl="VC for empty" proved="true">
 <proof prover="2"><result status="valid" time="0.000000" steps="0"/></proof>
 </goal>
</theory>
<theory name="Size" proved="true">
 <goal name="size_nonneg&#39;vc" expl="VC for size_nonneg" proved="true">
 <proof prover="4"><result status="valid" time="0.000000" steps="40"/></proof>
 </goal>
 <goal name="size_empty" proved="true">
 <proof prover="4"><result status="valid" time="0.000000" steps="24"/></proof>
 </goal>
</theory>
<theory name="Occ" proved="true">
 <goal name="occ_nonneg&#39;vc" expl="VC for occ_nonneg" proved="true">
 <proof prover="3"><result status="valid" time="0.010000" steps="3571"/></proof>
 </goal>
</theory>
<theory name="PairingHeap" proved="true">
 <goal name="le_root_trans" proved="true">
 <proof prover="4"><result status="valid" time="0.000000" steps="36"/></proof>
 </goal>
 <goal name="le_root_tree_trans" proved="true">
 <transf name="induction_ty_lex" proved="true" >
  <goal name="le_root_tree_trans.0" proved="true">
  <proof prover="4"><result status="valid" time="0.010000" steps="68"/></proof>
  </goal>
 </transf>
 </goal>
 <goal name="mem_heap_tree&#39;vc" expl="VC for mem_heap_tree" proved="true">
 <proof prover="4"><result status="valid" time="0.030000" steps="304"/></proof>
 </goal>
 <goal name="mem_heap&#39;vc" expl="VC for mem_heap" proved="true">
 <proof prover="3"><result status="valid" time="0.040000" steps="8105"/></proof>
 </goal>
 <goal name="root_is_minimum" proved="true">
 <proof prover="4"><result status="valid" time="0.030000" steps="146"/></proof>
 </goal>
 <goal name="empty&#39;vc" expl="VC for empty" proved="true">
 <proof prover="3"><result status="valid" time="0.010000" steps="4832"/></proof>
 </goal>
 <goal name="is_empty&#39;vc" expl="VC for is_empty" proved="true">
 <proof prover="4"><result status="valid" time="0.000000" steps="57"/></proof>
 </goal>
 <goal name="size&#39;vc" expl="VC for size" proved="true">
 <proof prover="0"><result status="valid" time="0.050000" steps="3841"/></proof>
 <proof prover="4"><result status="valid" time="0.000000" steps="10"/></proof>
 </goal>
 <goal name="merge&#39;vc" expl="VC for merge" proved="true">
 <proof prover="0"><result status="valid" time="0.100000" steps="20654"/></proof>
 <proof prover="3"><result status="valid" time="0.060000" steps="17884"/></proof>
 </goal>
 <goal name="insert&#39;vc" expl="VC for insert" proved="true">
 <proof prover="0"><result status="valid" time="0.090000" steps="7616"/></proof>
 <proof prover="3"><result status="valid" time="0.030000" steps="8006"/></proof>
 </goal>
 <goal name="find_min&#39;vc" expl="VC for find_min" proved="true">
 <proof prover="0"><result status="valid" time="0.050000" steps="4600"/></proof>
 <proof prover="4"><result status="valid" time="0.000000" steps="60"/></proof>
 </goal>
 <goal name="merge_pairs&#39;vc" expl="VC for merge_pairs" proved="true">
 <proof prover="0"><result status="valid" time="0.340000" steps="54341"/></proof>
 <proof prover="3"><result status="valid" time="0.270000" steps="46598"/></proof>
 </goal>
 <goal name="delete_min&#39;vc" expl="VC for delete_min" proved="true">
 <proof prover="0"><result status="valid" time="0.080000" steps="7615"/></proof>
 <proof prover="4"><result status="valid" time="0.020000" steps="261"/></proof>
 </goal>
</theory>
</file>
</why3session>