author | wenzelm |
Fri, 13 May 2011 15:55:32 +0200 | |
changeset 42791 | 36f787ae5f70 |
parent 42790 | e07e56300faa |
child 42792 | 85fb70b0c5e8 |
permissions | -rw-r--r-- |
9938 | 1 |
(* Title: Provers/classical.ML |
2 |
Author: Lawrence C Paulson, Cambridge University Computer Laboratory |
|
0 | 3 |
|
4 |
Theorem prover for classical reasoning, including predicate calculus, set |
|
5 |
theory, etc. |
|
6 |
||
9563
216d053992a5
fixed classification of rules in atts and modifiers (final!?);
wenzelm
parents:
9513
diff
changeset
|
7 |
Rules must be classified as intro, elim, safe, hazardous (unsafe). |
0 | 8 |
|
9 |
A rule is unsafe unless it can be applied blindly without harmful results. |
|
10 |
For a rule to be safe, its premises and conclusion should be logically |
|
11 |
equivalent. There should be no variables in the premises that are not in |
|
12 |
the conclusion. |
|
13 |
*) |
|
14 |
||
4079
9df5e4f22d96
new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents:
4066
diff
changeset
|
15 |
(*higher precedence than := facilitates use of references*) |
12376
480303e3fa08
simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents:
12362
diff
changeset
|
16 |
infix 4 addSIs addSEs addSDs addIs addEs addDs delrules |
4651 | 17 |
addSWrapper delSWrapper addWrapper delWrapper |
11181
d04f57b91166
renamed addaltern to addafter, addSaltern to addSafter
oheimb
parents:
11168
diff
changeset
|
18 |
addSbefore addSafter addbefore addafter |
5523 | 19 |
addD2 addE2 addSD2 addSE2; |
4079
9df5e4f22d96
new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents:
4066
diff
changeset
|
20 |
|
9df5e4f22d96
new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents:
4066
diff
changeset
|
21 |
|
9df5e4f22d96
new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents:
4066
diff
changeset
|
22 |
(*should be a type abbreviation in signature CLASSICAL*) |
9df5e4f22d96
new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents:
4066
diff
changeset
|
23 |
type netpair = (int * (bool * thm)) Net.net * (int * (bool * thm)) Net.net; |
4651 | 24 |
type wrapper = (int -> tactic) -> (int -> tactic); |
4079
9df5e4f22d96
new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents:
4066
diff
changeset
|
25 |
|
0 | 26 |
signature CLASSICAL_DATA = |
4079
9df5e4f22d96
new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents:
4066
diff
changeset
|
27 |
sig |
42790 | 28 |
val imp_elim: thm (* P --> Q ==> (~ R ==> P) ==> (Q ==> R) ==> R *) |
29 |
val not_elim: thm (* ~P ==> P ==> R *) |
|
30 |
val swap: thm (* ~ P ==> (~ R ==> P) ==> R *) |
|
31 |
val classical: thm (* (~ P ==> P) ==> P *) |
|
32 |
val sizef: thm -> int (* size function for BEST_FIRST *) |
|
0 | 33 |
val hyp_subst_tacs: (int -> tactic) list |
4079
9df5e4f22d96
new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents:
4066
diff
changeset
|
34 |
end; |
0 | 35 |
|
5841 | 36 |
signature BASIC_CLASSICAL = |
4079
9df5e4f22d96
new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents:
4066
diff
changeset
|
37 |
sig |
0 | 38 |
type claset |
4079
9df5e4f22d96
new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents:
4066
diff
changeset
|
39 |
val empty_cs: claset |
42439
9efdd0af15ac
eliminated Display.string_of_thm_without_context;
wenzelm
parents:
42361
diff
changeset
|
40 |
val print_cs: Proof.context -> claset -> unit |
42790 | 41 |
val rep_cs: claset -> |
42 |
{safeIs: thm list, |
|
43 |
safeEs: thm list, |
|
44 |
hazIs: thm list, |
|
45 |
hazEs: thm list, |
|
46 |
swrappers: (string * wrapper) list, |
|
47 |
uwrappers: (string * wrapper) list, |
|
48 |
safe0_netpair: netpair, |
|
49 |
safep_netpair: netpair, |
|
50 |
haz_netpair: netpair, |
|
51 |
dup_netpair: netpair, |
|
52 |
xtra_netpair: Context_Rules.netpair} |
|
53 |
val merge_cs: claset * claset -> claset |
|
54 |
val addDs: claset * thm list -> claset |
|
55 |
val addEs: claset * thm list -> claset |
|
56 |
val addIs: claset * thm list -> claset |
|
57 |
val addSDs: claset * thm list -> claset |
|
58 |
val addSEs: claset * thm list -> claset |
|
59 |
val addSIs: claset * thm list -> claset |
|
60 |
val delrules: claset * thm list -> claset |
|
61 |
val addSWrapper: claset * (string * wrapper) -> claset |
|
62 |
val delSWrapper: claset * string -> claset |
|
63 |
val addWrapper: claset * (string * wrapper) -> claset |
|
64 |
val delWrapper: claset * string -> claset |
|
65 |
val addSbefore: claset * (string * (int -> tactic)) -> claset |
|
66 |
val addSafter: claset * (string * (int -> tactic)) -> claset |
|
67 |
val addbefore: claset * (string * (int -> tactic)) -> claset |
|
68 |
val addafter: claset * (string * (int -> tactic)) -> claset |
|
69 |
val addD2: claset * (string * thm) -> claset |
|
70 |
val addE2: claset * (string * thm) -> claset |
|
71 |
val addSD2: claset * (string * thm) -> claset |
|
72 |
val addSE2: claset * (string * thm) -> claset |
|
73 |
val appSWrappers: claset -> wrapper |
|
74 |
val appWrappers: claset -> wrapper |
|
982
4fe0b642b7d5
Addition of wrappers for integration with the simplifier.
lcp
parents:
747
diff
changeset
|
75 |
|
42790 | 76 |
val global_claset_of: theory -> claset |
77 |
val claset_of: Proof.context -> claset |
|
4079
9df5e4f22d96
new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents:
4066
diff
changeset
|
78 |
|
42790 | 79 |
val fast_tac: claset -> int -> tactic |
80 |
val slow_tac: claset -> int -> tactic |
|
81 |
val astar_tac: claset -> int -> tactic |
|
82 |
val slow_astar_tac: claset -> int -> tactic |
|
83 |
val best_tac: claset -> int -> tactic |
|
84 |
val first_best_tac: claset -> int -> tactic |
|
85 |
val slow_best_tac: claset -> int -> tactic |
|
86 |
val depth_tac: claset -> int -> int -> tactic |
|
87 |
val deepen_tac: claset -> int -> int -> tactic |
|
1587
e7d8a4957bac
Now provides astar versions (thanks to Norbert Voelker)
paulson
parents:
1524
diff
changeset
|
88 |
|
42790 | 89 |
val contr_tac: int -> tactic |
90 |
val dup_elim: thm -> thm |
|
91 |
val dup_intr: thm -> thm |
|
92 |
val dup_step_tac: claset -> int -> tactic |
|
93 |
val eq_mp_tac: int -> tactic |
|
94 |
val haz_step_tac: claset -> int -> tactic |
|
95 |
val joinrules: thm list * thm list -> (bool * thm) list |
|
96 |
val mp_tac: int -> tactic |
|
97 |
val safe_tac: claset -> tactic |
|
98 |
val safe_steps_tac: claset -> int -> tactic |
|
99 |
val safe_step_tac: claset -> int -> tactic |
|
100 |
val clarify_tac: claset -> int -> tactic |
|
101 |
val clarify_step_tac: claset -> int -> tactic |
|
102 |
val step_tac: claset -> int -> tactic |
|
103 |
val slow_step_tac: claset -> int -> tactic |
|
104 |
val swapify: thm list -> thm list |
|
105 |
val swap_res_tac: thm list -> int -> tactic |
|
106 |
val inst_step_tac: claset -> int -> tactic |
|
107 |
val inst0_step_tac: claset -> int -> tactic |
|
108 |
val instp_step_tac: claset -> int -> tactic |
|
4079
9df5e4f22d96
new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents:
4066
diff
changeset
|
109 |
end; |
1724 | 110 |
|
5841 | 111 |
signature CLASSICAL = |
112 |
sig |
|
113 |
include BASIC_CLASSICAL |
|
18534
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset
|
114 |
val classical_rule: thm -> thm |
15036 | 115 |
val add_context_safe_wrapper: string * (Proof.context -> wrapper) -> theory -> theory |
116 |
val del_context_safe_wrapper: string -> theory -> theory |
|
117 |
val add_context_unsafe_wrapper: string * (Proof.context -> wrapper) -> theory -> theory |
|
118 |
val del_context_unsafe_wrapper: string -> theory -> theory |
|
32261 | 119 |
val get_claset: Proof.context -> claset |
120 |
val put_claset: claset -> Proof.context -> Proof.context |
|
24021 | 121 |
val get_cs: Context.generic -> claset |
122 |
val map_cs: (claset -> claset) -> Context.generic -> Context.generic |
|
18728 | 123 |
val safe_dest: int option -> attribute |
124 |
val safe_elim: int option -> attribute |
|
125 |
val safe_intro: int option -> attribute |
|
126 |
val haz_dest: int option -> attribute |
|
127 |
val haz_elim: int option -> attribute |
|
128 |
val haz_intro: int option -> attribute |
|
129 |
val rule_del: attribute |
|
30513 | 130 |
val cla_modifiers: Method.modifier parser list |
35613 | 131 |
val cla_meth: (claset -> tactic) -> Proof.context -> Proof.method |
132 |
val cla_meth': (claset -> int -> tactic) -> Proof.context -> Proof.method |
|
30541 | 133 |
val cla_method: (claset -> tactic) -> (Proof.context -> Proof.method) context_parser |
134 |
val cla_method': (claset -> int -> tactic) -> (Proof.context -> Proof.method) context_parser |
|
18708 | 135 |
val setup: theory -> theory |
5841 | 136 |
end; |
137 |
||
0 | 138 |
|
5927 | 139 |
functor ClassicalFun(Data: CLASSICAL_DATA): CLASSICAL = |
0 | 140 |
struct |
141 |
||
7354 | 142 |
local open Data in |
0 | 143 |
|
18534
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset
|
144 |
(** classical elimination rules **) |
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset
|
145 |
|
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset
|
146 |
(* |
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset
|
147 |
Classical reasoning requires stronger elimination rules. For |
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset
|
148 |
instance, make_elim of Pure transforms the HOL rule injD into |
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset
|
149 |
|
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset
|
150 |
[| inj f; f x = f y; x = y ==> PROP W |] ==> PROP W |
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset
|
151 |
|
26938 | 152 |
Such rules can cause fast_tac to fail and blast_tac to report "PROOF |
18534
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset
|
153 |
FAILED"; classical_rule will strenthen this to |
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset
|
154 |
|
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset
|
155 |
[| inj f; ~ W ==> f x = f y; x = y ==> W |] ==> W |
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset
|
156 |
*) |
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset
|
157 |
|
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset
|
158 |
fun classical_rule rule = |
41581
72a02e3dec7e
clarified pretty_statement: more robust treatment of fixes and conclusion of elimination (e.g. for classical rule);
wenzelm
parents:
36960
diff
changeset
|
159 |
if is_some (Object_Logic.elim_concl rule) then |
18534
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset
|
160 |
let |
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset
|
161 |
val rule' = rule RS classical; |
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset
|
162 |
val concl' = Thm.concl_of rule'; |
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset
|
163 |
fun redundant_hyp goal = |
19257 | 164 |
concl' aconv Logic.strip_assums_concl goal orelse |
18534
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset
|
165 |
(case Logic.strip_assums_hyp goal of |
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset
|
166 |
hyp :: hyps => exists (fn t => t aconv hyp) hyps |
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset
|
167 |
| _ => false); |
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset
|
168 |
val rule'' = |
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset
|
169 |
rule' |> ALLGOALS (SUBGOAL (fn (goal, i) => |
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset
|
170 |
if i = 1 orelse redundant_hyp goal |
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset
|
171 |
then Tactic.etac thin_rl i |
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset
|
172 |
else all_tac)) |
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset
|
173 |
|> Seq.hd |
21963 | 174 |
|> Drule.zero_var_indexes; |
22360
26ead7ed4f4b
moved eq_thm etc. to structure Thm in Pure/more_thm.ML;
wenzelm
parents:
22095
diff
changeset
|
175 |
in if Thm.equiv_thm (rule, rule'') then rule else rule'' end |
18534
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset
|
176 |
else rule; |
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset
|
177 |
|
23594
e65e466dda01
renamed ObjectLogic.atomize_tac to ObjectLogic.atomize_prems_tac;
wenzelm
parents:
23178
diff
changeset
|
178 |
(*flatten nested meta connectives in prems*) |
35625 | 179 |
val flat_rule = Conv.fconv_rule (Conv.prems_conv ~1 Object_Logic.atomize_prems); |
18534
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset
|
180 |
|
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset
|
181 |
|
1800 | 182 |
(*** Useful tactics for classical reasoning ***) |
0 | 183 |
|
10736 | 184 |
(*Prove goal that assumes both P and ~P. |
4392 | 185 |
No backtracking if it finds an equal assumption. Perhaps should call |
186 |
ematch_tac instead of eresolve_tac, but then cannot prove ZF/cantor.*) |
|
10736 | 187 |
val contr_tac = eresolve_tac [not_elim] THEN' |
4392 | 188 |
(eq_assume_tac ORELSE' assume_tac); |
0 | 189 |
|
681
9b02474744ca
Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents:
469
diff
changeset
|
190 |
(*Finds P-->Q and P in the assumptions, replaces implication by Q. |
9b02474744ca
Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents:
469
diff
changeset
|
191 |
Could do the same thing for P<->Q and P... *) |
26412
0918f5c0bbca
pass imp_elim (instead of mp) and swap explicitly -- avoids store_thm;
wenzelm
parents:
24867
diff
changeset
|
192 |
fun mp_tac i = eresolve_tac [not_elim, Data.imp_elim] i THEN assume_tac i; |
0 | 193 |
|
194 |
(*Like mp_tac but instantiates no variables*) |
|
26412
0918f5c0bbca
pass imp_elim (instead of mp) and swap explicitly -- avoids store_thm;
wenzelm
parents:
24867
diff
changeset
|
195 |
fun eq_mp_tac i = ematch_tac [not_elim, Data.imp_elim] i THEN eq_assume_tac i; |
0 | 196 |
|
197 |
(*Creates rules to eliminate ~A, from rules to introduce A*) |
|
26412
0918f5c0bbca
pass imp_elim (instead of mp) and swap explicitly -- avoids store_thm;
wenzelm
parents:
24867
diff
changeset
|
198 |
fun swapify intrs = intrs RLN (2, [Data.swap]); |
30528 | 199 |
val swapped = Thm.rule_attribute (fn _ => fn th => th RSN (2, Data.swap)); |
0 | 200 |
|
201 |
(*Uses introduction rules in the normal way, or on negated assumptions, |
|
202 |
trying rules in order. *) |
|
10736 | 203 |
fun swap_res_tac rls = |
33339 | 204 |
let fun addrl rl brls = (false, rl) :: (true, rl RSN (2, Data.swap)) :: brls |
10736 | 205 |
in assume_tac ORELSE' |
206 |
contr_tac ORELSE' |
|
33339 | 207 |
biresolve_tac (fold_rev addrl rls []) |
0 | 208 |
end; |
209 |
||
681
9b02474744ca
Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents:
469
diff
changeset
|
210 |
(*Duplication of hazardous rules, for complete provers*) |
2689
6d3d893453de
dup_intr & dup_elim no longer call standard -- this
paulson
parents:
2630
diff
changeset
|
211 |
fun dup_intr th = zero_var_indexes (th RS classical); |
681
9b02474744ca
Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents:
469
diff
changeset
|
212 |
|
6967 | 213 |
fun dup_elim th = |
36546 | 214 |
let |
215 |
val rl = (th RSN (2, revcut_rl)) |> Thm.assumption 2 |> Seq.hd; |
|
42361 | 216 |
val ctxt = Proof_Context.init_global (Thm.theory_of_thm rl); |
36546 | 217 |
in rule_by_tactic ctxt (TRYALL (etac revcut_rl)) rl end; |
218 |
||
1073
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset
|
219 |
|
1800 | 220 |
(**** Classical rule sets ****) |
0 | 221 |
|
222 |
datatype claset = |
|
12401 | 223 |
CS of {safeIs : thm list, (*safe introduction rules*) |
224 |
safeEs : thm list, (*safe elimination rules*) |
|
225 |
hazIs : thm list, (*unsafe introduction rules*) |
|
226 |
hazEs : thm list, (*unsafe elimination rules*) |
|
227 |
swrappers : (string * wrapper) list, (*for transforming safe_step_tac*) |
|
9938 | 228 |
uwrappers : (string * wrapper) list, (*for transforming step_tac*) |
12401 | 229 |
safe0_netpair : netpair, (*nets for trivial cases*) |
230 |
safep_netpair : netpair, (*nets for >0 subgoals*) |
|
231 |
haz_netpair : netpair, (*nets for unsafe rules*) |
|
232 |
dup_netpair : netpair, (*nets for duplication*) |
|
33369 | 233 |
xtra_netpair : Context_Rules.netpair}; (*nets for extra rules*) |
0 | 234 |
|
1073
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset
|
235 |
(*Desired invariants are |
9938 | 236 |
safe0_netpair = build safe0_brls, |
237 |
safep_netpair = build safep_brls, |
|
238 |
haz_netpair = build (joinrules(hazIs, hazEs)), |
|
10736 | 239 |
dup_netpair = build (joinrules(map dup_intr hazIs, |
12376
480303e3fa08
simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents:
12362
diff
changeset
|
240 |
map dup_elim hazEs)) |
1073
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset
|
241 |
|
10736 | 242 |
where build = build_netpair(Net.empty,Net.empty), |
1073
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset
|
243 |
safe0_brls contains all brules that solve the subgoal, and |
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset
|
244 |
safep_brls contains all brules that generate 1 or more new subgoals. |
4079
9df5e4f22d96
new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents:
4066
diff
changeset
|
245 |
The theorem lists are largely comments, though they are used in merge_cs and print_cs. |
1073
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset
|
246 |
Nets must be built incrementally, to save space and time. |
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset
|
247 |
*) |
0 | 248 |
|
6502 | 249 |
val empty_netpair = (Net.empty, Net.empty); |
250 |
||
10736 | 251 |
val empty_cs = |
9938 | 252 |
CS{safeIs = [], |
253 |
safeEs = [], |
|
254 |
hazIs = [], |
|
255 |
hazEs = [], |
|
4651 | 256 |
swrappers = [], |
257 |
uwrappers = [], |
|
6502 | 258 |
safe0_netpair = empty_netpair, |
259 |
safep_netpair = empty_netpair, |
|
260 |
haz_netpair = empty_netpair, |
|
6955 | 261 |
dup_netpair = empty_netpair, |
262 |
xtra_netpair = empty_netpair}; |
|
0 | 263 |
|
42439
9efdd0af15ac
eliminated Display.string_of_thm_without_context;
wenzelm
parents:
42361
diff
changeset
|
264 |
fun print_cs ctxt (CS {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers, ...}) = |
9efdd0af15ac
eliminated Display.string_of_thm_without_context;
wenzelm
parents:
42361
diff
changeset
|
265 |
let val pretty_thms = map (Display.pretty_thm ctxt) in |
9760 | 266 |
[Pretty.big_list "safe introduction rules (intro!):" (pretty_thms safeIs), |
267 |
Pretty.big_list "introduction rules (intro):" (pretty_thms hazIs), |
|
268 |
Pretty.big_list "safe elimination rules (elim!):" (pretty_thms safeEs), |
|
15036 | 269 |
Pretty.big_list "elimination rules (elim):" (pretty_thms hazEs), |
270 |
Pretty.strs ("safe wrappers:" :: map #1 swrappers), |
|
271 |
Pretty.strs ("unsafe wrappers:" :: map #1 uwrappers)] |
|
8727 | 272 |
|> Pretty.chunks |> Pretty.writeln |
3546 | 273 |
end; |
0 | 274 |
|
4653 | 275 |
fun rep_cs (CS args) = args; |
1073
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset
|
276 |
|
22674 | 277 |
fun appSWrappers (CS {swrappers, ...}) = fold snd swrappers; |
278 |
fun appWrappers (CS {uwrappers, ...}) = fold snd uwrappers; |
|
1073
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset
|
279 |
|
4079
9df5e4f22d96
new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents:
4066
diff
changeset
|
280 |
|
1800 | 281 |
(*** Adding (un)safe introduction or elimination rules. |
1073
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset
|
282 |
|
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset
|
283 |
In case of overlap, new rules are tried BEFORE old ones!! |
1800 | 284 |
***) |
0 | 285 |
|
12376
480303e3fa08
simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents:
12362
diff
changeset
|
286 |
(*For use with biresolve_tac. Combines intro rules with swap to handle negated |
1073
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset
|
287 |
assumptions. Pairs elim rules with true. *) |
12376
480303e3fa08
simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents:
12362
diff
changeset
|
288 |
fun joinrules (intrs, elims) = |
18557
60a0f9caa0a2
Provers/classical: stricter checks to ensure that supplied intro, dest and
paulson
parents:
18534
diff
changeset
|
289 |
(map (pair true) (elims @ swapify intrs)) @ map (pair false) intrs; |
12376
480303e3fa08
simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents:
12362
diff
changeset
|
290 |
|
12401 | 291 |
fun joinrules' (intrs, elims) = |
18557
60a0f9caa0a2
Provers/classical: stricter checks to ensure that supplied intro, dest and
paulson
parents:
18534
diff
changeset
|
292 |
map (pair true) elims @ map (pair false) intrs; |
1073
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset
|
293 |
|
10736 | 294 |
(*Priority: prefer rules with fewest subgoals, |
1231 | 295 |
then rules added most recently (preferring the head of the list).*) |
1073
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset
|
296 |
fun tag_brls k [] = [] |
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset
|
297 |
| tag_brls k (brl::brls) = |
10736 | 298 |
(1000000*subgoals_of_brl brl + k, brl) :: |
1073
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset
|
299 |
tag_brls (k+1) brls; |
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset
|
300 |
|
12401 | 301 |
fun tag_brls' _ _ [] = [] |
302 |
| tag_brls' w k (brl::brls) = ((w, k), brl) :: tag_brls' w (k + 1) brls; |
|
10736 | 303 |
|
23178 | 304 |
fun insert_tagged_list rls = fold_rev Tactic.insert_tagged_brl rls; |
1073
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset
|
305 |
|
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset
|
306 |
(*Insert into netpair that already has nI intr rules and nE elim rules. |
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset
|
307 |
Count the intr rules double (to account for swapify). Negate to give the |
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset
|
308 |
new insertions the lowest priority.*) |
12376
480303e3fa08
simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents:
12362
diff
changeset
|
309 |
fun insert (nI, nE) = insert_tagged_list o (tag_brls (~(2*nI+nE))) o joinrules; |
12401 | 310 |
fun insert' w (nI, nE) = insert_tagged_list o tag_brls' w (~(nI + nE)) o joinrules'; |
1073
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset
|
311 |
|
23178 | 312 |
fun delete_tagged_list rls = fold_rev Tactic.delete_tagged_brl rls; |
12362 | 313 |
fun delete x = delete_tagged_list (joinrules x); |
12401 | 314 |
fun delete' x = delete_tagged_list (joinrules' x); |
1800 | 315 |
|
22360
26ead7ed4f4b
moved eq_thm etc. to structure Thm in Pure/more_thm.ML;
wenzelm
parents:
22095
diff
changeset
|
316 |
val mem_thm = member Thm.eq_thm_prop |
26ead7ed4f4b
moved eq_thm etc. to structure Thm in Pure/more_thm.ML;
wenzelm
parents:
22095
diff
changeset
|
317 |
and rem_thm = remove Thm.eq_thm_prop; |
2813
cc4c816dafdc
delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents:
2689
diff
changeset
|
318 |
|
42790 | 319 |
fun warn msg rules th = |
320 |
mem_thm rules th andalso (warning (msg ^ Display.string_of_thm_without_context th); true); |
|
321 |
||
322 |
fun warn_other th (CS{safeIs, safeEs, hazIs, hazEs, ...}) = |
|
323 |
warn "Rule already declared as safe introduction (intro!)\n" safeIs th orelse |
|
324 |
warn "Rule already declared as safe elimination (elim!)\n" safeEs th orelse |
|
325 |
warn "Rule already declared as introduction (intro)\n" hazIs th orelse |
|
326 |
warn "Rule already declared as elimination (elim)\n" hazEs th; |
|
1927
6f97cb16e453
New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents:
1814
diff
changeset
|
327 |
|
12376
480303e3fa08
simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents:
12362
diff
changeset
|
328 |
|
1800 | 329 |
(*** Safe rules ***) |
982
4fe0b642b7d5
Addition of wrappers for integration with the simplifier.
lcp
parents:
747
diff
changeset
|
330 |
|
18691 | 331 |
fun addSI w th |
42790 | 332 |
(cs as CS {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers, |
333 |
safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) = |
|
334 |
if warn "Ignoring duplicate safe introduction (intro!)\n" safeIs th then cs |
|
1927
6f97cb16e453
New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents:
1814
diff
changeset
|
335 |
else |
42790 | 336 |
let |
337 |
val th' = flat_rule th; |
|
23594
e65e466dda01
renamed ObjectLogic.atomize_tac to ObjectLogic.atomize_prems_tac;
wenzelm
parents:
23178
diff
changeset
|
338 |
val (safe0_rls, safep_rls) = (*0 subgoals vs 1 or more*) |
42790 | 339 |
List.partition Thm.no_prems [th']; |
340 |
val nI = length safeIs + 1; |
|
341 |
val nE = length safeEs; |
|
342 |
val _ = warn_other th cs; |
|
343 |
in |
|
344 |
CS |
|
345 |
{safeIs = th::safeIs, |
|
1073
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset
|
346 |
safe0_netpair = insert (nI,nE) (safe0_rls, []) safe0_netpair, |
9938 | 347 |
safep_netpair = insert (nI,nE) (safep_rls, []) safep_netpair, |
42790 | 348 |
safeEs = safeEs, |
349 |
hazIs = hazIs, |
|
350 |
hazEs = hazEs, |
|
351 |
swrappers = swrappers, |
|
352 |
uwrappers = uwrappers, |
|
353 |
haz_netpair = haz_netpair, |
|
354 |
dup_netpair = dup_netpair, |
|
18691 | 355 |
xtra_netpair = insert' (the_default 0 w) (nI,nE) ([th], []) xtra_netpair} |
42790 | 356 |
end; |
1073
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset
|
357 |
|
18691 | 358 |
fun addSE w th |
42790 | 359 |
(cs as CS {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers, |
360 |
safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) = |
|
361 |
if warn "Ignoring duplicate safe elimination (elim!)\n" safeEs th then cs |
|
18557
60a0f9caa0a2
Provers/classical: stricter checks to ensure that supplied intro, dest and
paulson
parents:
18534
diff
changeset
|
362 |
else if has_fewer_prems 1 th then |
42790 | 363 |
error ("Ill-formed elimination rule\n" ^ Display.string_of_thm_without_context th) |
1927
6f97cb16e453
New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents:
1814
diff
changeset
|
364 |
else |
42790 | 365 |
let |
366 |
val th' = classical_rule (flat_rule th); |
|
18534
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset
|
367 |
val (safe0_rls, safep_rls) = (*0 subgoals vs 1 or more*) |
42790 | 368 |
List.partition (fn rl => nprems_of rl=1) [th']; |
369 |
val nI = length safeIs; |
|
370 |
val nE = length safeEs + 1; |
|
371 |
val _ = warn_other th cs; |
|
372 |
in |
|
373 |
CS |
|
374 |
{safeEs = th::safeEs, |
|
1073
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset
|
375 |
safe0_netpair = insert (nI,nE) ([], safe0_rls) safe0_netpair, |
9938 | 376 |
safep_netpair = insert (nI,nE) ([], safep_rls) safep_netpair, |
42790 | 377 |
safeIs = safeIs, |
378 |
hazIs = hazIs, |
|
379 |
hazEs = hazEs, |
|
380 |
swrappers = swrappers, |
|
381 |
uwrappers = uwrappers, |
|
382 |
haz_netpair = haz_netpair, |
|
383 |
dup_netpair = dup_netpair, |
|
18691 | 384 |
xtra_netpair = insert' (the_default 0 w) (nI,nE) ([], [th]) xtra_netpair} |
42790 | 385 |
end; |
0 | 386 |
|
1073
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset
|
387 |
|
1800 | 388 |
(*** Hazardous (unsafe) rules ***) |
0 | 389 |
|
18691 | 390 |
fun addI w th |
42790 | 391 |
(cs as CS {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers, |
392 |
safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) = |
|
393 |
if warn "Ignoring duplicate introduction (intro)\n" hazIs th then cs |
|
1927
6f97cb16e453
New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents:
1814
diff
changeset
|
394 |
else |
42790 | 395 |
let |
396 |
val th' = flat_rule th; |
|
397 |
val nI = length hazIs + 1; |
|
398 |
val nE = length hazEs; |
|
399 |
val _ = warn_other th cs; |
|
400 |
in |
|
401 |
CS |
|
402 |
{hazIs = th :: hazIs, |
|
403 |
haz_netpair = insert (nI, nE) ([th'], []) haz_netpair, |
|
404 |
dup_netpair = insert (nI, nE) ([dup_intr th'], []) dup_netpair, |
|
405 |
safeIs = safeIs, |
|
406 |
safeEs = safeEs, |
|
407 |
hazEs = hazEs, |
|
408 |
swrappers = swrappers, |
|
409 |
uwrappers = uwrappers, |
|
9938 | 410 |
safe0_netpair = safe0_netpair, |
411 |
safep_netpair = safep_netpair, |
|
42790 | 412 |
xtra_netpair = insert' (the_default 1 w) (nI, nE) ([th], []) xtra_netpair} |
413 |
end |
|
414 |
handle THM ("RSN: no unifiers", _, _) => (*from dup_intr*) (* FIXME !? *) |
|
415 |
error ("Ill-formed introduction rule\n" ^ Display.string_of_thm_without_context th); |
|
1073
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset
|
416 |
|
18691 | 417 |
fun addE w th |
42790 | 418 |
(cs as CS {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers, |
419 |
safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) = |
|
420 |
if warn "Ignoring duplicate elimination (elim)\n" hazEs th then cs |
|
18557
60a0f9caa0a2
Provers/classical: stricter checks to ensure that supplied intro, dest and
paulson
parents:
18534
diff
changeset
|
421 |
else if has_fewer_prems 1 th then |
42790 | 422 |
error ("Ill-formed elimination rule\n" ^ Display.string_of_thm_without_context th) |
1927
6f97cb16e453
New classical reasoner: warns of, and ignores, redundant rules.
paulson
parents:
1814
diff
changeset
|
423 |
else |
42790 | 424 |
let |
425 |
val th' = classical_rule (flat_rule th); |
|
426 |
val nI = length hazIs; |
|
427 |
val nE = length hazEs + 1; |
|
428 |
val _ = warn_other th cs; |
|
429 |
in |
|
430 |
CS |
|
431 |
{hazEs = th :: hazEs, |
|
432 |
haz_netpair = insert (nI, nE) ([], [th']) haz_netpair, |
|
433 |
dup_netpair = insert (nI, nE) ([], [dup_elim th']) dup_netpair, |
|
434 |
safeIs = safeIs, |
|
435 |
safeEs = safeEs, |
|
436 |
hazIs = hazIs, |
|
437 |
swrappers = swrappers, |
|
438 |
uwrappers = uwrappers, |
|
9938 | 439 |
safe0_netpair = safe0_netpair, |
440 |
safep_netpair = safep_netpair, |
|
42790 | 441 |
xtra_netpair = insert' (the_default 1 w) (nI, nE) ([], [th]) xtra_netpair} |
442 |
end; |
|
0 | 443 |
|
444 |
||
1073
b3f190995bc9
Recoded addSIs, etc., so that nets are built incrementally
lcp
parents:
1010
diff
changeset
|
445 |
|
10736 | 446 |
(*** Deletion of rules |
1800 | 447 |
Working out what to delete, requires repeating much of the code used |
9938 | 448 |
to insert. |
1800 | 449 |
***) |
450 |
||
10736 | 451 |
fun delSI th |
42790 | 452 |
(cs as CS {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers, |
453 |
safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) = |
|
454 |
if mem_thm safeIs th then |
|
18534
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset
|
455 |
let |
42790 | 456 |
val th' = flat_rule th; |
457 |
val (safe0_rls, safep_rls) = List.partition Thm.no_prems [th']; |
|
458 |
in |
|
459 |
CS |
|
460 |
{safe0_netpair = delete (safe0_rls, []) safe0_netpair, |
|
461 |
safep_netpair = delete (safep_rls, []) safep_netpair, |
|
462 |
safeIs = rem_thm th safeIs, |
|
463 |
safeEs = safeEs, |
|
464 |
hazIs = hazIs, |
|
465 |
hazEs = hazEs, |
|
466 |
swrappers = swrappers, |
|
467 |
uwrappers = uwrappers, |
|
468 |
haz_netpair = haz_netpair, |
|
469 |
dup_netpair = dup_netpair, |
|
470 |
xtra_netpair = delete' ([th], []) xtra_netpair} |
|
18534
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset
|
471 |
end |
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset
|
472 |
else cs; |
1800 | 473 |
|
42790 | 474 |
fun delSE th |
475 |
(cs as CS {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers, |
|
476 |
safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) = |
|
477 |
if mem_thm safeEs th then |
|
478 |
let |
|
479 |
val th' = classical_rule (flat_rule th); |
|
480 |
val (safe0_rls, safep_rls) = List.partition (fn rl => nprems_of rl = 1) [th']; |
|
481 |
in |
|
482 |
CS |
|
483 |
{safe0_netpair = delete ([], safe0_rls) safe0_netpair, |
|
484 |
safep_netpair = delete ([], safep_rls) safep_netpair, |
|
485 |
safeIs = safeIs, |
|
486 |
safeEs = rem_thm th safeEs, |
|
487 |
hazIs = hazIs, |
|
488 |
hazEs = hazEs, |
|
489 |
swrappers = swrappers, |
|
490 |
uwrappers = uwrappers, |
|
491 |
haz_netpair = haz_netpair, |
|
492 |
dup_netpair = dup_netpair, |
|
493 |
xtra_netpair = delete' ([], [th]) xtra_netpair} |
|
494 |
end |
|
495 |
else cs; |
|
1800 | 496 |
|
2813
cc4c816dafdc
delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents:
2689
diff
changeset
|
497 |
fun delI th |
42790 | 498 |
(cs as CS {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers, |
499 |
safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) = |
|
500 |
if mem_thm hazIs th then |
|
501 |
let val th' = flat_rule th in |
|
502 |
CS |
|
503 |
{haz_netpair = delete ([th'], []) haz_netpair, |
|
23594
e65e466dda01
renamed ObjectLogic.atomize_tac to ObjectLogic.atomize_prems_tac;
wenzelm
parents:
23178
diff
changeset
|
504 |
dup_netpair = delete ([dup_intr th'], []) dup_netpair, |
42790 | 505 |
safeIs = safeIs, |
506 |
safeEs = safeEs, |
|
507 |
hazIs = rem_thm th hazIs, |
|
508 |
hazEs = hazEs, |
|
509 |
swrappers = swrappers, |
|
510 |
uwrappers = uwrappers, |
|
9938 | 511 |
safe0_netpair = safe0_netpair, |
512 |
safep_netpair = safep_netpair, |
|
12401 | 513 |
xtra_netpair = delete' ([th], []) xtra_netpair} |
23594
e65e466dda01
renamed ObjectLogic.atomize_tac to ObjectLogic.atomize_prems_tac;
wenzelm
parents:
23178
diff
changeset
|
514 |
end |
42790 | 515 |
else cs |
516 |
handle THM ("RSN: no unifiers", _, _) => (*from dup_intr*) (* FIXME !? *) |
|
517 |
error ("Ill-formed introduction rule\n" ^ Display.string_of_thm_without_context th); |
|
1800 | 518 |
|
2813
cc4c816dafdc
delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents:
2689
diff
changeset
|
519 |
fun delE th |
42790 | 520 |
(cs as CS {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers, |
521 |
safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) = |
|
522 |
if mem_thm hazEs th then |
|
523 |
let val th' = classical_rule (flat_rule th) in |
|
524 |
CS |
|
525 |
{haz_netpair = delete ([], [th']) haz_netpair, |
|
18534
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset
|
526 |
dup_netpair = delete ([], [dup_elim th']) dup_netpair, |
42790 | 527 |
safeIs = safeIs, |
528 |
safeEs = safeEs, |
|
529 |
hazIs = hazIs, |
|
530 |
hazEs = rem_thm th hazEs, |
|
531 |
swrappers = swrappers, |
|
532 |
uwrappers = uwrappers, |
|
9938 | 533 |
safe0_netpair = safe0_netpair, |
534 |
safep_netpair = safep_netpair, |
|
12401 | 535 |
xtra_netpair = delete' ([], [th]) xtra_netpair} |
42790 | 536 |
end |
537 |
else cs; |
|
1800 | 538 |
|
2813
cc4c816dafdc
delrules now deletes ALL occurrences of a rule, since it may appear in any of
paulson
parents:
2689
diff
changeset
|
539 |
(*Delete ALL occurrences of "th" in the claset (perhaps from several lists)*) |
18534
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset
|
540 |
fun delrule th (cs as CS {safeIs, safeEs, hazIs, hazEs, ...}) = |
42790 | 541 |
let val th' = Tactic.make_elim th (* FIXME classical make_elim!? *) in |
18691 | 542 |
if mem_thm safeIs th orelse mem_thm safeEs th orelse |
543 |
mem_thm hazIs th orelse mem_thm hazEs th orelse |
|
544 |
mem_thm safeEs th' orelse mem_thm hazEs th' |
|
12376
480303e3fa08
simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents:
12362
diff
changeset
|
545 |
then delSI th (delSE th (delI th (delE th (delSE th' (delE th' cs))))) |
32091
30e2ffbba718
proper context for Display.pretty_thm etc. or old-style versions Display.pretty_thm_global, Display.pretty_thm_without_context etc.;
wenzelm
parents:
31945
diff
changeset
|
546 |
else (warning ("Undeclared classical rule\n" ^ Display.string_of_thm_without_context th); cs) |
9938 | 547 |
end; |
1800 | 548 |
|
18534
6799b38ed872
added classical_rule, which replaces Data.make_elim;
wenzelm
parents:
18374
diff
changeset
|
549 |
fun cs delrules ths = fold delrule ths cs; |
1800 | 550 |
|
551 |
||
42790 | 552 |
fun make_elim th = |
553 |
if has_fewer_prems 1 th then |
|
554 |
error ("Ill-formed destruction rule\n" ^ Display.string_of_thm_without_context th) |
|
555 |
else Tactic.make_elim th; |
|
556 |
||
557 |
fun cs addSIs ths = fold_rev (addSI NONE) ths cs; |
|
558 |
fun cs addSEs ths = fold_rev (addSE NONE) ths cs; |
|
559 |
fun cs addSDs ths = cs addSEs (map make_elim ths); |
|
560 |
fun cs addIs ths = fold_rev (addI NONE) ths cs; |
|
561 |
fun cs addEs ths = fold_rev (addE NONE) ths cs; |
|
562 |
fun cs addDs ths = cs addEs (map make_elim ths); |
|
563 |
||
564 |
||
4767
b9f3468c6ee2
introduced functions for updating the wrapper lists
oheimb
parents:
4765
diff
changeset
|
565 |
(*** Modifying the wrapper tacticals ***) |
22674 | 566 |
fun map_swrappers f |
567 |
(CS {safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers, |
|
568 |
safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) = |
|
569 |
CS {safeIs = safeIs, safeEs = safeEs, hazIs = hazIs, hazEs = hazEs, |
|
4767
b9f3468c6ee2
introduced functions for updating the wrapper lists
oheimb
parents:
4765
diff
changeset
|
570 |
swrappers = f swrappers, uwrappers = uwrappers, |
b9f3468c6ee2
introduced functions for updating the wrapper lists
oheimb
parents:
4765
diff
changeset
|
571 |
safe0_netpair = safe0_netpair, safep_netpair = safep_netpair, |
6955 | 572 |
haz_netpair = haz_netpair, dup_netpair = dup_netpair, xtra_netpair = xtra_netpair}; |
4767
b9f3468c6ee2
introduced functions for updating the wrapper lists
oheimb
parents:
4765
diff
changeset
|
573 |
|
22674 | 574 |
fun map_uwrappers f |
575 |
(CS{safeIs, safeEs, hazIs, hazEs, swrappers, uwrappers, |
|
576 |
safe0_netpair, safep_netpair, haz_netpair, dup_netpair, xtra_netpair}) = |
|
577 |
CS {safeIs = safeIs, safeEs = safeEs, hazIs = hazIs, hazEs = hazEs, |
|
4767
b9f3468c6ee2
introduced functions for updating the wrapper lists
oheimb
parents:
4765
diff
changeset
|
578 |
swrappers = swrappers, uwrappers = f uwrappers, |
b9f3468c6ee2
introduced functions for updating the wrapper lists
oheimb
parents:
4765
diff
changeset
|
579 |
safe0_netpair = safe0_netpair, safep_netpair = safep_netpair, |
6955 | 580 |
haz_netpair = haz_netpair, dup_netpair = dup_netpair, xtra_netpair = xtra_netpair}; |
4767
b9f3468c6ee2
introduced functions for updating the wrapper lists
oheimb
parents:
4765
diff
changeset
|
581 |
|
22674 | 582 |
fun update_warn msg (p as (key : string, _)) xs = |
42790 | 583 |
(if AList.defined (op =) xs key then warning msg else (); AList.update (op =) p xs); |
22674 | 584 |
|
585 |
fun delete_warn msg (key : string) xs = |
|
586 |
if AList.defined (op =) xs key then AList.delete (op =) key xs |
|
42790 | 587 |
else (warning msg; xs); |
982
4fe0b642b7d5
Addition of wrappers for integration with the simplifier.
lcp
parents:
747
diff
changeset
|
588 |
|
4651 | 589 |
(*Add/replace a safe wrapper*) |
22674 | 590 |
fun cs addSWrapper new_swrapper = map_swrappers |
591 |
(update_warn ("Overwriting safe wrapper " ^ fst new_swrapper) new_swrapper) cs; |
|
4651 | 592 |
|
593 |
(*Add/replace an unsafe wrapper*) |
|
22674 | 594 |
fun cs addWrapper new_uwrapper = map_uwrappers |
595 |
(update_warn ("Overwriting unsafe wrapper " ^ fst new_uwrapper) new_uwrapper) cs; |
|
982
4fe0b642b7d5
Addition of wrappers for integration with the simplifier.
lcp
parents:
747
diff
changeset
|
596 |
|
4651 | 597 |
(*Remove a safe wrapper*) |
22674 | 598 |
fun cs delSWrapper name = map_swrappers |
599 |
(delete_warn ("No such safe wrapper in claset: " ^ name) name) cs; |
|
982
4fe0b642b7d5
Addition of wrappers for integration with the simplifier.
lcp
parents:
747
diff
changeset
|
600 |
|
4651 | 601 |
(*Remove an unsafe wrapper*) |
22674 | 602 |
fun cs delWrapper name = map_uwrappers |
603 |
(delete_warn ("No such unsafe wrapper in claset: " ^ name) name) cs; |
|
982
4fe0b642b7d5
Addition of wrappers for integration with the simplifier.
lcp
parents:
747
diff
changeset
|
604 |
|
11168 | 605 |
(* compose a safe tactic alternatively before/after safe_step_tac *) |
42790 | 606 |
fun cs addSbefore (name, tac1) = cs addSWrapper (name, fn tac2 => tac1 ORELSE' tac2); |
607 |
fun cs addSafter (name, tac2) = cs addSWrapper (name, fn tac1 => tac1 ORELSE' tac2); |
|
982
4fe0b642b7d5
Addition of wrappers for integration with the simplifier.
lcp
parents:
747
diff
changeset
|
608 |
|
11168 | 609 |
(*compose a tactic alternatively before/after the step tactic *) |
42790 | 610 |
fun cs addbefore (name, tac1) = cs addWrapper (name, fn tac2 => tac1 APPEND' tac2); |
611 |
fun cs addafter (name, tac2) = cs addWrapper (name, fn tac1 => tac1 APPEND' tac2); |
|
4767
b9f3468c6ee2
introduced functions for updating the wrapper lists
oheimb
parents:
4765
diff
changeset
|
612 |
|
42790 | 613 |
fun cs addD2 (name, thm) = cs addafter (name, datac thm 1); |
614 |
fun cs addE2 (name, thm) = cs addafter (name, eatac thm 1); |
|
615 |
fun cs addSD2 (name, thm) = cs addSafter (name, dmatch_tac [thm] THEN' eq_assume_tac); |
|
616 |
fun cs addSE2 (name, thm) = cs addSafter (name, ematch_tac [thm] THEN' eq_assume_tac); |
|
982
4fe0b642b7d5
Addition of wrappers for integration with the simplifier.
lcp
parents:
747
diff
changeset
|
617 |
|
1711 | 618 |
(*Merge works by adding all new rules of the 2nd claset into the 1st claset. |
619 |
Merging the term nets may look more efficient, but the rather delicate |
|
620 |
treatment of priority might get muddled up.*) |
|
22674 | 621 |
fun merge_cs (cs as CS {safeIs, safeEs, hazIs, hazEs, ...}, |
24358 | 622 |
cs' as CS {safeIs = safeIs2, safeEs = safeEs2, hazIs = hazIs2, hazEs = hazEs2, |
22674 | 623 |
swrappers, uwrappers, ...}) = |
24358 | 624 |
if pointer_eq (cs, cs') then cs |
625 |
else |
|
626 |
let |
|
627 |
val safeIs' = fold rem_thm safeIs safeIs2; |
|
628 |
val safeEs' = fold rem_thm safeEs safeEs2; |
|
629 |
val hazIs' = fold rem_thm hazIs hazIs2; |
|
630 |
val hazEs' = fold rem_thm hazEs hazEs2; |
|
42790 | 631 |
val cs1 = cs addSIs safeIs' addSEs safeEs' addIs hazIs' addEs hazEs'; |
632 |
val cs2 = map_swrappers (fn ws => AList.merge (op =) (K true) (ws, swrappers)) cs1; |
|
633 |
val cs3 = map_uwrappers (fn ws => AList.merge (op =) (K true) (ws, uwrappers)) cs2; |
|
24358 | 634 |
in cs3 end; |
1711 | 635 |
|
982
4fe0b642b7d5
Addition of wrappers for integration with the simplifier.
lcp
parents:
747
diff
changeset
|
636 |
|
1800 | 637 |
(**** Simple tactics for theorem proving ****) |
0 | 638 |
|
639 |
(*Attack subgoals using safe inferences -- matching, not resolution*) |
|
42790 | 640 |
fun safe_step_tac (cs as CS {safe0_netpair, safep_netpair, ...}) = |
4651 | 641 |
appSWrappers cs (FIRST' [ |
9938 | 642 |
eq_assume_tac, |
643 |
eq_mp_tac, |
|
644 |
bimatch_from_nets_tac safe0_netpair, |
|
645 |
FIRST' hyp_subst_tacs, |
|
646 |
bimatch_from_nets_tac safep_netpair]); |
|
0 | 647 |
|
5757 | 648 |
(*Repeatedly attack a subgoal using safe inferences -- it's deterministic!*) |
42790 | 649 |
fun safe_steps_tac cs = |
650 |
REPEAT_DETERM1 o (fn i => COND (has_fewer_prems i) no_tac (safe_step_tac cs i)); |
|
5757 | 651 |
|
0 | 652 |
(*Repeatedly attack subgoals using safe inferences -- it's deterministic!*) |
5757 | 653 |
fun safe_tac cs = REPEAT_DETERM1 (FIRSTGOAL (safe_steps_tac cs)); |
747
bdc066781063
deepen_tac: modified due to outcome of experiments. Its
lcp
parents:
681
diff
changeset
|
654 |
|
3705
76f3b2803982
Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents:
3546
diff
changeset
|
655 |
|
76f3b2803982
Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents:
3546
diff
changeset
|
656 |
(*** Clarify_tac: do safe steps without causing branching ***) |
76f3b2803982
Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents:
3546
diff
changeset
|
657 |
|
42790 | 658 |
fun nsubgoalsP n (k, brl) = (subgoals_of_brl brl = n); |
3705
76f3b2803982
Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents:
3546
diff
changeset
|
659 |
|
76f3b2803982
Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents:
3546
diff
changeset
|
660 |
(*version of bimatch_from_nets_tac that only applies rules that |
76f3b2803982
Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents:
3546
diff
changeset
|
661 |
create precisely n subgoals.*) |
10736 | 662 |
fun n_bimatch_from_nets_tac n = |
42790 | 663 |
biresolution_from_nets_tac (order_list o filter (nsubgoalsP n)) true; |
3705
76f3b2803982
Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents:
3546
diff
changeset
|
664 |
|
76f3b2803982
Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents:
3546
diff
changeset
|
665 |
fun eq_contr_tac i = ematch_tac [not_elim] i THEN eq_assume_tac i; |
76f3b2803982
Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents:
3546
diff
changeset
|
666 |
val eq_assume_contr_tac = eq_assume_tac ORELSE' eq_contr_tac; |
76f3b2803982
Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents:
3546
diff
changeset
|
667 |
|
76f3b2803982
Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents:
3546
diff
changeset
|
668 |
(*Two-way branching is allowed only if one of the branches immediately closes*) |
76f3b2803982
Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents:
3546
diff
changeset
|
669 |
fun bimatch2_tac netpair i = |
42790 | 670 |
n_bimatch_from_nets_tac 2 netpair i THEN |
671 |
(eq_assume_contr_tac i ORELSE eq_assume_contr_tac (i + 1)); |
|
3705
76f3b2803982
Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents:
3546
diff
changeset
|
672 |
|
76f3b2803982
Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents:
3546
diff
changeset
|
673 |
(*Attack subgoals using safe inferences -- matching, not resolution*) |
10736 | 674 |
fun clarify_step_tac (cs as CS{safe0_netpair,safep_netpair,...}) = |
4651 | 675 |
appSWrappers cs (FIRST' [ |
9938 | 676 |
eq_assume_contr_tac, |
677 |
bimatch_from_nets_tac safe0_netpair, |
|
678 |
FIRST' hyp_subst_tacs, |
|
679 |
n_bimatch_from_nets_tac 1 safep_netpair, |
|
3705
76f3b2803982
Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents:
3546
diff
changeset
|
680 |
bimatch2_tac safep_netpair]); |
76f3b2803982
Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents:
3546
diff
changeset
|
681 |
|
76f3b2803982
Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents:
3546
diff
changeset
|
682 |
fun clarify_tac cs = SELECT_GOAL (REPEAT_DETERM (clarify_step_tac cs 1)); |
76f3b2803982
Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents:
3546
diff
changeset
|
683 |
|
76f3b2803982
Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents:
3546
diff
changeset
|
684 |
|
76f3b2803982
Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents:
3546
diff
changeset
|
685 |
(*** Unsafe steps instantiate variables or lose information ***) |
76f3b2803982
Addition of clarify_tac, clarify_step_tac, Clarify_tac, Clarify_step_tac
paulson
parents:
3546
diff
changeset
|
686 |
|
4066 | 687 |
(*Backtracking is allowed among the various these unsafe ways of |
688 |
proving a subgoal. *) |
|
32862 | 689 |
fun inst0_step_tac (CS {safe0_netpair, ...}) = |
690 |
assume_tac APPEND' |
|
691 |
contr_tac APPEND' |
|
747
bdc066781063
deepen_tac: modified due to outcome of experiments. Its
lcp
parents:
681
diff
changeset
|
692 |
biresolve_from_nets_tac safe0_netpair; |
bdc066781063
deepen_tac: modified due to outcome of experiments. Its
lcp
parents:
681
diff
changeset
|
693 |
|
4066 | 694 |
(*These unsafe steps could generate more subgoals.*) |
32862 | 695 |
fun instp_step_tac (CS {safep_netpair, ...}) = |
747
bdc066781063
deepen_tac: modified due to outcome of experiments. Its
lcp
parents:
681
diff
changeset
|
696 |
biresolve_from_nets_tac safep_netpair; |
0 | 697 |
|
698 |
(*These steps could instantiate variables and are therefore unsafe.*) |
|
747
bdc066781063
deepen_tac: modified due to outcome of experiments. Its
lcp
parents:
681
diff
changeset
|
699 |
fun inst_step_tac cs = inst0_step_tac cs APPEND' instp_step_tac cs; |
0 | 700 |
|
10736 | 701 |
fun haz_step_tac (CS{haz_netpair,...}) = |
681
9b02474744ca
Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents:
469
diff
changeset
|
702 |
biresolve_from_nets_tac haz_netpair; |
9b02474744ca
Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents:
469
diff
changeset
|
703 |
|
0 | 704 |
(*Single step for the prover. FAILS unless it makes progress. *) |
42790 | 705 |
fun step_tac cs i = |
706 |
safe_tac cs ORELSE appWrappers cs (inst_step_tac cs ORELSE' haz_step_tac cs) i; |
|
0 | 707 |
|
708 |
(*Using a "safe" rule to instantiate variables is unsafe. This tactic |
|
709 |
allows backtracking from "safe" rules to "unsafe" rules here.*) |
|
42790 | 710 |
fun slow_step_tac cs i = |
711 |
safe_tac cs ORELSE appWrappers cs (inst_step_tac cs APPEND' haz_step_tac cs) i; |
|
0 | 712 |
|
42791
36f787ae5f70
eliminated weight_ASTAR: int Unsynchronized.ref (astar_tac appears to be obsolete anyway);
wenzelm
parents:
42790
diff
changeset
|
713 |
|
1800 | 714 |
(**** The following tactics all fail unless they solve one goal ****) |
0 | 715 |
|
716 |
(*Dumb but fast*) |
|
10382
1fb807260ff1
atomize: all automated tactics that "solve" goals;
wenzelm
parents:
10309
diff
changeset
|
717 |
fun fast_tac cs = |
35625 | 718 |
Object_Logic.atomize_prems_tac THEN' SELECT_GOAL (DEPTH_SOLVE (step_tac cs 1)); |
0 | 719 |
|
720 |
(*Slower but smarter than fast_tac*) |
|
10382
1fb807260ff1
atomize: all automated tactics that "solve" goals;
wenzelm
parents:
10309
diff
changeset
|
721 |
fun best_tac cs = |
35625 | 722 |
Object_Logic.atomize_prems_tac THEN' |
0 | 723 |
SELECT_GOAL (BEST_FIRST (has_fewer_prems 1, sizef) (step_tac cs 1)); |
724 |
||
9402 | 725 |
(*even a bit smarter than best_tac*) |
10382
1fb807260ff1
atomize: all automated tactics that "solve" goals;
wenzelm
parents:
10309
diff
changeset
|
726 |
fun first_best_tac cs = |
35625 | 727 |
Object_Logic.atomize_prems_tac THEN' |
9402 | 728 |
SELECT_GOAL (BEST_FIRST (has_fewer_prems 1, sizef) (FIRSTGOAL (step_tac cs))); |
729 |
||
10382
1fb807260ff1
atomize: all automated tactics that "solve" goals;
wenzelm
parents:
10309
diff
changeset
|
730 |
fun slow_tac cs = |
35625 | 731 |
Object_Logic.atomize_prems_tac THEN' |
10382
1fb807260ff1
atomize: all automated tactics that "solve" goals;
wenzelm
parents:
10309
diff
changeset
|
732 |
SELECT_GOAL (DEPTH_SOLVE (slow_step_tac cs 1)); |
0 | 733 |
|
10382
1fb807260ff1
atomize: all automated tactics that "solve" goals;
wenzelm
parents:
10309
diff
changeset
|
734 |
fun slow_best_tac cs = |
35625 | 735 |
Object_Logic.atomize_prems_tac THEN' |
0 | 736 |
SELECT_GOAL (BEST_FIRST (has_fewer_prems 1, sizef) (slow_step_tac cs 1)); |
737 |
||
681
9b02474744ca
Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents:
469
diff
changeset
|
738 |
|
10736 | 739 |
(***ASTAR with weight weight_ASTAR, by Norbert Voelker*) |
42791
36f787ae5f70
eliminated weight_ASTAR: int Unsynchronized.ref (astar_tac appears to be obsolete anyway);
wenzelm
parents:
42790
diff
changeset
|
740 |
|
36f787ae5f70
eliminated weight_ASTAR: int Unsynchronized.ref (astar_tac appears to be obsolete anyway);
wenzelm
parents:
42790
diff
changeset
|
741 |
val weight_ASTAR = 5; |
1587
e7d8a4957bac
Now provides astar versions (thanks to Norbert Voelker)
paulson
parents:
1524
diff
changeset
|
742 |
|
10382
1fb807260ff1
atomize: all automated tactics that "solve" goals;
wenzelm
parents:
10309
diff
changeset
|
743 |
fun astar_tac cs = |
35625 | 744 |
Object_Logic.atomize_prems_tac THEN' |
10382
1fb807260ff1
atomize: all automated tactics that "solve" goals;
wenzelm
parents:
10309
diff
changeset
|
745 |
SELECT_GOAL |
42791
36f787ae5f70
eliminated weight_ASTAR: int Unsynchronized.ref (astar_tac appears to be obsolete anyway);
wenzelm
parents:
42790
diff
changeset
|
746 |
(ASTAR (has_fewer_prems 1, fn lev => fn thm => size_of_thm thm + weight_ASTAR * lev) |
10382
1fb807260ff1
atomize: all automated tactics that "solve" goals;
wenzelm
parents:
10309
diff
changeset
|
747 |
(step_tac cs 1)); |
1587
e7d8a4957bac
Now provides astar versions (thanks to Norbert Voelker)
paulson
parents:
1524
diff
changeset
|
748 |
|
10736 | 749 |
fun slow_astar_tac cs = |
35625 | 750 |
Object_Logic.atomize_prems_tac THEN' |
10382
1fb807260ff1
atomize: all automated tactics that "solve" goals;
wenzelm
parents:
10309
diff
changeset
|
751 |
SELECT_GOAL |
42791
36f787ae5f70
eliminated weight_ASTAR: int Unsynchronized.ref (astar_tac appears to be obsolete anyway);
wenzelm
parents:
42790
diff
changeset
|
752 |
(ASTAR (has_fewer_prems 1, fn lev => fn thm => size_of_thm thm + weight_ASTAR * lev) |
10382
1fb807260ff1
atomize: all automated tactics that "solve" goals;
wenzelm
parents:
10309
diff
changeset
|
753 |
(slow_step_tac cs 1)); |
1587
e7d8a4957bac
Now provides astar versions (thanks to Norbert Voelker)
paulson
parents:
1524
diff
changeset
|
754 |
|
42790 | 755 |
|
1800 | 756 |
(**** Complete tactic, loosely based upon LeanTaP. This tactic is the outcome |
747
bdc066781063
deepen_tac: modified due to outcome of experiments. Its
lcp
parents:
681
diff
changeset
|
757 |
of much experimentation! Changing APPEND to ORELSE below would prove |
bdc066781063
deepen_tac: modified due to outcome of experiments. Its
lcp
parents:
681
diff
changeset
|
758 |
easy theorems faster, but loses completeness -- and many of the harder |
1800 | 759 |
theorems such as 43. ****) |
681
9b02474744ca
Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents:
469
diff
changeset
|
760 |
|
747
bdc066781063
deepen_tac: modified due to outcome of experiments. Its
lcp
parents:
681
diff
changeset
|
761 |
(*Non-deterministic! Could always expand the first unsafe connective. |
bdc066781063
deepen_tac: modified due to outcome of experiments. Its
lcp
parents:
681
diff
changeset
|
762 |
That's hard to implement and did not perform better in experiments, due to |
bdc066781063
deepen_tac: modified due to outcome of experiments. Its
lcp
parents:
681
diff
changeset
|
763 |
greater search depth required.*) |
32863 | 764 |
fun dup_step_tac (CS {dup_netpair, ...}) = |
681
9b02474744ca
Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents:
469
diff
changeset
|
765 |
biresolve_from_nets_tac dup_netpair; |
9b02474744ca
Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents:
469
diff
changeset
|
766 |
|
5523 | 767 |
(*Searching to depth m. A variant called nodup_depth_tac appears in clasimp.ML*) |
5757 | 768 |
local |
42790 | 769 |
fun slow_step_tac' cs = appWrappers cs (instp_step_tac cs APPEND' dup_step_tac cs); |
770 |
in |
|
771 |
fun depth_tac cs m i state = SELECT_GOAL |
|
772 |
(safe_steps_tac cs 1 THEN_ELSE |
|
773 |
(DEPTH_SOLVE (depth_tac cs m 1), |
|
774 |
inst0_step_tac cs 1 APPEND COND (K (m = 0)) no_tac |
|
775 |
(slow_step_tac' cs 1 THEN DEPTH_SOLVE (depth_tac cs (m - 1) 1)))) i state; |
|
5757 | 776 |
end; |
747
bdc066781063
deepen_tac: modified due to outcome of experiments. Its
lcp
parents:
681
diff
changeset
|
777 |
|
10736 | 778 |
(*Search, with depth bound m. |
2173 | 779 |
This is the "entry point", which does safe inferences first.*) |
42790 | 780 |
fun safe_depth_tac cs m = SUBGOAL (fn (prem,i) => |
781 |
let val deti = |
|
782 |
(*No Vars in the goal? No need to backtrack between goals.*) |
|
783 |
if exists_subterm (fn Var _ => true | _ => false) prem then DETERM else I |
|
784 |
in |
|
785 |
SELECT_GOAL (TRY (safe_tac cs) THEN DEPTH_SOLVE (deti (depth_tac cs m 1))) i |
|
786 |
end); |
|
681
9b02474744ca
Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents:
469
diff
changeset
|
787 |
|
42790 | 788 |
fun deepen_tac cs = DEEPEN (2, 10) (safe_depth_tac cs); |
681
9b02474744ca
Provers/classical: now takes theorem "classical" as argument, proves "swap"
lcp
parents:
469
diff
changeset
|
789 |
|
4079
9df5e4f22d96
new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents:
4066
diff
changeset
|
790 |
|
1724 | 791 |
|
15036 | 792 |
(** context dependent claset components **) |
793 |
||
794 |
datatype context_cs = ContextCS of |
|
795 |
{swrappers: (string * (Proof.context -> wrapper)) list, |
|
796 |
uwrappers: (string * (Proof.context -> wrapper)) list}; |
|
797 |
||
798 |
fun context_cs ctxt cs (ContextCS {swrappers, uwrappers}) = |
|
799 |
let |
|
800 |
fun add_wrapper add (name, f) claset = add (claset, (name, f ctxt)); |
|
801 |
in |
|
22674 | 802 |
cs |
803 |
|> fold_rev (add_wrapper (op addSWrapper)) swrappers |
|
15036 | 804 |
|> fold_rev (add_wrapper (op addWrapper)) uwrappers |
805 |
end; |
|
806 |
||
807 |
fun make_context_cs (swrappers, uwrappers) = |
|
808 |
ContextCS {swrappers = swrappers, uwrappers = uwrappers}; |
|
809 |
||
810 |
val empty_context_cs = make_context_cs ([], []); |
|
811 |
||
812 |
fun merge_context_cs (ctxt_cs1, ctxt_cs2) = |
|
24358 | 813 |
if pointer_eq (ctxt_cs1, ctxt_cs2) then ctxt_cs1 |
814 |
else |
|
815 |
let |
|
816 |
val ContextCS {swrappers = swrappers1, uwrappers = uwrappers1} = ctxt_cs1; |
|
817 |
val ContextCS {swrappers = swrappers2, uwrappers = uwrappers2} = ctxt_cs2; |
|
818 |
val swrappers' = AList.merge (op =) (K true) (swrappers1, swrappers2); |
|
819 |
val uwrappers' = AList.merge (op =) (K true) (uwrappers1, uwrappers2); |
|
820 |
in make_context_cs (swrappers', uwrappers') end; |
|
15036 | 821 |
|
822 |
||
823 |
||
17880 | 824 |
(** claset data **) |
4079
9df5e4f22d96
new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents:
4066
diff
changeset
|
825 |
|
24021 | 826 |
(* global clasets *) |
1724 | 827 |
|
33522 | 828 |
structure GlobalClaset = Theory_Data |
22846 | 829 |
( |
26497
1873915c64a9
purely functional setup of claset/simpset/clasimpset;
wenzelm
parents:
26470
diff
changeset
|
830 |
type T = claset * context_cs; |
1873915c64a9
purely functional setup of claset/simpset/clasimpset;
wenzelm
parents:
26470
diff
changeset
|
831 |
val empty = (empty_cs, empty_context_cs); |
1873915c64a9
purely functional setup of claset/simpset/clasimpset;
wenzelm
parents:
26470
diff
changeset
|
832 |
val extend = I; |
33522 | 833 |
fun merge ((cs1, ctxt_cs1), (cs2, ctxt_cs2)) = |
26497
1873915c64a9
purely functional setup of claset/simpset/clasimpset;
wenzelm
parents:
26470
diff
changeset
|
834 |
(merge_cs (cs1, cs2), merge_context_cs (ctxt_cs1, ctxt_cs2)); |
22846 | 835 |
); |
1724 | 836 |
|
32261 | 837 |
val get_global_claset = #1 o GlobalClaset.get; |
838 |
val map_global_claset = GlobalClaset.map o apfst; |
|
17880 | 839 |
|
42361 | 840 |
val get_context_cs = #2 o GlobalClaset.get o Proof_Context.theory_of; |
15036 | 841 |
fun map_context_cs f = GlobalClaset.map (apsnd |
842 |
(fn ContextCS {swrappers, uwrappers} => make_context_cs (f (swrappers, uwrappers)))); |
|
4079
9df5e4f22d96
new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents:
4066
diff
changeset
|
843 |
|
32148
253f6808dabe
renamed simpset_of to global_simpset_of, and local_simpset_of to simpset_of -- same for claset and clasimpset;
wenzelm
parents:
32091
diff
changeset
|
844 |
fun global_claset_of thy = |
26497
1873915c64a9
purely functional setup of claset/simpset/clasimpset;
wenzelm
parents:
26470
diff
changeset
|
845 |
let val (cs, ctxt_cs) = GlobalClaset.get thy |
42361 | 846 |
in context_cs (Proof_Context.init_global thy) cs (ctxt_cs) end; |
3727
ed63c05d7992
Added Safe_tac; all other default claset tactics now dereference "claset"
paulson
parents:
3705
diff
changeset
|
847 |
|
4079
9df5e4f22d96
new implicit claset mechanism based on Sign.sg anytype data;
wenzelm
parents:
4066
diff
changeset
|
848 |
|
15036 | 849 |
(* context dependent components *) |
850 |
||
26497
1873915c64a9
purely functional setup of claset/simpset/clasimpset;
wenzelm
parents:
26470
diff
changeset
|
851 |
fun add_context_safe_wrapper wrapper = map_context_cs (apfst ((AList.update (op =) wrapper))); |
1873915c64a9
purely functional setup of claset/simpset/clasimpset;
wenzelm
parents:
26470
diff
changeset
|
852 |
fun del_context_safe_wrapper name = map_context_cs (apfst ((AList.delete (op =) name))); |
15036 | 853 |
|
26497
1873915c64a9
purely functional setup of claset/simpset/clasimpset;
wenzelm
parents:
26470
diff
changeset
|
854 |
fun add_context_unsafe_wrapper wrapper = map_context_cs (apsnd ((AList.update (op =) wrapper))); |
1873915c64a9
purely functional setup of claset/simpset/clasimpset;
wenzelm
parents:
26470
diff
changeset
|
855 |
fun del_context_unsafe_wrapper name = map_context_cs (apsnd ((AList.delete (op =) name))); |
15036 | 856 |
|
857 |
||
24021 | 858 |
(* local clasets *) |
5841 | 859 |
|
33519 | 860 |
structure LocalClaset = Proof_Data |
22846 | 861 |
( |
5841 | 862 |
type T = claset; |
32261 | 863 |
val init = get_global_claset; |
22846 | 864 |
); |
5841 | 865 |
|
32261 | 866 |
val get_claset = LocalClaset.get; |
867 |
val put_claset = LocalClaset.put; |
|
868 |
||
32148
253f6808dabe
renamed simpset_of to global_simpset_of, and local_simpset_of to simpset_of -- same for claset and clasimpset;
wenzelm
parents:
32091
diff
changeset
|
869 |
fun claset_of ctxt = |
26497
1873915c64a9
purely functional setup of claset/simpset/clasimpset;
wenzelm
parents:
26470
diff
changeset
|
870 |
context_cs ctxt (LocalClaset.get ctxt) (get_context_cs ctxt); |
22846 | 871 |
|
5841 | 872 |
|
24021 | 873 |
(* generic clasets *) |
874 |
||
32148
253f6808dabe
renamed simpset_of to global_simpset_of, and local_simpset_of to simpset_of -- same for claset and clasimpset;
wenzelm
parents:
32091
diff
changeset
|
875 |
val get_cs = Context.cases global_claset_of claset_of; |
32261 | 876 |
fun map_cs f = Context.mapping (map_global_claset f) (LocalClaset.map f); |
24021 | 877 |
|
878 |
||
5885 | 879 |
(* attributes *) |
880 |
||
18728 | 881 |
fun attrib f = Thm.declaration_attribute (fn th => |
32261 | 882 |
Context.mapping (map_global_claset (f th)) (LocalClaset.map (f th))); |
5885 | 883 |
|
21689
58abd6d8abd1
Removal of theorem tagging, which the ATP linkup no longer requires,
paulson
parents:
21687
diff
changeset
|
884 |
fun safe_dest w = attrib (addSE w o make_elim); |
18691 | 885 |
val safe_elim = attrib o addSE; |
886 |
val safe_intro = attrib o addSI; |
|
21689
58abd6d8abd1
Removal of theorem tagging, which the ATP linkup no longer requires,
paulson
parents:
21687
diff
changeset
|
887 |
fun haz_dest w = attrib (addE w o make_elim); |
18691 | 888 |
val haz_elim = attrib o addE; |
889 |
val haz_intro = attrib o addI; |
|
33369 | 890 |
val rule_del = attrib delrule o Context_Rules.rule_del; |
5885 | 891 |
|
892 |
||
10736 | 893 |
end; |
5841 | 894 |
|
895 |
||
896 |
||
5885 | 897 |
(** concrete syntax of attributes **) |
5841 | 898 |
|
899 |
val introN = "intro"; |
|
900 |
val elimN = "elim"; |
|
901 |
val destN = "dest"; |
|
902 |
||
30528 | 903 |
val setup_attrs = |
904 |
Attrib.setup @{binding swapped} (Scan.succeed swapped) |
|
905 |
"classical swap of introduction rule" #> |
|
33369 | 906 |
Attrib.setup @{binding dest} (Context_Rules.add safe_dest haz_dest Context_Rules.dest_query) |
30528 | 907 |
"declaration of Classical destruction rule" #> |
33369 | 908 |
Attrib.setup @{binding elim} (Context_Rules.add safe_elim haz_elim Context_Rules.elim_query) |
30528 | 909 |
"declaration of Classical elimination rule" #> |
33369 | 910 |
Attrib.setup @{binding intro} (Context_Rules.add safe_intro haz_intro Context_Rules.intro_query) |
30528 | 911 |
"declaration of Classical introduction rule" #> |
912 |
Attrib.setup @{binding rule} (Scan.lift Args.del >> K rule_del) |
|
913 |
"remove declaration of intro/elim/dest rule"; |
|
5841 | 914 |
|
915 |
||
916 |
||
7230 | 917 |
(** proof methods **) |
918 |
||
919 |
local |
|
920 |
||
30609
983e8b6e4e69
Disposed old declarations, tactics, tactic combinators that refer to the simpset or claset of an implicit theory;
wenzelm
parents:
30558
diff
changeset
|
921 |
fun some_rule_tac ctxt facts = SUBGOAL (fn (goal, i) => |
5841 | 922 |
let |
33369 | 923 |
val [rules1, rules2, rules4] = Context_Rules.find_rules false facts goal ctxt; |
32148
253f6808dabe
renamed simpset_of to global_simpset_of, and local_simpset_of to simpset_of -- same for claset and clasimpset;
wenzelm
parents:
32091
diff
changeset
|
924 |
val CS {xtra_netpair, ...} = claset_of ctxt; |
33369 | 925 |
val rules3 = Context_Rules.find_rules_netpair true facts goal xtra_netpair; |
12376
480303e3fa08
simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents:
12362
diff
changeset
|
926 |
val rules = rules1 @ rules2 @ rules3 @ rules4; |
18223 | 927 |
val ruleq = Drule.multi_resolves facts rules; |
12376
480303e3fa08
simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents:
12362
diff
changeset
|
928 |
in |
480303e3fa08
simplified (and clarified) integration with Pure/ContextRules;
wenzelm
parents:
12362
diff
changeset
|
929 |
Method.trace ctxt rules; |
32952 | 930 |
fn st => Seq.maps (fn rule => Tactic.rtac rule i st) ruleq |
18834 | 931 |
end) |
21687 | 932 |
THEN_ALL_NEW Goal.norm_hhf_tac; |
5841 | 933 |
|
30609
983e8b6e4e69
Disposed old declarations, tactics, tactic combinators that refer to the simpset or claset of an implicit theory;
wenzelm
parents:
30558
diff
changeset
|
934 |
in |
7281 | 935 |
|
30609
983e8b6e4e69
Disposed old declarations, tactics, tactic combinators that refer to the simpset or claset of an implicit theory;
wenzelm
parents:
30558
diff
changeset
|
936 |
fun rule_tac ctxt [] facts = some_rule_tac ctxt facts |
983e8b6e4e69
Disposed old declarations, tactics, tactic combinators that refer to the simpset or claset of an implicit theory;
wenzelm
parents:
30558
diff
changeset
|
937 |
| rule_tac _ rules facts = Method.rule_tac rules facts; |
983e8b6e4e69
Disposed old declarations, tactics, tactic combinators that refer to the simpset or claset of an implicit theory;
wenzelm
parents:
30558
diff
changeset
|
938 |
|
983e8b6e4e69
Disposed old declarations, tactics, tactic combinators that refer to the simpset or claset of an implicit theory;
wenzelm
parents:
30558
diff
changeset
|
939 |
fun default_tac ctxt rules facts = |
983e8b6e4e69
Disposed old declarations, tactics, tactic combinators that refer to the simpset or claset of an implicit theory;
wenzelm
parents:
30558
diff
changeset
|
940 |
HEADGOAL (rule_tac ctxt rules facts) ORELSE |
26470 | 941 |
Class.default_intro_tac ctxt facts; |
10309 | 942 |
|
7230 | 943 |
end; |
5841 | 944 |
|
945 |
||
7230 | 946 |
(* contradiction method *) |
6502 | 947 |
|
7425 | 948 |
val contradiction = Method.rule [Data.not_elim, Data.not_elim COMP Drule.swap_prems_rl]; |
6502 | 949 |
|
950 |
||
951 |
(* automatic methods *) |
|
5841 | 952 |
|
5927 | 953 |
val cla_modifiers = |
18728 | 954 |
[Args.$$$ destN -- Args.bang_colon >> K ((I, safe_dest NONE): Method.modifier), |
955 |
Args.$$$ destN -- Args.colon >> K (I, haz_dest NONE), |
|
956 |
Args.$$$ elimN -- Args.bang_colon >> K (I, safe_elim NONE), |
|
957 |
Args.$$$ elimN -- Args.colon >> K (I, haz_elim NONE), |
|
958 |
Args.$$$ introN -- Args.bang_colon >> K (I, safe_intro NONE), |
|
959 |
Args.$$$ introN -- Args.colon >> K (I, haz_intro NONE), |
|
960 |
Args.del -- Args.colon >> K (I, rule_del)]; |
|
5927 | 961 |
|
35613 | 962 |
fun cla_meth tac ctxt = METHOD (fn facts => |
963 |
ALLGOALS (Method.insert_tac facts) THEN tac (claset_of ctxt)); |
|
7132 | 964 |
|
35613 | 965 |
fun cla_meth' tac ctxt = METHOD (fn facts => |
966 |
HEADGOAL (Method.insert_tac facts THEN' tac (claset_of ctxt))); |
|
5841 | 967 |
|
35613 | 968 |
fun cla_method tac = Method.sections cla_modifiers >> K (cla_meth tac); |
969 |
fun cla_method' tac = Method.sections cla_modifiers >> K (cla_meth' tac); |
|
5841 | 970 |
|
971 |
||
972 |
||
973 |
(** setup_methods **) |
|
974 |
||
30541 | 975 |
val setup_methods = |
30609
983e8b6e4e69
Disposed old declarations, tactics, tactic combinators that refer to the simpset or claset of an implicit theory;
wenzelm
parents:
30558
diff
changeset
|
976 |
Method.setup @{binding default} |
983e8b6e4e69
Disposed old declarations, tactics, tactic combinators that refer to the simpset or claset of an implicit theory;
wenzelm
parents:
30558
diff
changeset
|
977 |
(Attrib.thms >> (fn rules => fn ctxt => METHOD (default_tac ctxt rules))) |
30541 | 978 |
"apply some intro/elim rule (potentially classical)" #> |
30609
983e8b6e4e69
Disposed old declarations, tactics, tactic combinators that refer to the simpset or claset of an implicit theory;
wenzelm
parents:
30558
diff
changeset
|
979 |
Method.setup @{binding rule} |
983e8b6e4e69
Disposed old declarations, tactics, tactic combinators that refer to the simpset or claset of an implicit theory;
wenzelm
parents:
30558
diff
changeset
|
980 |
(Attrib.thms >> (fn rules => fn ctxt => METHOD (HEADGOAL o rule_tac ctxt rules))) |
30541 | 981 |
"apply some intro/elim rule (potentially classical)" #> |
982 |
Method.setup @{binding contradiction} (Scan.succeed (K contradiction)) |
|
983 |
"proof by contradiction" #> |
|
984 |
Method.setup @{binding clarify} (cla_method' (CHANGED_PROP oo clarify_tac)) |
|
985 |
"repeatedly apply safe steps" #> |
|
986 |
Method.setup @{binding fast} (cla_method' fast_tac) "classical prover (depth-first)" #> |
|
987 |
Method.setup @{binding slow} (cla_method' slow_tac) "classical prover (slow depth-first)" #> |
|
988 |
Method.setup @{binding best} (cla_method' best_tac) "classical prover (best-first)" #> |
|
989 |
Method.setup @{binding deepen} (cla_method' (fn cs => deepen_tac cs 4)) |
|
990 |
"classical prover (iterative deepening)" #> |
|
991 |
Method.setup @{binding safe} (cla_method (CHANGED_PROP o safe_tac)) |
|
992 |
"classical prover (apply safe rules)"; |
|
5841 | 993 |
|
994 |
||
995 |
||
996 |
(** theory setup **) |
|
997 |
||
26497
1873915c64a9
purely functional setup of claset/simpset/clasimpset;
wenzelm
parents:
26470
diff
changeset
|
998 |
val setup = setup_attrs #> setup_methods; |
5841 | 999 |
|
1000 |
||
8667 | 1001 |
|
1002 |
(** outer syntax **) |
|
1003 |
||
24867 | 1004 |
val _ = |
36960
01594f816e3a
prefer structure Keyword, Parse, Parse_Spec, Outer_Syntax;
wenzelm
parents:
36610
diff
changeset
|
1005 |
Outer_Syntax.improper_command "print_claset" "print context of Classical Reasoner" |
01594f816e3a
prefer structure Keyword, Parse, Parse_Spec, Outer_Syntax;
wenzelm
parents:
36610
diff
changeset
|
1006 |
Keyword.diag |
26497
1873915c64a9
purely functional setup of claset/simpset/clasimpset;
wenzelm
parents:
26470
diff
changeset
|
1007 |
(Scan.succeed (Toplevel.no_timing o Toplevel.unknown_context o |
42439
9efdd0af15ac
eliminated Display.string_of_thm_without_context;
wenzelm
parents:
42361
diff
changeset
|
1008 |
Toplevel.keep (fn state => |
9efdd0af15ac
eliminated Display.string_of_thm_without_context;
wenzelm
parents:
42361
diff
changeset
|
1009 |
let val ctxt = Toplevel.context_of state |
9efdd0af15ac
eliminated Display.string_of_thm_without_context;
wenzelm
parents:
42361
diff
changeset
|
1010 |
in print_cs ctxt (claset_of ctxt) end))); |
8667 | 1011 |
|
5841 | 1012 |
end; |