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