author | nipkow |
Tue, 07 Sep 2010 10:05:19 +0200 | |
changeset 39198 | f967a16dfcdd |
parent 39112 | 611e41ef07c3 |
child 39261 | b1bfb3de88fd |
permissions | -rw-r--r-- |
37574
b8c1f4c46983
renamed "Sledgehammer_Fact_Preprocessor" to "Clausifier";
blanchet
parents:
37572
diff
changeset
|
1 |
(* Title: HOL/Tools/Sledgehammer/clausifier.ML |
38027 | 2 |
Author: Jia Meng, Cambridge University Computer Laboratory and NICTA |
36393
be73a2b2443b
support readable names even when Isar proof reconstruction is enabled -- useful for debugging
blanchet
parents:
36228
diff
changeset
|
3 |
Author: Jasmin Blanchette, TU Muenchen |
15347 | 4 |
|
20461
d689ad772b2c
skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents:
20457
diff
changeset
|
5 |
Transformation of axiom rules (elim/intro/etc) into CNF forms. |
15347 | 6 |
*) |
7 |
||
37574
b8c1f4c46983
renamed "Sledgehammer_Fact_Preprocessor" to "Clausifier";
blanchet
parents:
37572
diff
changeset
|
8 |
signature CLAUSIFIER = |
21505 | 9 |
sig |
38632
9cde57cdd0e3
treat "using X by metis" (more or less) the same as "by (metis X)"
blanchet
parents:
38610
diff
changeset
|
10 |
val extensionalize_theorem : thm -> thm |
38001
a9b47b85ca24
reintroduced more preprocessing steps to Sledgehammer, adapted to the new FOF setting
blanchet
parents:
38000
diff
changeset
|
11 |
val introduce_combinators_in_cterm : cterm -> thm |
38028 | 12 |
val introduce_combinators_in_theorem : thm -> thm |
39037
5146d640aa4a
Let MESON take an additional "preskolemization tactic", which can be used to put the goal in definitional CNF
blanchet
parents:
39036
diff
changeset
|
13 |
val to_definitional_cnf_with_quantifiers : theory -> thm -> thm |
5146d640aa4a
Let MESON take an additional "preskolemization tactic", which can be used to put the goal in definitional CNF
blanchet
parents:
39036
diff
changeset
|
14 |
val cnf_axiom : theory -> thm -> thm list |
21505 | 15 |
end; |
19196
62ee8c10d796
Added functions to retrieve local and global atpset rules.
mengj
parents:
19175
diff
changeset
|
16 |
|
37574
b8c1f4c46983
renamed "Sledgehammer_Fact_Preprocessor" to "Clausifier";
blanchet
parents:
37572
diff
changeset
|
17 |
structure Clausifier : CLAUSIFIER = |
15997 | 18 |
struct |
15347 | 19 |
|
15997 | 20 |
(**** Transformation of Elimination Rules into First-Order Formulas****) |
15347 | 21 |
|
29064 | 22 |
val cfalse = cterm_of @{theory HOL} HOLogic.false_const; |
23 |
val ctp_false = cterm_of @{theory HOL} (HOLogic.mk_Trueprop HOLogic.false_const); |
|
20461
d689ad772b2c
skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents:
20457
diff
changeset
|
24 |
|
38001
a9b47b85ca24
reintroduced more preprocessing steps to Sledgehammer, adapted to the new FOF setting
blanchet
parents:
38000
diff
changeset
|
25 |
(* Converts an elim-rule into an equivalent theorem that does not have the |
a9b47b85ca24
reintroduced more preprocessing steps to Sledgehammer, adapted to the new FOF setting
blanchet
parents:
38000
diff
changeset
|
26 |
predicate variable. Leaves other theorems unchanged. We simply instantiate |
a9b47b85ca24
reintroduced more preprocessing steps to Sledgehammer, adapted to the new FOF setting
blanchet
parents:
38000
diff
changeset
|
27 |
the conclusion variable to False. (Cf. "transform_elim_term" in |
38652
e063be321438
perform eta-expansion of quantifier bodies in Sledgehammer translation when needed + transform elim rules later;
blanchet
parents:
38632
diff
changeset
|
28 |
"Sledgehammer_Util".) *) |
38001
a9b47b85ca24
reintroduced more preprocessing steps to Sledgehammer, adapted to the new FOF setting
blanchet
parents:
38000
diff
changeset
|
29 |
fun transform_elim_theorem th = |
21430
77651b6d9d6c
New transformation of eliminatino rules: we simply replace the final conclusion variable by False
paulson
parents:
21290
diff
changeset
|
30 |
case concl_of th of (*conclusion variable*) |
35963 | 31 |
@{const Trueprop} $ (v as Var (_, @{typ bool})) => |
29064 | 32 |
Thm.instantiate ([], [(cterm_of @{theory HOL} v, cfalse)]) th |
35963 | 33 |
| v as Var(_, @{typ prop}) => |
29064 | 34 |
Thm.instantiate ([], [(cterm_of @{theory HOL} v, ctp_false)]) th |
38001
a9b47b85ca24
reintroduced more preprocessing steps to Sledgehammer, adapted to the new FOF setting
blanchet
parents:
38000
diff
changeset
|
35 |
| _ => th |
15997 | 36 |
|
24742
73b8b42a36b6
removal of some "ref"s from res_axioms.ML; a side-effect is that the ordering
paulson
parents:
24669
diff
changeset
|
37 |
(*To enforce single-threading*) |
73b8b42a36b6
removal of some "ref"s from res_axioms.ML; a side-effect is that the ordering
paulson
parents:
24669
diff
changeset
|
38 |
exception Clausify_failure of theory; |
20461
d689ad772b2c
skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents:
20457
diff
changeset
|
39 |
|
28544
26743a1591f5
improved performance of skolem cache, due to parallel map;
wenzelm
parents:
28262
diff
changeset
|
40 |
|
16009 | 41 |
(**** SKOLEMIZATION BY INFERENCE (lcp) ****) |
42 |
||
37410
2bf7e6136047
adjusted the polymorphism handling of Skolem constants so that proof reconstruction doesn't fail in "equality_inf"
blanchet
parents:
37403
diff
changeset
|
43 |
fun mk_skolem_id t = |
37436 | 44 |
let val T = fastype_of t in |
37496
9ae78e12e126
reintroduce new Sledgehammer polymorphic handling code;
blanchet
parents:
37488
diff
changeset
|
45 |
Const (@{const_name skolem_id}, T --> T) $ t |
37436 | 46 |
end |
37410
2bf7e6136047
adjusted the polymorphism handling of Skolem constants so that proof reconstruction doesn't fail in "equality_inf"
blanchet
parents:
37403
diff
changeset
|
47 |
|
37617
f73cd4069f69
always perform "inline" skolemization, polymorphism or not, Skolem cache or not
blanchet
parents:
37616
diff
changeset
|
48 |
fun beta_eta_under_lambdas (Abs (s, T, t')) = |
f73cd4069f69
always perform "inline" skolemization, polymorphism or not, Skolem cache or not
blanchet
parents:
37616
diff
changeset
|
49 |
Abs (s, T, beta_eta_under_lambdas t') |
f73cd4069f69
always perform "inline" skolemization, polymorphism or not, Skolem cache or not
blanchet
parents:
37616
diff
changeset
|
50 |
| beta_eta_under_lambdas t = Envir.beta_eta_contract t |
37512
ff72d3ddc898
this looks like the most appropriate place to do the beta-eta-contraction
blanchet
parents:
37511
diff
changeset
|
51 |
|
18141
89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18009
diff
changeset
|
52 |
(*Traverse a theorem, accumulating Skolem function definitions.*) |
37617
f73cd4069f69
always perform "inline" skolemization, polymorphism or not, Skolem cache or not
blanchet
parents:
37616
diff
changeset
|
53 |
fun assume_skolem_funs th = |
37399
34f080a12063
proper polymorphic Skolemization of uncached facts + synchronization of caching and relevance filter
blanchet
parents:
37349
diff
changeset
|
54 |
let |
37617
f73cd4069f69
always perform "inline" skolemization, polymorphism or not, Skolem cache or not
blanchet
parents:
37616
diff
changeset
|
55 |
fun dec_sko (Const (@{const_name Ex}, _) $ (body as Abs (s', T, p))) rhss = |
37399
34f080a12063
proper polymorphic Skolemization of uncached facts + synchronization of caching and relevance filter
blanchet
parents:
37349
diff
changeset
|
56 |
(*Existential: declare a Skolem function, then insert into body and continue*) |
34f080a12063
proper polymorphic Skolemization of uncached facts + synchronization of caching and relevance filter
blanchet
parents:
37349
diff
changeset
|
57 |
let |
37617
f73cd4069f69
always perform "inline" skolemization, polymorphism or not, Skolem cache or not
blanchet
parents:
37616
diff
changeset
|
58 |
val args = OldTerm.term_frees body |
37399
34f080a12063
proper polymorphic Skolemization of uncached facts + synchronization of caching and relevance filter
blanchet
parents:
37349
diff
changeset
|
59 |
val Ts = map type_of args |
38280 | 60 |
val cT = Ts ---> T |
37500
7587b6e63454
thread original theorem along with CNF theorem, as a step toward killing the Skolem cache
blanchet
parents:
37498
diff
changeset
|
61 |
(* Forms a lambda-abstraction over the formal parameters *) |
7587b6e63454
thread original theorem along with CNF theorem, as a step toward killing the Skolem cache
blanchet
parents:
37498
diff
changeset
|
62 |
val rhs = |
7587b6e63454
thread original theorem along with CNF theorem, as a step toward killing the Skolem cache
blanchet
parents:
37498
diff
changeset
|
63 |
list_abs_free (map dest_Free args, |
37617
f73cd4069f69
always perform "inline" skolemization, polymorphism or not, Skolem cache or not
blanchet
parents:
37616
diff
changeset
|
64 |
HOLogic.choice_const T $ beta_eta_under_lambdas body) |
37518
efb0923cc098
use Skolem inlining also in the nonpolymorphic case, as a step toward simplifying the source code
blanchet
parents:
37512
diff
changeset
|
65 |
|> mk_skolem_id |
efb0923cc098
use Skolem inlining also in the nonpolymorphic case, as a step toward simplifying the source code
blanchet
parents:
37512
diff
changeset
|
66 |
val comb = list_comb (rhs, args) |
37617
f73cd4069f69
always perform "inline" skolemization, polymorphism or not, Skolem cache or not
blanchet
parents:
37616
diff
changeset
|
67 |
in dec_sko (subst_bound (comb, p)) (rhs :: rhss) end |
f73cd4069f69
always perform "inline" skolemization, polymorphism or not, Skolem cache or not
blanchet
parents:
37616
diff
changeset
|
68 |
| dec_sko (Const (@{const_name All},_) $ Abs (a, T, p)) rhss = |
37399
34f080a12063
proper polymorphic Skolemization of uncached facts + synchronization of caching and relevance filter
blanchet
parents:
37349
diff
changeset
|
69 |
(*Universal quant: insert a free variable into body and continue*) |
34f080a12063
proper polymorphic Skolemization of uncached facts + synchronization of caching and relevance filter
blanchet
parents:
37349
diff
changeset
|
70 |
let val fname = Name.variant (OldTerm.add_term_names (p,[])) a |
37617
f73cd4069f69
always perform "inline" skolemization, polymorphism or not, Skolem cache or not
blanchet
parents:
37616
diff
changeset
|
71 |
in dec_sko (subst_bound (Free(fname,T), p)) rhss end |
38795
848be46708dc
formerly unnamed infix conjunction and disjunction now named HOL.conj and HOL.disj
haftmann
parents:
38652
diff
changeset
|
72 |
| dec_sko (@{const HOL.conj} $ p $ q) rhss = rhss |> dec_sko p |> dec_sko q |
848be46708dc
formerly unnamed infix conjunction and disjunction now named HOL.conj and HOL.disj
haftmann
parents:
38652
diff
changeset
|
73 |
| dec_sko (@{const HOL.disj} $ p $ q) rhss = rhss |> dec_sko p |> dec_sko q |
37617
f73cd4069f69
always perform "inline" skolemization, polymorphism or not, Skolem cache or not
blanchet
parents:
37616
diff
changeset
|
74 |
| dec_sko (@{const Trueprop} $ p) rhss = dec_sko p rhss |
f73cd4069f69
always perform "inline" skolemization, polymorphism or not, Skolem cache or not
blanchet
parents:
37616
diff
changeset
|
75 |
| dec_sko _ rhss = rhss |
20419 | 76 |
in dec_sko (prop_of th) [] end; |
77 |
||
78 |
||
24827 | 79 |
(**** REPLACING ABSTRACTIONS BY COMBINATORS ****) |
20419 | 80 |
|
39198 | 81 |
val fun_cong_all = @{thm ext_iff [THEN iffD1]} |
20419 | 82 |
|
38001
a9b47b85ca24
reintroduced more preprocessing steps to Sledgehammer, adapted to the new FOF setting
blanchet
parents:
38000
diff
changeset
|
83 |
(* Removes the lambdas from an equation of the form "t = (%x. u)". |
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:
38282
diff
changeset
|
84 |
(Cf. "extensionalize_term" in "Sledgehammer_Translate".) *) |
38000
c0b9efa8bfca
added extensionalization to Sledgehammer, mimicking what the Clausifier used to do
blanchet
parents:
37995
diff
changeset
|
85 |
fun extensionalize_theorem th = |
37540
48273d1ea331
better eta-expansion in Sledgehammer's clausification;
blanchet
parents:
37518
diff
changeset
|
86 |
case prop_of th of |
38864
4abe644fcea5
formerly unnamed infix equality now named HOL.eq
haftmann
parents:
38795
diff
changeset
|
87 |
_ $ (Const (@{const_name HOL.eq}, Type (_, [Type (@{type_name fun}, _), _])) |
38000
c0b9efa8bfca
added extensionalization to Sledgehammer, mimicking what the Clausifier used to do
blanchet
parents:
37995
diff
changeset
|
88 |
$ _ $ Abs (s, _, _)) => extensionalize_theorem (th RS fun_cong_all) |
37540
48273d1ea331
better eta-expansion in Sledgehammer's clausification;
blanchet
parents:
37518
diff
changeset
|
89 |
| _ => th |
20419 | 90 |
|
37416
d5ac8280497e
no point in introducing combinators for inlined Skolem functions
blanchet
parents:
37410
diff
changeset
|
91 |
fun is_quasi_lambda_free (Const (@{const_name skolem_id}, _) $ _) = true |
d5ac8280497e
no point in introducing combinators for inlined Skolem functions
blanchet
parents:
37410
diff
changeset
|
92 |
| is_quasi_lambda_free (t1 $ t2) = |
d5ac8280497e
no point in introducing combinators for inlined Skolem functions
blanchet
parents:
37410
diff
changeset
|
93 |
is_quasi_lambda_free t1 andalso is_quasi_lambda_free t2 |
d5ac8280497e
no point in introducing combinators for inlined Skolem functions
blanchet
parents:
37410
diff
changeset
|
94 |
| is_quasi_lambda_free (Abs _) = false |
d5ac8280497e
no point in introducing combinators for inlined Skolem functions
blanchet
parents:
37410
diff
changeset
|
95 |
| is_quasi_lambda_free _ = true |
20461
d689ad772b2c
skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents:
20457
diff
changeset
|
96 |
|
32010 | 97 |
val [f_B,g_B] = map (cterm_of @{theory}) (OldTerm.term_vars (prop_of @{thm abs_B})); |
98 |
val [g_C,f_C] = map (cterm_of @{theory}) (OldTerm.term_vars (prop_of @{thm abs_C})); |
|
99 |
val [f_S,g_S] = map (cterm_of @{theory}) (OldTerm.term_vars (prop_of @{thm abs_S})); |
|
20863
4ee61dbf192d
improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents:
20789
diff
changeset
|
100 |
|
38282
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
38280
diff
changeset
|
101 |
(* FIXME: Requires more use of cterm constructors. *) |
24827 | 102 |
fun abstract ct = |
28544
26743a1591f5
improved performance of skolem cache, due to parallel map;
wenzelm
parents:
28262
diff
changeset
|
103 |
let |
26743a1591f5
improved performance of skolem cache, due to parallel map;
wenzelm
parents:
28262
diff
changeset
|
104 |
val thy = theory_of_cterm ct |
25256
fe467fdf129a
Catch exceptions arising during the abstraction operation.
paulson
parents:
25243
diff
changeset
|
105 |
val Abs(x,_,body) = term_of ct |
35963 | 106 |
val Type(@{type_name fun}, [xT,bodyT]) = typ_of (ctyp_of_term ct) |
38005
b6555e9c5de4
prevent schematic variable clash in combinator-introduction code, when invoked from Sledgehammer (another consequence of the CNF -> FOF transition)
blanchet
parents:
38001
diff
changeset
|
107 |
val cxT = ctyp_of thy xT |
b6555e9c5de4
prevent schematic variable clash in combinator-introduction code, when invoked from Sledgehammer (another consequence of the CNF -> FOF transition)
blanchet
parents:
38001
diff
changeset
|
108 |
val cbodyT = ctyp_of thy bodyT |
b6555e9c5de4
prevent schematic variable clash in combinator-introduction code, when invoked from Sledgehammer (another consequence of the CNF -> FOF transition)
blanchet
parents:
38001
diff
changeset
|
109 |
fun makeK () = |
b6555e9c5de4
prevent schematic variable clash in combinator-introduction code, when invoked from Sledgehammer (another consequence of the CNF -> FOF transition)
blanchet
parents:
38001
diff
changeset
|
110 |
instantiate' [SOME cxT, SOME cbodyT] [SOME (cterm_of thy body)] |
b6555e9c5de4
prevent schematic variable clash in combinator-introduction code, when invoked from Sledgehammer (another consequence of the CNF -> FOF transition)
blanchet
parents:
38001
diff
changeset
|
111 |
@{thm abs_K} |
24827 | 112 |
in |
113 |
case body of |
|
114 |
Const _ => makeK() |
|
115 |
| Free _ => makeK() |
|
116 |
| Var _ => makeK() (*though Var isn't expected*) |
|
27184 | 117 |
| Bound 0 => instantiate' [SOME cxT] [] @{thm abs_I} (*identity: I*) |
24827 | 118 |
| rator$rand => |
27184 | 119 |
if loose_bvar1 (rator,0) then (*C or S*) |
27179
8f29fed3dc9a
ResAxioms.cnf_axiom/cnf_rules_pairs: pass explicit theory context;
wenzelm
parents:
27174
diff
changeset
|
120 |
if loose_bvar1 (rand,0) then (*S*) |
8f29fed3dc9a
ResAxioms.cnf_axiom/cnf_rules_pairs: pass explicit theory context;
wenzelm
parents:
27174
diff
changeset
|
121 |
let val crator = cterm_of thy (Abs(x,xT,rator)) |
8f29fed3dc9a
ResAxioms.cnf_axiom/cnf_rules_pairs: pass explicit theory context;
wenzelm
parents:
27174
diff
changeset
|
122 |
val crand = cterm_of thy (Abs(x,xT,rand)) |
27184 | 123 |
val abs_S' = cterm_instantiate [(f_S,crator),(g_S,crand)] @{thm abs_S} |
124 |
val (_,rhs) = Thm.dest_equals (cprop_of abs_S') |
|
27179
8f29fed3dc9a
ResAxioms.cnf_axiom/cnf_rules_pairs: pass explicit theory context;
wenzelm
parents:
27174
diff
changeset
|
125 |
in |
8f29fed3dc9a
ResAxioms.cnf_axiom/cnf_rules_pairs: pass explicit theory context;
wenzelm
parents:
27174
diff
changeset
|
126 |
Thm.transitive abs_S' (Conv.binop_conv abstract rhs) |
8f29fed3dc9a
ResAxioms.cnf_axiom/cnf_rules_pairs: pass explicit theory context;
wenzelm
parents:
27174
diff
changeset
|
127 |
end |
8f29fed3dc9a
ResAxioms.cnf_axiom/cnf_rules_pairs: pass explicit theory context;
wenzelm
parents:
27174
diff
changeset
|
128 |
else (*C*) |
8f29fed3dc9a
ResAxioms.cnf_axiom/cnf_rules_pairs: pass explicit theory context;
wenzelm
parents:
27174
diff
changeset
|
129 |
let val crator = cterm_of thy (Abs(x,xT,rator)) |
27184 | 130 |
val abs_C' = cterm_instantiate [(f_C,crator),(g_C,cterm_of thy rand)] @{thm abs_C} |
131 |
val (_,rhs) = Thm.dest_equals (cprop_of abs_C') |
|
27179
8f29fed3dc9a
ResAxioms.cnf_axiom/cnf_rules_pairs: pass explicit theory context;
wenzelm
parents:
27174
diff
changeset
|
132 |
in |
8f29fed3dc9a
ResAxioms.cnf_axiom/cnf_rules_pairs: pass explicit theory context;
wenzelm
parents:
27174
diff
changeset
|
133 |
Thm.transitive abs_C' (Conv.fun_conv (Conv.arg_conv abstract) rhs) |
8f29fed3dc9a
ResAxioms.cnf_axiom/cnf_rules_pairs: pass explicit theory context;
wenzelm
parents:
27174
diff
changeset
|
134 |
end |
27184 | 135 |
else if loose_bvar1 (rand,0) then (*B or eta*) |
36945 | 136 |
if rand = Bound 0 then Thm.eta_conversion ct |
27179
8f29fed3dc9a
ResAxioms.cnf_axiom/cnf_rules_pairs: pass explicit theory context;
wenzelm
parents:
27174
diff
changeset
|
137 |
else (*B*) |
8f29fed3dc9a
ResAxioms.cnf_axiom/cnf_rules_pairs: pass explicit theory context;
wenzelm
parents:
27174
diff
changeset
|
138 |
let val crand = cterm_of thy (Abs(x,xT,rand)) |
8f29fed3dc9a
ResAxioms.cnf_axiom/cnf_rules_pairs: pass explicit theory context;
wenzelm
parents:
27174
diff
changeset
|
139 |
val crator = cterm_of thy rator |
27184 | 140 |
val abs_B' = cterm_instantiate [(f_B,crator),(g_B,crand)] @{thm abs_B} |
141 |
val (_,rhs) = Thm.dest_equals (cprop_of abs_B') |
|
37349 | 142 |
in Thm.transitive abs_B' (Conv.arg_conv abstract rhs) end |
27179
8f29fed3dc9a
ResAxioms.cnf_axiom/cnf_rules_pairs: pass explicit theory context;
wenzelm
parents:
27174
diff
changeset
|
143 |
else makeK() |
37349 | 144 |
| _ => raise Fail "abstract: Bad term" |
24827 | 145 |
end; |
20863
4ee61dbf192d
improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents:
20789
diff
changeset
|
146 |
|
37349 | 147 |
(* Traverse a theorem, remplacing lambda-abstractions with combinators. *) |
38001
a9b47b85ca24
reintroduced more preprocessing steps to Sledgehammer, adapted to the new FOF setting
blanchet
parents:
38000
diff
changeset
|
148 |
fun introduce_combinators_in_cterm ct = |
37416
d5ac8280497e
no point in introducing combinators for inlined Skolem functions
blanchet
parents:
37410
diff
changeset
|
149 |
if is_quasi_lambda_free (term_of ct) then |
37349 | 150 |
Thm.reflexive ct |
151 |
else case term_of ct of |
|
152 |
Abs _ => |
|
153 |
let |
|
154 |
val (cv, cta) = Thm.dest_abs NONE ct |
|
155 |
val (v, _) = dest_Free (term_of cv) |
|
38001
a9b47b85ca24
reintroduced more preprocessing steps to Sledgehammer, adapted to the new FOF setting
blanchet
parents:
38000
diff
changeset
|
156 |
val u_th = introduce_combinators_in_cterm cta |
37349 | 157 |
val cu = Thm.rhs_of u_th |
158 |
val comb_eq = abstract (Thm.cabs cv cu) |
|
159 |
in Thm.transitive (Thm.abstract_rule v cv u_th) comb_eq end |
|
160 |
| _ $ _ => |
|
161 |
let val (ct1, ct2) = Thm.dest_comb ct in |
|
38001
a9b47b85ca24
reintroduced more preprocessing steps to Sledgehammer, adapted to the new FOF setting
blanchet
parents:
38000
diff
changeset
|
162 |
Thm.combination (introduce_combinators_in_cterm ct1) |
a9b47b85ca24
reintroduced more preprocessing steps to Sledgehammer, adapted to the new FOF setting
blanchet
parents:
38000
diff
changeset
|
163 |
(introduce_combinators_in_cterm ct2) |
37349 | 164 |
end |
165 |
||
38001
a9b47b85ca24
reintroduced more preprocessing steps to Sledgehammer, adapted to the new FOF setting
blanchet
parents:
38000
diff
changeset
|
166 |
fun introduce_combinators_in_theorem th = |
37416
d5ac8280497e
no point in introducing combinators for inlined Skolem functions
blanchet
parents:
37410
diff
changeset
|
167 |
if is_quasi_lambda_free (prop_of th) then |
37349 | 168 |
th |
24827 | 169 |
else |
37349 | 170 |
let |
171 |
val th = Drule.eta_contraction_rule th |
|
38001
a9b47b85ca24
reintroduced more preprocessing steps to Sledgehammer, adapted to the new FOF setting
blanchet
parents:
38000
diff
changeset
|
172 |
val eqth = introduce_combinators_in_cterm (cprop_of th) |
37349 | 173 |
in Thm.equal_elim eqth th end |
174 |
handle THM (msg, _, _) => |
|
175 |
(warning ("Error in the combinator translation of " ^ |
|
176 |
Display.string_of_thm_without_context th ^ |
|
177 |
"\nException message: " ^ msg ^ "."); |
|
178 |
(* A type variable of sort "{}" will make abstraction fail. *) |
|
179 |
TrueI) |
|
16009 | 180 |
|
181 |
(*cterms are used throughout for efficiency*) |
|
38280 | 182 |
val cTrueprop = cterm_of @{theory HOL} HOLogic.Trueprop; |
16009 | 183 |
|
184 |
(*Given an abstraction over n variables, replace the bound variables by free |
|
185 |
ones. Return the body, along with the list of free variables.*) |
|
20461
d689ad772b2c
skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents:
20457
diff
changeset
|
186 |
fun c_variant_abs_multi (ct0, vars) = |
16009 | 187 |
let val (cv,ct) = Thm.dest_abs NONE ct0 |
188 |
in c_variant_abs_multi (ct, cv::vars) end |
|
189 |
handle CTERM _ => (ct0, rev vars); |
|
190 |
||
37617
f73cd4069f69
always perform "inline" skolemization, polymorphism or not, Skolem cache or not
blanchet
parents:
37616
diff
changeset
|
191 |
val skolem_id_def_raw = @{thms skolem_id_def_raw} |
f73cd4069f69
always perform "inline" skolemization, polymorphism or not, Skolem cache or not
blanchet
parents:
37616
diff
changeset
|
192 |
|
f73cd4069f69
always perform "inline" skolemization, polymorphism or not, Skolem cache or not
blanchet
parents:
37616
diff
changeset
|
193 |
(* Given the definition of a Skolem function, return a theorem to replace |
f73cd4069f69
always perform "inline" skolemization, polymorphism or not, Skolem cache or not
blanchet
parents:
37616
diff
changeset
|
194 |
an existential formula by a use of that function. |
18141
89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18009
diff
changeset
|
195 |
Example: "EX x. x : A & x ~: B ==> sko A B : A & sko A B ~: B" [.] *) |
38016 | 196 |
fun skolem_theorem_of_def thy rhs0 = |
37399
34f080a12063
proper polymorphic Skolemization of uncached facts + synchronization of caching and relevance filter
blanchet
parents:
37349
diff
changeset
|
197 |
let |
38280 | 198 |
val rhs = rhs0 |> Type.legacy_freeze_thaw |> #1 |> cterm_of thy |
37617
f73cd4069f69
always perform "inline" skolemization, polymorphism or not, Skolem cache or not
blanchet
parents:
37616
diff
changeset
|
199 |
val rhs' = rhs |> Thm.dest_comb |> snd |
f73cd4069f69
always perform "inline" skolemization, polymorphism or not, Skolem cache or not
blanchet
parents:
37616
diff
changeset
|
200 |
val (ch, frees) = c_variant_abs_multi (rhs', []) |
f73cd4069f69
always perform "inline" skolemization, polymorphism or not, Skolem cache or not
blanchet
parents:
37616
diff
changeset
|
201 |
val (hilbert, cabs) = ch |> Thm.dest_comb |>> term_of |
f73cd4069f69
always perform "inline" skolemization, polymorphism or not, Skolem cache or not
blanchet
parents:
37616
diff
changeset
|
202 |
val T = |
f73cd4069f69
always perform "inline" skolemization, polymorphism or not, Skolem cache or not
blanchet
parents:
37616
diff
changeset
|
203 |
case hilbert of |
f73cd4069f69
always perform "inline" skolemization, polymorphism or not, Skolem cache or not
blanchet
parents:
37616
diff
changeset
|
204 |
Const (@{const_name Eps}, Type (@{type_name fun}, [_, T])) => T |
f73cd4069f69
always perform "inline" skolemization, polymorphism or not, Skolem cache or not
blanchet
parents:
37616
diff
changeset
|
205 |
| _ => raise TERM ("skolem_theorem_of_def: expected \"Eps\"", [hilbert]) |
38280 | 206 |
val cex = cterm_of thy (HOLogic.exists_const T) |
37617
f73cd4069f69
always perform "inline" skolemization, polymorphism or not, Skolem cache or not
blanchet
parents:
37616
diff
changeset
|
207 |
val ex_tm = Thm.capply cTrueprop (Thm.capply cex cabs) |
37629 | 208 |
val conc = |
37617
f73cd4069f69
always perform "inline" skolemization, polymorphism or not, Skolem cache or not
blanchet
parents:
37616
diff
changeset
|
209 |
Drule.list_comb (rhs, frees) |
f73cd4069f69
always perform "inline" skolemization, polymorphism or not, Skolem cache or not
blanchet
parents:
37616
diff
changeset
|
210 |
|> Drule.beta_conv cabs |> Thm.capply cTrueprop |
f73cd4069f69
always perform "inline" skolemization, polymorphism or not, Skolem cache or not
blanchet
parents:
37616
diff
changeset
|
211 |
fun tacf [prem] = |
38016 | 212 |
rewrite_goals_tac skolem_id_def_raw |
213 |
THEN rtac ((prem |> rewrite_rule skolem_id_def_raw) RS @{thm someI_ex}) 1 |
|
37617
f73cd4069f69
always perform "inline" skolemization, polymorphism or not, Skolem cache or not
blanchet
parents:
37616
diff
changeset
|
214 |
in |
37629 | 215 |
Goal.prove_internal [ex_tm] conc tacf |
216 |
|> forall_intr_list frees |
|
217 |
|> Thm.forall_elim_vars 0 (*Introduce Vars, but don't discharge defs.*) |
|
218 |
|> Thm.varifyT_global |
|
37617
f73cd4069f69
always perform "inline" skolemization, polymorphism or not, Skolem cache or not
blanchet
parents:
37616
diff
changeset
|
219 |
end |
24742
73b8b42a36b6
removal of some "ref"s from res_axioms.ML; a side-effect is that the ordering
paulson
parents:
24669
diff
changeset
|
220 |
|
37995
06f02b15ef8a
generate full first-order formulas (FOF) in Sledgehammer
blanchet
parents:
37629
diff
changeset
|
221 |
(* Converts an Isabelle theorem (intro, elim or simp format, even higher-order) |
06f02b15ef8a
generate full first-order formulas (FOF) in Sledgehammer
blanchet
parents:
37629
diff
changeset
|
222 |
into NNF. *) |
24937
340523598914
context-based treatment of generalization; also handling TFrees in axiom clauses
paulson
parents:
24854
diff
changeset
|
223 |
fun to_nnf th ctxt0 = |
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:
38282
diff
changeset
|
224 |
let |
01ed56c46259
beta eta contract the Sledgehammer conjecture (and also the axioms, although this might not be needed), just like Metis does (implicitly);
blanchet
parents:
38282
diff
changeset
|
225 |
val th1 = th |> transform_elim_theorem |> zero_var_indexes |
01ed56c46259
beta eta contract the Sledgehammer conjecture (and also the axioms, although this might not be needed), just like Metis does (implicitly);
blanchet
parents:
38282
diff
changeset
|
226 |
val ((_, [th2]), ctxt) = Variable.import true [th1] ctxt0 |
01ed56c46259
beta eta contract the Sledgehammer conjecture (and also the axioms, although this might not be needed), just like Metis does (implicitly);
blanchet
parents:
38282
diff
changeset
|
227 |
val th3 = th2 |> Conv.fconv_rule Object_Logic.atomize |
01ed56c46259
beta eta contract the Sledgehammer conjecture (and also the axioms, although this might not be needed), just like Metis does (implicitly);
blanchet
parents:
38282
diff
changeset
|
228 |
|> extensionalize_theorem |
01ed56c46259
beta eta contract the Sledgehammer conjecture (and also the axioms, although this might not be needed), just like Metis does (implicitly);
blanchet
parents:
38282
diff
changeset
|
229 |
|> Meson.make_nnf ctxt |
01ed56c46259
beta eta contract the Sledgehammer conjecture (and also the axioms, although this might not be needed), just like Metis does (implicitly);
blanchet
parents:
38282
diff
changeset
|
230 |
in (th3, ctxt) end |
16009 | 231 |
|
39036
dff91b90d74c
use definitional CNFs in Metis rather than plain CNF, following a suggestion by Joe Hurd;
blanchet
parents:
38864
diff
changeset
|
232 |
fun to_definitional_cnf_with_quantifiers thy th = |
dff91b90d74c
use definitional CNFs in Metis rather than plain CNF, following a suggestion by Joe Hurd;
blanchet
parents:
38864
diff
changeset
|
233 |
let |
dff91b90d74c
use definitional CNFs in Metis rather than plain CNF, following a suggestion by Joe Hurd;
blanchet
parents:
38864
diff
changeset
|
234 |
val eqth = cnf.make_cnfx_thm thy (HOLogic.dest_Trueprop (prop_of th)) |
dff91b90d74c
use definitional CNFs in Metis rather than plain CNF, following a suggestion by Joe Hurd;
blanchet
parents:
38864
diff
changeset
|
235 |
val eqth = eqth RS @{thm eq_reflection} |
dff91b90d74c
use definitional CNFs in Metis rather than plain CNF, following a suggestion by Joe Hurd;
blanchet
parents:
38864
diff
changeset
|
236 |
val eqth = eqth RS @{thm TruepropI} |
dff91b90d74c
use definitional CNFs in Metis rather than plain CNF, following a suggestion by Joe Hurd;
blanchet
parents:
38864
diff
changeset
|
237 |
in Thm.equal_elim eqth th end |
dff91b90d74c
use definitional CNFs in Metis rather than plain CNF, following a suggestion by Joe Hurd;
blanchet
parents:
38864
diff
changeset
|
238 |
|
38278 | 239 |
(* Convert a theorem to CNF, with Skolem functions as additional premises. *) |
240 |
fun cnf_axiom thy th = |
|
37626
1146291fe718
move blacklisting completely out of the clausifier;
blanchet
parents:
37620
diff
changeset
|
241 |
let |
1146291fe718
move blacklisting completely out of the clausifier;
blanchet
parents:
37620
diff
changeset
|
242 |
val ctxt0 = Variable.global_thm_context th |
39036
dff91b90d74c
use definitional CNFs in Metis rather than plain CNF, following a suggestion by Joe Hurd;
blanchet
parents:
38864
diff
changeset
|
243 |
val (nnf_th, ctxt) = to_nnf th ctxt0 |
39112 | 244 |
val def_th = (* FIXME: to_definitional_cnf_with_quantifiers thy *) nnf_th |
39036
dff91b90d74c
use definitional CNFs in Metis rather than plain CNF, following a suggestion by Joe Hurd;
blanchet
parents:
38864
diff
changeset
|
245 |
val sko_ths = map (skolem_theorem_of_def thy) (assume_skolem_funs def_th) |
dff91b90d74c
use definitional CNFs in Metis rather than plain CNF, following a suggestion by Joe Hurd;
blanchet
parents:
38864
diff
changeset
|
246 |
val (cnf_ths, ctxt) = Meson.make_cnf sko_ths def_th ctxt |
37626
1146291fe718
move blacklisting completely out of the clausifier;
blanchet
parents:
37620
diff
changeset
|
247 |
in |
39036
dff91b90d74c
use definitional CNFs in Metis rather than plain CNF, following a suggestion by Joe Hurd;
blanchet
parents:
38864
diff
changeset
|
248 |
cnf_ths |> map introduce_combinators_in_theorem |
dff91b90d74c
use definitional CNFs in Metis rather than plain CNF, following a suggestion by Joe Hurd;
blanchet
parents:
38864
diff
changeset
|
249 |
|> Variable.export ctxt ctxt0 |
dff91b90d74c
use definitional CNFs in Metis rather than plain CNF, following a suggestion by Joe Hurd;
blanchet
parents:
38864
diff
changeset
|
250 |
|> Meson.finish_cnf |
dff91b90d74c
use definitional CNFs in Metis rather than plain CNF, following a suggestion by Joe Hurd;
blanchet
parents:
38864
diff
changeset
|
251 |
|> map Thm.close_derivation |
37626
1146291fe718
move blacklisting completely out of the clausifier;
blanchet
parents:
37620
diff
changeset
|
252 |
end |
1146291fe718
move blacklisting completely out of the clausifier;
blanchet
parents:
37620
diff
changeset
|
253 |
handle THM _ => [] |
27184 | 254 |
|
20461
d689ad772b2c
skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents:
20457
diff
changeset
|
255 |
end; |