author | blanchet |
Sun, 22 May 2011 14:51:04 +0200 | |
changeset 42942 | ad34216cff2f |
parent 42939 | 0134d6650092 |
child 42944 | 9e620869a576 |
permissions | -rw-r--r-- |
38047 | 1 |
(* Title: HOL/Tools/ATP/atp_problem.ML |
38027 | 2 |
Author: Jia Meng, Cambridge University Computer Laboratory and NICTA |
37509
f39464d971c4
factor out TPTP format output into file of its own, to facilitate further changes
blanchet
parents:
diff
changeset
|
3 |
Author: Jasmin Blanchette, TU Muenchen |
f39464d971c4
factor out TPTP format output into file of its own, to facilitate further changes
blanchet
parents:
diff
changeset
|
4 |
|
39452 | 5 |
Abstract representation of ATP problems and TPTP syntax. |
37509
f39464d971c4
factor out TPTP format output into file of its own, to facilitate further changes
blanchet
parents:
diff
changeset
|
6 |
*) |
f39464d971c4
factor out TPTP format output into file of its own, to facilitate further changes
blanchet
parents:
diff
changeset
|
7 |
|
38019
e207a64e1e0b
complete renaming of "Sledgehammer_TPTP_Format" to "ATP_Problem"
blanchet
parents:
38018
diff
changeset
|
8 |
signature ATP_PROBLEM = |
37509
f39464d971c4
factor out TPTP format output into file of its own, to facilitate further changes
blanchet
parents:
diff
changeset
|
9 |
sig |
37992 | 10 |
datatype 'a fo_term = ATerm of 'a * 'a fo_term list |
11 |
datatype quantifier = AForall | AExists |
|
12 |
datatype connective = ANot | AAnd | AOr | AImplies | AIf | AIff | ANotIff |
|
42531
a462dbaa584f
added more rudimentary type support to Sledgehammer's ATP encoding
blanchet
parents:
42530
diff
changeset
|
13 |
datatype ('a, 'b, 'c) formula = |
a462dbaa584f
added more rudimentary type support to Sledgehammer's ATP encoding
blanchet
parents:
42530
diff
changeset
|
14 |
AQuant of quantifier * ('a * 'b option) list * ('a, 'b, 'c) formula | |
a462dbaa584f
added more rudimentary type support to Sledgehammer's ATP encoding
blanchet
parents:
42530
diff
changeset
|
15 |
AConn of connective * ('a, 'b, 'c) formula list | |
a462dbaa584f
added more rudimentary type support to Sledgehammer's ATP encoding
blanchet
parents:
42530
diff
changeset
|
16 |
AAtom of 'c |
37994
b04307085a09
make TPTP generator accept full first-order formulas
blanchet
parents:
37993
diff
changeset
|
17 |
|
42939 | 18 |
datatype format = CNF_UEQ | FOF | TFF |
42525
7a506b0b644f
distinguish FOF and TFF (typed first-order) in ATP abstract syntax tree
blanchet
parents:
42449
diff
changeset
|
19 |
datatype formula_kind = Axiom | Definition | Lemma | Hypothesis | Conjecture |
42527
6a9458524f01
reintroduced constructor for formulas, and automatically detect which logic to use (TFF or FOF) to avoid clutter
blanchet
parents:
42526
diff
changeset
|
20 |
datatype 'a problem_line = |
42543
f9d402d144d4
declare TFF types so that SNARK can be used with types
blanchet
parents:
42538
diff
changeset
|
21 |
Decl of string * 'a * 'a list * 'a | |
42577
78414ec6fa4e
made the format (TFF or FOF) of the TPTP problem a global argument of the problem again and have the ATPs report which formats they support
blanchet
parents:
42567
diff
changeset
|
22 |
Formula of string * formula_kind * ('a, 'a, 'a fo_term) formula |
42529
747736d8b47e
added "useful_info" argument to ATP formulas -- this will probably be useful later to specify intro, simp, elim to SPASS
blanchet
parents:
42528
diff
changeset
|
23 |
* string fo_term option * string fo_term option |
38017
3ad3e3ca2451
move Sledgehammer-specific code out of "Sledgehammer_TPTP_Format"
blanchet
parents:
38014
diff
changeset
|
24 |
type 'a problem = (string * 'a problem_line list) list |
37992 | 25 |
|
42939 | 26 |
(* official TPTP syntax *) |
42752 | 27 |
val tptp_special_prefix : string |
28 |
val tptp_false : string |
|
29 |
val tptp_true : string |
|
42722 | 30 |
val tptp_tff_type_of_types : string |
31 |
val tptp_tff_bool_type : string |
|
32 |
val tptp_tff_individual_type : string |
|
42939 | 33 |
val is_atp_variable : string -> bool |
42942 | 34 |
val mk_anot : ('a, 'b, 'c) formula -> ('a, 'b, 'c) formula |
35 |
val mk_aconn : |
|
36 |
connective -> ('a, 'b, 'c) formula -> ('a, 'b, 'c) formula |
|
37 |
-> ('a, 'b, 'c) formula |
|
38019
e207a64e1e0b
complete renaming of "Sledgehammer_TPTP_Format" to "ATP_Problem"
blanchet
parents:
38018
diff
changeset
|
38 |
val timestamp : unit -> string |
42567
d012947edd36
shorten readable names -- they can get really long with monomorphization, which actually slows down the ATPs
blanchet
parents:
42543
diff
changeset
|
39 |
val hashw : word * word -> word |
d012947edd36
shorten readable names -- they can get really long with monomorphization, which actually slows down the ATPs
blanchet
parents:
42543
diff
changeset
|
40 |
val hashw_string : string * word -> word |
42709
e7af132d48fe
allow each prover to specify its own formula kind for symbols occurring in the conjecture
blanchet
parents:
42659
diff
changeset
|
41 |
val tptp_strings_for_atp_problem : format -> string problem -> string list |
42939 | 42 |
val filter_cnf_ueq_problem : |
43 |
(string * string) problem -> (string * string) problem |
|
39452 | 44 |
val nice_atp_problem : |
38017
3ad3e3ca2451
move Sledgehammer-specific code out of "Sledgehammer_TPTP_Format"
blanchet
parents:
38014
diff
changeset
|
45 |
bool -> ('a * (string * string) problem_line list) list |
3ad3e3ca2451
move Sledgehammer-specific code out of "Sledgehammer_TPTP_Format"
blanchet
parents:
38014
diff
changeset
|
46 |
-> ('a * string problem_line list) list |
3ad3e3ca2451
move Sledgehammer-specific code out of "Sledgehammer_TPTP_Format"
blanchet
parents:
38014
diff
changeset
|
47 |
* (string Symtab.table * string Symtab.table) option |
37509
f39464d971c4
factor out TPTP format output into file of its own, to facilitate further changes
blanchet
parents:
diff
changeset
|
48 |
end; |
f39464d971c4
factor out TPTP format output into file of its own, to facilitate further changes
blanchet
parents:
diff
changeset
|
49 |
|
38019
e207a64e1e0b
complete renaming of "Sledgehammer_TPTP_Format" to "ATP_Problem"
blanchet
parents:
38018
diff
changeset
|
50 |
structure ATP_Problem : ATP_PROBLEM = |
37509
f39464d971c4
factor out TPTP format output into file of its own, to facilitate further changes
blanchet
parents:
diff
changeset
|
51 |
struct |
f39464d971c4
factor out TPTP format output into file of its own, to facilitate further changes
blanchet
parents:
diff
changeset
|
52 |
|
37643
f576af716aa6
rewrote the TPTP problem generation code more or less from scratch;
blanchet
parents:
37642
diff
changeset
|
53 |
(** ATP problem **) |
f576af716aa6
rewrote the TPTP problem generation code more or less from scratch;
blanchet
parents:
37642
diff
changeset
|
54 |
|
37961
6a48c85a211a
first step in using "fof" rather than "cnf" in TPTP problems
blanchet
parents:
37931
diff
changeset
|
55 |
datatype 'a fo_term = ATerm of 'a * 'a fo_term list |
6a48c85a211a
first step in using "fof" rather than "cnf" in TPTP problems
blanchet
parents:
37931
diff
changeset
|
56 |
datatype quantifier = AForall | AExists |
37992 | 57 |
datatype connective = ANot | AAnd | AOr | AImplies | AIf | AIff | ANotIff |
42531
a462dbaa584f
added more rudimentary type support to Sledgehammer's ATP encoding
blanchet
parents:
42530
diff
changeset
|
58 |
datatype ('a, 'b, 'c) formula = |
a462dbaa584f
added more rudimentary type support to Sledgehammer's ATP encoding
blanchet
parents:
42530
diff
changeset
|
59 |
AQuant of quantifier * ('a * 'b option) list * ('a, 'b, 'c) formula | |
a462dbaa584f
added more rudimentary type support to Sledgehammer's ATP encoding
blanchet
parents:
42530
diff
changeset
|
60 |
AConn of connective * ('a, 'b, 'c) formula list | |
a462dbaa584f
added more rudimentary type support to Sledgehammer's ATP encoding
blanchet
parents:
42530
diff
changeset
|
61 |
AAtom of 'c |
37961
6a48c85a211a
first step in using "fof" rather than "cnf" in TPTP problems
blanchet
parents:
37931
diff
changeset
|
62 |
|
42939 | 63 |
datatype format = CNF_UEQ | FOF | TFF |
42525
7a506b0b644f
distinguish FOF and TFF (typed first-order) in ATP abstract syntax tree
blanchet
parents:
42449
diff
changeset
|
64 |
datatype formula_kind = Axiom | Definition | Lemma | Hypothesis | Conjecture |
42527
6a9458524f01
reintroduced constructor for formulas, and automatically detect which logic to use (TFF or FOF) to avoid clutter
blanchet
parents:
42526
diff
changeset
|
65 |
datatype 'a problem_line = |
42543
f9d402d144d4
declare TFF types so that SNARK can be used with types
blanchet
parents:
42538
diff
changeset
|
66 |
Decl of string * 'a * 'a list * 'a | |
42577
78414ec6fa4e
made the format (TFF or FOF) of the TPTP problem a global argument of the problem again and have the ATPs report which formats they support
blanchet
parents:
42567
diff
changeset
|
67 |
Formula of string * formula_kind * ('a, 'a, 'a fo_term) formula |
42529
747736d8b47e
added "useful_info" argument to ATP formulas -- this will probably be useful later to specify intro, simp, elim to SPASS
blanchet
parents:
42528
diff
changeset
|
68 |
* string fo_term option * string fo_term option |
37643
f576af716aa6
rewrote the TPTP problem generation code more or less from scratch;
blanchet
parents:
37642
diff
changeset
|
69 |
type 'a problem = (string * 'a problem_line list) list |
f576af716aa6
rewrote the TPTP problem generation code more or less from scratch;
blanchet
parents:
37642
diff
changeset
|
70 |
|
42722 | 71 |
(* official TPTP syntax *) |
42752 | 72 |
val tptp_special_prefix = "$" |
73 |
val tptp_false = "$false" |
|
74 |
val tptp_true = "$true" |
|
42722 | 75 |
val tptp_tff_type_of_types = "$tType" |
76 |
val tptp_tff_bool_type = "$o" |
|
77 |
val tptp_tff_individual_type = "$i" |
|
78 |
||
42939 | 79 |
fun is_atp_variable s = Char.isUpper (String.sub (s, 0)) |
80 |
||
42942 | 81 |
fun mk_anot (AConn (ANot, [phi])) = phi |
82 |
| mk_anot phi = AConn (ANot, [phi]) |
|
83 |
fun mk_aconn c phi1 phi2 = AConn (c, [phi1, phi2]) |
|
84 |
||
38019
e207a64e1e0b
complete renaming of "Sledgehammer_TPTP_Format" to "ATP_Problem"
blanchet
parents:
38018
diff
changeset
|
85 |
val timestamp = Date.fmt "%Y-%m-%d %H:%M:%S" o Date.fromTimeLocal o Time.now |
e207a64e1e0b
complete renaming of "Sledgehammer_TPTP_Format" to "ATP_Problem"
blanchet
parents:
38018
diff
changeset
|
86 |
|
42567
d012947edd36
shorten readable names -- they can get really long with monomorphization, which actually slows down the ATPs
blanchet
parents:
42543
diff
changeset
|
87 |
(* This hash function is recommended in Compilers: Principles, Techniques, and |
d012947edd36
shorten readable names -- they can get really long with monomorphization, which actually slows down the ATPs
blanchet
parents:
42543
diff
changeset
|
88 |
Tools, by Aho, Sethi, and Ullman. The "hashpjw" function, which they |
d012947edd36
shorten readable names -- they can get really long with monomorphization, which actually slows down the ATPs
blanchet
parents:
42543
diff
changeset
|
89 |
particularly recommend, triggers a bug in versions of Poly/ML up to 4.2.0. *) |
d012947edd36
shorten readable names -- they can get really long with monomorphization, which actually slows down the ATPs
blanchet
parents:
42543
diff
changeset
|
90 |
fun hashw (u, w) = Word.+ (u, Word.* (0w65599, w)) |
d012947edd36
shorten readable names -- they can get really long with monomorphization, which actually slows down the ATPs
blanchet
parents:
42543
diff
changeset
|
91 |
fun hashw_char (c, w) = hashw (Word.fromInt (Char.ord c), w) |
d012947edd36
shorten readable names -- they can get really long with monomorphization, which actually slows down the ATPs
blanchet
parents:
42543
diff
changeset
|
92 |
fun hashw_string (s : string, w) = CharVector.foldl hashw_char w s |
d012947edd36
shorten readable names -- they can get really long with monomorphization, which actually slows down the ATPs
blanchet
parents:
42543
diff
changeset
|
93 |
|
38631
979a0b37f981
prefer TPTP "conjecture" tag to "hypothesis" on ATPs where this is possible;
blanchet
parents:
38613
diff
changeset
|
94 |
fun string_for_kind Axiom = "axiom" |
41769
eb2e39555f98
extended ATP problem syntax to support other applications than Sledgehammer, e.g. experiments with ATPs
blanchet
parents:
41491
diff
changeset
|
95 |
| string_for_kind Definition = "definition" |
eb2e39555f98
extended ATP problem syntax to support other applications than Sledgehammer, e.g. experiments with ATPs
blanchet
parents:
41491
diff
changeset
|
96 |
| string_for_kind Lemma = "lemma" |
38631
979a0b37f981
prefer TPTP "conjecture" tag to "hypothesis" on ATPs where this is possible;
blanchet
parents:
38613
diff
changeset
|
97 |
| string_for_kind Hypothesis = "hypothesis" |
979a0b37f981
prefer TPTP "conjecture" tag to "hypothesis" on ATPs where this is possible;
blanchet
parents:
38613
diff
changeset
|
98 |
| string_for_kind Conjecture = "conjecture" |
979a0b37f981
prefer TPTP "conjecture" tag to "hypothesis" on ATPs where this is possible;
blanchet
parents:
38613
diff
changeset
|
99 |
|
37961
6a48c85a211a
first step in using "fof" rather than "cnf" in TPTP problems
blanchet
parents:
37931
diff
changeset
|
100 |
fun string_for_term (ATerm (s, [])) = s |
38088
a9847fb539dd
fix bug with "=" vs. "fequal" introduced by last change (dddb8ba3a1ce)
blanchet
parents:
38047
diff
changeset
|
101 |
| string_for_term (ATerm ("equal", ts)) = |
a9847fb539dd
fix bug with "=" vs. "fequal" introduced by last change (dddb8ba3a1ce)
blanchet
parents:
38047
diff
changeset
|
102 |
space_implode " = " (map string_for_term ts) |
41769
eb2e39555f98
extended ATP problem syntax to support other applications than Sledgehammer, e.g. experiments with ATPs
blanchet
parents:
41491
diff
changeset
|
103 |
| string_for_term (ATerm ("[]", ts)) = |
eb2e39555f98
extended ATP problem syntax to support other applications than Sledgehammer, e.g. experiments with ATPs
blanchet
parents:
41491
diff
changeset
|
104 |
(* used for lists in the optional "source" field of a derivation *) |
eb2e39555f98
extended ATP problem syntax to support other applications than Sledgehammer, e.g. experiments with ATPs
blanchet
parents:
41491
diff
changeset
|
105 |
"[" ^ commas (map string_for_term ts) ^ "]" |
37961
6a48c85a211a
first step in using "fof" rather than "cnf" in TPTP problems
blanchet
parents:
37931
diff
changeset
|
106 |
| string_for_term (ATerm (s, ts)) = |
38088
a9847fb539dd
fix bug with "=" vs. "fequal" introduced by last change (dddb8ba3a1ce)
blanchet
parents:
38047
diff
changeset
|
107 |
s ^ "(" ^ commas (map string_for_term ts) ^ ")" |
37961
6a48c85a211a
first step in using "fof" rather than "cnf" in TPTP problems
blanchet
parents:
37931
diff
changeset
|
108 |
fun string_for_quantifier AForall = "!" |
6a48c85a211a
first step in using "fof" rather than "cnf" in TPTP problems
blanchet
parents:
37931
diff
changeset
|
109 |
| string_for_quantifier AExists = "?" |
6a48c85a211a
first step in using "fof" rather than "cnf" in TPTP problems
blanchet
parents:
37931
diff
changeset
|
110 |
fun string_for_connective ANot = "~" |
6a48c85a211a
first step in using "fof" rather than "cnf" in TPTP problems
blanchet
parents:
37931
diff
changeset
|
111 |
| string_for_connective AAnd = "&" |
6a48c85a211a
first step in using "fof" rather than "cnf" in TPTP problems
blanchet
parents:
37931
diff
changeset
|
112 |
| string_for_connective AOr = "|" |
6a48c85a211a
first step in using "fof" rather than "cnf" in TPTP problems
blanchet
parents:
37931
diff
changeset
|
113 |
| string_for_connective AImplies = "=>" |
37992 | 114 |
| string_for_connective AIf = "<=" |
37961
6a48c85a211a
first step in using "fof" rather than "cnf" in TPTP problems
blanchet
parents:
37931
diff
changeset
|
115 |
| string_for_connective AIff = "<=>" |
37992 | 116 |
| string_for_connective ANotIff = "<~>" |
42937 | 117 |
fun string_for_bound_var TFF (s, ty) = |
42722 | 118 |
s ^ " : " ^ (ty |> the_default tptp_tff_individual_type) |
42937 | 119 |
| string_for_bound_var _ (s, _) = s |
42722 | 120 |
fun string_for_formula format (AQuant (q, xs, phi)) = |
42526 | 121 |
"(" ^ string_for_quantifier q ^ |
42722 | 122 |
"[" ^ commas (map (string_for_bound_var format) xs) ^ "] : " ^ |
123 |
string_for_formula format phi ^ ")" |
|
124 |
| string_for_formula _ (AConn (ANot, [AAtom (ATerm ("equal", ts))])) = |
|
38005
b6555e9c5de4
prevent schematic variable clash in combinator-introduction code, when invoked from Sledgehammer (another consequence of the CNF -> FOF transition)
blanchet
parents:
38004
diff
changeset
|
125 |
space_implode " != " (map string_for_term ts) |
42722 | 126 |
| string_for_formula format (AConn (c, [phi])) = |
127 |
"(" ^ string_for_connective c ^ " " ^ string_for_formula format phi ^ ")" |
|
128 |
| string_for_formula format (AConn (c, phis)) = |
|
37961
6a48c85a211a
first step in using "fof" rather than "cnf" in TPTP problems
blanchet
parents:
37931
diff
changeset
|
129 |
"(" ^ space_implode (" " ^ string_for_connective c ^ " ") |
42722 | 130 |
(map (string_for_formula format) phis) ^ ")" |
131 |
| string_for_formula _ (AAtom tm) = string_for_term tm |
|
37961
6a48c85a211a
first step in using "fof" rather than "cnf" in TPTP problems
blanchet
parents:
37931
diff
changeset
|
132 |
|
42528 | 133 |
fun string_for_symbol_type [] res_ty = res_ty |
134 |
| string_for_symbol_type [arg_ty] res_ty = arg_ty ^ " > " ^ res_ty |
|
135 |
| string_for_symbol_type arg_tys res_ty = |
|
136 |
string_for_symbol_type ["(" ^ space_implode " * " arg_tys ^ ")"] res_ty |
|
137 |
||
42639 | 138 |
val default_source = |
139 |
ATerm ("inference", ATerm ("isabelle", []) :: replicate 2 (ATerm ("[]", []))) |
|
140 |
||
42709
e7af132d48fe
allow each prover to specify its own formula kind for symbols occurring in the conjecture
blanchet
parents:
42659
diff
changeset
|
141 |
fun string_for_problem_line _ (Decl (ident, sym, arg_tys, res_ty)) = |
42533 | 142 |
"tff(" ^ ident ^ ", type,\n " ^ sym ^ " : " ^ |
42528 | 143 |
string_for_symbol_type arg_tys res_ty ^ ").\n" |
42939 | 144 |
| string_for_problem_line format (Formula (ident, kind, phi, source, info)) = |
145 |
(case format of CNF_UEQ => "cnf" | FOF => "fof" | TFF => "tff") ^ |
|
42709
e7af132d48fe
allow each prover to specify its own formula kind for symbols occurring in the conjecture
blanchet
parents:
42659
diff
changeset
|
146 |
"(" ^ ident ^ ", " ^ string_for_kind kind ^ ",\n (" ^ |
42722 | 147 |
string_for_formula format phi ^ ")" ^ |
42939 | 148 |
(case (source, info) of |
42709
e7af132d48fe
allow each prover to specify its own formula kind for symbols occurring in the conjecture
blanchet
parents:
42659
diff
changeset
|
149 |
(NONE, NONE) => "" |
e7af132d48fe
allow each prover to specify its own formula kind for symbols occurring in the conjecture
blanchet
parents:
42659
diff
changeset
|
150 |
| (SOME tm, NONE) => ", " ^ string_for_term tm |
e7af132d48fe
allow each prover to specify its own formula kind for symbols occurring in the conjecture
blanchet
parents:
42659
diff
changeset
|
151 |
| (_, SOME tm) => |
e7af132d48fe
allow each prover to specify its own formula kind for symbols occurring in the conjecture
blanchet
parents:
42659
diff
changeset
|
152 |
", " ^ string_for_term (source |> the_default default_source) ^ |
e7af132d48fe
allow each prover to specify its own formula kind for symbols occurring in the conjecture
blanchet
parents:
42659
diff
changeset
|
153 |
", " ^ string_for_term tm) ^ ").\n" |
e7af132d48fe
allow each prover to specify its own formula kind for symbols occurring in the conjecture
blanchet
parents:
42659
diff
changeset
|
154 |
fun tptp_strings_for_atp_problem format problem = |
37643
f576af716aa6
rewrote the TPTP problem generation code more or less from scratch;
blanchet
parents:
37642
diff
changeset
|
155 |
"% This file was generated by Isabelle (most likely Sledgehammer)\n\ |
f576af716aa6
rewrote the TPTP problem generation code more or less from scratch;
blanchet
parents:
37642
diff
changeset
|
156 |
\% " ^ timestamp () ^ "\n" :: |
f576af716aa6
rewrote the TPTP problem generation code more or less from scratch;
blanchet
parents:
37642
diff
changeset
|
157 |
maps (fn (_, []) => [] |
f576af716aa6
rewrote the TPTP problem generation code more or less from scratch;
blanchet
parents:
37642
diff
changeset
|
158 |
| (heading, lines) => |
41491 | 159 |
"\n% " ^ heading ^ " (" ^ string_of_int (length lines) ^ ")\n" :: |
42709
e7af132d48fe
allow each prover to specify its own formula kind for symbols occurring in the conjecture
blanchet
parents:
42659
diff
changeset
|
160 |
map (string_for_problem_line format) lines) |
38631
979a0b37f981
prefer TPTP "conjecture" tag to "hypothesis" on ATPs where this is possible;
blanchet
parents:
38613
diff
changeset
|
161 |
problem |
37643
f576af716aa6
rewrote the TPTP problem generation code more or less from scratch;
blanchet
parents:
37642
diff
changeset
|
162 |
|
42939 | 163 |
|
164 |
(** CNF UEQ (Waldmeister) **) |
|
165 |
||
166 |
exception LOST_CONJECTURE of unit |
|
167 |
||
168 |
fun is_problem_line_negated (Formula (_, _, AConn (ANot, _), _, _)) = true |
|
169 |
| is_problem_line_negated _ = false |
|
170 |
||
171 |
fun is_problem_line_cnf_ueq |
|
172 |
(Formula (_, _, AAtom (ATerm (("equal", _), _)), _, _)) = true |
|
173 |
| is_problem_line_cnf_ueq _ = false |
|
174 |
||
175 |
fun open_formula (AQuant (AForall, _, phi)) = open_formula phi |
|
176 |
| open_formula phi = phi |
|
177 |
fun open_non_conjecture_line (line as Formula (_, Conjecture, _, _, _)) = line |
|
178 |
| open_non_conjecture_line (Formula (ident, kind, phi, source, info)) = |
|
179 |
Formula (ident, kind, open_formula phi, source, info) |
|
180 |
| open_non_conjecture_line line = line |
|
181 |
||
182 |
fun negate_conjecture_line (Formula (ident, Conjecture, phi, source, info)) = |
|
42942 | 183 |
Formula (ident, Hypothesis, mk_anot phi, source, info) |
42939 | 184 |
| negate_conjecture_line line = line |
185 |
||
186 |
val filter_cnf_ueq_problem = |
|
187 |
map (apsnd (map open_non_conjecture_line |
|
188 |
#> filter is_problem_line_cnf_ueq |
|
189 |
#> map negate_conjecture_line)) |
|
190 |
#> (fn problem => |
|
191 |
let |
|
192 |
val conjs = problem |> maps snd |> filter is_problem_line_negated |
|
193 |
in if length conjs = 1 then problem else [] end) |
|
38017
3ad3e3ca2451
move Sledgehammer-specific code out of "Sledgehammer_TPTP_Format"
blanchet
parents:
38014
diff
changeset
|
194 |
|
37643
f576af716aa6
rewrote the TPTP problem generation code more or less from scratch;
blanchet
parents:
37642
diff
changeset
|
195 |
|
f576af716aa6
rewrote the TPTP problem generation code more or less from scratch;
blanchet
parents:
37642
diff
changeset
|
196 |
(** Nice names **) |
f576af716aa6
rewrote the TPTP problem generation code more or less from scratch;
blanchet
parents:
37642
diff
changeset
|
197 |
|
37624 | 198 |
fun empty_name_pool readable_names = |
37643
f576af716aa6
rewrote the TPTP problem generation code more or less from scratch;
blanchet
parents:
37642
diff
changeset
|
199 |
if readable_names then SOME (Symtab.empty, Symtab.empty) else NONE |
37624 | 200 |
|
201 |
fun pool_fold f xs z = pair z #> fold_rev (fn x => uncurry (f x)) xs |
|
202 |
fun pool_map f xs = |
|
203 |
pool_fold (fn x => fn ys => fn pool => f x pool |>> (fn y => y :: ys)) xs [] |
|
204 |
||
42227
662b50b7126f
if "monomorphize" is enabled, mangle the type information in the names by default
blanchet
parents:
41769
diff
changeset
|
205 |
val no_qualifiers = |
662b50b7126f
if "monomorphize" is enabled, mangle the type information in the names by default
blanchet
parents:
41769
diff
changeset
|
206 |
let |
662b50b7126f
if "monomorphize" is enabled, mangle the type information in the names by default
blanchet
parents:
41769
diff
changeset
|
207 |
fun skip [] = [] |
662b50b7126f
if "monomorphize" is enabled, mangle the type information in the names by default
blanchet
parents:
41769
diff
changeset
|
208 |
| skip (#"." :: cs) = skip cs |
662b50b7126f
if "monomorphize" is enabled, mangle the type information in the names by default
blanchet
parents:
41769
diff
changeset
|
209 |
| skip (c :: cs) = if Char.isAlphaNum c then skip cs else c :: keep cs |
662b50b7126f
if "monomorphize" is enabled, mangle the type information in the names by default
blanchet
parents:
41769
diff
changeset
|
210 |
and keep [] = [] |
662b50b7126f
if "monomorphize" is enabled, mangle the type information in the names by default
blanchet
parents:
41769
diff
changeset
|
211 |
| keep (#"." :: cs) = skip cs |
662b50b7126f
if "monomorphize" is enabled, mangle the type information in the names by default
blanchet
parents:
41769
diff
changeset
|
212 |
| keep (c :: cs) = c :: keep cs |
662b50b7126f
if "monomorphize" is enabled, mangle the type information in the names by default
blanchet
parents:
41769
diff
changeset
|
213 |
in String.explode #> rev #> keep #> rev #> String.implode end |
662b50b7126f
if "monomorphize" is enabled, mangle the type information in the names by default
blanchet
parents:
41769
diff
changeset
|
214 |
|
42761
8ea9c6fa8b53
fixed several bugs in Isar proof reconstruction, in particular w.r.t. mangled types and hAPP
blanchet
parents:
42752
diff
changeset
|
215 |
(* Long names can slow down the ATPs. *) |
42724
4d6bcf846759
added "max_mono_instances" option to Sledgehammer and renamed old "monomorphize_limit" option
blanchet
parents:
42722
diff
changeset
|
216 |
val max_readable_name_size = 20 |
42567
d012947edd36
shorten readable names -- they can get really long with monomorphization, which actually slows down the ATPs
blanchet
parents:
42543
diff
changeset
|
217 |
|
39109 | 218 |
(* "op" is also reserved, to avoid the unreadable "op_1", "op_2", etc., in the |
219 |
problem files. "equal" is reserved by some ATPs. "eq" is reserved to ensure |
|
220 |
that "HOL.eq" is correctly mapped to equality. *) |
|
221 |
val reserved_nice_names = ["op", "equal", "eq"] |
|
42939 | 222 |
|
37624 | 223 |
fun readable_name full_name s = |
37643
f576af716aa6
rewrote the TPTP problem generation code more or less from scratch;
blanchet
parents:
37642
diff
changeset
|
224 |
if s = full_name then |
f576af716aa6
rewrote the TPTP problem generation code more or less from scratch;
blanchet
parents:
37642
diff
changeset
|
225 |
s |
f576af716aa6
rewrote the TPTP problem generation code more or less from scratch;
blanchet
parents:
37642
diff
changeset
|
226 |
else |
42567
d012947edd36
shorten readable names -- they can get really long with monomorphization, which actually slows down the ATPs
blanchet
parents:
42543
diff
changeset
|
227 |
s |> no_qualifiers |
d012947edd36
shorten readable names -- they can get really long with monomorphization, which actually slows down the ATPs
blanchet
parents:
42543
diff
changeset
|
228 |
|> Name.desymbolize (Char.isUpper (String.sub (full_name, 0))) |
42583
84b134118616
avoid trailing digits for SNARK (type) names -- grr...
blanchet
parents:
42577
diff
changeset
|
229 |
|> (fn s => |
42659 | 230 |
if size s > max_readable_name_size then |
231 |
String.substring (s, 0, max_readable_name_size div 2 - 4) ^ |
|
42583
84b134118616
avoid trailing digits for SNARK (type) names -- grr...
blanchet
parents:
42577
diff
changeset
|
232 |
Word.toString (hashw_string (full_name, 0w0)) ^ |
42659 | 233 |
String.extract (s, size s - max_readable_name_size div 2 + 4, |
234 |
NONE) |
|
42583
84b134118616
avoid trailing digits for SNARK (type) names -- grr...
blanchet
parents:
42577
diff
changeset
|
235 |
else |
84b134118616
avoid trailing digits for SNARK (type) names -- grr...
blanchet
parents:
42577
diff
changeset
|
236 |
s) |
42567
d012947edd36
shorten readable names -- they can get really long with monomorphization, which actually slows down the ATPs
blanchet
parents:
42543
diff
changeset
|
237 |
|> (fn s => if member (op =) reserved_nice_names s then full_name else s) |
37624 | 238 |
|
239 |
fun nice_name (full_name, _) NONE = (full_name, NONE) |
|
240 |
| nice_name (full_name, desired_name) (SOME the_pool) = |
|
39384 | 241 |
if String.isPrefix "$" full_name then |
242 |
(full_name, SOME the_pool) |
|
243 |
else case Symtab.lookup (fst the_pool) full_name of |
|
37624 | 244 |
SOME nice_name => (nice_name, SOME the_pool) |
245 |
| NONE => |
|
246 |
let |
|
247 |
val nice_prefix = readable_name full_name desired_name |
|
248 |
fun add j = |
|
249 |
let |
|
42644 | 250 |
val nice_name = |
42942 | 251 |
nice_prefix ^ (if j = 0 then "" else "_" ^ string_of_int j) |
37624 | 252 |
in |
253 |
case Symtab.lookup (snd the_pool) nice_name of |
|
254 |
SOME full_name' => |
|
255 |
if full_name = full_name' then (nice_name, the_pool) |
|
256 |
else add (j + 1) |
|
257 |
| NONE => |
|
258 |
(nice_name, |
|
259 |
(Symtab.update_new (full_name, nice_name) (fst the_pool), |
|
260 |
Symtab.update_new (nice_name, full_name) (snd the_pool))) |
|
261 |
end |
|
262 |
in add 0 |> apsnd SOME end |
|
263 |
||
37961
6a48c85a211a
first step in using "fof" rather than "cnf" in TPTP problems
blanchet
parents:
37931
diff
changeset
|
264 |
fun nice_term (ATerm (name, ts)) = |
6a48c85a211a
first step in using "fof" rather than "cnf" in TPTP problems
blanchet
parents:
37931
diff
changeset
|
265 |
nice_name name ##>> pool_map nice_term ts #>> ATerm |
6a48c85a211a
first step in using "fof" rather than "cnf" in TPTP problems
blanchet
parents:
37931
diff
changeset
|
266 |
fun nice_formula (AQuant (q, xs, phi)) = |
42526 | 267 |
pool_map nice_name (map fst xs) |
268 |
##>> pool_map (fn NONE => pair NONE |
|
42531
a462dbaa584f
added more rudimentary type support to Sledgehammer's ATP encoding
blanchet
parents:
42530
diff
changeset
|
269 |
| SOME ty => nice_name ty #>> SOME) (map snd xs) |
42526 | 270 |
##>> nice_formula phi |
271 |
#>> (fn ((ss, ts), phi) => AQuant (q, ss ~~ ts, phi)) |
|
37961
6a48c85a211a
first step in using "fof" rather than "cnf" in TPTP problems
blanchet
parents:
37931
diff
changeset
|
272 |
| nice_formula (AConn (c, phis)) = |
6a48c85a211a
first step in using "fof" rather than "cnf" in TPTP problems
blanchet
parents:
37931
diff
changeset
|
273 |
pool_map nice_formula phis #>> curry AConn c |
38034 | 274 |
| nice_formula (AAtom tm) = nice_term tm #>> AAtom |
42543
f9d402d144d4
declare TFF types so that SNARK can be used with types
blanchet
parents:
42538
diff
changeset
|
275 |
fun nice_problem_line (Decl (ident, sym, arg_tys, res_ty)) = |
42528 | 276 |
nice_name sym |
277 |
##>> pool_map nice_name arg_tys |
|
278 |
##>> nice_name res_ty |
|
42543
f9d402d144d4
declare TFF types so that SNARK can be used with types
blanchet
parents:
42538
diff
changeset
|
279 |
#>> (fn ((sym, arg_tys), res_ty) => Decl (ident, sym, arg_tys, res_ty)) |
42939 | 280 |
| nice_problem_line (Formula (ident, kind, phi, source, info)) = |
281 |
nice_formula phi #>> (fn phi => Formula (ident, kind, phi, source, info)) |
|
37931 | 282 |
fun nice_problem problem = |
37643
f576af716aa6
rewrote the TPTP problem generation code more or less from scratch;
blanchet
parents:
37642
diff
changeset
|
283 |
pool_map (fn (heading, lines) => |
37931 | 284 |
pool_map nice_problem_line lines #>> pair heading) problem |
39452 | 285 |
fun nice_atp_problem readable_names problem = |
38017
3ad3e3ca2451
move Sledgehammer-specific code out of "Sledgehammer_TPTP_Format"
blanchet
parents:
38014
diff
changeset
|
286 |
nice_problem problem (empty_name_pool readable_names) |
37509
f39464d971c4
factor out TPTP format output into file of its own, to facilitate further changes
blanchet
parents:
diff
changeset
|
287 |
|
f39464d971c4
factor out TPTP format output into file of its own, to facilitate further changes
blanchet
parents:
diff
changeset
|
288 |
end; |