blanchet@48250
|
1 |
(* Title: HOL/Tools/Sledgehammer/sledgehammer_fact.ML
|
blanchet@48250
|
2 |
Author: Jia Meng, Cambridge University Computer Laboratory and NICTA
|
blanchet@48250
|
3 |
Author: Jasmin Blanchette, TU Muenchen
|
blanchet@48250
|
4 |
|
blanchet@48250
|
5 |
Sledgehammer fact handling.
|
blanchet@48250
|
6 |
*)
|
blanchet@48250
|
7 |
|
blanchet@48250
|
8 |
signature SLEDGEHAMMER_FACT =
|
blanchet@48250
|
9 |
sig
|
blanchet@48250
|
10 |
type status = ATP_Problem_Generate.status
|
blanchet@48250
|
11 |
type stature = ATP_Problem_Generate.stature
|
blanchet@48250
|
12 |
|
blanchet@48296
|
13 |
type fact = ((unit -> string) * stature) * thm
|
blanchet@48296
|
14 |
|
blanchet@48292
|
15 |
type fact_override =
|
blanchet@48250
|
16 |
{add : (Facts.ref * Attrib.src list) list,
|
blanchet@48250
|
17 |
del : (Facts.ref * Attrib.src list) list,
|
blanchet@48250
|
18 |
only : bool}
|
blanchet@48250
|
19 |
|
blanchet@48250
|
20 |
val ignore_no_atp : bool Config.T
|
blanchet@48250
|
21 |
val instantiate_inducts : bool Config.T
|
blanchet@48292
|
22 |
val no_fact_override : fact_override
|
blanchet@48250
|
23 |
val fact_from_ref :
|
blanchet@48250
|
24 |
Proof.context -> unit Symtab.table -> thm list -> status Termtab.table
|
blanchet@48250
|
25 |
-> Facts.ref * Attrib.src list -> ((string * stature) * thm) list
|
blanchet@50047
|
26 |
val backquote_thm : Proof.context -> thm -> string
|
blanchet@50511
|
27 |
val is_blacklisted_or_something : Proof.context -> bool -> string -> bool
|
blanchet@48250
|
28 |
val clasimpset_rule_table_of : Proof.context -> status Termtab.table
|
blanchet@50735
|
29 |
val build_name_tables :
|
blanchet@50735
|
30 |
(thm -> string) -> ('a * thm) list
|
blanchet@50735
|
31 |
-> string Symtab.table * string Symtab.table
|
blanchet@48250
|
32 |
val maybe_instantiate_inducts :
|
blanchet@48250
|
33 |
Proof.context -> term list -> term -> (((unit -> string) * 'a) * thm) list
|
blanchet@48250
|
34 |
-> (((unit -> string) * 'a) * thm) list
|
blanchet@48250
|
35 |
val maybe_filter_no_atps : Proof.context -> ('a * thm) list -> ('a * thm) list
|
blanchet@48530
|
36 |
val all_facts :
|
blanchet@50442
|
37 |
Proof.context -> bool -> bool -> unit Symtab.table -> thm list -> thm list
|
blanchet@48530
|
38 |
-> status Termtab.table -> fact list
|
blanchet@48250
|
39 |
val nearly_all_facts :
|
blanchet@48299
|
40 |
Proof.context -> bool -> fact_override -> unit Symtab.table
|
blanchet@48299
|
41 |
-> status Termtab.table -> thm list -> term list -> term -> fact list
|
blanchet@48250
|
42 |
end;
|
blanchet@48250
|
43 |
|
blanchet@48250
|
44 |
structure Sledgehammer_Fact : SLEDGEHAMMER_FACT =
|
blanchet@48250
|
45 |
struct
|
blanchet@48250
|
46 |
|
blanchet@50495
|
47 |
open ATP_Util
|
blanchet@48250
|
48 |
open ATP_Problem_Generate
|
blanchet@48250
|
49 |
open Metis_Tactic
|
blanchet@48250
|
50 |
open Sledgehammer_Util
|
blanchet@48250
|
51 |
|
blanchet@48296
|
52 |
type fact = ((unit -> string) * stature) * thm
|
blanchet@48296
|
53 |
|
blanchet@48292
|
54 |
type fact_override =
|
blanchet@48250
|
55 |
{add : (Facts.ref * Attrib.src list) list,
|
blanchet@48250
|
56 |
del : (Facts.ref * Attrib.src list) list,
|
blanchet@48250
|
57 |
only : bool}
|
blanchet@48250
|
58 |
|
blanchet@48250
|
59 |
(* experimental features *)
|
blanchet@48250
|
60 |
val ignore_no_atp =
|
blanchet@48250
|
61 |
Attrib.setup_config_bool @{binding sledgehammer_ignore_no_atp} (K false)
|
blanchet@48250
|
62 |
val instantiate_inducts =
|
blanchet@48250
|
63 |
Attrib.setup_config_bool @{binding sledgehammer_instantiate_inducts} (K false)
|
blanchet@48250
|
64 |
|
blanchet@48292
|
65 |
val no_fact_override = {add = [], del = [], only = false}
|
blanchet@48250
|
66 |
|
blanchet@48250
|
67 |
fun needs_quoting reserved s =
|
blanchet@48250
|
68 |
Symtab.defined reserved s orelse
|
wenzelm@50239
|
69 |
exists (not o Symbol_Pos.is_identifier) (Long_Name.explode s)
|
blanchet@48250
|
70 |
|
blanchet@48250
|
71 |
fun make_name reserved multi j name =
|
blanchet@48250
|
72 |
(name |> needs_quoting reserved name ? quote) ^
|
blanchet@48250
|
73 |
(if multi then "(" ^ string_of_int j ^ ")" else "")
|
blanchet@48250
|
74 |
|
blanchet@48250
|
75 |
fun explode_interval _ (Facts.FromTo (i, j)) = i upto j
|
blanchet@48250
|
76 |
| explode_interval max (Facts.From i) = i upto i + max - 1
|
blanchet@48250
|
77 |
| explode_interval _ (Facts.Single i) = [i]
|
blanchet@48250
|
78 |
|
blanchet@48250
|
79 |
val backquote =
|
blanchet@48250
|
80 |
raw_explode #> map (fn "`" => "\\`" | s => s) #> implode #> enclose "`" "`"
|
blanchet@48250
|
81 |
|
blanchet@48250
|
82 |
(* unfolding these can yield really huge terms *)
|
blanchet@48250
|
83 |
val risky_defs = @{thms Bit0_def Bit1_def}
|
blanchet@48250
|
84 |
|
blanchet@48250
|
85 |
fun is_rec_eq lhs = Term.exists_subterm (curry (op =) (head_of lhs))
|
blanchet@48250
|
86 |
fun is_rec_def (@{const Trueprop} $ t) = is_rec_def t
|
blanchet@48250
|
87 |
| is_rec_def (@{const ==>} $ _ $ t2) = is_rec_def t2
|
blanchet@48250
|
88 |
| is_rec_def (Const (@{const_name "=="}, _) $ t1 $ t2) = is_rec_eq t1 t2
|
blanchet@48250
|
89 |
| is_rec_def (Const (@{const_name HOL.eq}, _) $ t1 $ t2) = is_rec_eq t1 t2
|
blanchet@48250
|
90 |
| is_rec_def _ = false
|
blanchet@48250
|
91 |
|
blanchet@48250
|
92 |
fun is_assum assms th = exists (fn ct => prop_of th aconv term_of ct) assms
|
blanchet@48396
|
93 |
fun is_chained chained = member Thm.eq_thm_prop chained
|
blanchet@48250
|
94 |
|
blanchet@48396
|
95 |
fun scope_of_thm global assms chained th =
|
blanchet@48396
|
96 |
if is_chained chained th then Chained
|
blanchet@48250
|
97 |
else if global then Global
|
blanchet@48250
|
98 |
else if is_assum assms th then Assum
|
blanchet@48250
|
99 |
else Local
|
blanchet@48250
|
100 |
|
blanchet@48250
|
101 |
val may_be_induction =
|
blanchet@48250
|
102 |
exists_subterm (fn Var (_, Type (@{type_name fun}, [_, T])) =>
|
blanchet@48250
|
103 |
body_type T = @{typ bool}
|
blanchet@48250
|
104 |
| _ => false)
|
blanchet@48250
|
105 |
|
blanchet@48396
|
106 |
fun status_of_thm css name th =
|
blanchet@48250
|
107 |
(* FIXME: use structured name *)
|
blanchet@48250
|
108 |
if (String.isSubstring ".induct" name orelse
|
blanchet@48250
|
109 |
String.isSubstring ".inducts" name) andalso
|
blanchet@48250
|
110 |
may_be_induction (prop_of th) then
|
blanchet@48250
|
111 |
Induction
|
blanchet@48396
|
112 |
else case Termtab.lookup css (prop_of th) of
|
blanchet@48250
|
113 |
SOME status => status
|
blanchet@48250
|
114 |
| NONE => General
|
blanchet@48250
|
115 |
|
blanchet@48396
|
116 |
fun stature_of_thm global assms chained css name th =
|
blanchet@48396
|
117 |
(scope_of_thm global assms chained th, status_of_thm css name th)
|
blanchet@48250
|
118 |
|
blanchet@48396
|
119 |
fun fact_from_ref ctxt reserved chained css (xthm as (xref, args)) =
|
blanchet@48250
|
120 |
let
|
blanchet@48250
|
121 |
val ths = Attrib.eval_thms ctxt [xthm]
|
blanchet@48250
|
122 |
val bracket =
|
blanchet@48250
|
123 |
map (enclose "[" "]" o Pretty.str_of o Args.pretty_src ctxt) args
|
blanchet@48250
|
124 |
|> implode
|
blanchet@48250
|
125 |
fun nth_name j =
|
blanchet@48250
|
126 |
case xref of
|
blanchet@48250
|
127 |
Facts.Fact s => backquote s ^ bracket
|
blanchet@48250
|
128 |
| Facts.Named (("", _), _) => "[" ^ bracket ^ "]"
|
blanchet@48250
|
129 |
| Facts.Named ((name, _), NONE) =>
|
blanchet@48250
|
130 |
make_name reserved (length ths > 1) (j + 1) name ^ bracket
|
blanchet@48250
|
131 |
| Facts.Named ((name, _), SOME intervals) =>
|
blanchet@48250
|
132 |
make_name reserved true
|
blanchet@48250
|
133 |
(nth (maps (explode_interval (length ths)) intervals) j) name ^
|
blanchet@48250
|
134 |
bracket
|
blanchet@48396
|
135 |
fun add_nth th (j, rest) =
|
blanchet@48396
|
136 |
let val name = nth_name j in
|
blanchet@48396
|
137 |
(j + 1, ((name, stature_of_thm false [] chained css name th), th)
|
blanchet@48396
|
138 |
:: rest)
|
blanchet@48396
|
139 |
end
|
blanchet@48396
|
140 |
in (0, []) |> fold add_nth ths |> snd end
|
blanchet@48250
|
141 |
|
blanchet@48250
|
142 |
(* Reject theorems with names like "List.filter.filter_list_def" or
|
blanchet@48250
|
143 |
"Accessible_Part.acc.defs", as these are definitions arising from packages. *)
|
blanchet@50736
|
144 |
fun is_package_def s =
|
blanchet@50736
|
145 |
let val ss = Long_Name.explode s in
|
blanchet@50736
|
146 |
length ss > 2 andalso not (hd ss = "local") andalso
|
blanchet@50736
|
147 |
exists (fn suf => String.isSuffix suf s)
|
blanchet@50736
|
148 |
["_case_def", "_rec_def", "_size_def", "_size_overloaded_def"]
|
blanchet@48250
|
149 |
end
|
blanchet@48250
|
150 |
|
blanchet@48250
|
151 |
(* FIXME: put other record thms here, or declare as "no_atp" *)
|
blanchet@48250
|
152 |
fun multi_base_blacklist ctxt ho_atp =
|
blanchet@48250
|
153 |
["defs", "select_defs", "update_defs", "split", "splits", "split_asm",
|
blanchet@50442
|
154 |
"ext_cases", "eq.simps", "eq.refl", "nchotomy", "case_cong",
|
blanchet@48440
|
155 |
"weak_case_cong", "nibble_pair_of_char_simps", "nibble.simps",
|
blanchet@48440
|
156 |
"nibble.distinct"]
|
blanchet@48250
|
157 |
|> not (ho_atp orelse (Config.get ctxt instantiate_inducts)) ?
|
blanchet@48250
|
158 |
append ["induct", "inducts"]
|
blanchet@48440
|
159 |
|> map (prefix Long_Name.separator)
|
blanchet@48250
|
160 |
|
blanchet@50490
|
161 |
val max_lambda_nesting = 5 (*only applies if not ho_atp*)
|
blanchet@48250
|
162 |
|
blanchet@48250
|
163 |
fun term_has_too_many_lambdas max (t1 $ t2) =
|
blanchet@48250
|
164 |
exists (term_has_too_many_lambdas max) [t1, t2]
|
blanchet@48250
|
165 |
| term_has_too_many_lambdas max (Abs (_, _, t)) =
|
blanchet@48250
|
166 |
max = 0 orelse term_has_too_many_lambdas (max - 1) t
|
blanchet@48250
|
167 |
| term_has_too_many_lambdas _ _ = false
|
blanchet@48250
|
168 |
|
blanchet@48250
|
169 |
(* Don't count nested lambdas at the level of formulas, since they are
|
blanchet@48250
|
170 |
quantifiers. *)
|
blanchet@48437
|
171 |
fun formula_has_too_many_lambdas Ts (Abs (_, T, t)) =
|
blanchet@48437
|
172 |
formula_has_too_many_lambdas (T :: Ts) t
|
blanchet@48437
|
173 |
| formula_has_too_many_lambdas Ts t =
|
blanchet@48250
|
174 |
if member (op =) [HOLogic.boolT, propT] (fastype_of1 (Ts, t)) then
|
blanchet@48437
|
175 |
exists (formula_has_too_many_lambdas Ts) (#2 (strip_comb t))
|
blanchet@48250
|
176 |
else
|
blanchet@48250
|
177 |
term_has_too_many_lambdas max_lambda_nesting t
|
blanchet@48250
|
178 |
|
blanchet@50523
|
179 |
(* The maximum apply depth of any "metis" call in "Metis_Examples" (on
|
blanchet@50523
|
180 |
2007-10-31) was 11. *)
|
blanchet@50490
|
181 |
val max_apply_depth = 18
|
blanchet@48250
|
182 |
|
blanchet@48250
|
183 |
fun apply_depth (f $ t) = Int.max (apply_depth f, apply_depth t + 1)
|
blanchet@48250
|
184 |
| apply_depth (Abs (_, _, t)) = apply_depth t
|
blanchet@48250
|
185 |
| apply_depth _ = 0
|
blanchet@48250
|
186 |
|
blanchet@50512
|
187 |
fun is_too_complex ho_atp t =
|
blanchet@48437
|
188 |
apply_depth t > max_apply_depth orelse
|
blanchet@48437
|
189 |
(not ho_atp andalso formula_has_too_many_lambdas [] t)
|
blanchet@48250
|
190 |
|
blanchet@48667
|
191 |
(* FIXME: Ad hoc list *)
|
blanchet@48667
|
192 |
val technical_prefixes =
|
blanchet@50736
|
193 |
["ATP", "Code_Evaluation", "Datatype", "DSequence", "Enum", "Lazy_Sequence",
|
blanchet@50736
|
194 |
"Meson", "Metis", "Nitpick", "New_DSequence", "New_Random_Sequence",
|
blanchet@50736
|
195 |
"Quickcheck", "Quickcheck_Exhaustive", "Quickcheck_Narrowing",
|
blanchet@50736
|
196 |
"Random_Sequence", "Sledgehammer", "SMT"]
|
blanchet@48667
|
197 |
|> map (suffix Long_Name.separator)
|
blanchet@48440
|
198 |
|
blanchet@48667
|
199 |
fun has_technical_prefix s =
|
blanchet@48667
|
200 |
exists (fn pref => String.isPrefix pref s) technical_prefixes
|
blanchet@48667
|
201 |
val exists_technical_const = exists_Const (has_technical_prefix o fst)
|
blanchet@48250
|
202 |
|
blanchet@48250
|
203 |
(* FIXME: make more reliable *)
|
blanchet@48250
|
204 |
val exists_low_level_class_const =
|
blanchet@48250
|
205 |
exists_Const (fn (s, _) =>
|
blanchet@48250
|
206 |
s = @{const_name equal_class.equal} orelse
|
blanchet@48250
|
207 |
String.isSubstring (Long_Name.separator ^ "class" ^ Long_Name.separator) s)
|
blanchet@48250
|
208 |
|
blanchet@48250
|
209 |
fun is_that_fact th =
|
blanchet@48250
|
210 |
String.isSuffix (Long_Name.separator ^ Obtain.thatN) (Thm.get_name_hint th)
|
blanchet@48250
|
211 |
andalso exists_subterm (fn Free (s, _) => s = Name.skolem Auto_Bind.thesisN
|
blanchet@48250
|
212 |
| _ => false) (prop_of th)
|
blanchet@48250
|
213 |
|
blanchet@50523
|
214 |
fun is_likely_tautology_too_meta_or_too_technical th =
|
blanchet@48406
|
215 |
let
|
blanchet@50053
|
216 |
fun is_interesting_subterm (Const (s, _)) =
|
blanchet@50053
|
217 |
not (member (op =) atp_widely_irrelevant_consts s)
|
blanchet@50053
|
218 |
| is_interesting_subterm (Free _) = true
|
blanchet@50053
|
219 |
| is_interesting_subterm _ = false
|
blanchet@48406
|
220 |
fun is_boring_bool t =
|
blanchet@50053
|
221 |
not (exists_subterm is_interesting_subterm t) orelse
|
blanchet@48406
|
222 |
exists_type (exists_subtype (curry (op =) @{typ prop})) t
|
blanchet@50495
|
223 |
fun is_boring_prop _ (@{const Trueprop} $ t) = is_boring_bool t
|
blanchet@50495
|
224 |
| is_boring_prop Ts (@{const "==>"} $ t $ u) =
|
blanchet@50495
|
225 |
is_boring_prop Ts t andalso is_boring_prop Ts u
|
blanchet@50496
|
226 |
| is_boring_prop Ts (Const (@{const_name all}, _) $ Abs (_, T, t)) =
|
blanchet@50496
|
227 |
is_boring_prop (T :: Ts) t
|
blanchet@50495
|
228 |
| is_boring_prop Ts ((t as Const (@{const_name all}, _)) $ u) =
|
blanchet@50495
|
229 |
is_boring_prop Ts (t $ eta_expand Ts u 1)
|
blanchet@50495
|
230 |
| is_boring_prop _ (Const (@{const_name "=="}, _) $ t $ u) =
|
blanchet@48406
|
231 |
is_boring_bool t andalso is_boring_bool u
|
blanchet@50495
|
232 |
| is_boring_prop _ _ = true
|
blanchet@50523
|
233 |
val t = prop_of th
|
blanchet@48406
|
234 |
in
|
blanchet@50523
|
235 |
(is_boring_prop [] (prop_of th) andalso
|
blanchet@50523
|
236 |
not (Thm.eq_thm_prop (@{thm ext}, th))) orelse
|
blanchet@48667
|
237 |
exists_type type_has_top_sort t orelse exists_technical_const t orelse
|
blanchet@48667
|
238 |
exists_low_level_class_const t orelse is_that_fact th
|
blanchet@48438
|
239 |
end
|
blanchet@48438
|
240 |
|
blanchet@50511
|
241 |
fun is_blacklisted_or_something ctxt ho_atp name =
|
blanchet@50510
|
242 |
(not (Config.get ctxt ignore_no_atp) andalso is_package_def name) orelse
|
blanchet@50510
|
243 |
exists (fn s => String.isSuffix s name) (multi_base_blacklist ctxt ho_atp)
|
blanchet@50510
|
244 |
|
blanchet@50048
|
245 |
fun hackish_string_for_term ctxt =
|
blanchet@50049
|
246 |
with_vanilla_print_mode (Syntax.string_of_term ctxt) #> simplify_spaces
|
blanchet@48250
|
247 |
|
blanchet@48250
|
248 |
(* This is a terrible hack. Free variables are sometimes coded as "M__" when
|
blanchet@48250
|
249 |
they are displayed as "M" and we want to avoid clashes with these. But
|
blanchet@48250
|
250 |
sometimes it's even worse: "Ma__" encodes "M". So we simply reserve all
|
blanchet@48250
|
251 |
prefixes of all free variables. In the worse case scenario, where the fact
|
blanchet@49981
|
252 |
won't be resolved correctly, the user can fix it manually, e.g., by giving a
|
blanchet@49981
|
253 |
name to the offending fact. *)
|
blanchet@48250
|
254 |
fun all_prefixes_of s =
|
blanchet@48250
|
255 |
map (fn i => String.extract (s, 0, SOME i)) (1 upto size s - 1)
|
blanchet@48250
|
256 |
|
blanchet@48250
|
257 |
fun close_form t =
|
blanchet@48250
|
258 |
(t, [] |> Term.add_free_names t |> maps all_prefixes_of)
|
blanchet@48250
|
259 |
|> fold (fn ((s, i), T) => fn (t', taken) =>
|
blanchet@48250
|
260 |
let val s' = singleton (Name.variant_list taken) s in
|
blanchet@48250
|
261 |
((if fastype_of t' = HOLogic.boolT then HOLogic.all_const
|
blanchet@48250
|
262 |
else Logic.all_const) T
|
blanchet@48250
|
263 |
$ Abs (s', T, abstract_over (Var ((s, i), T), t')),
|
blanchet@48250
|
264 |
s' :: taken)
|
blanchet@48250
|
265 |
end)
|
blanchet@48250
|
266 |
(Term.add_vars t [] |> sort_wrt (fst o fst))
|
blanchet@48250
|
267 |
|> fst
|
blanchet@48250
|
268 |
|
blanchet@50047
|
269 |
fun backquote_term ctxt t =
|
blanchet@48400
|
270 |
t |> close_form
|
blanchet@50047
|
271 |
|> hackish_string_for_term ctxt
|
blanchet@48400
|
272 |
|> backquote
|
blanchet@48400
|
273 |
|
blanchet@50047
|
274 |
fun backquote_thm ctxt th = backquote_term ctxt (prop_of th)
|
blanchet@48394
|
275 |
|
blanchet@48250
|
276 |
fun clasimpset_rule_table_of ctxt =
|
blanchet@48250
|
277 |
let
|
blanchet@48250
|
278 |
val thy = Proof_Context.theory_of ctxt
|
blanchet@48250
|
279 |
val atomize = HOLogic.mk_Trueprop o Object_Logic.atomize_term thy
|
blanchet@48250
|
280 |
fun add stature normalizers get_th =
|
blanchet@48250
|
281 |
fold (fn rule =>
|
blanchet@48250
|
282 |
let
|
blanchet@48250
|
283 |
val th = rule |> get_th
|
blanchet@48250
|
284 |
val t =
|
blanchet@48250
|
285 |
th |> Thm.maxidx_of th > 0 ? zero_var_indexes |> prop_of
|
blanchet@48250
|
286 |
in
|
blanchet@48250
|
287 |
fold (fn normalize => Termtab.update (normalize t, stature))
|
blanchet@48250
|
288 |
(I :: normalizers)
|
blanchet@48250
|
289 |
end)
|
blanchet@48250
|
290 |
val {safeIs, (* safeEs, *) hazIs, (* hazEs, *) ...} =
|
blanchet@48250
|
291 |
ctxt |> claset_of |> Classical.rep_cs
|
blanchet@48250
|
292 |
val intros = Item_Net.content safeIs @ Item_Net.content hazIs
|
blanchet@48250
|
293 |
(* Add once it is used:
|
blanchet@48250
|
294 |
val elims =
|
blanchet@48250
|
295 |
Item_Net.content safeEs @ Item_Net.content hazEs
|
blanchet@48250
|
296 |
|> map Classical.classical_rule
|
blanchet@48250
|
297 |
*)
|
blanchet@48250
|
298 |
val simps = ctxt |> simpset_of |> dest_ss |> #simps
|
blanchet@48250
|
299 |
val specs = ctxt |> Spec_Rules.get
|
blanchet@48250
|
300 |
val (rec_defs, nonrec_defs) =
|
blanchet@48250
|
301 |
specs |> filter (curry (op =) Spec_Rules.Equational o fst)
|
blanchet@48250
|
302 |
|> maps (snd o snd)
|
blanchet@48250
|
303 |
|> filter_out (member Thm.eq_thm_prop risky_defs)
|
blanchet@48250
|
304 |
|> List.partition (is_rec_def o prop_of)
|
blanchet@48250
|
305 |
val spec_intros =
|
blanchet@48250
|
306 |
specs |> filter (member (op =) [Spec_Rules.Inductive,
|
blanchet@48250
|
307 |
Spec_Rules.Co_Inductive] o fst)
|
blanchet@48250
|
308 |
|> maps (snd o snd)
|
blanchet@48250
|
309 |
in
|
blanchet@48250
|
310 |
Termtab.empty |> add Simp [atomize] snd simps
|
blanchet@48438
|
311 |
|> add Rec_Def [] I rec_defs
|
blanchet@48438
|
312 |
|> add Non_Rec_Def [] I nonrec_defs
|
blanchet@48250
|
313 |
(* Add once it is used:
|
blanchet@48250
|
314 |
|> add Elim [] I elims
|
blanchet@48250
|
315 |
*)
|
blanchet@48250
|
316 |
|> add Intro [] I intros
|
blanchet@48250
|
317 |
|> add Inductive [] I spec_intros
|
blanchet@48250
|
318 |
end
|
blanchet@48250
|
319 |
|
blanchet@50481
|
320 |
fun normalize_eq (t as @{const Trueprop}
|
blanchet@50481
|
321 |
$ ((t0 as Const (@{const_name HOL.eq}, _)) $ t1 $ t2)) =
|
blanchet@50481
|
322 |
if Term_Ord.fast_term_ord (t1, t2) <> GREATER then t
|
blanchet@50481
|
323 |
else HOLogic.mk_Trueprop (t0 $ t2 $ t1)
|
blanchet@50481
|
324 |
| normalize_eq (t as @{const Trueprop} $ (@{const Not}
|
blanchet@50481
|
325 |
$ ((t0 as Const (@{const_name HOL.eq}, _)) $ t1 $ t2))) =
|
blanchet@50481
|
326 |
if Term_Ord.fast_term_ord (t1, t2) <> GREATER then t
|
blanchet@50481
|
327 |
else HOLogic.mk_Trueprop (HOLogic.mk_not (t0 $ t2 $ t1))
|
blanchet@50481
|
328 |
| normalize_eq t = t
|
blanchet@50481
|
329 |
|
blanchet@50485
|
330 |
val normalize_eq_etc = normalize_eq o Term_Subst.zero_var_indexes
|
blanchet@50485
|
331 |
|
blanchet@50485
|
332 |
fun if_thm_before th th' =
|
blanchet@50485
|
333 |
if Theory.subthy (pairself Thm.theory_of_thm (th, th')) then th else th'
|
blanchet@50485
|
334 |
|
blanchet@50734
|
335 |
(* Hack: Conflate the facts about a class as seen from the outside with the
|
blanchet@50734
|
336 |
corresponding low-level facts, so that MaSh can learn from the low-level
|
blanchet@50734
|
337 |
proofs. *)
|
blanchet@50734
|
338 |
fun un_class_ify s =
|
blanchet@50734
|
339 |
case first_field "_class" s of
|
blanchet@50734
|
340 |
SOME (pref, suf) => [s, pref ^ suf]
|
blanchet@50734
|
341 |
| NONE => [s]
|
blanchet@50734
|
342 |
|
blanchet@50735
|
343 |
fun build_name_tables name_of facts =
|
blanchet@50733
|
344 |
let
|
blanchet@50733
|
345 |
fun cons_thm (_, th) = Termtab.cons_list (normalize_eq_etc (prop_of th), th)
|
blanchet@50735
|
346 |
fun add_plain canon alias =
|
blanchet@50815
|
347 |
Symtab.update (Thm.get_name_hint alias,
|
blanchet@50735
|
348 |
name_of (if_thm_before canon alias))
|
blanchet@50735
|
349 |
fun add_plains (_, aliases as canon :: _) = fold (add_plain canon) aliases
|
blanchet@50735
|
350 |
fun add_inclass (name, target) =
|
blanchet@50735
|
351 |
fold (fn s => Symtab.update (s, target)) (un_class_ify name)
|
blanchet@50815
|
352 |
val prop_tab = fold cons_thm facts Termtab.empty
|
blanchet@50735
|
353 |
val plain_name_tab = Termtab.fold add_plains prop_tab Symtab.empty
|
blanchet@50735
|
354 |
val inclass_name_tab = Symtab.fold add_inclass plain_name_tab Symtab.empty
|
blanchet@50735
|
355 |
in (plain_name_tab, inclass_name_tab) end
|
blanchet@50485
|
356 |
|
blanchet@50485
|
357 |
fun uniquify facts =
|
blanchet@48250
|
358 |
Termtab.fold (cons o snd)
|
blanchet@50485
|
359 |
(fold (Termtab.default o `(normalize_eq_etc o prop_of o snd)) facts
|
blanchet@50481
|
360 |
Termtab.empty) []
|
blanchet@48250
|
361 |
|
blanchet@48250
|
362 |
fun struct_induct_rule_on th =
|
blanchet@48250
|
363 |
case Logic.strip_horn (prop_of th) of
|
blanchet@48250
|
364 |
(prems, @{const Trueprop}
|
blanchet@48250
|
365 |
$ ((p as Var ((p_name, 0), _)) $ (a as Var (_, ind_T)))) =>
|
blanchet@48250
|
366 |
if not (is_TVar ind_T) andalso length prems > 1 andalso
|
blanchet@48250
|
367 |
exists (exists_subterm (curry (op aconv) p)) prems andalso
|
blanchet@48250
|
368 |
not (exists (exists_subterm (curry (op aconv) a)) prems) then
|
blanchet@48250
|
369 |
SOME (p_name, ind_T)
|
blanchet@48250
|
370 |
else
|
blanchet@48250
|
371 |
NONE
|
blanchet@48250
|
372 |
| _ => NONE
|
blanchet@48250
|
373 |
|
blanchet@50586
|
374 |
val instantiate_induct_timeout = seconds 0.01
|
blanchet@50586
|
375 |
|
blanchet@48250
|
376 |
fun instantiate_induct_rule ctxt concl_prop p_name ((name, stature), th) ind_x =
|
blanchet@48250
|
377 |
let
|
blanchet@48250
|
378 |
fun varify_noninducts (t as Free (s, T)) =
|
blanchet@48250
|
379 |
if (s, T) = ind_x orelse can dest_funT T then t else Var ((s, 0), T)
|
blanchet@48250
|
380 |
| varify_noninducts t = t
|
blanchet@48250
|
381 |
val p_inst =
|
blanchet@48250
|
382 |
concl_prop |> map_aterms varify_noninducts |> close_form
|
blanchet@48250
|
383 |
|> lambda (Free ind_x)
|
blanchet@50047
|
384 |
|> hackish_string_for_term ctxt
|
blanchet@48250
|
385 |
in
|
blanchet@48250
|
386 |
((fn () => name () ^ "[where " ^ p_name ^ " = " ^ quote p_inst ^ "]",
|
blanchet@48250
|
387 |
stature), th |> read_instantiate ctxt [((p_name, 0), p_inst)])
|
blanchet@48250
|
388 |
end
|
blanchet@48250
|
389 |
|
blanchet@48250
|
390 |
fun type_match thy (T1, T2) =
|
blanchet@48250
|
391 |
(Sign.typ_match thy (T2, T1) Vartab.empty; true)
|
blanchet@48250
|
392 |
handle Type.TYPE_MATCH => false
|
blanchet@48250
|
393 |
|
blanchet@48250
|
394 |
fun instantiate_if_induct_rule ctxt stmt stmt_xs (ax as (_, th)) =
|
blanchet@48250
|
395 |
case struct_induct_rule_on th of
|
blanchet@48250
|
396 |
SOME (p_name, ind_T) =>
|
blanchet@48250
|
397 |
let val thy = Proof_Context.theory_of ctxt in
|
blanchet@48250
|
398 |
stmt_xs |> filter (fn (_, T) => type_match thy (T, ind_T))
|
blanchet@50586
|
399 |
|> map_filter (try (TimeLimit.timeLimit instantiate_induct_timeout
|
blanchet@50586
|
400 |
(instantiate_induct_rule ctxt stmt p_name ax)))
|
blanchet@48250
|
401 |
end
|
blanchet@48250
|
402 |
| NONE => [ax]
|
blanchet@48250
|
403 |
|
blanchet@48250
|
404 |
fun external_frees t =
|
blanchet@48250
|
405 |
[] |> Term.add_frees t |> filter_out (can Name.dest_internal o fst)
|
blanchet@48250
|
406 |
|
blanchet@48250
|
407 |
fun maybe_instantiate_inducts ctxt hyp_ts concl_t =
|
blanchet@48250
|
408 |
if Config.get ctxt instantiate_inducts then
|
blanchet@48250
|
409 |
let
|
blanchet@48250
|
410 |
val thy = Proof_Context.theory_of ctxt
|
blanchet@48250
|
411 |
val ind_stmt =
|
blanchet@48250
|
412 |
(hyp_ts |> filter_out (null o external_frees), concl_t)
|
blanchet@48250
|
413 |
|> Logic.list_implies |> Object_Logic.atomize_term thy
|
blanchet@48250
|
414 |
val ind_stmt_xs = external_frees ind_stmt
|
blanchet@48250
|
415 |
in maps (instantiate_if_induct_rule ctxt ind_stmt ind_stmt_xs) end
|
blanchet@48250
|
416 |
else
|
blanchet@48250
|
417 |
I
|
blanchet@48250
|
418 |
|
blanchet@48250
|
419 |
fun maybe_filter_no_atps ctxt =
|
blanchet@48250
|
420 |
not (Config.get ctxt ignore_no_atp) ? filter_out (No_ATPs.member ctxt o snd)
|
blanchet@48250
|
421 |
|
blanchet@50523
|
422 |
fun all_facts ctxt generous ho_atp reserved add_ths chained css =
|
blanchet@48251
|
423 |
let
|
blanchet@48251
|
424 |
val thy = Proof_Context.theory_of ctxt
|
blanchet@48251
|
425 |
val global_facts = Global_Theory.facts_of thy
|
blanchet@48251
|
426 |
val local_facts = Proof_Context.facts_of ctxt
|
blanchet@48251
|
427 |
val named_locals = local_facts |> Facts.dest_static []
|
blanchet@48251
|
428 |
val assms = Assumption.all_assms_of ctxt
|
blanchet@48251
|
429 |
fun is_good_unnamed_local th =
|
blanchet@48251
|
430 |
not (Thm.has_name_hint th) andalso
|
blanchet@48251
|
431 |
forall (fn (_, ths) => not (member Thm.eq_thm_prop ths th)) named_locals
|
blanchet@48251
|
432 |
val unnamed_locals =
|
blanchet@48396
|
433 |
union Thm.eq_thm_prop (Facts.props local_facts) chained
|
blanchet@48251
|
434 |
|> filter is_good_unnamed_local |> map (pair "" o single)
|
blanchet@48251
|
435 |
val full_space =
|
blanchet@48251
|
436 |
Name_Space.merge (Facts.space_of global_facts, Facts.space_of local_facts)
|
blanchet@48251
|
437 |
fun add_facts global foldx facts =
|
blanchet@48251
|
438 |
foldx (fn (name0, ths) =>
|
blanchet@50512
|
439 |
if name0 <> "" andalso
|
blanchet@48251
|
440 |
forall (not o member Thm.eq_thm_prop add_ths) ths andalso
|
blanchet@50511
|
441 |
(Facts.is_concealed facts name0 orelse
|
blanchet@50511
|
442 |
not (can (Proof_Context.get_thms ctxt) name0) orelse
|
blanchet@50523
|
443 |
(not generous andalso
|
blanchet@50512
|
444 |
is_blacklisted_or_something ctxt ho_atp name0)) then
|
blanchet@48251
|
445 |
I
|
blanchet@48251
|
446 |
else
|
blanchet@48251
|
447 |
let
|
blanchet@50485
|
448 |
val n = length ths
|
blanchet@50485
|
449 |
val multi = n > 1
|
blanchet@48251
|
450 |
fun check_thms a =
|
blanchet@48251
|
451 |
case try (Proof_Context.get_thms ctxt) a of
|
blanchet@48251
|
452 |
NONE => false
|
blanchet@48251
|
453 |
| SOME ths' => eq_list Thm.eq_thm_prop (ths, ths')
|
blanchet@48251
|
454 |
in
|
blanchet@50485
|
455 |
pair n
|
blanchet@50756
|
456 |
#> fold_rev (fn th => fn (j, accum) =>
|
blanchet@50485
|
457 |
(j - 1,
|
blanchet@50485
|
458 |
if not (member Thm.eq_thm_prop add_ths th) andalso
|
blanchet@50523
|
459 |
(is_likely_tautology_too_meta_or_too_technical th orelse
|
blanchet@50523
|
460 |
(not generous andalso
|
blanchet@50523
|
461 |
is_too_complex ho_atp (prop_of th))) then
|
blanchet@50756
|
462 |
accum
|
blanchet@50485
|
463 |
else
|
blanchet@50485
|
464 |
let
|
blanchet@50485
|
465 |
val new =
|
blanchet@50485
|
466 |
(((fn () =>
|
blanchet@50485
|
467 |
if name0 = "" then
|
blanchet@50485
|
468 |
backquote_thm ctxt th
|
blanchet@50485
|
469 |
else
|
blanchet@50485
|
470 |
[Facts.extern ctxt facts name0,
|
blanchet@50485
|
471 |
Name_Space.extern ctxt full_space name0]
|
blanchet@50756
|
472 |
|> distinct (op =)
|
blanchet@50485
|
473 |
|> find_first check_thms
|
blanchet@50485
|
474 |
|> the_default name0
|
blanchet@50485
|
475 |
|> make_name reserved multi j),
|
blanchet@50485
|
476 |
stature_of_thm global assms chained css name0 th),
|
blanchet@50485
|
477 |
th)
|
blanchet@50485
|
478 |
in
|
blanchet@50756
|
479 |
accum |> (if multi then apsnd else apfst) (cons new)
|
blanchet@50485
|
480 |
end)) ths
|
blanchet@48251
|
481 |
#> snd
|
blanchet@48251
|
482 |
end)
|
blanchet@48251
|
483 |
in
|
blanchet@50756
|
484 |
(* The single-theorem names go before the multiple-theorem ones (e.g.,
|
blanchet@50756
|
485 |
"xxx" vs. "xxx(3)"), so that single names are preferred when both are
|
blanchet@50756
|
486 |
available. *)
|
blanchet@50756
|
487 |
`I [] |> add_facts false fold local_facts (unnamed_locals @ named_locals)
|
blanchet@50756
|
488 |
|> add_facts true Facts.fold_static global_facts global_facts
|
blanchet@50756
|
489 |
|> op @
|
blanchet@48251
|
490 |
end
|
blanchet@48251
|
491 |
|
blanchet@48396
|
492 |
fun nearly_all_facts ctxt ho_atp {add, del, only} reserved css chained hyp_ts
|
blanchet@48396
|
493 |
concl_t =
|
blanchet@48250
|
494 |
if only andalso null add then
|
blanchet@48250
|
495 |
[]
|
blanchet@48250
|
496 |
else
|
blanchet@48250
|
497 |
let
|
blanchet@48396
|
498 |
val chained =
|
blanchet@48396
|
499 |
chained
|
blanchet@48292
|
500 |
|> maps (fn th => insert Thm.eq_thm_prop (zero_var_indexes th) [th])
|
blanchet@48250
|
501 |
in
|
blanchet@48250
|
502 |
(if only then
|
blanchet@48250
|
503 |
maps (map (fn ((name, stature), th) => ((K name, stature), th))
|
blanchet@48396
|
504 |
o fact_from_ref ctxt reserved chained css) add
|
blanchet@48250
|
505 |
else
|
blanchet@48292
|
506 |
let val (add, del) = pairself (Attrib.eval_thms ctxt) (add, del) in
|
blanchet@50442
|
507 |
all_facts ctxt false ho_atp reserved add chained css
|
blanchet@48292
|
508 |
|> filter_out (member Thm.eq_thm_prop del o snd)
|
blanchet@48292
|
509 |
|> maybe_filter_no_atps ctxt
|
blanchet@48332
|
510 |
|> uniquify
|
blanchet@48292
|
511 |
end)
|
blanchet@48250
|
512 |
|> maybe_instantiate_inducts ctxt hyp_ts concl_t
|
blanchet@48250
|
513 |
end
|
blanchet@48250
|
514 |
|
blanchet@48250
|
515 |
end;
|