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) formula = ('a, 'b, 'c) ATP_Problem.formula
13 type 'a proof = 'a ATP_Proof.proof
14 type locality = ATP_Problem_Generate.locality
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 * locality) list * minimize_command * int * int
29 bool * int * string Symtab.table * (string * locality) 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 * locality) list vector -> string proof
48 -> (string * locality) 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 * locality) 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) 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 * locality) list * minimize_command * int * int
98 bool * int * string Symtab.table * (string * locality) 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 = combinatorsN
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 ((_, 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 if is_axiom_used_in_proof is_combinator_def atp_proof then combinatorsN
179 else if is_axiom_used_in_proof is_lam_lifted atp_proof then lam_liftingN
182 val is_typed_helper_name =
183 String.isPrefix helper_prefix andf String.isSuffix typed_helper_suffix
184 fun is_typed_helper_used_in_atp_proof atp_proof =
185 is_axiom_used_in_proof is_typed_helper_name atp_proof
187 val leo2_ext = "extcnf_equal_neg"
188 val isa_ext = Thm.get_name_hint @{thm ext}
189 val isa_short_ext = Long_Name.base_name isa_ext
192 if Thm.eq_thm_prop (@{thm ext},
193 singleton (Attrib.eval_thms ctxt) (Facts.named isa_short_ext, [])) then
198 fun add_fact _ fact_names (Inference ((_, ss), _, _, [])) =
199 union (op =) (resolve_fact fact_names ss)
200 | add_fact ctxt _ (Inference (_, _, rule, _)) =
201 if rule = leo2_ext then insert (op =) (ext_name ctxt, General) else I
204 fun used_facts_in_atp_proof ctxt fact_names atp_proof =
205 if null atp_proof then Vector.foldl (uncurry (union (op =))) [] fact_names
206 else fold (add_fact ctxt fact_names) atp_proof []
208 (* (quasi-)underapproximation of the truth *)
209 fun is_locality_global Local = false
210 | is_locality_global Assum = false
211 | is_locality_global Chained = false
212 | is_locality_global _ = true
214 fun used_facts_in_unsound_atp_proof _ _ [] = NONE
215 | used_facts_in_unsound_atp_proof ctxt fact_names atp_proof =
217 val used_facts = used_facts_in_atp_proof ctxt fact_names atp_proof
219 if forall (is_locality_global o snd) used_facts andalso
220 not (is_axiom_used_in_proof (is_conjecture o single) atp_proof) then
221 SOME (map fst used_facts)
227 (** Soft-core proof reconstruction: one-liners **)
229 fun string_for_label (s, num) = s ^ string_of_int num
231 fun show_time NONE = ""
232 | show_time (SOME ext_time) = " (" ^ string_from_ext_time ext_time ^ ")"
234 fun apply_on_subgoal _ 1 = "by "
235 | apply_on_subgoal 1 _ = "apply "
236 | apply_on_subgoal i n =
237 "prefer " ^ string_of_int i ^ " " ^ apply_on_subgoal 1 n
238 fun command_call name [] =
239 name |> not (Lexicon.is_identifier name) ? enclose "(" ")"
240 | command_call name args = "(" ^ name ^ " " ^ space_implode " " args ^ ")"
241 fun try_command_line banner time command =
242 banner ^ ": " ^ Markup.markup Isabelle_Markup.sendback command ^ show_time time ^ "."
243 fun using_labels [] = ""
245 "using " ^ space_implode " " (map string_for_label ls) ^ " "
246 fun reconstructor_command reconstr i n (ls, ss) =
247 using_labels ls ^ apply_on_subgoal i n ^
248 command_call (string_for_reconstructor reconstr) ss
249 fun minimize_line _ [] = ""
250 | minimize_line minimize_command ss =
251 case minimize_command ss of
253 | command => "\nTo minimize: " ^ Markup.markup Isabelle_Markup.sendback command ^ "."
255 val split_used_facts =
256 List.partition (curry (op =) Chained o snd)
257 #> pairself (sort_distinct (string_ord o pairself fst))
259 fun one_line_proof_text (preplay, banner, used_facts, minimize_command,
260 subgoal, subgoal_count) =
262 val (chained, extra) = split_used_facts used_facts
263 val (failed, reconstr, ext_time) =
265 Played (reconstr, time) => (false, reconstr, (SOME (false, time)))
266 | Trust_Playable (reconstr, time) =>
271 if time = Time.zeroTime then NONE else SOME (true, time))
272 | Failed_to_Play reconstr => (true, reconstr, NONE)
275 |> reconstructor_command reconstr subgoal subgoal_count
276 |> (if failed then enclose "One-line proof reconstruction failed: " "."
277 else try_command_line banner ext_time)
278 in try_line ^ minimize_line minimize_command (map fst (extra @ chained)) end
280 (** Hard-core proof reconstruction: structured Isar proofs **)
282 fun forall_of v t = HOLogic.all_const (fastype_of v) $ lambda v t
283 fun exists_of v t = HOLogic.exists_const (fastype_of v) $ lambda v t
285 fun make_tvar s = TVar (("'" ^ s, 0), HOLogic.typeS)
286 fun make_tfree ctxt w =
287 let val ww = "'" ^ w in
288 TFree (ww, the_default HOLogic.typeS (Variable.def_sort ctxt (ww, ~1)))
292 val no_label = ("", ~1)
295 val assum_prefix = "a"
296 val have_prefix = "f"
298 fun raw_label_for_name (num, ss) =
299 case resolve_conjecture ss of
300 [j] => (conjecture_prefix, j)
301 | _ => case Int.fromString num of
302 SOME j => (raw_prefix, j)
303 | NONE => (raw_prefix ^ num, 0)
305 (**** INTERPRETATION OF TSTP SYNTAX TREES ****)
307 exception HO_TERM of (string, string) ho_term list
308 exception FORMULA of (string, string, (string, string) ho_term) formula list
309 exception SAME of unit
311 (* Type variables are given the basic sort "HOL.type". Some will later be
312 constrained by information from type literals, or by type inference. *)
313 fun typ_from_atp ctxt (u as ATerm (a, us)) =
314 let val Ts = map (typ_from_atp ctxt) us in
315 case unprefix_and_unascii type_const_prefix a of
316 SOME b => Type (invert_const b, Ts)
318 if not (null us) then
319 raise HO_TERM [u] (* only "tconst"s have type arguments *)
320 else case unprefix_and_unascii tfree_prefix a of
321 SOME b => make_tfree ctxt b
323 (* Could be an Isabelle variable or a variable from the ATP, say "X1"
324 or "_5018". Sometimes variables from the ATP are indistinguishable
325 from Isabelle variables, which forces us to use a type parameter in
327 (a |> perhaps (unprefix_and_unascii tvar_prefix), HOLogic.typeS)
328 |> Type_Infer.param 0
331 (* Type class literal applied to a type. Returns triple of polarity, class,
333 fun type_constraint_from_term ctxt (u as ATerm (a, us)) =
334 case (unprefix_and_unascii class_prefix a, map (typ_from_atp ctxt) us) of
335 (SOME b, [T]) => (b, T)
336 | _ => raise HO_TERM [u]
338 (* Accumulate type constraints in a formula: negative type literals. *)
339 fun add_var (key, z) = Vartab.map_default (key, []) (cons z)
340 fun add_type_constraint false (cl, TFree (a ,_)) = add_var ((a, ~1), cl)
341 | add_type_constraint false (cl, TVar (ix, _)) = add_var (ix, cl)
342 | add_type_constraint _ _ = I
344 fun repair_variable_name f s =
346 fun subscript_name s n = s ^ nat_subscript n
347 val s = String.map f s
349 case space_explode "_" s of
350 [_] => (case take_suffix Char.isDigit (String.explode s) of
351 (cs1 as _ :: _, cs2 as _ :: _) =>
352 subscript_name (String.implode cs1)
353 (the (Int.fromString (String.implode cs2)))
355 | [s1, s2] => (case Int.fromString s2 of
356 SOME n => subscript_name s1 n
361 (* The number of type arguments of a constant, zero if it's monomorphic. For
362 (instances of) Skolem pseudoconstants, this information is encoded in the
364 fun num_type_args thy s =
365 if String.isPrefix skolem_const_prefix s then
366 s |> space_explode Long_Name.separator |> List.last |> Int.fromString |> the
367 else if String.isPrefix lam_lifted_prefix s then
368 if String.isPrefix lam_lifted_poly_prefix s then 2 else 0
370 (s, Sign.the_const_type thy s) |> Sign.const_typargs thy |> length
372 fun slack_fastype_of t = fastype_of t handle TERM _ => HOLogic.typeT
374 (* First-order translation. No types are known for variables. "HOLogic.typeT"
375 should allow them to be inferred. *)
376 fun term_from_atp ctxt textual sym_tab =
378 val thy = Proof_Context.theory_of ctxt
379 (* For Metis, we use 1 rather than 0 because variable references in clauses
380 may otherwise conflict with variable constraints in the goal. At least,
381 type inference often fails otherwise. See also "axiom_inference" in
382 "Metis_Reconstruct". *)
383 val var_index = if textual then 0 else 1
384 fun do_term extra_ts opt_T u =
387 if String.isPrefix simple_type_prefix s then
388 @{const True} (* ignore TPTP type information *)
389 else if s = tptp_equal then
390 let val ts = map (do_term [] NONE) us in
391 if textual andalso length ts = 2 andalso
392 hd ts aconv List.last ts then
393 (* Vampire is keen on producing these. *)
396 list_comb (Const (@{const_name HOL.eq}, HOLogic.typeT), ts)
398 else case unprefix_and_unascii const_prefix s of
401 val ((s', s''), mangled_us) =
402 s' |> unmangled_const |>> `invert_const
404 if s' = type_tag_name then
405 case mangled_us @ us of
407 do_term extra_ts (SOME (typ_from_atp ctxt typ_u)) term_u
408 | _ => raise HO_TERM us
409 else if s' = predicator_name then
410 do_term [] (SOME @{typ bool}) (hd us)
411 else if s' = app_op_name then
412 let val extra_t = do_term [] NONE (List.last us) in
413 do_term (extra_t :: extra_ts)
415 SOME T => SOME (slack_fastype_of extra_t --> T)
417 (nth us (length us - 2))
419 else if s' = type_guard_name then
420 @{const True} (* ignore type predicates *)
423 val new_skolem = String.isPrefix new_skolem_const_prefix s''
425 length us - the_default 0 (Symtab.lookup sym_tab s)
426 val (type_us, term_us) =
427 chop num_ty_args us |>> append mangled_us
428 val term_ts = map (do_term [] NONE) term_us
430 (if not (null type_us) andalso
431 num_type_args thy s' = length type_us then
432 let val Ts = type_us |> map (typ_from_atp ctxt) in
434 SOME (Type_Infer.paramify_vars (tl Ts ---> hd Ts))
436 try (Sign.const_instance thy) (s', Ts)
443 | NONE => map slack_fastype_of term_ts --->
446 | NONE => HOLogic.typeT))
449 Var ((new_skolem_var_name_from_const s'', var_index), T)
451 Const (unproxify_const s', T)
452 in list_comb (t, term_ts @ extra_ts) end
454 | NONE => (* a free or schematic variable *)
456 val term_ts = map (do_term [] NONE) us
457 val ts = term_ts @ extra_ts
460 SOME T => map slack_fastype_of term_ts ---> T
461 | NONE => map slack_fastype_of ts ---> HOLogic.typeT
463 case unprefix_and_unascii fixed_var_prefix s of
464 SOME s => Free (s, T)
466 case unprefix_and_unascii schematic_var_prefix s of
467 SOME s => Var ((s, var_index), T)
469 Var ((s |> textual ? repair_variable_name Char.toLower,
471 in list_comb (t, ts) end
474 fun term_from_atom ctxt textual sym_tab pos (u as ATerm (s, _)) =
475 if String.isPrefix class_prefix s then
476 add_type_constraint pos (type_constraint_from_term ctxt u)
477 #> pair @{const True}
479 pair (term_from_atp ctxt textual sym_tab (SOME @{typ bool}) u)
481 val combinator_table =
482 [(@{const_name Meson.COMBI}, @{thm Meson.COMBI_def_raw}),
483 (@{const_name Meson.COMBK}, @{thm Meson.COMBK_def_raw}),
484 (@{const_name Meson.COMBB}, @{thm Meson.COMBB_def_raw}),
485 (@{const_name Meson.COMBC}, @{thm Meson.COMBC_def_raw}),
486 (@{const_name Meson.COMBS}, @{thm Meson.COMBS_def_raw})]
488 fun uncombine_term thy =
490 fun aux (t1 $ t2) = betapply (pairself aux (t1, t2))
491 | aux (Abs (s, T, t')) = Abs (s, T, aux t')
492 | aux (t as Const (x as (s, _))) =
493 (case AList.lookup (op =) combinator_table s of
494 SOME thm => thm |> prop_of |> specialize_type thy x
495 |> Logic.dest_equals |> snd
500 (* Update schematic type variables with detected sort constraints. It's not
501 totally clear whether this code is necessary. *)
502 fun repair_tvar_sorts (t, tvar_tab) =
504 fun do_type (Type (a, Ts)) = Type (a, map do_type Ts)
505 | do_type (TVar (xi, s)) =
506 TVar (xi, the_default s (Vartab.lookup tvar_tab xi))
507 | do_type (TFree z) = TFree z
508 fun do_term (Const (a, T)) = Const (a, do_type T)
509 | do_term (Free (a, T)) = Free (a, do_type T)
510 | do_term (Var (xi, T)) = Var (xi, do_type T)
511 | do_term (t as Bound _) = t
512 | do_term (Abs (a, T, t)) = Abs (a, do_type T, do_term t)
513 | do_term (t1 $ t2) = do_term t1 $ do_term t2
514 in t |> not (Vartab.is_empty tvar_tab) ? do_term end
516 fun quantify_over_var quant_of var_s t =
518 val vars = [] |> Term.add_vars t |> filter (fn ((s, _), _) => s = var_s)
520 in fold_rev quant_of vars t end
522 (* Interpret an ATP formula as a HOL term, extracting sort constraints as they
523 appear in the formula. *)
524 fun prop_from_atp ctxt textual sym_tab phi =
526 fun do_formula pos phi =
528 AQuant (_, [], phi) => do_formula pos phi
529 | AQuant (q, (s, _) :: xs, phi') =>
530 do_formula pos (AQuant (q, xs, phi'))
532 #>> quantify_over_var (case q of
534 | AExists => exists_of)
535 (s |> textual ? repair_variable_name Char.toLower)
536 | AConn (ANot, [phi']) => do_formula (not pos) phi' #>> s_not
537 | AConn (c, [phi1, phi2]) =>
538 do_formula (pos |> c = AImplies ? not) phi1
539 ##>> do_formula pos phi2
545 | ANot => raise Fail "impossible connective")
546 | AAtom tm => term_from_atom ctxt textual sym_tab pos tm
547 | _ => raise FORMULA [phi]
548 in repair_tvar_sorts (do_formula true phi Vartab.empty) end
550 fun infer_formula_types ctxt =
551 Type.constraint HOLogic.boolT
553 (Proof_Context.set_mode Proof_Context.mode_schematic ctxt)
555 fun uncombined_etc_prop_from_atp ctxt textual sym_tab =
556 let val thy = Proof_Context.theory_of ctxt in
557 prop_from_atp ctxt textual sym_tab
558 #> textual ? uncombine_term thy #> infer_formula_types ctxt
561 (**** Translation of TSTP files to Isar proofs ****)
563 fun unvarify_term (Var ((s, 0), T)) = Free (s, T)
564 | unvarify_term t = raise TERM ("unvarify_term: non-Var", [t])
566 fun decode_line sym_tab (Definition (name, phi1, phi2)) ctxt =
568 val thy = Proof_Context.theory_of ctxt
569 val t1 = prop_from_atp ctxt true sym_tab phi1
570 val vars = snd (strip_comb t1)
571 val frees = map unvarify_term vars
572 val unvarify_args = subst_atomic (vars ~~ frees)
573 val t2 = prop_from_atp ctxt true sym_tab phi2
575 HOLogic.eq_const HOLogic.typeT $ t1 $ t2
576 |> unvarify_args |> uncombine_term thy |> infer_formula_types ctxt
579 (Definition (name, t1, t2),
580 fold Variable.declare_term (maps Misc_Legacy.term_frees [t1, t2]) ctxt)
582 | decode_line sym_tab (Inference (name, u, rule, deps)) ctxt =
583 let val t = u |> uncombined_etc_prop_from_atp ctxt true sym_tab in
584 (Inference (name, t, rule, deps),
585 fold Variable.declare_term (Misc_Legacy.term_frees t) ctxt)
587 fun decode_lines ctxt sym_tab lines =
588 fst (fold_map (decode_line sym_tab) lines ctxt)
590 fun is_same_inference _ (Definition _) = false
591 | is_same_inference t (Inference (_, t', _, _)) = t aconv t'
593 (* No "real" literals means only type information (tfree_tcs, clsrel, or
595 val is_only_type_information = curry (op aconv) @{term True}
597 fun replace_one_dependency (old, new) dep =
598 if is_same_atp_step dep old then new else [dep]
599 fun replace_dependencies_in_line _ (line as Definition _) = line
600 | replace_dependencies_in_line p (Inference (name, t, rule, deps)) =
601 Inference (name, t, rule,
602 fold (union (op =) o replace_one_dependency p) deps [])
604 (* Discard facts; consolidate adjacent lines that prove the same formula, since
605 they differ only in type information.*)
606 fun add_line _ (line as Definition _) lines = line :: lines
607 | add_line fact_names (Inference (name as (_, ss), t, rule, [])) lines =
608 (* No dependencies: fact, conjecture, or (for Vampire) internal facts or
610 if is_fact fact_names ss then
611 (* Facts are not proof lines. *)
612 if is_only_type_information t then
613 map (replace_dependencies_in_line (name, [])) lines
614 (* Is there a repetition? If so, replace later line by earlier one. *)
615 else case take_prefix (not o is_same_inference t) lines of
616 (_, []) => lines (* no repetition of proof line *)
617 | (pre, Inference (name', _, _, _) :: post) =>
618 pre @ map (replace_dependencies_in_line (name', [name])) post
619 | _ => raise Fail "unexpected inference"
620 else if is_conjecture ss then
621 Inference (name, s_not t, rule, []) :: lines
623 map (replace_dependencies_in_line (name, [])) lines
624 | add_line _ (Inference (name, t, rule, deps)) lines =
625 (* Type information will be deleted later; skip repetition test. *)
626 if is_only_type_information t then
627 Inference (name, t, rule, deps) :: lines
628 (* Is there a repetition? If so, replace later line by earlier one. *)
629 else case take_prefix (not o is_same_inference t) lines of
630 (* FIXME: Doesn't this code risk conflating proofs involving different
632 (_, []) => Inference (name, t, rule, deps) :: lines
633 | (pre, Inference (name', t', rule, _) :: post) =>
634 Inference (name, t', rule, deps) ::
635 pre @ map (replace_dependencies_in_line (name', [name])) post
636 | _ => raise Fail "unexpected inference"
638 (* Recursively delete empty lines (type information) from the proof. *)
639 fun add_nontrivial_line (line as Inference (name, t, _, [])) lines =
640 if is_only_type_information t then delete_dependency name lines
642 | add_nontrivial_line line lines = line :: lines
643 and delete_dependency name lines =
644 fold_rev add_nontrivial_line
645 (map (replace_dependencies_in_line (name, [])) lines) []
647 (* ATPs sometimes reuse free variable names in the strangest ways. Removing
648 offending lines often does the trick. *)
649 fun is_bad_free frees (Free x) = not (member (op =) frees x)
650 | is_bad_free _ _ = false
652 fun add_desired_line _ _ _ (line as Definition (name, _, _)) (j, lines) =
653 (j, line :: map (replace_dependencies_in_line (name, [])) lines)
654 | add_desired_line isar_shrink_factor fact_names frees
655 (Inference (name as (_, ss), t, rule, deps)) (j, lines) =
657 if is_fact fact_names ss orelse
658 is_conjecture ss orelse
659 (* the last line must be kept *)
661 (not (is_only_type_information t) andalso
662 null (Term.add_tvars t []) andalso
663 not (exists_subterm (is_bad_free frees) t) andalso
664 length deps >= 2 andalso j mod isar_shrink_factor = 0 andalso
665 (* kill next to last line, which usually results in a trivial step *)
667 Inference (name, t, rule, deps) :: lines (* keep line *)
669 map (replace_dependencies_in_line (name, deps)) lines) (* drop line *)
671 (** Isar proof construction and manipulation **)
673 type label = string * int
674 type facts = label list * string list
676 datatype isar_qualifier = Show | Then | Moreover | Ultimately
679 Fix of (string * typ) list |
681 Assume of label * term |
682 Prove of isar_qualifier list * label * term * byline
685 Case_Split of isar_step list list * facts
687 fun add_fact_from_dependency fact_names (name as (_, ss)) =
688 if is_fact fact_names ss then
689 apsnd (union (op =) (map fst (resolve_fact fact_names ss)))
691 apfst (insert (op =) (raw_label_for_name name))
693 fun repair_name "$true" = "c_True"
694 | repair_name "$false" = "c_False"
695 | repair_name "$$e" = tptp_equal (* seen in Vampire proofs *)
697 if is_tptp_equal s orelse
698 (* seen in Vampire proofs *)
699 (String.isPrefix "sQ" s andalso String.isSuffix "_eqProxy" s) then
704 (* FIXME: Still needed? Try with SPASS proofs perhaps. *)
705 val kill_duplicate_assumptions_in_proof =
707 fun relabel_facts subst =
708 apfst (map (fn l => AList.lookup (op =) subst l |> the_default l))
709 fun do_step (step as Assume (l, t)) (proof, subst, assums) =
710 (case AList.lookup (op aconv) assums t of
711 SOME l' => (proof, (l, l') :: subst, assums)
712 | NONE => (step :: proof, subst, (t, l) :: assums))
713 | do_step (Prove (qs, l, t, by)) (proof, subst, assums) =
716 By_Metis facts => By_Metis (relabel_facts subst facts)
717 | Case_Split (proofs, facts) =>
718 Case_Split (map do_proof proofs,
719 relabel_facts subst facts)) ::
720 proof, subst, assums)
721 | do_step step (proof, subst, assums) = (step :: proof, subst, assums)
722 and do_proof proof = fold do_step proof ([], [], []) |> #1 |> rev
725 fun used_labels_of_step (Prove (_, _, _, by)) =
727 By_Metis (ls, _) => ls
728 | Case_Split (proofs, (ls, _)) =>
729 fold (union (op =) o used_labels_of) proofs ls)
730 | used_labels_of_step _ = []
731 and used_labels_of proof = fold (union (op =) o used_labels_of_step) proof []
733 fun kill_useless_labels_in_proof proof =
735 val used_ls = used_labels_of proof
736 fun do_label l = if member (op =) used_ls l then l else no_label
737 fun do_step (Assume (l, t)) = Assume (do_label l, t)
738 | do_step (Prove (qs, l, t, by)) =
739 Prove (qs, do_label l, t,
741 Case_Split (proofs, facts) =>
742 Case_Split (map (map do_step) proofs, facts)
744 | do_step step = step
745 in map do_step proof end
747 fun prefix_for_depth n = replicate_string (n + 1)
751 fun aux _ _ _ [] = []
752 | aux subst depth (next_assum, next_fact) (Assume (l, t) :: proof) =
754 Assume (l, t) :: aux subst depth (next_assum, next_fact) proof
756 let val l' = (prefix_for_depth depth assum_prefix, next_assum) in
758 aux ((l, l') :: subst) depth (next_assum + 1, next_fact) proof
760 | aux subst depth (next_assum, next_fact)
761 (Prove (qs, l, t, by) :: proof) =
763 val (l', subst, next_fact) =
765 (l, subst, next_fact)
768 val l' = (prefix_for_depth depth have_prefix, next_fact)
769 in (l', (l, l') :: subst, next_fact + 1) end
771 apfst (maps (the_list o AList.lookup (op =) subst))
774 By_Metis facts => By_Metis (relabel_facts facts)
775 | Case_Split (proofs, facts) =>
776 Case_Split (map (aux subst (depth + 1) (1, 1)) proofs,
779 Prove (qs, l', t, by) :: aux subst depth (next_assum, next_fact) proof
781 | aux subst depth nextp (step :: proof) =
782 step :: aux subst depth nextp proof
783 in aux [] 0 (1, 1) end
785 fun string_for_proof ctxt0 type_enc lam_trans i n =
788 ctxt0 |> Config.put show_free_types false
789 |> Config.put show_types true
790 |> Config.put show_sorts true
791 fun fix_print_mode f x =
792 Print_Mode.setmp (filter (curry (op =) Symbol.xsymbolsN)
793 (print_mode_value ())) f x
794 fun do_indent ind = replicate_string (ind * indent_size) " "
796 maybe_quote s ^ " :: " ^
797 maybe_quote (fix_print_mode (Syntax.string_of_typ ctxt) T)
798 fun do_label l = if l = no_label then "" else string_for_label l ^ ": "
800 (if member (op =) qs Moreover then "moreover " else "") ^
801 (if member (op =) qs Ultimately then "ultimately " else "") ^
802 (if member (op =) qs Then then
803 if member (op =) qs Show then "thus" else "hence"
805 if member (op =) qs Show then "show" else "have")
806 val do_term = maybe_quote o fix_print_mode (Syntax.string_of_term ctxt)
807 val reconstr = Metis (type_enc, lam_trans)
808 fun do_facts (ls, ss) =
809 reconstructor_command reconstr 1 1
810 (ls |> sort_distinct (prod_ord string_ord int_ord),
811 ss |> sort_distinct string_ord)
812 and do_step ind (Fix xs) =
813 do_indent ind ^ "fix " ^ space_implode " and " (map do_free xs) ^ "\n"
814 | do_step ind (Let (t1, t2)) =
815 do_indent ind ^ "let " ^ do_term t1 ^ " = " ^ do_term t2 ^ "\n"
816 | do_step ind (Assume (l, t)) =
817 do_indent ind ^ "assume " ^ do_label l ^ do_term t ^ "\n"
818 | do_step ind (Prove (qs, l, t, By_Metis facts)) =
819 do_indent ind ^ do_have qs ^ " " ^
820 do_label l ^ do_term t ^ " " ^ do_facts facts ^ "\n"
821 | do_step ind (Prove (qs, l, t, Case_Split (proofs, facts))) =
822 implode (map (prefix (do_indent ind ^ "moreover\n") o do_block ind)
824 do_indent ind ^ do_have qs ^ " " ^ do_label l ^ do_term t ^ " " ^
825 do_facts facts ^ "\n"
826 and do_steps prefix suffix ind steps =
827 let val s = implode (map (do_step ind) steps) in
828 replicate_string (ind * indent_size - size prefix) " " ^ prefix ^
829 String.extract (s, ind * indent_size,
830 SOME (size s - ind * indent_size - 1)) ^
833 and do_block ind proof = do_steps "{ " " }" (ind + 1) proof
834 (* One-step proofs are pointless; better use the Metis one-liner
836 and do_proof [Prove (_, _, _, By_Metis _)] = ""
838 (if i <> 1 then "prefer " ^ string_of_int i ^ "\n" else "") ^
839 do_indent 0 ^ "proof -\n" ^ do_steps "" "" 1 proof ^ do_indent 0 ^
840 (if n <> 1 then "next" else "qed")
843 fun isar_proof_text ctxt isar_proof_requested
844 (debug, isar_shrink_factor, pool, fact_names, sym_tab, atp_proof, goal)
845 (one_line_params as (_, _, _, _, subgoal, subgoal_count)) =
847 val isar_shrink_factor =
848 (if isar_proof_requested then 1 else 2) * isar_shrink_factor
849 val (params, hyp_ts, concl_t) = strip_subgoal ctxt goal subgoal
850 val frees = fold Term.add_frees (concl_t :: hyp_ts) []
851 val one_line_proof = one_line_proof_text one_line_params
853 if is_typed_helper_used_in_atp_proof atp_proof then full_typesN
855 val lam_trans = lam_trans_from_atp_proof atp_proof metis_default_lam_trans
857 fun isar_proof_of () =
861 |> clean_up_atp_proof_dependencies
862 |> nasty_atp_proof pool
863 |> map_term_names_in_atp_proof repair_name
864 |> decode_lines ctxt sym_tab
865 |> rpair [] |-> fold_rev (add_line fact_names)
866 |> rpair [] |-> fold_rev add_nontrivial_line
868 |-> fold_rev (add_desired_line isar_shrink_factor fact_names frees)
870 val conj_name = conjecture_prefix ^ string_of_int (length hyp_ts)
873 |> map_filter (fn Inference (name as (_, ss), _, _, []) =>
874 if member (op =) ss conj_name then SOME name else NONE
876 fun dep_of_step (Definition _) = NONE
877 | dep_of_step (Inference (name, _, _, from)) = SOME (from, name)
878 val ref_graph = atp_proof |> map_filter dep_of_step |> make_ref_graph
879 val axioms = axioms_of_ref_graph ref_graph conjs
880 val tainted = tainted_atoms_of_ref_graph ref_graph conjs
883 |> fold (fn Definition _ => I (* FIXME *)
884 | Inference ((s, _), t, _, _) =>
885 Symtab.update_new (s,
886 t |> member (op = o apsnd fst) tainted s ? s_not))
888 (* FIXME: add "fold_rev forall_of (map Var (Term.add_vars t []))"? *)
889 fun prop_of_clause c =
890 fold (curry s_disj) (map_filter (Symtab.lookup props o fst) c)
892 fun label_of_clause c = (space_implode "___" (map fst c), 0)
893 fun maybe_show outer c =
894 (outer andalso length c = 1 andalso subset (op =) (c, conjs))
896 fun do_have outer qs (gamma, c) =
897 Prove (maybe_show outer c qs, label_of_clause c, prop_of_clause c,
898 By_Metis (fold (add_fact_from_dependency fact_names
899 o the_single) gamma ([], [])))
900 fun do_inf outer (Have z) = do_have outer [] z
901 | do_inf outer (Hence z) = do_have outer [Then] z
902 | do_inf outer (Cases cases) =
903 let val c = succedent_of_cases cases in
904 Prove (maybe_show outer c [Ultimately], label_of_clause c,
906 Case_Split (map (do_case false) cases, ([], [])))
908 and do_case outer (c, infs) =
909 Assume (label_of_clause c, prop_of_clause c) ::
910 map (do_inf outer) infs
912 (if null params then [] else [Fix params]) @
914 |> redirect_graph axioms tainted
915 |> chain_direct_proof
917 |> kill_duplicate_assumptions_in_proof
918 |> kill_useless_labels_in_proof
920 |> string_for_proof ctxt type_enc lam_trans subgoal subgoal_count
924 if isar_proof_requested then
925 "\nNo structured proof available (proof too short)."
929 "\n\n" ^ (if isar_proof_requested then "Structured proof"
930 else "Perhaps this will work") ^
931 ":\n" ^ Markup.markup Isabelle_Markup.sendback isar_proof
936 else case try isar_proof_of () of
938 | NONE => if isar_proof_requested then
939 "\nWarning: The Isar proof construction failed."
942 in one_line_proof ^ isar_proof end
944 fun proof_text ctxt isar_proof isar_params
945 (one_line_params as (preplay, _, _, _, _, _)) =
946 (if case preplay of Failed_to_Play _ => true | _ => isar_proof then
947 isar_proof_text ctxt isar_proof isar_params
949 one_line_proof_text) one_line_params