author | mengj |
Fri, 28 Oct 2005 02:25:57 +0200 | |
changeset 18000 | ac059afd6b86 |
parent 17959 | 8db36a108213 |
child 18009 | df077e122064 |
permissions | -rw-r--r-- |
15347 | 1 |
(* Author: Jia Meng, Cambridge University Computer Laboratory |
2 |
ID: $Id$ |
|
3 |
Copyright 2004 University of Cambridge |
|
4 |
||
5 |
Transformation of axiom rules (elim/intro/etc) into CNF forms. |
|
6 |
*) |
|
7 |
||
15997 | 8 |
signature RES_AXIOMS = |
9 |
sig |
|
10 |
exception ELIMR2FOL of string |
|
17404
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17279
diff
changeset
|
11 |
val tagging_enabled : bool |
15997 | 12 |
val elimRule_tac : thm -> Tactical.tactic |
16012 | 13 |
val elimR2Fol : thm -> term |
15997 | 14 |
val transform_elim : thm -> thm |
16039
dfe264950511
Moved some of the clausify functions from ATP/res_clasimpset.ML to res_axioms.ML.
quigley
parents:
16012
diff
changeset
|
15 |
val clausify_axiom_pairs : (string*thm) -> (ResClause.clause*thm) list |
18000
ac059afd6b86
Added several new functions that convert HOL Isabelle rules to FOL axiom clauses. The original functions that convert FOL rules to clauses stay with the same names; the new functions have "H" at the end of their names.
mengj
parents:
17959
diff
changeset
|
16 |
val clausify_axiom_pairsH : (string*thm) -> (ResHolClause.clause*thm) list |
15997 | 17 |
val cnf_axiom : (string * thm) -> thm list |
18000
ac059afd6b86
Added several new functions that convert HOL Isabelle rules to FOL axiom clauses. The original functions that convert FOL rules to clauses stay with the same names; the new functions have "H" at the end of their names.
mengj
parents:
17959
diff
changeset
|
18 |
val cnf_axiomH : (string * thm) -> thm list |
15997 | 19 |
val meta_cnf_axiom : thm -> thm list |
18000
ac059afd6b86
Added several new functions that convert HOL Isabelle rules to FOL axiom clauses. The original functions that convert FOL rules to clauses stay with the same names; the new functions have "H" at the end of their names.
mengj
parents:
17959
diff
changeset
|
20 |
val meta_cnf_axiomH : thm -> thm list |
16012 | 21 |
val rm_Eps : (term * term) list -> thm list -> term list |
15997 | 22 |
val claset_rules_of_thy : theory -> (string * thm) list |
23 |
val simpset_rules_of_thy : theory -> (string * thm) list |
|
17484
f6a225f97f0a
simplification of the Isabelle-ATP code; hooks for batch generation of problems
paulson
parents:
17412
diff
changeset
|
24 |
val claset_rules_of_ctxt: Proof.context -> (string * thm) list |
f6a225f97f0a
simplification of the Isabelle-ATP code; hooks for batch generation of problems
paulson
parents:
17412
diff
changeset
|
25 |
val simpset_rules_of_ctxt : Proof.context -> (string * thm) list |
17829 | 26 |
val clausify_rules_pairs : (string*thm) list -> (ResClause.clause*thm) list list |
18000
ac059afd6b86
Added several new functions that convert HOL Isabelle rules to FOL axiom clauses. The original functions that convert FOL rules to clauses stay with the same names; the new functions have "H" at the end of their names.
mengj
parents:
17959
diff
changeset
|
27 |
val clausify_rules_pairsH : (string*thm) list -> (ResHolClause.clause*thm) list list |
16563 | 28 |
val clause_setup : (theory -> theory) list |
29 |
val meson_method_setup : (theory -> theory) list |
|
17905
1574533861b1
Added files in order to use external ATPs as oracles and invoke these ATPs by calling Isabelle methods (currently "vampire" and "eprover").
mengj
parents:
17829
diff
changeset
|
30 |
val pairname : thm -> (string * thm) |
18000
ac059afd6b86
Added several new functions that convert HOL Isabelle rules to FOL axiom clauses. The original functions that convert FOL rules to clauses stay with the same names; the new functions have "H" at the end of their names.
mengj
parents:
17959
diff
changeset
|
31 |
val repeat_RS : thm -> thm -> thm |
ac059afd6b86
Added several new functions that convert HOL Isabelle rules to FOL axiom clauses. The original functions that convert FOL rules to clauses stay with the same names; the new functions have "H" at the end of their names.
mengj
parents:
17959
diff
changeset
|
32 |
|
15997 | 33 |
end; |
15347 | 34 |
|
15997 | 35 |
structure ResAxioms : RES_AXIOMS = |
36 |
||
37 |
struct |
|
15347 | 38 |
|
18000
ac059afd6b86
Added several new functions that convert HOL Isabelle rules to FOL axiom clauses. The original functions that convert FOL rules to clauses stay with the same names; the new functions have "H" at the end of their names.
mengj
parents:
17959
diff
changeset
|
39 |
|
17404
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17279
diff
changeset
|
40 |
val tagging_enabled = false (*compile_time option*) |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17279
diff
changeset
|
41 |
|
15997 | 42 |
(**** Transformation of Elimination Rules into First-Order Formulas****) |
15347 | 43 |
|
15390 | 44 |
(* a tactic used to prove an elim-rule. *) |
16009 | 45 |
fun elimRule_tac th = |
46 |
((rtac impI 1) ORELSE (rtac notI 1)) THEN (etac th 1) THEN |
|
16588 | 47 |
REPEAT(fast_tac HOL_cs 1); |
15347 | 48 |
|
49 |
exception ELIMR2FOL of string; |
|
50 |
||
15390 | 51 |
(* functions used to construct a formula *) |
52 |
||
15347 | 53 |
fun make_disjs [x] = x |
15956 | 54 |
| make_disjs (x :: xs) = HOLogic.mk_disj(x, make_disjs xs) |
15347 | 55 |
|
56 |
fun make_conjs [x] = x |
|
15956 | 57 |
| make_conjs (x :: xs) = HOLogic.mk_conj(x, make_conjs xs) |
58 |
||
59 |
fun add_EX tm [] = tm |
|
60 |
| add_EX tm ((x,xtp)::xs) = add_EX (HOLogic.exists_const xtp $ Abs(x,xtp,tm)) xs; |
|
15347 | 61 |
|
62 |
||
63 |
||
15956 | 64 |
fun is_neg (Const("Trueprop",_) $ (Const("Not",_) $ Free(p,_))) (Const("Trueprop",_) $ Free(q,_)) = (p = q) |
15371 | 65 |
| is_neg _ _ = false; |
66 |
||
15347 | 67 |
|
68 |
exception STRIP_CONCL; |
|
69 |
||
70 |
||
15371 | 71 |
fun strip_concl' prems bvs (Const ("==>",_) $ P $ Q) = |
15956 | 72 |
let val P' = HOLogic.dest_Trueprop P |
73 |
val prems' = P'::prems |
|
74 |
in |
|
15371 | 75 |
strip_concl' prems' bvs Q |
15956 | 76 |
end |
15371 | 77 |
| strip_concl' prems bvs P = |
15956 | 78 |
let val P' = HOLogic.Not $ (HOLogic.dest_Trueprop P) |
79 |
in |
|
15371 | 80 |
add_EX (make_conjs (P'::prems)) bvs |
15956 | 81 |
end; |
15371 | 82 |
|
83 |
||
84 |
fun strip_concl prems bvs concl (Const ("all", _) $ Abs (x,xtp,body)) = strip_concl prems ((x,xtp)::bvs) concl body |
|
85 |
| strip_concl prems bvs concl (Const ("==>",_) $ P $ Q) = |
|
86 |
if (is_neg P concl) then (strip_concl' prems bvs Q) |
|
87 |
else |
|
15956 | 88 |
(let val P' = HOLogic.dest_Trueprop P |
15371 | 89 |
val prems' = P'::prems |
90 |
in |
|
91 |
strip_concl prems' bvs concl Q |
|
92 |
end) |
|
93 |
| strip_concl prems bvs concl _ = add_EX (make_conjs prems) bvs; |
|
15347 | 94 |
|
95 |
||
96 |
||
15371 | 97 |
fun trans_elim (main,others,concl) = |
98 |
let val others' = map (strip_concl [] [] concl) others |
|
15347 | 99 |
val disjs = make_disjs others' |
100 |
in |
|
15956 | 101 |
HOLogic.mk_imp (HOLogic.dest_Trueprop main, disjs) |
15347 | 102 |
end; |
103 |
||
104 |
||
15390 | 105 |
(* aux function of elim2Fol, take away predicate variable. *) |
15371 | 106 |
fun elimR2Fol_aux prems concl = |
15347 | 107 |
let val nprems = length prems |
108 |
val main = hd prems |
|
109 |
in |
|
15956 | 110 |
if (nprems = 1) then HOLogic.Not $ (HOLogic.dest_Trueprop main) |
15371 | 111 |
else trans_elim (main, tl prems, concl) |
15347 | 112 |
end; |
113 |
||
15956 | 114 |
|
16012 | 115 |
(* convert an elim rule into an equivalent formula, of type term. *) |
15347 | 116 |
fun elimR2Fol elimR = |
117 |
let val elimR' = Drule.freeze_all elimR |
|
118 |
val (prems,concl) = (prems_of elimR', concl_of elimR') |
|
119 |
in |
|
120 |
case concl of Const("Trueprop",_) $ Free(_,Type("bool",[])) |
|
15956 | 121 |
=> HOLogic.mk_Trueprop (elimR2Fol_aux prems concl) |
122 |
| Free(x,Type("prop",[])) => HOLogic.mk_Trueprop(elimR2Fol_aux prems concl) |
|
15347 | 123 |
| _ => raise ELIMR2FOL("Not an elimination rule!") |
124 |
end; |
|
125 |
||
126 |
||
15390 | 127 |
(* check if a rule is an elim rule *) |
16009 | 128 |
fun is_elimR th = |
129 |
case (concl_of th) of (Const ("Trueprop", _) $ Var (idx,_)) => true |
|
15347 | 130 |
| Var(indx,Type("prop",[])) => true |
131 |
| _ => false; |
|
132 |
||
15997 | 133 |
(* convert an elim-rule into an equivalent theorem that does not have the |
134 |
predicate variable. Leave other theorems unchanged.*) |
|
16009 | 135 |
fun transform_elim th = |
136 |
if is_elimR th then |
|
137 |
let val tm = elimR2Fol th |
|
138 |
val ctm = cterm_of (sign_of_thm th) tm |
|
15997 | 139 |
in |
17959 | 140 |
OldGoals.prove_goalw_cterm [] ctm (fn prems => [elimRule_tac th]) |
15997 | 141 |
end |
16563 | 142 |
else th; |
15997 | 143 |
|
144 |
||
145 |
(**** Transformation of Clasets and Simpsets into First-Order Axioms ****) |
|
146 |
||
15390 | 147 |
(* repeated resolution *) |
15347 | 148 |
fun repeat_RS thm1 thm2 = |
149 |
let val thm1' = thm1 RS thm2 handle THM _ => thm1 |
|
150 |
in |
|
151 |
if eq_thm(thm1,thm1') then thm1' else (repeat_RS thm1' thm2) |
|
152 |
end; |
|
153 |
||
154 |
||
16009 | 155 |
(*Convert a theorem into NNF and also skolemize it. Original version, using |
156 |
Hilbert's epsilon in the resulting clauses.*) |
|
18000
ac059afd6b86
Added several new functions that convert HOL Isabelle rules to FOL axiom clauses. The original functions that convert FOL rules to clauses stay with the same names; the new functions have "H" at the end of their names.
mengj
parents:
17959
diff
changeset
|
157 |
fun skolem_axiom_g mk_nnf th = |
ac059afd6b86
Added several new functions that convert HOL Isabelle rules to FOL axiom clauses. The original functions that convert FOL rules to clauses stay with the same names; the new functions have "H" at the end of their names.
mengj
parents:
17959
diff
changeset
|
158 |
let val th' = (skolemize o mk_nnf o ObjectLogic.atomize_thm o Drule.freeze_all) th |
16588 | 159 |
in repeat_RS th' someI_ex |
160 |
end; |
|
15347 | 161 |
|
162 |
||
18000
ac059afd6b86
Added several new functions that convert HOL Isabelle rules to FOL axiom clauses. The original functions that convert FOL rules to clauses stay with the same names; the new functions have "H" at the end of their names.
mengj
parents:
17959
diff
changeset
|
163 |
val skolem_axiom = skolem_axiom_g make_nnf; |
ac059afd6b86
Added several new functions that convert HOL Isabelle rules to FOL axiom clauses. The original functions that convert FOL rules to clauses stay with the same names; the new functions have "H" at the end of their names.
mengj
parents:
17959
diff
changeset
|
164 |
val skolem_axiomH = skolem_axiom_g make_nnf1; |
ac059afd6b86
Added several new functions that convert HOL Isabelle rules to FOL axiom clauses. The original functions that convert FOL rules to clauses stay with the same names; the new functions have "H" at the end of their names.
mengj
parents:
17959
diff
changeset
|
165 |
|
ac059afd6b86
Added several new functions that convert HOL Isabelle rules to FOL axiom clauses. The original functions that convert FOL rules to clauses stay with the same names; the new functions have "H" at the end of their names.
mengj
parents:
17959
diff
changeset
|
166 |
|
16009 | 167 |
fun cnf_rule th = make_clauses [skolem_axiom (transform_elim th)]; |
15347 | 168 |
|
18000
ac059afd6b86
Added several new functions that convert HOL Isabelle rules to FOL axiom clauses. The original functions that convert FOL rules to clauses stay with the same names; the new functions have "H" at the end of their names.
mengj
parents:
17959
diff
changeset
|
169 |
fun cnf_ruleH th = make_clauses [skolem_axiomH (transform_elim th)]; |
ac059afd6b86
Added several new functions that convert HOL Isabelle rules to FOL axiom clauses. The original functions that convert FOL rules to clauses stay with the same names; the new functions have "H" at the end of their names.
mengj
parents:
17959
diff
changeset
|
170 |
|
16563 | 171 |
(*Transfer a theorem into theory Reconstruction.thy if it is not already |
15359
8bad1f42fec0
new CLAUSIFY attribute for proof reconstruction with lemmas
paulson
parents:
15347
diff
changeset
|
172 |
inside that theory -- because it's needed for Skolemization *) |
8bad1f42fec0
new CLAUSIFY attribute for proof reconstruction with lemmas
paulson
parents:
15347
diff
changeset
|
173 |
|
16563 | 174 |
(*This will refer to the final version of theory Reconstruction.*) |
175 |
val recon_thy_ref = Theory.self_ref (the_context ()); |
|
15359
8bad1f42fec0
new CLAUSIFY attribute for proof reconstruction with lemmas
paulson
parents:
15347
diff
changeset
|
176 |
|
16563 | 177 |
(*If called while Reconstruction is being created, it will transfer to the |
178 |
current version. If called afterward, it will transfer to the final version.*) |
|
16009 | 179 |
fun transfer_to_Reconstruction th = |
16563 | 180 |
transfer (Theory.deref recon_thy_ref) th handle THM _ => th; |
15347 | 181 |
|
15955
87cf2ce8ede8
memoization of ResAxioms.cnf_axiom rather than of Reconstruction.clausify_rule
paulson
parents:
15872
diff
changeset
|
182 |
fun is_taut th = |
87cf2ce8ede8
memoization of ResAxioms.cnf_axiom rather than of Reconstruction.clausify_rule
paulson
parents:
15872
diff
changeset
|
183 |
case (prop_of th) of |
87cf2ce8ede8
memoization of ResAxioms.cnf_axiom rather than of Reconstruction.clausify_rule
paulson
parents:
15872
diff
changeset
|
184 |
(Const ("Trueprop", _) $ Const ("True", _)) => true |
87cf2ce8ede8
memoization of ResAxioms.cnf_axiom rather than of Reconstruction.clausify_rule
paulson
parents:
15872
diff
changeset
|
185 |
| _ => false; |
87cf2ce8ede8
memoization of ResAxioms.cnf_axiom rather than of Reconstruction.clausify_rule
paulson
parents:
15872
diff
changeset
|
186 |
|
87cf2ce8ede8
memoization of ResAxioms.cnf_axiom rather than of Reconstruction.clausify_rule
paulson
parents:
15872
diff
changeset
|
187 |
(* remove tautologous clauses *) |
87cf2ce8ede8
memoization of ResAxioms.cnf_axiom rather than of Reconstruction.clausify_rule
paulson
parents:
15872
diff
changeset
|
188 |
val rm_redundant_cls = List.filter (not o is_taut); |
15347 | 189 |
|
17829 | 190 |
(* transform an Isabelle theorem into CNF *) |
18000
ac059afd6b86
Added several new functions that convert HOL Isabelle rules to FOL axiom clauses. The original functions that convert FOL rules to clauses stay with the same names; the new functions have "H" at the end of their names.
mengj
parents:
17959
diff
changeset
|
191 |
fun cnf_axiom_aux_g cnf_rule th = |
16173 | 192 |
map zero_var_indexes |
16009 | 193 |
(rm_redundant_cls (cnf_rule (transfer_to_Reconstruction th))); |
18000
ac059afd6b86
Added several new functions that convert HOL Isabelle rules to FOL axiom clauses. The original functions that convert FOL rules to clauses stay with the same names; the new functions have "H" at the end of their names.
mengj
parents:
17959
diff
changeset
|
194 |
|
ac059afd6b86
Added several new functions that convert HOL Isabelle rules to FOL axiom clauses. The original functions that convert FOL rules to clauses stay with the same names; the new functions have "H" at the end of their names.
mengj
parents:
17959
diff
changeset
|
195 |
val cnf_axiom_aux = cnf_axiom_aux_g cnf_rule; |
ac059afd6b86
Added several new functions that convert HOL Isabelle rules to FOL axiom clauses. The original functions that convert FOL rules to clauses stay with the same names; the new functions have "H" at the end of their names.
mengj
parents:
17959
diff
changeset
|
196 |
val cnf_axiom_auxH = cnf_axiom_aux_g cnf_ruleH; |
15997 | 197 |
|
198 |
||
16009 | 199 |
(**** SKOLEMIZATION BY INFERENCE (lcp) ****) |
200 |
||
201 |
(*Traverse a term, accumulating Skolem function definitions.*) |
|
202 |
fun declare_skofuns s t thy = |
|
17404
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17279
diff
changeset
|
203 |
let fun dec_sko (Const ("Ex",_) $ (xtp as Abs(_,T,p))) (n, (thy, axs)) = |
16009 | 204 |
(*Existential: declare a Skolem function, then insert into body and continue*) |
205 |
let val cname = s ^ "_" ^ Int.toString n |
|
16012 | 206 |
val args = term_frees xtp (*get the formal parameter list*) |
16009 | 207 |
val Ts = map type_of args |
208 |
val cT = Ts ---> T |
|
16125 | 209 |
val c = Const (Sign.full_name (Theory.sign_of thy) cname, cT) |
16009 | 210 |
val rhs = list_abs_free (map dest_Free args, HOLogic.choice_const T $ xtp) |
16012 | 211 |
(*Forms a lambda-abstraction over the formal parameters*) |
16009 | 212 |
val def = equals cT $ c $ rhs |
213 |
val thy' = Theory.add_consts_i [(cname, cT, NoSyn)] thy |
|
16012 | 214 |
(*Theory is augmented with the constant, then its def*) |
17404
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17279
diff
changeset
|
215 |
val cdef = cname ^ "_def" |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17279
diff
changeset
|
216 |
val thy'' = Theory.add_defs_i false [(cdef, def)] thy' |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17279
diff
changeset
|
217 |
in dec_sko (subst_bound (list_comb(c,args), p)) |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17279
diff
changeset
|
218 |
(n+1, (thy'', get_axiom thy'' cdef :: axs)) |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17279
diff
changeset
|
219 |
end |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17279
diff
changeset
|
220 |
| dec_sko (Const ("All",_) $ (xtp as Abs(a,T,p))) (n, thx) = |
16012 | 221 |
(*Universal quant: insert a free variable into body and continue*) |
16009 | 222 |
let val fname = variant (add_term_names (p,[])) a |
17404
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17279
diff
changeset
|
223 |
in dec_sko (subst_bound (Free(fname,T), p)) (n, thx) end |
16009 | 224 |
| dec_sko (Const ("op &", _) $ p $ q) nthy = |
225 |
dec_sko q (dec_sko p nthy) |
|
226 |
| dec_sko (Const ("op |", _) $ p $ q) nthy = |
|
227 |
dec_sko q (dec_sko p nthy) |
|
17404
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17279
diff
changeset
|
228 |
| dec_sko (Const ("HOL.tag", _) $ p) nthy = |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17279
diff
changeset
|
229 |
dec_sko p nthy |
16009 | 230 |
| dec_sko (Const ("Trueprop", _) $ p) nthy = |
231 |
dec_sko p nthy |
|
17404
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17279
diff
changeset
|
232 |
| dec_sko t nthx = nthx (*Do nothing otherwise*) |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17279
diff
changeset
|
233 |
in #2 (dec_sko t (1, (thy,[]))) end; |
16009 | 234 |
|
235 |
(*cterms are used throughout for efficiency*) |
|
236 |
val cTrueprop = Thm.cterm_of (Theory.sign_of HOL.thy) HOLogic.Trueprop; |
|
237 |
||
238 |
(*cterm version of mk_cTrueprop*) |
|
239 |
fun c_mkTrueprop A = Thm.capply cTrueprop A; |
|
240 |
||
241 |
(*Given an abstraction over n variables, replace the bound variables by free |
|
242 |
ones. Return the body, along with the list of free variables.*) |
|
243 |
fun c_variant_abs_multi (ct0, vars) = |
|
244 |
let val (cv,ct) = Thm.dest_abs NONE ct0 |
|
245 |
in c_variant_abs_multi (ct, cv::vars) end |
|
246 |
handle CTERM _ => (ct0, rev vars); |
|
247 |
||
248 |
(*Given the definition of a Skolem function, return a theorem to replace |
|
249 |
an existential formula by a use of that function.*) |
|
16588 | 250 |
fun skolem_of_def def = |
16009 | 251 |
let val (c,rhs) = Drule.dest_equals (cprop_of (Drule.freeze_all def)) |
252 |
val (ch, frees) = c_variant_abs_multi (rhs, []) |
|
253 |
val (chil,cabs) = Thm.dest_comb ch |
|
16588 | 254 |
val {sign,t, ...} = rep_cterm chil |
16009 | 255 |
val (Const ("Hilbert_Choice.Eps", Type("fun",[_,T]))) = t |
256 |
val cex = Thm.cterm_of sign (HOLogic.exists_const T) |
|
257 |
val ex_tm = c_mkTrueprop (Thm.capply cex cabs) |
|
258 |
and conc = c_mkTrueprop (Drule.beta_conv cabs (Drule.list_comb(c,frees))); |
|
17959 | 259 |
in OldGoals.prove_goalw_cterm [def] (Drule.mk_implies (ex_tm, conc)) |
16009 | 260 |
(fn [prem] => [ rtac (prem RS someI_ex) 1 ]) |
261 |
end; |
|
262 |
||
263 |
||
264 |
(*Converts an Isabelle theorem (intro, elim or simp format) into nnf.*) |
|
265 |
fun to_nnf thy th = |
|
16588 | 266 |
th |> Thm.transfer thy |
267 |
|> transform_elim |> Drule.freeze_all |
|
268 |
|> ObjectLogic.atomize_thm |> make_nnf; |
|
16009 | 269 |
|
270 |
(*The cache prevents repeated clausification of a theorem, |
|
16800 | 271 |
and also repeated declaration of Skolem functions*) (* FIXME better use Termtab!? *) |
15955
87cf2ce8ede8
memoization of ResAxioms.cnf_axiom rather than of Reconstruction.clausify_rule
paulson
parents:
15872
diff
changeset
|
272 |
val clause_cache = ref (Symtab.empty : (thm * thm list) Symtab.table) |
87cf2ce8ede8
memoization of ResAxioms.cnf_axiom rather than of Reconstruction.clausify_rule
paulson
parents:
15872
diff
changeset
|
273 |
|
16009 | 274 |
(*Declare Skolem functions for a theorem, supplied in nnf and with its name*) |
275 |
fun skolem thy (name,th) = |
|
16588 | 276 |
let val cname = (case name of "" => gensym "sko" | s => Sign.base_name s) |
17404
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17279
diff
changeset
|
277 |
val (thy',axs) = declare_skofuns cname (#prop (rep_thm th)) thy |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17279
diff
changeset
|
278 |
in (map skolem_of_def axs, thy') end; |
16009 | 279 |
|
280 |
(*Populate the clause cache using the supplied theorems*) |
|
281 |
fun skolemlist [] thy = thy |
|
282 |
| skolemlist ((name,th)::nths) thy = |
|
17412 | 283 |
(case Symtab.lookup (!clause_cache) name of |
16009 | 284 |
NONE => |
16588 | 285 |
let val (nnfth,ok) = (to_nnf thy th, true) |
286 |
handle THM _ => (asm_rl, false) |
|
287 |
in |
|
288 |
if ok then |
|
289 |
let val (skoths,thy') = skolem thy (name, nnfth) |
|
290 |
val cls = Meson.make_cnf skoths nnfth |
|
17412 | 291 |
in change clause_cache (Symtab.update (name, (th, cls))); |
16588 | 292 |
skolemlist nths thy' |
293 |
end |
|
294 |
else skolemlist nths thy |
|
295 |
end |
|
16009 | 296 |
| SOME _ => skolemlist nths thy) (*FIXME: check for duplicate names?*) |
297 |
||
298 |
(*Exported function to convert Isabelle theorems into axiom clauses*) |
|
18000
ac059afd6b86
Added several new functions that convert HOL Isabelle rules to FOL axiom clauses. The original functions that convert FOL rules to clauses stay with the same names; the new functions have "H" at the end of their names.
mengj
parents:
17959
diff
changeset
|
299 |
fun cnf_axiom_g cnf_axiom_aux (name,th) = |
15956 | 300 |
case name of |
15955
87cf2ce8ede8
memoization of ResAxioms.cnf_axiom rather than of Reconstruction.clausify_rule
paulson
parents:
15872
diff
changeset
|
301 |
"" => cnf_axiom_aux th (*no name, so can't cache*) |
17412 | 302 |
| s => case Symtab.lookup (!clause_cache) s of |
15955
87cf2ce8ede8
memoization of ResAxioms.cnf_axiom rather than of Reconstruction.clausify_rule
paulson
parents:
15872
diff
changeset
|
303 |
NONE => |
87cf2ce8ede8
memoization of ResAxioms.cnf_axiom rather than of Reconstruction.clausify_rule
paulson
parents:
15872
diff
changeset
|
304 |
let val cls = cnf_axiom_aux th |
17412 | 305 |
in change clause_cache (Symtab.update (s, (th, cls))); cls end |
15955
87cf2ce8ede8
memoization of ResAxioms.cnf_axiom rather than of Reconstruction.clausify_rule
paulson
parents:
15872
diff
changeset
|
306 |
| SOME(th',cls) => |
87cf2ce8ede8
memoization of ResAxioms.cnf_axiom rather than of Reconstruction.clausify_rule
paulson
parents:
15872
diff
changeset
|
307 |
if eq_thm(th,th') then cls |
87cf2ce8ede8
memoization of ResAxioms.cnf_axiom rather than of Reconstruction.clausify_rule
paulson
parents:
15872
diff
changeset
|
308 |
else (*New theorem stored under the same name? Possible??*) |
87cf2ce8ede8
memoization of ResAxioms.cnf_axiom rather than of Reconstruction.clausify_rule
paulson
parents:
15872
diff
changeset
|
309 |
let val cls = cnf_axiom_aux th |
17412 | 310 |
in change clause_cache (Symtab.update (s, (th, cls))); cls end; |
15347 | 311 |
|
18000
ac059afd6b86
Added several new functions that convert HOL Isabelle rules to FOL axiom clauses. The original functions that convert FOL rules to clauses stay with the same names; the new functions have "H" at the end of their names.
mengj
parents:
17959
diff
changeset
|
312 |
|
ac059afd6b86
Added several new functions that convert HOL Isabelle rules to FOL axiom clauses. The original functions that convert FOL rules to clauses stay with the same names; the new functions have "H" at the end of their names.
mengj
parents:
17959
diff
changeset
|
313 |
val cnf_axiom = cnf_axiom_g cnf_axiom_aux; |
ac059afd6b86
Added several new functions that convert HOL Isabelle rules to FOL axiom clauses. The original functions that convert FOL rules to clauses stay with the same names; the new functions have "H" at the end of their names.
mengj
parents:
17959
diff
changeset
|
314 |
val cnf_axiomH = cnf_axiom_g cnf_axiom_auxH; |
ac059afd6b86
Added several new functions that convert HOL Isabelle rules to FOL axiom clauses. The original functions that convert FOL rules to clauses stay with the same names; the new functions have "H" at the end of their names.
mengj
parents:
17959
diff
changeset
|
315 |
|
ac059afd6b86
Added several new functions that convert HOL Isabelle rules to FOL axiom clauses. The original functions that convert FOL rules to clauses stay with the same names; the new functions have "H" at the end of their names.
mengj
parents:
17959
diff
changeset
|
316 |
|
15956 | 317 |
fun pairname th = (Thm.name_of_thm th, th); |
318 |
||
319 |
fun meta_cnf_axiom th = |
|
320 |
map Meson.make_meta_clause (cnf_axiom (pairname th)); |
|
15499 | 321 |
|
15347 | 322 |
|
18000
ac059afd6b86
Added several new functions that convert HOL Isabelle rules to FOL axiom clauses. The original functions that convert FOL rules to clauses stay with the same names; the new functions have "H" at the end of their names.
mengj
parents:
17959
diff
changeset
|
323 |
fun meta_cnf_axiomH th = |
ac059afd6b86
Added several new functions that convert HOL Isabelle rules to FOL axiom clauses. The original functions that convert FOL rules to clauses stay with the same names; the new functions have "H" at the end of their names.
mengj
parents:
17959
diff
changeset
|
324 |
map Meson.make_meta_clause (cnf_axiomH (pairname th)); |
ac059afd6b86
Added several new functions that convert HOL Isabelle rules to FOL axiom clauses. The original functions that convert FOL rules to clauses stay with the same names; the new functions have "H" at the end of their names.
mengj
parents:
17959
diff
changeset
|
325 |
|
15347 | 326 |
(* changed: with one extra case added *) |
15956 | 327 |
fun univ_vars_of_aux (Const ("Hilbert_Choice.Eps",_) $ Abs(_,_,body)) vars = |
328 |
univ_vars_of_aux body vars |
|
329 |
| univ_vars_of_aux (Const ("Ex",_) $ Abs(_,_,body)) vars = |
|
330 |
univ_vars_of_aux body vars (* EX x. body *) |
|
15347 | 331 |
| univ_vars_of_aux (P $ Q) vars = |
15956 | 332 |
univ_vars_of_aux Q (univ_vars_of_aux P vars) |
15347 | 333 |
| univ_vars_of_aux (t as Var(_,_)) vars = |
15956 | 334 |
if (t mem vars) then vars else (t::vars) |
15347 | 335 |
| univ_vars_of_aux _ vars = vars; |
336 |
||
337 |
fun univ_vars_of t = univ_vars_of_aux t []; |
|
338 |
||
339 |
||
17819 | 340 |
(**** Generating Skoklem Functions ****) |
341 |
||
342 |
val skolem_prefix = "sk_"; |
|
343 |
val skolem_id = ref 0; |
|
344 |
||
345 |
fun gen_skolem_name () = |
|
346 |
let val sk_fun = skolem_prefix ^ string_of_int (! skolem_id); |
|
347 |
in inc skolem_id; sk_fun end; |
|
348 |
||
349 |
fun gen_skolem univ_vars tp = |
|
350 |
let |
|
351 |
val skolem_type = map Term.fastype_of univ_vars ---> tp |
|
352 |
val skolem_term = Const (gen_skolem_name (), skolem_type) |
|
353 |
in Term.list_comb (skolem_term, univ_vars) end; |
|
354 |
||
15347 | 355 |
fun get_new_skolem epss (t as (Const ("Hilbert_Choice.Eps",_) $ Abs(_,tp,_))) = |
356 |
let val all_vars = univ_vars_of t |
|
17819 | 357 |
val sk_term = gen_skolem all_vars tp |
15347 | 358 |
in |
359 |
(sk_term,(t,sk_term)::epss) |
|
360 |
end; |
|
361 |
||
17404
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17279
diff
changeset
|
362 |
(*FIXME: use a-list lookup!!*) |
15531 | 363 |
fun sk_lookup [] t = NONE |
364 |
| sk_lookup ((tm,sk_tm)::tms) t = if (t = tm) then SOME (sk_tm) else (sk_lookup tms t); |
|
15347 | 365 |
|
15390 | 366 |
(* get the proper skolem term to replace epsilon term *) |
15347 | 367 |
fun get_skolem epss t = |
15956 | 368 |
case (sk_lookup epss t) of NONE => get_new_skolem epss t |
369 |
| SOME sk => (sk,epss); |
|
15347 | 370 |
|
16009 | 371 |
fun rm_Eps_cls_aux epss (t as (Const ("Hilbert_Choice.Eps",_) $ Abs(_,_,_))) = |
372 |
get_skolem epss t |
|
15347 | 373 |
| rm_Eps_cls_aux epss (P $ Q) = |
16009 | 374 |
let val (P',epss') = rm_Eps_cls_aux epss P |
375 |
val (Q',epss'') = rm_Eps_cls_aux epss' Q |
|
376 |
in (P' $ Q',epss'') end |
|
15347 | 377 |
| rm_Eps_cls_aux epss t = (t,epss); |
378 |
||
16009 | 379 |
fun rm_Eps_cls epss th = rm_Eps_cls_aux epss (prop_of th); |
15347 | 380 |
|
17404
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17279
diff
changeset
|
381 |
(* replace the epsilon terms in a formula by skolem terms. *) |
15347 | 382 |
fun rm_Eps _ [] = [] |
17829 | 383 |
| rm_Eps epss (th::ths) = |
16009 | 384 |
let val (th',epss') = rm_Eps_cls epss th |
17829 | 385 |
in th' :: (rm_Eps epss' ths) end; |
15347 | 386 |
|
387 |
||
388 |
||
15872 | 389 |
(**** Extract and Clausify theorems from a theory's claset and simpset ****) |
15347 | 390 |
|
17404
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17279
diff
changeset
|
391 |
(*Preserve the name of "th" after the transformation "f"*) |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17279
diff
changeset
|
392 |
fun preserve_name f th = Thm.name_thm (Thm.name_of_thm th, f th); |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17279
diff
changeset
|
393 |
|
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17279
diff
changeset
|
394 |
(*Tags identify the major premise or conclusion, as hints to resolution provers. |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17279
diff
changeset
|
395 |
However, they don't appear to help in recent tests, and they complicate the code.*) |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17279
diff
changeset
|
396 |
val tagI = thm "tagI"; |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17279
diff
changeset
|
397 |
val tagD = thm "tagD"; |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17279
diff
changeset
|
398 |
|
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17279
diff
changeset
|
399 |
val tag_intro = preserve_name (fn th => th RS tagI); |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17279
diff
changeset
|
400 |
val tag_elim = preserve_name (fn th => tagD RS th); |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17279
diff
changeset
|
401 |
|
17484
f6a225f97f0a
simplification of the Isabelle-ATP code; hooks for batch generation of problems
paulson
parents:
17412
diff
changeset
|
402 |
fun rules_of_claset cs = |
f6a225f97f0a
simplification of the Isabelle-ATP code; hooks for batch generation of problems
paulson
parents:
17412
diff
changeset
|
403 |
let val {safeIs,safeEs,hazIs,hazEs,...} = rep_cs cs |
f6a225f97f0a
simplification of the Isabelle-ATP code; hooks for batch generation of problems
paulson
parents:
17412
diff
changeset
|
404 |
val intros = safeIs @ hazIs |
f6a225f97f0a
simplification of the Isabelle-ATP code; hooks for batch generation of problems
paulson
parents:
17412
diff
changeset
|
405 |
val elims = safeEs @ hazEs |
17404
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17279
diff
changeset
|
406 |
in |
17484
f6a225f97f0a
simplification of the Isabelle-ATP code; hooks for batch generation of problems
paulson
parents:
17412
diff
changeset
|
407 |
debug ("rules_of_claset intros: " ^ Int.toString(length intros) ^ |
f6a225f97f0a
simplification of the Isabelle-ATP code; hooks for batch generation of problems
paulson
parents:
17412
diff
changeset
|
408 |
" elims: " ^ Int.toString(length elims)); |
17404
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17279
diff
changeset
|
409 |
if tagging_enabled |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17279
diff
changeset
|
410 |
then map pairname (map tag_intro intros @ map tag_elim elims) |
17484
f6a225f97f0a
simplification of the Isabelle-ATP code; hooks for batch generation of problems
paulson
parents:
17412
diff
changeset
|
411 |
else map pairname (intros @ elims) |
17404
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17279
diff
changeset
|
412 |
end; |
15347 | 413 |
|
17484
f6a225f97f0a
simplification of the Isabelle-ATP code; hooks for batch generation of problems
paulson
parents:
17412
diff
changeset
|
414 |
fun rules_of_simpset ss = |
f6a225f97f0a
simplification of the Isabelle-ATP code; hooks for batch generation of problems
paulson
parents:
17412
diff
changeset
|
415 |
let val ({rules,...}, _) = rep_ss ss |
f6a225f97f0a
simplification of the Isabelle-ATP code; hooks for batch generation of problems
paulson
parents:
17412
diff
changeset
|
416 |
val simps = Net.entries rules |
f6a225f97f0a
simplification of the Isabelle-ATP code; hooks for batch generation of problems
paulson
parents:
17412
diff
changeset
|
417 |
in |
f6a225f97f0a
simplification of the Isabelle-ATP code; hooks for batch generation of problems
paulson
parents:
17412
diff
changeset
|
418 |
debug ("rules_of_simpset: " ^ Int.toString(length simps)); |
f6a225f97f0a
simplification of the Isabelle-ATP code; hooks for batch generation of problems
paulson
parents:
17412
diff
changeset
|
419 |
map (fn r => (#name r, #thm r)) simps |
f6a225f97f0a
simplification of the Isabelle-ATP code; hooks for batch generation of problems
paulson
parents:
17412
diff
changeset
|
420 |
end; |
f6a225f97f0a
simplification of the Isabelle-ATP code; hooks for batch generation of problems
paulson
parents:
17412
diff
changeset
|
421 |
|
f6a225f97f0a
simplification of the Isabelle-ATP code; hooks for batch generation of problems
paulson
parents:
17412
diff
changeset
|
422 |
fun claset_rules_of_thy thy = rules_of_claset (claset_of thy); |
f6a225f97f0a
simplification of the Isabelle-ATP code; hooks for batch generation of problems
paulson
parents:
17412
diff
changeset
|
423 |
fun simpset_rules_of_thy thy = rules_of_simpset (simpset_of thy); |
f6a225f97f0a
simplification of the Isabelle-ATP code; hooks for batch generation of problems
paulson
parents:
17412
diff
changeset
|
424 |
|
f6a225f97f0a
simplification of the Isabelle-ATP code; hooks for batch generation of problems
paulson
parents:
17412
diff
changeset
|
425 |
fun claset_rules_of_ctxt ctxt = rules_of_claset (local_claset_of ctxt); |
f6a225f97f0a
simplification of the Isabelle-ATP code; hooks for batch generation of problems
paulson
parents:
17412
diff
changeset
|
426 |
fun simpset_rules_of_ctxt ctxt = rules_of_simpset (local_simpset_of ctxt); |
15347 | 427 |
|
428 |
||
15872 | 429 |
(**** Translate a set of classical/simplifier rules into CNF (still as type "thm") ****) |
15347 | 430 |
|
431 |
(* classical rules *) |
|
18000
ac059afd6b86
Added several new functions that convert HOL Isabelle rules to FOL axiom clauses. The original functions that convert FOL rules to clauses stay with the same names; the new functions have "H" at the end of their names.
mengj
parents:
17959
diff
changeset
|
432 |
fun cnf_rules_g cnf_axiom [] err_list = ([],err_list) |
ac059afd6b86
Added several new functions that convert HOL Isabelle rules to FOL axiom clauses. The original functions that convert FOL rules to clauses stay with the same names; the new functions have "H" at the end of their names.
mengj
parents:
17959
diff
changeset
|
433 |
| cnf_rules_g cnf_axiom ((name,th) :: ths) err_list = |
ac059afd6b86
Added several new functions that convert HOL Isabelle rules to FOL axiom clauses. The original functions that convert FOL rules to clauses stay with the same names; the new functions have "H" at the end of their names.
mengj
parents:
17959
diff
changeset
|
434 |
let val (ts,es) = cnf_rules_g cnf_axiom ths err_list |
17404
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17279
diff
changeset
|
435 |
in (cnf_axiom (name,th) :: ts,es) handle _ => (ts, (th::es)) end; |
15347 | 436 |
|
437 |
||
18000
ac059afd6b86
Added several new functions that convert HOL Isabelle rules to FOL axiom clauses. The original functions that convert FOL rules to clauses stay with the same names; the new functions have "H" at the end of their names.
mengj
parents:
17959
diff
changeset
|
438 |
val cnf_rules = cnf_rules_g cnf_axiom; |
ac059afd6b86
Added several new functions that convert HOL Isabelle rules to FOL axiom clauses. The original functions that convert FOL rules to clauses stay with the same names; the new functions have "H" at the end of their names.
mengj
parents:
17959
diff
changeset
|
439 |
val cnf_rulesH = cnf_rules_g cnf_axiomH; |
ac059afd6b86
Added several new functions that convert HOL Isabelle rules to FOL axiom clauses. The original functions that convert FOL rules to clauses stay with the same names; the new functions have "H" at the end of their names.
mengj
parents:
17959
diff
changeset
|
440 |
|
ac059afd6b86
Added several new functions that convert HOL Isabelle rules to FOL axiom clauses. The original functions that convert FOL rules to clauses stay with the same names; the new functions have "H" at the end of their names.
mengj
parents:
17959
diff
changeset
|
441 |
|
15872 | 442 |
(**** Convert all theorems of a claset/simpset into clauses (ResClause.clause) ****) |
15347 | 443 |
|
17404
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17279
diff
changeset
|
444 |
fun addclause (c,th) l = |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17279
diff
changeset
|
445 |
if ResClause.isTaut c then l else (c,th) :: l; |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17279
diff
changeset
|
446 |
|
18000
ac059afd6b86
Added several new functions that convert HOL Isabelle rules to FOL axiom clauses. The original functions that convert FOL rules to clauses stay with the same names; the new functions have "H" at the end of their names.
mengj
parents:
17959
diff
changeset
|
447 |
fun addclauseH (c,th) l = |
ac059afd6b86
Added several new functions that convert HOL Isabelle rules to FOL axiom clauses. The original functions that convert FOL rules to clauses stay with the same names; the new functions have "H" at the end of their names.
mengj
parents:
17959
diff
changeset
|
448 |
if ResHolClause.isTaut c then l else (c,th)::l; |
ac059afd6b86
Added several new functions that convert HOL Isabelle rules to FOL axiom clauses. The original functions that convert FOL rules to clauses stay with the same names; the new functions have "H" at the end of their names.
mengj
parents:
17959
diff
changeset
|
449 |
|
ac059afd6b86
Added several new functions that convert HOL Isabelle rules to FOL axiom clauses. The original functions that convert FOL rules to clauses stay with the same names; the new functions have "H" at the end of their names.
mengj
parents:
17959
diff
changeset
|
450 |
|
17829 | 451 |
(* outputs a list of (clause,theorem) pairs *) |
452 |
fun clausify_axiom_pairs (thm_name,th) = |
|
453 |
let val isa_clauses = cnf_axiom (thm_name,th) |
|
16039
dfe264950511
Moved some of the clausify functions from ATP/res_clasimpset.ML to res_axioms.ML.
quigley
parents:
16012
diff
changeset
|
454 |
val isa_clauses' = rm_Eps [] isa_clauses |
dfe264950511
Moved some of the clausify functions from ATP/res_clasimpset.ML to res_axioms.ML.
quigley
parents:
16012
diff
changeset
|
455 |
val clauses_n = length isa_clauses |
dfe264950511
Moved some of the clausify functions from ATP/res_clasimpset.ML to res_axioms.ML.
quigley
parents:
16012
diff
changeset
|
456 |
fun make_axiom_clauses _ [] []= [] |
16897 | 457 |
| make_axiom_clauses i (cls::clss) (cls'::clss') = |
17404
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17279
diff
changeset
|
458 |
addclause (ResClause.make_axiom_clause cls (thm_name,i), cls') |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17279
diff
changeset
|
459 |
(make_axiom_clauses (i+1) clss clss') |
15347 | 460 |
in |
16039
dfe264950511
Moved some of the clausify functions from ATP/res_clasimpset.ML to res_axioms.ML.
quigley
parents:
16012
diff
changeset
|
461 |
make_axiom_clauses 0 isa_clauses' isa_clauses |
17404
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17279
diff
changeset
|
462 |
end |
15347 | 463 |
|
18000
ac059afd6b86
Added several new functions that convert HOL Isabelle rules to FOL axiom clauses. The original functions that convert FOL rules to clauses stay with the same names; the new functions have "H" at the end of their names.
mengj
parents:
17959
diff
changeset
|
464 |
|
ac059afd6b86
Added several new functions that convert HOL Isabelle rules to FOL axiom clauses. The original functions that convert FOL rules to clauses stay with the same names; the new functions have "H" at the end of their names.
mengj
parents:
17959
diff
changeset
|
465 |
fun clausify_axiom_pairsH (thm_name,th) = |
ac059afd6b86
Added several new functions that convert HOL Isabelle rules to FOL axiom clauses. The original functions that convert FOL rules to clauses stay with the same names; the new functions have "H" at the end of their names.
mengj
parents:
17959
diff
changeset
|
466 |
let val isa_clauses = cnf_axiomH (thm_name,th) |
ac059afd6b86
Added several new functions that convert HOL Isabelle rules to FOL axiom clauses. The original functions that convert FOL rules to clauses stay with the same names; the new functions have "H" at the end of their names.
mengj
parents:
17959
diff
changeset
|
467 |
val isa_clauses' = rm_Eps [] isa_clauses |
ac059afd6b86
Added several new functions that convert HOL Isabelle rules to FOL axiom clauses. The original functions that convert FOL rules to clauses stay with the same names; the new functions have "H" at the end of their names.
mengj
parents:
17959
diff
changeset
|
468 |
val clauses_n = length isa_clauses |
ac059afd6b86
Added several new functions that convert HOL Isabelle rules to FOL axiom clauses. The original functions that convert FOL rules to clauses stay with the same names; the new functions have "H" at the end of their names.
mengj
parents:
17959
diff
changeset
|
469 |
fun make_axiom_clauses _ [] []= [] |
ac059afd6b86
Added several new functions that convert HOL Isabelle rules to FOL axiom clauses. The original functions that convert FOL rules to clauses stay with the same names; the new functions have "H" at the end of their names.
mengj
parents:
17959
diff
changeset
|
470 |
| make_axiom_clauses i (cls::clss) (cls'::clss') = |
ac059afd6b86
Added several new functions that convert HOL Isabelle rules to FOL axiom clauses. The original functions that convert FOL rules to clauses stay with the same names; the new functions have "H" at the end of their names.
mengj
parents:
17959
diff
changeset
|
471 |
addclauseH (ResHolClause.make_axiom_clause cls (thm_name,i), cls') |
ac059afd6b86
Added several new functions that convert HOL Isabelle rules to FOL axiom clauses. The original functions that convert FOL rules to clauses stay with the same names; the new functions have "H" at the end of their names.
mengj
parents:
17959
diff
changeset
|
472 |
(make_axiom_clauses (i+1) clss clss') |
ac059afd6b86
Added several new functions that convert HOL Isabelle rules to FOL axiom clauses. The original functions that convert FOL rules to clauses stay with the same names; the new functions have "H" at the end of their names.
mengj
parents:
17959
diff
changeset
|
473 |
in |
ac059afd6b86
Added several new functions that convert HOL Isabelle rules to FOL axiom clauses. The original functions that convert FOL rules to clauses stay with the same names; the new functions have "H" at the end of their names.
mengj
parents:
17959
diff
changeset
|
474 |
make_axiom_clauses 0 isa_clauses' isa_clauses |
ac059afd6b86
Added several new functions that convert HOL Isabelle rules to FOL axiom clauses. The original functions that convert FOL rules to clauses stay with the same names; the new functions have "H" at the end of their names.
mengj
parents:
17959
diff
changeset
|
475 |
end |
ac059afd6b86
Added several new functions that convert HOL Isabelle rules to FOL axiom clauses. The original functions that convert FOL rules to clauses stay with the same names; the new functions have "H" at the end of their names.
mengj
parents:
17959
diff
changeset
|
476 |
|
ac059afd6b86
Added several new functions that convert HOL Isabelle rules to FOL axiom clauses. The original functions that convert FOL rules to clauses stay with the same names; the new functions have "H" at the end of their names.
mengj
parents:
17959
diff
changeset
|
477 |
|
ac059afd6b86
Added several new functions that convert HOL Isabelle rules to FOL axiom clauses. The original functions that convert FOL rules to clauses stay with the same names; the new functions have "H" at the end of their names.
mengj
parents:
17959
diff
changeset
|
478 |
|
17829 | 479 |
fun clausify_rules_pairs_aux result [] = result |
480 |
| clausify_rules_pairs_aux result ((name,th)::ths) = |
|
481 |
clausify_rules_pairs_aux (clausify_axiom_pairs (name,th) :: result) ths |
|
482 |
handle THM (msg,_,_) => |
|
483 |
(debug ("Cannot clausify " ^ name ^ ": " ^ msg); |
|
484 |
clausify_rules_pairs_aux result ths) |
|
485 |
| ResClause.CLAUSE (msg,t) => |
|
486 |
(debug ("Cannot clausify " ^ name ^ ": " ^ msg ^ |
|
487 |
": " ^ TermLib.string_of_term t); |
|
488 |
clausify_rules_pairs_aux result ths) |
|
17404
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17279
diff
changeset
|
489 |
|
18000
ac059afd6b86
Added several new functions that convert HOL Isabelle rules to FOL axiom clauses. The original functions that convert FOL rules to clauses stay with the same names; the new functions have "H" at the end of their names.
mengj
parents:
17959
diff
changeset
|
490 |
|
ac059afd6b86
Added several new functions that convert HOL Isabelle rules to FOL axiom clauses. The original functions that convert FOL rules to clauses stay with the same names; the new functions have "H" at the end of their names.
mengj
parents:
17959
diff
changeset
|
491 |
fun clausify_rules_pairs_auxH result [] = result |
ac059afd6b86
Added several new functions that convert HOL Isabelle rules to FOL axiom clauses. The original functions that convert FOL rules to clauses stay with the same names; the new functions have "H" at the end of their names.
mengj
parents:
17959
diff
changeset
|
492 |
| clausify_rules_pairs_auxH result ((name,th)::ths) = |
ac059afd6b86
Added several new functions that convert HOL Isabelle rules to FOL axiom clauses. The original functions that convert FOL rules to clauses stay with the same names; the new functions have "H" at the end of their names.
mengj
parents:
17959
diff
changeset
|
493 |
clausify_rules_pairs_auxH (clausify_axiom_pairsH (name,th) :: result) ths |
ac059afd6b86
Added several new functions that convert HOL Isabelle rules to FOL axiom clauses. The original functions that convert FOL rules to clauses stay with the same names; the new functions have "H" at the end of their names.
mengj
parents:
17959
diff
changeset
|
494 |
handle THM (msg,_,_) => |
ac059afd6b86
Added several new functions that convert HOL Isabelle rules to FOL axiom clauses. The original functions that convert FOL rules to clauses stay with the same names; the new functions have "H" at the end of their names.
mengj
parents:
17959
diff
changeset
|
495 |
(debug ("Cannot clausify " ^ name ^ ": " ^ msg); |
ac059afd6b86
Added several new functions that convert HOL Isabelle rules to FOL axiom clauses. The original functions that convert FOL rules to clauses stay with the same names; the new functions have "H" at the end of their names.
mengj
parents:
17959
diff
changeset
|
496 |
clausify_rules_pairs_auxH result ths) |
ac059afd6b86
Added several new functions that convert HOL Isabelle rules to FOL axiom clauses. The original functions that convert FOL rules to clauses stay with the same names; the new functions have "H" at the end of their names.
mengj
parents:
17959
diff
changeset
|
497 |
| ResHolClause.LAM2COMB (t) => |
ac059afd6b86
Added several new functions that convert HOL Isabelle rules to FOL axiom clauses. The original functions that convert FOL rules to clauses stay with the same names; the new functions have "H" at the end of their names.
mengj
parents:
17959
diff
changeset
|
498 |
(debug ("Cannot clausify " ^ TermLib.string_of_term t); |
ac059afd6b86
Added several new functions that convert HOL Isabelle rules to FOL axiom clauses. The original functions that convert FOL rules to clauses stay with the same names; the new functions have "H" at the end of their names.
mengj
parents:
17959
diff
changeset
|
499 |
clausify_rules_pairs_auxH result ths) |
16039
dfe264950511
Moved some of the clausify functions from ATP/res_clasimpset.ML to res_axioms.ML.
quigley
parents:
16012
diff
changeset
|
500 |
|
15347 | 501 |
|
18000
ac059afd6b86
Added several new functions that convert HOL Isabelle rules to FOL axiom clauses. The original functions that convert FOL rules to clauses stay with the same names; the new functions have "H" at the end of their names.
mengj
parents:
17959
diff
changeset
|
502 |
|
ac059afd6b86
Added several new functions that convert HOL Isabelle rules to FOL axiom clauses. The original functions that convert FOL rules to clauses stay with the same names; the new functions have "H" at the end of their names.
mengj
parents:
17959
diff
changeset
|
503 |
val clausify_rules_pairs = clausify_rules_pairs_aux []; |
ac059afd6b86
Added several new functions that convert HOL Isabelle rules to FOL axiom clauses. The original functions that convert FOL rules to clauses stay with the same names; the new functions have "H" at the end of their names.
mengj
parents:
17959
diff
changeset
|
504 |
|
ac059afd6b86
Added several new functions that convert HOL Isabelle rules to FOL axiom clauses. The original functions that convert FOL rules to clauses stay with the same names; the new functions have "H" at the end of their names.
mengj
parents:
17959
diff
changeset
|
505 |
val clausify_rules_pairsH = clausify_rules_pairs_auxH []; |
16009 | 506 |
(*Setup function: takes a theory and installs ALL simprules and claset rules |
507 |
into the clause cache*) |
|
508 |
fun clause_cache_setup thy = |
|
509 |
let val simps = simpset_rules_of_thy thy |
|
510 |
and clas = claset_rules_of_thy thy |
|
511 |
in skolemlist clas (skolemlist simps thy) end; |
|
512 |
||
16563 | 513 |
val clause_setup = [clause_cache_setup]; |
514 |
||
515 |
||
516 |
(*** meson proof methods ***) |
|
517 |
||
518 |
fun cnf_rules_of_ths ths = List.concat (#1 (cnf_rules (map pairname ths) [])); |
|
519 |
||
520 |
fun meson_meth ths ctxt = |
|
521 |
Method.SIMPLE_METHOD' HEADGOAL |
|
522 |
(CHANGED_PROP o Meson.meson_claset_tac (cnf_rules_of_ths ths) (local_claset_of ctxt)); |
|
523 |
||
524 |
val meson_method_setup = |
|
525 |
[Method.add_methods |
|
526 |
[("meson", Method.thms_ctxt_args meson_meth, |
|
527 |
"The MESON resolution proof procedure")]]; |
|
15347 | 528 |
|
529 |
end; |