author | blanchet |
Tue, 22 Jun 2010 17:07:39 +0200 | |
changeset 37503 | c2dfa26b9da6 |
parent 37502 | a8f7b25d5478 |
child 37504 | 4308d2bbbca8 |
permissions | -rw-r--r-- |
35826 | 1 |
(* Title: HOL/Tools/Sledgehammer/sledgehammer_fact_filter.ML |
33309 | 2 |
Author: Jia Meng, Cambridge University Computer Laboratory, NICTA |
36393
be73a2b2443b
support readable names even when Isar proof reconstruction is enabled -- useful for debugging
blanchet
parents:
36227
diff
changeset
|
3 |
Author: Jasmin Blanchette, TU Muenchen |
33309 | 4 |
*) |
15452 | 5 |
|
35826 | 6 |
signature SLEDGEHAMMER_FACT_FILTER = |
16802
6eeee59dac4c
use Toplevel.print_state_hook instead of adhoc Proof.atp_hook;
wenzelm
parents:
16767
diff
changeset
|
7 |
sig |
37500
7587b6e63454
thread original theorem along with CNF theorem, as a step toward killing the Skolem cache
blanchet
parents:
37498
diff
changeset
|
8 |
type cnf_thm = Sledgehammer_Fact_Preprocessor.cnf_thm |
35865 | 9 |
type classrel_clause = Sledgehammer_FOL_Clause.classrel_clause |
10 |
type arity_clause = Sledgehammer_FOL_Clause.arity_clause |
|
11 |
type hol_clause = Sledgehammer_HOL_Clause.hol_clause |
|
36473
8a5c99a1c965
remove "higher_order" option from Sledgehammer -- the "smart" default is good enough
blanchet
parents:
36393
diff
changeset
|
12 |
|
35966
f8c738abaed8
honor the newly introduced Sledgehammer parameters and fixed the parsing;
blanchet
parents:
35963
diff
changeset
|
13 |
type relevance_override = |
f8c738abaed8
honor the newly introduced Sledgehammer parameters and fixed the parsing;
blanchet
parents:
35963
diff
changeset
|
14 |
{add: Facts.ref list, |
f8c738abaed8
honor the newly introduced Sledgehammer parameters and fixed the parsing;
blanchet
parents:
35963
diff
changeset
|
15 |
del: Facts.ref list, |
f8c738abaed8
honor the newly introduced Sledgehammer parameters and fixed the parsing;
blanchet
parents:
35963
diff
changeset
|
16 |
only: bool} |
f8c738abaed8
honor the newly introduced Sledgehammer parameters and fixed the parsing;
blanchet
parents:
35963
diff
changeset
|
17 |
|
37344
40f379944c1e
totally bypass Sledgehammer's relevance filter when facts are given using the "(fact1 ... factn)" syntax;
blanchet
parents:
37171
diff
changeset
|
18 |
val name_thms_pair_from_ref : |
40f379944c1e
totally bypass Sledgehammer's relevance filter when facts are given using the "(fact1 ... factn)" syntax;
blanchet
parents:
37171
diff
changeset
|
19 |
Proof.context -> thm list -> Facts.ref -> string * thm list |
22989 | 20 |
val tvar_classes_of_terms : term list -> string list |
21 |
val tfree_classes_of_terms : term list -> string list |
|
22 |
val type_consts_of_terms : theory -> term list -> string list |
|
37399
34f080a12063
proper polymorphic Skolemization of uncached facts + synchronization of caching and relevance filter
blanchet
parents:
37359
diff
changeset
|
23 |
val is_quasi_fol_term : theory -> term -> bool |
37347
635425a442e8
show more respect for user-specified facts, even if they could lead to unsound proofs + don't throw away "unsound" theorems in "full_type" mode, since they are then sound
blanchet
parents:
37345
diff
changeset
|
24 |
val relevant_facts : |
635425a442e8
show more respect for user-specified facts, even if they could lead to unsound proofs + don't throw away "unsound" theorems in "full_type" mode, since they are then sound
blanchet
parents:
37345
diff
changeset
|
25 |
bool -> bool -> real -> real -> bool -> int -> bool -> relevance_override |
37500
7587b6e63454
thread original theorem along with CNF theorem, as a step toward killing the Skolem cache
blanchet
parents:
37498
diff
changeset
|
26 |
-> Proof.context * (thm list * 'a) -> thm list -> cnf_thm list |
36473
8a5c99a1c965
remove "higher_order" option from Sledgehammer -- the "smart" default is good enough
blanchet
parents:
36393
diff
changeset
|
27 |
val prepare_clauses : |
37500
7587b6e63454
thread original theorem along with CNF theorem, as a step toward killing the Skolem cache
blanchet
parents:
37498
diff
changeset
|
28 |
bool -> thm list -> cnf_thm list -> cnf_thm list -> theory |
7587b6e63454
thread original theorem along with CNF theorem, as a step toward killing the Skolem cache
blanchet
parents:
37498
diff
changeset
|
29 |
-> string vector |
7587b6e63454
thread original theorem along with CNF theorem, as a step toward killing the Skolem cache
blanchet
parents:
37498
diff
changeset
|
30 |
* (hol_clause list * hol_clause list * hol_clause list |
7587b6e63454
thread original theorem along with CNF theorem, as a step toward killing the Skolem cache
blanchet
parents:
37498
diff
changeset
|
31 |
* hol_clause list * classrel_clause list * arity_clause list) |
15347 | 32 |
end; |
33 |
||
35826 | 34 |
structure Sledgehammer_Fact_Filter : SLEDGEHAMMER_FACT_FILTER = |
15347 | 35 |
struct |
36 |
||
35865 | 37 |
open Sledgehammer_FOL_Clause |
38 |
open Sledgehammer_Fact_Preprocessor |
|
39 |
open Sledgehammer_HOL_Clause |
|
35826 | 40 |
|
35966
f8c738abaed8
honor the newly introduced Sledgehammer parameters and fixed the parsing;
blanchet
parents:
35963
diff
changeset
|
41 |
type relevance_override = |
f8c738abaed8
honor the newly introduced Sledgehammer parameters and fixed the parsing;
blanchet
parents:
35963
diff
changeset
|
42 |
{add: Facts.ref list, |
f8c738abaed8
honor the newly introduced Sledgehammer parameters and fixed the parsing;
blanchet
parents:
35963
diff
changeset
|
43 |
del: Facts.ref list, |
f8c738abaed8
honor the newly introduced Sledgehammer parameters and fixed the parsing;
blanchet
parents:
35963
diff
changeset
|
44 |
only: bool} |
21070 | 45 |
|
28477
9339d4dcec8b
version of sledgehammer using threads instead of processes, misc cleanup;
wenzelm
parents:
28065
diff
changeset
|
46 |
(***************************************************************) |
9339d4dcec8b
version of sledgehammer using threads instead of processes, misc cleanup;
wenzelm
parents:
28065
diff
changeset
|
47 |
(* Relevance Filtering *) |
9339d4dcec8b
version of sledgehammer using threads instead of processes, misc cleanup;
wenzelm
parents:
28065
diff
changeset
|
48 |
(***************************************************************) |
19194 | 49 |
|
35865 | 50 |
fun strip_Trueprop (@{const Trueprop} $ t) = t |
24958 | 51 |
| strip_Trueprop t = t; |
19194 | 52 |
|
24287 | 53 |
(*** constants with types ***) |
54 |
||
55 |
(*An abstraction of Isabelle types*) |
|
56 |
datatype const_typ = CTVar | CType of string * const_typ list |
|
57 |
||
58 |
(*Is the second type an instance of the first one?*) |
|
59 |
fun match_type (CType(con1,args1)) (CType(con2,args2)) = |
|
60 |
con1=con2 andalso match_types args1 args2 |
|
61 |
| match_type CTVar _ = true |
|
62 |
| match_type _ CTVar = false |
|
63 |
and match_types [] [] = true |
|
64 |
| match_types (a1::as1) (a2::as2) = match_type a1 a2 andalso match_types as1 as2; |
|
65 |
||
66 |
(*Is there a unifiable constant?*) |
|
67 |
fun uni_mem gctab (c,c_typ) = |
|
68 |
case Symtab.lookup gctab c of |
|
69 |
NONE => false |
|
70 |
| SOME ctyps_list => exists (match_types c_typ) ctyps_list; |
|
71 |
||
72 |
(*Maps a "real" type to a const_typ*) |
|
73 |
fun const_typ_of (Type (c,typs)) = CType (c, map const_typ_of typs) |
|
74 |
| const_typ_of (TFree _) = CTVar |
|
75 |
| const_typ_of (TVar _) = CTVar |
|
76 |
||
77 |
(*Pairs a constant with the list of its type instantiations (using const_typ)*) |
|
78 |
fun const_with_typ thy (c,typ) = |
|
79 |
let val tvars = Sign.const_typargs thy (c,typ) |
|
80 |
in (c, map const_typ_of tvars) end |
|
81 |
handle TYPE _ => (c,[]); (*Variable (locale constant): monomorphic*) |
|
82 |
||
83 |
(*Add a const/type pair to the table, but a [] entry means a standard connective, |
|
84 |
which we ignore.*) |
|
37502 | 85 |
fun add_const_type_to_table (c, ctyps) = |
86 |
Symtab.map_default (c, [ctyps]) |
|
87 |
(fn [] => [] | ctypss => insert (op =) ctyps ctypss) |
|
24287 | 88 |
|
89 |
(*Free variables are included, as well as constants, to handle locales*) |
|
37502 | 90 |
fun add_term_consts_typs_rm thy (Const x) = |
91 |
add_const_type_to_table (const_with_typ thy x) |
|
92 |
| add_term_consts_typs_rm thy (Free x) = |
|
93 |
add_const_type_to_table (const_with_typ thy x) |
|
94 |
| add_term_consts_typs_rm _ (Const (@{const_name skolem_id}, _) $ _) = I |
|
95 |
| add_term_consts_typs_rm thy (t $ u) = |
|
96 |
add_term_consts_typs_rm thy t #> add_term_consts_typs_rm thy u |
|
97 |
| add_term_consts_typs_rm thy (Abs (_, _, t)) = add_term_consts_typs_rm thy t |
|
98 |
| add_term_consts_typs_rm _ _ = I |
|
24287 | 99 |
|
37502 | 100 |
|
101 |
(* Including equality in this list might be expected to stop rules like |
|
102 |
subset_antisym from being chosen, but for some reason filtering works better |
|
103 |
with them listed. The logical signs All, Ex, &, and --> are omitted because |
|
104 |
any remaining occurrences must be within comprehensions. *) |
|
105 |
val standard_consts = |
|
106 |
[@{const_name Trueprop}, @{const_name "==>"}, @{const_name all}, |
|
107 |
@{const_name "=="}, @{const_name "op |"}, @{const_name Not}, |
|
108 |
@{const_name "op ="}]; |
|
24287 | 109 |
|
110 |
val null_const_tab : const_typ list list Symtab.table = |
|
37502 | 111 |
fold (Symtab.update o rpair []) standard_consts Symtab.empty |
24287 | 112 |
|
37502 | 113 |
fun get_goal_consts_typs thy goals = |
114 |
fold (add_term_consts_typs_rm thy) goals null_const_tab |
|
24287 | 115 |
|
116 |
(*Inserts a dummy "constant" referring to the theory name, so that relevance |
|
117 |
takes the given theory into account.*) |
|
36220
f3655a3ae1ab
rename Sledgehammer "theory_const" option to "theory_relevant", now that I understand better what it does
blanchet
parents:
36185
diff
changeset
|
118 |
fun const_prop_of theory_relevant th = |
f3655a3ae1ab
rename Sledgehammer "theory_const" option to "theory_relevant", now that I understand better what it does
blanchet
parents:
36185
diff
changeset
|
119 |
if theory_relevant then |
24287 | 120 |
let val name = Context.theory_name (theory_of_thm th) |
121 |
val t = Const (name ^ ". 1", HOLogic.boolT) |
|
122 |
in t $ prop_of th end |
|
123 |
else prop_of th; |
|
124 |
||
125 |
(**** Constant / Type Frequencies ****) |
|
126 |
||
127 |
(*A two-dimensional symbol table counts frequencies of constants. It's keyed first by |
|
128 |
constant name and second by its list of type instantiations. For the latter, we need |
|
129 |
a linear ordering on type const_typ list.*) |
|
130 |
||
131 |
local |
|
132 |
||
133 |
fun cons_nr CTVar = 0 |
|
134 |
| cons_nr (CType _) = 1; |
|
135 |
||
136 |
in |
|
137 |
||
138 |
fun const_typ_ord TU = |
|
139 |
case TU of |
|
140 |
(CType (a, Ts), CType (b, Us)) => |
|
141 |
(case fast_string_ord(a,b) of EQUAL => dict_ord const_typ_ord (Ts,Us) | ord => ord) |
|
142 |
| (T, U) => int_ord (cons_nr T, cons_nr U); |
|
143 |
||
144 |
end; |
|
145 |
||
31971
8c1b845ed105
renamed functor TableFun to Table, and GraphFun to Graph;
wenzelm
parents:
31910
diff
changeset
|
146 |
structure CTtab = Table(type key = const_typ list val ord = dict_ord const_typ_ord); |
24287 | 147 |
|
37503
c2dfa26b9da6
cosmetics + prevent consideration of inlined Skolem terms in relevance filter
blanchet
parents:
37502
diff
changeset
|
148 |
fun count_axiom_consts theory_relevant thy (thm, _) = |
c2dfa26b9da6
cosmetics + prevent consideration of inlined Skolem terms in relevance filter
blanchet
parents:
37502
diff
changeset
|
149 |
let |
c2dfa26b9da6
cosmetics + prevent consideration of inlined Skolem terms in relevance filter
blanchet
parents:
37502
diff
changeset
|
150 |
fun do_const (a, T) = |
c2dfa26b9da6
cosmetics + prevent consideration of inlined Skolem terms in relevance filter
blanchet
parents:
37502
diff
changeset
|
151 |
let val (c, cts) = const_with_typ thy (a,T) in |
c2dfa26b9da6
cosmetics + prevent consideration of inlined Skolem terms in relevance filter
blanchet
parents:
37502
diff
changeset
|
152 |
(* Two-dimensional table update. Constant maps to types maps to |
c2dfa26b9da6
cosmetics + prevent consideration of inlined Skolem terms in relevance filter
blanchet
parents:
37502
diff
changeset
|
153 |
count. *) |
c2dfa26b9da6
cosmetics + prevent consideration of inlined Skolem terms in relevance filter
blanchet
parents:
37502
diff
changeset
|
154 |
CTtab.map_default (cts, 0) (Integer.add 1) |
c2dfa26b9da6
cosmetics + prevent consideration of inlined Skolem terms in relevance filter
blanchet
parents:
37502
diff
changeset
|
155 |
|> Symtab.map_default (c, CTtab.empty) |
c2dfa26b9da6
cosmetics + prevent consideration of inlined Skolem terms in relevance filter
blanchet
parents:
37502
diff
changeset
|
156 |
end |
c2dfa26b9da6
cosmetics + prevent consideration of inlined Skolem terms in relevance filter
blanchet
parents:
37502
diff
changeset
|
157 |
fun do_term (Const x) = do_const x |
c2dfa26b9da6
cosmetics + prevent consideration of inlined Skolem terms in relevance filter
blanchet
parents:
37502
diff
changeset
|
158 |
| do_term (Free x) = do_const x |
c2dfa26b9da6
cosmetics + prevent consideration of inlined Skolem terms in relevance filter
blanchet
parents:
37502
diff
changeset
|
159 |
| do_term (Const (@{const_name skolem_id}, _) $ _) = I |
c2dfa26b9da6
cosmetics + prevent consideration of inlined Skolem terms in relevance filter
blanchet
parents:
37502
diff
changeset
|
160 |
| do_term (t $ u) = do_term t #> do_term u |
c2dfa26b9da6
cosmetics + prevent consideration of inlined Skolem terms in relevance filter
blanchet
parents:
37502
diff
changeset
|
161 |
| do_term (Abs (_, _, t)) = do_term t |
c2dfa26b9da6
cosmetics + prevent consideration of inlined Skolem terms in relevance filter
blanchet
parents:
37502
diff
changeset
|
162 |
| do_term _ = I |
c2dfa26b9da6
cosmetics + prevent consideration of inlined Skolem terms in relevance filter
blanchet
parents:
37502
diff
changeset
|
163 |
in do_term (const_prop_of theory_relevant thm) end |
24287 | 164 |
|
165 |
||
166 |
(**** Actual Filtering Code ****) |
|
167 |
||
168 |
(*The frequency of a constant is the sum of those of all instances of its type.*) |
|
169 |
fun const_frequency ctab (c, cts) = |
|
36185
0ee736f08ed0
optimize relevance filter by doing a Table.fold directly rather than destroying the datastructure each time;
blanchet
parents:
36182
diff
changeset
|
170 |
CTtab.fold (fn (cts', m) => match_types cts cts' ? Integer.add m) |
0ee736f08ed0
optimize relevance filter by doing a Table.fold directly rather than destroying the datastructure each time;
blanchet
parents:
36182
diff
changeset
|
171 |
(the (Symtab.lookup ctab c)) 0 |
24287 | 172 |
|
37503
c2dfa26b9da6
cosmetics + prevent consideration of inlined Skolem terms in relevance filter
blanchet
parents:
37502
diff
changeset
|
173 |
(*A surprising number of theorems contain only a few significant constants. |
c2dfa26b9da6
cosmetics + prevent consideration of inlined Skolem terms in relevance filter
blanchet
parents:
37502
diff
changeset
|
174 |
These include all induction rules, and other general theorems. Filtering |
c2dfa26b9da6
cosmetics + prevent consideration of inlined Skolem terms in relevance filter
blanchet
parents:
37502
diff
changeset
|
175 |
theorems in clause form reveals these complexities in the form of Skolem |
c2dfa26b9da6
cosmetics + prevent consideration of inlined Skolem terms in relevance filter
blanchet
parents:
37502
diff
changeset
|
176 |
functions. If we were instead to filter theorems in their natural form, |
c2dfa26b9da6
cosmetics + prevent consideration of inlined Skolem terms in relevance filter
blanchet
parents:
37502
diff
changeset
|
177 |
some other method of measuring theorem complexity would become necessary.*) |
c2dfa26b9da6
cosmetics + prevent consideration of inlined Skolem terms in relevance filter
blanchet
parents:
37502
diff
changeset
|
178 |
|
c2dfa26b9da6
cosmetics + prevent consideration of inlined Skolem terms in relevance filter
blanchet
parents:
37502
diff
changeset
|
179 |
(* "log" seems best in practice. A constant function of one ignores the constant |
c2dfa26b9da6
cosmetics + prevent consideration of inlined Skolem terms in relevance filter
blanchet
parents:
37502
diff
changeset
|
180 |
frequencies. *) |
c2dfa26b9da6
cosmetics + prevent consideration of inlined Skolem terms in relevance filter
blanchet
parents:
37502
diff
changeset
|
181 |
fun log_weight2 (x:real) = 1.0 + 2.0 / Math.ln (x + 1.0) |
c2dfa26b9da6
cosmetics + prevent consideration of inlined Skolem terms in relevance filter
blanchet
parents:
37502
diff
changeset
|
182 |
|
c2dfa26b9da6
cosmetics + prevent consideration of inlined Skolem terms in relevance filter
blanchet
parents:
37502
diff
changeset
|
183 |
(* Computes a constant's weight, as determined by its frequency. *) |
c2dfa26b9da6
cosmetics + prevent consideration of inlined Skolem terms in relevance filter
blanchet
parents:
37502
diff
changeset
|
184 |
val ct_weight = log_weight2 o real oo const_frequency |
24287 | 185 |
|
186 |
(*Relevant constants are weighted according to frequency, |
|
187 |
but irrelevant constants are simply counted. Otherwise, Skolem functions, |
|
188 |
which are rare, would harm a clause's chances of being picked.*) |
|
189 |
fun clause_weight ctab gctyps consts_typs = |
|
190 |
let val rel = filter (uni_mem gctyps) consts_typs |
|
37503
c2dfa26b9da6
cosmetics + prevent consideration of inlined Skolem terms in relevance filter
blanchet
parents:
37502
diff
changeset
|
191 |
val rel_weight = fold (curry Real.+ o ct_weight ctab) rel 0.0 |
24287 | 192 |
in |
32960
69916a850301
eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents:
32955
diff
changeset
|
193 |
rel_weight / (rel_weight + real (length consts_typs - length rel)) |
24287 | 194 |
end; |
195 |
||
196 |
(*Multiplies out to a list of pairs: 'a * 'b list -> ('a * 'b) list -> ('a * 'b) list*) |
|
30190 | 197 |
fun add_expand_pairs (x,ys) xys = List.foldl (fn (y,acc) => (x,y)::acc) xys ys; |
24287 | 198 |
|
199 |
fun consts_typs_of_term thy t = |
|
37502 | 200 |
let val tab = add_term_consts_typs_rm thy t null_const_tab in |
201 |
Symtab.fold add_expand_pairs tab [] |
|
202 |
end |
|
24287 | 203 |
|
36220
f3655a3ae1ab
rename Sledgehammer "theory_const" option to "theory_relevant", now that I understand better what it does
blanchet
parents:
36185
diff
changeset
|
204 |
fun pair_consts_typs_axiom theory_relevant thy (p as (thm, _)) = |
f3655a3ae1ab
rename Sledgehammer "theory_const" option to "theory_relevant", now that I understand better what it does
blanchet
parents:
36185
diff
changeset
|
205 |
(p, (consts_typs_of_term thy (const_prop_of theory_relevant thm))); |
24287 | 206 |
|
207 |
exception ConstFree; |
|
208 |
fun dest_ConstFree (Const aT) = aT |
|
209 |
| dest_ConstFree (Free aT) = aT |
|
210 |
| dest_ConstFree _ = raise ConstFree; |
|
211 |
||
212 |
(*Look for definitions of the form f ?x1 ... ?xn = t, but not reversed.*) |
|
32994 | 213 |
fun defines thy thm gctypes = |
24287 | 214 |
let val tm = prop_of thm |
32960
69916a850301
eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents:
32955
diff
changeset
|
215 |
fun defs lhs rhs = |
24287 | 216 |
let val (rator,args) = strip_comb lhs |
32960
69916a850301
eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents:
32955
diff
changeset
|
217 |
val ct = const_with_typ thy (dest_ConstFree rator) |
33037
b22e44496dc2
replaced old_style infixes eq_set, subset, union, inter and variants by generic versions
haftmann
parents:
32994
diff
changeset
|
218 |
in |
b22e44496dc2
replaced old_style infixes eq_set, subset, union, inter and variants by generic versions
haftmann
parents:
32994
diff
changeset
|
219 |
forall is_Var args andalso uni_mem gctypes ct andalso |
33038 | 220 |
subset (op =) (Term.add_vars rhs [], Term.add_vars lhs []) |
24287 | 221 |
end |
32960
69916a850301
eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents:
32955
diff
changeset
|
222 |
handle ConstFree => false |
24287 | 223 |
in |
35963 | 224 |
case tm of |
225 |
@{const Trueprop} $ (Const (@{const_name "op ="}, _) $ lhs $ rhs) => |
|
226 |
defs lhs rhs |
|
227 |
| _ => false |
|
24287 | 228 |
end; |
229 |
||
37500
7587b6e63454
thread original theorem along with CNF theorem, as a step toward killing the Skolem cache
blanchet
parents:
37498
diff
changeset
|
230 |
type annotated_clause = cnf_thm * ((string * const_typ list) list) |
24287 | 231 |
|
232 |
(*For a reverse sort, putting the largest values first.*) |
|
37500
7587b6e63454
thread original theorem along with CNF theorem, as a step toward killing the Skolem cache
blanchet
parents:
37498
diff
changeset
|
233 |
fun compare_pairs ((_, w1), (_, w2)) = Real.compare (w2, w1) |
24287 | 234 |
|
235 |
(*Limit the number of new clauses, to prevent runaway acceptance.*) |
|
37500
7587b6e63454
thread original theorem along with CNF theorem, as a step toward killing the Skolem cache
blanchet
parents:
37498
diff
changeset
|
236 |
fun take_best max_new (newpairs : (annotated_clause * real) list) = |
24287 | 237 |
let val nnew = length newpairs |
238 |
in |
|
28477
9339d4dcec8b
version of sledgehammer using threads instead of processes, misc cleanup;
wenzelm
parents:
28065
diff
changeset
|
239 |
if nnew <= max_new then (map #1 newpairs, []) |
24287 | 240 |
else |
241 |
let val cls = sort compare_pairs newpairs |
|
28477
9339d4dcec8b
version of sledgehammer using threads instead of processes, misc cleanup;
wenzelm
parents:
28065
diff
changeset
|
242 |
val accepted = List.take (cls, max_new) |
24287 | 243 |
in |
35865 | 244 |
trace_msg (fn () => ("Number of candidates, " ^ Int.toString nnew ^ |
32960
69916a850301
eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents:
32955
diff
changeset
|
245 |
", exceeds the limit of " ^ Int.toString (max_new))); |
35865 | 246 |
trace_msg (fn () => ("Effective pass mark: " ^ Real.toString (#2 (List.last accepted)))); |
247 |
trace_msg (fn () => "Actually passed: " ^ |
|
37500
7587b6e63454
thread original theorem along with CNF theorem, as a step toward killing the Skolem cache
blanchet
parents:
37498
diff
changeset
|
248 |
space_implode ", " (map (fn (((_,((name,_), _)),_),_) => name) accepted)); |
24287 | 249 |
|
32960
69916a850301
eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents:
32955
diff
changeset
|
250 |
(map #1 accepted, map #1 (List.drop (cls, max_new))) |
24287 | 251 |
end |
252 |
end; |
|
253 |
||
36922 | 254 |
fun relevant_clauses ctxt relevance_convergence defs_relevant max_new |
37498
b426cbdb5a23
removed Sledgehammer's support for the DFG syntax;
blanchet
parents:
37479
diff
changeset
|
255 |
({add, del, ...} : relevance_override) ctab = |
36182
b136019c5d61
reorganize Sledgehammer's relevance filter slightly
blanchet
parents:
36061
diff
changeset
|
256 |
let |
37344
40f379944c1e
totally bypass Sledgehammer's relevance filter when facts are given using the "(fact1 ... factn)" syntax;
blanchet
parents:
37171
diff
changeset
|
257 |
val thy = ProofContext.theory_of ctxt |
37501
b5440c78ed3f
leverage new data structure for handling "add:" and "del:"
blanchet
parents:
37500
diff
changeset
|
258 |
val add_thms = maps (ProofContext.get_fact ctxt) add |
b5440c78ed3f
leverage new data structure for handling "add:" and "del:"
blanchet
parents:
37500
diff
changeset
|
259 |
val del_thms = maps (ProofContext.get_fact ctxt) del |
37344
40f379944c1e
totally bypass Sledgehammer's relevance filter when facts are given using the "(fact1 ... factn)" syntax;
blanchet
parents:
37171
diff
changeset
|
260 |
fun iter threshold rel_consts = |
36182
b136019c5d61
reorganize Sledgehammer's relevance filter slightly
blanchet
parents:
36061
diff
changeset
|
261 |
let |
b136019c5d61
reorganize Sledgehammer's relevance filter slightly
blanchet
parents:
36061
diff
changeset
|
262 |
fun relevant ([], _) [] = [] (* Nothing added this iteration *) |
37344
40f379944c1e
totally bypass Sledgehammer's relevance filter when facts are given using the "(fact1 ... factn)" syntax;
blanchet
parents:
37171
diff
changeset
|
263 |
| relevant (newpairs, rejects) [] = |
36182
b136019c5d61
reorganize Sledgehammer's relevance filter slightly
blanchet
parents:
36061
diff
changeset
|
264 |
let |
b136019c5d61
reorganize Sledgehammer's relevance filter slightly
blanchet
parents:
36061
diff
changeset
|
265 |
val (newrels, more_rejects) = take_best max_new newpairs |
b136019c5d61
reorganize Sledgehammer's relevance filter slightly
blanchet
parents:
36061
diff
changeset
|
266 |
val new_consts = maps #2 newrels |
37502 | 267 |
val rel_consts' = fold add_const_type_to_table new_consts rel_consts |
37344
40f379944c1e
totally bypass Sledgehammer's relevance filter when facts are given using the "(fact1 ... factn)" syntax;
blanchet
parents:
37171
diff
changeset
|
268 |
val threshold = |
40f379944c1e
totally bypass Sledgehammer's relevance filter when facts are given using the "(fact1 ... factn)" syntax;
blanchet
parents:
37171
diff
changeset
|
269 |
threshold + (1.0 - threshold) / relevance_convergence |
32960
69916a850301
eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents:
32955
diff
changeset
|
270 |
in |
36182
b136019c5d61
reorganize Sledgehammer's relevance filter slightly
blanchet
parents:
36061
diff
changeset
|
271 |
trace_msg (fn () => "relevant this iteration: " ^ |
b136019c5d61
reorganize Sledgehammer's relevance filter slightly
blanchet
parents:
36061
diff
changeset
|
272 |
Int.toString (length newrels)); |
37344
40f379944c1e
totally bypass Sledgehammer's relevance filter when facts are given using the "(fact1 ... factn)" syntax;
blanchet
parents:
37171
diff
changeset
|
273 |
map #1 newrels @ iter threshold rel_consts' |
40f379944c1e
totally bypass Sledgehammer's relevance filter when facts are given using the "(fact1 ... factn)" syntax;
blanchet
parents:
37171
diff
changeset
|
274 |
(more_rejects @ rejects) |
32960
69916a850301
eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents:
32955
diff
changeset
|
275 |
end |
36182
b136019c5d61
reorganize Sledgehammer's relevance filter slightly
blanchet
parents:
36061
diff
changeset
|
276 |
| relevant (newrels, rejects) |
37503
c2dfa26b9da6
cosmetics + prevent consideration of inlined Skolem terms in relevance filter
blanchet
parents:
37502
diff
changeset
|
277 |
((ax as (clsthm as (_, ((name, n), orig_th)), |
37501
b5440c78ed3f
leverage new data structure for handling "add:" and "del:"
blanchet
parents:
37500
diff
changeset
|
278 |
consts_typs)) :: axs) = |
35966
f8c738abaed8
honor the newly introduced Sledgehammer parameters and fixed the parsing;
blanchet
parents:
35963
diff
changeset
|
279 |
let |
37501
b5440c78ed3f
leverage new data structure for handling "add:" and "del:"
blanchet
parents:
37500
diff
changeset
|
280 |
val weight = if member Thm.eq_thm add_thms orig_th then 1.0 |
b5440c78ed3f
leverage new data structure for handling "add:" and "del:"
blanchet
parents:
37500
diff
changeset
|
281 |
else if member Thm.eq_thm del_thms orig_th then 0.0 |
35966
f8c738abaed8
honor the newly introduced Sledgehammer parameters and fixed the parsing;
blanchet
parents:
35963
diff
changeset
|
282 |
else clause_weight ctab rel_consts consts_typs |
32960
69916a850301
eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents:
32955
diff
changeset
|
283 |
in |
37344
40f379944c1e
totally bypass Sledgehammer's relevance filter when facts are given using the "(fact1 ... factn)" syntax;
blanchet
parents:
37171
diff
changeset
|
284 |
if weight >= threshold orelse |
36922 | 285 |
(defs_relevant andalso defines thy (#1 clsthm) rel_consts) then |
36182
b136019c5d61
reorganize Sledgehammer's relevance filter slightly
blanchet
parents:
36061
diff
changeset
|
286 |
(trace_msg (fn () => name ^ " clause " ^ Int.toString n ^ |
b136019c5d61
reorganize Sledgehammer's relevance filter slightly
blanchet
parents:
36061
diff
changeset
|
287 |
" passes: " ^ Real.toString weight); |
b136019c5d61
reorganize Sledgehammer's relevance filter slightly
blanchet
parents:
36061
diff
changeset
|
288 |
relevant ((ax, weight) :: newrels, rejects) axs) |
b136019c5d61
reorganize Sledgehammer's relevance filter slightly
blanchet
parents:
36061
diff
changeset
|
289 |
else |
b136019c5d61
reorganize Sledgehammer's relevance filter slightly
blanchet
parents:
36061
diff
changeset
|
290 |
relevant (newrels, ax :: rejects) axs |
32960
69916a850301
eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents:
32955
diff
changeset
|
291 |
end |
36182
b136019c5d61
reorganize Sledgehammer's relevance filter slightly
blanchet
parents:
36061
diff
changeset
|
292 |
in |
37344
40f379944c1e
totally bypass Sledgehammer's relevance filter when facts are given using the "(fact1 ... factn)" syntax;
blanchet
parents:
37171
diff
changeset
|
293 |
trace_msg (fn () => "relevant_clauses, current threshold: " ^ |
40f379944c1e
totally bypass Sledgehammer's relevance filter when facts are given using the "(fact1 ... factn)" syntax;
blanchet
parents:
37171
diff
changeset
|
294 |
Real.toString threshold); |
36182
b136019c5d61
reorganize Sledgehammer's relevance filter slightly
blanchet
parents:
36061
diff
changeset
|
295 |
relevant ([], []) |
b136019c5d61
reorganize Sledgehammer's relevance filter slightly
blanchet
parents:
36061
diff
changeset
|
296 |
end |
b136019c5d61
reorganize Sledgehammer's relevance filter slightly
blanchet
parents:
36061
diff
changeset
|
297 |
in iter end |
32960
69916a850301
eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents:
32955
diff
changeset
|
298 |
|
36922 | 299 |
fun relevance_filter ctxt relevance_threshold relevance_convergence |
300 |
defs_relevant max_new theory_relevant relevance_override |
|
37500
7587b6e63454
thread original theorem along with CNF theorem, as a step toward killing the Skolem cache
blanchet
parents:
37498
diff
changeset
|
301 |
thy (axioms : cnf_thm list) goals = |
35966
f8c738abaed8
honor the newly introduced Sledgehammer parameters and fixed the parsing;
blanchet
parents:
35963
diff
changeset
|
302 |
if relevance_threshold > 0.0 then |
35963 | 303 |
let |
37503
c2dfa26b9da6
cosmetics + prevent consideration of inlined Skolem terms in relevance filter
blanchet
parents:
37502
diff
changeset
|
304 |
val const_tab = fold (count_axiom_consts theory_relevant thy) axioms |
c2dfa26b9da6
cosmetics + prevent consideration of inlined Skolem terms in relevance filter
blanchet
parents:
37502
diff
changeset
|
305 |
Symtab.empty |
24287 | 306 |
val goal_const_tab = get_goal_consts_typs thy goals |
35963 | 307 |
val _ = |
308 |
trace_msg (fn () => "Initial constants: " ^ |
|
309 |
commas (Symtab.keys goal_const_tab)) |
|
310 |
val relevant = |
|
36922 | 311 |
relevant_clauses ctxt relevance_convergence defs_relevant max_new |
37344
40f379944c1e
totally bypass Sledgehammer's relevance filter when facts are given using the "(fact1 ... factn)" syntax;
blanchet
parents:
37171
diff
changeset
|
312 |
relevance_override const_tab relevance_threshold |
36922 | 313 |
goal_const_tab |
36220
f3655a3ae1ab
rename Sledgehammer "theory_const" option to "theory_relevant", now that I understand better what it does
blanchet
parents:
36185
diff
changeset
|
314 |
(map (pair_consts_typs_axiom theory_relevant thy) |
f3655a3ae1ab
rename Sledgehammer "theory_const" option to "theory_relevant", now that I understand better what it does
blanchet
parents:
36185
diff
changeset
|
315 |
axioms) |
35963 | 316 |
in |
317 |
trace_msg (fn () => "Total relevant: " ^ Int.toString (length relevant)); |
|
318 |
relevant |
|
319 |
end |
|
320 |
else |
|
321 |
axioms; |
|
24287 | 322 |
|
323 |
(***************************************************************) |
|
19768
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
324 |
(* Retrieving and filtering lemmas *) |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
325 |
(***************************************************************) |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
326 |
|
33022
c95102496490
Removal of the unused atpset concept, the atp attribute and some related code.
paulson
parents:
32994
diff
changeset
|
327 |
(*** retrieve lemmas and filter them ***) |
19768
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
328 |
|
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
329 |
(*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
|
330 |
|
22382
dbf09db0a40d
New code to store theorem names in a concise form rather than as fully-qualified.
paulson
parents:
22217
diff
changeset
|
331 |
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
|
332 |
|
20757
fe84fe0dfd30
Definitions produced by packages are now blacklisted.
paulson
parents:
20661
diff
changeset
|
333 |
(*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
|
334 |
"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
|
335 |
fun is_package_def a = |
30364
577edc39b501
moved basic algebra of long names from structure NameSpace to Long_Name;
wenzelm
parents:
30291
diff
changeset
|
336 |
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
|
337 |
in |
552d20ff9a95
Removal of theorem tagging, which the ATP linkup no longer requires.
paulson
parents:
21588
diff
changeset
|
338 |
length names > 2 andalso |
552d20ff9a95
Removal of theorem tagging, which the ATP linkup no longer requires.
paulson
parents:
21588
diff
changeset
|
339 |
not (hd names = "local") andalso |
552d20ff9a95
Removal of theorem tagging, which the ATP linkup no longer requires.
paulson
parents:
21588
diff
changeset
|
340 |
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
|
341 |
end; |
20757
fe84fe0dfd30
Definitions produced by packages are now blacklisted.
paulson
parents:
20661
diff
changeset
|
342 |
|
36061 | 343 |
fun mk_clause_table xs = |
344 |
fold (Termtab.update o `(prop_of o fst)) xs Termtab.empty |
|
22382
dbf09db0a40d
New code to store theorem names in a concise form rather than as fully-qualified.
paulson
parents:
22217
diff
changeset
|
345 |
|
36061 | 346 |
fun make_unique xs = |
347 |
Termtab.fold (cons o snd) (mk_clause_table xs) [] |
|
19768
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
348 |
|
36061 | 349 |
(* Remove existing axiom clauses from the conjecture clauses, as this can |
350 |
dramatically boost an ATP's performance (for some reason). *) |
|
351 |
fun subtract_cls ax_clauses = |
|
352 |
filter_out (Termtab.defined (mk_clause_table ax_clauses) o prop_of) |
|
19768
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
353 |
|
37345
4402a2bfa204
make Sledgehammer's "add:" and "del:" syntax work better in the presence of aliases;
blanchet
parents:
37344
diff
changeset
|
354 |
fun all_name_thms_pairs respect_no_atp ctxt chained_ths = |
22382
dbf09db0a40d
New code to store theorem names in a concise form rather than as fully-qualified.
paulson
parents:
22217
diff
changeset
|
355 |
let |
26675 | 356 |
val global_facts = PureThy.facts_of (ProofContext.theory_of ctxt); |
26278 | 357 |
val local_facts = ProofContext.facts_of ctxt; |
33641
af07d9cd86ce
all_valid_thms: more sophisticated check against global + local name space;
wenzelm
parents:
33316
diff
changeset
|
358 |
val full_space = |
af07d9cd86ce
all_valid_thms: more sophisticated check against global + local name space;
wenzelm
parents:
33316
diff
changeset
|
359 |
Name_Space.merge (Facts.space_of global_facts, Facts.space_of local_facts); |
af07d9cd86ce
all_valid_thms: more sophisticated check against global + local name space;
wenzelm
parents:
33316
diff
changeset
|
360 |
|
af07d9cd86ce
all_valid_thms: more sophisticated check against global + local name space;
wenzelm
parents:
33316
diff
changeset
|
361 |
fun valid_facts facts = |
af07d9cd86ce
all_valid_thms: more sophisticated check against global + local name space;
wenzelm
parents:
33316
diff
changeset
|
362 |
(facts, []) |-> Facts.fold_static (fn (name, ths0) => |
37399
34f080a12063
proper polymorphic Skolemization of uncached facts + synchronization of caching and relevance filter
blanchet
parents:
37359
diff
changeset
|
363 |
if Facts.is_concealed facts name orelse |
34f080a12063
proper polymorphic Skolemization of uncached facts + synchronization of caching and relevance filter
blanchet
parents:
37359
diff
changeset
|
364 |
(respect_no_atp andalso is_package_def name) orelse |
34f080a12063
proper polymorphic Skolemization of uncached facts + synchronization of caching and relevance filter
blanchet
parents:
37359
diff
changeset
|
365 |
member (op =) multi_base_blacklist (Long_Name.base_name name) then |
34f080a12063
proper polymorphic Skolemization of uncached facts + synchronization of caching and relevance filter
blanchet
parents:
37359
diff
changeset
|
366 |
I |
34f080a12063
proper polymorphic Skolemization of uncached facts + synchronization of caching and relevance filter
blanchet
parents:
37359
diff
changeset
|
367 |
else |
34f080a12063
proper polymorphic Skolemization of uncached facts + synchronization of caching and relevance filter
blanchet
parents:
37359
diff
changeset
|
368 |
let |
34f080a12063
proper polymorphic Skolemization of uncached facts + synchronization of caching and relevance filter
blanchet
parents:
37359
diff
changeset
|
369 |
fun check_thms a = |
34f080a12063
proper polymorphic Skolemization of uncached facts + synchronization of caching and relevance filter
blanchet
parents:
37359
diff
changeset
|
370 |
(case try (ProofContext.get_thms ctxt) a of |
34f080a12063
proper polymorphic Skolemization of uncached facts + synchronization of caching and relevance filter
blanchet
parents:
37359
diff
changeset
|
371 |
NONE => false |
34f080a12063
proper polymorphic Skolemization of uncached facts + synchronization of caching and relevance filter
blanchet
parents:
37359
diff
changeset
|
372 |
| SOME ths1 => Thm.eq_thms (ths0, ths1)); |
33641
af07d9cd86ce
all_valid_thms: more sophisticated check against global + local name space;
wenzelm
parents:
33316
diff
changeset
|
373 |
|
37399
34f080a12063
proper polymorphic Skolemization of uncached facts + synchronization of caching and relevance filter
blanchet
parents:
37359
diff
changeset
|
374 |
val name1 = Facts.extern facts name; |
34f080a12063
proper polymorphic Skolemization of uncached facts + synchronization of caching and relevance filter
blanchet
parents:
37359
diff
changeset
|
375 |
val name2 = Name_Space.extern full_space name; |
34f080a12063
proper polymorphic Skolemization of uncached facts + synchronization of caching and relevance filter
blanchet
parents:
37359
diff
changeset
|
376 |
val ths = filter_out is_theorem_bad_for_atps ths0; |
34f080a12063
proper polymorphic Skolemization of uncached facts + synchronization of caching and relevance filter
blanchet
parents:
37359
diff
changeset
|
377 |
in |
34f080a12063
proper polymorphic Skolemization of uncached facts + synchronization of caching and relevance filter
blanchet
parents:
37359
diff
changeset
|
378 |
case find_first check_thms [name1, name2, name] of |
34f080a12063
proper polymorphic Skolemization of uncached facts + synchronization of caching and relevance filter
blanchet
parents:
37359
diff
changeset
|
379 |
NONE => I |
34f080a12063
proper polymorphic Skolemization of uncached facts + synchronization of caching and relevance filter
blanchet
parents:
37359
diff
changeset
|
380 |
| SOME name' => |
34f080a12063
proper polymorphic Skolemization of uncached facts + synchronization of caching and relevance filter
blanchet
parents:
37359
diff
changeset
|
381 |
cons (name' |> forall (member Thm.eq_thm chained_ths) ths |
34f080a12063
proper polymorphic Skolemization of uncached facts + synchronization of caching and relevance filter
blanchet
parents:
37359
diff
changeset
|
382 |
? prefix chained_prefix, ths) |
34f080a12063
proper polymorphic Skolemization of uncached facts + synchronization of caching and relevance filter
blanchet
parents:
37359
diff
changeset
|
383 |
end) |
26675 | 384 |
in valid_facts global_facts @ valid_facts local_facts end; |
21224 | 385 |
|
33309 | 386 |
fun multi_name a th (n, pairs) = |
387 |
(n + 1, (a ^ "(" ^ Int.toString n ^ ")", th) :: pairs); |
|
21224 | 388 |
|
37498
b426cbdb5a23
removed Sledgehammer's support for the DFG syntax;
blanchet
parents:
37479
diff
changeset
|
389 |
fun add_names (_, []) pairs = pairs |
37399
34f080a12063
proper polymorphic Skolemization of uncached facts + synchronization of caching and relevance filter
blanchet
parents:
37359
diff
changeset
|
390 |
| add_names (a, [th]) pairs = (a, th) :: pairs |
34f080a12063
proper polymorphic Skolemization of uncached facts + synchronization of caching and relevance filter
blanchet
parents:
37359
diff
changeset
|
391 |
| add_names (a, ths) pairs = #2 (fold (multi_name a) ths (1, pairs)) |
21224 | 392 |
|
21290
33b6bb5d6ab8
Improvement to classrel clauses: now outputs the minimum needed.
paulson
parents:
21243
diff
changeset
|
393 |
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
|
394 |
|
36550
f8da913b6c3a
make sure short theorem names are preferred to composite ones in Sledgehammer;
blanchet
parents:
36473
diff
changeset
|
395 |
(* The single-name theorems go after the multiple-name ones, so that single |
f8da913b6c3a
make sure short theorem names are preferred to composite ones in Sledgehammer;
blanchet
parents:
36473
diff
changeset
|
396 |
names are preferred when both are available. *) |
37344
40f379944c1e
totally bypass Sledgehammer's relevance filter when facts are given using the "(fact1 ... factn)" syntax;
blanchet
parents:
37171
diff
changeset
|
397 |
fun name_thm_pairs respect_no_atp ctxt name_thms_pairs = |
33309 | 398 |
let |
37344
40f379944c1e
totally bypass Sledgehammer's relevance filter when facts are given using the "(fact1 ... factn)" syntax;
blanchet
parents:
37171
diff
changeset
|
399 |
val (mults, singles) = List.partition is_multi name_thms_pairs |
37399
34f080a12063
proper polymorphic Skolemization of uncached facts + synchronization of caching and relevance filter
blanchet
parents:
37359
diff
changeset
|
400 |
val ps = [] |> fold add_names singles |> fold add_names mults |
36060
4d27652ffb40
reintroduce efficient set structure to collect "no_atp" theorems
blanchet
parents:
36059
diff
changeset
|
401 |
in ps |> respect_no_atp ? filter_out (No_ATPs.member ctxt o snd) end; |
21224 | 402 |
|
37344
40f379944c1e
totally bypass Sledgehammer's relevance filter when facts are given using the "(fact1 ... factn)" syntax;
blanchet
parents:
37171
diff
changeset
|
403 |
fun is_named ("", th) = |
40f379944c1e
totally bypass Sledgehammer's relevance filter when facts are given using the "(fact1 ... factn)" syntax;
blanchet
parents:
37171
diff
changeset
|
404 |
(warning ("No name for theorem " ^ |
40f379944c1e
totally bypass Sledgehammer's relevance filter when facts are given using the "(fact1 ... factn)" syntax;
blanchet
parents:
37171
diff
changeset
|
405 |
Display.string_of_thm_without_context th); false) |
40f379944c1e
totally bypass Sledgehammer's relevance filter when facts are given using the "(fact1 ... factn)" syntax;
blanchet
parents:
37171
diff
changeset
|
406 |
| is_named _ = true |
40f379944c1e
totally bypass Sledgehammer's relevance filter when facts are given using the "(fact1 ... factn)" syntax;
blanchet
parents:
37171
diff
changeset
|
407 |
fun checked_name_thm_pairs respect_no_atp ctxt = |
40f379944c1e
totally bypass Sledgehammer's relevance filter when facts are given using the "(fact1 ... factn)" syntax;
blanchet
parents:
37171
diff
changeset
|
408 |
name_thm_pairs respect_no_atp ctxt |
40f379944c1e
totally bypass Sledgehammer's relevance filter when facts are given using the "(fact1 ... factn)" syntax;
blanchet
parents:
37171
diff
changeset
|
409 |
#> tap (fn ps => trace_msg |
40f379944c1e
totally bypass Sledgehammer's relevance filter when facts are given using the "(fact1 ... factn)" syntax;
blanchet
parents:
37171
diff
changeset
|
410 |
(fn () => ("Considering " ^ Int.toString (length ps) ^ |
40f379944c1e
totally bypass Sledgehammer's relevance filter when facts are given using the "(fact1 ... factn)" syntax;
blanchet
parents:
37171
diff
changeset
|
411 |
" theorems"))) |
40f379944c1e
totally bypass Sledgehammer's relevance filter when facts are given using the "(fact1 ... factn)" syntax;
blanchet
parents:
37171
diff
changeset
|
412 |
#> filter is_named |
19894 | 413 |
|
37344
40f379944c1e
totally bypass Sledgehammer's relevance filter when facts are given using the "(fact1 ... factn)" syntax;
blanchet
parents:
37171
diff
changeset
|
414 |
fun name_thms_pair_from_ref ctxt chained_ths xref = |
40f379944c1e
totally bypass Sledgehammer's relevance filter when facts are given using the "(fact1 ... factn)" syntax;
blanchet
parents:
37171
diff
changeset
|
415 |
let |
40f379944c1e
totally bypass Sledgehammer's relevance filter when facts are given using the "(fact1 ... factn)" syntax;
blanchet
parents:
37171
diff
changeset
|
416 |
val ths = ProofContext.get_fact ctxt xref |
40f379944c1e
totally bypass Sledgehammer's relevance filter when facts are given using the "(fact1 ... factn)" syntax;
blanchet
parents:
37171
diff
changeset
|
417 |
val name = Facts.string_of_ref xref |
40f379944c1e
totally bypass Sledgehammer's relevance filter when facts are given using the "(fact1 ... factn)" syntax;
blanchet
parents:
37171
diff
changeset
|
418 |
|> forall (member Thm.eq_thm chained_ths) ths |
40f379944c1e
totally bypass Sledgehammer's relevance filter when facts are given using the "(fact1 ... factn)" syntax;
blanchet
parents:
37171
diff
changeset
|
419 |
? prefix chained_prefix |
40f379944c1e
totally bypass Sledgehammer's relevance filter when facts are given using the "(fact1 ... factn)" syntax;
blanchet
parents:
37171
diff
changeset
|
420 |
in (name, ths) end |
40f379944c1e
totally bypass Sledgehammer's relevance filter when facts are given using the "(fact1 ... factn)" syntax;
blanchet
parents:
37171
diff
changeset
|
421 |
|
19768
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
422 |
|
21290
33b6bb5d6ab8
Improvement to classrel clauses: now outputs the minimum needed.
paulson
parents:
21243
diff
changeset
|
423 |
(***************************************************************) |
33b6bb5d6ab8
Improvement to classrel clauses: now outputs the minimum needed.
paulson
parents:
21243
diff
changeset
|
424 |
(* Type Classes Present in the Axiom or Conjecture Clauses *) |
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 |
|
32952 | 427 |
fun add_classes (sorts, cset) = List.foldl setinsert cset (flat sorts); |
21290
33b6bb5d6ab8
Improvement to classrel clauses: now outputs the minimum needed.
paulson
parents:
21243
diff
changeset
|
428 |
|
33b6bb5d6ab8
Improvement to classrel clauses: now outputs the minimum needed.
paulson
parents:
21243
diff
changeset
|
429 |
(*Remove this trivial type class*) |
35865 | 430 |
fun delete_type cset = Symtab.delete_safe (the_single @{sort HOL.type}) cset; |
21290
33b6bb5d6ab8
Improvement to classrel clauses: now outputs the minimum needed.
paulson
parents:
21243
diff
changeset
|
431 |
|
33b6bb5d6ab8
Improvement to classrel clauses: now outputs the minimum needed.
paulson
parents:
21243
diff
changeset
|
432 |
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
|
433 |
let val sorts_list = map (map #2 o OldTerm.term_tvars) ts |
30190 | 434 |
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
|
435 |
|
33b6bb5d6ab8
Improvement to classrel clauses: now outputs the minimum needed.
paulson
parents:
21243
diff
changeset
|
436 |
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
|
437 |
let val sorts_list = map (map #2 o OldTerm.term_tfrees) ts |
30190 | 438 |
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
|
439 |
|
21373
18f519614978
Arity clauses are now produced only for types and type classes actually used.
paulson
parents:
21311
diff
changeset
|
440 |
(*fold type constructors*) |
18f519614978
Arity clauses are now produced only for types and type classes actually used.
paulson
parents:
21311
diff
changeset
|
441 |
fun fold_type_consts f (Type (a, Ts)) x = fold (fold_type_consts f) Ts (f (a,x)) |
32994 | 442 |
| fold_type_consts _ _ x = x; |
21373
18f519614978
Arity clauses are now produced only for types and type classes actually used.
paulson
parents:
21311
diff
changeset
|
443 |
|
18f519614978
Arity clauses are now produced only for types and type classes actually used.
paulson
parents:
21311
diff
changeset
|
444 |
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
|
445 |
|
21397
2134b81a0b37
Now includes only types used to instantiate overloaded constants in arity clauses
paulson
parents:
21373
diff
changeset
|
446 |
(*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
|
447 |
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
|
448 |
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
|
449 |
fun add_tcs (Const cT) x = fold add_type_consts_in_type (const_typargs cT) x |
32994 | 450 |
| add_tcs (Abs (_, _, u)) x = add_tcs u x |
21397
2134b81a0b37
Now includes only types used to instantiate overloaded constants in arity clauses
paulson
parents:
21373
diff
changeset
|
451 |
| 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
|
452 |
| add_tcs _ x = x |
2134b81a0b37
Now includes only types used to instantiate overloaded constants in arity clauses
paulson
parents:
21373
diff
changeset
|
453 |
in add_tcs end |
21373
18f519614978
Arity clauses are now produced only for types and type classes actually used.
paulson
parents:
21311
diff
changeset
|
454 |
|
21397
2134b81a0b37
Now includes only types used to instantiate overloaded constants in arity clauses
paulson
parents:
21373
diff
changeset
|
455 |
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
|
456 |
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
|
457 |
|
18f519614978
Arity clauses are now produced only for types and type classes actually used.
paulson
parents:
21311
diff
changeset
|
458 |
|
19194 | 459 |
(***************************************************************) |
460 |
(* ATP invocation methods setup *) |
|
461 |
(***************************************************************) |
|
462 |
||
37410
2bf7e6136047
adjusted the polymorphism handling of Skolem constants so that proof reconstruction doesn't fail in "equality_inf"
blanchet
parents:
37399
diff
changeset
|
463 |
fun is_quasi_fol_term thy = |
2bf7e6136047
adjusted the polymorphism handling of Skolem constants so that proof reconstruction doesn't fail in "equality_inf"
blanchet
parents:
37399
diff
changeset
|
464 |
Meson.is_fol_term thy o snd o conceal_skolem_somes ~1 [] |
37399
34f080a12063
proper polymorphic Skolemization of uncached facts + synchronization of caching and relevance filter
blanchet
parents:
37359
diff
changeset
|
465 |
|
20526
756c4f1fd04c
Extended the blacklist with higher-order theorems. Restructured. Added checks to
paulson
parents:
20457
diff
changeset
|
466 |
(*Ensures that no higher-order theorems "leak out"*) |
37399
34f080a12063
proper polymorphic Skolemization of uncached facts + synchronization of caching and relevance filter
blanchet
parents:
37359
diff
changeset
|
467 |
fun restrict_to_logic thy true cls = |
34f080a12063
proper polymorphic Skolemization of uncached facts + synchronization of caching and relevance filter
blanchet
parents:
37359
diff
changeset
|
468 |
filter (is_quasi_fol_term thy o prop_of o fst) cls |
37498
b426cbdb5a23
removed Sledgehammer's support for the DFG syntax;
blanchet
parents:
37479
diff
changeset
|
469 |
| restrict_to_logic _ false cls = cls |
20526
756c4f1fd04c
Extended the blacklist with higher-order theorems. Restructured. Added checks to
paulson
parents:
20457
diff
changeset
|
470 |
|
37347
635425a442e8
show more respect for user-specified facts, even if they could lead to unsound proofs + don't throw away "unsound" theorems in "full_type" mode, since they are then sound
blanchet
parents:
37345
diff
changeset
|
471 |
(**** Predicates to detect unwanted clauses (prolific or likely to cause |
635425a442e8
show more respect for user-specified facts, even if they could lead to unsound proofs + don't throw away "unsound" theorems in "full_type" mode, since they are then sound
blanchet
parents:
37345
diff
changeset
|
472 |
unsoundness) ****) |
21470
7c1b59ddcd56
Consolidation of code to "blacklist" unhelpful theorems, including record
paulson
parents:
21431
diff
changeset
|
473 |
|
7c1b59ddcd56
Consolidation of code to "blacklist" unhelpful theorems, including record
paulson
parents:
21431
diff
changeset
|
474 |
(** 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
|
475 |
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
|
476 |
inconsistent clauses such as V=a|V=b, though it by no means guarantees soundness. **) |
21588 | 477 |
|
37348 | 478 |
fun var_occurs_in_term ix = |
479 |
let |
|
480 |
fun aux (Var (jx, _)) = (ix = jx) |
|
481 |
| aux (t1 $ t2) = aux t1 orelse aux t2 |
|
482 |
| aux (Abs (_, _, t)) = aux t |
|
483 |
| aux _ = false |
|
484 |
in aux end |
|
21470
7c1b59ddcd56
Consolidation of code to "blacklist" unhelpful theorems, including record
paulson
parents:
21431
diff
changeset
|
485 |
|
37348 | 486 |
fun is_record_type T = not (null (Record.dest_recTs T)) |
21470
7c1b59ddcd56
Consolidation of code to "blacklist" unhelpful theorems, including record
paulson
parents:
21431
diff
changeset
|
487 |
|
7c1b59ddcd56
Consolidation of code to "blacklist" unhelpful theorems, including record
paulson
parents:
21431
diff
changeset
|
488 |
(*Unwanted equalities include |
7c1b59ddcd56
Consolidation of code to "blacklist" unhelpful theorems, including record
paulson
parents:
21431
diff
changeset
|
489 |
(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
|
490 |
(2) those between a variable and a record, since these seem to be prolific "cases" thms |
21588 | 491 |
*) |
37348 | 492 |
fun too_general_eqterms (Var (ix,T), t) = |
493 |
not (var_occurs_in_term ix t) orelse is_record_type T |
|
21470
7c1b59ddcd56
Consolidation of code to "blacklist" unhelpful theorems, including record
paulson
parents:
21431
diff
changeset
|
494 |
| too_general_eqterms _ = false; |
7c1b59ddcd56
Consolidation of code to "blacklist" unhelpful theorems, including record
paulson
parents:
21431
diff
changeset
|
495 |
|
35865 | 496 |
fun too_general_equality (Const (@{const_name "op ="}, _) $ x $ y) = |
21470
7c1b59ddcd56
Consolidation of code to "blacklist" unhelpful theorems, including record
paulson
parents:
21431
diff
changeset
|
497 |
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
|
498 |
| too_general_equality _ = false; |
7c1b59ddcd56
Consolidation of code to "blacklist" unhelpful theorems, including record
paulson
parents:
21431
diff
changeset
|
499 |
|
29267 | 500 |
fun has_typed_var tycons = exists_subterm |
501 |
(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
|
502 |
|
37347
635425a442e8
show more respect for user-specified facts, even if they could lead to unsound proofs + don't throw away "unsound" theorems in "full_type" mode, since they are then sound
blanchet
parents:
37345
diff
changeset
|
503 |
(* Clauses are forbidden to contain variables of these types. The typical reason |
635425a442e8
show more respect for user-specified facts, even if they could lead to unsound proofs + don't throw away "unsound" theorems in "full_type" mode, since they are then sound
blanchet
parents:
37345
diff
changeset
|
504 |
is that they lead to unsoundness. Note that "unit" satisfies numerous |
635425a442e8
show more respect for user-specified facts, even if they could lead to unsound proofs + don't throw away "unsound" theorems in "full_type" mode, since they are then sound
blanchet
parents:
37345
diff
changeset
|
505 |
equations like "?x = ()". The resulting clause will have no type constraint, |
635425a442e8
show more respect for user-specified facts, even if they could lead to unsound proofs + don't throw away "unsound" theorems in "full_type" mode, since they are then sound
blanchet
parents:
37345
diff
changeset
|
506 |
yielding false proofs. Even "bool" leads to many unsound proofs, though only |
635425a442e8
show more respect for user-specified facts, even if they could lead to unsound proofs + don't throw away "unsound" theorems in "full_type" mode, since they are then sound
blanchet
parents:
37345
diff
changeset
|
507 |
for higher-order problems. *) |
635425a442e8
show more respect for user-specified facts, even if they could lead to unsound proofs + don't throw away "unsound" theorems in "full_type" mode, since they are then sound
blanchet
parents:
37345
diff
changeset
|
508 |
val dangerous_types = [@{type_name unit}, @{type_name bool}]; |
22217
a5d983f7113f
Tidying; more debugging information. New reference unwanted_types.
paulson
parents:
22193
diff
changeset
|
509 |
|
37347
635425a442e8
show more respect for user-specified facts, even if they could lead to unsound proofs + don't throw away "unsound" theorems in "full_type" mode, since they are then sound
blanchet
parents:
37345
diff
changeset
|
510 |
(* Clauses containing variables of type "unit" or "bool" or of the form |
635425a442e8
show more respect for user-specified facts, even if they could lead to unsound proofs + don't throw away "unsound" theorems in "full_type" mode, since they are then sound
blanchet
parents:
37345
diff
changeset
|
511 |
"?x = A | ?x = B | ?x = C" are likely to lead to unsound proofs if types are |
635425a442e8
show more respect for user-specified facts, even if they could lead to unsound proofs + don't throw away "unsound" theorems in "full_type" mode, since they are then sound
blanchet
parents:
37345
diff
changeset
|
512 |
omitted. *) |
635425a442e8
show more respect for user-specified facts, even if they could lead to unsound proofs + don't throw away "unsound" theorems in "full_type" mode, since they are then sound
blanchet
parents:
37345
diff
changeset
|
513 |
fun is_dangerous_term _ @{prop True} = true |
635425a442e8
show more respect for user-specified facts, even if they could lead to unsound proofs + don't throw away "unsound" theorems in "full_type" mode, since they are then sound
blanchet
parents:
37345
diff
changeset
|
514 |
| is_dangerous_term full_types t = |
635425a442e8
show more respect for user-specified facts, even if they could lead to unsound proofs + don't throw away "unsound" theorems in "full_type" mode, since they are then sound
blanchet
parents:
37345
diff
changeset
|
515 |
not full_types andalso |
635425a442e8
show more respect for user-specified facts, even if they could lead to unsound proofs + don't throw away "unsound" theorems in "full_type" mode, since they are then sound
blanchet
parents:
37345
diff
changeset
|
516 |
(has_typed_var dangerous_types t orelse |
635425a442e8
show more respect for user-specified facts, even if they could lead to unsound proofs + don't throw away "unsound" theorems in "full_type" mode, since they are then sound
blanchet
parents:
37345
diff
changeset
|
517 |
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
|
518 |
|
37347
635425a442e8
show more respect for user-specified facts, even if they could lead to unsound proofs + don't throw away "unsound" theorems in "full_type" mode, since they are then sound
blanchet
parents:
37345
diff
changeset
|
519 |
fun remove_dangerous_clauses full_types add_thms = |
37501
b5440c78ed3f
leverage new data structure for handling "add:" and "del:"
blanchet
parents:
37500
diff
changeset
|
520 |
filter_out (fn (cnf_th, (_, orig_th)) => |
b5440c78ed3f
leverage new data structure for handling "add:" and "del:"
blanchet
parents:
37500
diff
changeset
|
521 |
not (member Thm.eq_thm add_thms orig_th) andalso |
b5440c78ed3f
leverage new data structure for handling "add:" and "del:"
blanchet
parents:
37500
diff
changeset
|
522 |
is_dangerous_term full_types (prop_of cnf_th)) |
21431
ef9080e7dbbc
Outputs a minimal number of arity clauses. Tidying of blacklist, fixing the blacklisting of thm lists
paulson
parents:
21397
diff
changeset
|
523 |
|
37399
34f080a12063
proper polymorphic Skolemization of uncached facts + synchronization of caching and relevance filter
blanchet
parents:
37359
diff
changeset
|
524 |
fun is_fol_goal thy = forall (Meson.is_fol_term thy) o map prop_of |
30536
07b4f050e4df
split relevance-filter and writing of problem-files;
immler@in.tum.de
parents:
30364
diff
changeset
|
525 |
|
37347
635425a442e8
show more respect for user-specified facts, even if they could lead to unsound proofs + don't throw away "unsound" theorems in "full_type" mode, since they are then sound
blanchet
parents:
37345
diff
changeset
|
526 |
fun relevant_facts full_types respect_no_atp relevance_threshold |
635425a442e8
show more respect for user-specified facts, even if they could lead to unsound proofs + don't throw away "unsound" theorems in "full_type" mode, since they are then sound
blanchet
parents:
37345
diff
changeset
|
527 |
relevance_convergence defs_relevant max_new theory_relevant |
635425a442e8
show more respect for user-specified facts, even if they could lead to unsound proofs + don't throw away "unsound" theorems in "full_type" mode, since they are then sound
blanchet
parents:
37345
diff
changeset
|
528 |
(relevance_override as {add, del, only}) |
635425a442e8
show more respect for user-specified facts, even if they could lead to unsound proofs + don't throw away "unsound" theorems in "full_type" mode, since they are then sound
blanchet
parents:
37345
diff
changeset
|
529 |
(ctxt, (chained_ths, _)) goal_cls = |
36185
0ee736f08ed0
optimize relevance filter by doing a Table.fold directly rather than destroying the datastructure each time;
blanchet
parents:
36182
diff
changeset
|
530 |
if (only andalso null add) orelse relevance_threshold > 1.0 then |
0ee736f08ed0
optimize relevance filter by doing a Table.fold directly rather than destroying the datastructure each time;
blanchet
parents:
36182
diff
changeset
|
531 |
[] |
0ee736f08ed0
optimize relevance filter by doing a Table.fold directly rather than destroying the datastructure each time;
blanchet
parents:
36182
diff
changeset
|
532 |
else |
0ee736f08ed0
optimize relevance filter by doing a Table.fold directly rather than destroying the datastructure each time;
blanchet
parents:
36182
diff
changeset
|
533 |
let |
0ee736f08ed0
optimize relevance filter by doing a Table.fold directly rather than destroying the datastructure each time;
blanchet
parents:
36182
diff
changeset
|
534 |
val thy = ProofContext.theory_of ctxt |
37345
4402a2bfa204
make Sledgehammer's "add:" and "del:" syntax work better in the presence of aliases;
blanchet
parents:
37344
diff
changeset
|
535 |
val has_override = not (null add) orelse not (null del) |
37399
34f080a12063
proper polymorphic Skolemization of uncached facts + synchronization of caching and relevance filter
blanchet
parents:
37359
diff
changeset
|
536 |
val is_FO = is_fol_goal thy goal_cls |
37345
4402a2bfa204
make Sledgehammer's "add:" and "del:" syntax work better in the presence of aliases;
blanchet
parents:
37344
diff
changeset
|
537 |
val axioms = |
37399
34f080a12063
proper polymorphic Skolemization of uncached facts + synchronization of caching and relevance filter
blanchet
parents:
37359
diff
changeset
|
538 |
checked_name_thm_pairs (respect_no_atp andalso not only) ctxt |
37344
40f379944c1e
totally bypass Sledgehammer's relevance filter when facts are given using the "(fact1 ... factn)" syntax;
blanchet
parents:
37171
diff
changeset
|
539 |
(if only then map (name_thms_pair_from_ref ctxt chained_ths) add |
37345
4402a2bfa204
make Sledgehammer's "add:" and "del:" syntax work better in the presence of aliases;
blanchet
parents:
37344
diff
changeset
|
540 |
else all_name_thms_pairs respect_no_atp ctxt chained_ths) |
4402a2bfa204
make Sledgehammer's "add:" and "del:" syntax work better in the presence of aliases;
blanchet
parents:
37344
diff
changeset
|
541 |
|> cnf_rules_pairs thy |
4402a2bfa204
make Sledgehammer's "add:" and "del:" syntax work better in the presence of aliases;
blanchet
parents:
37344
diff
changeset
|
542 |
|> not has_override ? make_unique |
37399
34f080a12063
proper polymorphic Skolemization of uncached facts + synchronization of caching and relevance filter
blanchet
parents:
37359
diff
changeset
|
543 |
|> not only ? restrict_to_logic thy is_FO |
37501
b5440c78ed3f
leverage new data structure for handling "add:" and "del:"
blanchet
parents:
37500
diff
changeset
|
544 |
|> (if only then |
b5440c78ed3f
leverage new data structure for handling "add:" and "del:"
blanchet
parents:
37500
diff
changeset
|
545 |
I |
b5440c78ed3f
leverage new data structure for handling "add:" and "del:"
blanchet
parents:
37500
diff
changeset
|
546 |
else |
b5440c78ed3f
leverage new data structure for handling "add:" and "del:"
blanchet
parents:
37500
diff
changeset
|
547 |
remove_dangerous_clauses full_types |
b5440c78ed3f
leverage new data structure for handling "add:" and "del:"
blanchet
parents:
37500
diff
changeset
|
548 |
(maps (ProofContext.get_fact ctxt) add)) |
36185
0ee736f08ed0
optimize relevance filter by doing a Table.fold directly rather than destroying the datastructure each time;
blanchet
parents:
36182
diff
changeset
|
549 |
in |
36922 | 550 |
relevance_filter ctxt relevance_threshold relevance_convergence |
551 |
defs_relevant max_new theory_relevant relevance_override |
|
37345
4402a2bfa204
make Sledgehammer's "add:" and "del:" syntax work better in the presence of aliases;
blanchet
parents:
37344
diff
changeset
|
552 |
thy axioms (map prop_of goal_cls) |
4402a2bfa204
make Sledgehammer's "add:" and "del:" syntax work better in the presence of aliases;
blanchet
parents:
37344
diff
changeset
|
553 |
|> has_override ? make_unique |
36185
0ee736f08ed0
optimize relevance filter by doing a Table.fold directly rather than destroying the datastructure each time;
blanchet
parents:
36182
diff
changeset
|
554 |
end |
30536
07b4f050e4df
split relevance-filter and writing of problem-files;
immler@in.tum.de
parents:
30364
diff
changeset
|
555 |
|
31752
19a5f1c8a844
use results of relevance-filter to determine additional clauses;
immler@in.tum.de
parents:
31749
diff
changeset
|
556 |
(* prepare for passing to writer, |
19a5f1c8a844
use results of relevance-filter to determine additional clauses;
immler@in.tum.de
parents:
31749
diff
changeset
|
557 |
create additional clauses based on the information from extra_cls *) |
37498
b426cbdb5a23
removed Sledgehammer's support for the DFG syntax;
blanchet
parents:
37479
diff
changeset
|
558 |
fun prepare_clauses full_types goal_cls axcls extra_cls thy = |
31409
d8537ba165b5
split preparing clauses and writing problemfile;
immler@in.tum.de
parents:
30536
diff
changeset
|
559 |
let |
37399
34f080a12063
proper polymorphic Skolemization of uncached facts + synchronization of caching and relevance filter
blanchet
parents:
37359
diff
changeset
|
560 |
val is_FO = is_fol_goal thy goal_cls |
36061 | 561 |
val ccls = subtract_cls extra_cls goal_cls |
35865 | 562 |
val _ = app (fn th => trace_msg (fn _ => Display.string_of_thm_global thy th)) ccls |
30536
07b4f050e4df
split relevance-filter and writing of problem-files;
immler@in.tum.de
parents:
30364
diff
changeset
|
563 |
val ccltms = map prop_of ccls |
31752
19a5f1c8a844
use results of relevance-filter to determine additional clauses;
immler@in.tum.de
parents:
31749
diff
changeset
|
564 |
and axtms = map (prop_of o #1) extra_cls |
30536
07b4f050e4df
split relevance-filter and writing of problem-files;
immler@in.tum.de
parents:
30364
diff
changeset
|
565 |
val subs = tfree_classes_of_terms ccltms |
07b4f050e4df
split relevance-filter and writing of problem-files;
immler@in.tum.de
parents:
30364
diff
changeset
|
566 |
and supers = tvar_classes_of_terms axtms |
35865 | 567 |
and tycons = type_consts_of_terms thy (ccltms @ axtms) |
30536
07b4f050e4df
split relevance-filter and writing of problem-files;
immler@in.tum.de
parents:
30364
diff
changeset
|
568 |
(*TFrees in conjecture clauses; TVars in axiom clauses*) |
37498
b426cbdb5a23
removed Sledgehammer's support for the DFG syntax;
blanchet
parents:
37479
diff
changeset
|
569 |
val conjectures = make_conjecture_clauses thy ccls |
b426cbdb5a23
removed Sledgehammer's support for the DFG syntax;
blanchet
parents:
37479
diff
changeset
|
570 |
val (_, extra_clauses) = ListPair.unzip (make_axiom_clauses thy extra_cls) |
b426cbdb5a23
removed Sledgehammer's support for the DFG syntax;
blanchet
parents:
37479
diff
changeset
|
571 |
val (clnames, axiom_clauses) = ListPair.unzip (make_axiom_clauses thy axcls) |
37479
f6b1ee5b420b
try to improve Sledgehammer/Metis's behavior in full_types mode, e.g. by handing True, False, and If better
blanchet
parents:
37410
diff
changeset
|
572 |
val helper_clauses = |
37498
b426cbdb5a23
removed Sledgehammer's support for the DFG syntax;
blanchet
parents:
37479
diff
changeset
|
573 |
get_helper_clauses thy is_FO full_types conjectures extra_cls |
b426cbdb5a23
removed Sledgehammer's support for the DFG syntax;
blanchet
parents:
37479
diff
changeset
|
574 |
val (supers', arity_clauses) = make_arity_clauses thy tycons supers |
35865 | 575 |
val classrel_clauses = make_classrel_clauses thy subs supers' |
30536
07b4f050e4df
split relevance-filter and writing of problem-files;
immler@in.tum.de
parents:
30364
diff
changeset
|
576 |
in |
31752
19a5f1c8a844
use results of relevance-filter to determine additional clauses;
immler@in.tum.de
parents:
31749
diff
changeset
|
577 |
(Vector.fromList clnames, |
31865
5e97c4abd18e
fixed: count constants with supplementary lemmas
immler@in.tum.de
parents:
31837
diff
changeset
|
578 |
(conjectures, axiom_clauses, extra_clauses, helper_clauses, classrel_clauses, arity_clauses)) |
31409
d8537ba165b5
split preparing clauses and writing problemfile;
immler@in.tum.de
parents:
30536
diff
changeset
|
579 |
end |
15644 | 580 |
|
15347 | 581 |
end; |