src/HOL/Tools/Sledgehammer/sledgehammer_atp_reconstruct.ML
author blanchet
Wed Dec 15 11:26:28 2010 +0100 (2010-12-15)
changeset 41138 eb80538166b6
parent 41136 30bedf58b177
child 41140 9c68004b8c9d
permissions -rw-r--r--
implemented partially-typed "tags" type encoding
blanchet@40114
     1
(*  Title:      HOL/Tools/Sledgehammer/sledgehammer_atp_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
blanchet@39495
     6
Proof reconstruction for Sledgehammer.
wenzelm@33310
     7
*)
wenzelm@33310
     8
blanchet@40068
     9
signature SLEDGEHAMMER_ATP_RECONSTRUCT =
paulson@24425
    10
sig
blanchet@38988
    11
  type locality = Sledgehammer_Filter.locality
blanchet@41136
    12
  type type_system = Sledgehammer_ATP_Translate.type_system
blanchet@36281
    13
  type minimize_command = string list -> string
blanchet@38818
    14
  type metis_params =
blanchet@41136
    15
    string * type_system * minimize_command * string
blanchet@41136
    16
    * (string * locality) list vector * thm * int
blanchet@38818
    17
  type isar_params =
blanchet@38040
    18
    string Symtab.table * bool * int * Proof.context * int list list
blanchet@38818
    19
  type text_result = string * (string * locality) list
blanchet@38818
    20
blanchet@40204
    21
  val repair_conjecture_shape_and_fact_names :
blanchet@39493
    22
    string -> int list list -> (string * locality) list vector
blanchet@39493
    23
    -> int list list * (string * locality) list vector
blanchet@40060
    24
  val apply_on_subgoal : int -> int -> string
blanchet@40060
    25
  val command_call : string -> string list -> string
blanchet@40064
    26
  val try_command_line : string -> string -> string
blanchet@40064
    27
  val minimize_line : ('a list -> string) -> 'a list -> string
blanchet@40723
    28
  val split_used_facts :
blanchet@40723
    29
    (string * locality) list
blanchet@40723
    30
    -> (string * locality) list * (string * locality) list
blanchet@38818
    31
  val isar_proof_text : isar_params -> metis_params -> text_result
blanchet@38818
    32
  val proof_text : bool -> isar_params -> metis_params -> text_result
paulson@24425
    33
end;
paulson@21978
    34
blanchet@40068
    35
structure Sledgehammer_ATP_Reconstruct : SLEDGEHAMMER_ATP_RECONSTRUCT =
paulson@21978
    36
struct
paulson@21978
    37
blanchet@38028
    38
open ATP_Problem
blanchet@39452
    39
open ATP_Proof
blanchet@39494
    40
open Metis_Translate
blanchet@36478
    41
open Sledgehammer_Util
blanchet@38988
    42
open Sledgehammer_Filter
blanchet@40074
    43
open Sledgehammer_ATP_Translate
paulson@21978
    44
blanchet@36281
    45
type minimize_command = string list -> string
blanchet@38818
    46
type metis_params =
blanchet@41136
    47
  string * type_system * minimize_command * string
blanchet@41136
    48
  * (string * locality) list vector * thm * int
blanchet@38818
    49
type isar_params =
blanchet@38818
    50
  string Symtab.table * bool * int * Proof.context * int list list
blanchet@38818
    51
type text_result = string * (string * locality) list
blanchet@36281
    52
blanchet@39500
    53
fun is_head_digit s = Char.isDigit (String.sub (s, 0))
blanchet@39500
    54
val scan_integer = Scan.many1 is_head_digit >> (the o Int.fromString o implode)
blanchet@39500
    55
blanchet@39500
    56
fun find_first_in_list_vector vec key =
blanchet@39500
    57
  Vector.foldl (fn (ps, NONE) => AList.lookup (op =) ps key
blanchet@39500
    58
                 | (_, value) => value) NONE vec
blanchet@39500
    59
blanchet@39453
    60
blanchet@39493
    61
(** SPASS's Flotter hack **)
blanchet@39493
    62
blanchet@40204
    63
(* This is a hack required for keeping track of facts after they have been
blanchet@39493
    64
   clausified by SPASS's Flotter tool. The "ATP/scripts/spass" script is also
blanchet@39493
    65
   part of this hack. *)
blanchet@39493
    66
blanchet@39493
    67
val set_ClauseFormulaRelationN = "set_ClauseFormulaRelation"
blanchet@39493
    68
blanchet@39493
    69
fun extract_clause_sequence output =
blanchet@39493
    70
  let
blanchet@39493
    71
    val tokens_of = String.tokens (not o Char.isAlphaNum)
blanchet@39493
    72
    fun extract_num ("clause" :: (ss as _ :: _)) =
blanchet@39493
    73
    Int.fromString (List.last ss)
blanchet@39493
    74
      | extract_num _ = NONE
blanchet@39493
    75
  in output |> split_lines |> map_filter (extract_num o tokens_of) end
blanchet@39493
    76
blanchet@39493
    77
val parse_clause_formula_pair =
blanchet@39493
    78
  $$ "(" |-- scan_integer --| $$ ","
blanchet@39493
    79
  -- (Symbol.scan_id ::: Scan.repeat ($$ "," |-- Symbol.scan_id)) --| $$ ")"
blanchet@39493
    80
  --| Scan.option ($$ ",")
blanchet@39493
    81
val parse_clause_formula_relation =
blanchet@39493
    82
  Scan.this_string set_ClauseFormulaRelationN |-- $$ "("
blanchet@39493
    83
  |-- Scan.repeat parse_clause_formula_pair
blanchet@39493
    84
val extract_clause_formula_relation =
blanchet@39493
    85
  Substring.full #> Substring.position set_ClauseFormulaRelationN
blanchet@39493
    86
  #> snd #> Substring.position "." #> fst #> Substring.string
wenzelm@40627
    87
  #> raw_explode #> filter_out Symbol.is_blank #> parse_clause_formula_relation
blanchet@39493
    88
  #> fst
blanchet@39493
    89
blanchet@40204
    90
fun repair_conjecture_shape_and_fact_names output conjecture_shape fact_names =
blanchet@39493
    91
  if String.isSubstring set_ClauseFormulaRelationN output then
blanchet@39493
    92
    let
blanchet@39493
    93
      val j0 = hd (hd conjecture_shape)
blanchet@39493
    94
      val seq = extract_clause_sequence output
blanchet@39493
    95
      val name_map = extract_clause_formula_relation output
blanchet@39493
    96
      fun renumber_conjecture j =
blanchet@39493
    97
        conjecture_prefix ^ string_of_int (j - j0)
blanchet@39493
    98
        |> AList.find (fn (s, ss) => member (op =) ss s) name_map
blanchet@39493
    99
        |> map (fn s => find_index (curry (op =) s) seq + 1)
blanchet@39493
   100
      fun names_for_number j =
blanchet@39493
   101
        j |> AList.lookup (op =) name_map |> these
blanchet@40204
   102
          |> map_filter (try (unprefix fact_prefix)) |> map unascii_of
blanchet@39493
   103
          |> map (fn name =>
blanchet@40204
   104
                     (name, name |> find_first_in_list_vector fact_names |> the)
blanchet@39493
   105
                     handle Option.Option =>
blanchet@39493
   106
                            error ("No such fact: " ^ quote name ^ "."))
blanchet@39493
   107
    in
blanchet@39493
   108
      (conjecture_shape |> map (maps renumber_conjecture),
blanchet@39493
   109
       seq |> map names_for_number |> Vector.fromList)
blanchet@39493
   110
    end
blanchet@39493
   111
  else
blanchet@40204
   112
    (conjecture_shape, fact_names)
blanchet@39493
   113
blanchet@39493
   114
blanchet@39453
   115
(** Soft-core proof reconstruction: Metis one-liner **)
blanchet@39453
   116
blanchet@39453
   117
fun string_for_label (s, num) = s ^ string_of_int num
blanchet@39453
   118
blanchet@40060
   119
fun apply_on_subgoal _ 1 = "by "
blanchet@40060
   120
  | apply_on_subgoal 1 _ = "apply "
blanchet@40060
   121
  | apply_on_subgoal i _ = "prefer " ^ string_of_int i ^ " apply "
blanchet@40060
   122
fun command_call name [] = name
blanchet@40060
   123
  | command_call name args = "(" ^ name ^ " " ^ space_implode " " args ^ ")"
blanchet@40064
   124
fun try_command_line banner command =
blanchet@40060
   125
  banner ^ ": " ^ Markup.markup Markup.sendback command ^ "."
blanchet@40060
   126
fun using_labels [] = ""
blanchet@40060
   127
  | using_labels ls =
blanchet@39453
   128
    "using " ^ space_implode " " (map string_for_label ls) ^ " "
blanchet@41136
   129
fun metis_name type_sys = if is_fully_typed type_sys then "metisFT" else "metis"
blanchet@41136
   130
fun metis_call type_sys ss = command_call (metis_name type_sys) ss
blanchet@41136
   131
fun metis_command type_sys i n (ls, ss) =
blanchet@41136
   132
  using_labels ls ^ apply_on_subgoal i n ^ metis_call type_sys ss
blanchet@41136
   133
fun metis_line banner type_sys i n ss =
blanchet@41136
   134
  try_command_line banner (metis_command type_sys i n ([], ss))
blanchet@39453
   135
fun minimize_line _ [] = ""
blanchet@39453
   136
  | minimize_line minimize_command ss =
blanchet@39453
   137
    case minimize_command ss of
blanchet@39453
   138
      "" => ""
blanchet@39453
   139
    | command =>
blanchet@39453
   140
      "\nTo minimize the number of lemmas, try this: " ^
blanchet@39453
   141
      Markup.markup Markup.sendback command ^ "."
blanchet@39453
   142
blanchet@40204
   143
fun resolve_fact fact_names ((_, SOME s)) =
blanchet@40204
   144
    (case strip_prefix_and_unascii fact_prefix s of
blanchet@40204
   145
       SOME s' => (case find_first_in_list_vector fact_names s' of
blanchet@39453
   146
                     SOME x => [(s', x)]
blanchet@39453
   147
                   | NONE => [])
blanchet@39453
   148
     | NONE => [])
blanchet@40204
   149
  | resolve_fact fact_names (num, NONE) =
blanchet@39453
   150
    case Int.fromString num of
blanchet@39453
   151
      SOME j =>
blanchet@40204
   152
      if j > 0 andalso j <= Vector.length fact_names then
blanchet@40204
   153
        Vector.sub (fact_names, j - 1)
blanchet@39453
   154
      else
blanchet@39453
   155
        []
blanchet@39453
   156
    | NONE => []
blanchet@39453
   157
blanchet@40204
   158
fun add_fact fact_names (Inference (name, _, [])) =
blanchet@40204
   159
    append (resolve_fact fact_names name)
blanchet@39453
   160
  | add_fact _ _ = I
blanchet@39453
   161
blanchet@40204
   162
fun used_facts_in_tstplike_proof fact_names =
blanchet@40204
   163
  atp_proof_from_tstplike_string #> rpair [] #-> fold (add_fact fact_names)
blanchet@39453
   164
blanchet@40723
   165
val split_used_facts =
blanchet@40723
   166
  List.partition (curry (op =) Chained o snd)
blanchet@39453
   167
  #> pairself (sort_distinct (string_ord o pairself fst))
blanchet@39453
   168
blanchet@41136
   169
fun metis_proof_text (banner, type_sys, minimize_command, tstplike_proof,
blanchet@41136
   170
                      fact_names, goal, i) =
blanchet@39453
   171
  let
blanchet@40723
   172
    val (chained_lemmas, other_lemmas) =
blanchet@40723
   173
      split_used_facts (used_facts_in_tstplike_proof fact_names tstplike_proof)
blanchet@39453
   174
    val n = Logic.count_prems (prop_of goal)
blanchet@39453
   175
  in
blanchet@41136
   176
    (metis_line banner type_sys i n (map fst other_lemmas) ^
blanchet@39453
   177
     minimize_line minimize_command (map fst (other_lemmas @ chained_lemmas)),
blanchet@39453
   178
     other_lemmas @ chained_lemmas)
blanchet@39453
   179
  end
blanchet@39453
   180
blanchet@39453
   181
blanchet@39453
   182
(** Hard-core proof reconstruction: structured Isar proofs **)
blanchet@39453
   183
blanchet@38014
   184
(* Simple simplifications to ensure that sort annotations don't leave a trail of
blanchet@38014
   185
   spurious "True"s. *)
blanchet@38014
   186
fun s_not @{const False} = @{const True}
blanchet@38014
   187
  | s_not @{const True} = @{const False}
blanchet@38014
   188
  | s_not (@{const Not} $ t) = t
blanchet@38014
   189
  | s_not t = @{const Not} $ t
blanchet@38014
   190
fun s_conj (@{const True}, t2) = t2
blanchet@38014
   191
  | s_conj (t1, @{const True}) = t1
blanchet@38014
   192
  | s_conj p = HOLogic.mk_conj p
blanchet@38014
   193
fun s_disj (@{const False}, t2) = t2
blanchet@38014
   194
  | s_disj (t1, @{const False}) = t1
blanchet@38014
   195
  | s_disj p = HOLogic.mk_disj p
blanchet@38014
   196
fun s_imp (@{const True}, t2) = t2
blanchet@38014
   197
  | s_imp (t1, @{const False}) = s_not t1
blanchet@38014
   198
  | s_imp p = HOLogic.mk_imp p
blanchet@38014
   199
fun s_iff (@{const True}, t2) = t2
blanchet@38014
   200
  | s_iff (t1, @{const True}) = t1
blanchet@38014
   201
  | s_iff (t1, t2) = HOLogic.eq_const HOLogic.boolT $ t1 $ t2
blanchet@38014
   202
blanchet@39425
   203
fun forall_of v t = HOLogic.all_const (fastype_of v) $ lambda v t
blanchet@39425
   204
fun exists_of v t = HOLogic.exists_const (fastype_of v) $ lambda v t
blanchet@39425
   205
blanchet@39452
   206
fun negate_term (Const (@{const_name All}, T) $ Abs (s, T', t')) =
blanchet@39452
   207
    Const (@{const_name Ex}, T) $ Abs (s, T', negate_term t')
blanchet@39452
   208
  | negate_term (Const (@{const_name Ex}, T) $ Abs (s, T', t')) =
blanchet@39452
   209
    Const (@{const_name All}, T) $ Abs (s, T', negate_term t')
blanchet@39452
   210
  | negate_term (@{const HOL.implies} $ t1 $ t2) =
blanchet@39452
   211
    @{const HOL.conj} $ t1 $ negate_term t2
blanchet@39452
   212
  | negate_term (@{const HOL.conj} $ t1 $ t2) =
blanchet@39452
   213
    @{const HOL.disj} $ negate_term t1 $ negate_term t2
blanchet@39452
   214
  | negate_term (@{const HOL.disj} $ t1 $ t2) =
blanchet@39452
   215
    @{const HOL.conj} $ negate_term t1 $ negate_term t2
blanchet@39452
   216
  | negate_term (@{const Not} $ t) = t
blanchet@39452
   217
  | negate_term t = @{const Not} $ t
blanchet@39368
   218
blanchet@39453
   219
val indent_size = 2
blanchet@39453
   220
val no_label = ("", ~1)
blanchet@39453
   221
blanchet@39453
   222
val raw_prefix = "X"
blanchet@39453
   223
val assum_prefix = "A"
blanchet@39453
   224
val fact_prefix = "F"
blanchet@39370
   225
blanchet@39455
   226
fun resolve_conjecture conjecture_shape (num, s_opt) =
blanchet@39455
   227
  let
blanchet@39455
   228
    val k = case try (unprefix conjecture_prefix) (the_default "" s_opt) of
blanchet@39455
   229
              SOME s => Int.fromString s |> the_default ~1
blanchet@39455
   230
            | NONE => case Int.fromString num of
blanchet@39455
   231
                        SOME j => find_index (exists (curry (op =) j))
blanchet@39455
   232
                                             conjecture_shape
blanchet@39455
   233
                      | NONE => ~1
blanchet@39455
   234
  in if k >= 0 then [k] else [] end
blanchet@39453
   235
blanchet@40204
   236
fun is_fact conjecture_shape = not o null o resolve_fact conjecture_shape
blanchet@39710
   237
fun is_conjecture conjecture_shape = not o null o resolve_conjecture conjecture_shape
blanchet@36291
   238
blanchet@39453
   239
fun raw_label_for_name conjecture_shape name =
blanchet@39453
   240
  case resolve_conjecture conjecture_shape name of
blanchet@39453
   241
    [j] => (conjecture_prefix, j)
blanchet@39455
   242
  | _ => case Int.fromString (fst name) of
blanchet@39453
   243
           SOME j => (raw_prefix, j)
blanchet@39455
   244
         | NONE => (raw_prefix ^ fst name, 0)
blanchet@39453
   245
paulson@21978
   246
(**** INTERPRETATION OF TSTP SYNTAX TREES ****)
paulson@21978
   247
blanchet@37991
   248
exception FO_TERM of string fo_term list
blanchet@37994
   249
exception FORMULA of (string, string fo_term) formula list
blanchet@37991
   250
exception SAME of unit
paulson@21978
   251
blanchet@36909
   252
(* Type variables are given the basic sort "HOL.type". Some will later be
blanchet@37991
   253
   constrained by information from type literals, or by type inference. *)
blanchet@37991
   254
fun type_from_fo_term tfrees (u as ATerm (a, us)) =
blanchet@37991
   255
  let val Ts = map (type_from_fo_term tfrees) us in
blanchet@38748
   256
    case strip_prefix_and_unascii type_const_prefix a of
blanchet@37991
   257
      SOME b => Type (invert_const b, Ts)
blanchet@37991
   258
    | NONE =>
blanchet@37991
   259
      if not (null us) then
blanchet@37991
   260
        raise FO_TERM [u]  (* only "tconst"s have type arguments *)
blanchet@38748
   261
      else case strip_prefix_and_unascii tfree_prefix a of
blanchet@37991
   262
        SOME b =>
blanchet@37991
   263
        let val s = "'" ^ b in
blanchet@37991
   264
          TFree (s, AList.lookup (op =) tfrees s |> the_default HOLogic.typeS)
blanchet@37991
   265
        end
blanchet@36486
   266
      | NONE =>
blanchet@38748
   267
        case strip_prefix_and_unascii tvar_prefix a of
blanchet@37991
   268
          SOME b => TVar (("'" ^ b, 0), HOLogic.typeS)
blanchet@36486
   269
        | NONE =>
blanchet@37991
   270
          (* Variable from the ATP, say "X1" *)
blanchet@37991
   271
          Type_Infer.param 0 (a, HOLogic.typeS)
blanchet@37991
   272
  end
paulson@21978
   273
blanchet@38014
   274
(* Type class literal applied to a type. Returns triple of polarity, class,
blanchet@38014
   275
   type. *)
blanchet@38014
   276
fun type_constraint_from_term pos tfrees (u as ATerm (a, us)) =
blanchet@38748
   277
  case (strip_prefix_and_unascii class_prefix a,
blanchet@38014
   278
        map (type_from_fo_term tfrees) us) of
blanchet@38014
   279
    (SOME b, [T]) => (pos, b, T)
blanchet@38014
   280
  | _ => raise FO_TERM [u]
blanchet@38014
   281
blanchet@38085
   282
(** Accumulate type constraints in a formula: negative type literals **)
blanchet@38014
   283
fun add_var (key, z)  = Vartab.map_default (key, []) (cons z)
blanchet@38014
   284
fun add_type_constraint (false, cl, TFree (a ,_)) = add_var ((a, ~1), cl)
blanchet@38014
   285
  | add_type_constraint (false, cl, TVar (ix, _)) = add_var (ix, cl)
blanchet@38014
   286
  | add_type_constraint _ = I
blanchet@38014
   287
blanchet@38490
   288
fun repair_atp_variable_name f s =
blanchet@36486
   289
  let
blanchet@36486
   290
    fun subscript_name s n = s ^ nat_subscript n
blanchet@38488
   291
    val s = String.map f s
blanchet@36486
   292
  in
blanchet@36486
   293
    case space_explode "_" s of
blanchet@36486
   294
      [_] => (case take_suffix Char.isDigit (String.explode s) of
blanchet@36486
   295
                (cs1 as _ :: _, cs2 as _ :: _) =>
blanchet@36486
   296
                subscript_name (String.implode cs1)
blanchet@36486
   297
                               (the (Int.fromString (String.implode cs2)))
blanchet@36486
   298
              | (_, _) => s)
blanchet@36486
   299
    | [s1, s2] => (case Int.fromString s2 of
blanchet@36486
   300
                     SOME n => subscript_name s1 n
blanchet@36486
   301
                   | NONE => s)
blanchet@36486
   302
    | _ => s
blanchet@36486
   303
  end
blanchet@36486
   304
blanchet@36909
   305
(* First-order translation. No types are known for variables. "HOLogic.typeT"
blanchet@38014
   306
   should allow them to be inferred. *)
blanchet@41136
   307
fun raw_term_from_pred thy type_sys tfrees =
blanchet@36909
   308
  let
blanchet@37643
   309
    fun aux opt_T extra_us u =
blanchet@36909
   310
      case u of
blanchet@37991
   311
        ATerm ("hBOOL", [u1]) => aux (SOME @{typ bool}) [] u1
blanchet@37991
   312
      | ATerm ("hAPP", [u1, u2]) => aux opt_T (u2 :: extra_us) u1
blanchet@37991
   313
      | ATerm (a, us) =>
blanchet@41138
   314
        if a = type_tag_name then
blanchet@36909
   315
          case us of
blanchet@37643
   316
            [typ_u, term_u] =>
blanchet@37991
   317
            aux (SOME (type_from_fo_term tfrees typ_u)) extra_us term_u
blanchet@37991
   318
          | _ => raise FO_TERM us
blanchet@38748
   319
        else case strip_prefix_and_unascii const_prefix a of
blanchet@36909
   320
          SOME "equal" =>
blanchet@39106
   321
          let val ts = map (aux NONE []) us in
blanchet@39106
   322
            if length ts = 2 andalso hd ts aconv List.last ts then
blanchet@39106
   323
              (* Vampire is keen on producing these. *)
blanchet@39106
   324
              @{const True}
blanchet@39106
   325
            else
blanchet@39106
   326
              list_comb (Const (@{const_name HOL.eq}, HOLogic.typeT), ts)
blanchet@39106
   327
          end
blanchet@36909
   328
        | SOME b =>
blanchet@36909
   329
          let
blanchet@36909
   330
            val c = invert_const b
blanchet@41136
   331
            val num_ty_args = num_atp_type_args thy type_sys c
blanchet@41136
   332
            val (type_us, term_us) = chop num_ty_args us
blanchet@37643
   333
            (* Extra args from "hAPP" come after any arguments given directly to
blanchet@37643
   334
               the constant. *)
blanchet@37643
   335
            val term_ts = map (aux NONE []) term_us
blanchet@37643
   336
            val extra_ts = map (aux NONE []) extra_us
blanchet@36909
   337
            val t =
blanchet@41136
   338
              Const (c, if is_fully_typed type_sys then
blanchet@36909
   339
                          case opt_T of
blanchet@37643
   340
                            SOME T => map fastype_of term_ts ---> T
blanchet@36909
   341
                          | NONE =>
blanchet@41136
   342
                            if num_type_args thy c = 0 then
blanchet@36909
   343
                              Sign.const_instance thy (c, [])
blanchet@36909
   344
                            else
blanchet@36909
   345
                              raise Fail ("no type information for " ^ quote c)
blanchet@41136
   346
                        else if num_type_args thy c = length type_us then
blanchet@37998
   347
                          Sign.const_instance thy (c,
blanchet@41136
   348
                              map (type_from_fo_term tfrees) type_us)
blanchet@41136
   349
                        else
blanchet@41136
   350
                          HOLogic.typeT)
blanchet@37643
   351
          in list_comb (t, term_ts @ extra_ts) end
blanchet@36909
   352
        | NONE => (* a free or schematic variable *)
blanchet@36909
   353
          let
blanchet@37643
   354
            val ts = map (aux NONE []) (us @ extra_us)
blanchet@36909
   355
            val T = map fastype_of ts ---> HOLogic.typeT
blanchet@36909
   356
            val t =
blanchet@38748
   357
              case strip_prefix_and_unascii fixed_var_prefix a of
blanchet@36909
   358
                SOME b => Free (b, T)
blanchet@36909
   359
              | NONE =>
blanchet@38748
   360
                case strip_prefix_and_unascii schematic_var_prefix a of
blanchet@36967
   361
                  SOME b => Var ((b, 0), T)
blanchet@36909
   362
                | NONE =>
blanchet@39452
   363
                  if is_atp_variable a then
blanchet@38490
   364
                    Var ((repair_atp_variable_name Char.toLower a, 0), T)
blanchet@38017
   365
                  else
blanchet@38488
   366
                    (* Skolem constants? *)
blanchet@38490
   367
                    Var ((repair_atp_variable_name Char.toUpper a, 0), T)
blanchet@36909
   368
          in list_comb (t, ts) end
blanchet@38014
   369
  in aux (SOME HOLogic.boolT) [] end
paulson@21978
   370
blanchet@41136
   371
fun term_from_pred thy type_sys tfrees pos (u as ATerm (s, _)) =
blanchet@38014
   372
  if String.isPrefix class_prefix s then
blanchet@38014
   373
    add_type_constraint (type_constraint_from_term pos tfrees u)
blanchet@38014
   374
    #> pair @{const True}
blanchet@38014
   375
  else
blanchet@41136
   376
    pair (raw_term_from_pred thy type_sys tfrees u)
blanchet@36402
   377
blanchet@36555
   378
val combinator_table =
blanchet@39953
   379
  [(@{const_name Meson.COMBI}, @{thm Meson.COMBI_def_raw}),
blanchet@39953
   380
   (@{const_name Meson.COMBK}, @{thm Meson.COMBK_def_raw}),
blanchet@39953
   381
   (@{const_name Meson.COMBB}, @{thm Meson.COMBB_def_raw}),
blanchet@39953
   382
   (@{const_name Meson.COMBC}, @{thm Meson.COMBC_def_raw}),
blanchet@39953
   383
   (@{const_name Meson.COMBS}, @{thm Meson.COMBS_def_raw})]
blanchet@36555
   384
blanchet@36555
   385
fun uncombine_term (t1 $ t2) = betapply (pairself uncombine_term (t1, t2))
blanchet@36555
   386
  | uncombine_term (Abs (s, T, t')) = Abs (s, T, uncombine_term t')
blanchet@36555
   387
  | uncombine_term (t as Const (x as (s, _))) =
blanchet@36555
   388
    (case AList.lookup (op =) combinator_table s of
blanchet@36555
   389
       SOME thm => thm |> prop_of |> specialize_type @{theory} x |> Logic.dest_equals |> snd
blanchet@36555
   390
     | NONE => t)
blanchet@36555
   391
  | uncombine_term t = t
blanchet@36555
   392
blanchet@37991
   393
(* Update schematic type variables with detected sort constraints. It's not
blanchet@37991
   394
   totally clear when this code is necessary. *)
blanchet@38014
   395
fun repair_tvar_sorts (t, tvar_tab) =
blanchet@36909
   396
  let
blanchet@37991
   397
    fun do_type (Type (a, Ts)) = Type (a, map do_type Ts)
blanchet@37991
   398
      | do_type (TVar (xi, s)) =
blanchet@37991
   399
        TVar (xi, the_default s (Vartab.lookup tvar_tab xi))
blanchet@37991
   400
      | do_type (TFree z) = TFree z
blanchet@37991
   401
    fun do_term (Const (a, T)) = Const (a, do_type T)
blanchet@37991
   402
      | do_term (Free (a, T)) = Free (a, do_type T)
blanchet@37991
   403
      | do_term (Var (xi, T)) = Var (xi, do_type T)
blanchet@37991
   404
      | do_term (t as Bound _) = t
blanchet@37991
   405
      | do_term (Abs (a, T, t)) = Abs (a, do_type T, do_term t)
blanchet@37991
   406
      | do_term (t1 $ t2) = do_term t1 $ do_term t2
blanchet@37991
   407
  in t |> not (Vartab.is_empty tvar_tab) ? do_term end
blanchet@37991
   408
blanchet@39425
   409
fun quantify_over_var quant_of var_s t =
blanchet@39425
   410
  let
blanchet@39425
   411
    val vars = [] |> Term.add_vars t |> filter (fn ((s, _), _) => s = var_s)
blanchet@39425
   412
                  |> map Var
blanchet@39425
   413
  in fold_rev quant_of vars t end
blanchet@37991
   414
blanchet@38085
   415
(* Interpret an ATP formula as a HOL term, extracting sort constraints as they
blanchet@38085
   416
   appear in the formula. *)
blanchet@41136
   417
fun prop_from_formula thy type_sys tfrees phi =
blanchet@38014
   418
  let
blanchet@38014
   419
    fun do_formula pos phi =
blanchet@37991
   420
      case phi of
blanchet@38014
   421
        AQuant (_, [], phi) => do_formula pos phi
blanchet@37991
   422
      | AQuant (q, x :: xs, phi') =>
blanchet@38014
   423
        do_formula pos (AQuant (q, xs, phi'))
blanchet@39425
   424
        #>> quantify_over_var (case q of
blanchet@39425
   425
                                 AForall => forall_of
blanchet@39425
   426
                               | AExists => exists_of)
blanchet@39425
   427
                              (repair_atp_variable_name Char.toLower x)
blanchet@38014
   428
      | AConn (ANot, [phi']) => do_formula (not pos) phi' #>> s_not
blanchet@37991
   429
      | AConn (c, [phi1, phi2]) =>
blanchet@38014
   430
        do_formula (pos |> c = AImplies ? not) phi1
blanchet@38014
   431
        ##>> do_formula pos phi2
blanchet@38014
   432
        #>> (case c of
blanchet@38014
   433
               AAnd => s_conj
blanchet@38014
   434
             | AOr => s_disj
blanchet@38014
   435
             | AImplies => s_imp
blanchet@38038
   436
             | AIf => s_imp o swap
blanchet@38038
   437
             | AIff => s_iff
blanchet@40069
   438
             | ANotIff => s_not o s_iff
blanchet@40069
   439
             | _ => raise Fail "unexpected connective")
blanchet@41136
   440
      | AAtom tm => term_from_pred thy type_sys tfrees pos tm
blanchet@37991
   441
      | _ => raise FORMULA [phi]
blanchet@38014
   442
  in repair_tvar_sorts (do_formula true phi Vartab.empty) end
blanchet@37991
   443
blanchet@36556
   444
fun check_formula ctxt =
wenzelm@39288
   445
  Type.constraint HOLogic.boolT
blanchet@36486
   446
  #> Syntax.check_term (ProofContext.set_mode ProofContext.mode_schematic ctxt)
paulson@21978
   447
paulson@21978
   448
paulson@21978
   449
(**** Translation of TSTP files to Isar Proofs ****)
paulson@21978
   450
blanchet@36486
   451
fun unvarify_term (Var ((s, 0), T)) = Free (s, T)
blanchet@36486
   452
  | unvarify_term t = raise TERM ("unvarify_term: non-Var", [t])
paulson@21978
   453
blanchet@41136
   454
fun decode_line type_sys tfrees (Definition (name, phi1, phi2)) ctxt =
blanchet@36486
   455
    let
blanchet@37991
   456
      val thy = ProofContext.theory_of ctxt
blanchet@41136
   457
      val t1 = prop_from_formula thy type_sys tfrees phi1
blanchet@36551
   458
      val vars = snd (strip_comb t1)
blanchet@36486
   459
      val frees = map unvarify_term vars
blanchet@36486
   460
      val unvarify_args = subst_atomic (vars ~~ frees)
blanchet@41136
   461
      val t2 = prop_from_formula thy type_sys tfrees phi2
blanchet@36551
   462
      val (t1, t2) =
blanchet@36551
   463
        HOLogic.eq_const HOLogic.typeT $ t1 $ t2
blanchet@36556
   464
        |> unvarify_args |> uncombine_term |> check_formula ctxt
blanchet@36555
   465
        |> HOLogic.dest_eq
blanchet@36486
   466
    in
blanchet@39368
   467
      (Definition (name, t1, t2),
blanchet@36551
   468
       fold Variable.declare_term (maps OldTerm.term_frees [t1, t2]) ctxt)
blanchet@36486
   469
    end
blanchet@41136
   470
  | decode_line type_sys tfrees (Inference (name, u, deps)) ctxt =
blanchet@36551
   471
    let
blanchet@37991
   472
      val thy = ProofContext.theory_of ctxt
blanchet@41136
   473
      val t = u |> prop_from_formula thy type_sys tfrees
blanchet@37998
   474
                |> uncombine_term |> check_formula ctxt
blanchet@36551
   475
    in
blanchet@39368
   476
      (Inference (name, t, deps),
blanchet@36551
   477
       fold Variable.declare_term (OldTerm.term_frees t) ctxt)
blanchet@36486
   478
    end
blanchet@41136
   479
fun decode_lines ctxt type_sys tfrees lines =
blanchet@41136
   480
  fst (fold_map (decode_line type_sys tfrees) lines ctxt)
paulson@21978
   481
blanchet@38035
   482
fun is_same_inference _ (Definition _) = false
blanchet@38035
   483
  | is_same_inference t (Inference (_, t', _)) = t aconv t'
blanchet@36486
   484
blanchet@36486
   485
(* No "real" literals means only type information (tfree_tcs, clsrel, or
blanchet@36486
   486
   clsarity). *)
blanchet@36486
   487
val is_only_type_information = curry (op aconv) HOLogic.true_const
blanchet@36486
   488
blanchet@39373
   489
fun replace_one_dependency (old, new) dep =
blanchet@39452
   490
  if is_same_step (dep, old) then new else [dep]
blanchet@39373
   491
fun replace_dependencies_in_line _ (line as Definition _) = line
blanchet@39373
   492
  | replace_dependencies_in_line p (Inference (name, t, deps)) =
blanchet@39373
   493
    Inference (name, t, fold (union (op =) o replace_one_dependency p) deps [])
paulson@21978
   494
blanchet@40204
   495
(* Discard facts; consolidate adjacent lines that prove the same formula, since
blanchet@38085
   496
   they differ only in type information.*)
blanchet@36551
   497
fun add_line _ _ (line as Definition _) lines = line :: lines
blanchet@40204
   498
  | add_line conjecture_shape fact_names (Inference (name, t, [])) lines =
blanchet@40204
   499
    (* No dependencies: fact, conjecture, or (for Vampire) internal facts or
blanchet@38085
   500
       definitions. *)
blanchet@40204
   501
    if is_fact fact_names name then
blanchet@40204
   502
      (* Facts are not proof lines. *)
blanchet@36486
   503
      if is_only_type_information t then
blanchet@39373
   504
        map (replace_dependencies_in_line (name, [])) lines
blanchet@36486
   505
      (* Is there a repetition? If so, replace later line by earlier one. *)
blanchet@38035
   506
      else case take_prefix (not o is_same_inference t) lines of
blanchet@39373
   507
        (_, []) => lines (* no repetition of proof line *)
blanchet@39368
   508
      | (pre, Inference (name', _, _) :: post) =>
blanchet@39373
   509
        pre @ map (replace_dependencies_in_line (name', [name])) post
blanchet@40069
   510
      | _ => raise Fail "unexpected inference"
blanchet@39370
   511
    else if is_conjecture conjecture_shape name then
blanchet@39368
   512
      Inference (name, negate_term t, []) :: lines
blanchet@36551
   513
    else
blanchet@39373
   514
      map (replace_dependencies_in_line (name, [])) lines
blanchet@39368
   515
  | add_line _ _ (Inference (name, t, deps)) lines =
blanchet@36486
   516
    (* Type information will be deleted later; skip repetition test. *)
blanchet@36486
   517
    if is_only_type_information t then
blanchet@39368
   518
      Inference (name, t, deps) :: lines
blanchet@36486
   519
    (* Is there a repetition? If so, replace later line by earlier one. *)
blanchet@38035
   520
    else case take_prefix (not o is_same_inference t) lines of
blanchet@36486
   521
      (* FIXME: Doesn't this code risk conflating proofs involving different
blanchet@38035
   522
         types? *)
blanchet@39368
   523
       (_, []) => Inference (name, t, deps) :: lines
blanchet@39368
   524
     | (pre, Inference (name', t', _) :: post) =>
blanchet@39368
   525
       Inference (name, t', deps) ::
blanchet@39373
   526
       pre @ map (replace_dependencies_in_line (name', [name])) post
blanchet@40069
   527
     | _ => raise Fail "unexpected inference"
paulson@22044
   528
blanchet@36486
   529
(* Recursively delete empty lines (type information) from the proof. *)
blanchet@39368
   530
fun add_nontrivial_line (Inference (name, t, [])) lines =
blanchet@39373
   531
    if is_only_type_information t then delete_dependency name lines
blanchet@39368
   532
    else Inference (name, t, []) :: lines
blanchet@36486
   533
  | add_nontrivial_line line lines = line :: lines
blanchet@39373
   534
and delete_dependency name lines =
blanchet@39373
   535
  fold_rev add_nontrivial_line
blanchet@39373
   536
           (map (replace_dependencies_in_line (name, [])) lines) []
blanchet@36486
   537
blanchet@37323
   538
(* ATPs sometimes reuse free variable names in the strangest ways. Removing
blanchet@37323
   539
   offending lines often does the trick. *)
blanchet@36560
   540
fun is_bad_free frees (Free x) = not (member (op =) frees x)
blanchet@36560
   541
  | is_bad_free _ _ = false
paulson@22470
   542
blanchet@39368
   543
fun add_desired_line _ _ _ _ (line as Definition (name, _, _)) (j, lines) =
blanchet@39373
   544
    (j, line :: map (replace_dependencies_in_line (name, [])) lines)
blanchet@40204
   545
  | add_desired_line isar_shrink_factor conjecture_shape fact_names frees
blanchet@39368
   546
                     (Inference (name, t, deps)) (j, lines) =
blanchet@36402
   547
    (j + 1,
blanchet@40204
   548
     if is_fact fact_names name orelse
blanchet@39370
   549
        is_conjecture conjecture_shape name orelse
blanchet@39373
   550
        (* the last line must be kept *)
blanchet@39373
   551
        j = 0 orelse
blanchet@36570
   552
        (not (is_only_type_information t) andalso
blanchet@36570
   553
         null (Term.add_tvars t []) andalso
blanchet@36570
   554
         not (exists_subterm (is_bad_free frees) t) andalso
blanchet@39373
   555
         length deps >= 2 andalso j mod isar_shrink_factor = 0 andalso
blanchet@39373
   556
         (* kill next to last line, which usually results in a trivial step *)
blanchet@39373
   557
         j <> 1) then
blanchet@39368
   558
       Inference (name, t, deps) :: lines  (* keep line *)
blanchet@36402
   559
     else
blanchet@39373
   560
       map (replace_dependencies_in_line (name, deps)) lines)  (* drop line *)
paulson@21978
   561
blanchet@36486
   562
(** Isar proof construction and manipulation **)
blanchet@36486
   563
blanchet@36486
   564
fun merge_fact_sets (ls1, ss1) (ls2, ss2) =
blanchet@36486
   565
  (union (op =) ls1 ls2, union (op =) ss1 ss2)
blanchet@36402
   566
blanchet@36402
   567
type label = string * int
blanchet@36402
   568
type facts = label list * string list
blanchet@36402
   569
blanchet@39452
   570
datatype isar_qualifier = Show | Then | Moreover | Ultimately
blanchet@36291
   571
blanchet@39452
   572
datatype isar_step =
blanchet@36478
   573
  Fix of (string * typ) list |
blanchet@36486
   574
  Let of term * term |
blanchet@36402
   575
  Assume of label * term |
blanchet@39452
   576
  Have of isar_qualifier list * label * term * byline
blanchet@36402
   577
and byline =
blanchet@36564
   578
  ByMetis of facts |
blanchet@39452
   579
  CaseSplit of isar_step list list * facts
blanchet@36402
   580
blanchet@36574
   581
fun smart_case_split [] facts = ByMetis facts
blanchet@36574
   582
  | smart_case_split proofs facts = CaseSplit (proofs, facts)
blanchet@36574
   583
blanchet@40204
   584
fun add_fact_from_dependency conjecture_shape fact_names name =
blanchet@40204
   585
  if is_fact fact_names name then
blanchet@40204
   586
    apsnd (union (op =) (map fst (resolve_fact fact_names name)))
blanchet@36475
   587
  else
blanchet@39370
   588
    apfst (insert (op =) (raw_label_for_name conjecture_shape name))
blanchet@36402
   589
blanchet@39370
   590
fun step_for_line _ _ _ (Definition (_, t1, t2)) = Let (t1, t2)
blanchet@39370
   591
  | step_for_line conjecture_shape _ _ (Inference (name, t, [])) =
blanchet@39370
   592
    Assume (raw_label_for_name conjecture_shape name, t)
blanchet@40204
   593
  | step_for_line conjecture_shape fact_names j (Inference (name, t, deps)) =
blanchet@39370
   594
    Have (if j = 1 then [Show] else [],
blanchet@39425
   595
          raw_label_for_name conjecture_shape name,
blanchet@39425
   596
          fold_rev forall_of (map Var (Term.add_vars t [])) t,
blanchet@40204
   597
          ByMetis (fold (add_fact_from_dependency conjecture_shape fact_names)
blanchet@39373
   598
                        deps ([], [])))
blanchet@36291
   599
blanchet@39454
   600
fun repair_name "$true" = "c_True"
blanchet@39454
   601
  | repair_name "$false" = "c_False"
blanchet@39454
   602
  | repair_name "$$e" = "c_equal" (* seen in Vampire proofs *)
blanchet@39454
   603
  | repair_name "equal" = "c_equal" (* needed by SPASS? *)
blanchet@39454
   604
  | repair_name s =
blanchet@39454
   605
    if String.isPrefix "sQ" s andalso String.isSuffix "_eqProxy" s then
blanchet@39454
   606
      "c_equal" (* seen in Vampire proofs *)
blanchet@39454
   607
    else
blanchet@39454
   608
      s
blanchet@39454
   609
blanchet@41136
   610
fun isar_proof_from_tstplike_proof pool ctxt type_sys tfrees isar_shrink_factor
blanchet@41136
   611
        tstplike_proof conjecture_shape fact_names params frees =
blanchet@36402
   612
  let
blanchet@36486
   613
    val lines =
blanchet@39452
   614
      tstplike_proof
blanchet@39454
   615
      |> atp_proof_from_tstplike_string
blanchet@39454
   616
      |> nasty_atp_proof pool
blanchet@39454
   617
      |> map_term_names_in_atp_proof repair_name
blanchet@41136
   618
      |> decode_lines ctxt type_sys tfrees
blanchet@40204
   619
      |> rpair [] |-> fold_rev (add_line conjecture_shape fact_names)
blanchet@36486
   620
      |> rpair [] |-> fold_rev add_nontrivial_line
blanchet@37498
   621
      |> rpair (0, []) |-> fold_rev (add_desired_line isar_shrink_factor
blanchet@40204
   622
                                             conjecture_shape fact_names frees)
blanchet@36486
   623
      |> snd
blanchet@36402
   624
  in
blanchet@36909
   625
    (if null params then [] else [Fix params]) @
blanchet@40204
   626
    map2 (step_for_line conjecture_shape fact_names) (length lines downto 1)
blanchet@39370
   627
         lines
blanchet@36402
   628
  end
blanchet@36402
   629
blanchet@36402
   630
(* When redirecting proofs, we keep information about the labels seen so far in
blanchet@36402
   631
   the "backpatches" data structure. The first component indicates which facts
blanchet@36402
   632
   should be associated with forthcoming proof steps. The second component is a
blanchet@37322
   633
   pair ("assum_ls", "drop_ls"), where "assum_ls" are the labels that should
blanchet@37322
   634
   become assumptions and "drop_ls" are the labels that should be dropped in a
blanchet@37322
   635
   case split. *)
blanchet@36402
   636
type backpatches = (label * facts) list * (label list * label list)
blanchet@36402
   637
blanchet@36556
   638
fun used_labels_of_step (Have (_, _, _, by)) =
blanchet@36402
   639
    (case by of
blanchet@36564
   640
       ByMetis (ls, _) => ls
blanchet@36556
   641
     | CaseSplit (proofs, (ls, _)) =>
blanchet@36556
   642
       fold (union (op =) o used_labels_of) proofs ls)
blanchet@36556
   643
  | used_labels_of_step _ = []
blanchet@36556
   644
and used_labels_of proof = fold (union (op =) o used_labels_of_step) proof []
blanchet@36402
   645
blanchet@36402
   646
fun new_labels_of_step (Fix _) = []
blanchet@36486
   647
  | new_labels_of_step (Let _) = []
blanchet@36402
   648
  | new_labels_of_step (Assume (l, _)) = [l]
blanchet@36402
   649
  | new_labels_of_step (Have (_, l, _, _)) = [l]
blanchet@36402
   650
val new_labels_of = maps new_labels_of_step
blanchet@36402
   651
blanchet@36402
   652
val join_proofs =
blanchet@36402
   653
  let
blanchet@36402
   654
    fun aux _ [] = NONE
blanchet@36402
   655
      | aux proof_tail (proofs as (proof1 :: _)) =
blanchet@36402
   656
        if exists null proofs then
blanchet@36402
   657
          NONE
blanchet@36402
   658
        else if forall (curry (op =) (hd proof1) o hd) (tl proofs) then
blanchet@36402
   659
          aux (hd proof1 :: proof_tail) (map tl proofs)
blanchet@36402
   660
        else case hd proof1 of
blanchet@37498
   661
          Have ([], l, t, _) => (* FIXME: should we really ignore the "by"? *)
blanchet@36402
   662
          if forall (fn Have ([], l', t', _) :: _ => (l, t) = (l', t')
blanchet@36402
   663
                      | _ => false) (tl proofs) andalso
blanchet@36402
   664
             not (exists (member (op =) (maps new_labels_of proofs))
blanchet@36556
   665
                         (used_labels_of proof_tail)) then
blanchet@36402
   666
            SOME (l, t, map rev proofs, proof_tail)
blanchet@36402
   667
          else
blanchet@36402
   668
            NONE
blanchet@36402
   669
        | _ => NONE
blanchet@36402
   670
  in aux [] o map rev end
blanchet@36402
   671
blanchet@36402
   672
fun case_split_qualifiers proofs =
blanchet@36402
   673
  case length proofs of
blanchet@36402
   674
    0 => []
blanchet@36402
   675
  | 1 => [Then]
blanchet@36402
   676
  | _ => [Ultimately]
blanchet@36402
   677
blanchet@39372
   678
fun redirect_proof hyp_ts concl_t proof =
wenzelm@33310
   679
  let
blanchet@37324
   680
    (* The first pass outputs those steps that are independent of the negated
blanchet@37324
   681
       conjecture. The second pass flips the proof by contradiction to obtain a
blanchet@37324
   682
       direct proof, introducing case splits when an inference depends on
blanchet@37324
   683
       several facts that depend on the negated conjecture. *)
blanchet@39372
   684
     val concl_l = (conjecture_prefix, length hyp_ts)
blanchet@38040
   685
     fun first_pass ([], contra) = ([], contra)
blanchet@38040
   686
       | first_pass ((step as Fix _) :: proof, contra) =
blanchet@38040
   687
         first_pass (proof, contra) |>> cons step
blanchet@38040
   688
       | first_pass ((step as Let _) :: proof, contra) =
blanchet@38040
   689
         first_pass (proof, contra) |>> cons step
blanchet@39370
   690
       | first_pass ((step as Assume (l as (_, j), _)) :: proof, contra) =
blanchet@39372
   691
         if l = concl_l then first_pass (proof, contra ||> cons step)
blanchet@39372
   692
         else first_pass (proof, contra) |>> cons (Assume (l, nth hyp_ts j))
blanchet@38040
   693
       | first_pass (Have (qs, l, t, ByMetis (ls, ss)) :: proof, contra) =
blanchet@39372
   694
         let val step = Have (qs, l, t, ByMetis (ls, ss)) in
blanchet@38040
   695
           if exists (member (op =) (fst contra)) ls then
blanchet@38040
   696
             first_pass (proof, contra |>> cons l ||> cons step)
blanchet@38040
   697
           else
blanchet@38040
   698
             first_pass (proof, contra) |>> cons step
blanchet@38040
   699
         end
blanchet@38040
   700
       | first_pass _ = raise Fail "malformed proof"
blanchet@36402
   701
    val (proof_top, (contra_ls, contra_proof)) =
blanchet@39372
   702
      first_pass (proof, ([concl_l], []))
blanchet@36402
   703
    val backpatch_label = the_default ([], []) oo AList.lookup (op =) o fst
blanchet@36402
   704
    fun backpatch_labels patches ls =
blanchet@36402
   705
      fold merge_fact_sets (map (backpatch_label patches) ls) ([], [])
blanchet@36402
   706
    fun second_pass end_qs ([], assums, patches) =
blanchet@37324
   707
        ([Have (end_qs, no_label, concl_t,
blanchet@36564
   708
                ByMetis (backpatch_labels patches (map snd assums)))], patches)
blanchet@36402
   709
      | second_pass end_qs (Assume (l, t) :: proof, assums, patches) =
blanchet@36402
   710
        second_pass end_qs (proof, (t, l) :: assums, patches)
blanchet@36564
   711
      | second_pass end_qs (Have (qs, l, t, ByMetis (ls, ss)) :: proof, assums,
blanchet@36402
   712
                            patches) =
blanchet@39373
   713
        (if member (op =) (snd (snd patches)) l andalso
blanchet@39373
   714
            not (member (op =) (fst (snd patches)) l) andalso
blanchet@39373
   715
            not (AList.defined (op =) (fst patches) l) then
blanchet@39373
   716
           second_pass end_qs (proof, assums, patches ||> apsnd (append ls))
blanchet@39373
   717
         else case List.partition (member (op =) contra_ls) ls of
blanchet@39373
   718
           ([contra_l], co_ls) =>
blanchet@39373
   719
           if member (op =) qs Show then
blanchet@39373
   720
             second_pass end_qs (proof, assums,
blanchet@39373
   721
                                 patches |>> cons (contra_l, (co_ls, ss)))
blanchet@39373
   722
           else
blanchet@39373
   723
             second_pass end_qs
blanchet@39373
   724
                         (proof, assums,
blanchet@39373
   725
                          patches |>> cons (contra_l, (l :: co_ls, ss)))
blanchet@39373
   726
             |>> cons (if member (op =) (fst (snd patches)) l then
blanchet@39373
   727
                         Assume (l, negate_term t)
blanchet@39373
   728
                       else
blanchet@39373
   729
                         Have (qs, l, negate_term t,
blanchet@39373
   730
                               ByMetis (backpatch_label patches l)))
blanchet@39373
   731
         | (contra_ls as _ :: _, co_ls) =>
blanchet@39373
   732
           let
blanchet@39373
   733
             val proofs =
blanchet@39373
   734
               map_filter
blanchet@39373
   735
                   (fn l =>
blanchet@39373
   736
                       if l = concl_l then
blanchet@39373
   737
                         NONE
blanchet@39373
   738
                       else
blanchet@39373
   739
                         let
blanchet@39373
   740
                           val drop_ls = filter (curry (op <>) l) contra_ls
blanchet@39373
   741
                         in
blanchet@39373
   742
                           second_pass []
blanchet@39373
   743
                               (proof, assums,
blanchet@39373
   744
                                patches ||> apfst (insert (op =) l)
blanchet@39373
   745
                                        ||> apsnd (union (op =) drop_ls))
blanchet@39373
   746
                           |> fst |> SOME
blanchet@39373
   747
                         end) contra_ls
blanchet@39373
   748
             val (assumes, facts) =
blanchet@39373
   749
               if member (op =) (fst (snd patches)) l then
blanchet@39373
   750
                 ([Assume (l, negate_term t)], (l :: co_ls, ss))
blanchet@39373
   751
               else
blanchet@39373
   752
                 ([], (co_ls, ss))
blanchet@39373
   753
           in
blanchet@39373
   754
             (case join_proofs proofs of
blanchet@39373
   755
                SOME (l, t, proofs, proof_tail) =>
blanchet@39373
   756
                Have (case_split_qualifiers proofs @
blanchet@39373
   757
                      (if null proof_tail then end_qs else []), l, t,
blanchet@39373
   758
                      smart_case_split proofs facts) :: proof_tail
blanchet@39373
   759
              | NONE =>
blanchet@39373
   760
                [Have (case_split_qualifiers proofs @ end_qs, no_label,
blanchet@39373
   761
                       concl_t, smart_case_split proofs facts)],
blanchet@39373
   762
              patches)
blanchet@39373
   763
             |>> append assumes
blanchet@39373
   764
           end
blanchet@39373
   765
         | _ => raise Fail "malformed proof")
blanchet@36402
   766
       | second_pass _ _ = raise Fail "malformed proof"
blanchet@36486
   767
    val proof_bottom =
blanchet@36486
   768
      second_pass [Show] (contra_proof, [], ([], ([], []))) |> fst
blanchet@36402
   769
  in proof_top @ proof_bottom end
blanchet@36402
   770
blanchet@38490
   771
(* FIXME: Still needed? Probably not. *)
blanchet@36402
   772
val kill_duplicate_assumptions_in_proof =
blanchet@36402
   773
  let
blanchet@36402
   774
    fun relabel_facts subst =
blanchet@36402
   775
      apfst (map (fn l => AList.lookup (op =) subst l |> the_default l))
blanchet@36491
   776
    fun do_step (step as Assume (l, t)) (proof, subst, assums) =
blanchet@36402
   777
        (case AList.lookup (op aconv) assums t of
blanchet@36967
   778
           SOME l' => (proof, (l, l') :: subst, assums)
blanchet@36491
   779
         | NONE => (step :: proof, subst, (t, l) :: assums))
blanchet@36402
   780
      | do_step (Have (qs, l, t, by)) (proof, subst, assums) =
blanchet@36402
   781
        (Have (qs, l, t,
blanchet@36402
   782
               case by of
blanchet@36564
   783
                 ByMetis facts => ByMetis (relabel_facts subst facts)
blanchet@36402
   784
               | CaseSplit (proofs, facts) =>
blanchet@36402
   785
                 CaseSplit (map do_proof proofs, relabel_facts subst facts)) ::
blanchet@36402
   786
         proof, subst, assums)
blanchet@36491
   787
      | do_step step (proof, subst, assums) = (step :: proof, subst, assums)
blanchet@36402
   788
    and do_proof proof = fold do_step proof ([], [], []) |> #1 |> rev
blanchet@36402
   789
  in do_proof end
blanchet@36402
   790
blanchet@36402
   791
val then_chain_proof =
blanchet@36402
   792
  let
blanchet@36402
   793
    fun aux _ [] = []
blanchet@36491
   794
      | aux _ ((step as Assume (l, _)) :: proof) = step :: aux l proof
blanchet@36402
   795
      | aux l' (Have (qs, l, t, by) :: proof) =
blanchet@36402
   796
        (case by of
blanchet@36564
   797
           ByMetis (ls, ss) =>
blanchet@36402
   798
           Have (if member (op =) ls l' then
blanchet@36402
   799
                   (Then :: qs, l, t,
blanchet@36564
   800
                    ByMetis (filter_out (curry (op =) l') ls, ss))
blanchet@36402
   801
                 else
blanchet@36564
   802
                   (qs, l, t, ByMetis (ls, ss)))
blanchet@36402
   803
         | CaseSplit (proofs, facts) =>
blanchet@36402
   804
           Have (qs, l, t, CaseSplit (map (aux no_label) proofs, facts))) ::
blanchet@36402
   805
        aux l proof
blanchet@36491
   806
      | aux _ (step :: proof) = step :: aux no_label proof
blanchet@36402
   807
  in aux no_label end
blanchet@36402
   808
blanchet@36402
   809
fun kill_useless_labels_in_proof proof =
blanchet@36402
   810
  let
blanchet@36556
   811
    val used_ls = used_labels_of proof
blanchet@36402
   812
    fun do_label l = if member (op =) used_ls l then l else no_label
blanchet@36556
   813
    fun do_step (Assume (l, t)) = Assume (do_label l, t)
blanchet@36556
   814
      | do_step (Have (qs, l, t, by)) =
blanchet@36402
   815
        Have (qs, do_label l, t,
blanchet@36402
   816
              case by of
blanchet@36402
   817
                CaseSplit (proofs, facts) =>
blanchet@36556
   818
                CaseSplit (map (map do_step) proofs, facts)
blanchet@36402
   819
              | _ => by)
blanchet@36556
   820
      | do_step step = step
blanchet@36556
   821
  in map do_step proof end
blanchet@36402
   822
blanchet@36402
   823
fun prefix_for_depth n = replicate_string (n + 1)
blanchet@36402
   824
blanchet@36402
   825
val relabel_proof =
blanchet@36402
   826
  let
blanchet@36402
   827
    fun aux _ _ _ [] = []
blanchet@36402
   828
      | aux subst depth (next_assum, next_fact) (Assume (l, t) :: proof) =
blanchet@36402
   829
        if l = no_label then
blanchet@36402
   830
          Assume (l, t) :: aux subst depth (next_assum, next_fact) proof
blanchet@36402
   831
        else
blanchet@36402
   832
          let val l' = (prefix_for_depth depth assum_prefix, next_assum) in
blanchet@36402
   833
            Assume (l', t) ::
blanchet@36402
   834
            aux ((l, l') :: subst) depth (next_assum + 1, next_fact) proof
blanchet@36402
   835
          end
blanchet@36402
   836
      | aux subst depth (next_assum, next_fact) (Have (qs, l, t, by) :: proof) =
blanchet@36402
   837
        let
blanchet@36402
   838
          val (l', subst, next_fact) =
blanchet@36402
   839
            if l = no_label then
blanchet@36402
   840
              (l, subst, next_fact)
blanchet@36402
   841
            else
blanchet@36402
   842
              let
blanchet@36402
   843
                val l' = (prefix_for_depth depth fact_prefix, next_fact)
blanchet@36402
   844
              in (l', (l, l') :: subst, next_fact + 1) end
blanchet@36570
   845
          val relabel_facts =
blanchet@39370
   846
            apfst (maps (the_list o AList.lookup (op =) subst))
blanchet@36402
   847
          val by =
blanchet@36402
   848
            case by of
blanchet@36564
   849
              ByMetis facts => ByMetis (relabel_facts facts)
blanchet@36402
   850
            | CaseSplit (proofs, facts) =>
blanchet@36402
   851
              CaseSplit (map (aux subst (depth + 1) (1, 1)) proofs,
blanchet@36402
   852
                         relabel_facts facts)
blanchet@36402
   853
        in
blanchet@36402
   854
          Have (qs, l', t, by) ::
blanchet@36402
   855
          aux subst depth (next_assum, next_fact) proof
blanchet@36402
   856
        end
blanchet@36491
   857
      | aux subst depth nextp (step :: proof) =
blanchet@36491
   858
        step :: aux subst depth nextp proof
blanchet@36402
   859
  in aux [] 0 (1, 1) end
blanchet@36402
   860
blanchet@41136
   861
fun string_for_proof ctxt0 type_sys i n =
blanchet@36402
   862
  let
wenzelm@39134
   863
    val ctxt = ctxt0
wenzelm@39134
   864
      |> Config.put show_free_types false
wenzelm@39134
   865
      |> Config.put show_types true
blanchet@37319
   866
    fun fix_print_mode f x =
wenzelm@39134
   867
      Print_Mode.setmp (filter (curry (op =) Symbol.xsymbolsN)
wenzelm@39134
   868
                               (print_mode_value ())) f x
blanchet@36402
   869
    fun do_indent ind = replicate_string (ind * indent_size) " "
blanchet@36478
   870
    fun do_free (s, T) =
blanchet@36478
   871
      maybe_quote s ^ " :: " ^
blanchet@36478
   872
      maybe_quote (fix_print_mode (Syntax.string_of_typ ctxt) T)
blanchet@36570
   873
    fun do_label l = if l = no_label then "" else string_for_label l ^ ": "
blanchet@36402
   874
    fun do_have qs =
blanchet@36402
   875
      (if member (op =) qs Moreover then "moreover " else "") ^
blanchet@36402
   876
      (if member (op =) qs Ultimately then "ultimately " else "") ^
blanchet@36402
   877
      (if member (op =) qs Then then
blanchet@36402
   878
         if member (op =) qs Show then "thus" else "hence"
blanchet@36402
   879
       else
blanchet@36402
   880
         if member (op =) qs Show then "show" else "have")
blanchet@36478
   881
    val do_term = maybe_quote o fix_print_mode (Syntax.string_of_term ctxt)
blanchet@36570
   882
    fun do_facts (ls, ss) =
blanchet@41136
   883
      metis_command type_sys 1 1
blanchet@38698
   884
                    (ls |> sort_distinct (prod_ord string_ord int_ord),
blanchet@38698
   885
                     ss |> sort_distinct string_ord)
blanchet@36478
   886
    and do_step ind (Fix xs) =
blanchet@36478
   887
        do_indent ind ^ "fix " ^ space_implode " and " (map do_free xs) ^ "\n"
blanchet@36486
   888
      | do_step ind (Let (t1, t2)) =
blanchet@36486
   889
        do_indent ind ^ "let " ^ do_term t1 ^ " = " ^ do_term t2 ^ "\n"
blanchet@36402
   890
      | do_step ind (Assume (l, t)) =
blanchet@36402
   891
        do_indent ind ^ "assume " ^ do_label l ^ do_term t ^ "\n"
blanchet@36564
   892
      | do_step ind (Have (qs, l, t, ByMetis facts)) =
blanchet@36402
   893
        do_indent ind ^ do_have qs ^ " " ^
blanchet@36479
   894
        do_label l ^ do_term t ^ " " ^ do_facts facts ^ "\n"
blanchet@36402
   895
      | do_step ind (Have (qs, l, t, CaseSplit (proofs, facts))) =
blanchet@36402
   896
        space_implode (do_indent ind ^ "moreover\n")
blanchet@36402
   897
                      (map (do_block ind) proofs) ^
blanchet@36479
   898
        do_indent ind ^ do_have qs ^ " " ^ do_label l ^ do_term t ^ " " ^
blanchet@36478
   899
        do_facts facts ^ "\n"
blanchet@36402
   900
    and do_steps prefix suffix ind steps =
blanchet@36402
   901
      let val s = implode (map (do_step ind) steps) in
blanchet@36402
   902
        replicate_string (ind * indent_size - size prefix) " " ^ prefix ^
blanchet@36402
   903
        String.extract (s, ind * indent_size,
blanchet@36402
   904
                        SOME (size s - ind * indent_size - 1)) ^
blanchet@36402
   905
        suffix ^ "\n"
blanchet@36402
   906
      end
blanchet@36402
   907
    and do_block ind proof = do_steps "{ " " }" (ind + 1) proof
blanchet@36564
   908
    (* One-step proofs are pointless; better use the Metis one-liner
blanchet@36564
   909
       directly. *)
blanchet@36564
   910
    and do_proof [Have (_, _, _, ByMetis _)] = ""
blanchet@36564
   911
      | do_proof proof =
blanchet@36480
   912
        (if i <> 1 then "prefer " ^ string_of_int i ^ "\n" else "") ^
blanchet@39452
   913
        do_indent 0 ^ "proof -\n" ^ do_steps "" "" 1 proof ^ do_indent 0 ^
blanchet@39452
   914
        (if n <> 1 then "next" else "qed")
blanchet@36488
   915
  in do_proof end
blanchet@36402
   916
blanchet@37479
   917
fun isar_proof_text (pool, debug, isar_shrink_factor, ctxt, conjecture_shape)
blanchet@41136
   918
                    (metis_params as (_, type_sys, _, tstplike_proof,
blanchet@40204
   919
                                      fact_names, goal, i)) =
blanchet@36402
   920
  let
blanchet@36909
   921
    val (params, hyp_ts, concl_t) = strip_subgoal goal i
blanchet@36909
   922
    val frees = fold Term.add_frees (concl_t :: hyp_ts) []
blanchet@36967
   923
    val tfrees = fold Term.add_tfrees (concl_t :: hyp_ts) []
blanchet@36402
   924
    val n = Logic.count_prems (prop_of goal)
blanchet@40723
   925
    val (one_line_proof, lemma_names) = metis_proof_text metis_params
blanchet@36283
   926
    fun isar_proof_for () =
blanchet@41136
   927
      case isar_proof_from_tstplike_proof pool ctxt type_sys tfrees
blanchet@40204
   928
               isar_shrink_factor tstplike_proof conjecture_shape fact_names
blanchet@39452
   929
               params frees
blanchet@39372
   930
           |> redirect_proof hyp_ts concl_t
blanchet@36402
   931
           |> kill_duplicate_assumptions_in_proof
blanchet@36402
   932
           |> then_chain_proof
blanchet@36402
   933
           |> kill_useless_labels_in_proof
blanchet@36402
   934
           |> relabel_proof
blanchet@41136
   935
           |> string_for_proof ctxt type_sys i n of
blanchet@38599
   936
        "" => "\nNo structured proof available."
blanchet@38599
   937
      | proof => "\n\nStructured proof:\n" ^ Markup.markup Markup.sendback proof
blanchet@35868
   938
    val isar_proof =
blanchet@36402
   939
      if debug then
blanchet@36283
   940
        isar_proof_for ()
blanchet@36283
   941
      else
blanchet@36283
   942
        try isar_proof_for ()
blanchet@38599
   943
        |> the_default "\nWarning: The Isar proof construction failed."
blanchet@36283
   944
  in (one_line_proof ^ isar_proof, lemma_names) end
paulson@21978
   945
blanchet@40723
   946
fun proof_text isar_proof isar_params metis_params =
blanchet@36557
   947
  (if isar_proof then isar_proof_text isar_params else metis_proof_text)
blanchet@40723
   948
      metis_params
blanchet@36223
   949
immler@31038
   950
end;