src/HOL/Tools/res_atp.ML
author wenzelm
Thu Nov 12 20:33:26 2009 +0100 (2009-11-12)
changeset 33641 af07d9cd86ce
parent 33316 6a72af4e84b8
permissions -rw-r--r--
all_valid_thms: more sophisticated check against global + local name space;
wenzelm@33309
     1
(*  Title:      HOL/Tools/res_atp.ML
wenzelm@33309
     2
    Author:     Jia Meng, Cambridge University Computer Laboratory, NICTA
wenzelm@33309
     3
*)
paulson@15452
     4
wenzelm@16802
     5
signature RES_ATP =
wenzelm@16802
     6
sig
mengj@19194
     7
  datatype mode = Auto | Fol | Hol
paulson@22989
     8
  val tvar_classes_of_terms : term list -> string list
paulson@22989
     9
  val tfree_classes_of_terms : term list -> string list
paulson@22989
    10
  val type_consts_of_terms : theory -> term list -> string list
immler@31409
    11
  val get_relevant : int -> bool -> Proof.context * (thm list * 'a) -> thm list ->
immler@31409
    12
    (thm * (string * int)) list
immler@31410
    13
  val prepare_clauses : bool -> thm list -> thm list ->
wenzelm@33316
    14
    (thm * (Res_HOL_Clause.axiom_name * Res_HOL_Clause.clause_id)) list ->
wenzelm@33316
    15
    (thm * (Res_HOL_Clause.axiom_name * Res_HOL_Clause.clause_id)) list -> theory ->
wenzelm@33316
    16
    Res_HOL_Clause.axiom_name vector *
wenzelm@33316
    17
      (Res_HOL_Clause.clause list * Res_HOL_Clause.clause list * Res_HOL_Clause.clause list *
wenzelm@33316
    18
      Res_HOL_Clause.clause list * Res_Clause.classrelClause list * Res_Clause.arityClause list)
paulson@15347
    19
end;
paulson@15347
    20
wenzelm@33316
    21
structure Res_ATP: RES_ATP =
paulson@15347
    22
struct
paulson@15347
    23
paulson@21070
    24
mengj@19194
    25
(********************************************************************)
mengj@19194
    26
(* some settings for both background automatic ATP calling procedure*)
mengj@19194
    27
(* and also explicit ATP invocation methods                         *)
mengj@19194
    28
(********************************************************************)
mengj@19194
    29
wenzelm@28477
    30
(*Translation mode can be auto-detected, or forced to be first-order or higher-order*)
wenzelm@28477
    31
datatype mode = Auto | Fol | Hol;
wenzelm@28477
    32
wenzelm@28477
    33
val linkup_logic_mode = Auto;
wenzelm@28477
    34
mengj@19194
    35
(*** background linkup ***)
wenzelm@28477
    36
val run_blacklist_filter = true;
paulson@21224
    37
paulson@24287
    38
(*** relevance filter parameters ***)
wenzelm@28477
    39
val run_relevance_filter = true;
wenzelm@28477
    40
val pass_mark = 0.5;
wenzelm@28477
    41
val convergence = 3.2;    (*Higher numbers allow longer inference chains*)
wenzelm@28477
    42
val follow_defs = false;  (*Follow definitions. Makes problems bigger.*)
wenzelm@28477
    43
  
wenzelm@28477
    44
(***************************************************************)
wenzelm@28477
    45
(* Relevance Filtering                                         *)
wenzelm@28477
    46
(***************************************************************)
mengj@19194
    47
paulson@24958
    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.*)
paulson@24287
    68
val standard_consts = ["Trueprop","==>","all","==","op |","Not","op ="];
paulson@24287
    69
paulson@24287
    70
paulson@24287
    71
(*** constants with types ***)
paulson@24287
    72
paulson@24287
    73
(*An abstraction of Isabelle types*)
paulson@24287
    74
datatype const_typ =  CTVar | CType of string * const_typ list
paulson@24287
    75
paulson@24287
    76
(*Is the second type an instance of the first one?*)
paulson@24287
    77
fun match_type (CType(con1,args1)) (CType(con2,args2)) = 
paulson@24287
    78
      con1=con2 andalso match_types args1 args2
paulson@24287
    79
  | match_type CTVar _ = true
paulson@24287
    80
  | match_type _ CTVar = false
paulson@24287
    81
and match_types [] [] = true
paulson@24287
    82
  | match_types (a1::as1) (a2::as2) = match_type a1 a2 andalso match_types as1 as2;
paulson@24287
    83
paulson@24287
    84
(*Is there a unifiable constant?*)
paulson@24287
    85
fun uni_mem gctab (c,c_typ) =
paulson@24287
    86
  case Symtab.lookup gctab c of
paulson@24287
    87
      NONE => false
paulson@24287
    88
    | SOME ctyps_list => exists (match_types c_typ) ctyps_list;
paulson@24287
    89
  
paulson@24287
    90
(*Maps a "real" type to a const_typ*)
paulson@24287
    91
fun const_typ_of (Type (c,typs)) = CType (c, map const_typ_of typs) 
paulson@24287
    92
  | const_typ_of (TFree _) = CTVar
paulson@24287
    93
  | const_typ_of (TVar _) = CTVar
paulson@24287
    94
paulson@24287
    95
(*Pairs a constant with the list of its type instantiations (using const_typ)*)
paulson@24287
    96
fun const_with_typ thy (c,typ) = 
paulson@24287
    97
    let val tvars = Sign.const_typargs thy (c,typ)
paulson@24287
    98
    in (c, map const_typ_of tvars) end
paulson@24287
    99
    handle TYPE _ => (c,[]);   (*Variable (locale constant): monomorphic*)   
paulson@24287
   100
paulson@24287
   101
(*Add a const/type pair to the table, but a [] entry means a standard connective,
paulson@24287
   102
  which we ignore.*)
paulson@24287
   103
fun add_const_typ_table ((c,ctyps), tab) =
paulson@24287
   104
  Symtab.map_default (c, [ctyps]) (fn [] => [] | ctyps_list => insert (op =) ctyps ctyps_list) 
paulson@24287
   105
    tab;
paulson@24287
   106
paulson@24287
   107
(*Free variables are included, as well as constants, to handle locales*)
paulson@24287
   108
fun add_term_consts_typs_rm thy (Const(c, typ), tab) =
paulson@24287
   109
      add_const_typ_table (const_with_typ thy (c,typ), tab) 
paulson@24287
   110
  | add_term_consts_typs_rm thy (Free(c, typ), tab) =
paulson@24287
   111
      add_const_typ_table (const_with_typ thy (c,typ), tab) 
paulson@24287
   112
  | add_term_consts_typs_rm thy (t $ u, tab) =
paulson@24287
   113
      add_term_consts_typs_rm thy (t, add_term_consts_typs_rm thy (u, tab))
paulson@24287
   114
  | add_term_consts_typs_rm thy (Abs(_,_,t), tab) = add_term_consts_typs_rm thy (t, tab)
wenzelm@32994
   115
  | add_term_consts_typs_rm _ (_, tab) = tab;
paulson@24287
   116
paulson@24287
   117
(*The empty list here indicates that the constant is being ignored*)
paulson@24287
   118
fun add_standard_const (s,tab) = Symtab.update (s,[]) tab;
paulson@24287
   119
paulson@24287
   120
val null_const_tab : const_typ list list Symtab.table = 
wenzelm@30190
   121
    List.foldl add_standard_const Symtab.empty standard_consts;
paulson@24287
   122
wenzelm@30190
   123
fun get_goal_consts_typs thy = List.foldl (add_term_consts_typs_rm thy) null_const_tab;
paulson@24287
   124
paulson@24287
   125
(*Inserts a dummy "constant" referring to the theory name, so that relevance
paulson@24287
   126
  takes the given theory into account.*)
wenzelm@28477
   127
fun const_prop_of theory_const th =
wenzelm@28477
   128
 if theory_const then
paulson@24287
   129
  let val name = Context.theory_name (theory_of_thm th)
paulson@24287
   130
      val t = Const (name ^ ". 1", HOLogic.boolT)
paulson@24287
   131
  in  t $ prop_of th  end
paulson@24287
   132
 else prop_of th;
paulson@24287
   133
paulson@24287
   134
(**** Constant / Type Frequencies ****)
paulson@24287
   135
paulson@24287
   136
(*A two-dimensional symbol table counts frequencies of constants. It's keyed first by
paulson@24287
   137
  constant name and second by its list of type instantiations. For the latter, we need
paulson@24287
   138
  a linear ordering on type const_typ list.*)
paulson@24287
   139
  
paulson@24287
   140
local
paulson@24287
   141
paulson@24287
   142
fun cons_nr CTVar = 0
paulson@24287
   143
  | cons_nr (CType _) = 1;
paulson@24287
   144
paulson@24287
   145
in
paulson@24287
   146
paulson@24287
   147
fun const_typ_ord TU =
paulson@24287
   148
  case TU of
paulson@24287
   149
    (CType (a, Ts), CType (b, Us)) =>
paulson@24287
   150
      (case fast_string_ord(a,b) of EQUAL => dict_ord const_typ_ord (Ts,Us) | ord => ord)
paulson@24287
   151
  | (T, U) => int_ord (cons_nr T, cons_nr U);
paulson@24287
   152
paulson@24287
   153
end;
paulson@24287
   154
wenzelm@31971
   155
structure CTtab = Table(type key = const_typ list val ord = dict_ord const_typ_ord);
paulson@24287
   156
wenzelm@28477
   157
fun count_axiom_consts theory_const thy ((thm,_), tab) = 
paulson@24287
   158
  let fun count_const (a, T, tab) =
wenzelm@32960
   159
        let val (c, cts) = const_with_typ thy (a,T)
wenzelm@32960
   160
        in  (*Two-dimensional table update. Constant maps to types maps to count.*)
wenzelm@32960
   161
            Symtab.map_default (c, CTtab.empty) 
wenzelm@32960
   162
                               (CTtab.map_default (cts,0) (fn n => n+1)) tab
wenzelm@32960
   163
        end
paulson@24287
   164
      fun count_term_consts (Const(a,T), tab) = count_const(a,T,tab)
wenzelm@32960
   165
        | count_term_consts (Free(a,T), tab) = count_const(a,T,tab)
wenzelm@32960
   166
        | count_term_consts (t $ u, tab) =
wenzelm@32960
   167
            count_term_consts (t, count_term_consts (u, tab))
wenzelm@32960
   168
        | count_term_consts (Abs(_,_,t), tab) = count_term_consts (t, tab)
wenzelm@32960
   169
        | count_term_consts (_, tab) = tab
wenzelm@28477
   170
  in  count_term_consts (const_prop_of theory_const thm, tab)  end;
paulson@24287
   171
paulson@24287
   172
paulson@24287
   173
(**** Actual Filtering Code ****)
paulson@24287
   174
paulson@24287
   175
(*The frequency of a constant is the sum of those of all instances of its type.*)
paulson@24287
   176
fun const_frequency ctab (c, cts) =
paulson@24287
   177
  let val pairs = CTtab.dest (the (Symtab.lookup ctab c))
paulson@24287
   178
      fun add ((cts',m), n) = if match_types cts cts' then m+n else n
paulson@24287
   179
  in  List.foldl add 0 pairs  end;
paulson@24287
   180
paulson@24287
   181
(*Add in a constant's weight, as determined by its frequency.*)
paulson@24287
   182
fun add_ct_weight ctab ((c,T), w) =
wenzelm@28477
   183
  w + weight_fn (real (const_frequency ctab (c,T)));
paulson@24287
   184
paulson@24287
   185
(*Relevant constants are weighted according to frequency, 
paulson@24287
   186
  but irrelevant constants are simply counted. Otherwise, Skolem functions,
paulson@24287
   187
  which are rare, would harm a clause's chances of being picked.*)
paulson@24287
   188
fun clause_weight ctab gctyps consts_typs =
paulson@24287
   189
    let val rel = filter (uni_mem gctyps) consts_typs
paulson@24287
   190
        val rel_weight = List.foldl (add_ct_weight ctab) 0.0 rel
paulson@24287
   191
    in
wenzelm@32960
   192
        rel_weight / (rel_weight + real (length consts_typs - length rel))
paulson@24287
   193
    end;
paulson@24287
   194
    
paulson@24287
   195
(*Multiplies out to a list of pairs: 'a * 'b list -> ('a * 'b) list -> ('a * 'b) list*)
wenzelm@30190
   196
fun add_expand_pairs (x,ys) xys = List.foldl (fn (y,acc) => (x,y)::acc) xys ys;
paulson@24287
   197
paulson@24287
   198
fun consts_typs_of_term thy t = 
paulson@24287
   199
  let val tab = add_term_consts_typs_rm thy (t, null_const_tab)
paulson@24287
   200
  in  Symtab.fold add_expand_pairs tab []  end;
paulson@24287
   201
wenzelm@28477
   202
fun pair_consts_typs_axiom theory_const thy (thm,name) =
wenzelm@28477
   203
    ((thm,name), (consts_typs_of_term thy (const_prop_of theory_const thm)));
paulson@24287
   204
paulson@24287
   205
exception ConstFree;
paulson@24287
   206
fun dest_ConstFree (Const aT) = aT
paulson@24287
   207
  | dest_ConstFree (Free aT) = aT
paulson@24287
   208
  | dest_ConstFree _ = raise ConstFree;
paulson@24287
   209
paulson@24287
   210
(*Look for definitions of the form f ?x1 ... ?xn = t, but not reversed.*)
wenzelm@32994
   211
fun defines thy thm gctypes =
paulson@24287
   212
    let val tm = prop_of thm
wenzelm@32960
   213
        fun defs lhs rhs =
paulson@24287
   214
            let val (rator,args) = strip_comb lhs
wenzelm@32960
   215
                val ct = const_with_typ thy (dest_ConstFree rator)
haftmann@33037
   216
            in
haftmann@33037
   217
              forall is_Var args andalso uni_mem gctypes ct andalso
haftmann@33038
   218
                subset (op =) (Term.add_vars rhs [], Term.add_vars lhs [])
paulson@24287
   219
            end
wenzelm@32960
   220
            handle ConstFree => false
paulson@24287
   221
    in    
wenzelm@32960
   222
        case tm of Const ("Trueprop",_) $ (Const("op =",_) $ lhs $ rhs) => 
wenzelm@32960
   223
                   defs lhs rhs 
wenzelm@32960
   224
                 | _ => false
paulson@24287
   225
    end;
paulson@24287
   226
paulson@24287
   227
type annotd_cls = (thm * (string * int)) * ((string * const_typ list) list);
paulson@24287
   228
       
paulson@24287
   229
(*For a reverse sort, putting the largest values first.*)
paulson@24287
   230
fun compare_pairs ((_,w1),(_,w2)) = Real.compare (w2,w1);
paulson@24287
   231
paulson@24287
   232
(*Limit the number of new clauses, to prevent runaway acceptance.*)
wenzelm@28477
   233
fun take_best max_new (newpairs : (annotd_cls*real) list) =
paulson@24287
   234
  let val nnew = length newpairs
paulson@24287
   235
  in
wenzelm@28477
   236
    if nnew <= max_new then (map #1 newpairs, [])
paulson@24287
   237
    else 
paulson@24287
   238
      let val cls = sort compare_pairs newpairs
wenzelm@28477
   239
          val accepted = List.take (cls, max_new)
paulson@24287
   240
      in
wenzelm@33316
   241
        Res_Axioms.trace_msg (fn () => ("Number of candidates, " ^ Int.toString nnew ^ 
wenzelm@32960
   242
                       ", exceeds the limit of " ^ Int.toString (max_new)));
wenzelm@33316
   243
        Res_Axioms.trace_msg (fn () => ("Effective pass mark: " ^ Real.toString (#2 (List.last accepted))));
wenzelm@33316
   244
        Res_Axioms.trace_msg (fn () => "Actually passed: " ^
paulson@24287
   245
          space_implode ", " (map (fn (((_,(name,_)),_),_) => name) accepted));
paulson@24287
   246
wenzelm@32960
   247
        (map #1 accepted, map #1 (List.drop (cls, max_new)))
paulson@24287
   248
      end
paulson@24287
   249
  end;
paulson@24287
   250
wenzelm@28477
   251
fun relevant_clauses max_new thy ctab p rel_consts =
paulson@24287
   252
  let fun relevant ([],_) [] = [] : (thm * (string * int)) list  (*Nothing added this iteration*)
wenzelm@32960
   253
        | relevant (newpairs,rejects) [] =
wenzelm@32960
   254
            let val (newrels,more_rejects) = take_best max_new newpairs
wenzelm@32960
   255
                val new_consts = maps #2 newrels
wenzelm@32960
   256
                val rel_consts' = List.foldl add_const_typ_table rel_consts new_consts
wenzelm@32960
   257
                val newp = p + (1.0-p) / convergence
wenzelm@32960
   258
            in
wenzelm@33316
   259
              Res_Axioms.trace_msg (fn () => "relevant this iteration: " ^ Int.toString (length newrels));
wenzelm@32960
   260
               (map #1 newrels) @ 
wenzelm@32960
   261
               (relevant_clauses max_new thy ctab newp rel_consts' (more_rejects@rejects))
wenzelm@32960
   262
            end
wenzelm@32960
   263
        | relevant (newrels,rejects) ((ax as (clsthm as (_,(name,n)),consts_typs)) :: axs) =
wenzelm@32960
   264
            let val weight = clause_weight ctab rel_consts consts_typs
wenzelm@32960
   265
            in
wenzelm@32994
   266
              if p <= weight orelse (follow_defs andalso defines thy (#1 clsthm) rel_consts)
wenzelm@33316
   267
              then (Res_Axioms.trace_msg (fn () => (name ^ " clause " ^ Int.toString n ^ 
wenzelm@32960
   268
                                            " passes: " ^ Real.toString weight));
wenzelm@32960
   269
                    relevant ((ax,weight)::newrels, rejects) axs)
wenzelm@32960
   270
              else relevant (newrels, ax::rejects) axs
wenzelm@32960
   271
            end
wenzelm@33316
   272
    in  Res_Axioms.trace_msg (fn () => ("relevant_clauses, current pass mark = " ^ Real.toString p));
paulson@24287
   273
        relevant ([],[]) 
paulson@24287
   274
    end;
wenzelm@32960
   275
        
wenzelm@28477
   276
fun relevance_filter max_new theory_const thy axioms goals = 
wenzelm@28477
   277
 if run_relevance_filter andalso pass_mark >= 0.1
paulson@24287
   278
 then
paulson@31910
   279
  let val const_tab = List.foldl (count_axiom_consts theory_const thy) Symtab.empty axioms
paulson@24287
   280
      val goal_const_tab = get_goal_consts_typs thy goals
wenzelm@33316
   281
      val _ = Res_Axioms.trace_msg (fn () => ("Initial constants: " ^
paulson@24287
   282
                                 space_implode ", " (Symtab.keys goal_const_tab)));
wenzelm@28477
   283
      val rels = relevant_clauses max_new thy const_tab (pass_mark) 
wenzelm@28477
   284
                   goal_const_tab  (map (pair_consts_typs_axiom theory_const thy) axioms)
paulson@24287
   285
  in
wenzelm@33316
   286
      Res_Axioms.trace_msg (fn () => ("Total relevant: " ^ Int.toString (length rels)));
paulson@24287
   287
      rels
paulson@24287
   288
  end
paulson@24287
   289
 else axioms;
paulson@24287
   290
paulson@24287
   291
(***************************************************************)
mengj@19768
   292
(* Retrieving and filtering lemmas                             *)
mengj@19768
   293
(***************************************************************)
mengj@19768
   294
paulson@33022
   295
(*** retrieve lemmas and filter them ***)
mengj@19768
   296
mengj@19768
   297
(*Hashing to detect duplicate and variant clauses, e.g. from the [iff] attribute*)
mengj@19768
   298
paulson@22382
   299
fun setinsert (x,s) = Symtab.update (x,()) s;
mengj@19768
   300
paulson@20757
   301
(*Reject theorems with names like "List.filter.filter_list_def" or
paulson@21690
   302
  "Accessible_Part.acc.defs", as these are definitions arising from packages.*)
paulson@20757
   303
fun is_package_def a =
wenzelm@30364
   304
  let val names = Long_Name.explode a
paulson@21690
   305
  in
paulson@21690
   306
     length names > 2 andalso
paulson@21690
   307
     not (hd names = "local") andalso
paulson@21690
   308
     String.isSuffix "_def" a  orelse  String.isSuffix "_defs" a
paulson@21690
   309
  end;
paulson@20757
   310
mengj@19768
   311
(** a hash function from Term.term to int, and also a hash table **)
mengj@19768
   312
val xor_words = List.foldl Word.xorb 0w0;
mengj@19768
   313
mengj@19768
   314
fun hashw_term ((Const(c,_)), w) = Polyhash.hashw_string (c,w)
paulson@20661
   315
  | hashw_term ((Free(a,_)), w) = Polyhash.hashw_string (a,w)
mengj@19768
   316
  | hashw_term ((Var(_,_)), w) = w
paulson@20661
   317
  | hashw_term ((Bound i), w) = Polyhash.hashw_int(i,w)
mengj@19768
   318
  | hashw_term ((Abs(_,_,t)), w) = hashw_term (t, w)
mengj@19768
   319
  | hashw_term ((P$Q), w) = hashw_term (Q, (hashw_term (P, w)));
mengj@19768
   320
paulson@21070
   321
fun hash_literal (Const("Not",_)$P) = Word.notb(hashw_term(P,0w0))
paulson@21070
   322
  | hash_literal P = hashw_term(P,0w0);
mengj@19768
   323
paulson@24958
   324
fun hash_term t = Word.toIntX (xor_words (map hash_literal (HOLogic.disjuncts (strip_Trueprop t))));
mengj@19768
   325
mengj@19768
   326
fun equal_thm (thm1,thm2) = Term.aconv(prop_of thm1, prop_of thm2);
paulson@20457
   327
paulson@22382
   328
exception HASH_CLAUSE;
paulson@22382
   329
mengj@19768
   330
(*Create a hash table for clauses, of the given size*)
mengj@19768
   331
fun mk_clause_table n =
paulson@20457
   332
      Polyhash.mkTable (hash_term o prop_of, equal_thm)
mengj@19768
   333
                       (n, HASH_CLAUSE);
mengj@19768
   334
paulson@20457
   335
(*Use a hash table to eliminate duplicates from xs. Argument is a list of
paulson@20868
   336
  (thm * (string * int)) tuples. The theorems are hashed into the table. *)
wenzelm@21588
   337
fun make_unique xs =
paulson@20868
   338
  let val ht = mk_clause_table 7000
paulson@20457
   339
  in
wenzelm@33316
   340
      Res_Axioms.trace_msg (fn () => ("make_unique gets " ^ Int.toString (length xs) ^ " clauses"));
wenzelm@21588
   341
      app (ignore o Polyhash.peekInsert ht) xs;
paulson@20868
   342
      Polyhash.listItems ht
paulson@20457
   343
  end;
mengj@19768
   344
paulson@20868
   345
(*Remove existing axiom clauses from the conjecture clauses, as this can dramatically
paulson@20868
   346
  boost an ATP's performance (for some reason)*)
wenzelm@21588
   347
fun subtract_cls c_clauses ax_clauses =
paulson@20868
   348
  let val ht = mk_clause_table 2200
wenzelm@33035
   349
      fun known x = is_some (Polyhash.peek ht x)
paulson@20868
   350
  in
wenzelm@21588
   351
      app (ignore o Polyhash.peekInsert ht) ax_clauses;
wenzelm@21588
   352
      filter (not o known) c_clauses
paulson@20868
   353
  end;
mengj@19768
   354
paulson@21224
   355
fun all_valid_thms 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;
wenzelm@33641
   372
          val ths = filter_out Res_Axioms.bad_for_atp ths0;
wenzelm@33641
   373
        in
wenzelm@33641
   374
          if Facts.is_concealed facts name orelse null ths orelse
wenzelm@33641
   375
            run_blacklist_filter andalso is_package_def name then I
wenzelm@33641
   376
          else
wenzelm@33641
   377
            (case find_first check_thms [name1, name2, name] of
wenzelm@33641
   378
              NONE => I
wenzelm@33641
   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 =
wenzelm@33316
   392
  if (Long_Name.base_name a) mem_string Res_Axioms.multi_base_blacklist 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
paulson@24286
   397
(*The single theorems go BEFORE the multiple ones. Blacklist is applied to all.*)
wenzelm@21588
   398
fun name_thm_pairs ctxt =
wenzelm@33309
   399
  let
wenzelm@33309
   400
    val (mults, singles) = List.partition is_multi (all_valid_thms ctxt)
wenzelm@33309
   401
    fun blacklisted (_, th) =
wenzelm@33316
   402
      run_blacklist_filter andalso Res_Blacklist.blacklisted ctxt th
paulson@24286
   403
  in
wenzelm@33309
   404
    filter_out blacklisted
wenzelm@33309
   405
      (fold add_single_names singles (fold add_multi_names mults []))
paulson@24286
   406
  end;
paulson@21224
   407
wenzelm@32091
   408
fun check_named ("", th) =
wenzelm@32091
   409
      (warning ("No name for theorem " ^ Display.string_of_thm_without_context th); false)
wenzelm@32994
   410
  | check_named _ = true;
paulson@19894
   411
paulson@33022
   412
fun get_all_lemmas ctxt =
paulson@19894
   413
  let val included_thms =
wenzelm@33316
   414
        tap (fn ths => Res_Axioms.trace_msg
paulson@33022
   415
                     (fn () => ("Including all " ^ Int.toString (length ths) ^ " theorems")))
paulson@33022
   416
            (name_thm_pairs ctxt)
paulson@19894
   417
  in
immler@31410
   418
    filter check_named included_thms
paulson@19894
   419
  end;
mengj@19768
   420
paulson@21290
   421
(***************************************************************)
paulson@21290
   422
(* Type Classes Present in the Axiom or Conjecture Clauses     *)
paulson@21290
   423
(***************************************************************)
paulson@21290
   424
wenzelm@32952
   425
fun add_classes (sorts, cset) = List.foldl setinsert cset (flat sorts);
paulson@21290
   426
paulson@21290
   427
(*Remove this trivial type class*)
paulson@21290
   428
fun delete_type cset = Symtab.delete_safe "HOL.type" cset;
paulson@21290
   429
paulson@21290
   430
fun tvar_classes_of_terms ts =
wenzelm@29270
   431
  let val sorts_list = map (map #2 o OldTerm.term_tvars) ts
wenzelm@30190
   432
  in  Symtab.keys (delete_type (List.foldl add_classes Symtab.empty sorts_list))  end;
paulson@21290
   433
paulson@21290
   434
fun tfree_classes_of_terms ts =
wenzelm@29270
   435
  let val sorts_list = map (map #2 o OldTerm.term_tfrees) ts
wenzelm@30190
   436
  in  Symtab.keys (delete_type (List.foldl add_classes Symtab.empty sorts_list))  end;
paulson@20526
   437
paulson@21373
   438
(*fold type constructors*)
paulson@21373
   439
fun fold_type_consts f (Type (a, Ts)) x = fold (fold_type_consts f) Ts (f (a,x))
wenzelm@32994
   440
  | fold_type_consts _ _ x = x;
paulson@21373
   441
paulson@21373
   442
val add_type_consts_in_type = fold_type_consts setinsert;
paulson@21373
   443
paulson@21397
   444
(*Type constructors used to instantiate overloaded constants are the only ones needed.*)
paulson@21397
   445
fun add_type_consts_in_term thy =
paulson@21397
   446
  let val const_typargs = Sign.const_typargs thy
paulson@21397
   447
      fun add_tcs (Const cT) x = fold add_type_consts_in_type (const_typargs cT) x
wenzelm@32994
   448
        | add_tcs (Abs (_, _, u)) x = add_tcs u x
paulson@21397
   449
        | add_tcs (t $ u) x = add_tcs t (add_tcs u x)
paulson@21397
   450
        | add_tcs _ x = x
paulson@21397
   451
  in  add_tcs  end
paulson@21373
   452
paulson@21397
   453
fun type_consts_of_terms thy ts =
paulson@21397
   454
  Symtab.keys (fold (add_type_consts_in_term thy) ts Symtab.empty);
paulson@21373
   455
paulson@21373
   456
mengj@19194
   457
(***************************************************************)
mengj@19194
   458
(* ATP invocation methods setup                                *)
mengj@19194
   459
(***************************************************************)
mengj@19194
   460
paulson@20526
   461
(*Ensures that no higher-order theorems "leak out"*)
paulson@24958
   462
fun restrict_to_logic thy true cls = filter (Meson.is_fol_term thy o prop_of o fst) cls
paulson@24958
   463
  | restrict_to_logic thy false cls = cls;
paulson@20526
   464
paulson@21470
   465
(**** Predicates to detect unwanted clauses (prolific or likely to cause unsoundness) ****)
paulson@21470
   466
paulson@21470
   467
(** Too general means, positive equality literal with a variable X as one operand,
paulson@21470
   468
  when X does not occur properly in the other operand. This rules out clearly
paulson@21470
   469
  inconsistent clauses such as V=a|V=b, though it by no means guarantees soundness. **)
wenzelm@21588
   470
paulson@21470
   471
fun occurs ix =
paulson@21470
   472
    let fun occ(Var (jx,_)) = (ix=jx)
paulson@21470
   473
          | occ(t1$t2)      = occ t1 orelse occ t2
paulson@21470
   474
          | occ(Abs(_,_,t)) = occ t
paulson@21470
   475
          | occ _           = false
paulson@21470
   476
    in occ end;
paulson@21470
   477
haftmann@31723
   478
fun is_recordtype T = not (null (Record.dest_recTs T));
paulson@21470
   479
paulson@21470
   480
(*Unwanted equalities include
paulson@21470
   481
  (1) those between a variable that does not properly occur in the second operand,
paulson@21470
   482
  (2) those between a variable and a record, since these seem to be prolific "cases" thms
wenzelm@21588
   483
*)
paulson@21470
   484
fun too_general_eqterms (Var (ix,T), t) = not (occurs ix t) orelse is_recordtype T
paulson@21470
   485
  | too_general_eqterms _ = false;
paulson@21470
   486
paulson@21470
   487
fun too_general_equality (Const ("op =", _) $ x $ y) =
paulson@21470
   488
      too_general_eqterms (x,y) orelse too_general_eqterms(y,x)
paulson@21470
   489
  | too_general_equality _ = false;
paulson@21470
   490
paulson@21470
   491
(* tautologous? *)
paulson@21470
   492
fun is_taut (Const ("Trueprop", _) $ Const ("True", _)) = true
paulson@21470
   493
  | is_taut _ = false;
paulson@21470
   494
wenzelm@29267
   495
fun has_typed_var tycons = exists_subterm
wenzelm@29267
   496
  (fn Var (_, Type (a, _)) => member (op =) tycons a | _ => false);
paulson@21431
   497
paulson@22217
   498
(*Clauses are forbidden to contain variables of these types. The typical reason is that
paulson@22217
   499
  they lead to unsoundness. Note that "unit" satisfies numerous equations like ?X=().
paulson@22217
   500
  The resulting clause will have no type constraint, yielding false proofs. Even "bool"
paulson@22217
   501
  leads to many unsound proofs, though (obviously) only for higher-order problems.*)
paulson@24215
   502
val unwanted_types = ["Product_Type.unit","bool"];
paulson@22217
   503
paulson@21470
   504
fun unwanted t =
paulson@24958
   505
  is_taut t orelse has_typed_var unwanted_types t orelse
paulson@24958
   506
  forall too_general_equality (HOLogic.disjuncts (strip_Trueprop t));
paulson@21470
   507
paulson@21431
   508
(*Clauses containing variables of type "unit" or "bool" are unlikely to be useful and
paulson@21431
   509
  likely to lead to unsound proofs.*)
paulson@22217
   510
fun remove_unwanted_clauses cls = filter (not o unwanted o prop_of o fst) cls;
paulson@21431
   511
immler@30536
   512
fun isFO thy goal_cls = case linkup_logic_mode of
immler@30536
   513
      Auto => forall (Meson.is_fol_term thy) (map prop_of goal_cls)
immler@30536
   514
    | Fol => true
immler@30536
   515
    | Hol => false
immler@30536
   516
immler@31409
   517
fun get_relevant max_new theory_const (ctxt, (chain_ths, th)) goal_cls =
immler@30536
   518
  let
immler@30536
   519
    val thy = ProofContext.theory_of ctxt
Philipp@32552
   520
    val isFO = isFO thy goal_cls
wenzelm@33306
   521
    val included_cls = get_all_lemmas ctxt
wenzelm@33316
   522
      |> Res_Axioms.cnf_rules_pairs thy |> make_unique
wenzelm@33306
   523
      |> restrict_to_logic thy isFO
wenzelm@33306
   524
      |> remove_unwanted_clauses
mengj@19194
   525
  in
paulson@33046
   526
    relevance_filter max_new theory_const thy included_cls (map prop_of goal_cls) 
immler@30536
   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 *)
immler@31752
   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 =
wenzelm@33316
   535
      Res_Axioms.cnf_rules_pairs thy (filter check_named (map Res_Axioms.pairname chain_ths))
Philipp@32866
   536
    val axcls = chain_cls @ axcls
Philipp@32866
   537
    val extra_cls = chain_cls @ extra_cls
immler@31837
   538
    val isFO = isFO thy goal_cls
immler@31752
   539
    val ccls = subtract_cls goal_cls extra_cls
wenzelm@33316
   540
    val _ = app (fn th => Res_Axioms.trace_msg (fn _ => Display.string_of_thm_global thy th)) ccls
immler@30536
   541
    val ccltms = map prop_of ccls
immler@31752
   542
    and axtms = map (prop_of o #1) extra_cls
immler@30536
   543
    val subs = tfree_classes_of_terms ccltms
immler@30536
   544
    and supers = tvar_classes_of_terms axtms
immler@30536
   545
    and tycons = type_consts_of_terms thy (ccltms@axtms)
immler@30536
   546
    (*TFrees in conjecture clauses; TVars in axiom clauses*)
wenzelm@33316
   547
    val conjectures = Res_HOL_Clause.make_conjecture_clauses dfg thy ccls
wenzelm@33316
   548
    val (_, extra_clauses) = ListPair.unzip (Res_HOL_Clause.make_axiom_clauses dfg thy extra_cls)
wenzelm@33316
   549
    val (clnames,axiom_clauses) = ListPair.unzip (Res_HOL_Clause.make_axiom_clauses dfg thy axcls)
wenzelm@33316
   550
    val helper_clauses = Res_HOL_Clause.get_helper_clauses dfg thy isFO (conjectures, extra_cls, [])
wenzelm@33316
   551
    val (supers',arity_clauses) = Res_Clause.make_arity_clauses_dfg dfg thy tycons supers
wenzelm@33316
   552
    val classrel_clauses = Res_Clause.make_classrel_clauses thy subs supers'
immler@30536
   553
  in
immler@31752
   554
    (Vector.fromList clnames,
immler@31865
   555
      (conjectures, axiom_clauses, extra_clauses, helper_clauses, classrel_clauses, arity_clauses))
immler@31409
   556
  end
quigley@15644
   557
paulson@15347
   558
end;
immler@30536
   559