author  mengj 
Thu, 25 May 2006 08:08:38 +0200  
changeset 19719  837025cc6317 
parent 19642  ea7162f84677 
child 20015  1ffcf4802802 
permissions  rwrr 
15347  1 
(* Author: Jia Meng, Cambridge University Computer Laboratory 
2 
ID: $Id$ 

3 
Copyright 2004 University of Cambridge 

4 

5 
ML data structure for storing/printing FOL clauses and arity clauses. 

6 
Typed equality is treated differently. 

7 
*) 

8 

9 
signature RES_CLAUSE = 

10 
sig 

18868  11 
exception CLAUSE of string * term 
12 
type clause and arityClause and classrelClause 

13 
type fol_type 

14 
type typ_var 

15 
type type_literal 

16 
val add_typs_aux : (typ_var * string list) list > type_literal list * type_literal list 

17 
val arity_clause_thy: theory > arityClause list 

18 
val ascii_of : string > string 

19 
val bracket_pack : string list > string 

20 
val check_var_pairs: ''a * ''b > (''a * ''b) list > int 

21 
val classrel_clauses_thy: theory > classrelClause list 

22 
val clause_eq : clause * clause > bool 

23 
val clause_prefix : string 

24 
val clause2tptp : clause > string * string list 

25 
val const_prefix : string 

19719  26 
val dfg_write_file: thm list > string > ((thm * (string * int)) list * classrelClause list * arityClause list) > unit 
18868  27 
val fixed_var_prefix : string 
28 
val gen_tptp_cls : int * string * string * string > string 

29 
val gen_tptp_type_cls : int * string * string * string * int > string 

30 
val get_axiomName : clause > string 

31 
val hash_clause : clause > int 

32 
val init : theory > unit 

33 
val isMeta : string > bool 

34 
val isTaut : clause > bool 

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

35 
val keep_types : bool ref 
18868  36 
val list_ord : ('a * 'b > order) > 'a list * 'b list > order 
19443
e32a4703d834
Take conjectures and axioms as thms when convert them to ResClause.clause format.
mengj
parents:
19354
diff
changeset

37 
val make_axiom_clause : thm > string * int > clause option 
e32a4703d834
Take conjectures and axioms as thms when convert them to ResClause.clause format.
mengj
parents:
19354
diff
changeset

38 
val make_conjecture_clauses : thm list > clause list 
18868  39 
val make_fixed_const : string > string 
40 
val make_fixed_type_const : string > string 

41 
val make_fixed_type_var : string > string 

42 
val make_fixed_var : string > string 

43 
val make_schematic_type_var : string * int > string 

44 
val make_schematic_var : string * int > string 

45 
val make_type_class : string > string 

46 
val mk_fol_type: string * string * fol_type list > fol_type 

47 
val mk_typ_var_sort : Term.typ > typ_var * sort 

48 
val paren_pack : string list > string 

49 
val schematic_var_prefix : string 

50 
val special_equal : bool ref 

51 
val string_of_fol_type : fol_type > string 

52 
val tconst_prefix : string 

53 
val tfree_prefix : string 

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

54 
val tptp_arity_clause : arityClause > string 
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset

55 
val tptp_classrelClause : classrelClause > string 
18868  56 
val tptp_of_typeLit : type_literal > string 
18863  57 
val tptp_tfree_clause : string > string 
19443
e32a4703d834
Take conjectures and axioms as thms when convert them to ResClause.clause format.
mengj
parents:
19354
diff
changeset

58 
val tptp_write_file: thm list > string > ((thm * (string * int)) list * classrelClause list * arityClause list) > unit 
17404
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset

59 
val tvar_prefix : string 
18868  60 
val types_eq: fol_type list * fol_type list > (string*string) list * (string*string) list > bool * ((string*string) list * (string*string) list) 
61 
val types_ord : fol_type list * fol_type list > order 

17908
ac97527724ba
More functions are added to the signature of ResClause
mengj
parents:
17888
diff
changeset

62 
val union_all : ''a list list > ''a list 
18863  63 
val writeln_strs: TextIO.outstream > TextIO.vector list > unit 
19719  64 
val dfg_sign: bool > string > string 
65 
val dfg_of_typeLit: type_literal > string 

66 
val get_tvar_strs: (typ_var * sort) list > string list 

67 
val gen_dfg_cls: int * string * string * string * string list > string 

68 
val add_foltype_funcs: fol_type * int Symtab.table > int Symtab.table 

69 
val add_arityClause_funcs: arityClause * int Symtab.table > int Symtab.table 

70 
val add_arityClause_preds: arityClause * int Symtab.table > int Symtab.table 

71 
val add_classrelClause_preds : classrelClause * int Symtab.table > int Symtab.table 

72 
val dfg_tfree_clause : string > string 

73 
val string_of_start: string > string 

74 
val string_of_descrip : string > string 

75 
val string_of_symbols: string > string > string 

76 
val string_of_funcs: (string * int) list > string 

77 
val string_of_preds: (string * Int.int) list > string 

78 
val dfg_classrelClause: classrelClause > string 

79 
val dfg_arity_clause: arityClause > string 

80 
end; 

15347  81 

18420
9470061ab283
hashing to eliminate the output of duplicate clauses
paulson
parents:
18411
diff
changeset

82 
structure ResClause : RES_CLAUSE = 
15347  83 
struct 
84 

85 
(* Added for typed equality *) 

86 
val special_equal = ref false; (* by default,equality does not carry type information *) 

87 
val eq_typ_wrapper = "typeinfo"; (* default string *) 

88 

89 

90 
val schematic_var_prefix = "V_"; 

91 
val fixed_var_prefix = "v_"; 

92 

17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset

93 
val tvar_prefix = "T_"; 
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset

94 
val tfree_prefix = "t_"; 
15347  95 

96 
val clause_prefix = "cls_"; 

17525
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset

97 
val arclause_prefix = "clsarity_" 
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset

98 
val clrelclause_prefix = "clsrel_"; 
15347  99 

17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset

100 
val const_prefix = "c_"; 
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset

101 
val tconst_prefix = "tc_"; 
16199
ee95ab217fee
no longer emits literals for type class HOL.type; also minor tidying
paulson
parents:
16039
diff
changeset

102 
val class_prefix = "class_"; 
15347  103 

17775  104 
fun union_all xss = foldl (op union) [] xss; 
105 

106 
(*Provide readable names for the more common symbolic functions*) 

15347  107 
val const_trans_table = 
108 
Symtab.make [("op =", "equal"), 

19277  109 
("Orderings.less_eq", "lessequals"), 
110 
("Orderings.less", "less"), 

15347  111 
("op &", "and"), 
112 
("op ", "or"), 

19233
77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19207
diff
changeset

113 
("HOL.plus", "plus"), 
77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19207
diff
changeset

114 
("HOL.minus", "minus"), 
77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19207
diff
changeset

115 
("HOL.times", "times"), 
18676  116 
("Divides.op div", "div"), 
117 
("HOL.divide", "divide"), 

15347  118 
("op >", "implies"), 
17375  119 
("{}", "emptyset"), 
15347  120 
("op :", "in"), 
121 
("op Un", "union"), 

18390  122 
("op Int", "inter"), 
123 
("List.op @", "append")]; 

15347  124 

17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset

125 
val type_const_trans_table = 
18411
2d3165a0fb40
No axiom, arity or classrel clauses contain HOL.type. Negative occurrences are
paulson
parents:
18409
diff
changeset

126 
Symtab.make [("*", "prod"), 
2d3165a0fb40
No axiom, arity or classrel clauses contain HOL.type. Negative occurrences are
paulson
parents:
18409
diff
changeset

127 
("+", "sum"), 
2d3165a0fb40
No axiom, arity or classrel clauses contain HOL.type. Negative occurrences are
paulson
parents:
18409
diff
changeset

128 
("~=>", "map")]; 
15347  129 

15610  130 
(*Escaping of special characters. 
131 
Alphanumeric characters are left unchanged. 

132 
The character _ goes to __ 

133 
Characters in the range ASCII space to / go to _A to _P, respectively. 

134 
Other printing characters go to _NNN where NNN is the decimal ASCII code.*) 

135 
local 

136 

137 
val A_minus_space = Char.ord #"A"  Char.ord #" "; 

138 

15347  139 
fun ascii_of_c c = 
15610  140 
if Char.isAlphaNum c then String.str c 
141 
else if c = #"_" then "__" 

142 
else if #" " <= c andalso c <= #"/" 

143 
then "_" ^ String.str (Char.chr (Char.ord c + A_minus_space)) 

144 
else if Char.isPrint c then ("_" ^ Int.toString (Char.ord c)) 

145 
else "" 

15347  146 

15610  147 
in 
148 

149 
val ascii_of = String.translate ascii_of_c; 

150 

151 
end; 

15347  152 

17525
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset

153 
(* convert a list of strings into one single string; surrounded by brackets *) 
18218
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset

154 
fun paren_pack [] = "" (*empty argument list*) 
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset

155 
 paren_pack strings = "(" ^ commas strings ^ ")"; 
17525
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset

156 

ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset

157 
fun bracket_pack strings = "[" ^ commas strings ^ "]"; 
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset

158 

ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset

159 

16925
0fd7b1438d28
simpler variable names, and no types for monomorphic constants
paulson
parents:
16903
diff
changeset

160 
(*Remove the initial ' character from a type variable, if it is present*) 
0fd7b1438d28
simpler variable names, and no types for monomorphic constants
paulson
parents:
16903
diff
changeset

161 
fun trim_type_var s = 
0fd7b1438d28
simpler variable names, and no types for monomorphic constants
paulson
parents:
16903
diff
changeset

162 
if s <> "" andalso String.sub(s,0) = #"'" then String.extract(s,1,NONE) 
0fd7b1438d28
simpler variable names, and no types for monomorphic constants
paulson
parents:
16903
diff
changeset

163 
else error ("trim_type: Malformed type variable encountered: " ^ s); 
0fd7b1438d28
simpler variable names, and no types for monomorphic constants
paulson
parents:
16903
diff
changeset

164 

16903  165 
fun ascii_of_indexname (v,0) = ascii_of v 
17525
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset

166 
 ascii_of_indexname (v,i) = ascii_of v ^ "_" ^ Int.toString i; 
15347  167 

17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset

168 
fun make_schematic_var v = schematic_var_prefix ^ (ascii_of_indexname v); 
15347  169 
fun make_fixed_var x = fixed_var_prefix ^ (ascii_of x); 
170 

16925
0fd7b1438d28
simpler variable names, and no types for monomorphic constants
paulson
parents:
16903
diff
changeset

171 
fun make_schematic_type_var (x,i) = 
0fd7b1438d28
simpler variable names, and no types for monomorphic constants
paulson
parents:
16903
diff
changeset

172 
tvar_prefix ^ (ascii_of_indexname (trim_type_var x,i)); 
0fd7b1438d28
simpler variable names, and no types for monomorphic constants
paulson
parents:
16903
diff
changeset

173 
fun make_fixed_type_var x = tfree_prefix ^ (ascii_of (trim_type_var x)); 
15347  174 

18411
2d3165a0fb40
No axiom, arity or classrel clauses contain HOL.type. Negative occurrences are
paulson
parents:
18409
diff
changeset

175 
fun lookup_const c = 
17412  176 
case Symtab.lookup const_trans_table c of 
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset

177 
SOME c' => c' 
18411
2d3165a0fb40
No axiom, arity or classrel clauses contain HOL.type. Negative occurrences are
paulson
parents:
18409
diff
changeset

178 
 NONE => ascii_of c; 
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset

179 

18411
2d3165a0fb40
No axiom, arity or classrel clauses contain HOL.type. Negative occurrences are
paulson
parents:
18409
diff
changeset

180 
fun lookup_type_const c = 
17412  181 
case Symtab.lookup type_const_trans_table c of 
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset

182 
SOME c' => c' 
18411
2d3165a0fb40
No axiom, arity or classrel clauses contain HOL.type. Negative occurrences are
paulson
parents:
18409
diff
changeset

183 
 NONE => ascii_of c; 
2d3165a0fb40
No axiom, arity or classrel clauses contain HOL.type. Negative occurrences are
paulson
parents:
18409
diff
changeset

184 

2d3165a0fb40
No axiom, arity or classrel clauses contain HOL.type. Negative occurrences are
paulson
parents:
18409
diff
changeset

185 
fun make_fixed_const "op =" = "equal" (*MUST BE "equal" because it's builtin to ATPs*) 
2d3165a0fb40
No axiom, arity or classrel clauses contain HOL.type. Negative occurrences are
paulson
parents:
18409
diff
changeset

186 
 make_fixed_const c = const_prefix ^ lookup_const c; 
2d3165a0fb40
No axiom, arity or classrel clauses contain HOL.type. Negative occurrences are
paulson
parents:
18409
diff
changeset

187 

2d3165a0fb40
No axiom, arity or classrel clauses contain HOL.type. Negative occurrences are
paulson
parents:
18409
diff
changeset

188 
fun make_fixed_type_const c = tconst_prefix ^ lookup_type_const c; 
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset

189 

17261  190 
fun make_type_class clas = class_prefix ^ ascii_of clas; 
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset

191 

ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset

192 

18798  193 
(***** definitions and functions for FOL clauses, for conversion to TPTP or DFG format. *****) 
15347  194 

17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset

195 
val keep_types = ref true; 
15347  196 

197 
datatype kind = Axiom  Hypothesis  Conjecture; 

198 
fun name_of_kind Axiom = "axiom" 

199 
 name_of_kind Hypothesis = "hypothesis" 

200 
 name_of_kind Conjecture = "conjecture"; 

201 

202 
type clause_id = int; 

203 
type axiom_name = string; 

204 

205 

206 
type polarity = bool; 

207 

18869
00741f7280f7
removal of ResClause.num_of_clauses and other simplifications
paulson
parents:
18868
diff
changeset

208 
(* "tag" is used for vampire specific syntax FIXME REMOVE *) 
15347  209 
type tag = bool; 
210 

211 

212 
(**** Isabelle FOL clauses ****) 

213 

214 
val tagged = ref false; 

215 

216 
type pred_name = string; 

18402
aaba095cf62b
1. changed fol_type, it's not a string type anymore.
mengj
parents:
18390
diff
changeset

217 

aaba095cf62b
1. changed fol_type, it's not a string type anymore.
mengj
parents:
18390
diff
changeset

218 
datatype typ_var = FOLTVar of indexname  FOLTFree of string; 
aaba095cf62b
1. changed fol_type, it's not a string type anymore.
mengj
parents:
18390
diff
changeset

219 

18798  220 
(*FIXME: give the constructors more sensible names*) 
18402
aaba095cf62b
1. changed fol_type, it's not a string type anymore.
mengj
parents:
18390
diff
changeset

221 
datatype fol_type = AtomV of string 
aaba095cf62b
1. changed fol_type, it's not a string type anymore.
mengj
parents:
18390
diff
changeset

222 
 AtomF of string 
aaba095cf62b
1. changed fol_type, it's not a string type anymore.
mengj
parents:
18390
diff
changeset

223 
 Comp of string * fol_type list; 
aaba095cf62b
1. changed fol_type, it's not a string type anymore.
mengj
parents:
18390
diff
changeset

224 

aaba095cf62b
1. changed fol_type, it's not a string type anymore.
mengj
parents:
18390
diff
changeset

225 
fun string_of_fol_type (AtomV x) = x 
aaba095cf62b
1. changed fol_type, it's not a string type anymore.
mengj
parents:
18390
diff
changeset

226 
 string_of_fol_type (AtomF x) = x 
aaba095cf62b
1. changed fol_type, it's not a string type anymore.
mengj
parents:
18390
diff
changeset

227 
 string_of_fol_type (Comp(tcon,tps)) = 
18856
4669dec681f4
tidyup of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset

228 
tcon ^ (paren_pack (map string_of_fol_type tps)); 
4669dec681f4
tidyup of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset

229 

18439
4b517881ac7e
Added functions for fol_type; also put some functions to the signature, used by ResHolClause.
mengj
parents:
18420
diff
changeset

230 
fun mk_fol_type ("Var",x,_) = AtomV(x) 
4b517881ac7e
Added functions for fol_type; also put some functions to the signature, used by ResHolClause.
mengj
parents:
18420
diff
changeset

231 
 mk_fol_type ("Fixed",x,_) = AtomF(x) 
4b517881ac7e
Added functions for fol_type; also put some functions to the signature, used by ResHolClause.
mengj
parents:
18420
diff
changeset

232 
 mk_fol_type ("Comp",con,args) = Comp(con,args) 
4b517881ac7e
Added functions for fol_type; also put some functions to the signature, used by ResHolClause.
mengj
parents:
18420
diff
changeset

233 

4b517881ac7e
Added functions for fol_type; also put some functions to the signature, used by ResHolClause.
mengj
parents:
18420
diff
changeset

234 

18798  235 
(*First string is the type class; the second is a TVar or TFfree*) 
236 
datatype type_literal = LTVar of string * string  LTFree of string * string; 

15347  237 

18856
4669dec681f4
tidyup of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset

238 
datatype fol_term = UVar of string * fol_type 
4669dec681f4
tidyup of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset

239 
 Fun of string * fol_type list * fol_term list; 
4669dec681f4
tidyup of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset

240 
datatype predicate = Predicate of pred_name * fol_type list * fol_term list; 
15347  241 

242 
datatype literal = Literal of polarity * predicate * tag; 

243 

17999  244 
fun mk_typ_var_sort (TFree(a,s)) = (FOLTFree a,s) 
245 
 mk_typ_var_sort (TVar(v,s)) = (FOLTVar v,s); 

246 

247 

18856
4669dec681f4
tidyup of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset

248 
(*A clause has firstorder literals and other, typerelated literals*) 
15347  249 
datatype clause = 
250 
Clause of {clause_id: clause_id, 

251 
axiom_name: axiom_name, 

19447  252 
th: thm, 
15347  253 
kind: kind, 
254 
literals: literal list, 

18869
00741f7280f7
removal of ResClause.num_of_clauses and other simplifications
paulson
parents:
18868
diff
changeset

255 
types_sorts: (typ_var * sort) list}; 
00741f7280f7
removal of ResClause.num_of_clauses and other simplifications
paulson
parents:
18868
diff
changeset

256 

00741f7280f7
removal of ResClause.num_of_clauses and other simplifications
paulson
parents:
18868
diff
changeset

257 
fun get_axiomName (Clause cls) = #axiom_name cls; 
15347  258 

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

259 
exception CLAUSE of string * term; 
15347  260 

18856
4669dec681f4
tidyup of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset

261 
fun isFalse (Literal (pol,Predicate(pname,_,[]),_)) = 
4669dec681f4
tidyup of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset

262 
(pol andalso pname = "c_False") orelse 
4669dec681f4
tidyup of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset

263 
(not pol andalso pname = "c_True") 
17317
3f12de2e2e6e
IsabelleATP link: sortable axiom names; no spaces in switches; general tidying
paulson
parents:
17312
diff
changeset

264 
 isFalse _ = false; 
3f12de2e2e6e
IsabelleATP link: sortable axiom names; no spaces in switches; general tidying
paulson
parents:
17312
diff
changeset

265 

18856
4669dec681f4
tidyup of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset

266 
fun isTrue (Literal (pol,Predicate(pname,_,[]),_)) = 
4669dec681f4
tidyup of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset

267 
(pol andalso pname = "c_True") orelse 
4669dec681f4
tidyup of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset

268 
(not pol andalso pname = "c_False") 
17404
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset

269 
 isTrue _ = false; 
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset

270 

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

271 
fun isTaut (Clause {literals,...}) = exists isTrue literals; 
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset

272 

19447  273 
fun make_clause (clause_id, axiom_name, th, kind, literals, types_sorts) = 
17317
3f12de2e2e6e
IsabelleATP link: sortable axiom names; no spaces in switches; general tidying
paulson
parents:
17312
diff
changeset

274 
if forall isFalse literals 
17234  275 
then error "Problem too trivial for resolution (empty clause)" 
276 
else 

19447  277 
Clause {clause_id = clause_id, axiom_name = axiom_name, 
278 
th = th, kind = kind, 

18869
00741f7280f7
removal of ResClause.num_of_clauses and other simplifications
paulson
parents:
18868
diff
changeset

279 
literals = literals, types_sorts = types_sorts}; 
17317
3f12de2e2e6e
IsabelleATP link: sortable axiom names; no spaces in switches; general tidying
paulson
parents:
17312
diff
changeset

280 

3f12de2e2e6e
IsabelleATP link: sortable axiom names; no spaces in switches; general tidying
paulson
parents:
17312
diff
changeset

281 

18218
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset

282 
(*Declarations of the current theoryto allow suppressing types.*) 
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset

283 
val const_typargs = ref (Library.K [] : (string*typ > typ list)); 
17317
3f12de2e2e6e
IsabelleATP link: sortable axiom names; no spaces in switches; general tidying
paulson
parents:
17312
diff
changeset

284 

18218
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset

285 
fun num_typargs(s,T) = if !keep_types then length (!const_typargs (s,T)) else 0; 
16925
0fd7b1438d28
simpler variable names, and no types for monomorphic constants
paulson
parents:
16903
diff
changeset

286 

0fd7b1438d28
simpler variable names, and no types for monomorphic constants
paulson
parents:
16903
diff
changeset

287 
(*Initialize the type suppression mechanism with the current theory before 
0fd7b1438d28
simpler variable names, and no types for monomorphic constants
paulson
parents:
16903
diff
changeset

288 
producing any clauses!*) 
18218
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset

289 
fun init thy = (const_typargs := Sign.const_typargs thy); 
16925
0fd7b1438d28
simpler variable names, and no types for monomorphic constants
paulson
parents:
16903
diff
changeset

290 

17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset

291 

18402
aaba095cf62b
1. changed fol_type, it's not a string type anymore.
mengj
parents:
18390
diff
changeset

292 
(*Flatten a type to a fol_type while accumulating sort constraints on the TFrees and 
16925
0fd7b1438d28
simpler variable names, and no types for monomorphic constants
paulson
parents:
16903
diff
changeset

293 
TVars it contains.*) 
18218
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset

294 
fun type_of (Type (a, Ts)) = 
18798  295 
let val (folTyps, ts) = types_of Ts 
18218
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset

296 
val t = make_fixed_type_const a 
18798  297 
in (Comp(t,folTyps), ts) end 
298 
 type_of (TFree (a,s)) = (AtomF(make_fixed_type_var a), [(FOLTFree a, s)]) 

299 
 type_of (TVar (v, s)) = (AtomV(make_schematic_type_var v), [(FOLTVar v, s)]) 

18218
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset

300 
and types_of Ts = 
18798  301 
let val (folTyps,ts) = ListPair.unzip (map type_of Ts) 
302 
in (folTyps, union_all ts) end; 

15390  303 

18439
4b517881ac7e
Added functions for fol_type; also put some functions to the signature, used by ResHolClause.
mengj
parents:
18420
diff
changeset

304 

18218
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset

305 
fun const_types_of (c,T) = types_of (!const_typargs (c,T)); 
16925
0fd7b1438d28
simpler variable names, and no types for monomorphic constants
paulson
parents:
16903
diff
changeset

306 

16903  307 
(* Any variables created via the METAHYPS tactical should be treated as 
308 
universal vars, although it is represented as "Free(...)" by Isabelle *) 

309 
val isMeta = String.isPrefix "METAHYP1_" 

17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset

310 

18798  311 
fun pred_name_type (Const(c,T)) = (make_fixed_const c, const_types_of (c,T)) 
15390  312 
 pred_name_type (Free(x,T)) = 
17404
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset

313 
if isMeta x then raise CLAUSE("Predicate Not First Order 1", Free(x,T)) 
18798  314 
else (make_fixed_var x, ([],[])) 
17404
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset

315 
 pred_name_type (v as Var _) = raise CLAUSE("Predicate Not First Order 2", v) 
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset

316 
 pred_name_type t = raise CLAUSE("Predicate input unexpected", t); 
15347  317 

15615  318 

18218
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset

319 
(* For typed equality *) 
15615  320 
(* here "arg_typ" is the type of "="'s argument's type, not the type of the equality *) 
321 
(* Find type of equality arg *) 

322 
fun eq_arg_type (Type("fun",[T,_])) = 

323 
let val (folT,_) = type_of T; 

17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset

324 
in folT end; 
15347  325 

18798  326 
fun fun_name_type (Const(c,T)) args = (make_fixed_const c, const_types_of (c,T)) 
327 
 fun_name_type (Free(x,T)) args = 

328 
if isMeta x then raise CLAUSE("Function Not First Order", Free(x,T)) 

329 
else (make_fixed_var x, ([],[])) 

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

330 
 fun_name_type f args = raise CLAUSE("Function Not First Order 1", f); 
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset

331 

18856
4669dec681f4
tidyup of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset

332 
(*Convert a term to a fol_term while accumulating sort constraints on the TFrees and 
4669dec681f4
tidyup of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset

333 
TVars it contains.*) 
15347  334 
fun term_of (Var(ind_nm,T)) = 
18798  335 
let val (folType,ts) = type_of T 
336 
in (UVar(make_schematic_var ind_nm, folType), ts) end 

15347  337 
 term_of (Free(x,T)) = 
18798  338 
let val (folType, ts) = type_of T 
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset

339 
in 
18798  340 
if isMeta x then (UVar(make_schematic_var(x,0),folType), ts) 
341 
else (Fun(make_fixed_var x, [folType], []), ts) 

17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset

342 
end 
18218
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset

343 
 term_of app = 
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset

344 
let val (f,args) = strip_comb app 
18798  345 
val (funName,(contys,ts1)) = fun_name_type f args 
346 
val (args',ts2) = terms_of args 

17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset

347 
in 
18868  348 
(Fun(funName,contys,args'), union_all (ts1::ts2)) 
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset

349 
end 
18798  350 
and terms_of ts = ListPair.unzip (map term_of ts) 
15390  351 

18856
4669dec681f4
tidyup of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset

352 
(*Create a predicate value, again accumulating sort constraints.*) 
17404
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset

353 
fun pred_of (Const("op =", typ), args) = 
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset

354 
let val arg_typ = eq_arg_type typ 
18798  355 
val (args',ts) = terms_of args 
17404
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset

356 
val equal_name = make_fixed_const "op =" 
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset

357 
in 
18218
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset

358 
(Predicate(equal_name,[arg_typ],args'), 
18856
4669dec681f4
tidyup of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset

359 
union_all ts) 
17404
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset

360 
end 
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset

361 
 pred_of (pred,args) = 
18856
4669dec681f4
tidyup of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset

362 
let val (pname, (predType,ts1)) = pred_name_type pred 
18798  363 
val (args',ts2) = terms_of args 
17404
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset

364 
in 
18856
4669dec681f4
tidyup of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset

365 
(Predicate(pname,predType,args'), union_all (ts1::ts2)) 
17404
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset

366 
end; 
15347  367 

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

368 
(*Treatment of literals, possibly negated or tagged*) 
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset

369 
fun predicate_of ((Const("Not",_) $ P), polarity, tag) = 
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset

370 
predicate_of (P, not polarity, tag) 
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset

371 
 predicate_of ((Const("HOL.tag",_) $ P), polarity, tag) = 
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset

372 
predicate_of (P, polarity, true) 
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset

373 
 predicate_of (term,polarity,tag) = 
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset

374 
(pred_of (strip_comb term), polarity, tag); 
15347  375 

17888  376 
fun literals_of_term1 args (Const("Trueprop",_) $ P) = literals_of_term1 args P 
18856
4669dec681f4
tidyup of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset

377 
 literals_of_term1 args (Const("op ",_) $ P $ Q) = 
4669dec681f4
tidyup of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset

378 
literals_of_term1 (literals_of_term1 args P) Q 
4669dec681f4
tidyup of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset

379 
 literals_of_term1 (lits, ts) P = 
4669dec681f4
tidyup of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset

380 
let val ((pred, ts'), polarity, tag) = predicate_of (P,true,false) 
4669dec681f4
tidyup of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset

381 
val lits' = Literal(polarity,pred,tag) :: lits 
17234  382 
in 
18856
4669dec681f4
tidyup of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset

383 
(lits', ts union ts') 
17234  384 
end; 
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset

385 

18856
4669dec681f4
tidyup of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset

386 
val literals_of_term = literals_of_term1 ([],[]); 
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset

387 

18403
df0c0f35c897
Changed literals' ordering and the functions for sorting literals.
mengj
parents:
18402
diff
changeset

388 

df0c0f35c897
Changed literals' ordering and the functions for sorting literals.
mengj
parents:
18402
diff
changeset

389 
fun list_ord _ ([],[]) = EQUAL 
df0c0f35c897
Changed literals' ordering and the functions for sorting literals.
mengj
parents:
18402
diff
changeset

390 
 list_ord _ ([],_) = LESS 
df0c0f35c897
Changed literals' ordering and the functions for sorting literals.
mengj
parents:
18402
diff
changeset

391 
 list_ord _ (_,[]) = GREATER 
19207
33f1b4515ce4
Tidying and tracing. Handling exn CLAUSE so that errors don't reach toplevel.
paulson
parents:
19197
diff
changeset

392 
 list_ord ord (x::xs, y::ys) = 
33f1b4515ce4
Tidying and tracing. Handling exn CLAUSE so that errors don't reach toplevel.
paulson
parents:
19197
diff
changeset

393 
(case ord(x,y) of EQUAL => list_ord ord (xs,ys) 
33f1b4515ce4
Tidying and tracing. Handling exn CLAUSE so that errors don't reach toplevel.
paulson
parents:
19197
diff
changeset

394 
 xy_ord => xy_ord); 
33f1b4515ce4
Tidying and tracing. Handling exn CLAUSE so that errors don't reach toplevel.
paulson
parents:
19197
diff
changeset

395 

18403
df0c0f35c897
Changed literals' ordering and the functions for sorting literals.
mengj
parents:
18402
diff
changeset

396 
fun type_ord (AtomV(_),AtomV(_)) = EQUAL 
df0c0f35c897
Changed literals' ordering and the functions for sorting literals.
mengj
parents:
18402
diff
changeset

397 
 type_ord (AtomV(_),_) = LESS 
df0c0f35c897
Changed literals' ordering and the functions for sorting literals.
mengj
parents:
18402
diff
changeset

398 
 type_ord (AtomF(_),AtomV(_)) = GREATER 
df0c0f35c897
Changed literals' ordering and the functions for sorting literals.
mengj
parents:
18402
diff
changeset

399 
 type_ord (AtomF(f1),AtomF(f2)) = string_ord (f1,f2) 
df0c0f35c897
Changed literals' ordering and the functions for sorting literals.
mengj
parents:
18402
diff
changeset

400 
 type_ord (AtomF(_),_) = LESS 
df0c0f35c897
Changed literals' ordering and the functions for sorting literals.
mengj
parents:
18402
diff
changeset

401 
 type_ord (Comp(_,_),AtomV(_)) = GREATER 
df0c0f35c897
Changed literals' ordering and the functions for sorting literals.
mengj
parents:
18402
diff
changeset

402 
 type_ord (Comp(_,_),AtomF(_)) = GREATER 
df0c0f35c897
Changed literals' ordering and the functions for sorting literals.
mengj
parents:
18402
diff
changeset

403 
 type_ord (Comp(con1,args1),Comp(con2,args2)) = 
19207
33f1b4515ce4
Tidying and tracing. Handling exn CLAUSE so that errors don't reach toplevel.
paulson
parents:
19197
diff
changeset

404 
(case string_ord(con1,con2) of EQUAL => types_ord (args1,args2) 
33f1b4515ce4
Tidying and tracing. Handling exn CLAUSE so that errors don't reach toplevel.
paulson
parents:
19197
diff
changeset

405 
 con_ord => con_ord) 
18403
df0c0f35c897
Changed literals' ordering and the functions for sorting literals.
mengj
parents:
18402
diff
changeset

406 
and 
18920  407 
types_ord ([],[]) = EQUAL 
18403
df0c0f35c897
Changed literals' ordering and the functions for sorting literals.
mengj
parents:
18402
diff
changeset

408 
 types_ord (tps1,tps2) = list_ord type_ord (tps1,tps2); 
df0c0f35c897
Changed literals' ordering and the functions for sorting literals.
mengj
parents:
18402
diff
changeset

409 

18402
aaba095cf62b
1. changed fol_type, it's not a string type anymore.
mengj
parents:
18390
diff
changeset

410 

18920  411 
fun term_ord (UVar _, UVar _) = EQUAL 
412 
 term_ord (UVar _, _) = LESS 

413 
 term_ord (Fun _, UVar _) = GREATER 

18403
df0c0f35c897
Changed literals' ordering and the functions for sorting literals.
mengj
parents:
18402
diff
changeset

414 
 term_ord (Fun(f1,tps1,tms1),Fun(f2,tps2,tms2)) = 
18420
9470061ab283
hashing to eliminate the output of duplicate clauses
paulson
parents:
18411
diff
changeset

415 
(case string_ord (f1,f2) of 
9470061ab283
hashing to eliminate the output of duplicate clauses
paulson
parents:
18411
diff
changeset

416 
EQUAL => 
9470061ab283
hashing to eliminate the output of duplicate clauses
paulson
parents:
18411
diff
changeset

417 
(case terms_ord (tms1,tms2) of EQUAL => types_ord (tps1,tps2) 
9470061ab283
hashing to eliminate the output of duplicate clauses
paulson
parents:
18411
diff
changeset

418 
 tms_ord => tms_ord) 
9470061ab283
hashing to eliminate the output of duplicate clauses
paulson
parents:
18411
diff
changeset

419 
 fn_ord => fn_ord) 
18403
df0c0f35c897
Changed literals' ordering and the functions for sorting literals.
mengj
parents:
18402
diff
changeset

420 

df0c0f35c897
Changed literals' ordering and the functions for sorting literals.
mengj
parents:
18402
diff
changeset

421 
and 
18920  422 
terms_ord ([],[]) = EQUAL 
18420
9470061ab283
hashing to eliminate the output of duplicate clauses
paulson
parents:
18411
diff
changeset

423 
 terms_ord (tms1,tms2) = list_ord term_ord (tms1,tms2); 
18403
df0c0f35c897
Changed literals' ordering and the functions for sorting literals.
mengj
parents:
18402
diff
changeset

424 

df0c0f35c897
Changed literals' ordering and the functions for sorting literals.
mengj
parents:
18402
diff
changeset

425 

df0c0f35c897
Changed literals' ordering and the functions for sorting literals.
mengj
parents:
18402
diff
changeset

426 

18856
4669dec681f4
tidyup of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset

427 
fun predicate_ord (Predicate(pname1,ftyps1,ftms1),Predicate(pname2,ftyps2,ftms2)) = 
4669dec681f4
tidyup of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset

428 
case string_ord (pname1,pname2) of 
4669dec681f4
tidyup of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset

429 
EQUAL => (case terms_ord(ftms1,ftms2) of EQUAL => types_ord(ftyps1,ftyps2) 
4669dec681f4
tidyup of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset

430 
 ftms_ord => ftms_ord) 
4669dec681f4
tidyup of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset

431 
 pname_ord => pname_ord 
4669dec681f4
tidyup of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset

432 

18402
aaba095cf62b
1. changed fol_type, it's not a string type anymore.
mengj
parents:
18390
diff
changeset

433 

aaba095cf62b
1. changed fol_type, it's not a string type anymore.
mengj
parents:
18390
diff
changeset

434 
fun literal_ord (Literal(false,_,_),Literal(true,_,_)) = LESS 
aaba095cf62b
1. changed fol_type, it's not a string type anymore.
mengj
parents:
18390
diff
changeset

435 
 literal_ord (Literal(true,_,_),Literal(false,_,_)) = GREATER 
aaba095cf62b
1. changed fol_type, it's not a string type anymore.
mengj
parents:
18390
diff
changeset

436 
 literal_ord (Literal(_,pred1,_),Literal(_,pred2,_)) = predicate_ord(pred1,pred2); 
aaba095cf62b
1. changed fol_type, it's not a string type anymore.
mengj
parents:
18390
diff
changeset

437 

aaba095cf62b
1. changed fol_type, it's not a string type anymore.
mengj
parents:
18390
diff
changeset

438 
fun sort_lits lits = sort literal_ord lits; 
aaba095cf62b
1. changed fol_type, it's not a string type anymore.
mengj
parents:
18390
diff
changeset

439 

18420
9470061ab283
hashing to eliminate the output of duplicate clauses
paulson
parents:
18411
diff
changeset

440 

18409
080094128a09
Added functions to test equivalence between clauses.
mengj
parents:
18403
diff
changeset

441 
(********** clause equivalence ******************) 
080094128a09
Added functions to test equivalence between clauses.
mengj
parents:
18403
diff
changeset

442 

080094128a09
Added functions to test equivalence between clauses.
mengj
parents:
18403
diff
changeset

443 
fun check_var_pairs (x,y) [] = 0 
080094128a09
Added functions to test equivalence between clauses.
mengj
parents:
18403
diff
changeset

444 
 check_var_pairs (x,y) ((u,v)::w) = 
080094128a09
Added functions to test equivalence between clauses.
mengj
parents:
18403
diff
changeset

445 
if (x,y) = (u,v) then 1 
080094128a09
Added functions to test equivalence between clauses.
mengj
parents:
18403
diff
changeset

446 
else 
19176  447 
if x=u orelse y=v then 2 (*conflict*) 
18409
080094128a09
Added functions to test equivalence between clauses.
mengj
parents:
18403
diff
changeset

448 
else check_var_pairs (x,y) w; 
080094128a09
Added functions to test equivalence between clauses.
mengj
parents:
18403
diff
changeset

449 

080094128a09
Added functions to test equivalence between clauses.
mengj
parents:
18403
diff
changeset

450 
fun type_eq (AtomV(v1),AtomV(v2)) (vars,tvars) = 
080094128a09
Added functions to test equivalence between clauses.
mengj
parents:
18403
diff
changeset

451 
(case check_var_pairs (v1,v2) tvars of 0 => (true,(vars,(v1,v2)::tvars)) 
080094128a09
Added functions to test equivalence between clauses.
mengj
parents:
18403
diff
changeset

452 
 1 => (true,(vars,tvars)) 
080094128a09
Added functions to test equivalence between clauses.
mengj
parents:
18403
diff
changeset

453 
 2 => (false,(vars,tvars))) 
080094128a09
Added functions to test equivalence between clauses.
mengj
parents:
18403
diff
changeset

454 
 type_eq (AtomV(_),_) vtvars = (false,vtvars) 
080094128a09
Added functions to test equivalence between clauses.
mengj
parents:
18403
diff
changeset

455 
 type_eq (AtomF(f1),AtomF(f2)) vtvars = (f1=f2,vtvars) 
080094128a09
Added functions to test equivalence between clauses.
mengj
parents:
18403
diff
changeset

456 
 type_eq (AtomF(_),_) vtvars = (false,vtvars) 
080094128a09
Added functions to test equivalence between clauses.
mengj
parents:
18403
diff
changeset

457 
 type_eq (Comp(con1,args1),Comp(con2,args2)) vtvars = 
18420
9470061ab283
hashing to eliminate the output of duplicate clauses
paulson
parents:
18411
diff
changeset

458 
let val (eq1,vtvars1) = 
9470061ab283
hashing to eliminate the output of duplicate clauses
paulson
parents:
18411
diff
changeset

459 
if con1 = con2 then types_eq (args1,args2) vtvars 
9470061ab283
hashing to eliminate the output of duplicate clauses
paulson
parents:
18411
diff
changeset

460 
else (false,vtvars) 
9470061ab283
hashing to eliminate the output of duplicate clauses
paulson
parents:
18411
diff
changeset

461 
in 
9470061ab283
hashing to eliminate the output of duplicate clauses
paulson
parents:
18411
diff
changeset

462 
(eq1,vtvars1) 
9470061ab283
hashing to eliminate the output of duplicate clauses
paulson
parents:
18411
diff
changeset

463 
end 
18409
080094128a09
Added functions to test equivalence between clauses.
mengj
parents:
18403
diff
changeset

464 
 type_eq (Comp(_,_),_) vtvars = (false,vtvars) 
080094128a09
Added functions to test equivalence between clauses.
mengj
parents:
18403
diff
changeset

465 

19176  466 
and types_eq ([],[]) vtvars = (true,vtvars) 
18420
9470061ab283
hashing to eliminate the output of duplicate clauses
paulson
parents:
18411
diff
changeset

467 
 types_eq (tp1::tps1,tp2::tps2) vtvars = 
9470061ab283
hashing to eliminate the output of duplicate clauses
paulson
parents:
18411
diff
changeset

468 
let val (eq1,vtvars1) = type_eq (tp1,tp2) vtvars 
9470061ab283
hashing to eliminate the output of duplicate clauses
paulson
parents:
18411
diff
changeset

469 
val (eq2,vtvars2) = if eq1 then types_eq (tps1,tps2) vtvars1 
9470061ab283
hashing to eliminate the output of duplicate clauses
paulson
parents:
18411
diff
changeset

470 
else (eq1,vtvars1) 
9470061ab283
hashing to eliminate the output of duplicate clauses
paulson
parents:
18411
diff
changeset

471 
in 
9470061ab283
hashing to eliminate the output of duplicate clauses
paulson
parents:
18411
diff
changeset

472 
(eq2,vtvars2) 
9470061ab283
hashing to eliminate the output of duplicate clauses
paulson
parents:
18411
diff
changeset

473 
end; 
18409
080094128a09
Added functions to test equivalence between clauses.
mengj
parents:
18403
diff
changeset

474 

080094128a09
Added functions to test equivalence between clauses.
mengj
parents:
18403
diff
changeset

475 

080094128a09
Added functions to test equivalence between clauses.
mengj
parents:
18403
diff
changeset

476 
fun term_eq (UVar(v1,tp1),UVar(v2,tp2)) (vars,tvars) = 
080094128a09
Added functions to test equivalence between clauses.
mengj
parents:
18403
diff
changeset

477 
(case check_var_pairs (v1,v2) vars of 0 => type_eq (tp1,tp2) (((v1,v2)::vars),tvars) 
080094128a09
Added functions to test equivalence between clauses.
mengj
parents:
18403
diff
changeset

478 
 1 => type_eq (tp1,tp2) (vars,tvars) 
080094128a09
Added functions to test equivalence between clauses.
mengj
parents:
18403
diff
changeset

479 
 2 => (false,(vars,tvars))) 
18920  480 
 term_eq (UVar _,_) vtvars = (false,vtvars) 
18409
080094128a09
Added functions to test equivalence between clauses.
mengj
parents:
18403
diff
changeset

481 
 term_eq (Fun(f1,tps1,tms1),Fun(f2,tps2,tms2)) vtvars = 
18420
9470061ab283
hashing to eliminate the output of duplicate clauses
paulson
parents:
18411
diff
changeset

482 
let val (eq1,vtvars1) = 
9470061ab283
hashing to eliminate the output of duplicate clauses
paulson
parents:
18411
diff
changeset

483 
if f1 = f2 then terms_eq (tms1,tms2) vtvars 
9470061ab283
hashing to eliminate the output of duplicate clauses
paulson
parents:
18411
diff
changeset

484 
else (false,vtvars) 
9470061ab283
hashing to eliminate the output of duplicate clauses
paulson
parents:
18411
diff
changeset

485 
val (eq2,vtvars2) = 
9470061ab283
hashing to eliminate the output of duplicate clauses
paulson
parents:
18411
diff
changeset

486 
if eq1 then types_eq (tps1,tps2) vtvars1 
9470061ab283
hashing to eliminate the output of duplicate clauses
paulson
parents:
18411
diff
changeset

487 
else (eq1,vtvars1) 
9470061ab283
hashing to eliminate the output of duplicate clauses
paulson
parents:
18411
diff
changeset

488 
in 
9470061ab283
hashing to eliminate the output of duplicate clauses
paulson
parents:
18411
diff
changeset

489 
(eq2,vtvars2) 
9470061ab283
hashing to eliminate the output of duplicate clauses
paulson
parents:
18411
diff
changeset

490 
end 
18409
080094128a09
Added functions to test equivalence between clauses.
mengj
parents:
18403
diff
changeset

491 
 term_eq (Fun(_,_,_),_) vtvars = (false,vtvars) 
080094128a09
Added functions to test equivalence between clauses.
mengj
parents:
18403
diff
changeset

492 

19176  493 
and terms_eq ([],[]) vtvars = (true,vtvars) 
18420
9470061ab283
hashing to eliminate the output of duplicate clauses
paulson
parents:
18411
diff
changeset

494 
 terms_eq (tm1::tms1,tm2::tms2) vtvars = 
9470061ab283
hashing to eliminate the output of duplicate clauses
paulson
parents:
18411
diff
changeset

495 
let val (eq1,vtvars1) = term_eq (tm1,tm2) vtvars 
9470061ab283
hashing to eliminate the output of duplicate clauses
paulson
parents:
18411
diff
changeset

496 
val (eq2,vtvars2) = if eq1 then terms_eq (tms1,tms2) vtvars1 
9470061ab283
hashing to eliminate the output of duplicate clauses
paulson
parents:
18411
diff
changeset

497 
else (eq1,vtvars1) 
9470061ab283
hashing to eliminate the output of duplicate clauses
paulson
parents:
18411
diff
changeset

498 
in 
9470061ab283
hashing to eliminate the output of duplicate clauses
paulson
parents:
18411
diff
changeset

499 
(eq2,vtvars2) 
9470061ab283
hashing to eliminate the output of duplicate clauses
paulson
parents:
18411
diff
changeset

500 
end; 
18409
080094128a09
Added functions to test equivalence between clauses.
mengj
parents:
18403
diff
changeset

501 

080094128a09
Added functions to test equivalence between clauses.
mengj
parents:
18403
diff
changeset

502 

18856
4669dec681f4
tidyup of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset

503 
fun pred_eq (Predicate(pname1,tps1,tms1),Predicate(pname2,tps2,tms2)) vtvars = 
18409
080094128a09
Added functions to test equivalence between clauses.
mengj
parents:
18403
diff
changeset

504 
let val (eq1,vtvars1) = 
19176  505 
if pname1 = pname2 then terms_eq (tms1,tms2) vtvars 
18409
080094128a09
Added functions to test equivalence between clauses.
mengj
parents:
18403
diff
changeset

506 
else (false,vtvars) 
080094128a09
Added functions to test equivalence between clauses.
mengj
parents:
18403
diff
changeset

507 
val (eq2,vtvars2) = 
080094128a09
Added functions to test equivalence between clauses.
mengj
parents:
18403
diff
changeset

508 
if eq1 then types_eq (tps1,tps2) vtvars1 
080094128a09
Added functions to test equivalence between clauses.
mengj
parents:
18403
diff
changeset

509 
else (eq1,vtvars1) 
080094128a09
Added functions to test equivalence between clauses.
mengj
parents:
18403
diff
changeset

510 
in 
080094128a09
Added functions to test equivalence between clauses.
mengj
parents:
18403
diff
changeset

511 
(eq2,vtvars2) 
080094128a09
Added functions to test equivalence between clauses.
mengj
parents:
18403
diff
changeset

512 
end; 
080094128a09
Added functions to test equivalence between clauses.
mengj
parents:
18403
diff
changeset

513 

080094128a09
Added functions to test equivalence between clauses.
mengj
parents:
18403
diff
changeset

514 

080094128a09
Added functions to test equivalence between clauses.
mengj
parents:
18403
diff
changeset

515 
fun lit_eq (Literal(pol1,pred1,_),Literal(pol2,pred2,_)) vtvars = 
080094128a09
Added functions to test equivalence between clauses.
mengj
parents:
18403
diff
changeset

516 
if (pol1 = pol2) then pred_eq (pred1,pred2) vtvars 
080094128a09
Added functions to test equivalence between clauses.
mengj
parents:
18403
diff
changeset

517 
else (false,vtvars); 
080094128a09
Added functions to test equivalence between clauses.
mengj
parents:
18403
diff
changeset

518 

080094128a09
Added functions to test equivalence between clauses.
mengj
parents:
18403
diff
changeset

519 
fun lits_eq ([],[]) vtvars = (true,vtvars) 
080094128a09
Added functions to test equivalence between clauses.
mengj
parents:
18403
diff
changeset

520 
 lits_eq (l1::ls1,l2::ls2) vtvars = 
19176  521 
let val (eq1,vtvars1) = lit_eq (l1,l2) vtvars 
522 
in 

523 
if eq1 then lits_eq (ls1,ls2) vtvars1 

524 
else (false,vtvars1) 

525 
end 

526 
 lits_eq _ vtvars = (false,vtvars); 

18409
080094128a09
Added functions to test equivalence between clauses.
mengj
parents:
18403
diff
changeset

527 

18420
9470061ab283
hashing to eliminate the output of duplicate clauses
paulson
parents:
18411
diff
changeset

528 
(*Equality of two clauses up to variable renaming*) 
18798  529 
fun clause_eq (Clause{literals=lits1,...}, Clause{literals=lits2,...}) = 
19176  530 
#1 (lits_eq (lits1,lits2) ([],[])); 
18409
080094128a09
Added functions to test equivalence between clauses.
mengj
parents:
18403
diff
changeset

531 

080094128a09
Added functions to test equivalence between clauses.
mengj
parents:
18403
diff
changeset

532 

18420
9470061ab283
hashing to eliminate the output of duplicate clauses
paulson
parents:
18411
diff
changeset

533 
(*** Hash function for clauses ***) 
9470061ab283
hashing to eliminate the output of duplicate clauses
paulson
parents:
18411
diff
changeset

534 

9470061ab283
hashing to eliminate the output of duplicate clauses
paulson
parents:
18411
diff
changeset

535 
val xor_words = List.foldl Word.xorb 0w0; 
9470061ab283
hashing to eliminate the output of duplicate clauses
paulson
parents:
18411
diff
changeset

536 

18920  537 
fun hashw_term (UVar _, w) = w 
18449  538 
 hashw_term (Fun(f,tps,args), w) = 
539 
List.foldl hashw_term (Polyhash.hashw_string (f,w)) args; 

18420
9470061ab283
hashing to eliminate the output of duplicate clauses
paulson
parents:
18411
diff
changeset

540 

18449  541 
fun hashw_pred (Predicate(pn,_,args), w) = 
542 
List.foldl hashw_term (Polyhash.hashw_string (pn,w)) args; 

18420
9470061ab283
hashing to eliminate the output of duplicate clauses
paulson
parents:
18411
diff
changeset

543 

18449  544 
fun hash1_literal (Literal(true,pred,_)) = hashw_pred (pred, 0w0) 
545 
 hash1_literal (Literal(false,pred,_)) = Word.notb (hashw_pred (pred, 0w0)); 

18420
9470061ab283
hashing to eliminate the output of duplicate clauses
paulson
parents:
18411
diff
changeset

546 

18798  547 
fun hash_clause (Clause{literals,...}) = 
548 
Word.toIntX (xor_words (map hash1_literal literals)); 

18402
aaba095cf62b
1. changed fol_type, it's not a string type anymore.
mengj
parents:
18390
diff
changeset

549 

aaba095cf62b
1. changed fol_type, it's not a string type anymore.
mengj
parents:
18390
diff
changeset

550 

18798  551 
(*Make literals for sorted type variables. FIXME: can it use map?*) 
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset

552 
fun sorts_on_typs (_, []) = ([]) 
16199
ee95ab217fee
no longer emits literals for type class HOL.type; also minor tidying
paulson
parents:
16039
diff
changeset

553 
 sorts_on_typs (v, "HOL.type" :: s) = 
18411
2d3165a0fb40
No axiom, arity or classrel clauses contain HOL.type. Negative occurrences are
paulson
parents:
18409
diff
changeset

554 
sorts_on_typs (v,s) (*IGNORE sort "type"*) 
18798  555 
 sorts_on_typs ((FOLTVar indx), s::ss) = 
556 
LTVar(make_type_class s, make_schematic_type_var indx) :: 

557 
sorts_on_typs ((FOLTVar indx), ss) 

558 
 sorts_on_typs ((FOLTFree x), s::ss) = 

559 
LTFree(make_type_class s, make_fixed_type_var x) :: 

560 
sorts_on_typs ((FOLTFree x), ss); 

15347  561 

17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset

562 

18798  563 
fun pred_of_sort (LTVar (s,ty)) = (s,1) 
564 
 pred_of_sort (LTFree (s,ty)) = (s,1) 

17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset

565 

16199
ee95ab217fee
no longer emits literals for type class HOL.type; also minor tidying
paulson
parents:
16039
diff
changeset

566 
(*Given a list of sorted type variables, return two separate lists. 
ee95ab217fee
no longer emits literals for type class HOL.type; also minor tidying
paulson
parents:
16039
diff
changeset

567 
The first is for TVars, the second for TFrees.*) 
18856
4669dec681f4
tidyup of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset

568 
fun add_typs_aux [] = ([],[]) 
4669dec681f4
tidyup of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset

569 
 add_typs_aux ((FOLTVar indx,s)::tss) = 
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset

570 
let val vs = sorts_on_typs (FOLTVar indx, s) 
18856
4669dec681f4
tidyup of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset

571 
val (vss,fss) = add_typs_aux tss 
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset

572 
in 
18856
4669dec681f4
tidyup of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset

573 
(vs union vss, fss) 
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset

574 
end 
18856
4669dec681f4
tidyup of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset

575 
 add_typs_aux ((FOLTFree x,s)::tss) = 
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset

576 
let val fs = sorts_on_typs (FOLTFree x, s) 
18856
4669dec681f4
tidyup of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset

577 
val (vss,fss) = add_typs_aux tss 
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset

578 
in 
18856
4669dec681f4
tidyup of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset

579 
(vss, fs union fss) 
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset

580 
end; 
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset

581 

17999  582 

18869
00741f7280f7
removal of ResClause.num_of_clauses and other simplifications
paulson
parents:
18868
diff
changeset

583 
(** make axiom and conjecture clauses. **) 
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset

584 

ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset

585 
fun get_tvar_strs [] = [] 
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset

586 
 get_tvar_strs ((FOLTVar indx,s)::tss) = 
18920  587 
(make_schematic_type_var indx) ins (get_tvar_strs tss) 
588 
 get_tvar_strs((FOLTFree x,s)::tss) = get_tvar_strs tss 

15347  589 

18869
00741f7280f7
removal of ResClause.num_of_clauses and other simplifications
paulson
parents:
18868
diff
changeset

590 
(* check if a clause is firstorder before making a conjecture clause*) 
19443
e32a4703d834
Take conjectures and axioms as thms when convert them to ResClause.clause format.
mengj
parents:
19354
diff
changeset

591 
fun make_conjecture_clause n thm = 
e32a4703d834
Take conjectures and axioms as thms when convert them to ResClause.clause format.
mengj
parents:
19354
diff
changeset

592 
let val t = prop_of thm 
e32a4703d834
Take conjectures and axioms as thms when convert them to ResClause.clause format.
mengj
parents:
19354
diff
changeset

593 
val _ = check_is_fol_term t 
18199
d236379ea408
 before converting axiom and conjecture clauses into ResClause.clause format, perform "check_is_fol_term" first.
mengj
parents:
18056
diff
changeset

594 
handle TERM("check_is_fol_term",_) => raise CLAUSE("Goal is not FOL",t) 
18856
4669dec681f4
tidyup of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset

595 
val (lits,types_sorts) = literals_of_term t 
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset

596 
in 
19447  597 
make_clause(n, "conjecture", thm, Conjecture, lits, types_sorts) 
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset

598 
end; 
17845
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset

599 

1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset

600 
fun make_conjecture_clauses_aux _ [] = [] 
17888  601 
 make_conjecture_clauses_aux n (t::ts) = 
602 
make_conjecture_clause n t :: make_conjecture_clauses_aux (n+1) ts 

17845
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset

603 

1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset

604 
val make_conjecture_clauses = make_conjecture_clauses_aux 0 
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset

605 

18920  606 
(** Too general means, positive equality literal with a variable X as one operand, 
607 
when X does not occur properly in the other operand. This rules out clearly 

608 
inconsistent clauses such as V=aV=b, though it by no means guarantees soundness. **) 

609 

610 
fun occurs a (UVar(b,_)) = a=b 

611 
 occurs a (Fun (_,_,ts)) = exists (occurs a) ts 

612 

613 
(*Is the first operand a variable that does not properly occur in the second operand?*) 

614 
fun too_general_terms (UVar _, UVar _) = false 

615 
 too_general_terms (Fun _, _) = false 

616 
 too_general_terms (UVar (a,_), t) = not (occurs a t); 

617 

618 
fun too_general_lit (Literal (true,Predicate("equal",_,[x,y]),_)) = 

619 
too_general_terms (x,y) orelse too_general_terms(y,x) 

620 
 too_general_lit _ = false; 

17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset

621 

18199
d236379ea408
 before converting axiom and conjecture clauses into ResClause.clause format, perform "check_is_fol_term" first.
mengj
parents:
18056
diff
changeset

622 
(*before converting an axiom clause to "clause" format, check if it is FOL*) 
19443
e32a4703d834
Take conjectures and axioms as thms when convert them to ResClause.clause format.
mengj
parents:
19354
diff
changeset

623 
fun make_axiom_clause thm (ax_name,cls_id) = 
e32a4703d834
Take conjectures and axioms as thms when convert them to ResClause.clause format.
mengj
parents:
19354
diff
changeset

624 
let val term = prop_of thm 
e32a4703d834
Take conjectures and axioms as thms when convert them to ResClause.clause format.
mengj
parents:
19354
diff
changeset

625 
val (lits,types_sorts) = literals_of_term term 
15347  626 
in 
19207
33f1b4515ce4
Tidying and tracing. Handling exn CLAUSE so that errors don't reach toplevel.
paulson
parents:
19197
diff
changeset

627 
if not (Meson.is_fol_term term) then 
33f1b4515ce4
Tidying and tracing. Handling exn CLAUSE so that errors don't reach toplevel.
paulson
parents:
19197
diff
changeset

628 
(Output.debug ("Omitting " ^ ax_name ^ ": Axiom is not FOL"); 
33f1b4515ce4
Tidying and tracing. Handling exn CLAUSE so that errors don't reach toplevel.
paulson
parents:
19197
diff
changeset

629 
NONE) 
33f1b4515ce4
Tidying and tracing. Handling exn CLAUSE so that errors don't reach toplevel.
paulson
parents:
19197
diff
changeset

630 
else if forall too_general_lit lits then 
18920  631 
(Output.debug ("Omitting " ^ ax_name ^ ": equalities are too general"); 
632 
NONE) 

19447  633 
else SOME (make_clause(cls_id, ax_name, thm, Axiom, sort_lits lits, types_sorts)) 
19207
33f1b4515ce4
Tidying and tracing. Handling exn CLAUSE so that errors don't reach toplevel.
paulson
parents:
19197
diff
changeset

634 
end 
33f1b4515ce4
Tidying and tracing. Handling exn CLAUSE so that errors don't reach toplevel.
paulson
parents:
19197
diff
changeset

635 
handle CLAUSE _ => NONE; 
15347  636 

637 

19443
e32a4703d834
Take conjectures and axioms as thms when convert them to ResClause.clause format.
mengj
parents:
19354
diff
changeset

638 
fun make_axiom_clauses [] = [] 
e32a4703d834
Take conjectures and axioms as thms when convert them to ResClause.clause format.
mengj
parents:
19354
diff
changeset

639 
 make_axiom_clauses ((thm,(name,id))::thms) = 
e32a4703d834
Take conjectures and axioms as thms when convert them to ResClause.clause format.
mengj
parents:
19354
diff
changeset

640 
case make_axiom_clause thm (name,id) of SOME cls => if isTaut cls then make_axiom_clauses thms else cls :: make_axiom_clauses thms 
e32a4703d834
Take conjectures and axioms as thms when convert them to ResClause.clause format.
mengj
parents:
19354
diff
changeset

641 
 NONE => make_axiom_clauses thms; 
19354  642 

15347  643 
(**** Isabelle arities ****) 
644 

645 
exception ARCLAUSE of string; 

646 

647 
type class = string; 

648 
type tcons = string; 

649 

18868  650 
datatype arLit = TConsLit of bool * (class * tcons * string list) 
651 
 TVarLit of bool * (class * string); 

15347  652 

653 
datatype arityClause = 

654 
ArityClause of {clause_id: clause_id, 

17845
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset

655 
axiom_name: axiom_name, 
15347  656 
kind: kind, 
657 
conclLit: arLit, 

658 
premLits: arLit list}; 

659 

660 

18798  661 
fun gen_TVars 0 = [] 
662 
 gen_TVars n = ("T_" ^ Int.toString n) :: gen_TVars (n1); 

15347  663 

18411
2d3165a0fb40
No axiom, arity or classrel clauses contain HOL.type. Negative occurrences are
paulson
parents:
18409
diff
changeset

664 
fun pack_sort(_,[]) = [] 
2d3165a0fb40
No axiom, arity or classrel clauses contain HOL.type. Negative occurrences are
paulson
parents:
18409
diff
changeset

665 
 pack_sort(tvar, "HOL.type"::srt) = pack_sort(tvar, srt) (*IGNORE sort "type"*) 
2d3165a0fb40
No axiom, arity or classrel clauses contain HOL.type. Negative occurrences are
paulson
parents:
18409
diff
changeset

666 
 pack_sort(tvar, cls::srt) = (make_type_class cls, tvar) :: pack_sort(tvar, srt); 
15347  667 

18868  668 
fun make_TVarLit (b, (cls,str)) = TVarLit(b, (cls,str)); 
669 
fun make_TConsLit (b, (cls,tcons,tvars)) = 

670 
TConsLit(b, (make_type_class cls, make_fixed_type_const tcons, tvars)); 

15347  671 

18411
2d3165a0fb40
No axiom, arity or classrel clauses contain HOL.type. Negative occurrences are
paulson
parents:
18409
diff
changeset

672 
(*Arity of type constructor tcon :: (arg1,...,argN)res*) 
2d3165a0fb40
No axiom, arity or classrel clauses contain HOL.type. Negative occurrences are
paulson
parents:
18409
diff
changeset

673 
fun make_axiom_arity_clause (tcons, n, (res,args)) = 
17845
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset

674 
let val nargs = length args 
18798  675 
val tvars = gen_TVars nargs 
17845
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset

676 
val tvars_srts = ListPair.zip (tvars,args) 
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset

677 
val tvars_srts' = union_all(map pack_sort tvars_srts) 
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset

678 
val false_tvars_srts' = map (pair false) tvars_srts' 
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset

679 
in 
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset

680 
ArityClause {clause_id = n, kind = Axiom, 
18411
2d3165a0fb40
No axiom, arity or classrel clauses contain HOL.type. Negative occurrences are
paulson
parents:
18409
diff
changeset

681 
axiom_name = lookup_type_const tcons, 
2d3165a0fb40
No axiom, arity or classrel clauses contain HOL.type. Negative occurrences are
paulson
parents:
18409
diff
changeset

682 
conclLit = make_TConsLit(true, (res,tcons,tvars)), 
17845
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset

683 
premLits = map make_TVarLit false_tvars_srts'} 
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset

684 
end; 
15347  685 

686 

687 
(**** Isabelle class relations ****) 

688 

689 
datatype classrelClause = 

18868  690 
ClassrelClause of {axiom_name: axiom_name, 
15347  691 
subclass: class, 
18411
2d3165a0fb40
No axiom, arity or classrel clauses contain HOL.type. Negative occurrences are
paulson
parents:
18409
diff
changeset

692 
superclass: class}; 
17845
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset

693 

1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset

694 
fun make_axiom_classrelClause n subclass superclass = 
18868  695 
ClassrelClause {axiom_name = clrelclause_prefix ^ ascii_of subclass ^ 
696 
"_" ^ Int.toString n, 

697 
subclass = make_type_class subclass, 

698 
superclass = make_type_class superclass}; 

15347  699 

17845
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset

700 
fun classrelClauses_of_aux n sub [] = [] 
18411
2d3165a0fb40
No axiom, arity or classrel clauses contain HOL.type. Negative occurrences are
paulson
parents:
18409
diff
changeset

701 
 classrelClauses_of_aux n sub ("HOL.type"::sups) = (*Should be ignored*) 
2d3165a0fb40
No axiom, arity or classrel clauses contain HOL.type. Negative occurrences are
paulson
parents:
18409
diff
changeset

702 
classrelClauses_of_aux n sub sups 
17845
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset

703 
 classrelClauses_of_aux n sub (sup::sups) = 
18868  704 
make_axiom_classrelClause n sub sup :: classrelClauses_of_aux (n+1) sub sups; 
15347  705 

18411
2d3165a0fb40
No axiom, arity or classrel clauses contain HOL.type. Negative occurrences are
paulson
parents:
18409
diff
changeset

706 
fun classrelClauses_of (sub,sups) = classrelClauses_of_aux 0 sub sups; 
17845
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset

707 

19642  708 
val classrel_clauses_thy = 
709 
maps classrelClauses_of o Graph.dest o #classes o Sorts.rep_algebra o Sign.classes_of; 

18868  710 

711 

712 
(** Isabelle arities **) 

17845
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset

713 

1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset

714 
fun arity_clause _ (tcons, []) = [] 
19155  715 
 arity_clause n (tcons, ("HOL.type",_)::ars) = (*ignore*) 
18411
2d3165a0fb40
No axiom, arity or classrel clauses contain HOL.type. Negative occurrences are
paulson
parents:
18409
diff
changeset

716 
arity_clause n (tcons,ars) 
17845
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset

717 
 arity_clause n (tcons, ar::ars) = 
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset

718 
make_axiom_arity_clause (tcons,n,ar) :: 
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset

719 
arity_clause (n+1) (tcons,ars); 
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset

720 

1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset

721 
fun multi_arity_clause [] = [] 
19155  722 
 multi_arity_clause ((tcons,ars) :: tc_arlists) = 
723 
(*Reversal ensures that older entries always get the same axiom name*) 

724 
arity_clause 0 (tcons, rev ars) @ 

725 
multi_arity_clause tc_arlists 

17845
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset

726 

1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset

727 
fun arity_clause_thy thy = 
19642  728 
let val arities = thy > Sign.classes_of 
729 
> Sorts.rep_algebra > #arities > Symtab.dest 

730 
> map (apsnd (map (fn (c, (_, Ss)) => (c, Ss)))); 

19521  731 
in multi_arity_clause (rev arities) end; 
17845
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset

732 

1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset

733 

18868  734 
(**** Find occurrences of predicates in clauses ****) 
735 

736 
(*FIXME: multiplearity checking doesn't work, as update_new is the wrong 

737 
function (it flags repeated declarations of a function, even with the same arity)*) 

738 

739 
fun update_many (tab, keypairs) = foldl (uncurry Symtab.update) tab keypairs; 

740 

741 
fun add_predicate_preds (Predicate(pname,tys,tms), preds) = 

742 
if pname = "equal" then preds (*equality is builtin and requires no declaration*) 

743 
else Symtab.update (pname, length tys + length tms) preds 

744 

745 
fun add_literal_preds (Literal(_,pred,_), preds) = add_predicate_preds (pred,preds) 

746 

747 
fun add_type_sort_preds ((FOLTVar indx,s), preds) = 

748 
update_many (preds, map pred_of_sort (sorts_on_typs (FOLTVar indx, s))) 

749 
 add_type_sort_preds ((FOLTFree x,s), preds) = 

750 
update_many (preds, map pred_of_sort (sorts_on_typs (FOLTFree x, s))); 

17845
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset

751 

18868  752 
fun add_clause_preds (Clause {literals, types_sorts, ...}, preds) = 
753 
foldl add_literal_preds (foldl add_type_sort_preds preds types_sorts) literals 

754 
handle Symtab.DUP a => raise ERROR ("predicate " ^ a ^ " has multiple arities") 

755 

756 
fun add_classrelClause_preds (ClassrelClause {subclass,superclass,...}, preds) = 

757 
Symtab.update (subclass,1) (Symtab.update (superclass,1) preds); 

17845
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset

758 

18868  759 
fun add_arityClause_preds (ArityClause {conclLit,...}, preds) = 
760 
let val TConsLit(_, (tclass, _, _)) = conclLit 

761 
in Symtab.update (tclass,1) preds end; 

762 

763 
fun preds_of_clauses clauses clsrel_clauses arity_clauses = 

764 
Symtab.dest 

765 
(foldl add_classrelClause_preds 

766 
(foldl add_arityClause_preds 

767 
(foldl add_clause_preds Symtab.empty clauses) 

768 
arity_clauses) 

769 
clsrel_clauses) 

18798  770 

18868  771 
(*** Find occurrences of functions in clauses ***) 
772 

773 
fun add_foltype_funcs (AtomV _, funcs) = funcs 

774 
 add_foltype_funcs (AtomF a, funcs) = Symtab.update (a,0) funcs 

775 
 add_foltype_funcs (Comp(a,tys), funcs) = 

776 
foldl add_foltype_funcs (Symtab.update (a, length tys) funcs) tys; 

777 

778 
fun add_folterm_funcs (UVar _, funcs) = funcs 

779 
 add_folterm_funcs (Fun(a,tys,[]), funcs) = Symtab.update (a,0) funcs 

780 
(*A constant is a special case: it has no type argument even if overloaded*) 

781 
 add_folterm_funcs (Fun(a,tys,tms), funcs) = 

782 
foldl add_foltype_funcs 

783 
(foldl add_folterm_funcs (Symtab.update (a, length tys + length tms) funcs) 

784 
tms) 

785 
tys 

18798  786 

18868  787 
fun add_predicate_funcs (Predicate(_,tys,tms), funcs) = 
788 
foldl add_foltype_funcs (foldl add_folterm_funcs funcs tms) tys; 

789 

790 
fun add_literal_funcs (Literal(_,pred,_), funcs) = add_predicate_funcs (pred,funcs) 

791 

792 
fun add_arityClause_funcs (ArityClause {conclLit,...}, funcs) = 

793 
let val TConsLit(_, (_, tcons, tvars)) = conclLit 

794 
in Symtab.update (tcons, length tvars) funcs end; 

17845
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset

795 

18868  796 
fun add_clause_funcs (Clause {literals, ...}, funcs) = 
797 
foldl add_literal_funcs funcs literals 

798 
handle Symtab.DUP a => raise ERROR ("function " ^ a ^ " has multiple arities") 

799 

800 
fun funcs_of_clauses clauses arity_clauses = 

801 
Symtab.dest (foldl add_arityClause_funcs 

802 
(foldl add_clause_funcs Symtab.empty clauses) 

803 
arity_clauses) 

804 

805 

806 
(**** Stringoriented operations ****) 

15347  807 

808 
fun wrap_eq_type typ t = eq_typ_wrapper ^"(" ^ t ^ "," ^ typ ^ ")"; 

809 

18218
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset

810 
(*Only need to wrap equality's arguments with "typeinfo" if the output clauses are typed 
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset

811 
and if we specifically ask for types to be included. *) 
15347  812 
fun string_of_equality (typ,terms) = 
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset

813 
let val [tstr1,tstr2] = map string_of_term terms 
18402
aaba095cf62b
1. changed fol_type, it's not a string type anymore.
mengj
parents:
18390
diff
changeset

814 
val typ' = string_of_fol_type typ 
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset

815 
in 
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset

816 
if !keep_types andalso !special_equal 
18402
aaba095cf62b
1. changed fol_type, it's not a string type anymore.
mengj
parents:
18390
diff
changeset

817 
then "equal(" ^ (wrap_eq_type typ' tstr1) ^ "," ^ 
aaba095cf62b
1. changed fol_type, it's not a string type anymore.
mengj
parents:
18390
diff
changeset

818 
(wrap_eq_type typ' tstr2) ^ ")" 
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset

819 
else "equal(" ^ tstr1 ^ "," ^ tstr2 ^ ")" 
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset

820 
end 
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset

821 
and string_of_term (UVar(x,_)) = x 
18218
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset

822 
 string_of_term (Fun("equal",[typ],terms)) = string_of_equality(typ,terms) 
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset

823 
 string_of_term (Fun (name,typs,[])) = name (*Overloaded consts like 0 don't get types!*) 
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset

824 
 string_of_term (Fun (name,typs,terms)) = 
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset

825 
let val terms_as_strings = map string_of_term terms 
18402
aaba095cf62b
1. changed fol_type, it's not a string type anymore.
mengj
parents:
18390
diff
changeset

826 
val typs' = if !keep_types then map string_of_fol_type typs else [] 
18420
9470061ab283
hashing to eliminate the output of duplicate clauses
paulson
parents:
18411
diff
changeset

827 
in name ^ (paren_pack (terms_as_strings @ typs')) end; 
15347  828 

829 
(* before output the string of the predicate, check if the predicate corresponds to an equality or not. *) 

18218
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset

830 
fun string_of_predicate (Predicate("equal",[typ],terms)) = string_of_equality(typ,terms) 
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset

831 
 string_of_predicate (Predicate(name,typs,terms)) = 
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset

832 
let val terms_as_strings = map string_of_term terms 
18402
aaba095cf62b
1. changed fol_type, it's not a string type anymore.
mengj
parents:
18390
diff
changeset

833 
val typs' = if !keep_types then map string_of_fol_type typs else [] 
18420
9470061ab283
hashing to eliminate the output of duplicate clauses
paulson
parents:
18411
diff
changeset

834 
in name ^ (paren_pack (terms_as_strings @ typs')) end; 
17317
3f12de2e2e6e
IsabelleATP link: sortable axiom names; no spaces in switches; general tidying
paulson
parents:
17312
diff
changeset

835 

3f12de2e2e6e
IsabelleATP link: sortable axiom names; no spaces in switches; general tidying
paulson
parents:
17312
diff
changeset

836 
fun string_of_clausename (cls_id,ax_name) = 
17525
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset

837 
clause_prefix ^ ascii_of ax_name ^ "_" ^ Int.toString cls_id; 
17317
3f12de2e2e6e
IsabelleATP link: sortable axiom names; no spaces in switches; general tidying
paulson
parents:
17312
diff
changeset

838 

3f12de2e2e6e
IsabelleATP link: sortable axiom names; no spaces in switches; general tidying
paulson
parents:
17312
diff
changeset

839 
fun string_of_type_clsname (cls_id,ax_name,idx) = 
17525
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset

840 
string_of_clausename (cls_id,ax_name) ^ "_tcs" ^ (Int.toString idx); 
18863  841 

842 
(*Write a list of strings to a file*) 

843 
fun writeln_strs os = List.app (fn s => TextIO.output (os,s)); 

844 

17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset

845 

18868  846 
(**** Producing DFG files ****) 
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset

847 

18863  848 
(*Attach sign in DFG syntax: false means negate.*) 
849 
fun dfg_sign true s = s 

850 
 dfg_sign false s = "not(" ^ s ^ ")" 

851 

852 
fun dfg_literal (Literal(pol,pred,tag)) = dfg_sign pol (string_of_predicate pred) 

17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset

853 

18798  854 
fun dfg_of_typeLit (LTVar (s,ty)) = "not(" ^ s ^ "(" ^ ty ^ "))" 
18856
4669dec681f4
tidyup of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset

855 
 dfg_of_typeLit (LTFree (s,ty)) = s ^ "(" ^ ty ^ ")"; 
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset

856 

18868  857 
(*Enclose the clause body by quantifiers, if necessary*) 
858 
fun dfg_forall [] body = body 

859 
 dfg_forall vars body = "forall([" ^ commas vars ^ "],\n" ^ body ^ ")" 

17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset

860 

18868  861 
fun gen_dfg_cls (cls_id, ax_name, knd, lits, vars) = 
862 
"clause( %(" ^ knd ^ ")\n" ^ 

863 
dfg_forall vars ("or(" ^ lits ^ ")") ^ ",\n" ^ 

18863  864 
string_of_clausename (cls_id,ax_name) ^ ").\n\n"; 
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset

865 

18869
00741f7280f7
removal of ResClause.num_of_clauses and other simplifications
paulson
parents:
18868
diff
changeset

866 
fun dfg_clause_aux (Clause{literals, types_sorts, ...}) = 
18868  867 
let val lits = map dfg_literal literals 
18869
00741f7280f7
removal of ResClause.num_of_clauses and other simplifications
paulson
parents:
18868
diff
changeset

868 
val (tvar_lits,tfree_lits) = add_typs_aux types_sorts 
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset

869 
val tvar_lits_strs = 
18869
00741f7280f7
removal of ResClause.num_of_clauses and other simplifications
paulson
parents:
18868
diff
changeset

870 
if !keep_types then map dfg_of_typeLit tvar_lits else [] 
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset

871 
val tfree_lits = 
18869
00741f7280f7
removal of ResClause.num_of_clauses and other simplifications
paulson
parents:
18868
diff
changeset

872 
if !keep_types then map dfg_of_typeLit tfree_lits else [] 
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset

873 
in 
17234  874 
(tvar_lits_strs @ lits, tfree_lits) 
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset

875 
end; 
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset

876 

ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset

877 
fun dfg_folterms (Literal(pol,pred,tag)) = 
18856
4669dec681f4
tidyup of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset

878 
let val Predicate (_, _, folterms) = pred 
18218
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset

879 
in folterms end 
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset

880 

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

881 
fun get_uvars (UVar(a,typ)) = [a] 
18868  882 
 get_uvars (Fun (_,typ,tlist)) = union_all(map get_uvars tlist) 
17404
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset

883 

18868  884 
fun dfg_vars (Clause {literals,...}) = 
18920  885 
union_all (map get_uvars (List.concat (map dfg_folterms literals))) 
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset

886 

18798  887 
fun clause2dfg (cls as Clause{axiom_name,clause_id,kind,types_sorts,...}) = 
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset

888 
let val (lits,tfree_lits) = dfg_clause_aux cls 
18798  889 
(*"lits" includes the typing assumptions (TVars)*) 
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset

890 
val vars = dfg_vars cls 
18798  891 
val tvars = get_tvar_strs types_sorts 
892 
val knd = name_of_kind kind 

17234  893 
val lits_str = commas lits 
18868  894 
val cls_str = gen_dfg_cls(clause_id, axiom_name, knd, lits_str, tvars@vars) 
18798  895 
in (cls_str, tfree_lits) end; 
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset

896 

18798  897 
fun string_of_arity (name, num) = "(" ^ name ^ "," ^ Int.toString num ^ ")" 
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset

898 

18856
4669dec681f4
tidyup of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset

899 
fun string_of_preds [] = "" 
4669dec681f4
tidyup of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset

900 
 string_of_preds preds = "predicates[" ^ commas(map string_of_arity preds) ^ "].\n"; 
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset

901 

18856
4669dec681f4
tidyup of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset

902 
fun string_of_funcs [] = "" 
4669dec681f4
tidyup of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset

903 
 string_of_funcs funcs = "functions[" ^ commas(map string_of_arity funcs) ^ "].\n" ; 
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset

904 

17234  905 
fun string_of_symbols predstr funcstr = 
906 
"list_of_symbols.\n" ^ predstr ^ funcstr ^ "end_of_list.\n\n"; 

17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset

907 

18798  908 
fun string_of_start name = "begin_problem(" ^ name ^ ").\n\n"; 
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset

909 

18863  910 
fun string_of_descrip name = 
18868  911 
"list_of_descriptions.\nname({*" ^ name ^ 
912 
"*}).\nauthor({*Isabelle*}).\nstatus(unknown).\ndescription({*autogenerated*}).\nend_of_list.\n\n" 

17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset

913 

18863  914 
fun dfg_tfree_clause tfree_lit = 
915 
"clause( %(conjecture)\n" ^ "or( " ^ tfree_lit ^ "),\n" ^ "tfree_tcs" ^ ").\n\n" 

916 

17845
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset

917 
fun string_of_arClauseID (ArityClause {clause_id,axiom_name,...}) = 
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset

918 
arclause_prefix ^ ascii_of axiom_name ^ "_" ^ Int.toString clause_id; 
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset

919 

18863  920 
fun dfg_of_arLit (TConsLit(pol,(c,t,args))) = 
921 
dfg_sign pol (c ^ "(" ^ t ^ paren_pack args ^ ")") 

922 
 dfg_of_arLit (TVarLit(pol,(c,str))) = 

923 
dfg_sign pol (c ^ "(" ^ str ^ ")") 

17525
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset

924 

18863  925 
fun dfg_classrelLits sub sup = 
926 
let val tvar = "(T)" 

927 
in 

928 
"not(" ^ sub ^ tvar ^ "), " ^ sup ^ tvar 

929 
end; 

17525
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset

930 

18868  931 
fun dfg_classrelClause (ClassrelClause {axiom_name,subclass,superclass,...}) = 
932 
"clause(forall([T],\nor( " ^ dfg_classrelLits subclass superclass ^ ")),\n" ^ 

933 
axiom_name ^ ").\n\n"; 

934 

935 
fun dfg_arity_clause (arcls as ArityClause{kind,conclLit,premLits,...}) = 

936 
let val arcls_id = string_of_arClauseID arcls 

937 
val knd = name_of_kind kind 

938 
val TConsLit(_, (_,_,tvars)) = conclLit 

939 
val lits = map dfg_of_arLit (conclLit :: premLits) 

18863  940 
in 
18868  941 
"clause( %(" ^ knd ^ ")\n" ^ 
942 
dfg_forall tvars ("or( " ^ commas lits ^ ")") ^ ",\n" ^ 

943 
arcls_id ^ ").\n\n" 

18863  944 
end; 
945 

946 
(* write out a subgoal in DFG format to the file "xxxx_N"*) 

19719  947 
fun dfg_write_file thms filename (axclauses,classrel_clauses,arity_clauses) = 
18863  948 
let 
19207
33f1b4515ce4
Tidying and tracing. Handling exn CLAUSE so that errors don't reach toplevel.
paulson
parents:
19197
diff
changeset

949 
val _ = Output.debug ("Preparing to write the DFG file " ^ filename) 
19719  950 
val conjectures = make_conjecture_clauses thms 
951 
val axclauses' = make_axiom_clauses axclauses 

18868  952 
val (dfg_clss, tfree_litss) = ListPair.unzip (map clause2dfg conjectures) 
19719  953 
val clss = conjectures @ axclauses' 
18868  954 
val funcs = funcs_of_clauses clss arity_clauses 
955 
and preds = preds_of_clauses clss classrel_clauses arity_clauses 

18863  956 
and probname = Path.pack (Path.base (Path.unpack filename)) 
19719  957 
val (axstrs, _) = ListPair.unzip (map clause2dfg axclauses') 
18863  958 
val tfree_clss = map dfg_tfree_clause (union_all tfree_litss) 
19155  959 
val out = TextIO.openOut filename 
18863  960 
in 
18868  961 
TextIO.output (out, string_of_start probname); 
962 
TextIO.output (out, string_of_descrip probname); 

963 
TextIO.output (out, string_of_symbols (string_of_funcs funcs) (string_of_preds preds)); 

964 
TextIO.output (out, "list_of_clauses(axioms,cnf).\n"); 

965 
writeln_strs out axstrs; 

966 
List.app (curry TextIO.output out o dfg_classrelClause) classrel_clauses; 

967 
List.app (curry TextIO.output out o dfg_arity_clause) arity_clauses; 

968 
TextIO.output (out, "end_of_list.\n\nlist_of_clauses(conjectures,cnf).\n"); 

969 
writeln_strs out tfree_clss; 

970 
writeln_strs out dfg_clss; 

971 
TextIO.output (out, "end_of_list.\n\nend_problem.\n"); 

972 
TextIO.closeOut out 

17525
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset

973 
end; 
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset

974 

ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset

975 

18869
00741f7280f7
removal of ResClause.num_of_clauses and other simplifications
paulson
parents:
18868
diff
changeset

976 
(**** Produce TPTP files ****) 
18868  977 

978 
(*Attach sign in TPTP syntax: false means negate.*) 

979 
fun tptp_sign true s = "++" ^ s 

980 
 tptp_sign false s = "" ^ s 

981 

982 
fun tptp_literal (Literal(pol,pred,tag)) = (*FIXME REMOVE TAGGING*) 

15347  983 
let val pred_string = string_of_predicate pred 
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset

984 
val tagged_pol = 
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset

985 
if (tag andalso !tagged) then (if pol then "+++" else "") 
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset

986 
else (if pol then "++" else "") 
15347  987 
in 
988 
tagged_pol ^ pred_string 

989 
end; 

990 

18798  991 
fun tptp_of_typeLit (LTVar (s,ty)) = "" ^ s ^ "(" ^ ty ^ ")" 
992 
 tptp_of_typeLit (LTFree (s,ty)) = "++" ^ s ^ "(" ^ ty ^ ")"; 

15347  993 

994 
fun gen_tptp_cls (cls_id,ax_name,knd,lits) = 

17317
3f12de2e2e6e
IsabelleATP link: sortable axiom names; no spaces in switches; general tidying
paulson
parents:
17312
diff
changeset

995 
"input_clause(" ^ string_of_clausename (cls_id,ax_name) ^ "," ^ 
18863  996 
knd ^ "," ^ lits ^ ").\n"; 
15347  997 

17317
3f12de2e2e6e
IsabelleATP link: sortable axiom names; no spaces in switches; general tidying
paulson
parents:
17312
diff
changeset

998 
fun gen_tptp_type_cls (cls_id,ax_name,knd,tfree_lit,idx) = 
3f12de2e2e6e
IsabelleATP link: sortable axiom names; no spaces in switches; general tidying
paulson
parents:
17312
diff
changeset

999 
"input_clause(" ^ string_of_type_clsname (cls_id,ax_name,idx) ^ "," ^ 
18863  1000 
knd ^ ",[" ^ tfree_lit ^ "]).\n"; 
15347  1001 

18869
00741f7280f7
removal of ResClause.num_of_clauses and other simplifications
paulson
parents:
18868
diff
changeset

1002 
fun tptp_type_lits (Clause {literals, types_sorts, ...}) = 
00741f7280f7
removal of ResClause.num_of_clauses and other simplifications
paulson
parents:
18868
diff
changeset

1003 
let val lits = map tptp_literal literals 
00741f7280f7
removal of ResClause.num_of_clauses and other simplifications
paulson
parents:
18868
diff
changeset

1004 
val (tvar_lits,tfree_lits) = add_typs_aux types_sorts 
00741f7280f7
removal of ResClause.num_of_clauses and other simplifications
paulson
parents:
18868
diff
changeset

1005 
val tvar_lits_strs = 
00741f7280f7
removal of ResClause.num_of_clauses and other simplifications
paulson
parents:
18868
diff
changeset

1006 
if !keep_types then map tptp_of_typeLit tvar_lits else [] 
00741f7280f7
removal of ResClause.num_of_clauses and other simplifications
paulson
parents:
18868
diff
changeset

1007 
val tfree_lits = 
00741f7280f7
removal of ResClause.num_of_clauses and other simplifications
paulson
parents:
18868
diff
changeset

1008 
if !keep_types then map tptp_of_typeLit tfree_lits else [] 
15347  1009 
in 
17305
6cef3aedd661
axioms now included in tptp files, no /bin/cat and various tidying
paulson
parents:
17261
diff
changeset

1010 
(tvar_lits_strs @ lits, tfree_lits) 
15347  1011 
end; 
1012 

18869
00741f7280f7
removal of ResClause.num_of_clauses and other simplifications
paulson
parents:
18868
diff
changeset

1013 
fun clause2tptp (cls as Clause {clause_id, axiom_name, kind, ...}) = 
17422  1014 
let val (lits,tfree_lits) = tptp_type_lits cls 
17305
6cef3aedd661
axioms now included in tptp files, no /bin/cat and various tidying
paulson
parents:
17261
diff
changeset

1015 
(*"lits" includes the typing assumptions (TVars)*) 
18869
00741f7280f7
removal of ResClause.num_of_clauses and other simplifications
paulson
parents:
18868
diff
changeset

1016 
val knd = name_of_kind kind 
00741f7280f7
removal of ResClause.num_of_clauses and other simplifications
paulson
parents:
18868
diff
changeset

1017 
val cls_str = gen_tptp_cls(clause_id, axiom_name, knd, bracket_pack lits) 
15608  1018 
in 
1019 
(cls_str,tfree_lits) 

1020 
end; 

1021 

18863  1022 
fun tptp_tfree_clause tfree_lit = 
1023 
"input_clause(" ^ "tfree_tcs," ^ "conjecture" ^ ",[" ^ tfree_lit ^ "]).\n"; 

15608  1024 

17525
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset

1025 
fun tptp_of_arLit (TConsLit(b,(c,t,args))) = 
18868  1026 
tptp_sign b (c ^ "(" ^ t ^ paren_pack args ^ ")") 
17525
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset

1027 
 tptp_of_arLit (TVarLit(b,(c,str))) = 
18868  1028 
tptp_sign b (c ^ "(" ^ str ^ ")") 
15347  1029 

18868  1030 
fun tptp_arity_clause (arcls as ArityClause{kind,conclLit,premLits,...}) = 
1031 
let val arcls_id = string_of_arClauseID arcls 

1032 
val knd = name_of_kind kind 

1033 
val lits = map tptp_of_arLit (conclLit :: premLits) 

1034 
in 

1035 
"input_clause(" ^ arcls_id ^ "," ^ knd ^ "," ^ bracket_pack lits ^ ").\n" 

1036 
end; 

15347  1037 

1038 
fun tptp_classrelLits sub sup = 

1039 
let val tvar = "(T)" 

1040 
in 

18411
2d3165a0fb40
No axiom, arity or classrel clauses contain HOL.type. Negative occurrences are
paulson
parents:
18409
diff
changeset

1041 
"[" ^ sub ^ tvar ^ ",++" ^ sup ^ tvar ^ "]" 
15347  1042 
end; 
1043 

18868  1044 
fun tptp_classrelClause (ClassrelClause {axiom_name,subclass,superclass,...}) = 
1045 
"input_clause(" ^ axiom_name ^ ",axiom," ^ tptp_classrelLits subclass superclass ^ ").\n" 

17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset

1046 

18863  1047 
(* write out a subgoal as tptp clauses to the file "xxxx_N"*) 
19443
e32a4703d834
Take conjectures and axioms as thms when convert them to ResClause.clause format.
mengj
parents:
19354
diff
changeset

1048 
fun tptp_write_file thms filename (axclauses,classrel_clauses,arity_clauses) = 
18863  1049 
let 
19207
33f1b4515ce4
Tidying and tracing. Handling exn CLAUSE so that errors don't reach toplevel.
paulson
parents:
19197
diff
changeset

1050 
val _ = Output.debug ("Preparing to write the TPTP file " ^ filename) 
19443
e32a4703d834
Take conjectures and axioms as thms when convert them to ResClause.clause format.
mengj
parents:
19354
diff
changeset

1051 
val clss = make_conjecture_clauses thms 
e32a4703d834
Take conjectures and axioms as thms when convert them to ResClause.clause format.
mengj
parents:
19354
diff
changeset

1052 
val axclauses' = make_axiom_clauses axclauses 
18863  1053 
val (tptp_clss,tfree_litss) = ListPair.unzip (map clause2tptp clss) 
1054 
val tfree_clss = map tptp_tfree_clause (foldl (op union_string) [] tfree_litss) 

1055 
val out = TextIO.openOut filename 

1056 
in 

19197
92404b5c20ad
tptp_write_file now takes goals and axioms as Term.term and writes them to a file.
mengj
parents:
19176
diff
changeset

1057 
List.app (curry TextIO.output out o #1 o clause2tptp) axclauses'; 
18863  1058 
writeln_strs out tfree_clss; 
1059 
writeln_strs out tptp_clss; 

18868  1060 
List.app (curry TextIO.output out o tptp_classrelClause) classrel_clauses; 
1061 
List.app (curry TextIO.output out o tptp_arity_clause) arity_clauses; 

18863  1062 
TextIO.closeOut out 
1063 
end; 

1064 

19354  1065 

1066 

1067 

1068 

15347  1069 
end; 