1 (* Title: HOL/Tools/Sledgehammer/sledgehammer_translate.ML
2 Author: Fabian Immler, TU Muenchen
4 Author: Jasmin Blanchette, TU Muenchen
6 Translation of HOL to FOL.
9 signature SLEDGEHAMMER_TRANSLATE =
11 type 'a problem = 'a ATP_Problem.problem
13 val axiom_prefix : string
14 val conjecture_prefix : string
15 val helper_prefix : string
16 val class_rel_clause_prefix : string
17 val arity_clause_prefix : string
18 val tfrees_name : string
20 Proof.context -> bool -> bool -> bool -> bool -> term list -> term
21 -> ((string * 'a) * thm) list
22 -> string problem * string Symtab.table * int * (string * 'a) vector
25 structure Sledgehammer_Translate : SLEDGEHAMMER_TRANSLATE =
30 open Sledgehammer_Util
32 val axiom_prefix = "ax_"
33 val conjecture_prefix = "conj_"
34 val helper_prefix = "help_"
35 val class_rel_clause_prefix = "clrel_";
36 val arity_clause_prefix = "arity_"
37 val tfrees_name = "tfrees"
39 (* Freshness almost guaranteed! *)
40 val sledgehammer_weak_prefix = "Sledgehammer:"
45 combformula: (name, combterm) formula,
46 ctypes_sorts: typ list}
48 fun mk_anot phi = AConn (ANot, [phi])
49 fun mk_aconn c phi1 phi2 = AConn (c, [phi1, phi2])
50 fun mk_ahorn [] phi = phi
51 | mk_ahorn (phi :: phis) psi =
52 AConn (AImplies, [fold (mk_aconn AAnd) phis phi, psi])
54 fun combformula_for_prop thy =
56 val do_term = combterm_from_term thy
57 fun do_quant bs q s T t' =
58 let val s = Name.variant (map fst bs) s in
59 do_formula ((s, T) :: bs) t'
60 #>> (fn phi => AQuant (q, [`make_bound_var s], phi))
62 and do_conn bs c t1 t2 =
63 do_formula bs t1 ##>> do_formula bs t2
64 #>> (fn (phi1, phi2) => AConn (c, [phi1, phi2]))
68 do_formula bs t1 #>> (fn phi => AConn (ANot, [phi]))
69 | Const (@{const_name All}, _) $ Abs (s, T, t') =>
70 do_quant bs AForall s T t'
71 | Const (@{const_name Ex}, _) $ Abs (s, T, t') =>
72 do_quant bs AExists s T t'
73 | @{const "op &"} $ t1 $ t2 => do_conn bs AAnd t1 t2
74 | @{const "op |"} $ t1 $ t2 => do_conn bs AOr t1 t2
75 | @{const HOL.implies} $ t1 $ t2 => do_conn bs AImplies t1 t2
76 | Const (@{const_name "op ="}, Type (_, [@{typ bool}, _])) $ t1 $ t2 =>
78 | _ => (fn ts => do_term bs (Envir.eta_contract t)
79 |>> AAtom ||> union (op =) ts)
82 val presimplify_term = prop_of o Meson.presimplify oo Skip_Proof.make_thm
84 fun concealed_bound_name j = sledgehammer_weak_prefix ^ Int.toString j
85 fun conceal_bounds Ts t =
86 subst_bounds (map (Free o apfst concealed_bound_name)
87 (0 upto length Ts - 1 ~~ Ts), t)
88 fun reveal_bounds Ts =
89 subst_atomic (map (fn (j, T) => (Free (concealed_bound_name j, T), Bound j))
90 (0 upto length Ts - 1 ~~ Ts))
92 (* Removes the lambdas from an equation of the form "t = (%x. u)".
93 (Cf. "extensionalize_theorem" in "Clausifier".) *)
94 fun extensionalize_term t =
96 fun aux j (@{const Trueprop} $ t') = @{const Trueprop} $ aux j t'
97 | aux j (t as Const (s, Type (_, [Type (_, [_, T']),
98 Type (_, [_, res_T])]))
99 $ t2 $ Abs (var_s, var_T, t')) =
100 if s = @{const_name "op ="} orelse s = @{const_name "=="} then
101 let val var_t = Var ((var_s, j), var_T) in
102 Const (s, T' --> T' --> res_T)
103 $ betapply (t2, var_t) $ subst_bound (var_t, t')
109 in aux (maxidx_of_term t + 1) t end
111 fun introduce_combinators_in_term ctxt kind t =
112 let val thy = ProofContext.theory_of ctxt in
113 if Meson.is_fol_term thy t then
119 @{const Not} $ t1 => @{const Not} $ aux Ts t1
120 | (t0 as Const (@{const_name All}, _)) $ Abs (s, T, t') =>
121 t0 $ Abs (s, T, aux (T :: Ts) t')
122 | (t0 as Const (@{const_name All}, _)) $ t1 =>
123 aux Ts (t0 $ eta_expand Ts t1 1)
124 | (t0 as Const (@{const_name Ex}, _)) $ Abs (s, T, t') =>
125 t0 $ Abs (s, T, aux (T :: Ts) t')
126 | (t0 as Const (@{const_name Ex}, _)) $ t1 =>
127 aux Ts (t0 $ eta_expand Ts t1 1)
128 | (t0 as @{const "op &"}) $ t1 $ t2 => t0 $ aux Ts t1 $ aux Ts t2
129 | (t0 as @{const "op |"}) $ t1 $ t2 => t0 $ aux Ts t1 $ aux Ts t2
130 | (t0 as @{const HOL.implies}) $ t1 $ t2 => t0 $ aux Ts t1 $ aux Ts t2
131 | (t0 as Const (@{const_name "op ="}, Type (_, [@{typ bool}, _])))
133 t0 $ aux Ts t1 $ aux Ts t2
134 | _ => if not (exists_subterm (fn Abs _ => true | _ => false) t) then
137 t |> conceal_bounds Ts
138 |> Envir.eta_contract
140 |> Clausifier.introduce_combinators_in_cterm
141 |> prop_of |> Logic.dest_equals |> snd
143 val ([t], ctxt') = Variable.import_terms true [t] ctxt
144 in t |> aux [] |> singleton (Variable.export_terms ctxt' ctxt) end
146 (* A type variable of sort "{}" will make abstraction fail. *)
147 if kind = Conjecture then HOLogic.false_const
148 else HOLogic.true_const
151 (* Metis's use of "resolve_tac" freezes the schematic variables. We simulate the
152 same in Sledgehammer to prevent the discovery of unreplable proofs. *)
155 fun aux (t $ u) = aux t $ aux u
156 | aux (Abs (s, T, t)) = Abs (s, T, aux t)
157 | aux (Var ((s, i), T)) =
158 Free (sledgehammer_weak_prefix ^ s ^ "_" ^ string_of_int i, T)
160 in t |> exists_subterm is_Var t ? aux end
162 (* "Object_Logic.atomize_term" isn't as powerful as it could be; for example,
163 it leaves metaequalities over "prop"s alone. *)
166 fun aux (@{const Trueprop} $ t1) = t1
167 | aux (Const (@{const_name all}, _) $ Abs (s, T, t')) =
168 HOLogic.all_const T $ Abs (s, T, aux t')
169 | aux (@{const "==>"} $ t1 $ t2) = HOLogic.mk_imp (pairself aux (t1, t2))
170 | aux (Const (@{const_name "=="}, Type (_, [@{typ prop}, _])) $ t1 $ t2) =
171 HOLogic.eq_const HOLogic.boolT $ aux t1 $ aux t2
172 | aux (Const (@{const_name "=="}, Type (_, [T, _])) $ t1 $ t2) =
173 HOLogic.eq_const T $ t1 $ t2
174 | aux _ = raise Fail "aux"
175 in perhaps (try aux) end
177 (* making axiom and conjecture formulas *)
178 fun make_formula ctxt presimp name kind t =
180 val thy = ProofContext.theory_of ctxt
181 val t = t |> Envir.beta_eta_contract
182 |> transform_elim_term
184 val need_trueprop = (fastype_of t = HOLogic.boolT)
185 val t = t |> need_trueprop ? HOLogic.mk_Trueprop
186 |> extensionalize_term
187 |> presimp ? presimplify_term thy
188 |> perhaps (try (HOLogic.dest_Trueprop))
189 |> introduce_combinators_in_term ctxt kind
190 |> kind <> Axiom ? freeze_term
191 val (combformula, ctypes_sorts) = combformula_for_prop thy t []
193 {name = name, combformula = combformula, kind = kind,
194 ctypes_sorts = ctypes_sorts}
197 fun make_axiom ctxt presimp ((name, loc), th) =
198 case make_formula ctxt presimp name Axiom (prop_of th) of
199 {combformula = AAtom (CombConst (("c_True", _), _, _)), ...} => NONE
200 | formula => SOME ((name, loc), formula)
201 fun make_conjecture ctxt ts =
202 let val last = length ts - 1 in
203 map2 (fn j => make_formula ctxt true (Int.toString j)
204 (if j = last then Conjecture else Hypothesis))
210 fun count_combterm (CombConst ((s, _), _, _)) =
211 Symtab.map_entry s (Integer.add 1)
212 | count_combterm (CombVar _) = I
213 | count_combterm (CombApp (t1, t2)) = fold count_combterm [t1, t2]
214 fun count_combformula (AQuant (_, _, phi)) = count_combformula phi
215 | count_combformula (AConn (_, phis)) = fold count_combformula phis
216 | count_combformula (AAtom tm) = count_combterm tm
217 fun count_fol_formula ({combformula, ...} : fol_formula) =
218 count_combformula combformula
220 val optional_helpers =
221 [(["c_COMBI", "c_COMBK"], @{thms COMBI_def COMBK_def}),
222 (["c_COMBB", "c_COMBC"], @{thms COMBB_def COMBC_def}),
223 (["c_COMBS"], @{thms COMBS_def})]
224 val optional_typed_helpers =
225 [(["c_True", "c_False", "c_If"], @{thms True_or_False}),
226 (["c_If"], @{thms if_True if_False})]
227 val mandatory_helpers = @{thms fequal_def}
230 [optional_helpers, optional_typed_helpers] |> maps (maps fst)
231 |> sort_distinct string_ord |> map (rpair 0) |> Symtab.make
233 fun get_helper_facts ctxt is_FO full_types conjectures axioms =
235 val ct = fold (fold count_fol_formula) [conjectures, axioms] init_counters
236 fun is_needed c = the (Symtab.lookup ct c) > 0
237 fun baptize th = ((Thm.get_name_hint th, false), th)
240 |> full_types ? append optional_typed_helpers
241 |> maps (fn (ss, ths) =>
242 if exists is_needed ss then map baptize ths else [])) @
243 (if is_FO then [] else map baptize mandatory_helpers)
244 |> map_filter (Option.map snd o make_axiom ctxt false)
247 fun prepare_formulas ctxt full_types hyp_ts concl_t axiom_pairs =
249 val thy = ProofContext.theory_of ctxt
250 val axiom_ts = map (prop_of o snd) axiom_pairs
255 (* Remove existing axioms from the conjecture, as this can dramatically
256 boost an ATP's performance (for some reason). *)
258 val axiom_table = fold (Termtab.update o rpair ()) axiom_ts
260 in hyp_ts |> filter_out (Termtab.defined axiom_table) end
261 val goal_t = Logic.list_implies (hyp_ts, concl_t)
262 val is_FO = Meson.is_fol_term thy goal_t
263 val subs = tfree_classes_of_terms [goal_t]
264 val supers = tvar_classes_of_terms axiom_ts
265 val tycons = type_consts_of_terms thy (goal_t :: axiom_ts)
266 (* TFrees in the conjecture; TVars in the axioms *)
267 val conjectures = make_conjecture ctxt (hyp_ts @ [concl_t])
268 val (axiom_names, axioms) =
269 ListPair.unzip (map_filter (make_axiom ctxt true) axiom_pairs)
270 val helper_facts = get_helper_facts ctxt is_FO full_types conjectures axioms
271 val (supers', arity_clauses) = make_arity_clauses thy tycons supers
272 val class_rel_clauses = make_class_rel_clauses thy subs supers'
274 (Vector.fromList axiom_names,
275 (conjectures, axioms, helper_facts, class_rel_clauses, arity_clauses))
278 fun wrap_type ty t = ATerm ((type_wrapper_name, type_wrapper_name), [ty, t])
280 fun fo_term_for_combtyp (CombTVar name) = ATerm (name, [])
281 | fo_term_for_combtyp (CombTFree name) = ATerm (name, [])
282 | fo_term_for_combtyp (CombType (name, tys)) =
283 ATerm (name, map fo_term_for_combtyp tys)
285 fun fo_literal_for_type_literal (TyLitVar (class, name)) =
286 (true, ATerm (class, [ATerm (name, [])]))
287 | fo_literal_for_type_literal (TyLitFree (class, name)) =
288 (true, ATerm (class, [ATerm (name, [])]))
290 fun formula_for_fo_literal (pos, t) = AAtom t |> not pos ? mk_anot
292 fun fo_term_for_combterm full_types =
294 fun aux top_level u =
296 val (head, args) = strip_combterm_comb u
299 CombConst (name as (s, s'), _, ty_args) =>
300 let val ty_args = if full_types then [] else ty_args in
302 if top_level andalso length args = 2 then (name, [])
303 else (("c_fequal", @{const_name fequal}), ty_args)
304 else if top_level then
306 "c_False" => (("$false", s'), [])
307 | "c_True" => (("$true", s'), [])
308 | _ => (name, ty_args)
312 | CombVar (name, _) => (name, [])
313 | CombApp _ => raise Fail "impossible \"CombApp\""
314 val t = ATerm (x, map fo_term_for_combtyp ty_args @
315 map (aux false) args)
317 if full_types then wrap_type (fo_term_for_combtyp (combtyp_of u)) t else t
321 fun formula_for_combformula full_types =
323 fun aux (AQuant (q, xs, phi)) = AQuant (q, xs, aux phi)
324 | aux (AConn (c, phis)) = AConn (c, map aux phis)
325 | aux (AAtom tm) = AAtom (fo_term_for_combterm full_types tm)
328 fun formula_for_axiom full_types
329 ({combformula, ctypes_sorts, ...} : fol_formula) =
330 mk_ahorn (map (formula_for_fo_literal o fo_literal_for_type_literal)
331 (type_literals_for_types ctypes_sorts))
332 (formula_for_combformula full_types combformula)
334 fun problem_line_for_fact prefix full_types (formula as {name, kind, ...}) =
335 Fof (prefix ^ ascii_of name, kind, formula_for_axiom full_types formula)
337 fun problem_line_for_class_rel_clause (ClassRelClause {name, subclass,
339 let val ty_arg = ATerm (("T", "T"), []) in
340 Fof (class_rel_clause_prefix ^ ascii_of name, Axiom,
341 AConn (AImplies, [AAtom (ATerm (subclass, [ty_arg])),
342 AAtom (ATerm (superclass, [ty_arg]))]))
345 fun fo_literal_for_arity_literal (TConsLit (c, t, args)) =
346 (true, ATerm (c, [ATerm (t, map (fn arg => ATerm (arg, [])) args)]))
347 | fo_literal_for_arity_literal (TVarLit (c, sort)) =
348 (false, ATerm (c, [ATerm (sort, [])]))
350 fun problem_line_for_arity_clause (ArityClause {name, conclLit, premLits,
352 Fof (arity_clause_prefix ^ ascii_of name, Axiom,
353 mk_ahorn (map (formula_for_fo_literal o apfst not
354 o fo_literal_for_arity_literal) premLits)
355 (formula_for_fo_literal
356 (fo_literal_for_arity_literal conclLit)))
358 fun problem_line_for_conjecture full_types
359 ({name, kind, combformula, ...} : fol_formula) =
360 Fof (conjecture_prefix ^ name, kind,
361 formula_for_combformula full_types combformula)
363 fun free_type_literals_for_conjecture ({ctypes_sorts, ...} : fol_formula) =
364 map fo_literal_for_type_literal (type_literals_for_types ctypes_sorts)
366 fun problem_line_for_free_type lit =
367 Fof (tfrees_name, Hypothesis, formula_for_fo_literal lit)
368 fun problem_lines_for_free_types conjectures =
370 val litss = map free_type_literals_for_conjecture conjectures
371 val lits = fold (union (op =)) litss []
372 in map problem_line_for_free_type lits end
374 (** "hBOOL" and "hAPP" **)
376 type const_info = {min_arity: int, max_arity: int, sub_level: bool}
378 fun consider_term top_level (ATerm ((s, _), ts)) =
379 (if is_tptp_variable s then
382 let val n = length ts in
384 (s, {min_arity = n, max_arity = 0, sub_level = false})
385 (fn {min_arity, max_arity, sub_level} =>
386 {min_arity = Int.min (n, min_arity),
387 max_arity = Int.max (n, max_arity),
388 sub_level = sub_level orelse not top_level})
390 #> fold (consider_term (top_level andalso s = type_wrapper_name)) ts
391 fun consider_formula (AQuant (_, _, phi)) = consider_formula phi
392 | consider_formula (AConn (_, phis)) = fold consider_formula phis
393 | consider_formula (AAtom tm) = consider_term true tm
395 fun consider_problem_line (Fof (_, _, phi)) = consider_formula phi
396 fun consider_problem problem = fold (fold consider_problem_line o snd) problem
398 fun const_table_for_problem explicit_apply problem =
399 if explicit_apply then NONE
400 else SOME (Symtab.empty |> consider_problem problem)
402 fun min_arity_of thy full_types NONE s =
403 (if s = "equal" orelse s = type_wrapper_name orelse
404 String.isPrefix type_const_prefix s orelse
405 String.isPrefix class_prefix s then
406 16383 (* large number *)
407 else if full_types then
409 else case strip_prefix_and_unascii const_prefix s of
410 SOME s' => num_type_args thy (invert_const s')
412 | min_arity_of _ _ (SOME the_const_tab) s =
413 case Symtab.lookup the_const_tab s of
414 SOME ({min_arity, ...} : const_info) => min_arity
417 fun full_type_of (ATerm ((s, _), [ty, _])) =
418 if s = type_wrapper_name then ty else raise Fail "expected type wrapper"
419 | full_type_of _ = raise Fail "expected type wrapper"
421 fun list_hAPP_rev _ t1 [] = t1
422 | list_hAPP_rev NONE t1 (t2 :: ts2) =
423 ATerm (`I "hAPP", [list_hAPP_rev NONE t1 ts2, t2])
424 | list_hAPP_rev (SOME ty) t1 (t2 :: ts2) =
425 let val ty' = ATerm (`make_fixed_type_const @{type_name fun},
426 [full_type_of t2, ty]) in
427 ATerm (`I "hAPP", [wrap_type ty' (list_hAPP_rev (SOME ty') t1 ts2), t2])
430 fun repair_applications_in_term thy full_types const_tab =
432 fun aux opt_ty (ATerm (name as (s, _), ts)) =
433 if s = type_wrapper_name then
435 [t1, t2] => ATerm (name, [aux NONE t1, aux (SOME t1) t2])
436 | _ => raise Fail "malformed type wrapper"
439 val ts = map (aux NONE) ts
440 val (ts1, ts2) = chop (min_arity_of thy full_types const_tab s) ts
441 in list_hAPP_rev opt_ty (ATerm (name, ts1)) (rev ts2) end
444 fun boolify t = ATerm (`I "hBOOL", [t])
446 (* True if the constant ever appears outside of the top-level position in
447 literals, or if it appears with different arities (e.g., because of different
448 type instantiations). If false, the constant always receives all of its
449 arguments and is used as a predicate. *)
450 fun is_predicate NONE s =
451 s = "equal" orelse s = "$false" orelse s = "$true" orelse
452 String.isPrefix type_const_prefix s orelse String.isPrefix class_prefix s
453 | is_predicate (SOME the_const_tab) s =
454 case Symtab.lookup the_const_tab s of
455 SOME {min_arity, max_arity, sub_level} =>
456 not sub_level andalso min_arity = max_arity
459 fun repair_predicates_in_term const_tab (t as ATerm ((s, _), ts)) =
460 if s = type_wrapper_name then
462 [_, t' as ATerm ((s', _), _)] =>
463 if is_predicate const_tab s' then t' else boolify t
464 | _ => raise Fail "malformed type wrapper"
466 t |> not (is_predicate const_tab s) ? boolify
468 fun close_universally phi =
470 fun term_vars bounds (ATerm (name as (s, _), tms)) =
471 (is_tptp_variable s andalso not (member (op =) bounds name))
473 #> fold (term_vars bounds) tms
474 fun formula_vars bounds (AQuant (_, xs, phi)) =
475 formula_vars (xs @ bounds) phi
476 | formula_vars bounds (AConn (_, phis)) = fold (formula_vars bounds) phis
477 | formula_vars bounds (AAtom tm) = term_vars bounds tm
479 case formula_vars [] phi [] of [] => phi | xs => AQuant (AForall, xs, phi)
482 fun repair_formula thy explicit_forall full_types const_tab =
484 fun aux (AQuant (q, xs, phi)) = AQuant (q, xs, aux phi)
485 | aux (AConn (c, phis)) = AConn (c, map aux phis)
487 AAtom (tm |> repair_applications_in_term thy full_types const_tab
488 |> repair_predicates_in_term const_tab)
489 in aux #> explicit_forall ? close_universally end
491 fun repair_problem_line thy explicit_forall full_types const_tab
492 (Fof (ident, kind, phi)) =
493 Fof (ident, kind, repair_formula thy explicit_forall full_types const_tab phi)
494 fun repair_problem_with_const_table thy =
495 map o apsnd o map ooo repair_problem_line thy
497 fun repair_problem thy explicit_forall full_types explicit_apply problem =
498 repair_problem_with_const_table thy explicit_forall full_types
499 (const_table_for_problem explicit_apply problem) problem
501 fun prepare_problem ctxt readable_names explicit_forall full_types
502 explicit_apply hyp_ts concl_t axiom_pairs =
504 val thy = ProofContext.theory_of ctxt
505 val (axiom_names, (conjectures, axioms, helper_facts, class_rel_clauses,
507 prepare_formulas ctxt full_types hyp_ts concl_t axiom_pairs
508 val axiom_lines = map (problem_line_for_fact axiom_prefix full_types) axioms
510 map (problem_line_for_fact helper_prefix full_types) helper_facts
511 val conjecture_lines =
512 map (problem_line_for_conjecture full_types) conjectures
513 val tfree_lines = problem_lines_for_free_types conjectures
514 val class_rel_lines =
515 map problem_line_for_class_rel_clause class_rel_clauses
516 val arity_lines = map problem_line_for_arity_clause arity_clauses
517 (* Reordering these might or might not confuse the proof reconstruction
518 code or the SPASS Flotter hack. *)
520 [("Relevant facts", axiom_lines),
521 ("Class relationships", class_rel_lines),
522 ("Arity declarations", arity_lines),
523 ("Helper facts", helper_lines),
524 ("Conjectures", conjecture_lines),
525 ("Type variables", tfree_lines)]
526 |> repair_problem thy explicit_forall full_types explicit_apply
527 val (problem, pool) = nice_tptp_problem readable_names problem
528 val conjecture_offset =
529 length axiom_lines + length class_rel_lines + length arity_lines
530 + length helper_lines
533 case pool of SOME the_pool => snd the_pool | NONE => Symtab.empty,
534 conjecture_offset, axiom_names)