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