author | blanchet |
Thu, 30 Sep 2010 00:29:37 +0200 | |
changeset 39893 | 25a339e1ff9b |
parent 39886 | 8a9f0c97d550 |
child 39900 | 549c00e0e89b |
permissions | -rw-r--r-- |
9869 | 1 |
(* Title: HOL/Tools/meson.ML |
9840
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
2 |
Author: Lawrence C Paulson, Cambridge University Computer Laboratory |
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
3 |
|
9869 | 4 |
The MESON resolution proof procedure for HOL. |
29267 | 5 |
When making clauses, avoids using the rewriter -- instead uses RS recursively. |
9840
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
6 |
*) |
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
7 |
|
24300 | 8 |
signature MESON = |
15579
32bee18c675f
Tools/meson.ML: signature, structure and "open" rather than "local"
paulson
parents:
15574
diff
changeset
|
9 |
sig |
32955 | 10 |
val trace: bool Unsynchronized.ref |
24300 | 11 |
val term_pair_of: indexname * (typ * 'a) -> term * 'a |
12 |
val size_of_subgoals: thm -> int |
|
39269
c2795d8a2461
use definitional CNF for the goal if at least one of the premisses would lead to too many clauses in Meson
blanchet
parents:
39159
diff
changeset
|
13 |
val has_too_many_clauses: Proof.context -> term -> bool |
24937
340523598914
context-based treatment of generalization; also handling TFrees in axiom clauses
paulson
parents:
24827
diff
changeset
|
14 |
val make_cnf: thm list -> thm -> Proof.context -> thm list * Proof.context |
24300 | 15 |
val finish_cnf: thm list -> thm list |
38089
ed65a0777e10
perform the presimplification done by Metis.make_nnf in Sledgehammer again, to deal with "If" and similar constructs
blanchet
parents:
37926
diff
changeset
|
16 |
val presimplify: thm -> thm |
32262 | 17 |
val make_nnf: Proof.context -> thm -> thm |
18 |
val skolemize: Proof.context -> thm -> thm |
|
24300 | 19 |
val is_fol_term: theory -> term -> bool |
35869
cac366550624
start work on direct proof reconstruction for Sledgehammer
blanchet
parents:
35625
diff
changeset
|
20 |
val make_clauses_unsorted: thm list -> thm list |
24300 | 21 |
val make_clauses: thm list -> thm list |
22 |
val make_horns: thm list -> thm list |
|
23 |
val best_prolog_tac: (thm -> int) -> thm list -> tactic |
|
24 |
val depth_prolog_tac: thm list -> tactic |
|
25 |
val gocls: thm list -> thm list |
|
32262 | 26 |
val skolemize_prems_tac: Proof.context -> thm list -> int -> tactic |
39037
5146d640aa4a
Let MESON take an additional "preskolemization tactic", which can be used to put the goal in definitional CNF
blanchet
parents:
38864
diff
changeset
|
27 |
val MESON: |
39269
c2795d8a2461
use definitional CNF for the goal if at least one of the premisses would lead to too many clauses in Meson
blanchet
parents:
39159
diff
changeset
|
28 |
tactic -> (thm list -> thm list) -> (thm list -> tactic) -> Proof.context |
c2795d8a2461
use definitional CNF for the goal if at least one of the premisses would lead to too many clauses in Meson
blanchet
parents:
39159
diff
changeset
|
29 |
-> int -> tactic |
32262 | 30 |
val best_meson_tac: (thm -> int) -> Proof.context -> int -> tactic |
31 |
val safe_best_meson_tac: Proof.context -> int -> tactic |
|
32 |
val depth_meson_tac: Proof.context -> int -> tactic |
|
24300 | 33 |
val prolog_step_tac': thm list -> int -> tactic |
34 |
val iter_deepen_prolog_tac: thm list -> tactic |
|
32262 | 35 |
val iter_deepen_meson_tac: Proof.context -> thm list -> int -> tactic |
24300 | 36 |
val make_meta_clause: thm -> thm |
37 |
val make_meta_clauses: thm list -> thm list |
|
32262 | 38 |
val meson_tac: Proof.context -> thm list -> int -> tactic |
39 |
val setup: theory -> theory |
|
15579
32bee18c675f
Tools/meson.ML: signature, structure and "open" rather than "local"
paulson
parents:
15574
diff
changeset
|
40 |
end |
9840
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
41 |
|
24300 | 42 |
structure Meson: MESON = |
15579
32bee18c675f
Tools/meson.ML: signature, structure and "open" rather than "local"
paulson
parents:
15574
diff
changeset
|
43 |
struct |
9840
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
44 |
|
32955 | 45 |
val trace = Unsynchronized.ref false; |
46 |
fun trace_msg msg = if ! trace then tracing (msg ()) else (); |
|
47 |
||
26562
9d25ef112cf6
* Metis: the maximum number of clauses that can be produced from a theorem is now given by the attribute max_clauses. Theorems that exceed this number are ignored, with a warning printed.
paulson
parents:
26424
diff
changeset
|
48 |
val max_clauses_default = 60; |
38806
0aafc7e81056
more appropriate name for configuration option "meson_max_clauses" (cf. output of 'pront_configs');
wenzelm
parents:
38802
diff
changeset
|
49 |
val (max_clauses, setup) = Attrib.config_int "meson_max_clauses" (K max_clauses_default); |
26562
9d25ef112cf6
* Metis: the maximum number of clauses that can be produced from a theorem is now given by the attribute max_clauses. Theorems that exceed this number are ignored, with a warning printed.
paulson
parents:
26424
diff
changeset
|
50 |
|
38802
a925c0ee42f7
clarified iter_deepen_limit vs meson (cf. 7c5896919eb8) -- eliminated global ref;
wenzelm
parents:
38795
diff
changeset
|
51 |
(*No known example (on 1-5-2007) needs even thirty*) |
a925c0ee42f7
clarified iter_deepen_limit vs meson (cf. 7c5896919eb8) -- eliminated global ref;
wenzelm
parents:
38795
diff
changeset
|
52 |
val iter_deepen_limit = 50; |
a925c0ee42f7
clarified iter_deepen_limit vs meson (cf. 7c5896919eb8) -- eliminated global ref;
wenzelm
parents:
38795
diff
changeset
|
53 |
|
31454 | 54 |
val disj_forward = @{thm disj_forward}; |
55 |
val disj_forward2 = @{thm disj_forward2}; |
|
56 |
val make_pos_rule = @{thm make_pos_rule}; |
|
57 |
val make_pos_rule' = @{thm make_pos_rule'}; |
|
58 |
val make_pos_goal = @{thm make_pos_goal}; |
|
59 |
val make_neg_rule = @{thm make_neg_rule}; |
|
60 |
val make_neg_rule' = @{thm make_neg_rule'}; |
|
61 |
val make_neg_goal = @{thm make_neg_goal}; |
|
62 |
val conj_forward = @{thm conj_forward}; |
|
63 |
val all_forward = @{thm all_forward}; |
|
64 |
val ex_forward = @{thm ex_forward}; |
|
65 |
val choice = @{thm choice}; |
|
66 |
||
39159 | 67 |
val not_conjD = @{thm meson_not_conjD}; |
68 |
val not_disjD = @{thm meson_not_disjD}; |
|
69 |
val not_notD = @{thm meson_not_notD}; |
|
70 |
val not_allD = @{thm meson_not_allD}; |
|
71 |
val not_exD = @{thm meson_not_exD}; |
|
72 |
val imp_to_disjD = @{thm meson_imp_to_disjD}; |
|
73 |
val not_impD = @{thm meson_not_impD}; |
|
74 |
val iff_to_disjD = @{thm meson_iff_to_disjD}; |
|
75 |
val not_iffD = @{thm meson_not_iffD}; |
|
76 |
val conj_exD1 = @{thm meson_conj_exD1}; |
|
77 |
val conj_exD2 = @{thm meson_conj_exD2}; |
|
78 |
val disj_exD = @{thm meson_disj_exD}; |
|
79 |
val disj_exD1 = @{thm meson_disj_exD1}; |
|
80 |
val disj_exD2 = @{thm meson_disj_exD2}; |
|
81 |
val disj_assoc = @{thm meson_disj_assoc}; |
|
82 |
val disj_comm = @{thm meson_disj_comm}; |
|
83 |
val disj_FalseD1 = @{thm meson_disj_FalseD1}; |
|
84 |
val disj_FalseD2 = @{thm meson_disj_FalseD2}; |
|
9840
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
85 |
|
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
86 |
|
15579
32bee18c675f
Tools/meson.ML: signature, structure and "open" rather than "local"
paulson
parents:
15574
diff
changeset
|
87 |
(**** Operators for forward proof ****) |
32bee18c675f
Tools/meson.ML: signature, structure and "open" rather than "local"
paulson
parents:
15574
diff
changeset
|
88 |
|
20417
c611b1412056
better skolemization, using first-order resolution rather than hoping for the right result
paulson
parents:
20361
diff
changeset
|
89 |
|
c611b1412056
better skolemization, using first-order resolution rather than hoping for the right result
paulson
parents:
20361
diff
changeset
|
90 |
(** First-order Resolution **) |
c611b1412056
better skolemization, using first-order resolution rather than hoping for the right result
paulson
parents:
20361
diff
changeset
|
91 |
|
c611b1412056
better skolemization, using first-order resolution rather than hoping for the right result
paulson
parents:
20361
diff
changeset
|
92 |
fun term_pair_of (ix, (ty,t)) = (Var (ix,ty), t); |
c611b1412056
better skolemization, using first-order resolution rather than hoping for the right result
paulson
parents:
20361
diff
changeset
|
93 |
|
c611b1412056
better skolemization, using first-order resolution rather than hoping for the right result
paulson
parents:
20361
diff
changeset
|
94 |
(*FIXME: currently does not "rename variables apart"*) |
c611b1412056
better skolemization, using first-order resolution rather than hoping for the right result
paulson
parents:
20361
diff
changeset
|
95 |
fun first_order_resolve thA thB = |
32262 | 96 |
(case |
97 |
try (fn () => |
|
98 |
let val thy = theory_of_thm thA |
|
99 |
val tmA = concl_of thA |
|
100 |
val Const("==>",_) $ tmB $ _ = prop_of thB |
|
37398
e194213451c9
beta-eta-contract, to respect "first_order_match"'s specification;
blanchet
parents:
37388
diff
changeset
|
101 |
val tenv = |
37410
2bf7e6136047
adjusted the polymorphism handling of Skolem constants so that proof reconstruction doesn't fail in "equality_inf"
blanchet
parents:
37398
diff
changeset
|
102 |
Pattern.first_order_match thy (tmB, tmA) |
2bf7e6136047
adjusted the polymorphism handling of Skolem constants so that proof reconstruction doesn't fail in "equality_inf"
blanchet
parents:
37398
diff
changeset
|
103 |
(Vartab.empty, Vartab.empty) |> snd |
32262 | 104 |
val ct_pairs = map (pairself (cterm_of thy) o term_pair_of) (Vartab.dest tenv) |
105 |
in thA RS (cterm_instantiate ct_pairs thB) end) () of |
|
106 |
SOME th => th |
|
37398
e194213451c9
beta-eta-contract, to respect "first_order_match"'s specification;
blanchet
parents:
37388
diff
changeset
|
107 |
| NONE => raise THM ("first_order_resolve", 0, [thA, thB])) |
18175
7858b777569a
new version of "tryres" allowing multiple unifiers (apparently needed for
paulson
parents:
18141
diff
changeset
|
108 |
|
24937
340523598914
context-based treatment of generalization; also handling TFrees in axiom clauses
paulson
parents:
24827
diff
changeset
|
109 |
(*Forward proof while preserving bound variables names*) |
340523598914
context-based treatment of generalization; also handling TFrees in axiom clauses
paulson
parents:
24827
diff
changeset
|
110 |
fun rename_bvs_RS th rl = |
340523598914
context-based treatment of generalization; also handling TFrees in axiom clauses
paulson
parents:
24827
diff
changeset
|
111 |
let val th' = th RS rl |
340523598914
context-based treatment of generalization; also handling TFrees in axiom clauses
paulson
parents:
24827
diff
changeset
|
112 |
in Thm.rename_boundvars (concl_of th') (concl_of th) th' end; |
340523598914
context-based treatment of generalization; also handling TFrees in axiom clauses
paulson
parents:
24827
diff
changeset
|
113 |
|
340523598914
context-based treatment of generalization; also handling TFrees in axiom clauses
paulson
parents:
24827
diff
changeset
|
114 |
(*raises exception if no rules apply*) |
24300 | 115 |
fun tryres (th, rls) = |
18141
89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18024
diff
changeset
|
116 |
let fun tryall [] = raise THM("tryres", 0, th::rls) |
24937
340523598914
context-based treatment of generalization; also handling TFrees in axiom clauses
paulson
parents:
24827
diff
changeset
|
117 |
| tryall (rl::rls) = (rename_bvs_RS th rl handle THM _ => tryall rls) |
18141
89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18024
diff
changeset
|
118 |
in tryall rls end; |
24300 | 119 |
|
21050
d0447a511edb
More robust error handling in make_nnf and forward_res
paulson
parents:
21046
diff
changeset
|
120 |
(*Permits forward proof from rules that discharge assumptions. The supplied proof state st, |
d0447a511edb
More robust error handling in make_nnf and forward_res
paulson
parents:
21046
diff
changeset
|
121 |
e.g. from conj_forward, should have the form |
d0447a511edb
More robust error handling in make_nnf and forward_res
paulson
parents:
21046
diff
changeset
|
122 |
"[| P' ==> ?P; Q' ==> ?Q |] ==> ?P & ?Q" |
d0447a511edb
More robust error handling in make_nnf and forward_res
paulson
parents:
21046
diff
changeset
|
123 |
and the effect should be to instantiate ?P and ?Q with normalized versions of P' and Q'.*) |
32262 | 124 |
fun forward_res ctxt nf st = |
21050
d0447a511edb
More robust error handling in make_nnf and forward_res
paulson
parents:
21046
diff
changeset
|
125 |
let fun forward_tacf [prem] = rtac (nf prem) 1 |
24300 | 126 |
| forward_tacf prems = |
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:
32032
diff
changeset
|
127 |
error (cat_lines |
30e2ffbba718
proper context for Display.pretty_thm etc. or old-style versions Display.pretty_thm_global, Display.pretty_thm_without_context etc.;
wenzelm
parents:
32032
diff
changeset
|
128 |
("Bad proof state in forward_res, please inform lcp@cl.cam.ac.uk:" :: |
32262 | 129 |
Display.string_of_thm ctxt st :: |
130 |
"Premises:" :: map (Display.string_of_thm ctxt) prems)) |
|
21050
d0447a511edb
More robust error handling in make_nnf and forward_res
paulson
parents:
21046
diff
changeset
|
131 |
in |
37781
2fbbf0a48cef
moved misc legacy stuff from OldGoals to Misc_Legacy;
wenzelm
parents:
37539
diff
changeset
|
132 |
case Seq.pull (ALLGOALS (Misc_Legacy.METAHYPS forward_tacf) st) |
21050
d0447a511edb
More robust error handling in make_nnf and forward_res
paulson
parents:
21046
diff
changeset
|
133 |
of SOME(th,_) => th |
d0447a511edb
More robust error handling in make_nnf and forward_res
paulson
parents:
21046
diff
changeset
|
134 |
| NONE => raise THM("forward_res", 0, [st]) |
d0447a511edb
More robust error handling in make_nnf and forward_res
paulson
parents:
21046
diff
changeset
|
135 |
end; |
15579
32bee18c675f
Tools/meson.ML: signature, structure and "open" rather than "local"
paulson
parents:
15574
diff
changeset
|
136 |
|
20134
73cb53843190
has_consts renamed to has_conn, now actually parses the first-order formula
paulson
parents:
20119
diff
changeset
|
137 |
(*Are any of the logical connectives in "bs" present in the term?*) |
73cb53843190
has_consts renamed to has_conn, now actually parses the first-order formula
paulson
parents:
20119
diff
changeset
|
138 |
fun has_conns bs = |
39328 | 139 |
let fun has (Const _) = false |
38557 | 140 |
| has (Const(@{const_name Trueprop},_) $ p) = has p |
141 |
| has (Const(@{const_name Not},_) $ p) = has p |
|
38795
848be46708dc
formerly unnamed infix conjunction and disjunction now named HOL.conj and HOL.disj
haftmann
parents:
38786
diff
changeset
|
142 |
| has (Const(@{const_name HOL.disj},_) $ p $ q) = member (op =) bs @{const_name HOL.disj} orelse has p orelse has q |
848be46708dc
formerly unnamed infix conjunction and disjunction now named HOL.conj and HOL.disj
haftmann
parents:
38786
diff
changeset
|
143 |
| has (Const(@{const_name HOL.conj},_) $ p $ q) = member (op =) bs @{const_name HOL.conj} orelse has p orelse has q |
38557 | 144 |
| has (Const(@{const_name All},_) $ Abs(_,_,p)) = member (op =) bs @{const_name All} orelse has p |
145 |
| has (Const(@{const_name Ex},_) $ Abs(_,_,p)) = member (op =) bs @{const_name Ex} orelse has p |
|
24300 | 146 |
| has _ = false |
15579
32bee18c675f
Tools/meson.ML: signature, structure and "open" rather than "local"
paulson
parents:
15574
diff
changeset
|
147 |
in has end; |
24300 | 148 |
|
9840
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
149 |
|
15579
32bee18c675f
Tools/meson.ML: signature, structure and "open" rather than "local"
paulson
parents:
15574
diff
changeset
|
150 |
(**** Clause handling ****) |
9840
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
151 |
|
38557 | 152 |
fun literals (Const(@{const_name Trueprop},_) $ P) = literals P |
38795
848be46708dc
formerly unnamed infix conjunction and disjunction now named HOL.conj and HOL.disj
haftmann
parents:
38786
diff
changeset
|
153 |
| literals (Const(@{const_name HOL.disj},_) $ P $ Q) = literals P @ literals Q |
38557 | 154 |
| literals (Const(@{const_name Not},_) $ P) = [(false,P)] |
15579
32bee18c675f
Tools/meson.ML: signature, structure and "open" rather than "local"
paulson
parents:
15574
diff
changeset
|
155 |
| literals P = [(true,P)]; |
9840
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
156 |
|
15579
32bee18c675f
Tools/meson.ML: signature, structure and "open" rather than "local"
paulson
parents:
15574
diff
changeset
|
157 |
(*number of literals in a term*) |
32bee18c675f
Tools/meson.ML: signature, structure and "open" rather than "local"
paulson
parents:
15574
diff
changeset
|
158 |
val nliterals = length o literals; |
9840
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
159 |
|
18389 | 160 |
|
161 |
(*** Tautology Checking ***) |
|
162 |
||
38795
848be46708dc
formerly unnamed infix conjunction and disjunction now named HOL.conj and HOL.disj
haftmann
parents:
38786
diff
changeset
|
163 |
fun signed_lits_aux (Const (@{const_name HOL.disj}, _) $ P $ Q) (poslits, neglits) = |
18389 | 164 |
signed_lits_aux Q (signed_lits_aux P (poslits, neglits)) |
38557 | 165 |
| signed_lits_aux (Const(@{const_name Not},_) $ P) (poslits, neglits) = (poslits, P::neglits) |
18389 | 166 |
| signed_lits_aux P (poslits, neglits) = (P::poslits, neglits); |
24300 | 167 |
|
18389 | 168 |
fun signed_lits th = signed_lits_aux (HOLogic.dest_Trueprop (concl_of th)) ([],[]); |
169 |
||
170 |
(*Literals like X=X are tautologous*) |
|
38864
4abe644fcea5
formerly unnamed infix equality now named HOL.eq
haftmann
parents:
38806
diff
changeset
|
171 |
fun taut_poslit (Const(@{const_name HOL.eq},_) $ t $ u) = t aconv u |
38557 | 172 |
| taut_poslit (Const(@{const_name True},_)) = true |
18389 | 173 |
| taut_poslit _ = false; |
174 |
||
175 |
fun is_taut th = |
|
176 |
let val (poslits,neglits) = signed_lits th |
|
177 |
in exists taut_poslit poslits |
|
178 |
orelse |
|
20073 | 179 |
exists (member (op aconv) neglits) (HOLogic.false_const :: poslits) |
19894 | 180 |
end |
24300 | 181 |
handle TERM _ => false; (*probably dest_Trueprop on a weird theorem*) |
18389 | 182 |
|
183 |
||
184 |
(*** To remove trivial negated equality literals from clauses ***) |
|
185 |
||
186 |
(*They are typically functional reflexivity axioms and are the converses of |
|
187 |
injectivity equivalences*) |
|
24300 | 188 |
|
39159 | 189 |
val not_refl_disj_D = @{thm meson_not_refl_disj_D}; |
18389 | 190 |
|
20119 | 191 |
(*Is either term a Var that does not properly occur in the other term?*) |
192 |
fun eliminable (t as Var _, u) = t aconv u orelse not (Logic.occs(t,u)) |
|
193 |
| eliminable (u, t as Var _) = t aconv u orelse not (Logic.occs(t,u)) |
|
194 |
| eliminable _ = false; |
|
195 |
||
18389 | 196 |
fun refl_clause_aux 0 th = th |
197 |
| refl_clause_aux n th = |
|
198 |
case HOLogic.dest_Trueprop (concl_of th) of |
|
38795
848be46708dc
formerly unnamed infix conjunction and disjunction now named HOL.conj and HOL.disj
haftmann
parents:
38786
diff
changeset
|
199 |
(Const (@{const_name HOL.disj}, _) $ (Const (@{const_name HOL.disj}, _) $ _ $ _) $ _) => |
18389 | 200 |
refl_clause_aux n (th RS disj_assoc) (*isolate an atom as first disjunct*) |
38864
4abe644fcea5
formerly unnamed infix equality now named HOL.eq
haftmann
parents:
38806
diff
changeset
|
201 |
| (Const (@{const_name HOL.disj}, _) $ (Const(@{const_name Not},_) $ (Const(@{const_name HOL.eq},_) $ t $ u)) $ _) => |
24300 | 202 |
if eliminable(t,u) |
203 |
then refl_clause_aux (n-1) (th RS not_refl_disj_D) (*Var inequation: delete*) |
|
204 |
else refl_clause_aux (n-1) (th RS disj_comm) (*not between Vars: ignore*) |
|
38795
848be46708dc
formerly unnamed infix conjunction and disjunction now named HOL.conj and HOL.disj
haftmann
parents:
38786
diff
changeset
|
205 |
| (Const (@{const_name HOL.disj}, _) $ _ $ _) => refl_clause_aux n (th RS disj_comm) |
24300 | 206 |
| _ => (*not a disjunction*) th; |
18389 | 207 |
|
38795
848be46708dc
formerly unnamed infix conjunction and disjunction now named HOL.conj and HOL.disj
haftmann
parents:
38786
diff
changeset
|
208 |
fun notequal_lits_count (Const (@{const_name HOL.disj}, _) $ P $ Q) = |
18389 | 209 |
notequal_lits_count P + notequal_lits_count Q |
38864
4abe644fcea5
formerly unnamed infix equality now named HOL.eq
haftmann
parents:
38806
diff
changeset
|
210 |
| notequal_lits_count (Const(@{const_name Not},_) $ (Const(@{const_name HOL.eq},_) $ _ $ _)) = 1 |
18389 | 211 |
| notequal_lits_count _ = 0; |
212 |
||
213 |
(*Simplify a clause by applying reflexivity to its negated equality literals*) |
|
24300 | 214 |
fun refl_clause th = |
18389 | 215 |
let val neqs = notequal_lits_count (HOLogic.dest_Trueprop (concl_of th)) |
19894 | 216 |
in zero_var_indexes (refl_clause_aux neqs th) end |
24300 | 217 |
handle TERM _ => th; (*probably dest_Trueprop on a weird theorem*) |
18389 | 218 |
|
219 |
||
24937
340523598914
context-based treatment of generalization; also handling TFrees in axiom clauses
paulson
parents:
24827
diff
changeset
|
220 |
(*** Removal of duplicate literals ***) |
340523598914
context-based treatment of generalization; also handling TFrees in axiom clauses
paulson
parents:
24827
diff
changeset
|
221 |
|
340523598914
context-based treatment of generalization; also handling TFrees in axiom clauses
paulson
parents:
24827
diff
changeset
|
222 |
(*Forward proof, passing extra assumptions as theorems to the tactic*) |
39328 | 223 |
fun forward_res2 nf hyps st = |
24937
340523598914
context-based treatment of generalization; also handling TFrees in axiom clauses
paulson
parents:
24827
diff
changeset
|
224 |
case Seq.pull |
340523598914
context-based treatment of generalization; also handling TFrees in axiom clauses
paulson
parents:
24827
diff
changeset
|
225 |
(REPEAT |
37781
2fbbf0a48cef
moved misc legacy stuff from OldGoals to Misc_Legacy;
wenzelm
parents:
37539
diff
changeset
|
226 |
(Misc_Legacy.METAHYPS (fn major::minors => rtac (nf (minors@hyps) major) 1) 1) |
24937
340523598914
context-based treatment of generalization; also handling TFrees in axiom clauses
paulson
parents:
24827
diff
changeset
|
227 |
st) |
340523598914
context-based treatment of generalization; also handling TFrees in axiom clauses
paulson
parents:
24827
diff
changeset
|
228 |
of SOME(th,_) => th |
340523598914
context-based treatment of generalization; also handling TFrees in axiom clauses
paulson
parents:
24827
diff
changeset
|
229 |
| NONE => raise THM("forward_res2", 0, [st]); |
340523598914
context-based treatment of generalization; also handling TFrees in axiom clauses
paulson
parents:
24827
diff
changeset
|
230 |
|
340523598914
context-based treatment of generalization; also handling TFrees in axiom clauses
paulson
parents:
24827
diff
changeset
|
231 |
(*Remove duplicates in P|Q by assuming ~P in Q |
340523598914
context-based treatment of generalization; also handling TFrees in axiom clauses
paulson
parents:
24827
diff
changeset
|
232 |
rls (initially []) accumulates assumptions of the form P==>False*) |
32262 | 233 |
fun nodups_aux ctxt rls th = nodups_aux ctxt rls (th RS disj_assoc) |
24937
340523598914
context-based treatment of generalization; also handling TFrees in axiom clauses
paulson
parents:
24827
diff
changeset
|
234 |
handle THM _ => tryres(th,rls) |
39328 | 235 |
handle THM _ => tryres(forward_res2 (nodups_aux ctxt) rls (th RS disj_forward2), |
24937
340523598914
context-based treatment of generalization; also handling TFrees in axiom clauses
paulson
parents:
24827
diff
changeset
|
236 |
[disj_FalseD1, disj_FalseD2, asm_rl]) |
340523598914
context-based treatment of generalization; also handling TFrees in axiom clauses
paulson
parents:
24827
diff
changeset
|
237 |
handle THM _ => th; |
340523598914
context-based treatment of generalization; also handling TFrees in axiom clauses
paulson
parents:
24827
diff
changeset
|
238 |
|
340523598914
context-based treatment of generalization; also handling TFrees in axiom clauses
paulson
parents:
24827
diff
changeset
|
239 |
(*Remove duplicate literals, if there are any*) |
32262 | 240 |
fun nodups ctxt th = |
24937
340523598914
context-based treatment of generalization; also handling TFrees in axiom clauses
paulson
parents:
24827
diff
changeset
|
241 |
if has_duplicates (op =) (literals (prop_of th)) |
32262 | 242 |
then nodups_aux ctxt [] th |
24937
340523598914
context-based treatment of generalization; also handling TFrees in axiom clauses
paulson
parents:
24827
diff
changeset
|
243 |
else th; |
340523598914
context-based treatment of generalization; also handling TFrees in axiom clauses
paulson
parents:
24827
diff
changeset
|
244 |
|
340523598914
context-based treatment of generalization; also handling TFrees in axiom clauses
paulson
parents:
24827
diff
changeset
|
245 |
|
18389 | 246 |
(*** The basic CNF transformation ***) |
247 |
||
39328 | 248 |
fun estimated_num_clauses bound t = |
26562
9d25ef112cf6
* Metis: the maximum number of clauses that can be produced from a theorem is now given by the attribute max_clauses. Theorems that exceed this number are ignored, with a warning printed.
paulson
parents:
26424
diff
changeset
|
249 |
let |
39269
c2795d8a2461
use definitional CNF for the goal if at least one of the premisses would lead to too many clauses in Meson
blanchet
parents:
39159
diff
changeset
|
250 |
fun sum x y = if x < bound andalso y < bound then x+y else bound |
c2795d8a2461
use definitional CNF for the goal if at least one of the premisses would lead to too many clauses in Meson
blanchet
parents:
39159
diff
changeset
|
251 |
fun prod x y = if x < bound andalso y < bound then x*y else bound |
26562
9d25ef112cf6
* Metis: the maximum number of clauses that can be produced from a theorem is now given by the attribute max_clauses. Theorems that exceed this number are ignored, with a warning printed.
paulson
parents:
26424
diff
changeset
|
252 |
|
9d25ef112cf6
* Metis: the maximum number of clauses that can be produced from a theorem is now given by the attribute max_clauses. Theorems that exceed this number are ignored, with a warning printed.
paulson
parents:
26424
diff
changeset
|
253 |
(*Estimate the number of clauses in order to detect infeasible theorems*) |
38557 | 254 |
fun signed_nclauses b (Const(@{const_name Trueprop},_) $ t) = signed_nclauses b t |
255 |
| signed_nclauses b (Const(@{const_name Not},_) $ t) = signed_nclauses (not b) t |
|
38795
848be46708dc
formerly unnamed infix conjunction and disjunction now named HOL.conj and HOL.disj
haftmann
parents:
38786
diff
changeset
|
256 |
| signed_nclauses b (Const(@{const_name HOL.conj},_) $ t $ u) = |
32960
69916a850301
eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents:
32955
diff
changeset
|
257 |
if b then sum (signed_nclauses b t) (signed_nclauses b u) |
69916a850301
eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents:
32955
diff
changeset
|
258 |
else prod (signed_nclauses b t) (signed_nclauses b u) |
38795
848be46708dc
formerly unnamed infix conjunction and disjunction now named HOL.conj and HOL.disj
haftmann
parents:
38786
diff
changeset
|
259 |
| signed_nclauses b (Const(@{const_name HOL.disj},_) $ t $ u) = |
32960
69916a850301
eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents:
32955
diff
changeset
|
260 |
if b then prod (signed_nclauses b t) (signed_nclauses b u) |
69916a850301
eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents:
32955
diff
changeset
|
261 |
else sum (signed_nclauses b t) (signed_nclauses b u) |
38786
e46e7a9cb622
formerly unnamed infix impliciation now named HOL.implies
haftmann
parents:
38709
diff
changeset
|
262 |
| signed_nclauses b (Const(@{const_name HOL.implies},_) $ t $ u) = |
32960
69916a850301
eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents:
32955
diff
changeset
|
263 |
if b then prod (signed_nclauses (not b) t) (signed_nclauses b u) |
69916a850301
eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents:
32955
diff
changeset
|
264 |
else sum (signed_nclauses (not b) t) (signed_nclauses b u) |
38864
4abe644fcea5
formerly unnamed infix equality now named HOL.eq
haftmann
parents:
38806
diff
changeset
|
265 |
| signed_nclauses b (Const(@{const_name HOL.eq}, Type ("fun", [T, _])) $ t $ u) = |
32960
69916a850301
eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents:
32955
diff
changeset
|
266 |
if T = HOLogic.boolT then (*Boolean equality is if-and-only-if*) |
69916a850301
eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents:
32955
diff
changeset
|
267 |
if b then sum (prod (signed_nclauses (not b) t) (signed_nclauses b u)) |
69916a850301
eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents:
32955
diff
changeset
|
268 |
(prod (signed_nclauses (not b) u) (signed_nclauses b t)) |
69916a850301
eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents:
32955
diff
changeset
|
269 |
else sum (prod (signed_nclauses b t) (signed_nclauses b u)) |
69916a850301
eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents:
32955
diff
changeset
|
270 |
(prod (signed_nclauses (not b) t) (signed_nclauses (not b) u)) |
69916a850301
eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents:
32955
diff
changeset
|
271 |
else 1 |
38557 | 272 |
| signed_nclauses b (Const(@{const_name Ex}, _) $ Abs (_,_,t)) = signed_nclauses b t |
273 |
| signed_nclauses b (Const(@{const_name All},_) $ Abs (_,_,t)) = signed_nclauses b t |
|
26562
9d25ef112cf6
* Metis: the maximum number of clauses that can be produced from a theorem is now given by the attribute max_clauses. Theorems that exceed this number are ignored, with a warning printed.
paulson
parents:
26424
diff
changeset
|
274 |
| signed_nclauses _ _ = 1; (* literal *) |
39269
c2795d8a2461
use definitional CNF for the goal if at least one of the premisses would lead to too many clauses in Meson
blanchet
parents:
39159
diff
changeset
|
275 |
in signed_nclauses true t end |
c2795d8a2461
use definitional CNF for the goal if at least one of the premisses would lead to too many clauses in Meson
blanchet
parents:
39159
diff
changeset
|
276 |
|
c2795d8a2461
use definitional CNF for the goal if at least one of the premisses would lead to too many clauses in Meson
blanchet
parents:
39159
diff
changeset
|
277 |
fun has_too_many_clauses ctxt t = |
c2795d8a2461
use definitional CNF for the goal if at least one of the premisses would lead to too many clauses in Meson
blanchet
parents:
39159
diff
changeset
|
278 |
let val max_cl = Config.get ctxt max_clauses in |
39328 | 279 |
estimated_num_clauses (max_cl + 1) t > max_cl |
39269
c2795d8a2461
use definitional CNF for the goal if at least one of the premisses would lead to too many clauses in Meson
blanchet
parents:
39159
diff
changeset
|
280 |
end |
19894 | 281 |
|
15579
32bee18c675f
Tools/meson.ML: signature, structure and "open" rather than "local"
paulson
parents:
15574
diff
changeset
|
282 |
(*Replaces universally quantified variables by FREE variables -- because |
24937
340523598914
context-based treatment of generalization; also handling TFrees in axiom clauses
paulson
parents:
24827
diff
changeset
|
283 |
assumptions may not contain scheme variables. Later, generalize using Variable.export. *) |
340523598914
context-based treatment of generalization; also handling TFrees in axiom clauses
paulson
parents:
24827
diff
changeset
|
284 |
local |
340523598914
context-based treatment of generalization; also handling TFrees in axiom clauses
paulson
parents:
24827
diff
changeset
|
285 |
val spec_var = Thm.dest_arg (Thm.dest_arg (#2 (Thm.dest_implies (Thm.cprop_of spec)))); |
340523598914
context-based treatment of generalization; also handling TFrees in axiom clauses
paulson
parents:
24827
diff
changeset
|
286 |
val spec_varT = #T (Thm.rep_cterm spec_var); |
38557 | 287 |
fun name_of (Const (@{const_name All}, _) $ Abs(x,_,_)) = x | name_of _ = Name.uu; |
24937
340523598914
context-based treatment of generalization; also handling TFrees in axiom clauses
paulson
parents:
24827
diff
changeset
|
288 |
in |
340523598914
context-based treatment of generalization; also handling TFrees in axiom clauses
paulson
parents:
24827
diff
changeset
|
289 |
fun freeze_spec th ctxt = |
340523598914
context-based treatment of generalization; also handling TFrees in axiom clauses
paulson
parents:
24827
diff
changeset
|
290 |
let |
340523598914
context-based treatment of generalization; also handling TFrees in axiom clauses
paulson
parents:
24827
diff
changeset
|
291 |
val cert = Thm.cterm_of (ProofContext.theory_of ctxt); |
340523598914
context-based treatment of generalization; also handling TFrees in axiom clauses
paulson
parents:
24827
diff
changeset
|
292 |
val ([x], ctxt') = Variable.variant_fixes [name_of (HOLogic.dest_Trueprop (concl_of th))] ctxt; |
340523598914
context-based treatment of generalization; also handling TFrees in axiom clauses
paulson
parents:
24827
diff
changeset
|
293 |
val spec' = Thm.instantiate ([], [(spec_var, cert (Free (x, spec_varT)))]) spec; |
340523598914
context-based treatment of generalization; also handling TFrees in axiom clauses
paulson
parents:
24827
diff
changeset
|
294 |
in (th RS spec', ctxt') end |
340523598914
context-based treatment of generalization; also handling TFrees in axiom clauses
paulson
parents:
24827
diff
changeset
|
295 |
end; |
9840
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
296 |
|
15998
bc916036cf84
new cnf function taking Skolemization theorems as an extra argument
paulson
parents:
15965
diff
changeset
|
297 |
(*Used with METAHYPS below. There is one assumption, which gets bound to prem |
bc916036cf84
new cnf function taking Skolemization theorems as an extra argument
paulson
parents:
15965
diff
changeset
|
298 |
and then normalized via function nf. The normal form is given to resolve_tac, |
22515
f4061faa5fda
"generalize" now replaces ugly mes_XXX generated symbols by 1-letter identifiers.
paulson
parents:
22381
diff
changeset
|
299 |
instantiate a Boolean variable created by resolution with disj_forward. Since |
f4061faa5fda
"generalize" now replaces ugly mes_XXX generated symbols by 1-letter identifiers.
paulson
parents:
22381
diff
changeset
|
300 |
(nf prem) returns a LIST of theorems, we can backtrack to get all combinations.*) |
15579
32bee18c675f
Tools/meson.ML: signature, structure and "open" rather than "local"
paulson
parents:
15574
diff
changeset
|
301 |
fun resop nf [prem] = resolve_tac (nf prem) 1; |
9840
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
302 |
|
39037
5146d640aa4a
Let MESON take an additional "preskolemization tactic", which can be used to put the goal in definitional CNF
blanchet
parents:
38864
diff
changeset
|
303 |
(* Any need to extend this list with "HOL.type_class", "HOL.eq_class", |
5146d640aa4a
Let MESON take an additional "preskolemization tactic", which can be used to put the goal in definitional CNF
blanchet
parents:
38864
diff
changeset
|
304 |
and "Pure.term"? *) |
38557 | 305 |
val has_meta_conn = exists_Const (member (op =) ["==", "==>", "=simp=>", "all", "prop"] o #1); |
20417
c611b1412056
better skolemization, using first-order resolution rather than hoping for the right result
paulson
parents:
20361
diff
changeset
|
306 |
|
37410
2bf7e6136047
adjusted the polymorphism handling of Skolem constants so that proof reconstruction doesn't fail in "equality_inf"
blanchet
parents:
37398
diff
changeset
|
307 |
fun apply_skolem_theorem (th, rls) = |
37398
e194213451c9
beta-eta-contract, to respect "first_order_match"'s specification;
blanchet
parents:
37388
diff
changeset
|
308 |
let |
37410
2bf7e6136047
adjusted the polymorphism handling of Skolem constants so that proof reconstruction doesn't fail in "equality_inf"
blanchet
parents:
37398
diff
changeset
|
309 |
fun tryall [] = raise THM ("apply_skolem_theorem", 0, th::rls) |
37398
e194213451c9
beta-eta-contract, to respect "first_order_match"'s specification;
blanchet
parents:
37388
diff
changeset
|
310 |
| tryall (rl :: rls) = |
e194213451c9
beta-eta-contract, to respect "first_order_match"'s specification;
blanchet
parents:
37388
diff
changeset
|
311 |
first_order_resolve th rl handle THM _ => tryall rls |
e194213451c9
beta-eta-contract, to respect "first_order_match"'s specification;
blanchet
parents:
37388
diff
changeset
|
312 |
in tryall rls end |
22515
f4061faa5fda
"generalize" now replaces ugly mes_XXX generated symbols by 1-letter identifiers.
paulson
parents:
22381
diff
changeset
|
313 |
|
37410
2bf7e6136047
adjusted the polymorphism handling of Skolem constants so that proof reconstruction doesn't fail in "equality_inf"
blanchet
parents:
37398
diff
changeset
|
314 |
(* Conjunctive normal form, adding clauses from th in front of ths (for foldr). |
2bf7e6136047
adjusted the polymorphism handling of Skolem constants so that proof reconstruction doesn't fail in "equality_inf"
blanchet
parents:
37398
diff
changeset
|
315 |
Strips universal quantifiers and breaks up conjunctions. |
2bf7e6136047
adjusted the polymorphism handling of Skolem constants so that proof reconstruction doesn't fail in "equality_inf"
blanchet
parents:
37398
diff
changeset
|
316 |
Eliminates existential quantifiers using Skolemization theorems. *) |
39886
8a9f0c97d550
first step towards a new skolemizer that doesn't require "Eps"
blanchet
parents:
39328
diff
changeset
|
317 |
fun cnf old_skolem_ths ctxt (th, ths) = |
33222 | 318 |
let val ctxtr = Unsynchronized.ref ctxt (* FIXME ??? *) |
24937
340523598914
context-based treatment of generalization; also handling TFrees in axiom clauses
paulson
parents:
24827
diff
changeset
|
319 |
fun cnf_aux (th,ths) = |
24300 | 320 |
if not (can HOLogic.dest_Trueprop (prop_of th)) then ths (*meta-level: ignore*) |
38795
848be46708dc
formerly unnamed infix conjunction and disjunction now named HOL.conj and HOL.disj
haftmann
parents:
38786
diff
changeset
|
321 |
else if not (has_conns [@{const_name All}, @{const_name Ex}, @{const_name HOL.conj}] (prop_of th)) |
32262 | 322 |
then nodups ctxt th :: ths (*no work to do, terminate*) |
24300 | 323 |
else case head_of (HOLogic.dest_Trueprop (concl_of th)) of |
38795
848be46708dc
formerly unnamed infix conjunction and disjunction now named HOL.conj and HOL.disj
haftmann
parents:
38786
diff
changeset
|
324 |
Const (@{const_name HOL.conj}, _) => (*conjunction*) |
24300 | 325 |
cnf_aux (th RS conjunct1, cnf_aux (th RS conjunct2, ths)) |
38557 | 326 |
| Const (@{const_name All}, _) => (*universal quantifier*) |
24937
340523598914
context-based treatment of generalization; also handling TFrees in axiom clauses
paulson
parents:
24827
diff
changeset
|
327 |
let val (th',ctxt') = freeze_spec th (!ctxtr) |
340523598914
context-based treatment of generalization; also handling TFrees in axiom clauses
paulson
parents:
24827
diff
changeset
|
328 |
in ctxtr := ctxt'; cnf_aux (th', ths) end |
38557 | 329 |
| Const (@{const_name Ex}, _) => |
24300 | 330 |
(*existential quantifier: Insert Skolem functions*) |
39886
8a9f0c97d550
first step towards a new skolemizer that doesn't require "Eps"
blanchet
parents:
39328
diff
changeset
|
331 |
cnf_aux (apply_skolem_theorem (th, old_skolem_ths), ths) |
38795
848be46708dc
formerly unnamed infix conjunction and disjunction now named HOL.conj and HOL.disj
haftmann
parents:
38786
diff
changeset
|
332 |
| Const (@{const_name HOL.disj}, _) => |
24300 | 333 |
(*Disjunction of P, Q: Create new goal of proving ?P | ?Q and solve it using |
334 |
all combinations of converting P, Q to CNF.*) |
|
335 |
let val tac = |
|
37781
2fbbf0a48cef
moved misc legacy stuff from OldGoals to Misc_Legacy;
wenzelm
parents:
37539
diff
changeset
|
336 |
Misc_Legacy.METAHYPS (resop cnf_nil) 1 THEN |
2fbbf0a48cef
moved misc legacy stuff from OldGoals to Misc_Legacy;
wenzelm
parents:
37539
diff
changeset
|
337 |
(fn st' => st' |> Misc_Legacy.METAHYPS (resop cnf_nil) 1) |
24300 | 338 |
in Seq.list_of (tac (th RS disj_forward)) @ ths end |
32262 | 339 |
| _ => nodups ctxt th :: ths (*no work to do*) |
19154 | 340 |
and cnf_nil th = cnf_aux (th,[]) |
39269
c2795d8a2461
use definitional CNF for the goal if at least one of the premisses would lead to too many clauses in Meson
blanchet
parents:
39159
diff
changeset
|
341 |
val cls = |
c2795d8a2461
use definitional CNF for the goal if at least one of the premisses would lead to too many clauses in Meson
blanchet
parents:
39159
diff
changeset
|
342 |
if has_too_many_clauses ctxt (concl_of th) |
32960
69916a850301
eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents:
32955
diff
changeset
|
343 |
then (trace_msg (fn () => "cnf is ignoring: " ^ Display.string_of_thm ctxt th); ths) |
69916a850301
eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents:
32955
diff
changeset
|
344 |
else cnf_aux (th,ths) |
24937
340523598914
context-based treatment of generalization; also handling TFrees in axiom clauses
paulson
parents:
24827
diff
changeset
|
345 |
in (cls, !ctxtr) end; |
22515
f4061faa5fda
"generalize" now replaces ugly mes_XXX generated symbols by 1-letter identifiers.
paulson
parents:
22381
diff
changeset
|
346 |
|
39886
8a9f0c97d550
first step towards a new skolemizer that doesn't require "Eps"
blanchet
parents:
39328
diff
changeset
|
347 |
fun make_cnf old_skolem_ths th ctxt = cnf old_skolem_ths ctxt (th, []) |
20417
c611b1412056
better skolemization, using first-order resolution rather than hoping for the right result
paulson
parents:
20361
diff
changeset
|
348 |
|
c611b1412056
better skolemization, using first-order resolution rather than hoping for the right result
paulson
parents:
20361
diff
changeset
|
349 |
(*Generalization, removal of redundant equalities, removal of tautologies.*) |
24937
340523598914
context-based treatment of generalization; also handling TFrees in axiom clauses
paulson
parents:
24827
diff
changeset
|
350 |
fun finish_cnf ths = filter (not o is_taut) (map refl_clause ths); |
9840
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
351 |
|
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
352 |
|
15579
32bee18c675f
Tools/meson.ML: signature, structure and "open" rather than "local"
paulson
parents:
15574
diff
changeset
|
353 |
(**** Generation of contrapositives ****) |
9840
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
354 |
|
38557 | 355 |
fun is_left (Const (@{const_name Trueprop}, _) $ |
38795
848be46708dc
formerly unnamed infix conjunction and disjunction now named HOL.conj and HOL.disj
haftmann
parents:
38786
diff
changeset
|
356 |
(Const (@{const_name HOL.disj}, _) $ (Const (@{const_name HOL.disj}, _) $ _ $ _) $ _)) = true |
21102
7f2ebe5c5b72
Conversion to clause form now tolerates Boolean variables without looping.
paulson
parents:
21095
diff
changeset
|
357 |
| is_left _ = false; |
24300 | 358 |
|
15579
32bee18c675f
Tools/meson.ML: signature, structure and "open" rather than "local"
paulson
parents:
15574
diff
changeset
|
359 |
(*Associate disjuctions to right -- make leftmost disjunct a LITERAL*) |
24300 | 360 |
fun assoc_right th = |
21102
7f2ebe5c5b72
Conversion to clause form now tolerates Boolean variables without looping.
paulson
parents:
21095
diff
changeset
|
361 |
if is_left (prop_of th) then assoc_right (th RS disj_assoc) |
7f2ebe5c5b72
Conversion to clause form now tolerates Boolean variables without looping.
paulson
parents:
21095
diff
changeset
|
362 |
else th; |
9840
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
363 |
|
15579
32bee18c675f
Tools/meson.ML: signature, structure and "open" rather than "local"
paulson
parents:
15574
diff
changeset
|
364 |
(*Must check for negative literal first!*) |
32bee18c675f
Tools/meson.ML: signature, structure and "open" rather than "local"
paulson
parents:
15574
diff
changeset
|
365 |
val clause_rules = [disj_assoc, make_neg_rule, make_pos_rule]; |
9840
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
366 |
|
15579
32bee18c675f
Tools/meson.ML: signature, structure and "open" rather than "local"
paulson
parents:
15574
diff
changeset
|
367 |
(*For ordinary resolution. *) |
32bee18c675f
Tools/meson.ML: signature, structure and "open" rather than "local"
paulson
parents:
15574
diff
changeset
|
368 |
val resolution_clause_rules = [disj_assoc, make_neg_rule', make_pos_rule']; |
9840
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
369 |
|
15579
32bee18c675f
Tools/meson.ML: signature, structure and "open" rather than "local"
paulson
parents:
15574
diff
changeset
|
370 |
(*Create a goal or support clause, conclusing False*) |
32bee18c675f
Tools/meson.ML: signature, structure and "open" rather than "local"
paulson
parents:
15574
diff
changeset
|
371 |
fun make_goal th = (*Must check for negative literal first!*) |
32bee18c675f
Tools/meson.ML: signature, structure and "open" rather than "local"
paulson
parents:
15574
diff
changeset
|
372 |
make_goal (tryres(th, clause_rules)) |
32bee18c675f
Tools/meson.ML: signature, structure and "open" rather than "local"
paulson
parents:
15574
diff
changeset
|
373 |
handle THM _ => tryres(th, [make_neg_goal, make_pos_goal]); |
9840
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
374 |
|
15579
32bee18c675f
Tools/meson.ML: signature, structure and "open" rather than "local"
paulson
parents:
15574
diff
changeset
|
375 |
(*Sort clauses by number of literals*) |
32bee18c675f
Tools/meson.ML: signature, structure and "open" rather than "local"
paulson
parents:
15574
diff
changeset
|
376 |
fun fewerlits(th1,th2) = nliterals(prop_of th1) < nliterals(prop_of th2); |
9840
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
377 |
|
18389 | 378 |
fun sort_clauses ths = sort (make_ord fewerlits) ths; |
9840
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
379 |
|
38099
e3bb96b83807
fix Meson's definition of first-orderness to prevent errors later on elsewhere (e.g. in Metis)
blanchet
parents:
38089
diff
changeset
|
380 |
fun has_bool @{typ bool} = true |
e3bb96b83807
fix Meson's definition of first-orderness to prevent errors later on elsewhere (e.g. in Metis)
blanchet
parents:
38089
diff
changeset
|
381 |
| has_bool (Type (_, Ts)) = exists has_bool Ts |
e3bb96b83807
fix Meson's definition of first-orderness to prevent errors later on elsewhere (e.g. in Metis)
blanchet
parents:
38089
diff
changeset
|
382 |
| has_bool _ = false |
e3bb96b83807
fix Meson's definition of first-orderness to prevent errors later on elsewhere (e.g. in Metis)
blanchet
parents:
38089
diff
changeset
|
383 |
|
e3bb96b83807
fix Meson's definition of first-orderness to prevent errors later on elsewhere (e.g. in Metis)
blanchet
parents:
38089
diff
changeset
|
384 |
fun has_fun (Type (@{type_name fun}, _)) = true |
e3bb96b83807
fix Meson's definition of first-orderness to prevent errors later on elsewhere (e.g. in Metis)
blanchet
parents:
38089
diff
changeset
|
385 |
| has_fun (Type (_, Ts)) = exists has_fun Ts |
e3bb96b83807
fix Meson's definition of first-orderness to prevent errors later on elsewhere (e.g. in Metis)
blanchet
parents:
38089
diff
changeset
|
386 |
| has_fun _ = false |
24300 | 387 |
|
388 |
(*Is the string the name of a connective? Really only | and Not can remain, |
|
389 |
since this code expects to be called on a clause form.*) |
|
19875 | 390 |
val is_conn = member (op =) |
38795
848be46708dc
formerly unnamed infix conjunction and disjunction now named HOL.conj and HOL.disj
haftmann
parents:
38786
diff
changeset
|
391 |
[@{const_name Trueprop}, @{const_name HOL.conj}, @{const_name HOL.disj}, |
38786
e46e7a9cb622
formerly unnamed infix impliciation now named HOL.implies
haftmann
parents:
38709
diff
changeset
|
392 |
@{const_name HOL.implies}, @{const_name Not}, |
38557 | 393 |
@{const_name All}, @{const_name Ex}, @{const_name Ball}, @{const_name Bex}]; |
15613 | 394 |
|
24300 | 395 |
(*True if the term contains a function--not a logical connective--where the type |
20524
1493053fc111
Tweaks to is_fol_term, the first-order test. We don't count "=" as a connective
paulson
parents:
20417
diff
changeset
|
396 |
of any argument contains bool.*) |
24300 | 397 |
val has_bool_arg_const = |
15613 | 398 |
exists_Const |
38099
e3bb96b83807
fix Meson's definition of first-orderness to prevent errors later on elsewhere (e.g. in Metis)
blanchet
parents:
38089
diff
changeset
|
399 |
(fn (c,T) => not(is_conn c) andalso exists has_bool (binder_types T)); |
22381
cb145d434284
The first-order test now tests for the obscure case of a polymorphic constant like 1 being
paulson
parents:
22360
diff
changeset
|
400 |
|
24300 | 401 |
(*A higher-order instance of a first-order constant? Example is the definition of |
38622 | 402 |
one, 1, at a function type in theory Function_Algebras.*) |
24300 | 403 |
fun higher_inst_const thy (c,T) = |
22381
cb145d434284
The first-order test now tests for the obscure case of a polymorphic constant like 1 being
paulson
parents:
22360
diff
changeset
|
404 |
case binder_types T of |
cb145d434284
The first-order test now tests for the obscure case of a polymorphic constant like 1 being
paulson
parents:
22360
diff
changeset
|
405 |
[] => false (*not a function type, OK*) |
cb145d434284
The first-order test now tests for the obscure case of a polymorphic constant like 1 being
paulson
parents:
22360
diff
changeset
|
406 |
| Ts => length (binder_types (Sign.the_const_type thy c)) <> length Ts; |
cb145d434284
The first-order test now tests for the obscure case of a polymorphic constant like 1 being
paulson
parents:
22360
diff
changeset
|
407 |
|
24742
73b8b42a36b6
removal of some "ref"s from res_axioms.ML; a side-effect is that the ordering
paulson
parents:
24300
diff
changeset
|
408 |
(*Returns false if any Vars in the theorem mention type bool. |
21102
7f2ebe5c5b72
Conversion to clause form now tolerates Boolean variables without looping.
paulson
parents:
21095
diff
changeset
|
409 |
Also rejects functions whose arguments are Booleans or other functions.*) |
22381
cb145d434284
The first-order test now tests for the obscure case of a polymorphic constant like 1 being
paulson
parents:
22360
diff
changeset
|
410 |
fun is_fol_term thy t = |
38557 | 411 |
Term.is_first_order ["all", @{const_name All}, @{const_name Ex}] t andalso |
38099
e3bb96b83807
fix Meson's definition of first-orderness to prevent errors later on elsewhere (e.g. in Metis)
blanchet
parents:
38089
diff
changeset
|
412 |
not (exists_subterm (fn Var (_, T) => has_bool T orelse has_fun T |
e3bb96b83807
fix Meson's definition of first-orderness to prevent errors later on elsewhere (e.g. in Metis)
blanchet
parents:
38089
diff
changeset
|
413 |
| _ => false) t orelse |
e3bb96b83807
fix Meson's definition of first-orderness to prevent errors later on elsewhere (e.g. in Metis)
blanchet
parents:
38089
diff
changeset
|
414 |
has_bool_arg_const t orelse |
24300 | 415 |
exists_Const (higher_inst_const thy) t orelse |
416 |
has_meta_conn t); |
|
19204
b8f7de7ef629
Tidying, and getting rid of SELECT_GOAL (as it does something different now)
paulson
parents:
19154
diff
changeset
|
417 |
|
21102
7f2ebe5c5b72
Conversion to clause form now tolerates Boolean variables without looping.
paulson
parents:
21095
diff
changeset
|
418 |
fun rigid t = not (is_Var (head_of t)); |
7f2ebe5c5b72
Conversion to clause form now tolerates Boolean variables without looping.
paulson
parents:
21095
diff
changeset
|
419 |
|
38795
848be46708dc
formerly unnamed infix conjunction and disjunction now named HOL.conj and HOL.disj
haftmann
parents:
38786
diff
changeset
|
420 |
fun ok4horn (Const (@{const_name Trueprop},_) $ (Const (@{const_name HOL.disj}, _) $ t $ _)) = rigid t |
38557 | 421 |
| ok4horn (Const (@{const_name Trueprop},_) $ t) = rigid t |
21102
7f2ebe5c5b72
Conversion to clause form now tolerates Boolean variables without looping.
paulson
parents:
21095
diff
changeset
|
422 |
| ok4horn _ = false; |
7f2ebe5c5b72
Conversion to clause form now tolerates Boolean variables without looping.
paulson
parents:
21095
diff
changeset
|
423 |
|
15579
32bee18c675f
Tools/meson.ML: signature, structure and "open" rather than "local"
paulson
parents:
15574
diff
changeset
|
424 |
(*Create a meta-level Horn clause*) |
24300 | 425 |
fun make_horn crules th = |
426 |
if ok4horn (concl_of th) |
|
21102
7f2ebe5c5b72
Conversion to clause form now tolerates Boolean variables without looping.
paulson
parents:
21095
diff
changeset
|
427 |
then make_horn crules (tryres(th,crules)) handle THM _ => th |
7f2ebe5c5b72
Conversion to clause form now tolerates Boolean variables without looping.
paulson
parents:
21095
diff
changeset
|
428 |
else th; |
9840
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
429 |
|
16563 | 430 |
(*Generate Horn clauses for all contrapositives of a clause. The input, th, |
431 |
is a HOL disjunction.*) |
|
33339 | 432 |
fun add_contras crules th hcs = |
39328 | 433 |
let fun rots (0,_) = hcs |
24300 | 434 |
| rots (k,th) = zero_var_indexes (make_horn crules th) :: |
435 |
rots(k-1, assoc_right (th RS disj_comm)) |
|
15862 | 436 |
in case nliterals(prop_of th) of |
24300 | 437 |
1 => th::hcs |
15579
32bee18c675f
Tools/meson.ML: signature, structure and "open" rather than "local"
paulson
parents:
15574
diff
changeset
|
438 |
| n => rots(n, assoc_right th) |
32bee18c675f
Tools/meson.ML: signature, structure and "open" rather than "local"
paulson
parents:
15574
diff
changeset
|
439 |
end; |
9840
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
440 |
|
15579
32bee18c675f
Tools/meson.ML: signature, structure and "open" rather than "local"
paulson
parents:
15574
diff
changeset
|
441 |
(*Use "theorem naming" to label the clauses*) |
32bee18c675f
Tools/meson.ML: signature, structure and "open" rather than "local"
paulson
parents:
15574
diff
changeset
|
442 |
fun name_thms label = |
33339 | 443 |
let fun name1 th (k, ths) = |
27865
27a8ad9612a3
moved basic thm operations from structure PureThy to Thm (cf. more_thm.ML);
wenzelm
parents:
27239
diff
changeset
|
444 |
(k-1, Thm.put_name_hint (label ^ string_of_int k) th :: ths) |
33339 | 445 |
in fn ths => #2 (fold_rev name1 ths (length ths, [])) end; |
9840
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
446 |
|
16563 | 447 |
(*Is the given disjunction an all-negative support clause?*) |
15579
32bee18c675f
Tools/meson.ML: signature, structure and "open" rather than "local"
paulson
parents:
15574
diff
changeset
|
448 |
fun is_negative th = forall (not o #1) (literals (prop_of th)); |
9840
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
449 |
|
33317 | 450 |
val neg_clauses = filter is_negative; |
9840
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
451 |
|
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
452 |
|
15579
32bee18c675f
Tools/meson.ML: signature, structure and "open" rather than "local"
paulson
parents:
15574
diff
changeset
|
453 |
(***** MESON PROOF PROCEDURE *****) |
9840
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
454 |
|
38557 | 455 |
fun rhyps (Const("==>",_) $ (Const(@{const_name Trueprop},_) $ A) $ phi, |
24300 | 456 |
As) = rhyps(phi, A::As) |
15579
32bee18c675f
Tools/meson.ML: signature, structure and "open" rather than "local"
paulson
parents:
15574
diff
changeset
|
457 |
| rhyps (_, As) = As; |
9840
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
458 |
|
15579
32bee18c675f
Tools/meson.ML: signature, structure and "open" rather than "local"
paulson
parents:
15574
diff
changeset
|
459 |
(** Detecting repeated assumptions in a subgoal **) |
9840
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
460 |
|
15579
32bee18c675f
Tools/meson.ML: signature, structure and "open" rather than "local"
paulson
parents:
15574
diff
changeset
|
461 |
(*The stringtree detects repeated assumptions.*) |
33245 | 462 |
fun ins_term t net = Net.insert_term (op aconv) (t, t) net; |
9840
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
463 |
|
15579
32bee18c675f
Tools/meson.ML: signature, structure and "open" rather than "local"
paulson
parents:
15574
diff
changeset
|
464 |
(*detects repetitions in a list of terms*) |
32bee18c675f
Tools/meson.ML: signature, structure and "open" rather than "local"
paulson
parents:
15574
diff
changeset
|
465 |
fun has_reps [] = false |
32bee18c675f
Tools/meson.ML: signature, structure and "open" rather than "local"
paulson
parents:
15574
diff
changeset
|
466 |
| has_reps [_] = false |
32bee18c675f
Tools/meson.ML: signature, structure and "open" rather than "local"
paulson
parents:
15574
diff
changeset
|
467 |
| has_reps [t,u] = (t aconv u) |
33245 | 468 |
| has_reps ts = (fold ins_term ts Net.empty; false) handle Net.INSERT => true; |
9840
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
469 |
|
15579
32bee18c675f
Tools/meson.ML: signature, structure and "open" rather than "local"
paulson
parents:
15574
diff
changeset
|
470 |
(*Like TRYALL eq_assume_tac, but avoids expensive THEN calls*) |
18508 | 471 |
fun TRYING_eq_assume_tac 0 st = Seq.single st |
472 |
| TRYING_eq_assume_tac i st = |
|
31945 | 473 |
TRYING_eq_assume_tac (i-1) (Thm.eq_assumption i st) |
18508 | 474 |
handle THM _ => TRYING_eq_assume_tac (i-1) st; |
475 |
||
476 |
fun TRYALL_eq_assume_tac st = TRYING_eq_assume_tac (nprems_of st) st; |
|
9840
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
477 |
|
15579
32bee18c675f
Tools/meson.ML: signature, structure and "open" rather than "local"
paulson
parents:
15574
diff
changeset
|
478 |
(*Loop checking: FAIL if trying to prove the same thing twice |
32bee18c675f
Tools/meson.ML: signature, structure and "open" rather than "local"
paulson
parents:
15574
diff
changeset
|
479 |
-- if *ANY* subgoal has repeated literals*) |
32bee18c675f
Tools/meson.ML: signature, structure and "open" rather than "local"
paulson
parents:
15574
diff
changeset
|
480 |
fun check_tac st = |
32bee18c675f
Tools/meson.ML: signature, structure and "open" rather than "local"
paulson
parents:
15574
diff
changeset
|
481 |
if exists (fn prem => has_reps (rhyps(prem,[]))) (prems_of st) |
32bee18c675f
Tools/meson.ML: signature, structure and "open" rather than "local"
paulson
parents:
15574
diff
changeset
|
482 |
then Seq.empty else Seq.single st; |
9840
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
483 |
|
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
484 |
|
15579
32bee18c675f
Tools/meson.ML: signature, structure and "open" rather than "local"
paulson
parents:
15574
diff
changeset
|
485 |
(* net_resolve_tac actually made it slower... *) |
32bee18c675f
Tools/meson.ML: signature, structure and "open" rather than "local"
paulson
parents:
15574
diff
changeset
|
486 |
fun prolog_step_tac horns i = |
32bee18c675f
Tools/meson.ML: signature, structure and "open" rather than "local"
paulson
parents:
15574
diff
changeset
|
487 |
(assume_tac i APPEND resolve_tac horns i) THEN check_tac THEN |
18508 | 488 |
TRYALL_eq_assume_tac; |
9840
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
489 |
|
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
490 |
(*Sums the sizes of the subgoals, ignoring hypotheses (ancestors)*) |
33339 | 491 |
fun addconcl prem sz = size_of_term (Logic.strip_assums_concl prem) + sz; |
15579
32bee18c675f
Tools/meson.ML: signature, structure and "open" rather than "local"
paulson
parents:
15574
diff
changeset
|
492 |
|
33339 | 493 |
fun size_of_subgoals st = fold_rev addconcl (prems_of st) 0; |
15579
32bee18c675f
Tools/meson.ML: signature, structure and "open" rather than "local"
paulson
parents:
15574
diff
changeset
|
494 |
|
9840
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
495 |
|
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
496 |
(*Negation Normal Form*) |
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
497 |
val nnf_rls = [imp_to_disjD, iff_to_disjD, not_conjD, not_disjD, |
9869 | 498 |
not_impD, not_iffD, not_allD, not_exD, not_notD]; |
15581 | 499 |
|
38557 | 500 |
fun ok4nnf (Const (@{const_name Trueprop},_) $ (Const (@{const_name Not}, _) $ t)) = rigid t |
501 |
| ok4nnf (Const (@{const_name Trueprop},_) $ t) = rigid t |
|
21102
7f2ebe5c5b72
Conversion to clause form now tolerates Boolean variables without looping.
paulson
parents:
21095
diff
changeset
|
502 |
| ok4nnf _ = false; |
7f2ebe5c5b72
Conversion to clause form now tolerates Boolean variables without looping.
paulson
parents:
21095
diff
changeset
|
503 |
|
32262 | 504 |
fun make_nnf1 ctxt th = |
24300 | 505 |
if ok4nnf (concl_of th) |
32262 | 506 |
then make_nnf1 ctxt (tryres(th, nnf_rls)) |
28174
626f0a79a4b9
more careful exception handling in order to prevent backtracking; miscellaneous tidying up.
paulson
parents:
27865
diff
changeset
|
507 |
handle THM ("tryres", _, _) => |
32262 | 508 |
forward_res ctxt (make_nnf1 ctxt) |
9869 | 509 |
(tryres(th, [conj_forward,disj_forward,all_forward,ex_forward])) |
28174
626f0a79a4b9
more careful exception handling in order to prevent backtracking; miscellaneous tidying up.
paulson
parents:
27865
diff
changeset
|
510 |
handle THM ("tryres", _, _) => th |
38608
01ed56c46259
beta eta contract the Sledgehammer conjecture (and also the axioms, although this might not be needed), just like Metis does (implicitly);
blanchet
parents:
38606
diff
changeset
|
511 |
else th |
9840
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
512 |
|
24300 | 513 |
(*The simplification removes defined quantifiers and occurrences of True and False. |
20018 | 514 |
nnf_ss also includes the one-point simprocs, |
18405
afb1a52a7011
removal of some redundancies (e.g. one-point-rules) in clause production
paulson
parents:
18389
diff
changeset
|
515 |
which are needed to avoid the various one-point theorems from generating junk clauses.*) |
19894 | 516 |
val nnf_simps = |
37539 | 517 |
@{thms simp_implies_def Ex1_def Ball_def Bex_def if_True if_False if_cancel |
518 |
if_eq_cancel cases_simp} |
|
519 |
val nnf_extra_simps = @{thms split_ifs ex_simps all_simps simp_thms} |
|
18405
afb1a52a7011
removal of some redundancies (e.g. one-point-rules) in clause production
paulson
parents:
18389
diff
changeset
|
520 |
|
afb1a52a7011
removal of some redundancies (e.g. one-point-rules) in clause production
paulson
parents:
18389
diff
changeset
|
521 |
val nnf_ss = |
24300 | 522 |
HOL_basic_ss addsimps nnf_extra_simps |
24040 | 523 |
addsimprocs [defALL_regroup,defEX_regroup, @{simproc neq}, @{simproc let_simp}]; |
15872 | 524 |
|
38089
ed65a0777e10
perform the presimplification done by Metis.make_nnf in Sledgehammer again, to deal with "If" and similar constructs
blanchet
parents:
37926
diff
changeset
|
525 |
val presimplify = |
ed65a0777e10
perform the presimplification done by Metis.make_nnf in Sledgehammer again, to deal with "If" and similar constructs
blanchet
parents:
37926
diff
changeset
|
526 |
rewrite_rule (map safe_mk_meta_eq nnf_simps) |
ed65a0777e10
perform the presimplification done by Metis.make_nnf in Sledgehammer again, to deal with "If" and similar constructs
blanchet
parents:
37926
diff
changeset
|
527 |
#> simplify nnf_ss |
ed65a0777e10
perform the presimplification done by Metis.make_nnf in Sledgehammer again, to deal with "If" and similar constructs
blanchet
parents:
37926
diff
changeset
|
528 |
|
32262 | 529 |
fun make_nnf ctxt th = case prems_of th of |
38606
3003ddbd46d9
encode "fequal" reasoning rules in Metis problem, just as is done for Sledgehammer -- otherwise any proof that relies on "fequal" found by Sledgehammer can't be reconstructed
blanchet
parents:
38099
diff
changeset
|
530 |
[] => th |> presimplify |> make_nnf1 ctxt |
21050
d0447a511edb
More robust error handling in make_nnf and forward_res
paulson
parents:
21046
diff
changeset
|
531 |
| _ => raise THM ("make_nnf: premises in argument", 0, [th]); |
15581 | 532 |
|
15965
f422f8283491
Use of IntInf.int instead of int in most numeric simprocs; avoids
paulson
parents:
15946
diff
changeset
|
533 |
(*Pull existential quantifiers to front. This accomplishes Skolemization for |
f422f8283491
Use of IntInf.int instead of int in most numeric simprocs; avoids
paulson
parents:
15946
diff
changeset
|
534 |
clauses that arise from a subgoal.*) |
32262 | 535 |
fun skolemize1 ctxt th = |
38557 | 536 |
if not (has_conns [@{const_name Ex}] (prop_of th)) then th |
32262 | 537 |
else (skolemize1 ctxt (tryres(th, [choice, conj_exD1, conj_exD2, |
15679
28eb0fe50533
Integrating the reconstruction files into the building of HOL
quigley
parents:
15653
diff
changeset
|
538 |
disj_exD, disj_exD1, disj_exD2]))) |
28174
626f0a79a4b9
more careful exception handling in order to prevent backtracking; miscellaneous tidying up.
paulson
parents:
27865
diff
changeset
|
539 |
handle THM ("tryres", _, _) => |
32262 | 540 |
skolemize1 ctxt (forward_res ctxt (skolemize1 ctxt) |
9869 | 541 |
(tryres (th, [conj_forward, disj_forward, all_forward]))) |
28174
626f0a79a4b9
more careful exception handling in order to prevent backtracking; miscellaneous tidying up.
paulson
parents:
27865
diff
changeset
|
542 |
handle THM ("tryres", _, _) => |
32262 | 543 |
forward_res ctxt (skolemize1 ctxt) (rename_bvs_RS th ex_forward); |
29684 | 544 |
|
32262 | 545 |
fun skolemize ctxt th = skolemize1 ctxt (make_nnf ctxt th); |
9840
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
546 |
|
32262 | 547 |
fun skolemize_nnf_list _ [] = [] |
548 |
| skolemize_nnf_list ctxt (th::ths) = |
|
549 |
skolemize ctxt th :: skolemize_nnf_list ctxt ths |
|
25710
4cdf7de81e1b
Replaced refs by config params; finer critical section in mets method
paulson
parents:
25694
diff
changeset
|
550 |
handle THM _ => (*RS can fail if Unify.search_bound is too small*) |
32955 | 551 |
(trace_msg (fn () => "Failed to Skolemize " ^ Display.string_of_thm ctxt th); |
32262 | 552 |
skolemize_nnf_list ctxt ths); |
25694
cbb59ba6bf0c
Skolemization now catches exception THM, which may be raised if unification fails.
paulson
parents:
24937
diff
changeset
|
553 |
|
33339 | 554 |
fun add_clauses th cls = |
36603
d5d6111761a6
renamed Variable.thm_context to Variable.global_thm_context to emphasize that this is not the real thing;
wenzelm
parents:
36001
diff
changeset
|
555 |
let val ctxt0 = Variable.global_thm_context th |
33339 | 556 |
val (cnfs, ctxt) = make_cnf [] th ctxt0 |
24937
340523598914
context-based treatment of generalization; also handling TFrees in axiom clauses
paulson
parents:
24827
diff
changeset
|
557 |
in Variable.export ctxt ctxt0 cnfs @ cls end; |
9840
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
558 |
|
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
559 |
(*Make clauses from a list of theorems, previously Skolemized and put into nnf. |
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
560 |
The resulting clauses are HOL disjunctions.*) |
39235
cda88e68106d
Meson.make_clauses_unsorted: removed spurious debug code stemming from 5146d640aa4a -- must not handle arbitrary exceptions in user space;
wenzelm
parents:
39159
diff
changeset
|
561 |
fun make_clauses_unsorted ths = fold_rev add_clauses ths []; |
35869
cac366550624
start work on direct proof reconstruction for Sledgehammer
blanchet
parents:
35625
diff
changeset
|
562 |
val make_clauses = sort_clauses o make_clauses_unsorted; |
15773
f14ae2432710
Completed integration of reconstruction code. Now finds and displays proofs when used with modified version
quigley
parents:
15736
diff
changeset
|
563 |
|
16563 | 564 |
(*Convert a list of clauses (disjunctions) to Horn clauses (contrapositives)*) |
9869 | 565 |
fun make_horns ths = |
9840
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
566 |
name_thms "Horn#" |
33339 | 567 |
(distinct Thm.eq_thm_prop (fold_rev (add_contras clause_rules) ths [])); |
9840
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
568 |
|
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
569 |
(*Could simply use nprems_of, which would count remaining subgoals -- no |
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
570 |
discrimination as to their size! With BEST_FIRST, fails for problem 41.*) |
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
571 |
|
9869 | 572 |
fun best_prolog_tac sizef horns = |
9840
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
573 |
BEST_FIRST (has_fewer_prems 1, sizef) (prolog_step_tac horns 1); |
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
574 |
|
9869 | 575 |
fun depth_prolog_tac horns = |
9840
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
576 |
DEPTH_FIRST (has_fewer_prems 1) (prolog_step_tac horns 1); |
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
577 |
|
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
578 |
(*Return all negative clauses, as possible goal clauses*) |
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
579 |
fun gocls cls = name_thms "Goal#" (map make_goal (neg_clauses cls)); |
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
580 |
|
32262 | 581 |
fun skolemize_prems_tac ctxt prems = |
37926
e6ff246c0cdb
renamings + only need second component of name pool to reconstruct proofs
blanchet
parents:
37781
diff
changeset
|
582 |
cut_facts_tac (skolemize_nnf_list ctxt prems) THEN' REPEAT o etac exE |
9840
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
583 |
|
22546
c40d7ab8cbc5
MESON tactical takes an additional argument: the clausification function.
paulson
parents:
22515
diff
changeset
|
584 |
(*Basis of all meson-tactics. Supplies cltac with clauses: HOL disjunctions. |
c40d7ab8cbc5
MESON tactical takes an additional argument: the clausification function.
paulson
parents:
22515
diff
changeset
|
585 |
Function mkcl converts theorems to clauses.*) |
39037
5146d640aa4a
Let MESON take an additional "preskolemization tactic", which can be used to put the goal in definitional CNF
blanchet
parents:
38864
diff
changeset
|
586 |
fun MESON preskolem_tac mkcl cltac ctxt i st = |
16588 | 587 |
SELECT_GOAL |
35625 | 588 |
(EVERY [Object_Logic.atomize_prems_tac 1, |
23552 | 589 |
rtac ccontr 1, |
39269
c2795d8a2461
use definitional CNF for the goal if at least one of the premisses would lead to too many clauses in Meson
blanchet
parents:
39159
diff
changeset
|
590 |
preskolem_tac, |
32283 | 591 |
Subgoal.FOCUS (fn {context = ctxt', prems = negs, ...} => |
39269
c2795d8a2461
use definitional CNF for the goal if at least one of the premisses would lead to too many clauses in Meson
blanchet
parents:
39159
diff
changeset
|
592 |
EVERY1 [skolemize_prems_tac ctxt negs, |
32283 | 593 |
Subgoal.FOCUS (cltac o mkcl o #prems) ctxt']) ctxt 1]) i st |
24300 | 594 |
handle THM _ => no_tac st; (*probably from make_meta_clause, not first-order*) |
9840
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
595 |
|
39037
5146d640aa4a
Let MESON take an additional "preskolemization tactic", which can be used to put the goal in definitional CNF
blanchet
parents:
38864
diff
changeset
|
596 |
|
9840
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
597 |
(** Best-first search versions **) |
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
598 |
|
16563 | 599 |
(*ths is a list of additional clauses (HOL disjunctions) to use.*) |
9869 | 600 |
fun best_meson_tac sizef = |
39269
c2795d8a2461
use definitional CNF for the goal if at least one of the premisses would lead to too many clauses in Meson
blanchet
parents:
39159
diff
changeset
|
601 |
MESON all_tac make_clauses |
22546
c40d7ab8cbc5
MESON tactical takes an additional argument: the clausification function.
paulson
parents:
22515
diff
changeset
|
602 |
(fn cls => |
9840
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
603 |
THEN_BEST_FIRST (resolve_tac (gocls cls) 1) |
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
604 |
(has_fewer_prems 1, sizef) |
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
605 |
(prolog_step_tac (make_horns cls) 1)); |
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
606 |
|
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
607 |
(*First, breaks the goal into independent units*) |
32262 | 608 |
fun safe_best_meson_tac ctxt = |
609 |
SELECT_GOAL (TRY (safe_tac (claset_of ctxt)) THEN |
|
610 |
TRYALL (best_meson_tac size_of_subgoals ctxt)); |
|
9840
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
611 |
|
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
612 |
(** Depth-first search version **) |
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
613 |
|
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
614 |
val depth_meson_tac = |
39269
c2795d8a2461
use definitional CNF for the goal if at least one of the premisses would lead to too many clauses in Meson
blanchet
parents:
39159
diff
changeset
|
615 |
MESON all_tac make_clauses |
22546
c40d7ab8cbc5
MESON tactical takes an additional argument: the clausification function.
paulson
parents:
22515
diff
changeset
|
616 |
(fn cls => EVERY [resolve_tac (gocls cls) 1, depth_prolog_tac (make_horns cls)]); |
9840
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
617 |
|
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
618 |
|
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
619 |
(** Iterative deepening version **) |
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
620 |
|
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
621 |
(*This version does only one inference per call; |
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
622 |
having only one eq_assume_tac speeds it up!*) |
9869 | 623 |
fun prolog_step_tac' horns = |
39328 | 624 |
let val (horn0s, _) = (*0 subgoals vs 1 or more*) |
9840
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
625 |
take_prefix Thm.no_prems horns |
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
626 |
val nrtac = net_resolve_tac horns |
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
627 |
in fn i => eq_assume_tac i ORELSE |
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
628 |
match_tac horn0s i ORELSE (*no backtracking if unit MATCHES*) |
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
629 |
((assume_tac i APPEND nrtac i) THEN check_tac) |
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
630 |
end; |
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
631 |
|
9869 | 632 |
fun iter_deepen_prolog_tac horns = |
38802
a925c0ee42f7
clarified iter_deepen_limit vs meson (cf. 7c5896919eb8) -- eliminated global ref;
wenzelm
parents:
38795
diff
changeset
|
633 |
ITER_DEEPEN iter_deepen_limit (has_fewer_prems 1) (prolog_step_tac' horns); |
9840
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
634 |
|
39269
c2795d8a2461
use definitional CNF for the goal if at least one of the premisses would lead to too many clauses in Meson
blanchet
parents:
39159
diff
changeset
|
635 |
fun iter_deepen_meson_tac ctxt ths = ctxt |> MESON all_tac make_clauses |
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:
32032
diff
changeset
|
636 |
(fn cls => |
30e2ffbba718
proper context for Display.pretty_thm etc. or old-style versions Display.pretty_thm_global, Display.pretty_thm_without_context etc.;
wenzelm
parents:
32032
diff
changeset
|
637 |
(case (gocls (cls @ ths)) of |
30e2ffbba718
proper context for Display.pretty_thm etc. or old-style versions Display.pretty_thm_global, Display.pretty_thm_without_context etc.;
wenzelm
parents:
32032
diff
changeset
|
638 |
[] => no_tac (*no goal clauses*) |
30e2ffbba718
proper context for Display.pretty_thm etc. or old-style versions Display.pretty_thm_global, Display.pretty_thm_without_context etc.;
wenzelm
parents:
32032
diff
changeset
|
639 |
| goes => |
30e2ffbba718
proper context for Display.pretty_thm etc. or old-style versions Display.pretty_thm_global, Display.pretty_thm_without_context etc.;
wenzelm
parents:
32032
diff
changeset
|
640 |
let |
30e2ffbba718
proper context for Display.pretty_thm etc. or old-style versions Display.pretty_thm_global, Display.pretty_thm_without_context etc.;
wenzelm
parents:
32032
diff
changeset
|
641 |
val horns = make_horns (cls @ ths) |
32955 | 642 |
val _ = trace_msg (fn () => |
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:
32032
diff
changeset
|
643 |
cat_lines ("meson method called:" :: |
32262 | 644 |
map (Display.string_of_thm ctxt) (cls @ ths) @ |
645 |
["clauses:"] @ map (Display.string_of_thm ctxt) horns)) |
|
38802
a925c0ee42f7
clarified iter_deepen_limit vs meson (cf. 7c5896919eb8) -- eliminated global ref;
wenzelm
parents:
38795
diff
changeset
|
646 |
in |
a925c0ee42f7
clarified iter_deepen_limit vs meson (cf. 7c5896919eb8) -- eliminated global ref;
wenzelm
parents:
38795
diff
changeset
|
647 |
THEN_ITER_DEEPEN iter_deepen_limit |
a925c0ee42f7
clarified iter_deepen_limit vs meson (cf. 7c5896919eb8) -- eliminated global ref;
wenzelm
parents:
38795
diff
changeset
|
648 |
(resolve_tac goes 1) (has_fewer_prems 1) (prolog_step_tac' horns) |
a925c0ee42f7
clarified iter_deepen_limit vs meson (cf. 7c5896919eb8) -- eliminated global ref;
wenzelm
parents:
38795
diff
changeset
|
649 |
end)); |
9840
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
650 |
|
32262 | 651 |
fun meson_tac ctxt ths = |
652 |
SELECT_GOAL (TRY (safe_tac (claset_of ctxt)) THEN TRYALL (iter_deepen_meson_tac ctxt ths)); |
|
9869 | 653 |
|
654 |
||
14813 | 655 |
(**** Code to support ordinary resolution, rather than Model Elimination ****) |
14744 | 656 |
|
24300 | 657 |
(*Convert a list of clauses (disjunctions) to meta-level clauses (==>), |
15008 | 658 |
with no contrapositives, for ordinary resolution.*) |
14744 | 659 |
|
660 |
(*Rules to convert the head literal into a negated assumption. If the head |
|
661 |
literal is already negated, then using notEfalse instead of notEfalse' |
|
662 |
prevents a double negation.*) |
|
27239 | 663 |
val notEfalse = read_instantiate @{context} [(("R", 0), "False")] notE; |
14744 | 664 |
val notEfalse' = rotate_prems 1 notEfalse; |
665 |
||
24300 | 666 |
fun negated_asm_of_head th = |
14744 | 667 |
th RS notEfalse handle THM _ => th RS notEfalse'; |
668 |
||
26066
19df083a2bbf
make_meta_clause bugfix: now works for higher-order clauses like LeastI_ex
paulson
parents:
25710
diff
changeset
|
669 |
(*Converting one theorem from a disjunction to a meta-level clause*) |
19df083a2bbf
make_meta_clause bugfix: now works for higher-order clauses like LeastI_ex
paulson
parents:
25710
diff
changeset
|
670 |
fun make_meta_clause th = |
33832 | 671 |
let val (fth,thaw) = Drule.legacy_freeze_thaw_robust th |
26066
19df083a2bbf
make_meta_clause bugfix: now works for higher-order clauses like LeastI_ex
paulson
parents:
25710
diff
changeset
|
672 |
in |
35845
e5980f0ad025
renamed varify/unvarify operations to varify_global/unvarify_global to emphasize that these only work in a global situation;
wenzelm
parents:
35625
diff
changeset
|
673 |
(zero_var_indexes o Thm.varifyT_global o thaw 0 o |
26066
19df083a2bbf
make_meta_clause bugfix: now works for higher-order clauses like LeastI_ex
paulson
parents:
25710
diff
changeset
|
674 |
negated_asm_of_head o make_horn resolution_clause_rules) fth |
19df083a2bbf
make_meta_clause bugfix: now works for higher-order clauses like LeastI_ex
paulson
parents:
25710
diff
changeset
|
675 |
end; |
24300 | 676 |
|
14744 | 677 |
fun make_meta_clauses ths = |
678 |
name_thms "MClause#" |
|
22360
26ead7ed4f4b
moved eq_thm etc. to structure Thm in Pure/more_thm.ML;
wenzelm
parents:
22130
diff
changeset
|
679 |
(distinct Thm.eq_thm_prop (map make_meta_clause ths)); |
14744 | 680 |
|
9840
9dfcb0224f8c
meson.ML moved from HOL/ex to HOL/Tools: meson_tac installed by default
paulson
parents:
diff
changeset
|
681 |
end; |