author | blanchet |
Mon, 26 Apr 2010 21:16:35 +0200 | |
changeset 36398 | de8522a5cbae |
parent 36394 | 1a48d18449d8 |
child 36478 | 1aba777a367f |
permissions | -rw-r--r-- |
35826 | 1 |
(* Title: HOL/Tools/Sledgehammer/sledgehammer_fact_preprocessor.ML |
33311 | 2 |
Author: Jia Meng, Cambridge University Computer Laboratory |
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 |
||
35826 | 8 |
signature SLEDGEHAMMER_FACT_PREPROCESSOR = |
21505 | 9 |
sig |
32955 | 10 |
val trace: bool Unsynchronized.ref |
11 |
val trace_msg: (unit -> string) -> unit |
|
35865 | 12 |
val skolem_prefix: string |
27179
8f29fed3dc9a
ResAxioms.cnf_axiom/cnf_rules_pairs: pass explicit theory context;
wenzelm
parents:
27174
diff
changeset
|
13 |
val cnf_axiom: theory -> thm -> thm list |
27184 | 14 |
val multi_base_blacklist: string list |
25243 | 15 |
val bad_for_atp: thm -> bool |
35568
8fbbfc39508f
renamed type_has_empty_sort to type_has_topsort -- {} is the full universal sort;
wenzelm
parents:
33832
diff
changeset
|
16 |
val type_has_topsort: typ -> bool |
27179
8f29fed3dc9a
ResAxioms.cnf_axiom/cnf_rules_pairs: pass explicit theory context;
wenzelm
parents:
27174
diff
changeset
|
17 |
val cnf_rules_pairs: theory -> (string * thm) list -> (thm * (string * int)) list |
32740 | 18 |
val suppress_endtheory: bool Unsynchronized.ref |
19 |
(*for emergency use where endtheory causes problems*) |
|
36398
de8522a5cbae
make "neg_clausify" return a list of lists of clauses, so that it's possible to see which clause comes from which theorem
blanchet
parents:
36394
diff
changeset
|
20 |
val strip_subgoal : thm -> int -> term list * term list * term |
de8522a5cbae
make "neg_clausify" return a list of lists of clauses, so that it's possible to see which clause comes from which theorem
blanchet
parents:
36394
diff
changeset
|
21 |
val neg_clausify: thm -> thm list |
de8522a5cbae
make "neg_clausify" return a list of lists of clauses, so that it's possible to see which clause comes from which theorem
blanchet
parents:
36394
diff
changeset
|
22 |
val neg_conjecture_clauses: |
de8522a5cbae
make "neg_clausify" return a list of lists of clauses, so that it's possible to see which clause comes from which theorem
blanchet
parents:
36394
diff
changeset
|
23 |
Proof.context -> thm -> int -> thm list list * (string * typ) list |
36394
1a48d18449d8
move "neg_clausify" method and "clausify" attribute to "sledgehammer_isar.ML"
blanchet
parents:
36393
diff
changeset
|
24 |
val neg_clausify_tac: Proof.context -> int -> tactic |
24669 | 25 |
val setup: theory -> theory |
21505 | 26 |
end; |
19196
62ee8c10d796
Added functions to retrieve local and global atpset rules.
mengj
parents:
19175
diff
changeset
|
27 |
|
35826 | 28 |
structure Sledgehammer_Fact_Preprocessor : SLEDGEHAMMER_FACT_PREPROCESSOR = |
15997 | 29 |
struct |
15347 | 30 |
|
35865 | 31 |
open Sledgehammer_FOL_Clause |
32 |
||
32955 | 33 |
val trace = Unsynchronized.ref false; |
35865 | 34 |
fun trace_msg msg = if !trace then tracing (msg ()) else (); |
35 |
||
36 |
val skolem_prefix = "sko_" |
|
32955 | 37 |
|
33832 | 38 |
fun freeze_thm th = #1 (Drule.legacy_freeze_thaw th); |
20863
4ee61dbf192d
improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents:
20789
diff
changeset
|
39 |
|
35568
8fbbfc39508f
renamed type_has_empty_sort to type_has_topsort -- {} is the full universal sort;
wenzelm
parents:
33832
diff
changeset
|
40 |
val type_has_topsort = Term.exists_subtype |
8fbbfc39508f
renamed type_has_empty_sort to type_has_topsort -- {} is the full universal sort;
wenzelm
parents:
33832
diff
changeset
|
41 |
(fn TFree (_, []) => true |
8fbbfc39508f
renamed type_has_empty_sort to type_has_topsort -- {} is the full universal sort;
wenzelm
parents:
33832
diff
changeset
|
42 |
| TVar (_, []) => true |
8fbbfc39508f
renamed type_has_empty_sort to type_has_topsort -- {} is the full universal sort;
wenzelm
parents:
33832
diff
changeset
|
43 |
| _ => false); |
27184 | 44 |
|
28544
26743a1591f5
improved performance of skolem cache, due to parallel map;
wenzelm
parents:
28262
diff
changeset
|
45 |
|
15997 | 46 |
(**** Transformation of Elimination Rules into First-Order Formulas****) |
15347 | 47 |
|
29064 | 48 |
val cfalse = cterm_of @{theory HOL} HOLogic.false_const; |
49 |
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
|
50 |
|
21430
77651b6d9d6c
New transformation of eliminatino rules: we simply replace the final conclusion variable by False
paulson
parents:
21290
diff
changeset
|
51 |
(*Converts an elim-rule into an equivalent theorem that does not have the |
77651b6d9d6c
New transformation of eliminatino rules: we simply replace the final conclusion variable by False
paulson
parents:
21290
diff
changeset
|
52 |
predicate variable. Leaves other theorems unchanged. We simply instantiate the |
77651b6d9d6c
New transformation of eliminatino rules: we simply replace the final conclusion variable by False
paulson
parents:
21290
diff
changeset
|
53 |
conclusion variable to False.*) |
16009 | 54 |
fun transform_elim th = |
21430
77651b6d9d6c
New transformation of eliminatino rules: we simply replace the final conclusion variable by False
paulson
parents:
21290
diff
changeset
|
55 |
case concl_of th of (*conclusion variable*) |
35963 | 56 |
@{const Trueprop} $ (v as Var (_, @{typ bool})) => |
29064 | 57 |
Thm.instantiate ([], [(cterm_of @{theory HOL} v, cfalse)]) th |
35963 | 58 |
| v as Var(_, @{typ prop}) => |
29064 | 59 |
Thm.instantiate ([], [(cterm_of @{theory HOL} v, ctp_false)]) th |
21430
77651b6d9d6c
New transformation of eliminatino rules: we simply replace the final conclusion variable by False
paulson
parents:
21290
diff
changeset
|
60 |
| _ => th; |
15997 | 61 |
|
24742
73b8b42a36b6
removal of some "ref"s from res_axioms.ML; a side-effect is that the ordering
paulson
parents:
24669
diff
changeset
|
62 |
(*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
|
63 |
exception Clausify_failure of theory; |
20461
d689ad772b2c
skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents:
20457
diff
changeset
|
64 |
|
28544
26743a1591f5
improved performance of skolem cache, due to parallel map;
wenzelm
parents:
28262
diff
changeset
|
65 |
|
16009 | 66 |
(**** SKOLEMIZATION BY INFERENCE (lcp) ****) |
67 |
||
24742
73b8b42a36b6
removal of some "ref"s from res_axioms.ML; a side-effect is that the ordering
paulson
parents:
24669
diff
changeset
|
68 |
fun rhs_extra_types lhsT rhs = |
73b8b42a36b6
removal of some "ref"s from res_axioms.ML; a side-effect is that the ordering
paulson
parents:
24669
diff
changeset
|
69 |
let val lhs_vars = Term.add_tfreesT lhsT [] |
73b8b42a36b6
removal of some "ref"s from res_axioms.ML; a side-effect is that the ordering
paulson
parents:
24669
diff
changeset
|
70 |
fun add_new_TFrees (TFree v) = |
24821
cc55041ca8ba
skolem_cache: ignore internal theorems -- major speedup;
wenzelm
parents:
24785
diff
changeset
|
71 |
if member (op =) lhs_vars v then I else insert (op =) (TFree v) |
cc55041ca8ba
skolem_cache: ignore internal theorems -- major speedup;
wenzelm
parents:
24785
diff
changeset
|
72 |
| add_new_TFrees _ = I |
24742
73b8b42a36b6
removal of some "ref"s from res_axioms.ML; a side-effect is that the ordering
paulson
parents:
24669
diff
changeset
|
73 |
val rhs_consts = fold_aterms (fn Const c => insert (op =) c | _ => I) rhs [] |
73b8b42a36b6
removal of some "ref"s from res_axioms.ML; a side-effect is that the ordering
paulson
parents:
24669
diff
changeset
|
74 |
in fold (#2 #> Term.fold_atyps add_new_TFrees) rhs_consts [] end; |
73b8b42a36b6
removal of some "ref"s from res_axioms.ML; a side-effect is that the ordering
paulson
parents:
24669
diff
changeset
|
75 |
|
18141
89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18009
diff
changeset
|
76 |
(*Traverse a theorem, declaring Skolem function definitions. String s is the suggested |
27174
c2c484480f40
declare_skofuns/skolem: canonical argument order;
wenzelm
parents:
26939
diff
changeset
|
77 |
prefix for the Skolem constant.*) |
c2c484480f40
declare_skofuns/skolem: canonical argument order;
wenzelm
parents:
26939
diff
changeset
|
78 |
fun declare_skofuns s th = |
c2c484480f40
declare_skofuns/skolem: canonical argument order;
wenzelm
parents:
26939
diff
changeset
|
79 |
let |
33222 | 80 |
val nref = Unsynchronized.ref 0 (* FIXME ??? *) |
35963 | 81 |
fun dec_sko (Const (@{const_name Ex}, _) $ (xtp as Abs (_, T, p))) (axs, thy) = |
27174
c2c484480f40
declare_skofuns/skolem: canonical argument order;
wenzelm
parents:
26939
diff
changeset
|
82 |
(*Existential: declare a Skolem function, then insert into body and continue*) |
c2c484480f40
declare_skofuns/skolem: canonical argument order;
wenzelm
parents:
26939
diff
changeset
|
83 |
let |
35865 | 84 |
val cname = skolem_prefix ^ s ^ "_" ^ Int.toString (Unsynchronized.inc nref) |
29265
5b4247055bd7
moved old add_term_vars, add_term_frees etc. to structure OldTerm;
wenzelm
parents:
29064
diff
changeset
|
85 |
val args0 = OldTerm.term_frees xtp (*get the formal parameter list*) |
27174
c2c484480f40
declare_skofuns/skolem: canonical argument order;
wenzelm
parents:
26939
diff
changeset
|
86 |
val Ts = map type_of args0 |
c2c484480f40
declare_skofuns/skolem: canonical argument order;
wenzelm
parents:
26939
diff
changeset
|
87 |
val extraTs = rhs_extra_types (Ts ---> T) xtp |
c2c484480f40
declare_skofuns/skolem: canonical argument order;
wenzelm
parents:
26939
diff
changeset
|
88 |
val argsx = map (fn T => Free (gensym "vsk", T)) extraTs |
c2c484480f40
declare_skofuns/skolem: canonical argument order;
wenzelm
parents:
26939
diff
changeset
|
89 |
val args = argsx @ args0 |
c2c484480f40
declare_skofuns/skolem: canonical argument order;
wenzelm
parents:
26939
diff
changeset
|
90 |
val cT = extraTs ---> Ts ---> T |
c2c484480f40
declare_skofuns/skolem: canonical argument order;
wenzelm
parents:
26939
diff
changeset
|
91 |
val rhs = list_abs_free (map dest_Free args, HOLogic.choice_const T $ xtp) |
c2c484480f40
declare_skofuns/skolem: canonical argument order;
wenzelm
parents:
26939
diff
changeset
|
92 |
(*Forms a lambda-abstraction over the formal parameters*) |
28110 | 93 |
val (c, thy') = |
33173
b8ca12f6681a
eliminated obsolete tags for types/consts -- now handled via name space, in strongly typed fashion;
wenzelm
parents:
33158
diff
changeset
|
94 |
Sign.declare_const ((Binding.conceal (Binding.name cname), cT), NoSyn) thy |
27174
c2c484480f40
declare_skofuns/skolem: canonical argument order;
wenzelm
parents:
26939
diff
changeset
|
95 |
val cdef = cname ^ "_def" |
36106
19deea200358
Thm.add_axiom/add_def: return internal name of foundational axiom;
wenzelm
parents:
35984
diff
changeset
|
96 |
val ((_, ax), thy'') = |
35984 | 97 |
Thm.add_def true false (Binding.name cdef, Logic.mk_equals (c, rhs)) thy' |
98 |
val ax' = Drule.export_without_context ax |
|
99 |
in dec_sko (subst_bound (list_comb (c, args), p)) (ax' :: axs, thy'') end |
|
35963 | 100 |
| dec_sko (Const (@{const_name All}, _) $ (Abs (a, T, p))) thx = |
27174
c2c484480f40
declare_skofuns/skolem: canonical argument order;
wenzelm
parents:
26939
diff
changeset
|
101 |
(*Universal quant: insert a free variable into body and continue*) |
29270
0eade173f77e
moved old add_type_XXX, add_term_XXX etc. to structure OldTerm;
wenzelm
parents:
29265
diff
changeset
|
102 |
let val fname = Name.variant (OldTerm.add_term_names (p, [])) a |
27174
c2c484480f40
declare_skofuns/skolem: canonical argument order;
wenzelm
parents:
26939
diff
changeset
|
103 |
in dec_sko (subst_bound (Free (fname, T), p)) thx end |
35963 | 104 |
| dec_sko (@{const "op &"} $ p $ q) thx = dec_sko q (dec_sko p thx) |
105 |
| dec_sko (@{const "op |"} $ p $ q) thx = dec_sko q (dec_sko p thx) |
|
106 |
| dec_sko (@{const Trueprop} $ p) thx = dec_sko p thx |
|
27174
c2c484480f40
declare_skofuns/skolem: canonical argument order;
wenzelm
parents:
26939
diff
changeset
|
107 |
| dec_sko t thx = thx (*Do nothing otherwise*) |
c2c484480f40
declare_skofuns/skolem: canonical argument order;
wenzelm
parents:
26939
diff
changeset
|
108 |
in fn thy => dec_sko (Thm.prop_of th) ([], thy) end; |
18141
89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18009
diff
changeset
|
109 |
|
89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18009
diff
changeset
|
110 |
(*Traverse a theorem, accumulating Skolem function definitions.*) |
22731
abfdccaed085
trying to make single-step proofs work better, especially if they contain
paulson
parents:
22724
diff
changeset
|
111 |
fun assume_skofuns s th = |
33222 | 112 |
let val sko_count = Unsynchronized.ref 0 (* FIXME ??? *) |
35971 | 113 |
fun dec_sko (Const (@{const_name Ex}, _) $ (xtp as Abs(_,T,p))) defs = |
20461
d689ad772b2c
skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents:
20457
diff
changeset
|
114 |
(*Existential: declare a Skolem function, then insert into body and continue*) |
d689ad772b2c
skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents:
20457
diff
changeset
|
115 |
let val skos = map (#1 o Logic.dest_equals) defs (*existing sko fns*) |
33040 | 116 |
val args = subtract (op =) skos (OldTerm.term_frees xtp) (*the formal parameters*) |
20461
d689ad772b2c
skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents:
20457
diff
changeset
|
117 |
val Ts = map type_of args |
d689ad772b2c
skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents:
20457
diff
changeset
|
118 |
val cT = Ts ---> T |
35865 | 119 |
val id = skolem_prefix ^ s ^ "_" ^ Int.toString (Unsynchronized.inc sko_count) |
22731
abfdccaed085
trying to make single-step proofs work better, especially if they contain
paulson
parents:
22724
diff
changeset
|
120 |
val c = Free (id, cT) |
20461
d689ad772b2c
skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents:
20457
diff
changeset
|
121 |
val rhs = list_abs_free (map dest_Free args, |
d689ad772b2c
skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents:
20457
diff
changeset
|
122 |
HOLogic.choice_const T $ xtp) |
d689ad772b2c
skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents:
20457
diff
changeset
|
123 |
(*Forms a lambda-abstraction over the formal parameters*) |
27330 | 124 |
val def = Logic.mk_equals (c, rhs) |
20461
d689ad772b2c
skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents:
20457
diff
changeset
|
125 |
in dec_sko (subst_bound (list_comb(c,args), p)) |
d689ad772b2c
skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents:
20457
diff
changeset
|
126 |
(def :: defs) |
d689ad772b2c
skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents:
20457
diff
changeset
|
127 |
end |
35963 | 128 |
| dec_sko (Const (@{const_name All},_) $ Abs (a, T, p)) defs = |
20461
d689ad772b2c
skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents:
20457
diff
changeset
|
129 |
(*Universal quant: insert a free variable into body and continue*) |
29270
0eade173f77e
moved old add_type_XXX, add_term_XXX etc. to structure OldTerm;
wenzelm
parents:
29265
diff
changeset
|
130 |
let val fname = Name.variant (OldTerm.add_term_names (p,[])) a |
20461
d689ad772b2c
skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents:
20457
diff
changeset
|
131 |
in dec_sko (subst_bound (Free(fname,T), p)) defs end |
35963 | 132 |
| dec_sko (@{const "op &"} $ p $ q) defs = dec_sko q (dec_sko p defs) |
133 |
| dec_sko (@{const "op |"} $ p $ q) defs = dec_sko q (dec_sko p defs) |
|
134 |
| dec_sko (@{const Trueprop} $ p) defs = dec_sko p defs |
|
20461
d689ad772b2c
skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents:
20457
diff
changeset
|
135 |
| dec_sko t defs = defs (*Do nothing otherwise*) |
20419 | 136 |
in dec_sko (prop_of th) [] end; |
137 |
||
138 |
||
24827 | 139 |
(**** REPLACING ABSTRACTIONS BY COMBINATORS ****) |
20419 | 140 |
|
141 |
(*Returns the vars of a theorem*) |
|
142 |
fun vars_of_thm th = |
|
22691 | 143 |
map (Thm.cterm_of (theory_of_thm th) o Var) (Thm.fold_terms Term.add_vars th []); |
20419 | 144 |
|
145 |
(*Make a version of fun_cong with a given variable name*) |
|
146 |
local |
|
147 |
val fun_cong' = fun_cong RS asm_rl; (*renumber f, g to prevent clashes with (a,0)*) |
|
148 |
val cx = hd (vars_of_thm fun_cong'); |
|
149 |
val ty = typ_of (ctyp_of_term cx); |
|
20445 | 150 |
val thy = theory_of_thm fun_cong; |
20419 | 151 |
fun mkvar a = cterm_of thy (Var((a,0),ty)); |
152 |
in |
|
153 |
fun xfun_cong x = Thm.instantiate ([], [(cx, mkvar x)]) fun_cong' |
|
154 |
end; |
|
155 |
||
20863
4ee61dbf192d
improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents:
20789
diff
changeset
|
156 |
(*Removes the lambdas from an equation of the form t = (%x. u). A non-negative n, |
4ee61dbf192d
improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents:
20789
diff
changeset
|
157 |
serves as an upper bound on how many to remove.*) |
4ee61dbf192d
improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents:
20789
diff
changeset
|
158 |
fun strip_lambdas 0 th = th |
24669 | 159 |
| strip_lambdas n th = |
20863
4ee61dbf192d
improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents:
20789
diff
changeset
|
160 |
case prop_of th of |
35963 | 161 |
_ $ (Const (@{const_name "op ="}, _) $ _ $ Abs (x, _, _)) => |
24669 | 162 |
strip_lambdas (n-1) (freeze_thm (th RS xfun_cong x)) |
163 |
| _ => th; |
|
20419 | 164 |
|
24669 | 165 |
val lambda_free = not o Term.has_abs; |
20461
d689ad772b2c
skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents:
20457
diff
changeset
|
166 |
|
32010 | 167 |
val [f_B,g_B] = map (cterm_of @{theory}) (OldTerm.term_vars (prop_of @{thm abs_B})); |
168 |
val [g_C,f_C] = map (cterm_of @{theory}) (OldTerm.term_vars (prop_of @{thm abs_C})); |
|
169 |
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
|
170 |
|
24827 | 171 |
(*FIXME: requires more use of cterm constructors*) |
172 |
fun abstract ct = |
|
28544
26743a1591f5
improved performance of skolem cache, due to parallel map;
wenzelm
parents:
28262
diff
changeset
|
173 |
let |
26743a1591f5
improved performance of skolem cache, due to parallel map;
wenzelm
parents:
28262
diff
changeset
|
174 |
val thy = theory_of_cterm ct |
25256
fe467fdf129a
Catch exceptions arising during the abstraction operation.
paulson
parents:
25243
diff
changeset
|
175 |
val Abs(x,_,body) = term_of ct |
35963 | 176 |
val Type(@{type_name fun}, [xT,bodyT]) = typ_of (ctyp_of_term ct) |
24827 | 177 |
val cxT = ctyp_of thy xT and cbodyT = ctyp_of thy bodyT |
27184 | 178 |
fun makeK() = instantiate' [SOME cxT, SOME cbodyT] [SOME (cterm_of thy body)] @{thm abs_K} |
24827 | 179 |
in |
180 |
case body of |
|
181 |
Const _ => makeK() |
|
182 |
| Free _ => makeK() |
|
183 |
| Var _ => makeK() (*though Var isn't expected*) |
|
27184 | 184 |
| Bound 0 => instantiate' [SOME cxT] [] @{thm abs_I} (*identity: I*) |
24827 | 185 |
| rator$rand => |
27184 | 186 |
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
|
187 |
if loose_bvar1 (rand,0) then (*S*) |
8f29fed3dc9a
ResAxioms.cnf_axiom/cnf_rules_pairs: pass explicit theory context;
wenzelm
parents:
27174
diff
changeset
|
188 |
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
|
189 |
val crand = cterm_of thy (Abs(x,xT,rand)) |
27184 | 190 |
val abs_S' = cterm_instantiate [(f_S,crator),(g_S,crand)] @{thm abs_S} |
191 |
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
|
192 |
in |
8f29fed3dc9a
ResAxioms.cnf_axiom/cnf_rules_pairs: pass explicit theory context;
wenzelm
parents:
27174
diff
changeset
|
193 |
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
|
194 |
end |
8f29fed3dc9a
ResAxioms.cnf_axiom/cnf_rules_pairs: pass explicit theory context;
wenzelm
parents:
27174
diff
changeset
|
195 |
else (*C*) |
8f29fed3dc9a
ResAxioms.cnf_axiom/cnf_rules_pairs: pass explicit theory context;
wenzelm
parents:
27174
diff
changeset
|
196 |
let val crator = cterm_of thy (Abs(x,xT,rator)) |
27184 | 197 |
val abs_C' = cterm_instantiate [(f_C,crator),(g_C,cterm_of thy rand)] @{thm abs_C} |
198 |
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
|
199 |
in |
8f29fed3dc9a
ResAxioms.cnf_axiom/cnf_rules_pairs: pass explicit theory context;
wenzelm
parents:
27174
diff
changeset
|
200 |
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
|
201 |
end |
27184 | 202 |
else if loose_bvar1 (rand,0) then (*B or eta*) |
27179
8f29fed3dc9a
ResAxioms.cnf_axiom/cnf_rules_pairs: pass explicit theory context;
wenzelm
parents:
27174
diff
changeset
|
203 |
if rand = Bound 0 then eta_conversion ct |
8f29fed3dc9a
ResAxioms.cnf_axiom/cnf_rules_pairs: pass explicit theory context;
wenzelm
parents:
27174
diff
changeset
|
204 |
else (*B*) |
8f29fed3dc9a
ResAxioms.cnf_axiom/cnf_rules_pairs: pass explicit theory context;
wenzelm
parents:
27174
diff
changeset
|
205 |
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
|
206 |
val crator = cterm_of thy rator |
27184 | 207 |
val abs_B' = cterm_instantiate [(f_B,crator),(g_B,crand)] @{thm abs_B} |
208 |
val (_,rhs) = Thm.dest_equals (cprop_of abs_B') |
|
27179
8f29fed3dc9a
ResAxioms.cnf_axiom/cnf_rules_pairs: pass explicit theory context;
wenzelm
parents:
27174
diff
changeset
|
209 |
in |
8f29fed3dc9a
ResAxioms.cnf_axiom/cnf_rules_pairs: pass explicit theory context;
wenzelm
parents:
27174
diff
changeset
|
210 |
Thm.transitive abs_B' (Conv.arg_conv abstract rhs) |
8f29fed3dc9a
ResAxioms.cnf_axiom/cnf_rules_pairs: pass explicit theory context;
wenzelm
parents:
27174
diff
changeset
|
211 |
end |
8f29fed3dc9a
ResAxioms.cnf_axiom/cnf_rules_pairs: pass explicit theory context;
wenzelm
parents:
27174
diff
changeset
|
212 |
else makeK() |
24827 | 213 |
| _ => error "abstract: Bad term" |
214 |
end; |
|
20863
4ee61dbf192d
improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents:
20789
diff
changeset
|
215 |
|
20419 | 216 |
(*Traverse a theorem, declaring abstraction function definitions. String s is the suggested |
28544
26743a1591f5
improved performance of skolem cache, due to parallel map;
wenzelm
parents:
28262
diff
changeset
|
217 |
prefix for the constants.*) |
24827 | 218 |
fun combinators_aux ct = |
219 |
if lambda_free (term_of ct) then reflexive ct |
|
220 |
else |
|
221 |
case term_of ct of |
|
222 |
Abs _ => |
|
32994 | 223 |
let val (cv, cta) = Thm.dest_abs NONE ct |
224 |
val (v, _) = dest_Free (term_of cv) |
|
27179
8f29fed3dc9a
ResAxioms.cnf_axiom/cnf_rules_pairs: pass explicit theory context;
wenzelm
parents:
27174
diff
changeset
|
225 |
val u_th = combinators_aux cta |
8f29fed3dc9a
ResAxioms.cnf_axiom/cnf_rules_pairs: pass explicit theory context;
wenzelm
parents:
27174
diff
changeset
|
226 |
val cu = Thm.rhs_of u_th |
8f29fed3dc9a
ResAxioms.cnf_axiom/cnf_rules_pairs: pass explicit theory context;
wenzelm
parents:
27174
diff
changeset
|
227 |
val comb_eq = abstract (Thm.cabs cv cu) |
28544
26743a1591f5
improved performance of skolem cache, due to parallel map;
wenzelm
parents:
28262
diff
changeset
|
228 |
in transitive (abstract_rule v cv u_th) comb_eq end |
32994 | 229 |
| _ $ _ => |
230 |
let val (ct1, ct2) = Thm.dest_comb ct |
|
27179
8f29fed3dc9a
ResAxioms.cnf_axiom/cnf_rules_pairs: pass explicit theory context;
wenzelm
parents:
27174
diff
changeset
|
231 |
in combination (combinators_aux ct1) (combinators_aux ct2) end; |
27184 | 232 |
|
24827 | 233 |
fun combinators th = |
27184 | 234 |
if lambda_free (prop_of th) then th |
24827 | 235 |
else |
28544
26743a1591f5
improved performance of skolem cache, due to parallel map;
wenzelm
parents:
28262
diff
changeset
|
236 |
let val th = Drule.eta_contraction_rule th |
27179
8f29fed3dc9a
ResAxioms.cnf_axiom/cnf_rules_pairs: pass explicit theory context;
wenzelm
parents:
27174
diff
changeset
|
237 |
val eqth = combinators_aux (cprop_of th) |
25256
fe467fdf129a
Catch exceptions arising during the abstraction operation.
paulson
parents:
25243
diff
changeset
|
238 |
in equal_elim eqth th end |
27184 | 239 |
handle THM (msg,_,_) => |
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:
32010
diff
changeset
|
240 |
(warning (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:
32010
diff
changeset
|
241 |
["Error in the combinator translation of " ^ Display.string_of_thm_without_context th, |
30e2ffbba718
proper context for Display.pretty_thm etc. or old-style versions Display.pretty_thm_global, Display.pretty_thm_without_context etc.;
wenzelm
parents:
32010
diff
changeset
|
242 |
" Exception message: " ^ msg]); |
25256
fe467fdf129a
Catch exceptions arising during the abstraction operation.
paulson
parents:
25243
diff
changeset
|
243 |
TrueI); (*A type variable of sort {} will cause make abstraction fail.*) |
16009 | 244 |
|
245 |
(*cterms are used throughout for efficiency*) |
|
29064 | 246 |
val cTrueprop = Thm.cterm_of @{theory HOL} HOLogic.Trueprop; |
16009 | 247 |
|
248 |
(*cterm version of mk_cTrueprop*) |
|
249 |
fun c_mkTrueprop A = Thm.capply cTrueprop A; |
|
250 |
||
251 |
(*Given an abstraction over n variables, replace the bound variables by free |
|
252 |
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
|
253 |
fun c_variant_abs_multi (ct0, vars) = |
16009 | 254 |
let val (cv,ct) = Thm.dest_abs NONE ct0 |
255 |
in c_variant_abs_multi (ct, cv::vars) end |
|
256 |
handle CTERM _ => (ct0, rev vars); |
|
257 |
||
20461
d689ad772b2c
skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents:
20457
diff
changeset
|
258 |
(*Given the definition of a Skolem function, return a theorem to replace |
d689ad772b2c
skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents:
20457
diff
changeset
|
259 |
an existential formula by a use of that function. |
18141
89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18009
diff
changeset
|
260 |
Example: "EX x. x : A & x ~: B ==> sko A B : A & sko A B ~: B" [.] *) |
20461
d689ad772b2c
skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents:
20457
diff
changeset
|
261 |
fun skolem_of_def def = |
22902
ac833b4bb7ee
moved some Drule operations to Thm (see more_thm.ML);
wenzelm
parents:
22846
diff
changeset
|
262 |
let val (c,rhs) = Thm.dest_equals (cprop_of (freeze_thm def)) |
16009 | 263 |
val (ch, frees) = c_variant_abs_multi (rhs, []) |
18141
89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18009
diff
changeset
|
264 |
val (chilbert,cabs) = Thm.dest_comb ch |
26627
dac6d56b7c8d
rep_cterm/rep_thm: no longer dereference theory_ref;
wenzelm
parents:
26618
diff
changeset
|
265 |
val thy = Thm.theory_of_cterm chilbert |
dac6d56b7c8d
rep_cterm/rep_thm: no longer dereference theory_ref;
wenzelm
parents:
26618
diff
changeset
|
266 |
val t = Thm.term_of chilbert |
35963 | 267 |
val T = case t of |
268 |
Const (@{const_name Eps}, Type (@{type_name fun},[_,T])) => T |
|
269 |
| _ => raise THM ("skolem_of_def: expected Eps", 0, [def]) |
|
22596 | 270 |
val cex = Thm.cterm_of thy (HOLogic.exists_const T) |
16009 | 271 |
val ex_tm = c_mkTrueprop (Thm.capply cex cabs) |
272 |
and conc = c_mkTrueprop (Drule.beta_conv cabs (Drule.list_comb(c,frees))); |
|
31454 | 273 |
fun tacf [prem] = rewrite_goals_tac [def] THEN rtac (prem RS @{thm someI_ex}) 1 |
23352 | 274 |
in Goal.prove_internal [ex_tm] conc tacf |
18141
89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18009
diff
changeset
|
275 |
|> forall_intr_list frees |
26653 | 276 |
|> Thm.forall_elim_vars 0 (*Introduce Vars, but don't discharge defs.*) |
35845
e5980f0ad025
renamed varify/unvarify operations to varify_global/unvarify_global to emphasize that these only work in a global situation;
wenzelm
parents:
35828
diff
changeset
|
277 |
|> Thm.varifyT_global |
18141
89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18009
diff
changeset
|
278 |
end; |
16009 | 279 |
|
24742
73b8b42a36b6
removal of some "ref"s from res_axioms.ML; a side-effect is that the ordering
paulson
parents:
24669
diff
changeset
|
280 |
|
20863
4ee61dbf192d
improvements to abstraction, ensuring more re-use of abstraction functions
paulson
parents:
20789
diff
changeset
|
281 |
(*Converts an Isabelle theorem (intro, elim or simp format, even higher-order) into NNF.*) |
24937
340523598914
context-based treatment of generalization; also handling TFrees in axiom clauses
paulson
parents:
24854
diff
changeset
|
282 |
fun to_nnf th ctxt0 = |
27179
8f29fed3dc9a
ResAxioms.cnf_axiom/cnf_rules_pairs: pass explicit theory context;
wenzelm
parents:
27174
diff
changeset
|
283 |
let val th1 = th |> transform_elim |> zero_var_indexes |
32262 | 284 |
val ((_, [th2]), ctxt) = Variable.import true [th1] ctxt0 |
285 |
val th3 = th2 |
|
35625 | 286 |
|> Conv.fconv_rule Object_Logic.atomize |
32262 | 287 |
|> Meson.make_nnf ctxt |> strip_lambdas ~1 |
24937
340523598914
context-based treatment of generalization; also handling TFrees in axiom clauses
paulson
parents:
24854
diff
changeset
|
288 |
in (th3, ctxt) end; |
16009 | 289 |
|
18141
89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18009
diff
changeset
|
290 |
(*Generate Skolem functions for a theorem supplied in nnf*) |
24937
340523598914
context-based treatment of generalization; also handling TFrees in axiom clauses
paulson
parents:
24854
diff
changeset
|
291 |
fun assume_skolem_of_def s th = |
22731
abfdccaed085
trying to make single-step proofs work better, especially if they contain
paulson
parents:
22724
diff
changeset
|
292 |
map (skolem_of_def o assume o (cterm_of (theory_of_thm th))) (assume_skofuns s th); |
18141
89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18009
diff
changeset
|
293 |
|
25007 | 294 |
|
35963 | 295 |
(*** Blacklisting (FIXME: duplicated in "Sledgehammer_Fact_Filter"?) ***) |
25007 | 296 |
|
297 |
val max_lambda_nesting = 3; |
|
27184 | 298 |
|
25007 | 299 |
fun excessive_lambdas (f$t, k) = excessive_lambdas (f,k) orelse excessive_lambdas (t,k) |
300 |
| excessive_lambdas (Abs(_,_,t), k) = k=0 orelse excessive_lambdas (t,k-1) |
|
301 |
| excessive_lambdas _ = false; |
|
302 |
||
303 |
fun is_formula_type T = (T = HOLogic.boolT orelse T = propT); |
|
304 |
||
305 |
(*Don't count nested lambdas at the level of formulas, as they are quantifiers*) |
|
306 |
fun excessive_lambdas_fm Ts (Abs(_,T,t)) = excessive_lambdas_fm (T::Ts) t |
|
307 |
| excessive_lambdas_fm Ts t = |
|
308 |
if is_formula_type (fastype_of1 (Ts, t)) |
|
309 |
then exists (excessive_lambdas_fm Ts) (#2 (strip_comb t)) |
|
310 |
else excessive_lambdas (t, max_lambda_nesting); |
|
311 |
||
33027 | 312 |
(*The max apply_depth of any metis call in Metis_Examples (on 31-10-2007) was 11.*) |
25256
fe467fdf129a
Catch exceptions arising during the abstraction operation.
paulson
parents:
25243
diff
changeset
|
313 |
val max_apply_depth = 15; |
27184 | 314 |
|
25256
fe467fdf129a
Catch exceptions arising during the abstraction operation.
paulson
parents:
25243
diff
changeset
|
315 |
fun apply_depth (f$t) = Int.max (apply_depth f, apply_depth t + 1) |
fe467fdf129a
Catch exceptions arising during the abstraction operation.
paulson
parents:
25243
diff
changeset
|
316 |
| apply_depth (Abs(_,_,t)) = apply_depth t |
fe467fdf129a
Catch exceptions arising during the abstraction operation.
paulson
parents:
25243
diff
changeset
|
317 |
| apply_depth _ = 0; |
fe467fdf129a
Catch exceptions arising during the abstraction operation.
paulson
parents:
25243
diff
changeset
|
318 |
|
27184 | 319 |
fun too_complex t = |
320 |
apply_depth t > max_apply_depth orelse |
|
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:
25761
diff
changeset
|
321 |
Meson.too_many_clauses NONE t orelse |
25256
fe467fdf129a
Catch exceptions arising during the abstraction operation.
paulson
parents:
25243
diff
changeset
|
322 |
excessive_lambdas_fm [] t; |
27184 | 323 |
|
25243 | 324 |
fun is_strange_thm th = |
325 |
case head_of (concl_of th) of |
|
35963 | 326 |
Const (a, _) => (a <> @{const_name Trueprop} andalso |
327 |
a <> @{const_name "=="}) |
|
25243 | 328 |
| _ => false; |
329 |
||
27184 | 330 |
fun bad_for_atp th = |
33306
4138ba02b681
replaced slightly odd Thm.is_internal by Facts.is_concealed -- as provided by the name space;
wenzelm
parents:
33222
diff
changeset
|
331 |
too_complex (prop_of th) |
35568
8fbbfc39508f
renamed type_has_empty_sort to type_has_topsort -- {} is the full universal sort;
wenzelm
parents:
33832
diff
changeset
|
332 |
orelse exists_type type_has_topsort (prop_of th) |
25761 | 333 |
orelse is_strange_thm th; |
25243 | 334 |
|
35963 | 335 |
(* FIXME: put other record thms here, or declare as "no_atp" *) |
25007 | 336 |
val multi_base_blacklist = |
35963 | 337 |
["defs", "select_defs", "update_defs", "induct", "inducts", "split", "splits", |
338 |
"split_asm", "cases", "ext_cases"]; |
|
25007 | 339 |
|
21071 | 340 |
(*Keep the full complexity of the original name*) |
30364
577edc39b501
moved basic algebra of long names from structure NameSpace to Long_Name;
wenzelm
parents:
30291
diff
changeset
|
341 |
fun flatten_name s = space_implode "_X" (Long_Name.explode s); |
21071 | 342 |
|
22731
abfdccaed085
trying to make single-step proofs work better, especially if they contain
paulson
parents:
22724
diff
changeset
|
343 |
fun fake_name th = |
27865
27a8ad9612a3
moved basic thm operations from structure PureThy to Thm (cf. more_thm.ML);
wenzelm
parents:
27809
diff
changeset
|
344 |
if Thm.has_name_hint th then flatten_name (Thm.get_name_hint th) |
22731
abfdccaed085
trying to make single-step proofs work better, especially if they contain
paulson
parents:
22724
diff
changeset
|
345 |
else gensym "unknown_thm_"; |
abfdccaed085
trying to make single-step proofs work better, especially if they contain
paulson
parents:
22724
diff
changeset
|
346 |
|
27184 | 347 |
(*Skolemize a named theorem, with Skolem functions as additional premises.*) |
348 |
fun skolem_thm (s, th) = |
|
30364
577edc39b501
moved basic algebra of long names from structure NameSpace to Long_Name;
wenzelm
parents:
30291
diff
changeset
|
349 |
if member (op =) multi_base_blacklist (Long_Name.base_name s) orelse bad_for_atp th then [] |
27184 | 350 |
else |
351 |
let |
|
352 |
val ctxt0 = Variable.thm_context th |
|
353 |
val (nnfth, ctxt1) = to_nnf th ctxt0 |
|
354 |
val (cnfs, ctxt2) = Meson.make_cnf (assume_skolem_of_def s nnfth) nnfth ctxt1 |
|
355 |
in cnfs |> map combinators |> Variable.export ctxt2 ctxt0 |> Meson.finish_cnf end |
|
356 |
handle THM _ => []; |
|
357 |
||
24742
73b8b42a36b6
removal of some "ref"s from res_axioms.ML; a side-effect is that the ordering
paulson
parents:
24669
diff
changeset
|
358 |
(*The cache prevents repeated clausification of a theorem, and also repeated declaration of |
73b8b42a36b6
removal of some "ref"s from res_axioms.ML; a side-effect is that the ordering
paulson
parents:
24669
diff
changeset
|
359 |
Skolem functions.*) |
33522 | 360 |
structure ThmCache = Theory_Data |
22846 | 361 |
( |
28544
26743a1591f5
improved performance of skolem cache, due to parallel map;
wenzelm
parents:
28262
diff
changeset
|
362 |
type T = thm list Thmtab.table * unit Symtab.table; |
26743a1591f5
improved performance of skolem cache, due to parallel map;
wenzelm
parents:
28262
diff
changeset
|
363 |
val empty = (Thmtab.empty, Symtab.empty); |
26618 | 364 |
val extend = I; |
33522 | 365 |
fun merge ((cache1, seen1), (cache2, seen2)) : T = |
27184 | 366 |
(Thmtab.merge (K true) (cache1, cache2), Symtab.merge (K true) (seen1, seen2)); |
22846 | 367 |
); |
22516 | 368 |
|
27184 | 369 |
val lookup_cache = Thmtab.lookup o #1 o ThmCache.get; |
370 |
val already_seen = Symtab.defined o #2 o ThmCache.get; |
|
20461
d689ad772b2c
skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents:
20457
diff
changeset
|
371 |
|
27184 | 372 |
val update_cache = ThmCache.map o apfst o Thmtab.update; |
373 |
fun mark_seen name = ThmCache.map (apsnd (Symtab.update (name, ()))); |
|
25007 | 374 |
|
36228
df47dc6c0e03
got rid of somewhat pointless "pairname" function in Sledgehammer
blanchet
parents:
36106
diff
changeset
|
375 |
(* Convert Isabelle theorems into axiom clauses. *) |
27179
8f29fed3dc9a
ResAxioms.cnf_axiom/cnf_rules_pairs: pass explicit theory context;
wenzelm
parents:
27174
diff
changeset
|
376 |
fun cnf_axiom thy th0 = |
27184 | 377 |
let val th = Thm.transfer thy th0 in |
378 |
case lookup_cache thy th of |
|
379 |
NONE => map Thm.close_derivation (skolem_thm (fake_name th, th)) |
|
380 |
| SOME cls => cls |
|
22516 | 381 |
end; |
15347 | 382 |
|
18141
89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18009
diff
changeset
|
383 |
|
22471 | 384 |
(**** Translate a set of theorems into CNF ****) |
15347 | 385 |
|
19894 | 386 |
fun pair_name_cls k (n, []) = [] |
387 |
| pair_name_cls k (n, cls::clss) = (cls, (n,k)) :: pair_name_cls (k+1) (n, clss) |
|
20461
d689ad772b2c
skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents:
20457
diff
changeset
|
388 |
|
27179
8f29fed3dc9a
ResAxioms.cnf_axiom/cnf_rules_pairs: pass explicit theory context;
wenzelm
parents:
27174
diff
changeset
|
389 |
fun cnf_rules_pairs_aux _ pairs [] = pairs |
8f29fed3dc9a
ResAxioms.cnf_axiom/cnf_rules_pairs: pass explicit theory context;
wenzelm
parents:
27174
diff
changeset
|
390 |
| cnf_rules_pairs_aux thy pairs ((name,th)::ths) = |
8f29fed3dc9a
ResAxioms.cnf_axiom/cnf_rules_pairs: pass explicit theory context;
wenzelm
parents:
27174
diff
changeset
|
391 |
let val pairs' = (pair_name_cls 0 (name, cnf_axiom thy th)) @ pairs |
35826 | 392 |
handle THM _ => pairs | |
35865 | 393 |
CLAUSE _ => pairs |
27179
8f29fed3dc9a
ResAxioms.cnf_axiom/cnf_rules_pairs: pass explicit theory context;
wenzelm
parents:
27174
diff
changeset
|
394 |
in cnf_rules_pairs_aux thy pairs' ths end; |
20461
d689ad772b2c
skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents:
20457
diff
changeset
|
395 |
|
21290
33b6bb5d6ab8
Improvement to classrel clauses: now outputs the minimum needed.
paulson
parents:
21254
diff
changeset
|
396 |
(*The combination of rev and tail recursion preserves the original order*) |
27179
8f29fed3dc9a
ResAxioms.cnf_axiom/cnf_rules_pairs: pass explicit theory context;
wenzelm
parents:
27174
diff
changeset
|
397 |
fun cnf_rules_pairs thy l = cnf_rules_pairs_aux thy [] (rev l); |
19353 | 398 |
|
19196
62ee8c10d796
Added functions to retrieve local and global atpset rules.
mengj
parents:
19175
diff
changeset
|
399 |
|
35865 | 400 |
(**** Convert all facts of the theory into FOL or HOL clauses ****) |
15347 | 401 |
|
28544
26743a1591f5
improved performance of skolem cache, due to parallel map;
wenzelm
parents:
28262
diff
changeset
|
402 |
local |
26743a1591f5
improved performance of skolem cache, due to parallel map;
wenzelm
parents:
28262
diff
changeset
|
403 |
|
26743a1591f5
improved performance of skolem cache, due to parallel map;
wenzelm
parents:
28262
diff
changeset
|
404 |
fun skolem_def (name, th) thy = |
26743a1591f5
improved performance of skolem cache, due to parallel map;
wenzelm
parents:
28262
diff
changeset
|
405 |
let val ctxt0 = Variable.thm_context th in |
26743a1591f5
improved performance of skolem cache, due to parallel map;
wenzelm
parents:
28262
diff
changeset
|
406 |
(case try (to_nnf th) ctxt0 of |
26743a1591f5
improved performance of skolem cache, due to parallel map;
wenzelm
parents:
28262
diff
changeset
|
407 |
NONE => (NONE, thy) |
26743a1591f5
improved performance of skolem cache, due to parallel map;
wenzelm
parents:
28262
diff
changeset
|
408 |
| SOME (nnfth, ctxt1) => |
26743a1591f5
improved performance of skolem cache, due to parallel map;
wenzelm
parents:
28262
diff
changeset
|
409 |
let val (defs, thy') = declare_skofuns (flatten_name name) nnfth thy |
26743a1591f5
improved performance of skolem cache, due to parallel map;
wenzelm
parents:
28262
diff
changeset
|
410 |
in (SOME (th, ctxt0, ctxt1, nnfth, defs), thy') end) |
26743a1591f5
improved performance of skolem cache, due to parallel map;
wenzelm
parents:
28262
diff
changeset
|
411 |
end; |
24742
73b8b42a36b6
removal of some "ref"s from res_axioms.ML; a side-effect is that the ordering
paulson
parents:
24669
diff
changeset
|
412 |
|
28544
26743a1591f5
improved performance of skolem cache, due to parallel map;
wenzelm
parents:
28262
diff
changeset
|
413 |
fun skolem_cnfs (th, ctxt0, ctxt1, nnfth, defs) = |
26743a1591f5
improved performance of skolem cache, due to parallel map;
wenzelm
parents:
28262
diff
changeset
|
414 |
let |
26743a1591f5
improved performance of skolem cache, due to parallel map;
wenzelm
parents:
28262
diff
changeset
|
415 |
val (cnfs, ctxt2) = Meson.make_cnf (map skolem_of_def defs) nnfth ctxt1; |
26743a1591f5
improved performance of skolem cache, due to parallel map;
wenzelm
parents:
28262
diff
changeset
|
416 |
val cnfs' = cnfs |
26743a1591f5
improved performance of skolem cache, due to parallel map;
wenzelm
parents:
28262
diff
changeset
|
417 |
|> map combinators |
26743a1591f5
improved performance of skolem cache, due to parallel map;
wenzelm
parents:
28262
diff
changeset
|
418 |
|> Variable.export ctxt2 ctxt0 |
26743a1591f5
improved performance of skolem cache, due to parallel map;
wenzelm
parents:
28262
diff
changeset
|
419 |
|> Meson.finish_cnf |
26743a1591f5
improved performance of skolem cache, due to parallel map;
wenzelm
parents:
28262
diff
changeset
|
420 |
|> map Thm.close_derivation; |
26743a1591f5
improved performance of skolem cache, due to parallel map;
wenzelm
parents:
28262
diff
changeset
|
421 |
in (th, cnfs') end; |
26743a1591f5
improved performance of skolem cache, due to parallel map;
wenzelm
parents:
28262
diff
changeset
|
422 |
|
26743a1591f5
improved performance of skolem cache, due to parallel map;
wenzelm
parents:
28262
diff
changeset
|
423 |
in |
24742
73b8b42a36b6
removal of some "ref"s from res_axioms.ML; a side-effect is that the ordering
paulson
parents:
24669
diff
changeset
|
424 |
|
27184 | 425 |
fun saturate_skolem_cache thy = |
28544
26743a1591f5
improved performance of skolem cache, due to parallel map;
wenzelm
parents:
28262
diff
changeset
|
426 |
let |
33306
4138ba02b681
replaced slightly odd Thm.is_internal by Facts.is_concealed -- as provided by the name space;
wenzelm
parents:
33222
diff
changeset
|
427 |
val facts = PureThy.facts_of thy; |
4138ba02b681
replaced slightly odd Thm.is_internal by Facts.is_concealed -- as provided by the name space;
wenzelm
parents:
33222
diff
changeset
|
428 |
val new_facts = (facts, []) |-> Facts.fold_static (fn (name, ths) => |
4138ba02b681
replaced slightly odd Thm.is_internal by Facts.is_concealed -- as provided by the name space;
wenzelm
parents:
33222
diff
changeset
|
429 |
if Facts.is_concealed facts name orelse already_seen thy name then I |
4138ba02b681
replaced slightly odd Thm.is_internal by Facts.is_concealed -- as provided by the name space;
wenzelm
parents:
33222
diff
changeset
|
430 |
else cons (name, ths)); |
28544
26743a1591f5
improved performance of skolem cache, due to parallel map;
wenzelm
parents:
28262
diff
changeset
|
431 |
val new_thms = (new_facts, []) |-> fold (fn (name, ths) => |
30364
577edc39b501
moved basic algebra of long names from structure NameSpace to Long_Name;
wenzelm
parents:
30291
diff
changeset
|
432 |
if member (op =) multi_base_blacklist (Long_Name.base_name name) then I |
28544
26743a1591f5
improved performance of skolem cache, due to parallel map;
wenzelm
parents:
28262
diff
changeset
|
433 |
else fold_index (fn (i, th) => |
26743a1591f5
improved performance of skolem cache, due to parallel map;
wenzelm
parents:
28262
diff
changeset
|
434 |
if bad_for_atp th orelse is_some (lookup_cache thy th) then I |
26743a1591f5
improved performance of skolem cache, due to parallel map;
wenzelm
parents:
28262
diff
changeset
|
435 |
else cons (name ^ "_" ^ string_of_int (i + 1), Thm.transfer thy th)) ths); |
26743a1591f5
improved performance of skolem cache, due to parallel map;
wenzelm
parents:
28262
diff
changeset
|
436 |
in |
26743a1591f5
improved performance of skolem cache, due to parallel map;
wenzelm
parents:
28262
diff
changeset
|
437 |
if null new_facts then NONE |
26743a1591f5
improved performance of skolem cache, due to parallel map;
wenzelm
parents:
28262
diff
changeset
|
438 |
else |
26743a1591f5
improved performance of skolem cache, due to parallel map;
wenzelm
parents:
28262
diff
changeset
|
439 |
let |
26743a1591f5
improved performance of skolem cache, due to parallel map;
wenzelm
parents:
28262
diff
changeset
|
440 |
val (defs, thy') = thy |
26743a1591f5
improved performance of skolem cache, due to parallel map;
wenzelm
parents:
28262
diff
changeset
|
441 |
|> fold (mark_seen o #1) new_facts |
26743a1591f5
improved performance of skolem cache, due to parallel map;
wenzelm
parents:
28262
diff
changeset
|
442 |
|> fold_map skolem_def (sort_distinct (Thm.thm_ord o pairself snd) new_thms) |
26743a1591f5
improved performance of skolem cache, due to parallel map;
wenzelm
parents:
28262
diff
changeset
|
443 |
|>> map_filter I; |
29368 | 444 |
val cache_entries = Par_List.map skolem_cnfs defs; |
28544
26743a1591f5
improved performance of skolem cache, due to parallel map;
wenzelm
parents:
28262
diff
changeset
|
445 |
in SOME (fold update_cache cache_entries thy') end |
26743a1591f5
improved performance of skolem cache, due to parallel map;
wenzelm
parents:
28262
diff
changeset
|
446 |
end; |
27184 | 447 |
|
28544
26743a1591f5
improved performance of skolem cache, due to parallel map;
wenzelm
parents:
28262
diff
changeset
|
448 |
end; |
24854 | 449 |
|
32740 | 450 |
val suppress_endtheory = Unsynchronized.ref false; |
27184 | 451 |
|
452 |
fun clause_cache_endtheory thy = |
|
453 |
if ! suppress_endtheory then NONE |
|
454 |
else saturate_skolem_cache thy; |
|
455 |
||
20457
85414caac94a
refinements to conversion into clause form, esp for the HO case
paulson
parents:
20445
diff
changeset
|
456 |
|
22516 | 457 |
(*The cache can be kept smaller by inspecting the prop of each thm. Can ignore all that are |
458 |
lambda_free, but then the individual theory caches become much bigger.*) |
|
21071 | 459 |
|
27179
8f29fed3dc9a
ResAxioms.cnf_axiom/cnf_rules_pairs: pass explicit theory context;
wenzelm
parents:
27174
diff
changeset
|
460 |
|
36398
de8522a5cbae
make "neg_clausify" return a list of lists of clauses, so that it's possible to see which clause comes from which theorem
blanchet
parents:
36394
diff
changeset
|
461 |
fun strip_subgoal goal i = |
de8522a5cbae
make "neg_clausify" return a list of lists of clauses, so that it's possible to see which clause comes from which theorem
blanchet
parents:
36394
diff
changeset
|
462 |
let |
de8522a5cbae
make "neg_clausify" return a list of lists of clauses, so that it's possible to see which clause comes from which theorem
blanchet
parents:
36394
diff
changeset
|
463 |
val (t, frees) = Logic.goal_params (prop_of goal) i |
de8522a5cbae
make "neg_clausify" return a list of lists of clauses, so that it's possible to see which clause comes from which theorem
blanchet
parents:
36394
diff
changeset
|
464 |
val hyp_ts = t |> Logic.strip_assums_hyp |> map (curry subst_bounds frees) |
de8522a5cbae
make "neg_clausify" return a list of lists of clauses, so that it's possible to see which clause comes from which theorem
blanchet
parents:
36394
diff
changeset
|
465 |
val concl_t = t |> Logic.strip_assums_concl |> curry subst_bounds frees |
de8522a5cbae
make "neg_clausify" return a list of lists of clauses, so that it's possible to see which clause comes from which theorem
blanchet
parents:
36394
diff
changeset
|
466 |
in (rev frees, hyp_ts, concl_t) end |
de8522a5cbae
make "neg_clausify" return a list of lists of clauses, so that it's possible to see which clause comes from which theorem
blanchet
parents:
36394
diff
changeset
|
467 |
|
21999
0cf192e489e2
improvements to proof reconstruction. Some files loaded in a different order
paulson
parents:
21900
diff
changeset
|
468 |
(*** Converting a subgoal into negated conjecture clauses. ***) |
0cf192e489e2
improvements to proof reconstruction. Some files loaded in a different order
paulson
parents:
21900
diff
changeset
|
469 |
|
32262 | 470 |
fun neg_skolemize_tac ctxt = |
35625 | 471 |
EVERY' [rtac ccontr, Object_Logic.atomize_prems_tac, Meson.skolemize_tac ctxt]; |
22471 | 472 |
|
36398
de8522a5cbae
make "neg_clausify" return a list of lists of clauses, so that it's possible to see which clause comes from which theorem
blanchet
parents:
36394
diff
changeset
|
473 |
fun neg_skolemize_tac ctxt = |
de8522a5cbae
make "neg_clausify" return a list of lists of clauses, so that it's possible to see which clause comes from which theorem
blanchet
parents:
36394
diff
changeset
|
474 |
EVERY' [rtac ccontr, Object_Logic.atomize_prems_tac, Meson.skolemize_tac ctxt]; |
de8522a5cbae
make "neg_clausify" return a list of lists of clauses, so that it's possible to see which clause comes from which theorem
blanchet
parents:
36394
diff
changeset
|
475 |
|
35869
cac366550624
start work on direct proof reconstruction for Sledgehammer
blanchet
parents:
35865
diff
changeset
|
476 |
val neg_clausify = |
36398
de8522a5cbae
make "neg_clausify" return a list of lists of clauses, so that it's possible to see which clause comes from which theorem
blanchet
parents:
36394
diff
changeset
|
477 |
single #> Meson.make_clauses_unsorted #> map combinators #> Meson.finish_cnf |
21999
0cf192e489e2
improvements to proof reconstruction. Some files loaded in a different order
paulson
parents:
21900
diff
changeset
|
478 |
|
32257
bad5a99c16d8
neg_conjecture_clauses, neg_clausify_tac: proper context, eliminated METAHYPS;
wenzelm
parents:
32231
diff
changeset
|
479 |
fun neg_conjecture_clauses ctxt st0 n = |
bad5a99c16d8
neg_conjecture_clauses, neg_clausify_tac: proper context, eliminated METAHYPS;
wenzelm
parents:
32231
diff
changeset
|
480 |
let |
32262 | 481 |
val st = Seq.hd (neg_skolemize_tac ctxt n st0) |
32257
bad5a99c16d8
neg_conjecture_clauses, neg_clausify_tac: proper context, eliminated METAHYPS;
wenzelm
parents:
32231
diff
changeset
|
482 |
val ({params, prems, ...}, _) = Subgoal.focus (Variable.set_body false ctxt) n st |
36398
de8522a5cbae
make "neg_clausify" return a list of lists of clauses, so that it's possible to see which clause comes from which theorem
blanchet
parents:
36394
diff
changeset
|
483 |
in |
de8522a5cbae
make "neg_clausify" return a list of lists of clauses, so that it's possible to see which clause comes from which theorem
blanchet
parents:
36394
diff
changeset
|
484 |
(map neg_clausify prems, map (Term.dest_Free o Thm.term_of o #2) params) |
de8522a5cbae
make "neg_clausify" return a list of lists of clauses, so that it's possible to see which clause comes from which theorem
blanchet
parents:
36394
diff
changeset
|
485 |
end |
21999
0cf192e489e2
improvements to proof reconstruction. Some files loaded in a different order
paulson
parents:
21900
diff
changeset
|
486 |
|
24669 | 487 |
(*Conversion of a subgoal to conjecture clauses. Each clause has |
21999
0cf192e489e2
improvements to proof reconstruction. Some files loaded in a different order
paulson
parents:
21900
diff
changeset
|
488 |
leading !!-bound universal variables, to express generality. *) |
32257
bad5a99c16d8
neg_conjecture_clauses, neg_clausify_tac: proper context, eliminated METAHYPS;
wenzelm
parents:
32231
diff
changeset
|
489 |
fun neg_clausify_tac ctxt = |
32262 | 490 |
neg_skolemize_tac ctxt THEN' |
32257
bad5a99c16d8
neg_conjecture_clauses, neg_clausify_tac: proper context, eliminated METAHYPS;
wenzelm
parents:
32231
diff
changeset
|
491 |
SUBGOAL (fn (prop, i) => |
bad5a99c16d8
neg_conjecture_clauses, neg_clausify_tac: proper context, eliminated METAHYPS;
wenzelm
parents:
32231
diff
changeset
|
492 |
let val ts = Logic.strip_assums_hyp prop in |
bad5a99c16d8
neg_conjecture_clauses, neg_clausify_tac: proper context, eliminated METAHYPS;
wenzelm
parents:
32231
diff
changeset
|
493 |
EVERY' |
32283 | 494 |
[Subgoal.FOCUS |
32257
bad5a99c16d8
neg_conjecture_clauses, neg_clausify_tac: proper context, eliminated METAHYPS;
wenzelm
parents:
32231
diff
changeset
|
495 |
(fn {prems, ...} => |
bad5a99c16d8
neg_conjecture_clauses, neg_clausify_tac: proper context, eliminated METAHYPS;
wenzelm
parents:
32231
diff
changeset
|
496 |
(Method.insert_tac |
36398
de8522a5cbae
make "neg_clausify" return a list of lists of clauses, so that it's possible to see which clause comes from which theorem
blanchet
parents:
36394
diff
changeset
|
497 |
(map forall_intr_vars (maps neg_clausify prems)) i)) ctxt, |
32257
bad5a99c16d8
neg_conjecture_clauses, neg_clausify_tac: proper context, eliminated METAHYPS;
wenzelm
parents:
32231
diff
changeset
|
498 |
REPEAT_DETERM_N (length ts) o etac thin_rl] i |
21999
0cf192e489e2
improvements to proof reconstruction. Some files loaded in a different order
paulson
parents:
21900
diff
changeset
|
499 |
end); |
0cf192e489e2
improvements to proof reconstruction. Some files loaded in a different order
paulson
parents:
21900
diff
changeset
|
500 |
|
27184 | 501 |
|
502 |
(** setup **) |
|
503 |
||
504 |
val setup = |
|
505 |
perhaps saturate_skolem_cache #> |
|
506 |
Theory.at_end clause_cache_endtheory; |
|
18510
0a6c24f549c3
the "skolem" attribute and better initialization of the clause database
paulson
parents:
18404
diff
changeset
|
507 |
|
20461
d689ad772b2c
skolem_cache_thm: Drule.close_derivation on clauses preserves some space;
wenzelm
parents:
20457
diff
changeset
|
508 |
end; |