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