src/HOL/Tools/Sledgehammer/sledgehammer_fact.ML
author blanchet
Mon Jul 23 15:32:30 2012 +0200 (2012-07-23 ago)
changeset 48440 159e320ef851
parent 48438 3e45c98fe127
child 48530 d443166f9520
permissions -rw-r--r--
identified "evil" theories for MaSh -- this is rather ad hoc, but so is MaSh anyway
blanchet@48250
     1
(*  Title:      HOL/Tools/Sledgehammer/sledgehammer_fact.ML
blanchet@48250
     2
    Author:     Jia Meng, Cambridge University Computer Laboratory and NICTA
blanchet@48250
     3
    Author:     Jasmin Blanchette, TU Muenchen
blanchet@48250
     4
blanchet@48250
     5
Sledgehammer fact handling.
blanchet@48250
     6
*)
blanchet@48250
     7
blanchet@48250
     8
signature SLEDGEHAMMER_FACT =
blanchet@48250
     9
sig
blanchet@48250
    10
  type status = ATP_Problem_Generate.status
blanchet@48250
    11
  type stature = ATP_Problem_Generate.stature
blanchet@48250
    12
blanchet@48296
    13
  type fact = ((unit -> string) * stature) * thm
blanchet@48296
    14
blanchet@48292
    15
  type fact_override =
blanchet@48250
    16
    {add : (Facts.ref * Attrib.src list) list,
blanchet@48250
    17
     del : (Facts.ref * Attrib.src list) list,
blanchet@48250
    18
     only : bool}
blanchet@48250
    19
blanchet@48250
    20
  val ignore_no_atp : bool Config.T
blanchet@48250
    21
  val instantiate_inducts : bool Config.T
blanchet@48292
    22
  val no_fact_override : fact_override
blanchet@48250
    23
  val fact_from_ref :
blanchet@48250
    24
    Proof.context -> unit Symtab.table -> thm list -> status Termtab.table
blanchet@48250
    25
    -> Facts.ref * Attrib.src list -> ((string * stature) * thm) list
blanchet@48394
    26
  val backquote_thm : thm -> string
blanchet@48250
    27
  val clasimpset_rule_table_of : Proof.context -> status Termtab.table
blanchet@48250
    28
  val maybe_instantiate_inducts :
blanchet@48250
    29
    Proof.context -> term list -> term -> (((unit -> string) * 'a) * thm) list
blanchet@48250
    30
    -> (((unit -> string) * 'a) * thm) list
blanchet@48250
    31
  val maybe_filter_no_atps : Proof.context -> ('a * thm) list -> ('a * thm) list
blanchet@48394
    32
  val all_facts_of : Proof.context -> status Termtab.table -> fact list
blanchet@48250
    33
  val nearly_all_facts :
blanchet@48299
    34
    Proof.context -> bool -> fact_override -> unit Symtab.table
blanchet@48299
    35
    -> status Termtab.table -> thm list -> term list -> term -> fact list
blanchet@48250
    36
end;
blanchet@48250
    37
blanchet@48250
    38
structure Sledgehammer_Fact : SLEDGEHAMMER_FACT =
blanchet@48250
    39
struct
blanchet@48250
    40
blanchet@48250
    41
open ATP_Problem_Generate
blanchet@48250
    42
open Metis_Tactic
blanchet@48250
    43
open Sledgehammer_Util
blanchet@48250
    44
blanchet@48296
    45
type fact = ((unit -> string) * stature) * thm
blanchet@48296
    46
blanchet@48292
    47
type fact_override =
blanchet@48250
    48
  {add : (Facts.ref * Attrib.src list) list,
blanchet@48250
    49
   del : (Facts.ref * Attrib.src list) list,
blanchet@48250
    50
   only : bool}
blanchet@48250
    51
blanchet@48250
    52
(* experimental features *)
blanchet@48250
    53
val ignore_no_atp =
blanchet@48250
    54
  Attrib.setup_config_bool @{binding sledgehammer_ignore_no_atp} (K false)
blanchet@48250
    55
val instantiate_inducts =
blanchet@48250
    56
  Attrib.setup_config_bool @{binding sledgehammer_instantiate_inducts} (K false)
blanchet@48250
    57
blanchet@48292
    58
val no_fact_override = {add = [], del = [], only = false}
blanchet@48250
    59
blanchet@48250
    60
fun needs_quoting reserved s =
blanchet@48250
    61
  Symtab.defined reserved s orelse
blanchet@48250
    62
  exists (not o Lexicon.is_identifier) (Long_Name.explode s)
blanchet@48250
    63
blanchet@48250
    64
fun make_name reserved multi j name =
blanchet@48250
    65
  (name |> needs_quoting reserved name ? quote) ^
blanchet@48250
    66
  (if multi then "(" ^ string_of_int j ^ ")" else "")
blanchet@48250
    67
blanchet@48250
    68
fun explode_interval _ (Facts.FromTo (i, j)) = i upto j
blanchet@48250
    69
  | explode_interval max (Facts.From i) = i upto i + max - 1
blanchet@48250
    70
  | explode_interval _ (Facts.Single i) = [i]
blanchet@48250
    71
blanchet@48250
    72
val backquote =
blanchet@48250
    73
  raw_explode #> map (fn "`" => "\\`" | s => s) #> implode #> enclose "`" "`"
blanchet@48250
    74
blanchet@48250
    75
(* unfolding these can yield really huge terms *)
blanchet@48250
    76
val risky_defs = @{thms Bit0_def Bit1_def}
blanchet@48250
    77
blanchet@48250
    78
fun is_rec_eq lhs = Term.exists_subterm (curry (op =) (head_of lhs))
blanchet@48250
    79
fun is_rec_def (@{const Trueprop} $ t) = is_rec_def t
blanchet@48250
    80
  | is_rec_def (@{const ==>} $ _ $ t2) = is_rec_def t2
blanchet@48250
    81
  | is_rec_def (Const (@{const_name "=="}, _) $ t1 $ t2) = is_rec_eq t1 t2
blanchet@48250
    82
  | is_rec_def (Const (@{const_name HOL.eq}, _) $ t1 $ t2) = is_rec_eq t1 t2
blanchet@48250
    83
  | is_rec_def _ = false
blanchet@48250
    84
blanchet@48250
    85
fun is_assum assms th = exists (fn ct => prop_of th aconv term_of ct) assms
blanchet@48396
    86
fun is_chained chained = member Thm.eq_thm_prop chained
blanchet@48250
    87
blanchet@48396
    88
fun scope_of_thm global assms chained th =
blanchet@48396
    89
  if is_chained chained th then Chained
blanchet@48250
    90
  else if global then Global
blanchet@48250
    91
  else if is_assum assms th then Assum
blanchet@48250
    92
  else Local
blanchet@48250
    93
blanchet@48250
    94
val may_be_induction =
blanchet@48250
    95
  exists_subterm (fn Var (_, Type (@{type_name fun}, [_, T])) =>
blanchet@48250
    96
                     body_type T = @{typ bool}
blanchet@48250
    97
                   | _ => false)
blanchet@48250
    98
blanchet@48396
    99
fun status_of_thm css name th =
blanchet@48250
   100
  (* FIXME: use structured name *)
blanchet@48250
   101
  if (String.isSubstring ".induct" name orelse
blanchet@48250
   102
      String.isSubstring ".inducts" name) andalso
blanchet@48250
   103
     may_be_induction (prop_of th) then
blanchet@48250
   104
    Induction
blanchet@48396
   105
  else case Termtab.lookup css (prop_of th) of
blanchet@48250
   106
    SOME status => status
blanchet@48250
   107
  | NONE => General
blanchet@48250
   108
blanchet@48396
   109
fun stature_of_thm global assms chained css name th =
blanchet@48396
   110
  (scope_of_thm global assms chained th, status_of_thm css name th)
blanchet@48250
   111
blanchet@48396
   112
fun fact_from_ref ctxt reserved chained css (xthm as (xref, args)) =
blanchet@48250
   113
  let
blanchet@48250
   114
    val ths = Attrib.eval_thms ctxt [xthm]
blanchet@48250
   115
    val bracket =
blanchet@48250
   116
      map (enclose "[" "]" o Pretty.str_of o Args.pretty_src ctxt) args
blanchet@48250
   117
      |> implode
blanchet@48250
   118
    fun nth_name j =
blanchet@48250
   119
      case xref of
blanchet@48250
   120
        Facts.Fact s => backquote s ^ bracket
blanchet@48250
   121
      | Facts.Named (("", _), _) => "[" ^ bracket ^ "]"
blanchet@48250
   122
      | Facts.Named ((name, _), NONE) =>
blanchet@48250
   123
        make_name reserved (length ths > 1) (j + 1) name ^ bracket
blanchet@48250
   124
      | Facts.Named ((name, _), SOME intervals) =>
blanchet@48250
   125
        make_name reserved true
blanchet@48250
   126
                 (nth (maps (explode_interval (length ths)) intervals) j) name ^
blanchet@48250
   127
        bracket
blanchet@48396
   128
    fun add_nth th (j, rest) =
blanchet@48396
   129
      let val name = nth_name j in
blanchet@48396
   130
        (j + 1, ((name, stature_of_thm false [] chained css name th), th)
blanchet@48396
   131
                :: rest)
blanchet@48396
   132
      end
blanchet@48396
   133
  in (0, []) |> fold add_nth ths |> snd end
blanchet@48250
   134
blanchet@48250
   135
(* Reject theorems with names like "List.filter.filter_list_def" or
blanchet@48250
   136
  "Accessible_Part.acc.defs", as these are definitions arising from packages. *)
blanchet@48250
   137
fun is_package_def a =
blanchet@48250
   138
  let val names = Long_Name.explode a in
blanchet@48250
   139
    (length names > 2 andalso not (hd names = "local") andalso
blanchet@48250
   140
     String.isSuffix "_def" a) orelse String.isSuffix "_defs" a
blanchet@48250
   141
  end
blanchet@48250
   142
blanchet@48250
   143
(* FIXME: put other record thms here, or declare as "no_atp" *)
blanchet@48250
   144
fun multi_base_blacklist ctxt ho_atp =
blanchet@48250
   145
  ["defs", "select_defs", "update_defs", "split", "splits", "split_asm",
blanchet@48250
   146
   "cases", "ext_cases", "eq.simps", "eq.refl", "nchotomy", "case_cong",
blanchet@48440
   147
   "weak_case_cong", "nibble_pair_of_char_simps", "nibble.simps",
blanchet@48440
   148
   "nibble.distinct"]
blanchet@48250
   149
  |> not (ho_atp orelse (Config.get ctxt instantiate_inducts)) ?
blanchet@48250
   150
        append ["induct", "inducts"]
blanchet@48440
   151
  |> map (prefix Long_Name.separator)
blanchet@48250
   152
blanchet@48250
   153
val max_lambda_nesting = 3 (*only applies if not ho_atp*)
blanchet@48250
   154
blanchet@48250
   155
fun term_has_too_many_lambdas max (t1 $ t2) =
blanchet@48250
   156
    exists (term_has_too_many_lambdas max) [t1, t2]
blanchet@48250
   157
  | term_has_too_many_lambdas max (Abs (_, _, t)) =
blanchet@48250
   158
    max = 0 orelse term_has_too_many_lambdas (max - 1) t
blanchet@48250
   159
  | term_has_too_many_lambdas _ _ = false
blanchet@48250
   160
blanchet@48250
   161
(* Don't count nested lambdas at the level of formulas, since they are
blanchet@48250
   162
   quantifiers. *)
blanchet@48437
   163
fun formula_has_too_many_lambdas Ts (Abs (_, T, t)) =
blanchet@48437
   164
    formula_has_too_many_lambdas (T :: Ts) t
blanchet@48437
   165
  | formula_has_too_many_lambdas Ts t =
blanchet@48250
   166
    if member (op =) [HOLogic.boolT, propT] (fastype_of1 (Ts, t)) then
blanchet@48437
   167
      exists (formula_has_too_many_lambdas Ts) (#2 (strip_comb t))
blanchet@48250
   168
    else
blanchet@48250
   169
      term_has_too_many_lambdas max_lambda_nesting t
blanchet@48250
   170
blanchet@48250
   171
(* The max apply depth of any "metis" call in "Metis_Examples" (on 2007-10-31)
blanchet@48250
   172
   was 11. *)
blanchet@48250
   173
val max_apply_depth = 15
blanchet@48250
   174
blanchet@48250
   175
fun apply_depth (f $ t) = Int.max (apply_depth f, apply_depth t + 1)
blanchet@48250
   176
  | apply_depth (Abs (_, _, t)) = apply_depth t
blanchet@48250
   177
  | apply_depth _ = 0
blanchet@48250
   178
blanchet@48250
   179
fun is_formula_too_complex ho_atp t =
blanchet@48437
   180
  apply_depth t > max_apply_depth orelse
blanchet@48437
   181
  (not ho_atp andalso formula_has_too_many_lambdas [] t)
blanchet@48250
   182
blanchet@48440
   183
(* These theories contain auxiliary facts that could positively confuse
blanchet@48440
   184
   Sledgehammer if they were included. *)
blanchet@48440
   185
val sledgehammer_prefixes =
blanchet@48440
   186
  ["ATP", "Meson", "Metis", "Sledgehammer"] |> map (suffix Long_Name.separator)
blanchet@48440
   187
blanchet@48250
   188
val exists_sledgehammer_const =
blanchet@48438
   189
  exists_Const (fn (s, _) =>
blanchet@48438
   190
      exists (fn pref => String.isPrefix pref s) sledgehammer_prefixes)
blanchet@48250
   191
blanchet@48250
   192
(* FIXME: make more reliable *)
blanchet@48250
   193
val exists_low_level_class_const =
blanchet@48250
   194
  exists_Const (fn (s, _) =>
blanchet@48250
   195
     s = @{const_name equal_class.equal} orelse
blanchet@48250
   196
     String.isSubstring (Long_Name.separator ^ "class" ^ Long_Name.separator) s)
blanchet@48250
   197
blanchet@48250
   198
fun is_that_fact th =
blanchet@48250
   199
  String.isSuffix (Long_Name.separator ^ Obtain.thatN) (Thm.get_name_hint th)
blanchet@48250
   200
  andalso exists_subterm (fn Free (s, _) => s = Name.skolem Auto_Bind.thesisN
blanchet@48250
   201
                           | _ => false) (prop_of th)
blanchet@48250
   202
blanchet@48406
   203
fun is_likely_tautology_or_too_meta th =
blanchet@48406
   204
  let
blanchet@48406
   205
    val is_boring_const = member (op =) atp_widely_irrelevant_consts
blanchet@48406
   206
    fun is_boring_bool t =
blanchet@48406
   207
      not (exists_Const (not o is_boring_const o fst) t) orelse
blanchet@48406
   208
      exists_type (exists_subtype (curry (op =) @{typ prop})) t
blanchet@48406
   209
    fun is_boring_prop (@{const Trueprop} $ t) = is_boring_bool t
blanchet@48406
   210
      | is_boring_prop (@{const "==>"} $ t $ u) =
blanchet@48406
   211
        is_boring_prop t andalso is_boring_prop u
blanchet@48406
   212
      | is_boring_prop (Const (@{const_name all}, _) $ (Abs (_, _, t)) $ u) =
blanchet@48406
   213
        is_boring_prop t andalso is_boring_prop u
blanchet@48406
   214
      | is_boring_prop (Const (@{const_name "=="}, _) $ t $ u) =
blanchet@48406
   215
        is_boring_bool t andalso is_boring_bool u
blanchet@48406
   216
      | is_boring_prop _ = true
blanchet@48406
   217
  in
blanchet@48406
   218
    is_boring_prop (prop_of th) andalso not (Thm.eq_thm_prop (@{thm ext}, th))
blanchet@48406
   219
  end
blanchet@48406
   220
blanchet@48438
   221
fun is_theorem_bad_for_atps ho_atp th =
blanchet@48438
   222
  is_likely_tautology_or_too_meta th orelse
blanchet@48438
   223
  let val t = prop_of th in
blanchet@48438
   224
    is_formula_too_complex ho_atp t orelse
blanchet@48438
   225
    exists_type type_has_top_sort t orelse
blanchet@48438
   226
    exists_sledgehammer_const t orelse exists_low_level_class_const t orelse
blanchet@48438
   227
    is_that_fact th
blanchet@48438
   228
  end
blanchet@48438
   229
blanchet@48394
   230
fun hackish_string_for_term thy t =
blanchet@48250
   231
  Print_Mode.setmp (filter (curry (op =) Symbol.xsymbolsN)
blanchet@48394
   232
                   (print_mode_value ())) (Syntax.string_of_term_global thy) t
blanchet@48250
   233
  |> String.translate (fn c => if Char.isPrint c then str c else "")
blanchet@48250
   234
  |> simplify_spaces
blanchet@48250
   235
blanchet@48250
   236
(* This is a terrible hack. Free variables are sometimes coded as "M__" when
blanchet@48250
   237
   they are displayed as "M" and we want to avoid clashes with these. But
blanchet@48250
   238
   sometimes it's even worse: "Ma__" encodes "M". So we simply reserve all
blanchet@48250
   239
   prefixes of all free variables. In the worse case scenario, where the fact
blanchet@48250
   240
   won't be resolved correctly, the user can fix it manually, e.g., by naming
blanchet@48250
   241
   the fact in question. Ideally we would need nothing of it, but backticks
blanchet@48250
   242
   simply don't work with schematic variables. *)
blanchet@48250
   243
fun all_prefixes_of s =
blanchet@48250
   244
  map (fn i => String.extract (s, 0, SOME i)) (1 upto size s - 1)
blanchet@48250
   245
blanchet@48250
   246
fun close_form t =
blanchet@48250
   247
  (t, [] |> Term.add_free_names t |> maps all_prefixes_of)
blanchet@48250
   248
  |> fold (fn ((s, i), T) => fn (t', taken) =>
blanchet@48250
   249
              let val s' = singleton (Name.variant_list taken) s in
blanchet@48250
   250
                ((if fastype_of t' = HOLogic.boolT then HOLogic.all_const
blanchet@48250
   251
                  else Logic.all_const) T
blanchet@48250
   252
                 $ Abs (s', T, abstract_over (Var ((s, i), T), t')),
blanchet@48250
   253
                 s' :: taken)
blanchet@48250
   254
              end)
blanchet@48250
   255
          (Term.add_vars t [] |> sort_wrt (fst o fst))
blanchet@48250
   256
  |> fst
blanchet@48250
   257
blanchet@48400
   258
fun backquote_term thy t =
blanchet@48400
   259
  t |> close_form
blanchet@48400
   260
    |> hackish_string_for_term thy
blanchet@48400
   261
    |> backquote
blanchet@48400
   262
blanchet@48400
   263
fun backquote_thm th = backquote_term (theory_of_thm th) (prop_of th)
blanchet@48394
   264
blanchet@48250
   265
fun clasimpset_rule_table_of ctxt =
blanchet@48250
   266
  let
blanchet@48250
   267
    val thy = Proof_Context.theory_of ctxt
blanchet@48250
   268
    val atomize = HOLogic.mk_Trueprop o Object_Logic.atomize_term thy
blanchet@48250
   269
    fun add stature normalizers get_th =
blanchet@48250
   270
      fold (fn rule =>
blanchet@48250
   271
               let
blanchet@48250
   272
                 val th = rule |> get_th
blanchet@48250
   273
                 val t =
blanchet@48250
   274
                   th |> Thm.maxidx_of th > 0 ? zero_var_indexes |> prop_of
blanchet@48250
   275
               in
blanchet@48250
   276
                 fold (fn normalize => Termtab.update (normalize t, stature))
blanchet@48250
   277
                      (I :: normalizers)
blanchet@48250
   278
               end)
blanchet@48250
   279
    val {safeIs, (* safeEs, *) hazIs, (* hazEs, *) ...} =
blanchet@48250
   280
      ctxt |> claset_of |> Classical.rep_cs
blanchet@48250
   281
    val intros = Item_Net.content safeIs @ Item_Net.content hazIs
blanchet@48250
   282
(* Add once it is used:
blanchet@48250
   283
    val elims =
blanchet@48250
   284
      Item_Net.content safeEs @ Item_Net.content hazEs
blanchet@48250
   285
      |> map Classical.classical_rule
blanchet@48250
   286
*)
blanchet@48250
   287
    val simps = ctxt |> simpset_of |> dest_ss |> #simps
blanchet@48250
   288
    val specs = ctxt |> Spec_Rules.get
blanchet@48250
   289
    val (rec_defs, nonrec_defs) =
blanchet@48250
   290
      specs |> filter (curry (op =) Spec_Rules.Equational o fst)
blanchet@48250
   291
            |> maps (snd o snd)
blanchet@48250
   292
            |> filter_out (member Thm.eq_thm_prop risky_defs)
blanchet@48250
   293
            |> List.partition (is_rec_def o prop_of)
blanchet@48250
   294
    val spec_intros =
blanchet@48250
   295
      specs |> filter (member (op =) [Spec_Rules.Inductive,
blanchet@48250
   296
                                      Spec_Rules.Co_Inductive] o fst)
blanchet@48250
   297
            |> maps (snd o snd)
blanchet@48250
   298
  in
blanchet@48250
   299
    Termtab.empty |> add Simp [atomize] snd simps
blanchet@48438
   300
                  |> add Rec_Def [] I rec_defs
blanchet@48438
   301
                  |> add Non_Rec_Def [] I nonrec_defs
blanchet@48250
   302
(* Add once it is used:
blanchet@48250
   303
                  |> add Elim [] I elims
blanchet@48250
   304
*)
blanchet@48250
   305
                  |> add Intro [] I intros
blanchet@48250
   306
                  |> add Inductive [] I spec_intros
blanchet@48250
   307
  end
blanchet@48250
   308
blanchet@48250
   309
fun uniquify xs =
blanchet@48250
   310
  Termtab.fold (cons o snd)
blanchet@48250
   311
               (fold (Termtab.update o `(prop_of o snd)) xs Termtab.empty) []
blanchet@48250
   312
blanchet@48250
   313
fun struct_induct_rule_on th =
blanchet@48250
   314
  case Logic.strip_horn (prop_of th) of
blanchet@48250
   315
    (prems, @{const Trueprop}
blanchet@48250
   316
            $ ((p as Var ((p_name, 0), _)) $ (a as Var (_, ind_T)))) =>
blanchet@48250
   317
    if not (is_TVar ind_T) andalso length prems > 1 andalso
blanchet@48250
   318
       exists (exists_subterm (curry (op aconv) p)) prems andalso
blanchet@48250
   319
       not (exists (exists_subterm (curry (op aconv) a)) prems) then
blanchet@48250
   320
      SOME (p_name, ind_T)
blanchet@48250
   321
    else
blanchet@48250
   322
      NONE
blanchet@48250
   323
  | _ => NONE
blanchet@48250
   324
blanchet@48250
   325
fun instantiate_induct_rule ctxt concl_prop p_name ((name, stature), th) ind_x =
blanchet@48250
   326
  let
blanchet@48394
   327
    val thy = Proof_Context.theory_of ctxt
blanchet@48250
   328
    fun varify_noninducts (t as Free (s, T)) =
blanchet@48250
   329
        if (s, T) = ind_x orelse can dest_funT T then t else Var ((s, 0), T)
blanchet@48250
   330
      | varify_noninducts t = t
blanchet@48250
   331
    val p_inst =
blanchet@48250
   332
      concl_prop |> map_aterms varify_noninducts |> close_form
blanchet@48250
   333
                 |> lambda (Free ind_x)
blanchet@48394
   334
                 |> hackish_string_for_term thy
blanchet@48250
   335
  in
blanchet@48250
   336
    ((fn () => name () ^ "[where " ^ p_name ^ " = " ^ quote p_inst ^ "]",
blanchet@48250
   337
      stature), th |> read_instantiate ctxt [((p_name, 0), p_inst)])
blanchet@48250
   338
  end
blanchet@48250
   339
blanchet@48250
   340
fun type_match thy (T1, T2) =
blanchet@48250
   341
  (Sign.typ_match thy (T2, T1) Vartab.empty; true)
blanchet@48250
   342
  handle Type.TYPE_MATCH => false
blanchet@48250
   343
blanchet@48250
   344
fun instantiate_if_induct_rule ctxt stmt stmt_xs (ax as (_, th)) =
blanchet@48250
   345
  case struct_induct_rule_on th of
blanchet@48250
   346
    SOME (p_name, ind_T) =>
blanchet@48250
   347
    let val thy = Proof_Context.theory_of ctxt in
blanchet@48250
   348
      stmt_xs |> filter (fn (_, T) => type_match thy (T, ind_T))
blanchet@48250
   349
              |> map_filter (try (instantiate_induct_rule ctxt stmt p_name ax))
blanchet@48250
   350
    end
blanchet@48250
   351
  | NONE => [ax]
blanchet@48250
   352
blanchet@48250
   353
fun external_frees t =
blanchet@48250
   354
  [] |> Term.add_frees t |> filter_out (can Name.dest_internal o fst)
blanchet@48250
   355
blanchet@48250
   356
fun maybe_instantiate_inducts ctxt hyp_ts concl_t =
blanchet@48250
   357
  if Config.get ctxt instantiate_inducts then
blanchet@48250
   358
    let
blanchet@48250
   359
      val thy = Proof_Context.theory_of ctxt
blanchet@48250
   360
      val ind_stmt =
blanchet@48250
   361
        (hyp_ts |> filter_out (null o external_frees), concl_t)
blanchet@48250
   362
        |> Logic.list_implies |> Object_Logic.atomize_term thy
blanchet@48250
   363
      val ind_stmt_xs = external_frees ind_stmt
blanchet@48250
   364
    in maps (instantiate_if_induct_rule ctxt ind_stmt ind_stmt_xs) end
blanchet@48250
   365
  else
blanchet@48250
   366
    I
blanchet@48250
   367
blanchet@48250
   368
fun maybe_filter_no_atps ctxt =
blanchet@48250
   369
  not (Config.get ctxt ignore_no_atp) ? filter_out (No_ATPs.member ctxt o snd)
blanchet@48250
   370
blanchet@48396
   371
fun all_facts ctxt ho_atp reserved add_ths chained css =
blanchet@48251
   372
  let
blanchet@48251
   373
    val thy = Proof_Context.theory_of ctxt
blanchet@48251
   374
    val global_facts = Global_Theory.facts_of thy
blanchet@48251
   375
    val local_facts = Proof_Context.facts_of ctxt
blanchet@48251
   376
    val named_locals = local_facts |> Facts.dest_static []
blanchet@48251
   377
    val assms = Assumption.all_assms_of ctxt
blanchet@48251
   378
    fun is_good_unnamed_local th =
blanchet@48251
   379
      not (Thm.has_name_hint th) andalso
blanchet@48251
   380
      forall (fn (_, ths) => not (member Thm.eq_thm_prop ths th)) named_locals
blanchet@48251
   381
    val unnamed_locals =
blanchet@48396
   382
      union Thm.eq_thm_prop (Facts.props local_facts) chained
blanchet@48251
   383
      |> filter is_good_unnamed_local |> map (pair "" o single)
blanchet@48251
   384
    val full_space =
blanchet@48251
   385
      Name_Space.merge (Facts.space_of global_facts, Facts.space_of local_facts)
blanchet@48251
   386
    fun add_facts global foldx facts =
blanchet@48251
   387
      foldx (fn (name0, ths) =>
blanchet@48327
   388
        if name0 <> "" andalso
blanchet@48251
   389
           forall (not o member Thm.eq_thm_prop add_ths) ths andalso
blanchet@48251
   390
           (Facts.is_concealed facts name0 orelse
blanchet@48327
   391
            not (can (Proof_Context.get_thms ctxt) name0) orelse
blanchet@48251
   392
            (not (Config.get ctxt ignore_no_atp) andalso
blanchet@48251
   393
             is_package_def name0) orelse
blanchet@48251
   394
            exists (fn s => String.isSuffix s name0)
blanchet@48251
   395
                   (multi_base_blacklist ctxt ho_atp)) then
blanchet@48251
   396
          I
blanchet@48251
   397
        else
blanchet@48251
   398
          let
blanchet@48251
   399
            val multi = length ths > 1
blanchet@48251
   400
            fun check_thms a =
blanchet@48251
   401
              case try (Proof_Context.get_thms ctxt) a of
blanchet@48251
   402
                NONE => false
blanchet@48251
   403
              | SOME ths' => eq_list Thm.eq_thm_prop (ths, ths')
blanchet@48251
   404
          in
blanchet@48251
   405
            pair 1
blanchet@48251
   406
            #> fold (fn th => fn (j, (multis, unis)) =>
blanchet@48251
   407
                        (j + 1,
blanchet@48251
   408
                         if not (member Thm.eq_thm_prop add_ths th) andalso
blanchet@48327
   409
                            is_theorem_bad_for_atps ho_atp th then
blanchet@48251
   410
                           (multis, unis)
blanchet@48251
   411
                         else
blanchet@48251
   412
                           let
blanchet@48251
   413
                             val new =
blanchet@48251
   414
                               (((fn () =>
blanchet@48327
   415
                                     if name0 = "" then
blanchet@48394
   416
                                       backquote_thm th
blanchet@48327
   417
                                     else
blanchet@48327
   418
                                       [Facts.extern ctxt facts name0,
blanchet@48327
   419
                                        Name_Space.extern ctxt full_space name0]
blanchet@48327
   420
                                       |> find_first check_thms
blanchet@48327
   421
                                       |> the_default name0
blanchet@48327
   422
                                       |> make_name reserved multi j),
blanchet@48396
   423
                                  stature_of_thm global assms chained css name0
blanchet@48396
   424
                                                 th), th)
blanchet@48251
   425
                           in
blanchet@48251
   426
                             if multi then (new :: multis, unis)
blanchet@48251
   427
                             else (multis, new :: unis)
blanchet@48251
   428
                           end)) ths
blanchet@48251
   429
            #> snd
blanchet@48251
   430
          end)
blanchet@48251
   431
  in
blanchet@48251
   432
    (* The single-name theorems go after the multiple-name ones, so that single
blanchet@48251
   433
       names are preferred when both are available. *)
blanchet@48251
   434
    ([], []) |> add_facts false fold local_facts (unnamed_locals @ named_locals)
blanchet@48251
   435
             |> add_facts true Facts.fold_static global_facts global_facts
blanchet@48251
   436
             |> op @
blanchet@48251
   437
  end
blanchet@48251
   438
blanchet@48396
   439
fun all_facts_of ctxt css =
blanchet@48396
   440
  all_facts ctxt false Symtab.empty [] [] css
blanchet@48396
   441
  |> rev (* partly restore the original order of facts, for MaSh *)
blanchet@48251
   442
blanchet@48396
   443
fun nearly_all_facts ctxt ho_atp {add, del, only} reserved css chained hyp_ts
blanchet@48396
   444
                     concl_t =
blanchet@48250
   445
  if only andalso null add then
blanchet@48250
   446
    []
blanchet@48250
   447
  else
blanchet@48250
   448
    let
blanchet@48396
   449
      val chained =
blanchet@48396
   450
        chained
blanchet@48292
   451
        |> maps (fn th => insert Thm.eq_thm_prop (zero_var_indexes th) [th])
blanchet@48250
   452
    in
blanchet@48250
   453
      (if only then
blanchet@48250
   454
         maps (map (fn ((name, stature), th) => ((K name, stature), th))
blanchet@48396
   455
               o fact_from_ref ctxt reserved chained css) add
blanchet@48250
   456
       else
blanchet@48292
   457
         let val (add, del) = pairself (Attrib.eval_thms ctxt) (add, del) in
blanchet@48396
   458
           all_facts ctxt ho_atp reserved add chained css
blanchet@48292
   459
           |> filter_out (member Thm.eq_thm_prop del o snd)
blanchet@48292
   460
           |> maybe_filter_no_atps ctxt
blanchet@48332
   461
           |> uniquify
blanchet@48292
   462
         end)
blanchet@48250
   463
      |> maybe_instantiate_inducts ctxt hyp_ts concl_t
blanchet@48250
   464
    end
blanchet@48250
   465
blanchet@48250
   466
end;