author | blanchet |
Tue, 19 Nov 2013 18:34:04 +0100 | |
changeset 54503 | b490e15a5e19 |
parent 54141 | f57f8e7a879f |
child 54813 | c8b04da1bd01 |
permissions | -rw-r--r-- |
38988 | 1 |
(* Title: HOL/Tools/Sledgehammer/sledgehammer_minimize.ML |
31037
ac8669134e7a
added Philipp Meyer's implementation of AtpMinimal
immler@in.tum.de
parents:
diff
changeset
|
2 |
Author: Philipp Meyer, TU Muenchen |
36370
a4f601daa175
centralized ATP-specific error handling in "atp_wrapper.ML"
blanchet
parents:
36369
diff
changeset
|
3 |
Author: Jasmin Blanchette, TU Muenchen |
31037
ac8669134e7a
added Philipp Meyer's implementation of AtpMinimal
immler@in.tum.de
parents:
diff
changeset
|
4 |
|
40977 | 5 |
Minimization of fact list for Metis using external provers. |
31037
ac8669134e7a
added Philipp Meyer's implementation of AtpMinimal
immler@in.tum.de
parents:
diff
changeset
|
6 |
*) |
ac8669134e7a
added Philipp Meyer's implementation of AtpMinimal
immler@in.tum.de
parents:
diff
changeset
|
7 |
|
38988 | 8 |
signature SLEDGEHAMMER_MINIMIZE = |
32525 | 9 |
sig |
46340 | 10 |
type stature = ATP_Problem_Generate.stature |
52555 | 11 |
type play = Sledgehammer_Reconstructor.play |
48250
1065c307fafe
further ML structure split to permit finer-grained loading/reordering (problem to solve: MaSh needs most of Sledgehammer)
blanchet
parents:
48085
diff
changeset
|
12 |
type mode = Sledgehammer_Provers.mode |
41087
d7b5fd465198
split "Sledgehammer" module into two parts, to resolve forthcoming dependency problems
blanchet
parents:
40983
diff
changeset
|
13 |
type params = Sledgehammer_Provers.params |
48250
1065c307fafe
further ML structure split to permit finer-grained loading/reordering (problem to solve: MaSh needs most of Sledgehammer)
blanchet
parents:
48085
diff
changeset
|
14 |
type prover = Sledgehammer_Provers.prover |
35867 | 15 |
|
42646
4781fcd53572
replaced some Unsynchronized.refs with Config.Ts
blanchet
parents:
42579
diff
changeset
|
16 |
val binary_min_facts : int Config.T |
48250
1065c307fafe
further ML structure split to permit finer-grained loading/reordering (problem to solve: MaSh needs most of Sledgehammer)
blanchet
parents:
48085
diff
changeset
|
17 |
val auto_minimize_min_facts : int Config.T |
1065c307fafe
further ML structure split to permit finer-grained loading/reordering (problem to solve: MaSh needs most of Sledgehammer)
blanchet
parents:
48085
diff
changeset
|
18 |
val auto_minimize_max_time : real Config.T |
40061
71cc5aac8b76
generalization of the Sledgehammer minimizer, to make it possible to handle SMT solvers as well
blanchet
parents:
40060
diff
changeset
|
19 |
val minimize_facts : |
54503 | 20 |
(thm list -> unit) -> string -> params -> bool -> int -> int |
54130
b4e6cd4cab92
thread the goal through instead of relying on unreliable (possibly fake) state
blanchet
parents:
54127
diff
changeset
|
21 |
-> Proof.state -> thm -> play Lazy.lazy option |
51187
c344cf148e8f
avoid using "smt" for minimization -- better use the prover itself, since then Sledgehammer gets to try metis again and gives the opportunity to output an Isar proof -- and show Isar proof as fallback for SMT proofs
blanchet
parents:
51130
diff
changeset
|
22 |
-> ((string * stature) * thm list) list |
46340 | 23 |
-> ((string * stature) * thm list) list option |
50669
84c7cf36b2e0
use "Lazy" to simplify control flow a bit and guarantee single evaluation (at most)
blanchet
parents:
50668
diff
changeset
|
24 |
* (play Lazy.lazy * (play -> string) * string) |
54503 | 25 |
val get_minimizing_prover : Proof.context -> mode -> (thm list -> unit) -> string -> prover |
26 |
val run_minimize : params -> (thm list -> unit) -> int -> (Facts.ref * Attrib.src list) list -> |
|
27 |
Proof.state -> unit |
|
35866
513074557e06
move the Sledgehammer Isar commands together into one file;
blanchet
parents:
35865
diff
changeset
|
28 |
end; |
32525 | 29 |
|
38988 | 30 |
structure Sledgehammer_Minimize : SLEDGEHAMMER_MINIMIZE = |
31037
ac8669134e7a
added Philipp Meyer's implementation of AtpMinimal
immler@in.tum.de
parents:
diff
changeset
|
31 |
struct |
ac8669134e7a
added Philipp Meyer's implementation of AtpMinimal
immler@in.tum.de
parents:
diff
changeset
|
32 |
|
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
33 |
open ATP_Util |
39496
a52a4e4399c1
got caught once again by SML's pattern maching (ctor vs. var)
blanchet
parents:
39491
diff
changeset
|
34 |
open ATP_Proof |
46320 | 35 |
open ATP_Problem_Generate |
51200
260cb10aac4b
minimize SMT proofs with E if Isar proofs are desired and Metis managed to preplay
blanchet
parents:
51191
diff
changeset
|
36 |
open ATP_Systems |
36142
f5e15e9aae10
make Sledgehammer "minimize" output less confusing + round up (not down) time limits to nearest second
blanchet
parents:
36063
diff
changeset
|
37 |
open Sledgehammer_Util |
48250
1065c307fafe
further ML structure split to permit finer-grained loading/reordering (problem to solve: MaSh needs most of Sledgehammer)
blanchet
parents:
48085
diff
changeset
|
38 |
open Sledgehammer_Fact |
52555 | 39 |
open Sledgehammer_Reconstructor |
49914 | 40 |
open Sledgehammer_Reconstruct |
41087
d7b5fd465198
split "Sledgehammer" module into two parts, to resolve forthcoming dependency problems
blanchet
parents:
40983
diff
changeset
|
41 |
open Sledgehammer_Provers |
35866
513074557e06
move the Sledgehammer Isar commands together into one file;
blanchet
parents:
35865
diff
changeset
|
42 |
|
36370
a4f601daa175
centralized ATP-specific error handling in "atp_wrapper.ML"
blanchet
parents:
36369
diff
changeset
|
43 |
(* wrapper for calling external prover *) |
31236 | 44 |
|
40061
71cc5aac8b76
generalization of the Sledgehammer minimizer, to make it possible to handle SMT solvers as well
blanchet
parents:
40060
diff
changeset
|
45 |
fun n_facts names = |
38698
d19c3a7ce38b
clean handling of whether a fact is chained or not;
blanchet
parents:
38696
diff
changeset
|
46 |
let val n = length names in |
40061
71cc5aac8b76
generalization of the Sledgehammer minimizer, to make it possible to handle SMT solvers as well
blanchet
parents:
40060
diff
changeset
|
47 |
string_of_int n ^ " fact" ^ plural_s n ^ |
38092
81a003f7de0d
speed up the minimizer by using the time taken for the first iteration as a timeout for the following iterations, and fix a subtle bug in "string_for_failure"
blanchet
parents:
38084
diff
changeset
|
48 |
(if n > 0 then |
48085
ff5e900d7b1a
avoid dumping definitions several times in LEO-II proofs
blanchet
parents:
47531
diff
changeset
|
49 |
": " ^ (names |> map fst |> sort string_ord |> space_implode " ") |
38092
81a003f7de0d
speed up the minimizer by using the time taken for the first iteration as a timeout for the following iterations, and fix a subtle bug in "string_for_failure"
blanchet
parents:
38084
diff
changeset
|
50 |
else |
81a003f7de0d
speed up the minimizer by using the time taken for the first iteration as a timeout for the following iterations, and fix a subtle bug in "string_for_failure"
blanchet
parents:
38084
diff
changeset
|
51 |
"") |
81a003f7de0d
speed up the minimizer by using the time taken for the first iteration as a timeout for the following iterations, and fix a subtle bug in "string_for_failure"
blanchet
parents:
38084
diff
changeset
|
52 |
end |
81a003f7de0d
speed up the minimizer by using the time taken for the first iteration as a timeout for the following iterations, and fix a subtle bug in "string_for_failure"
blanchet
parents:
38084
diff
changeset
|
53 |
|
41091
0afdf5cde874
implicitly call the minimizer for SMT solvers that don't return an unsat core
blanchet
parents:
41090
diff
changeset
|
54 |
fun print silent f = if silent then () else Output.urgent_message (f ()) |
0afdf5cde874
implicitly call the minimizer for SMT solvers that don't return an unsat core
blanchet
parents:
41090
diff
changeset
|
55 |
|
53800 | 56 |
fun test_facts ({debug, verbose, overlord, spy, provers, max_mono_iters, |
46301 | 57 |
max_new_mono_instances, type_enc, strict, lam_trans, |
53764 | 58 |
uncurried_aliases, isar_proofs, isar_compress, isar_try0, |
59 |
preplay_timeout, ...} : params) |
|
54130
b4e6cd4cab92
thread the goal through instead of relying on unreliable (possibly fake) state
blanchet
parents:
54127
diff
changeset
|
60 |
silent (prover : prover) timeout i n state goal facts = |
31236 | 61 |
let |
41277
1369c27c6966
reduce the minimizer slack and add verbose information
blanchet
parents:
41267
diff
changeset
|
62 |
val _ = |
1369c27c6966
reduce the minimizer slack and add verbose information
blanchet
parents:
41267
diff
changeset
|
63 |
print silent (fn () => |
1369c27c6966
reduce the minimizer slack and add verbose information
blanchet
parents:
41267
diff
changeset
|
64 |
"Testing " ^ n_facts (map fst facts) ^ |
50557 | 65 |
(if verbose then |
66 |
case timeout of |
|
52031
9a9238342963
tuning -- renamed '_from_' to '_of_' in Sledgehammer
blanchet
parents:
51998
diff
changeset
|
67 |
SOME timeout => " (timeout: " ^ string_of_time timeout ^ ")" |
50557 | 68 |
| _ => "" |
69 |
else |
|
70 |
"") ^ "...") |
|
51005
ce4290c33d73
eliminated needless speed optimization -- and simplified code quite a bit
blanchet
parents:
50669
diff
changeset
|
71 |
val facts = facts |> maps (fn (n, ths) => map (pair n) ths) |
38100
e458a0dd3dc1
use "explicit_apply" in the minimizer whenever it might make a difference to prevent freak failures;
blanchet
parents:
38094
diff
changeset
|
72 |
val params = |
53800 | 73 |
{debug = debug, verbose = verbose, overlord = overlord, spy = spy, blocking = true, |
74 |
provers = provers, type_enc = type_enc, strict = strict, lam_trans = lam_trans, |
|
75 |
uncurried_aliases = uncurried_aliases, learn = false, fact_filter = NONE, |
|
76 |
max_facts = SOME (length facts), fact_thresholds = (1.01, 1.01), |
|
77 |
max_mono_iters = max_mono_iters, max_new_mono_instances = max_new_mono_instances, |
|
78 |
isar_proofs = isar_proofs, isar_compress = isar_compress, isar_try0 = isar_try0, |
|
79 |
slice = false, minimize = SOME false, timeout = timeout, preplay_timeout = preplay_timeout, |
|
80 |
expect = ""} |
|
40065 | 81 |
val problem = |
54141
f57f8e7a879f
generate a comment storing the goal nickname in "learn_prover"
blanchet
parents:
54130
diff
changeset
|
82 |
{comment = "", state = state, goal = goal, subgoal = i, subgoal_count = n, |
f57f8e7a879f
generate a comment storing the goal nickname in "learn_prover"
blanchet
parents:
54130
diff
changeset
|
83 |
factss = [("", facts)]} |
45370
bab52dafa63a
use "Time.time" rather than milliseconds internally
blanchet
parents:
45369
diff
changeset
|
84 |
val result as {outcome, used_facts, run_time, ...} = |
45520 | 85 |
prover params (K (K (K ""))) problem |
36223
217ca1273786
make Sledgehammer's minimizer also minimize Isar proofs
blanchet
parents:
36143
diff
changeset
|
86 |
in |
43259
30c141dc22d6
killed "explicit_apply" option in Sledgehammer -- the "smart" default is about as lightweight as "false" and just as complete as "true"
blanchet
parents:
43166
diff
changeset
|
87 |
print silent |
30c141dc22d6
killed "explicit_apply" option in Sledgehammer -- the "smart" default is about as lightweight as "false" and just as complete as "true"
blanchet
parents:
43166
diff
changeset
|
88 |
(fn () => |
30c141dc22d6
killed "explicit_apply" option in Sledgehammer -- the "smart" default is about as lightweight as "false" and just as complete as "true"
blanchet
parents:
43166
diff
changeset
|
89 |
case outcome of |
53586
bd5fa6425993
prefixed types and some functions with "atp_" for disambiguation
blanchet
parents:
52632
diff
changeset
|
90 |
SOME failure => string_of_atp_failure failure |
43259
30c141dc22d6
killed "explicit_apply" option in Sledgehammer -- the "smart" default is about as lightweight as "false" and just as complete as "true"
blanchet
parents:
43166
diff
changeset
|
91 |
| NONE => |
30c141dc22d6
killed "explicit_apply" option in Sledgehammer -- the "smart" default is about as lightweight as "false" and just as complete as "true"
blanchet
parents:
43166
diff
changeset
|
92 |
"Found proof" ^ |
30c141dc22d6
killed "explicit_apply" option in Sledgehammer -- the "smart" default is about as lightweight as "false" and just as complete as "true"
blanchet
parents:
43166
diff
changeset
|
93 |
(if length used_facts = length facts then "" |
45370
bab52dafa63a
use "Time.time" rather than milliseconds internally
blanchet
parents:
45369
diff
changeset
|
94 |
else " with " ^ n_facts used_facts) ^ |
52031
9a9238342963
tuning -- renamed '_from_' to '_of_' in Sledgehammer
blanchet
parents:
51998
diff
changeset
|
95 |
" (" ^ string_of_time run_time ^ ")."); |
38092
81a003f7de0d
speed up the minimizer by using the time taken for the first iteration as a timeout for the following iterations, and fix a subtle bug in "string_for_failure"
blanchet
parents:
38084
diff
changeset
|
96 |
result |
36223
217ca1273786
make Sledgehammer's minimizer also minimize Isar proofs
blanchet
parents:
36143
diff
changeset
|
97 |
end |
31236 | 98 |
|
40204
da97d75e20e6
standardize on "fact" terminology (vs. "axiom" or "theorem") in Sledgehammer -- but keep "Axiom" in the lower-level "ATP_Problem" module
blanchet
parents:
40200
diff
changeset
|
99 |
(* minimalization of facts *) |
31236 | 100 |
|
45372 | 101 |
(* Give the external prover some slack. The ATP gets further slack because the |
102 |
Sledgehammer preprocessing time is included in the estimate below but isn't |
|
103 |
part of the timeout. *) |
|
104 |
val slack_msecs = 200 |
|
105 |
||
50557 | 106 |
fun new_timeout NONE _ = NONE |
107 |
| new_timeout (SOME timeout) run_time = |
|
108 |
Int.min (Time.toMilliseconds timeout, |
|
109 |
Time.toMilliseconds run_time + slack_msecs) |
|
110 |
|> Time.fromMilliseconds |> SOME |
|
45372 | 111 |
|
45367 | 112 |
(* The linear algorithm usually outperforms the binary algorithm when over 60% |
113 |
of the facts are actually needed. The binary algorithm is much more |
|
114 |
appropriate for provers that cannot return the list of used facts and hence |
|
115 |
returns all facts as used. Since we cannot know in advance how many facts are |
|
116 |
actually needed, we heuristically set the threshold to 10 facts. *) |
|
42646
4781fcd53572
replaced some Unsynchronized.refs with Config.Ts
blanchet
parents:
42579
diff
changeset
|
117 |
val binary_min_facts = |
4781fcd53572
replaced some Unsynchronized.refs with Config.Ts
blanchet
parents:
42579
diff
changeset
|
118 |
Attrib.setup_config_int @{binding sledgehammer_minimize_binary_min_facts} |
45368 | 119 |
(K 20) |
48250
1065c307fafe
further ML structure split to permit finer-grained loading/reordering (problem to solve: MaSh needs most of Sledgehammer)
blanchet
parents:
48085
diff
changeset
|
120 |
val auto_minimize_min_facts = |
1065c307fafe
further ML structure split to permit finer-grained loading/reordering (problem to solve: MaSh needs most of Sledgehammer)
blanchet
parents:
48085
diff
changeset
|
121 |
Attrib.setup_config_int @{binding sledgehammer_auto_minimize_min_facts} |
1065c307fafe
further ML structure split to permit finer-grained loading/reordering (problem to solve: MaSh needs most of Sledgehammer)
blanchet
parents:
48085
diff
changeset
|
122 |
(fn generic => Config.get_generic generic binary_min_facts) |
1065c307fafe
further ML structure split to permit finer-grained loading/reordering (problem to solve: MaSh needs most of Sledgehammer)
blanchet
parents:
48085
diff
changeset
|
123 |
val auto_minimize_max_time = |
1065c307fafe
further ML structure split to permit finer-grained loading/reordering (problem to solve: MaSh needs most of Sledgehammer)
blanchet
parents:
48085
diff
changeset
|
124 |
Attrib.setup_config_real @{binding sledgehammer_auto_minimize_max_time} |
1065c307fafe
further ML structure split to permit finer-grained loading/reordering (problem to solve: MaSh needs most of Sledgehammer)
blanchet
parents:
48085
diff
changeset
|
125 |
(K 5.0) |
40977 | 126 |
|
45368 | 127 |
fun linear_minimize test timeout result xs = |
128 |
let |
|
129 |
fun min _ [] p = p |
|
130 |
| min timeout (x :: xs) (seen, result) = |
|
131 |
case test timeout (xs @ seen) of |
|
45372 | 132 |
result as {outcome = NONE, used_facts, run_time, ...} |
133 |
: prover_result => |
|
48798 | 134 |
min (new_timeout timeout run_time) |
135 |
(filter_used_facts true used_facts xs) |
|
136 |
(filter_used_facts false used_facts seen, result) |
|
45368 | 137 |
| _ => min timeout xs (x :: seen, result) |
48799 | 138 |
in min timeout xs ([], result) end |
38015 | 139 |
|
45368 | 140 |
fun binary_minimize test timeout result xs = |
40977 | 141 |
let |
45372 | 142 |
fun min depth (result as {run_time, ...} : prover_result) sup |
143 |
(xs as _ :: _ :: _) = |
|
41743 | 144 |
let |
45367 | 145 |
val (l0, r0) = chop (length xs div 2) xs |
41743 | 146 |
(* |
45366
4339763edd55
speed up binary minimizer in practice by preferring the first half of the used facts (which are likelier to be relevant) to the second half
blanchet
parents:
44463
diff
changeset
|
147 |
val _ = warning (replicate_string depth " " ^ "{ " ^ |
4339763edd55
speed up binary minimizer in practice by preferring the first half of the used facts (which are likelier to be relevant) to the second half
blanchet
parents:
44463
diff
changeset
|
148 |
"sup: " ^ n_facts (map fst sup)) |
4339763edd55
speed up binary minimizer in practice by preferring the first half of the used facts (which are likelier to be relevant) to the second half
blanchet
parents:
44463
diff
changeset
|
149 |
val _ = warning (replicate_string depth " " ^ " " ^ |
4339763edd55
speed up binary minimizer in practice by preferring the first half of the used facts (which are likelier to be relevant) to the second half
blanchet
parents:
44463
diff
changeset
|
150 |
"xs: " ^ n_facts (map fst xs)) |
4339763edd55
speed up binary minimizer in practice by preferring the first half of the used facts (which are likelier to be relevant) to the second half
blanchet
parents:
44463
diff
changeset
|
151 |
val _ = warning (replicate_string depth " " ^ " " ^ |
4339763edd55
speed up binary minimizer in practice by preferring the first half of the used facts (which are likelier to be relevant) to the second half
blanchet
parents:
44463
diff
changeset
|
152 |
"l0: " ^ n_facts (map fst l0)) |
4339763edd55
speed up binary minimizer in practice by preferring the first half of the used facts (which are likelier to be relevant) to the second half
blanchet
parents:
44463
diff
changeset
|
153 |
val _ = warning (replicate_string depth " " ^ " " ^ |
4339763edd55
speed up binary minimizer in practice by preferring the first half of the used facts (which are likelier to be relevant) to the second half
blanchet
parents:
44463
diff
changeset
|
154 |
"r0: " ^ n_facts (map fst r0)) |
41743 | 155 |
*) |
45367 | 156 |
val depth = depth + 1 |
45372 | 157 |
val timeout = new_timeout timeout run_time |
41743 | 158 |
in |
45368 | 159 |
case test timeout (sup @ l0) of |
45372 | 160 |
result as {outcome = NONE, used_facts, ...} => |
48798 | 161 |
min depth result (filter_used_facts true used_facts sup) |
162 |
(filter_used_facts true used_facts l0) |
|
45367 | 163 |
| _ => |
45368 | 164 |
case test timeout (sup @ r0) of |
45367 | 165 |
result as {outcome = NONE, used_facts, ...} => |
48798 | 166 |
min depth result (filter_used_facts true used_facts sup) |
167 |
(filter_used_facts true used_facts r0) |
|
45367 | 168 |
| _ => |
169 |
let |
|
170 |
val (sup_r0, (l, result)) = min depth result (sup @ r0) l0 |
|
171 |
val (sup, r0) = |
|
48798 | 172 |
(sup, r0) |
173 |
|> pairself (filter_used_facts true (map fst sup_r0)) |
|
45367 | 174 |
val (sup_l, (r, result)) = min depth result (sup @ l) r0 |
48798 | 175 |
val sup = sup |> filter_used_facts true (map fst sup_l) |
45367 | 176 |
in (sup, (l @ r, result)) end |
40977 | 177 |
end |
41743 | 178 |
(* |
179 |
|> tap (fn _ => warning (replicate_string depth " " ^ "}")) |
|
180 |
*) |
|
45367 | 181 |
| min _ result sup xs = (sup, (xs, result)) |
182 |
in |
|
183 |
case snd (min 0 result [] xs) of |
|
45372 | 184 |
([x], result as {run_time, ...}) => |
185 |
(case test (new_timeout timeout run_time) [] of |
|
45367 | 186 |
result as {outcome = NONE, ...} => ([], result) |
187 |
| _ => ([x], result)) |
|
188 |
| p => p |
|
189 |
end |
|
40977 | 190 |
|
48321 | 191 |
fun minimize_facts do_learn prover_name (params as {learn, timeout, ...}) silent |
54130
b4e6cd4cab92
thread the goal through instead of relying on unreliable (possibly fake) state
blanchet
parents:
54127
diff
changeset
|
192 |
i n state goal preplay0 facts = |
31236 | 193 |
let |
40941
a3e6f8634a11
replace "smt" prover with specific SMT solvers, e.g. "z3" -- whatever the SMT module gives us
blanchet
parents:
40553
diff
changeset
|
194 |
val ctxt = Proof.context_of state |
45574 | 195 |
val prover = |
196 |
get_prover ctxt (if silent then Auto_Minimize else Minimize) prover_name |
|
54130
b4e6cd4cab92
thread the goal through instead of relying on unreliable (possibly fake) state
blanchet
parents:
54127
diff
changeset
|
197 |
fun test timeout = test_facts params silent prover timeout i n state goal |
48796
0f94b8b69e79
consider removing chained facts last, so that they're more likely to be kept
blanchet
parents:
48399
diff
changeset
|
198 |
val (chained, non_chained) = List.partition is_fact_chained facts |
48799 | 199 |
(* Push chained facts to the back, so that they are less likely to be |
200 |
kicked out by the linear minimization algorithm. *) |
|
48796
0f94b8b69e79
consider removing chained facts last, so that they're more likely to be kept
blanchet
parents:
48399
diff
changeset
|
201 |
val facts = non_chained @ chained |
31236 | 202 |
in |
48796
0f94b8b69e79
consider removing chained facts last, so that they're more likely to be kept
blanchet
parents:
48399
diff
changeset
|
203 |
(print silent (fn () => "Sledgehammer minimizer: " ^ |
0f94b8b69e79
consider removing chained facts last, so that they're more likely to be kept
blanchet
parents:
48399
diff
changeset
|
204 |
quote prover_name ^ "."); |
0f94b8b69e79
consider removing chained facts last, so that they're more likely to be kept
blanchet
parents:
48399
diff
changeset
|
205 |
case test timeout facts of |
45371 | 206 |
result as {outcome = NONE, used_facts, run_time, ...} => |
38015 | 207 |
let |
48798 | 208 |
val facts = filter_used_facts true used_facts facts |
45372 | 209 |
val min = |
42646
4781fcd53572
replaced some Unsynchronized.refs with Config.Ts
blanchet
parents:
42579
diff
changeset
|
210 |
if length facts >= Config.get ctxt binary_min_facts then |
45368 | 211 |
binary_minimize |
40977 | 212 |
else |
45368 | 213 |
linear_minimize |
214 |
val (min_facts, {preplay, message, message_tail, ...}) = |
|
45371 | 215 |
min test (new_timeout timeout run_time) result facts |
48321 | 216 |
in |
217 |
print silent (fn () => cat_lines |
|
218 |
["Minimized to " ^ n_facts (map fst min_facts)] ^ |
|
48796
0f94b8b69e79
consider removing chained facts last, so that they're more likely to be kept
blanchet
parents:
48399
diff
changeset
|
219 |
(case min_facts |> filter is_fact_chained |> length of |
48321 | 220 |
0 => "" |
221 |
| n => "\n(including " ^ string_of_int n ^ " chained)") ^ "."); |
|
54503 | 222 |
(if learn then do_learn (maps snd min_facts) else ()); |
51187
c344cf148e8f
avoid using "smt" for minimization -- better use the prover itself, since then Sledgehammer gets to try metis again and gives the opportunity to output an Isar proof -- and show Isar proof as fallback for SMT proofs
blanchet
parents:
51130
diff
changeset
|
223 |
(SOME min_facts, |
c344cf148e8f
avoid using "smt" for minimization -- better use the prover itself, since then Sledgehammer gets to try metis again and gives the opportunity to output an Isar proof -- and show Isar proof as fallback for SMT proofs
blanchet
parents:
51130
diff
changeset
|
224 |
(if is_some preplay0 andalso length min_facts = length facts then |
c344cf148e8f
avoid using "smt" for minimization -- better use the prover itself, since then Sledgehammer gets to try metis again and gives the opportunity to output an Isar proof -- and show Isar proof as fallback for SMT proofs
blanchet
parents:
51130
diff
changeset
|
225 |
the preplay0 |
c344cf148e8f
avoid using "smt" for minimization -- better use the prover itself, since then Sledgehammer gets to try metis again and gives the opportunity to output an Isar proof -- and show Isar proof as fallback for SMT proofs
blanchet
parents:
51130
diff
changeset
|
226 |
else |
c344cf148e8f
avoid using "smt" for minimization -- better use the prover itself, since then Sledgehammer gets to try metis again and gives the opportunity to output an Isar proof -- and show Isar proof as fallback for SMT proofs
blanchet
parents:
51130
diff
changeset
|
227 |
preplay, |
c344cf148e8f
avoid using "smt" for minimization -- better use the prover itself, since then Sledgehammer gets to try metis again and gives the opportunity to output an Isar proof -- and show Isar proof as fallback for SMT proofs
blanchet
parents:
51130
diff
changeset
|
228 |
message, message_tail)) |
48321 | 229 |
end |
43052
8d6a4978cc65
automatically minimize with Metis when this can be done within a few seconds
blanchet
parents:
43051
diff
changeset
|
230 |
| {outcome = SOME TimedOut, preplay, ...} => |
8d6a4978cc65
automatically minimize with Metis when this can be done within a few seconds
blanchet
parents:
43051
diff
changeset
|
231 |
(NONE, |
8d6a4978cc65
automatically minimize with Metis when this can be done within a few seconds
blanchet
parents:
43051
diff
changeset
|
232 |
(preplay, |
50557 | 233 |
fn _ => |
234 |
"Timeout: You can increase the time limit using the \"timeout\" \ |
|
235 |
\option (e.g., \"timeout = " ^ |
|
236 |
string_of_int (10 + Time.toMilliseconds |
|
237 |
(timeout |> the_default (seconds 60.0)) div 1000) ^ |
|
238 |
"\").", "")) |
|
43052
8d6a4978cc65
automatically minimize with Metis when this can be done within a few seconds
blanchet
parents:
43051
diff
changeset
|
239 |
| {preplay, message, ...} => |
43261
a4aeb26a6362
make sure that the message tail (timing + TPTP important message) is preserved upon automatic minimization
blanchet
parents:
43259
diff
changeset
|
240 |
(NONE, (preplay, prefix "Prover error: " o message, ""))) |
43166 | 241 |
handle ERROR msg => |
50669
84c7cf36b2e0
use "Lazy" to simplify control flow a bit and guarantee single evaluation (at most)
blanchet
parents:
50668
diff
changeset
|
242 |
(NONE, (Lazy.value (Failed_to_Play plain_metis), |
84c7cf36b2e0
use "Lazy" to simplify control flow a bit and guarantee single evaluation (at most)
blanchet
parents:
50668
diff
changeset
|
243 |
fn _ => "Error: " ^ msg, "")) |
31236 | 244 |
end |
245 |
||
48250
1065c307fafe
further ML structure split to permit finer-grained loading/reordering (problem to solve: MaSh needs most of Sledgehammer)
blanchet
parents:
48085
diff
changeset
|
246 |
fun adjust_reconstructor_params override_params |
53800 | 247 |
({debug, verbose, overlord, spy, blocking, provers, type_enc, strict, |
48321 | 248 |
lam_trans, uncurried_aliases, learn, fact_filter, max_facts, |
49918
cf441f4a358b
renamed Isar-proof related options + changed semantics of Isar shrinking
blanchet
parents:
49914
diff
changeset
|
249 |
fact_thresholds, max_mono_iters, max_new_mono_instances, isar_proofs, |
53764 | 250 |
isar_compress, isar_try0, slice, minimize, timeout, preplay_timeout, |
251 |
expect} : params) = |
|
48250
1065c307fafe
further ML structure split to permit finer-grained loading/reordering (problem to solve: MaSh needs most of Sledgehammer)
blanchet
parents:
48085
diff
changeset
|
252 |
let |
1065c307fafe
further ML structure split to permit finer-grained loading/reordering (problem to solve: MaSh needs most of Sledgehammer)
blanchet
parents:
48085
diff
changeset
|
253 |
fun lookup_override name default_value = |
1065c307fafe
further ML structure split to permit finer-grained loading/reordering (problem to solve: MaSh needs most of Sledgehammer)
blanchet
parents:
48085
diff
changeset
|
254 |
case AList.lookup (op =) override_params name of |
1065c307fafe
further ML structure split to permit finer-grained loading/reordering (problem to solve: MaSh needs most of Sledgehammer)
blanchet
parents:
48085
diff
changeset
|
255 |
SOME [s] => SOME s |
1065c307fafe
further ML structure split to permit finer-grained loading/reordering (problem to solve: MaSh needs most of Sledgehammer)
blanchet
parents:
48085
diff
changeset
|
256 |
| _ => default_value |
1065c307fafe
further ML structure split to permit finer-grained loading/reordering (problem to solve: MaSh needs most of Sledgehammer)
blanchet
parents:
48085
diff
changeset
|
257 |
(* Only those options that reconstructors are interested in are considered |
1065c307fafe
further ML structure split to permit finer-grained loading/reordering (problem to solve: MaSh needs most of Sledgehammer)
blanchet
parents:
48085
diff
changeset
|
258 |
here. *) |
1065c307fafe
further ML structure split to permit finer-grained loading/reordering (problem to solve: MaSh needs most of Sledgehammer)
blanchet
parents:
48085
diff
changeset
|
259 |
val type_enc = lookup_override "type_enc" type_enc |
1065c307fafe
further ML structure split to permit finer-grained loading/reordering (problem to solve: MaSh needs most of Sledgehammer)
blanchet
parents:
48085
diff
changeset
|
260 |
val lam_trans = lookup_override "lam_trans" lam_trans |
1065c307fafe
further ML structure split to permit finer-grained loading/reordering (problem to solve: MaSh needs most of Sledgehammer)
blanchet
parents:
48085
diff
changeset
|
261 |
in |
53800 | 262 |
{debug = debug, verbose = verbose, overlord = overlord, spy = spy, blocking = blocking, |
263 |
provers = provers, type_enc = type_enc, strict = strict, lam_trans = lam_trans, |
|
264 |
uncurried_aliases = uncurried_aliases, learn = learn, fact_filter = fact_filter, |
|
265 |
max_facts = max_facts, fact_thresholds = fact_thresholds, max_mono_iters = max_mono_iters, |
|
49918
cf441f4a358b
renamed Isar-proof related options + changed semantics of Isar shrinking
blanchet
parents:
49914
diff
changeset
|
266 |
max_new_mono_instances = max_new_mono_instances, isar_proofs = isar_proofs, |
53800 | 267 |
isar_compress = isar_compress, isar_try0 = isar_try0, slice = slice, minimize = minimize, |
268 |
timeout = timeout, preplay_timeout = preplay_timeout, expect = expect} |
|
48250
1065c307fafe
further ML structure split to permit finer-grained loading/reordering (problem to solve: MaSh needs most of Sledgehammer)
blanchet
parents:
48085
diff
changeset
|
269 |
end |
1065c307fafe
further ML structure split to permit finer-grained loading/reordering (problem to solve: MaSh needs most of Sledgehammer)
blanchet
parents:
48085
diff
changeset
|
270 |
|
48384
83dc102041e6
learn on explicit "min" command but do the learning in a thread, since it may take a couple of seconds
blanchet
parents:
48321
diff
changeset
|
271 |
fun maybe_minimize ctxt mode do_learn name |
49918
cf441f4a358b
renamed Isar-proof related options + changed semantics of Isar shrinking
blanchet
parents:
49914
diff
changeset
|
272 |
(params as {verbose, isar_proofs, minimize, ...}) |
54130
b4e6cd4cab92
thread the goal through instead of relying on unreliable (possibly fake) state
blanchet
parents:
54127
diff
changeset
|
273 |
({state, goal, subgoal, subgoal_count, ...} : prover_problem) |
51009
e8ff34a1fa9a
thread through fact triple component from which used facts come, for accurate index output
blanchet
parents:
51007
diff
changeset
|
274 |
(result as {outcome, used_facts, used_from, run_time, preplay, message, |
48384
83dc102041e6
learn on explicit "min" command but do the learning in a thread, since it may take a couple of seconds
blanchet
parents:
48321
diff
changeset
|
275 |
message_tail} : prover_result) = |
48250
1065c307fafe
further ML structure split to permit finer-grained loading/reordering (problem to solve: MaSh needs most of Sledgehammer)
blanchet
parents:
48085
diff
changeset
|
276 |
if is_some outcome orelse null used_facts then |
1065c307fafe
further ML structure split to permit finer-grained loading/reordering (problem to solve: MaSh needs most of Sledgehammer)
blanchet
parents:
48085
diff
changeset
|
277 |
result |
1065c307fafe
further ML structure split to permit finer-grained loading/reordering (problem to solve: MaSh needs most of Sledgehammer)
blanchet
parents:
48085
diff
changeset
|
278 |
else |
1065c307fafe
further ML structure split to permit finer-grained loading/reordering (problem to solve: MaSh needs most of Sledgehammer)
blanchet
parents:
48085
diff
changeset
|
279 |
let |
1065c307fafe
further ML structure split to permit finer-grained loading/reordering (problem to solve: MaSh needs most of Sledgehammer)
blanchet
parents:
48085
diff
changeset
|
280 |
val num_facts = length used_facts |
1065c307fafe
further ML structure split to permit finer-grained loading/reordering (problem to solve: MaSh needs most of Sledgehammer)
blanchet
parents:
48085
diff
changeset
|
281 |
val ((perhaps_minimize, (minimize_name, params)), preplay) = |
1065c307fafe
further ML structure split to permit finer-grained loading/reordering (problem to solve: MaSh needs most of Sledgehammer)
blanchet
parents:
48085
diff
changeset
|
282 |
if mode = Normal then |
1065c307fafe
further ML structure split to permit finer-grained loading/reordering (problem to solve: MaSh needs most of Sledgehammer)
blanchet
parents:
48085
diff
changeset
|
283 |
if num_facts >= Config.get ctxt auto_minimize_min_facts then |
1065c307fafe
further ML structure split to permit finer-grained loading/reordering (problem to solve: MaSh needs most of Sledgehammer)
blanchet
parents:
48085
diff
changeset
|
284 |
((true, (name, params)), preplay) |
1065c307fafe
further ML structure split to permit finer-grained loading/reordering (problem to solve: MaSh needs most of Sledgehammer)
blanchet
parents:
48085
diff
changeset
|
285 |
else |
1065c307fafe
further ML structure split to permit finer-grained loading/reordering (problem to solve: MaSh needs most of Sledgehammer)
blanchet
parents:
48085
diff
changeset
|
286 |
let |
1065c307fafe
further ML structure split to permit finer-grained loading/reordering (problem to solve: MaSh needs most of Sledgehammer)
blanchet
parents:
48085
diff
changeset
|
287 |
fun can_min_fast_enough time = |
1065c307fafe
further ML structure split to permit finer-grained loading/reordering (problem to solve: MaSh needs most of Sledgehammer)
blanchet
parents:
48085
diff
changeset
|
288 |
0.001 |
1065c307fafe
further ML structure split to permit finer-grained loading/reordering (problem to solve: MaSh needs most of Sledgehammer)
blanchet
parents:
48085
diff
changeset
|
289 |
* Real.fromInt ((num_facts + 1) * Time.toMilliseconds time) |
1065c307fafe
further ML structure split to permit finer-grained loading/reordering (problem to solve: MaSh needs most of Sledgehammer)
blanchet
parents:
48085
diff
changeset
|
290 |
<= Config.get ctxt auto_minimize_max_time |
1065c307fafe
further ML structure split to permit finer-grained loading/reordering (problem to solve: MaSh needs most of Sledgehammer)
blanchet
parents:
48085
diff
changeset
|
291 |
fun prover_fast_enough () = can_min_fast_enough run_time |
1065c307fafe
further ML structure split to permit finer-grained loading/reordering (problem to solve: MaSh needs most of Sledgehammer)
blanchet
parents:
48085
diff
changeset
|
292 |
in |
51190
2654b3965c8d
made "isar_proofs" a 3-way option, to provide a way to totally disable isar_proofs if desired
blanchet
parents:
51187
diff
changeset
|
293 |
(case Lazy.force preplay of |
2654b3965c8d
made "isar_proofs" a 3-way option, to provide a way to totally disable isar_proofs if desired
blanchet
parents:
51187
diff
changeset
|
294 |
Played (reconstr as Metis _, timeout) => |
51191
89e9e945a005
auto-minimizer should respect "isar_proofs = true"
blanchet
parents:
51190
diff
changeset
|
295 |
if isar_proofs = SOME true then |
51200
260cb10aac4b
minimize SMT proofs with E if Isar proofs are desired and Metis managed to preplay
blanchet
parents:
51191
diff
changeset
|
296 |
(* Cheat: Assume the selected ATP is as fast as "metis" for |
260cb10aac4b
minimize SMT proofs with E if Isar proofs are desired and Metis managed to preplay
blanchet
parents:
51191
diff
changeset
|
297 |
the goal it proved itself. *) |
260cb10aac4b
minimize SMT proofs with E if Isar proofs are desired and Metis managed to preplay
blanchet
parents:
51191
diff
changeset
|
298 |
(can_min_fast_enough timeout, |
260cb10aac4b
minimize SMT proofs with E if Isar proofs are desired and Metis managed to preplay
blanchet
parents:
51191
diff
changeset
|
299 |
(isar_proof_reconstructor ctxt name, params)) |
51191
89e9e945a005
auto-minimizer should respect "isar_proofs = true"
blanchet
parents:
51190
diff
changeset
|
300 |
else if can_min_fast_enough timeout then |
51190
2654b3965c8d
made "isar_proofs" a 3-way option, to provide a way to totally disable isar_proofs if desired
blanchet
parents:
51187
diff
changeset
|
301 |
(true, extract_reconstructor params reconstr |
2654b3965c8d
made "isar_proofs" a 3-way option, to provide a way to totally disable isar_proofs if desired
blanchet
parents:
51187
diff
changeset
|
302 |
||> (fn override_params => |
2654b3965c8d
made "isar_proofs" a 3-way option, to provide a way to totally disable isar_proofs if desired
blanchet
parents:
51187
diff
changeset
|
303 |
adjust_reconstructor_params override_params |
2654b3965c8d
made "isar_proofs" a 3-way option, to provide a way to totally disable isar_proofs if desired
blanchet
parents:
51187
diff
changeset
|
304 |
params)) |
2654b3965c8d
made "isar_proofs" a 3-way option, to provide a way to totally disable isar_proofs if desired
blanchet
parents:
51187
diff
changeset
|
305 |
else |
2654b3965c8d
made "isar_proofs" a 3-way option, to provide a way to totally disable isar_proofs if desired
blanchet
parents:
51187
diff
changeset
|
306 |
(prover_fast_enough (), (name, params)) |
2654b3965c8d
made "isar_proofs" a 3-way option, to provide a way to totally disable isar_proofs if desired
blanchet
parents:
51187
diff
changeset
|
307 |
| Played (SMT, timeout) => |
51191
89e9e945a005
auto-minimizer should respect "isar_proofs = true"
blanchet
parents:
51190
diff
changeset
|
308 |
(* Cheat: Assume the original prover is as fast as "smt" for |
51190
2654b3965c8d
made "isar_proofs" a 3-way option, to provide a way to totally disable isar_proofs if desired
blanchet
parents:
51187
diff
changeset
|
309 |
the goal it proved itself *) |
2654b3965c8d
made "isar_proofs" a 3-way option, to provide a way to totally disable isar_proofs if desired
blanchet
parents:
51187
diff
changeset
|
310 |
(can_min_fast_enough timeout, (name, params)) |
2654b3965c8d
made "isar_proofs" a 3-way option, to provide a way to totally disable isar_proofs if desired
blanchet
parents:
51187
diff
changeset
|
311 |
| _ => (prover_fast_enough (), (name, params)), |
2654b3965c8d
made "isar_proofs" a 3-way option, to provide a way to totally disable isar_proofs if desired
blanchet
parents:
51187
diff
changeset
|
312 |
preplay) |
48250
1065c307fafe
further ML structure split to permit finer-grained loading/reordering (problem to solve: MaSh needs most of Sledgehammer)
blanchet
parents:
48085
diff
changeset
|
313 |
end |
1065c307fafe
further ML structure split to permit finer-grained loading/reordering (problem to solve: MaSh needs most of Sledgehammer)
blanchet
parents:
48085
diff
changeset
|
314 |
else |
54127
1e6db1c9f14c
verbose minimization when learning from ATP proofs
blanchet
parents:
54119
diff
changeset
|
315 |
((false, (name, params)), preplay) |
48250
1065c307fafe
further ML structure split to permit finer-grained loading/reordering (problem to solve: MaSh needs most of Sledgehammer)
blanchet
parents:
48085
diff
changeset
|
316 |
val minimize = minimize |> the_default perhaps_minimize |
1065c307fafe
further ML structure split to permit finer-grained loading/reordering (problem to solve: MaSh needs most of Sledgehammer)
blanchet
parents:
48085
diff
changeset
|
317 |
val (used_facts, (preplay, message, _)) = |
1065c307fafe
further ML structure split to permit finer-grained loading/reordering (problem to solve: MaSh needs most of Sledgehammer)
blanchet
parents:
48085
diff
changeset
|
318 |
if minimize then |
48392
ca998fa08cd9
added "learn_from_atp" command to MaSh, for patient users
blanchet
parents:
48384
diff
changeset
|
319 |
minimize_facts do_learn minimize_name params |
54127
1e6db1c9f14c
verbose minimization when learning from ATP proofs
blanchet
parents:
54119
diff
changeset
|
320 |
(not verbose orelse (mode <> Normal andalso mode <> MaSh)) subgoal |
54130
b4e6cd4cab92
thread the goal through instead of relying on unreliable (possibly fake) state
blanchet
parents:
54127
diff
changeset
|
321 |
subgoal_count state goal (SOME preplay) |
51010 | 322 |
(filter_used_facts true used_facts (map (apsnd single) used_from)) |
48250
1065c307fafe
further ML structure split to permit finer-grained loading/reordering (problem to solve: MaSh needs most of Sledgehammer)
blanchet
parents:
48085
diff
changeset
|
323 |
|>> Option.map (map fst) |
1065c307fafe
further ML structure split to permit finer-grained loading/reordering (problem to solve: MaSh needs most of Sledgehammer)
blanchet
parents:
48085
diff
changeset
|
324 |
else |
1065c307fafe
further ML structure split to permit finer-grained loading/reordering (problem to solve: MaSh needs most of Sledgehammer)
blanchet
parents:
48085
diff
changeset
|
325 |
(SOME used_facts, (preplay, message, "")) |
1065c307fafe
further ML structure split to permit finer-grained loading/reordering (problem to solve: MaSh needs most of Sledgehammer)
blanchet
parents:
48085
diff
changeset
|
326 |
in |
1065c307fafe
further ML structure split to permit finer-grained loading/reordering (problem to solve: MaSh needs most of Sledgehammer)
blanchet
parents:
48085
diff
changeset
|
327 |
case used_facts of |
1065c307fafe
further ML structure split to permit finer-grained loading/reordering (problem to solve: MaSh needs most of Sledgehammer)
blanchet
parents:
48085
diff
changeset
|
328 |
SOME used_facts => |
51009
e8ff34a1fa9a
thread through fact triple component from which used facts come, for accurate index output
blanchet
parents:
51007
diff
changeset
|
329 |
{outcome = NONE, used_facts = used_facts, used_from = used_from, |
e8ff34a1fa9a
thread through fact triple component from which used facts come, for accurate index output
blanchet
parents:
51007
diff
changeset
|
330 |
run_time = run_time, preplay = preplay, message = message, |
e8ff34a1fa9a
thread through fact triple component from which used facts come, for accurate index output
blanchet
parents:
51007
diff
changeset
|
331 |
message_tail = message_tail} |
48250
1065c307fafe
further ML structure split to permit finer-grained loading/reordering (problem to solve: MaSh needs most of Sledgehammer)
blanchet
parents:
48085
diff
changeset
|
332 |
| NONE => result |
1065c307fafe
further ML structure split to permit finer-grained loading/reordering (problem to solve: MaSh needs most of Sledgehammer)
blanchet
parents:
48085
diff
changeset
|
333 |
end |
1065c307fafe
further ML structure split to permit finer-grained loading/reordering (problem to solve: MaSh needs most of Sledgehammer)
blanchet
parents:
48085
diff
changeset
|
334 |
|
51187
c344cf148e8f
avoid using "smt" for minimization -- better use the prover itself, since then Sledgehammer gets to try metis again and gives the opportunity to output an Isar proof -- and show Isar proof as fallback for SMT proofs
blanchet
parents:
51130
diff
changeset
|
335 |
fun get_minimizing_prover ctxt mode do_learn name params minimize_command |
c344cf148e8f
avoid using "smt" for minimization -- better use the prover itself, since then Sledgehammer gets to try metis again and gives the opportunity to output an Isar proof -- and show Isar proof as fallback for SMT proofs
blanchet
parents:
51130
diff
changeset
|
336 |
problem = |
48250
1065c307fafe
further ML structure split to permit finer-grained loading/reordering (problem to solve: MaSh needs most of Sledgehammer)
blanchet
parents:
48085
diff
changeset
|
337 |
get_prover ctxt mode name params minimize_command problem |
48384
83dc102041e6
learn on explicit "min" command but do the learning in a thread, since it may take a couple of seconds
blanchet
parents:
48321
diff
changeset
|
338 |
|> maybe_minimize ctxt mode do_learn name params problem |
48250
1065c307fafe
further ML structure split to permit finer-grained loading/reordering (problem to solve: MaSh needs most of Sledgehammer)
blanchet
parents:
48085
diff
changeset
|
339 |
|
48321 | 340 |
fun run_minimize (params as {provers, ...}) do_learn i refs state = |
38045 | 341 |
let |
342 |
val ctxt = Proof.context_of state |
|
54130
b4e6cd4cab92
thread the goal through instead of relying on unreliable (possibly fake) state
blanchet
parents:
54127
diff
changeset
|
343 |
val {goal, facts = chained_ths, ...} = Proof.goal state |
38696
4c6b65d6a135
quote facts whose names collide with a keyword or command name (cf. "subclass" in "Jinja/J/TypeSafe.thy")
blanchet
parents:
38617
diff
changeset
|
344 |
val reserved = reserved_isar_keyword_table () |
48396 | 345 |
val css = clasimpset_rule_table_of ctxt |
54130
b4e6cd4cab92
thread the goal through instead of relying on unreliable (possibly fake) state
blanchet
parents:
54127
diff
changeset
|
346 |
val facts = refs |> maps (map (apsnd single) o fact_of_ref ctxt reserved chained_ths css) |
38045 | 347 |
in |
348 |
case subgoal_count state of |
|
40132
7ee65dbffa31
renamed Output.priority to Output.urgent_message to emphasize its special role more clearly;
wenzelm
parents:
40114
diff
changeset
|
349 |
0 => Output.urgent_message "No subgoal!" |
41265
a393d6d8e198
let each prover minimizes its own stuff (rather than taking the first prover of the list to minimize every prover's stuff)
blanchet
parents:
41259
diff
changeset
|
350 |
| n => case provers of |
a393d6d8e198
let each prover minimizes its own stuff (rather than taking the first prover of the list to minimize every prover's stuff)
blanchet
parents:
41259
diff
changeset
|
351 |
[] => error "No prover is set." |
a393d6d8e198
let each prover minimizes its own stuff (rather than taking the first prover of the list to minimize every prover's stuff)
blanchet
parents:
41259
diff
changeset
|
352 |
| prover :: _ => |
a393d6d8e198
let each prover minimizes its own stuff (rather than taking the first prover of the list to minimize every prover's stuff)
blanchet
parents:
41259
diff
changeset
|
353 |
(kill_provers (); |
54130
b4e6cd4cab92
thread the goal through instead of relying on unreliable (possibly fake) state
blanchet
parents:
54127
diff
changeset
|
354 |
minimize_facts do_learn prover params false i n state goal NONE facts |
43261
a4aeb26a6362
make sure that the message tail (timing + TPTP important message) is preserved upon automatic minimization
blanchet
parents:
43259
diff
changeset
|
355 |
|> (fn (_, (preplay, message, message_tail)) => |
50669
84c7cf36b2e0
use "Lazy" to simplify control flow a bit and guarantee single evaluation (at most)
blanchet
parents:
50668
diff
changeset
|
356 |
message (Lazy.force preplay) ^ message_tail |
43261
a4aeb26a6362
make sure that the message tail (timing + TPTP important message) is preserved upon automatic minimization
blanchet
parents:
43259
diff
changeset
|
357 |
|> Output.urgent_message)) |
38045 | 358 |
end |
359 |
||
35866
513074557e06
move the Sledgehammer Isar commands together into one file;
blanchet
parents:
35865
diff
changeset
|
360 |
end; |