1 (* Title: HOL/Tools/Sledgehammer/sledgehammer_filter_mash.ML
2 Author: Jasmin Blanchette, TU Muenchen
4 Sledgehammer's machine-learning-based relevance filter (MaSh).
7 signature SLEDGEHAMMER_FILTER_MASH =
9 type status = ATP_Problem_Generate.status
10 type stature = ATP_Problem_Generate.stature
11 type fact = Sledgehammer_Fact.fact
12 type fact_override = Sledgehammer_Fact.fact_override
13 type params = Sledgehammer_Provers.params
14 type relevance_fudge = Sledgehammer_Provers.relevance_fudge
15 type prover_result = Sledgehammer_Provers.prover_result
17 val trace : bool Config.T
22 val fact_filters : string list
23 val escape_meta : string -> string
24 val escape_metas : string list -> string
25 val unescape_meta : string -> string
26 val unescape_metas : string -> string list
27 val extract_query : string -> string * string list
28 val suggested_facts : string list -> ('a * thm) list -> ('a * thm) list
30 int -> (('a * thm) list * ('a * thm) list) list -> ('a * thm) list
31 val is_likely_tautology_or_too_meta : thm -> bool
32 val theory_ord : theory * theory -> order
33 val thm_ord : thm * thm -> order
35 Proof.context -> string -> theory -> status -> term list -> string list
36 val isabelle_dependencies_of : unit Symtab.table -> thm -> string list
37 val goal_of_thm : theory -> thm -> thm
38 val run_prover_for_mash :
39 Proof.context -> params -> string -> fact list -> thm -> prover_result
40 val mash_CLEAR : Proof.context -> unit
43 -> (string * string list * string list * string list) list -> unit
46 -> (string * string list * string list * string list) list -> unit
48 Proof.context -> bool -> int -> string list * string list -> string list
49 val mash_unlearn : Proof.context -> unit
50 val mash_could_suggest_facts : unit -> bool
51 val mash_can_suggest_facts : Proof.context -> bool
52 val mash_suggest_facts :
53 Proof.context -> params -> string -> int -> term list -> term
54 -> ('a * thm) list -> ('a * thm) list * ('a * thm) list
56 Proof.context -> params -> theory -> Time.time -> fact list -> string
57 val mash_learn_proof :
58 Proof.context -> params -> term -> ('a * thm) list -> thm list -> unit
60 Proof.context -> params -> string -> int -> fact_override -> term list
61 -> term -> fact list -> fact list
62 val kill_learners : unit -> unit
63 val running_learners : unit -> unit
66 structure Sledgehammer_Filter_MaSh : SLEDGEHAMMER_FILTER_MASH =
70 open ATP_Problem_Generate
71 open Sledgehammer_Util
72 open Sledgehammer_Fact
73 open Sledgehammer_Filter_Iter
74 open Sledgehammer_Provers
75 open Sledgehammer_Minimize
78 Attrib.setup_config_bool @{binding sledgehammer_filter_mash_trace} (K false)
79 fun trace_msg ctxt msg = if Config.get ctxt trace then tracing (msg ()) else ()
87 val fact_filters = [meshN, iterN, mashN]
89 fun mash_home () = getenv "MASH_HOME"
90 fun mash_state_dir () =
91 getenv "ISABELLE_HOME_USER" ^ "/mash"
92 |> tap (Isabelle_System.mkdir o Path.explode)
93 fun mash_state_path () = mash_state_dir () ^ "/state" |> Path.explode
96 (*** Isabelle helpers ***)
99 if Char.isAlphaNum c orelse c = #"_" orelse c = #"." orelse c = #"(" orelse
100 c = #")" orelse c = #"," then
103 (* fixed width, in case more digits follow *)
104 "\\" ^ stringN_of_int 3 (Char.ord c)
106 fun unmeta_chars accum [] = String.implode (rev accum)
107 | unmeta_chars accum (#"\\" :: d1 :: d2 :: d3 :: cs) =
108 (case Int.fromString (String.implode [d1, d2, d3]) of
109 SOME n => unmeta_chars (Char.chr n :: accum) cs
110 | NONE => "" (* error *))
111 | unmeta_chars _ (#"\\" :: _) = "" (* error *)
112 | unmeta_chars accum (c :: cs) = unmeta_chars (c :: accum) cs
114 val escape_meta = String.translate meta_char
115 val escape_metas = map escape_meta #> space_implode " "
116 val unescape_meta = String.explode #> unmeta_chars []
118 space_explode " " #> filter_out (curry (op =) "") #> map unescape_meta
120 fun extract_query line =
121 case space_explode ":" line of
122 [goal_name, suggs] => (unescape_meta goal_name, unescape_metas suggs)
125 fun suggested_facts suggs facts =
127 fun add_fact (fact as (_, th)) = Symtab.default (Thm.get_name_hint th, fact)
128 val tab = Symtab.empty |> fold add_fact facts
129 in map_filter (Symtab.lookup tab) suggs end
131 (* Ad hoc score function roughly based on Blanchette's Ringberg 2011 data. *)
132 fun score x = Math.pow (1.5, 15.5 - 0.05 * Real.fromInt x) + 15.0
134 fun sum_sq_avg [] = 0
136 Real.ceil (100000.0 * fold (curry (op +) o score) xs 0.0) div length xs
138 fun mesh_facts max_facts [(selected, unknown)] =
139 take max_facts selected @ take (max_facts - length selected) unknown
140 | mesh_facts max_facts mess =
142 val mess = mess |> map (apfst (`length))
143 val fact_eq = Thm.eq_thm o pairself snd
144 fun score_in fact ((sel_len, sels), unks) =
145 case find_index (curry fact_eq fact) sels of
146 ~1 => (case find_index (curry fact_eq fact) unks of
150 fun score_of fact = mess |> map_filter (score_in fact) |> sum_sq_avg
151 val facts = fold (union fact_eq o take max_facts o snd o fst) mess []
153 facts |> map (`score_of) |> sort (int_ord o swap o pairself fst)
154 |> map snd |> take max_facts
157 val thy_feature_prefix = "y_"
159 val thy_feature_name_of = prefix thy_feature_prefix
160 val const_name_of = prefix const_prefix
161 val type_name_of = prefix type_const_prefix
162 val class_name_of = prefix class_prefix
164 fun is_likely_tautology_or_too_meta th =
166 val is_boring_const = member (op =) atp_widely_irrelevant_consts
167 fun is_boring_bool t =
168 not (exists_Const (not o is_boring_const o fst) t) orelse
169 exists_type (exists_subtype (curry (op =) @{typ prop})) t
170 fun is_boring_prop (@{const Trueprop} $ t) = is_boring_bool t
171 | is_boring_prop (@{const "==>"} $ t $ u) =
172 is_boring_prop t andalso is_boring_prop u
173 | is_boring_prop (Const (@{const_name all}, _) $ (Abs (_, _, t)) $ u) =
174 is_boring_prop t andalso is_boring_prop u
175 | is_boring_prop (Const (@{const_name "=="}, _) $ t $ u) =
176 is_boring_bool t andalso is_boring_bool u
177 | is_boring_prop _ = true
179 is_boring_prop (prop_of th) andalso not (Thm.eq_thm_prop (@{thm ext}, th))
183 if Theory.eq_thy p then
185 else if Theory.subthy p then
187 else if Theory.subthy (swap p) then
189 else case int_ord (pairself (length o Theory.ancestors_of) p) of
190 EQUAL => string_ord (pairself Context.theory_name p)
193 val thm_ord = theory_ord o pairself theory_of_thm
195 val bad_types = [@{type_name prop}, @{type_name bool}, @{type_name fun}]
197 fun interesting_terms_types_and_classes ctxt prover term_max_depth
200 fun is_bad_const (x as (s, _)) args =
201 member (op =) atp_logical_consts s orelse
202 fst (is_built_in_const_for_prover ctxt prover x args)
203 fun add_classes @{sort type} = I
204 | add_classes S = union (op =) (map class_name_of S)
205 fun do_add_type (Type (s, Ts)) =
206 (not (member (op =) bad_types s) ? insert (op =) (type_name_of s))
207 #> fold do_add_type Ts
208 | do_add_type (TFree (_, S)) = add_classes S
209 | do_add_type (TVar (_, S)) = add_classes S
210 fun add_type T = type_max_depth >= 0 ? do_add_type T
212 if member (op <>) args "" then s ^ "(" ^ space_implode "," args ^ ")"
214 fun patternify ~1 _ = ""
215 | patternify depth t =
217 (Const (s, _), args) =>
218 mk_app (const_name_of s) (map (patternify (depth - 1)) args)
220 fun add_term_patterns ~1 _ = I
221 | add_term_patterns depth t =
222 insert (op =) (patternify depth t)
223 #> add_term_patterns (depth - 1) t
224 val add_term = add_term_patterns term_max_depth
226 let val (head, args) = strip_comb t in
228 Const (x as (_, T)) =>
229 not (is_bad_const x args) ? (add_term t #> add_type T)
230 | Free (_, T) => add_type T
231 | Var (_, T) => add_type T
232 | Abs (_, T, body) => add_type T #> add_patterns body
234 #> fold add_patterns args
236 in [] |> fold add_patterns ts end
238 fun is_exists (s, _) = (s = @{const_name Ex} orelse s = @{const_name Ex1})
240 val term_max_depth = 1
241 val type_max_depth = 1
243 (* TODO: Generate type classes for types? *)
244 fun features_of ctxt prover thy status ts =
245 thy_feature_name_of (Context.theory_name thy) ::
246 interesting_terms_types_and_classes ctxt prover term_max_depth type_max_depth
248 |> forall is_lambda_free ts ? cons "no_lams"
249 |> forall (not o exists_Const is_exists) ts ? cons "no_skos"
252 | Induction => cons "induction"
253 | Intro => cons "intro"
254 | Inductive => cons "inductive"
255 | Elim => cons "elim"
256 | Simp => cons "simp"
259 fun isabelle_dependencies_of all_facts = thms_in_proof (SOME all_facts)
261 val freezeT = Type.legacy_freeze_type
263 fun freeze (t $ u) = freeze t $ freeze u
264 | freeze (Abs (s, T, t)) = Abs (s, freezeT T, freeze t)
265 | freeze (Var ((s, _), T)) = Free (s, freezeT T)
266 | freeze (Const (s, T)) = Const (s, freezeT T)
267 | freeze (Free (s, T)) = Free (s, freezeT T)
270 fun goal_of_thm thy = prop_of #> freeze #> cterm_of thy #> Goal.init
272 fun run_prover_for_mash ctxt params prover facts goal =
275 {state = Proof.init ctxt, goal = goal, subgoal = 1, subgoal_count = 1,
276 facts = facts |> map (apfst (apfst (fn name => name ())))
277 |> map Untranslated_Fact}
278 val prover = get_minimizing_prover ctxt Normal (K ()) prover
279 in prover params (K (K (K ""))) problem end
282 (*** Low-level communication with MaSh ***)
284 fun write_file (xs, f) file =
285 let val path = Path.explode file in
288 |> List.app (File.append path o space_implode "" o map f)
291 fun mash_info overlord =
292 if overlord then (getenv "ISABELLE_HOME_USER", "")
293 else (getenv "ISABELLE_TMP", serial_string ())
295 fun run_mash ctxt overlord (temp_dir, serial) core =
297 val log_file = temp_dir ^ "/mash_log" ^ serial
298 val err_file = temp_dir ^ "/mash_err" ^ serial
300 mash_home () ^ "/mash.py --quiet --outputDir " ^ mash_state_dir () ^
301 " --log " ^ log_file ^ " " ^ core ^ " 2>&1 > " ^ err_file
303 trace_msg ctxt (fn () => "Running " ^ command);
304 write_file ([], K "") log_file;
305 write_file ([], K "") err_file;
306 Isabelle_System.bash command;
308 else (map (File.rm o Path.explode) [log_file, err_file]; ());
309 trace_msg ctxt (K "Done")
312 (* TODO: Eliminate code once "mash.py" handles sequences of ADD commands as fast
314 fun run_mash_init ctxt overlord write_access write_feats write_deps =
316 val info as (temp_dir, serial) = mash_info overlord
317 val in_dir = temp_dir ^ "/mash_init" ^ serial
318 val in_dir_path = in_dir |> Path.explode |> tap Isabelle_System.mkdir
320 write_file write_access (in_dir ^ "/mash_accessibility");
321 write_file write_feats (in_dir ^ "/mash_features");
322 write_file write_deps (in_dir ^ "/mash_dependencies");
323 run_mash ctxt overlord info ("--init --inputDir " ^ in_dir);
324 (* FIXME: temporary hack *)
326 else (Isabelle_System.bash ("rm -r -f " ^ File.shell_path in_dir_path); ())
329 fun run_mash_commands ctxt overlord save max_suggs write_cmds read_suggs =
331 val info as (temp_dir, serial) = mash_info overlord
332 val sugg_file = temp_dir ^ "/mash_suggs" ^ serial
333 val cmd_file = temp_dir ^ "/mash_commands" ^ serial
335 write_file ([], K "") sugg_file;
336 write_file write_cmds cmd_file;
337 run_mash ctxt overlord info
338 ("--inputFile " ^ cmd_file ^ " --predictions " ^ sugg_file ^
339 " --numberOfPredictions " ^ string_of_int max_suggs ^
340 (if save then " --saveModel" else ""));
341 read_suggs (fn () => File.read_lines (Path.explode sugg_file))
344 else (map (File.rm o Path.explode) [sugg_file, cmd_file]; ()))
347 fun str_of_update (name, parents, feats, deps) =
348 "! " ^ escape_meta name ^ ": " ^ escape_metas parents ^ "; " ^
349 escape_metas feats ^ "; " ^ escape_metas deps ^ "\n"
351 fun str_of_query (parents, feats) =
352 "? " ^ escape_metas parents ^ "; " ^ escape_metas feats
354 fun init_str_of_update get (upd as (name, _, _, _)) =
355 escape_meta name ^ ": " ^ escape_metas (get upd) ^ "\n"
357 fun mash_CLEAR ctxt =
358 let val path = mash_state_dir () |> Path.explode in
359 trace_msg ctxt (K "MaSh CLEAR");
360 File.fold_dir (fn file => fn () =>
361 File.rm (Path.append path (Path.basic file)))
365 fun mash_INIT ctxt _ [] = mash_CLEAR ctxt
366 | mash_INIT ctxt overlord upds =
367 (trace_msg ctxt (fn () => "MaSh INIT " ^
368 elide_string 1000 (space_implode " " (map #1 upds)));
369 run_mash_init ctxt overlord (upds, init_str_of_update #2)
370 (upds, init_str_of_update #3) (upds, init_str_of_update #4))
372 fun mash_ADD _ _ [] = ()
373 | mash_ADD ctxt overlord upds =
374 (trace_msg ctxt (fn () => "MaSh ADD " ^
375 elide_string 1000 (space_implode " " (map #1 upds)));
376 run_mash_commands ctxt overlord true 0 (upds, str_of_update) (K ()))
378 fun mash_QUERY ctxt overlord max_suggs (query as (_, feats)) =
379 (trace_msg ctxt (fn () => "MaSh QUERY " ^ space_implode " " feats);
380 run_mash_commands ctxt overlord false max_suggs
381 ([query], str_of_query)
382 (fn suggs => snd (extract_query (List.last (suggs ()))))
383 handle List.Empty => [])
386 (*** High-level communication with MaSh ***)
388 fun try_graph ctxt when def f =
390 handle Graph.CYCLES (cycle :: _) =>
391 (trace_msg ctxt (fn () =>
392 "Cycle involving " ^ commas cycle ^ " when " ^ when); def)
393 | Graph.UNDEF name =>
394 (trace_msg ctxt (fn () =>
395 "Unknown fact " ^ quote name ^ " when " ^ when); def)
398 {thys : bool Symtab.table,
399 fact_graph : unit Graph.T}
401 val empty_state = {thys = Symtab.empty, fact_graph = Graph.empty}
405 fun mash_load _ (state as (true, _)) = state
407 let val path = mash_state_path () in
409 case try File.read_lines path of
410 SOME (comp_thys :: incomp_thys :: fact_lines) =>
412 fun add_thy comp thy = Symtab.update (thy, comp)
413 fun add_edge_to name parent =
414 Graph.default_node (parent, ())
415 #> Graph.add_edge (parent, name)
416 fun add_fact_line line =
417 case extract_query line of
418 ("", _) => I (* shouldn't happen *)
420 Graph.default_node (name, ())
421 #> fold (add_edge_to name) parents
423 Symtab.empty |> fold (add_thy true) (unescape_metas comp_thys)
424 |> fold (add_thy false) (unescape_metas incomp_thys)
426 try_graph ctxt "loading state" Graph.empty (fn () =>
427 Graph.empty |> fold add_fact_line fact_lines)
428 in {thys = thys, fact_graph = fact_graph} end
432 fun mash_save ({thys, fact_graph, ...} : mash_state) =
434 val path = mash_state_path ()
435 val thys = Symtab.dest thys
436 val line_for_thys = escape_metas o AList.find (op =) thys
437 fun fact_line_for name parents =
438 escape_meta name ^ ": " ^ escape_metas parents
439 val append_fact = File.append path o suffix "\n" oo fact_line_for
441 File.write path (line_for_thys true ^ "\n" ^ line_for_thys false ^ "\n");
442 Graph.fold (fn (name, ((), (parents, _))) => fn () =>
443 append_fact name (Graph.Keys.dest parents))
448 Synchronized.var "Sledgehammer_Filter_MaSh.global_state" (false, empty_state)
452 fun mash_map ctxt f =
453 Synchronized.change global_state (mash_load ctxt ##> (f #> tap mash_save))
456 Synchronized.change_result global_state (mash_load ctxt #> `snd)
458 fun mash_unlearn ctxt =
459 Synchronized.change global_state (fn _ =>
460 (mash_CLEAR ctxt; File.write (mash_state_path ()) "";
461 (true, empty_state)))
465 fun mash_could_suggest_facts () = mash_home () <> ""
466 fun mash_can_suggest_facts ctxt =
467 not (Graph.is_empty (#fact_graph (mash_get ctxt)))
469 fun parents_wrt_facts facts fact_graph =
471 val facts = [] |> fold (cons o Thm.get_name_hint o snd) facts
472 val tab = Symtab.empty |> fold (fn name => Symtab.update (name, ())) facts
473 fun insert_not_parent parents name =
474 not (member (op =) parents name) ? insert (op =) name
475 fun parents_of parents [] = parents
476 | parents_of parents (name :: names) =
477 if Symtab.defined tab name then
478 parents_of (name :: parents) names
480 parents_of parents (Graph.Keys.fold (insert_not_parent parents)
481 (Graph.imm_preds fact_graph name) names)
482 in parents_of [] (Graph.maximals fact_graph) end
484 (* Generate more suggestions than requested, because some might be thrown out
485 later for various reasons and "meshing" gives better results with some
487 fun max_suggs_of max_facts = max_facts + Int.min (200, max_facts)
489 fun is_fact_in_graph fact_graph (_, th) =
490 can (Graph.get_node fact_graph) (Thm.get_name_hint th)
492 fun mash_suggest_facts ctxt ({overlord, ...} : params) prover max_facts hyp_ts
495 val thy = Proof_Context.theory_of ctxt
496 val fact_graph = #fact_graph (mash_get ctxt)
497 val parents = parents_wrt_facts facts fact_graph
498 val feats = features_of ctxt prover thy General (concl_t :: hyp_ts)
500 if Graph.is_empty fact_graph then []
501 else mash_QUERY ctxt overlord (max_suggs_of max_facts) (parents, feats)
502 val selected = facts |> suggested_facts suggs
503 val unknown = facts |> filter_out (is_fact_in_graph fact_graph)
504 in (selected, unknown) end
506 fun add_thys_for thy =
507 let fun add comp thy = Symtab.update (Context.theory_name thy, comp) in
508 add false thy #> fold (add true) (Theory.ancestors_of thy)
511 fun update_fact_graph ctxt (name, parents, feats, deps) (upds, graph) =
513 fun maybe_add_from from (accum as (parents, graph)) =
514 try_graph ctxt "updating graph" accum (fn () =>
515 (from :: parents, Graph.add_edge_acyclic (from, name) graph))
516 val graph = graph |> Graph.default_node (name, ())
517 val (parents, graph) = ([], graph) |> fold maybe_add_from parents
518 val (deps, graph) = ([], graph) |> fold maybe_add_from deps
519 in ((name, parents, feats, deps) :: upds, graph) end
521 val pass1_learn_timeout_factor = 0.5
523 (* Too many dependencies is a sign that a decision procedure is at work. There
524 isn't much too learn from such proofs. *)
525 val max_dependencies = 10
527 (* The timeout is understood in a very slack fashion. *)
528 fun mash_learn_thy ctxt ({provers, verbose, overlord, ...} : params) thy timeout
531 val timer = Timer.startRealTimer ()
532 val prover = hd provers
534 Time.> (Timer.checkRealTimer timer, time_mult frac timeout)
535 val {fact_graph, ...} = mash_get ctxt
537 facts |> filter_out (is_fact_in_graph fact_graph)
538 |> sort (thm_ord o pairself snd)
540 if null new_facts then
544 val ths = facts |> map snd
546 ths |> filter_out is_likely_tautology_or_too_meta
547 |> map (rpair () o Thm.get_name_hint)
549 fun trim_deps deps = if length deps > max_dependencies then [] else deps
550 fun do_fact _ (accum as (_, true)) = accum
551 | do_fact ((_, (_, status)), th) ((parents, upds), false) =
553 val name = Thm.get_name_hint th
555 features_of ctxt prover (theory_of_thm th) status [prop_of th]
556 val deps = isabelle_dependencies_of all_names th |> trim_deps
557 val upd = (name, parents, feats, deps)
558 in (([name], upd :: upds), timed_out pass1_learn_timeout_factor) end
559 val parents = parents_wrt_facts facts fact_graph
561 ((parents, []), false) |> fold do_fact new_facts |>> apsnd rev
563 fun trans {thys, fact_graph} =
565 val mash_INIT_or_ADD =
566 if Graph.is_empty fact_graph then mash_INIT else mash_ADD
567 val (upds, fact_graph) =
568 ([], fact_graph) |> fold (update_fact_graph ctxt) upds
570 (mash_INIT_or_ADD ctxt overlord (rev upds);
571 {thys = thys |> add_thys_for thy,
572 fact_graph = fact_graph})
577 "Processed " ^ string_of_int n ^ " proof" ^ plural_s n ^
579 " in " ^ string_from_time (Timer.checkRealTimer timer)
587 fun mash_learn_proof ctxt ({provers, overlord, ...} : params) t facts used_ths =
589 val thy = Proof_Context.theory_of ctxt
590 val prover = hd provers
591 val name = ATP_Util.timestamp () ^ " " ^ serial_string () (* fresh enough *)
592 val feats = features_of ctxt prover thy General [t]
593 val deps = used_ths |> map Thm.get_name_hint
595 mash_map ctxt (fn {thys, fact_graph} =>
597 val parents = parents_wrt_facts facts fact_graph
598 val upds = [(name, parents, feats, deps)]
599 val (upds, fact_graph) =
600 ([], fact_graph) |> fold (update_fact_graph ctxt) upds
602 mash_ADD ctxt overlord upds;
603 {thys = thys, fact_graph = fact_graph}
607 (* The threshold should be large enough so that MaSh doesn't kick in for Auto
608 Sledgehammer and Try. *)
609 val min_secs_for_learning = 15
610 val learn_timeout_factor = 2.0
612 fun relevant_facts ctxt (params as {learn, fact_filter, timeout, ...}) prover
613 max_facts ({add, only, ...} : fact_override) hyp_ts concl_t facts =
614 if not (subset (op =) (the_list fact_filter, fact_filters)) then
615 error ("Unknown fact filter: " ^ quote (the fact_filter) ^ ".")
618 else if max_facts <= 0 orelse null facts then
622 val thy = Proof_Context.theory_of ctxt
624 if not learn orelse Async_Manager.has_running_threads MaShN then
626 else if Time.toSeconds timeout >= min_secs_for_learning then
628 val soft_timeout = time_mult learn_timeout_factor timeout
629 val hard_timeout = time_mult 4.0 soft_timeout
630 val birth_time = Time.now ()
631 val death_time = Time.+ (birth_time, hard_timeout)
632 val desc = ("machine learner for Sledgehammer", "")
634 Async_Manager.launch MaShN birth_time death_time desc
636 (true, mash_learn_thy ctxt params thy soft_timeout facts))
642 SOME ff => (() |> ff <> iterN ? maybe_learn; ff)
644 if mash_can_suggest_facts ctxt then (maybe_learn (); meshN)
645 else if mash_could_suggest_facts () then (maybe_learn (); iterN)
647 val add_ths = Attrib.eval_thms ctxt add
648 fun prepend_facts ths accepts =
649 ((facts |> filter (member Thm.eq_thm_prop ths o snd)) @
650 (accepts |> filter_out (member Thm.eq_thm_prop ths o snd)))
653 iterative_relevant_facts ctxt params prover max_facts NONE hyp_ts
656 mash_suggest_facts ctxt params prover max_facts hyp_ts concl_t facts
658 [] |> (if fact_filter <> mashN then cons (iter (), []) else I)
659 |> (if fact_filter <> iterN then cons (mash ()) else I)
661 mesh_facts max_facts mess
662 |> not (null add_ths) ? prepend_facts add_ths
665 fun kill_learners () = Async_Manager.kill_threads MaShN "learner"
666 fun running_learners () = Async_Manager.running_threads MaShN "learner"