author  paulson 
Wed, 15 Nov 2006 11:33:59 +0100  
changeset 21373  18f519614978 
parent 21290  33b6bb5d6ab8 
child 21416  f23e4e75dfd3 
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 

20422
35a6a4c863f1
removed the (apparently pointless) signature constraint
paulson
parents:
20418
diff
changeset

9 
(*FIXME: is this signature necessary? Or maybe define and open a Basic_ResClause?*) 
15347  10 
signature RES_CLAUSE = 
11 
sig 

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

20824  14 
datatype fol_type = AtomV of string 
15 
 AtomF of string 

16 
 Comp of string * fol_type list; 

17 
datatype fol_term = UVar of string * fol_type 

18 
 Fun of string * fol_type list * fol_term list; 

19 
datatype predicate = Predicate of string * fol_type list * fol_term list; 

20 
type typ_var and type_literal and literal 

21 
val literals_of_term: Term.term > literal list * (typ_var * Term.sort) list 

18868  22 
val add_typs_aux : (typ_var * string list) list > type_literal list * type_literal list 
23 
val arity_clause_thy: theory > arityClause list 

24 
val ascii_of : string > string 

25 
val bracket_pack : string list > string 

21290
33b6bb5d6ab8
Improvement to classrel clauses: now outputs the minimum needed.
paulson
parents:
21254
diff
changeset

26 
val make_classrel_clauses: theory > class list > class list > classrelClause list 
18868  27 
val clause_prefix : string 
28 
val clause2tptp : clause > string * string list 

29 
val const_prefix : string 

20022  30 
val dfg_write_file: thm list > string > 
31 
((thm * (string * int)) list * classrelClause list * arityClause list) > string list 

18868  32 
val fixed_var_prefix : string 
33 
val gen_tptp_cls : int * string * string * string > string 

34 
val gen_tptp_type_cls : int * string * string * string * int > string 

35 
val get_axiomName : clause > string 

20824  36 
val get_literals : clause > literal list 
18868  37 
val init : theory > unit 
38 
val isMeta : string > bool 

39 
val isTaut : clause > bool 

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

40 
val keep_types : bool ref 
18868  41 
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

42 
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

43 
val make_conjecture_clauses : thm list > clause list 
18868  44 
val make_fixed_const : string > string 
45 
val make_fixed_type_const : string > string 

46 
val make_fixed_type_var : string > string 

47 
val make_fixed_var : string > string 

48 
val make_schematic_type_var : string * int > string 

49 
val make_schematic_var : string * int > string 

50 
val make_type_class : string > string 

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

52 
val mk_typ_var_sort : Term.typ > typ_var * sort 

53 
val paren_pack : string list > string 

54 
val schematic_var_prefix : string 

55 
val special_equal : bool ref 

56 
val string_of_fol_type : fol_type > string 

57 
val tconst_prefix : string 

58 
val tfree_prefix : string 

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

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

60 
val tptp_classrelClause : classrelClause > string 
18868  61 
val tptp_of_typeLit : type_literal > string 
18863  62 
val tptp_tfree_clause : string > string 
20022  63 
val tptp_write_file: thm list > string > 
64 
((thm * (string * int)) list * classrelClause list * arityClause list) > string list 

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

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

66 
val union_all : ''a list list > ''a list 
18863  67 
val writeln_strs: TextIO.outstream > TextIO.vector list > unit 
19719  68 
val dfg_sign: bool > string > string 
69 
val dfg_of_typeLit: type_literal > string 

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

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

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

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

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

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

76 
val dfg_tfree_clause : string > string 

77 
val string_of_start: string > string 

78 
val string_of_descrip : string > string 

79 
val string_of_symbols: string > string > string 

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

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

82 
val dfg_classrelClause: classrelClause > string 

83 
val dfg_arity_clause: arityClause > string 

84 
end; 

15347  85 

20422
35a6a4c863f1
removed the (apparently pointless) signature constraint
paulson
parents:
20418
diff
changeset

86 
structure ResClause = 
15347  87 
struct 
88 

89 
(* Added for typed equality *) 

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

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

92 

93 

94 
val schematic_var_prefix = "V_"; 

95 
val fixed_var_prefix = "v_"; 

96 

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

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

98 
val tfree_prefix = "t_"; 
15347  99 

100 
val clause_prefix = "cls_"; 

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

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

102 
val clrelclause_prefix = "clsrel_"; 
15347  103 

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

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

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

106 
val class_prefix = "class_"; 
15347  107 

17775  108 
fun union_all xss = foldl (op union) [] xss; 
109 

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

15347  111 
val const_trans_table = 
112 
Symtab.make [("op =", "equal"), 

19277  113 
("Orderings.less_eq", "lessequals"), 
114 
("Orderings.less", "less"), 

15347  115 
("op &", "and"), 
116 
("op ", "or"), 

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

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

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

119 
("HOL.times", "times"), 
18676  120 
("Divides.op div", "div"), 
121 
("HOL.divide", "divide"), 

15347  122 
("op >", "implies"), 
17375  123 
("{}", "emptyset"), 
15347  124 
("op :", "in"), 
125 
("op Un", "union"), 

18390  126 
("op Int", "inter"), 
20790
a9595fdc02b1
Added the combinator constants to the constants table.
mengj
parents:
20422
diff
changeset

127 
("List.op @", "append"), 
21254
d53f76357f41
incorporated former theories Reconstruction and ResAtpMethods into ATP_Linkup;
wenzelm
parents:
20854
diff
changeset

128 
("ATP_Linkup.fequal", "fequal"), 
d53f76357f41
incorporated former theories Reconstruction and ResAtpMethods into ATP_Linkup;
wenzelm
parents:
20854
diff
changeset

129 
("ATP_Linkup.COMBI", "COMBI"), 
d53f76357f41
incorporated former theories Reconstruction and ResAtpMethods into ATP_Linkup;
wenzelm
parents:
20854
diff
changeset

130 
("ATP_Linkup.COMBK", "COMBK"), 
d53f76357f41
incorporated former theories Reconstruction and ResAtpMethods into ATP_Linkup;
wenzelm
parents:
20854
diff
changeset

131 
("ATP_Linkup.COMBB", "COMBB"), 
d53f76357f41
incorporated former theories Reconstruction and ResAtpMethods into ATP_Linkup;
wenzelm
parents:
20854
diff
changeset

132 
("ATP_Linkup.COMBC", "COMBC"), 
d53f76357f41
incorporated former theories Reconstruction and ResAtpMethods into ATP_Linkup;
wenzelm
parents:
20854
diff
changeset

133 
("ATP_Linkup.COMBS", "COMBS"), 
d53f76357f41
incorporated former theories Reconstruction and ResAtpMethods into ATP_Linkup;
wenzelm
parents:
20854
diff
changeset

134 
("ATP_Linkup.COMBB'", "COMBB_e"), 
d53f76357f41
incorporated former theories Reconstruction and ResAtpMethods into ATP_Linkup;
wenzelm
parents:
20854
diff
changeset

135 
("ATP_Linkup.COMBC'", "COMBC_e"), 
d53f76357f41
incorporated former theories Reconstruction and ResAtpMethods into ATP_Linkup;
wenzelm
parents:
20854
diff
changeset

136 
("ATP_Linkup.COMBS'", "COMBS_e")]; 
15347  137 

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

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

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

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

141 
("~=>", "map")]; 
15347  142 

15610  143 
(*Escaping of special characters. 
144 
Alphanumeric characters are left unchanged. 

145 
The character _ goes to __ 

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

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

148 
local 

149 

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

151 

15347  152 
fun ascii_of_c c = 
15610  153 
if Char.isAlphaNum c then String.str c 
154 
else if c = #"_" then "__" 

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

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

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

158 
else "" 

15347  159 

15610  160 
in 
161 

162 
val ascii_of = String.translate ascii_of_c; 

163 

164 
end; 

15347  165 

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

166 
(* 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

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

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

169 

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

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

171 

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

172 

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

173 
(*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

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

175 
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

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

177 

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

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

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

181 
fun make_schematic_var v = schematic_var_prefix ^ (ascii_of_indexname v); 
15347  182 
fun make_fixed_var x = fixed_var_prefix ^ (ascii_of x); 
183 

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

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

185 
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

186 
fun make_fixed_type_var x = tfree_prefix ^ (ascii_of (trim_type_var x)); 
15347  187 

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

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

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

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

192 

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

193 
fun lookup_type_const c = 
17412  194 
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

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

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

197 

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

198 
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

199 
 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

200 

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

201 
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

202 

17261  203 
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

204 

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

205 

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

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

208 
val keep_types = ref true; 
15347  209 

210 
datatype kind = Axiom  Hypothesis  Conjecture; 

211 
fun name_of_kind Axiom = "axiom" 

212 
 name_of_kind Hypothesis = "hypothesis" 

213 
 name_of_kind Conjecture = "conjecture"; 

214 

215 
type clause_id = int; 

216 
type axiom_name = string; 

217 
type polarity = bool; 

218 

219 
(**** Isabelle FOL clauses ****) 

220 

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

221 
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

222 

18798  223 
(*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

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

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

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

227 

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

228 
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

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

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

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

232 

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

233 
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

234 
 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

235 
 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

236 

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

237 

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

15347  240 

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

241 
datatype fol_term = UVar of string * fol_type 
20038  242 
 Fun of string * fol_type list * fol_term list; 
20824  243 
datatype predicate = Predicate of string * fol_type list * fol_term list; 
15347  244 

20018  245 
datatype literal = Literal of polarity * predicate; 
15347  246 

17999  247 
fun mk_typ_var_sort (TFree(a,s)) = (FOLTFree a,s) 
248 
 mk_typ_var_sort (TVar(v,s)) = (FOLTVar v,s); 

249 

250 

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

251 
(*A clause has firstorder literals and other, typerelated literals*) 
15347  252 
datatype clause = 
253 
Clause of {clause_id: clause_id, 

254 
axiom_name: axiom_name, 

19447  255 
th: thm, 
15347  256 
kind: kind, 
257 
literals: literal list, 

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

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

259 

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

260 
fun get_axiomName (Clause cls) = #axiom_name cls; 
15347  261 

20824  262 
fun get_literals (Clause cls) = #literals cls; 
263 

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

264 
exception CLAUSE of string * term; 
15347  265 

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

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

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

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

270 

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

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

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

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

275 

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

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

277 

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

278 

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

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

280 
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

281 

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

282 
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

283 

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

284 
(*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

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

286 
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

287 

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

288 

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

289 
(*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

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

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

293 
val t = make_fixed_type_const a 
18798  294 
in (Comp(t,folTyps), ts) end 
295 
 type_of (TFree (a,s)) = (AtomF(make_fixed_type_var a), [(FOLTFree a, s)]) 

296 
 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

297 
and types_of Ts = 
18798  298 
let val (folTyps,ts) = ListPair.unzip (map type_of Ts) 
299 
in (folTyps, union_all ts) end; 

15390  300 

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

301 

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

302 
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

303 

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

306 
val isMeta = String.isPrefix "METAHYP1_" 

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

307 

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

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

312 
 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

313 
 pred_name_type t = raise CLAUSE("Predicate input unexpected", t); 
15347  314 

15615  315 

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

316 
(* For typed equality *) 
15615  317 
(* here "arg_typ" is the type of "="'s argument's type, not the type of the equality *) 
318 
(* Find type of equality arg *) 

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

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

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

321 
in folT end; 
15347  322 

18798  323 
fun fun_name_type (Const(c,T)) args = (make_fixed_const c, const_types_of (c,T)) 
324 
 fun_name_type (Free(x,T)) args = 

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

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

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

327 
 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

328 

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

329 
(*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

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

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

336 
in 
18798  337 
if isMeta x then (UVar(make_schematic_var(x,0),folType), ts) 
20038  338 
else (Fun(make_fixed_var x, [], []), ts) (*Frees don't need types!*) 
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset

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

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

341 
let val (f,args) = strip_comb app 
18798  342 
val (funName,(contys,ts1)) = fun_name_type f args 
343 
val (args',ts2) = terms_of args 

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

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

346 
end 
18798  347 
and terms_of ts = ListPair.unzip (map term_of ts) 
15390  348 

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

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

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

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

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

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

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

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

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

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

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

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

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

363 
end; 
15347  364 

20018  365 
(*Treatment of literals, possibly negated*) 
366 
fun predicate_of ((Const("Not",_) $ P), polarity) = predicate_of (P, not polarity) 

367 
 predicate_of (term,polarity) = (pred_of (strip_comb term), polarity); 

15347  368 

17888  369 
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

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

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

372 
 literals_of_term1 (lits, ts) P = 
20018  373 
let val ((pred, ts'), polarity) = predicate_of (P,true) 
374 
val lits' = Literal(polarity,pred) :: lits 

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

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

378 

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

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

380 

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

381 

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

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

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

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

385 
 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

386 
(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

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

388 

18798  389 
(*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

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

391 
 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

392 
sorts_on_typs (v,s) (*IGNORE sort "type"*) 
18798  393 
 sorts_on_typs ((FOLTVar indx), s::ss) = 
394 
LTVar(make_type_class s, make_schematic_type_var indx) :: 

395 
sorts_on_typs ((FOLTVar indx), ss) 

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

397 
LTFree(make_type_class s, make_fixed_type_var x) :: 

398 
sorts_on_typs ((FOLTFree x), ss); 

15347  399 

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

400 

18798  401 
fun pred_of_sort (LTVar (s,ty)) = (s,1) 
402 
 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

403 

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

404 
(*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

405 
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

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

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

408 
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

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

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

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

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

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

414 
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

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

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

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

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

419 

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

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

423 

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

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

426 

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

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

429 
 too_general_terms (Fun _, _) = false 

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

431 

20018  432 
fun too_general_lit (Literal (true, Predicate("equal",_,[x,y]))) = 
18920  433 
too_general_terms (x,y) orelse too_general_terms(y,x) 
434 
 too_general_lit _ = false; 

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

435 

20015
1ffcf4802802
Literals aren't sorted any more. Output overloaded constants' type var instantiations.
mengj
parents:
19719
diff
changeset

436 

1ffcf4802802
Literals aren't sorted any more. Output overloaded constants' type var instantiations.
mengj
parents:
19719
diff
changeset

437 

1ffcf4802802
Literals aren't sorted any more. Output overloaded constants' type var instantiations.
mengj
parents:
19719
diff
changeset

438 
(** make axiom and conjecture clauses. **) 
1ffcf4802802
Literals aren't sorted any more. Output overloaded constants' type var instantiations.
mengj
parents:
19719
diff
changeset

439 

1ffcf4802802
Literals aren't sorted any more. Output overloaded constants' type var instantiations.
mengj
parents:
19719
diff
changeset

440 
exception MAKE_CLAUSE; 
1ffcf4802802
Literals aren't sorted any more. Output overloaded constants' type var instantiations.
mengj
parents:
19719
diff
changeset

441 
fun make_clause (clause_id, axiom_name, th, kind) = 
20018  442 
let val term = prop_of th 
443 
val (lits,types_sorts) = literals_of_term term 

444 
in if forall isFalse lits 

445 
then error "Problem too trivial for resolution (empty clause)" 

446 
else if kind=Axiom andalso forall too_general_lit lits 

447 
then (Output.debug ("Omitting " ^ axiom_name ^ ": equalities are too general"); 

448 
raise MAKE_CLAUSE) 

449 
else Clause {clause_id = clause_id, axiom_name = axiom_name, th = th, 

450 
kind = kind, literals = lits, types_sorts = types_sorts} 

451 
end; 

20015
1ffcf4802802
Literals aren't sorted any more. Output overloaded constants' type var instantiations.
mengj
parents:
19719
diff
changeset

452 

1ffcf4802802
Literals aren't sorted any more. Output overloaded constants' type var instantiations.
mengj
parents:
19719
diff
changeset

453 
fun get_tvar_strs [] = [] 
1ffcf4802802
Literals aren't sorted any more. Output overloaded constants' type var instantiations.
mengj
parents:
19719
diff
changeset

454 
 get_tvar_strs ((FOLTVar indx,s)::tss) = 
20854  455 
insert (op =) (make_schematic_type_var indx) (get_tvar_strs tss) 
20015
1ffcf4802802
Literals aren't sorted any more. Output overloaded constants' type var instantiations.
mengj
parents:
19719
diff
changeset

456 
 get_tvar_strs((FOLTFree x,s)::tss) = get_tvar_strs tss 
1ffcf4802802
Literals aren't sorted any more. Output overloaded constants' type var instantiations.
mengj
parents:
19719
diff
changeset

457 

1ffcf4802802
Literals aren't sorted any more. Output overloaded constants' type var instantiations.
mengj
parents:
19719
diff
changeset

458 
(* check if a clause is firstorder before making a conjecture clause*) 
20418  459 
fun make_conjecture_clause n th = 
460 
if Meson.is_fol_term (prop_of th) then make_clause(n, "conjecture", th, Conjecture) 

461 
else raise CLAUSE("Goal is not FOL", prop_of th); 

462 

20015
1ffcf4802802
Literals aren't sorted any more. Output overloaded constants' type var instantiations.
mengj
parents:
19719
diff
changeset

463 
fun make_conjecture_clauses_aux _ [] = [] 
1ffcf4802802
Literals aren't sorted any more. Output overloaded constants' type var instantiations.
mengj
parents:
19719
diff
changeset

464 
 make_conjecture_clauses_aux n (t::ts) = 
1ffcf4802802
Literals aren't sorted any more. Output overloaded constants' type var instantiations.
mengj
parents:
19719
diff
changeset

465 
make_conjecture_clause n t :: make_conjecture_clauses_aux (n+1) ts 
1ffcf4802802
Literals aren't sorted any more. Output overloaded constants' type var instantiations.
mengj
parents:
19719
diff
changeset

466 

1ffcf4802802
Literals aren't sorted any more. Output overloaded constants' type var instantiations.
mengj
parents:
19719
diff
changeset

467 
val make_conjecture_clauses = make_conjecture_clauses_aux 0 
1ffcf4802802
Literals aren't sorted any more. Output overloaded constants' type var instantiations.
mengj
parents:
19719
diff
changeset

468 

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

469 
(*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

470 
fun make_axiom_clause thm (ax_name,cls_id) = 
20022  471 
if Meson.is_fol_term (prop_of thm) 
472 
then (SOME (make_clause(cls_id, ax_name, thm, Axiom)) handle MAKE_CLAUSE => NONE) 

473 
else (Output.debug ("Omitting " ^ ax_name ^ ": Axiom is not FOL"); NONE) 

20015
1ffcf4802802
Literals aren't sorted any more. Output overloaded constants' type var instantiations.
mengj
parents:
19719
diff
changeset

474 

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

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

476 
 make_axiom_clauses ((thm,(name,id))::thms) = 
20022  477 
case make_axiom_clause thm (name,id) of 
478 
SOME cls => if isTaut cls then make_axiom_clauses thms 

479 
else (name,cls) :: make_axiom_clauses thms 

480 
 NONE => make_axiom_clauses thms; 

19354  481 

15347  482 
(**** Isabelle arities ****) 
483 

484 
exception ARCLAUSE of string; 

485 

486 
type class = string; 

487 
type tcons = string; 

488 

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

15347  491 

492 
datatype arityClause = 

21373
18f519614978
Arity clauses are now produced only for types and type classes actually used.
paulson
parents:
21290
diff
changeset

493 
ArityClause of {axiom_name: axiom_name, 
15347  494 
kind: kind, 
495 
conclLit: arLit, 

496 
premLits: arLit list}; 

497 

498 

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

15347  501 

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

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

503 
 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

504 
 pack_sort(tvar, cls::srt) = (make_type_class cls, tvar) :: pack_sort(tvar, srt); 
15347  505 

18868  506 
fun make_TVarLit (b, (cls,str)) = TVarLit(b, (cls,str)); 
507 
fun make_TConsLit (b, (cls,tcons,tvars)) = 

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

15347  509 

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

510 
(*Arity of type constructor tcon :: (arg1,...,argN)res*) 
21373
18f519614978
Arity clauses are now produced only for types and type classes actually used.
paulson
parents:
21290
diff
changeset

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

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

514 
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

515 
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

516 
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

517 
in 
21373
18f519614978
Arity clauses are now produced only for types and type classes actually used.
paulson
parents:
21290
diff
changeset

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

519 
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

520 
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

521 
end; 
15347  522 

523 

524 
(**** Isabelle class relations ****) 

525 

526 
datatype classrelClause = 

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

529 
superclass: class}; 
21290
33b6bb5d6ab8
Improvement to classrel clauses: now outputs the minimum needed.
paulson
parents:
21254
diff
changeset

530 

33b6bb5d6ab8
Improvement to classrel clauses: now outputs the minimum needed.
paulson
parents:
21254
diff
changeset

531 
(*Generate all pairs (sub,super) such that sub is a proper subclass of super in theory thy.*) 
33b6bb5d6ab8
Improvement to classrel clauses: now outputs the minimum needed.
paulson
parents:
21254
diff
changeset

532 
fun class_pairs thy subs supers = 
33b6bb5d6ab8
Improvement to classrel clauses: now outputs the minimum needed.
paulson
parents:
21254
diff
changeset

533 
let val class_less = Sorts.class_less(Sign.classes_of thy) 
33b6bb5d6ab8
Improvement to classrel clauses: now outputs the minimum needed.
paulson
parents:
21254
diff
changeset

534 
fun add_super sub (super,pairs) = 
33b6bb5d6ab8
Improvement to classrel clauses: now outputs the minimum needed.
paulson
parents:
21254
diff
changeset

535 
if class_less (sub,super) then (sub,super)::pairs else pairs 
33b6bb5d6ab8
Improvement to classrel clauses: now outputs the minimum needed.
paulson
parents:
21254
diff
changeset

536 
fun add_supers (sub,pairs) = foldl (add_super sub) pairs supers 
33b6bb5d6ab8
Improvement to classrel clauses: now outputs the minimum needed.
paulson
parents:
21254
diff
changeset

537 
in foldl add_supers [] subs end; 
15347  538 

21290
33b6bb5d6ab8
Improvement to classrel clauses: now outputs the minimum needed.
paulson
parents:
21254
diff
changeset

539 
fun make_classrelClause (sub,super) = 
33b6bb5d6ab8
Improvement to classrel clauses: now outputs the minimum needed.
paulson
parents:
21254
diff
changeset

540 
ClassrelClause {axiom_name = clrelclause_prefix ^ ascii_of sub ^ "_" ^ ascii_of super, 
33b6bb5d6ab8
Improvement to classrel clauses: now outputs the minimum needed.
paulson
parents:
21254
diff
changeset

541 
subclass = make_type_class sub, 
33b6bb5d6ab8
Improvement to classrel clauses: now outputs the minimum needed.
paulson
parents:
21254
diff
changeset

542 
superclass = make_type_class super}; 
15347  543 

21290
33b6bb5d6ab8
Improvement to classrel clauses: now outputs the minimum needed.
paulson
parents:
21254
diff
changeset

544 
fun make_classrel_clauses thy subs supers = 
33b6bb5d6ab8
Improvement to classrel clauses: now outputs the minimum needed.
paulson
parents:
21254
diff
changeset

545 
map make_classrelClause (class_pairs thy subs supers); 
18868  546 

547 

548 
(** Isabelle arities **) 

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

549 

21373
18f519614978
Arity clauses are now produced only for types and type classes actually used.
paulson
parents:
21290
diff
changeset

550 
fun arity_clause _ _ (tcons, []) = [] 
18f519614978
Arity clauses are now produced only for types and type classes actually used.
paulson
parents:
21290
diff
changeset

551 
 arity_clause seen n (tcons, ("HOL.type",_)::ars) = (*ignore*) 
18f519614978
Arity clauses are now produced only for types and type classes actually used.
paulson
parents:
21290
diff
changeset

552 
arity_clause seen n (tcons,ars) 
18f519614978
Arity clauses are now produced only for types and type classes actually used.
paulson
parents:
21290
diff
changeset

553 
 arity_clause seen n (tcons, (ar as (class,_)) :: ars) = 
18f519614978
Arity clauses are now produced only for types and type classes actually used.
paulson
parents:
21290
diff
changeset

554 
if class mem_string seen then (*multiple arities for the same tycon, class pair*) 
18f519614978
Arity clauses are now produced only for types and type classes actually used.
paulson
parents:
21290
diff
changeset

555 
make_axiom_arity_clause (tcons, lookup_type_const tcons ^ "_" ^ class ^ "_" ^ Int.toString n, ar) :: 
18f519614978
Arity clauses are now produced only for types and type classes actually used.
paulson
parents:
21290
diff
changeset

556 
arity_clause seen (n+1) (tcons,ars) 
18f519614978
Arity clauses are now produced only for types and type classes actually used.
paulson
parents:
21290
diff
changeset

557 
else 
18f519614978
Arity clauses are now produced only for types and type classes actually used.
paulson
parents:
21290
diff
changeset

558 
make_axiom_arity_clause (tcons, lookup_type_const tcons ^ "_" ^ class, ar) :: 
18f519614978
Arity clauses are now produced only for types and type classes actually used.
paulson
parents:
21290
diff
changeset

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

560 

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

561 
fun multi_arity_clause [] = [] 
19155  562 
 multi_arity_clause ((tcons,ars) :: tc_arlists) = 
21373
18f519614978
Arity clauses are now produced only for types and type classes actually used.
paulson
parents:
21290
diff
changeset

563 
arity_clause [] 1 (tcons, ars) @ 
19155  564 
multi_arity_clause tc_arlists 
17845
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset

565 

21373
18f519614978
Arity clauses are now produced only for types and type classes actually used.
paulson
parents:
21290
diff
changeset

566 
(*Generate all pairs (tycon,class,sorts) such that tycon belongs to class in theory thy.*) 
18f519614978
Arity clauses are now produced only for types and type classes actually used.
paulson
parents:
21290
diff
changeset

567 
fun type_class_pairs thy tycons classes = 
18f519614978
Arity clauses are now produced only for types and type classes actually used.
paulson
parents:
21290
diff
changeset

568 
let val alg = Sign.classes_of thy 
18f519614978
Arity clauses are now produced only for types and type classes actually used.
paulson
parents:
21290
diff
changeset

569 
fun domain_sorts (tycon,class) = Sorts.mg_domain alg tycon [class] 
18f519614978
Arity clauses are now produced only for types and type classes actually used.
paulson
parents:
21290
diff
changeset

570 
fun add_class tycon (class,pairs) = 
18f519614978
Arity clauses are now produced only for types and type classes actually used.
paulson
parents:
21290
diff
changeset

571 
(class, domain_sorts(tycon,class))::pairs 
18f519614978
Arity clauses are now produced only for types and type classes actually used.
paulson
parents:
21290
diff
changeset

572 
handle Sorts.CLASS_ERROR _ => pairs 
18f519614978
Arity clauses are now produced only for types and type classes actually used.
paulson
parents:
21290
diff
changeset

573 
fun try_classes tycon = (tycon, foldl (add_class tycon) [] classes) 
18f519614978
Arity clauses are now produced only for types and type classes actually used.
paulson
parents:
21290
diff
changeset

574 
in map try_classes tycons end; 
18f519614978
Arity clauses are now produced only for types and type classes actually used.
paulson
parents:
21290
diff
changeset

575 

18f519614978
Arity clauses are now produced only for types and type classes actually used.
paulson
parents:
21290
diff
changeset

576 
fun arity_clause_thy thy tycons classes = 
18f519614978
Arity clauses are now produced only for types and type classes actually used.
paulson
parents:
21290
diff
changeset

577 
multi_arity_clause (type_class_pairs thy tycons classes); 
17845
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset

578 

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

579 

18868  580 
(**** Find occurrences of predicates in clauses ****) 
581 

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

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

584 

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

586 

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

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

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

590 

20018  591 
fun add_literal_preds (Literal(_,pred), preds) = add_predicate_preds (pred,preds) 
18868  592 

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

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

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

596 
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

597 

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

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

601 

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

603 
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

604 

21373
18f519614978
Arity clauses are now produced only for types and type classes actually used.
paulson
parents:
21290
diff
changeset

605 
(*Not sure the TVar case is ever used*) 
18f519614978
Arity clauses are now produced only for types and type classes actually used.
paulson
parents:
21290
diff
changeset

606 
fun class_of_arityLit (TConsLit(_, (tclass, _, _))) = tclass 
18f519614978
Arity clauses are now produced only for types and type classes actually used.
paulson
parents:
21290
diff
changeset

607 
 class_of_arityLit (TVarLit(_, (tclass, _))) = tclass; 
18f519614978
Arity clauses are now produced only for types and type classes actually used.
paulson
parents:
21290
diff
changeset

608 

18f519614978
Arity clauses are now produced only for types and type classes actually used.
paulson
parents:
21290
diff
changeset

609 
fun add_arityClause_preds (ArityClause {conclLit,premLits,...}, preds) = 
18f519614978
Arity clauses are now produced only for types and type classes actually used.
paulson
parents:
21290
diff
changeset

610 
let val classes = map class_of_arityLit (conclLit::premLits) 
18f519614978
Arity clauses are now produced only for types and type classes actually used.
paulson
parents:
21290
diff
changeset

611 
fun upd (class,preds) = Symtab.update (class,1) preds 
18f519614978
Arity clauses are now produced only for types and type classes actually used.
paulson
parents:
21290
diff
changeset

612 
in foldl upd preds classes end; 
18868  613 

614 
fun preds_of_clauses clauses clsrel_clauses arity_clauses = 

615 
Symtab.dest 

616 
(foldl add_classrelClause_preds 

617 
(foldl add_arityClause_preds 

618 
(foldl add_clause_preds Symtab.empty clauses) 

619 
arity_clauses) 

620 
clsrel_clauses) 

18798  621 

18868  622 
(*** Find occurrences of functions in clauses ***) 
623 

624 
fun add_foltype_funcs (AtomV _, funcs) = funcs 

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

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

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

628 

20038  629 
fun add_folterm_funcs (UVar(_,ty), funcs) = add_foltype_funcs (ty, funcs) 
18868  630 
 add_folterm_funcs (Fun(a,tys,tms), funcs) = 
631 
foldl add_foltype_funcs 

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

633 
tms) 

634 
tys 

18798  635 

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

638 

20018  639 
fun add_literal_funcs (Literal(_,pred), funcs) = add_predicate_funcs (pred,funcs) 
18868  640 

20038  641 
(*TFrees are recorded as constants*) 
642 
fun add_type_sort_funcs ((FOLTVar _, _), funcs) = funcs 

643 
 add_type_sort_funcs ((FOLTFree a, _), funcs) = 

644 
Symtab.update (make_fixed_type_var a, 0) funcs 

645 

18868  646 
fun add_arityClause_funcs (ArityClause {conclLit,...}, funcs) = 
647 
let val TConsLit(_, (_, tcons, tvars)) = conclLit 

648 
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

649 

20038  650 
fun add_clause_funcs (Clause {literals, types_sorts, ...}, funcs) = 
651 
foldl add_literal_funcs (foldl add_type_sort_funcs funcs types_sorts) 

652 
literals 

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

655 
fun funcs_of_clauses clauses arity_clauses = 

656 
Symtab.dest (foldl add_arityClause_funcs 

657 
(foldl add_clause_funcs Symtab.empty clauses) 

658 
arity_clauses) 

659 

660 

661 
(**** Stringoriented operations ****) 

15347  662 

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

664 

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

665 
(*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

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

668 
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

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

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

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

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

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

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

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

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

677 
 string_of_term (Fun("equal",[typ],terms)) = string_of_equality(typ,terms) 
20015
1ffcf4802802
Literals aren't sorted any more. Output overloaded constants' type var instantiations.
mengj
parents:
19719
diff
changeset

678 
 string_of_term (Fun (name,typs,[])) = name ^ (paren_pack (map string_of_fol_type typs)) 
18218
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset

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

680 
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

681 
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

682 
in name ^ (paren_pack (terms_as_strings @ typs')) end; 
15347  683 

684 
(* 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

685 
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

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

687 
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

688 
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

689 
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

690 

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

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

692 
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

693 

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

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

695 
string_of_clausename (cls_id,ax_name) ^ "_tcs" ^ (Int.toString idx); 
18863  696 

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

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

699 

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

700 

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

702 

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

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

706 

20018  707 
fun dfg_literal (Literal(pol,pred)) = dfg_sign pol (string_of_predicate pred) 
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset

708 

18798  709 
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

710 
 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

711 

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

714 
 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

715 

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

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

18863  719 
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

720 

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

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

723 
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

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

725 
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

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

727 
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

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

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

731 

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

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

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

735 

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

736 
fun get_uvars (UVar(a,typ)) = [a] 
18868  737 
 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

738 

18868  739 
fun dfg_vars (Clause {literals,...}) = 
18920  740 
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

741 

18798  742 
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

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

745 
val vars = dfg_vars cls 
18798  746 
val tvars = get_tvar_strs types_sorts 
20038  747 
val cls_str = gen_dfg_cls(clause_id, axiom_name, name_of_kind kind, 
748 
commas lits, tvars@vars) 

18798  749 
in (cls_str, tfree_lits) end; 
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset

750 

18798  751 
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

752 

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

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

754 
 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

755 

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

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

757 
 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

758 

17234  759 
fun string_of_symbols predstr funcstr = 
760 
"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

761 

18798  762 
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

763 

18863  764 
fun string_of_descrip name = 
18868  765 
"list_of_descriptions.\nname({*" ^ name ^ 
766 
"*}).\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

767 

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

770 

21373
18f519614978
Arity clauses are now produced only for types and type classes actually used.
paulson
parents:
21290
diff
changeset

771 
fun string_of_arClauseID (ArityClause {axiom_name,...}) = 
18f519614978
Arity clauses are now produced only for types and type classes actually used.
paulson
parents:
21290
diff
changeset

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

773 

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

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

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

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

778 

20038  779 
fun dfg_classrelLits sub sup = "not(" ^ sub ^ "(T)), " ^ sup ^ "(T)"; 
17525
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset

780 

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

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

784 

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

786 
let val arcls_id = string_of_arClauseID arcls 

787 
val knd = name_of_kind kind 

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

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

18863  790 
in 
18868  791 
"clause( %(" ^ knd ^ ")\n" ^ 
792 
dfg_forall tvars ("or( " ^ commas lits ^ ")") ^ ",\n" ^ 

793 
arcls_id ^ ").\n\n" 

18863  794 
end; 
795 

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

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

799 
val _ = Output.debug ("Preparing to write the DFG file " ^ filename) 
19719  800 
val conjectures = make_conjecture_clauses thms 
20038  801 
val (clnames,axclauses) = ListPair.unzip (make_axiom_clauses ax_tuples) 
18868  802 
val (dfg_clss, tfree_litss) = ListPair.unzip (map clause2dfg conjectures) 
20038  803 
val clss = conjectures @ axclauses 
18868  804 
val funcs = funcs_of_clauses clss arity_clauses 
805 
and preds = preds_of_clauses clss classrel_clauses arity_clauses 

18863  806 
and probname = Path.pack (Path.base (Path.unpack filename)) 
20038  807 
val (axstrs, _) = ListPair.unzip (map clause2dfg axclauses) 
18863  808 
val tfree_clss = map dfg_tfree_clause (union_all tfree_litss) 
19155  809 
val out = TextIO.openOut filename 
18863  810 
in 
18868  811 
TextIO.output (out, string_of_start probname); 
812 
TextIO.output (out, string_of_descrip probname); 

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

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

815 
writeln_strs out axstrs; 

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

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

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

819 
writeln_strs out tfree_clss; 

820 
writeln_strs out dfg_clss; 

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

20022  822 
TextIO.closeOut out; 
823 
clnames 

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

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

825 

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

826 

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

827 
(**** Produce TPTP files ****) 
18868  828 

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

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

831 
 tptp_sign false s = "" ^ s 

832 

20018  833 
fun tptp_literal (Literal(pol,pred)) = 
834 
(if pol then "++" else "") ^ string_of_predicate pred; 

15347  835 

18798  836 
fun tptp_of_typeLit (LTVar (s,ty)) = "" ^ s ^ "(" ^ ty ^ ")" 
837 
 tptp_of_typeLit (LTFree (s,ty)) = "++" ^ s ^ "(" ^ ty ^ ")"; 

15347  838 

839 
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

840 
"input_clause(" ^ string_of_clausename (cls_id,ax_name) ^ "," ^ 
18863  841 
knd ^ "," ^ lits ^ ").\n"; 
15347  842 

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

843 
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

844 
"input_clause(" ^ string_of_type_clsname (cls_id,ax_name,idx) ^ "," ^ 
18863  845 
knd ^ ",[" ^ tfree_lit ^ "]).\n"; 
15347  846 

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

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

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

849 
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

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

851 
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

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

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

855 
(tvar_lits_strs @ lits, tfree_lits) 
15347  856 
end; 
857 

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

858 
fun clause2tptp (cls as Clause {clause_id, axiom_name, kind, ...}) = 
17422  859 
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

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

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

862 
val cls_str = gen_tptp_cls(clause_id, axiom_name, knd, bracket_pack lits) 
15608  863 
in 
864 
(cls_str,tfree_lits) 

865 
end; 

866 

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

15608  869 

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

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

872 
 tptp_of_arLit (TVarLit(b,(c,str))) = 
18868  873 
tptp_sign b (c ^ "(" ^ str ^ ")") 
15347  874 

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

877 
val knd = name_of_kind kind 

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

879 
in 

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

881 
end; 

15347  882 

883 
fun tptp_classrelLits sub sup = 

884 
let val tvar = "(T)" 

885 
in 

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

886 
"[" ^ sub ^ tvar ^ ",++" ^ sup ^ tvar ^ "]" 
15347  887 
end; 
888 

18868  889 
fun tptp_classrelClause (ClassrelClause {axiom_name,subclass,superclass,...}) = 
890 
"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

891 

18863  892 
(* write out a subgoal as tptp clauses to the file "xxxx_N"*) 
20038  893 
fun tptp_write_file thms filename (ax_tuples,classrel_clauses,arity_clauses) = 
18863  894 
let 
19207
33f1b4515ce4
Tidying and tracing. Handling exn CLAUSE so that errors don't reach toplevel.
paulson
parents:
19197
diff
changeset

895 
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

896 
val clss = make_conjecture_clauses thms 
20038  897 
val (clnames,axclauses) = ListPair.unzip (make_axiom_clauses ax_tuples) 
18863  898 
val (tptp_clss,tfree_litss) = ListPair.unzip (map clause2tptp clss) 
899 
val tfree_clss = map tptp_tfree_clause (foldl (op union_string) [] tfree_litss) 

900 
val out = TextIO.openOut filename 

901 
in 

20038  902 
List.app (curry TextIO.output out o #1 o clause2tptp) axclauses; 
18863  903 
writeln_strs out tfree_clss; 
904 
writeln_strs out tptp_clss; 

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

20022  907 
TextIO.closeOut out; 
908 
clnames 

18863  909 
end; 
910 

15347  911 
end; 