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