author | blanchet |
Thu, 17 Oct 2013 23:41:00 +0200 | |
changeset 54142 | 5f3c1b445253 |
parent 54124 | d3c0cf737b55 |
child 54143 | 18def1c73c79 |
permissions | -rw-r--r-- |
48380 | 1 |
(* Title: HOL/Tools/Sledgehammer/sledgehammer_mepo.ML |
38027 | 2 |
Author: Jia Meng, Cambridge University Computer Laboratory and 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 |
39958 | 4 |
|
48380 | 5 |
Sledgehammer's iterative relevance filter (MePo = Meng-Paulson). |
33309 | 6 |
*) |
15452 | 7 |
|
48381 | 8 |
signature SLEDGEHAMMER_MEPO = |
16802
6eeee59dac4c
use Toplevel.print_state_hook instead of adhoc Proof.atp_hook;
wenzelm
parents:
16767
diff
changeset
|
9 |
sig |
46340 | 10 |
type stature = ATP_Problem_Generate.stature |
51004
5f2788c38127
distinguish raw and non-raw facts, using raw for 10 000s of facts and non-raw after selection of some hundreds
blanchet
parents:
50985
diff
changeset
|
11 |
type raw_fact = Sledgehammer_Fact.raw_fact |
48296
e7f01b7e244e
gracefully handle the case of empty theories when going up the accessibility chain
blanchet
parents:
48293
diff
changeset
|
12 |
type fact = Sledgehammer_Fact.fact |
48288
255c6e1fd505
rationalize relevance filter, slowing moving code from Iter to MaSh
blanchet
parents:
48250
diff
changeset
|
13 |
type params = Sledgehammer_Provers.params |
54095 | 14 |
|
15 |
type relevance_fudge = |
|
16 |
{local_const_multiplier : real, |
|
17 |
worse_irrel_freq : real, |
|
18 |
higher_order_irrel_weight : real, |
|
19 |
abs_rel_weight : real, |
|
20 |
abs_irrel_weight : real, |
|
21 |
theory_const_rel_weight : real, |
|
22 |
theory_const_irrel_weight : real, |
|
23 |
chained_const_irrel_weight : real, |
|
24 |
intro_bonus : real, |
|
25 |
elim_bonus : real, |
|
26 |
simp_bonus : real, |
|
27 |
local_bonus : real, |
|
28 |
assum_bonus : real, |
|
29 |
chained_bonus : real, |
|
30 |
max_imperfect : real, |
|
31 |
max_imperfect_exp : real, |
|
32 |
threshold_divisor : real, |
|
33 |
ridiculous_threshold : real} |
|
40070
bdb890782d4a
replaced references with proper record that's threaded through
blanchet
parents:
39958
diff
changeset
|
34 |
|
42646
4781fcd53572
replaced some Unsynchronized.refs with Config.Ts
blanchet
parents:
42641
diff
changeset
|
35 |
val trace : bool Config.T |
48219 | 36 |
val pseudo_abs_name : string |
54095 | 37 |
val default_relevance_fudge : relevance_fudge |
48406 | 38 |
val mepo_suggested_facts : |
54095 | 39 |
Proof.context -> params -> int -> relevance_fudge option -> term list -> term -> |
40 |
raw_fact list -> fact list |
|
15347 | 41 |
end; |
42 |
||
48381 | 43 |
structure Sledgehammer_MePo : SLEDGEHAMMER_MEPO = |
15347 | 44 |
struct |
45 |
||
46320 | 46 |
open ATP_Problem_Generate |
50608 | 47 |
open Sledgehammer_Util |
48296
e7f01b7e244e
gracefully handle the case of empty theories when going up the accessibility chain
blanchet
parents:
48293
diff
changeset
|
48 |
open Sledgehammer_Fact |
48288
255c6e1fd505
rationalize relevance filter, slowing moving code from Iter to MaSh
blanchet
parents:
48250
diff
changeset
|
49 |
open Sledgehammer_Provers |
38652
e063be321438
perform eta-expansion of quantifier bodies in Sledgehammer translation when needed + transform elim rules later;
blanchet
parents:
38644
diff
changeset
|
50 |
|
42646
4781fcd53572
replaced some Unsynchronized.refs with Config.Ts
blanchet
parents:
42641
diff
changeset
|
51 |
val trace = |
53548 | 52 |
Attrib.setup_config_bool @{binding sledgehammer_mepo_trace} (K false) |
42646
4781fcd53572
replaced some Unsynchronized.refs with Config.Ts
blanchet
parents:
42641
diff
changeset
|
53 |
fun trace_msg ctxt msg = if Config.get ctxt trace then tracing (msg ()) else () |
35826 | 54 |
|
37616
c8d2d84d6011
always perform relevance filtering on original formulas
blanchet
parents:
37580
diff
changeset
|
55 |
val sledgehammer_prefix = "Sledgehammer" ^ Long_Name.separator |
48219 | 56 |
val pseudo_abs_name = sledgehammer_prefix ^ "abs" |
38992
542474156c66
introduce fudge factors to deal with "theory const"
blanchet
parents:
38988
diff
changeset
|
57 |
val theory_const_suffix = Long_Name.separator ^ " 1" |
37616
c8d2d84d6011
always perform relevance filtering on original formulas
blanchet
parents:
37580
diff
changeset
|
58 |
|
54095 | 59 |
type relevance_fudge = |
60 |
{local_const_multiplier : real, |
|
61 |
worse_irrel_freq : real, |
|
62 |
higher_order_irrel_weight : real, |
|
63 |
abs_rel_weight : real, |
|
64 |
abs_irrel_weight : real, |
|
65 |
theory_const_rel_weight : real, |
|
66 |
theory_const_irrel_weight : real, |
|
67 |
chained_const_irrel_weight : real, |
|
68 |
intro_bonus : real, |
|
69 |
elim_bonus : real, |
|
70 |
simp_bonus : real, |
|
71 |
local_bonus : real, |
|
72 |
assum_bonus : real, |
|
73 |
chained_bonus : real, |
|
74 |
max_imperfect : real, |
|
75 |
max_imperfect_exp : real, |
|
76 |
threshold_divisor : real, |
|
77 |
ridiculous_threshold : real} |
|
78 |
||
79 |
(* FUDGE *) |
|
80 |
val default_relevance_fudge = |
|
81 |
{local_const_multiplier = 1.5, |
|
82 |
worse_irrel_freq = 100.0, |
|
83 |
higher_order_irrel_weight = 1.05, |
|
84 |
abs_rel_weight = 0.5, |
|
85 |
abs_irrel_weight = 2.0, |
|
86 |
theory_const_rel_weight = 0.5, |
|
87 |
theory_const_irrel_weight = 0.25, |
|
88 |
chained_const_irrel_weight = 0.25, |
|
89 |
intro_bonus = 0.15, |
|
90 |
elim_bonus = 0.15, |
|
91 |
simp_bonus = 0.15, |
|
92 |
local_bonus = 0.55, |
|
93 |
assum_bonus = 1.05, |
|
94 |
chained_bonus = 1.5, |
|
95 |
max_imperfect = 11.5, |
|
96 |
max_imperfect_exp = 1.0, |
|
97 |
threshold_divisor = 2.0, |
|
98 |
ridiculous_threshold = 0.1} |
|
99 |
||
46073
b2594cc862d7
removed special handling for set constants in relevance filter
blanchet
parents:
45982
diff
changeset
|
100 |
fun order_of_type (Type (@{type_name fun}, [T1, T2])) = |
38939 | 101 |
Int.max (order_of_type T1 + 1, order_of_type T2) |
102 |
| order_of_type (Type (_, Ts)) = fold (Integer.max o order_of_type) Ts 0 |
|
103 |
| order_of_type _ = 0 |
|
104 |
||
38823
828e68441a2f
renaming + treat "TFree" better in "pattern_for_type"
blanchet
parents:
38822
diff
changeset
|
105 |
(* An abstraction of Isabelle types and first-order terms *) |
828e68441a2f
renaming + treat "TFree" better in "pattern_for_type"
blanchet
parents:
38822
diff
changeset
|
106 |
datatype pattern = PVar | PApp of string * pattern list |
54087
957115f3dae4
use plain types instead of dedicated type pattern
blanchet
parents:
54086
diff
changeset
|
107 |
datatype ptype = PType of int * typ list |
38744
2b6333f78a9e
make relevance filter work in term of a "max_relevant" option + use Vampire SOS;
blanchet
parents:
38743
diff
changeset
|
108 |
|
54087
957115f3dae4
use plain types instead of dedicated type pattern
blanchet
parents:
54086
diff
changeset
|
109 |
fun string_of_patternT (TVar _) = "_" |
957115f3dae4
use plain types instead of dedicated type pattern
blanchet
parents:
54086
diff
changeset
|
110 |
| string_of_patternT (Type (s, ps)) = |
54086 | 111 |
if null ps then s else s ^ string_of_patternsT ps |
54087
957115f3dae4
use plain types instead of dedicated type pattern
blanchet
parents:
54086
diff
changeset
|
112 |
| string_of_patternT (TFree (s, _)) = s |
54086 | 113 |
and string_of_patternsT ps = "(" ^ commas (map string_of_patternT ps) ^ ")" |
114 |
fun string_of_ptype (PType (_, ps)) = string_of_patternsT ps |
|
24287 | 115 |
|
116 |
(*Is the second type an instance of the first one?*) |
|
54087
957115f3dae4
use plain types instead of dedicated type pattern
blanchet
parents:
54086
diff
changeset
|
117 |
fun match_patternT (TVar _, _) = true |
957115f3dae4
use plain types instead of dedicated type pattern
blanchet
parents:
54086
diff
changeset
|
118 |
| match_patternT (Type (s, ps), Type (t, qs)) = |
54086 | 119 |
s = t andalso match_patternsT (ps, qs) |
54087
957115f3dae4
use plain types instead of dedicated type pattern
blanchet
parents:
54086
diff
changeset
|
120 |
| match_patternT (TFree (s, _), TFree (t, _)) = s = t |
957115f3dae4
use plain types instead of dedicated type pattern
blanchet
parents:
54086
diff
changeset
|
121 |
| match_patternT (_, _) = false |
54086 | 122 |
and match_patternsT (_, []) = true |
123 |
| match_patternsT ([], _) = false |
|
124 |
| match_patternsT (p :: ps, q :: qs) = |
|
125 |
match_patternT (p, q) andalso match_patternsT (ps, qs) |
|
126 |
fun match_ptype (PType (_, ps), PType (_, qs)) = match_patternsT (ps, qs) |
|
24287 | 127 |
|
38823
828e68441a2f
renaming + treat "TFree" better in "pattern_for_type"
blanchet
parents:
38822
diff
changeset
|
128 |
(* Is there a unifiable constant? *) |
38827
cf01645cbbce
extended relevance filter with first-order term matching
blanchet
parents:
38825
diff
changeset
|
129 |
fun pconst_mem f consts (s, ps) = |
38939 | 130 |
exists (curry (match_ptype o f) ps) |
38827
cf01645cbbce
extended relevance filter with first-order term matching
blanchet
parents:
38825
diff
changeset
|
131 |
(map snd (filter (curry (op =) s o fst) consts)) |
cf01645cbbce
extended relevance filter with first-order term matching
blanchet
parents:
38825
diff
changeset
|
132 |
fun pconst_hyper_mem f const_tab (s, ps) = |
38939 | 133 |
exists (curry (match_ptype o f) ps) (these (Symtab.lookup const_tab s)) |
37505
d9af5c01dc4a
added code to optionally perform fact filtering on the original (non-CNF) formulas
blanchet
parents:
37504
diff
changeset
|
134 |
|
38744
2b6333f78a9e
make relevance filter work in term of a "max_relevant" option + use Vampire SOS;
blanchet
parents:
38743
diff
changeset
|
135 |
(* Pairs a constant with the list of its type instantiations. *) |
41204
bd57cf5944cb
get rid of experimental feature of term patterns in relevance filter -- doesn't work well unless we take into consideration the equality theory entailed by the relevant facts
blanchet
parents:
41202
diff
changeset
|
136 |
fun ptype thy const x = |
54087
957115f3dae4
use plain types instead of dedicated type pattern
blanchet
parents:
54086
diff
changeset
|
137 |
(if const then these (try (Sign.const_typargs thy) x) else []) |
41204
bd57cf5944cb
get rid of experimental feature of term patterns in relevance filter -- doesn't work well unless we take into consideration the equality theory entailed by the relevant facts
blanchet
parents:
41202
diff
changeset
|
138 |
fun rich_ptype thy const (s, T) = |
bd57cf5944cb
get rid of experimental feature of term patterns in relevance filter -- doesn't work well unless we take into consideration the equality theory entailed by the relevant facts
blanchet
parents:
41202
diff
changeset
|
139 |
PType (order_of_type T, ptype thy const (s, T)) |
bd57cf5944cb
get rid of experimental feature of term patterns in relevance filter -- doesn't work well unless we take into consideration the equality theory entailed by the relevant facts
blanchet
parents:
41202
diff
changeset
|
140 |
fun rich_pconst thy const (s, T) = (s, rich_ptype thy const (s, T)) |
24287 | 141 |
|
51998
f732a674db1b
renamed Sledgehammer functions with 'for' in their names to 'of'
blanchet
parents:
51026
diff
changeset
|
142 |
fun string_of_hyper_pconst (s, ps) = |
f732a674db1b
renamed Sledgehammer functions with 'for' in their names to 'of'
blanchet
parents:
51026
diff
changeset
|
143 |
s ^ "{" ^ commas (map string_of_ptype ps) ^ "}" |
24287 | 144 |
|
54087
957115f3dae4
use plain types instead of dedicated type pattern
blanchet
parents:
54086
diff
changeset
|
145 |
fun patternT_eq (TVar _, TVar _) = true |
957115f3dae4
use plain types instead of dedicated type pattern
blanchet
parents:
54086
diff
changeset
|
146 |
| patternT_eq (Type (s, Ts), Type (t, Us)) = s = t andalso patternsT_eq (Ts, Us) |
957115f3dae4
use plain types instead of dedicated type pattern
blanchet
parents:
54086
diff
changeset
|
147 |
| patternT_eq (TFree (s, _), TFree (t, _)) = (s = t) |
957115f3dae4
use plain types instead of dedicated type pattern
blanchet
parents:
54086
diff
changeset
|
148 |
| patternT_eq _ = false |
957115f3dae4
use plain types instead of dedicated type pattern
blanchet
parents:
54086
diff
changeset
|
149 |
and patternsT_eq ([], []) = true |
957115f3dae4
use plain types instead of dedicated type pattern
blanchet
parents:
54086
diff
changeset
|
150 |
| patternsT_eq ([], _) = false |
957115f3dae4
use plain types instead of dedicated type pattern
blanchet
parents:
54086
diff
changeset
|
151 |
| patternsT_eq (_, []) = false |
957115f3dae4
use plain types instead of dedicated type pattern
blanchet
parents:
54086
diff
changeset
|
152 |
| patternsT_eq (T :: Ts, U :: Us) = patternT_eq (T, U) andalso patternsT_eq (Ts, Us) |
957115f3dae4
use plain types instead of dedicated type pattern
blanchet
parents:
54086
diff
changeset
|
153 |
fun ptype_eq (PType (m, Ts), PType (n, Us)) = m = n andalso patternsT_eq (Ts, Us) |
957115f3dae4
use plain types instead of dedicated type pattern
blanchet
parents:
54086
diff
changeset
|
154 |
|
957115f3dae4
use plain types instead of dedicated type pattern
blanchet
parents:
54086
diff
changeset
|
155 |
(* Add a pconstant to the table, but a [] entry means a standard connective, |
957115f3dae4
use plain types instead of dedicated type pattern
blanchet
parents:
54086
diff
changeset
|
156 |
which we ignore. *) |
957115f3dae4
use plain types instead of dedicated type pattern
blanchet
parents:
54086
diff
changeset
|
157 |
fun add_pconst_to_table (s, p) = Symtab.map_default (s, [p]) (insert ptype_eq p) |
38819
71c9f61516cd
if the goal contains no constants or frees, fall back on chained facts, then on local facts, etc., instead of generating a trivial ATP problem
blanchet
parents:
38818
diff
changeset
|
158 |
|
47933
4e8e0245e8be
treat sets specially in relevance filter, as they used to, to avoid cluttering the problem with facts about Set.member and Collect
blanchet
parents:
47904
diff
changeset
|
159 |
(* Set constants tend to pull in too many irrelevant facts. We limit the damage |
4e8e0245e8be
treat sets specially in relevance filter, as they used to, to avoid cluttering the problem with facts about Set.member and Collect
blanchet
parents:
47904
diff
changeset
|
160 |
by treating them more or less as if they were built-in but add their |
4e8e0245e8be
treat sets specially in relevance filter, as they used to, to avoid cluttering the problem with facts about Set.member and Collect
blanchet
parents:
47904
diff
changeset
|
161 |
axiomatization at the end. *) |
4e8e0245e8be
treat sets specially in relevance filter, as they used to, to avoid cluttering the problem with facts about Set.member and Collect
blanchet
parents:
47904
diff
changeset
|
162 |
val set_consts = [@{const_name Collect}, @{const_name Set.member}] |
47939
9ff976a6c2cb
added "Collect_cong" to cover extensionality of "Collect" (special cases of "ext" pass through the relevant filter)
blanchet
parents:
47933
diff
changeset
|
163 |
val set_thms = @{thms Collect_mem_eq mem_Collect_eq Collect_cong} |
47933
4e8e0245e8be
treat sets specially in relevance filter, as they used to, to avoid cluttering the problem with facts about Set.member and Collect
blanchet
parents:
47904
diff
changeset
|
164 |
|
54089
b13f6731f873
use same relevance filter for ATP and SMT solvers -- attempting to filter out certain ground instances of polymorphic symbols like + and 0 has unexpected side-effects that lead to incompletenesses (relevant facts not being selected)
blanchet
parents:
54088
diff
changeset
|
165 |
fun add_pconsts_in_term thy = |
37505
d9af5c01dc4a
added code to optionally perform fact filtering on the original (non-CNF) formulas
blanchet
parents:
37504
diff
changeset
|
166 |
let |
54089
b13f6731f873
use same relevance filter for ATP and SMT solvers -- attempting to filter out certain ground instances of polymorphic symbols like + and 0 has unexpected side-effects that lead to incompletenesses (relevant facts not being selected)
blanchet
parents:
54088
diff
changeset
|
167 |
fun do_const const (x as (s, _)) ts = |
b13f6731f873
use same relevance filter for ATP and SMT solvers -- attempting to filter out certain ground instances of polymorphic symbols like + and 0 has unexpected side-effects that lead to incompletenesses (relevant facts not being selected)
blanchet
parents:
54088
diff
changeset
|
168 |
if member (op =) set_consts s then |
b13f6731f873
use same relevance filter for ATP and SMT solvers -- attempting to filter out certain ground instances of polymorphic symbols like + and 0 has unexpected side-effects that lead to incompletenesses (relevant facts not being selected)
blanchet
parents:
54088
diff
changeset
|
169 |
fold (do_term false) ts |
b13f6731f873
use same relevance filter for ATP and SMT solvers -- attempting to filter out certain ground instances of polymorphic symbols like + and 0 has unexpected side-effects that lead to incompletenesses (relevant facts not being selected)
blanchet
parents:
54088
diff
changeset
|
170 |
else |
b13f6731f873
use same relevance filter for ATP and SMT solvers -- attempting to filter out certain ground instances of polymorphic symbols like + and 0 has unexpected side-effects that lead to incompletenesses (relevant facts not being selected)
blanchet
parents:
54088
diff
changeset
|
171 |
(not (is_irrelevant_const s) ? add_pconst_to_table (rich_pconst thy const x)) |
b13f6731f873
use same relevance filter for ATP and SMT solvers -- attempting to filter out certain ground instances of polymorphic symbols like + and 0 has unexpected side-effects that lead to incompletenesses (relevant facts not being selected)
blanchet
parents:
54088
diff
changeset
|
172 |
#> fold (do_term false) ts |
42741
546b0bda3cb8
do not pollute relevance filter facts with too many facts about the boring set constants Collect and mem_def, which we might anyway unfold depending on Meson's settings
blanchet
parents:
42738
diff
changeset
|
173 |
and do_term ext_arg t = |
38827
cf01645cbbce
extended relevance filter with first-order term matching
blanchet
parents:
38825
diff
changeset
|
174 |
case strip_comb t of |
54089
b13f6731f873
use same relevance filter for ATP and SMT solvers -- attempting to filter out certain ground instances of polymorphic symbols like + and 0 has unexpected side-effects that lead to incompletenesses (relevant facts not being selected)
blanchet
parents:
54088
diff
changeset
|
175 |
(Const x, ts) => do_const true x ts |
b13f6731f873
use same relevance filter for ATP and SMT solvers -- attempting to filter out certain ground instances of polymorphic symbols like + and 0 has unexpected side-effects that lead to incompletenesses (relevant facts not being selected)
blanchet
parents:
54088
diff
changeset
|
176 |
| (Free x, ts) => do_const false x ts |
38939 | 177 |
| (Abs (_, T, t'), ts) => |
42741
546b0bda3cb8
do not pollute relevance filter facts with too many facts about the boring set constants Collect and mem_def, which we might anyway unfold depending on Meson's settings
blanchet
parents:
42738
diff
changeset
|
178 |
((null ts andalso not ext_arg) |
546b0bda3cb8
do not pollute relevance filter facts with too many facts about the boring set constants Collect and mem_def, which we might anyway unfold depending on Meson's settings
blanchet
parents:
42738
diff
changeset
|
179 |
(* Since lambdas on the right-hand side of equalities are usually |
47953
a2c3706c4cb1
added "ext_cong_neq" lemma (not used yet); tuning
blanchet
parents:
47939
diff
changeset
|
180 |
extensionalized later by "abs_extensionalize_term", we don't |
a2c3706c4cb1
added "ext_cong_neq" lemma (not used yet); tuning
blanchet
parents:
47939
diff
changeset
|
181 |
penalize them here. *) |
53550
ffe2ce7910c1
get rid of another complication in relevance filter
blanchet
parents:
53548
diff
changeset
|
182 |
? add_pconst_to_table (pseudo_abs_name, |
ffe2ce7910c1
get rid of another complication in relevance filter
blanchet
parents:
53548
diff
changeset
|
183 |
PType (order_of_type T + 1, []))) |
42735
1d375de437e9
fine-tuned the relevance filter, so that equations of the form "c = (%x. _)" and constants occurring in chained facts are not unduely penalized
blanchet
parents:
42732
diff
changeset
|
184 |
#> fold (do_term false) (t' :: ts) |
1d375de437e9
fine-tuned the relevance filter, so that equations of the form "c = (%x. _)" and constants occurring in chained facts are not unduely penalized
blanchet
parents:
42732
diff
changeset
|
185 |
| (_, ts) => fold (do_term false) ts |
42741
546b0bda3cb8
do not pollute relevance filter facts with too many facts about the boring set constants Collect and mem_def, which we might anyway unfold depending on Meson's settings
blanchet
parents:
42738
diff
changeset
|
186 |
and do_term_or_formula ext_arg T = |
53551 | 187 |
if T = HOLogic.boolT then do_formula else do_term ext_arg |
188 |
and do_formula t = |
|
37537 | 189 |
case t of |
54089
b13f6731f873
use same relevance filter for ATP and SMT solvers -- attempting to filter out certain ground instances of polymorphic symbols like + and 0 has unexpected side-effects that lead to incompletenesses (relevant facts not being selected)
blanchet
parents:
54088
diff
changeset
|
190 |
Const (@{const_name all}, _) $ Abs (_, _, t') => do_formula t' |
53551 | 191 |
| @{const "==>"} $ t1 $ t2 => do_formula t1 #> do_formula t2 |
37537 | 192 |
| Const (@{const_name "=="}, Type (_, [T, _])) $ t1 $ t2 => |
42741
546b0bda3cb8
do not pollute relevance filter facts with too many facts about the boring set constants Collect and mem_def, which we might anyway unfold depending on Meson's settings
blanchet
parents:
42738
diff
changeset
|
193 |
do_term_or_formula false T t1 #> do_term_or_formula true T t2 |
53551 | 194 |
| @{const Trueprop} $ t1 => do_formula t1 |
41140
9c68004b8c9d
added Sledgehammer support for higher-order propositional reasoning
blanchet
parents:
41138
diff
changeset
|
195 |
| @{const False} => I |
9c68004b8c9d
added Sledgehammer support for higher-order propositional reasoning
blanchet
parents:
41138
diff
changeset
|
196 |
| @{const True} => I |
53551 | 197 |
| @{const Not} $ t1 => do_formula t1 |
54089
b13f6731f873
use same relevance filter for ATP and SMT solvers -- attempting to filter out certain ground instances of polymorphic symbols like + and 0 has unexpected side-effects that lead to incompletenesses (relevant facts not being selected)
blanchet
parents:
54088
diff
changeset
|
198 |
| Const (@{const_name All}, _) $ Abs (_, _, t') => do_formula t' |
b13f6731f873
use same relevance filter for ATP and SMT solvers -- attempting to filter out certain ground instances of polymorphic symbols like + and 0 has unexpected side-effects that lead to incompletenesses (relevant facts not being selected)
blanchet
parents:
54088
diff
changeset
|
199 |
| Const (@{const_name Ex}, _) $ Abs (_, _, t') => do_formula t' |
53551 | 200 |
| @{const HOL.conj} $ t1 $ t2 => do_formula t1 #> do_formula t2 |
201 |
| @{const HOL.disj} $ t1 $ t2 => do_formula t1 #> do_formula t2 |
|
202 |
| @{const HOL.implies} $ t1 $ t2 => do_formula t1 #> do_formula t2 |
|
38864
4abe644fcea5
formerly unnamed infix equality now named HOL.eq
haftmann
parents:
38829
diff
changeset
|
203 |
| Const (@{const_name HOL.eq}, Type (_, [T, _])) $ t1 $ t2 => |
42741
546b0bda3cb8
do not pollute relevance filter facts with too many facts about the boring set constants Collect and mem_def, which we might anyway unfold depending on Meson's settings
blanchet
parents:
42738
diff
changeset
|
204 |
do_term_or_formula false T t1 #> do_term_or_formula true T t2 |
38587
1317657d6aa9
fix the relevance filter so that it ignores If, Ex1, Ball, Bex
blanchet
parents:
38395
diff
changeset
|
205 |
| Const (@{const_name If}, Type (_, [_, Type (_, [T, _])])) |
1317657d6aa9
fix the relevance filter so that it ignores If, Ex1, Ball, Bex
blanchet
parents:
38395
diff
changeset
|
206 |
$ t1 $ t2 $ t3 => |
53551 | 207 |
do_formula t1 #> fold (do_term_or_formula false T) [t2, t3] |
54089
b13f6731f873
use same relevance filter for ATP and SMT solvers -- attempting to filter out certain ground instances of polymorphic symbols like + and 0 has unexpected side-effects that lead to incompletenesses (relevant facts not being selected)
blanchet
parents:
54088
diff
changeset
|
208 |
| Const (@{const_name Ex1}, _) $ Abs (_, _, t') => do_formula t' |
b13f6731f873
use same relevance filter for ATP and SMT solvers -- attempting to filter out certain ground instances of polymorphic symbols like + and 0 has unexpected side-effects that lead to incompletenesses (relevant facts not being selected)
blanchet
parents:
54088
diff
changeset
|
209 |
| Const (@{const_name Ball}, _) $ t1 $ Abs (_, _, t') => |
53551 | 210 |
do_formula (t1 $ Bound ~1) #> do_formula t' |
54089
b13f6731f873
use same relevance filter for ATP and SMT solvers -- attempting to filter out certain ground instances of polymorphic symbols like + and 0 has unexpected side-effects that lead to incompletenesses (relevant facts not being selected)
blanchet
parents:
54088
diff
changeset
|
211 |
| Const (@{const_name Bex}, _) $ t1 $ Abs (_, _, t') => |
53551 | 212 |
do_formula (t1 $ Bound ~1) #> do_formula t' |
37537 | 213 |
| (t0 as Const (_, @{typ bool})) $ t1 => |
53551 | 214 |
do_term false t0 #> do_formula t1 (* theory constant *) |
42735
1d375de437e9
fine-tuned the relevance filter, so that equations of the form "c = (%x. _)" and constants occurring in chained facts are not unduely penalized
blanchet
parents:
42732
diff
changeset
|
215 |
| _ => do_term false t |
53551 | 216 |
in do_formula end |
24287 | 217 |
|
54089
b13f6731f873
use same relevance filter for ATP and SMT solvers -- attempting to filter out certain ground instances of polymorphic symbols like + and 0 has unexpected side-effects that lead to incompletenesses (relevant facts not being selected)
blanchet
parents:
54088
diff
changeset
|
218 |
fun pconsts_in_fact thy t = |
48227 | 219 |
Symtab.fold (fn (s, pss) => fold (cons o pair s) pss) |
54089
b13f6731f873
use same relevance filter for ATP and SMT solvers -- attempting to filter out certain ground instances of polymorphic symbols like + and 0 has unexpected side-effects that lead to incompletenesses (relevant facts not being selected)
blanchet
parents:
54088
diff
changeset
|
220 |
(Symtab.empty |> add_pconsts_in_term thy t) [] |
48227 | 221 |
|
222 |
(* Inserts a dummy "constant" referring to the theory name, so that relevance |
|
223 |
takes the given theory into account. *) |
|
41200
6cc9b6fd7f6f
add the current theory's constant to the goal to make theorems from the current theory more relevant on the first iteration already
blanchet
parents:
41199
diff
changeset
|
224 |
fun theory_constify ({theory_const_rel_weight, theory_const_irrel_weight, ...} |
6cc9b6fd7f6f
add the current theory's constant to the goal to make theorems from the current theory more relevant on the first iteration already
blanchet
parents:
41199
diff
changeset
|
225 |
: relevance_fudge) thy_name t = |
40070
bdb890782d4a
replaced references with proper record that's threaded through
blanchet
parents:
39958
diff
changeset
|
226 |
if exists (curry (op <) 0.0) [theory_const_rel_weight, |
bdb890782d4a
replaced references with proper record that's threaded through
blanchet
parents:
39958
diff
changeset
|
227 |
theory_const_irrel_weight] then |
41200
6cc9b6fd7f6f
add the current theory's constant to the goal to make theorems from the current theory more relevant on the first iteration already
blanchet
parents:
41199
diff
changeset
|
228 |
Const (thy_name ^ theory_const_suffix, @{typ bool}) $ t |
37505
d9af5c01dc4a
added code to optionally perform fact filtering on the original (non-CNF) formulas
blanchet
parents:
37504
diff
changeset
|
229 |
else |
41200
6cc9b6fd7f6f
add the current theory's constant to the goal to make theorems from the current theory more relevant on the first iteration already
blanchet
parents:
41199
diff
changeset
|
230 |
t |
6cc9b6fd7f6f
add the current theory's constant to the goal to make theorems from the current theory more relevant on the first iteration already
blanchet
parents:
41199
diff
changeset
|
231 |
|
6cc9b6fd7f6f
add the current theory's constant to the goal to make theorems from the current theory more relevant on the first iteration already
blanchet
parents:
41199
diff
changeset
|
232 |
fun theory_const_prop_of fudge th = |
6cc9b6fd7f6f
add the current theory's constant to the goal to make theorems from the current theory more relevant on the first iteration already
blanchet
parents:
41199
diff
changeset
|
233 |
theory_constify fudge (Context.theory_name (theory_of_thm th)) (prop_of th) |
37505
d9af5c01dc4a
added code to optionally perform fact filtering on the original (non-CNF) formulas
blanchet
parents:
37504
diff
changeset
|
234 |
|
54089
b13f6731f873
use same relevance filter for ATP and SMT solvers -- attempting to filter out certain ground instances of polymorphic symbols like + and 0 has unexpected side-effects that lead to incompletenesses (relevant facts not being selected)
blanchet
parents:
54088
diff
changeset
|
235 |
fun pair_consts_fact thy fudge fact = |
48227 | 236 |
case fact |> snd |> theory_const_prop_of fudge |
54089
b13f6731f873
use same relevance filter for ATP and SMT solvers -- attempting to filter out certain ground instances of polymorphic symbols like + and 0 has unexpected side-effects that lead to incompletenesses (relevant facts not being selected)
blanchet
parents:
54088
diff
changeset
|
237 |
|> pconsts_in_fact thy of |
48227 | 238 |
[] => NONE |
239 |
| consts => SOME ((fact, consts), NONE) |
|
240 |
||
38743 | 241 |
(* A two-dimensional symbol table counts frequencies of constants. It's keyed |
242 |
first by constant name and second by its list of type instantiations. For the |
|
38823
828e68441a2f
renaming + treat "TFree" better in "pattern_for_type"
blanchet
parents:
38822
diff
changeset
|
243 |
latter, we need a linear ordering on "pattern list". *) |
24287 | 244 |
|
54086 | 245 |
fun patternT_ord p = |
38743 | 246 |
case p of |
54088 | 247 |
(Type (s, ps), Type (t, qs)) => |
248 |
(case fast_string_ord (s, t) of |
|
249 |
EQUAL => dict_ord patternT_ord (ps, qs) |
|
250 |
| ord => ord) |
|
251 |
| (TVar _, TVar _) => EQUAL |
|
54089
b13f6731f873
use same relevance filter for ATP and SMT solvers -- attempting to filter out certain ground instances of polymorphic symbols like + and 0 has unexpected side-effects that lead to incompletenesses (relevant facts not being selected)
blanchet
parents:
54088
diff
changeset
|
252 |
| (TVar _, _) => LESS |
54087
957115f3dae4
use plain types instead of dedicated type pattern
blanchet
parents:
54086
diff
changeset
|
253 |
| (Type _, TVar _) => GREATER |
957115f3dae4
use plain types instead of dedicated type pattern
blanchet
parents:
54086
diff
changeset
|
254 |
| (Type _, TFree _) => LESS |
957115f3dae4
use plain types instead of dedicated type pattern
blanchet
parents:
54086
diff
changeset
|
255 |
| (TFree (s, _), TFree (t, _)) => fast_string_ord (s, t) |
54089
b13f6731f873
use same relevance filter for ATP and SMT solvers -- attempting to filter out certain ground instances of polymorphic symbols like + and 0 has unexpected side-effects that lead to incompletenesses (relevant facts not being selected)
blanchet
parents:
54088
diff
changeset
|
256 |
| (TFree _, _) => GREATER |
54088 | 257 |
fun ptype_ord (PType (m, ps), PType (n, qs)) = |
258 |
(case dict_ord patternT_ord (ps, qs) of |
|
259 |
EQUAL => int_ord (m, n) |
|
260 |
| ord => ord) |
|
24287 | 261 |
|
38939 | 262 |
structure PType_Tab = Table(type key = ptype val ord = ptype_ord) |
24287 | 263 |
|
40204
da97d75e20e6
standardize on "fact" terminology (vs. "axiom" or "theorem") in Sledgehammer -- but keep "Axiom" in the lower-level "ATP_Problem" module
blanchet
parents:
40191
diff
changeset
|
264 |
fun count_fact_consts thy fudge = |
37503
c2dfa26b9da6
cosmetics + prevent consideration of inlined Skolem terms in relevance filter
blanchet
parents:
37502
diff
changeset
|
265 |
let |
38827
cf01645cbbce
extended relevance filter with first-order term matching
blanchet
parents:
38825
diff
changeset
|
266 |
fun do_const const (s, T) ts = |
cf01645cbbce
extended relevance filter with first-order term matching
blanchet
parents:
38825
diff
changeset
|
267 |
(* Two-dimensional table update. Constant maps to types maps to count. *) |
41204
bd57cf5944cb
get rid of experimental feature of term patterns in relevance filter -- doesn't work well unless we take into consideration the equality theory entailed by the relevant facts
blanchet
parents:
41202
diff
changeset
|
268 |
PType_Tab.map_default (rich_ptype thy const (s, T), 0) (Integer.add 1) |
38939 | 269 |
|> Symtab.map_default (s, PType_Tab.empty) |
38827
cf01645cbbce
extended relevance filter with first-order term matching
blanchet
parents:
38825
diff
changeset
|
270 |
#> fold do_term ts |
cf01645cbbce
extended relevance filter with first-order term matching
blanchet
parents:
38825
diff
changeset
|
271 |
and do_term t = |
cf01645cbbce
extended relevance filter with first-order term matching
blanchet
parents:
38825
diff
changeset
|
272 |
case strip_comb t of |
cf01645cbbce
extended relevance filter with first-order term matching
blanchet
parents:
38825
diff
changeset
|
273 |
(Const x, ts) => do_const true x ts |
cf01645cbbce
extended relevance filter with first-order term matching
blanchet
parents:
38825
diff
changeset
|
274 |
| (Free x, ts) => do_const false x ts |
cf01645cbbce
extended relevance filter with first-order term matching
blanchet
parents:
38825
diff
changeset
|
275 |
| (Abs (_, _, t'), ts) => fold do_term (t' :: ts) |
cf01645cbbce
extended relevance filter with first-order term matching
blanchet
parents:
38825
diff
changeset
|
276 |
| (_, ts) => fold do_term ts |
40070
bdb890782d4a
replaced references with proper record that's threaded through
blanchet
parents:
39958
diff
changeset
|
277 |
in do_term o theory_const_prop_of fudge o snd end |
24287 | 278 |
|
39367 | 279 |
fun pow_int _ 0 = 1.0 |
38939 | 280 |
| pow_int x 1 = x |
281 |
| pow_int x n = if n > 0 then x * pow_int x (n - 1) else pow_int x (n + 1) / x |
|
282 |
||
24287 | 283 |
(*The frequency of a constant is the sum of those of all instances of its type.*) |
38824 | 284 |
fun pconst_freq match const_tab (c, ps) = |
38939 | 285 |
PType_Tab.fold (fn (qs, m) => match (ps, qs) ? Integer.add m) |
286 |
(the (Symtab.lookup const_tab c)) 0 |
|
38686 | 287 |
|
24287 | 288 |
|
38085
cc44e887246c
avoid "clause" and "cnf" terminology where it no longer makes sense
blanchet
parents:
38027
diff
changeset
|
289 |
(* A surprising number of theorems contain only a few significant constants. |
cc44e887246c
avoid "clause" and "cnf" terminology where it no longer makes sense
blanchet
parents:
38027
diff
changeset
|
290 |
These include all induction rules, and other general theorems. *) |
37503
c2dfa26b9da6
cosmetics + prevent consideration of inlined Skolem terms in relevance filter
blanchet
parents:
37502
diff
changeset
|
291 |
|
c2dfa26b9da6
cosmetics + prevent consideration of inlined Skolem terms in relevance filter
blanchet
parents:
37502
diff
changeset
|
292 |
(* "log" seems best in practice. A constant function of one ignores the constant |
38938
2b93dbc07778
improve weighting of irrelevant constants, based on Mirabelle experiments
blanchet
parents:
38937
diff
changeset
|
293 |
frequencies. Rare constants give more points if they are relevant than less |
2b93dbc07778
improve weighting of irrelevant constants, based on Mirabelle experiments
blanchet
parents:
38937
diff
changeset
|
294 |
rare ones. *) |
39367 | 295 |
fun rel_weight_for _ freq = 1.0 + 2.0 / Math.ln (Real.fromInt freq + 1.0) |
38938
2b93dbc07778
improve weighting of irrelevant constants, based on Mirabelle experiments
blanchet
parents:
38937
diff
changeset
|
296 |
|
2b93dbc07778
improve weighting of irrelevant constants, based on Mirabelle experiments
blanchet
parents:
38937
diff
changeset
|
297 |
(* Irrelevant constants are treated differently. We associate lower penalties to |
2b93dbc07778
improve weighting of irrelevant constants, based on Mirabelle experiments
blanchet
parents:
38937
diff
changeset
|
298 |
very rare constants and very common ones -- the former because they can't |
2b93dbc07778
improve weighting of irrelevant constants, based on Mirabelle experiments
blanchet
parents:
38937
diff
changeset
|
299 |
lead to the inclusion of too many new facts, and the latter because they are |
2b93dbc07778
improve weighting of irrelevant constants, based on Mirabelle experiments
blanchet
parents:
38937
diff
changeset
|
300 |
so common as to be of little interest. *) |
40070
bdb890782d4a
replaced references with proper record that's threaded through
blanchet
parents:
39958
diff
changeset
|
301 |
fun irrel_weight_for ({worse_irrel_freq, higher_order_irrel_weight, ...} |
bdb890782d4a
replaced references with proper record that's threaded through
blanchet
parents:
39958
diff
changeset
|
302 |
: relevance_fudge) order freq = |
bdb890782d4a
replaced references with proper record that's threaded through
blanchet
parents:
39958
diff
changeset
|
303 |
let val (k, x) = worse_irrel_freq |> `Real.ceil in |
38939 | 304 |
(if freq < k then Math.ln (Real.fromInt (freq + 1)) / Math.ln x |
305 |
else rel_weight_for order freq / rel_weight_for order k) |
|
40070
bdb890782d4a
replaced references with proper record that's threaded through
blanchet
parents:
39958
diff
changeset
|
306 |
* pow_int higher_order_irrel_weight (order - 1) |
38938
2b93dbc07778
improve weighting of irrelevant constants, based on Mirabelle experiments
blanchet
parents:
38937
diff
changeset
|
307 |
end |
37503
c2dfa26b9da6
cosmetics + prevent consideration of inlined Skolem terms in relevance filter
blanchet
parents:
37502
diff
changeset
|
308 |
|
51998
f732a674db1b
renamed Sledgehammer functions with 'for' in their names to 'of'
blanchet
parents:
51026
diff
changeset
|
309 |
fun multiplier_of_const_name local_const_multiplier s = |
41790
56dcd46ddf7a
give more weight to Frees than to Consts in relevance filter
blanchet
parents:
41768
diff
changeset
|
310 |
if String.isSubstring "." s then 1.0 else local_const_multiplier |
38821 | 311 |
|
41790
56dcd46ddf7a
give more weight to Frees than to Consts in relevance filter
blanchet
parents:
41768
diff
changeset
|
312 |
(* Computes a constant's weight, as determined by its frequency. *) |
53551 | 313 |
fun generic_pconst_weight local_const_multiplier abs_weight theory_const_weight |
314 |
chained_const_weight weight_for f const_tab chained_const_tab |
|
315 |
(c as (s, PType (m, _))) = |
|
48219 | 316 |
if s = pseudo_abs_name then |
41790
56dcd46ddf7a
give more weight to Frees than to Consts in relevance filter
blanchet
parents:
41768
diff
changeset
|
317 |
abs_weight |
56dcd46ddf7a
give more weight to Frees than to Consts in relevance filter
blanchet
parents:
41768
diff
changeset
|
318 |
else if String.isSuffix theory_const_suffix s then |
56dcd46ddf7a
give more weight to Frees than to Consts in relevance filter
blanchet
parents:
41768
diff
changeset
|
319 |
theory_const_weight |
56dcd46ddf7a
give more weight to Frees than to Consts in relevance filter
blanchet
parents:
41768
diff
changeset
|
320 |
else |
51998
f732a674db1b
renamed Sledgehammer functions with 'for' in their names to 'of'
blanchet
parents:
51026
diff
changeset
|
321 |
multiplier_of_const_name local_const_multiplier s |
41790
56dcd46ddf7a
give more weight to Frees than to Consts in relevance filter
blanchet
parents:
41768
diff
changeset
|
322 |
* weight_for m (pconst_freq (match_ptype o f) const_tab c) |
42735
1d375de437e9
fine-tuned the relevance filter, so that equations of the form "c = (%x. _)" and constants occurring in chained facts are not unduely penalized
blanchet
parents:
42732
diff
changeset
|
323 |
|> (if chained_const_weight < 1.0 andalso |
1d375de437e9
fine-tuned the relevance filter, so that equations of the form "c = (%x. _)" and constants occurring in chained facts are not unduely penalized
blanchet
parents:
42732
diff
changeset
|
324 |
pconst_hyper_mem I chained_const_tab c then |
1d375de437e9
fine-tuned the relevance filter, so that equations of the form "c = (%x. _)" and constants occurring in chained facts are not unduely penalized
blanchet
parents:
42732
diff
changeset
|
325 |
curry (op *) chained_const_weight |
1d375de437e9
fine-tuned the relevance filter, so that equations of the form "c = (%x. _)" and constants occurring in chained facts are not unduely penalized
blanchet
parents:
42732
diff
changeset
|
326 |
else |
1d375de437e9
fine-tuned the relevance filter, so that equations of the form "c = (%x. _)" and constants occurring in chained facts are not unduely penalized
blanchet
parents:
42732
diff
changeset
|
327 |
I) |
41790
56dcd46ddf7a
give more weight to Frees than to Consts in relevance filter
blanchet
parents:
41768
diff
changeset
|
328 |
|
56dcd46ddf7a
give more weight to Frees than to Consts in relevance filter
blanchet
parents:
41768
diff
changeset
|
329 |
fun rel_pconst_weight ({local_const_multiplier, abs_rel_weight, |
56dcd46ddf7a
give more weight to Frees than to Consts in relevance filter
blanchet
parents:
41768
diff
changeset
|
330 |
theory_const_rel_weight, ...} : relevance_fudge) |
56dcd46ddf7a
give more weight to Frees than to Consts in relevance filter
blanchet
parents:
41768
diff
changeset
|
331 |
const_tab = |
53551 | 332 |
generic_pconst_weight local_const_multiplier abs_rel_weight |
42735
1d375de437e9
fine-tuned the relevance filter, so that equations of the form "c = (%x. _)" and constants occurring in chained facts are not unduely penalized
blanchet
parents:
42732
diff
changeset
|
333 |
theory_const_rel_weight 0.0 rel_weight_for I const_tab |
1d375de437e9
fine-tuned the relevance filter, so that equations of the form "c = (%x. _)" and constants occurring in chained facts are not unduely penalized
blanchet
parents:
42732
diff
changeset
|
334 |
Symtab.empty |
1d375de437e9
fine-tuned the relevance filter, so that equations of the form "c = (%x. _)" and constants occurring in chained facts are not unduely penalized
blanchet
parents:
42732
diff
changeset
|
335 |
|
41790
56dcd46ddf7a
give more weight to Frees than to Consts in relevance filter
blanchet
parents:
41768
diff
changeset
|
336 |
fun irrel_pconst_weight (fudge as {local_const_multiplier, abs_irrel_weight, |
42735
1d375de437e9
fine-tuned the relevance filter, so that equations of the form "c = (%x. _)" and constants occurring in chained facts are not unduely penalized
blanchet
parents:
42732
diff
changeset
|
337 |
theory_const_irrel_weight, |
1d375de437e9
fine-tuned the relevance filter, so that equations of the form "c = (%x. _)" and constants occurring in chained facts are not unduely penalized
blanchet
parents:
42732
diff
changeset
|
338 |
chained_const_irrel_weight, ...}) |
1d375de437e9
fine-tuned the relevance filter, so that equations of the form "c = (%x. _)" and constants occurring in chained facts are not unduely penalized
blanchet
parents:
42732
diff
changeset
|
339 |
const_tab chained_const_tab = |
41790
56dcd46ddf7a
give more weight to Frees than to Consts in relevance filter
blanchet
parents:
41768
diff
changeset
|
340 |
generic_pconst_weight local_const_multiplier abs_irrel_weight |
53551 | 341 |
theory_const_irrel_weight chained_const_irrel_weight |
342 |
(irrel_weight_for fudge) swap const_tab |
|
343 |
chained_const_tab |
|
24287 | 344 |
|
46340 | 345 |
fun stature_bonus ({intro_bonus, ...} : relevance_fudge) (_, Intro) = |
346 |
intro_bonus |
|
347 |
| stature_bonus {elim_bonus, ...} (_, Elim) = elim_bonus |
|
348 |
| stature_bonus {simp_bonus, ...} (_, Simp) = simp_bonus |
|
349 |
| stature_bonus {local_bonus, ...} (Local, _) = local_bonus |
|
350 |
| stature_bonus {assum_bonus, ...} (Assum, _) = assum_bonus |
|
351 |
| stature_bonus {chained_bonus, ...} (Chained, _) = chained_bonus |
|
352 |
| stature_bonus _ _ = 0.0 |
|
38751
01c4d14b2a61
add a bonus for chained facts, since they are likely to be relevant;
blanchet
parents:
38749
diff
changeset
|
353 |
|
40418 | 354 |
fun is_odd_const_name s = |
53550
ffe2ce7910c1
get rid of another complication in relevance filter
blanchet
parents:
53548
diff
changeset
|
355 |
s = pseudo_abs_name orelse String.isSuffix theory_const_suffix s |
40418 | 356 |
|
53516
925591242376
got rid of currently unused data structure, to speed up relevance filter
blanchet
parents:
53493
diff
changeset
|
357 |
fun fact_weight fudge stature const_tab rel_const_tab chained_const_tab |
925591242376
got rid of currently unused data structure, to speed up relevance filter
blanchet
parents:
53493
diff
changeset
|
358 |
fact_consts = |
53158
4b9df3461eda
thread information about when a constant became relevant through MePo -- the information is not used yet but could help fight starvation in the (ITP) world
blanchet
parents:
53127
diff
changeset
|
359 |
case fact_consts |> List.partition (pconst_hyper_mem I rel_const_tab) |
4b9df3461eda
thread information about when a constant became relevant through MePo -- the information is not used yet but could help fight starvation in the (ITP) world
blanchet
parents:
53127
diff
changeset
|
360 |
||> filter_out (pconst_hyper_mem swap rel_const_tab) of |
38827
cf01645cbbce
extended relevance filter with first-order term matching
blanchet
parents:
38825
diff
changeset
|
361 |
([], _) => 0.0 |
38744
2b6333f78a9e
make relevance filter work in term of a "max_relevant" option + use Vampire SOS;
blanchet
parents:
38743
diff
changeset
|
362 |
| (rel, irrel) => |
40418 | 363 |
if forall (forall (is_odd_const_name o fst)) [rel, irrel] then |
40371 | 364 |
0.0 |
365 |
else |
|
366 |
let |
|
42735
1d375de437e9
fine-tuned the relevance filter, so that equations of the form "c = (%x. _)" and constants occurring in chained facts are not unduely penalized
blanchet
parents:
42732
diff
changeset
|
367 |
val irrel = irrel |> filter_out (pconst_mem swap rel) |
40371 | 368 |
val rel_weight = |
369 |
0.0 |> fold (curry (op +) o rel_pconst_weight fudge const_tab) rel |
|
370 |
val irrel_weight = |
|
46340 | 371 |
~ (stature_bonus fudge stature) |
42735
1d375de437e9
fine-tuned the relevance filter, so that equations of the form "c = (%x. _)" and constants occurring in chained facts are not unduely penalized
blanchet
parents:
42732
diff
changeset
|
372 |
|> fold (curry (op +) |
53158
4b9df3461eda
thread information about when a constant became relevant through MePo -- the information is not used yet but could help fight starvation in the (ITP) world
blanchet
parents:
53127
diff
changeset
|
373 |
o irrel_pconst_weight fudge const_tab chained_const_tab) |
4b9df3461eda
thread information about when a constant became relevant through MePo -- the information is not used yet but could help fight starvation in the (ITP) world
blanchet
parents:
53127
diff
changeset
|
374 |
irrel |
40371 | 375 |
val res = rel_weight / (rel_weight + irrel_weight) |
376 |
in if Real.isFinite res then res else 0.0 end |
|
38747 | 377 |
|
48293 | 378 |
fun take_most_relevant ctxt max_facts remaining_max |
42728
44cd74a419ce
added configuration options for experimental features
blanchet
parents:
42702
diff
changeset
|
379 |
({max_imperfect, max_imperfect_exp, ...} : relevance_fudge) |
51004
5f2788c38127
distinguish raw and non-raw facts, using raw for 10 000s of facts and non-raw after selection of some hundreds
blanchet
parents:
50985
diff
changeset
|
380 |
(candidates : ((raw_fact * (string * ptype) list) * real) list) = |
38744
2b6333f78a9e
make relevance filter work in term of a "max_relevant" option + use Vampire SOS;
blanchet
parents:
38743
diff
changeset
|
381 |
let |
38747 | 382 |
val max_imperfect = |
40070
bdb890782d4a
replaced references with proper record that's threaded through
blanchet
parents:
39958
diff
changeset
|
383 |
Real.ceil (Math.pow (max_imperfect, |
38904 | 384 |
Math.pow (Real.fromInt remaining_max |
48293 | 385 |
/ Real.fromInt max_facts, max_imperfect_exp))) |
38747 | 386 |
val (perfect, imperfect) = |
38889 | 387 |
candidates |> sort (Real.compare o swap o pairself snd) |
388 |
|> take_prefix (fn (_, w) => w > 0.99999) |
|
38747 | 389 |
val ((accepts, more_rejects), rejects) = |
390 |
chop max_imperfect imperfect |>> append perfect |>> chop remaining_max |
|
38744
2b6333f78a9e
make relevance filter work in term of a "max_relevant" option + use Vampire SOS;
blanchet
parents:
38743
diff
changeset
|
391 |
in |
42646
4781fcd53572
replaced some Unsynchronized.refs with Config.Ts
blanchet
parents:
42641
diff
changeset
|
392 |
trace_msg ctxt (fn () => |
41491 | 393 |
"Actually passed (" ^ string_of_int (length accepts) ^ " of " ^ |
394 |
string_of_int (length candidates) ^ "): " ^ |
|
38889 | 395 |
(accepts |> map (fn ((((name, _), _), _), weight) => |
38752
6628adcae4a7
consider "locality" when assigning weights to facts
blanchet
parents:
38751
diff
changeset
|
396 |
name () ^ " [" ^ Real.toString weight ^ "]") |
38745
ad577fd62ee4
reorganize options regarding to the relevance threshold and decay
blanchet
parents:
38744
diff
changeset
|
397 |
|> commas)); |
38747 | 398 |
(accepts, more_rejects @ rejects) |
38744
2b6333f78a9e
make relevance filter work in term of a "max_relevant" option + use Vampire SOS;
blanchet
parents:
38743
diff
changeset
|
399 |
end |
24287 | 400 |
|
54089
b13f6731f873
use same relevance filter for ATP and SMT solvers -- attempting to filter out certain ground instances of polymorphic symbols like + and 0 has unexpected side-effects that lead to incompletenesses (relevant facts not being selected)
blanchet
parents:
54088
diff
changeset
|
401 |
fun if_empty_replace_with_scope thy facts sc tab = |
38819
71c9f61516cd
if the goal contains no constants or frees, fall back on chained facts, then on local facts, etc., instead of generating a trivial ATP problem
blanchet
parents:
38818
diff
changeset
|
402 |
if Symtab.is_empty tab then |
42732
86683865278d
no penality for constants that appear in chained facts
blanchet
parents:
42730
diff
changeset
|
403 |
Symtab.empty |
54089
b13f6731f873
use same relevance filter for ATP and SMT solvers -- attempting to filter out certain ground instances of polymorphic symbols like + and 0 has unexpected side-effects that lead to incompletenesses (relevant facts not being selected)
blanchet
parents:
54088
diff
changeset
|
404 |
|> fold (add_pconsts_in_term thy) |
46340 | 405 |
(map_filter (fn ((_, (sc', _)), th) => |
406 |
if sc' = sc then SOME (prop_of th) else NONE) facts) |
|
38819
71c9f61516cd
if the goal contains no constants or frees, fall back on chained facts, then on local facts, etc., instead of generating a trivial ATP problem
blanchet
parents:
38818
diff
changeset
|
407 |
else |
71c9f61516cd
if the goal contains no constants or frees, fall back on chained facts, then on local facts, etc., instead of generating a trivial ATP problem
blanchet
parents:
38818
diff
changeset
|
408 |
tab |
71c9f61516cd
if the goal contains no constants or frees, fall back on chained facts, then on local facts, etc., instead of generating a trivial ATP problem
blanchet
parents:
38818
diff
changeset
|
409 |
|
54089
b13f6731f873
use same relevance filter for ATP and SMT solvers -- attempting to filter out certain ground instances of polymorphic symbols like + and 0 has unexpected side-effects that lead to incompletenesses (relevant facts not being selected)
blanchet
parents:
54088
diff
changeset
|
410 |
fun consider_arities th = |
41158
8c9c31a757f5
make Sledgehammer's relevance filter include the "ext" rule when appropriate
blanchet
parents:
41140
diff
changeset
|
411 |
let |
8c9c31a757f5
make Sledgehammer's relevance filter include the "ext" rule when appropriate
blanchet
parents:
41140
diff
changeset
|
412 |
fun aux _ _ NONE = NONE |
8c9c31a757f5
make Sledgehammer's relevance filter include the "ext" rule when appropriate
blanchet
parents:
41140
diff
changeset
|
413 |
| aux t args (SOME tab) = |
8c9c31a757f5
make Sledgehammer's relevance filter include the "ext" rule when appropriate
blanchet
parents:
41140
diff
changeset
|
414 |
case t of |
8c9c31a757f5
make Sledgehammer's relevance filter include the "ext" rule when appropriate
blanchet
parents:
41140
diff
changeset
|
415 |
t1 $ t2 => SOME tab |> aux t1 (t2 :: args) |> aux t2 [] |
54089
b13f6731f873
use same relevance filter for ATP and SMT solvers -- attempting to filter out certain ground instances of polymorphic symbols like + and 0 has unexpected side-effects that lead to incompletenesses (relevant facts not being selected)
blanchet
parents:
54088
diff
changeset
|
416 |
| Const (s, _) => |
b13f6731f873
use same relevance filter for ATP and SMT solvers -- attempting to filter out certain ground instances of polymorphic symbols like + and 0 has unexpected side-effects that lead to incompletenesses (relevant facts not being selected)
blanchet
parents:
54088
diff
changeset
|
417 |
(if is_widely_irrelevant_const s then |
41158
8c9c31a757f5
make Sledgehammer's relevance filter include the "ext" rule when appropriate
blanchet
parents:
41140
diff
changeset
|
418 |
SOME tab |
8c9c31a757f5
make Sledgehammer's relevance filter include the "ext" rule when appropriate
blanchet
parents:
41140
diff
changeset
|
419 |
else case Symtab.lookup tab s of |
8c9c31a757f5
make Sledgehammer's relevance filter include the "ext" rule when appropriate
blanchet
parents:
41140
diff
changeset
|
420 |
NONE => SOME (Symtab.update (s, length args) tab) |
8c9c31a757f5
make Sledgehammer's relevance filter include the "ext" rule when appropriate
blanchet
parents:
41140
diff
changeset
|
421 |
| SOME n => if n = length args then SOME tab else NONE) |
8c9c31a757f5
make Sledgehammer's relevance filter include the "ext" rule when appropriate
blanchet
parents:
41140
diff
changeset
|
422 |
| _ => SOME tab |
8c9c31a757f5
make Sledgehammer's relevance filter include the "ext" rule when appropriate
blanchet
parents:
41140
diff
changeset
|
423 |
in aux (prop_of th) [] end |
8c9c31a757f5
make Sledgehammer's relevance filter include the "ext" rule when appropriate
blanchet
parents:
41140
diff
changeset
|
424 |
|
44785 | 425 |
(* FIXME: This is currently only useful for polymorphic type encodings. *) |
54089
b13f6731f873
use same relevance filter for ATP and SMT solvers -- attempting to filter out certain ground instances of polymorphic symbols like + and 0 has unexpected side-effects that lead to incompletenesses (relevant facts not being selected)
blanchet
parents:
54088
diff
changeset
|
426 |
fun could_benefit_from_ext facts = |
b13f6731f873
use same relevance filter for ATP and SMT solvers -- attempting to filter out certain ground instances of polymorphic symbols like + and 0 has unexpected side-effects that lead to incompletenesses (relevant facts not being selected)
blanchet
parents:
54088
diff
changeset
|
427 |
fold (consider_arities o snd) facts (SOME Symtab.empty) |> is_none |
41158
8c9c31a757f5
make Sledgehammer's relevance filter include the "ext" rule when appropriate
blanchet
parents:
41140
diff
changeset
|
428 |
|
43492
43326cadc31a
insert rather than append special facts to make it less likely that they're truncated away
blanchet
parents:
43477
diff
changeset
|
429 |
(* High enough so that it isn't wrongly considered as very relevant (e.g., for E |
43326cadc31a
insert rather than append special facts to make it less likely that they're truncated away
blanchet
parents:
43477
diff
changeset
|
430 |
weights), but low enough so that it is unlikely to be truncated away if few |
43326cadc31a
insert rather than append special facts to make it less likely that they're truncated away
blanchet
parents:
43477
diff
changeset
|
431 |
facts are included. *) |
53546
a2d2fa096e31
kick out totally hopeless facts after 5 iterations to speed things up
blanchet
parents:
53516
diff
changeset
|
432 |
val special_fact_index = 45 (* FUDGE *) |
a2d2fa096e31
kick out totally hopeless facts after 5 iterations to speed things up
blanchet
parents:
53516
diff
changeset
|
433 |
|
54087
957115f3dae4
use plain types instead of dedicated type pattern
blanchet
parents:
54086
diff
changeset
|
434 |
fun eq_prod eqx eqy ((x1, y1), (x2, y2)) = eqx (x1, x2) andalso eqy (y1, y2) |
957115f3dae4
use plain types instead of dedicated type pattern
blanchet
parents:
54086
diff
changeset
|
435 |
|
53546
a2d2fa096e31
kick out totally hopeless facts after 5 iterations to speed things up
blanchet
parents:
53516
diff
changeset
|
436 |
val really_hopeless_get_kicked_out_iter = 5 (* FUDGE *) |
43492
43326cadc31a
insert rather than append special facts to make it less likely that they're truncated away
blanchet
parents:
43477
diff
changeset
|
437 |
|
54089
b13f6731f873
use same relevance filter for ATP and SMT solvers -- attempting to filter out certain ground instances of polymorphic symbols like + and 0 has unexpected side-effects that lead to incompletenesses (relevant facts not being selected)
blanchet
parents:
54088
diff
changeset
|
438 |
fun relevance_filter ctxt thres0 decay max_facts |
b13f6731f873
use same relevance filter for ATP and SMT solvers -- attempting to filter out certain ground instances of polymorphic symbols like + and 0 has unexpected side-effects that lead to incompletenesses (relevant facts not being selected)
blanchet
parents:
54088
diff
changeset
|
439 |
(fudge as {threshold_divisor, ridiculous_threshold, ...}) facts hyp_ts concl_t = |
38739
8b8ed80b5699
renamed "relevance_convergence" to "relevance_decay"
blanchet
parents:
38738
diff
changeset
|
440 |
let |
42361 | 441 |
val thy = Proof_Context.theory_of ctxt |
54142
5f3c1b445253
no fact subsumption -- this only confuses later code, e.g. 'add:'
blanchet
parents:
54124
diff
changeset
|
442 |
val facts = drop_duplicate_facts facts |
40204
da97d75e20e6
standardize on "fact" terminology (vs. "axiom" or "theorem") in Sledgehammer -- but keep "Axiom" in the lower-level "ATP_Problem" module
blanchet
parents:
40191
diff
changeset
|
443 |
val const_tab = fold (count_fact_consts thy fudge) facts Symtab.empty |
54089
b13f6731f873
use same relevance filter for ATP and SMT solvers -- attempting to filter out certain ground instances of polymorphic symbols like + and 0 has unexpected side-effects that lead to incompletenesses (relevant facts not being selected)
blanchet
parents:
54088
diff
changeset
|
444 |
val add_pconsts = add_pconsts_in_term thy |
48292 | 445 |
val chained_ts = |
446 |
facts |> map_filter (fn ((_, (Chained, _)), th) => SOME (prop_of th) |
|
447 |
| _ => NONE) |
|
53551 | 448 |
val chained_const_tab = Symtab.empty |> fold add_pconsts chained_ts |
38819
71c9f61516cd
if the goal contains no constants or frees, fall back on chained facts, then on local facts, etc., instead of generating a trivial ATP problem
blanchet
parents:
38818
diff
changeset
|
449 |
val goal_const_tab = |
53158
4b9df3461eda
thread information about when a constant became relevant through MePo -- the information is not used yet but could help fight starvation in the (ITP) world
blanchet
parents:
53127
diff
changeset
|
450 |
Symtab.empty |
53551 | 451 |
|> fold add_pconsts hyp_ts |
452 |
|> add_pconsts concl_t |
|
42732
86683865278d
no penality for constants that appear in chained facts
blanchet
parents:
42730
diff
changeset
|
453 |
|> (fn tab => if Symtab.is_empty tab then chained_const_tab else tab) |
54089
b13f6731f873
use same relevance filter for ATP and SMT solvers -- attempting to filter out certain ground instances of polymorphic symbols like + and 0 has unexpected side-effects that lead to incompletenesses (relevant facts not being selected)
blanchet
parents:
54088
diff
changeset
|
454 |
|> fold (if_empty_replace_with_scope thy facts) [Chained, Assum, Local] |
53516
925591242376
got rid of currently unused data structure, to speed up relevance filter
blanchet
parents:
53493
diff
changeset
|
455 |
fun iter j remaining_max thres rel_const_tab hopeless hopeful = |
38739
8b8ed80b5699
renamed "relevance_convergence" to "relevance_decay"
blanchet
parents:
38738
diff
changeset
|
456 |
let |
53546
a2d2fa096e31
kick out totally hopeless facts after 5 iterations to speed things up
blanchet
parents:
53516
diff
changeset
|
457 |
val hopeless = |
a2d2fa096e31
kick out totally hopeless facts after 5 iterations to speed things up
blanchet
parents:
53516
diff
changeset
|
458 |
hopeless |> j = really_hopeless_get_kicked_out_iter |
a2d2fa096e31
kick out totally hopeless facts after 5 iterations to speed things up
blanchet
parents:
53516
diff
changeset
|
459 |
? filter_out (fn (_, w) => w < 0.001) |
40191
257d2e06bfb8
put theorems added using "add:" at the beginning of the list returned by the relevance filter, so that they don't get truncated away
blanchet
parents:
40071
diff
changeset
|
460 |
fun relevant [] _ [] = |
38747 | 461 |
(* Nothing has been added this iteration. *) |
48288
255c6e1fd505
rationalize relevance filter, slowing moving code from Iter to MaSh
blanchet
parents:
48250
diff
changeset
|
462 |
if j = 0 andalso thres >= ridiculous_threshold then |
38747 | 463 |
(* First iteration? Try again. *) |
48293 | 464 |
iter 0 max_facts (thres / threshold_divisor) rel_const_tab |
53516
925591242376
got rid of currently unused data structure, to speed up relevance filter
blanchet
parents:
53493
diff
changeset
|
465 |
hopeless hopeful |
38744
2b6333f78a9e
make relevance filter work in term of a "max_relevant" option + use Vampire SOS;
blanchet
parents:
38743
diff
changeset
|
466 |
else |
40191
257d2e06bfb8
put theorems added using "add:" at the beginning of the list returned by the relevance filter, so that they don't get truncated away
blanchet
parents:
40071
diff
changeset
|
467 |
[] |
38889 | 468 |
| relevant candidates rejects [] = |
38739
8b8ed80b5699
renamed "relevance_convergence" to "relevance_decay"
blanchet
parents:
38738
diff
changeset
|
469 |
let |
38747 | 470 |
val (accepts, more_rejects) = |
48293 | 471 |
take_most_relevant ctxt max_facts remaining_max fudge candidates |
53546
a2d2fa096e31
kick out totally hopeless facts after 5 iterations to speed things up
blanchet
parents:
53516
diff
changeset
|
472 |
val sps = maps (snd o fst) accepts |
38739
8b8ed80b5699
renamed "relevance_convergence" to "relevance_decay"
blanchet
parents:
38738
diff
changeset
|
473 |
val rel_const_tab' = |
53550
ffe2ce7910c1
get rid of another complication in relevance filter
blanchet
parents:
53548
diff
changeset
|
474 |
rel_const_tab |> fold add_pconst_to_table sps |
53158
4b9df3461eda
thread information about when a constant became relevant through MePo -- the information is not used yet but could help fight starvation in the (ITP) world
blanchet
parents:
53127
diff
changeset
|
475 |
fun is_dirty (s, _) = |
4b9df3461eda
thread information about when a constant became relevant through MePo -- the information is not used yet but could help fight starvation in the (ITP) world
blanchet
parents:
53127
diff
changeset
|
476 |
Symtab.lookup rel_const_tab' s <> Symtab.lookup rel_const_tab s |
38745
ad577fd62ee4
reorganize options regarding to the relevance threshold and decay
blanchet
parents:
38744
diff
changeset
|
477 |
val (hopeful_rejects, hopeless_rejects) = |
ad577fd62ee4
reorganize options regarding to the relevance threshold and decay
blanchet
parents:
38744
diff
changeset
|
478 |
(rejects @ hopeless, ([], [])) |
ad577fd62ee4
reorganize options regarding to the relevance threshold and decay
blanchet
parents:
38744
diff
changeset
|
479 |
|-> fold (fn (ax as (_, consts), old_weight) => |
ad577fd62ee4
reorganize options regarding to the relevance threshold and decay
blanchet
parents:
38744
diff
changeset
|
480 |
if exists is_dirty consts then |
ad577fd62ee4
reorganize options regarding to the relevance threshold and decay
blanchet
parents:
38744
diff
changeset
|
481 |
apfst (cons (ax, NONE)) |
ad577fd62ee4
reorganize options regarding to the relevance threshold and decay
blanchet
parents:
38744
diff
changeset
|
482 |
else |
ad577fd62ee4
reorganize options regarding to the relevance threshold and decay
blanchet
parents:
38744
diff
changeset
|
483 |
apsnd (cons (ax, old_weight))) |
ad577fd62ee4
reorganize options regarding to the relevance threshold and decay
blanchet
parents:
38744
diff
changeset
|
484 |
|>> append (more_rejects |
ad577fd62ee4
reorganize options regarding to the relevance threshold and decay
blanchet
parents:
38744
diff
changeset
|
485 |
|> map (fn (ax as (_, consts), old_weight) => |
ad577fd62ee4
reorganize options regarding to the relevance threshold and decay
blanchet
parents:
38744
diff
changeset
|
486 |
(ax, if exists is_dirty consts then NONE |
ad577fd62ee4
reorganize options regarding to the relevance threshold and decay
blanchet
parents:
38744
diff
changeset
|
487 |
else SOME old_weight))) |
48288
255c6e1fd505
rationalize relevance filter, slowing moving code from Iter to MaSh
blanchet
parents:
48250
diff
changeset
|
488 |
val thres = |
255c6e1fd505
rationalize relevance filter, slowing moving code from Iter to MaSh
blanchet
parents:
48250
diff
changeset
|
489 |
1.0 - (1.0 - thres) |
38822
aa0101e618e2
fix threshold computation + remove "op =" from relevant constants
blanchet
parents:
38821
diff
changeset
|
490 |
* Math.pow (decay, Real.fromInt (length accepts)) |
38747 | 491 |
val remaining_max = remaining_max - length accepts |
38739
8b8ed80b5699
renamed "relevance_convergence" to "relevance_decay"
blanchet
parents:
38738
diff
changeset
|
492 |
in |
42646
4781fcd53572
replaced some Unsynchronized.refs with Config.Ts
blanchet
parents:
42641
diff
changeset
|
493 |
trace_msg ctxt (fn () => "New or updated constants: " ^ |
53158
4b9df3461eda
thread information about when a constant became relevant through MePo -- the information is not used yet but could help fight starvation in the (ITP) world
blanchet
parents:
53127
diff
changeset
|
494 |
commas (rel_const_tab' |
4b9df3461eda
thread information about when a constant became relevant through MePo -- the information is not used yet but could help fight starvation in the (ITP) world
blanchet
parents:
53127
diff
changeset
|
495 |
|> Symtab.dest |
54087
957115f3dae4
use plain types instead of dedicated type pattern
blanchet
parents:
54086
diff
changeset
|
496 |
|> subtract (eq_prod (op =) (eq_list ptype_eq)) |
957115f3dae4
use plain types instead of dedicated type pattern
blanchet
parents:
54086
diff
changeset
|
497 |
(rel_const_tab |> Symtab.dest) |
51998
f732a674db1b
renamed Sledgehammer functions with 'for' in their names to 'of'
blanchet
parents:
51026
diff
changeset
|
498 |
|> map string_of_hyper_pconst)); |
38745
ad577fd62ee4
reorganize options regarding to the relevance threshold and decay
blanchet
parents:
38744
diff
changeset
|
499 |
map (fst o fst) accepts @ |
38747 | 500 |
(if remaining_max = 0 then |
40191
257d2e06bfb8
put theorems added using "add:" at the beginning of the list returned by the relevance filter, so that they don't get truncated away
blanchet
parents:
40071
diff
changeset
|
501 |
[] |
38745
ad577fd62ee4
reorganize options regarding to the relevance threshold and decay
blanchet
parents:
38744
diff
changeset
|
502 |
else |
48288
255c6e1fd505
rationalize relevance filter, slowing moving code from Iter to MaSh
blanchet
parents:
48250
diff
changeset
|
503 |
iter (j + 1) remaining_max thres rel_const_tab' |
53516
925591242376
got rid of currently unused data structure, to speed up relevance filter
blanchet
parents:
53493
diff
changeset
|
504 |
hopeless_rejects hopeful_rejects) |
38739
8b8ed80b5699
renamed "relevance_convergence" to "relevance_decay"
blanchet
parents:
38738
diff
changeset
|
505 |
end |
38889 | 506 |
| relevant candidates rejects |
46340 | 507 |
(((ax as (((_, stature), _), fact_consts)), cached_weight) |
38747 | 508 |
:: hopeful) = |
38739
8b8ed80b5699
renamed "relevance_convergence" to "relevance_decay"
blanchet
parents:
38738
diff
changeset
|
509 |
let |
8b8ed80b5699
renamed "relevance_convergence" to "relevance_decay"
blanchet
parents:
38738
diff
changeset
|
510 |
val weight = |
8b8ed80b5699
renamed "relevance_convergence" to "relevance_decay"
blanchet
parents:
38738
diff
changeset
|
511 |
case cached_weight of |
8b8ed80b5699
renamed "relevance_convergence" to "relevance_decay"
blanchet
parents:
38738
diff
changeset
|
512 |
SOME w => w |
53158
4b9df3461eda
thread information about when a constant became relevant through MePo -- the information is not used yet but could help fight starvation in the (ITP) world
blanchet
parents:
53127
diff
changeset
|
513 |
| NONE => |
4b9df3461eda
thread information about when a constant became relevant through MePo -- the information is not used yet but could help fight starvation in the (ITP) world
blanchet
parents:
53127
diff
changeset
|
514 |
fact_weight fudge stature const_tab rel_const_tab |
53516
925591242376
got rid of currently unused data structure, to speed up relevance filter
blanchet
parents:
53493
diff
changeset
|
515 |
chained_const_tab fact_consts |
38739
8b8ed80b5699
renamed "relevance_convergence" to "relevance_decay"
blanchet
parents:
38738
diff
changeset
|
516 |
in |
48288
255c6e1fd505
rationalize relevance filter, slowing moving code from Iter to MaSh
blanchet
parents:
48250
diff
changeset
|
517 |
if weight >= thres then |
38889 | 518 |
relevant ((ax, weight) :: candidates) rejects hopeful |
38739
8b8ed80b5699
renamed "relevance_convergence" to "relevance_decay"
blanchet
parents:
38738
diff
changeset
|
519 |
else |
38889 | 520 |
relevant candidates ((ax, weight) :: rejects) hopeful |
38739
8b8ed80b5699
renamed "relevance_convergence" to "relevance_decay"
blanchet
parents:
38738
diff
changeset
|
521 |
end |
8b8ed80b5699
renamed "relevance_convergence" to "relevance_decay"
blanchet
parents:
38738
diff
changeset
|
522 |
in |
42646
4781fcd53572
replaced some Unsynchronized.refs with Config.Ts
blanchet
parents:
42641
diff
changeset
|
523 |
trace_msg ctxt (fn () => |
38744
2b6333f78a9e
make relevance filter work in term of a "max_relevant" option + use Vampire SOS;
blanchet
parents:
38743
diff
changeset
|
524 |
"ITERATION " ^ string_of_int j ^ ": current threshold: " ^ |
48288
255c6e1fd505
rationalize relevance filter, slowing moving code from Iter to MaSh
blanchet
parents:
48250
diff
changeset
|
525 |
Real.toString thres ^ ", constants: " ^ |
53158
4b9df3461eda
thread information about when a constant became relevant through MePo -- the information is not used yet but could help fight starvation in the (ITP) world
blanchet
parents:
53127
diff
changeset
|
526 |
commas (rel_const_tab |
4b9df3461eda
thread information about when a constant became relevant through MePo -- the information is not used yet but could help fight starvation in the (ITP) world
blanchet
parents:
53127
diff
changeset
|
527 |
|> Symtab.dest |
38744
2b6333f78a9e
make relevance filter work in term of a "max_relevant" option + use Vampire SOS;
blanchet
parents:
38743
diff
changeset
|
528 |
|> filter (curry (op <>) [] o snd) |
51998
f732a674db1b
renamed Sledgehammer functions with 'for' in their names to 'of'
blanchet
parents:
51026
diff
changeset
|
529 |
|> map string_of_hyper_pconst)); |
38889 | 530 |
relevant [] [] hopeful |
38739
8b8ed80b5699
renamed "relevance_convergence" to "relevance_decay"
blanchet
parents:
38738
diff
changeset
|
531 |
end |
47933
4e8e0245e8be
treat sets specially in relevance filter, as they used to, to avoid cluttering the problem with facts about Set.member and Collect
blanchet
parents:
47904
diff
changeset
|
532 |
fun uses_const s t = |
4e8e0245e8be
treat sets specially in relevance filter, as they used to, to avoid cluttering the problem with facts about Set.member and Collect
blanchet
parents:
47904
diff
changeset
|
533 |
fold_aterms (curry (fn (Const (s', _), false) => s' = s | (_, b) => b)) t |
4e8e0245e8be
treat sets specially in relevance filter, as they used to, to avoid cluttering the problem with facts about Set.member and Collect
blanchet
parents:
47904
diff
changeset
|
534 |
false |
4e8e0245e8be
treat sets specially in relevance filter, as they used to, to avoid cluttering the problem with facts about Set.member and Collect
blanchet
parents:
47904
diff
changeset
|
535 |
fun uses_const_anywhere accepts s = |
4e8e0245e8be
treat sets specially in relevance filter, as they used to, to avoid cluttering the problem with facts about Set.member and Collect
blanchet
parents:
47904
diff
changeset
|
536 |
exists (uses_const s o prop_of o snd) accepts orelse |
4e8e0245e8be
treat sets specially in relevance filter, as they used to, to avoid cluttering the problem with facts about Set.member and Collect
blanchet
parents:
47904
diff
changeset
|
537 |
exists (uses_const s) (concl_t :: hyp_ts) |
4e8e0245e8be
treat sets specially in relevance filter, as they used to, to avoid cluttering the problem with facts about Set.member and Collect
blanchet
parents:
47904
diff
changeset
|
538 |
fun add_set_const_thms accepts = |
4e8e0245e8be
treat sets specially in relevance filter, as they used to, to avoid cluttering the problem with facts about Set.member and Collect
blanchet
parents:
47904
diff
changeset
|
539 |
exists (uses_const_anywhere accepts) set_consts ? append set_thms |
43492
43326cadc31a
insert rather than append special facts to make it less likely that they're truncated away
blanchet
parents:
43477
diff
changeset
|
540 |
fun insert_into_facts accepts [] = accepts |
43326cadc31a
insert rather than append special facts to make it less likely that they're truncated away
blanchet
parents:
43477
diff
changeset
|
541 |
| insert_into_facts accepts ths = |
43326cadc31a
insert rather than append special facts to make it less likely that they're truncated away
blanchet
parents:
43477
diff
changeset
|
542 |
let |
43326cadc31a
insert rather than append special facts to make it less likely that they're truncated away
blanchet
parents:
43477
diff
changeset
|
543 |
val add = facts |> filter (member Thm.eq_thm_prop ths o snd) |
43326cadc31a
insert rather than append special facts to make it less likely that they're truncated away
blanchet
parents:
43477
diff
changeset
|
544 |
val (bef, after) = |
43326cadc31a
insert rather than append special facts to make it less likely that they're truncated away
blanchet
parents:
43477
diff
changeset
|
545 |
accepts |> filter_out (member Thm.eq_thm_prop ths o snd) |
48293 | 546 |
|> take (max_facts - length add) |
43492
43326cadc31a
insert rather than append special facts to make it less likely that they're truncated away
blanchet
parents:
43477
diff
changeset
|
547 |
|> chop special_fact_index |
43326cadc31a
insert rather than append special facts to make it less likely that they're truncated away
blanchet
parents:
43477
diff
changeset
|
548 |
in bef @ add @ after end |
43326cadc31a
insert rather than append special facts to make it less likely that they're truncated away
blanchet
parents:
43477
diff
changeset
|
549 |
fun insert_special_facts accepts = |
51026 | 550 |
(* FIXME: get rid of "ext" here once it is treated as a helper *) |
54089
b13f6731f873
use same relevance filter for ATP and SMT solvers -- attempting to filter out certain ground instances of polymorphic symbols like + and 0 has unexpected side-effects that lead to incompletenesses (relevant facts not being selected)
blanchet
parents:
54088
diff
changeset
|
551 |
[] |> could_benefit_from_ext accepts ? cons @{thm ext} |
51026 | 552 |
|> add_set_const_thms accepts |
553 |
|> insert_into_facts accepts |
|
38739
8b8ed80b5699
renamed "relevance_convergence" to "relevance_decay"
blanchet
parents:
38738
diff
changeset
|
554 |
in |
54089
b13f6731f873
use same relevance filter for ATP and SMT solvers -- attempting to filter out certain ground instances of polymorphic symbols like + and 0 has unexpected side-effects that lead to incompletenesses (relevant facts not being selected)
blanchet
parents:
54088
diff
changeset
|
555 |
facts |> map_filter (pair_consts_fact thy fudge) |
53516
925591242376
got rid of currently unused data structure, to speed up relevance filter
blanchet
parents:
53493
diff
changeset
|
556 |
|> iter 0 max_facts thres0 goal_const_tab [] |
43492
43326cadc31a
insert rather than append special facts to make it less likely that they're truncated away
blanchet
parents:
43477
diff
changeset
|
557 |
|> insert_special_facts |
42646
4781fcd53572
replaced some Unsynchronized.refs with Config.Ts
blanchet
parents:
42641
diff
changeset
|
558 |
|> tap (fn accepts => trace_msg ctxt (fn () => |
41491 | 559 |
"Total relevant: " ^ string_of_int (length accepts))) |
38739
8b8ed80b5699
renamed "relevance_convergence" to "relevance_decay"
blanchet
parents:
38738
diff
changeset
|
560 |
end |
24287 | 561 |
|
54095 | 562 |
fun mepo_suggested_facts ctxt ({fact_thresholds = (thres0, thres1), ...} : params) max_facts fudge |
563 |
hyp_ts concl_t facts = |
|
37538
97ab019d5ac8
make sure that theorems passed using "add:" to Sledgehammer are not eliminated on heuristic grounds
blanchet
parents:
37537
diff
changeset
|
564 |
let |
42361 | 565 |
val thy = Proof_Context.theory_of ctxt |
54095 | 566 |
val fudge = fudge |> the_default default_relevance_fudge |
48288
255c6e1fd505
rationalize relevance filter, slowing moving code from Iter to MaSh
blanchet
parents:
48250
diff
changeset
|
567 |
val decay = Math.pow ((1.0 - thres1) / (1.0 - thres0), |
48293 | 568 |
1.0 / Real.fromInt (max_facts + 1)) |
37538
97ab019d5ac8
make sure that theorems passed using "add:" to Sledgehammer are not eliminated on heuristic grounds
blanchet
parents:
37537
diff
changeset
|
569 |
in |
54089
b13f6731f873
use same relevance filter for ATP and SMT solvers -- attempting to filter out certain ground instances of polymorphic symbols like + and 0 has unexpected side-effects that lead to incompletenesses (relevant facts not being selected)
blanchet
parents:
54088
diff
changeset
|
570 |
trace_msg ctxt (fn () => "Considering " ^ string_of_int (length facts) ^ " facts"); |
48288
255c6e1fd505
rationalize relevance filter, slowing moving code from Iter to MaSh
blanchet
parents:
48250
diff
changeset
|
571 |
(if thres1 < 0.0 then |
40204
da97d75e20e6
standardize on "fact" terminology (vs. "axiom" or "theorem") in Sledgehammer -- but keep "Axiom" in the lower-level "ATP_Problem" module
blanchet
parents:
40191
diff
changeset
|
572 |
facts |
54124 | 573 |
else if thres0 > 1.0 orelse thres0 > thres1 orelse max_facts <= 0 then |
38739
8b8ed80b5699
renamed "relevance_convergence" to "relevance_decay"
blanchet
parents:
38738
diff
changeset
|
574 |
[] |
8b8ed80b5699
renamed "relevance_convergence" to "relevance_decay"
blanchet
parents:
38738
diff
changeset
|
575 |
else |
54089
b13f6731f873
use same relevance filter for ATP and SMT solvers -- attempting to filter out certain ground instances of polymorphic symbols like + and 0 has unexpected side-effects that lead to incompletenesses (relevant facts not being selected)
blanchet
parents:
54088
diff
changeset
|
576 |
relevance_filter ctxt thres0 decay max_facts fudge facts hyp_ts |
b13f6731f873
use same relevance filter for ATP and SMT solvers -- attempting to filter out certain ground instances of polymorphic symbols like + and 0 has unexpected side-effects that lead to incompletenesses (relevant facts not being selected)
blanchet
parents:
54088
diff
changeset
|
577 |
(concl_t |> theory_constify fudge (Context.theory_name thy))) |
51004
5f2788c38127
distinguish raw and non-raw facts, using raw for 10 000s of facts and non-raw after selection of some hundreds
blanchet
parents:
50985
diff
changeset
|
578 |
|> map fact_of_raw_fact |
37538
97ab019d5ac8
make sure that theorems passed using "add:" to Sledgehammer are not eliminated on heuristic grounds
blanchet
parents:
37537
diff
changeset
|
579 |
end |
30536
07b4f050e4df
split relevance-filter and writing of problem-files;
immler@in.tum.de
parents:
30364
diff
changeset
|
580 |
|
15347 | 581 |
end; |