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