distinguish between recursive and nonrecursive definitions + clean up typedef dependencies in MaSh
1 (* Title: HOL/Tools/ATP/atp_proof_reconstruct.ML
2 Author: Lawrence C. Paulson, Cambridge University Computer Laboratory
3 Author: Claire Quigley, Cambridge University Computer Laboratory
4 Author: Jasmin Blanchette, TU Muenchen
6 Proof reconstruction from ATP proofs.
9 signature ATP_PROOF_RECONSTRUCT =
11 type ('a, 'b) ho_term = ('a, 'b) ATP_Problem.ho_term
12 type ('a, 'b, 'c, 'd) formula = ('a, 'b, 'c, 'd) ATP_Problem.formula
13 type 'a proof = 'a ATP_Proof.proof
14 type stature = ATP_Problem_Generate.stature
16 datatype reconstructor =
17 Metis of string * string |
21 Played of reconstructor * Time.time |
22 Trust_Playable of reconstructor * Time.time option |
23 Failed_to_Play of reconstructor
25 type minimize_command = string list -> string
26 type one_line_params =
27 play * string * (string * stature) list * minimize_command * int * int
29 bool * int * string Symtab.table * (string * stature) list vector
30 * int Symtab.table * string proof * thm
34 val full_typesN : string
35 val partial_typesN : string
36 val no_typesN : string
37 val really_full_type_enc : string
38 val full_type_enc : string
39 val partial_type_enc : string
40 val no_type_enc : string
41 val full_type_encs : string list
42 val partial_type_encs : string list
43 val metis_default_lam_trans : string
44 val metis_call : string -> string -> string
45 val string_for_reconstructor : reconstructor -> string
46 val used_facts_in_atp_proof :
47 Proof.context -> (string * stature) list vector -> string proof
48 -> (string * stature) list
49 val lam_trans_from_atp_proof : string proof -> string -> string
50 val is_typed_helper_used_in_atp_proof : string proof -> bool
51 val used_facts_in_unsound_atp_proof :
52 Proof.context -> (string * stature) list vector -> 'a proof
54 val unalias_type_enc : string -> string list
55 val one_line_proof_text : one_line_params -> string
56 val make_tvar : string -> typ
57 val make_tfree : Proof.context -> string -> typ
59 Proof.context -> bool -> int Symtab.table -> typ option
60 -> (string, string) ho_term -> term
62 Proof.context -> bool -> int Symtab.table
63 -> (string, string, (string, string) ho_term, string) formula -> term
65 Proof.context -> bool -> isar_params -> one_line_params -> string
67 Proof.context -> bool -> isar_params -> one_line_params -> string
70 structure ATP_Proof_Reconstruct : ATP_PROOF_RECONSTRUCT =
76 open ATP_Problem_Generate
78 structure String_Redirect = ATP_Proof_Redirect(
80 val ord = fn ((s, _ : string list), (s', _)) => fast_string_ord (s, s')
85 datatype reconstructor =
86 Metis of string * string |
90 Played of reconstructor * Time.time |
91 Trust_Playable of reconstructor * Time.time option |
92 Failed_to_Play of reconstructor
94 type minimize_command = string list -> string
95 type one_line_params =
96 play * string * (string * stature) list * minimize_command * int * int
98 bool * int * string Symtab.table * (string * stature) list vector
99 * int Symtab.table * string proof * thm
104 val full_typesN = "full_types"
105 val partial_typesN = "partial_types"
106 val no_typesN = "no_types"
108 val really_full_type_enc = "mono_tags"
109 val full_type_enc = "poly_guards_query"
110 val partial_type_enc = "poly_args"
111 val no_type_enc = "erased"
113 val full_type_encs = [full_type_enc, really_full_type_enc]
114 val partial_type_encs = partial_type_enc :: full_type_encs
116 val type_enc_aliases =
117 [(full_typesN, full_type_encs),
118 (partial_typesN, partial_type_encs),
119 (no_typesN, [no_type_enc])]
121 fun unalias_type_enc s =
122 AList.lookup (op =) type_enc_aliases s |> the_default [s]
124 val metis_default_lam_trans = combsN
126 fun metis_call type_enc lam_trans =
129 case AList.find (fn (enc, encs) => enc = hd encs) type_enc_aliases
133 val opts = [] |> type_enc <> partial_typesN ? cons type_enc
134 |> lam_trans <> metis_default_lam_trans ? cons lam_trans
135 in metisN ^ (if null opts then "" else " (" ^ commas opts ^ ")") end
137 fun string_for_reconstructor (Metis (type_enc, lam_trans)) =
138 metis_call type_enc lam_trans
139 | string_for_reconstructor SMT = smtN
141 fun find_first_in_list_vector vec key =
142 Vector.foldl (fn (ps, NONE) => AList.lookup (op =) ps key
143 | (_, value) => value) NONE vec
145 val unprefix_fact_number = space_implode "_" o tl o space_explode "_"
147 fun resolve_one_named_fact fact_names s =
148 case try (unprefix fact_prefix) s of
150 let val s' = s' |> unprefix_fact_number |> unascii_of in
151 s' |> find_first_in_list_vector fact_names |> Option.map (pair s')
154 fun resolve_fact fact_names = map_filter (resolve_one_named_fact fact_names)
155 fun is_fact fact_names = not o null o resolve_fact fact_names
157 fun resolve_one_named_conjecture s =
158 case try (unprefix conjecture_prefix) s of
159 SOME s' => Int.fromString s'
162 val resolve_conjecture = map_filter resolve_one_named_conjecture
163 val is_conjecture = not o null o resolve_conjecture
165 fun is_axiom_used_in_proof pred =
166 exists (fn Inference_Step ((_, ss), _, _, []) => exists pred ss | _ => false)
168 val is_combinator_def = String.isPrefix (helper_prefix ^ combinator_prefix)
170 val ascii_of_lam_fact_prefix = ascii_of lam_fact_prefix
172 (* overapproximation (good enough) *)
173 fun is_lam_lifted s =
174 String.isPrefix fact_prefix s andalso
175 String.isSubstring ascii_of_lam_fact_prefix s
177 fun lam_trans_from_atp_proof atp_proof default =
178 case (is_axiom_used_in_proof is_combinator_def atp_proof,
179 is_axiom_used_in_proof is_lam_lifted atp_proof) of
180 (false, false) => default
181 | (false, true) => liftingN
182 (* | (true, true) => combs_and_liftingN -- not supported by "metis" *)
183 | (true, _) => combsN
185 val is_typed_helper_name =
186 String.isPrefix helper_prefix andf String.isSuffix typed_helper_suffix
187 fun is_typed_helper_used_in_atp_proof atp_proof =
188 is_axiom_used_in_proof is_typed_helper_name atp_proof
190 val leo2_ext = "extcnf_equal_neg"
191 val leo2_unfold_def = "unfold_def"
193 val isa_ext = Thm.get_name_hint @{thm ext}
194 val isa_short_ext = Long_Name.base_name isa_ext
197 if Thm.eq_thm_prop (@{thm ext},
198 singleton (Attrib.eval_thms ctxt) (Facts.named isa_short_ext, [])) then
203 fun add_non_rec_defs fact_names accum =
205 (fn (facts, facts') =>
207 (filter (fn (_, (_, status)) => status = Non_Rec_Def) facts)
211 fun add_fact ctxt fact_names (Inference_Step ((_, ss), _, rule, deps)) =
212 (if rule = leo2_ext then
213 insert (op =) (ext_name ctxt, (Global, General))
214 else if rule = leo2_unfold_def then
215 (* LEO 1.3.3 does not record definitions properly, leading to missing
216 dependencies in the TSTP proof. Remove the next line once this is
218 add_non_rec_defs fact_names
219 else if rule = satallax_unsat_coreN then
221 (* Satallax doesn't include definitions in its unsatisfiable cores,
222 so we assume the worst and include them all here. *)
223 [(ext_name ctxt, (Global, General))] |> add_non_rec_defs fact_names
227 #> (if null deps then union (op =) (resolve_fact fact_names ss)
231 fun used_facts_in_atp_proof ctxt fact_names atp_proof =
232 if null atp_proof then Vector.foldl (uncurry (union (op =))) [] fact_names
233 else fold (add_fact ctxt fact_names) atp_proof []
235 fun used_facts_in_unsound_atp_proof _ _ [] = NONE
236 | used_facts_in_unsound_atp_proof ctxt fact_names atp_proof =
237 let val used_facts = used_facts_in_atp_proof ctxt fact_names atp_proof in
238 if forall (fn (_, (sc, _)) => sc = Global) used_facts andalso
239 not (is_axiom_used_in_proof (is_conjecture o single) atp_proof) then
240 SOME (map fst used_facts)
246 (** Soft-core proof reconstruction: one-liners **)
248 fun string_for_label (s, num) = s ^ string_of_int num
250 fun show_time NONE = ""
251 | show_time (SOME ext_time) = " (" ^ string_from_ext_time ext_time ^ ")"
253 fun apply_on_subgoal _ 1 = "by "
254 | apply_on_subgoal 1 _ = "apply "
255 | apply_on_subgoal i n =
256 "prefer " ^ string_of_int i ^ " " ^ apply_on_subgoal 1 n
257 fun command_call name [] =
258 name |> not (Lexicon.is_identifier name) ? enclose "(" ")"
259 | command_call name args = "(" ^ name ^ " " ^ space_implode " " args ^ ")"
260 fun try_command_line banner time command =
261 banner ^ ": " ^ Markup.markup Isabelle_Markup.sendback command ^ show_time time ^ "."
262 fun using_labels [] = ""
264 "using " ^ space_implode " " (map string_for_label ls) ^ " "
265 fun reconstructor_command reconstr i n (ls, ss) =
266 using_labels ls ^ apply_on_subgoal i n ^
267 command_call (string_for_reconstructor reconstr) ss
268 fun minimize_line _ [] = ""
269 | minimize_line minimize_command ss =
270 case minimize_command ss of
273 "\nTo minimize: " ^ Markup.markup Isabelle_Markup.sendback command ^ "."
275 fun split_used_facts facts =
276 facts |> List.partition (fn (_, (sc, _)) => sc = Chained)
277 |> pairself (sort_distinct (string_ord o pairself fst))
279 fun one_line_proof_text (preplay, banner, used_facts, minimize_command,
280 subgoal, subgoal_count) =
282 val (chained, extra) = split_used_facts used_facts
283 val (failed, reconstr, ext_time) =
285 Played (reconstr, time) => (false, reconstr, (SOME (false, time)))
286 | Trust_Playable (reconstr, time) =>
291 if time = Time.zeroTime then NONE else SOME (true, time))
292 | Failed_to_Play reconstr => (true, reconstr, NONE)
295 |> reconstructor_command reconstr subgoal subgoal_count
297 enclose "One-line proof reconstruction failed: "
298 ".\n(Invoking \"sledgehammer\" with \"[strict]\" might \
301 try_command_line banner ext_time)
302 in try_line ^ minimize_line minimize_command (map fst (extra @ chained)) end
304 (** Hard-core proof reconstruction: structured Isar proofs **)
306 fun forall_of v t = HOLogic.all_const (fastype_of v) $ lambda v t
307 fun exists_of v t = HOLogic.exists_const (fastype_of v) $ lambda v t
309 fun make_tvar s = TVar (("'" ^ s, 0), HOLogic.typeS)
310 fun make_tfree ctxt w =
311 let val ww = "'" ^ w in
312 TFree (ww, the_default HOLogic.typeS (Variable.def_sort ctxt (ww, ~1)))
316 val no_label = ("", ~1)
319 val assum_prefix = "a"
320 val have_prefix = "f"
322 fun raw_label_for_name (num, ss) =
323 case resolve_conjecture ss of
324 [j] => (conjecture_prefix, j)
325 | _ => (raw_prefix ^ ascii_of num, 0)
327 (**** INTERPRETATION OF TSTP SYNTAX TREES ****)
329 exception HO_TERM of (string, string) ho_term list
331 (string, string, (string, string) ho_term, string) formula list
332 exception SAME of unit
334 (* Type variables are given the basic sort "HOL.type". Some will later be
335 constrained by information from type literals, or by type inference. *)
336 fun typ_from_atp ctxt (u as ATerm ((a, _), us)) =
337 let val Ts = map (typ_from_atp ctxt) us in
338 case unprefix_and_unascii type_const_prefix a of
339 SOME b => Type (invert_const b, Ts)
341 if not (null us) then
342 raise HO_TERM [u] (* only "tconst"s have type arguments *)
343 else case unprefix_and_unascii tfree_prefix a of
344 SOME b => make_tfree ctxt b
346 (* Could be an Isabelle variable or a variable from the ATP, say "X1"
347 or "_5018". Sometimes variables from the ATP are indistinguishable
348 from Isabelle variables, which forces us to use a type parameter in
350 (a |> perhaps (unprefix_and_unascii tvar_prefix), HOLogic.typeS)
351 |> Type_Infer.param 0
354 (* Type class literal applied to a type. Returns triple of polarity, class,
356 fun type_constraint_from_term ctxt (u as ATerm ((a, _), us)) =
357 case (unprefix_and_unascii class_prefix a, map (typ_from_atp ctxt) us) of
358 (SOME b, [T]) => (b, T)
359 | _ => raise HO_TERM [u]
361 (* Accumulate type constraints in a formula: negative type literals. *)
362 fun add_var (key, z) = Vartab.map_default (key, []) (cons z)
363 fun add_type_constraint false (cl, TFree (a ,_)) = add_var ((a, ~1), cl)
364 | add_type_constraint false (cl, TVar (ix, _)) = add_var (ix, cl)
365 | add_type_constraint _ _ = I
367 fun repair_variable_name f s =
369 fun subscript_name s n = s ^ nat_subscript n
370 val s = String.map f s
372 case space_explode "_" s of
373 [_] => (case take_suffix Char.isDigit (String.explode s) of
374 (cs1 as _ :: _, cs2 as _ :: _) =>
375 subscript_name (String.implode cs1)
376 (the (Int.fromString (String.implode cs2)))
378 | [s1, s2] => (case Int.fromString s2 of
379 SOME n => subscript_name s1 n
384 (* The number of type arguments of a constant, zero if it's monomorphic. For
385 (instances of) Skolem pseudoconstants, this information is encoded in the
387 fun num_type_args thy s =
388 if String.isPrefix skolem_const_prefix s then
389 s |> Long_Name.explode |> List.last |> Int.fromString |> the
390 else if String.isPrefix lam_lifted_prefix s then
391 if String.isPrefix lam_lifted_poly_prefix s then 2 else 0
393 (s, Sign.the_const_type thy s) |> Sign.const_typargs thy |> length
395 fun slack_fastype_of t = fastype_of t handle TERM _ => HOLogic.typeT
397 (* First-order translation. No types are known for variables. "HOLogic.typeT"
398 should allow them to be inferred. *)
399 fun term_from_atp ctxt textual sym_tab =
401 val thy = Proof_Context.theory_of ctxt
402 (* For Metis, we use 1 rather than 0 because variable references in clauses
403 may otherwise conflict with variable constraints in the goal. At least,
404 type inference often fails otherwise. See also "axiom_inference" in
405 "Metis_Reconstruct". *)
406 val var_index = if textual then 0 else 1
407 fun do_term extra_ts opt_T u =
409 ATerm ((s, _), us) =>
410 if String.isPrefix native_type_prefix s then
411 @{const True} (* ignore TPTP type information *)
412 else if s = tptp_equal then
413 let val ts = map (do_term [] NONE) us in
414 if textual andalso length ts = 2 andalso
415 hd ts aconv List.last ts then
416 (* Vampire is keen on producing these. *)
419 list_comb (Const (@{const_name HOL.eq}, HOLogic.typeT), ts)
421 else case unprefix_and_unascii const_prefix s of
424 val ((s', s''), mangled_us) =
425 s' |> unmangled_const |>> `invert_const
427 if s' = type_tag_name then
428 case mangled_us @ us of
430 do_term extra_ts (SOME (typ_from_atp ctxt typ_u)) term_u
431 | _ => raise HO_TERM us
432 else if s' = predicator_name then
433 do_term [] (SOME @{typ bool}) (hd us)
434 else if s' = app_op_name then
435 let val extra_t = do_term [] NONE (List.last us) in
436 do_term (extra_t :: extra_ts)
438 SOME T => SOME (slack_fastype_of extra_t --> T)
440 (nth us (length us - 2))
442 else if s' = type_guard_name then
443 @{const True} (* ignore type predicates *)
446 val new_skolem = String.isPrefix new_skolem_const_prefix s''
448 length us - the_default 0 (Symtab.lookup sym_tab s)
449 val (type_us, term_us) =
450 chop num_ty_args us |>> append mangled_us
451 val term_ts = map (do_term [] NONE) term_us
453 (if not (null type_us) andalso
454 num_type_args thy s' = length type_us then
455 let val Ts = type_us |> map (typ_from_atp ctxt) in
457 SOME (Type_Infer.paramify_vars (tl Ts ---> hd Ts))
459 try (Sign.const_instance thy) (s', Ts)
466 | NONE => map slack_fastype_of term_ts --->
469 | NONE => HOLogic.typeT))
472 Var ((new_skolem_var_name_from_const s'', var_index), T)
474 Const (unproxify_const s', T)
475 in list_comb (t, term_ts @ extra_ts) end
477 | NONE => (* a free or schematic variable *)
479 val term_ts = map (do_term [] NONE) us
480 val ts = term_ts @ extra_ts
483 SOME T => map slack_fastype_of term_ts ---> T
484 | NONE => map slack_fastype_of ts ---> HOLogic.typeT
486 case unprefix_and_unascii fixed_var_prefix s of
487 SOME s => Free (s, T)
489 case unprefix_and_unascii schematic_var_prefix s of
490 SOME s => Var ((s, var_index), T)
492 Var ((s |> textual ? repair_variable_name Char.toLower,
494 in list_comb (t, ts) end
497 fun term_from_atom ctxt textual sym_tab pos (u as ATerm ((s, _), _)) =
498 if String.isPrefix class_prefix s then
499 add_type_constraint pos (type_constraint_from_term ctxt u)
500 #> pair @{const True}
502 pair (term_from_atp ctxt textual sym_tab (SOME @{typ bool}) u)
504 val combinator_table =
505 [(@{const_name Meson.COMBI}, @{thm Meson.COMBI_def [abs_def]}),
506 (@{const_name Meson.COMBK}, @{thm Meson.COMBK_def [abs_def]}),
507 (@{const_name Meson.COMBB}, @{thm Meson.COMBB_def [abs_def]}),
508 (@{const_name Meson.COMBC}, @{thm Meson.COMBC_def [abs_def]}),
509 (@{const_name Meson.COMBS}, @{thm Meson.COMBS_def [abs_def]})]
511 fun uncombine_term thy =
513 fun aux (t1 $ t2) = betapply (pairself aux (t1, t2))
514 | aux (Abs (s, T, t')) = Abs (s, T, aux t')
515 | aux (t as Const (x as (s, _))) =
516 (case AList.lookup (op =) combinator_table s of
517 SOME thm => thm |> prop_of |> specialize_type thy x
518 |> Logic.dest_equals |> snd
523 (* Update schematic type variables with detected sort constraints. It's not
524 totally clear whether this code is necessary. *)
525 fun repair_tvar_sorts (t, tvar_tab) =
527 fun do_type (Type (a, Ts)) = Type (a, map do_type Ts)
528 | do_type (TVar (xi, s)) =
529 TVar (xi, the_default s (Vartab.lookup tvar_tab xi))
530 | do_type (TFree z) = TFree z
531 fun do_term (Const (a, T)) = Const (a, do_type T)
532 | do_term (Free (a, T)) = Free (a, do_type T)
533 | do_term (Var (xi, T)) = Var (xi, do_type T)
534 | do_term (t as Bound _) = t
535 | do_term (Abs (a, T, t)) = Abs (a, do_type T, do_term t)
536 | do_term (t1 $ t2) = do_term t1 $ do_term t2
537 in t |> not (Vartab.is_empty tvar_tab) ? do_term end
539 fun quantify_over_var quant_of var_s t =
541 val vars = [] |> Term.add_vars t |> filter (fn ((s, _), _) => s = var_s)
543 in fold_rev quant_of vars t end
545 (* Interpret an ATP formula as a HOL term, extracting sort constraints as they
546 appear in the formula. *)
547 fun prop_from_atp ctxt textual sym_tab phi =
549 fun do_formula pos phi =
551 AQuant (_, [], phi) => do_formula pos phi
552 | AQuant (q, (s, _) :: xs, phi') =>
553 do_formula pos (AQuant (q, xs, phi'))
555 #>> quantify_over_var (case q of
557 | AExists => exists_of)
558 (s |> textual ? repair_variable_name Char.toLower)
559 | AConn (ANot, [phi']) => do_formula (not pos) phi' #>> s_not
560 | AConn (c, [phi1, phi2]) =>
561 do_formula (pos |> c = AImplies ? not) phi1
562 ##>> do_formula pos phi2
568 | ANot => raise Fail "impossible connective")
569 | AAtom tm => term_from_atom ctxt textual sym_tab pos tm
570 | _ => raise FORMULA [phi]
571 in repair_tvar_sorts (do_formula true phi Vartab.empty) end
573 fun infer_formula_types ctxt =
574 Type.constraint HOLogic.boolT
576 (Proof_Context.set_mode Proof_Context.mode_schematic ctxt)
578 fun uncombined_etc_prop_from_atp ctxt textual sym_tab =
579 let val thy = Proof_Context.theory_of ctxt in
580 prop_from_atp ctxt textual sym_tab
581 #> textual ? uncombine_term thy #> infer_formula_types ctxt
584 (**** Translation of TSTP files to Isar proofs ****)
586 fun unvarify_term (Var ((s, 0), T)) = Free (s, T)
587 | unvarify_term t = raise TERM ("unvarify_term: non-Var", [t])
589 fun decode_line sym_tab (Definition_Step (name, phi1, phi2)) ctxt =
591 val thy = Proof_Context.theory_of ctxt
592 val t1 = prop_from_atp ctxt true sym_tab phi1
593 val vars = snd (strip_comb t1)
594 val frees = map unvarify_term vars
595 val unvarify_args = subst_atomic (vars ~~ frees)
596 val t2 = prop_from_atp ctxt true sym_tab phi2
598 HOLogic.eq_const HOLogic.typeT $ t1 $ t2
599 |> unvarify_args |> uncombine_term thy |> infer_formula_types ctxt
602 (Definition_Step (name, t1, t2),
603 fold Variable.declare_term (maps Misc_Legacy.term_frees [t1, t2]) ctxt)
605 | decode_line sym_tab (Inference_Step (name, u, rule, deps)) ctxt =
606 let val t = u |> uncombined_etc_prop_from_atp ctxt true sym_tab in
607 (Inference_Step (name, t, rule, deps),
608 fold Variable.declare_term (Misc_Legacy.term_frees t) ctxt)
610 fun decode_lines ctxt sym_tab lines =
611 fst (fold_map (decode_line sym_tab) lines ctxt)
613 fun is_same_inference _ (Definition_Step _) = false
614 | is_same_inference t (Inference_Step (_, t', _, _)) = t aconv t'
616 (* No "real" literals means only type information (tfree_tcs, clsrel, or
618 fun is_only_type_information t = t aconv @{term True}
620 fun replace_one_dependency (old, new) dep =
621 if is_same_atp_step dep old then new else [dep]
622 fun replace_dependencies_in_line _ (line as Definition_Step _) = line
623 | replace_dependencies_in_line p (Inference_Step (name, t, rule, deps)) =
624 Inference_Step (name, t, rule,
625 fold (union (op =) o replace_one_dependency p) deps [])
627 (* Discard facts; consolidate adjacent lines that prove the same formula, since
628 they differ only in type information.*)
629 fun add_line _ (line as Definition_Step _) lines = line :: lines
630 | add_line fact_names (Inference_Step (name as (_, ss), t, rule, [])) lines =
631 (* No dependencies: fact, conjecture, or (for Vampire) internal facts or
633 if is_fact fact_names ss then
634 (* Facts are not proof lines. *)
635 if is_only_type_information t then
636 map (replace_dependencies_in_line (name, [])) lines
637 (* Is there a repetition? If so, replace later line by earlier one. *)
638 else case take_prefix (not o is_same_inference t) lines of
639 (_, []) => lines (* no repetition of proof line *)
640 | (pre, Inference_Step (name', _, _, _) :: post) =>
641 pre @ map (replace_dependencies_in_line (name', [name])) post
642 | _ => raise Fail "unexpected inference"
643 else if is_conjecture ss then
644 Inference_Step (name, t, rule, []) :: lines
646 map (replace_dependencies_in_line (name, [])) lines
647 | add_line _ (Inference_Step (name, t, rule, deps)) lines =
648 (* Type information will be deleted later; skip repetition test. *)
649 if is_only_type_information t then
650 Inference_Step (name, t, rule, deps) :: lines
651 (* Is there a repetition? If so, replace later line by earlier one. *)
652 else case take_prefix (not o is_same_inference t) lines of
653 (* FIXME: Doesn't this code risk conflating proofs involving different
655 (_, []) => Inference_Step (name, t, rule, deps) :: lines
656 | (pre, Inference_Step (name', t', rule, _) :: post) =>
657 Inference_Step (name, t', rule, deps) ::
658 pre @ map (replace_dependencies_in_line (name', [name])) post
659 | _ => raise Fail "unexpected inference"
661 val waldmeister_conjecture_num = "1.0.0.0"
663 val repair_waldmeister_endgame =
665 fun do_tail (Inference_Step (name, t, rule, deps)) =
666 Inference_Step (name, s_not t, rule, deps)
667 | do_tail line = line
669 | do_body ((line as Inference_Step ((num, _), _, _, _)) :: lines) =
670 if num = waldmeister_conjecture_num then map do_tail (line :: lines)
671 else line :: do_body lines
672 | do_body (line :: lines) = line :: do_body lines
675 (* Recursively delete empty lines (type information) from the proof. *)
676 fun add_nontrivial_line (line as Inference_Step (name, t, _, [])) lines =
677 if is_only_type_information t then delete_dependency name lines
679 | add_nontrivial_line line lines = line :: lines
680 and delete_dependency name lines =
681 fold_rev add_nontrivial_line
682 (map (replace_dependencies_in_line (name, [])) lines) []
684 (* ATPs sometimes reuse free variable names in the strangest ways. Removing
685 offending lines often does the trick. *)
686 fun is_bad_free frees (Free x) = not (member (op =) frees x)
687 | is_bad_free _ _ = false
689 fun add_desired_line _ _ _ (line as Definition_Step (name, _, _)) (j, lines) =
690 (j, line :: map (replace_dependencies_in_line (name, [])) lines)
691 | add_desired_line isar_shrink_factor fact_names frees
692 (Inference_Step (name as (_, ss), t, rule, deps)) (j, lines) =
694 if is_fact fact_names ss orelse
695 is_conjecture ss orelse
696 (* the last line must be kept *)
698 (not (is_only_type_information t) andalso
699 null (Term.add_tvars t []) andalso
700 not (exists_subterm (is_bad_free frees) t) andalso
701 length deps >= 2 andalso j mod isar_shrink_factor = 0 andalso
702 (* kill next to last line, which usually results in a trivial step *)
704 Inference_Step (name, t, rule, deps) :: lines (* keep line *)
706 map (replace_dependencies_in_line (name, deps)) lines) (* drop line *)
708 (** Isar proof construction and manipulation **)
710 type label = string * int
711 type facts = label list * string list
713 datatype isar_qualifier = Show | Then | Moreover | Ultimately
716 Fix of (string * typ) list |
718 Assume of label * term |
719 Prove of isar_qualifier list * label * term * byline
722 Case_Split of isar_step list list * facts
724 fun add_fact_from_dependency fact_names (name as (_, ss)) =
725 if is_fact fact_names ss then
726 apsnd (union (op =) (map fst (resolve_fact fact_names ss)))
728 apfst (insert (op =) (raw_label_for_name name))
730 fun repair_name "$true" = "c_True"
731 | repair_name "$false" = "c_False"
732 | repair_name "$$e" = tptp_equal (* seen in Vampire proofs *)
734 if is_tptp_equal s orelse
735 (* seen in Vampire proofs *)
736 (String.isPrefix "sQ" s andalso String.isSuffix "_eqProxy" s) then
741 (* FIXME: Still needed? Try with SPASS proofs perhaps. *)
742 val kill_duplicate_assumptions_in_proof =
744 fun relabel_facts subst =
745 apfst (map (fn l => AList.lookup (op =) subst l |> the_default l))
746 fun do_step (step as Assume (l, t)) (proof, subst, assums) =
747 (case AList.lookup (op aconv) assums t of
748 SOME l' => (proof, (l, l') :: subst, assums)
749 | NONE => (step :: proof, subst, (t, l) :: assums))
750 | do_step (Prove (qs, l, t, by)) (proof, subst, assums) =
753 By_Metis facts => By_Metis (relabel_facts subst facts)
754 | Case_Split (proofs, facts) =>
755 Case_Split (map do_proof proofs,
756 relabel_facts subst facts)) ::
757 proof, subst, assums)
758 | do_step step (proof, subst, assums) = (step :: proof, subst, assums)
759 and do_proof proof = fold do_step proof ([], [], []) |> #1 |> rev
762 fun used_labels_of_step (Prove (_, _, _, by)) =
764 By_Metis (ls, _) => ls
765 | Case_Split (proofs, (ls, _)) =>
766 fold (union (op =) o used_labels_of) proofs ls)
767 | used_labels_of_step _ = []
768 and used_labels_of proof = fold (union (op =) o used_labels_of_step) proof []
770 fun kill_useless_labels_in_proof proof =
772 val used_ls = used_labels_of proof
773 fun do_label l = if member (op =) used_ls l then l else no_label
774 fun do_step (Assume (l, t)) = Assume (do_label l, t)
775 | do_step (Prove (qs, l, t, by)) =
776 Prove (qs, do_label l, t,
778 Case_Split (proofs, facts) =>
779 Case_Split (map (map do_step) proofs, facts)
781 | do_step step = step
782 in map do_step proof end
784 fun prefix_for_depth n = replicate_string (n + 1)
788 fun aux _ _ _ [] = []
789 | aux subst depth (next_assum, next_fact) (Assume (l, t) :: proof) =
791 Assume (l, t) :: aux subst depth (next_assum, next_fact) proof
793 let val l' = (prefix_for_depth depth assum_prefix, next_assum) in
795 aux ((l, l') :: subst) depth (next_assum + 1, next_fact) proof
797 | aux subst depth (next_assum, next_fact)
798 (Prove (qs, l, t, by) :: proof) =
800 val (l', subst, next_fact) =
802 (l, subst, next_fact)
805 val l' = (prefix_for_depth depth have_prefix, next_fact)
806 in (l', (l, l') :: subst, next_fact + 1) end
808 apfst (maps (the_list o AList.lookup (op =) subst))
811 By_Metis facts => By_Metis (relabel_facts facts)
812 | Case_Split (proofs, facts) =>
813 Case_Split (map (aux subst (depth + 1) (1, 1)) proofs,
816 Prove (qs, l', t, by) :: aux subst depth (next_assum, next_fact) proof
818 | aux subst depth nextp (step :: proof) =
819 step :: aux subst depth nextp proof
820 in aux [] 0 (1, 1) end
822 fun string_for_proof ctxt0 type_enc lam_trans i n =
825 (* FIXME: Implement proper handling of type constraints:
826 |> Config.put show_free_types false
827 |> Config.put show_types false
828 |> Config.put show_sorts false
830 fun fix_print_mode f x =
831 Print_Mode.setmp (filter (curry (op =) Symbol.xsymbolsN)
832 (print_mode_value ())) f x
833 fun do_indent ind = replicate_string (ind * indent_size) " "
835 maybe_quote s ^ " :: " ^
836 maybe_quote (fix_print_mode (Syntax.string_of_typ ctxt) T)
837 fun do_label l = if l = no_label then "" else string_for_label l ^ ": "
839 (if member (op =) qs Moreover then "moreover " else "") ^
840 (if member (op =) qs Ultimately then "ultimately " else "") ^
841 (if member (op =) qs Then then
842 if member (op =) qs Show then "thus" else "hence"
844 if member (op =) qs Show then "show" else "have")
845 val do_term = maybe_quote o fix_print_mode (Syntax.string_of_term ctxt)
846 val reconstr = Metis (type_enc, lam_trans)
847 fun do_facts (ls, ss) =
848 reconstructor_command reconstr 1 1
849 (ls |> sort_distinct (prod_ord string_ord int_ord),
850 ss |> sort_distinct string_ord)
851 and do_step ind (Fix xs) =
852 do_indent ind ^ "fix " ^ space_implode " and " (map do_free xs) ^ "\n"
853 | do_step ind (Let (t1, t2)) =
854 do_indent ind ^ "let " ^ do_term t1 ^ " = " ^ do_term t2 ^ "\n"
855 | do_step ind (Assume (l, t)) =
856 do_indent ind ^ "assume " ^ do_label l ^ do_term t ^ "\n"
857 | do_step ind (Prove (qs, l, t, By_Metis facts)) =
858 do_indent ind ^ do_have qs ^ " " ^
859 do_label l ^ do_term t ^ " " ^ do_facts facts ^ "\n"
860 | do_step ind (Prove (qs, l, t, Case_Split (proofs, facts))) =
861 implode (map (prefix (do_indent ind ^ "moreover\n") o do_block ind)
863 do_indent ind ^ do_have qs ^ " " ^ do_label l ^ do_term t ^ " " ^
864 do_facts facts ^ "\n"
865 and do_steps prefix suffix ind steps =
866 let val s = implode (map (do_step ind) steps) in
867 replicate_string (ind * indent_size - size prefix) " " ^ prefix ^
868 String.extract (s, ind * indent_size,
869 SOME (size s - ind * indent_size - 1)) ^
872 and do_block ind proof = do_steps "{ " " }" (ind + 1) proof
873 (* One-step proofs are pointless; better use the Metis one-liner
875 and do_proof [Prove (_, _, _, By_Metis _)] = ""
877 (if i <> 1 then "prefer " ^ string_of_int i ^ "\n" else "") ^
878 do_indent 0 ^ "proof -\n" ^ do_steps "" "" 1 proof ^ do_indent 0 ^
879 (if n <> 1 then "next" else "qed")
882 fun isar_proof_text ctxt isar_proof_requested
883 (debug, isar_shrink_factor, pool, fact_names, sym_tab, atp_proof, goal)
884 (one_line_params as (_, _, _, _, subgoal, subgoal_count)) =
886 val isar_shrink_factor =
887 (if isar_proof_requested then 1 else 2) * isar_shrink_factor
888 val (params, hyp_ts, concl_t) = strip_subgoal ctxt goal subgoal
889 val frees = fold Term.add_frees (concl_t :: hyp_ts) []
890 val one_line_proof = one_line_proof_text one_line_params
892 if is_typed_helper_used_in_atp_proof atp_proof then full_typesN
894 val lam_trans = lam_trans_from_atp_proof atp_proof metis_default_lam_trans
896 fun isar_proof_of () =
900 |> clean_up_atp_proof_dependencies
901 |> nasty_atp_proof pool
902 |> map_term_names_in_atp_proof repair_name
903 |> decode_lines ctxt sym_tab
904 |> rpair [] |-> fold_rev (add_line fact_names)
905 |> repair_waldmeister_endgame
906 |> rpair [] |-> fold_rev add_nontrivial_line
908 |-> fold_rev (add_desired_line isar_shrink_factor fact_names frees)
910 val conj_name = conjecture_prefix ^ string_of_int (length hyp_ts)
913 |> map_filter (fn Inference_Step (name as (_, ss), _, _, []) =>
914 if member (op =) ss conj_name then SOME name else NONE
916 fun dep_of_step (Definition_Step _) = NONE
917 | dep_of_step (Inference_Step (name, _, _, from)) = SOME (from, name)
918 val ref_graph = atp_proof |> map_filter dep_of_step |> make_ref_graph
919 val axioms = axioms_of_ref_graph ref_graph conjs
920 val tainted = tainted_atoms_of_ref_graph ref_graph conjs
923 |> fold (fn Definition_Step _ => I (* FIXME *)
924 | Inference_Step ((s, _), t, _, _) =>
925 Symtab.update_new (s,
926 t |> fold forall_of (map Var (Term.add_vars t []))
927 |> member (op = o apsnd fst) tainted s ? s_not))
929 fun prop_of_clause c =
930 fold (curry s_disj) (map_filter (Symtab.lookup props o fst) c)
932 fun label_of_clause [name] = raw_label_for_name name
933 | label_of_clause c = (space_implode "___" (map fst c), 0)
934 fun maybe_show outer c =
935 (outer andalso length c = 1 andalso subset (op =) (c, conjs))
937 fun do_have outer qs (gamma, c) =
938 Prove (maybe_show outer c qs, label_of_clause c, prop_of_clause c,
939 By_Metis (fold (add_fact_from_dependency fact_names
940 o the_single) gamma ([], [])))
941 fun do_inf outer (Have z) = do_have outer [] z
942 | do_inf outer (Hence z) = do_have outer [Then] z
943 | do_inf outer (Cases cases) =
944 let val c = succedent_of_cases cases in
945 Prove (maybe_show outer c [Ultimately], label_of_clause c,
947 Case_Split (map (do_case false) cases, ([], [])))
949 and do_case outer (c, infs) =
950 Assume (label_of_clause c, prop_of_clause c) ::
951 map (do_inf outer) infs
953 (if null params then [] else [Fix params]) @
955 |> redirect_graph axioms tainted
956 |> chain_direct_proof
958 |> kill_duplicate_assumptions_in_proof
959 |> kill_useless_labels_in_proof
961 |> string_for_proof ctxt type_enc lam_trans subgoal subgoal_count
965 if isar_proof_requested then
966 "\nNo structured proof available (proof too short)."
970 "\n\n" ^ (if isar_proof_requested then "Structured proof"
971 else "Perhaps this will work") ^
972 ":\n" ^ Markup.markup Isabelle_Markup.sendback isar_proof
977 else case try isar_proof_of () of
979 | NONE => if isar_proof_requested then
980 "\nWarning: The Isar proof construction failed."
983 in one_line_proof ^ isar_proof end
985 fun proof_text ctxt isar_proof isar_params
986 (one_line_params as (preplay, _, _, _, _, _)) =
987 (if case preplay of Failed_to_Play _ => true | _ => isar_proof then
988 isar_proof_text ctxt isar_proof isar_params
990 one_line_proof_text) one_line_params