don't store fresh names in fact graph, since these cannot be the parents of any other facts
1 (* Title: HOL/Tools/Sledgehammer/sledgehammer_mash.ML
2 Author: Jasmin Blanchette, TU Muenchen
4 Sledgehammer's machine-learning-based relevance filter (MaSh).
7 signature SLEDGEHAMMER_MASH =
9 type stature = ATP_Problem_Generate.stature
10 type fact = Sledgehammer_Fact.fact
11 type fact_override = Sledgehammer_Fact.fact_override
12 type params = Sledgehammer_Provers.params
13 type relevance_fudge = Sledgehammer_Provers.relevance_fudge
14 type prover_result = Sledgehammer_Provers.prover_result
16 val trace : bool Config.T
22 val learn_isarN : string
23 val learn_atpN : string
24 val relearn_isarN : string
25 val relearn_atpN : string
26 val fact_filters : string list
27 val escape_meta : string -> string
28 val escape_metas : string list -> string
29 val unescape_meta : string -> string
30 val unescape_metas : string -> string list
31 val extract_query : string -> string * string list
32 val nickname_of : thm -> string
33 val suggested_facts : string list -> ('a * thm) list -> ('a * thm) list
35 int -> (('a * thm) list * ('a * thm) list) list -> ('a * thm) list
36 val is_likely_tautology_or_too_meta : thm -> bool
37 val theory_ord : theory * theory -> order
38 val thm_ord : thm * thm -> order
39 val goal_of_thm : theory -> thm -> thm
40 val run_prover_for_mash :
41 Proof.context -> params -> string -> fact list -> thm -> prover_result
43 Proof.context -> string -> theory -> stature -> term list -> string list
44 val isar_dependencies_of : unit Symtab.table -> thm -> string list
45 val atp_dependencies_of :
46 Proof.context -> params -> string -> bool -> fact list -> unit Symtab.table
48 val mash_CLEAR : Proof.context -> unit
51 -> (string * string list * string list * string list) list -> unit
53 Proof.context -> bool -> int -> string list * string list -> string list
54 val mash_unlearn : Proof.context -> unit
55 val mash_could_suggest_facts : unit -> bool
56 val mash_can_suggest_facts : Proof.context -> bool
57 val mash_suggest_facts :
58 Proof.context -> params -> string -> int -> term list -> term
59 -> ('a * thm) list -> ('a * thm) list * ('a * thm) list
60 val mash_learn_proof :
61 Proof.context -> params -> string -> term -> ('a * thm) list -> thm list
63 val mash_learn_facts :
64 Proof.context -> params -> string -> bool -> bool -> Time.time -> fact list
67 Proof.context -> params -> fact_override -> thm list -> bool -> unit
69 Proof.context -> params -> string -> int -> fact_override -> term list
70 -> term -> fact list -> fact list
71 val kill_learners : unit -> unit
72 val running_learners : unit -> unit
75 structure Sledgehammer_MaSh : SLEDGEHAMMER_MASH =
79 open ATP_Problem_Generate
80 open Sledgehammer_Util
81 open Sledgehammer_Fact
82 open Sledgehammer_Provers
83 open Sledgehammer_Minimize
84 open Sledgehammer_MePo
87 Attrib.setup_config_bool @{binding sledgehammer_mash_trace} (K false)
88 fun trace_msg ctxt msg = if Config.get ctxt trace then tracing (msg ()) else ()
96 val fact_filters = [meshN, mepoN, mashN]
98 val unlearnN = "unlearn"
99 val learn_isarN = "learn_isar"
100 val learn_atpN = "learn_atp"
101 val relearn_isarN = "relearn_isar"
102 val relearn_atpN = "relearn_atp"
104 fun mash_home () = getenv "MASH_HOME"
105 fun mash_model_dir () =
106 getenv "ISABELLE_HOME_USER" ^ "/mash"
107 |> tap (Isabelle_System.mkdir o Path.explode)
108 val mash_state_dir = mash_model_dir
109 fun mash_state_path () = mash_state_dir () ^ "/state" |> Path.explode
112 (*** Isabelle helpers ***)
115 if Char.isAlphaNum c orelse c = #"_" orelse c = #"." orelse c = #"(" orelse
116 c = #")" orelse c = #"," then
119 (* fixed width, in case more digits follow *)
120 "%" ^ stringN_of_int 3 (Char.ord c)
122 fun unmeta_chars accum [] = String.implode (rev accum)
123 | unmeta_chars accum (#"%" :: d1 :: d2 :: d3 :: cs) =
124 (case Int.fromString (String.implode [d1, d2, d3]) of
125 SOME n => unmeta_chars (Char.chr n :: accum) cs
126 | NONE => "" (* error *))
127 | unmeta_chars _ (#"%" :: _) = "" (* error *)
128 | unmeta_chars accum (c :: cs) = unmeta_chars (c :: accum) cs
130 val escape_meta = String.translate meta_char
131 val escape_metas = map escape_meta #> space_implode " "
132 val unescape_meta = String.explode #> unmeta_chars []
134 space_explode " " #> filter_out (curry (op =) "") #> map unescape_meta
136 fun extract_query line =
137 case space_explode ":" line of
138 [goal_name, suggs] => (unescape_meta goal_name, unescape_metas suggs)
141 fun parent_of_local_thm th =
143 val thy = th |> Thm.theory_of_thm
144 val facts = thy |> Global_Theory.facts_of
145 val space = facts |> Facts.space_of
146 fun id_of s = #id (Name_Space.the_entry space s)
147 fun max_id (s', _) (s, id) =
148 let val id' = id_of s' in if id > id' then (s, id) else (s', id') end
149 in ("", ~1) |> Facts.fold_static max_id facts |> fst end
151 val local_prefix = "local" ^ Long_Name.separator
154 if Thm.has_name_hint th then
155 let val hint = Thm.get_name_hint th in
156 (* FIXME: There must be a better way to detect local facts. *)
157 case try (unprefix local_prefix) hint of
159 parent_of_local_thm th ^ Long_Name.separator ^ Long_Name.separator ^ suf
165 fun suggested_facts suggs facts =
167 fun add_fact (fact as (_, th)) = Symtab.default (nickname_of th, fact)
168 val tab = Symtab.empty |> fold add_fact facts
169 in map_filter (Symtab.lookup tab) suggs end
171 (* Ad hoc score function roughly based on Blanchette's Ringberg 2011 data. *)
172 fun score x = Math.pow (1.5, 15.5 - 0.05 * Real.fromInt x) + 15.0
174 fun sum_sq_avg [] = 0
176 Real.ceil (100000.0 * fold (curry (op +) o score) xs 0.0) div length xs
178 fun mesh_facts max_facts [(selected, unknown)] =
179 take max_facts selected @ take (max_facts - length selected) unknown
180 | mesh_facts max_facts mess =
182 val mess = mess |> map (apfst (`length))
183 val fact_eq = Thm.eq_thm o pairself snd
184 fun score_in fact ((sel_len, sels), unks) =
185 case find_index (curry fact_eq fact) sels of
186 ~1 => (case find_index (curry fact_eq fact) unks of
190 fun score_of fact = mess |> map_filter (score_in fact) |> sum_sq_avg
191 val facts = fold (union fact_eq o take max_facts o snd o fst) mess []
193 facts |> map (`score_of) |> sort (int_ord o swap o pairself fst)
194 |> map snd |> take max_facts
197 val thy_feature_name_of = prefix "y"
198 val const_name_of = prefix "c"
199 val type_name_of = prefix "t"
200 val class_name_of = prefix "s"
202 fun is_likely_tautology_or_too_meta th =
204 val is_boring_const = member (op =) atp_widely_irrelevant_consts
205 fun is_boring_bool t =
206 not (exists_Const (not o is_boring_const o fst) t) orelse
207 exists_type (exists_subtype (curry (op =) @{typ prop})) t
208 fun is_boring_prop (@{const Trueprop} $ t) = is_boring_bool t
209 | is_boring_prop (@{const "==>"} $ t $ u) =
210 is_boring_prop t andalso is_boring_prop u
211 | is_boring_prop (Const (@{const_name all}, _) $ (Abs (_, _, t)) $ u) =
212 is_boring_prop t andalso is_boring_prop u
213 | is_boring_prop (Const (@{const_name "=="}, _) $ t $ u) =
214 is_boring_bool t andalso is_boring_bool u
215 | is_boring_prop _ = true
217 is_boring_prop (prop_of th) andalso not (Thm.eq_thm_prop (@{thm ext}, th))
221 if Theory.eq_thy p then
223 else if Theory.subthy p then
225 else if Theory.subthy (swap p) then
227 else case int_ord (pairself (length o Theory.ancestors_of) p) of
228 EQUAL => string_ord (pairself Context.theory_name p)
231 val thm_ord = theory_ord o pairself theory_of_thm
233 val freezeT = Type.legacy_freeze_type
235 fun freeze (t $ u) = freeze t $ freeze u
236 | freeze (Abs (s, T, t)) = Abs (s, freezeT T, freeze t)
237 | freeze (Var ((s, _), T)) = Free (s, freezeT T)
238 | freeze (Const (s, T)) = Const (s, freezeT T)
239 | freeze (Free (s, T)) = Free (s, freezeT T)
242 fun goal_of_thm thy = prop_of #> freeze #> cterm_of thy #> Goal.init
244 fun run_prover_for_mash ctxt params prover facts goal =
247 {state = Proof.init ctxt, goal = goal, subgoal = 1, subgoal_count = 1,
248 facts = facts |> map (apfst (apfst (fn name => name ())))
249 |> map Untranslated_Fact}
251 get_minimizing_prover ctxt MaSh (K (K ())) prover params (K (K (K "")))
255 val bad_types = [@{type_name prop}, @{type_name bool}, @{type_name fun}]
258 [@{const_name prop}, @{const_name Pure.conjunction}] @ atp_logical_consts
260 fun interesting_terms_types_and_classes ctxt prover term_max_depth
263 fun is_bad_const (x as (s, _)) args =
264 member (op =) logical_consts s orelse
265 fst (is_built_in_const_for_prover ctxt prover x args)
266 fun add_classes @{sort type} = I
267 | add_classes S = union (op =) (map class_name_of S)
268 fun do_add_type (Type (s, Ts)) =
269 (not (member (op =) bad_types s) ? insert (op =) (type_name_of s))
270 #> fold do_add_type Ts
271 | do_add_type (TFree (_, S)) = add_classes S
272 | do_add_type (TVar (_, S)) = add_classes S
273 fun add_type T = type_max_depth >= 0 ? do_add_type T
275 if member (op <>) args "" then s ^ "(" ^ space_implode "," args ^ ")"
277 fun patternify ~1 _ = ""
278 | patternify depth t =
280 (Const (x as (s, _)), args) =>
281 if is_bad_const x args then ""
282 else mk_app (const_name_of s) (map (patternify (depth - 1)) args)
284 fun add_term_patterns ~1 _ = I
285 | add_term_patterns depth t =
286 insert (op =) (patternify depth t)
287 #> add_term_patterns (depth - 1) t
288 val add_term = add_term_patterns term_max_depth
290 let val (head, args) = strip_comb t in
292 Const (_, T) => add_term t #> add_type T
293 | Free (_, T) => add_type T
294 | Var (_, T) => add_type T
295 | Abs (_, T, body) => add_type T #> add_patterns body
297 #> fold add_patterns args
299 in [] |> fold add_patterns ts end
301 fun is_exists (s, _) = (s = @{const_name Ex} orelse s = @{const_name Ex1})
303 val term_max_depth = 1
304 val type_max_depth = 1
306 (* TODO: Generate type classes for types? *)
307 fun features_of ctxt prover thy (scope, status) ts =
308 thy_feature_name_of (Context.theory_name thy) ::
309 interesting_terms_types_and_classes ctxt prover term_max_depth type_max_depth
311 |> forall is_lambda_free ts ? cons "no_lams"
312 |> forall (not o exists_Const is_exists) ts ? cons "no_skos"
313 |> scope <> Global ? cons "local"
316 | Induction => cons "induction"
317 | Intro => cons "intro"
318 | Inductive => cons "inductive"
319 | Elim => cons "elim"
320 | Simp => cons "simp"
323 fun isar_dependencies_of all_facts = thms_in_proof (SOME all_facts)
325 val atp_dep_default_max_fact = 50
327 fun atp_dependencies_of ctxt (params as {verbose, max_facts, ...}) prover auto
329 case isar_dependencies_of all_names th of
333 val thy = Proof_Context.theory_of ctxt
334 val goal = goal_of_thm thy th
335 val (_, hyp_ts, concl_t) = ATP_Util.strip_subgoal ctxt goal 1
336 val facts = facts |> filter (fn (_, th') => thm_ord (th', th) = LESS)
337 fun fix_name ((_, stature), th) = ((fn () => nickname_of th, stature), th)
338 fun is_dep dep (_, th) = nickname_of th = dep
339 fun add_isar_dep facts dep accum =
340 if exists (is_dep dep) accum then
342 else case find_first (is_dep dep) facts of
343 SOME ((name, status), th) => accum @ [((name, status), th)]
344 | NONE => accum (* shouldn't happen *)
346 facts |> iterative_relevant_facts ctxt params prover
347 (max_facts |> the_default atp_dep_default_max_fact) NONE
349 |> fold (add_isar_dep facts) isar_deps
352 if verbose andalso not auto then
353 let val num_facts = length facts in
354 "MaSh: " ^ quote prover ^ " on " ^ quote (nickname_of th) ^
355 " with " ^ string_of_int num_facts ^ " fact" ^ plural_s num_facts ^
357 |> Output.urgent_message
361 case run_prover_for_mash ctxt params prover facts goal of
362 {outcome = NONE, used_facts, ...} =>
363 (if verbose andalso not auto then
364 let val num_facts = length used_facts in
365 "Found proof with " ^ string_of_int num_facts ^ " fact" ^
366 plural_s num_facts ^ "."
367 |> Output.urgent_message
371 used_facts |> map fst)
376 (*** Low-level communication with MaSh ***)
378 (* more friendly than "try o File.rm" for those who keep the files open in their
380 fun wipe_out file = File.write file ""
382 fun write_file (xs, f) file =
383 let val path = Path.explode file in
386 |> List.app (File.append path o space_implode "" o map f)
389 fun run_mash_tool ctxt overlord save max_suggs write_cmds read_suggs =
391 val (temp_dir, serial) =
392 if overlord then (getenv "ISABELLE_HOME_USER", "")
393 else (getenv "ISABELLE_TMP", serial_string ())
394 val log_file = if overlord then temp_dir ^ "/mash_log" else "/dev/null"
395 val err_file = temp_dir ^ "/mash_err" ^ serial
396 val sugg_file = temp_dir ^ "/mash_suggs" ^ serial
397 val cmd_file = temp_dir ^ "/mash_commands" ^ serial
399 "--inputFile " ^ cmd_file ^ " --predictions " ^ sugg_file ^
400 " --numberOfPredictions " ^ string_of_int max_suggs ^
401 (if save then " --saveModel" else "")
403 mash_home () ^ "/mash --quiet --outputDir " ^ mash_model_dir () ^
404 " --log " ^ log_file ^ " " ^ core ^ " >& " ^ err_file
406 write_file ([], K "") sugg_file;
407 write_file write_cmds cmd_file;
408 trace_msg ctxt (fn () => "Running " ^ command);
409 Isabelle_System.bash command;
410 read_suggs (fn () => try File.read_lines (Path.explode sugg_file) |> these)
411 |> tap (fn _ => trace_msg ctxt (fn () =>
412 case try File.read (Path.explode err_file) of
415 | SOME s => "Error: " ^ elide_string 1000 s))
417 ? tap (fn _ => List.app (wipe_out o Path.explode)
418 [err_file, sugg_file, cmd_file])
421 fun str_of_update (name, parents, feats, deps) =
422 "! " ^ escape_meta name ^ ": " ^ escape_metas parents ^ "; " ^
423 escape_metas feats ^ "; " ^ escape_metas deps ^ "\n"
425 fun str_of_query (parents, feats) =
426 "? " ^ escape_metas parents ^ "; " ^ escape_metas feats
428 fun mash_CLEAR ctxt =
429 let val path = mash_model_dir () |> Path.explode in
430 trace_msg ctxt (K "MaSh CLEAR");
431 File.fold_dir (fn file => fn _ =>
432 try File.rm (Path.append path (Path.basic file)))
437 fun mash_ADD _ _ [] = ()
438 | mash_ADD ctxt overlord upds =
439 (trace_msg ctxt (fn () => "MaSh ADD " ^
440 elide_string 1000 (space_implode " " (map #1 upds)));
441 run_mash_tool ctxt overlord true 0 (upds, str_of_update) (K ()))
443 fun mash_QUERY ctxt overlord max_suggs (query as (_, feats)) =
444 (trace_msg ctxt (fn () => "MaSh QUERY " ^ space_implode " " feats);
445 run_mash_tool ctxt overlord false max_suggs
446 ([query], str_of_query)
450 | suggs => snd (extract_query (List.last suggs)))
451 handle List.Empty => [])
454 (*** High-level communication with MaSh ***)
456 fun try_graph ctxt when def f =
458 handle Graph.CYCLES (cycle :: _) =>
459 (trace_msg ctxt (fn () =>
460 "Cycle involving " ^ commas cycle ^ " when " ^ when); def)
462 (trace_msg ctxt (fn () =>
463 "Duplicate fact " ^ quote name ^ " when " ^ when); def)
464 | Graph.UNDEF name =>
465 (trace_msg ctxt (fn () =>
466 "Unknown fact " ^ quote name ^ " when " ^ when); def)
468 if Exn.is_interrupt exn then
471 (trace_msg ctxt (fn () =>
472 "Internal error when " ^ when ^ ":\n" ^
473 ML_Compiler.exn_message exn); def)
475 type mash_state = {fact_G : unit Graph.T}
477 val empty_state = {fact_G = Graph.empty}
481 val version = "*** MaSh 0.0 ***"
483 fun load _ (state as (true, _)) = state
485 let val path = mash_state_path () in
487 case try File.read_lines path of
488 SOME (version' :: fact_lines) =>
490 fun add_edge_to name parent =
491 Graph.default_node (parent, ())
492 #> Graph.add_edge (parent, name)
493 fun add_fact_line line =
494 case extract_query line of
495 ("", _) => I (* shouldn't happen *)
497 Graph.default_node (name, ())
498 #> fold (add_edge_to name) parents
500 try_graph ctxt "loading state" Graph.empty (fn () =>
501 Graph.empty |> version' = version
502 ? fold add_fact_line fact_lines)
503 in {fact_G = fact_G} end
509 val path = mash_state_path ()
510 fun fact_line_for name parents =
511 escape_meta name ^ ": " ^ escape_metas parents
512 val append_fact = File.append path o suffix "\n" oo fact_line_for
513 fun append_entry (name, ((), (parents, _))) () =
514 append_fact name (Graph.Keys.dest parents)
516 File.write path (version ^ "\n");
517 Graph.fold append_entry fact_G ()
521 Synchronized.var "Sledgehammer_MaSh.global_state" (false, empty_state)
525 fun mash_map ctxt f =
526 Synchronized.change global_state (load ctxt ##> (f #> tap save))
529 Synchronized.change_result global_state (load ctxt #> `snd)
531 fun mash_unlearn ctxt =
532 Synchronized.change global_state (fn _ =>
533 (mash_CLEAR ctxt; wipe_out (mash_state_path ()); (true, empty_state)))
537 fun mash_could_suggest_facts () = mash_home () <> ""
538 fun mash_can_suggest_facts ctxt = not (Graph.is_empty (#fact_G (mash_get ctxt)))
540 fun queue_of xs = Queue.empty |> fold Queue.enqueue xs
542 fun max_facts_in_graph fact_G facts =
544 val facts = [] |> fold (cons o nickname_of o snd) facts
545 val tab = Symtab.empty |> fold (fn name => Symtab.update (name, ())) facts
546 fun enqueue_new seen name =
547 not (member (op =) seen name) ? Queue.enqueue name
548 fun find_maxes seen maxs names =
549 case try Queue.dequeue names of
551 | SOME (name, names) =>
552 if Symtab.defined tab name then
554 val new = (Graph.all_preds fact_G [name], name)
555 fun not_ancestor (_, x) (yp, _) = not (member (op =) yp x)
556 val maxs = maxs |> filter (fn max => not_ancestor max new)
557 val maxs = maxs |> forall (not_ancestor new) maxs ? cons new
558 in find_maxes (name :: seen) maxs names end
560 find_maxes (name :: seen) maxs
561 (Graph.Keys.fold (enqueue_new seen)
562 (Graph.imm_preds fact_G name) names)
563 in find_maxes [] [] (queue_of (Graph.maximals fact_G)) end
565 (* Generate more suggestions than requested, because some might be thrown out
566 later for various reasons and "meshing" gives better results with some
568 fun max_suggs_of max_facts = max_facts + Int.min (200, max_facts)
570 fun is_fact_in_graph fact_G (_, th) =
571 can (Graph.get_node fact_G) (nickname_of th)
573 fun mash_suggest_facts ctxt ({overlord, ...} : params) prover max_facts hyp_ts
576 val thy = Proof_Context.theory_of ctxt
577 val fact_G = #fact_G (mash_get ctxt)
578 val parents = max_facts_in_graph fact_G facts
579 val feats = features_of ctxt prover thy (Local, General) (concl_t :: hyp_ts)
581 if Graph.is_empty fact_G then []
582 else mash_QUERY ctxt overlord (max_suggs_of max_facts) (parents, feats)
583 val selected = facts |> suggested_facts suggs
584 val unknown = facts |> filter_out (is_fact_in_graph fact_G)
585 in (selected, unknown) end
587 fun update_fact_graph ctxt (name, parents, feats, deps) (upds, graph) =
589 fun maybe_add_from from (accum as (parents, graph)) =
590 try_graph ctxt "updating graph" accum (fn () =>
591 (from :: parents, Graph.add_edge_acyclic (from, name) graph))
592 val graph = graph |> Graph.default_node (name, ())
593 val (parents, graph) = ([], graph) |> fold maybe_add_from parents
594 val (deps, graph) = ([], graph) |> fold maybe_add_from deps
595 in ((name, parents, feats, deps) :: upds, graph) end
597 val learn_timeout_slack = 2.0
599 fun launch_thread timeout task =
601 val hard_timeout = time_mult learn_timeout_slack timeout
602 val birth_time = Time.now ()
603 val death_time = Time.+ (birth_time, hard_timeout)
604 val desc = ("machine learner for Sledgehammer", "")
605 in Async_Manager.launch MaShN birth_time death_time desc task end
607 fun freshish_name () =
608 Date.fmt ".%Y_%m_%d_%H_%M_%S__" (Date.fromTimeLocal (Time.now ())) ^
611 fun mash_learn_proof ctxt ({overlord, timeout, ...} : params) prover t facts
613 if is_smt_prover ctxt prover then
616 launch_thread timeout (fn () =>
618 val thy = Proof_Context.theory_of ctxt
619 val name = freshish_name ()
620 val feats = features_of ctxt prover thy (Local, General) [t]
621 val deps = used_ths |> map nickname_of
622 val {fact_G} = mash_get ctxt
623 val parents = max_facts_in_graph fact_G facts
625 mash_ADD ctxt overlord [(name, parents, feats, deps)]; (true, "")
629 Markup.markup Isabelle_Markup.sendback (sledgehammerN ^ " " ^ sub)
631 (* Too many dependencies is a sign that a decision procedure is at work. There
632 isn't much too learn from such proofs. *)
633 val max_dependencies = 10
634 val commit_timeout = seconds 30.0
636 (* The timeout is understood in a very slack fashion. *)
637 fun mash_learn_facts ctxt (params as {debug, verbose, overlord, timeout, ...})
638 prover auto atp learn_timeout facts =
640 val timer = Timer.startRealTimer ()
641 fun next_commit_time () =
642 Time.+ (Timer.checkRealTimer timer, commit_timeout)
643 val {fact_G} = mash_get ctxt
644 val (old_facts, new_facts) =
645 facts |> List.partition (is_fact_in_graph fact_G)
646 ||> sort (thm_ord o pairself snd)
647 val num_new_facts = length new_facts
652 " " ^ string_of_int num_new_facts ^ " fact" ^
653 plural_s num_new_facts ^
654 (if atp then " (ATP timeout: " ^ string_from_time timeout ^ ")"
660 |> Output.urgent_message;
661 if num_new_facts = 0 then
663 "Nothing to learn.\n\nHint: Try " ^ sendback relearn_isarN ^ " or " ^
664 sendback relearn_atpN ^ " to learn from scratch."
669 val last_th = new_facts |> List.last |> snd
670 (* crude approximation *)
672 old_facts |> filter (fn (_, th) => thm_ord (th, last_th) <> GREATER)
675 |> filter_out is_likely_tautology_or_too_meta
676 |> map (rpair () o nickname_of)
678 fun do_commit [] state = state
679 | do_commit upds {fact_G} =
682 ([], fact_G) |> fold (update_fact_graph ctxt) upds
683 in mash_ADD ctxt overlord (rev upds); {fact_G = fact_G} end
684 fun trim_deps deps = if length deps > max_dependencies then [] else deps
685 fun commit last upds =
686 (if debug andalso not auto then Output.urgent_message "Committing..."
688 mash_map ctxt (do_commit (rev upds));
689 if not last andalso not auto then
690 let val num_upds = length upds in
691 "Processed " ^ string_of_int num_upds ^ " fact" ^
692 plural_s num_upds ^ " in the last " ^
693 string_from_time commit_timeout ^ "."
694 |> Output.urgent_message
698 fun do_fact _ (accum as (_, (_, _, _, true))) = accum
699 | do_fact ((_, stature), th)
700 (upds, (parents, n, next_commit, false)) =
702 val name = nickname_of th
704 features_of ctxt prover (theory_of_thm th) stature [prop_of th]
706 (if atp then atp_dependencies_of ctxt params prover auto facts
707 else isar_dependencies_of) all_names th
709 val n = n |> not (null deps) ? Integer.add 1
710 val upds = (name, parents, feats, deps) :: upds
711 val (upds, next_commit) =
712 if Time.> (Timer.checkRealTimer timer, next_commit) then
713 (commit false upds; ([], next_commit_time ()))
717 Time.> (Timer.checkRealTimer timer, learn_timeout)
718 in (upds, ([name], n, next_commit, timed_out)) end
719 val parents = max_facts_in_graph fact_G ancestors
720 val (upds, (_, n, _, _)) =
721 ([], (parents, 0, next_commit_time (), false))
722 |> fold do_fact new_facts
725 if verbose orelse not auto then
726 "Learned " ^ string_of_int n ^ " nontrivial proof" ^ plural_s n ^
728 " in " ^ string_from_time (Timer.checkRealTimer timer)
736 fun mash_learn ctxt (params as {provers, ...}) fact_override chained atp =
738 val css = Sledgehammer_Fact.clasimpset_rule_table_of ctxt
739 val ctxt = ctxt |> Config.put instantiate_inducts false
741 nearly_all_facts ctxt false fact_override Symtab.empty css chained []
744 mash_learn_facts ctxt params (hd provers) false atp infinite_timeout facts
745 |> Output.urgent_message
748 (* The threshold should be large enough so that MaSh doesn't kick in for Auto
749 Sledgehammer and Try. *)
750 val min_secs_for_learning = 15
752 fun relevant_facts ctxt (params as {learn, fact_filter, timeout, ...}) prover
753 max_facts ({add, only, ...} : fact_override) hyp_ts concl_t facts =
754 if not (subset (op =) (the_list fact_filter, fact_filters)) then
755 error ("Unknown fact filter: " ^ quote (the fact_filter) ^ ".")
758 else if max_facts <= 0 orelse null facts then
763 if learn andalso not (Async_Manager.has_running_threads MaShN) andalso
764 Time.toSeconds timeout >= min_secs_for_learning then
765 let val timeout = time_mult learn_timeout_slack timeout in
766 launch_thread timeout
767 (fn () => (true, mash_learn_facts ctxt params prover true false
774 SOME ff => (() |> ff <> mepoN ? maybe_learn; ff)
776 if is_smt_prover ctxt prover then mepoN
777 else if mash_can_suggest_facts ctxt then (maybe_learn (); meshN)
778 else if mash_could_suggest_facts () then (maybe_learn (); mepoN)
780 val add_ths = Attrib.eval_thms ctxt add
781 fun prepend_facts ths accepts =
782 ((facts |> filter (member Thm.eq_thm_prop ths o snd)) @
783 (accepts |> filter_out (member Thm.eq_thm_prop ths o snd)))
786 iterative_relevant_facts ctxt params prover max_facts NONE hyp_ts
789 mash_suggest_facts ctxt params prover max_facts hyp_ts concl_t facts
791 [] |> (if fact_filter <> mashN then cons (iter (), []) else I)
792 |> (if fact_filter <> mepoN then cons (mash ()) else I)
794 mesh_facts max_facts mess
795 |> not (null add_ths) ? prepend_facts add_ths
798 fun kill_learners () = Async_Manager.kill_threads MaShN "learner"
799 fun running_learners () = Async_Manager.running_threads MaShN "learner"