1 (* Title: HOL/Tools/Sledgehammer/sledgehammer_provers.ML
2 Author: Fabian Immler, TU Muenchen
4 Author: Jasmin Blanchette, TU Muenchen
6 Generic prover abstraction for Sledgehammer.
9 signature SLEDGEHAMMER_PROVERS =
11 type failure = ATP_Proof.failure
12 type locality = ATP_Translate.locality
13 type type_enc = ATP_Translate.type_enc
14 type reconstructor = ATP_Reconstruct.reconstructor
15 type play = ATP_Reconstruct.play
16 type minimize_command = ATP_Reconstruct.minimize_command
17 type relevance_fudge = Sledgehammer_Filter.relevance_fudge
19 datatype mode = Auto_Try | Try | Normal | Minimize
27 type_enc: type_enc option,
29 relevance_thresholds: real * real,
30 max_relevant: int option,
32 max_new_mono_instances: int,
34 isar_shrink_factor: int,
37 preplay_timeout: Time.time,
40 datatype prover_fact =
41 Untranslated_Fact of (string * locality) * thm |
42 SMT_Weighted_Fact of (string * locality) * (int option * thm)
49 facts: prover_fact list,
50 smt_filter: (string * locality) SMT_Solver.smt_filter_data option}
53 {outcome: failure option,
54 used_facts: (string * locality) list,
55 run_time_in_msecs: int option,
56 preplay: unit -> play,
57 message: play -> string,
61 params -> (string -> minimize_command) -> prover_problem -> prover_result
63 val concealed_lambdasN : string
64 val lambda_liftingN : string
65 val combinatorsN : string
68 val dest_dir : string Config.T
69 val problem_prefix : string Config.T
70 val measure_run_time : bool Config.T
71 val atp_lambda_translation : string Config.T
72 val atp_readable_names : bool Config.T
73 val smt_triggers : bool Config.T
74 val smt_weights : bool Config.T
75 val smt_weight_min_facts : int Config.T
76 val smt_min_weight : int Config.T
77 val smt_max_weight : int Config.T
78 val smt_max_weight_index : int Config.T
79 val smt_weight_curve : (int -> int) Unsynchronized.ref
80 val smt_max_slices : int Config.T
81 val smt_slice_fact_frac : real Config.T
82 val smt_slice_time_frac : real Config.T
83 val smt_slice_min_secs : int Config.T
85 val select_smt_solver : string -> Proof.context -> Proof.context
86 val prover_name_for_reconstructor : reconstructor -> string option
87 val is_metis_prover : string -> bool
88 val is_atp : theory -> string -> bool
89 val is_smt_prover : Proof.context -> string -> bool
90 val is_unit_equational_atp : Proof.context -> string -> bool
91 val is_prover_supported : Proof.context -> string -> bool
92 val is_prover_installed : Proof.context -> string -> bool
93 val default_max_relevant_for_prover : Proof.context -> bool -> string -> int
94 val is_unit_equality : term -> bool
95 val is_appropriate_prop_for_prover : Proof.context -> string -> term -> bool
96 val is_built_in_const_for_prover :
97 Proof.context -> string -> string * typ -> term list -> bool * term list
98 val atp_relevance_fudge : relevance_fudge
99 val smt_relevance_fudge : relevance_fudge
100 val relevance_fudge_for_prover : Proof.context -> string -> relevance_fudge
101 val weight_smt_fact :
102 Proof.context -> int -> ((string * locality) * thm) * int
103 -> (string * locality) * (int option * thm)
104 val untranslated_fact : prover_fact -> (string * locality) * thm
105 val smt_weighted_fact :
106 Proof.context -> int -> prover_fact * int
107 -> (string * locality) * (int option * thm)
108 val supported_provers : Proof.context -> unit
109 val kill_provers : unit -> unit
110 val running_provers : unit -> unit
111 val messages : int option -> unit
112 val filter_used_facts : ''a list -> (''a * 'b) list -> (''a * 'b) list
113 val get_prover : Proof.context -> mode -> string -> prover
116 structure Sledgehammer_Provers : SLEDGEHAMMER_PROVERS =
125 open Sledgehammer_Util
126 open Sledgehammer_Filter
128 (** The Sledgehammer **)
130 datatype mode = Auto_Try | Try | Normal | Minimize
132 (* Identifier to distinguish Sledgehammer from other tools using
134 val das_tool = "Sledgehammer"
136 val metisN = Metis_Tactics.metisN
137 val metis_full_typesN = metisN ^ "_" ^ Metis_Tactics.full_typesN
138 val metis_no_typesN = metisN ^ "_" ^ Metis_Tactics.no_typesN
140 val metis_prover_infos =
142 (metis_full_typesN, Metis_Full_Types),
143 (metis_no_typesN, Metis_No_Types)]
145 val prover_name_for_reconstructor =
146 AList.find (op =) metis_prover_infos #> try hd
148 val metis_reconstructors = map snd metis_prover_infos
150 val is_metis_prover = AList.defined (op =) metis_prover_infos
151 val is_atp = member (op =) o supported_atps
153 val select_smt_solver = Context.proof_map o SMT_Config.select_solver
155 fun is_smt_prover ctxt name =
156 member (op =) (SMT_Solver.available_solvers_of ctxt) name
158 fun is_unit_equational_atp ctxt name =
159 let val thy = Proof_Context.theory_of ctxt in
160 case try (get_atp thy) name of
161 SOME {formats, ...} => member (op =) formats CNF_UEQ
165 fun is_prover_supported ctxt name =
166 let val thy = Proof_Context.theory_of ctxt in
167 is_metis_prover name orelse is_atp thy name orelse is_smt_prover ctxt name
170 fun is_prover_installed ctxt =
171 is_metis_prover orf is_smt_prover ctxt orf
172 is_atp_installed (Proof_Context.theory_of ctxt)
174 fun get_slices slicing slices =
175 (0 upto length slices - 1) ~~ slices |> not slicing ? (List.last #> single)
177 val metis_default_max_relevant = 20
179 fun default_max_relevant_for_prover ctxt slicing name =
180 let val thy = Proof_Context.theory_of ctxt in
181 if is_metis_prover name then
182 metis_default_max_relevant
183 else if is_atp thy name then
184 fold (Integer.max o #1 o snd o snd o snd)
185 (get_slices slicing (#best_slices (get_atp thy name) ctxt)) 0
186 else (* is_smt_prover ctxt name *)
187 SMT_Solver.default_max_relevant ctxt name
190 fun is_if (@{const_name If}, _) = true
193 (* Beware of "if and only if" (which is translated as such) and "If" (which is
194 translated to conditional equations). *)
195 fun is_good_unit_equality T t u =
196 T <> @{typ bool} andalso not (exists (exists_Const is_if) [t, u])
198 fun is_unit_equality (@{const Trueprop} $ t) = is_unit_equality t
199 | is_unit_equality (Const (@{const_name all}, _) $ Abs (_, _, t)) =
201 | is_unit_equality (Const (@{const_name All}, _) $ Abs (_, _, t)) =
203 | is_unit_equality (Const (@{const_name "=="}, Type (_, [T, _])) $ t $ u) =
204 is_good_unit_equality T t u
205 | is_unit_equality (Const (@{const_name HOL.eq}, Type (_ , [T, _])) $ t $ u) =
206 is_good_unit_equality T t u
207 | is_unit_equality _ = false
209 fun is_appropriate_prop_for_prover ctxt name =
210 if is_unit_equational_atp ctxt name then is_unit_equality else K true
212 fun is_built_in_const_for_prover ctxt name =
213 if is_smt_prover ctxt name then
214 let val ctxt = ctxt |> select_smt_solver name in
216 if SMT_Builtin.is_builtin_num_ext ctxt (list_comb (Const x, ts)) then
218 else if SMT_Builtin.is_builtin_fun_ext ctxt x ts then
224 fn (s, _) => fn ts => (member (op =) atp_irrelevant_consts s, ts)
227 val atp_relevance_fudge =
228 {local_const_multiplier = 1.5,
229 worse_irrel_freq = 100.0,
230 higher_order_irrel_weight = 1.05,
231 abs_rel_weight = 0.5,
232 abs_irrel_weight = 2.0,
233 skolem_irrel_weight = 0.25,
234 theory_const_rel_weight = 0.5,
235 theory_const_irrel_weight = 0.25,
236 chained_const_irrel_weight = 0.25,
243 max_imperfect = 11.5,
244 max_imperfect_exp = 1.0,
245 threshold_divisor = 2.0,
246 ridiculous_threshold = 0.01}
249 val smt_relevance_fudge =
250 {local_const_multiplier = #local_const_multiplier atp_relevance_fudge,
251 worse_irrel_freq = #worse_irrel_freq atp_relevance_fudge,
252 higher_order_irrel_weight = #higher_order_irrel_weight atp_relevance_fudge,
253 abs_rel_weight = #abs_rel_weight atp_relevance_fudge,
254 abs_irrel_weight = #abs_irrel_weight atp_relevance_fudge,
255 skolem_irrel_weight = #skolem_irrel_weight atp_relevance_fudge,
256 theory_const_rel_weight = #theory_const_rel_weight atp_relevance_fudge,
257 theory_const_irrel_weight = #theory_const_irrel_weight atp_relevance_fudge,
258 chained_const_irrel_weight = #chained_const_irrel_weight atp_relevance_fudge,
259 intro_bonus = #intro_bonus atp_relevance_fudge,
260 elim_bonus = #elim_bonus atp_relevance_fudge,
261 simp_bonus = #simp_bonus atp_relevance_fudge,
262 local_bonus = #local_bonus atp_relevance_fudge,
263 assum_bonus = #assum_bonus atp_relevance_fudge,
264 chained_bonus = #chained_bonus atp_relevance_fudge,
265 max_imperfect = #max_imperfect atp_relevance_fudge,
266 max_imperfect_exp = #max_imperfect_exp atp_relevance_fudge,
267 threshold_divisor = #threshold_divisor atp_relevance_fudge,
268 ridiculous_threshold = #ridiculous_threshold atp_relevance_fudge}
270 fun relevance_fudge_for_prover ctxt name =
271 if is_smt_prover ctxt name then smt_relevance_fudge else atp_relevance_fudge
273 fun supported_provers ctxt =
275 val thy = Proof_Context.theory_of ctxt
276 val (remote_provers, local_provers) =
277 map fst metis_prover_infos @
278 sort_strings (supported_atps thy) @
279 sort_strings (SMT_Solver.available_solvers_of ctxt)
280 |> List.partition (String.isPrefix remote_prefix)
282 Output.urgent_message ("Supported provers: " ^
283 commas (local_provers @ remote_provers) ^ ".")
286 fun kill_provers () = Async_Manager.kill_threads das_tool "prover"
287 fun running_provers () = Async_Manager.running_threads das_tool "prover"
288 val messages = Async_Manager.thread_messages das_tool "prover"
290 (** problems, results, ATPs, etc. **)
297 provers: string list,
298 type_enc: type_enc option,
300 relevance_thresholds: real * real,
301 max_relevant: int option,
303 max_new_mono_instances: int,
305 isar_shrink_factor: int,
308 preplay_timeout: Time.time,
311 datatype prover_fact =
312 Untranslated_Fact of (string * locality) * thm |
313 SMT_Weighted_Fact of (string * locality) * (int option * thm)
315 type prover_problem =
320 facts: prover_fact list,
321 smt_filter: (string * locality) SMT_Solver.smt_filter_data option}
324 {outcome: failure option,
325 used_facts: (string * locality) list,
326 run_time_in_msecs: int option,
327 preplay: unit -> play,
328 message: play -> string,
329 message_tail: string}
332 params -> (string -> minimize_command) -> prover_problem -> prover_result
335 (* configuration attributes *)
337 val concealed_lambdasN = "concealed_lambdas"
338 val lambda_liftingN = "lambda_lifting"
339 val combinatorsN = "combinators"
340 val lambdasN = "lambdas"
343 (* Empty string means create files in Isabelle's temporary files directory. *)
345 Attrib.setup_config_string @{binding sledgehammer_dest_dir} (K "")
347 Attrib.setup_config_string @{binding sledgehammer_problem_prefix} (K "prob")
348 val measure_run_time =
349 Attrib.setup_config_bool @{binding sledgehammer_measure_run_time} (K false)
351 val atp_lambda_translation =
352 Attrib.setup_config_string @{binding sledgehammer_atp_lambda_translation}
354 (* In addition to being easier to read, readable names are often much shorter,
355 especially if types are mangled in names. For these reason, they are enabled
357 val atp_readable_names =
358 Attrib.setup_config_bool @{binding sledgehammer_atp_readable_names} (K true)
361 Attrib.setup_config_bool @{binding sledgehammer_smt_triggers} (K true)
363 Attrib.setup_config_bool @{binding sledgehammer_smt_weights} (K true)
364 val smt_weight_min_facts =
365 Attrib.setup_config_int @{binding sledgehammer_smt_weight_min_facts} (K 20)
369 Attrib.setup_config_int @{binding sledgehammer_smt_min_weight} (K 0)
371 Attrib.setup_config_int @{binding sledgehammer_smt_max_weight} (K 10)
372 val smt_max_weight_index =
373 Attrib.setup_config_int @{binding sledgehammer_smt_max_weight_index} (K 200)
374 val smt_weight_curve = Unsynchronized.ref (fn x : int => x * x)
376 fun smt_fact_weight ctxt j num_facts =
377 if Config.get ctxt smt_weights andalso
378 num_facts >= Config.get ctxt smt_weight_min_facts then
380 val min = Config.get ctxt smt_min_weight
381 val max = Config.get ctxt smt_max_weight
382 val max_index = Config.get ctxt smt_max_weight_index
383 val curve = !smt_weight_curve
385 SOME (max - (max - min + 1) * curve (Int.max (0, max_index - j - 1))
391 fun weight_smt_fact ctxt num_facts ((info, th), j) =
392 let val thy = Proof_Context.theory_of ctxt in
393 (info, (smt_fact_weight ctxt j num_facts, th |> Thm.transfer thy))
396 fun untranslated_fact (Untranslated_Fact p) = p
397 | untranslated_fact (SMT_Weighted_Fact (info, (_, th))) = (info, th)
398 fun smt_weighted_fact _ _ (SMT_Weighted_Fact p, _) = p
399 | smt_weighted_fact ctxt num_facts (fact, j) =
400 (untranslated_fact fact, j) |> weight_smt_fact ctxt num_facts
402 fun overlord_file_location_for_prover prover =
403 (getenv "ISABELLE_HOME_USER", "prob_" ^ prover)
405 fun with_path cleanup after f path =
407 |> tap (fn _ => cleanup path)
411 fun proof_banner mode name =
413 Auto_Try => "Auto Sledgehammer (" ^ quote name ^ ") found a proof"
414 | Try => "Sledgehammer (" ^ quote name ^ ") found a proof"
417 (* based on "Mirabelle.can_apply" and generalized *)
418 fun timed_apply timeout tac state i =
420 val {context = ctxt, facts, goal} = Proof.goal state
421 val full_tac = Method.insert_tac facts i THEN tac ctxt i
422 in TimeLimit.timeLimit timeout (try (Seq.pull o full_tac)) goal end
424 fun tac_for_reconstructor Metis =
425 Metis_Tactics.metis_tac [Metis_Tactics.partial_type_enc]
426 | tac_for_reconstructor Metis_Full_Types =
427 Metis_Tactics.metis_tac Metis_Tactics.full_type_syss
428 | tac_for_reconstructor Metis_No_Types =
429 Metis_Tactics.metis_tac [Metis_Tactics.no_type_enc]
430 | tac_for_reconstructor _ = raise Fail "unexpected reconstructor"
432 fun timed_reconstructor reconstructor debug timeout ths =
433 (Config.put Metis_Tactics.verbose debug
434 #> (fn ctxt => tac_for_reconstructor reconstructor ctxt ths))
435 |> timed_apply timeout
437 fun filter_used_facts used = filter (member (op =) used o fst)
439 fun play_one_line_proof debug timeout ths state i reconstructors =
441 fun play [] [] = Failed_to_Play (hd reconstructors)
442 | play timed_outs [] = Trust_Playable (List.last timed_outs, SOME timeout)
443 | play timed_out (reconstructor :: reconstructors) =
444 let val timer = Timer.startRealTimer () in
445 case timed_reconstructor reconstructor debug timeout ths state i of
446 SOME (SOME _) => Played (reconstructor, Timer.checkRealTimer timer)
447 | _ => play timed_out reconstructors
449 handle TimeLimit.TimeOut =>
450 play (reconstructor :: timed_out) reconstructors
452 if timeout = Time.zeroTime then Trust_Playable (hd reconstructors, NONE)
453 else play [] reconstructors
457 (* generic TPTP-based ATPs *)
459 (* Too general means, positive equality literal with a variable X as one
460 operand, when X does not occur properly in the other operand. This rules out
461 clearly inconsistent facts such as X = a | X = b, though it by no means
462 guarantees soundness. *)
464 (* Unwanted equalities are those between a (bound or schematic) variable that
465 does not properly occur in the second operand. *)
466 val is_exhaustive_finite =
468 fun is_bad_equal (Var z) t =
469 not (exists_subterm (fn Var z' => z = z' | _ => false) t)
470 | is_bad_equal (Bound j) t = not (loose_bvar1 (t, j))
471 | is_bad_equal _ _ = false
472 fun do_equals t1 t2 = is_bad_equal t1 t2 orelse is_bad_equal t2 t1
473 fun do_formula pos t =
475 (_, @{const Trueprop} $ t1) => do_formula pos t1
476 | (true, Const (@{const_name all}, _) $ Abs (_, _, t')) =>
478 | (true, Const (@{const_name All}, _) $ Abs (_, _, t')) =>
480 | (false, Const (@{const_name Ex}, _) $ Abs (_, _, t')) =>
482 | (_, @{const "==>"} $ t1 $ t2) =>
483 do_formula (not pos) t1 andalso
484 (t2 = @{prop False} orelse do_formula pos t2)
485 | (_, @{const HOL.implies} $ t1 $ t2) =>
486 do_formula (not pos) t1 andalso
487 (t2 = @{const False} orelse do_formula pos t2)
488 | (_, @{const Not} $ t1) => do_formula (not pos) t1
489 | (true, @{const HOL.disj} $ t1 $ t2) => forall (do_formula pos) [t1, t2]
490 | (false, @{const HOL.conj} $ t1 $ t2) => forall (do_formula pos) [t1, t2]
491 | (true, Const (@{const_name HOL.eq}, _) $ t1 $ t2) => do_equals t1 t2
492 | (true, Const (@{const_name "=="}, _) $ t1 $ t2) => do_equals t1 t2
494 in do_formula true end
496 fun has_bound_or_var_of_type pred =
497 exists_subterm (fn Var (_, T as Type _) => pred T
498 | Abs (_, T as Type _, _) => pred T
501 (* Facts are forbidden to contain variables of these types. The typical reason
502 is that they lead to unsoundness. Note that "unit" satisfies numerous
503 equations like "?x = ()". The resulting clauses will have no type constraint,
504 yielding false proofs. Even "bool" leads to many unsound proofs, though only
505 for higher-order problems. *)
507 (* Facts containing variables of type "unit" or "bool" or of the form
508 "ALL x. x = A | x = B | x = C" are likely to lead to unsound proofs if types
510 fun is_dangerous_prop ctxt =
512 #> (has_bound_or_var_of_type (is_type_surely_finite ctxt false) orf
513 is_exhaustive_finite)
515 fun int_opt_add (SOME m) (SOME n) = SOME (m + n)
516 | int_opt_add _ _ = NONE
518 (* Important messages are important but not so important that users want to see
520 val atp_important_message_keep_quotient = 10
522 fun choose_format_and_type_enc best_type_enc formats type_enc_opt =
523 (case type_enc_opt of
525 | NONE => type_enc_from_string best_type_enc)
526 |> choose_format formats
528 fun lift_lambdas ctxt ts =
529 case SMT_Translate.lift_lambdas ctxt false ts |> snd of
530 (defs, [t]) => [foldr1 HOLogic.mk_conj (t :: defs)] (* FIXME: hack *)
531 | (defs, ts) => ts @ defs
533 fun translate_atp_lambdas ctxt type_enc =
534 Config.get ctxt atp_lambda_translation
536 if trans = smartN then
537 if is_type_enc_higher_order type_enc then lambdasN else combinatorsN
538 else if trans = lambdasN andalso
539 not (is_type_enc_higher_order type_enc) then
540 error ("Lambda translation method incompatible with \
541 \first-order encoding.")
545 if trans = concealed_lambdasN then map (conceal_lambdas ctxt)
546 else if trans = lambda_liftingN then lift_lambdas ctxt
547 else if trans = combinatorsN then map (introduce_combinators ctxt)
548 else if trans = lambdasN then map Envir.eta_contract
549 else error ("Unknown lambda translation method: " ^ quote trans ^ "."))
551 val metis_minimize_max_time = seconds 2.0
553 fun choose_minimize_command minimize_command name preplay =
555 Played (reconstructor, time) =>
556 if Time.<= (time, metis_minimize_max_time) then
557 prover_name_for_reconstructor reconstructor |> the_default name
563 fun repair_monomorph_context max_iters max_new_instances =
564 Config.put Monomorph.max_rounds max_iters
565 #> Config.put Monomorph.max_new_instances max_new_instances
566 #> Config.put Monomorph.keep_partial_instances false
568 (* Give the ATPs some slack before interrupting them the hard way. "z3_atp" on
569 Linux appears to be the only ATP that does not honor its time limit. *)
570 val atp_timeout_slack = seconds 1.0
572 fun run_atp mode name
573 ({exec, required_execs, arguments, proof_delims, known_failures,
574 conj_sym_kind, prem_kind, formats, best_slices, ...} : atp_config)
575 ({debug, verbose, overlord, type_enc, sound, max_relevant,
576 max_mono_iters, max_new_mono_instances, isar_proof,
577 isar_shrink_factor, slicing, timeout, preplay_timeout, ...} : params)
579 ({state, goal, subgoal, subgoal_count, facts, ...} : prover_problem) =
581 val thy = Proof.theory_of state
582 val ctxt = Proof.context_of state
583 val (_, hyp_ts, concl_t) = strip_subgoal ctxt goal subgoal
584 val (dest_dir, problem_prefix) =
585 if overlord then overlord_file_location_for_prover name
586 else (Config.get ctxt dest_dir, Config.get ctxt problem_prefix)
587 val problem_file_name =
588 Path.basic (problem_prefix ^ (if overlord then "" else serial_string ()) ^
589 "_" ^ string_of_int subgoal)
590 val problem_path_name =
591 if dest_dir = "" then
592 File.tmp_path problem_file_name
593 else if File.exists (Path.explode dest_dir) then
594 Path.append (Path.explode dest_dir) problem_file_name
596 error ("No such directory: " ^ quote dest_dir ^ ".")
597 val measure_run_time = verbose orelse Config.get ctxt measure_run_time
598 val command = Path.explode (getenv (fst exec) ^ "/" ^ snd exec)
601 val split = String.tokens (fn c => str c = "\n")
602 val (output, t) = s |> split |> split_last |> apfst cat_lines
603 fun as_num f = f >> (fst o read_int)
604 val num = as_num (Scan.many1 Symbol.is_ascii_digit)
605 val digit = Scan.one Symbol.is_ascii_digit
606 val num3 = as_num (digit ::: digit ::: (digit >> single))
607 val time = num --| Scan.$$ "." -- num3 >> (fn (a, b) => a * 1000 + b)
608 val as_time = Scan.read Symbol.stopper time o raw_explode
609 in (output, as_time t) end
610 fun run_on prob_file =
611 case filter (curry (op =) "" o getenv o fst) (exec :: required_execs) of
612 (home_var, _) :: _ =>
613 error ("The environment variable " ^ quote home_var ^ " is not set.")
615 if File.exists command then
617 (* If slicing is disabled, we expand the last slice to fill the
618 entire time available. *)
619 val actual_slices = get_slices slicing (best_slices ctxt)
620 val num_actual_slices = length actual_slices
621 fun monomorphize_facts facts =
624 ctxt |> repair_monomorph_context max_mono_iters
625 max_new_mono_instances
626 (* pseudo-theorem involving the same constants as the subgoal *)
628 Logic.list_implies (hyp_ts, concl_t)
629 |> Skip_Proof.make_thm thy
631 facts |> chop (length facts div 4)
632 |>> map (pair 1 o snd)
633 ||> map (pair 2 o snd)
635 |> cons (0, subgoal_th)
637 Monomorph.monomorph atp_schematic_consts_of rths ctxt
639 |> curry ListPair.zip (map fst facts)
640 |> maps (fn (name, rths) => map (pair name o snd) rths)
642 fun run_slice (slice, (time_frac, (complete,
643 (best_max_relevant, best_type_enc, extra))))
647 length facts |> is_none max_relevant
648 ? Integer.min best_max_relevant
649 val (format, type_enc) =
650 choose_format_and_type_enc best_type_enc formats type_enc
651 val fairly_sound = is_type_enc_fairly_sound type_enc
653 facts |> map untranslated_fact
655 ? filter_out (is_dangerous_prop ctxt o prop_of o snd)
657 |> polymorphism_of_type_enc type_enc <> Polymorphic
659 |> map (apsnd prop_of)
660 val real_ms = Real.fromInt o Time.toMilliseconds
663 |> (if slice < num_actual_slices - 1 then
664 curry Real.min (time_frac * real_ms timeout)
668 val generous_slice_timeout =
669 Time.+ (slice_timeout, atp_timeout_slack)
672 quote name ^ " slice #" ^ string_of_int (slice + 1) ^
673 " with " ^ string_of_int num_facts ^ " fact" ^
674 plural_s num_facts ^ " for " ^
675 string_from_time slice_timeout ^ "..."
676 |> Output.urgent_message
679 val (atp_problem, pool, conjecture_offset, facts_offset,
680 fact_names, typed_helpers, sym_tab) =
681 prepare_atp_problem ctxt format conj_sym_kind prem_kind
682 type_enc sound false (translate_atp_lambdas ctxt type_enc)
683 (Config.get ctxt atp_readable_names) true hyp_ts concl_t
685 fun weights () = atp_problem_weights atp_problem
686 val full_proof = debug orelse isar_proof
688 File.shell_path command ^ " " ^
689 arguments ctxt full_proof extra slice_timeout weights ^ " " ^
690 File.shell_path prob_file
692 (if measure_run_time then
693 "TIMEFORMAT='%3R'; { time " ^ core ^ " ; }"
695 "exec " ^ core) ^ " 2>&1"
698 |> tptp_lines_for_atp_problem format
699 |> cons ("% " ^ command ^ "\n")
700 |> File.write_list prob_file
701 val conjecture_shape =
702 conjecture_offset + 1
703 upto conjecture_offset + length hyp_ts + 1
705 val ((output, msecs), (atp_proof, outcome)) =
706 TimeLimit.timeLimit generous_slice_timeout Isabelle_System.bash_output command
707 |>> (if overlord then
708 prefix ("% " ^ command ^ "\n% " ^ timestamp () ^ "\n")
712 |> (if measure_run_time then split_time else rpair NONE)
713 |> (fn accum as (output, _) =>
715 extract_tstplike_proof_and_outcome verbose complete
716 proof_delims known_failures output
717 |>> atp_proof_from_tstplike_proof atp_problem output
718 handle UNRECOGNIZED_ATP_PROOF () =>
719 ([], SOME ProofIncomplete)))
720 handle TimeLimit.TimeOut =>
721 (("", SOME (Time.toMilliseconds slice_timeout)),
726 used_facts_in_unsound_atp_proof ctxt
727 conjecture_shape facts_offset fact_names atp_proof
728 |> Option.map (fn facts =>
730 (if is_type_enc_virtually_sound type_enc then
733 NONE, facts |> sort string_ord))
736 ((pool, conjecture_shape, facts_offset, fact_names,
737 typed_helpers, sym_tab),
738 (output, msecs, atp_proof, outcome))
740 val timer = Timer.startRealTimer ()
741 fun maybe_run_slice slice (result as (_, (_, msecs0, _, SOME _))) =
743 val time_left = Time.- (timeout, Timer.checkRealTimer timer)
745 if Time.<= (time_left, Time.zeroTime) then
748 (run_slice slice time_left
749 |> (fn (stuff, (output, msecs, atp_proof, outcome)) =>
750 (stuff, (output, int_opt_add msecs0 msecs,
751 atp_proof, outcome))))
753 | maybe_run_slice _ result = result
755 ((Symtab.empty, [], 0, Vector.fromList [], [], Symtab.empty),
756 ("", SOME 0, [], SOME InternalError))
757 |> fold maybe_run_slice actual_slices
760 error ("Bad executable: " ^ Path.print command)
762 (* If the problem file has not been exported, remove it; otherwise, export
763 the proof file too. *)
764 fun cleanup prob_file =
765 if dest_dir = "" then try File.rm prob_file else NONE
766 fun export prob_file (_, (output, _, _, _)) =
767 if dest_dir = "" then
770 File.write (Path.explode (Path.implode prob_file ^ "_proof")) output
771 val ((pool, conjecture_shape, facts_offset, fact_names, typed_helpers,
773 (output, msecs, atp_proof, outcome)) =
774 with_path cleanup export run_on problem_path_name
775 val important_message =
776 if mode = Normal andalso
777 random_range 0 (atp_important_message_keep_quotient - 1) = 0 then
778 extract_important_message output
781 val (used_facts, preplay, message, message_tail) =
786 used_facts_in_atp_proof ctxt facts_offset fact_names atp_proof
792 facts |> map untranslated_fact |> filter_used_facts used_facts
795 (if mode = Minimize then
796 Output.urgent_message "Preplaying proof..."
799 play_one_line_proof debug preplay_timeout used_ths state subgoal
804 val full_types = uses_typed_helpers typed_helpers atp_proof
806 (debug, full_types, isar_shrink_factor, pool,
807 conjecture_shape, facts_offset, fact_names, sym_tab,
809 val one_line_params =
810 (preplay, proof_banner mode name, used_facts,
811 choose_minimize_command minimize_command name preplay,
812 subgoal, subgoal_count)
813 in proof_text ctxt isar_proof isar_params one_line_params end,
815 "\nATP real CPU time: " ^
816 string_from_time (Time.fromMilliseconds (the msecs)) ^ "."
819 (if important_message <> "" then
820 "\n\nImportant message from Dr. Geoff Sutcliffe:\n" ^
826 ([], K (Failed_to_Play Metis), fn _ => string_for_failure failure, "")
828 {outcome = outcome, used_facts = used_facts, run_time_in_msecs = msecs,
829 preplay = preplay, message = message, message_tail = message_tail}
832 (* "SMT_Failure.Abnormal_Termination" carries the solver's return code. Until
833 these are sorted out properly in the SMT module, we have to interpret these
835 val remote_smt_failures =
839 [(101, OutOfResources),
840 (103, MalformedInput),
841 (110, MalformedInput)]
844 val smt_failures = remote_smt_failures @ z3_failures @ unix_failures
846 fun failure_from_smt_failure (SMT_Failure.Counterexample {is_real_cex, ...}) =
847 if is_real_cex then Unprovable else GaveUp
848 | failure_from_smt_failure SMT_Failure.Time_Out = TimedOut
849 | failure_from_smt_failure (SMT_Failure.Abnormal_Termination code) =
850 (case AList.lookup (op =) smt_failures code of
851 SOME failure => failure
852 | NONE => UnknownError ("Abnormal termination with exit code " ^
853 string_of_int code ^ "."))
854 | failure_from_smt_failure SMT_Failure.Out_Of_Memory = OutOfResources
855 | failure_from_smt_failure (SMT_Failure.Other_Failure msg) =
860 Attrib.setup_config_int @{binding sledgehammer_smt_max_slices} (K 8)
861 val smt_slice_fact_frac =
862 Attrib.setup_config_real @{binding sledgehammer_smt_slice_fact_frac} (K 0.5)
863 val smt_slice_time_frac =
864 Attrib.setup_config_real @{binding sledgehammer_smt_slice_time_frac} (K 0.5)
865 val smt_slice_min_secs =
866 Attrib.setup_config_int @{binding sledgehammer_smt_slice_min_secs} (K 5)
868 fun smt_filter_loop ctxt name
869 ({debug, verbose, overlord, max_mono_iters,
870 max_new_mono_instances, timeout, slicing, ...} : params)
873 val max_slices = if slicing then Config.get ctxt smt_max_slices else 1
875 select_smt_solver name
877 Config.put SMT_Config.debug_files
878 (overlord_file_location_for_prover name
879 |> (fn (path, name) => path ^ "/" ^ name))
882 #> Config.put SMT_Config.infer_triggers (Config.get ctxt smt_triggers)
883 val state = state |> Proof.map_context repair_context
884 fun do_slice timeout slice outcome0 time_so_far facts =
886 val timer = Timer.startRealTimer ()
888 state |> Proof.map_context
889 (repair_monomorph_context max_mono_iters
890 max_new_mono_instances)
891 val ms = timeout |> Time.toMilliseconds
893 if slice < max_slices then
895 Int.max (1000 * Config.get ctxt smt_slice_min_secs,
896 Real.ceil (Config.get ctxt smt_slice_time_frac
898 |> Time.fromMilliseconds
901 val num_facts = length facts
904 quote name ^ " slice " ^ string_of_int slice ^ " with " ^
905 string_of_int num_facts ^ " fact" ^ plural_s num_facts ^ " for " ^
906 string_from_time slice_timeout ^ "..."
907 |> Output.urgent_message
910 val birth = Timer.checkRealTimer timer
912 if debug then Output.urgent_message "Invoking SMT solver..." else ()
913 val (outcome, used_facts) =
914 (case (slice, smt_filter) of
915 (1, SOME head) => head |> apsnd (apsnd repair_context)
916 | _ => SMT_Solver.smt_filter_preprocess state facts i)
917 |> SMT_Solver.smt_filter_apply slice_timeout
918 |> (fn {outcome, used_facts} => (outcome, used_facts))
919 handle exn => if Exn.is_interrupt exn then
922 (ML_Compiler.exn_message exn
923 |> SMT_Failure.Other_Failure |> SOME, [])
924 val death = Timer.checkRealTimer timer
925 val outcome0 = if is_none outcome0 then SOME outcome else outcome0
926 val time_so_far = Time.+ (time_so_far, Time.- (death, birth))
927 val too_many_facts_perhaps =
930 | SOME (SMT_Failure.Counterexample _) => false
931 | SOME SMT_Failure.Time_Out => slice_timeout <> timeout
932 | SOME (SMT_Failure.Abnormal_Termination _) => true (* kind of *)
933 | SOME SMT_Failure.Out_Of_Memory => true
934 | SOME (SMT_Failure.Other_Failure _) => true
935 val timeout = Time.- (timeout, Timer.checkRealTimer timer)
937 if too_many_facts_perhaps andalso slice < max_slices andalso
938 num_facts > 0 andalso Time.> (timeout, Time.zeroTime) then
941 Real.ceil (Config.get ctxt smt_slice_fact_frac
942 * Real.fromInt num_facts)
944 if verbose andalso is_some outcome then
945 quote name ^ " invoked with " ^ string_of_int num_facts ^
946 " fact" ^ plural_s num_facts ^ ": " ^
947 string_for_failure (failure_from_smt_failure (the outcome)) ^
948 " Retrying with " ^ string_of_int new_num_facts ^ " fact" ^
949 plural_s new_num_facts ^ "..."
950 |> Output.urgent_message
954 facts |> take new_num_facts
955 |> do_slice timeout (slice + 1) outcome0 time_so_far
958 {outcome = if is_none outcome then NONE else the outcome0,
959 used_facts = used_facts,
960 run_time_in_msecs = SOME (Time.toMilliseconds time_so_far)}
962 in do_slice timeout 1 NONE Time.zeroTime end
964 fun run_smt_solver mode name (params as {debug, verbose, preplay_timeout, ...})
966 ({state, subgoal, subgoal_count, facts, smt_filter, ...}
969 val ctxt = Proof.context_of state
970 val num_facts = length facts
971 val facts = facts ~~ (0 upto num_facts - 1)
972 |> map (smt_weighted_fact ctxt num_facts)
973 val {outcome, used_facts, run_time_in_msecs} =
974 smt_filter_loop ctxt name params state subgoal smt_filter facts
975 val (used_facts, used_ths) = used_facts |> ListPair.unzip
976 val outcome = outcome |> Option.map failure_from_smt_failure
977 val (preplay, message, message_tail) =
982 fun smt_settings () =
983 if name = SMT_Solver.solver_name_of ctxt then ""
984 else "smt_solver = " ^ maybe_quote name
986 case play_one_line_proof debug preplay_timeout used_ths state
987 subgoal metis_reconstructors of
989 | _ => Trust_Playable (SMT (smt_settings ()), NONE)
993 val one_line_params =
994 (preplay, proof_banner mode name, used_facts,
995 choose_minimize_command minimize_command name preplay,
996 subgoal, subgoal_count)
997 in one_line_proof_text one_line_params end,
999 "\nSMT solver real CPU time: " ^
1000 string_from_time (Time.fromMilliseconds
1001 (the run_time_in_msecs)) ^ "."
1005 (K (Failed_to_Play Metis), fn _ => string_for_failure failure, "")
1007 {outcome = outcome, used_facts = used_facts,
1008 run_time_in_msecs = run_time_in_msecs, preplay = preplay,
1009 message = message, message_tail = message_tail}
1012 fun run_metis mode name ({debug, timeout, ...} : params) minimize_command
1013 ({state, subgoal, subgoal_count, facts, ...} : prover_problem) =
1016 case AList.lookup (op =) metis_prover_infos name of
1018 | NONE => raise Fail ("unknown Metis version: " ^ quote name)
1019 val (used_facts, used_ths) =
1020 facts |> map untranslated_fact |> ListPair.unzip
1022 case play_one_line_proof debug timeout used_ths state subgoal
1024 play as Played (_, time) =>
1025 {outcome = NONE, used_facts = used_facts,
1026 run_time_in_msecs = SOME (Time.toMilliseconds time),
1028 message = fn play =>
1030 val one_line_params =
1031 (play, proof_banner mode name, used_facts,
1032 minimize_command name, subgoal, subgoal_count)
1033 in one_line_proof_text one_line_params end,
1037 val failure = case play of Failed_to_Play _ => GaveUp | _ => TimedOut
1039 {outcome = SOME failure, used_facts = [], run_time_in_msecs = NONE,
1040 preplay = K play, message = fn _ => string_for_failure failure,
1045 fun get_prover ctxt mode name =
1046 let val thy = Proof_Context.theory_of ctxt in
1047 if is_metis_prover name then run_metis mode name
1048 else if is_atp thy name then run_atp mode name (get_atp thy name)
1049 else if is_smt_prover ctxt name then run_smt_solver mode name
1050 else error ("No such prover: " ^ name ^ ".")