src/HOL/Tools/Sledgehammer/sledgehammer_filter.ML
author blanchet
Mon Jan 23 17:40:32 2012 +0100 (2012-01-23 ago)
changeset 46320 0b8b73b49848
parent 46217 7b19666f0e3d
child 46340 cac402c486b0
permissions -rw-r--r--
renamed two files to make room for a new file
blanchet@38988
     1
(*  Title:      HOL/Tools/Sledgehammer/sledgehammer_filter.ML
blanchet@38027
     2
    Author:     Jia Meng, Cambridge University Computer Laboratory and NICTA
blanchet@36393
     3
    Author:     Jasmin Blanchette, TU Muenchen
blanchet@39958
     4
blanchet@39958
     5
Sledgehammer's relevance filter.
wenzelm@33309
     6
*)
paulson@15452
     7
blanchet@38988
     8
signature SLEDGEHAMMER_FILTER =
wenzelm@16802
     9
sig
blanchet@46320
    10
  type locality = ATP_Problem_Generate.locality
blanchet@38752
    11
blanchet@40070
    12
  type relevance_fudge =
blanchet@42738
    13
    {local_const_multiplier : real,
blanchet@41159
    14
     worse_irrel_freq : real,
blanchet@40070
    15
     higher_order_irrel_weight : real,
blanchet@40070
    16
     abs_rel_weight : real,
blanchet@40070
    17
     abs_irrel_weight : real,
blanchet@40070
    18
     skolem_irrel_weight : real,
blanchet@40070
    19
     theory_const_rel_weight : real,
blanchet@40070
    20
     theory_const_irrel_weight : real,
blanchet@42735
    21
     chained_const_irrel_weight : real,
blanchet@40070
    22
     intro_bonus : real,
blanchet@40070
    23
     elim_bonus : real,
blanchet@40070
    24
     simp_bonus : real,
blanchet@40070
    25
     local_bonus : real,
blanchet@40070
    26
     assum_bonus : real,
blanchet@40070
    27
     chained_bonus : real,
blanchet@40070
    28
     max_imperfect : real,
blanchet@40070
    29
     max_imperfect_exp : real,
blanchet@40070
    30
     threshold_divisor : real,
blanchet@40070
    31
     ridiculous_threshold : real}
blanchet@40070
    32
blanchet@35966
    33
  type relevance_override =
blanchet@40070
    34
    {add : (Facts.ref * Attrib.src list) list,
blanchet@40070
    35
     del : (Facts.ref * Attrib.src list) list,
blanchet@40070
    36
     only : bool}
blanchet@35966
    37
blanchet@42646
    38
  val trace : bool Config.T
blanchet@42728
    39
  val ignore_no_atp : bool Config.T
blanchet@42728
    40
  val instantiate_inducts : bool Config.T
blanchet@44462
    41
  val no_relevance_override : relevance_override
blanchet@43351
    42
  val const_names_in_fact :
blanchet@43351
    43
    theory -> (string * typ -> term list -> bool * term list) -> term
blanchet@43351
    44
    -> string list
blanchet@40205
    45
  val fact_from_ref :
blanchet@38996
    46
    Proof.context -> unit Symtab.table -> thm list
blanchet@38996
    47
    -> Facts.ref * Attrib.src list -> ((string * locality) * thm) list
blanchet@41767
    48
  val all_facts :
nik@44585
    49
    Proof.context -> bool -> 'a Symtab.table -> bool -> thm list -> thm list
blanchet@43351
    50
    -> (((unit -> string) * locality) * thm) list
blanchet@43351
    51
  val nearly_all_facts :
nik@44585
    52
    Proof.context -> bool -> relevance_override -> thm list -> term list -> term
blanchet@43351
    53
    -> (((unit -> string) * locality) * thm) list
blanchet@37347
    54
  val relevant_facts :
blanchet@44625
    55
    Proof.context -> real * real -> int
blanchet@41336
    56
    -> (string * typ -> term list -> bool * term list) -> relevance_fudge
blanchet@41066
    57
    -> relevance_override -> thm list -> term list -> term
blanchet@43351
    58
    -> (((unit -> string) * locality) * thm) list
blanchet@40070
    59
    -> ((string * locality) * thm) list
paulson@15347
    60
end;
paulson@15347
    61
blanchet@38988
    62
structure Sledgehammer_Filter : SLEDGEHAMMER_FILTER =
paulson@15347
    63
struct
paulson@15347
    64
blanchet@46320
    65
open ATP_Problem_Generate
blanchet@44934
    66
open Metis_Tactic
blanchet@38652
    67
open Sledgehammer_Util
blanchet@38652
    68
blanchet@42646
    69
val trace =
blanchet@42646
    70
  Attrib.setup_config_bool @{binding sledgehammer_filter_trace} (K false)
blanchet@42646
    71
fun trace_msg ctxt msg = if Config.get ctxt trace then tracing (msg ()) else ()
blanchet@35826
    72
blanchet@41273
    73
(* experimental features *)
blanchet@42728
    74
val ignore_no_atp =
blanchet@42728
    75
  Attrib.setup_config_bool @{binding sledgehammer_ignore_no_atp} (K false)
blanchet@42728
    76
val instantiate_inducts =
blanchet@42728
    77
  Attrib.setup_config_bool @{binding sledgehammer_instantiate_inducts} (K false)
blanchet@38827
    78
blanchet@40070
    79
type relevance_fudge =
blanchet@42738
    80
  {local_const_multiplier : real,
blanchet@41159
    81
   worse_irrel_freq : real,
blanchet@40070
    82
   higher_order_irrel_weight : real,
blanchet@40070
    83
   abs_rel_weight : real,
blanchet@40070
    84
   abs_irrel_weight : real,
blanchet@40070
    85
   skolem_irrel_weight : real,
blanchet@40070
    86
   theory_const_rel_weight : real,
blanchet@40070
    87
   theory_const_irrel_weight : real,
blanchet@42735
    88
   chained_const_irrel_weight : real,
blanchet@40070
    89
   intro_bonus : real,
blanchet@40070
    90
   elim_bonus : real,
blanchet@40070
    91
   simp_bonus : real,
blanchet@40070
    92
   local_bonus : real,
blanchet@40070
    93
   assum_bonus : real,
blanchet@40070
    94
   chained_bonus : real,
blanchet@40070
    95
   max_imperfect : real,
blanchet@40070
    96
   max_imperfect_exp : real,
blanchet@40070
    97
   threshold_divisor : real,
blanchet@40070
    98
   ridiculous_threshold : real}
blanchet@40070
    99
blanchet@35966
   100
type relevance_override =
blanchet@40070
   101
  {add : (Facts.ref * Attrib.src list) list,
blanchet@40070
   102
   del : (Facts.ref * Attrib.src list) list,
blanchet@40070
   103
   only : bool}
paulson@21070
   104
blanchet@44462
   105
val no_relevance_override = {add = [], del = [], only = false}
blanchet@44462
   106
blanchet@37616
   107
val sledgehammer_prefix = "Sledgehammer" ^ Long_Name.separator
blanchet@39896
   108
val abs_name = sledgehammer_prefix ^ "abs"
blanchet@39896
   109
val skolem_prefix = sledgehammer_prefix ^ "sko"
blanchet@38992
   110
val theory_const_suffix = Long_Name.separator ^ " 1"
blanchet@37616
   111
blanchet@40227
   112
fun needs_quoting reserved s =
blanchet@40375
   113
  Symtab.defined reserved s orelse
wenzelm@42290
   114
  exists (not o Lexicon.is_identifier) (Long_Name.explode s)
blanchet@40227
   115
blanchet@40375
   116
fun make_name reserved multi j name =
blanchet@40227
   117
  (name |> needs_quoting reserved name ? quote) ^
wenzelm@41491
   118
  (if multi then "(" ^ string_of_int j ^ ")" else "")
blanchet@38744
   119
blanchet@40375
   120
fun explode_interval _ (Facts.FromTo (i, j)) = i upto j
blanchet@40375
   121
  | explode_interval max (Facts.From i) = i upto i + max - 1
blanchet@40375
   122
  | explode_interval _ (Facts.Single i) = [i]
blanchet@40375
   123
blanchet@41279
   124
val backquote =
blanchet@41279
   125
  raw_explode #> map (fn "`" => "\\`" | s => s) #> implode #> enclose "`" "`"
blanchet@40205
   126
fun fact_from_ref ctxt reserved chained_ths (xthm as (xref, args)) =
blanchet@38744
   127
  let
blanchet@38996
   128
    val ths = Attrib.eval_thms ctxt [xthm]
blanchet@38996
   129
    val bracket =
blanchet@41999
   130
      map (enclose "[" "]" o Pretty.str_of o Args.pretty_src ctxt) args
blanchet@41999
   131
      |> implode
blanchet@40375
   132
    fun nth_name j =
blanchet@38996
   133
      case xref of
blanchet@41279
   134
        Facts.Fact s => backquote s ^ bracket
blanchet@38996
   135
      | Facts.Named (("", _), _) => "[" ^ bracket ^ "]"
blanchet@40375
   136
      | Facts.Named ((name, _), NONE) =>
blanchet@40375
   137
        make_name reserved (length ths > 1) (j + 1) name ^ bracket
blanchet@40375
   138
      | Facts.Named ((name, _), SOME intervals) =>
blanchet@40375
   139
        make_name reserved true
blanchet@40375
   140
                 (nth (maps (explode_interval (length ths)) intervals) j) name ^
blanchet@40375
   141
        bracket
blanchet@38744
   142
  in
blanchet@40375
   143
    (ths, (0, []))
blanchet@38752
   144
    |-> fold (fn th => fn (j, rest) =>
blanchet@43421
   145
                 (j + 1,
blanchet@43421
   146
                  ((nth_name j,
blanchet@43421
   147
                    if member Thm.eq_thm_prop chained_ths th then Chained
blanchet@43421
   148
                    else General), th) :: rest))
blanchet@38744
   149
    |> snd
blanchet@38699
   150
  end
blanchet@37616
   151
blanchet@45034
   152
(* This is a terrible hack. Free variables are sometimes coded as "M__" when
blanchet@45034
   153
   they are displayed as "M" and we want to avoid clashes with these. But
blanchet@45034
   154
   sometimes it's even worse: "Ma__" encodes "M". So we simply reserve all
blanchet@45034
   155
   prefixes of all free variables. In the worse case scenario, where the fact
blanchet@45034
   156
   won't be resolved correctly, the user can fix it manually, e.g., by naming
blanchet@45034
   157
   the fact in question. Ideally we would need nothing of it, but backticks
blanchet@45034
   158
   simply don't work with schematic variables. *)
blanchet@41199
   159
fun all_prefixes_of s =
blanchet@41199
   160
  map (fn i => String.extract (s, 0, SOME i)) (1 upto size s - 1)
blanchet@41199
   161
fun close_form t =
blanchet@41199
   162
  (t, [] |> Term.add_free_names t |> maps all_prefixes_of)
blanchet@41199
   163
  |> fold (fn ((s, i), T) => fn (t', taken) =>
wenzelm@43324
   164
              let val s' = singleton (Name.variant_list taken) s in
blanchet@41199
   165
                ((if fastype_of t' = HOLogic.boolT then HOLogic.all_const
wenzelm@46217
   166
                  else Logic.all_const) T
blanchet@41199
   167
                 $ Abs (s', T, abstract_over (Var ((s, i), T), t')),
blanchet@41199
   168
                 s' :: taken)
blanchet@41199
   169
              end)
blanchet@41199
   170
          (Term.add_vars t [] |> sort_wrt (fst o fst))
blanchet@41199
   171
  |> fst
blanchet@41199
   172
blanchet@41199
   173
fun string_for_term ctxt t =
blanchet@41199
   174
  Print_Mode.setmp (filter (curry (op =) Symbol.xsymbolsN)
blanchet@41199
   175
                   (print_mode_value ())) (Syntax.string_of_term ctxt) t
blanchet@41199
   176
  |> String.translate (fn c => if Char.isPrint c then str c else "")
blanchet@41199
   177
  |> simplify_spaces
blanchet@41199
   178
blanchet@41199
   179
(** Structural induction rules **)
blanchet@41199
   180
blanchet@41200
   181
fun struct_induct_rule_on th =
blanchet@41199
   182
  case Logic.strip_horn (prop_of th) of
blanchet@41199
   183
    (prems, @{const Trueprop}
blanchet@41199
   184
            $ ((p as Var ((p_name, 0), _)) $ (a as Var (_, ind_T)))) =>
blanchet@41199
   185
    if not (is_TVar ind_T) andalso length prems > 1 andalso
blanchet@41199
   186
       exists (exists_subterm (curry (op aconv) p)) prems andalso
blanchet@41199
   187
       not (exists (exists_subterm (curry (op aconv) a)) prems) then
blanchet@41199
   188
      SOME (p_name, ind_T)
blanchet@41199
   189
    else
blanchet@41199
   190
      NONE
blanchet@41199
   191
  | _ => NONE
blanchet@41199
   192
blanchet@43245
   193
fun instantiate_induct_rule ctxt concl_prop p_name ((name, loc), th) ind_x =
blanchet@41199
   194
  let
blanchet@41199
   195
    fun varify_noninducts (t as Free (s, T)) =
blanchet@41199
   196
        if (s, T) = ind_x orelse can dest_funT T then t else Var ((s, 0), T)
blanchet@41199
   197
      | varify_noninducts t = t
blanchet@41199
   198
    val p_inst =
blanchet@41199
   199
      concl_prop |> map_aterms varify_noninducts |> close_form
blanchet@41199
   200
                 |> lambda (Free ind_x)
blanchet@41199
   201
                 |> string_for_term ctxt
blanchet@41199
   202
  in
blanchet@41207
   203
    ((fn () => name () ^ "[where " ^ p_name ^ " = " ^ quote p_inst ^ "]", loc),
blanchet@43245
   204
     th |> read_instantiate ctxt [((p_name, 0), p_inst)])
blanchet@41199
   205
  end
blanchet@41199
   206
blanchet@41199
   207
fun type_match thy (T1, T2) =
blanchet@41199
   208
  (Sign.typ_match thy (T2, T1) Vartab.empty; true)
blanchet@41199
   209
  handle Type.TYPE_MATCH => false
blanchet@41199
   210
blanchet@43245
   211
fun instantiate_if_induct_rule ctxt stmt stmt_xs (ax as (_, th)) =
blanchet@41200
   212
  case struct_induct_rule_on th of
blanchet@41199
   213
    SOME (p_name, ind_T) =>
wenzelm@42361
   214
    let val thy = Proof_Context.theory_of ctxt in
blanchet@41199
   215
      stmt_xs |> filter (fn (_, T) => type_match thy (T, ind_T))
blanchet@41199
   216
              |> map_filter (try (instantiate_induct_rule ctxt stmt p_name ax))
blanchet@41199
   217
    end
blanchet@41199
   218
  | NONE => [ax]
blanchet@41199
   219
wenzelm@28477
   220
(***************************************************************)
wenzelm@28477
   221
(* Relevance Filtering                                         *)
wenzelm@28477
   222
(***************************************************************)
mengj@19194
   223
paulson@24287
   224
(*** constants with types ***)
paulson@24287
   225
blanchet@46073
   226
fun order_of_type (Type (@{type_name fun}, [T1, T2])) =
blanchet@38939
   227
    Int.max (order_of_type T1 + 1, order_of_type T2)
blanchet@38939
   228
  | order_of_type (Type (_, Ts)) = fold (Integer.max o order_of_type) Ts 0
blanchet@38939
   229
  | order_of_type _ = 0
blanchet@38939
   230
blanchet@38823
   231
(* An abstraction of Isabelle types and first-order terms *)
blanchet@38823
   232
datatype pattern = PVar | PApp of string * pattern list
blanchet@38939
   233
datatype ptype = PType of int * pattern list
blanchet@38744
   234
blanchet@38823
   235
fun string_for_pattern PVar = "_"
blanchet@38823
   236
  | string_for_pattern (PApp (s, ps)) =
blanchet@38823
   237
    if null ps then s else s ^ string_for_patterns ps
blanchet@38823
   238
and string_for_patterns ps = "(" ^ commas (map string_for_pattern ps) ^ ")"
blanchet@38939
   239
fun string_for_ptype (PType (_, ps)) = string_for_patterns ps
paulson@24287
   240
paulson@24287
   241
(*Is the second type an instance of the first one?*)
blanchet@38824
   242
fun match_pattern (PVar, _) = true
blanchet@38824
   243
  | match_pattern (PApp _, PVar) = false
blanchet@38824
   244
  | match_pattern (PApp (s, ps), PApp (t, qs)) =
blanchet@38824
   245
    s = t andalso match_patterns (ps, qs)
blanchet@38824
   246
and match_patterns (_, []) = true
blanchet@38824
   247
  | match_patterns ([], _) = false
blanchet@38824
   248
  | match_patterns (p :: ps, q :: qs) =
blanchet@38824
   249
    match_pattern (p, q) andalso match_patterns (ps, qs)
blanchet@38939
   250
fun match_ptype (PType (_, ps), PType (_, qs)) = match_patterns (ps, qs)
paulson@24287
   251
blanchet@38823
   252
(* Is there a unifiable constant? *)
blanchet@38827
   253
fun pconst_mem f consts (s, ps) =
blanchet@38939
   254
  exists (curry (match_ptype o f) ps)
blanchet@38827
   255
         (map snd (filter (curry (op =) s o fst) consts))
blanchet@38827
   256
fun pconst_hyper_mem f const_tab (s, ps) =
blanchet@38939
   257
  exists (curry (match_ptype o f) ps) (these (Symtab.lookup const_tab s))
blanchet@37505
   258
blanchet@38939
   259
fun pattern_for_type (Type (s, Ts)) = PApp (s, map pattern_for_type Ts)
blanchet@38939
   260
  | pattern_for_type (TFree (s, _)) = PApp (s, [])
blanchet@38939
   261
  | pattern_for_type (TVar _) = PVar
blanchet@38827
   262
blanchet@38744
   263
(* Pairs a constant with the list of its type instantiations. *)
blanchet@41204
   264
fun ptype thy const x =
blanchet@38939
   265
  (if const then map pattern_for_type (these (try (Sign.const_typargs thy) x))
blanchet@41204
   266
   else [])
blanchet@41204
   267
fun rich_ptype thy const (s, T) =
blanchet@41204
   268
  PType (order_of_type T, ptype thy const (s, T))
blanchet@41204
   269
fun rich_pconst thy const (s, T) = (s, rich_ptype thy const (s, T))
paulson@24287
   270
blanchet@38939
   271
fun string_for_hyper_pconst (s, ps) =
blanchet@38939
   272
  s ^ "{" ^ commas (map string_for_ptype ps) ^ "}"
paulson@24287
   273
blanchet@38823
   274
(* Add a pconstant to the table, but a [] entry means a standard
blanchet@38819
   275
   connective, which we ignore.*)
blanchet@41066
   276
fun add_pconst_to_table also_skolem (s, p) =
blanchet@41066
   277
  if (not also_skolem andalso String.isPrefix skolem_prefix s) then I
blanchet@41066
   278
  else Symtab.map_default (s, [p]) (insert (op =) p)
blanchet@38819
   279
blanchet@42732
   280
fun add_pconsts_in_term thy is_built_in_const also_skolems pos =
blanchet@37505
   281
  let
blanchet@38819
   282
    val flip = Option.map not
blanchet@38587
   283
    (* We include free variables, as well as constants, to handle locales. For
blanchet@41205
   284
       each quantifiers that must necessarily be skolemized by the automatic
blanchet@41205
   285
       prover, we introduce a fresh constant to simulate the effect of
blanchet@41205
   286
       Skolemization. *)
blanchet@46073
   287
    fun do_const const x ts =
blanchet@41336
   288
      let val (built_in, ts) = is_built_in_const x ts in
blanchet@46073
   289
        (not built_in
blanchet@46073
   290
         ? add_pconst_to_table also_skolems (rich_pconst thy const x))
blanchet@46073
   291
        #> fold (do_term false) ts
blanchet@41336
   292
      end
blanchet@42741
   293
    and do_term ext_arg t =
blanchet@38827
   294
      case strip_comb t of
blanchet@46073
   295
        (Const x, ts) => do_const true x ts
blanchet@46073
   296
      | (Free x, ts) => do_const false x ts
blanchet@38939
   297
      | (Abs (_, T, t'), ts) =>
blanchet@42741
   298
        ((null ts andalso not ext_arg)
blanchet@42741
   299
         (* Since lambdas on the right-hand side of equalities are usually
blanchet@42741
   300
            extensionalized later by "extensionalize_term", we don't penalize
blanchet@42741
   301
            them here. *)
blanchet@41066
   302
         ? add_pconst_to_table true (abs_name, PType (order_of_type T + 1, [])))
blanchet@42735
   303
        #> fold (do_term false) (t' :: ts)
blanchet@42735
   304
      | (_, ts) => fold (do_term false) ts
blanchet@38939
   305
    fun do_quantifier will_surely_be_skolemized abs_T body_t =
blanchet@37537
   306
      do_formula pos body_t
blanchet@38747
   307
      #> (if also_skolems andalso will_surely_be_skolemized then
blanchet@41066
   308
            add_pconst_to_table true
wenzelm@43559
   309
                (legacy_gensym skolem_prefix, PType (order_of_type abs_T, []))
blanchet@38587
   310
          else
blanchet@38587
   311
            I)
blanchet@42741
   312
    and do_term_or_formula ext_arg T =
blanchet@42741
   313
      if T = HOLogic.boolT then do_formula NONE else do_term ext_arg
blanchet@37537
   314
    and do_formula pos t =
blanchet@37537
   315
      case t of
blanchet@38939
   316
        Const (@{const_name all}, _) $ Abs (_, T, t') =>
blanchet@38939
   317
        do_quantifier (pos = SOME false) T t'
blanchet@37537
   318
      | @{const "==>"} $ t1 $ t2 =>
blanchet@37537
   319
        do_formula (flip pos) t1 #> do_formula pos t2
blanchet@37537
   320
      | Const (@{const_name "=="}, Type (_, [T, _])) $ t1 $ t2 =>
blanchet@42741
   321
        do_term_or_formula false T t1 #> do_term_or_formula true T t2
blanchet@37537
   322
      | @{const Trueprop} $ t1 => do_formula pos t1
blanchet@41140
   323
      | @{const False} => I
blanchet@41140
   324
      | @{const True} => I
blanchet@37537
   325
      | @{const Not} $ t1 => do_formula (flip pos) t1
blanchet@38939
   326
      | Const (@{const_name All}, _) $ Abs (_, T, t') =>
blanchet@38939
   327
        do_quantifier (pos = SOME false) T t'
blanchet@38939
   328
      | Const (@{const_name Ex}, _) $ Abs (_, T, t') =>
blanchet@38939
   329
        do_quantifier (pos = SOME true) T t'
haftmann@38795
   330
      | @{const HOL.conj} $ t1 $ t2 => fold (do_formula pos) [t1, t2]
haftmann@38795
   331
      | @{const HOL.disj} $ t1 $ t2 => fold (do_formula pos) [t1, t2]
haftmann@38786
   332
      | @{const HOL.implies} $ t1 $ t2 =>
blanchet@37537
   333
        do_formula (flip pos) t1 #> do_formula pos t2
haftmann@38864
   334
      | Const (@{const_name HOL.eq}, Type (_, [T, _])) $ t1 $ t2 =>
blanchet@42741
   335
        do_term_or_formula false T t1 #> do_term_or_formula true T t2
blanchet@38587
   336
      | Const (@{const_name If}, Type (_, [_, Type (_, [T, _])]))
blanchet@38587
   337
        $ t1 $ t2 $ t3 =>
blanchet@42735
   338
        do_formula NONE t1 #> fold (do_term_or_formula false T) [t2, t3]
blanchet@38939
   339
      | Const (@{const_name Ex1}, _) $ Abs (_, T, t') =>
blanchet@38939
   340
        do_quantifier (is_some pos) T t'
blanchet@38939
   341
      | Const (@{const_name Ball}, _) $ t1 $ Abs (_, T, t') =>
blanchet@38939
   342
        do_quantifier (pos = SOME false) T
blanchet@38939
   343
                      (HOLogic.mk_imp (incr_boundvars 1 t1 $ Bound 0, t'))
blanchet@38939
   344
      | Const (@{const_name Bex}, _) $ t1 $ Abs (_, T, t') =>
blanchet@38939
   345
        do_quantifier (pos = SOME true) T
blanchet@38939
   346
                      (HOLogic.mk_conj (incr_boundvars 1 t1 $ Bound 0, t'))
blanchet@37537
   347
      | (t0 as Const (_, @{typ bool})) $ t1 =>
blanchet@42735
   348
        do_term false t0 #> do_formula pos t1  (* theory constant *)
blanchet@42735
   349
      | _ => do_term false t
blanchet@42732
   350
  in do_formula pos end
paulson@24287
   351
paulson@24287
   352
(*Inserts a dummy "constant" referring to the theory name, so that relevance
paulson@24287
   353
  takes the given theory into account.*)
blanchet@41200
   354
fun theory_constify ({theory_const_rel_weight, theory_const_irrel_weight, ...}
blanchet@41200
   355
                     : relevance_fudge) thy_name t =
blanchet@40070
   356
  if exists (curry (op <) 0.0) [theory_const_rel_weight,
blanchet@40070
   357
                                theory_const_irrel_weight] then
blanchet@41200
   358
    Const (thy_name ^ theory_const_suffix, @{typ bool}) $ t
blanchet@37505
   359
  else
blanchet@41200
   360
    t
blanchet@41200
   361
blanchet@41200
   362
fun theory_const_prop_of fudge th =
blanchet@41200
   363
  theory_constify fudge (Context.theory_name (theory_of_thm th)) (prop_of th)
blanchet@37505
   364
paulson@24287
   365
(**** Constant / Type Frequencies ****)
paulson@24287
   366
blanchet@38743
   367
(* A two-dimensional symbol table counts frequencies of constants. It's keyed
blanchet@38743
   368
   first by constant name and second by its list of type instantiations. For the
blanchet@38823
   369
   latter, we need a linear ordering on "pattern list". *)
paulson@24287
   370
blanchet@38823
   371
fun pattern_ord p =
blanchet@38743
   372
  case p of
blanchet@38744
   373
    (PVar, PVar) => EQUAL
blanchet@38823
   374
  | (PVar, PApp _) => LESS
blanchet@38823
   375
  | (PApp _, PVar) => GREATER
blanchet@38823
   376
  | (PApp q1, PApp q2) =>
blanchet@38823
   377
    prod_ord fast_string_ord (dict_ord pattern_ord) (q1, q2)
blanchet@38939
   378
fun ptype_ord (PType p, PType q) =
blanchet@38939
   379
  prod_ord (dict_ord pattern_ord) int_ord (swap p, swap q)
paulson@24287
   380
blanchet@38939
   381
structure PType_Tab = Table(type key = ptype val ord = ptype_ord)
paulson@24287
   382
blanchet@40204
   383
fun count_fact_consts thy fudge =
blanchet@37503
   384
  let
blanchet@38827
   385
    fun do_const const (s, T) ts =
blanchet@38827
   386
      (* Two-dimensional table update. Constant maps to types maps to count. *)
blanchet@41204
   387
      PType_Tab.map_default (rich_ptype thy const (s, T), 0) (Integer.add 1)
blanchet@38939
   388
      |> Symtab.map_default (s, PType_Tab.empty)
blanchet@38827
   389
      #> fold do_term ts
blanchet@38827
   390
    and do_term t =
blanchet@38827
   391
      case strip_comb t of
blanchet@38827
   392
        (Const x, ts) => do_const true x ts
blanchet@38827
   393
      | (Free x, ts) => do_const false x ts
blanchet@38827
   394
      | (Abs (_, _, t'), ts) => fold do_term (t' :: ts)
blanchet@38827
   395
      | (_, ts) => fold do_term ts
blanchet@40070
   396
  in do_term o theory_const_prop_of fudge o snd end
paulson@24287
   397
paulson@24287
   398
paulson@24287
   399
(**** Actual Filtering Code ****)
paulson@24287
   400
blanchet@39367
   401
fun pow_int _ 0 = 1.0
blanchet@38939
   402
  | pow_int x 1 = x
blanchet@38939
   403
  | pow_int x n = if n > 0 then x * pow_int x (n - 1) else pow_int x (n + 1) / x
blanchet@38939
   404
paulson@24287
   405
(*The frequency of a constant is the sum of those of all instances of its type.*)
blanchet@38824
   406
fun pconst_freq match const_tab (c, ps) =
blanchet@38939
   407
  PType_Tab.fold (fn (qs, m) => match (ps, qs) ? Integer.add m)
blanchet@38939
   408
                 (the (Symtab.lookup const_tab c)) 0
blanchet@38686
   409
paulson@24287
   410
blanchet@38085
   411
(* A surprising number of theorems contain only a few significant constants.
blanchet@38085
   412
   These include all induction rules, and other general theorems. *)
blanchet@37503
   413
blanchet@37503
   414
(* "log" seems best in practice. A constant function of one ignores the constant
blanchet@38938
   415
   frequencies. Rare constants give more points if they are relevant than less
blanchet@38938
   416
   rare ones. *)
blanchet@39367
   417
fun rel_weight_for _ freq = 1.0 + 2.0 / Math.ln (Real.fromInt freq + 1.0)
blanchet@38938
   418
blanchet@38938
   419
(* Irrelevant constants are treated differently. We associate lower penalties to
blanchet@38938
   420
   very rare constants and very common ones -- the former because they can't
blanchet@38938
   421
   lead to the inclusion of too many new facts, and the latter because they are
blanchet@38938
   422
   so common as to be of little interest. *)
blanchet@40070
   423
fun irrel_weight_for ({worse_irrel_freq, higher_order_irrel_weight, ...}
blanchet@40070
   424
                      : relevance_fudge) order freq =
blanchet@40070
   425
  let val (k, x) = worse_irrel_freq |> `Real.ceil in
blanchet@38939
   426
    (if freq < k then Math.ln (Real.fromInt (freq + 1)) / Math.ln x
blanchet@38939
   427
     else rel_weight_for order freq / rel_weight_for order k)
blanchet@40070
   428
    * pow_int higher_order_irrel_weight (order - 1)
blanchet@38938
   429
  end
blanchet@37503
   430
blanchet@41790
   431
fun multiplier_for_const_name local_const_multiplier s =
blanchet@41790
   432
  if String.isSubstring "." s then 1.0 else local_const_multiplier
blanchet@38821
   433
blanchet@41790
   434
(* Computes a constant's weight, as determined by its frequency. *)
blanchet@41790
   435
fun generic_pconst_weight local_const_multiplier abs_weight skolem_weight
blanchet@42735
   436
                          theory_const_weight chained_const_weight weight_for f
blanchet@42735
   437
                          const_tab chained_const_tab (c as (s, PType (m, _))) =
blanchet@41790
   438
  if s = abs_name then
blanchet@41790
   439
    abs_weight
blanchet@41790
   440
  else if String.isPrefix skolem_prefix s then
blanchet@41790
   441
    skolem_weight
blanchet@41790
   442
  else if String.isSuffix theory_const_suffix s then
blanchet@41790
   443
    theory_const_weight
blanchet@41790
   444
  else
blanchet@41790
   445
    multiplier_for_const_name local_const_multiplier s
blanchet@41790
   446
    * weight_for m (pconst_freq (match_ptype o f) const_tab c)
blanchet@42735
   447
    |> (if chained_const_weight < 1.0 andalso
blanchet@42735
   448
           pconst_hyper_mem I chained_const_tab c then
blanchet@42735
   449
          curry (op *) chained_const_weight
blanchet@42735
   450
        else
blanchet@42735
   451
          I)
blanchet@41790
   452
blanchet@41790
   453
fun rel_pconst_weight ({local_const_multiplier, abs_rel_weight,
blanchet@41790
   454
                        theory_const_rel_weight, ...} : relevance_fudge)
blanchet@41790
   455
                      const_tab =
blanchet@41790
   456
  generic_pconst_weight local_const_multiplier abs_rel_weight 0.0
blanchet@42735
   457
                        theory_const_rel_weight 0.0 rel_weight_for I const_tab
blanchet@42735
   458
                        Symtab.empty
blanchet@42735
   459
blanchet@41790
   460
fun irrel_pconst_weight (fudge as {local_const_multiplier, abs_irrel_weight,
blanchet@41790
   461
                                   skolem_irrel_weight,
blanchet@42735
   462
                                   theory_const_irrel_weight,
blanchet@42735
   463
                                   chained_const_irrel_weight, ...})
blanchet@42735
   464
                        const_tab chained_const_tab =
blanchet@41790
   465
  generic_pconst_weight local_const_multiplier abs_irrel_weight
blanchet@41790
   466
                        skolem_irrel_weight theory_const_irrel_weight
blanchet@42735
   467
                        chained_const_irrel_weight (irrel_weight_for fudge) swap
blanchet@42735
   468
                        const_tab chained_const_tab
paulson@24287
   469
blanchet@43421
   470
fun locality_bonus ({intro_bonus, ...} : relevance_fudge) Intro = intro_bonus
blanchet@40070
   471
  | locality_bonus {elim_bonus, ...} Elim = elim_bonus
blanchet@40070
   472
  | locality_bonus {simp_bonus, ...} Simp = simp_bonus
blanchet@40070
   473
  | locality_bonus {local_bonus, ...} Local = local_bonus
blanchet@40070
   474
  | locality_bonus {assum_bonus, ...} Assum = assum_bonus
blanchet@40070
   475
  | locality_bonus {chained_bonus, ...} Chained = chained_bonus
blanchet@43421
   476
  | locality_bonus _ _ = 0.0
blanchet@38751
   477
blanchet@40418
   478
fun is_odd_const_name s =
blanchet@40418
   479
  s = abs_name orelse String.isPrefix skolem_prefix s orelse
blanchet@40418
   480
  String.isSuffix theory_const_suffix s
blanchet@40418
   481
blanchet@42732
   482
fun fact_weight fudge loc const_tab relevant_consts chained_consts fact_consts =
blanchet@40204
   483
  case fact_consts |> List.partition (pconst_hyper_mem I relevant_consts)
blanchet@40204
   484
                   ||> filter_out (pconst_hyper_mem swap relevant_consts) of
blanchet@38827
   485
    ([], _) => 0.0
blanchet@38744
   486
  | (rel, irrel) =>
blanchet@40418
   487
    if forall (forall (is_odd_const_name o fst)) [rel, irrel] then
blanchet@40371
   488
      0.0
blanchet@40371
   489
    else
blanchet@40371
   490
      let
blanchet@42735
   491
        val irrel = irrel |> filter_out (pconst_mem swap rel)
blanchet@40371
   492
        val rel_weight =
blanchet@40371
   493
          0.0 |> fold (curry (op +) o rel_pconst_weight fudge const_tab) rel
blanchet@40371
   494
        val irrel_weight =
blanchet@40371
   495
          ~ (locality_bonus fudge loc)
blanchet@42735
   496
          |> fold (curry (op +)
blanchet@42735
   497
                   o irrel_pconst_weight fudge const_tab chained_consts) irrel
blanchet@40371
   498
        val res = rel_weight / (rel_weight + irrel_weight)
blanchet@40371
   499
      in if Real.isFinite res then res else 0.0 end
blanchet@38747
   500
blanchet@40369
   501
fun pconsts_in_fact thy is_built_in_const t =
blanchet@38825
   502
  Symtab.fold (fn (s, pss) => fold (cons o pair s) pss)
blanchet@42732
   503
              (Symtab.empty |> add_pconsts_in_term thy is_built_in_const true
blanchet@42732
   504
                                                   (SOME true) t) []
blanchet@42729
   505
blanchet@40369
   506
fun pair_consts_fact thy is_built_in_const fudge fact =
blanchet@40204
   507
  case fact |> snd |> theory_const_prop_of fudge
blanchet@40369
   508
            |> pconsts_in_fact thy is_built_in_const of
blanchet@38827
   509
    [] => NONE
blanchet@40204
   510
  | consts => SOME ((fact, consts), NONE)
paulson@24287
   511
blanchet@41768
   512
val const_names_in_fact = map fst ooo pconsts_in_fact
blanchet@41768
   513
blanchet@38699
   514
type annotated_thm =
blanchet@38939
   515
  (((unit -> string) * locality) * thm) * (string * ptype) list
blanchet@37505
   516
blanchet@42646
   517
fun take_most_relevant ctxt max_relevant remaining_max
blanchet@42728
   518
        ({max_imperfect, max_imperfect_exp, ...} : relevance_fudge)
blanchet@40070
   519
        (candidates : (annotated_thm * real) list) =
blanchet@38744
   520
  let
blanchet@38747
   521
    val max_imperfect =
blanchet@40070
   522
      Real.ceil (Math.pow (max_imperfect,
blanchet@38904
   523
                    Math.pow (Real.fromInt remaining_max
blanchet@40070
   524
                              / Real.fromInt max_relevant, max_imperfect_exp)))
blanchet@38747
   525
    val (perfect, imperfect) =
blanchet@38889
   526
      candidates |> sort (Real.compare o swap o pairself snd)
blanchet@38889
   527
                 |> take_prefix (fn (_, w) => w > 0.99999)
blanchet@38747
   528
    val ((accepts, more_rejects), rejects) =
blanchet@38747
   529
      chop max_imperfect imperfect |>> append perfect |>> chop remaining_max
blanchet@38744
   530
  in
blanchet@42646
   531
    trace_msg ctxt (fn () =>
wenzelm@41491
   532
        "Actually passed (" ^ string_of_int (length accepts) ^ " of " ^
wenzelm@41491
   533
        string_of_int (length candidates) ^ "): " ^
blanchet@38889
   534
        (accepts |> map (fn ((((name, _), _), _), weight) =>
blanchet@38752
   535
                            name () ^ " [" ^ Real.toString weight ^ "]")
blanchet@38745
   536
                 |> commas));
blanchet@38747
   537
    (accepts, more_rejects @ rejects)
blanchet@38744
   538
  end
paulson@24287
   539
blanchet@40369
   540
fun if_empty_replace_with_locality thy is_built_in_const facts loc tab =
blanchet@38819
   541
  if Symtab.is_empty tab then
blanchet@42732
   542
    Symtab.empty
blanchet@42732
   543
    |> fold (add_pconsts_in_term thy is_built_in_const false (SOME false))
blanchet@42732
   544
            (map_filter (fn ((_, loc'), th) =>
blanchet@42732
   545
                            if loc' = loc then SOME (prop_of th) else NONE)
blanchet@42732
   546
                        facts)
blanchet@38819
   547
  else
blanchet@38819
   548
    tab
blanchet@38819
   549
blanchet@42702
   550
fun consider_arities is_built_in_const th =
blanchet@41158
   551
  let
blanchet@41158
   552
    fun aux _ _ NONE = NONE
blanchet@41158
   553
      | aux t args (SOME tab) =
blanchet@41158
   554
        case t of
blanchet@41158
   555
          t1 $ t2 => SOME tab |> aux t1 (t2 :: args) |> aux t2 []
blanchet@41158
   556
        | Const (x as (s, _)) =>
blanchet@41336
   557
          (if is_built_in_const x args |> fst then
blanchet@41158
   558
             SOME tab
blanchet@41158
   559
           else case Symtab.lookup tab s of
blanchet@41158
   560
             NONE => SOME (Symtab.update (s, length args) tab)
blanchet@41158
   561
           | SOME n => if n = length args then SOME tab else NONE)
blanchet@41158
   562
        | _ => SOME tab
blanchet@41158
   563
  in aux (prop_of th) [] end
blanchet@41158
   564
blanchet@44785
   565
(* FIXME: This is currently only useful for polymorphic type encodings. *)
blanchet@42702
   566
fun could_benefit_from_ext is_built_in_const facts =
blanchet@42702
   567
  fold (consider_arities is_built_in_const o snd) facts (SOME Symtab.empty)
blanchet@41158
   568
  |> is_none
blanchet@41158
   569
blanchet@43492
   570
(* High enough so that it isn't wrongly considered as very relevant (e.g., for E
blanchet@43492
   571
   weights), but low enough so that it is unlikely to be truncated away if few
blanchet@43492
   572
   facts are included. *)
blanchet@43492
   573
val special_fact_index = 75
blanchet@43492
   574
blanchet@44625
   575
fun relevance_filter ctxt threshold0 decay max_relevant is_built_in_const
blanchet@40070
   576
        (fudge as {threshold_divisor, ridiculous_threshold, ...})
blanchet@42732
   577
        ({add, del, ...} : relevance_override) facts chained_ts hyp_ts concl_t =
blanchet@38739
   578
  let
wenzelm@42361
   579
    val thy = Proof_Context.theory_of ctxt
blanchet@40204
   580
    val const_tab = fold (count_fact_consts thy fudge) facts Symtab.empty
blanchet@42732
   581
    val add_pconsts = add_pconsts_in_term thy is_built_in_const false o SOME
blanchet@42732
   582
    val chained_const_tab = Symtab.empty |> fold (add_pconsts true) chained_ts
blanchet@38819
   583
    val goal_const_tab =
blanchet@42732
   584
      Symtab.empty |> fold (add_pconsts true) hyp_ts
blanchet@42732
   585
                   |> add_pconsts false concl_t
blanchet@42732
   586
      |> (fn tab => if Symtab.is_empty tab then chained_const_tab else tab)
blanchet@40369
   587
      |> fold (if_empty_replace_with_locality thy is_built_in_const facts)
blanchet@38993
   588
              [Chained, Assum, Local]
blanchet@39012
   589
    val add_ths = Attrib.eval_thms ctxt add
blanchet@39012
   590
    val del_ths = Attrib.eval_thms ctxt del
blanchet@42957
   591
    val facts = facts |> filter_out (member Thm.eq_thm_prop del_ths o snd)
blanchet@38747
   592
    fun iter j remaining_max threshold rel_const_tab hopeless hopeful =
blanchet@38739
   593
      let
blanchet@40191
   594
        fun relevant [] _ [] =
blanchet@38747
   595
            (* Nothing has been added this iteration. *)
blanchet@40070
   596
            if j = 0 andalso threshold >= ridiculous_threshold then
blanchet@38747
   597
              (* First iteration? Try again. *)
blanchet@40070
   598
              iter 0 max_relevant (threshold / threshold_divisor) rel_const_tab
blanchet@38747
   599
                   hopeless hopeful
blanchet@38744
   600
            else
blanchet@40191
   601
              []
blanchet@38889
   602
          | relevant candidates rejects [] =
blanchet@38739
   603
            let
blanchet@38747
   604
              val (accepts, more_rejects) =
blanchet@42646
   605
                take_most_relevant ctxt max_relevant remaining_max fudge
blanchet@42646
   606
                                   candidates
blanchet@38739
   607
              val rel_const_tab' =
blanchet@38745
   608
                rel_const_tab
blanchet@41066
   609
                |> fold (add_pconst_to_table false) (maps (snd o fst) accepts)
blanchet@38744
   610
              fun is_dirty (c, _) =
blanchet@38744
   611
                Symtab.lookup rel_const_tab' c <> Symtab.lookup rel_const_tab c
blanchet@38745
   612
              val (hopeful_rejects, hopeless_rejects) =
blanchet@38745
   613
                 (rejects @ hopeless, ([], []))
blanchet@38745
   614
                 |-> fold (fn (ax as (_, consts), old_weight) =>
blanchet@38745
   615
                              if exists is_dirty consts then
blanchet@38745
   616
                                apfst (cons (ax, NONE))
blanchet@38745
   617
                              else
blanchet@38745
   618
                                apsnd (cons (ax, old_weight)))
blanchet@38745
   619
                 |>> append (more_rejects
blanchet@38745
   620
                             |> map (fn (ax as (_, consts), old_weight) =>
blanchet@38745
   621
                                        (ax, if exists is_dirty consts then NONE
blanchet@38745
   622
                                             else SOME old_weight)))
blanchet@38747
   623
              val threshold =
blanchet@38822
   624
                1.0 - (1.0 - threshold)
blanchet@38822
   625
                      * Math.pow (decay, Real.fromInt (length accepts))
blanchet@38747
   626
              val remaining_max = remaining_max - length accepts
blanchet@38739
   627
            in
blanchet@42646
   628
              trace_msg ctxt (fn () => "New or updated constants: " ^
blanchet@38744
   629
                  commas (rel_const_tab' |> Symtab.dest
blanchet@38822
   630
                          |> subtract (op =) (rel_const_tab |> Symtab.dest)
blanchet@38827
   631
                          |> map string_for_hyper_pconst));
blanchet@38745
   632
              map (fst o fst) accepts @
blanchet@38747
   633
              (if remaining_max = 0 then
blanchet@40191
   634
                 []
blanchet@38745
   635
               else
blanchet@38747
   636
                 iter (j + 1) remaining_max threshold rel_const_tab'
blanchet@38747
   637
                      hopeless_rejects hopeful_rejects)
blanchet@38739
   638
            end
blanchet@38889
   639
          | relevant candidates rejects
blanchet@40204
   640
                     (((ax as (((_, loc), _), fact_consts)), cached_weight)
blanchet@38747
   641
                      :: hopeful) =
blanchet@38739
   642
            let
blanchet@38739
   643
              val weight =
blanchet@38739
   644
                case cached_weight of
blanchet@38739
   645
                  SOME w => w
blanchet@40204
   646
                | NONE => fact_weight fudge loc const_tab rel_const_tab
blanchet@42732
   647
                                      chained_const_tab fact_consts
blanchet@38739
   648
            in
blanchet@38741
   649
              if weight >= threshold then
blanchet@38889
   650
                relevant ((ax, weight) :: candidates) rejects hopeful
blanchet@38739
   651
              else
blanchet@38889
   652
                relevant candidates ((ax, weight) :: rejects) hopeful
blanchet@38739
   653
            end
blanchet@38739
   654
        in
blanchet@42646
   655
          trace_msg ctxt (fn () =>
blanchet@38744
   656
              "ITERATION " ^ string_of_int j ^ ": current threshold: " ^
blanchet@38744
   657
              Real.toString threshold ^ ", constants: " ^
blanchet@38744
   658
              commas (rel_const_tab |> Symtab.dest
blanchet@38744
   659
                      |> filter (curry (op <>) [] o snd)
blanchet@38827
   660
                      |> map string_for_hyper_pconst));
blanchet@38889
   661
          relevant [] [] hopeful
blanchet@38739
   662
        end
blanchet@42826
   663
    fun prepend_facts ths accepts =
blanchet@42957
   664
      ((facts |> filter (member Thm.eq_thm_prop ths o snd)) @
blanchet@42957
   665
       (accepts |> filter_out (member Thm.eq_thm_prop ths o snd)))
blanchet@40408
   666
      |> take max_relevant
blanchet@43492
   667
    fun insert_into_facts accepts [] = accepts
blanchet@43492
   668
      | insert_into_facts accepts ths =
blanchet@43492
   669
        let
blanchet@43492
   670
          val add = facts |> filter (member Thm.eq_thm_prop ths o snd)
blanchet@43492
   671
          val (bef, after) =
blanchet@43492
   672
            accepts |> filter_out (member Thm.eq_thm_prop ths o snd)
blanchet@43492
   673
                    |> take (max_relevant - length add)
blanchet@43492
   674
                    |> chop special_fact_index
blanchet@43492
   675
        in bef @ add @ after end
blanchet@43492
   676
    fun insert_special_facts accepts =
blanchet@43066
   677
       [] |> could_benefit_from_ext is_built_in_const accepts ? cons @{thm ext}
blanchet@43492
   678
          |> insert_into_facts accepts
blanchet@38739
   679
  in
blanchet@40369
   680
    facts |> map_filter (pair_consts_fact thy is_built_in_const fudge)
blanchet@40204
   681
          |> iter 0 max_relevant threshold0 goal_const_tab []
blanchet@42826
   682
          |> not (null add_ths) ? prepend_facts add_ths
blanchet@43492
   683
          |> insert_special_facts
blanchet@42646
   684
          |> tap (fn accepts => trace_msg ctxt (fn () =>
wenzelm@41491
   685
                      "Total relevant: " ^ string_of_int (length accepts)))
blanchet@38739
   686
  end
paulson@24287
   687
blanchet@38744
   688
paulson@24287
   689
(***************************************************************)
mengj@19768
   690
(* Retrieving and filtering lemmas                             *)
mengj@19768
   691
(***************************************************************)
mengj@19768
   692
paulson@33022
   693
(*** retrieve lemmas and filter them ***)
mengj@19768
   694
paulson@20757
   695
(*Reject theorems with names like "List.filter.filter_list_def" or
paulson@21690
   696
  "Accessible_Part.acc.defs", as these are definitions arising from packages.*)
paulson@20757
   697
fun is_package_def a =
blanchet@40205
   698
  let val names = Long_Name.explode a in
blanchet@40205
   699
    (length names > 2 andalso not (hd names = "local") andalso
blanchet@40205
   700
     String.isSuffix "_def" a) orelse String.isSuffix "_defs" a
blanchet@40205
   701
  end
paulson@20757
   702
blanchet@43245
   703
fun uniquify xs =
blanchet@43245
   704
  Termtab.fold (cons o snd)
blanchet@43245
   705
               (fold (Termtab.update o `(prop_of o snd)) xs Termtab.empty) []
mengj@19768
   706
blanchet@37626
   707
(* FIXME: put other record thms here, or declare as "no_atp" *)
nik@44585
   708
fun multi_base_blacklist ctxt ho_atp =
blanchet@41199
   709
  ["defs", "select_defs", "update_defs", "split", "splits", "split_asm",
blanchet@41199
   710
   "cases", "ext_cases", "eq.simps", "eq.refl", "nchotomy", "case_cong",
blanchet@41199
   711
   "weak_case_cong"]
nik@44585
   712
  |> not (ho_atp orelse (Config.get ctxt instantiate_inducts)) ?
nik@44585
   713
        append ["induct", "inducts"]
blanchet@38682
   714
  |> map (prefix ".")
blanchet@37626
   715
nik@44585
   716
val max_lambda_nesting = 3 (*only applies if not ho_atp*)
blanchet@37626
   717
blanchet@37626
   718
fun term_has_too_many_lambdas max (t1 $ t2) =
blanchet@37626
   719
    exists (term_has_too_many_lambdas max) [t1, t2]
blanchet@37626
   720
  | term_has_too_many_lambdas max (Abs (_, _, t)) =
blanchet@37626
   721
    max = 0 orelse term_has_too_many_lambdas (max - 1) t
blanchet@37626
   722
  | term_has_too_many_lambdas _ _ = false
blanchet@37626
   723
blanchet@37626
   724
(* Don't count nested lambdas at the level of formulas, since they are
blanchet@37626
   725
   quantifiers. *)
nik@44585
   726
fun formula_has_too_many_lambdas true _ _ = false (*i.e. ho_atp*)
nik@44585
   727
  | formula_has_too_many_lambdas _ Ts (Abs (_, T, t)) =
nik@44585
   728
      formula_has_too_many_lambdas false (T :: Ts) t
nik@44585
   729
  | formula_has_too_many_lambdas _ Ts t =
blanchet@41273
   730
    if member (op =) [HOLogic.boolT, propT] (fastype_of1 (Ts, t)) then
nik@44585
   731
      exists (formula_has_too_many_lambdas false Ts) (#2 (strip_comb t))
blanchet@37626
   732
    else
blanchet@37626
   733
      term_has_too_many_lambdas max_lambda_nesting t
blanchet@37626
   734
blanchet@38692
   735
(* The max apply depth of any "metis" call in "Metis_Examples" (on 2007-10-31)
blanchet@37626
   736
   was 11. *)
blanchet@37626
   737
val max_apply_depth = 15
blanchet@37626
   738
blanchet@37626
   739
fun apply_depth (f $ t) = Int.max (apply_depth f, apply_depth t + 1)
blanchet@37626
   740
  | apply_depth (Abs (_, _, t)) = apply_depth t
blanchet@37626
   741
  | apply_depth _ = 0
blanchet@37626
   742
nik@44585
   743
fun is_formula_too_complex ho_atp t =
nik@44585
   744
  apply_depth t > max_apply_depth orelse formula_has_too_many_lambdas ho_atp [] t
blanchet@37626
   745
blanchet@39946
   746
(* FIXME: Extend to "Meson" and "Metis" *)
blanchet@37543
   747
val exists_sledgehammer_const =
blanchet@37626
   748
  exists_Const (fn (s, _) => String.isPrefix sledgehammer_prefix s)
blanchet@37626
   749
blanchet@38904
   750
(* FIXME: make more reliable *)
blanchet@38904
   751
val exists_low_level_class_const =
blanchet@38904
   752
  exists_Const (fn (s, _) =>
blanchet@38904
   753
     String.isSubstring (Long_Name.separator ^ "class" ^ Long_Name.separator) s)
blanchet@38904
   754
blanchet@38821
   755
fun is_metastrange_theorem th =
blanchet@37626
   756
  case head_of (concl_of th) of
blanchet@43576
   757
    Const (s, _) => (s <> @{const_name Trueprop} andalso
blanchet@43576
   758
                     s <> @{const_name "=="})
blanchet@43576
   759
  | _ => false
blanchet@37626
   760
blanchet@38821
   761
fun is_that_fact th =
blanchet@38821
   762
  String.isSuffix (Long_Name.separator ^ Obtain.thatN) (Thm.get_name_hint th)
blanchet@38821
   763
  andalso exists_subterm (fn Free (s, _) => s = Name.skolem Auto_Bind.thesisN
blanchet@38821
   764
                           | _ => false) (prop_of th)
blanchet@38821
   765
blanchet@38085
   766
(**** Predicates to detect unwanted facts (prolific or likely to cause
blanchet@37347
   767
      unsoundness) ****)
paulson@21470
   768
nik@44585
   769
fun is_theorem_bad_for_atps ho_atp exporter thm =
blanchet@43576
   770
  is_metastrange_theorem thm orelse
blanchet@43576
   771
  (not exporter andalso
blanchet@43576
   772
   let val t = prop_of thm in
nik@44585
   773
     is_formula_too_complex ho_atp t orelse exists_type type_has_top_sort t orelse
blanchet@43576
   774
     exists_sledgehammer_const t orelse exists_low_level_class_const t orelse
blanchet@43576
   775
     is_that_fact thm
blanchet@43576
   776
   end)
blanchet@38627
   777
blanchet@45301
   778
val crude_zero_vars =
blanchet@45301
   779
  map_aterms (fn Var ((s, _), T) => Var ((s, 0), T) | t => t)
blanchet@42641
   780
  #> map_types (map_type_tvar (fn ((s, _), S) => TVar ((s, 0), S)))
blanchet@42641
   781
blanchet@43245
   782
fun clasimpset_rule_table_of ctxt =
blanchet@38937
   783
  let
blanchet@45301
   784
    val thy = Proof_Context.theory_of ctxt
blanchet@45301
   785
    val atomize = HOLogic.mk_Trueprop o Object_Logic.atomize_term thy
blanchet@45301
   786
    fun add loc g f =
blanchet@45301
   787
      fold (Termtab.update o rpair loc o g o crude_zero_vars o prop_of o f)
blanchet@45301
   788
    val {safeIs, safeEs, hazIs, hazEs, ...} =
blanchet@45301
   789
      ctxt |> claset_of |> Classical.rep_cs
wenzelm@42810
   790
    val intros = Item_Net.content safeIs @ Item_Net.content hazIs
blanchet@45301
   791
    val elims =
blanchet@45301
   792
      Item_Net.content safeEs @ Item_Net.content hazEs
blanchet@45301
   793
      |> map Classical.classical_rule
blanchet@42641
   794
    val simps = ctxt |> simpset_of |> dest_ss |> #simps
blanchet@42641
   795
  in
blanchet@43245
   796
    Termtab.empty |> add Intro I I intros
blanchet@43245
   797
                  |> add Elim I I elims
blanchet@43245
   798
                  |> add Simp I snd simps
blanchet@45301
   799
                  |> add Simp atomize snd simps
blanchet@42641
   800
  end
blanchet@38937
   801
nik@44585
   802
fun all_facts ctxt ho_atp reserved exporter add_ths chained_ths =
blanchet@38627
   803
  let
wenzelm@42361
   804
    val thy = Proof_Context.theory_of ctxt
wenzelm@39557
   805
    val global_facts = Global_Theory.facts_of thy
wenzelm@42361
   806
    val local_facts = Proof_Context.facts_of ctxt
blanchet@38644
   807
    val named_locals = local_facts |> Facts.dest_static []
blanchet@38993
   808
    val assms = Assumption.all_assms_of ctxt
blanchet@38993
   809
    fun is_assum th = exists (fn ct => prop_of th aconv term_of ct) assms
blanchet@42957
   810
    val is_chained = member Thm.eq_thm_prop chained_ths
blanchet@43245
   811
    val clasimpset_table = clasimpset_rule_table_of ctxt
blanchet@45301
   812
    fun locality_of_theorem global name th =
blanchet@45301
   813
      if String.isSubstring ".induct" name orelse (*FIXME: use structured name*)
nik@44586
   814
         String.isSubstring ".inducts" name then
blanchet@45301
   815
        Induction
nik@44585
   816
      else if is_chained th then
blanchet@42641
   817
        Chained
blanchet@42641
   818
      else if global then
blanchet@43421
   819
        case Termtab.lookup clasimpset_table (prop_of th) of
blanchet@43421
   820
          SOME loc => loc
blanchet@44783
   821
        | NONE => General
blanchet@45301
   822
      else if is_assum th then
blanchet@45301
   823
        Assum
blanchet@45301
   824
      else
blanchet@45301
   825
        Local
blanchet@38738
   826
    fun is_good_unnamed_local th =
blanchet@38820
   827
      not (Thm.has_name_hint th) andalso
blanchet@42957
   828
      forall (fn (_, ths) => not (member Thm.eq_thm_prop ths th)) named_locals
blanchet@38644
   829
    val unnamed_locals =
blanchet@42957
   830
      union Thm.eq_thm_prop (Facts.props local_facts) chained_ths
blanchet@38820
   831
      |> filter is_good_unnamed_local |> map (pair "" o single)
blanchet@38627
   832
    val full_space =
blanchet@38738
   833
      Name_Space.merge (Facts.space_of global_facts, Facts.space_of local_facts)
blanchet@38752
   834
    fun add_facts global foldx facts =
blanchet@38699
   835
      foldx (fn (name0, ths) =>
blanchet@43576
   836
        if not exporter andalso name0 <> "" andalso
blanchet@42957
   837
           forall (not o member Thm.eq_thm_prop add_ths) ths andalso
blanchet@38699
   838
           (Facts.is_concealed facts name0 orelse
blanchet@42728
   839
            (not (Config.get ctxt ignore_no_atp) andalso
blanchet@42728
   840
             is_package_def name0) orelse
blanchet@42728
   841
            exists (fn s => String.isSuffix s name0)
nik@44585
   842
                   (multi_base_blacklist ctxt ho_atp) orelse
blanchet@38699
   843
            String.isSuffix "_def_raw" (* FIXME: crude hack *) name0) then
blanchet@38627
   844
          I
blanchet@38627
   845
        else
blanchet@38627
   846
          let
blanchet@38699
   847
            val multi = length ths > 1
blanchet@41279
   848
            val backquote_thm =
blanchet@41279
   849
              backquote o string_for_term ctxt o close_form o prop_of
blanchet@38699
   850
            fun check_thms a =
wenzelm@42361
   851
              case try (Proof_Context.get_thms ctxt) a of
blanchet@38699
   852
                NONE => false
blanchet@42957
   853
              | SOME ths' => eq_list Thm.eq_thm_prop (ths, ths')
blanchet@38627
   854
          in
blanchet@38699
   855
            pair 1
blanchet@43245
   856
            #> fold (fn th => fn (j, (multis, unis)) =>
blanchet@42641
   857
                        (j + 1,
blanchet@43576
   858
                         if not (member Thm.eq_thm_prop add_ths th) andalso
nik@44585
   859
                            is_theorem_bad_for_atps ho_atp exporter th then
blanchet@43245
   860
                           (multis, unis)
blanchet@42641
   861
                         else
blanchet@43245
   862
                           let
blanchet@43245
   863
                             val new =
blanchet@43245
   864
                               (((fn () =>
blanchet@42641
   865
                                 if name0 = "" then
blanchet@42641
   866
                                   th |> backquote_thm
blanchet@42641
   867
                                 else
blanchet@42641
   868
                                   [Facts.extern ctxt facts name0,
blanchet@42641
   869
                                    Name_Space.extern ctxt full_space name0,
blanchet@42641
   870
                                    name0]
blanchet@42641
   871
                                   |> find_first check_thms
blanchet@42641
   872
                                   |> (fn SOME name =>
blanchet@42641
   873
                                          make_name reserved multi j name
blanchet@42641
   874
                                        | NONE => "")),
nik@44585
   875
                                locality_of_theorem global name0 th), th)
blanchet@43245
   876
                           in
blanchet@43245
   877
                             if multi then (new :: multis, unis)
blanchet@43245
   878
                             else (multis, new :: unis)
blanchet@43245
   879
                           end)) ths
blanchet@38699
   880
            #> snd
blanchet@38627
   881
          end)
blanchet@38644
   882
  in
blanchet@43245
   883
    (* The single-name theorems go after the multiple-name ones, so that single
blanchet@43245
   884
       names are preferred when both are available. *)
blanchet@43245
   885
    ([], []) |> add_facts false fold local_facts (unnamed_locals @ named_locals)
blanchet@43245
   886
             |> add_facts true Facts.fold_static global_facts global_facts
blanchet@43245
   887
             |> op @
blanchet@38644
   888
  end
blanchet@38627
   889
blanchet@41199
   890
fun external_frees t =
blanchet@41199
   891
  [] |> Term.add_frees t |> filter_out (can Name.dest_internal o fst)
blanchet@41199
   892
nik@44585
   893
fun nearly_all_facts ctxt ho_atp ({add, only, ...} : relevance_override)
nik@44585
   894
                     chained_ths hyp_ts concl_t =
blanchet@43351
   895
  let
blanchet@43351
   896
    val thy = Proof_Context.theory_of ctxt
blanchet@43351
   897
    val reserved = reserved_isar_keyword_table ()
blanchet@43351
   898
    val add_ths = Attrib.eval_thms ctxt add
blanchet@43351
   899
    val ind_stmt =
blanchet@43351
   900
      Logic.list_implies (hyp_ts |> filter_out (null o external_frees), concl_t)
blanchet@43351
   901
      |> Object_Logic.atomize_term thy
blanchet@43351
   902
    val ind_stmt_xs = external_frees ind_stmt
blanchet@43351
   903
  in
blanchet@43351
   904
    (if only then
blanchet@43351
   905
       maps (map (fn ((name, loc), th) => ((K name, loc), th))
blanchet@43351
   906
             o fact_from_ref ctxt reserved chained_ths) add
blanchet@43351
   907
     else
nik@44585
   908
       all_facts ctxt ho_atp reserved false add_ths chained_ths)
blanchet@43351
   909
    |> Config.get ctxt instantiate_inducts
blanchet@43351
   910
       ? maps (instantiate_if_induct_rule ctxt ind_stmt ind_stmt_xs)
blanchet@43351
   911
    |> (not (Config.get ctxt ignore_no_atp) andalso not only)
blanchet@43351
   912
       ? filter_out (No_ATPs.member ctxt o snd)
blanchet@43351
   913
    |> uniquify
blanchet@43351
   914
  end
blanchet@43351
   915
blanchet@44625
   916
fun relevant_facts ctxt (threshold0, threshold1) max_relevant is_built_in_const
blanchet@44625
   917
                   fudge (override as {only, ...}) chained_ths hyp_ts concl_t
blanchet@44625
   918
                   facts =
blanchet@37538
   919
  let
wenzelm@42361
   920
    val thy = Proof_Context.theory_of ctxt
blanchet@38822
   921
    val decay = Math.pow ((1.0 - threshold1) / (1.0 - threshold0),
blanchet@38822
   922
                          1.0 / Real.fromInt (max_relevant + 1))
blanchet@37538
   923
  in
blanchet@42646
   924
    trace_msg ctxt (fn () => "Considering " ^ string_of_int (length facts) ^
blanchet@42646
   925
                             " facts");
blanchet@39366
   926
    (if only orelse threshold1 < 0.0 then
blanchet@40204
   927
       facts
blanchet@39366
   928
     else if threshold0 > 1.0 orelse threshold0 > threshold1 orelse
blanchet@39366
   929
             max_relevant = 0 then
blanchet@38739
   930
       []
blanchet@38739
   931
     else
blanchet@44625
   932
       relevance_filter ctxt threshold0 decay max_relevant is_built_in_const
blanchet@44625
   933
           fudge override facts (chained_ths |> map prop_of) hyp_ts
blanchet@44625
   934
           (concl_t |> theory_constify fudge (Context.theory_name thy)))
blanchet@38822
   935
    |> map (apfst (apfst (fn f => f ())))
blanchet@37538
   936
  end
immler@30536
   937
paulson@15347
   938
end;