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
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
open VCS
type pstats = {
tmin : float ;
tval : float ;
tmax : float ;
tnbr : float ;
time : float ;
success : float ;
}
type stats = {
best : VCS.verdict ;
provers : (VCS.prover * pstats) list ;
tactics : int ;
proved : int ;
timeout : int ;
unknown : int ;
noresult : int ;
failed : int ;
cached : int ;
cachemiss : int ;
}
module Plist = Qed.Listmap.Make
(struct
type t = VCS.prover
let equal a b = a==b || (VCS.cmp_prover a b = 0)
let compare = VCS.cmp_prover
end)
let pzero = {
tmin = max_float ;
tval = 0.0 ;
tmax = 0.0 ;
tnbr = 0.0 ;
time = 0.0 ;
success = 0.0 ;
}
let padd a b =
if a == pzero then b else
if b == pzero then a else
{
tmin = min a.tmin b.tmin ;
tmax = max a.tmax b.tmax ;
tval = a.tval +. b.tval ;
time = a.time +. b.time ;
tnbr = a.tnbr +. b.tnbr ;
success = a.success +. b.success ;
}
let pmerge = Plist.union (fun _ a b -> padd a b)
let ptime t valid =
{ tmin = t ; tval = t ; tmax = t ; time = t ; tnbr = 1.0 ;
success = if valid then 1.0 else 0.0 }
let psolver r = ptime r.solver_time false
let pqed r = if VCS.is_valid r then ptime r.solver_time true else pzero
let presult r = if VCS.is_valid r then ptime r.prover_time true else pzero
let qsmoked r = if VCS.is_valid r then ptime r.solver_time false else ptime 0.0 true
let psmoked r = if VCS.is_valid r then ptime r.prover_time false else ptime 0.0 true
let vsmoked v = if VCS.is_proved ~smoke:true v then VCS.Valid else VCS.Failed
let empty = {
best = NoResult;
provers = [];
tactics = 0;
proved = 0;
timeout = 0;
unknown = 0 ;
noresult = 0 ;
failed = 0 ;
cached = 0 ;
cachemiss = 0 ;
}
let cacheable p r = p <> Qed && not @@ VCS.is_trivial r
let add_cached n (p,r) = if cacheable p r && r.cached then succ n else n
let add_cachemiss n (p,r) = if cacheable p r && not r.cached then succ n else n
let results ~smoke results =
let (p,r) = VCS.best results in
let verdict = if smoke then vsmoked r.verdict else r.verdict in
let is v = if verdict == v then 1 else 0 in
let proved = is Valid in
let timeout = is Timeout + is Stepout in
let failed = is Failed in
let unknown = is Unknown in
let noresult = 1 - proved - timeout - failed - unknown in
{
best = r.verdict ; tactics = 0 ;
proved ; timeout ; unknown ; failed ; noresult ;
cached = List.fold_left add_cached 0 results ;
cachemiss = List.fold_left add_cachemiss 0 results ;
provers =
if p = Qed then [Qed,if smoke then qsmoked r else pqed r]
else
pmerge [Qed,psolver r] [p,if smoke then psmoked r else presult r] ;
}
let add a b =
if a == empty then b else
if b == empty then a else
{
best = VCS.conjunction a.best b.best ;
provers = pmerge a.provers b.provers ;
tactics = a.tactics + b.tactics ;
proved = a.proved + b.proved ;
timeout = a.timeout + b.timeout ;
unknown = a.unknown + b.unknown ;
noresult = a.noresult + b.noresult ;
failed = a.failed + b.failed ;
cached = a.cached + b.cached ;
cachemiss = a.cachemiss + b.cachemiss ;
}
let tactical ~qed children =
let valid = List.for_all (fun c -> c.best = Valid) children in
let qed_only = children = [] in
let best = if valid then Valid else Unknown in
let provers = [Qed,ptime qed qed_only] in
List.fold_left add { empty with best ; provers ; tactics = 1 } children
let script stats =
let cached = stats.cachemiss = 0 in
let solver = List.fold_left
(fun t (p,s) -> if p = Qed then t +. s.time else t) 0.0 stats.provers in
let time = List.fold_left
(fun t (p,s) -> if p <> Qed then t +. s.time else t) 0.0 stats.provers in
VCS.result ~cached ~solver ~time stats.best
let subgoals s = s.proved + s.timeout + s.unknown + s.noresult + s.failed
let complete s = s.proved = subgoals s
let pp_pstats fmt p =
if p.tnbr > 0.0 &&
p.tmin > Rformat.epsilon &&
not (Wp_parameters.has_dkey VCS.dkey_shell)
then
let mean = p.tval /. p.tnbr in
let epsilon = 0.05 *. mean in
let delta = p.tmax -. p.tmin in
if delta < epsilon then
Format.fprintf fmt " (%a)" Rformat.pp_time mean
else
let middle = (p.tmin +. p.tmax) *. 0.5 in
if abs_float (middle -. mean) < epsilon then
Format.fprintf fmt " (%a-%a)"
Rformat.pp_time p.tmin
Rformat.pp_time p.tmax
else
Format.fprintf fmt " (%a-%a-%a)"
Rformat.pp_time p.tmin
Rformat.pp_time mean
Rformat.pp_time p.tmax
let pp_stats ~shell ~cache fmt s =
let total = subgoals s in
if s.tactics > 1 then
Format.fprintf fmt " (Tactics %d)" s.tactics
else if s.tactics = 1 then
Format.fprintf fmt " (Tactic)" ;
let updating = Cache.is_updating cache in
let qed_only = match s.provers with [Qed,_] -> true | _ -> false in
let print_cache = not qed_only && Cache.is_active cache in
List.iter
(fun (p,pr) ->
let success = truncate pr.success in
let print_proofs = success > 0 && total > 1 in
let print_perfo =
pr.time > Rformat.epsilon &&
(not shell || (not updating && s.cachemiss > 0))
in
if p != Qed || qed_only || print_perfo || print_proofs
then
begin
let title = VCS.title_of_prover ~version:false p in
Format.fprintf fmt " (%s" title ;
if print_proofs then
Format.fprintf fmt " %d/%d" success total ;
if print_perfo then
Format.fprintf fmt " %a" Rformat.pp_time pr.time ;
Format.fprintf fmt ")"
end
) s.provers ;
if shell && s.cachemiss > 0 && not updating then
Format.fprintf fmt " (Cache miss %d)" s.cachemiss
else
if print_cache then
let cacheable = s.cachemiss + s.cached in
if cacheable = 0 then
if s.best = Valid then
Format.pp_print_string fmt " (Trivial)"
else
Format.pp_print_string fmt " (No Cache)"
else
if updating || s.cachemiss = 0 then
Format.pp_print_string fmt " (Cached)"
else
Format.fprintf fmt " (Cached %d/%d)" s.cached cacheable
let pretty = pp_stats ~shell:false ~cache:NoCache