blanchet@41335
|
1 |
(* Title: HOL/Tools/Sledgehammer/sledgehammer_run.ML
|
wenzelm@28477
|
2 |
Author: Fabian Immler, TU Muenchen
|
wenzelm@32996
|
3 |
Author: Makarius
|
blanchet@35967
|
4 |
Author: Jasmin Blanchette, TU Muenchen
|
wenzelm@28477
|
5 |
|
blanchet@38255
|
6 |
Sledgehammer's heart.
|
wenzelm@28477
|
7 |
*)
|
wenzelm@28477
|
8 |
|
blanchet@41335
|
9 |
signature SLEDGEHAMMER_RUN =
|
wenzelm@28477
|
10 |
sig
|
blanchet@39232
|
11 |
type relevance_override = Sledgehammer_Filter.relevance_override
|
blanchet@40249
|
12 |
type minimize_command = Sledgehammer_ATP_Reconstruct.minimize_command
|
blanchet@41335
|
13 |
type params = Sledgehammer_Provers.params
|
blanchet@41511
|
14 |
type prover = Sledgehammer_Provers.prover
|
blanchet@39733
|
15 |
|
blanchet@43517
|
16 |
val auto_minimize_min_facts : int Config.T
|
blanchet@43315
|
17 |
val get_minimizing_prover : Proof.context -> bool -> string -> prover
|
blanchet@38290
|
18 |
val run_sledgehammer :
|
blanchet@43315
|
19 |
params -> bool -> int -> relevance_override -> (string -> minimize_command)
|
blanchet@43315
|
20 |
-> Proof.state -> bool * Proof.state
|
wenzelm@28477
|
21 |
end;
|
wenzelm@28477
|
22 |
|
blanchet@41335
|
23 |
structure Sledgehammer_Run : SLEDGEHAMMER_RUN =
|
wenzelm@28477
|
24 |
struct
|
wenzelm@28477
|
25 |
|
blanchet@38257
|
26 |
open Sledgehammer_Util
|
blanchet@39232
|
27 |
open Sledgehammer_Filter
|
blanchet@40249
|
28 |
open Sledgehammer_ATP_Translate
|
blanchet@41335
|
29 |
open Sledgehammer_Provers
|
blanchet@41339
|
30 |
open Sledgehammer_Minimize
|
blanchet@40253
|
31 |
|
blanchet@41456
|
32 |
fun prover_description ctxt ({verbose, blocking, ...} : params) name num_facts i
|
blanchet@41337
|
33 |
n goal =
|
blanchet@41337
|
34 |
quote name ^
|
blanchet@41337
|
35 |
(if verbose then
|
blanchet@41337
|
36 |
" with " ^ string_of_int num_facts ^ " fact" ^ plural_s num_facts
|
blanchet@41337
|
37 |
else
|
blanchet@41337
|
38 |
"") ^
|
blanchet@42614
|
39 |
" on " ^ (if n = 1 then "goal" else "subgoal " ^ string_of_int i) ^
|
blanchet@41337
|
40 |
(if blocking then
|
blanchet@42614
|
41 |
"."
|
blanchet@41337
|
42 |
else
|
blanchet@42614
|
43 |
":\n" ^ Syntax.string_of_term ctxt (Thm.term_of (Thm.cprem_of goal i)))
|
blanchet@41337
|
44 |
|
blanchet@43517
|
45 |
val auto_minimize_min_facts =
|
blanchet@43517
|
46 |
Attrib.setup_config_int @{binding sledgehammer_auto_minimize_min_facts}
|
blanchet@43517
|
47 |
(fn generic => Config.get_generic generic binary_min_facts)
|
blanchet@41339
|
48 |
|
blanchet@43315
|
49 |
fun get_minimizing_prover ctxt auto name
|
blanchet@42613
|
50 |
(params as {debug, verbose, explicit_apply, ...}) minimize_command
|
blanchet@41511
|
51 |
(problem as {state, subgoal, subgoal_count, facts, ...}) =
|
blanchet@43315
|
52 |
get_prover ctxt auto name params minimize_command problem
|
blanchet@41511
|
53 |
|> (fn result as {outcome, used_facts, run_time_in_msecs, message} =>
|
blanchet@41511
|
54 |
if is_some outcome then
|
blanchet@41511
|
55 |
result
|
blanchet@41511
|
56 |
else
|
blanchet@41511
|
57 |
let
|
blanchet@41511
|
58 |
val (used_facts, message) =
|
blanchet@43517
|
59 |
if length used_facts
|
blanchet@43517
|
60 |
>= Config.get ctxt auto_minimize_min_facts then
|
blanchet@42613
|
61 |
minimize_facts name params (SOME explicit_apply) (not verbose)
|
blanchet@42613
|
62 |
subgoal subgoal_count state
|
blanchet@41511
|
63 |
(filter_used_facts used_facts
|
blanchet@41511
|
64 |
(map (apsnd single o untranslated_fact) facts))
|
blanchet@41511
|
65 |
|>> Option.map (map fst)
|
blanchet@41511
|
66 |
else
|
blanchet@41511
|
67 |
(SOME used_facts, message)
|
blanchet@41511
|
68 |
in
|
blanchet@41511
|
69 |
case used_facts of
|
blanchet@41511
|
70 |
SOME used_facts =>
|
blanchet@41511
|
71 |
(if debug andalso not (null used_facts) then
|
blanchet@41511
|
72 |
facts ~~ (0 upto length facts - 1)
|
blanchet@41511
|
73 |
|> map (fn (fact, j) =>
|
blanchet@41511
|
74 |
fact |> untranslated_fact |> apsnd (K j))
|
blanchet@41511
|
75 |
|> filter_used_facts used_facts
|
blanchet@41511
|
76 |
|> map (fn ((name, _), j) => name ^ "@" ^ string_of_int j)
|
blanchet@41511
|
77 |
|> commas
|
blanchet@41511
|
78 |
|> enclose ("Fact" ^ plural_s (length facts) ^ " in " ^
|
blanchet@41511
|
79 |
quote name ^ " proof (of " ^
|
blanchet@41511
|
80 |
string_of_int (length facts) ^ "): ") "."
|
blanchet@41511
|
81 |
|> Output.urgent_message
|
blanchet@41511
|
82 |
else
|
blanchet@41511
|
83 |
();
|
blanchet@41511
|
84 |
{outcome = NONE, used_facts = used_facts,
|
blanchet@41511
|
85 |
run_time_in_msecs = run_time_in_msecs, message = message})
|
blanchet@41511
|
86 |
| NONE => result
|
blanchet@41511
|
87 |
end)
|
blanchet@41510
|
88 |
|
blanchet@43314
|
89 |
fun launch_prover (params as {debug, blocking, max_relevant, slicing, timeout,
|
blanchet@43314
|
90 |
expect, ...})
|
blanchet@43315
|
91 |
auto minimize_command only
|
blanchet@42612
|
92 |
{state, goal, subgoal, subgoal_count, facts, smt_filter} name =
|
blanchet@41337
|
93 |
let
|
blanchet@41337
|
94 |
val ctxt = Proof.context_of state
|
blanchet@41337
|
95 |
val birth_time = Time.now ()
|
blanchet@41337
|
96 |
val death_time = Time.+ (birth_time, timeout)
|
blanchet@41337
|
97 |
val max_relevant =
|
blanchet@43314
|
98 |
max_relevant
|
blanchet@43314
|
99 |
|> the_default (default_max_relevant_for_prover ctxt slicing name)
|
blanchet@41337
|
100 |
val num_facts = length facts |> not only ? Integer.min max_relevant
|
blanchet@41337
|
101 |
val desc =
|
blanchet@41337
|
102 |
prover_description ctxt params name num_facts subgoal subgoal_count goal
|
blanchet@41337
|
103 |
val problem =
|
blanchet@41337
|
104 |
{state = state, goal = goal, subgoal = subgoal,
|
blanchet@43509
|
105 |
subgoal_count = subgoal_count, facts = facts |> take num_facts,
|
blanchet@42612
|
106 |
smt_filter = smt_filter}
|
blanchet@41501
|
107 |
fun really_go () =
|
blanchet@41511
|
108 |
problem
|
blanchet@43315
|
109 |
|> get_minimizing_prover ctxt auto name params (minimize_command name)
|
blanchet@41510
|
110 |
|> (fn {outcome, message, ...} =>
|
blanchet@41510
|
111 |
(if is_some outcome then "none" else "some" (* sic *), message))
|
blanchet@41337
|
112 |
fun go () =
|
blanchet@41337
|
113 |
let
|
blanchet@41337
|
114 |
val (outcome_code, message) =
|
blanchet@41337
|
115 |
if debug then
|
blanchet@41337
|
116 |
really_go ()
|
blanchet@41337
|
117 |
else
|
blanchet@41337
|
118 |
(really_go ()
|
blanchet@41337
|
119 |
handle ERROR message => ("unknown", "Error: " ^ message ^ "\n")
|
blanchet@41337
|
120 |
| exn =>
|
blanchet@41337
|
121 |
if Exn.is_interrupt exn then
|
blanchet@41337
|
122 |
reraise exn
|
blanchet@41337
|
123 |
else
|
blanchet@41337
|
124 |
("unknown", "Internal error:\n" ^
|
blanchet@41337
|
125 |
ML_Compiler.exn_message exn ^ "\n"))
|
blanchet@41337
|
126 |
val _ =
|
blanchet@41390
|
127 |
(* The "expect" argument is deliberately ignored if the prover is
|
blanchet@41390
|
128 |
missing so that the "Metis_Examples" can be processed on any
|
blanchet@41390
|
129 |
machine. *)
|
blanchet@41390
|
130 |
if expect = "" orelse outcome_code = expect orelse
|
blanchet@41390
|
131 |
not (is_prover_installed ctxt name) then
|
blanchet@41337
|
132 |
()
|
blanchet@41337
|
133 |
else if blocking then
|
blanchet@41337
|
134 |
error ("Unexpected outcome: " ^ quote outcome_code ^ ".")
|
blanchet@41337
|
135 |
else
|
blanchet@41337
|
136 |
warning ("Unexpected outcome: " ^ quote outcome_code ^ ".");
|
blanchet@41337
|
137 |
in (outcome_code = "some", message) end
|
blanchet@41337
|
138 |
in
|
blanchet@41337
|
139 |
if auto then
|
blanchet@41337
|
140 |
let val (success, message) = TimeLimit.timeLimit timeout go () in
|
blanchet@41337
|
141 |
(success, state |> success ? Proof.goal_message (fn () =>
|
blanchet@41339
|
142 |
Pretty.chunks [Pretty.str "",
|
blanchet@41339
|
143 |
Pretty.mark Markup.hilite (Pretty.str message)]))
|
blanchet@41337
|
144 |
end
|
blanchet@41337
|
145 |
else if blocking then
|
blanchet@41337
|
146 |
let val (success, message) = TimeLimit.timeLimit timeout go () in
|
blanchet@41337
|
147 |
List.app Output.urgent_message
|
blanchet@41337
|
148 |
(Async_Manager.break_into_chunks [desc ^ "\n" ^ message]);
|
blanchet@41337
|
149 |
(success, state)
|
blanchet@41337
|
150 |
end
|
blanchet@41337
|
151 |
else
|
blanchet@41337
|
152 |
(Async_Manager.launch das_Tool birth_time death_time desc (snd o go);
|
blanchet@41337
|
153 |
(false, state))
|
blanchet@41337
|
154 |
end
|
blanchet@41337
|
155 |
|
blanchet@41483
|
156 |
fun class_of_smt_solver ctxt name =
|
blanchet@41483
|
157 |
ctxt |> select_smt_solver name
|
blanchet@41483
|
158 |
|> SMT_Config.solver_class_of |> SMT_Utils.string_of_class
|
blanchet@41483
|
159 |
|
blanchet@41483
|
160 |
(* Makes backtraces more transparent and might be more efficient as well. *)
|
blanchet@41483
|
161 |
fun smart_par_list_map _ [] = []
|
blanchet@41483
|
162 |
| smart_par_list_map f [x] = [f x]
|
blanchet@41483
|
163 |
| smart_par_list_map f xs = Par_List.map f xs
|
blanchet@41483
|
164 |
|
blanchet@41502
|
165 |
fun dest_SMT_Weighted_Fact (SMT_Weighted_Fact p) = p
|
blanchet@41502
|
166 |
| dest_SMT_Weighted_Fact _ = raise Fail "dest_SMT_Weighted_Fact"
|
blanchet@41502
|
167 |
|
blanchet@43450
|
168 |
val auto_max_relevant_divisor = 2 (* FUDGE *)
|
blanchet@40241
|
169 |
|
blanchet@43513
|
170 |
fun run_sledgehammer (params as {debug, blocking, provers, relevance_thresholds,
|
blanchet@43513
|
171 |
max_relevant, slicing, timeout, ...})
|
blanchet@43315
|
172 |
auto i (relevance_override as {only, ...}) minimize_command state =
|
blanchet@40240
|
173 |
if null provers then
|
blanchet@40240
|
174 |
error "No prover is set."
|
blanchet@39564
|
175 |
else case subgoal_count state of
|
wenzelm@40392
|
176 |
0 => (Output.urgent_message "No subgoal!"; (false, state))
|
blanchet@39564
|
177 |
| n =>
|
blanchet@39564
|
178 |
let
|
blanchet@39610
|
179 |
val _ = Proof.assert_backward state
|
blanchet@42644
|
180 |
val print = if auto then K () else Output.urgent_message
|
blanchet@41483
|
181 |
val state =
|
blanchet@41483
|
182 |
state |> Proof.map_context (Config.put SMT_Config.verbose debug)
|
blanchet@40441
|
183 |
val ctxt = Proof.context_of state
|
blanchet@40441
|
184 |
val {facts = chained_ths, goal, ...} = Proof.goal state
|
blanchet@40241
|
185 |
val (_, hyp_ts, concl_t) = strip_subgoal goal i
|
blanchet@40240
|
186 |
val _ = () |> not blocking ? kill_provers
|
blanchet@42591
|
187 |
val _ = case find_first (not o is_prover_supported ctxt) provers of
|
blanchet@41189
|
188 |
SOME name => error ("No such prover: " ^ name ^ ".")
|
blanchet@41189
|
189 |
| NONE => ()
|
blanchet@42644
|
190 |
val _ = print "Sledgehammering..."
|
blanchet@41189
|
191 |
val (smts, atps) = provers |> List.partition (is_smt_prover ctxt)
|
blanchet@42612
|
192 |
fun launch_provers state get_facts translate maybe_smt_filter provers =
|
blanchet@41502
|
193 |
let
|
blanchet@41502
|
194 |
val facts = get_facts ()
|
blanchet@41502
|
195 |
val num_facts = length facts
|
blanchet@41502
|
196 |
val facts = facts ~~ (0 upto num_facts - 1)
|
blanchet@41502
|
197 |
|> map (translate num_facts)
|
blanchet@41502
|
198 |
val problem =
|
blanchet@41502
|
199 |
{state = state, goal = goal, subgoal = i, subgoal_count = n,
|
blanchet@41502
|
200 |
facts = facts,
|
blanchet@42612
|
201 |
smt_filter = maybe_smt_filter
|
blanchet@41502
|
202 |
(fn () => map_filter (try dest_SMT_Weighted_Fact) facts) i}
|
blanchet@43315
|
203 |
val launch = launch_prover params auto minimize_command only
|
blanchet@41502
|
204 |
in
|
blanchet@41502
|
205 |
if auto then
|
blanchet@41502
|
206 |
fold (fn prover => fn (true, state) => (true, state)
|
blanchet@41510
|
207 |
| (false, _) => launch problem prover)
|
blanchet@41502
|
208 |
provers (false, state)
|
blanchet@41502
|
209 |
else
|
blanchet@41502
|
210 |
provers
|
blanchet@41510
|
211 |
|> (if blocking then smart_par_list_map else map) (launch problem)
|
blanchet@41502
|
212 |
|> exists fst |> rpair state
|
blanchet@41502
|
213 |
end
|
blanchet@43509
|
214 |
fun get_facts label relevance_fudge provers =
|
blanchet@41483
|
215 |
let
|
blanchet@41483
|
216 |
val max_max_relevant =
|
blanchet@41483
|
217 |
case max_relevant of
|
blanchet@41483
|
218 |
SOME n => n
|
blanchet@41483
|
219 |
| NONE =>
|
blanchet@43314
|
220 |
0 |> fold (Integer.max
|
blanchet@43314
|
221 |
o default_max_relevant_for_prover ctxt slicing)
|
blanchet@41483
|
222 |
provers
|
blanchet@41483
|
223 |
|> auto ? (fn n => n div auto_max_relevant_divisor)
|
blanchet@41483
|
224 |
val is_built_in_const =
|
blanchet@41483
|
225 |
is_built_in_const_for_prover ctxt (hd provers)
|
blanchet@41483
|
226 |
in
|
blanchet@43509
|
227 |
relevant_facts ctxt relevance_thresholds max_max_relevant
|
blanchet@43450
|
228 |
is_built_in_const relevance_fudge relevance_override
|
blanchet@43450
|
229 |
chained_ths hyp_ts concl_t
|
blanchet@41483
|
230 |
|> tap (fn facts =>
|
blanchet@41483
|
231 |
if debug then
|
blanchet@41483
|
232 |
label ^ plural_s (length provers) ^ ": " ^
|
blanchet@41483
|
233 |
(if null facts then
|
blanchet@41483
|
234 |
"Found no relevant facts."
|
blanchet@41483
|
235 |
else
|
blanchet@41483
|
236 |
"Including (up to) " ^ string_of_int (length facts) ^
|
blanchet@41483
|
237 |
" relevant fact" ^ plural_s (length facts) ^ ":\n" ^
|
blanchet@41483
|
238 |
(facts |> map (fst o fst) |> space_implode " ") ^ ".")
|
blanchet@42644
|
239 |
|> print
|
blanchet@41483
|
240 |
else
|
blanchet@41483
|
241 |
())
|
blanchet@41483
|
242 |
end
|
blanchet@42617
|
243 |
fun launch_atps accum =
|
blanchet@42617
|
244 |
if null atps then
|
blanchet@41502
|
245 |
accum
|
blanchet@41502
|
246 |
else
|
blanchet@43509
|
247 |
launch_provers state (get_facts "ATP" atp_relevance_fudge o K atps)
|
blanchet@43509
|
248 |
(K (Untranslated_Fact o fst)) (K (K NONE)) atps
|
blanchet@42617
|
249 |
fun launch_smts accum =
|
blanchet@42617
|
250 |
if null smts then
|
blanchet@41483
|
251 |
accum
|
blanchet@41483
|
252 |
else
|
blanchet@41483
|
253 |
let
|
blanchet@43509
|
254 |
val facts = get_facts "SMT solver" smt_relevance_fudge smts
|
blanchet@43517
|
255 |
val weight = SMT_Weighted_Fact oo weight_smt_fact ctxt
|
blanchet@42612
|
256 |
fun smt_filter facts =
|
blanchet@42659
|
257 |
(if debug then curry (op o) SOME
|
blanchet@42659
|
258 |
else TimeLimit.timeLimit timeout o try)
|
boehmes@41680
|
259 |
(SMT_Solver.smt_filter_preprocess state (facts ()))
|
blanchet@41483
|
260 |
in
|
blanchet@41483
|
261 |
smts |> map (`(class_of_smt_solver ctxt))
|
blanchet@41483
|
262 |
|> AList.group (op =)
|
blanchet@42612
|
263 |
|> map (launch_provers state (K facts) weight smt_filter o snd)
|
blanchet@41483
|
264 |
|> exists fst |> rpair state
|
blanchet@41483
|
265 |
end
|
blanchet@41510
|
266 |
fun launch_atps_and_smt_solvers () =
|
blanchet@41510
|
267 |
[launch_atps, launch_smts]
|
blanchet@41483
|
268 |
|> smart_par_list_map (fn f => f (false, state) |> K ())
|
blanchet@42644
|
269 |
handle ERROR msg => (print ("Error: " ^ msg); error msg)
|
blanchet@40241
|
270 |
in
|
blanchet@40246
|
271 |
(false, state)
|
blanchet@41510
|
272 |
|> (if blocking then launch_atps #> not auto ? launch_smts
|
blanchet@41510
|
273 |
else (fn p => Future.fork (tap launch_atps_and_smt_solvers) |> K p))
|
blanchet@42644
|
274 |
handle TimeLimit.TimeOut =>
|
blanchet@42644
|
275 |
(print "Sledgehammer ran out of time."; (false, state))
|
blanchet@40241
|
276 |
end
|
blanchet@38290
|
277 |
|
wenzelm@28582
|
278 |
end;
|