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
|
<?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="Alt-Ergo" version="2.1.0" timelimit="5" steplimit="0" memlimit="1000"/>
<prover id="1" name="Alt-Ergo" version="2.4.1" timelimit="1" steplimit="0" memlimit="1000"/>
<prover id="2" name="Coq" version="8.19.2" timelimit="5" steplimit="0" memlimit="1000"/>
<prover id="3" name="Alt-Ergo" version="2.2.0" timelimit="5" steplimit="0" memlimit="1000"/>
<prover id="4" name="Spass" version="3.9" timelimit="1" steplimit="0" memlimit="1000"/>
<prover id="5" name="Eprover" version="2.0" timelimit="5" steplimit="0" memlimit="1000"/>
<prover id="7" name="CVC4" version="1.5" timelimit="1" steplimit="0" memlimit="1000"/>
<file format="whyml" proved="true">
<path name=".."/><path name="gcd.mlw"/>
<theory name="EuclideanAlgorithm" proved="true">
<goal name="euclid'vc" expl="VC for euclid" proved="true">
<transf name="split_goal_right" proved="true" >
<goal name="euclid'vc.0" expl="check modulo by zero" proved="true">
<proof prover="0"><result status="valid" time="0.010000" steps="0"/></proof>
</goal>
<goal name="euclid'vc.1" expl="variant decrease" proved="true">
<proof prover="0"><result status="valid" time="0.020000" steps="24"/></proof>
</goal>
<goal name="euclid'vc.2" expl="precondition" proved="true">
<proof prover="0"><result status="valid" time="0.000000" steps="8"/></proof>
</goal>
<goal name="euclid'vc.3" expl="postcondition" proved="true">
<proof prover="0"><result status="valid" time="0.030000" steps="29"/></proof>
</goal>
</transf>
</goal>
</theory>
<theory name="EuclideanAlgorithmIterative" proved="true">
<goal name="euclid'vc" expl="VC for euclid" proved="true">
<proof prover="5"><result status="valid" time="0.020000"/></proof>
</goal>
</theory>
<theory name="BinaryGcd" proved="true">
<goal name="even1" proved="true">
<proof prover="0"><result status="valid" time="0.010000" steps="26"/></proof>
</goal>
<goal name="odd1" proved="true">
<proof prover="0"><result status="valid" time="0.020000" steps="30"/></proof>
</goal>
<goal name="div_nonneg" proved="true">
<proof prover="0"><result status="valid" time="0.010000" steps="4"/></proof>
</goal>
<goal name="gcd_even_even" proved="true">
<proof prover="0"><result status="valid" time="0.010000" steps="12"/></proof>
</goal>
<goal name="gcd_even_odd" proved="true">
<proof prover="2"><path name="gcd_BinaryGcd_gcd_even_odd_2.v"/><result status="valid" time="0.280000"/></proof>
</goal>
<goal name="gcd_even_odd2" proved="true">
<proof prover="0"><result status="valid" time="0.740000" steps="103"/></proof>
</goal>
<goal name="odd_odd_div2" proved="true">
<proof prover="0"><result status="valid" time="0.010000" steps="12"/></proof>
</goal>
<goal name="gcd_odd_odd'vc" expl="VC for gcd_odd_odd" proved="true">
<proof prover="0"><result status="valid" time="0.120000" steps="59"/></proof>
</goal>
<goal name="gcd_odd_odd2" proved="true">
<proof prover="0"><result status="valid" time="0.970000" steps="104"/></proof>
</goal>
<goal name="binary_gcd'vc" expl="VC for binary_gcd" proved="true">
<transf name="split_goal_right" proved="true" >
<goal name="binary_gcd'vc.0" expl="variant decrease" proved="true">
<proof prover="0"><result status="valid" time="0.010000" steps="12"/></proof>
</goal>
<goal name="binary_gcd'vc.1" expl="precondition" proved="true">
<proof prover="0"><result status="valid" time="0.010000" steps="12"/></proof>
</goal>
<goal name="binary_gcd'vc.2" expl="precondition" proved="true">
<proof prover="0"><result status="valid" time="0.000000" steps="14"/></proof>
</goal>
<goal name="binary_gcd'vc.3" expl="precondition" proved="true">
<proof prover="0"><result status="valid" time="0.010000" steps="16"/></proof>
</goal>
<goal name="binary_gcd'vc.4" expl="check division by zero" proved="true">
<proof prover="0"><result status="valid" time="0.010000" steps="18"/></proof>
</goal>
<goal name="binary_gcd'vc.5" expl="check division by zero" proved="true">
<proof prover="0"><result status="valid" time="0.010000" steps="18"/></proof>
</goal>
<goal name="binary_gcd'vc.6" expl="variant decrease" proved="true">
<proof prover="0"><result status="valid" time="0.010000" steps="21"/></proof>
</goal>
<goal name="binary_gcd'vc.7" expl="precondition" proved="true">
<proof prover="0"><result status="valid" time="0.010000" steps="19"/></proof>
</goal>
<goal name="binary_gcd'vc.8" expl="check division by zero" proved="true">
<proof prover="0"><result status="valid" time="0.010000" steps="18"/></proof>
</goal>
<goal name="binary_gcd'vc.9" expl="variant decrease" proved="true">
<proof prover="0"><result status="valid" time="0.020000" steps="20"/></proof>
</goal>
<goal name="binary_gcd'vc.10" expl="precondition" proved="true">
<proof prover="0"><result status="valid" time="0.010000" steps="20"/></proof>
</goal>
<goal name="binary_gcd'vc.11" expl="precondition" proved="true">
<proof prover="0"><result status="valid" time="0.000000" steps="16"/></proof>
</goal>
<goal name="binary_gcd'vc.12" expl="check division by zero" proved="true">
<proof prover="0"><result status="valid" time="0.000000" steps="18"/></proof>
</goal>
<goal name="binary_gcd'vc.13" expl="variant decrease" proved="true">
<proof prover="0"><result status="valid" time="0.020000" steps="20"/></proof>
</goal>
<goal name="binary_gcd'vc.14" expl="precondition" proved="true">
<proof prover="0"><result status="valid" time="0.010000" steps="20"/></proof>
</goal>
<goal name="binary_gcd'vc.15" expl="check division by zero" proved="true">
<proof prover="0"><result status="valid" time="0.010000" steps="18"/></proof>
</goal>
<goal name="binary_gcd'vc.16" expl="variant decrease" proved="true">
<proof prover="0"><result status="valid" time="0.010000" steps="20"/></proof>
</goal>
<goal name="binary_gcd'vc.17" expl="precondition" proved="true">
<proof prover="0"><result status="valid" time="0.010000" steps="20"/></proof>
</goal>
<goal name="binary_gcd'vc.18" expl="postcondition" proved="true">
<transf name="split_vc" proved="true" >
<goal name="binary_gcd'vc.18.0" expl="postcondition" proved="true">
<proof prover="4"><result status="valid" time="0.010000"/></proof>
</goal>
<goal name="binary_gcd'vc.18.1" expl="postcondition" proved="true">
<proof prover="3"><result status="valid" time="0.040000" steps="18"/></proof>
</goal>
<goal name="binary_gcd'vc.18.2" expl="postcondition" proved="true">
<proof prover="1"><result status="valid" time="0.040000" steps="548"/></proof>
</goal>
<goal name="binary_gcd'vc.18.3" expl="postcondition" proved="true">
<proof prover="3"><result status="valid" time="1.440000" steps="109"/></proof>
</goal>
<goal name="binary_gcd'vc.18.4" expl="postcondition" proved="true">
<proof prover="5" timelimit="1"><result status="valid" time="0.700000"/></proof>
</goal>
<goal name="binary_gcd'vc.18.5" expl="postcondition" proved="true">
<proof prover="5"><result status="valid" time="0.740000"/></proof>
</goal>
</transf>
</goal>
</transf>
</goal>
</theory>
<theory name="EuclideanAlgorithm63" proved="true">
<goal name="euclid'vc" expl="VC for euclid" proved="true">
<proof prover="7"><result status="valid" time="0.090000" steps="20273"/></proof>
</goal>
</theory>
</file>
</why3session>
|
