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