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