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