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