author  paulson 
Mon, 28 Aug 2006 18:15:32 +0200  
changeset 20421  d9606c64bc23 
parent 20419  df257a9cf0e9 
child 20445  b222d9939e00 
permissions  rwrr 
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 
val elimRule_tac : thm > Tactical.tactic 

16012  11 
val elimR2Fol : thm > term 
15997  12 
val transform_elim : thm > thm 
13 
val cnf_axiom : (string * thm) > thm list 

14 
val meta_cnf_axiom : thm > thm list 

15 
val claset_rules_of_thy : theory > (string * thm) list 

16 
val simpset_rules_of_thy : theory > (string * thm) list 

17484
f6a225f97f0a
simplification of the IsabelleATP code; hooks for batch generation of problems
paulson
parents:
17412
diff
changeset

17 
val claset_rules_of_ctxt: Proof.context > (string * thm) list 
f6a225f97f0a
simplification of the IsabelleATP code; hooks for batch generation of problems
paulson
parents:
17412
diff
changeset

18 
val simpset_rules_of_ctxt : Proof.context > (string * thm) 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

19 
val pairname : thm > (string * thm) 
18510
0a6c24f549c3
the "skolem" attribute and better initialization of the clause database
paulson
parents:
18404
diff
changeset

20 
val skolem_thm : thm > thm list 
20419  21 
val to_nnf : thm > thm 
19353  22 
val cnf_rules_pairs : (string * Thm.thm) list > (Thm.thm * (string * int)) list list; 
18708  23 
val meson_method_setup : theory > theory 
24 
val setup : theory > theory 

19196
62ee8c10d796
Added functions to retrieve local and global atpset rules.
mengj
parents:
19175
diff
changeset

25 

62ee8c10d796
Added functions to retrieve local and global atpset rules.
mengj
parents:
19175
diff
changeset

26 
val atpset_rules_of_thy : theory > (string * thm) list 
62ee8c10d796
Added functions to retrieve local and global atpset rules.
mengj
parents:
19175
diff
changeset

27 
val atpset_rules_of_ctxt : Proof.context > (string * thm) list 
15997  28 
end; 
20419  29 

30 
structure ResAxioms = 

15997  31 

32 
struct 

15347  33 

20419  34 
(*FIXME DELETE: For running the comparison between combinators and abstractions. 
35 
CANNOT be a ref, as the setting is used while Isabelle is built.*) 

36 
val abstract_lambdas = true; 

37 

38 
val trace_abs = ref false; 

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 

15997  40 
(**** Transformation of Elimination Rules into FirstOrder Formulas****) 
15347  41 

15390  42 
(* a tactic used to prove an elimrule. *) 
16009  43 
fun elimRule_tac th = 
20419  44 
(resolve_tac [impI,notI] 1) THEN (etac th 1) THEN REPEAT(fast_tac HOL_cs 1); 
15347  45 

15956  46 
fun add_EX tm [] = tm 
47 
 add_EX tm ((x,xtp)::xs) = add_EX (HOLogic.exists_const xtp $ Abs(x,xtp,tm)) xs; 

15347  48 

19894  49 
(*Checks for the premise ~P when the conclusion is P.*) 
50 
fun is_neg (Const("Trueprop",_) $ (Const("Not",_) $ Free(p,_))) 

51 
(Const("Trueprop",_) $ Free(q,_)) = (p = q) 

15371  52 
 is_neg _ _ = false; 
53 

20017
a2070352371c
made the conversion of elimination rules more robust
paulson
parents:
19894
diff
changeset

54 
exception ELIMR2FOL; 
a2070352371c
made the conversion of elimination rules more robust
paulson
parents:
19894
diff
changeset

55 

a2070352371c
made the conversion of elimination rules more robust
paulson
parents:
19894
diff
changeset

56 
(*Handles the case where the dummy "conclusion" variable appears negated in the 
a2070352371c
made the conversion of elimination rules more robust
paulson
parents:
19894
diff
changeset

57 
premises, so the final consequent must be kept.*) 
15371  58 
fun strip_concl' prems bvs (Const ("==>",_) $ P $ Q) = 
19894  59 
strip_concl' (HOLogic.dest_Trueprop P :: prems) bvs Q 
15371  60 
 strip_concl' prems bvs P = 
15956  61 
let val P' = HOLogic.Not $ (HOLogic.dest_Trueprop P) 
19894  62 
in add_EX (foldr1 HOLogic.mk_conj (P'::prems)) bvs end; 
15371  63 

20017
a2070352371c
made the conversion of elimination rules more robust
paulson
parents:
19894
diff
changeset

64 
(*Recurrsion over the minor premise of an elimination rule. Final consequent 
a2070352371c
made the conversion of elimination rules more robust
paulson
parents:
19894
diff
changeset

65 
is ignored, as it is the dummy "conclusion" variable.*) 
18141
89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18009
diff
changeset

66 
fun strip_concl prems bvs concl (Const ("all", _) $ Abs (x,xtp,body)) = 
89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18009
diff
changeset

67 
strip_concl prems ((x,xtp)::bvs) concl body 
15371  68 
 strip_concl prems bvs concl (Const ("==>",_) $ P $ Q) = 
18141
89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18009
diff
changeset

69 
if (is_neg P concl) then (strip_concl' prems bvs Q) 
89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18009
diff
changeset

70 
else strip_concl (HOLogic.dest_Trueprop P::prems) bvs concl Q 
20017
a2070352371c
made the conversion of elimination rules more robust
paulson
parents:
19894
diff
changeset

71 
 strip_concl prems bvs concl Q = 
a2070352371c
made the conversion of elimination rules more robust
paulson
parents:
19894
diff
changeset

72 
if concl aconv Q then add_EX (foldr1 HOLogic.mk_conj prems) bvs 
a2070352371c
made the conversion of elimination rules more robust
paulson
parents:
19894
diff
changeset

73 
else raise ELIMR2FOL (*expected conclusion not found!*) 
15347  74 

20017
a2070352371c
made the conversion of elimination rules more robust
paulson
parents:
19894
diff
changeset

75 
fun trans_elim (major,[],_) = HOLogic.Not $ major 
a2070352371c
made the conversion of elimination rules more robust
paulson
parents:
19894
diff
changeset

76 
 trans_elim (major,minors,concl) = 
a2070352371c
made the conversion of elimination rules more robust
paulson
parents:
19894
diff
changeset

77 
let val disjs = foldr1 HOLogic.mk_disj (map (strip_concl [] [] concl) minors) 
a2070352371c
made the conversion of elimination rules more robust
paulson
parents:
19894
diff
changeset

78 
in HOLogic.mk_imp (major, disjs) end; 
15347  79 

16012  80 
(* convert an elim rule into an equivalent formula, of type term. *) 
15347  81 
fun elimR2Fol elimR = 
20292
6f2b8ed987ec
removed obsolete Drule.freeze_all  now uses legacy Drule.freeze_thaw;
wenzelm
parents:
20071
diff
changeset

82 
let val elimR' = #1 (Drule.freeze_thaw elimR) 
19894  83 
val (prems,concl) = (prems_of elimR', concl_of elimR') 
20017
a2070352371c
made the conversion of elimination rules more robust
paulson
parents:
19894
diff
changeset

84 
val cv = case concl of (*conclusion variable*) 
a2070352371c
made the conversion of elimination rules more robust
paulson
parents:
19894
diff
changeset

85 
Const("Trueprop",_) $ (v as Free(_,Type("bool",[]))) => v 
a2070352371c
made the conversion of elimination rules more robust
paulson
parents:
19894
diff
changeset

86 
 v as Free(_, Type("prop",[])) => v 
a2070352371c
made the conversion of elimination rules more robust
paulson
parents:
19894
diff
changeset

87 
 _ => raise ELIMR2FOL 
a2070352371c
made the conversion of elimination rules more robust
paulson
parents:
19894
diff
changeset

88 
in case prems of 
a2070352371c
made the conversion of elimination rules more robust
paulson
parents:
19894
diff
changeset

89 
[] => raise ELIMR2FOL 
a2070352371c
made the conversion of elimination rules more robust
paulson
parents:
19894
diff
changeset

90 
 (Const("Trueprop",_) $ major) :: minors => 
a2070352371c
made the conversion of elimination rules more robust
paulson
parents:
19894
diff
changeset

91 
if member (op aconv) (term_frees major) cv then raise ELIMR2FOL 
a2070352371c
made the conversion of elimination rules more robust
paulson
parents:
19894
diff
changeset

92 
else (trans_elim (major, minors, concl) handle TERM _ => raise ELIMR2FOL) 
a2070352371c
made the conversion of elimination rules more robust
paulson
parents:
19894
diff
changeset

93 
 _ => raise ELIMR2FOL 
a2070352371c
made the conversion of elimination rules more robust
paulson
parents:
19894
diff
changeset

94 
end; 
15347  95 

15997  96 
(* convert an elimrule into an equivalent theorem that does not have the 
97 
predicate variable. Leave other theorems unchanged.*) 

16009  98 
fun transform_elim th = 
20017
a2070352371c
made the conversion of elimination rules more robust
paulson
parents:
19894
diff
changeset

99 
let val ctm = cterm_of (sign_of_thm th) (HOLogic.mk_Trueprop (elimR2Fol th)) 
18009  100 
in Goal.prove_raw [] ctm (fn _ => elimRule_tac th) end 
20017
a2070352371c
made the conversion of elimination rules more robust
paulson
parents:
19894
diff
changeset

101 
handle ELIMR2FOL => th (*not an elimination rule*) 
a2070352371c
made the conversion of elimination rules more robust
paulson
parents:
19894
diff
changeset

102 
 exn => (warning ("transform_elim failed: " ^ Toplevel.exn_message exn ^ 
a2070352371c
made the conversion of elimination rules more robust
paulson
parents:
19894
diff
changeset

103 
" for theorem " ^ string_of_thm th); th) 
a2070352371c
made the conversion of elimination rules more robust
paulson
parents:
19894
diff
changeset

104 

15997  105 

106 
(**** Transformation of Clasets and Simpsets into FirstOrder Axioms ****) 

107 

16563  108 
(*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

109 
inside that theory  because it's needed for Skolemization *) 
8bad1f42fec0
new CLAUSIFY attribute for proof reconstruction with lemmas
paulson
parents:
15347
diff
changeset

110 

16563  111 
(*This will refer to the final version of theory Reconstruction.*) 
112 
val recon_thy_ref = Theory.self_ref (the_context ()); 

15359
8bad1f42fec0
new CLAUSIFY attribute for proof reconstruction with lemmas
paulson
parents:
15347
diff
changeset

113 

16563  114 
(*If called while Reconstruction is being created, it will transfer to the 
115 
current version. If called afterward, it will transfer to the final version.*) 

16009  116 
fun transfer_to_Reconstruction th = 
16563  117 
transfer (Theory.deref recon_thy_ref) th handle THM _ => th; 
15347  118 

15955
87cf2ce8ede8
memoization of ResAxioms.cnf_axiom rather than of Reconstruction.clausify_rule
paulson
parents:
15872
diff
changeset

119 
fun is_taut th = 
87cf2ce8ede8
memoization of ResAxioms.cnf_axiom rather than of Reconstruction.clausify_rule
paulson
parents:
15872
diff
changeset

120 
case (prop_of th) of 
87cf2ce8ede8
memoization of ResAxioms.cnf_axiom rather than of Reconstruction.clausify_rule
paulson
parents:
15872
diff
changeset

121 
(Const ("Trueprop", _) $ Const ("True", _)) => true 
87cf2ce8ede8
memoization of ResAxioms.cnf_axiom rather than of Reconstruction.clausify_rule
paulson
parents:
15872
diff
changeset

122 
 _ => false; 
87cf2ce8ede8
memoization of ResAxioms.cnf_axiom rather than of Reconstruction.clausify_rule
paulson
parents:
15872
diff
changeset

123 

87cf2ce8ede8
memoization of ResAxioms.cnf_axiom rather than of Reconstruction.clausify_rule
paulson
parents:
15872
diff
changeset

124 
(* remove tautologous clauses *) 
87cf2ce8ede8
memoization of ResAxioms.cnf_axiom rather than of Reconstruction.clausify_rule
paulson
parents:
15872
diff
changeset

125 
val rm_redundant_cls = List.filter (not o is_taut); 
18141
89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18009
diff
changeset

126 

15997  127 

16009  128 
(**** SKOLEMIZATION BY INFERENCE (lcp) ****) 
129 

18141
89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18009
diff
changeset

130 
(*Traverse a theorem, declaring Skolem function definitions. String s is the suggested 
89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18009
diff
changeset

131 
prefix for the Skolem constant. Result is a new theory*) 
89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18009
diff
changeset

132 
fun declare_skofuns s th thy = 
20419  133 
let fun dec_sko (Const ("Ex",_) $ (xtp as Abs(_,T,p))) (thy, axs) = 
16009  134 
(*Existential: declare a Skolem function, then insert into body and continue*) 
20419  135 
let val cname = gensym ("sko_" ^ s ^ "_") 
16012  136 
val args = term_frees xtp (*get the formal parameter list*) 
16009  137 
val Ts = map type_of args 
138 
val cT = Ts > T 

18141
89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18009
diff
changeset

139 
val c = Const (Sign.full_name thy cname, cT) 
16009  140 
val rhs = list_abs_free (map dest_Free args, HOLogic.choice_const T $ xtp) 
16012  141 
(*Forms a lambdaabstraction over the formal parameters*) 
16009  142 
val thy' = Theory.add_consts_i [(cname, cT, NoSyn)] thy 
16012  143 
(*Theory is augmented with the constant, then its def*) 
17404
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17279
diff
changeset

144 
val cdef = cname ^ "_def" 
20419  145 
val thy'' = Theory.add_defs_i false false [(cdef, equals cT $ c $ rhs)] thy' 
17404
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17279
diff
changeset

146 
in dec_sko (subst_bound (list_comb(c,args), p)) 
20419  147 
(thy'', get_axiom thy'' cdef :: axs) 
17404
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17279
diff
changeset

148 
end 
20419  149 
 dec_sko (Const ("All",_) $ (xtp as Abs(a,T,p))) thx = 
16012  150 
(*Universal quant: insert a free variable into body and continue*) 
20071
8f3e1ddb50e6
replaced Term.variant(list) by Name.variant(_list);
wenzelm
parents:
20017
diff
changeset

151 
let val fname = Name.variant (add_term_names (p,[])) a 
20419  152 
in dec_sko (subst_bound (Free(fname,T), p)) thx end 
153 
 dec_sko (Const ("op &", _) $ p $ q) thx = dec_sko q (dec_sko p thx) 

154 
 dec_sko (Const ("op ", _) $ p $ q) thx = dec_sko q (dec_sko p thx) 

155 
 dec_sko (Const ("Trueprop", _) $ p) thx = dec_sko p thx 

156 
 dec_sko t thx = thx (*Do nothing otherwise*) 

157 
in dec_sko (prop_of th) (thy,[]) end; 

18141
89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18009
diff
changeset

158 

89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18009
diff
changeset

159 
(*Traverse a theorem, accumulating Skolem function definitions.*) 
89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18009
diff
changeset

160 
fun assume_skofuns th = 
89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18009
diff
changeset

161 
let fun dec_sko (Const ("Ex",_) $ (xtp as Abs(_,T,p))) defs = 
89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18009
diff
changeset

162 
(*Existential: declare a Skolem function, then insert into body and continue*) 
20419  163 
let val skos = map (#1 o Logic.dest_equals) defs (*existing sko fns*) 
18141
89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18009
diff
changeset

164 
val args = term_frees xtp \\ skos (*the formal parameters*) 
89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18009
diff
changeset

165 
val Ts = map type_of args 
89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18009
diff
changeset

166 
val cT = Ts > T 
20419  167 
val c = Free (gensym "sko_", cT) 
18141
89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18009
diff
changeset

168 
val rhs = list_abs_free (map dest_Free args, 
89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18009
diff
changeset

169 
HOLogic.choice_const T $ xtp) 
89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18009
diff
changeset

170 
(*Forms a lambdaabstraction over the formal parameters*) 
89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18009
diff
changeset

171 
val def = equals cT $ c $ rhs 
89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18009
diff
changeset

172 
in dec_sko (subst_bound (list_comb(c,args), p)) 
89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18009
diff
changeset

173 
(def :: defs) 
89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18009
diff
changeset

174 
end 
89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18009
diff
changeset

175 
 dec_sko (Const ("All",_) $ (xtp as Abs(a,T,p))) defs = 
89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18009
diff
changeset

176 
(*Universal quant: insert a free variable into body and continue*) 
20071
8f3e1ddb50e6
replaced Term.variant(list) by Name.variant(_list);
wenzelm
parents:
20017
diff
changeset

177 
let val fname = Name.variant (add_term_names (p,[])) a 
18141
89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18009
diff
changeset

178 
in dec_sko (subst_bound (Free(fname,T), p)) defs end 
89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18009
diff
changeset

179 
 dec_sko (Const ("op &", _) $ p $ q) defs = dec_sko q (dec_sko p defs) 
89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18009
diff
changeset

180 
 dec_sko (Const ("op ", _) $ p $ q) defs = dec_sko q (dec_sko p defs) 
89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18009
diff
changeset

181 
 dec_sko (Const ("Trueprop", _) $ p) defs = dec_sko p defs 
89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18009
diff
changeset

182 
 dec_sko t defs = defs (*Do nothing otherwise*) 
20419  183 
in dec_sko (prop_of th) [] end; 
184 

185 

186 
(**** REPLACING ABSTRACTIONS BY FUNCTION DEFINITIONS ****) 

187 

188 
(*Returns the vars of a theorem*) 

189 
fun vars_of_thm th = 

190 
map (Thm.cterm_of (Thm.theory_of_thm th) o Var) (Drule.fold_terms Term.add_vars th []); 

191 

192 
(*Make a version of fun_cong with a given variable name*) 

193 
local 

194 
val fun_cong' = fun_cong RS asm_rl; (*renumber f, g to prevent clashes with (a,0)*) 

195 
val cx = hd (vars_of_thm fun_cong'); 

196 
val ty = typ_of (ctyp_of_term cx); 

197 
val thy = Thm.theory_of_thm fun_cong; 

198 
fun mkvar a = cterm_of thy (Var((a,0),ty)); 

199 
in 

200 
fun xfun_cong x = Thm.instantiate ([], [(cx, mkvar x)]) fun_cong' 

201 
end; 

202 

203 
(*Removes the lambdas from an equation of the form t = (%x. u)*) 

204 
fun strip_lambdas th = 

205 
case prop_of th of 

206 
_ $ (Const ("op =", _) $ _ $ Abs (x,_,_)) => 

207 
strip_lambdas (#1 (Drule.freeze_thaw (th RS xfun_cong x))) 

208 
 _ => th; 

209 

210 
(*Convert meta to objectequality. Fails for theorems like split_comp_eq, 

211 
where some types have the empty sort.*) 

212 
fun object_eq th = th RS def_imp_eq 

213 
handle THM _ => error ("Theorem contains empty sort: " ^ string_of_thm th); 

214 

215 
fun valid_name vs (Free(x,T)) = x mem_string vs 

216 
 valid_name vs _ = false; 

217 

218 
(*Contract all etaredexes in the theorem, lest they give rise to needless abstractions*) 

219 
fun eta_conversion_rule th = 

220 
equal_elim (eta_conversion (cprop_of th)) th; 

221 

222 
fun crhs th = 

223 
case Drule.strip_comb (cprop_of th) of 

224 
(f, [_, rhs]) => 

225 
(case term_of f of 

226 
Const ("==", _) => rhs 

227 
 _ => raise THM ("crhs", 0, [th])) 

228 
 _ => raise THM ("crhs", 1, [th]); 

229 

230 
(*Apply a function definition to an argument, betareducing the result.*) 

231 
fun beta_comb cf x = 

232 
let val th1 = combination cf (reflexive x) 

233 
val th2 = beta_conversion false (crhs th1) 

234 
in transitive th1 th2 end; 

235 

236 
(*Apply a function definition to arguments, betareducing along the way.*) 

237 
fun list_combination cf [] = cf 

238 
 list_combination cf (x::xs) = list_combination (beta_comb cf x) xs; 

239 

240 
fun list_cabs ([] , t) = t 

241 
 list_cabs (v::vars, t) = Thm.cabs v (list_cabs(vars,t)); 

242 

20421  243 
fun assert_eta_free ct = 
20419  244 
let val t = term_of ct 
245 
in if (t aconv Envir.eta_contract t) then () 

246 
else error ("Eta redex in term: " ^ string_of_cterm ct) 

247 
end; 

248 

249 
(*Traverse a theorem, declaring abstraction function definitions. String s is the suggested 

250 
prefix for the constants. Resulting theory is returned in the first theorem. *) 

251 
fun declare_absfuns th = 

252 
let fun abstract thy ct = case term_of ct of 

253 
Abs (_,T,u) => 

254 
let val cname = gensym "abs_" 

20421  255 
val _ = assert_eta_free ct; 
20419  256 
val (cv,cta) = Thm.dest_abs NONE ct 
257 
val v = (#1 o dest_Free o term_of) cv 

258 
val (u'_th,defs) = abstract thy cta 

259 
val cu' = crhs u'_th 

260 
val abs_v_u = lambda (term_of cv) (term_of cu') 

261 
(*get the formal parameters: ALL variables free in the term*) 

262 
val args = term_frees abs_v_u 

263 
val Ts = map type_of args 

264 
val cT = Ts > (T > typ_of (ctyp_of_term cu')) 

265 
val thy = theory_of_thm u'_th 

266 
val c = Const (Sign.full_name thy cname, cT) 

267 
val thy = Theory.add_consts_i [(cname, cT, NoSyn)] thy 

268 
(*Theory is augmented with the constant, then its def*) 

269 
val rhs = list_abs_free (map dest_Free args, abs_v_u) 

270 
(*Forms a lambdaabstraction over the formal parameters*) 

271 
val cdef = cname ^ "_def" 

272 
val thy = Theory.add_defs_i false false [(cdef, equals cT $ c $ rhs)] thy 

273 
val def = #1 (Drule.freeze_thaw (get_axiom thy cdef)) 

274 
val def_args = list_combination def (map (cterm_of thy) args) 

275 
in (transitive (abstract_rule v cv u'_th) (symmetric def_args), 

276 
def :: defs) end 

277 
 (t1$t2) => 

278 
let val (ct1,ct2) = Thm.dest_comb ct 

279 
val (th1,defs1) = abstract thy ct1 

280 
val (th2,defs2) = abstract (theory_of_thm th1) ct2 

281 
in (combination th1 th2, defs1@defs2) end 

282 
 _ => (transfer thy (reflexive ct), []) 

283 
val _ = if !trace_abs then warning (string_of_thm th) else (); 

284 
val (eqth,defs) = abstract (theory_of_thm th) (cprop_of th) 

285 
val ths = equal_elim eqth th :: 

286 
map (forall_intr_vars o strip_lambdas o object_eq) defs 

287 
in (theory_of_thm eqth, ths) end; 

288 

289 
fun assume_absfuns th = 

290 
let val cterm = cterm_of (Thm.theory_of_thm th) 

291 
fun abstract vs ct = case term_of ct of 

292 
Abs (_,T,u) => 

293 
let val (cv,cta) = Thm.dest_abs NONE ct 

20421  294 
val _ = assert_eta_free ct; 
20419  295 
val v = (#1 o dest_Free o term_of) cv 
296 
val (u'_th,defs) = abstract (v::vs) cta 

297 
val cu' = crhs u'_th 

298 
val abs_v_u = Thm.cabs cv cu' 

299 
(*get the formal parameters: bound variables also present in the term*) 

300 
val args = filter (valid_name vs) (term_frees (term_of abs_v_u)) 

301 
val Ts = map type_of args 

302 
val const_ty = Ts > (T > typ_of (ctyp_of_term cu')) 

303 
val c = Free (gensym "abs_", const_ty) 

304 
val rhs = list_cabs (map cterm args, abs_v_u) 

305 
(*Forms a lambdaabstraction over the formal parameters*) 

306 
val def = assume (Thm.capply (cterm (equals const_ty $ c)) rhs) 

307 
val def_args = list_combination def (map cterm args) 

308 
in (transitive (abstract_rule v cv u'_th) (symmetric def_args), 

309 
def :: defs) end 

310 
 (t1$t2) => 

311 
let val (ct1,ct2) = Thm.dest_comb ct 

312 
val (t1',defs1) = abstract vs ct1 

313 
val (t2',defs2) = abstract vs ct2 

314 
in (combination t1' t2', defs1@defs2) end 

315 
 _ => (reflexive ct, []) 

316 
val (eqth,defs) = abstract [] (cprop_of th) 

317 
in equal_elim eqth th :: 

318 
map (forall_intr_vars o strip_lambdas o object_eq) defs 

319 
end; 

320 

16009  321 

322 
(*cterms are used throughout for efficiency*) 

18141
89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18009
diff
changeset

323 
val cTrueprop = Thm.cterm_of HOL.thy HOLogic.Trueprop; 
16009  324 

325 
(*cterm version of mk_cTrueprop*) 

326 
fun c_mkTrueprop A = Thm.capply cTrueprop A; 

327 

328 
(*Given an abstraction over n variables, replace the bound variables by free 

329 
ones. Return the body, along with the list of free variables.*) 

330 
fun c_variant_abs_multi (ct0, vars) = 

331 
let val (cv,ct) = Thm.dest_abs NONE ct0 

332 
in c_variant_abs_multi (ct, cv::vars) end 

333 
handle CTERM _ => (ct0, rev vars); 

334 

335 
(*Given the definition of a Skolem function, return a theorem to replace 

18141
89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18009
diff
changeset

336 
an existential formula by a use of that function. 
89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18009
diff
changeset

337 
Example: "EX x. x : A & x ~: B ==> sko A B : A & sko A B ~: B" [.] *) 
16588  338 
fun skolem_of_def def = 
20292
6f2b8ed987ec
removed obsolete Drule.freeze_all  now uses legacy Drule.freeze_thaw;
wenzelm
parents:
20071
diff
changeset

339 
let val (c,rhs) = Drule.dest_equals (cprop_of (#1 (Drule.freeze_thaw def))) 
16009  340 
val (ch, frees) = c_variant_abs_multi (rhs, []) 
18141
89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18009
diff
changeset

341 
val (chilbert,cabs) = Thm.dest_comb ch 
89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18009
diff
changeset

342 
val {sign,t, ...} = rep_cterm chilbert 
89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18009
diff
changeset

343 
val T = case t of Const ("Hilbert_Choice.Eps", Type("fun",[_,T])) => T 
89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18009
diff
changeset

344 
 _ => raise THM ("skolem_of_def: expected Eps", 0, [def]) 
16009  345 
val cex = Thm.cterm_of sign (HOLogic.exists_const T) 
346 
val ex_tm = c_mkTrueprop (Thm.capply cex cabs) 

347 
and conc = c_mkTrueprop (Drule.beta_conv cabs (Drule.list_comb(c,frees))); 

18141
89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18009
diff
changeset

348 
fun tacf [prem] = rewrite_goals_tac [def] THEN rtac (prem RS someI_ex) 1 
89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18009
diff
changeset

349 
in Goal.prove_raw [ex_tm] conc tacf 
89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18009
diff
changeset

350 
> forall_intr_list frees 
89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18009
diff
changeset

351 
> forall_elim_vars 0 (*Introduce Vars, but don't discharge defs.*) 
89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18009
diff
changeset

352 
> Thm.varifyT 
89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18009
diff
changeset

353 
end; 
16009  354 

18198
95330fc0ea8d
 combined common CNF functions used by HOL and FOL axioms, the difference between conversion of HOL and FOL theorems only comes in when theorems are converted to ResClause.clause or ResHolClause.clause format.
mengj
parents:
18144
diff
changeset

355 
(*Converts an Isabelle theorem (intro, elim or simp format) into nnf.*) 
95330fc0ea8d
 combined common CNF functions used by HOL and FOL axioms, the difference between conversion of HOL and FOL theorems only comes in when theorems are converted to ResClause.clause or ResHolClause.clause format.
mengj
parents:
18144
diff
changeset

356 
(*It now works for HOL too. *) 
18141
89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18009
diff
changeset

357 
fun to_nnf th = 
89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18009
diff
changeset

358 
th > transfer_to_Reconstruction 
20419  359 
> transform_elim > zero_var_indexes > Drule.freeze_thaw > #1 
16588  360 
> ObjectLogic.atomize_thm > make_nnf; 
16009  361 

362 
(*The cache prevents repeated clausification of a theorem, 

18510
0a6c24f549c3
the "skolem" attribute and better initialization of the clause database
paulson
parents:
18404
diff
changeset

363 
and also repeated declaration of Skolem functions*) 
0a6c24f549c3
the "skolem" attribute and better initialization of the clause database
paulson
parents:
18404
diff
changeset

364 
(* FIXME better use Termtab!? No, we MUST use theory data!!*) 
15955
87cf2ce8ede8
memoization of ResAxioms.cnf_axiom rather than of Reconstruction.clausify_rule
paulson
parents:
15872
diff
changeset

365 
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

366 

18141
89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18009
diff
changeset

367 

89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18009
diff
changeset

368 
(*Generate Skolem functions for a theorem supplied in nnf*) 
89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18009
diff
changeset

369 
fun skolem_of_nnf th = 
89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18009
diff
changeset

370 
map (skolem_of_def o assume o (cterm_of (theory_of_thm th))) (assume_skofuns th); 
89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18009
diff
changeset

371 

20419  372 
(*Replace lambdas by assumed function definitions in the theorems*) 
373 
fun assume_abstract ths = 

374 
if abstract_lambdas then List.concat (map (assume_absfuns o eta_conversion_rule) ths) 

375 
else map eta_conversion_rule ths; 

376 

377 
(*Replace lambdas by declared function definitions in the theorems*) 

378 
fun declare_abstract' (thy, []) = (thy, []) 

379 
 declare_abstract' (thy, th::ths) = 

380 
let val (thy', th_defs) = 

381 
th > zero_var_indexes > Drule.freeze_thaw > #1 

382 
> eta_conversion_rule > transfer thy > declare_absfuns 

383 
val (thy'', ths') = declare_abstract' (thy', ths) 

384 
in (thy'', th_defs @ ths') end; 

385 

20421  386 
(*FIXME DELETE if we decide to switch to abstractions*) 
20419  387 
fun declare_abstract (thy, ths) = 
388 
if abstract_lambdas then declare_abstract' (thy, ths) 

389 
else (thy, map eta_conversion_rule ths); 

390 

18510
0a6c24f549c3
the "skolem" attribute and better initialization of the clause database
paulson
parents:
18404
diff
changeset

391 
(*Skolemize a named theorem, with Skolem functions as additional premises.*) 
18198
95330fc0ea8d
 combined common CNF functions used by HOL and FOL axioms, the difference between conversion of HOL and FOL theorems only comes in when theorems are converted to ResClause.clause or ResHolClause.clause format.
mengj
parents:
18144
diff
changeset

392 
(*also works for HOL*) 
18141
89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18009
diff
changeset

393 
fun skolem_thm th = 
18510
0a6c24f549c3
the "skolem" attribute and better initialization of the clause database
paulson
parents:
18404
diff
changeset

394 
let val nnfth = to_nnf th 
20419  395 
in Meson.make_cnf (skolem_of_nnf nnfth) nnfth 
396 
> assume_abstract > Meson.finish_cnf > rm_redundant_cls 

18510
0a6c24f549c3
the "skolem" attribute and better initialization of the clause database
paulson
parents:
18404
diff
changeset

397 
end 
0a6c24f549c3
the "skolem" attribute and better initialization of the clause database
paulson
parents:
18404
diff
changeset

398 
handle THM _ => []; 
18141
89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18009
diff
changeset

399 

18510
0a6c24f549c3
the "skolem" attribute and better initialization of the clause database
paulson
parents:
18404
diff
changeset

400 
(*Declare Skolem functions for a theorem, supplied in nnf and with its name. 
0a6c24f549c3
the "skolem" attribute and better initialization of the clause database
paulson
parents:
18404
diff
changeset

401 
It returns a modified theory, unless skolemization fails.*) 
16009  402 
fun skolem thy (name,th) = 
20419  403 
let val cname = (case name of "" => gensym ""  s => Sign.base_name s) 
404 
val _ = Output.debug ("skolemizing " ^ name ^ ": ") 

18141
89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18009
diff
changeset

405 
in Option.map 
89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18009
diff
changeset

406 
(fn nnfth => 
89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18009
diff
changeset

407 
let val (thy',defs) = declare_skofuns cname nnfth thy 
20419  408 
val cnfs = Meson.make_cnf (map skolem_of_def defs) nnfth 
409 
val (thy'',cnfs') = declare_abstract (thy',cnfs) 

410 
in (thy'', rm_redundant_cls (Meson.finish_cnf cnfs')) 

411 
end) 

18198
95330fc0ea8d
 combined common CNF functions used by HOL and FOL axioms, the difference between conversion of HOL and FOL theorems only comes in when theorems are converted to ResClause.clause or ResHolClause.clause format.
mengj
parents:
18144
diff
changeset

412 
(SOME (to_nnf th) handle THM _ => NONE) 
18141
89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18009
diff
changeset

413 
end; 
16009  414 

18510
0a6c24f549c3
the "skolem" attribute and better initialization of the clause database
paulson
parents:
18404
diff
changeset

415 
(*Populate the clause cache using the supplied theorem. Return the clausal form 
0a6c24f549c3
the "skolem" attribute and better initialization of the clause database
paulson
parents:
18404
diff
changeset

416 
and modified theory.*) 
0a6c24f549c3
the "skolem" attribute and better initialization of the clause database
paulson
parents:
18404
diff
changeset

417 
fun skolem_cache_thm ((name,th), thy) = 
18144
4edcb5fdc3b0
duplicate axioms in ATP linkup, and general fixes
paulson
parents:
18141
diff
changeset

418 
case Symtab.lookup (!clause_cache) name of 
4edcb5fdc3b0
duplicate axioms in ATP linkup, and general fixes
paulson
parents:
18141
diff
changeset

419 
NONE => 
4edcb5fdc3b0
duplicate axioms in ATP linkup, and general fixes
paulson
parents:
18141
diff
changeset

420 
(case skolem thy (name, Thm.transfer thy th) of 
18510
0a6c24f549c3
the "skolem" attribute and better initialization of the clause database
paulson
parents:
18404
diff
changeset

421 
NONE => ([th],thy) 
18144
4edcb5fdc3b0
duplicate axioms in ATP linkup, and general fixes
paulson
parents:
18141
diff
changeset

422 
 SOME (thy',cls) => 
18510
0a6c24f549c3
the "skolem" attribute and better initialization of the clause database
paulson
parents:
18404
diff
changeset

423 
(change clause_cache (Symtab.update (name, (th, cls))); (cls,thy'))) 
18144
4edcb5fdc3b0
duplicate axioms in ATP linkup, and general fixes
paulson
parents:
18141
diff
changeset

424 
 SOME (th',cls) => 
18510
0a6c24f549c3
the "skolem" attribute and better initialization of the clause database
paulson
parents:
18404
diff
changeset

425 
if eq_thm(th,th') then (cls,thy) 
19232  426 
else (Output.debug ("skolem_cache: Ignoring variant of theorem " ^ name); 
427 
Output.debug (string_of_thm th); 

428 
Output.debug (string_of_thm th'); 

18510
0a6c24f549c3
the "skolem" attribute and better initialization of the clause database
paulson
parents:
18404
diff
changeset

429 
([th],thy)); 
0a6c24f549c3
the "skolem" attribute and better initialization of the clause database
paulson
parents:
18404
diff
changeset

430 

0a6c24f549c3
the "skolem" attribute and better initialization of the clause database
paulson
parents:
18404
diff
changeset

431 
fun skolem_cache ((name,th), thy) = #2 (skolem_cache_thm ((name,th), thy)); 
18141
89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18009
diff
changeset

432 

16009  433 

434 
(*Exported function to convert Isabelle theorems into axiom clauses*) 

19894  435 
fun cnf_axiom (name,th) = 
18144
4edcb5fdc3b0
duplicate axioms in ATP linkup, and general fixes
paulson
parents:
18141
diff
changeset

436 
case name of 
19894  437 
"" => skolem_thm th (*no name, so can't cache*) 
18144
4edcb5fdc3b0
duplicate axioms in ATP linkup, and general fixes
paulson
parents:
18141
diff
changeset

438 
 s => case Symtab.lookup (!clause_cache) s of 
4edcb5fdc3b0
duplicate axioms in ATP linkup, and general fixes
paulson
parents:
18141
diff
changeset

439 
NONE => 
19894  440 
let val cls = skolem_thm th 
18144
4edcb5fdc3b0
duplicate axioms in ATP linkup, and general fixes
paulson
parents:
18141
diff
changeset

441 
in change clause_cache (Symtab.update (s, (th, cls))); cls end 
4edcb5fdc3b0
duplicate axioms in ATP linkup, and general fixes
paulson
parents:
18141
diff
changeset

442 
 SOME(th',cls) => 
4edcb5fdc3b0
duplicate axioms in ATP linkup, and general fixes
paulson
parents:
18141
diff
changeset

443 
if eq_thm(th,th') then cls 
19232  444 
else (Output.debug ("cnf_axiom: duplicate or variant of theorem " ^ name); 
445 
Output.debug (string_of_thm th); 

446 
Output.debug (string_of_thm th'); 

18144
4edcb5fdc3b0
duplicate axioms in ATP linkup, and general fixes
paulson
parents:
18141
diff
changeset

447 
cls); 
15347  448 

18141
89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18009
diff
changeset

449 
fun pairname th = (Thm.name_of_thm th, th); 
89e2e8bed08f
Skolemization by inference, but not quite finished
paulson
parents:
18009
diff
changeset

450 

15956  451 
fun meta_cnf_axiom th = 
452 
map Meson.make_meta_clause (cnf_axiom (pairname th)); 

15499  453 

15347  454 

15872  455 
(**** Extract and Clausify theorems from a theory's claset and simpset ****) 
15347  456 

17404
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17279
diff
changeset

457 
(*Preserve the name of "th" after the transformation "f"*) 
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17279
diff
changeset

458 
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

459 

17484
f6a225f97f0a
simplification of the IsabelleATP code; hooks for batch generation of problems
paulson
parents:
17412
diff
changeset

460 
fun rules_of_claset cs = 
f6a225f97f0a
simplification of the IsabelleATP code; hooks for batch generation of problems
paulson
parents:
17412
diff
changeset

461 
let val {safeIs,safeEs,hazIs,hazEs,...} = rep_cs cs 
19175  462 
val intros = safeIs @ hazIs 
18532  463 
val elims = map Classical.classical_rule (safeEs @ hazEs) 
17404
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17279
diff
changeset

464 
in 
18680  465 
Output.debug ("rules_of_claset intros: " ^ Int.toString(length intros) ^ 
17484
f6a225f97f0a
simplification of the IsabelleATP code; hooks for batch generation of problems
paulson
parents:
17412
diff
changeset

466 
" elims: " ^ Int.toString(length elims)); 
20017
a2070352371c
made the conversion of elimination rules more robust
paulson
parents:
19894
diff
changeset

467 
map pairname (intros @ elims) 
17404
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17279
diff
changeset

468 
end; 
15347  469 

17484
f6a225f97f0a
simplification of the IsabelleATP code; hooks for batch generation of problems
paulson
parents:
17412
diff
changeset

470 
fun rules_of_simpset ss = 
f6a225f97f0a
simplification of the IsabelleATP code; hooks for batch generation of problems
paulson
parents:
17412
diff
changeset

471 
let val ({rules,...}, _) = rep_ss ss 
f6a225f97f0a
simplification of the IsabelleATP code; hooks for batch generation of problems
paulson
parents:
17412
diff
changeset

472 
val simps = Net.entries rules 
f6a225f97f0a
simplification of the IsabelleATP code; hooks for batch generation of problems
paulson
parents:
17412
diff
changeset

473 
in 
18680  474 
Output.debug ("rules_of_simpset: " ^ Int.toString(length simps)); 
17484
f6a225f97f0a
simplification of the IsabelleATP code; hooks for batch generation of problems
paulson
parents:
17412
diff
changeset

475 
map (fn r => (#name r, #thm r)) simps 
f6a225f97f0a
simplification of the IsabelleATP code; hooks for batch generation of problems
paulson
parents:
17412
diff
changeset

476 
end; 
f6a225f97f0a
simplification of the IsabelleATP code; hooks for batch generation of problems
paulson
parents:
17412
diff
changeset

477 

f6a225f97f0a
simplification of the IsabelleATP code; hooks for batch generation of problems
paulson
parents:
17412
diff
changeset

478 
fun claset_rules_of_thy thy = rules_of_claset (claset_of thy); 
f6a225f97f0a
simplification of the IsabelleATP code; hooks for batch generation of problems
paulson
parents:
17412
diff
changeset

479 
fun simpset_rules_of_thy thy = rules_of_simpset (simpset_of thy); 
f6a225f97f0a
simplification of the IsabelleATP code; hooks for batch generation of problems
paulson
parents:
17412
diff
changeset

480 

19196
62ee8c10d796
Added functions to retrieve local and global atpset rules.
mengj
parents:
19175
diff
changeset

481 
fun atpset_rules_of_thy thy = map pairname (ResAtpSet.atp_rules_of_thy thy); 
62ee8c10d796
Added functions to retrieve local and global atpset rules.
mengj
parents:
19175
diff
changeset

482 

62ee8c10d796
Added functions to retrieve local and global atpset rules.
mengj
parents:
19175
diff
changeset

483 

17484
f6a225f97f0a
simplification of the IsabelleATP code; hooks for batch generation of problems
paulson
parents:
17412
diff
changeset

484 
fun claset_rules_of_ctxt ctxt = rules_of_claset (local_claset_of ctxt); 
f6a225f97f0a
simplification of the IsabelleATP code; hooks for batch generation of problems
paulson
parents:
17412
diff
changeset

485 
fun simpset_rules_of_ctxt ctxt = rules_of_simpset (local_simpset_of ctxt); 
15347  486 

19196
62ee8c10d796
Added functions to retrieve local and global atpset rules.
mengj
parents:
19175
diff
changeset

487 
fun atpset_rules_of_ctxt ctxt = map pairname (ResAtpSet.atp_rules_of_ctxt ctxt); 
15347  488 

15872  489 
(**** Translate a set of classical/simplifier rules into CNF (still as type "thm") ****) 
15347  490 

19894  491 
(* classical rules: works for both FOL and HOL *) 
492 
fun cnf_rules [] err_list = ([],err_list) 

493 
 cnf_rules ((name,th) :: ths) err_list = 

494 
let val (ts,es) = cnf_rules ths err_list 

17404
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17279
diff
changeset

495 
in (cnf_axiom (name,th) :: ts,es) handle _ => (ts, (th::es)) end; 
15347  496 

19894  497 
fun pair_name_cls k (n, []) = [] 
498 
 pair_name_cls k (n, cls::clss) = (cls, (n,k)) :: pair_name_cls (k+1) (n, clss) 

499 

500 
fun cnf_rules_pairs_aux pairs [] = pairs 

501 
 cnf_rules_pairs_aux pairs ((name,th)::ths) = 

502 
let val pairs' = (pair_name_cls 0 (name, cnf_axiom(name,th))) :: pairs 

503 
handle THM _ => pairs  ResClause.CLAUSE _ => pairs 

504 
 ResHolClause.LAM2COMB _ => pairs 

505 
in cnf_rules_pairs_aux pairs' ths end; 

19353  506 

19894  507 
val cnf_rules_pairs = cnf_rules_pairs_aux []; 
19353  508 

19196
62ee8c10d796
Added functions to retrieve local and global atpset rules.
mengj
parents:
19175
diff
changeset

509 

18198
95330fc0ea8d
 combined common CNF functions used by HOL and FOL axioms, the difference between conversion of HOL and FOL theorems only comes in when theorems are converted to ResClause.clause or ResHolClause.clause format.
mengj
parents:
18144
diff
changeset

510 
(**** Convert all theorems of a claset/simpset into clauses (ResClause.clause, or ResHolClause.clause) ****) 
15347  511 

20419  512 
(*Setup function: takes a theory and installs ALL known theorems into the clause cache*) 
513 
fun clause_cache_setup thy = List.foldl skolem_cache thy (PureThy.all_thms_of thy); 

16009  514 

16563  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 = 

18708  525 
Method.add_methods 
526 
[("meson", Method.thms_ctxt_args meson_meth, 

18833  527 
"MESON resolution proof procedure")]; 
15347  528 

18510
0a6c24f549c3
the "skolem" attribute and better initialization of the clause database
paulson
parents:
18404
diff
changeset

529 

0a6c24f549c3
the "skolem" attribute and better initialization of the clause database
paulson
parents:
18404
diff
changeset

530 

0a6c24f549c3
the "skolem" attribute and better initialization of the clause database
paulson
parents:
18404
diff
changeset

531 
(*** The Skolemization attribute ***) 
0a6c24f549c3
the "skolem" attribute and better initialization of the clause database
paulson
parents:
18404
diff
changeset

532 

0a6c24f549c3
the "skolem" attribute and better initialization of the clause database
paulson
parents:
18404
diff
changeset

533 
fun conj2_rule (th1,th2) = conjI OF [th1,th2]; 
0a6c24f549c3
the "skolem" attribute and better initialization of the clause database
paulson
parents:
18404
diff
changeset

534 

0a6c24f549c3
the "skolem" attribute and better initialization of the clause database
paulson
parents:
18404
diff
changeset

535 
(*Conjoin a list of clauses to recreate a single theorem*) 
0a6c24f549c3
the "skolem" attribute and better initialization of the clause database
paulson
parents:
18404
diff
changeset

536 
val conj_rule = foldr1 conj2_rule; 
0a6c24f549c3
the "skolem" attribute and better initialization of the clause database
paulson
parents:
18404
diff
changeset

537 

20419  538 
fun skolem_attr (Context.Theory thy, th) = 
539 
let val name = Thm.name_of_thm th 

540 
val (cls, thy') = skolem_cache_thm ((name, th), thy) 

18728  541 
in (Context.Theory thy', conj_rule cls) end 
20419  542 
 skolem_attr (context, th) = (context, conj_rule (skolem_thm th)); 
18510
0a6c24f549c3
the "skolem" attribute and better initialization of the clause database
paulson
parents:
18404
diff
changeset

543 

0a6c24f549c3
the "skolem" attribute and better initialization of the clause database
paulson
parents:
18404
diff
changeset

544 
val setup_attrs = Attrib.add_attributes 
20419  545 
[("skolem", Attrib.no_args skolem_attr, "skolemization of a theorem")]; 
18510
0a6c24f549c3
the "skolem" attribute and better initialization of the clause database
paulson
parents:
18404
diff
changeset

546 

18708  547 
val setup = clause_cache_setup #> setup_attrs; 
18510
0a6c24f549c3
the "skolem" attribute and better initialization of the clause database
paulson
parents:
18404
diff
changeset

548 

15347  549 
end; 