src/HOL/Tools/Sledgehammer/sledgehammer_fact_filter.ML
author blanchet
Fri May 14 16:15:10 2010 +0200 (2010-05-14 ago)
changeset 36922 12f87df9c1a5
parent 36692 54b64d4ad524
child 36968 62e29faa3718
permissions -rw-r--r--
renamed two Sledgehammer options
blanchet@35826
     1
(*  Title:      HOL/Tools/Sledgehammer/sledgehammer_fact_filter.ML
wenzelm@33309
     2
    Author:     Jia Meng, Cambridge University Computer Laboratory, NICTA
blanchet@36393
     3
    Author:     Jasmin Blanchette, TU Muenchen
wenzelm@33309
     4
*)
paulson@15452
     5
blanchet@35826
     6
signature SLEDGEHAMMER_FACT_FILTER =
wenzelm@16802
     7
sig
blanchet@35865
     8
  type classrel_clause = Sledgehammer_FOL_Clause.classrel_clause
blanchet@35865
     9
  type arity_clause = Sledgehammer_FOL_Clause.arity_clause
blanchet@35826
    10
  type axiom_name = Sledgehammer_HOL_Clause.axiom_name
blanchet@35865
    11
  type hol_clause = Sledgehammer_HOL_Clause.hol_clause
blanchet@35865
    12
  type hol_clause_id = Sledgehammer_HOL_Clause.hol_clause_id
blanchet@36473
    13
blanchet@35966
    14
  type relevance_override =
blanchet@35966
    15
    {add: Facts.ref list,
blanchet@35966
    16
     del: Facts.ref list,
blanchet@35966
    17
     only: bool}
blanchet@35966
    18
paulson@22989
    19
  val tvar_classes_of_terms : term list -> string list
paulson@22989
    20
  val tfree_classes_of_terms : term list -> string list
paulson@22989
    21
  val type_consts_of_terms : theory -> term list -> string list
blanchet@35963
    22
  val get_relevant_facts :
blanchet@36473
    23
    bool -> real -> real -> bool -> int -> bool -> relevance_override
blanchet@36473
    24
    -> Proof.context * (thm list * 'a) -> thm list
blanchet@35963
    25
    -> (thm * (string * int)) list
blanchet@36473
    26
  val prepare_clauses :
blanchet@36473
    27
    bool -> thm list -> thm list -> (thm * (axiom_name * hol_clause_id)) list
blanchet@36473
    28
    -> (thm * (axiom_name * hol_clause_id)) list -> theory
blanchet@36473
    29
    -> axiom_name vector
blanchet@36473
    30
       * (hol_clause list * hol_clause list * hol_clause list *
blanchet@36473
    31
          hol_clause list * classrel_clause list * arity_clause list)
paulson@15347
    32
end;
paulson@15347
    33
blanchet@35826
    34
structure Sledgehammer_Fact_Filter : SLEDGEHAMMER_FACT_FILTER =
paulson@15347
    35
struct
paulson@15347
    36
blanchet@35865
    37
open Sledgehammer_FOL_Clause
blanchet@35865
    38
open Sledgehammer_Fact_Preprocessor
blanchet@35865
    39
open Sledgehammer_HOL_Clause
blanchet@35826
    40
blanchet@35966
    41
type relevance_override =
blanchet@35966
    42
  {add: Facts.ref list,
blanchet@35966
    43
   del: Facts.ref list,
blanchet@35966
    44
   only: bool}
paulson@21070
    45
wenzelm@28477
    46
(***************************************************************)
wenzelm@28477
    47
(* Relevance Filtering                                         *)
wenzelm@28477
    48
(***************************************************************)
mengj@19194
    49
blanchet@35865
    50
fun strip_Trueprop (@{const Trueprop} $ t) = t
paulson@24958
    51
  | strip_Trueprop t = t;
mengj@19194
    52
paulson@24287
    53
(*A surprising number of theorems contain only a few significant constants.
paulson@24287
    54
  These include all induction rules, and other general theorems. Filtering
paulson@24287
    55
  theorems in clause form reveals these complexities in the form of Skolem 
paulson@24287
    56
  functions. If we were instead to filter theorems in their natural form,
paulson@24287
    57
  some other method of measuring theorem complexity would become necessary.*)
paulson@24287
    58
paulson@24287
    59
fun log_weight2 (x:real) = 1.0 + 2.0/Math.ln (x+1.0);
paulson@24287
    60
paulson@24287
    61
(*The default seems best in practice. A constant function of one ignores
paulson@24287
    62
  the constant frequencies.*)
wenzelm@28477
    63
val weight_fn = log_weight2;
paulson@24287
    64
paulson@24287
    65
paulson@24287
    66
(*Including equality in this list might be expected to stop rules like subset_antisym from
paulson@24287
    67
  being chosen, but for some reason filtering works better with them listed. The
paulson@24287
    68
  logical signs All, Ex, &, and --> are omitted because any remaining occurrrences
paulson@24287
    69
  must be within comprehensions.*)
blanchet@35865
    70
val standard_consts =
blanchet@35865
    71
  [@{const_name Trueprop}, @{const_name "==>"}, @{const_name all},
blanchet@35865
    72
   @{const_name "=="}, @{const_name "op |"}, @{const_name Not},
blanchet@35865
    73
   @{const_name "op ="}];
paulson@24287
    74
paulson@24287
    75
paulson@24287
    76
(*** constants with types ***)
paulson@24287
    77
paulson@24287
    78
(*An abstraction of Isabelle types*)
paulson@24287
    79
datatype const_typ =  CTVar | CType of string * const_typ list
paulson@24287
    80
paulson@24287
    81
(*Is the second type an instance of the first one?*)
paulson@24287
    82
fun match_type (CType(con1,args1)) (CType(con2,args2)) = 
paulson@24287
    83
      con1=con2 andalso match_types args1 args2
paulson@24287
    84
  | match_type CTVar _ = true
paulson@24287
    85
  | match_type _ CTVar = false
paulson@24287
    86
and match_types [] [] = true
paulson@24287
    87
  | match_types (a1::as1) (a2::as2) = match_type a1 a2 andalso match_types as1 as2;
paulson@24287
    88
paulson@24287
    89
(*Is there a unifiable constant?*)
paulson@24287
    90
fun uni_mem gctab (c,c_typ) =
paulson@24287
    91
  case Symtab.lookup gctab c of
paulson@24287
    92
      NONE => false
paulson@24287
    93
    | SOME ctyps_list => exists (match_types c_typ) ctyps_list;
paulson@24287
    94
  
paulson@24287
    95
(*Maps a "real" type to a const_typ*)
paulson@24287
    96
fun const_typ_of (Type (c,typs)) = CType (c, map const_typ_of typs) 
paulson@24287
    97
  | const_typ_of (TFree _) = CTVar
paulson@24287
    98
  | const_typ_of (TVar _) = CTVar
paulson@24287
    99
paulson@24287
   100
(*Pairs a constant with the list of its type instantiations (using const_typ)*)
paulson@24287
   101
fun const_with_typ thy (c,typ) = 
paulson@24287
   102
    let val tvars = Sign.const_typargs thy (c,typ)
paulson@24287
   103
    in (c, map const_typ_of tvars) end
paulson@24287
   104
    handle TYPE _ => (c,[]);   (*Variable (locale constant): monomorphic*)   
paulson@24287
   105
paulson@24287
   106
(*Add a const/type pair to the table, but a [] entry means a standard connective,
paulson@24287
   107
  which we ignore.*)
paulson@24287
   108
fun add_const_typ_table ((c,ctyps), tab) =
paulson@24287
   109
  Symtab.map_default (c, [ctyps]) (fn [] => [] | ctyps_list => insert (op =) ctyps ctyps_list) 
paulson@24287
   110
    tab;
paulson@24287
   111
paulson@24287
   112
(*Free variables are included, as well as constants, to handle locales*)
paulson@24287
   113
fun add_term_consts_typs_rm thy (Const(c, typ), tab) =
paulson@24287
   114
      add_const_typ_table (const_with_typ thy (c,typ), tab) 
paulson@24287
   115
  | add_term_consts_typs_rm thy (Free(c, typ), tab) =
paulson@24287
   116
      add_const_typ_table (const_with_typ thy (c,typ), tab) 
paulson@24287
   117
  | add_term_consts_typs_rm thy (t $ u, tab) =
paulson@24287
   118
      add_term_consts_typs_rm thy (t, add_term_consts_typs_rm thy (u, tab))
paulson@24287
   119
  | add_term_consts_typs_rm thy (Abs(_,_,t), tab) = add_term_consts_typs_rm thy (t, tab)
wenzelm@32994
   120
  | add_term_consts_typs_rm _ (_, tab) = tab;
paulson@24287
   121
paulson@24287
   122
(*The empty list here indicates that the constant is being ignored*)
paulson@24287
   123
fun add_standard_const (s,tab) = Symtab.update (s,[]) tab;
paulson@24287
   124
paulson@24287
   125
val null_const_tab : const_typ list list Symtab.table = 
wenzelm@30190
   126
    List.foldl add_standard_const Symtab.empty standard_consts;
paulson@24287
   127
wenzelm@30190
   128
fun get_goal_consts_typs thy = List.foldl (add_term_consts_typs_rm thy) null_const_tab;
paulson@24287
   129
paulson@24287
   130
(*Inserts a dummy "constant" referring to the theory name, so that relevance
paulson@24287
   131
  takes the given theory into account.*)
blanchet@36220
   132
fun const_prop_of theory_relevant th =
blanchet@36220
   133
 if theory_relevant then
paulson@24287
   134
  let val name = Context.theory_name (theory_of_thm th)
paulson@24287
   135
      val t = Const (name ^ ". 1", HOLogic.boolT)
paulson@24287
   136
  in  t $ prop_of th  end
paulson@24287
   137
 else prop_of th;
paulson@24287
   138
paulson@24287
   139
(**** Constant / Type Frequencies ****)
paulson@24287
   140
paulson@24287
   141
(*A two-dimensional symbol table counts frequencies of constants. It's keyed first by
paulson@24287
   142
  constant name and second by its list of type instantiations. For the latter, we need
paulson@24287
   143
  a linear ordering on type const_typ list.*)
paulson@24287
   144
  
paulson@24287
   145
local
paulson@24287
   146
paulson@24287
   147
fun cons_nr CTVar = 0
paulson@24287
   148
  | cons_nr (CType _) = 1;
paulson@24287
   149
paulson@24287
   150
in
paulson@24287
   151
paulson@24287
   152
fun const_typ_ord TU =
paulson@24287
   153
  case TU of
paulson@24287
   154
    (CType (a, Ts), CType (b, Us)) =>
paulson@24287
   155
      (case fast_string_ord(a,b) of EQUAL => dict_ord const_typ_ord (Ts,Us) | ord => ord)
paulson@24287
   156
  | (T, U) => int_ord (cons_nr T, cons_nr U);
paulson@24287
   157
paulson@24287
   158
end;
paulson@24287
   159
wenzelm@31971
   160
structure CTtab = Table(type key = const_typ list val ord = dict_ord const_typ_ord);
paulson@24287
   161
blanchet@36220
   162
fun count_axiom_consts theory_relevant thy ((thm,_), tab) = 
paulson@24287
   163
  let fun count_const (a, T, tab) =
wenzelm@32960
   164
        let val (c, cts) = const_with_typ thy (a,T)
wenzelm@32960
   165
        in  (*Two-dimensional table update. Constant maps to types maps to count.*)
wenzelm@32960
   166
            Symtab.map_default (c, CTtab.empty) 
wenzelm@32960
   167
                               (CTtab.map_default (cts,0) (fn n => n+1)) tab
wenzelm@32960
   168
        end
paulson@24287
   169
      fun count_term_consts (Const(a,T), tab) = count_const(a,T,tab)
wenzelm@32960
   170
        | count_term_consts (Free(a,T), tab) = count_const(a,T,tab)
wenzelm@32960
   171
        | count_term_consts (t $ u, tab) =
wenzelm@32960
   172
            count_term_consts (t, count_term_consts (u, tab))
wenzelm@32960
   173
        | count_term_consts (Abs(_,_,t), tab) = count_term_consts (t, tab)
wenzelm@32960
   174
        | count_term_consts (_, tab) = tab
blanchet@36220
   175
  in  count_term_consts (const_prop_of theory_relevant thm, tab)  end;
paulson@24287
   176
paulson@24287
   177
paulson@24287
   178
(**** Actual Filtering Code ****)
paulson@24287
   179
paulson@24287
   180
(*The frequency of a constant is the sum of those of all instances of its type.*)
paulson@24287
   181
fun const_frequency ctab (c, cts) =
blanchet@36185
   182
  CTtab.fold (fn (cts', m) => match_types cts cts' ? Integer.add m)
blanchet@36185
   183
             (the (Symtab.lookup ctab c)) 0
paulson@24287
   184
paulson@24287
   185
(*Add in a constant's weight, as determined by its frequency.*)
paulson@24287
   186
fun add_ct_weight ctab ((c,T), w) =
wenzelm@28477
   187
  w + weight_fn (real (const_frequency ctab (c,T)));
paulson@24287
   188
paulson@24287
   189
(*Relevant constants are weighted according to frequency, 
paulson@24287
   190
  but irrelevant constants are simply counted. Otherwise, Skolem functions,
paulson@24287
   191
  which are rare, would harm a clause's chances of being picked.*)
paulson@24287
   192
fun clause_weight ctab gctyps consts_typs =
paulson@24287
   193
    let val rel = filter (uni_mem gctyps) consts_typs
paulson@24287
   194
        val rel_weight = List.foldl (add_ct_weight ctab) 0.0 rel
paulson@24287
   195
    in
wenzelm@32960
   196
        rel_weight / (rel_weight + real (length consts_typs - length rel))
paulson@24287
   197
    end;
paulson@24287
   198
    
paulson@24287
   199
(*Multiplies out to a list of pairs: 'a * 'b list -> ('a * 'b) list -> ('a * 'b) list*)
wenzelm@30190
   200
fun add_expand_pairs (x,ys) xys = List.foldl (fn (y,acc) => (x,y)::acc) xys ys;
paulson@24287
   201
paulson@24287
   202
fun consts_typs_of_term thy t = 
paulson@24287
   203
  let val tab = add_term_consts_typs_rm thy (t, null_const_tab)
paulson@24287
   204
  in  Symtab.fold add_expand_pairs tab []  end;
paulson@24287
   205
blanchet@36220
   206
fun pair_consts_typs_axiom theory_relevant thy (p as (thm, _)) =
blanchet@36220
   207
  (p, (consts_typs_of_term thy (const_prop_of theory_relevant thm)));
paulson@24287
   208
paulson@24287
   209
exception ConstFree;
paulson@24287
   210
fun dest_ConstFree (Const aT) = aT
paulson@24287
   211
  | dest_ConstFree (Free aT) = aT
paulson@24287
   212
  | dest_ConstFree _ = raise ConstFree;
paulson@24287
   213
paulson@24287
   214
(*Look for definitions of the form f ?x1 ... ?xn = t, but not reversed.*)
wenzelm@32994
   215
fun defines thy thm gctypes =
paulson@24287
   216
    let val tm = prop_of thm
wenzelm@32960
   217
        fun defs lhs rhs =
paulson@24287
   218
            let val (rator,args) = strip_comb lhs
wenzelm@32960
   219
                val ct = const_with_typ thy (dest_ConstFree rator)
haftmann@33037
   220
            in
haftmann@33037
   221
              forall is_Var args andalso uni_mem gctypes ct andalso
haftmann@33038
   222
                subset (op =) (Term.add_vars rhs [], Term.add_vars lhs [])
paulson@24287
   223
            end
wenzelm@32960
   224
            handle ConstFree => false
paulson@24287
   225
    in    
blanchet@35963
   226
        case tm of
blanchet@35963
   227
          @{const Trueprop} $ (Const (@{const_name "op ="}, _) $ lhs $ rhs) => 
blanchet@35963
   228
            defs lhs rhs 
blanchet@35963
   229
        | _ => false
paulson@24287
   230
    end;
paulson@24287
   231
paulson@24287
   232
type annotd_cls = (thm * (string * int)) * ((string * const_typ list) list);
paulson@24287
   233
       
paulson@24287
   234
(*For a reverse sort, putting the largest values first.*)
paulson@24287
   235
fun compare_pairs ((_,w1),(_,w2)) = Real.compare (w2,w1);
paulson@24287
   236
paulson@24287
   237
(*Limit the number of new clauses, to prevent runaway acceptance.*)
wenzelm@28477
   238
fun take_best max_new (newpairs : (annotd_cls*real) list) =
paulson@24287
   239
  let val nnew = length newpairs
paulson@24287
   240
  in
wenzelm@28477
   241
    if nnew <= max_new then (map #1 newpairs, [])
paulson@24287
   242
    else 
paulson@24287
   243
      let val cls = sort compare_pairs newpairs
wenzelm@28477
   244
          val accepted = List.take (cls, max_new)
paulson@24287
   245
      in
blanchet@35865
   246
        trace_msg (fn () => ("Number of candidates, " ^ Int.toString nnew ^ 
wenzelm@32960
   247
                       ", exceeds the limit of " ^ Int.toString (max_new)));
blanchet@35865
   248
        trace_msg (fn () => ("Effective pass mark: " ^ Real.toString (#2 (List.last accepted))));
blanchet@35865
   249
        trace_msg (fn () => "Actually passed: " ^
paulson@24287
   250
          space_implode ", " (map (fn (((_,(name,_)),_),_) => name) accepted));
paulson@24287
   251
wenzelm@32960
   252
        (map #1 accepted, map #1 (List.drop (cls, max_new)))
paulson@24287
   253
      end
paulson@24287
   254
  end;
paulson@24287
   255
blanchet@36922
   256
fun relevant_clauses ctxt relevance_convergence defs_relevant max_new
blanchet@36182
   257
                     (relevance_override as {add, del, only}) thy ctab =
blanchet@36182
   258
  let
blanchet@36227
   259
    val thms_for_facts =
blanchet@36227
   260
      maps (maps (cnf_axiom thy) o ProofContext.get_fact ctxt)
blanchet@36227
   261
    val add_thms = thms_for_facts add
blanchet@36227
   262
    val del_thms = thms_for_facts del
blanchet@36182
   263
    fun iter p rel_consts =
blanchet@36182
   264
      let
blanchet@36182
   265
        fun relevant ([], _) [] = []  (* Nothing added this iteration *)
blanchet@36182
   266
          | relevant (newpairs,rejects) [] =
blanchet@36182
   267
            let
blanchet@36182
   268
              val (newrels, more_rejects) = take_best max_new newpairs
blanchet@36182
   269
              val new_consts = maps #2 newrels
blanchet@36182
   270
              val rel_consts' = List.foldl add_const_typ_table rel_consts new_consts
blanchet@36922
   271
              val newp = p + (1.0 - p) / relevance_convergence
wenzelm@32960
   272
            in
blanchet@36182
   273
              trace_msg (fn () => "relevant this iteration: " ^
blanchet@36182
   274
                                  Int.toString (length newrels));
blanchet@36182
   275
              map #1 newrels @ iter newp rel_consts' (more_rejects @ rejects)
wenzelm@32960
   276
            end
blanchet@36182
   277
          | relevant (newrels, rejects)
blanchet@36182
   278
                     ((ax as (clsthm as (thm, (name, n)), consts_typs)) :: axs) =
blanchet@35966
   279
            let
blanchet@35966
   280
              val weight = if member Thm.eq_thm del_thms thm then 0.0
blanchet@35966
   281
                           else if member Thm.eq_thm add_thms thm then 1.0
blanchet@35966
   282
                           else if only then 0.0
blanchet@35966
   283
                           else clause_weight ctab rel_consts consts_typs
wenzelm@32960
   284
            in
blanchet@36182
   285
              if p <= weight orelse
blanchet@36922
   286
                 (defs_relevant andalso defines thy (#1 clsthm) rel_consts) then
blanchet@36182
   287
                (trace_msg (fn () => name ^ " clause " ^ Int.toString n ^ 
blanchet@36182
   288
                                     " passes: " ^ Real.toString weight);
blanchet@36182
   289
                relevant ((ax, weight) :: newrels, rejects) axs)
blanchet@36182
   290
              else
blanchet@36182
   291
                relevant (newrels, ax :: rejects) axs
wenzelm@32960
   292
            end
blanchet@36182
   293
        in
blanchet@36182
   294
          trace_msg (fn () => "relevant_clauses, current pass mark: " ^
blanchet@36182
   295
                              Real.toString p);
blanchet@36182
   296
          relevant ([], [])
blanchet@36182
   297
        end
blanchet@36182
   298
  in iter end
wenzelm@32960
   299
        
blanchet@36922
   300
fun relevance_filter ctxt relevance_threshold relevance_convergence
blanchet@36922
   301
                     defs_relevant max_new theory_relevant relevance_override
blanchet@36922
   302
                     thy axioms goals = 
blanchet@35966
   303
  if relevance_threshold > 0.0 then
blanchet@35963
   304
    let
blanchet@36220
   305
      val const_tab = List.foldl (count_axiom_consts theory_relevant thy)
blanchet@35963
   306
                                 Symtab.empty axioms
paulson@24287
   307
      val goal_const_tab = get_goal_consts_typs thy goals
blanchet@35963
   308
      val _ =
blanchet@35963
   309
        trace_msg (fn () => "Initial constants: " ^
blanchet@35963
   310
                            commas (Symtab.keys goal_const_tab))
blanchet@35963
   311
      val relevant =
blanchet@36922
   312
        relevant_clauses ctxt relevance_convergence defs_relevant max_new
blanchet@36922
   313
                         relevance_override thy const_tab relevance_threshold
blanchet@36922
   314
                         goal_const_tab
blanchet@36220
   315
                         (map (pair_consts_typs_axiom theory_relevant thy)
blanchet@36220
   316
                              axioms)
blanchet@35963
   317
    in
blanchet@35963
   318
      trace_msg (fn () => "Total relevant: " ^ Int.toString (length relevant));
blanchet@35963
   319
      relevant
blanchet@35963
   320
    end
blanchet@35963
   321
  else
blanchet@35963
   322
    axioms;
paulson@24287
   323
paulson@24287
   324
(***************************************************************)
mengj@19768
   325
(* Retrieving and filtering lemmas                             *)
mengj@19768
   326
(***************************************************************)
mengj@19768
   327
paulson@33022
   328
(*** retrieve lemmas and filter them ***)
mengj@19768
   329
mengj@19768
   330
(*Hashing to detect duplicate and variant clauses, e.g. from the [iff] attribute*)
mengj@19768
   331
paulson@22382
   332
fun setinsert (x,s) = Symtab.update (x,()) s;
mengj@19768
   333
paulson@20757
   334
(*Reject theorems with names like "List.filter.filter_list_def" or
paulson@21690
   335
  "Accessible_Part.acc.defs", as these are definitions arising from packages.*)
paulson@20757
   336
fun is_package_def a =
wenzelm@30364
   337
  let val names = Long_Name.explode a
paulson@21690
   338
  in
paulson@21690
   339
     length names > 2 andalso
paulson@21690
   340
     not (hd names = "local") andalso
paulson@21690
   341
     String.isSuffix "_def" a  orelse  String.isSuffix "_defs" a
paulson@21690
   342
  end;
paulson@20757
   343
blanchet@36061
   344
fun mk_clause_table xs =
blanchet@36061
   345
  fold (Termtab.update o `(prop_of o fst)) xs Termtab.empty
paulson@22382
   346
blanchet@36061
   347
fun make_unique xs =
blanchet@36061
   348
  Termtab.fold (cons o snd) (mk_clause_table xs) []
mengj@19768
   349
blanchet@36061
   350
(* Remove existing axiom clauses from the conjecture clauses, as this can
blanchet@36061
   351
   dramatically boost an ATP's performance (for some reason). *)
blanchet@36061
   352
fun subtract_cls ax_clauses =
blanchet@36061
   353
  filter_out (Termtab.defined (mk_clause_table ax_clauses) o prop_of)
mengj@19768
   354
blanchet@36058
   355
fun all_valid_thms respect_no_atp ctxt =
paulson@22382
   356
  let
wenzelm@26675
   357
    val global_facts = PureThy.facts_of (ProofContext.theory_of ctxt);
wenzelm@26278
   358
    val local_facts = ProofContext.facts_of ctxt;
wenzelm@33641
   359
    val full_space =
wenzelm@33641
   360
      Name_Space.merge (Facts.space_of global_facts, Facts.space_of local_facts);
wenzelm@33641
   361
wenzelm@33641
   362
    fun valid_facts facts =
wenzelm@33641
   363
      (facts, []) |-> Facts.fold_static (fn (name, ths0) =>
wenzelm@33641
   364
        let
wenzelm@33641
   365
          fun check_thms a =
wenzelm@33641
   366
            (case try (ProofContext.get_thms ctxt) a of
wenzelm@33641
   367
              NONE => false
wenzelm@33641
   368
            | SOME ths1 => Thm.eq_thms (ths0, ths1));
wenzelm@33641
   369
wenzelm@33641
   370
          val name1 = Facts.extern facts name;
wenzelm@33641
   371
          val name2 = Name_Space.extern full_space name;
blanchet@35865
   372
          val ths = filter_out bad_for_atp ths0;
wenzelm@33641
   373
        in
wenzelm@33641
   374
          if Facts.is_concealed facts name orelse null ths orelse
blanchet@36227
   375
             (respect_no_atp andalso is_package_def name) then
blanchet@36227
   376
            I
blanchet@36227
   377
          else case find_first check_thms [name1, name2, name] of
blanchet@36227
   378
            NONE => I
blanchet@36227
   379
          | SOME a => cons (a, ths)
wenzelm@33641
   380
        end);
wenzelm@26675
   381
  in valid_facts global_facts @ valid_facts local_facts end;
paulson@21224
   382
wenzelm@33309
   383
fun multi_name a th (n, pairs) =
wenzelm@33309
   384
  (n + 1, (a ^ "(" ^ Int.toString n ^ ")", th) :: pairs);
paulson@21224
   385
wenzelm@33309
   386
fun add_single_names (a, []) pairs = pairs
wenzelm@33309
   387
  | add_single_names (a, [th]) pairs = (a, th) :: pairs
wenzelm@33309
   388
  | add_single_names (a, ths) pairs = #2 (fold (multi_name a) ths (1, pairs));
paulson@21431
   389
paulson@22382
   390
(*Ignore blacklisted basenames*)
wenzelm@33309
   391
fun add_multi_names (a, ths) pairs =
haftmann@36692
   392
  if member (op =) multi_base_blacklist (Long_Name.base_name a) then pairs
wenzelm@33309
   393
  else add_single_names (a, ths) pairs;
paulson@21224
   394
paulson@21290
   395
fun is_multi (a, ths) = length ths > 1 orelse String.isSuffix ".axioms" a;
paulson@21290
   396
blanchet@36550
   397
(* The single-name theorems go after the multiple-name ones, so that single
blanchet@36550
   398
   names are preferred when both are available. *)
blanchet@36058
   399
fun name_thm_pairs respect_no_atp ctxt =
wenzelm@33309
   400
  let
blanchet@36058
   401
    val (mults, singles) =
blanchet@36058
   402
      List.partition is_multi (all_valid_thms respect_no_atp ctxt)
blanchet@36550
   403
    val ps = [] |> fold add_single_names singles
blanchet@36550
   404
                |> fold add_multi_names mults
blanchet@36060
   405
  in ps |> respect_no_atp ? filter_out (No_ATPs.member ctxt o snd) end;
paulson@21224
   406
wenzelm@32091
   407
fun check_named ("", th) =
wenzelm@32091
   408
      (warning ("No name for theorem " ^ Display.string_of_thm_without_context th); false)
wenzelm@32994
   409
  | check_named _ = true;
paulson@19894
   410
blanchet@36058
   411
fun get_all_lemmas respect_no_atp ctxt =
paulson@19894
   412
  let val included_thms =
blanchet@35865
   413
        tap (fn ths => trace_msg
paulson@33022
   414
                     (fn () => ("Including all " ^ Int.toString (length ths) ^ " theorems")))
blanchet@36058
   415
            (name_thm_pairs respect_no_atp ctxt)
paulson@19894
   416
  in
immler@31410
   417
    filter check_named included_thms
paulson@19894
   418
  end;
mengj@19768
   419
paulson@21290
   420
(***************************************************************)
paulson@21290
   421
(* Type Classes Present in the Axiom or Conjecture Clauses     *)
paulson@21290
   422
(***************************************************************)
paulson@21290
   423
wenzelm@32952
   424
fun add_classes (sorts, cset) = List.foldl setinsert cset (flat sorts);
paulson@21290
   425
paulson@21290
   426
(*Remove this trivial type class*)
blanchet@35865
   427
fun delete_type cset = Symtab.delete_safe (the_single @{sort HOL.type}) cset;
paulson@21290
   428
paulson@21290
   429
fun tvar_classes_of_terms ts =
wenzelm@29270
   430
  let val sorts_list = map (map #2 o OldTerm.term_tvars) ts
wenzelm@30190
   431
  in  Symtab.keys (delete_type (List.foldl add_classes Symtab.empty sorts_list))  end;
paulson@21290
   432
paulson@21290
   433
fun tfree_classes_of_terms ts =
wenzelm@29270
   434
  let val sorts_list = map (map #2 o OldTerm.term_tfrees) ts
wenzelm@30190
   435
  in  Symtab.keys (delete_type (List.foldl add_classes Symtab.empty sorts_list))  end;
paulson@20526
   436
paulson@21373
   437
(*fold type constructors*)
paulson@21373
   438
fun fold_type_consts f (Type (a, Ts)) x = fold (fold_type_consts f) Ts (f (a,x))
wenzelm@32994
   439
  | fold_type_consts _ _ x = x;
paulson@21373
   440
paulson@21373
   441
val add_type_consts_in_type = fold_type_consts setinsert;
paulson@21373
   442
paulson@21397
   443
(*Type constructors used to instantiate overloaded constants are the only ones needed.*)
paulson@21397
   444
fun add_type_consts_in_term thy =
paulson@21397
   445
  let val const_typargs = Sign.const_typargs thy
paulson@21397
   446
      fun add_tcs (Const cT) x = fold add_type_consts_in_type (const_typargs cT) x
wenzelm@32994
   447
        | add_tcs (Abs (_, _, u)) x = add_tcs u x
paulson@21397
   448
        | add_tcs (t $ u) x = add_tcs t (add_tcs u x)
paulson@21397
   449
        | add_tcs _ x = x
paulson@21397
   450
  in  add_tcs  end
paulson@21373
   451
paulson@21397
   452
fun type_consts_of_terms thy ts =
paulson@21397
   453
  Symtab.keys (fold (add_type_consts_in_term thy) ts Symtab.empty);
paulson@21373
   454
paulson@21373
   455
mengj@19194
   456
(***************************************************************)
mengj@19194
   457
(* ATP invocation methods setup                                *)
mengj@19194
   458
(***************************************************************)
mengj@19194
   459
paulson@20526
   460
(*Ensures that no higher-order theorems "leak out"*)
paulson@24958
   461
fun restrict_to_logic thy true cls = filter (Meson.is_fol_term thy o prop_of o fst) cls
paulson@24958
   462
  | restrict_to_logic thy false cls = cls;
paulson@20526
   463
paulson@21470
   464
(**** Predicates to detect unwanted clauses (prolific or likely to cause unsoundness) ****)
paulson@21470
   465
paulson@21470
   466
(** Too general means, positive equality literal with a variable X as one operand,
paulson@21470
   467
  when X does not occur properly in the other operand. This rules out clearly
paulson@21470
   468
  inconsistent clauses such as V=a|V=b, though it by no means guarantees soundness. **)
wenzelm@21588
   469
paulson@21470
   470
fun occurs ix =
paulson@21470
   471
    let fun occ(Var (jx,_)) = (ix=jx)
paulson@21470
   472
          | occ(t1$t2)      = occ t1 orelse occ t2
paulson@21470
   473
          | occ(Abs(_,_,t)) = occ t
paulson@21470
   474
          | occ _           = false
paulson@21470
   475
    in occ end;
paulson@21470
   476
haftmann@31723
   477
fun is_recordtype T = not (null (Record.dest_recTs T));
paulson@21470
   478
paulson@21470
   479
(*Unwanted equalities include
paulson@21470
   480
  (1) those between a variable that does not properly occur in the second operand,
paulson@21470
   481
  (2) those between a variable and a record, since these seem to be prolific "cases" thms
wenzelm@21588
   482
*)
paulson@21470
   483
fun too_general_eqterms (Var (ix,T), t) = not (occurs ix t) orelse is_recordtype T
paulson@21470
   484
  | too_general_eqterms _ = false;
paulson@21470
   485
blanchet@35865
   486
fun too_general_equality (Const (@{const_name "op ="}, _) $ x $ y) =
paulson@21470
   487
      too_general_eqterms (x,y) orelse too_general_eqterms(y,x)
paulson@21470
   488
  | too_general_equality _ = false;
paulson@21470
   489
wenzelm@29267
   490
fun has_typed_var tycons = exists_subterm
wenzelm@29267
   491
  (fn Var (_, Type (a, _)) => member (op =) tycons a | _ => false);
paulson@21431
   492
paulson@22217
   493
(*Clauses are forbidden to contain variables of these types. The typical reason is that
paulson@22217
   494
  they lead to unsoundness. Note that "unit" satisfies numerous equations like ?X=().
paulson@22217
   495
  The resulting clause will have no type constraint, yielding false proofs. Even "bool"
paulson@22217
   496
  leads to many unsound proofs, though (obviously) only for higher-order problems.*)
blanchet@35865
   497
val unwanted_types = [@{type_name unit}, @{type_name bool}];
paulson@22217
   498
paulson@21470
   499
fun unwanted t =
blanchet@35865
   500
  t = @{prop True} orelse has_typed_var unwanted_types t orelse
paulson@24958
   501
  forall too_general_equality (HOLogic.disjuncts (strip_Trueprop t));
paulson@21470
   502
paulson@21431
   503
(*Clauses containing variables of type "unit" or "bool" are unlikely to be useful and
paulson@21431
   504
  likely to lead to unsound proofs.*)
paulson@22217
   505
fun remove_unwanted_clauses cls = filter (not o unwanted o prop_of o fst) cls;
paulson@21431
   506
blanchet@36473
   507
fun is_first_order thy = forall (Meson.is_fol_term thy) o map prop_of
immler@30536
   508
blanchet@36922
   509
fun get_relevant_facts respect_no_atp relevance_threshold relevance_convergence
blanchet@36922
   510
                       defs_relevant max_new theory_relevant
blanchet@36185
   511
                       (relevance_override as {add, only, ...})
blanchet@36185
   512
                       (ctxt, (chain_ths, th)) goal_cls =
blanchet@36185
   513
  if (only andalso null add) orelse relevance_threshold > 1.0 then
blanchet@36185
   514
    []
blanchet@36185
   515
  else
blanchet@36185
   516
    let
blanchet@36185
   517
      val thy = ProofContext.theory_of ctxt
blanchet@36473
   518
      val is_FO = is_first_order thy goal_cls
blanchet@36185
   519
      val included_cls = get_all_lemmas respect_no_atp ctxt
blanchet@36185
   520
        |> cnf_rules_pairs thy |> make_unique
blanchet@36185
   521
        |> restrict_to_logic thy is_FO
blanchet@36185
   522
        |> remove_unwanted_clauses
blanchet@36185
   523
    in
blanchet@36922
   524
      relevance_filter ctxt relevance_threshold relevance_convergence
blanchet@36922
   525
                       defs_relevant max_new theory_relevant relevance_override
blanchet@36922
   526
                       thy included_cls (map prop_of goal_cls)
blanchet@36185
   527
    end
immler@30536
   528
immler@31752
   529
(* prepare for passing to writer,
immler@31752
   530
   create additional clauses based on the information from extra_cls *)
blanchet@36473
   531
fun prepare_clauses dfg goal_cls chain_ths axcls extra_cls thy =
immler@31409
   532
  let
Philipp@32866
   533
    (* add chain thms *)
wenzelm@33306
   534
    val chain_cls =
blanchet@36227
   535
      cnf_rules_pairs thy (filter check_named
blanchet@36227
   536
                                  (map (`Thm.get_name_hint) chain_ths))
Philipp@32866
   537
    val axcls = chain_cls @ axcls
Philipp@32866
   538
    val extra_cls = chain_cls @ extra_cls
blanchet@36473
   539
    val is_FO = is_first_order thy goal_cls
blanchet@36061
   540
    val ccls = subtract_cls extra_cls goal_cls
blanchet@35865
   541
    val _ = app (fn th => trace_msg (fn _ => Display.string_of_thm_global thy th)) ccls
immler@30536
   542
    val ccltms = map prop_of ccls
immler@31752
   543
    and axtms = map (prop_of o #1) extra_cls
immler@30536
   544
    val subs = tfree_classes_of_terms ccltms
immler@30536
   545
    and supers = tvar_classes_of_terms axtms
blanchet@35865
   546
    and tycons = type_consts_of_terms thy (ccltms @ axtms)
immler@30536
   547
    (*TFrees in conjecture clauses; TVars in axiom clauses*)
blanchet@35865
   548
    val conjectures = make_conjecture_clauses dfg thy ccls
blanchet@35865
   549
    val (_, extra_clauses) = ListPair.unzip (make_axiom_clauses dfg thy extra_cls)
blanchet@35865
   550
    val (clnames, axiom_clauses) = ListPair.unzip (make_axiom_clauses dfg thy axcls)
blanchet@35865
   551
    val helper_clauses = get_helper_clauses dfg thy is_FO (conjectures, extra_cls, [])
blanchet@35865
   552
    val (supers', arity_clauses) = make_arity_clauses_dfg dfg thy tycons supers
blanchet@35865
   553
    val classrel_clauses = make_classrel_clauses thy subs supers'
immler@30536
   554
  in
immler@31752
   555
    (Vector.fromList clnames,
immler@31865
   556
      (conjectures, axiom_clauses, extra_clauses, helper_clauses, classrel_clauses, arity_clauses))
immler@31409
   557
  end
quigley@15644
   558
paulson@15347
   559
end;