author | mengj |
Mon, 27 Nov 2006 23:48:10 +0100 | |
changeset 21564 | 519ee3129ee1 |
parent 21560 | d92389321fa7 |
child 21790 | 9d2761d09d91 |
permissions | -rw-r--r-- |
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; |
|
21509
6c5755ad9cae
ATP linkup now generates "new TPTP" rather than "old TPTP"
paulson
parents:
21470
diff
changeset
|
20 |
datatype kind = Axiom | Conjecture; |
6c5755ad9cae
ATP linkup now generates "new TPTP" rather than "old TPTP"
paulson
parents:
21470
diff
changeset
|
21 |
val name_of_kind : kind -> string |
20824 | 22 |
type typ_var and type_literal and literal |
23 |
val literals_of_term: Term.term -> literal list * (typ_var * Term.sort) list |
|
18868 | 24 |
val add_typs_aux : (typ_var * string list) list -> type_literal list * type_literal list |
25 |
val arity_clause_thy: theory -> arityClause list |
|
26 |
val ascii_of : string -> string |
|
21509
6c5755ad9cae
ATP linkup now generates "new TPTP" rather than "old TPTP"
paulson
parents:
21470
diff
changeset
|
27 |
val tptp_pack : string list -> string |
21290
33b6bb5d6ab8
Improvement to classrel clauses: now outputs the minimum needed.
paulson
parents:
21254
diff
changeset
|
28 |
val make_classrel_clauses: theory -> class list -> class list -> classrelClause list |
18868 | 29 |
val clause_prefix : string |
30 |
val clause2tptp : clause -> string * string list |
|
31 |
val const_prefix : string |
|
20022 | 32 |
val dfg_write_file: thm list -> string -> |
33 |
((thm * (string * int)) list * classrelClause list * arityClause list) -> string list |
|
18868 | 34 |
val fixed_var_prefix : string |
21509
6c5755ad9cae
ATP linkup now generates "new TPTP" rather than "old TPTP"
paulson
parents:
21470
diff
changeset
|
35 |
val gen_tptp_cls : int * string * string * string list -> string |
18868 | 36 |
val get_axiomName : clause -> string |
20824 | 37 |
val get_literals : clause -> literal list |
18868 | 38 |
val init : theory -> unit |
39 |
val isMeta : string -> bool |
|
40 |
val isTaut : clause -> bool |
|
17404
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
41 |
val keep_types : bool ref |
18868 | 42 |
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
|
43 |
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
|
44 |
val make_conjecture_clauses : thm list -> clause list |
18868 | 45 |
val make_fixed_const : string -> string |
46 |
val make_fixed_type_const : string -> string |
|
47 |
val make_fixed_type_var : string -> string |
|
48 |
val make_fixed_var : string -> string |
|
49 |
val make_schematic_type_var : string * int -> string |
|
50 |
val make_schematic_var : string * int -> string |
|
51 |
val make_type_class : string -> string |
|
52 |
val mk_fol_type: string * string * fol_type list -> fol_type |
|
53 |
val mk_typ_var_sort : Term.typ -> typ_var * sort |
|
54 |
val paren_pack : string list -> string |
|
55 |
val schematic_var_prefix : string |
|
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 |
val schematic_var_prefix = "V_"; |
|
90 |
val fixed_var_prefix = "v_"; |
|
91 |
||
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
92 |
val tvar_prefix = "T_"; |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
93 |
val tfree_prefix = "t_"; |
15347 | 94 |
|
95 |
val clause_prefix = "cls_"; |
|
17525
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
96 |
val arclause_prefix = "clsarity_" |
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
97 |
val clrelclause_prefix = "clsrel_"; |
15347 | 98 |
|
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
99 |
val const_prefix = "c_"; |
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
100 |
val tconst_prefix = "tc_"; |
16199
ee95ab217fee
no longer emits literals for type class HOL.type; also minor tidying
paulson
parents:
16039
diff
changeset
|
101 |
val class_prefix = "class_"; |
15347 | 102 |
|
17775 | 103 |
fun union_all xss = foldl (op union) [] xss; |
104 |
||
105 |
(*Provide readable names for the more common symbolic functions*) |
|
15347 | 106 |
val const_trans_table = |
107 |
Symtab.make [("op =", "equal"), |
|
19277 | 108 |
("Orderings.less_eq", "lessequals"), |
109 |
("Orderings.less", "less"), |
|
15347 | 110 |
("op &", "and"), |
111 |
("op |", "or"), |
|
19233
77ca20b0ed77
renamed HOL + - * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19207
diff
changeset
|
112 |
("HOL.plus", "plus"), |
77ca20b0ed77
renamed HOL + - * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19207
diff
changeset
|
113 |
("HOL.minus", "minus"), |
77ca20b0ed77
renamed HOL + - * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19207
diff
changeset
|
114 |
("HOL.times", "times"), |
21416 | 115 |
("Divides.div", "div"), |
18676 | 116 |
("HOL.divide", "divide"), |
15347 | 117 |
("op -->", "implies"), |
17375 | 118 |
("{}", "emptyset"), |
15347 | 119 |
("op :", "in"), |
120 |
("op Un", "union"), |
|
18390 | 121 |
("op Int", "inter"), |
20790
a9595fdc02b1
Added the combinator constants to the constants table.
mengj
parents:
20422
diff
changeset
|
122 |
("List.op @", "append"), |
21254
d53f76357f41
incorporated former theories Reconstruction and ResAtpMethods into ATP_Linkup;
wenzelm
parents:
20854
diff
changeset
|
123 |
("ATP_Linkup.fequal", "fequal"), |
d53f76357f41
incorporated former theories Reconstruction and ResAtpMethods into ATP_Linkup;
wenzelm
parents:
20854
diff
changeset
|
124 |
("ATP_Linkup.COMBI", "COMBI"), |
d53f76357f41
incorporated former theories Reconstruction and ResAtpMethods into ATP_Linkup;
wenzelm
parents:
20854
diff
changeset
|
125 |
("ATP_Linkup.COMBK", "COMBK"), |
d53f76357f41
incorporated former theories Reconstruction and ResAtpMethods into ATP_Linkup;
wenzelm
parents:
20854
diff
changeset
|
126 |
("ATP_Linkup.COMBB", "COMBB"), |
d53f76357f41
incorporated former theories Reconstruction and ResAtpMethods into ATP_Linkup;
wenzelm
parents:
20854
diff
changeset
|
127 |
("ATP_Linkup.COMBC", "COMBC"), |
d53f76357f41
incorporated former theories Reconstruction and ResAtpMethods into ATP_Linkup;
wenzelm
parents:
20854
diff
changeset
|
128 |
("ATP_Linkup.COMBS", "COMBS"), |
d53f76357f41
incorporated former theories Reconstruction and ResAtpMethods into ATP_Linkup;
wenzelm
parents:
20854
diff
changeset
|
129 |
("ATP_Linkup.COMBB'", "COMBB_e"), |
d53f76357f41
incorporated former theories Reconstruction and ResAtpMethods into ATP_Linkup;
wenzelm
parents:
20854
diff
changeset
|
130 |
("ATP_Linkup.COMBC'", "COMBC_e"), |
d53f76357f41
incorporated former theories Reconstruction and ResAtpMethods into ATP_Linkup;
wenzelm
parents:
20854
diff
changeset
|
131 |
("ATP_Linkup.COMBS'", "COMBS_e")]; |
15347 | 132 |
|
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
133 |
val type_const_trans_table = |
18411
2d3165a0fb40
No axiom, arity or classrel clauses contain HOL.type. Negative occurrences are
paulson
parents:
18409
diff
changeset
|
134 |
Symtab.make [("*", "prod"), |
2d3165a0fb40
No axiom, arity or classrel clauses contain HOL.type. Negative occurrences are
paulson
parents:
18409
diff
changeset
|
135 |
("+", "sum"), |
2d3165a0fb40
No axiom, arity or classrel clauses contain HOL.type. Negative occurrences are
paulson
parents:
18409
diff
changeset
|
136 |
("~=>", "map")]; |
15347 | 137 |
|
15610 | 138 |
(*Escaping of special characters. |
139 |
Alphanumeric characters are left unchanged. |
|
140 |
The character _ goes to __ |
|
141 |
Characters in the range ASCII space to / go to _A to _P, respectively. |
|
142 |
Other printing characters go to _NNN where NNN is the decimal ASCII code.*) |
|
143 |
local |
|
144 |
||
145 |
val A_minus_space = Char.ord #"A" - Char.ord #" "; |
|
146 |
||
15347 | 147 |
fun ascii_of_c c = |
15610 | 148 |
if Char.isAlphaNum c then String.str c |
149 |
else if c = #"_" then "__" |
|
150 |
else if #" " <= c andalso c <= #"/" |
|
151 |
then "_" ^ String.str (Char.chr (Char.ord c + A_minus_space)) |
|
152 |
else if Char.isPrint c then ("_" ^ Int.toString (Char.ord c)) |
|
153 |
else "" |
|
15347 | 154 |
|
15610 | 155 |
in |
156 |
||
157 |
val ascii_of = String.translate ascii_of_c; |
|
158 |
||
159 |
end; |
|
15347 | 160 |
|
17525
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
161 |
(* 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
|
162 |
fun paren_pack [] = "" (*empty argument list*) |
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
163 |
| paren_pack strings = "(" ^ commas strings ^ ")"; |
17525
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
164 |
|
21509
6c5755ad9cae
ATP linkup now generates "new TPTP" rather than "old TPTP"
paulson
parents:
21470
diff
changeset
|
165 |
(*TSTP format uses (...) rather than the old [...]*) |
6c5755ad9cae
ATP linkup now generates "new TPTP" rather than "old TPTP"
paulson
parents:
21470
diff
changeset
|
166 |
fun tptp_pack strings = "(" ^ space_implode " | " strings ^ ")"; |
17525
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
167 |
|
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
168 |
|
16925
0fd7b1438d28
simpler variable names, and no types for monomorphic constants
paulson
parents:
16903
diff
changeset
|
169 |
(*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
|
170 |
fun trim_type_var s = |
0fd7b1438d28
simpler variable names, and no types for monomorphic constants
paulson
parents:
16903
diff
changeset
|
171 |
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
|
172 |
else error ("trim_type: Malformed type variable encountered: " ^ s); |
0fd7b1438d28
simpler variable names, and no types for monomorphic constants
paulson
parents:
16903
diff
changeset
|
173 |
|
16903 | 174 |
fun ascii_of_indexname (v,0) = ascii_of v |
17525
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
175 |
| ascii_of_indexname (v,i) = ascii_of v ^ "_" ^ Int.toString i; |
15347 | 176 |
|
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
177 |
fun make_schematic_var v = schematic_var_prefix ^ (ascii_of_indexname v); |
15347 | 178 |
fun make_fixed_var x = fixed_var_prefix ^ (ascii_of x); |
179 |
||
16925
0fd7b1438d28
simpler variable names, and no types for monomorphic constants
paulson
parents:
16903
diff
changeset
|
180 |
fun make_schematic_type_var (x,i) = |
0fd7b1438d28
simpler variable names, and no types for monomorphic constants
paulson
parents:
16903
diff
changeset
|
181 |
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
|
182 |
fun make_fixed_type_var x = tfree_prefix ^ (ascii_of (trim_type_var x)); |
15347 | 183 |
|
18411
2d3165a0fb40
No axiom, arity or classrel clauses contain HOL.type. Negative occurrences are
paulson
parents:
18409
diff
changeset
|
184 |
fun lookup_const c = |
17412 | 185 |
case Symtab.lookup const_trans_table c of |
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
186 |
SOME c' => c' |
18411
2d3165a0fb40
No axiom, arity or classrel clauses contain HOL.type. Negative occurrences are
paulson
parents:
18409
diff
changeset
|
187 |
| NONE => ascii_of c; |
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
188 |
|
18411
2d3165a0fb40
No axiom, arity or classrel clauses contain HOL.type. Negative occurrences are
paulson
parents:
18409
diff
changeset
|
189 |
fun lookup_type_const c = |
17412 | 190 |
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
|
191 |
SOME c' => c' |
18411
2d3165a0fb40
No axiom, arity or classrel clauses contain HOL.type. Negative occurrences are
paulson
parents:
18409
diff
changeset
|
192 |
| NONE => ascii_of c; |
2d3165a0fb40
No axiom, arity or classrel clauses contain HOL.type. Negative occurrences are
paulson
parents:
18409
diff
changeset
|
193 |
|
2d3165a0fb40
No axiom, arity or classrel clauses contain HOL.type. Negative occurrences are
paulson
parents:
18409
diff
changeset
|
194 |
fun make_fixed_const "op =" = "equal" (*MUST BE "equal" because it's built-in to ATPs*) |
2d3165a0fb40
No axiom, arity or classrel clauses contain HOL.type. Negative occurrences are
paulson
parents:
18409
diff
changeset
|
195 |
| 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
|
196 |
|
2d3165a0fb40
No axiom, arity or classrel clauses contain HOL.type. Negative occurrences are
paulson
parents:
18409
diff
changeset
|
197 |
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
|
198 |
|
17261 | 199 |
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
|
200 |
|
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
201 |
|
18798 | 202 |
(***** definitions and functions for FOL clauses, for conversion to TPTP or DFG format. *****) |
15347 | 203 |
|
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
204 |
val keep_types = ref true; |
15347 | 205 |
|
21509
6c5755ad9cae
ATP linkup now generates "new TPTP" rather than "old TPTP"
paulson
parents:
21470
diff
changeset
|
206 |
datatype kind = Axiom | Conjecture; |
15347 | 207 |
fun name_of_kind Axiom = "axiom" |
21509
6c5755ad9cae
ATP linkup now generates "new TPTP" rather than "old TPTP"
paulson
parents:
21470
diff
changeset
|
208 |
| name_of_kind Conjecture = "negated_conjecture"; |
15347 | 209 |
|
210 |
type clause_id = int; |
|
211 |
type axiom_name = string; |
|
212 |
type polarity = bool; |
|
213 |
||
214 |
(**** Isabelle FOL clauses ****) |
|
215 |
||
18402
aaba095cf62b
1. changed fol_type, it's not a string type anymore.
mengj
parents:
18390
diff
changeset
|
216 |
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
|
217 |
|
18798 | 218 |
(*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
|
219 |
datatype fol_type = AtomV of string |
aaba095cf62b
1. changed fol_type, it's not a string type anymore.
mengj
parents:
18390
diff
changeset
|
220 |
| AtomF of string |
aaba095cf62b
1. changed fol_type, it's not a string type anymore.
mengj
parents:
18390
diff
changeset
|
221 |
| Comp of string * fol_type list; |
aaba095cf62b
1. changed fol_type, it's not a string type anymore.
mengj
parents:
18390
diff
changeset
|
222 |
|
aaba095cf62b
1. changed fol_type, it's not a string type anymore.
mengj
parents:
18390
diff
changeset
|
223 |
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
|
224 |
| string_of_fol_type (AtomF x) = x |
aaba095cf62b
1. changed fol_type, it's not a string type anymore.
mengj
parents:
18390
diff
changeset
|
225 |
| string_of_fol_type (Comp(tcon,tps)) = |
18856
4669dec681f4
tidy-up of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset
|
226 |
tcon ^ (paren_pack (map string_of_fol_type tps)); |
4669dec681f4
tidy-up of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset
|
227 |
|
18439
4b517881ac7e
Added functions for fol_type; also put some functions to the signature, used by ResHolClause.
mengj
parents:
18420
diff
changeset
|
228 |
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
|
229 |
| 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
|
230 |
| 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
|
231 |
|
4b517881ac7e
Added functions for fol_type; also put some functions to the signature, used by ResHolClause.
mengj
parents:
18420
diff
changeset
|
232 |
|
18798 | 233 |
(*First string is the type class; the second is a TVar or TFfree*) |
234 |
datatype type_literal = LTVar of string * string | LTFree of string * string; |
|
15347 | 235 |
|
18856
4669dec681f4
tidy-up of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset
|
236 |
datatype fol_term = UVar of string * fol_type |
20038 | 237 |
| Fun of string * fol_type list * fol_term list; |
20824 | 238 |
datatype predicate = Predicate of string * fol_type list * fol_term list; |
15347 | 239 |
|
20018 | 240 |
datatype literal = Literal of polarity * predicate; |
15347 | 241 |
|
17999 | 242 |
fun mk_typ_var_sort (TFree(a,s)) = (FOLTFree a,s) |
243 |
| mk_typ_var_sort (TVar(v,s)) = (FOLTVar v,s); |
|
244 |
||
245 |
||
18856
4669dec681f4
tidy-up of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset
|
246 |
(*A clause has first-order literals and other, type-related literals*) |
15347 | 247 |
datatype clause = |
248 |
Clause of {clause_id: clause_id, |
|
249 |
axiom_name: axiom_name, |
|
19447 | 250 |
th: thm, |
15347 | 251 |
kind: kind, |
252 |
literals: literal list, |
|
18869
00741f7280f7
removal of ResClause.num_of_clauses and other simplifications
paulson
parents:
18868
diff
changeset
|
253 |
types_sorts: (typ_var * sort) list}; |
00741f7280f7
removal of ResClause.num_of_clauses and other simplifications
paulson
parents:
18868
diff
changeset
|
254 |
|
00741f7280f7
removal of ResClause.num_of_clauses and other simplifications
paulson
parents:
18868
diff
changeset
|
255 |
fun get_axiomName (Clause cls) = #axiom_name cls; |
15347 | 256 |
|
20824 | 257 |
fun get_literals (Clause cls) = #literals cls; |
258 |
||
17404
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
259 |
exception CLAUSE of string * term; |
15347 | 260 |
|
20018 | 261 |
fun isFalse (Literal (pol, Predicate(pname,_,[]))) = |
18856
4669dec681f4
tidy-up of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset
|
262 |
(pol andalso pname = "c_False") orelse |
4669dec681f4
tidy-up of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset
|
263 |
(not pol andalso pname = "c_True") |
17317
3f12de2e2e6e
Isabelle-ATP link: sortable axiom names; no spaces in switches; general tidying
paulson
parents:
17312
diff
changeset
|
264 |
| isFalse _ = false; |
3f12de2e2e6e
Isabelle-ATP link: sortable axiom names; no spaces in switches; general tidying
paulson
parents:
17312
diff
changeset
|
265 |
|
20018 | 266 |
fun isTrue (Literal (pol, Predicate(pname,_,[]))) = |
18856
4669dec681f4
tidy-up of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset
|
267 |
(pol andalso pname = "c_True") orelse |
4669dec681f4
tidy-up 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 |
|
17317
3f12de2e2e6e
Isabelle-ATP link: sortable axiom names; no spaces in switches; general tidying
paulson
parents:
17312
diff
changeset
|
273 |
|
18218
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
274 |
(*Declarations of the current theory--to allow suppressing types.*) |
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
275 |
val const_typargs = ref (Library.K [] : (string*typ -> typ list)); |
17317
3f12de2e2e6e
Isabelle-ATP link: sortable axiom names; no spaces in switches; general tidying
paulson
parents:
17312
diff
changeset
|
276 |
|
18218
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
277 |
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
|
278 |
|
0fd7b1438d28
simpler variable names, and no types for monomorphic constants
paulson
parents:
16903
diff
changeset
|
279 |
(*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
|
280 |
producing any clauses!*) |
18218
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
281 |
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
|
282 |
|
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
283 |
|
18402
aaba095cf62b
1. changed fol_type, it's not a string type anymore.
mengj
parents:
18390
diff
changeset
|
284 |
(*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
|
285 |
TVars it contains.*) |
18218
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
286 |
fun type_of (Type (a, Ts)) = |
18798 | 287 |
let val (folTyps, ts) = types_of Ts |
18218
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
288 |
val t = make_fixed_type_const a |
18798 | 289 |
in (Comp(t,folTyps), ts) end |
290 |
| type_of (TFree (a,s)) = (AtomF(make_fixed_type_var a), [(FOLTFree a, s)]) |
|
291 |
| 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
|
292 |
and types_of Ts = |
18798 | 293 |
let val (folTyps,ts) = ListPair.unzip (map type_of Ts) |
294 |
in (folTyps, union_all ts) end; |
|
15390 | 295 |
|
18439
4b517881ac7e
Added functions for fol_type; also put some functions to the signature, used by ResHolClause.
mengj
parents:
18420
diff
changeset
|
296 |
|
18218
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
297 |
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
|
298 |
|
16903 | 299 |
(* Any variables created via the METAHYPS tactical should be treated as |
300 |
universal vars, although it is represented as "Free(...)" by Isabelle *) |
|
301 |
val isMeta = String.isPrefix "METAHYP1_" |
|
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
302 |
|
18798 | 303 |
fun pred_name_type (Const(c,T)) = (make_fixed_const c, const_types_of (c,T)) |
15390 | 304 |
| pred_name_type (Free(x,T)) = |
17404
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
305 |
if isMeta x then raise CLAUSE("Predicate Not First Order 1", Free(x,T)) |
18798 | 306 |
else (make_fixed_var x, ([],[])) |
17404
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
307 |
| 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
|
308 |
| pred_name_type t = raise CLAUSE("Predicate input unexpected", t); |
15347 | 309 |
|
15615 | 310 |
|
18218
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
311 |
(* For typed equality *) |
15615 | 312 |
(* here "arg_typ" is the type of "="'s argument's type, not the type of the equality *) |
313 |
(* Find type of equality arg *) |
|
314 |
fun eq_arg_type (Type("fun",[T,_])) = |
|
315 |
let val (folT,_) = type_of T; |
|
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
316 |
in folT end; |
15347 | 317 |
|
18798 | 318 |
fun fun_name_type (Const(c,T)) args = (make_fixed_const c, const_types_of (c,T)) |
319 |
| fun_name_type (Free(x,T)) args = |
|
320 |
if isMeta x then raise CLAUSE("Function Not First Order", Free(x,T)) |
|
321 |
else (make_fixed_var x, ([],[])) |
|
17404
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
322 |
| 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
|
323 |
|
18856
4669dec681f4
tidy-up of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset
|
324 |
(*Convert a term to a fol_term while accumulating sort constraints on the TFrees and |
4669dec681f4
tidy-up of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset
|
325 |
TVars it contains.*) |
15347 | 326 |
fun term_of (Var(ind_nm,T)) = |
18798 | 327 |
let val (folType,ts) = type_of T |
328 |
in (UVar(make_schematic_var ind_nm, folType), ts) end |
|
15347 | 329 |
| term_of (Free(x,T)) = |
18798 | 330 |
let val (folType, ts) = type_of T |
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
331 |
in |
18798 | 332 |
if isMeta x then (UVar(make_schematic_var(x,0),folType), ts) |
20038 | 333 |
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
|
334 |
end |
18218
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
335 |
| term_of app = |
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
336 |
let val (f,args) = strip_comb app |
18798 | 337 |
val (funName,(contys,ts1)) = fun_name_type f args |
338 |
val (args',ts2) = terms_of args |
|
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
339 |
in |
18868 | 340 |
(Fun(funName,contys,args'), union_all (ts1::ts2)) |
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
341 |
end |
18798 | 342 |
and terms_of ts = ListPair.unzip (map term_of ts) |
15390 | 343 |
|
18856
4669dec681f4
tidy-up of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset
|
344 |
(*Create a predicate value, again accumulating sort constraints.*) |
17404
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
345 |
fun pred_of (Const("op =", typ), args) = |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
346 |
let val arg_typ = eq_arg_type typ |
18798 | 347 |
val (args',ts) = terms_of args |
17404
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
348 |
val equal_name = make_fixed_const "op =" |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
349 |
in |
18218
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
350 |
(Predicate(equal_name,[arg_typ],args'), |
18856
4669dec681f4
tidy-up of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset
|
351 |
union_all ts) |
17404
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
352 |
end |
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
353 |
| pred_of (pred,args) = |
18856
4669dec681f4
tidy-up of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset
|
354 |
let val (pname, (predType,ts1)) = pred_name_type pred |
18798 | 355 |
val (args',ts2) = terms_of args |
17404
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
356 |
in |
18856
4669dec681f4
tidy-up of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset
|
357 |
(Predicate(pname,predType,args'), union_all (ts1::ts2)) |
17404
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
358 |
end; |
15347 | 359 |
|
20018 | 360 |
(*Treatment of literals, possibly negated*) |
361 |
fun predicate_of ((Const("Not",_) $ P), polarity) = predicate_of (P, not polarity) |
|
362 |
| predicate_of (term,polarity) = (pred_of (strip_comb term), polarity); |
|
15347 | 363 |
|
17888 | 364 |
fun literals_of_term1 args (Const("Trueprop",_) $ P) = literals_of_term1 args P |
18856
4669dec681f4
tidy-up of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset
|
365 |
| literals_of_term1 args (Const("op |",_) $ P $ Q) = |
4669dec681f4
tidy-up of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset
|
366 |
literals_of_term1 (literals_of_term1 args P) Q |
4669dec681f4
tidy-up of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset
|
367 |
| literals_of_term1 (lits, ts) P = |
20018 | 368 |
let val ((pred, ts'), polarity) = predicate_of (P,true) |
369 |
val lits' = Literal(polarity,pred) :: lits |
|
17234 | 370 |
in |
18856
4669dec681f4
tidy-up of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset
|
371 |
(lits', ts union ts') |
17234 | 372 |
end; |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
373 |
|
18856
4669dec681f4
tidy-up of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset
|
374 |
val literals_of_term = literals_of_term1 ([],[]); |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
375 |
|
18403
df0c0f35c897
Changed literals' ordering and the functions for sorting literals.
mengj
parents:
18402
diff
changeset
|
376 |
|
df0c0f35c897
Changed literals' ordering and the functions for sorting literals.
mengj
parents:
18402
diff
changeset
|
377 |
fun list_ord _ ([],[]) = EQUAL |
df0c0f35c897
Changed literals' ordering and the functions for sorting literals.
mengj
parents:
18402
diff
changeset
|
378 |
| list_ord _ ([],_) = LESS |
df0c0f35c897
Changed literals' ordering and the functions for sorting literals.
mengj
parents:
18402
diff
changeset
|
379 |
| list_ord _ (_,[]) = GREATER |
19207
33f1b4515ce4
Tidying and tracing. Handling exn CLAUSE so that errors don't reach top-level.
paulson
parents:
19197
diff
changeset
|
380 |
| list_ord ord (x::xs, y::ys) = |
33f1b4515ce4
Tidying and tracing. Handling exn CLAUSE so that errors don't reach top-level.
paulson
parents:
19197
diff
changeset
|
381 |
(case ord(x,y) of EQUAL => list_ord ord (xs,ys) |
33f1b4515ce4
Tidying and tracing. Handling exn CLAUSE so that errors don't reach top-level.
paulson
parents:
19197
diff
changeset
|
382 |
| xy_ord => xy_ord); |
33f1b4515ce4
Tidying and tracing. Handling exn CLAUSE so that errors don't reach top-level.
paulson
parents:
19197
diff
changeset
|
383 |
|
18798 | 384 |
(*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
|
385 |
fun sorts_on_typs (_, []) = ([]) |
16199
ee95ab217fee
no longer emits literals for type class HOL.type; also minor tidying
paulson
parents:
16039
diff
changeset
|
386 |
| 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
|
387 |
sorts_on_typs (v,s) (*IGNORE sort "type"*) |
18798 | 388 |
| sorts_on_typs ((FOLTVar indx), s::ss) = |
389 |
LTVar(make_type_class s, make_schematic_type_var indx) :: |
|
390 |
sorts_on_typs ((FOLTVar indx), ss) |
|
391 |
| sorts_on_typs ((FOLTFree x), s::ss) = |
|
392 |
LTFree(make_type_class s, make_fixed_type_var x) :: |
|
393 |
sorts_on_typs ((FOLTFree x), ss); |
|
15347 | 394 |
|
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
395 |
|
18798 | 396 |
fun pred_of_sort (LTVar (s,ty)) = (s,1) |
397 |
| 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
|
398 |
|
16199
ee95ab217fee
no longer emits literals for type class HOL.type; also minor tidying
paulson
parents:
16039
diff
changeset
|
399 |
(*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
|
400 |
The first is for TVars, the second for TFrees.*) |
18856
4669dec681f4
tidy-up of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset
|
401 |
fun add_typs_aux [] = ([],[]) |
4669dec681f4
tidy-up of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset
|
402 |
| add_typs_aux ((FOLTVar indx,s)::tss) = |
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
403 |
let val vs = sorts_on_typs (FOLTVar indx, s) |
18856
4669dec681f4
tidy-up of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset
|
404 |
val (vss,fss) = add_typs_aux tss |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
405 |
in |
18856
4669dec681f4
tidy-up of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset
|
406 |
(vs union vss, fss) |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
407 |
end |
18856
4669dec681f4
tidy-up of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset
|
408 |
| add_typs_aux ((FOLTFree x,s)::tss) = |
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
409 |
let val fs = sorts_on_typs (FOLTFree x, s) |
18856
4669dec681f4
tidy-up of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset
|
410 |
val (vss,fss) = add_typs_aux tss |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
411 |
in |
18856
4669dec681f4
tidy-up of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset
|
412 |
(vss, fs union fss) |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
413 |
end; |
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
414 |
|
20015
1ffcf4802802
Literals aren't sorted any more. Output overloaded constants' type var instantiations.
mengj
parents:
19719
diff
changeset
|
415 |
|
1ffcf4802802
Literals aren't sorted any more. Output overloaded constants' type var instantiations.
mengj
parents:
19719
diff
changeset
|
416 |
(** make axiom and conjecture clauses. **) |
1ffcf4802802
Literals aren't sorted any more. Output overloaded constants' type var instantiations.
mengj
parents:
19719
diff
changeset
|
417 |
|
1ffcf4802802
Literals aren't sorted any more. Output overloaded constants' type var instantiations.
mengj
parents:
19719
diff
changeset
|
418 |
exception MAKE_CLAUSE; |
1ffcf4802802
Literals aren't sorted any more. Output overloaded constants' type var instantiations.
mengj
parents:
19719
diff
changeset
|
419 |
fun make_clause (clause_id, axiom_name, th, kind) = |
21470
7c1b59ddcd56
Consolidation of code to "blacklist" unhelpful theorems, including record
paulson
parents:
21432
diff
changeset
|
420 |
let val (lits,types_sorts) = literals_of_term (prop_of th) |
20018 | 421 |
in if forall isFalse lits |
422 |
then error "Problem too trivial for resolution (empty clause)" |
|
423 |
else Clause {clause_id = clause_id, axiom_name = axiom_name, th = th, |
|
424 |
kind = kind, literals = lits, types_sorts = types_sorts} |
|
425 |
end; |
|
20015
1ffcf4802802
Literals aren't sorted any more. Output overloaded constants' type var instantiations.
mengj
parents:
19719
diff
changeset
|
426 |
|
1ffcf4802802
Literals aren't sorted any more. Output overloaded constants' type var instantiations.
mengj
parents:
19719
diff
changeset
|
427 |
fun get_tvar_strs [] = [] |
1ffcf4802802
Literals aren't sorted any more. Output overloaded constants' type var instantiations.
mengj
parents:
19719
diff
changeset
|
428 |
| get_tvar_strs ((FOLTVar indx,s)::tss) = |
20854 | 429 |
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
|
430 |
| 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
|
431 |
|
1ffcf4802802
Literals aren't sorted any more. Output overloaded constants' type var instantiations.
mengj
parents:
19719
diff
changeset
|
432 |
(* check if a clause is first-order before making a conjecture clause*) |
20418 | 433 |
fun make_conjecture_clause n th = |
434 |
if Meson.is_fol_term (prop_of th) then make_clause(n, "conjecture", th, Conjecture) |
|
435 |
else raise CLAUSE("Goal is not FOL", prop_of th); |
|
436 |
||
20015
1ffcf4802802
Literals aren't sorted any more. Output overloaded constants' type var instantiations.
mengj
parents:
19719
diff
changeset
|
437 |
fun make_conjecture_clauses_aux _ [] = [] |
1ffcf4802802
Literals aren't sorted any more. Output overloaded constants' type var instantiations.
mengj
parents:
19719
diff
changeset
|
438 |
| 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
|
439 |
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
|
440 |
|
1ffcf4802802
Literals aren't sorted any more. Output overloaded constants' type var instantiations.
mengj
parents:
19719
diff
changeset
|
441 |
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
|
442 |
|
18199
d236379ea408
-- before converting axiom and conjecture clauses into ResClause.clause format, perform "check_is_fol_term" first.
mengj
parents:
18056
diff
changeset
|
443 |
(*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
|
444 |
fun make_axiom_clause thm (ax_name,cls_id) = |
20022 | 445 |
if Meson.is_fol_term (prop_of thm) |
446 |
then (SOME (make_clause(cls_id, ax_name, thm, Axiom)) handle MAKE_CLAUSE => NONE) |
|
447 |
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
|
448 |
|
19443
e32a4703d834
Take conjectures and axioms as thms when convert them to ResClause.clause format.
mengj
parents:
19354
diff
changeset
|
449 |
fun make_axiom_clauses [] = [] |
e32a4703d834
Take conjectures and axioms as thms when convert them to ResClause.clause format.
mengj
parents:
19354
diff
changeset
|
450 |
| make_axiom_clauses ((thm,(name,id))::thms) = |
20022 | 451 |
case make_axiom_clause thm (name,id) of |
452 |
SOME cls => if isTaut cls then make_axiom_clauses thms |
|
453 |
else (name,cls) :: make_axiom_clauses thms |
|
454 |
| NONE => make_axiom_clauses thms; |
|
19354 | 455 |
|
15347 | 456 |
(**** Isabelle arities ****) |
457 |
||
458 |
exception ARCLAUSE of string; |
|
459 |
||
460 |
type class = string; |
|
461 |
type tcons = string; |
|
462 |
||
18868 | 463 |
datatype arLit = TConsLit of bool * (class * tcons * string list) |
464 |
| TVarLit of bool * (class * string); |
|
15347 | 465 |
|
466 |
datatype arityClause = |
|
21373
18f519614978
Arity clauses are now produced only for types and type classes actually used.
paulson
parents:
21290
diff
changeset
|
467 |
ArityClause of {axiom_name: axiom_name, |
15347 | 468 |
kind: kind, |
469 |
conclLit: arLit, |
|
470 |
premLits: arLit list}; |
|
471 |
||
472 |
||
18798 | 473 |
fun gen_TVars 0 = [] |
474 |
| gen_TVars n = ("T_" ^ Int.toString n) :: gen_TVars (n-1); |
|
15347 | 475 |
|
18411
2d3165a0fb40
No axiom, arity or classrel clauses contain HOL.type. Negative occurrences are
paulson
parents:
18409
diff
changeset
|
476 |
fun pack_sort(_,[]) = [] |
2d3165a0fb40
No axiom, arity or classrel clauses contain HOL.type. Negative occurrences are
paulson
parents:
18409
diff
changeset
|
477 |
| 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
|
478 |
| pack_sort(tvar, cls::srt) = (make_type_class cls, tvar) :: pack_sort(tvar, srt); |
15347 | 479 |
|
21560 | 480 |
fun make_TVarLit b (cls,str) = TVarLit(b, (cls,str)); |
481 |
||
482 |
fun make_TConsLit b (cls,tcons,tvars) = |
|
18868 | 483 |
TConsLit(b, (make_type_class cls, make_fixed_type_const tcons, tvars)); |
15347 | 484 |
|
18411
2d3165a0fb40
No axiom, arity or classrel clauses contain HOL.type. Negative occurrences are
paulson
parents:
18409
diff
changeset
|
485 |
(*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
|
486 |
fun make_axiom_arity_clause (tcons, axiom_name, (res,args)) = |
21560 | 487 |
let val tvars = gen_TVars (length args) |
17845
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
488 |
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
|
489 |
in |
21373
18f519614978
Arity clauses are now produced only for types and type classes actually used.
paulson
parents:
21290
diff
changeset
|
490 |
ArityClause {axiom_name = axiom_name, kind = Axiom, |
21560 | 491 |
conclLit = make_TConsLit true (res,tcons,tvars), |
492 |
premLits = map (make_TVarLit false) (union_all(map pack_sort tvars_srts))} |
|
17845
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
493 |
end; |
15347 | 494 |
|
495 |
||
496 |
(**** Isabelle class relations ****) |
|
497 |
||
498 |
datatype classrelClause = |
|
18868 | 499 |
ClassrelClause of {axiom_name: axiom_name, |
15347 | 500 |
subclass: class, |
18411
2d3165a0fb40
No axiom, arity or classrel clauses contain HOL.type. Negative occurrences are
paulson
parents:
18409
diff
changeset
|
501 |
superclass: class}; |
21290
33b6bb5d6ab8
Improvement to classrel clauses: now outputs the minimum needed.
paulson
parents:
21254
diff
changeset
|
502 |
|
33b6bb5d6ab8
Improvement to classrel clauses: now outputs the minimum needed.
paulson
parents:
21254
diff
changeset
|
503 |
(*Generate all pairs (sub,super) such that sub is a proper subclass of super in theory thy.*) |
21432
625797c592b2
Optimized class_pairs for the common case of no subclasses
paulson
parents:
21416
diff
changeset
|
504 |
fun class_pairs thy [] supers = [] |
625797c592b2
Optimized class_pairs for the common case of no subclasses
paulson
parents:
21416
diff
changeset
|
505 |
| class_pairs thy subs supers = |
625797c592b2
Optimized class_pairs for the common case of no subclasses
paulson
parents:
21416
diff
changeset
|
506 |
let val class_less = Sorts.class_less(Sign.classes_of thy) |
625797c592b2
Optimized class_pairs for the common case of no subclasses
paulson
parents:
21416
diff
changeset
|
507 |
fun add_super sub (super,pairs) = |
625797c592b2
Optimized class_pairs for the common case of no subclasses
paulson
parents:
21416
diff
changeset
|
508 |
if class_less (sub,super) then (sub,super)::pairs else pairs |
625797c592b2
Optimized class_pairs for the common case of no subclasses
paulson
parents:
21416
diff
changeset
|
509 |
fun add_supers (sub,pairs) = foldl (add_super sub) pairs supers |
625797c592b2
Optimized class_pairs for the common case of no subclasses
paulson
parents:
21416
diff
changeset
|
510 |
in foldl add_supers [] subs end; |
15347 | 511 |
|
21290
33b6bb5d6ab8
Improvement to classrel clauses: now outputs the minimum needed.
paulson
parents:
21254
diff
changeset
|
512 |
fun make_classrelClause (sub,super) = |
33b6bb5d6ab8
Improvement to classrel clauses: now outputs the minimum needed.
paulson
parents:
21254
diff
changeset
|
513 |
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
|
514 |
subclass = make_type_class sub, |
33b6bb5d6ab8
Improvement to classrel clauses: now outputs the minimum needed.
paulson
parents:
21254
diff
changeset
|
515 |
superclass = make_type_class super}; |
15347 | 516 |
|
21290
33b6bb5d6ab8
Improvement to classrel clauses: now outputs the minimum needed.
paulson
parents:
21254
diff
changeset
|
517 |
fun make_classrel_clauses thy subs supers = |
33b6bb5d6ab8
Improvement to classrel clauses: now outputs the minimum needed.
paulson
parents:
21254
diff
changeset
|
518 |
map make_classrelClause (class_pairs thy subs supers); |
18868 | 519 |
|
520 |
||
521 |
(** Isabelle arities **) |
|
17845
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
522 |
|
21373
18f519614978
Arity clauses are now produced only for types and type classes actually used.
paulson
parents:
21290
diff
changeset
|
523 |
fun arity_clause _ _ (tcons, []) = [] |
18f519614978
Arity clauses are now produced only for types and type classes actually used.
paulson
parents:
21290
diff
changeset
|
524 |
| 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
|
525 |
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
|
526 |
| 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
|
527 |
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
|
528 |
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
|
529 |
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
|
530 |
else |
18f519614978
Arity clauses are now produced only for types and type classes actually used.
paulson
parents:
21290
diff
changeset
|
531 |
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
|
532 |
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
|
533 |
|
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
534 |
fun multi_arity_clause [] = [] |
19155 | 535 |
| 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
|
536 |
arity_clause [] 1 (tcons, ars) @ |
19155 | 537 |
multi_arity_clause tc_arlists |
17845
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
538 |
|
21373
18f519614978
Arity clauses are now produced only for types and type classes actually used.
paulson
parents:
21290
diff
changeset
|
539 |
(*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
|
540 |
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
|
541 |
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
|
542 |
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
|
543 |
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
|
544 |
(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
|
545 |
handle Sorts.CLASS_ERROR _ => pairs |
18f519614978
Arity clauses are now produced only for types and type classes actually used.
paulson
parents:
21290
diff
changeset
|
546 |
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
|
547 |
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
|
548 |
|
18f519614978
Arity clauses are now produced only for types and type classes actually used.
paulson
parents:
21290
diff
changeset
|
549 |
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
|
550 |
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
|
551 |
|
1438291d57f0
deletion of Tools/res_types_sorts; removal of absolute numbering of clauses
paulson
parents:
17775
diff
changeset
|
552 |
|
18868 | 553 |
(**** Find occurrences of predicates in clauses ****) |
554 |
||
555 |
(*FIXME: multiple-arity checking doesn't work, as update_new is the wrong |
|
556 |
function (it flags repeated declarations of a function, even with the same arity)*) |
|
557 |
||
558 |
fun update_many (tab, keypairs) = foldl (uncurry Symtab.update) tab keypairs; |
|
559 |
||
560 |
fun add_predicate_preds (Predicate(pname,tys,tms), preds) = |
|
561 |
if pname = "equal" then preds (*equality is built-in and requires no declaration*) |
|
562 |
else Symtab.update (pname, length tys + length tms) preds |
|
563 |
||
20018 | 564 |
fun add_literal_preds (Literal(_,pred), preds) = add_predicate_preds (pred,preds) |
18868 | 565 |
|
566 |
fun add_type_sort_preds ((FOLTVar indx,s), preds) = |
|
567 |
update_many (preds, map pred_of_sort (sorts_on_typs (FOLTVar indx, s))) |
|
568 |
| add_type_sort_preds ((FOLTFree x,s), preds) = |
|
569 |
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
|
570 |
|
18868 | 571 |
fun add_clause_preds (Clause {literals, types_sorts, ...}, preds) = |
572 |
foldl add_literal_preds (foldl add_type_sort_preds preds types_sorts) literals |
|
573 |
handle Symtab.DUP a => raise ERROR ("predicate " ^ a ^ " has multiple arities") |
|
574 |
||
575 |
fun add_classrelClause_preds (ClassrelClause {subclass,superclass,...}, preds) = |
|
576 |
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
|
577 |
|
21373
18f519614978
Arity clauses are now produced only for types and type classes actually used.
paulson
parents:
21290
diff
changeset
|
578 |
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
|
579 |
| 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
|
580 |
|
18f519614978
Arity clauses are now produced only for types and type classes actually used.
paulson
parents:
21290
diff
changeset
|
581 |
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
|
582 |
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
|
583 |
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
|
584 |
in foldl upd preds classes end; |
18868 | 585 |
|
586 |
fun preds_of_clauses clauses clsrel_clauses arity_clauses = |
|
587 |
Symtab.dest |
|
588 |
(foldl add_classrelClause_preds |
|
589 |
(foldl add_arityClause_preds |
|
590 |
(foldl add_clause_preds Symtab.empty clauses) |
|
591 |
arity_clauses) |
|
592 |
clsrel_clauses) |
|
18798 | 593 |
|
18868 | 594 |
(*** Find occurrences of functions in clauses ***) |
595 |
||
596 |
fun add_foltype_funcs (AtomV _, funcs) = funcs |
|
597 |
| add_foltype_funcs (AtomF a, funcs) = Symtab.update (a,0) funcs |
|
598 |
| add_foltype_funcs (Comp(a,tys), funcs) = |
|
599 |
foldl add_foltype_funcs (Symtab.update (a, length tys) funcs) tys; |
|
600 |
||
20038 | 601 |
fun add_folterm_funcs (UVar(_,ty), funcs) = add_foltype_funcs (ty, funcs) |
18868 | 602 |
| add_folterm_funcs (Fun(a,tys,tms), funcs) = |
603 |
foldl add_foltype_funcs |
|
604 |
(foldl add_folterm_funcs (Symtab.update (a, length tys + length tms) funcs) |
|
605 |
tms) |
|
606 |
tys |
|
18798 | 607 |
|
18868 | 608 |
fun add_predicate_funcs (Predicate(_,tys,tms), funcs) = |
609 |
foldl add_foltype_funcs (foldl add_folterm_funcs funcs tms) tys; |
|
610 |
||
20018 | 611 |
fun add_literal_funcs (Literal(_,pred), funcs) = add_predicate_funcs (pred,funcs) |
18868 | 612 |
|
20038 | 613 |
(*TFrees are recorded as constants*) |
614 |
fun add_type_sort_funcs ((FOLTVar _, _), funcs) = funcs |
|
615 |
| add_type_sort_funcs ((FOLTFree a, _), funcs) = |
|
616 |
Symtab.update (make_fixed_type_var a, 0) funcs |
|
617 |
||
18868 | 618 |
fun add_arityClause_funcs (ArityClause {conclLit,...}, funcs) = |
619 |
let val TConsLit(_, (_, tcons, tvars)) = conclLit |
|
620 |
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
|
621 |
|
20038 | 622 |
fun add_clause_funcs (Clause {literals, types_sorts, ...}, funcs) = |
623 |
foldl add_literal_funcs (foldl add_type_sort_funcs funcs types_sorts) |
|
624 |
literals |
|
18868 | 625 |
handle Symtab.DUP a => raise ERROR ("function " ^ a ^ " has multiple arities") |
626 |
||
627 |
fun funcs_of_clauses clauses arity_clauses = |
|
628 |
Symtab.dest (foldl add_arityClause_funcs |
|
629 |
(foldl add_clause_funcs Symtab.empty clauses) |
|
630 |
arity_clauses) |
|
631 |
||
632 |
||
633 |
(**** String-oriented operations ****) |
|
15347 | 634 |
|
21509
6c5755ad9cae
ATP linkup now generates "new TPTP" rather than "old TPTP"
paulson
parents:
21470
diff
changeset
|
635 |
fun string_of_term (UVar(x,_)) = x |
20015
1ffcf4802802
Literals aren't sorted any more. Output overloaded constants' type var instantiations.
mengj
parents:
19719
diff
changeset
|
636 |
| 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
|
637 |
| string_of_term (Fun (name,typs,terms)) = |
21509
6c5755ad9cae
ATP linkup now generates "new TPTP" rather than "old TPTP"
paulson
parents:
21470
diff
changeset
|
638 |
let val typs' = if !keep_types then map string_of_fol_type typs else [] |
6c5755ad9cae
ATP linkup now generates "new TPTP" rather than "old TPTP"
paulson
parents:
21470
diff
changeset
|
639 |
in name ^ (paren_pack (map string_of_term terms @ typs')) end; |
6c5755ad9cae
ATP linkup now generates "new TPTP" rather than "old TPTP"
paulson
parents:
21470
diff
changeset
|
640 |
|
6c5755ad9cae
ATP linkup now generates "new TPTP" rather than "old TPTP"
paulson
parents:
21470
diff
changeset
|
641 |
fun string_of_pair [t1,t2] = (string_of_term t1, string_of_term t2) |
6c5755ad9cae
ATP linkup now generates "new TPTP" rather than "old TPTP"
paulson
parents:
21470
diff
changeset
|
642 |
| string_of_pair _ = raise ERROR ("equality predicate requires two arguments"); |
6c5755ad9cae
ATP linkup now generates "new TPTP" rather than "old TPTP"
paulson
parents:
21470
diff
changeset
|
643 |
|
6c5755ad9cae
ATP linkup now generates "new TPTP" rather than "old TPTP"
paulson
parents:
21470
diff
changeset
|
644 |
fun string_of_equality ts = |
6c5755ad9cae
ATP linkup now generates "new TPTP" rather than "old TPTP"
paulson
parents:
21470
diff
changeset
|
645 |
let val (s1,s2) = string_of_pair ts |
6c5755ad9cae
ATP linkup now generates "new TPTP" rather than "old TPTP"
paulson
parents:
21470
diff
changeset
|
646 |
in "equal(" ^ s1 ^ "," ^ s2 ^ ")" end; |
15347 | 647 |
|
648 |
(* before output the string of the predicate, check if the predicate corresponds to an equality or not. *) |
|
21509
6c5755ad9cae
ATP linkup now generates "new TPTP" rather than "old TPTP"
paulson
parents:
21470
diff
changeset
|
649 |
fun string_of_predicate (Predicate("equal",_,ts)) = string_of_equality ts |
6c5755ad9cae
ATP linkup now generates "new TPTP" rather than "old TPTP"
paulson
parents:
21470
diff
changeset
|
650 |
| string_of_predicate (Predicate(name,typs,ts)) = |
6c5755ad9cae
ATP linkup now generates "new TPTP" rather than "old TPTP"
paulson
parents:
21470
diff
changeset
|
651 |
let val typs' = if !keep_types then map string_of_fol_type typs else [] |
6c5755ad9cae
ATP linkup now generates "new TPTP" rather than "old TPTP"
paulson
parents:
21470
diff
changeset
|
652 |
in name ^ (paren_pack (map string_of_term ts @ typs')) end; |
17317
3f12de2e2e6e
Isabelle-ATP link: sortable axiom names; no spaces in switches; general tidying
paulson
parents:
17312
diff
changeset
|
653 |
|
3f12de2e2e6e
Isabelle-ATP link: sortable axiom names; no spaces in switches; general tidying
paulson
parents:
17312
diff
changeset
|
654 |
fun string_of_clausename (cls_id,ax_name) = |
17525
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
655 |
clause_prefix ^ ascii_of ax_name ^ "_" ^ Int.toString cls_id; |
17317
3f12de2e2e6e
Isabelle-ATP link: sortable axiom names; no spaces in switches; general tidying
paulson
parents:
17312
diff
changeset
|
656 |
|
21564 | 657 |
fun clause_name_of (cls_id,ax_name) = |
658 |
ascii_of ax_name ^ "_" ^ Int.toString cls_id; |
|
659 |
||
17317
3f12de2e2e6e
Isabelle-ATP link: sortable axiom names; no spaces in switches; general tidying
paulson
parents:
17312
diff
changeset
|
660 |
fun string_of_type_clsname (cls_id,ax_name,idx) = |
17525
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
661 |
string_of_clausename (cls_id,ax_name) ^ "_tcs" ^ (Int.toString idx); |
18863 | 662 |
|
663 |
(*Write a list of strings to a file*) |
|
664 |
fun writeln_strs os = List.app (fn s => TextIO.output (os,s)); |
|
665 |
||
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
666 |
|
18868 | 667 |
(**** Producing DFG files ****) |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
668 |
|
18863 | 669 |
(*Attach sign in DFG syntax: false means negate.*) |
670 |
fun dfg_sign true s = s |
|
671 |
| dfg_sign false s = "not(" ^ s ^ ")" |
|
672 |
||
20018 | 673 |
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
|
674 |
|
18798 | 675 |
fun dfg_of_typeLit (LTVar (s,ty)) = "not(" ^ s ^ "(" ^ ty ^ "))" |
18856
4669dec681f4
tidy-up of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset
|
676 |
| 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
|
677 |
|
18868 | 678 |
(*Enclose the clause body by quantifiers, if necessary*) |
679 |
fun dfg_forall [] body = body |
|
680 |
| 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
|
681 |
|
18868 | 682 |
fun gen_dfg_cls (cls_id, ax_name, knd, lits, vars) = |
683 |
"clause( %(" ^ knd ^ ")\n" ^ |
|
684 |
dfg_forall vars ("or(" ^ lits ^ ")") ^ ",\n" ^ |
|
18863 | 685 |
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
|
686 |
|
18869
00741f7280f7
removal of ResClause.num_of_clauses and other simplifications
paulson
parents:
18868
diff
changeset
|
687 |
fun dfg_clause_aux (Clause{literals, types_sorts, ...}) = |
18868 | 688 |
let val lits = map dfg_literal literals |
18869
00741f7280f7
removal of ResClause.num_of_clauses and other simplifications
paulson
parents:
18868
diff
changeset
|
689 |
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
|
690 |
val tvar_lits_strs = |
18869
00741f7280f7
removal of ResClause.num_of_clauses and other simplifications
paulson
parents:
18868
diff
changeset
|
691 |
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
|
692 |
val tfree_lits = |
18869
00741f7280f7
removal of ResClause.num_of_clauses and other simplifications
paulson
parents:
18868
diff
changeset
|
693 |
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
|
694 |
in |
17234 | 695 |
(tvar_lits_strs @ lits, tfree_lits) |
17230
77e93bf303a5
fixed arities and restored changes that had gone missing
paulson
parents:
17150
diff
changeset
|
696 |
end; |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
697 |
|
20018 | 698 |
fun dfg_folterms (Literal(pol,pred)) = |
18856
4669dec681f4
tidy-up of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset
|
699 |
let val Predicate (_, _, folterms) = pred |
18218
9a7ffce389c3
new treatment of polymorphic types, using Sign.const_typargs
paulson
parents:
18199
diff
changeset
|
700 |
in folterms end |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
701 |
|
17404
d16c3a62c396
the experimental tagging system, and the usual tidying
paulson
parents:
17375
diff
changeset
|
702 |
fun get_uvars (UVar(a,typ)) = [a] |
18868 | 703 |
| 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
|
704 |
|
18868 | 705 |
fun dfg_vars (Clause {literals,...}) = |
18920 | 706 |
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
|
707 |
|
18798 | 708 |
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
|
709 |
let val (lits,tfree_lits) = dfg_clause_aux cls |
18798 | 710 |
(*"lits" includes the typing assumptions (TVars)*) |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
711 |
val vars = dfg_vars cls |
18798 | 712 |
val tvars = get_tvar_strs types_sorts |
20038 | 713 |
val cls_str = gen_dfg_cls(clause_id, axiom_name, name_of_kind kind, |
714 |
commas lits, tvars@vars) |
|
18798 | 715 |
in (cls_str, tfree_lits) end; |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
716 |
|
18798 | 717 |
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
|
718 |
|
18856
4669dec681f4
tidy-up of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset
|
719 |
fun string_of_preds [] = "" |
4669dec681f4
tidy-up of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset
|
720 |
| 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
|
721 |
|
18856
4669dec681f4
tidy-up of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset
|
722 |
fun string_of_funcs [] = "" |
4669dec681f4
tidy-up of res_clause.ML, removing the "predicates" field
paulson
parents:
18798
diff
changeset
|
723 |
| 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
|
724 |
|
17234 | 725 |
fun string_of_symbols predstr funcstr = |
726 |
"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
|
727 |
|
18798 | 728 |
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
|
729 |
|
18863 | 730 |
fun string_of_descrip name = |
18868 | 731 |
"list_of_descriptions.\nname({*" ^ name ^ |
732 |
"*}).\nauthor({*Isabelle*}).\nstatus(unknown).\ndescription({*auto-generated*}).\nend_of_list.\n\n" |
|
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
733 |
|
18863 | 734 |
fun dfg_tfree_clause tfree_lit = |
21509
6c5755ad9cae
ATP linkup now generates "new TPTP" rather than "old TPTP"
paulson
parents:
21470
diff
changeset
|
735 |
"clause( %(negated_conjecture)\n" ^ "or( " ^ tfree_lit ^ "),\n" ^ "tfree_tcs" ^ ").\n\n" |
18863 | 736 |
|
737 |
fun dfg_of_arLit (TConsLit(pol,(c,t,args))) = |
|
738 |
dfg_sign pol (c ^ "(" ^ t ^ paren_pack args ^ ")") |
|
739 |
| dfg_of_arLit (TVarLit(pol,(c,str))) = |
|
740 |
dfg_sign pol (c ^ "(" ^ str ^ ")") |
|
17525
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
741 |
|
20038 | 742 |
fun dfg_classrelLits sub sup = "not(" ^ sub ^ "(T)), " ^ sup ^ "(T)"; |
17525
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
743 |
|
18868 | 744 |
fun dfg_classrelClause (ClassrelClause {axiom_name,subclass,superclass,...}) = |
745 |
"clause(forall([T],\nor( " ^ dfg_classrelLits subclass superclass ^ ")),\n" ^ |
|
746 |
axiom_name ^ ").\n\n"; |
|
747 |
||
21560 | 748 |
fun string_of_ar axiom_name = arclause_prefix ^ ascii_of axiom_name; |
749 |
||
750 |
fun dfg_arity_clause (ArityClause{axiom_name,kind,conclLit,premLits,...}) = |
|
751 |
let val TConsLit(_, (_,_,tvars)) = conclLit |
|
18868 | 752 |
val lits = map dfg_of_arLit (conclLit :: premLits) |
18863 | 753 |
in |
21560 | 754 |
"clause( %(" ^ name_of_kind kind ^ ")\n" ^ |
18868 | 755 |
dfg_forall tvars ("or( " ^ commas lits ^ ")") ^ ",\n" ^ |
21560 | 756 |
string_of_ar axiom_name ^ ").\n\n" |
18863 | 757 |
end; |
758 |
||
759 |
(* write out a subgoal in DFG format to the file "xxxx_N"*) |
|
20038 | 760 |
fun dfg_write_file thms filename (ax_tuples,classrel_clauses,arity_clauses) = |
18863 | 761 |
let |
19207
33f1b4515ce4
Tidying and tracing. Handling exn CLAUSE so that errors don't reach top-level.
paulson
parents:
19197
diff
changeset
|
762 |
val _ = Output.debug ("Preparing to write the DFG file " ^ filename) |
19719 | 763 |
val conjectures = make_conjecture_clauses thms |
20038 | 764 |
val (clnames,axclauses) = ListPair.unzip (make_axiom_clauses ax_tuples) |
18868 | 765 |
val (dfg_clss, tfree_litss) = ListPair.unzip (map clause2dfg conjectures) |
20038 | 766 |
val clss = conjectures @ axclauses |
18868 | 767 |
val funcs = funcs_of_clauses clss arity_clauses |
768 |
and preds = preds_of_clauses clss classrel_clauses arity_clauses |
|
18863 | 769 |
and probname = Path.pack (Path.base (Path.unpack filename)) |
20038 | 770 |
val (axstrs, _) = ListPair.unzip (map clause2dfg axclauses) |
18863 | 771 |
val tfree_clss = map dfg_tfree_clause (union_all tfree_litss) |
19155 | 772 |
val out = TextIO.openOut filename |
18863 | 773 |
in |
18868 | 774 |
TextIO.output (out, string_of_start probname); |
775 |
TextIO.output (out, string_of_descrip probname); |
|
776 |
TextIO.output (out, string_of_symbols (string_of_funcs funcs) (string_of_preds preds)); |
|
777 |
TextIO.output (out, "list_of_clauses(axioms,cnf).\n"); |
|
778 |
writeln_strs out axstrs; |
|
779 |
List.app (curry TextIO.output out o dfg_classrelClause) classrel_clauses; |
|
780 |
List.app (curry TextIO.output out o dfg_arity_clause) arity_clauses; |
|
781 |
TextIO.output (out, "end_of_list.\n\nlist_of_clauses(conjectures,cnf).\n"); |
|
782 |
writeln_strs out tfree_clss; |
|
783 |
writeln_strs out dfg_clss; |
|
784 |
TextIO.output (out, "end_of_list.\n\nend_problem.\n"); |
|
20022 | 785 |
TextIO.closeOut out; |
786 |
clnames |
|
17525
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
787 |
end; |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
788 |
|
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
16976
diff
changeset
|
789 |
|
18869
00741f7280f7
removal of ResClause.num_of_clauses and other simplifications
paulson
parents:
18868
diff
changeset
|
790 |
(**** Produce TPTP files ****) |
18868 | 791 |
|
792 |
(*Attach sign in TPTP syntax: false means negate.*) |
|
21509
6c5755ad9cae
ATP linkup now generates "new TPTP" rather than "old TPTP"
paulson
parents:
21470
diff
changeset
|
793 |
fun tptp_sign true s = s |
6c5755ad9cae
ATP linkup now generates "new TPTP" rather than "old TPTP"
paulson
parents:
21470
diff
changeset
|
794 |
| tptp_sign false s = "~ " ^ s |
18868 | 795 |
|
21509
6c5755ad9cae
ATP linkup now generates "new TPTP" rather than "old TPTP"
paulson
parents:
21470
diff
changeset
|
796 |
fun tptp_of_equality pol ts = |
6c5755ad9cae
ATP linkup now generates "new TPTP" rather than "old TPTP"
paulson
parents:
21470
diff
changeset
|
797 |
let val (s1,s2) = string_of_pair ts |
6c5755ad9cae
ATP linkup now generates "new TPTP" rather than "old TPTP"
paulson
parents:
21470
diff
changeset
|
798 |
val eqop = if pol then " = " else " != " |
6c5755ad9cae
ATP linkup now generates "new TPTP" rather than "old TPTP"
paulson
parents:
21470
diff
changeset
|
799 |
in s1 ^ eqop ^ s2 end; |
15347 | 800 |
|
21509
6c5755ad9cae
ATP linkup now generates "new TPTP" rather than "old TPTP"
paulson
parents:
21470
diff
changeset
|
801 |
fun tptp_literal (Literal(pol,Predicate("equal",_,ts))) = tptp_of_equality pol ts |
6c5755ad9cae
ATP linkup now generates "new TPTP" rather than "old TPTP"
paulson
parents:
21470
diff
changeset
|
802 |
| tptp_literal (Literal(pol,pred)) = tptp_sign pol (string_of_predicate pred); |
6c5755ad9cae
ATP linkup now generates "new TPTP" rather than "old TPTP"
paulson
parents:
21470
diff
changeset
|
803 |
|
6c5755ad9cae
ATP linkup now generates "new TPTP" rather than "old TPTP"
paulson
parents:
21470
diff
changeset
|
804 |
fun tptp_of_typeLit (LTVar (s,ty)) = tptp_sign false (s ^ "(" ^ ty ^ ")") |
6c5755ad9cae
ATP linkup now generates "new TPTP" rather than "old TPTP"
paulson
parents:
21470
diff
changeset
|
805 |
| tptp_of_typeLit (LTFree (s,ty)) = tptp_sign true (s ^ "(" ^ ty ^ ")"); |
15347 | 806 |
|
807 |
fun gen_tptp_cls (cls_id,ax_name,knd,lits) = |
|
21509
6c5755ad9cae
ATP linkup now generates "new TPTP" rather than "old TPTP"
paulson
parents:
21470
diff
changeset
|
808 |
"cnf(" ^ string_of_clausename (cls_id,ax_name) ^ "," ^ |
6c5755ad9cae
ATP linkup now generates "new TPTP" rather than "old TPTP"
paulson
parents:
21470
diff
changeset
|
809 |
name_of_kind knd ^ "," ^ tptp_pack lits ^ ").\n"; |
15347 | 810 |
|
18869
00741f7280f7
removal of ResClause.num_of_clauses and other simplifications
paulson
parents:
18868
diff
changeset
|
811 |
fun tptp_type_lits (Clause {literals, types_sorts, ...}) = |
00741f7280f7
removal of ResClause.num_of_clauses and other simplifications
paulson
parents:
18868
diff
changeset
|
812 |
let val lits = map tptp_literal literals |
00741f7280f7
removal of ResClause.num_of_clauses and other simplifications
paulson
parents:
18868
diff
changeset
|
813 |
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
|
814 |
val tvar_lits_strs = |
00741f7280f7
removal of ResClause.num_of_clauses and other simplifications
paulson
parents:
18868
diff
changeset
|
815 |
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
|
816 |
val tfree_lits = |
00741f7280f7
removal of ResClause.num_of_clauses and other simplifications
paulson
parents:
18868
diff
changeset
|
817 |
if !keep_types then map tptp_of_typeLit tfree_lits else [] |
15347 | 818 |
in |
17305
6cef3aedd661
axioms now included in tptp files, no /bin/cat and various tidying
paulson
parents:
17261
diff
changeset
|
819 |
(tvar_lits_strs @ lits, tfree_lits) |
15347 | 820 |
end; |
821 |
||
18869
00741f7280f7
removal of ResClause.num_of_clauses and other simplifications
paulson
parents:
18868
diff
changeset
|
822 |
fun clause2tptp (cls as Clause {clause_id, axiom_name, kind, ...}) = |
17422 | 823 |
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
|
824 |
(*"lits" includes the typing assumptions (TVars)*) |
21509
6c5755ad9cae
ATP linkup now generates "new TPTP" rather than "old TPTP"
paulson
parents:
21470
diff
changeset
|
825 |
val cls_str = gen_tptp_cls(clause_id, axiom_name, kind, lits) |
15608 | 826 |
in |
827 |
(cls_str,tfree_lits) |
|
828 |
end; |
|
829 |
||
18863 | 830 |
fun tptp_tfree_clause tfree_lit = |
21509
6c5755ad9cae
ATP linkup now generates "new TPTP" rather than "old TPTP"
paulson
parents:
21470
diff
changeset
|
831 |
"cnf(" ^ "tfree_tcs," ^ "negated_conjecture" ^ "," ^ tptp_pack[tfree_lit] ^ ").\n"; |
6c5755ad9cae
ATP linkup now generates "new TPTP" rather than "old TPTP"
paulson
parents:
21470
diff
changeset
|
832 |
|
17525
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
833 |
fun tptp_of_arLit (TConsLit(b,(c,t,args))) = |
18868 | 834 |
tptp_sign b (c ^ "(" ^ t ^ paren_pack args ^ ")") |
17525
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17422
diff
changeset
|
835 |
| tptp_of_arLit (TVarLit(b,(c,str))) = |
18868 | 836 |
tptp_sign b (c ^ "(" ^ str ^ ")") |
15347 | 837 |
|
21560 | 838 |
fun tptp_arity_clause (ArityClause{axiom_name,kind,conclLit,premLits,...}) = |
839 |
"cnf(" ^ string_of_ar axiom_name ^ "," ^ name_of_kind kind ^ "," ^ |
|
840 |
tptp_pack (map tptp_of_arLit (conclLit :: premLits)) ^ ").\n"; |
|
15347 | 841 |
|
842 |
fun tptp_classrelLits sub sup = |
|
21509
6c5755ad9cae
ATP linkup now generates "new TPTP" rather than "old TPTP"
paulson
parents:
21470
diff
changeset
|
843 |
let val tvar = "(T)" |
6c5755ad9cae
ATP linkup now generates "new TPTP" rather than "old TPTP"
paulson
parents:
21470
diff
changeset
|
844 |
in tptp_pack [tptp_sign false (sub^tvar), tptp_sign true (sup^tvar)] end; |
15347 | 845 |
|
18868 | 846 |
fun tptp_classrelClause (ClassrelClause {axiom_name,subclass,superclass,...}) = |
21509
6c5755ad9cae
ATP linkup now generates "new TPTP" rather than "old TPTP"
paulson
parents:
21470
diff
changeset
|
847 |
"cnf(" ^ 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
|
848 |
|
18863 | 849 |
(* write out a subgoal as tptp clauses to the file "xxxx_N"*) |
20038 | 850 |
fun tptp_write_file thms filename (ax_tuples,classrel_clauses,arity_clauses) = |
18863 | 851 |
let |
19207
33f1b4515ce4
Tidying and tracing. Handling exn CLAUSE so that errors don't reach top-level.
paulson
parents:
19197
diff
changeset
|
852 |
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
|
853 |
val clss = make_conjecture_clauses thms |
20038 | 854 |
val (clnames,axclauses) = ListPair.unzip (make_axiom_clauses ax_tuples) |
18863 | 855 |
val (tptp_clss,tfree_litss) = ListPair.unzip (map clause2tptp clss) |
856 |
val tfree_clss = map tptp_tfree_clause (foldl (op union_string) [] tfree_litss) |
|
857 |
val out = TextIO.openOut filename |
|
858 |
in |
|
20038 | 859 |
List.app (curry TextIO.output out o #1 o clause2tptp) axclauses; |
18863 | 860 |
writeln_strs out tfree_clss; |
861 |
writeln_strs out tptp_clss; |
|
18868 | 862 |
List.app (curry TextIO.output out o tptp_classrelClause) classrel_clauses; |
863 |
List.app (curry TextIO.output out o tptp_arity_clause) arity_clauses; |
|
20022 | 864 |
TextIO.closeOut out; |
865 |
clnames |
|
18863 | 866 |
end; |
867 |
||
15347 | 868 |
end; |