src/HOL/Tools/Sledgehammer/sledgehammer_reconstruct.ML
author blanchet
Tue Sep 14 17:36:27 2010 +0200 (2010-09-14)
changeset 39368 f661064b2b80
parent 39353 7f11d833d65b
child 39370 f8292d3020db
permissions -rw-r--r--
generalize proof reconstruction code;
first step towards support for nonnumeric formula names, needed for E 1.2
blanchet@38988
     1
(*  Title:      HOL/Tools/Sledgehammer/sledgehammer_reconstruct.ML
blanchet@38027
     2
    Author:     Lawrence C. Paulson, Cambridge University Computer Laboratory
blanchet@38027
     3
    Author:     Claire Quigley, Cambridge University Computer Laboratory
blanchet@36392
     4
    Author:     Jasmin Blanchette, TU Muenchen
paulson@21978
     5
wenzelm@33310
     6
Transfer of proofs from external provers.
wenzelm@33310
     7
*)
wenzelm@33310
     8
blanchet@38988
     9
signature SLEDGEHAMMER_RECONSTRUCT =
paulson@24425
    10
sig
blanchet@38988
    11
  type locality = Sledgehammer_Filter.locality
blanchet@36281
    12
  type minimize_command = string list -> string
blanchet@38818
    13
  type metis_params =
blanchet@39327
    14
    string * bool * minimize_command * string * (string * locality) list vector
blanchet@39327
    15
    * thm * int
blanchet@38818
    16
  type isar_params =
blanchet@38040
    17
    string Symtab.table * bool * int * Proof.context * int list list
blanchet@38818
    18
  type text_result = string * (string * locality) list
blanchet@38818
    19
blanchet@38818
    20
  val metis_proof_text : metis_params -> text_result
blanchet@38818
    21
  val isar_proof_text : isar_params -> metis_params -> text_result
blanchet@38818
    22
  val proof_text : bool -> isar_params -> metis_params -> text_result
paulson@24425
    23
end;
paulson@21978
    24
blanchet@38988
    25
structure Sledgehammer_Reconstruct : SLEDGEHAMMER_RECONSTRUCT =
paulson@21978
    26
struct
paulson@21978
    27
blanchet@38028
    28
open ATP_Problem
blanchet@37578
    29
open Metis_Clauses
blanchet@36478
    30
open Sledgehammer_Util
blanchet@38988
    31
open Sledgehammer_Filter
blanchet@38282
    32
open Sledgehammer_Translate
paulson@21978
    33
blanchet@36281
    34
type minimize_command = string list -> string
blanchet@38818
    35
type metis_params =
blanchet@39327
    36
  string * bool * minimize_command * string * (string * locality) list vector
blanchet@39327
    37
  * thm * int
blanchet@38818
    38
type isar_params =
blanchet@38818
    39
  string Symtab.table * bool * int * Proof.context * int list list
blanchet@38818
    40
type text_result = string * (string * locality) list
blanchet@36281
    41
blanchet@38014
    42
(* Simple simplifications to ensure that sort annotations don't leave a trail of
blanchet@38014
    43
   spurious "True"s. *)
blanchet@38014
    44
fun s_not @{const False} = @{const True}
blanchet@38014
    45
  | s_not @{const True} = @{const False}
blanchet@38014
    46
  | s_not (@{const Not} $ t) = t
blanchet@38014
    47
  | s_not t = @{const Not} $ t
blanchet@38014
    48
fun s_conj (@{const True}, t2) = t2
blanchet@38014
    49
  | s_conj (t1, @{const True}) = t1
blanchet@38014
    50
  | s_conj p = HOLogic.mk_conj p
blanchet@38014
    51
fun s_disj (@{const False}, t2) = t2
blanchet@38014
    52
  | s_disj (t1, @{const False}) = t1
blanchet@38014
    53
  | s_disj p = HOLogic.mk_disj p
blanchet@38014
    54
fun s_imp (@{const True}, t2) = t2
blanchet@38014
    55
  | s_imp (t1, @{const False}) = s_not t1
blanchet@38014
    56
  | s_imp p = HOLogic.mk_imp p
blanchet@38014
    57
fun s_iff (@{const True}, t2) = t2
blanchet@38014
    58
  | s_iff (t1, @{const True}) = t1
blanchet@38014
    59
  | s_iff (t1, t2) = HOLogic.eq_const HOLogic.boolT $ t1 $ t2
blanchet@38014
    60
blanchet@38014
    61
fun mk_anot (AConn (ANot, [phi])) = phi
blanchet@38014
    62
  | mk_anot phi = AConn (ANot, [phi])
blanchet@37991
    63
fun mk_aconn c (phi1, phi2) = AConn (c, [phi1, phi2])
blanchet@37991
    64
blanchet@39368
    65
datatype tstp_name = Str of string | Num of int
blanchet@39368
    66
blanchet@39368
    67
fun tstp_name_ord (Str s, Str t) = string_ord (s, t)
blanchet@39368
    68
  | tstp_name_ord (Str _, Num _) = LESS
blanchet@39368
    69
  | tstp_name_ord (Num i, Num j) = int_ord (i, j)
blanchet@39368
    70
  | tstp_name_ord (Num _, Str _) = GREATER
blanchet@39368
    71
blanchet@38066
    72
fun index_in_shape x = find_index (exists (curry (op =) x))
blanchet@39368
    73
fun resolve_axiom axiom_names (Str str) =
blanchet@39368
    74
    (case find_first_in_list_vector axiom_names str of
blanchet@39368
    75
       SOME x => [(str, x)]
blanchet@39368
    76
     | NONE => [])
blanchet@39368
    77
  | resolve_axiom axiom_names (Num num) =
blanchet@39368
    78
    if num > 0 andalso num <= Vector.length axiom_names then
blanchet@39368
    79
      Vector.sub (axiom_names, num - 1)
blanchet@39368
    80
    else
blanchet@39368
    81
      []
blanchet@39368
    82
val is_axiom_name = not o null oo resolve_axiom
blanchet@39368
    83
fun is_conjecture_name _ (Str str) = String.isPrefix conjecture_prefix str
blanchet@39368
    84
  | is_conjecture_name conjecture_shape (Num num) =
blanchet@39368
    85
    index_in_shape num conjecture_shape >= 0
blanchet@36291
    86
blanchet@37991
    87
fun negate_term (Const (@{const_name All}, T) $ Abs (s, T', t')) =
blanchet@37991
    88
    Const (@{const_name Ex}, T) $ Abs (s, T', negate_term t')
blanchet@37991
    89
  | negate_term (Const (@{const_name Ex}, T) $ Abs (s, T', t')) =
blanchet@37991
    90
    Const (@{const_name All}, T) $ Abs (s, T', negate_term t')
haftmann@38786
    91
  | negate_term (@{const HOL.implies} $ t1 $ t2) =
haftmann@38795
    92
    @{const HOL.conj} $ t1 $ negate_term t2
haftmann@38795
    93
  | negate_term (@{const HOL.conj} $ t1 $ t2) =
haftmann@38795
    94
    @{const HOL.disj} $ negate_term t1 $ negate_term t2
haftmann@38795
    95
  | negate_term (@{const HOL.disj} $ t1 $ t2) =
haftmann@38795
    96
    @{const HOL.conj} $ negate_term t1 $ negate_term t2
blanchet@37991
    97
  | negate_term (@{const Not} $ t) = t
blanchet@37991
    98
  | negate_term t = @{const Not} $ t
blanchet@37991
    99
blanchet@39368
   100
datatype ('a, 'b, 'c) raw_step =
blanchet@39368
   101
  Definition of tstp_name * 'a * 'b |
blanchet@39368
   102
  Inference of tstp_name * 'c * tstp_name list
blanchet@36491
   103
blanchet@39368
   104
fun raw_step_name (Definition (name, _, _)) = name
blanchet@39368
   105
  | raw_step_name (Inference (name, _, _)) = name
paulson@21978
   106
blanchet@38035
   107
(**** PARSING OF TSTP FORMAT ****)
paulson@21978
   108
paulson@21978
   109
(*Strings enclosed in single quotes, e.g. filenames*)
blanchet@37991
   110
val scan_quoted = $$ "'" |-- Scan.repeat (~$$ "'") --| $$ "'" >> implode;
paulson@21978
   111
blanchet@37991
   112
val scan_dollar_name =
blanchet@36548
   113
  Scan.repeat ($$ "$") -- Symbol.scan_id >> (fn (ss, s) => implode ss ^ s)
blanchet@36548
   114
blanchet@36548
   115
fun repair_name _ "$true" = "c_True"
blanchet@36548
   116
  | repair_name _ "$false" = "c_False"
blanchet@38007
   117
  | repair_name _ "$$e" = "c_equal" (* seen in Vampire proofs *)
blanchet@38035
   118
  | repair_name _ "equal" = "c_equal" (* needed by SPASS? *)
blanchet@38035
   119
  | repair_name pool s =
blanchet@38035
   120
    case Symtab.lookup pool s of
blanchet@38035
   121
      SOME s' => s'
blanchet@38035
   122
    | NONE =>
blanchet@38035
   123
      if String.isPrefix "sQ" s andalso String.isSuffix "_eqProxy" s then
blanchet@38035
   124
        "c_equal" (* seen in Vampire proofs *)
blanchet@38035
   125
      else
blanchet@38035
   126
        s
blanchet@36392
   127
(* Generalized first-order terms, which include file names, numbers, etc. *)
blanchet@38035
   128
val parse_potential_integer =
blanchet@38035
   129
  (scan_dollar_name || scan_quoted) >> K NONE
blanchet@38035
   130
  || scan_integer >> SOME
blanchet@38035
   131
fun parse_annotation x =
blanchet@38035
   132
  ((parse_potential_integer ::: Scan.repeat ($$ " " |-- parse_potential_integer)
blanchet@38036
   133
    >> map_filter I) -- Scan.optional parse_annotation []
blanchet@38035
   134
     >> uncurry (union (op =))
blanchet@38035
   135
   || $$ "(" |-- parse_annotations --| $$ ")"
blanchet@38035
   136
   || $$ "[" |-- parse_annotations --| $$ "]") x
blanchet@38035
   137
and parse_annotations x =
blanchet@38036
   138
  (Scan.optional (parse_annotation
blanchet@38036
   139
                  ::: Scan.repeat ($$ "," |-- parse_annotation)) []
blanchet@38035
   140
   >> (fn numss => fold (union (op =)) numss [])) x
blanchet@38035
   141
blanchet@38035
   142
(* Vampire proof lines sometimes contain needless information such as "(0:3)",
blanchet@38035
   143
   which can be hard to disambiguate from function application in an LL(1)
blanchet@38035
   144
   parser. As a workaround, we extend the TPTP term syntax with such detritus
blanchet@38035
   145
   and ignore it. *)
blanchet@38066
   146
fun parse_vampire_detritus x =
blanchet@38066
   147
  (scan_integer |-- $$ ":" --| scan_integer >> K []) x
blanchet@38035
   148
blanchet@36393
   149
fun parse_term pool x =
blanchet@37991
   150
  ((scan_dollar_name >> repair_name pool)
blanchet@38035
   151
    -- Scan.optional ($$ "(" |-- (parse_vampire_detritus || parse_terms pool)
blanchet@38035
   152
                      --| $$ ")") []
blanchet@38035
   153
    --| Scan.optional ($$ "(" |-- parse_vampire_detritus --| $$ ")") []
blanchet@38035
   154
   >> ATerm) x
blanchet@36393
   155
and parse_terms pool x =
blanchet@36393
   156
  (parse_term pool ::: Scan.repeat ($$ "," |-- parse_term pool)) x
paulson@21978
   157
blanchet@38034
   158
fun parse_atom pool =
blanchet@36393
   159
  parse_term pool -- Scan.option (Scan.option ($$ "!") --| $$ "="
blanchet@36393
   160
                                  -- parse_term pool)
blanchet@38035
   161
  >> (fn (u1, NONE) => AAtom u1
blanchet@38034
   162
       | (u1, SOME (NONE, u2)) => AAtom (ATerm ("c_equal", [u1, u2]))
blanchet@37991
   163
       | (u1, SOME (SOME _, u2)) =>
blanchet@38034
   164
         mk_anot (AAtom (ATerm ("c_equal", [u1, u2]))))
blanchet@37991
   165
blanchet@37991
   166
fun fo_term_head (ATerm (s, _)) = s
blanchet@36291
   167
blanchet@37991
   168
(* TPTP formulas are fully parenthesized, so we don't need to worry about
blanchet@37991
   169
   operator precedence. *)
blanchet@37991
   170
fun parse_formula pool x =
blanchet@37991
   171
  (($$ "(" |-- parse_formula pool --| $$ ")"
blanchet@37991
   172
    || ($$ "!" >> K AForall || $$ "?" >> K AExists)
blanchet@37991
   173
       --| $$ "[" -- parse_terms pool --| $$ "]" --| $$ ":"
blanchet@37991
   174
       -- parse_formula pool
blanchet@37991
   175
       >> (fn ((q, ts), phi) => AQuant (q, map fo_term_head ts, phi))
blanchet@37991
   176
    || $$ "~" |-- parse_formula pool >> mk_anot
blanchet@38034
   177
    || parse_atom pool)
blanchet@37991
   178
   -- Scan.option ((Scan.this_string "=>" >> K AImplies
blanchet@37991
   179
                    || Scan.this_string "<=>" >> K AIff
blanchet@37991
   180
                    || Scan.this_string "<~>" >> K ANotIff
blanchet@37991
   181
                    || Scan.this_string "<=" >> K AIf
blanchet@37991
   182
                    || $$ "|" >> K AOr || $$ "&" >> K AAnd)
blanchet@37991
   183
                   -- parse_formula pool)
blanchet@37991
   184
   >> (fn (phi1, NONE) => phi1
blanchet@37991
   185
        | (phi1, SOME (c, phi2)) => mk_aconn c (phi1, phi2))) x
blanchet@37991
   186
blanchet@38035
   187
val parse_tstp_extra_arguments =
blanchet@38035
   188
  Scan.optional ($$ "," |-- parse_annotation
blanchet@38035
   189
                 --| Scan.option ($$ "," |-- parse_annotations)) []
blanchet@36486
   190
blanchet@38035
   191
(* Syntax: (fof|cnf)\(<num>, <formula_role>, <formula> <extra_arguments>\).
blanchet@36486
   192
   The <num> could be an identifier, but we assume integers. *)
blanchet@37991
   193
 fun parse_tstp_line pool =
blanchet@37991
   194
   ((Scan.this_string "fof" || Scan.this_string "cnf") -- $$ "(")
blanchet@37991
   195
     |-- scan_integer --| $$ "," -- Symbol.scan_id --| $$ ","
blanchet@38035
   196
     -- parse_formula pool -- parse_tstp_extra_arguments --| $$ ")" --| $$ "."
blanchet@37991
   197
    >> (fn (((num, role), phi), deps) =>
blanchet@37991
   198
           case role of
blanchet@37991
   199
             "definition" =>
blanchet@37991
   200
             (case phi of
blanchet@38034
   201
                AConn (AIff, [phi1 as AAtom _, phi2]) =>
blanchet@39368
   202
                Definition (Num num, phi1, phi2)
blanchet@38036
   203
              | AAtom (ATerm ("c_equal", _)) =>
blanchet@39368
   204
                (* Vampire's equality proxy axiom *)
blanchet@39368
   205
                Inference (Num num, phi, map Num deps)
blanchet@37991
   206
              | _ => raise Fail "malformed definition")
blanchet@39368
   207
           | _ => Inference (Num num, phi, map Num deps))
blanchet@36291
   208
blanchet@38035
   209
(**** PARSING OF VAMPIRE OUTPUT ****)
blanchet@38035
   210
blanchet@38035
   211
(* Syntax: <num>. <formula> <annotation> *)
blanchet@38035
   212
fun parse_vampire_line pool =
blanchet@38035
   213
  scan_integer --| $$ "." -- parse_formula pool -- parse_annotation
blanchet@39368
   214
  >> (fn ((num, phi), deps) => Inference (Num num, phi, map Num deps))
blanchet@38035
   215
blanchet@36291
   216
(**** PARSING OF SPASS OUTPUT ****)
blanchet@36291
   217
blanchet@36392
   218
(* SPASS returns clause references of the form "x.y". We ignore "y", whose role
blanchet@36392
   219
   is not clear anyway. *)
blanchet@37962
   220
val parse_dot_name = scan_integer --| $$ "." --| scan_integer
paulson@21978
   221
blanchet@36392
   222
val parse_spass_annotations =
blanchet@36392
   223
  Scan.optional ($$ ":" |-- Scan.repeat (parse_dot_name
blanchet@36392
   224
                                         --| Scan.option ($$ ","))) []
blanchet@36291
   225
blanchet@36574
   226
(* It is not clear why some literals are followed by sequences of stars and/or
blanchet@36574
   227
   pluses. We ignore them. *)
blanchet@38034
   228
fun parse_decorated_atom pool =
blanchet@38034
   229
  parse_atom pool --| Scan.repeat ($$ "*" || $$ "+" || $$ " ")
blanchet@36291
   230
blanchet@38034
   231
fun mk_horn ([], []) = AAtom (ATerm ("c_False", []))
blanchet@37991
   232
  | mk_horn ([], pos_lits) = foldr1 (mk_aconn AOr) pos_lits
blanchet@37991
   233
  | mk_horn (neg_lits, []) = mk_anot (foldr1 (mk_aconn AAnd) neg_lits)
blanchet@37991
   234
  | mk_horn (neg_lits, pos_lits) =
blanchet@37991
   235
    mk_aconn AImplies (foldr1 (mk_aconn AAnd) neg_lits,
blanchet@37991
   236
                       foldr1 (mk_aconn AOr) pos_lits)
blanchet@37991
   237
blanchet@36393
   238
fun parse_horn_clause pool =
blanchet@38034
   239
  Scan.repeat (parse_decorated_atom pool) --| $$ "|" --| $$ "|"
blanchet@38034
   240
    -- Scan.repeat (parse_decorated_atom pool) --| $$ "-" --| $$ ">"
blanchet@38034
   241
    -- Scan.repeat (parse_decorated_atom pool)
blanchet@37991
   242
  >> (mk_horn o apfst (op @))
paulson@21978
   243
blanchet@36558
   244
(* Syntax: <num>[0:<inference><annotations>]
blanchet@38034
   245
   <atoms> || <atoms> -> <atoms>. *)
blanchet@36402
   246
fun parse_spass_line pool =
blanchet@37962
   247
  scan_integer --| $$ "[" --| $$ "0" --| $$ ":" --| Symbol.scan_id
blanchet@38035
   248
    -- parse_spass_annotations --| $$ "]" -- parse_horn_clause pool --| $$ "."
blanchet@39368
   249
  >> (fn ((num, deps), u) => Inference (Num num, u, map Num deps))
blanchet@36291
   250
blanchet@38035
   251
fun parse_line pool =
blanchet@38035
   252
  parse_tstp_line pool || parse_vampire_line pool || parse_spass_line pool
blanchet@36548
   253
fun parse_lines pool = Scan.repeat1 (parse_line pool)
blanchet@36548
   254
fun parse_proof pool =
blanchet@36548
   255
  fst o Scan.finite Symbol.stopper
blanchet@36548
   256
            (Scan.error (!! (fn _ => raise Fail "unrecognized ATP output")
blanchet@36548
   257
                            (parse_lines pool)))
blanchet@38738
   258
  o explode o strip_spaces_except_between_ident_chars
paulson@21978
   259
paulson@21978
   260
(**** INTERPRETATION OF TSTP SYNTAX TREES ****)
paulson@21978
   261
blanchet@37991
   262
exception FO_TERM of string fo_term list
blanchet@37994
   263
exception FORMULA of (string, string fo_term) formula list
blanchet@37991
   264
exception SAME of unit
paulson@21978
   265
blanchet@36909
   266
(* Type variables are given the basic sort "HOL.type". Some will later be
blanchet@37991
   267
   constrained by information from type literals, or by type inference. *)
blanchet@37991
   268
fun type_from_fo_term tfrees (u as ATerm (a, us)) =
blanchet@37991
   269
  let val Ts = map (type_from_fo_term tfrees) us in
blanchet@38748
   270
    case strip_prefix_and_unascii type_const_prefix a of
blanchet@37991
   271
      SOME b => Type (invert_const b, Ts)
blanchet@37991
   272
    | NONE =>
blanchet@37991
   273
      if not (null us) then
blanchet@37991
   274
        raise FO_TERM [u]  (* only "tconst"s have type arguments *)
blanchet@38748
   275
      else case strip_prefix_and_unascii tfree_prefix a of
blanchet@37991
   276
        SOME b =>
blanchet@37991
   277
        let val s = "'" ^ b in
blanchet@37991
   278
          TFree (s, AList.lookup (op =) tfrees s |> the_default HOLogic.typeS)
blanchet@37991
   279
        end
blanchet@36486
   280
      | NONE =>
blanchet@38748
   281
        case strip_prefix_and_unascii tvar_prefix a of
blanchet@37991
   282
          SOME b => TVar (("'" ^ b, 0), HOLogic.typeS)
blanchet@36486
   283
        | NONE =>
blanchet@37991
   284
          (* Variable from the ATP, say "X1" *)
blanchet@37991
   285
          Type_Infer.param 0 (a, HOLogic.typeS)
blanchet@37991
   286
  end
paulson@21978
   287
blanchet@38014
   288
(* Type class literal applied to a type. Returns triple of polarity, class,
blanchet@38014
   289
   type. *)
blanchet@38014
   290
fun type_constraint_from_term pos tfrees (u as ATerm (a, us)) =
blanchet@38748
   291
  case (strip_prefix_and_unascii class_prefix a,
blanchet@38014
   292
        map (type_from_fo_term tfrees) us) of
blanchet@38014
   293
    (SOME b, [T]) => (pos, b, T)
blanchet@38014
   294
  | _ => raise FO_TERM [u]
blanchet@38014
   295
blanchet@38085
   296
(** Accumulate type constraints in a formula: negative type literals **)
blanchet@38014
   297
fun add_var (key, z)  = Vartab.map_default (key, []) (cons z)
blanchet@38014
   298
fun add_type_constraint (false, cl, TFree (a ,_)) = add_var ((a, ~1), cl)
blanchet@38014
   299
  | add_type_constraint (false, cl, TVar (ix, _)) = add_var (ix, cl)
blanchet@38014
   300
  | add_type_constraint _ = I
blanchet@38014
   301
blanchet@38490
   302
fun repair_atp_variable_name f s =
blanchet@36486
   303
  let
blanchet@36486
   304
    fun subscript_name s n = s ^ nat_subscript n
blanchet@38488
   305
    val s = String.map f s
blanchet@36486
   306
  in
blanchet@36486
   307
    case space_explode "_" s of
blanchet@36486
   308
      [_] => (case take_suffix Char.isDigit (String.explode s) of
blanchet@36486
   309
                (cs1 as _ :: _, cs2 as _ :: _) =>
blanchet@36486
   310
                subscript_name (String.implode cs1)
blanchet@36486
   311
                               (the (Int.fromString (String.implode cs2)))
blanchet@36486
   312
              | (_, _) => s)
blanchet@36486
   313
    | [s1, s2] => (case Int.fromString s2 of
blanchet@36486
   314
                     SOME n => subscript_name s1 n
blanchet@36486
   315
                   | NONE => s)
blanchet@36486
   316
    | _ => s
blanchet@36486
   317
  end
blanchet@36486
   318
blanchet@36909
   319
(* First-order translation. No types are known for variables. "HOLogic.typeT"
blanchet@38014
   320
   should allow them to be inferred. *)
blanchet@38014
   321
fun raw_term_from_pred thy full_types tfrees =
blanchet@36909
   322
  let
blanchet@37643
   323
    fun aux opt_T extra_us u =
blanchet@36909
   324
      case u of
blanchet@37991
   325
        ATerm ("hBOOL", [u1]) => aux (SOME @{typ bool}) [] u1
blanchet@37991
   326
      | ATerm ("hAPP", [u1, u2]) => aux opt_T (u2 :: extra_us) u1
blanchet@37991
   327
      | ATerm (a, us) =>
blanchet@36909
   328
        if a = type_wrapper_name then
blanchet@36909
   329
          case us of
blanchet@37643
   330
            [typ_u, term_u] =>
blanchet@37991
   331
            aux (SOME (type_from_fo_term tfrees typ_u)) extra_us term_u
blanchet@37991
   332
          | _ => raise FO_TERM us
blanchet@38748
   333
        else case strip_prefix_and_unascii const_prefix a of
blanchet@36909
   334
          SOME "equal" =>
blanchet@39106
   335
          let val ts = map (aux NONE []) us in
blanchet@39106
   336
            if length ts = 2 andalso hd ts aconv List.last ts then
blanchet@39106
   337
              (* Vampire is keen on producing these. *)
blanchet@39106
   338
              @{const True}
blanchet@39106
   339
            else
blanchet@39106
   340
              list_comb (Const (@{const_name HOL.eq}, HOLogic.typeT), ts)
blanchet@39106
   341
          end
blanchet@36909
   342
        | SOME b =>
blanchet@36909
   343
          let
blanchet@36909
   344
            val c = invert_const b
blanchet@36909
   345
            val num_type_args = num_type_args thy c
blanchet@37643
   346
            val (type_us, term_us) =
blanchet@37643
   347
              chop (if full_types then 0 else num_type_args) us
blanchet@37643
   348
            (* Extra args from "hAPP" come after any arguments given directly to
blanchet@37643
   349
               the constant. *)
blanchet@37643
   350
            val term_ts = map (aux NONE []) term_us
blanchet@37643
   351
            val extra_ts = map (aux NONE []) extra_us
blanchet@36909
   352
            val t =
blanchet@36909
   353
              Const (c, if full_types then
blanchet@36909
   354
                          case opt_T of
blanchet@37643
   355
                            SOME T => map fastype_of term_ts ---> T
blanchet@36909
   356
                          | NONE =>
blanchet@36909
   357
                            if num_type_args = 0 then
blanchet@36909
   358
                              Sign.const_instance thy (c, [])
blanchet@36909
   359
                            else
blanchet@36909
   360
                              raise Fail ("no type information for " ^ quote c)
blanchet@36909
   361
                        else
blanchet@37998
   362
                          Sign.const_instance thy (c,
blanchet@37998
   363
                              map (type_from_fo_term tfrees) type_us))
blanchet@37643
   364
          in list_comb (t, term_ts @ extra_ts) end
blanchet@36909
   365
        | NONE => (* a free or schematic variable *)
blanchet@36909
   366
          let
blanchet@37643
   367
            val ts = map (aux NONE []) (us @ extra_us)
blanchet@36909
   368
            val T = map fastype_of ts ---> HOLogic.typeT
blanchet@36909
   369
            val t =
blanchet@38748
   370
              case strip_prefix_and_unascii fixed_var_prefix a of
blanchet@36909
   371
                SOME b => Free (b, T)
blanchet@36909
   372
              | NONE =>
blanchet@38748
   373
                case strip_prefix_and_unascii schematic_var_prefix a of
blanchet@36967
   374
                  SOME b => Var ((b, 0), T)
blanchet@36909
   375
                | NONE =>
blanchet@38017
   376
                  if is_tptp_variable a then
blanchet@38490
   377
                    Var ((repair_atp_variable_name Char.toLower a, 0), T)
blanchet@38017
   378
                  else
blanchet@38488
   379
                    (* Skolem constants? *)
blanchet@38490
   380
                    Var ((repair_atp_variable_name Char.toUpper a, 0), T)
blanchet@36909
   381
          in list_comb (t, ts) end
blanchet@38014
   382
  in aux (SOME HOLogic.boolT) [] end
paulson@21978
   383
blanchet@38014
   384
fun term_from_pred thy full_types tfrees pos (u as ATerm (s, _)) =
blanchet@38014
   385
  if String.isPrefix class_prefix s then
blanchet@38014
   386
    add_type_constraint (type_constraint_from_term pos tfrees u)
blanchet@38014
   387
    #> pair @{const True}
blanchet@38014
   388
  else
blanchet@38014
   389
    pair (raw_term_from_pred thy full_types tfrees u)
blanchet@36402
   390
blanchet@36555
   391
val combinator_table =
blanchet@36555
   392
  [(@{const_name COMBI}, @{thm COMBI_def_raw}),
blanchet@36555
   393
   (@{const_name COMBK}, @{thm COMBK_def_raw}),
blanchet@36555
   394
   (@{const_name COMBB}, @{thm COMBB_def_raw}),
blanchet@36555
   395
   (@{const_name COMBC}, @{thm COMBC_def_raw}),
blanchet@36555
   396
   (@{const_name COMBS}, @{thm COMBS_def_raw})]
blanchet@36555
   397
blanchet@36555
   398
fun uncombine_term (t1 $ t2) = betapply (pairself uncombine_term (t1, t2))
blanchet@36555
   399
  | uncombine_term (Abs (s, T, t')) = Abs (s, T, uncombine_term t')
blanchet@36555
   400
  | uncombine_term (t as Const (x as (s, _))) =
blanchet@36555
   401
    (case AList.lookup (op =) combinator_table s of
blanchet@36555
   402
       SOME thm => thm |> prop_of |> specialize_type @{theory} x |> Logic.dest_equals |> snd
blanchet@36555
   403
     | NONE => t)
blanchet@36555
   404
  | uncombine_term t = t
blanchet@36555
   405
blanchet@37991
   406
(* Update schematic type variables with detected sort constraints. It's not
blanchet@37991
   407
   totally clear when this code is necessary. *)
blanchet@38014
   408
fun repair_tvar_sorts (t, tvar_tab) =
blanchet@36909
   409
  let
blanchet@37991
   410
    fun do_type (Type (a, Ts)) = Type (a, map do_type Ts)
blanchet@37991
   411
      | do_type (TVar (xi, s)) =
blanchet@37991
   412
        TVar (xi, the_default s (Vartab.lookup tvar_tab xi))
blanchet@37991
   413
      | do_type (TFree z) = TFree z
blanchet@37991
   414
    fun do_term (Const (a, T)) = Const (a, do_type T)
blanchet@37991
   415
      | do_term (Free (a, T)) = Free (a, do_type T)
blanchet@37991
   416
      | do_term (Var (xi, T)) = Var (xi, do_type T)
blanchet@37991
   417
      | do_term (t as Bound _) = t
blanchet@37991
   418
      | do_term (Abs (a, T, t)) = Abs (a, do_type T, do_term t)
blanchet@37991
   419
      | do_term (t1 $ t2) = do_term t1 $ do_term t2
blanchet@37991
   420
  in t |> not (Vartab.is_empty tvar_tab) ? do_term end
blanchet@37991
   421
blanchet@37991
   422
fun quantify_over_free quant_s free_s body_t =
blanchet@37991
   423
  case Term.add_frees body_t [] |> filter (curry (op =) free_s o fst) of
blanchet@37991
   424
    [] => body_t
blanchet@37991
   425
  | frees as (_, free_T) :: _ =>
blanchet@37991
   426
    Abs (free_s, free_T, fold (curry abstract_over) (map Free frees) body_t)
blanchet@37991
   427
blanchet@38085
   428
(* Interpret an ATP formula as a HOL term, extracting sort constraints as they
blanchet@38085
   429
   appear in the formula. *)
blanchet@38014
   430
fun prop_from_formula thy full_types tfrees phi =
blanchet@38014
   431
  let
blanchet@38014
   432
    fun do_formula pos phi =
blanchet@37991
   433
      case phi of
blanchet@38014
   434
        AQuant (_, [], phi) => do_formula pos phi
blanchet@37991
   435
      | AQuant (q, x :: xs, phi') =>
blanchet@38014
   436
        do_formula pos (AQuant (q, xs, phi'))
blanchet@38014
   437
        #>> quantify_over_free (case q of
blanchet@38014
   438
                                  AForall => @{const_name All}
blanchet@38490
   439
                                | AExists => @{const_name Ex})
blanchet@38490
   440
                               (repair_atp_variable_name Char.toLower x)
blanchet@38014
   441
      | AConn (ANot, [phi']) => do_formula (not pos) phi' #>> s_not
blanchet@37991
   442
      | AConn (c, [phi1, phi2]) =>
blanchet@38014
   443
        do_formula (pos |> c = AImplies ? not) phi1
blanchet@38014
   444
        ##>> do_formula pos phi2
blanchet@38014
   445
        #>> (case c of
blanchet@38014
   446
               AAnd => s_conj
blanchet@38014
   447
             | AOr => s_disj
blanchet@38014
   448
             | AImplies => s_imp
blanchet@38038
   449
             | AIf => s_imp o swap
blanchet@38038
   450
             | AIff => s_iff
blanchet@38038
   451
             | ANotIff => s_not o s_iff)
blanchet@38034
   452
      | AAtom tm => term_from_pred thy full_types tfrees pos tm
blanchet@37991
   453
      | _ => raise FORMULA [phi]
blanchet@38014
   454
  in repair_tvar_sorts (do_formula true phi Vartab.empty) end
blanchet@37991
   455
blanchet@36556
   456
fun check_formula ctxt =
wenzelm@39288
   457
  Type.constraint HOLogic.boolT
blanchet@36486
   458
  #> Syntax.check_term (ProofContext.set_mode ProofContext.mode_schematic ctxt)
paulson@21978
   459
paulson@21978
   460
paulson@21978
   461
(**** Translation of TSTP files to Isar Proofs ****)
paulson@21978
   462
blanchet@36486
   463
fun unvarify_term (Var ((s, 0), T)) = Free (s, T)
blanchet@36486
   464
  | unvarify_term t = raise TERM ("unvarify_term: non-Var", [t])
paulson@21978
   465
blanchet@39368
   466
fun decode_line full_types tfrees (Definition (name, phi1, phi2)) ctxt =
blanchet@36486
   467
    let
blanchet@37991
   468
      val thy = ProofContext.theory_of ctxt
blanchet@37991
   469
      val t1 = prop_from_formula thy full_types tfrees phi1
blanchet@36551
   470
      val vars = snd (strip_comb t1)
blanchet@36486
   471
      val frees = map unvarify_term vars
blanchet@36486
   472
      val unvarify_args = subst_atomic (vars ~~ frees)
blanchet@37991
   473
      val t2 = prop_from_formula thy full_types tfrees phi2
blanchet@36551
   474
      val (t1, t2) =
blanchet@36551
   475
        HOLogic.eq_const HOLogic.typeT $ t1 $ t2
blanchet@36556
   476
        |> unvarify_args |> uncombine_term |> check_formula ctxt
blanchet@36555
   477
        |> HOLogic.dest_eq
blanchet@36486
   478
    in
blanchet@39368
   479
      (Definition (name, t1, t2),
blanchet@36551
   480
       fold Variable.declare_term (maps OldTerm.term_frees [t1, t2]) ctxt)
blanchet@36486
   481
    end
blanchet@39368
   482
  | decode_line full_types tfrees (Inference (name, u, deps)) ctxt =
blanchet@36551
   483
    let
blanchet@37991
   484
      val thy = ProofContext.theory_of ctxt
blanchet@37991
   485
      val t = u |> prop_from_formula thy full_types tfrees
blanchet@37998
   486
                |> uncombine_term |> check_formula ctxt
blanchet@36551
   487
    in
blanchet@39368
   488
      (Inference (name, t, deps),
blanchet@36551
   489
       fold Variable.declare_term (OldTerm.term_frees t) ctxt)
blanchet@36486
   490
    end
blanchet@36967
   491
fun decode_lines ctxt full_types tfrees lines =
blanchet@36967
   492
  fst (fold_map (decode_line full_types tfrees) lines ctxt)
paulson@21978
   493
blanchet@38035
   494
fun is_same_inference _ (Definition _) = false
blanchet@38035
   495
  | is_same_inference t (Inference (_, t', _)) = t aconv t'
blanchet@36486
   496
blanchet@36486
   497
(* No "real" literals means only type information (tfree_tcs, clsrel, or
blanchet@36486
   498
   clsarity). *)
blanchet@36486
   499
val is_only_type_information = curry (op aconv) HOLogic.true_const
blanchet@36486
   500
blanchet@36486
   501
fun replace_one_dep (old, new) dep = if dep = old then new else [dep]
blanchet@36486
   502
fun replace_deps_in_line _ (line as Definition _) = line
blanchet@39368
   503
  | replace_deps_in_line p (Inference (name, t, deps)) =
blanchet@39368
   504
    Inference (name, t, fold (union (op =) o replace_one_dep p) deps [])
paulson@21978
   505
blanchet@38085
   506
(* Discard axioms; consolidate adjacent lines that prove the same formula, since
blanchet@38085
   507
   they differ only in type information.*)
blanchet@36551
   508
fun add_line _ _ (line as Definition _) lines = line :: lines
blanchet@39368
   509
  | add_line conjecture_shape axiom_names (Inference (name, t, [])) lines =
blanchet@38085
   510
    (* No dependencies: axiom, conjecture, or (for Vampire) internal axioms or
blanchet@38085
   511
       definitions. *)
blanchet@39368
   512
    if is_axiom_name axiom_names name then
blanchet@36486
   513
      (* Axioms are not proof lines. *)
blanchet@36486
   514
      if is_only_type_information t then
blanchet@39368
   515
        map (replace_deps_in_line (name, [])) lines
blanchet@36486
   516
      (* Is there a repetition? If so, replace later line by earlier one. *)
blanchet@38035
   517
      else case take_prefix (not o is_same_inference t) lines of
blanchet@36486
   518
        (_, []) => lines (*no repetition of proof line*)
blanchet@39368
   519
      | (pre, Inference (name', _, _) :: post) =>
blanchet@39368
   520
        pre @ map (replace_deps_in_line (name', [name])) post
blanchet@39368
   521
    else if is_conjecture_name conjecture_shape name then
blanchet@39368
   522
      Inference (name, negate_term t, []) :: lines
blanchet@36551
   523
    else
blanchet@39368
   524
      map (replace_deps_in_line (name, [])) lines
blanchet@39368
   525
  | add_line _ _ (Inference (name, t, deps)) lines =
blanchet@36486
   526
    (* Type information will be deleted later; skip repetition test. *)
blanchet@36486
   527
    if is_only_type_information t then
blanchet@39368
   528
      Inference (name, t, deps) :: lines
blanchet@36486
   529
    (* Is there a repetition? If so, replace later line by earlier one. *)
blanchet@38035
   530
    else case take_prefix (not o is_same_inference t) lines of
blanchet@36486
   531
      (* FIXME: Doesn't this code risk conflating proofs involving different
blanchet@38035
   532
         types? *)
blanchet@39368
   533
       (_, []) => Inference (name, t, deps) :: lines
blanchet@39368
   534
     | (pre, Inference (name', t', _) :: post) =>
blanchet@39368
   535
       Inference (name, t', deps) ::
blanchet@39368
   536
       pre @ map (replace_deps_in_line (name', [name])) post
paulson@22044
   537
blanchet@36486
   538
(* Recursively delete empty lines (type information) from the proof. *)
blanchet@39368
   539
fun add_nontrivial_line (Inference (name, t, [])) lines =
blanchet@39368
   540
    if is_only_type_information t then delete_dep name lines
blanchet@39368
   541
    else Inference (name, t, []) :: lines
blanchet@36486
   542
  | add_nontrivial_line line lines = line :: lines
blanchet@39368
   543
and delete_dep name lines =
blanchet@39368
   544
  fold_rev add_nontrivial_line (map (replace_deps_in_line (name, [])) lines) []
blanchet@36486
   545
blanchet@37323
   546
(* ATPs sometimes reuse free variable names in the strangest ways. Removing
blanchet@37323
   547
   offending lines often does the trick. *)
blanchet@36560
   548
fun is_bad_free frees (Free x) = not (member (op =) frees x)
blanchet@36560
   549
  | is_bad_free _ _ = false
paulson@22470
   550
blanchet@39368
   551
fun add_desired_line _ _ _ _ (line as Definition (name, _, _)) (j, lines) =
blanchet@39368
   552
    (j, line :: map (replace_deps_in_line (name, [])) lines)
blanchet@38282
   553
  | add_desired_line isar_shrink_factor conjecture_shape axiom_names frees
blanchet@39368
   554
                     (Inference (name, t, deps)) (j, lines) =
blanchet@36402
   555
    (j + 1,
blanchet@39368
   556
     if is_axiom_name axiom_names name orelse
blanchet@39368
   557
        is_conjecture_name conjecture_shape name orelse
blanchet@36570
   558
        (not (is_only_type_information t) andalso
blanchet@36570
   559
         null (Term.add_tvars t []) andalso
blanchet@36570
   560
         not (exists_subterm (is_bad_free frees) t) andalso
blanchet@36570
   561
         (null lines orelse (* last line must be kept *)
blanchet@36924
   562
          (length deps >= 2 andalso j mod isar_shrink_factor = 0))) then
blanchet@39368
   563
       Inference (name, t, deps) :: lines  (* keep line *)
blanchet@36402
   564
     else
blanchet@39368
   565
       map (replace_deps_in_line (name, deps)) lines)  (* drop line *)
paulson@21978
   566
blanchet@36402
   567
(** EXTRACTING LEMMAS **)
paulson@21979
   568
blanchet@38599
   569
(* Like "split_line", but ignores "\n" that follow a comma (as in SNARK's
blanchet@38599
   570
   output). *)
blanchet@38599
   571
val split_proof_lines =
blanchet@38599
   572
  let
blanchet@38599
   573
    fun aux [] [] = []
blanchet@38599
   574
      | aux line [] = [implode (rev line)]
blanchet@38599
   575
      | aux line ("," :: "\n" :: rest) = aux ("," :: line) rest
blanchet@38599
   576
      | aux line ("\n" :: rest) = aux line [] @ aux [] rest
blanchet@38599
   577
      | aux line (s :: rest) = aux (s :: line) rest
blanchet@38599
   578
  in aux [] o explode end
blanchet@38599
   579
blanchet@37991
   580
(* A list consisting of the first number in each line is returned. For TSTP,
blanchet@37991
   581
   interesting lines have the form "fof(108, axiom, ...)", where the number
blanchet@37991
   582
   (108) is extracted. For SPASS, lines have the form "108[0:Inp] ...", where
blanchet@38033
   583
   the first number (108) is extracted. For Vampire, we look for
blanchet@38033
   584
   "108. ... [input]". *)
blanchet@38282
   585
fun used_facts_in_atp_proof axiom_names atp_proof =
blanchet@35865
   586
  let
blanchet@38818
   587
    fun axiom_names_at_index num =
blanchet@38039
   588
      let val j = Int.fromString num |> the_default ~1 in
blanchet@39368
   589
        resolve_axiom axiom_names (Num j)
blanchet@38039
   590
      end
blanchet@38039
   591
    val tokens_of =
blanchet@38039
   592
      String.tokens (fn c => not (Char.isAlphaNum c) andalso c <> #"_")
blanchet@38599
   593
    fun do_line (tag :: num :: "axiom" :: (rest as _ :: _)) =
blanchet@38599
   594
        if tag = "cnf" orelse tag = "fof" then
blanchet@38748
   595
          (case strip_prefix_and_unascii axiom_prefix (List.last rest) of
blanchet@38599
   596
             SOME name =>
blanchet@38698
   597
             if member (op =) rest "file" then
blanchet@38818
   598
               ([(name, name |> find_first_in_list_vector axiom_names |> the)]
blanchet@38818
   599
                handle Option.Option =>
blanchet@38818
   600
                       error ("No such fact: " ^ quote name ^ "."))
blanchet@38698
   601
             else
blanchet@38818
   602
               axiom_names_at_index num
blanchet@38818
   603
           | NONE => axiom_names_at_index num)
blanchet@38599
   604
        else
blanchet@38818
   605
          []
blanchet@38818
   606
      | do_line (num :: "0" :: "Inp" :: _) = axiom_names_at_index num
blanchet@38039
   607
      | do_line (num :: rest) =
blanchet@38818
   608
        (case List.last rest of "input" => axiom_names_at_index num | _ => [])
blanchet@38818
   609
      | do_line _ = []
blanchet@38818
   610
  in atp_proof |> split_proof_lines |> maps (do_line o tokens_of) end
blanchet@37399
   611
blanchet@37399
   612
val indent_size = 2
blanchet@37399
   613
val no_label = ("", ~1)
blanchet@37399
   614
blanchet@37399
   615
val raw_prefix = "X"
blanchet@37399
   616
val assum_prefix = "A"
blanchet@37399
   617
val fact_prefix = "F"
blanchet@37399
   618
blanchet@37399
   619
fun string_for_label (s, num) = s ^ string_of_int num
blanchet@37399
   620
blanchet@39368
   621
fun raw_label_for_name (Str str) = (raw_prefix ^ str, 0)
blanchet@39368
   622
  | raw_label_for_name (Num num) = (raw_prefix, num)
blanchet@39368
   623
blanchet@37399
   624
fun metis_using [] = ""
blanchet@37399
   625
  | metis_using ls =
blanchet@37399
   626
    "using " ^ space_implode " " (map string_for_label ls) ^ " "
blanchet@37399
   627
fun metis_apply _ 1 = "by "
blanchet@37399
   628
  | metis_apply 1 _ = "apply "
blanchet@37399
   629
  | metis_apply i _ = "prefer " ^ string_of_int i ^ " apply "
blanchet@37479
   630
fun metis_name full_types = if full_types then "metisFT" else "metis"
blanchet@37479
   631
fun metis_call full_types [] = metis_name full_types
blanchet@37479
   632
  | metis_call full_types ss =
blanchet@37479
   633
    "(" ^ metis_name full_types ^ " " ^ space_implode " " ss ^ ")"
blanchet@37479
   634
fun metis_command full_types i n (ls, ss) =
blanchet@37479
   635
  metis_using ls ^ metis_apply i n ^ metis_call full_types ss
blanchet@39327
   636
fun metis_line banner full_types i n ss =
blanchet@39327
   637
  banner ^ ": " ^
blanchet@38597
   638
  Markup.markup Markup.sendback (metis_command full_types i n ([], ss)) ^ "."
blanchet@36281
   639
fun minimize_line _ [] = ""
blanchet@38696
   640
  | minimize_line minimize_command ss =
blanchet@38696
   641
    case minimize_command ss of
blanchet@36281
   642
      "" => ""
blanchet@36281
   643
    | command =>
blanchet@38597
   644
      "\nTo minimize the number of lemmas, try this: " ^
blanchet@38597
   645
      Markup.markup Markup.sendback command ^ "."
immler@31840
   646
blanchet@38282
   647
fun used_facts axiom_names =
blanchet@38282
   648
  used_facts_in_atp_proof axiom_names
blanchet@38752
   649
  #> List.partition (curry (op =) Chained o snd)
blanchet@38752
   650
  #> pairself (sort_distinct (string_ord o pairself fst))
blanchet@38015
   651
blanchet@39327
   652
fun metis_proof_text (banner, full_types, minimize_command, atp_proof,
blanchet@39327
   653
                      axiom_names, goal, i) =
blanchet@36063
   654
  let
blanchet@38282
   655
    val (chained_lemmas, other_lemmas) = used_facts axiom_names atp_proof
blanchet@36063
   656
    val n = Logic.count_prems (prop_of goal)
blanchet@37171
   657
  in
blanchet@39327
   658
    (metis_line banner full_types i n (map fst other_lemmas) ^
blanchet@38752
   659
     minimize_line minimize_command (map fst (other_lemmas @ chained_lemmas)),
blanchet@38752
   660
     other_lemmas @ chained_lemmas)
blanchet@37171
   661
  end
immler@31037
   662
blanchet@36486
   663
(** Isar proof construction and manipulation **)
blanchet@36486
   664
blanchet@36486
   665
fun merge_fact_sets (ls1, ss1) (ls2, ss2) =
blanchet@36486
   666
  (union (op =) ls1 ls2, union (op =) ss1 ss2)
blanchet@36402
   667
blanchet@36402
   668
type label = string * int
blanchet@36402
   669
type facts = label list * string list
blanchet@36402
   670
blanchet@36402
   671
datatype qualifier = Show | Then | Moreover | Ultimately
blanchet@36291
   672
blanchet@36402
   673
datatype step =
blanchet@36478
   674
  Fix of (string * typ) list |
blanchet@36486
   675
  Let of term * term |
blanchet@36402
   676
  Assume of label * term |
blanchet@36402
   677
  Have of qualifier list * label * term * byline
blanchet@36402
   678
and byline =
blanchet@36564
   679
  ByMetis of facts |
blanchet@36402
   680
  CaseSplit of step list list * facts
blanchet@36402
   681
blanchet@36574
   682
fun smart_case_split [] facts = ByMetis facts
blanchet@36574
   683
  | smart_case_split proofs facts = CaseSplit (proofs, facts)
blanchet@36574
   684
blanchet@39368
   685
fun add_fact_from_dep axiom_names name =
blanchet@39368
   686
  if is_axiom_name axiom_names name then
blanchet@39368
   687
    apsnd (union (op =) (map fst (resolve_axiom axiom_names name)))
blanchet@36475
   688
  else
blanchet@39368
   689
    apfst (insert (op =) (raw_label_for_name name))
blanchet@36402
   690
blanchet@37998
   691
fun forall_of v t = HOLogic.all_const (fastype_of v) $ lambda v t
blanchet@36491
   692
fun forall_vars t = fold_rev forall_of (map Var (Term.add_vars t [])) t
blanchet@36491
   693
blanchet@37498
   694
fun step_for_line _ _ (Definition (_, t1, t2)) = Let (t1, t2)
blanchet@39368
   695
  | step_for_line _ _ (Inference (name, t, [])) =
blanchet@39368
   696
    Assume (raw_label_for_name name, t)
blanchet@39368
   697
  | step_for_line axiom_names j (Inference (name, t, deps)) =
blanchet@39368
   698
    Have (if j = 1 then [Show] else [], raw_label_for_name name,
blanchet@36491
   699
          forall_vars t,
blanchet@38282
   700
          ByMetis (fold (add_fact_from_dep axiom_names) deps ([], [])))
blanchet@36291
   701
blanchet@36967
   702
fun proof_from_atp_proof pool ctxt full_types tfrees isar_shrink_factor
blanchet@38282
   703
                         atp_proof conjecture_shape axiom_names params frees =
blanchet@36402
   704
  let
blanchet@36486
   705
    val lines =
blanchet@38035
   706
      atp_proof ^ "$" (* the $ sign acts as a sentinel (FIXME: needed?) *)
blanchet@36548
   707
      |> parse_proof pool
blanchet@39368
   708
      |> sort (tstp_name_ord o pairself raw_step_name)
blanchet@36967
   709
      |> decode_lines ctxt full_types tfrees
blanchet@38282
   710
      |> rpair [] |-> fold_rev (add_line conjecture_shape axiom_names)
blanchet@36486
   711
      |> rpair [] |-> fold_rev add_nontrivial_line
blanchet@37498
   712
      |> rpair (0, []) |-> fold_rev (add_desired_line isar_shrink_factor
blanchet@38282
   713
                                             conjecture_shape axiom_names frees)
blanchet@36486
   714
      |> snd
blanchet@36402
   715
  in
blanchet@36909
   716
    (if null params then [] else [Fix params]) @
blanchet@38282
   717
    map2 (step_for_line axiom_names) (length lines downto 1) lines
blanchet@36402
   718
  end
blanchet@36402
   719
blanchet@36402
   720
(* When redirecting proofs, we keep information about the labels seen so far in
blanchet@36402
   721
   the "backpatches" data structure. The first component indicates which facts
blanchet@36402
   722
   should be associated with forthcoming proof steps. The second component is a
blanchet@37322
   723
   pair ("assum_ls", "drop_ls"), where "assum_ls" are the labels that should
blanchet@37322
   724
   become assumptions and "drop_ls" are the labels that should be dropped in a
blanchet@37322
   725
   case split. *)
blanchet@36402
   726
type backpatches = (label * facts) list * (label list * label list)
blanchet@36402
   727
blanchet@36556
   728
fun used_labels_of_step (Have (_, _, _, by)) =
blanchet@36402
   729
    (case by of
blanchet@36564
   730
       ByMetis (ls, _) => ls
blanchet@36556
   731
     | CaseSplit (proofs, (ls, _)) =>
blanchet@36556
   732
       fold (union (op =) o used_labels_of) proofs ls)
blanchet@36556
   733
  | used_labels_of_step _ = []
blanchet@36556
   734
and used_labels_of proof = fold (union (op =) o used_labels_of_step) proof []
blanchet@36402
   735
blanchet@36402
   736
fun new_labels_of_step (Fix _) = []
blanchet@36486
   737
  | new_labels_of_step (Let _) = []
blanchet@36402
   738
  | new_labels_of_step (Assume (l, _)) = [l]
blanchet@36402
   739
  | new_labels_of_step (Have (_, l, _, _)) = [l]
blanchet@36402
   740
val new_labels_of = maps new_labels_of_step
blanchet@36402
   741
blanchet@36402
   742
val join_proofs =
blanchet@36402
   743
  let
blanchet@36402
   744
    fun aux _ [] = NONE
blanchet@36402
   745
      | aux proof_tail (proofs as (proof1 :: _)) =
blanchet@36402
   746
        if exists null proofs then
blanchet@36402
   747
          NONE
blanchet@36402
   748
        else if forall (curry (op =) (hd proof1) o hd) (tl proofs) then
blanchet@36402
   749
          aux (hd proof1 :: proof_tail) (map tl proofs)
blanchet@36402
   750
        else case hd proof1 of
blanchet@37498
   751
          Have ([], l, t, _) => (* FIXME: should we really ignore the "by"? *)
blanchet@36402
   752
          if forall (fn Have ([], l', t', _) :: _ => (l, t) = (l', t')
blanchet@36402
   753
                      | _ => false) (tl proofs) andalso
blanchet@36402
   754
             not (exists (member (op =) (maps new_labels_of proofs))
blanchet@36556
   755
                         (used_labels_of proof_tail)) then
blanchet@36402
   756
            SOME (l, t, map rev proofs, proof_tail)
blanchet@36402
   757
          else
blanchet@36402
   758
            NONE
blanchet@36402
   759
        | _ => NONE
blanchet@36402
   760
  in aux [] o map rev end
blanchet@36402
   761
blanchet@36402
   762
fun case_split_qualifiers proofs =
blanchet@36402
   763
  case length proofs of
blanchet@36402
   764
    0 => []
blanchet@36402
   765
  | 1 => [Then]
blanchet@36402
   766
  | _ => [Ultimately]
blanchet@36402
   767
blanchet@37991
   768
fun redirect_proof conjecture_shape hyp_ts concl_t proof =
wenzelm@33310
   769
  let
blanchet@37324
   770
    (* The first pass outputs those steps that are independent of the negated
blanchet@37324
   771
       conjecture. The second pass flips the proof by contradiction to obtain a
blanchet@37324
   772
       direct proof, introducing case splits when an inference depends on
blanchet@37324
   773
       several facts that depend on the negated conjecture. *)
blanchet@38038
   774
    fun find_hyp num =
blanchet@38038
   775
      nth hyp_ts (index_in_shape num conjecture_shape)
blanchet@38038
   776
      handle Subscript =>
blanchet@38038
   777
             raise Fail ("Cannot find hypothesis " ^ Int.toString num)
blanchet@38040
   778
     val concl_ls = map (pair raw_prefix) (List.last conjecture_shape)
blanchet@38040
   779
     val canonicalize_labels =
blanchet@38040
   780
       map (fn l => if member (op =) concl_ls l then hd concl_ls else l)
blanchet@38040
   781
       #> distinct (op =)
blanchet@38040
   782
     fun first_pass ([], contra) = ([], contra)
blanchet@38040
   783
       | first_pass ((step as Fix _) :: proof, contra) =
blanchet@38040
   784
         first_pass (proof, contra) |>> cons step
blanchet@38040
   785
       | first_pass ((step as Let _) :: proof, contra) =
blanchet@38040
   786
         first_pass (proof, contra) |>> cons step
blanchet@38040
   787
       | first_pass ((step as Assume (l as (_, num), _)) :: proof, contra) =
blanchet@38040
   788
         if member (op =) concl_ls l then
blanchet@38040
   789
           first_pass (proof, contra ||> l = hd concl_ls ? cons step)
blanchet@38040
   790
         else
blanchet@38040
   791
           first_pass (proof, contra) |>> cons (Assume (l, find_hyp num))
blanchet@38040
   792
       | first_pass (Have (qs, l, t, ByMetis (ls, ss)) :: proof, contra) =
blanchet@38040
   793
         let
blanchet@38040
   794
           val ls = canonicalize_labels ls
blanchet@38040
   795
           val step = Have (qs, l, t, ByMetis (ls, ss))
blanchet@38040
   796
         in
blanchet@38040
   797
           if exists (member (op =) (fst contra)) ls then
blanchet@38040
   798
             first_pass (proof, contra |>> cons l ||> cons step)
blanchet@38040
   799
           else
blanchet@38040
   800
             first_pass (proof, contra) |>> cons step
blanchet@38040
   801
         end
blanchet@38040
   802
       | first_pass _ = raise Fail "malformed proof"
blanchet@36402
   803
    val (proof_top, (contra_ls, contra_proof)) =
blanchet@38040
   804
      first_pass (proof, (concl_ls, []))
blanchet@36402
   805
    val backpatch_label = the_default ([], []) oo AList.lookup (op =) o fst
blanchet@36402
   806
    fun backpatch_labels patches ls =
blanchet@36402
   807
      fold merge_fact_sets (map (backpatch_label patches) ls) ([], [])
blanchet@36402
   808
    fun second_pass end_qs ([], assums, patches) =
blanchet@37324
   809
        ([Have (end_qs, no_label, concl_t,
blanchet@36564
   810
                ByMetis (backpatch_labels patches (map snd assums)))], patches)
blanchet@36402
   811
      | second_pass end_qs (Assume (l, t) :: proof, assums, patches) =
blanchet@36402
   812
        second_pass end_qs (proof, (t, l) :: assums, patches)
blanchet@36564
   813
      | second_pass end_qs (Have (qs, l, t, ByMetis (ls, ss)) :: proof, assums,
blanchet@36402
   814
                            patches) =
blanchet@36402
   815
        if member (op =) (snd (snd patches)) l andalso
blanchet@37322
   816
           not (member (op =) (fst (snd patches)) l) andalso
blanchet@36402
   817
           not (AList.defined (op =) (fst patches) l) then
blanchet@36402
   818
          second_pass end_qs (proof, assums, patches ||> apsnd (append ls))
blanchet@36402
   819
        else
blanchet@36402
   820
          (case List.partition (member (op =) contra_ls) ls of
blanchet@36402
   821
             ([contra_l], co_ls) =>
blanchet@37322
   822
             if member (op =) qs Show then
blanchet@37322
   823
               second_pass end_qs (proof, assums,
blanchet@37322
   824
                                   patches |>> cons (contra_l, (co_ls, ss)))
blanchet@37322
   825
             else
blanchet@36402
   826
               second_pass end_qs
blanchet@36402
   827
                           (proof, assums,
blanchet@36402
   828
                            patches |>> cons (contra_l, (l :: co_ls, ss)))
blanchet@36402
   829
               |>> cons (if member (op =) (fst (snd patches)) l then
blanchet@37991
   830
                           Assume (l, negate_term t)
blanchet@36402
   831
                         else
blanchet@37991
   832
                           Have (qs, l, negate_term t,
blanchet@36564
   833
                                 ByMetis (backpatch_label patches l)))
blanchet@36402
   834
           | (contra_ls as _ :: _, co_ls) =>
blanchet@36402
   835
             let
blanchet@36402
   836
               val proofs =
blanchet@36402
   837
                 map_filter
blanchet@36402
   838
                     (fn l =>
blanchet@38040
   839
                         if member (op =) concl_ls l then
blanchet@36402
   840
                           NONE
blanchet@36402
   841
                         else
blanchet@36402
   842
                           let
blanchet@36402
   843
                             val drop_ls = filter (curry (op <>) l) contra_ls
blanchet@36402
   844
                           in
blanchet@36402
   845
                             second_pass []
blanchet@36402
   846
                                 (proof, assums,
blanchet@36402
   847
                                  patches ||> apfst (insert (op =) l)
blanchet@36402
   848
                                          ||> apsnd (union (op =) drop_ls))
blanchet@36402
   849
                             |> fst |> SOME
blanchet@36402
   850
                           end) contra_ls
blanchet@37324
   851
               val (assumes, facts) =
blanchet@37324
   852
                 if member (op =) (fst (snd patches)) l then
blanchet@37991
   853
                   ([Assume (l, negate_term t)], (l :: co_ls, ss))
blanchet@37324
   854
                 else
blanchet@37324
   855
                   ([], (co_ls, ss))
blanchet@36402
   856
             in
blanchet@36402
   857
               (case join_proofs proofs of
blanchet@36402
   858
                  SOME (l, t, proofs, proof_tail) =>
blanchet@36402
   859
                  Have (case_split_qualifiers proofs @
blanchet@36402
   860
                        (if null proof_tail then end_qs else []), l, t,
blanchet@36574
   861
                        smart_case_split proofs facts) :: proof_tail
blanchet@36402
   862
                | NONE =>
blanchet@36402
   863
                  [Have (case_split_qualifiers proofs @ end_qs, no_label,
blanchet@36574
   864
                         concl_t, smart_case_split proofs facts)],
blanchet@36402
   865
                patches)
blanchet@37324
   866
               |>> append assumes
blanchet@36402
   867
             end
blanchet@36402
   868
           | _ => raise Fail "malformed proof")
blanchet@36402
   869
       | second_pass _ _ = raise Fail "malformed proof"
blanchet@36486
   870
    val proof_bottom =
blanchet@36486
   871
      second_pass [Show] (contra_proof, [], ([], ([], []))) |> fst
blanchet@36402
   872
  in proof_top @ proof_bottom end
blanchet@36402
   873
blanchet@38490
   874
(* FIXME: Still needed? Probably not. *)
blanchet@36402
   875
val kill_duplicate_assumptions_in_proof =
blanchet@36402
   876
  let
blanchet@36402
   877
    fun relabel_facts subst =
blanchet@36402
   878
      apfst (map (fn l => AList.lookup (op =) subst l |> the_default l))
blanchet@36491
   879
    fun do_step (step as Assume (l, t)) (proof, subst, assums) =
blanchet@36402
   880
        (case AList.lookup (op aconv) assums t of
blanchet@36967
   881
           SOME l' => (proof, (l, l') :: subst, assums)
blanchet@36491
   882
         | NONE => (step :: proof, subst, (t, l) :: assums))
blanchet@36402
   883
      | do_step (Have (qs, l, t, by)) (proof, subst, assums) =
blanchet@36402
   884
        (Have (qs, l, t,
blanchet@36402
   885
               case by of
blanchet@36564
   886
                 ByMetis facts => ByMetis (relabel_facts subst facts)
blanchet@36402
   887
               | CaseSplit (proofs, facts) =>
blanchet@36402
   888
                 CaseSplit (map do_proof proofs, relabel_facts subst facts)) ::
blanchet@36402
   889
         proof, subst, assums)
blanchet@36491
   890
      | do_step step (proof, subst, assums) = (step :: proof, subst, assums)
blanchet@36402
   891
    and do_proof proof = fold do_step proof ([], [], []) |> #1 |> rev
blanchet@36402
   892
  in do_proof end
blanchet@36402
   893
blanchet@36402
   894
val then_chain_proof =
blanchet@36402
   895
  let
blanchet@36402
   896
    fun aux _ [] = []
blanchet@36491
   897
      | aux _ ((step as Assume (l, _)) :: proof) = step :: aux l proof
blanchet@36402
   898
      | aux l' (Have (qs, l, t, by) :: proof) =
blanchet@36402
   899
        (case by of
blanchet@36564
   900
           ByMetis (ls, ss) =>
blanchet@36402
   901
           Have (if member (op =) ls l' then
blanchet@36402
   902
                   (Then :: qs, l, t,
blanchet@36564
   903
                    ByMetis (filter_out (curry (op =) l') ls, ss))
blanchet@36402
   904
                 else
blanchet@36564
   905
                   (qs, l, t, ByMetis (ls, ss)))
blanchet@36402
   906
         | CaseSplit (proofs, facts) =>
blanchet@36402
   907
           Have (qs, l, t, CaseSplit (map (aux no_label) proofs, facts))) ::
blanchet@36402
   908
        aux l proof
blanchet@36491
   909
      | aux _ (step :: proof) = step :: aux no_label proof
blanchet@36402
   910
  in aux no_label end
blanchet@36402
   911
blanchet@36402
   912
fun kill_useless_labels_in_proof proof =
blanchet@36402
   913
  let
blanchet@36556
   914
    val used_ls = used_labels_of proof
blanchet@36402
   915
    fun do_label l = if member (op =) used_ls l then l else no_label
blanchet@36556
   916
    fun do_step (Assume (l, t)) = Assume (do_label l, t)
blanchet@36556
   917
      | do_step (Have (qs, l, t, by)) =
blanchet@36402
   918
        Have (qs, do_label l, t,
blanchet@36402
   919
              case by of
blanchet@36402
   920
                CaseSplit (proofs, facts) =>
blanchet@36556
   921
                CaseSplit (map (map do_step) proofs, facts)
blanchet@36402
   922
              | _ => by)
blanchet@36556
   923
      | do_step step = step
blanchet@36556
   924
  in map do_step proof end
blanchet@36402
   925
blanchet@36402
   926
fun prefix_for_depth n = replicate_string (n + 1)
blanchet@36402
   927
blanchet@36402
   928
val relabel_proof =
blanchet@36402
   929
  let
blanchet@36402
   930
    fun aux _ _ _ [] = []
blanchet@36402
   931
      | aux subst depth (next_assum, next_fact) (Assume (l, t) :: proof) =
blanchet@36402
   932
        if l = no_label then
blanchet@36402
   933
          Assume (l, t) :: aux subst depth (next_assum, next_fact) proof
blanchet@36402
   934
        else
blanchet@36402
   935
          let val l' = (prefix_for_depth depth assum_prefix, next_assum) in
blanchet@36402
   936
            Assume (l', t) ::
blanchet@36402
   937
            aux ((l, l') :: subst) depth (next_assum + 1, next_fact) proof
blanchet@36402
   938
          end
blanchet@36402
   939
      | aux subst depth (next_assum, next_fact) (Have (qs, l, t, by) :: proof) =
blanchet@36402
   940
        let
blanchet@36402
   941
          val (l', subst, next_fact) =
blanchet@36402
   942
            if l = no_label then
blanchet@36402
   943
              (l, subst, next_fact)
blanchet@36402
   944
            else
blanchet@36402
   945
              let
blanchet@36402
   946
                val l' = (prefix_for_depth depth fact_prefix, next_fact)
blanchet@36402
   947
              in (l', (l, l') :: subst, next_fact + 1) end
blanchet@36570
   948
          val relabel_facts =
blanchet@36570
   949
            apfst (map (fn l =>
blanchet@36570
   950
                           case AList.lookup (op =) subst l of
blanchet@36570
   951
                             SOME l' => l'
blanchet@36570
   952
                           | NONE => raise Fail ("unknown label " ^
blanchet@36570
   953
                                                 quote (string_for_label l))))
blanchet@36402
   954
          val by =
blanchet@36402
   955
            case by of
blanchet@36564
   956
              ByMetis facts => ByMetis (relabel_facts facts)
blanchet@36402
   957
            | CaseSplit (proofs, facts) =>
blanchet@36402
   958
              CaseSplit (map (aux subst (depth + 1) (1, 1)) proofs,
blanchet@36402
   959
                         relabel_facts facts)
blanchet@36402
   960
        in
blanchet@36402
   961
          Have (qs, l', t, by) ::
blanchet@36402
   962
          aux subst depth (next_assum, next_fact) proof
blanchet@36402
   963
        end
blanchet@36491
   964
      | aux subst depth nextp (step :: proof) =
blanchet@36491
   965
        step :: aux subst depth nextp proof
blanchet@36402
   966
  in aux [] 0 (1, 1) end
blanchet@36402
   967
wenzelm@39115
   968
fun string_for_proof ctxt0 full_types i n =
blanchet@36402
   969
  let
wenzelm@39134
   970
    val ctxt = ctxt0
wenzelm@39134
   971
      |> Config.put show_free_types false
wenzelm@39134
   972
      |> Config.put show_types true
blanchet@37319
   973
    fun fix_print_mode f x =
wenzelm@39134
   974
      Print_Mode.setmp (filter (curry (op =) Symbol.xsymbolsN)
wenzelm@39134
   975
                               (print_mode_value ())) f x
blanchet@36402
   976
    fun do_indent ind = replicate_string (ind * indent_size) " "
blanchet@36478
   977
    fun do_free (s, T) =
blanchet@36478
   978
      maybe_quote s ^ " :: " ^
blanchet@36478
   979
      maybe_quote (fix_print_mode (Syntax.string_of_typ ctxt) T)
blanchet@36570
   980
    fun do_label l = if l = no_label then "" else string_for_label l ^ ": "
blanchet@36402
   981
    fun do_have qs =
blanchet@36402
   982
      (if member (op =) qs Moreover then "moreover " else "") ^
blanchet@36402
   983
      (if member (op =) qs Ultimately then "ultimately " else "") ^
blanchet@36402
   984
      (if member (op =) qs Then then
blanchet@36402
   985
         if member (op =) qs Show then "thus" else "hence"
blanchet@36402
   986
       else
blanchet@36402
   987
         if member (op =) qs Show then "show" else "have")
blanchet@36478
   988
    val do_term = maybe_quote o fix_print_mode (Syntax.string_of_term ctxt)
blanchet@36570
   989
    fun do_facts (ls, ss) =
blanchet@38698
   990
      metis_command full_types 1 1
blanchet@38698
   991
                    (ls |> sort_distinct (prod_ord string_ord int_ord),
blanchet@38698
   992
                     ss |> sort_distinct string_ord)
blanchet@36478
   993
    and do_step ind (Fix xs) =
blanchet@36478
   994
        do_indent ind ^ "fix " ^ space_implode " and " (map do_free xs) ^ "\n"
blanchet@36486
   995
      | do_step ind (Let (t1, t2)) =
blanchet@36486
   996
        do_indent ind ^ "let " ^ do_term t1 ^ " = " ^ do_term t2 ^ "\n"
blanchet@36402
   997
      | do_step ind (Assume (l, t)) =
blanchet@36402
   998
        do_indent ind ^ "assume " ^ do_label l ^ do_term t ^ "\n"
blanchet@36564
   999
      | do_step ind (Have (qs, l, t, ByMetis facts)) =
blanchet@36402
  1000
        do_indent ind ^ do_have qs ^ " " ^
blanchet@36479
  1001
        do_label l ^ do_term t ^ " " ^ do_facts facts ^ "\n"
blanchet@36402
  1002
      | do_step ind (Have (qs, l, t, CaseSplit (proofs, facts))) =
blanchet@36402
  1003
        space_implode (do_indent ind ^ "moreover\n")
blanchet@36402
  1004
                      (map (do_block ind) proofs) ^
blanchet@36479
  1005
        do_indent ind ^ do_have qs ^ " " ^ do_label l ^ do_term t ^ " " ^
blanchet@36478
  1006
        do_facts facts ^ "\n"
blanchet@36402
  1007
    and do_steps prefix suffix ind steps =
blanchet@36402
  1008
      let val s = implode (map (do_step ind) steps) in
blanchet@36402
  1009
        replicate_string (ind * indent_size - size prefix) " " ^ prefix ^
blanchet@36402
  1010
        String.extract (s, ind * indent_size,
blanchet@36402
  1011
                        SOME (size s - ind * indent_size - 1)) ^
blanchet@36402
  1012
        suffix ^ "\n"
blanchet@36402
  1013
      end
blanchet@36402
  1014
    and do_block ind proof = do_steps "{ " " }" (ind + 1) proof
blanchet@36564
  1015
    (* One-step proofs are pointless; better use the Metis one-liner
blanchet@36564
  1016
       directly. *)
blanchet@36564
  1017
    and do_proof [Have (_, _, _, ByMetis _)] = ""
blanchet@36564
  1018
      | do_proof proof =
blanchet@36480
  1019
        (if i <> 1 then "prefer " ^ string_of_int i ^ "\n" else "") ^
blanchet@36480
  1020
        do_indent 0 ^ "proof -\n" ^
blanchet@36480
  1021
        do_steps "" "" 1 proof ^
blanchet@38599
  1022
        do_indent 0 ^ (if n <> 1 then "next" else "qed")
blanchet@36488
  1023
  in do_proof end
blanchet@36402
  1024
blanchet@37479
  1025
fun isar_proof_text (pool, debug, isar_shrink_factor, ctxt, conjecture_shape)
blanchet@39327
  1026
                    (other_params as (_, full_types, _, atp_proof, axiom_names,
blanchet@38282
  1027
                                      goal, i)) =
blanchet@36402
  1028
  let
blanchet@36909
  1029
    val (params, hyp_ts, concl_t) = strip_subgoal goal i
blanchet@36909
  1030
    val frees = fold Term.add_frees (concl_t :: hyp_ts) []
blanchet@36967
  1031
    val tfrees = fold Term.add_tfrees (concl_t :: hyp_ts) []
blanchet@36402
  1032
    val n = Logic.count_prems (prop_of goal)
blanchet@37479
  1033
    val (one_line_proof, lemma_names) = metis_proof_text other_params
blanchet@36283
  1034
    fun isar_proof_for () =
blanchet@36967
  1035
      case proof_from_atp_proof pool ctxt full_types tfrees isar_shrink_factor
blanchet@38282
  1036
                                atp_proof conjecture_shape axiom_names params
blanchet@36924
  1037
                                frees
blanchet@37991
  1038
           |> redirect_proof conjecture_shape hyp_ts concl_t
blanchet@36402
  1039
           |> kill_duplicate_assumptions_in_proof
blanchet@36402
  1040
           |> then_chain_proof
blanchet@36402
  1041
           |> kill_useless_labels_in_proof
blanchet@36402
  1042
           |> relabel_proof
blanchet@37479
  1043
           |> string_for_proof ctxt full_types i n of
blanchet@38599
  1044
        "" => "\nNo structured proof available."
blanchet@38599
  1045
      | proof => "\n\nStructured proof:\n" ^ Markup.markup Markup.sendback proof
blanchet@35868
  1046
    val isar_proof =
blanchet@36402
  1047
      if debug then
blanchet@36283
  1048
        isar_proof_for ()
blanchet@36283
  1049
      else
blanchet@36283
  1050
        try isar_proof_for ()
blanchet@38599
  1051
        |> the_default "\nWarning: The Isar proof construction failed."
blanchet@36283
  1052
  in (one_line_proof ^ isar_proof, lemma_names) end
paulson@21978
  1053
blanchet@36557
  1054
fun proof_text isar_proof isar_params other_params =
blanchet@36557
  1055
  (if isar_proof then isar_proof_text isar_params else metis_proof_text)
blanchet@36557
  1056
      other_params
blanchet@36223
  1057
immler@31038
  1058
end;