author | paulson |
Wed, 20 Dec 2006 17:03:46 +0100 | |
changeset 21888 | c75a44597fb7 |
parent 21858 | 05f57309170c |
child 21900 | f386d7eb17d1 |
permissions | -rw-r--r-- |
19194 | 1 |
(* Author: Jia Meng, Cambridge University Computer Laboratory, NICTA |
15608 | 2 |
ID: $Id$ |
3 |
Copyright 2004 University of Cambridge |
|
15347 | 4 |
|
5 |
ATPs with TPTP format input. |
|
6 |
*) |
|
15452 | 7 |
|
20954 | 8 |
(*Currently unused, during debugging*) |
16802
6eeee59dac4c
use Toplevel.print_state_hook instead of adhoc Proof.atp_hook;
wenzelm
parents:
16767
diff
changeset
|
9 |
signature RES_ATP = |
6eeee59dac4c
use Toplevel.print_state_hook instead of adhoc Proof.atp_hook;
wenzelm
parents:
16767
diff
changeset
|
10 |
sig |
17306 | 11 |
val prover: string ref |
16802
6eeee59dac4c
use Toplevel.print_state_hook instead of adhoc Proof.atp_hook;
wenzelm
parents:
16767
diff
changeset
|
12 |
val custom_spass: string list ref |
17484
f6a225f97f0a
simplification of the Isabelle-ATP code; hooks for batch generation of problems
paulson
parents:
17435
diff
changeset
|
13 |
val destdir: string ref |
17849 | 14 |
val helper_path: string -> string -> string |
17484
f6a225f97f0a
simplification of the Isabelle-ATP code; hooks for batch generation of problems
paulson
parents:
17435
diff
changeset
|
15 |
val problem_name: string ref |
17690
8ba7c3cd24a8
time limit option; fixed bug concerning first line of ATP output
paulson
parents:
17525
diff
changeset
|
16 |
val time_limit: int ref |
21224 | 17 |
val set_prover: string -> unit |
21588 | 18 |
|
19194 | 19 |
datatype mode = Auto | Fol | Hol |
19450
651d949776f8
exported linkup_logic_mode and changed the default setting
paulson
parents:
19445
diff
changeset
|
20 |
val linkup_logic_mode : mode ref |
19722 | 21 |
val write_subgoal_file: bool -> mode -> Proof.context -> thm list -> thm list -> int -> string |
19194 | 22 |
val vampire_time: int ref |
23 |
val eprover_time: int ref |
|
19722 | 24 |
val spass_time: int ref |
19194 | 25 |
val run_vampire: int -> unit |
26 |
val run_eprover: int -> unit |
|
19722 | 27 |
val run_spass: int -> unit |
19194 | 28 |
val vampireLimit: unit -> int |
29 |
val eproverLimit: unit -> int |
|
19722 | 30 |
val spassLimit: unit -> int |
20289 | 31 |
val atp_method: (Proof.context -> thm list -> int -> tactic) -> |
32 |
Method.src -> Proof.context -> Proof.method |
|
19194 | 33 |
val cond_rm_tmp: string -> unit |
34 |
val hol_full_types: unit -> unit |
|
35 |
val hol_partial_types: unit -> unit |
|
36 |
val hol_const_types_only: unit -> unit |
|
37 |
val hol_no_types: unit -> unit |
|
38 |
val hol_typ_level: unit -> ResHolClause.type_level |
|
20246
fdfe7399e057
"all theorems" mode forces definition-expansion off.
paulson
parents:
20224
diff
changeset
|
39 |
val include_all: bool ref |
19194 | 40 |
val run_relevance_filter: bool ref |
19768
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
41 |
val run_blacklist_filter: bool ref |
20372
e42674e0486e
blacklist augmented to block some "unit" theorems that cause unsound resolution proofs
paulson
parents:
20289
diff
changeset
|
42 |
val blacklist: string list ref |
19894 | 43 |
val add_all : unit -> unit |
19227
d15f2baa7ecc
Added more functions to the signature and tidied up some functions.
mengj
parents:
19205
diff
changeset
|
44 |
val add_claset : unit -> unit |
d15f2baa7ecc
Added more functions to the signature and tidied up some functions.
mengj
parents:
19205
diff
changeset
|
45 |
val add_simpset : unit -> unit |
d15f2baa7ecc
Added more functions to the signature and tidied up some functions.
mengj
parents:
19205
diff
changeset
|
46 |
val add_clasimp : unit -> unit |
d15f2baa7ecc
Added more functions to the signature and tidied up some functions.
mengj
parents:
19205
diff
changeset
|
47 |
val add_atpset : unit -> unit |
19894 | 48 |
val rm_all : unit -> unit |
19227
d15f2baa7ecc
Added more functions to the signature and tidied up some functions.
mengj
parents:
19205
diff
changeset
|
49 |
val rm_claset : unit -> unit |
d15f2baa7ecc
Added more functions to the signature and tidied up some functions.
mengj
parents:
19205
diff
changeset
|
50 |
val rm_simpset : unit -> unit |
d15f2baa7ecc
Added more functions to the signature and tidied up some functions.
mengj
parents:
19205
diff
changeset
|
51 |
val rm_atpset : unit -> unit |
d15f2baa7ecc
Added more functions to the signature and tidied up some functions.
mengj
parents:
19205
diff
changeset
|
52 |
val rm_clasimp : unit -> unit |
21311 | 53 |
val is_fol_thms : thm list -> bool |
15347 | 54 |
end; |
55 |
||
20457
85414caac94a
refinements to conversion into clause form, esp for the HO case
paulson
parents:
20446
diff
changeset
|
56 |
structure ResAtp = |
15347 | 57 |
struct |
58 |
||
21070 | 59 |
fun timestamp s = Output.debug ("At " ^ Time.toString (Time.now()) ^ ": " ^ s); |
60 |
||
19194 | 61 |
(********************************************************************) |
62 |
(* some settings for both background automatic ATP calling procedure*) |
|
63 |
(* and also explicit ATP invocation methods *) |
|
64 |
(********************************************************************) |
|
65 |
||
66 |
(*** background linkup ***) |
|
21588 | 67 |
val call_atp = ref false; |
17150
ce2a1aeb42aa
DFG output now works for untyped rules (ML "ResClause.untyped();")
quigley
parents:
17091
diff
changeset
|
68 |
val hook_count = ref 0; |
21224 | 69 |
val time_limit = ref 60; |
21588 | 70 |
val prover = ref ""; |
21224 | 71 |
|
21588 | 72 |
fun set_prover atp = |
21224 | 73 |
case String.map Char.toLower atp of |
21588 | 74 |
"e" => |
21290
33b6bb5d6ab8
Improvement to classrel clauses: now outputs the minimum needed.
paulson
parents:
21243
diff
changeset
|
75 |
(ReduceAxiomsN.max_new := 100; |
21224 | 76 |
ReduceAxiomsN.theory_const := false; |
77 |
prover := "E") |
|
21588 | 78 |
| "spass" => |
21224 | 79 |
(ReduceAxiomsN.max_new := 40; |
80 |
ReduceAxiomsN.theory_const := true; |
|
81 |
prover := "spass") |
|
21588 | 82 |
| "vampire" => |
21224 | 83 |
(ReduceAxiomsN.max_new := 60; |
84 |
ReduceAxiomsN.theory_const := false; |
|
85 |
prover := "vampire") |
|
86 |
| _ => error ("No such prover: " ^ atp); |
|
87 |
||
88 |
val _ = set_prover "E"; (* use E as the default prover *) |
|
89 |
||
17305
6cef3aedd661
axioms now included in tptp files, no /bin/cat and various tidying
paulson
parents:
17235
diff
changeset
|
90 |
val custom_spass = (*specialized options for SPASS*) |
17690
8ba7c3cd24a8
time limit option; fixed bug concerning first line of ATP output
paulson
parents:
17525
diff
changeset
|
91 |
ref ["-Auto=0","-FullRed=0","-IORe","-IOFc","-RTaut","-RFSub","-RBSub"]; |
17484
f6a225f97f0a
simplification of the Isabelle-ATP code; hooks for batch generation of problems
paulson
parents:
17435
diff
changeset
|
92 |
val destdir = ref ""; (*Empty means write files to /tmp*) |
f6a225f97f0a
simplification of the Isabelle-ATP code; hooks for batch generation of problems
paulson
parents:
17435
diff
changeset
|
93 |
val problem_name = ref "prob"; |
f6a225f97f0a
simplification of the Isabelle-ATP code; hooks for batch generation of problems
paulson
parents:
17435
diff
changeset
|
94 |
|
17819 | 95 |
(*Return the path to a "helper" like SPASS or tptp2X, first checking that |
21588 | 96 |
it exists. FIXME: modify to use Path primitives and move to some central place.*) |
17819 | 97 |
fun helper_path evar base = |
98 |
case getenv evar of |
|
99 |
"" => error ("Isabelle environment variable " ^ evar ^ " not defined") |
|
21588 | 100 |
| home => |
17819 | 101 |
let val path = home ^ "/" ^ base |
21858
05f57309170c
avoid conflict with Alice keywords: renamed pack -> implode, unpack -> explode, any -> many, avoided assert;
wenzelm
parents:
21790
diff
changeset
|
102 |
in if File.exists (File.explode_platform_path path) then path |
21588 | 103 |
else error ("Could not find the file " ^ path) |
104 |
end; |
|
17819 | 105 |
|
21588 | 106 |
fun probfile_nosuffix _ = |
17484
f6a225f97f0a
simplification of the Isabelle-ATP code; hooks for batch generation of problems
paulson
parents:
17435
diff
changeset
|
107 |
if !destdir = "" then File.platform_path (File.tmp_path (Path.basic (!problem_name))) |
21858
05f57309170c
avoid conflict with Alice keywords: renamed pack -> implode, unpack -> explode, any -> many, avoided assert;
wenzelm
parents:
21790
diff
changeset
|
108 |
else if File.exists (File.explode_platform_path (!destdir)) |
17484
f6a225f97f0a
simplification of the Isabelle-ATP code; hooks for batch generation of problems
paulson
parents:
17435
diff
changeset
|
109 |
then !destdir ^ "/" ^ !problem_name |
f6a225f97f0a
simplification of the Isabelle-ATP code; hooks for batch generation of problems
paulson
parents:
17435
diff
changeset
|
110 |
else error ("No such directory: " ^ !destdir); |
15644 | 111 |
|
17717 | 112 |
fun prob_pathname n = probfile_nosuffix n ^ "_" ^ Int.toString n; |
113 |
||
19194 | 114 |
|
115 |
(*** ATP methods ***) |
|
116 |
val vampire_time = ref 60; |
|
117 |
val eprover_time = ref 60; |
|
19722 | 118 |
val spass_time = ref 60; |
119 |
||
21588 | 120 |
fun run_vampire time = |
19194 | 121 |
if (time >0) then vampire_time:= time |
122 |
else vampire_time:=60; |
|
123 |
||
21588 | 124 |
fun run_eprover time = |
19194 | 125 |
if (time > 0) then eprover_time:= time |
126 |
else eprover_time:=60; |
|
127 |
||
21588 | 128 |
fun run_spass time = |
19722 | 129 |
if (time > 0) then spass_time:=time |
130 |
else spass_time:=60; |
|
131 |
||
132 |
||
19194 | 133 |
fun vampireLimit () = !vampire_time; |
134 |
fun eproverLimit () = !eprover_time; |
|
19722 | 135 |
fun spassLimit () = !spass_time; |
19194 | 136 |
|
137 |
val hol_full_types = ResHolClause.full_types; |
|
138 |
val hol_partial_types = ResHolClause.partial_types; |
|
139 |
val hol_const_types_only = ResHolClause.const_types_only; |
|
140 |
val hol_no_types = ResHolClause.no_types; |
|
141 |
fun hol_typ_level () = ResHolClause.find_typ_level (); |
|
21588 | 142 |
fun is_typed_hol () = |
19194 | 143 |
let val tp_level = hol_typ_level() |
144 |
in |
|
21588 | 145 |
not (tp_level = ResHolClause.T_NONE) |
19194 | 146 |
end; |
147 |
||
148 |
fun atp_input_file () = |
|
21588 | 149 |
let val file = !problem_name |
19194 | 150 |
in |
21588 | 151 |
if !destdir = "" then File.platform_path (File.tmp_path (Path.basic file)) |
21858
05f57309170c
avoid conflict with Alice keywords: renamed pack -> implode, unpack -> explode, any -> many, avoided assert;
wenzelm
parents:
21790
diff
changeset
|
152 |
else if File.exists (File.explode_platform_path (!destdir)) |
21588 | 153 |
then !destdir ^ "/" ^ file |
154 |
else error ("No such directory: " ^ !destdir) |
|
19194 | 155 |
end; |
156 |
||
20868
724ab9896068
Improved detection of identical clauses, also in the conjecture
paulson
parents:
20854
diff
changeset
|
157 |
val include_all = ref true; |
19194 | 158 |
val include_simpset = ref false; |
21588 | 159 |
val include_claset = ref false; |
19194 | 160 |
val include_atpset = ref true; |
20246
fdfe7399e057
"all theorems" mode forces definition-expansion off.
paulson
parents:
20224
diff
changeset
|
161 |
|
fdfe7399e057
"all theorems" mode forces definition-expansion off.
paulson
parents:
20224
diff
changeset
|
162 |
(*Tests show that follow_defs gives VERY poor results with "include_all"*) |
fdfe7399e057
"all theorems" mode forces definition-expansion off.
paulson
parents:
20224
diff
changeset
|
163 |
fun add_all() = (include_all:=true; ReduceAxiomsN.follow_defs := false); |
fdfe7399e057
"all theorems" mode forces definition-expansion off.
paulson
parents:
20224
diff
changeset
|
164 |
fun rm_all() = include_all:=false; |
fdfe7399e057
"all theorems" mode forces definition-expansion off.
paulson
parents:
20224
diff
changeset
|
165 |
|
fdfe7399e057
"all theorems" mode forces definition-expansion off.
paulson
parents:
20224
diff
changeset
|
166 |
fun add_simpset() = include_simpset:=true; |
fdfe7399e057
"all theorems" mode forces definition-expansion off.
paulson
parents:
20224
diff
changeset
|
167 |
fun rm_simpset() = include_simpset:=false; |
fdfe7399e057
"all theorems" mode forces definition-expansion off.
paulson
parents:
20224
diff
changeset
|
168 |
|
fdfe7399e057
"all theorems" mode forces definition-expansion off.
paulson
parents:
20224
diff
changeset
|
169 |
fun add_claset() = include_claset:=true; |
fdfe7399e057
"all theorems" mode forces definition-expansion off.
paulson
parents:
20224
diff
changeset
|
170 |
fun rm_claset() = include_claset:=false; |
fdfe7399e057
"all theorems" mode forces definition-expansion off.
paulson
parents:
20224
diff
changeset
|
171 |
|
fdfe7399e057
"all theorems" mode forces definition-expansion off.
paulson
parents:
20224
diff
changeset
|
172 |
fun add_clasimp() = (include_simpset:=true;include_claset:=true); |
fdfe7399e057
"all theorems" mode forces definition-expansion off.
paulson
parents:
20224
diff
changeset
|
173 |
fun rm_clasimp() = (include_simpset:=false;include_claset:=false); |
fdfe7399e057
"all theorems" mode forces definition-expansion off.
paulson
parents:
20224
diff
changeset
|
174 |
|
fdfe7399e057
"all theorems" mode forces definition-expansion off.
paulson
parents:
20224
diff
changeset
|
175 |
fun add_atpset() = include_atpset:=true; |
fdfe7399e057
"all theorems" mode forces definition-expansion off.
paulson
parents:
20224
diff
changeset
|
176 |
fun rm_atpset() = include_atpset:=false; |
19194 | 177 |
|
178 |
||
179 |
(**** relevance filter ****) |
|
20457
85414caac94a
refinements to conversion into clause form, esp for the HO case
paulson
parents:
20446
diff
changeset
|
180 |
val run_relevance_filter = ReduceAxiomsN.run_relevance_filter; |
19768
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
181 |
val run_blacklist_filter = ref true; |
19194 | 182 |
|
183 |
(******************************************************************) |
|
184 |
(* detect whether a given problem (clauses) is FOL/HOL/HOLC/HOLCS *) |
|
185 |
(******************************************************************) |
|
186 |
||
187 |
datatype logic = FOL | HOL | HOLC | HOLCS; |
|
188 |
||
189 |
fun string_of_logic FOL = "FOL" |
|
190 |
| string_of_logic HOL = "HOL" |
|
191 |
| string_of_logic HOLC = "HOLC" |
|
192 |
| string_of_logic HOLCS = "HOLCS"; |
|
193 |
||
194 |
fun is_fol_logic FOL = true |
|
195 |
| is_fol_logic _ = false |
|
196 |
||
197 |
(*HOLCS will not occur here*) |
|
198 |
fun upgrade_lg HOLC _ = HOLC |
|
199 |
| upgrade_lg HOL HOLC = HOLC |
|
200 |
| upgrade_lg HOL _ = HOL |
|
21588 | 201 |
| upgrade_lg FOL lg = lg; |
19194 | 202 |
|
203 |
(* check types *) |
|
19451 | 204 |
fun has_bool_hfn (Type("bool",_)) = true |
205 |
| has_bool_hfn (Type("fun",_)) = true |
|
206 |
| has_bool_hfn (Type(_, Ts)) = exists has_bool_hfn Ts |
|
207 |
| has_bool_hfn _ = false; |
|
19194 | 208 |
|
19451 | 209 |
fun is_hol_fn tp = |
19194 | 210 |
let val (targs,tr) = strip_type tp |
211 |
in |
|
21588 | 212 |
exists (has_bool_hfn) (tr::targs) |
19194 | 213 |
end; |
214 |
||
19451 | 215 |
fun is_hol_pred tp = |
216 |
let val (targs,tr) = strip_type tp |
|
217 |
in |
|
21588 | 218 |
exists (has_bool_hfn) targs |
19451 | 219 |
end; |
19194 | 220 |
|
221 |
exception FN_LG of term; |
|
222 |
||
21588 | 223 |
fun fn_lg (t as Const(f,tp)) (lg,seen) = |
224 |
if is_hol_fn tp then (upgrade_lg HOL lg, insert (op =) t seen) else (lg, insert (op =) t seen) |
|
225 |
| fn_lg (t as Free(f,tp)) (lg,seen) = |
|
226 |
if is_hol_fn tp then (upgrade_lg HOL lg, insert (op =) t seen) else (lg, insert (op =) t seen) |
|
19194 | 227 |
| fn_lg (t as Var(f,tp)) (lg,seen) = |
20854 | 228 |
if is_hol_fn tp then (upgrade_lg HOL lg,insert (op =) t seen) else (lg,insert (op =) t seen) |
229 |
| fn_lg (t as Abs(_,_,_)) (lg,seen) = (upgrade_lg HOLC lg,insert (op =) t seen) |
|
21588 | 230 |
| fn_lg f _ = raise FN_LG(f); |
19194 | 231 |
|
232 |
||
233 |
fun term_lg [] (lg,seen) = (lg,seen) |
|
234 |
| term_lg (tm::tms) (FOL,seen) = |
|
20457
85414caac94a
refinements to conversion into clause form, esp for the HO case
paulson
parents:
20446
diff
changeset
|
235 |
let val (f,args) = strip_comb tm |
21588 | 236 |
val (lg',seen') = if f mem seen then (FOL,seen) |
237 |
else fn_lg f (FOL,seen) |
|
20457
85414caac94a
refinements to conversion into clause form, esp for the HO case
paulson
parents:
20446
diff
changeset
|
238 |
in |
21588 | 239 |
if is_fol_logic lg' then () |
20457
85414caac94a
refinements to conversion into clause form, esp for the HO case
paulson
parents:
20446
diff
changeset
|
240 |
else Output.debug ("Found a HOL term: " ^ Display.raw_string_of_term f); |
85414caac94a
refinements to conversion into clause form, esp for the HO case
paulson
parents:
20446
diff
changeset
|
241 |
term_lg (args@tms) (lg',seen') |
85414caac94a
refinements to conversion into clause form, esp for the HO case
paulson
parents:
20446
diff
changeset
|
242 |
end |
19194 | 243 |
| term_lg _ (lg,seen) = (lg,seen) |
244 |
||
245 |
exception PRED_LG of term; |
|
246 |
||
21588 | 247 |
fun pred_lg (t as Const(P,tp)) (lg,seen)= |
248 |
if is_hol_pred tp then (upgrade_lg HOL lg, insert (op =) t seen) |
|
249 |
else (lg,insert (op =) t seen) |
|
19194 | 250 |
| pred_lg (t as Free(P,tp)) (lg,seen) = |
21588 | 251 |
if is_hol_pred tp then (upgrade_lg HOL lg, insert (op =) t seen) |
21470
7c1b59ddcd56
Consolidation of code to "blacklist" unhelpful theorems, including record
paulson
parents:
21431
diff
changeset
|
252 |
else (lg,insert (op =) t seen) |
20854 | 253 |
| pred_lg (t as Var(_,_)) (lg,seen) = (upgrade_lg HOL lg, insert (op =) t seen) |
19194 | 254 |
| pred_lg P _ = raise PRED_LG(P); |
255 |
||
256 |
||
257 |
fun lit_lg (Const("Not",_) $ P) (lg,seen) = lit_lg P (lg,seen) |
|
258 |
| lit_lg P (lg,seen) = |
|
20457
85414caac94a
refinements to conversion into clause form, esp for the HO case
paulson
parents:
20446
diff
changeset
|
259 |
let val (pred,args) = strip_comb P |
21588 | 260 |
val (lg',seen') = if pred mem seen then (lg,seen) |
261 |
else pred_lg pred (lg,seen) |
|
20457
85414caac94a
refinements to conversion into clause form, esp for the HO case
paulson
parents:
20446
diff
changeset
|
262 |
in |
21588 | 263 |
if is_fol_logic lg' then () |
264 |
else Output.debug ("Found a HOL predicate: " ^ Display.raw_string_of_term pred); |
|
265 |
term_lg args (lg',seen') |
|
20457
85414caac94a
refinements to conversion into clause form, esp for the HO case
paulson
parents:
20446
diff
changeset
|
266 |
end; |
19194 | 267 |
|
268 |
fun lits_lg [] (lg,seen) = (lg,seen) |
|
269 |
| lits_lg (lit::lits) (FOL,seen) = |
|
20457
85414caac94a
refinements to conversion into clause form, esp for the HO case
paulson
parents:
20446
diff
changeset
|
270 |
let val (lg,seen') = lit_lg lit (FOL,seen) |
85414caac94a
refinements to conversion into clause form, esp for the HO case
paulson
parents:
20446
diff
changeset
|
271 |
in |
21588 | 272 |
if is_fol_logic lg then () |
273 |
else Output.debug ("Found a HOL literal: " ^ Display.raw_string_of_term lit); |
|
274 |
lits_lg lits (lg,seen') |
|
20457
85414caac94a
refinements to conversion into clause form, esp for the HO case
paulson
parents:
20446
diff
changeset
|
275 |
end |
19194 | 276 |
| lits_lg lits (lg,seen) = (lg,seen); |
277 |
||
21470
7c1b59ddcd56
Consolidation of code to "blacklist" unhelpful theorems, including record
paulson
parents:
21431
diff
changeset
|
278 |
fun dest_disj_aux (Const("Trueprop",_) $ t) disjs = dest_disj_aux t disjs |
7c1b59ddcd56
Consolidation of code to "blacklist" unhelpful theorems, including record
paulson
parents:
21431
diff
changeset
|
279 |
| dest_disj_aux (Const ("op |", _) $ t $ t') disjs = dest_disj_aux t (dest_disj_aux t' disjs) |
19227
d15f2baa7ecc
Added more functions to the signature and tidied up some functions.
mengj
parents:
19205
diff
changeset
|
280 |
| dest_disj_aux t disjs = t::disjs; |
d15f2baa7ecc
Added more functions to the signature and tidied up some functions.
mengj
parents:
19205
diff
changeset
|
281 |
|
d15f2baa7ecc
Added more functions to the signature and tidied up some functions.
mengj
parents:
19205
diff
changeset
|
282 |
fun dest_disj t = dest_disj_aux t []; |
d15f2baa7ecc
Added more functions to the signature and tidied up some functions.
mengj
parents:
19205
diff
changeset
|
283 |
|
21470
7c1b59ddcd56
Consolidation of code to "blacklist" unhelpful theorems, including record
paulson
parents:
21431
diff
changeset
|
284 |
fun logic_of_clause tm = lits_lg (dest_disj tm); |
19194 | 285 |
|
286 |
fun logic_of_clauses [] (lg,seen) = (lg,seen) |
|
287 |
| logic_of_clauses (cls::clss) (FOL,seen) = |
|
19227
d15f2baa7ecc
Added more functions to the signature and tidied up some functions.
mengj
parents:
19205
diff
changeset
|
288 |
let val (lg,seen') = logic_of_clause cls (FOL,seen) |
21588 | 289 |
val _ = |
19641
f1de44e61ec1
replaced low-level Term.str_of by Display.raw_string_of_term (should actually use Display.string_of_term);
wenzelm
parents:
19617
diff
changeset
|
290 |
if is_fol_logic lg then () |
19746 | 291 |
else Output.debug ("Found a HOL clause: " ^ Display.raw_string_of_term cls) |
19227
d15f2baa7ecc
Added more functions to the signature and tidied up some functions.
mengj
parents:
19205
diff
changeset
|
292 |
in |
21588 | 293 |
logic_of_clauses clss (lg,seen') |
19227
d15f2baa7ecc
Added more functions to the signature and tidied up some functions.
mengj
parents:
19205
diff
changeset
|
294 |
end |
19194 | 295 |
| logic_of_clauses (cls::clss) (lg,seen) = (lg,seen); |
296 |
||
297 |
fun problem_logic_goals_aux [] (lg,seen) = lg |
|
21588 | 298 |
| problem_logic_goals_aux (subgoal::subgoals) (lg,seen) = |
19194 | 299 |
problem_logic_goals_aux subgoals (logic_of_clauses subgoal (lg,seen)); |
21588 | 300 |
|
19194 | 301 |
fun problem_logic_goals subgoals = problem_logic_goals_aux subgoals (FOL,[]); |
302 |
||
21311 | 303 |
fun is_fol_thms ths = ((fst(logic_of_clauses (map prop_of ths) (FOL,[]))) = FOL); |
304 |
||
19768
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
305 |
(***************************************************************) |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
306 |
(* Retrieving and filtering lemmas *) |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
307 |
(***************************************************************) |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
308 |
|
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
309 |
(*** white list and black list of lemmas ***) |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
310 |
|
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
311 |
(*The rule subsetI is frequently omitted by the relevance filter.*) |
21588 | 312 |
val whitelist = ref [subsetI]; |
313 |
||
314 |
(*Names of theorems (not theorem lists! See multi_blacklist below) to be banned. |
|
20444 | 315 |
|
316 |
These theorems typically produce clauses that are prolific (match too many equality or |
|
19768
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
317 |
membership literals) and relate to seldom-used facts. Some duplicate other rules. |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
318 |
FIXME: this blacklist needs to be maintained using theory data and added to using |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
319 |
an attribute.*) |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
320 |
val blacklist = ref |
20526
756c4f1fd04c
Extended the blacklist with higher-order theorems. Restructured. Added checks to
paulson
parents:
20457
diff
changeset
|
321 |
["Datatype.prod.size", |
19768
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
322 |
"Divides.dvd_0_left_iff", |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
323 |
"Finite_Set.card_0_eq", |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
324 |
"Finite_Set.card_infinite", |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
325 |
"Finite_Set.Max_ge", |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
326 |
"Finite_Set.Max_in", |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
327 |
"Finite_Set.Max_le_iff", |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
328 |
"Finite_Set.Max_less_iff", |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
329 |
"Finite_Set.max.f_below_strict_below.below_f_conv", (*duplicates in Orderings.*) |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
330 |
"Finite_Set.max.f_below_strict_below.strict_below_f_conv", (*duplicates in Orderings.*) |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
331 |
"Finite_Set.Min_ge_iff", |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
332 |
"Finite_Set.Min_gr_iff", |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
333 |
"Finite_Set.Min_in", |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
334 |
"Finite_Set.Min_le", |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
335 |
"Finite_Set.min.f_below_strict_below.below_f_conv", (*duplicates in Orderings.*) |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
336 |
"Finite_Set.min.f_below_strict_below.strict_below_f_conv", (*duplicates in Orderings.*) |
20526
756c4f1fd04c
Extended the blacklist with higher-order theorems. Restructured. Added checks to
paulson
parents:
20457
diff
changeset
|
337 |
"Fun.vimage_image_eq", (*involves an existential quantifier*) |
756c4f1fd04c
Extended the blacklist with higher-order theorems. Restructured. Added checks to
paulson
parents:
20457
diff
changeset
|
338 |
"HOL.split_if_asm", (*splitting theorem*) |
20457
85414caac94a
refinements to conversion into clause form, esp for the HO case
paulson
parents:
20446
diff
changeset
|
339 |
"HOL.split_if", (*splitting theorem*) |
20526
756c4f1fd04c
Extended the blacklist with higher-order theorems. Restructured. Added checks to
paulson
parents:
20457
diff
changeset
|
340 |
"IntDef.abs_split", |
19768
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
341 |
"IntDef.Integ.Abs_Integ_inject", |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
342 |
"IntDef.Integ.Abs_Integ_inverse", |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
343 |
"IntDiv.zdvd_0_left", |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
344 |
"List.append_eq_append_conv", |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
345 |
"List.hd_Cons_tl", (*Says everything is [] or Cons. Probably prolific.*) |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
346 |
"List.in_listsD", |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
347 |
"List.in_listsI", |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
348 |
"List.lists.Cons", |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
349 |
"List.listsE", |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
350 |
"Nat.less_one", (*not directional? obscure*) |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
351 |
"Nat.not_gr0", |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
352 |
"Nat.one_eq_mult_iff", (*duplicate by symmetry*) |
21243 | 353 |
"Nat.of_nat_0_eq_iff", |
354 |
"Nat.of_nat_eq_0_iff", |
|
355 |
"Nat.of_nat_le_0_iff", |
|
19768
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
356 |
"NatSimprocs.divide_le_0_iff_number_of", (*too many clauses*) |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
357 |
"NatSimprocs.divide_less_0_iff_number_of", |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
358 |
"NatSimprocs.equation_minus_iff_1", (*not directional*) |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
359 |
"NatSimprocs.equation_minus_iff_number_of", (*not directional*) |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
360 |
"NatSimprocs.le_minus_iff_1", (*not directional*) |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
361 |
"NatSimprocs.le_minus_iff_number_of", (*not directional*) |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
362 |
"NatSimprocs.less_minus_iff_1", (*not directional*) |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
363 |
"NatSimprocs.less_minus_iff_number_of", (*not directional*) |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
364 |
"NatSimprocs.minus_equation_iff_number_of", (*not directional*) |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
365 |
"NatSimprocs.minus_le_iff_1", (*not directional*) |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
366 |
"NatSimprocs.minus_le_iff_number_of", (*not directional*) |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
367 |
"NatSimprocs.minus_less_iff_1", (*not directional*) |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
368 |
"NatSimprocs.mult_le_cancel_left_number_of", (*excessive case analysis*) |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
369 |
"NatSimprocs.mult_le_cancel_right_number_of", (*excessive case analysis*) |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
370 |
"NatSimprocs.mult_less_cancel_left_number_of", (*excessive case analysis*) |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
371 |
"NatSimprocs.mult_less_cancel_right_number_of", (*excessive case analysis*) |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
372 |
"NatSimprocs.zero_le_divide_iff_number_of", (*excessive case analysis*) |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
373 |
"NatSimprocs.zero_less_divide_iff_number_of", |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
374 |
"OrderedGroup.abs_0_eq", (*duplicate by symmetry*) |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
375 |
"OrderedGroup.diff_eq_0_iff_eq", (*prolific?*) |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
376 |
"OrderedGroup.join_0_eq_0", |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
377 |
"OrderedGroup.meet_0_eq_0", |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
378 |
"OrderedGroup.pprt_eq_0", (*obscure*) |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
379 |
"OrderedGroup.pprt_eq_id", (*obscure*) |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
380 |
"OrderedGroup.pprt_mono", (*obscure*) |
20526
756c4f1fd04c
Extended the blacklist with higher-order theorems. Restructured. Added checks to
paulson
parents:
20457
diff
changeset
|
381 |
"Orderings.split_max", (*splitting theorem*) |
20457
85414caac94a
refinements to conversion into clause form, esp for the HO case
paulson
parents:
20446
diff
changeset
|
382 |
"Orderings.split_min", (*splitting theorem*) |
19768
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
383 |
"Power.zero_less_power_abs_iff", |
20526
756c4f1fd04c
Extended the blacklist with higher-order theorems. Restructured. Added checks to
paulson
parents:
20457
diff
changeset
|
384 |
"Product_Type.split_eta_SetCompr", (*involves an existential quantifier*) |
20457
85414caac94a
refinements to conversion into clause form, esp for the HO case
paulson
parents:
20446
diff
changeset
|
385 |
"Product_Type.split_paired_Ball_Sigma", (*splitting theorem*) |
85414caac94a
refinements to conversion into clause form, esp for the HO case
paulson
parents:
20446
diff
changeset
|
386 |
"Product_Type.split_paired_Bex_Sigma", (*splitting theorem*) |
20526
756c4f1fd04c
Extended the blacklist with higher-order theorems. Restructured. Added checks to
paulson
parents:
20457
diff
changeset
|
387 |
"Product_Type.split_split_asm", (*splitting theorem*) |
20457
85414caac94a
refinements to conversion into clause form, esp for the HO case
paulson
parents:
20446
diff
changeset
|
388 |
"Product_Type.split_split", (*splitting theorem*) |
20526
756c4f1fd04c
Extended the blacklist with higher-order theorems. Restructured. Added checks to
paulson
parents:
20457
diff
changeset
|
389 |
"Product_Type.unit_abs_eta_conv", |
756c4f1fd04c
Extended the blacklist with higher-order theorems. Restructured. Added checks to
paulson
parents:
20457
diff
changeset
|
390 |
"Product_Type.unit_induct", |
19768
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
391 |
"Relation.diagI", |
20526
756c4f1fd04c
Extended the blacklist with higher-order theorems. Restructured. Added checks to
paulson
parents:
20457
diff
changeset
|
392 |
"Relation.Domain_def", (*involves an existential quantifier*) |
756c4f1fd04c
Extended the blacklist with higher-order theorems. Restructured. Added checks to
paulson
parents:
20457
diff
changeset
|
393 |
"Relation.Image_def", (*involves an existential quantifier*) |
19768
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
394 |
"Relation.ImageI", |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
395 |
"Ring_and_Field.divide_cancel_left", (*fields are seldom used & often prolific*) |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
396 |
"Ring_and_Field.divide_cancel_right", |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
397 |
"Ring_and_Field.divide_divide_eq_left", |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
398 |
"Ring_and_Field.divide_divide_eq_right", |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
399 |
"Ring_and_Field.divide_eq_0_iff", |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
400 |
"Ring_and_Field.divide_eq_1_iff", |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
401 |
"Ring_and_Field.divide_eq_eq_1", |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
402 |
"Ring_and_Field.divide_le_0_1_iff", |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
403 |
"Ring_and_Field.divide_le_eq_1_neg", (*obscure and prolific*) |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
404 |
"Ring_and_Field.divide_le_eq_1_pos", (*obscure and prolific*) |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
405 |
"Ring_and_Field.divide_less_0_1_iff", |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
406 |
"Ring_and_Field.divide_less_eq_1_neg", (*obscure and prolific*) |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
407 |
"Ring_and_Field.divide_less_eq_1_pos", (*obscure and prolific*) |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
408 |
"Ring_and_Field.eq_divide_eq_1", (*duplicate by symmetry*) |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
409 |
"Ring_and_Field.field_mult_cancel_left", |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
410 |
"Ring_and_Field.field_mult_cancel_right", |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
411 |
"Ring_and_Field.inverse_le_iff_le_neg", |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
412 |
"Ring_and_Field.inverse_le_iff_le", |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
413 |
"Ring_and_Field.inverse_less_iff_less_neg", |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
414 |
"Ring_and_Field.inverse_less_iff_less", |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
415 |
"Ring_and_Field.le_divide_eq_1_neg", (*obscure and prolific*) |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
416 |
"Ring_and_Field.le_divide_eq_1_pos", (*obscure and prolific*) |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
417 |
"Ring_and_Field.less_divide_eq_1_neg", (*obscure and prolific*) |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
418 |
"Ring_and_Field.less_divide_eq_1_pos", (*obscure and prolific*) |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
419 |
"Ring_and_Field.one_eq_divide_iff", (*duplicate by symmetry*) |
20526
756c4f1fd04c
Extended the blacklist with higher-order theorems. Restructured. Added checks to
paulson
parents:
20457
diff
changeset
|
420 |
"Set.Collect_bex_eq", (*involves an existential quantifier*) |
756c4f1fd04c
Extended the blacklist with higher-order theorems. Restructured. Added checks to
paulson
parents:
20457
diff
changeset
|
421 |
"Set.Collect_ex_eq", (*involves an existential quantifier*) |
19768
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
422 |
"Set.Diff_eq_empty_iff", (*redundant with paramodulation*) |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
423 |
"Set.Diff_insert0", |
20526
756c4f1fd04c
Extended the blacklist with higher-order theorems. Restructured. Added checks to
paulson
parents:
20457
diff
changeset
|
424 |
"Set.empty_Union_conv", (*redundant with paramodulation*) |
756c4f1fd04c
Extended the blacklist with higher-order theorems. Restructured. Added checks to
paulson
parents:
20457
diff
changeset
|
425 |
"Set.full_SetCompr_eq", (*involves an existential quantifier*) |
756c4f1fd04c
Extended the blacklist with higher-order theorems. Restructured. Added checks to
paulson
parents:
20457
diff
changeset
|
426 |
"Set.image_Collect", (*involves an existential quantifier*) |
756c4f1fd04c
Extended the blacklist with higher-order theorems. Restructured. Added checks to
paulson
parents:
20457
diff
changeset
|
427 |
"Set.image_def", (*involves an existential quantifier*) |
756c4f1fd04c
Extended the blacklist with higher-order theorems. Restructured. Added checks to
paulson
parents:
20457
diff
changeset
|
428 |
"Set.Int_UNIV", (*redundant with paramodulation*) |
756c4f1fd04c
Extended the blacklist with higher-order theorems. Restructured. Added checks to
paulson
parents:
20457
diff
changeset
|
429 |
"Set.Inter_iff", (*We already have InterI, InterE*) |
19768
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
430 |
"Set.psubsetE", (*too prolific and obscure*) |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
431 |
"Set.psubsetI", |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
432 |
"Set.singleton_insert_inj_eq'", |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
433 |
"Set.singleton_insert_inj_eq", |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
434 |
"Set.singletonD", (*these two duplicate some "insert" lemmas*) |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
435 |
"Set.singletonI", |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
436 |
"Set.Un_empty", (*redundant with paramodulation*) |
20526
756c4f1fd04c
Extended the blacklist with higher-order theorems. Restructured. Added checks to
paulson
parents:
20457
diff
changeset
|
437 |
"Set.UNION_def", (*involves an existential quantifier*) |
19768
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
438 |
"Set.Union_empty_conv", (*redundant with paramodulation*) |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
439 |
"Set.Union_iff", (*We already have UnionI, UnionE*) |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
440 |
"SetInterval.atLeastAtMost_iff", (*obscure and prolific*) |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
441 |
"SetInterval.atLeastLessThan_iff", (*obscure and prolific*) |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
442 |
"SetInterval.greaterThanAtMost_iff", (*obscure and prolific*) |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
443 |
"SetInterval.greaterThanLessThan_iff", (*obscure and prolific*) |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
444 |
"SetInterval.ivl_subset"]; (*excessive case analysis*) |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
445 |
|
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
446 |
|
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
447 |
(*These might be prolific but are probably OK, and min and max are basic. |
21588 | 448 |
"Orderings.max_less_iff_conj", |
19768
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
449 |
"Orderings.min_less_iff_conj", |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
450 |
"Orderings.min_max.below_inf.below_inf_conv", |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
451 |
"Orderings.min_max.below_sup.above_sup_conv", |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
452 |
Very prolific and somewhat obscure: |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
453 |
"Set.InterD", |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
454 |
"Set.UnionI", |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
455 |
*) |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
456 |
|
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
457 |
(*** retrieve lemmas from clasimpset and atpset, may filter them ***) |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
458 |
|
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
459 |
(*Hashing to detect duplicate and variant clauses, e.g. from the [iff] attribute*) |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
460 |
|
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
461 |
exception HASH_CLAUSE and HASH_STRING; |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
462 |
|
20757
fe84fe0dfd30
Definitions produced by packages are now blacklisted.
paulson
parents:
20661
diff
changeset
|
463 |
(*Reject theorems with names like "List.filter.filter_list_def" or |
21690
552d20ff9a95
Removal of theorem tagging, which the ATP linkup no longer requires.
paulson
parents:
21588
diff
changeset
|
464 |
"Accessible_Part.acc.defs", as these are definitions arising from packages.*) |
20757
fe84fe0dfd30
Definitions produced by packages are now blacklisted.
paulson
parents:
20661
diff
changeset
|
465 |
fun is_package_def a = |
21858
05f57309170c
avoid conflict with Alice keywords: renamed pack -> implode, unpack -> explode, any -> many, avoided assert;
wenzelm
parents:
21790
diff
changeset
|
466 |
let val names = NameSpace.explode a |
21690
552d20ff9a95
Removal of theorem tagging, which the ATP linkup no longer requires.
paulson
parents:
21588
diff
changeset
|
467 |
in |
552d20ff9a95
Removal of theorem tagging, which the ATP linkup no longer requires.
paulson
parents:
21588
diff
changeset
|
468 |
length names > 2 andalso |
552d20ff9a95
Removal of theorem tagging, which the ATP linkup no longer requires.
paulson
parents:
21588
diff
changeset
|
469 |
not (hd names = "local") andalso |
552d20ff9a95
Removal of theorem tagging, which the ATP linkup no longer requires.
paulson
parents:
21588
diff
changeset
|
470 |
String.isSuffix "_def" a orelse String.isSuffix "_defs" a |
552d20ff9a95
Removal of theorem tagging, which the ATP linkup no longer requires.
paulson
parents:
21588
diff
changeset
|
471 |
end; |
20757
fe84fe0dfd30
Definitions produced by packages are now blacklisted.
paulson
parents:
20661
diff
changeset
|
472 |
|
21588 | 473 |
fun make_banned_test xs = |
19768
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
474 |
let val ht = Polyhash.mkTable (Polyhash.hash_string, op =) |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
475 |
(6000, HASH_STRING) |
21588 | 476 |
fun banned s = |
21470
7c1b59ddcd56
Consolidation of code to "blacklist" unhelpful theorems, including record
paulson
parents:
21431
diff
changeset
|
477 |
isSome (Polyhash.peek ht s) orelse is_package_def s |
19768
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
478 |
in app (fn x => Polyhash.insert ht (x,())) (!blacklist); |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
479 |
banned |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
480 |
end; |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
481 |
|
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
482 |
(** a hash function from Term.term to int, and also a hash table **) |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
483 |
val xor_words = List.foldl Word.xorb 0w0; |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
484 |
|
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
485 |
fun hashw_term ((Const(c,_)), w) = Polyhash.hashw_string (c,w) |
20661
46832fee1215
Yet another version of fake_thm_name. "Full" hashing ensures that there are no collisions
paulson
parents:
20643
diff
changeset
|
486 |
| hashw_term ((Free(a,_)), w) = Polyhash.hashw_string (a,w) |
19768
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
487 |
| hashw_term ((Var(_,_)), w) = w |
20661
46832fee1215
Yet another version of fake_thm_name. "Full" hashing ensures that there are no collisions
paulson
parents:
20643
diff
changeset
|
488 |
| hashw_term ((Bound i), w) = Polyhash.hashw_int(i,w) |
19768
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
489 |
| hashw_term ((Abs(_,_,t)), w) = hashw_term (t, w) |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
490 |
| hashw_term ((P$Q), w) = hashw_term (Q, (hashw_term (P, w))); |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
491 |
|
21070 | 492 |
fun hash_literal (Const("Not",_)$P) = Word.notb(hashw_term(P,0w0)) |
493 |
| hash_literal P = hashw_term(P,0w0); |
|
19768
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
494 |
|
21470
7c1b59ddcd56
Consolidation of code to "blacklist" unhelpful theorems, including record
paulson
parents:
21431
diff
changeset
|
495 |
fun hash_term t = Word.toIntX (xor_words (map hash_literal (dest_disj t))); |
19768
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
496 |
|
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
497 |
fun equal_thm (thm1,thm2) = Term.aconv(prop_of thm1, prop_of thm2); |
20457
85414caac94a
refinements to conversion into clause form, esp for the HO case
paulson
parents:
20446
diff
changeset
|
498 |
|
19768
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
499 |
(*Create a hash table for clauses, of the given size*) |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
500 |
fun mk_clause_table n = |
20457
85414caac94a
refinements to conversion into clause form, esp for the HO case
paulson
parents:
20446
diff
changeset
|
501 |
Polyhash.mkTable (hash_term o prop_of, equal_thm) |
19768
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
502 |
(n, HASH_CLAUSE); |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
503 |
|
20457
85414caac94a
refinements to conversion into clause form, esp for the HO case
paulson
parents:
20446
diff
changeset
|
504 |
(*Use a hash table to eliminate duplicates from xs. Argument is a list of |
20868
724ab9896068
Improved detection of identical clauses, also in the conjecture
paulson
parents:
20854
diff
changeset
|
505 |
(thm * (string * int)) tuples. The theorems are hashed into the table. *) |
21588 | 506 |
fun make_unique xs = |
20868
724ab9896068
Improved detection of identical clauses, also in the conjecture
paulson
parents:
20854
diff
changeset
|
507 |
let val ht = mk_clause_table 7000 |
20457
85414caac94a
refinements to conversion into clause form, esp for the HO case
paulson
parents:
20446
diff
changeset
|
508 |
in |
21070 | 509 |
Output.debug("make_unique gets " ^ Int.toString (length xs) ^ " clauses"); |
21588 | 510 |
app (ignore o Polyhash.peekInsert ht) xs; |
20868
724ab9896068
Improved detection of identical clauses, also in the conjecture
paulson
parents:
20854
diff
changeset
|
511 |
Polyhash.listItems ht |
20457
85414caac94a
refinements to conversion into clause form, esp for the HO case
paulson
parents:
20446
diff
changeset
|
512 |
end; |
19768
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
513 |
|
20868
724ab9896068
Improved detection of identical clauses, also in the conjecture
paulson
parents:
20854
diff
changeset
|
514 |
(*Remove existing axiom clauses from the conjecture clauses, as this can dramatically |
724ab9896068
Improved detection of identical clauses, also in the conjecture
paulson
parents:
20854
diff
changeset
|
515 |
boost an ATP's performance (for some reason)*) |
21588 | 516 |
fun subtract_cls c_clauses ax_clauses = |
20868
724ab9896068
Improved detection of identical clauses, also in the conjecture
paulson
parents:
20854
diff
changeset
|
517 |
let val ht = mk_clause_table 2200 |
724ab9896068
Improved detection of identical clauses, also in the conjecture
paulson
parents:
20854
diff
changeset
|
518 |
fun known x = isSome (Polyhash.peek ht x) |
724ab9896068
Improved detection of identical clauses, also in the conjecture
paulson
parents:
20854
diff
changeset
|
519 |
in |
21588 | 520 |
app (ignore o Polyhash.peekInsert ht) ax_clauses; |
521 |
filter (not o known) c_clauses |
|
20868
724ab9896068
Improved detection of identical clauses, also in the conjecture
paulson
parents:
20854
diff
changeset
|
522 |
end; |
19768
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
523 |
|
21588 | 524 |
(*Filter axiom clauses, but keep supplied clauses and clauses in whitelist. |
20868
724ab9896068
Improved detection of identical clauses, also in the conjecture
paulson
parents:
20854
diff
changeset
|
525 |
Duplicates are removed later.*) |
20457
85414caac94a
refinements to conversion into clause form, esp for the HO case
paulson
parents:
20446
diff
changeset
|
526 |
fun get_relevant_clauses thy cls_thms white_cls goals = |
20868
724ab9896068
Improved detection of identical clauses, also in the conjecture
paulson
parents:
20854
diff
changeset
|
527 |
white_cls @ (ReduceAxiomsN.relevance_filter thy cls_thms goals); |
20457
85414caac94a
refinements to conversion into clause form, esp for the HO case
paulson
parents:
20446
diff
changeset
|
528 |
|
19768
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
529 |
fun display_thms [] = () |
21588 | 530 |
| display_thms ((name,thm)::nthms) = |
19768
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
531 |
let val nthm = name ^ ": " ^ (string_of_thm thm) |
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
532 |
in Output.debug nthm; display_thms nthms end; |
21588 | 533 |
|
21224 | 534 |
fun all_valid_thms ctxt = |
535 |
PureThy.thms_containing (ProofContext.theory_of ctxt) ([], []) @ |
|
536 |
filter (ProofContext.valid_thms ctxt) |
|
537 |
(FactIndex.find (ProofContext.fact_index_of ctxt) ([], [])); |
|
538 |
||
21588 | 539 |
fun multi_name a (th, (n,pairs)) = |
21224 | 540 |
(n+1, (a ^ "(" ^ Int.toString n ^ ")", th) :: pairs) |
541 |
||
21431
ef9080e7dbbc
Outputs a minimal number of arity clauses. Tidying of blacklist, fixing the blacklisting of thm lists
paulson
parents:
21397
diff
changeset
|
542 |
fun add_multi_names_aux ((a, []), pairs) = pairs |
ef9080e7dbbc
Outputs a minimal number of arity clauses. Tidying of blacklist, fixing the blacklisting of thm lists
paulson
parents:
21397
diff
changeset
|
543 |
| add_multi_names_aux ((a, [th]), pairs) = (a,th)::pairs |
ef9080e7dbbc
Outputs a minimal number of arity clauses. Tidying of blacklist, fixing the blacklisting of thm lists
paulson
parents:
21397
diff
changeset
|
544 |
| add_multi_names_aux ((a, ths), pairs) = #2 (foldl (multi_name a) (1,pairs) ths); |
ef9080e7dbbc
Outputs a minimal number of arity clauses. Tidying of blacklist, fixing the blacklisting of thm lists
paulson
parents:
21397
diff
changeset
|
545 |
|
ef9080e7dbbc
Outputs a minimal number of arity clauses. Tidying of blacklist, fixing the blacklisting of thm lists
paulson
parents:
21397
diff
changeset
|
546 |
val multi_blacklist = |
ef9080e7dbbc
Outputs a minimal number of arity clauses. Tidying of blacklist, fixing the blacklisting of thm lists
paulson
parents:
21397
diff
changeset
|
547 |
["Set.ball_simps", "Set.bex_simps", (*quantifier rewriting: useless*) |
ef9080e7dbbc
Outputs a minimal number of arity clauses. Tidying of blacklist, fixing the blacklisting of thm lists
paulson
parents:
21397
diff
changeset
|
548 |
"Set.disjoint_insert", "Set.insert_disjoint", "Set.Inter_UNIV_conv"]; |
ef9080e7dbbc
Outputs a minimal number of arity clauses. Tidying of blacklist, fixing the blacklisting of thm lists
paulson
parents:
21397
diff
changeset
|
549 |
|
21470
7c1b59ddcd56
Consolidation of code to "blacklist" unhelpful theorems, including record
paulson
parents:
21431
diff
changeset
|
550 |
val multi_base_blacklist = |
7c1b59ddcd56
Consolidation of code to "blacklist" unhelpful theorems, including record
paulson
parents:
21431
diff
changeset
|
551 |
["defs","select_defs","update_defs","induct","inducts","split","splits","split_asm"]; |
7c1b59ddcd56
Consolidation of code to "blacklist" unhelpful theorems, including record
paulson
parents:
21431
diff
changeset
|
552 |
|
21431
ef9080e7dbbc
Outputs a minimal number of arity clauses. Tidying of blacklist, fixing the blacklisting of thm lists
paulson
parents:
21397
diff
changeset
|
553 |
(*Ignore blacklisted theorem lists*) |
21588 | 554 |
fun add_multi_names ((a, ths), pairs) = |
21470
7c1b59ddcd56
Consolidation of code to "blacklist" unhelpful theorems, including record
paulson
parents:
21431
diff
changeset
|
555 |
if a mem_string multi_blacklist orelse (Sign.base_name a) mem_string multi_base_blacklist |
7c1b59ddcd56
Consolidation of code to "blacklist" unhelpful theorems, including record
paulson
parents:
21431
diff
changeset
|
556 |
then pairs |
21431
ef9080e7dbbc
Outputs a minimal number of arity clauses. Tidying of blacklist, fixing the blacklisting of thm lists
paulson
parents:
21397
diff
changeset
|
557 |
else add_multi_names_aux ((a, ths), pairs); |
21224 | 558 |
|
21290
33b6bb5d6ab8
Improvement to classrel clauses: now outputs the minimum needed.
paulson
parents:
21243
diff
changeset
|
559 |
fun is_multi (a, ths) = length ths > 1 orelse String.isSuffix ".axioms" a; |
33b6bb5d6ab8
Improvement to classrel clauses: now outputs the minimum needed.
paulson
parents:
21243
diff
changeset
|
560 |
|
33b6bb5d6ab8
Improvement to classrel clauses: now outputs the minimum needed.
paulson
parents:
21243
diff
changeset
|
561 |
(*The single theorems go BEFORE the multiple ones*) |
21588 | 562 |
fun name_thm_pairs ctxt = |
21290
33b6bb5d6ab8
Improvement to classrel clauses: now outputs the minimum needed.
paulson
parents:
21243
diff
changeset
|
563 |
let val (mults,singles) = List.partition is_multi (all_valid_thms ctxt) |
33b6bb5d6ab8
Improvement to classrel clauses: now outputs the minimum needed.
paulson
parents:
21243
diff
changeset
|
564 |
in foldl add_multi_names (foldl add_multi_names [] mults) singles end; |
21224 | 565 |
|
566 |
fun check_named ("",th) = (warning ("No name for theorem " ^ string_of_thm th); false) |
|
567 |
| check_named (_,th) = true; |
|
19894 | 568 |
|
19768
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
569 |
(* get lemmas from claset, simpset, atpset and extra supplied rules *) |
21588 | 570 |
fun get_clasimp_atp_lemmas ctxt user_thms = |
19894 | 571 |
let val included_thms = |
21588 | 572 |
if !include_all |
573 |
then (tap (fn ths => Output.debug |
|
574 |
("Including all " ^ Int.toString (length ths) ^ " theorems")) |
|
575 |
(name_thm_pairs ctxt)) |
|
576 |
else |
|
577 |
let val claset_thms = |
|
578 |
if !include_claset then ResAxioms.claset_rules_of ctxt |
|
579 |
else [] |
|
580 |
val simpset_thms = |
|
581 |
if !include_simpset then ResAxioms.simpset_rules_of ctxt |
|
582 |
else [] |
|
583 |
val atpset_thms = |
|
584 |
if !include_atpset then ResAxioms.atpset_rules_of ctxt |
|
585 |
else [] |
|
586 |
val _ = if !Output.show_debug_msgs |
|
587 |
then (Output.debug "ATP theorems: "; display_thms atpset_thms) |
|
588 |
else () |
|
589 |
in claset_thms @ simpset_thms @ atpset_thms end |
|
590 |
val user_rules = filter check_named |
|
21224 | 591 |
(map (ResAxioms.pairname) |
21588 | 592 |
(if null user_thms then !whitelist else user_thms)) |
19894 | 593 |
in |
21224 | 594 |
(filter check_named included_thms, user_rules) |
19894 | 595 |
end; |
19768
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
596 |
|
20457
85414caac94a
refinements to conversion into clause form, esp for the HO case
paulson
parents:
20446
diff
changeset
|
597 |
(*Remove lemmas that are banned from the backlist. Also remove duplicates. *) |
21588 | 598 |
fun blacklist_filter ths = |
599 |
if !run_blacklist_filter then |
|
21690
552d20ff9a95
Removal of theorem tagging, which the ATP linkup no longer requires.
paulson
parents:
21588
diff
changeset
|
600 |
let val banned = make_banned_test (map #1 ths) |
21588 | 601 |
fun ok (a,_) = not (banned a) |
21690
552d20ff9a95
Removal of theorem tagging, which the ATP linkup no longer requires.
paulson
parents:
21588
diff
changeset
|
602 |
val (good,bad) = List.partition ok ths |
552d20ff9a95
Removal of theorem tagging, which the ATP linkup no longer requires.
paulson
parents:
21588
diff
changeset
|
603 |
in if !Output.show_debug_msgs then |
552d20ff9a95
Removal of theorem tagging, which the ATP linkup no longer requires.
paulson
parents:
21588
diff
changeset
|
604 |
(Output.debug("blacklist filter gets " ^ Int.toString (length ths) ^ " theorems"); |
552d20ff9a95
Removal of theorem tagging, which the ATP linkup no longer requires.
paulson
parents:
21588
diff
changeset
|
605 |
Output.debug("filtered: " ^ space_implode ", " (map #1 bad)); |
552d20ff9a95
Removal of theorem tagging, which the ATP linkup no longer requires.
paulson
parents:
21588
diff
changeset
|
606 |
Output.debug("...and returns " ^ Int.toString (length good))) |
552d20ff9a95
Removal of theorem tagging, which the ATP linkup no longer requires.
paulson
parents:
21588
diff
changeset
|
607 |
else (); |
552d20ff9a95
Removal of theorem tagging, which the ATP linkup no longer requires.
paulson
parents:
21588
diff
changeset
|
608 |
good |
552d20ff9a95
Removal of theorem tagging, which the ATP linkup no longer requires.
paulson
parents:
21588
diff
changeset
|
609 |
end |
21431
ef9080e7dbbc
Outputs a minimal number of arity clauses. Tidying of blacklist, fixing the blacklisting of thm lists
paulson
parents:
21397
diff
changeset
|
610 |
else ths; |
19768
9afd9b9c47d0
ATP/res_clasimpset.ML has been merged into res_atp.ML.
mengj
parents:
19746
diff
changeset
|
611 |
|
21290
33b6bb5d6ab8
Improvement to classrel clauses: now outputs the minimum needed.
paulson
parents:
21243
diff
changeset
|
612 |
(***************************************************************) |
33b6bb5d6ab8
Improvement to classrel clauses: now outputs the minimum needed.
paulson
parents:
21243
diff
changeset
|
613 |
(* Type Classes Present in the Axiom or Conjecture Clauses *) |
33b6bb5d6ab8
Improvement to classrel clauses: now outputs the minimum needed.
paulson
parents:
21243
diff
changeset
|
614 |
(***************************************************************) |
33b6bb5d6ab8
Improvement to classrel clauses: now outputs the minimum needed.
paulson
parents:
21243
diff
changeset
|
615 |
|
33b6bb5d6ab8
Improvement to classrel clauses: now outputs the minimum needed.
paulson
parents:
21243
diff
changeset
|
616 |
fun setinsert (x,s) = Symtab.update (x,()) s; |
33b6bb5d6ab8
Improvement to classrel clauses: now outputs the minimum needed.
paulson
parents:
21243
diff
changeset
|
617 |
|
33b6bb5d6ab8
Improvement to classrel clauses: now outputs the minimum needed.
paulson
parents:
21243
diff
changeset
|
618 |
fun add_classes (sorts, cset) = foldl setinsert cset (List.concat sorts); |
33b6bb5d6ab8
Improvement to classrel clauses: now outputs the minimum needed.
paulson
parents:
21243
diff
changeset
|
619 |
|
33b6bb5d6ab8
Improvement to classrel clauses: now outputs the minimum needed.
paulson
parents:
21243
diff
changeset
|
620 |
(*Remove this trivial type class*) |
33b6bb5d6ab8
Improvement to classrel clauses: now outputs the minimum needed.
paulson
parents:
21243
diff
changeset
|
621 |
fun delete_type cset = Symtab.delete_safe "HOL.type" cset; |
33b6bb5d6ab8
Improvement to classrel clauses: now outputs the minimum needed.
paulson
parents:
21243
diff
changeset
|
622 |
|
33b6bb5d6ab8
Improvement to classrel clauses: now outputs the minimum needed.
paulson
parents:
21243
diff
changeset
|
623 |
fun tvar_classes_of_terms ts = |
33b6bb5d6ab8
Improvement to classrel clauses: now outputs the minimum needed.
paulson
parents:
21243
diff
changeset
|
624 |
let val sorts_list = map (map #2 o term_tvars) ts |
33b6bb5d6ab8
Improvement to classrel clauses: now outputs the minimum needed.
paulson
parents:
21243
diff
changeset
|
625 |
in Symtab.keys (delete_type (foldl add_classes Symtab.empty sorts_list)) end; |
33b6bb5d6ab8
Improvement to classrel clauses: now outputs the minimum needed.
paulson
parents:
21243
diff
changeset
|
626 |
|
33b6bb5d6ab8
Improvement to classrel clauses: now outputs the minimum needed.
paulson
parents:
21243
diff
changeset
|
627 |
fun tfree_classes_of_terms ts = |
33b6bb5d6ab8
Improvement to classrel clauses: now outputs the minimum needed.
paulson
parents:
21243
diff
changeset
|
628 |
let val sorts_list = map (map #2 o term_tfrees) ts |
33b6bb5d6ab8
Improvement to classrel clauses: now outputs the minimum needed.
paulson
parents:
21243
diff
changeset
|
629 |
in Symtab.keys (delete_type (foldl add_classes Symtab.empty sorts_list)) end; |
20526
756c4f1fd04c
Extended the blacklist with higher-order theorems. Restructured. Added checks to
paulson
parents:
20457
diff
changeset
|
630 |
|
21373
18f519614978
Arity clauses are now produced only for types and type classes actually used.
paulson
parents:
21311
diff
changeset
|
631 |
(*fold type constructors*) |
18f519614978
Arity clauses are now produced only for types and type classes actually used.
paulson
parents:
21311
diff
changeset
|
632 |
fun fold_type_consts f (Type (a, Ts)) x = fold (fold_type_consts f) Ts (f (a,x)) |
18f519614978
Arity clauses are now produced only for types and type classes actually used.
paulson
parents:
21311
diff
changeset
|
633 |
| fold_type_consts f T x = x; |
18f519614978
Arity clauses are now produced only for types and type classes actually used.
paulson
parents:
21311
diff
changeset
|
634 |
|
18f519614978
Arity clauses are now produced only for types and type classes actually used.
paulson
parents:
21311
diff
changeset
|
635 |
val add_type_consts_in_type = fold_type_consts setinsert; |
18f519614978
Arity clauses are now produced only for types and type classes actually used.
paulson
parents:
21311
diff
changeset
|
636 |
|
21397
2134b81a0b37
Now includes only types used to instantiate overloaded constants in arity clauses
paulson
parents:
21373
diff
changeset
|
637 |
(*Type constructors used to instantiate overloaded constants are the only ones needed.*) |
2134b81a0b37
Now includes only types used to instantiate overloaded constants in arity clauses
paulson
parents:
21373
diff
changeset
|
638 |
fun add_type_consts_in_term thy = |
2134b81a0b37
Now includes only types used to instantiate overloaded constants in arity clauses
paulson
parents:
21373
diff
changeset
|
639 |
let val const_typargs = Sign.const_typargs thy |
2134b81a0b37
Now includes only types used to instantiate overloaded constants in arity clauses
paulson
parents:
21373
diff
changeset
|
640 |
fun add_tcs (Const cT) x = fold add_type_consts_in_type (const_typargs cT) x |
2134b81a0b37
Now includes only types used to instantiate overloaded constants in arity clauses
paulson
parents:
21373
diff
changeset
|
641 |
| add_tcs (Abs (_, T, u)) x = add_tcs u x |
2134b81a0b37
Now includes only types used to instantiate overloaded constants in arity clauses
paulson
parents:
21373
diff
changeset
|
642 |
| add_tcs (t $ u) x = add_tcs t (add_tcs u x) |
2134b81a0b37
Now includes only types used to instantiate overloaded constants in arity clauses
paulson
parents:
21373
diff
changeset
|
643 |
| add_tcs _ x = x |
2134b81a0b37
Now includes only types used to instantiate overloaded constants in arity clauses
paulson
parents:
21373
diff
changeset
|
644 |
in add_tcs end |
21373
18f519614978
Arity clauses are now produced only for types and type classes actually used.
paulson
parents:
21311
diff
changeset
|
645 |
|
21397
2134b81a0b37
Now includes only types used to instantiate overloaded constants in arity clauses
paulson
parents:
21373
diff
changeset
|
646 |
fun type_consts_of_terms thy ts = |
2134b81a0b37
Now includes only types used to instantiate overloaded constants in arity clauses
paulson
parents:
21373
diff
changeset
|
647 |
Symtab.keys (fold (add_type_consts_in_term thy) ts Symtab.empty); |
21373
18f519614978
Arity clauses are now produced only for types and type classes actually used.
paulson
parents:
21311
diff
changeset
|
648 |
|
18f519614978
Arity clauses are now produced only for types and type classes actually used.
paulson
parents:
21311
diff
changeset
|
649 |
|
19194 | 650 |
(***************************************************************) |
651 |
(* ATP invocation methods setup *) |
|
652 |
(***************************************************************) |
|
653 |
||
21588 | 654 |
fun cnf_hyps_thms ctxt = |
20224
9c40a144ee0e
moved basic assumption operations from structure ProofContext to Assumption;
wenzelm
parents:
20131
diff
changeset
|
655 |
let val ths = Assumption.prems_of ctxt |
19617 | 656 |
in fold (fold (insert Thm.eq_thm) o ResAxioms.skolem_thm) ths [] end; |
19194 | 657 |
|
20526
756c4f1fd04c
Extended the blacklist with higher-order theorems. Restructured. Added checks to
paulson
parents:
20457
diff
changeset
|
658 |
(*Translation mode can be auto-detected, or forced to be first-order or higher-order*) |
19194 | 659 |
datatype mode = Auto | Fol | Hol; |
660 |
||
19450
651d949776f8
exported linkup_logic_mode and changed the default setting
paulson
parents:
19445
diff
changeset
|
661 |
val linkup_logic_mode = ref Auto; |
19205
4ec788c69f82
Tidying. New invoke_atp_ml for top-level debugging. Flag to force FOL mode.
paulson
parents:
19194
diff
changeset
|
662 |
|
20526
756c4f1fd04c
Extended the blacklist with higher-order theorems. Restructured. Added checks to
paulson
parents:
20457
diff
changeset
|
663 |
(*Ensures that no higher-order theorems "leak out"*) |
756c4f1fd04c
Extended the blacklist with higher-order theorems. Restructured. Added checks to
paulson
parents:
20457
diff
changeset
|
664 |
fun restrict_to_logic logic cls = |
21588 | 665 |
if is_fol_logic logic then filter (Meson.is_fol_term o prop_of o fst) cls |
666 |
else cls; |
|
20526
756c4f1fd04c
Extended the blacklist with higher-order theorems. Restructured. Added checks to
paulson
parents:
20457
diff
changeset
|
667 |
|
21470
7c1b59ddcd56
Consolidation of code to "blacklist" unhelpful theorems, including record
paulson
parents:
21431
diff
changeset
|
668 |
(**** Predicates to detect unwanted clauses (prolific or likely to cause unsoundness) ****) |
7c1b59ddcd56
Consolidation of code to "blacklist" unhelpful theorems, including record
paulson
parents:
21431
diff
changeset
|
669 |
|
7c1b59ddcd56
Consolidation of code to "blacklist" unhelpful theorems, including record
paulson
parents:
21431
diff
changeset
|
670 |
(** Too general means, positive equality literal with a variable X as one operand, |
7c1b59ddcd56
Consolidation of code to "blacklist" unhelpful theorems, including record
paulson
parents:
21431
diff
changeset
|
671 |
when X does not occur properly in the other operand. This rules out clearly |
7c1b59ddcd56
Consolidation of code to "blacklist" unhelpful theorems, including record
paulson
parents:
21431
diff
changeset
|
672 |
inconsistent clauses such as V=a|V=b, though it by no means guarantees soundness. **) |
21588 | 673 |
|
21470
7c1b59ddcd56
Consolidation of code to "blacklist" unhelpful theorems, including record
paulson
parents:
21431
diff
changeset
|
674 |
fun occurs ix = |
7c1b59ddcd56
Consolidation of code to "blacklist" unhelpful theorems, including record
paulson
parents:
21431
diff
changeset
|
675 |
let fun occ(Var (jx,_)) = (ix=jx) |
7c1b59ddcd56
Consolidation of code to "blacklist" unhelpful theorems, including record
paulson
parents:
21431
diff
changeset
|
676 |
| occ(t1$t2) = occ t1 orelse occ t2 |
7c1b59ddcd56
Consolidation of code to "blacklist" unhelpful theorems, including record
paulson
parents:
21431
diff
changeset
|
677 |
| occ(Abs(_,_,t)) = occ t |
7c1b59ddcd56
Consolidation of code to "blacklist" unhelpful theorems, including record
paulson
parents:
21431
diff
changeset
|
678 |
| occ _ = false |
7c1b59ddcd56
Consolidation of code to "blacklist" unhelpful theorems, including record
paulson
parents:
21431
diff
changeset
|
679 |
in occ end; |
7c1b59ddcd56
Consolidation of code to "blacklist" unhelpful theorems, including record
paulson
parents:
21431
diff
changeset
|
680 |
|
7c1b59ddcd56
Consolidation of code to "blacklist" unhelpful theorems, including record
paulson
parents:
21431
diff
changeset
|
681 |
fun is_recordtype T = not (null (RecordPackage.dest_recTs T)); |
7c1b59ddcd56
Consolidation of code to "blacklist" unhelpful theorems, including record
paulson
parents:
21431
diff
changeset
|
682 |
|
7c1b59ddcd56
Consolidation of code to "blacklist" unhelpful theorems, including record
paulson
parents:
21431
diff
changeset
|
683 |
(*Unwanted equalities include |
7c1b59ddcd56
Consolidation of code to "blacklist" unhelpful theorems, including record
paulson
parents:
21431
diff
changeset
|
684 |
(1) those between a variable that does not properly occur in the second operand, |
7c1b59ddcd56
Consolidation of code to "blacklist" unhelpful theorems, including record
paulson
parents:
21431
diff
changeset
|
685 |
(2) those between a variable and a record, since these seem to be prolific "cases" thms |
21588 | 686 |
*) |
21470
7c1b59ddcd56
Consolidation of code to "blacklist" unhelpful theorems, including record
paulson
parents:
21431
diff
changeset
|
687 |
fun too_general_eqterms (Var (ix,T), t) = not (occurs ix t) orelse is_recordtype T |
7c1b59ddcd56
Consolidation of code to "blacklist" unhelpful theorems, including record
paulson
parents:
21431
diff
changeset
|
688 |
| too_general_eqterms _ = false; |
7c1b59ddcd56
Consolidation of code to "blacklist" unhelpful theorems, including record
paulson
parents:
21431
diff
changeset
|
689 |
|
7c1b59ddcd56
Consolidation of code to "blacklist" unhelpful theorems, including record
paulson
parents:
21431
diff
changeset
|
690 |
fun too_general_equality (Const ("op =", _) $ x $ y) = |
7c1b59ddcd56
Consolidation of code to "blacklist" unhelpful theorems, including record
paulson
parents:
21431
diff
changeset
|
691 |
too_general_eqterms (x,y) orelse too_general_eqterms(y,x) |
7c1b59ddcd56
Consolidation of code to "blacklist" unhelpful theorems, including record
paulson
parents:
21431
diff
changeset
|
692 |
| too_general_equality _ = false; |
7c1b59ddcd56
Consolidation of code to "blacklist" unhelpful theorems, including record
paulson
parents:
21431
diff
changeset
|
693 |
|
7c1b59ddcd56
Consolidation of code to "blacklist" unhelpful theorems, including record
paulson
parents:
21431
diff
changeset
|
694 |
(* tautologous? *) |
7c1b59ddcd56
Consolidation of code to "blacklist" unhelpful theorems, including record
paulson
parents:
21431
diff
changeset
|
695 |
fun is_taut (Const ("Trueprop", _) $ Const ("True", _)) = true |
7c1b59ddcd56
Consolidation of code to "blacklist" unhelpful theorems, including record
paulson
parents:
21431
diff
changeset
|
696 |
| is_taut _ = false; |
7c1b59ddcd56
Consolidation of code to "blacklist" unhelpful theorems, including record
paulson
parents:
21431
diff
changeset
|
697 |
|
21431
ef9080e7dbbc
Outputs a minimal number of arity clauses. Tidying of blacklist, fixing the blacklisting of thm lists
paulson
parents:
21397
diff
changeset
|
698 |
(*True if the term contains a variable whose (atomic) type is in the given list.*) |
21588 | 699 |
fun has_typed_var tycons = |
21431
ef9080e7dbbc
Outputs a minimal number of arity clauses. Tidying of blacklist, fixing the blacklisting of thm lists
paulson
parents:
21397
diff
changeset
|
700 |
let fun var_tycon (Var (_, Type(a,_))) = a mem_string tycons |
ef9080e7dbbc
Outputs a minimal number of arity clauses. Tidying of blacklist, fixing the blacklisting of thm lists
paulson
parents:
21397
diff
changeset
|
701 |
| var_tycon _ = false |
ef9080e7dbbc
Outputs a minimal number of arity clauses. Tidying of blacklist, fixing the blacklisting of thm lists
paulson
parents:
21397
diff
changeset
|
702 |
in exists var_tycon o term_vars end; |
ef9080e7dbbc
Outputs a minimal number of arity clauses. Tidying of blacklist, fixing the blacklisting of thm lists
paulson
parents:
21397
diff
changeset
|
703 |
|
21470
7c1b59ddcd56
Consolidation of code to "blacklist" unhelpful theorems, including record
paulson
parents:
21431
diff
changeset
|
704 |
fun unwanted t = |
7c1b59ddcd56
Consolidation of code to "blacklist" unhelpful theorems, including record
paulson
parents:
21431
diff
changeset
|
705 |
is_taut t orelse has_typed_var ["Product_Type.unit","bool"] t orelse |
7c1b59ddcd56
Consolidation of code to "blacklist" unhelpful theorems, including record
paulson
parents:
21431
diff
changeset
|
706 |
forall too_general_equality (dest_disj t); |
7c1b59ddcd56
Consolidation of code to "blacklist" unhelpful theorems, including record
paulson
parents:
21431
diff
changeset
|
707 |
|
21431
ef9080e7dbbc
Outputs a minimal number of arity clauses. Tidying of blacklist, fixing the blacklisting of thm lists
paulson
parents:
21397
diff
changeset
|
708 |
(*Clauses containing variables of type "unit" or "bool" are unlikely to be useful and |
ef9080e7dbbc
Outputs a minimal number of arity clauses. Tidying of blacklist, fixing the blacklisting of thm lists
paulson
parents:
21397
diff
changeset
|
709 |
likely to lead to unsound proofs.*) |
21470
7c1b59ddcd56
Consolidation of code to "blacklist" unhelpful theorems, including record
paulson
parents:
21431
diff
changeset
|
710 |
fun remove_unwanted_clauses cls = |
7c1b59ddcd56
Consolidation of code to "blacklist" unhelpful theorems, including record
paulson
parents:
21431
diff
changeset
|
711 |
filter (not o unwanted o prop_of o fst) cls; |
21431
ef9080e7dbbc
Outputs a minimal number of arity clauses. Tidying of blacklist, fixing the blacklisting of thm lists
paulson
parents:
21397
diff
changeset
|
712 |
|
20131
c89ee2f4efd5
Pass user lemmas' names to ResHolClause.tptp_write_file and dfg_write_file.
mengj
parents:
20022
diff
changeset
|
713 |
fun tptp_writer logic goals filename (axioms,classrels,arities) user_lemmas = |
21588 | 714 |
if is_fol_logic logic |
19445
da75577642a9
tidying; ATP options including CASC mode for Vampire
paulson
parents:
19442
diff
changeset
|
715 |
then ResClause.tptp_write_file goals filename (axioms, classrels, arities) |
20131
c89ee2f4efd5
Pass user lemmas' names to ResHolClause.tptp_write_file and dfg_write_file.
mengj
parents:
20022
diff
changeset
|
716 |
else ResHolClause.tptp_write_file goals filename (axioms, classrels, arities) user_lemmas; |
19445
da75577642a9
tidying; ATP options including CASC mode for Vampire
paulson
parents:
19442
diff
changeset
|
717 |
|
20131
c89ee2f4efd5
Pass user lemmas' names to ResHolClause.tptp_write_file and dfg_write_file.
mengj
parents:
20022
diff
changeset
|
718 |
fun dfg_writer logic goals filename (axioms,classrels,arities) user_lemmas = |
21588 | 719 |
if is_fol_logic logic |
19445
da75577642a9
tidying; ATP options including CASC mode for Vampire
paulson
parents:
19442
diff
changeset
|
720 |
then ResClause.dfg_write_file goals filename (axioms, classrels, arities) |
20131
c89ee2f4efd5
Pass user lemmas' names to ResHolClause.tptp_write_file and dfg_write_file.
mengj
parents:
20022
diff
changeset
|
721 |
else ResHolClause.dfg_write_file goals filename (axioms, classrels, arities) user_lemmas; |
19194 | 722 |
|
20022 | 723 |
(*Called by the oracle-based methods declared in res_atp_methods.ML*) |
19722 | 724 |
fun write_subgoal_file dfg mode ctxt conjectures user_thms n = |
21588 | 725 |
let val conj_cls = make_clauses conjectures |
20444 | 726 |
|> ResAxioms.assume_abstract_list |> Meson.finish_cnf |
21588 | 727 |
val hyp_cls = cnf_hyps_thms ctxt |
728 |
val goal_cls = conj_cls@hyp_cls |
|
729 |
val goal_tms = map prop_of goal_cls |
|
730 |
val logic = case mode of |
|
21431
ef9080e7dbbc
Outputs a minimal number of arity clauses. Tidying of blacklist, fixing the blacklisting of thm lists
paulson
parents:
21397
diff
changeset
|
731 |
Auto => problem_logic_goals [goal_tms] |
21588 | 732 |
| Fol => FOL |
733 |
| Hol => HOL |
|
734 |
val (included_thms,user_rules) = get_clasimp_atp_lemmas ctxt user_thms |
|
735 |
val cla_simp_atp_clauses = included_thms |> blacklist_filter |
|
736 |
|> ResAxioms.cnf_rules_pairs |> make_unique |
|
737 |
|> restrict_to_logic logic |
|
21470
7c1b59ddcd56
Consolidation of code to "blacklist" unhelpful theorems, including record
paulson
parents:
21431
diff
changeset
|
738 |
|> remove_unwanted_clauses |
21588 | 739 |
val user_cls = ResAxioms.cnf_rules_pairs user_rules |
740 |
val thy = ProofContext.theory_of ctxt |
|
741 |
val axclauses = make_unique (get_relevant_clauses thy cla_simp_atp_clauses user_cls goal_tms) |
|
21431
ef9080e7dbbc
Outputs a minimal number of arity clauses. Tidying of blacklist, fixing the blacklisting of thm lists
paulson
parents:
21397
diff
changeset
|
742 |
val subs = tfree_classes_of_terms goal_tms |
21373
18f519614978
Arity clauses are now produced only for types and type classes actually used.
paulson
parents:
21311
diff
changeset
|
743 |
and axtms = map (prop_of o #1) axclauses |
18f519614978
Arity clauses are now produced only for types and type classes actually used.
paulson
parents:
21311
diff
changeset
|
744 |
val supers = tvar_classes_of_terms axtms |
21431
ef9080e7dbbc
Outputs a minimal number of arity clauses. Tidying of blacklist, fixing the blacklisting of thm lists
paulson
parents:
21397
diff
changeset
|
745 |
and tycons = type_consts_of_terms thy (goal_tms@axtms) |
21290
33b6bb5d6ab8
Improvement to classrel clauses: now outputs the minimum needed.
paulson
parents:
21243
diff
changeset
|
746 |
(*TFrees in conjecture clauses; TVars in axiom clauses*) |
21790
9d2761d09d91
Removal of the "keep_types" flag: we always keep types!
paulson
parents:
21690
diff
changeset
|
747 |
val classrel_clauses = ResClause.make_classrel_clauses thy subs supers |
9d2761d09d91
Removal of the "keep_types" flag: we always keep types!
paulson
parents:
21690
diff
changeset
|
748 |
val arity_clauses = ResClause.arity_clause_thy thy tycons supers |
21588 | 749 |
val writer = if dfg then dfg_writer else tptp_writer |
750 |
and file = atp_input_file() |
|
751 |
and user_lemmas_names = map #1 user_rules |
|
19194 | 752 |
in |
21588 | 753 |
writer logic goal_cls file (axclauses,classrel_clauses,arity_clauses) user_lemmas_names; |
754 |
Output.debug ("Writing to " ^ file); |
|
755 |
file |
|
19194 | 756 |
end; |
757 |
||
758 |
||
759 |
(**** remove tmp files ****) |
|
21588 | 760 |
fun cond_rm_tmp file = |
761 |
if !Output.show_debug_msgs orelse !destdir <> "" then Output.debug "ATP input kept..." |
|
20870 | 762 |
else OS.FileSys.remove file; |
19194 | 763 |
|
764 |
||
765 |
(****** setup ATPs as Isabelle methods ******) |
|
766 |
||
21588 | 767 |
fun atp_meth tac ths ctxt = |
19194 | 768 |
let val thy = ProofContext.theory_of ctxt |
21588 | 769 |
val _ = ResClause.init thy |
770 |
val _ = ResHolClause.init thy |
|
771 |
in Method.SIMPLE_METHOD' (tac ctxt ths) end; |
|
19194 | 772 |
|
773 |
fun atp_method tac = Method.thms_ctxt_args (atp_meth tac); |
|
774 |
||
775 |
(***************************************************************) |
|
776 |
(* automatic ATP invocation *) |
|
777 |
(***************************************************************) |
|
778 |
||
17306 | 779 |
(* call prover with settings and problem file for the current subgoal *) |
17764 | 780 |
fun watcher_call_provers sign sg_terms (childin, childout, pid) = |
16802
6eeee59dac4c
use Toplevel.print_state_hook instead of adhoc Proof.atp_hook;
wenzelm
parents:
16767
diff
changeset
|
781 |
let |
17422 | 782 |
fun make_atp_list [] n = [] |
17717 | 783 |
| make_atp_list (sg_term::xs) n = |
16802
6eeee59dac4c
use Toplevel.print_state_hook instead of adhoc Proof.atp_hook;
wenzelm
parents:
16767
diff
changeset
|
784 |
let |
17717 | 785 |
val probfile = prob_pathname n |
17690
8ba7c3cd24a8
time limit option; fixed bug concerning first line of ATP output
paulson
parents:
17525
diff
changeset
|
786 |
val time = Int.toString (!time_limit) |
16802
6eeee59dac4c
use Toplevel.print_state_hook instead of adhoc Proof.atp_hook;
wenzelm
parents:
16767
diff
changeset
|
787 |
in |
18680 | 788 |
Output.debug ("problem file in watcher_call_provers is " ^ probfile); |
17764 | 789 |
(*options are separated by Watcher.setting_sep, currently #"%"*) |
17306 | 790 |
if !prover = "spass" |
16802
6eeee59dac4c
use Toplevel.print_state_hook instead of adhoc Proof.atp_hook;
wenzelm
parents:
16767
diff
changeset
|
791 |
then |
19445
da75577642a9
tidying; ATP options including CASC mode for Vampire
paulson
parents:
19442
diff
changeset
|
792 |
let val spass = helper_path "SPASS_HOME" "SPASS" |
da75577642a9
tidying; ATP options including CASC mode for Vampire
paulson
parents:
19442
diff
changeset
|
793 |
val sopts = |
da75577642a9
tidying; ATP options including CASC mode for Vampire
paulson
parents:
19442
diff
changeset
|
794 |
"-Auto%-SOS=1%-PGiven=0%-PProblem=0%-Splits=0%-FullRed=0%-DocProof%-TimeLimit=" ^ time |
21588 | 795 |
in |
19445
da75577642a9
tidying; ATP options including CASC mode for Vampire
paulson
parents:
19442
diff
changeset
|
796 |
("spass", spass, sopts, probfile) :: make_atp_list xs (n+1) |
16802
6eeee59dac4c
use Toplevel.print_state_hook instead of adhoc Proof.atp_hook;
wenzelm
parents:
16767
diff
changeset
|
797 |
end |
17306 | 798 |
else if !prover = "vampire" |
21588 | 799 |
then |
17819 | 800 |
let val vampire = helper_path "VAMPIRE_HOME" "vampire" |
21132 | 801 |
val vopts = "--mode casc%-t " ^ time (*what about -m 100000?*) |
16802
6eeee59dac4c
use Toplevel.print_state_hook instead of adhoc Proof.atp_hook;
wenzelm
parents:
16767
diff
changeset
|
802 |
in |
19445
da75577642a9
tidying; ATP options including CASC mode for Vampire
paulson
parents:
19442
diff
changeset
|
803 |
("vampire", vampire, vopts, probfile) :: make_atp_list xs (n+1) |
16802
6eeee59dac4c
use Toplevel.print_state_hook instead of adhoc Proof.atp_hook;
wenzelm
parents:
16767
diff
changeset
|
804 |
end |
21588 | 805 |
else if !prover = "E" |
806 |
then |
|
807 |
let val Eprover = helper_path "E_HOME" "eproof" |
|
808 |
in |
|
809 |
("E", Eprover, |
|
810 |
"--tstp-in%-l5%-xAutoDev%-tAutoDev%--silent%--cpu-limit=" ^ time, probfile) :: |
|
811 |
make_atp_list xs (n+1) |
|
812 |
end |
|
813 |
else error ("Invalid prover name: " ^ !prover) |
|
16802
6eeee59dac4c
use Toplevel.print_state_hook instead of adhoc Proof.atp_hook;
wenzelm
parents:
16767
diff
changeset
|
814 |
end |
15452 | 815 |
|
17422 | 816 |
val atp_list = make_atp_list sg_terms 1 |
16802
6eeee59dac4c
use Toplevel.print_state_hook instead of adhoc Proof.atp_hook;
wenzelm
parents:
16767
diff
changeset
|
817 |
in |
6eeee59dac4c
use Toplevel.print_state_hook instead of adhoc Proof.atp_hook;
wenzelm
parents:
16767
diff
changeset
|
818 |
Watcher.callResProvers(childout,atp_list); |
18680 | 819 |
Output.debug "Sent commands to watcher!" |
16802
6eeee59dac4c
use Toplevel.print_state_hook instead of adhoc Proof.atp_hook;
wenzelm
parents:
16767
diff
changeset
|
820 |
end |
21588 | 821 |
|
21888 | 822 |
fun trace_vector fname = |
21858
05f57309170c
avoid conflict with Alice keywords: renamed pack -> implode, unpack -> explode, any -> many, avoided assert;
wenzelm
parents:
21790
diff
changeset
|
823 |
let val path = File.explode_platform_path fname |
21888 | 824 |
in Vector.app (File.append path o (fn s => s ^ "\n")) end; |
16357 | 825 |
|
20457
85414caac94a
refinements to conversion into clause form, esp for the HO case
paulson
parents:
20446
diff
changeset
|
826 |
(*Converting a subgoal into negated conjecture clauses*) |
85414caac94a
refinements to conversion into clause form, esp for the HO case
paulson
parents:
20446
diff
changeset
|
827 |
fun neg_clauses th n = |
85414caac94a
refinements to conversion into clause form, esp for the HO case
paulson
parents:
20446
diff
changeset
|
828 |
let val tacs = [rtac ccontr, ObjectLogic.atomize_tac, skolemize_tac] |
85414caac94a
refinements to conversion into clause form, esp for the HO case
paulson
parents:
20446
diff
changeset
|
829 |
val st = Seq.hd (EVERY' tacs n th) |
85414caac94a
refinements to conversion into clause form, esp for the HO case
paulson
parents:
20446
diff
changeset
|
830 |
val negs = Option.valOf (metahyps_thms n st) |
85414caac94a
refinements to conversion into clause form, esp for the HO case
paulson
parents:
20446
diff
changeset
|
831 |
in make_clauses negs |> ResAxioms.assume_abstract_list |> Meson.finish_cnf end; |
21588 | 832 |
|
20022 | 833 |
(*We write out problem files for each subgoal. Argument probfile generates filenames, |
18986 | 834 |
and allows the suppression of the suffix "_1" in problem-generation mode. |
835 |
FIXME: does not cope with &&, and it isn't easy because one could have multiple |
|
836 |
subgoals, each involving &&.*) |
|
20022 | 837 |
fun write_problem_files probfile (ctxt,th) = |
18753
aa82bd41555d
ResClasimp.get_clasimp_lemmas now takes all subgoals rather than only the first
paulson
parents:
18700
diff
changeset
|
838 |
let val goals = Thm.prems_of th |
19194 | 839 |
val _ = Output.debug ("number of subgoals = " ^ Int.toString (length goals)) |
17717 | 840 |
val thy = ProofContext.theory_of ctxt |
20457
85414caac94a
refinements to conversion into clause form, esp for the HO case
paulson
parents:
20446
diff
changeset
|
841 |
fun get_neg_subgoals [] _ = [] |
20526
756c4f1fd04c
Extended the blacklist with higher-order theorems. Restructured. Added checks to
paulson
parents:
20457
diff
changeset
|
842 |
| get_neg_subgoals (gl::gls) n = neg_clauses th n :: get_neg_subgoals gls (n+1) |
756c4f1fd04c
Extended the blacklist with higher-order theorems. Restructured. Added checks to
paulson
parents:
20457
diff
changeset
|
843 |
val goal_cls = get_neg_subgoals goals 1 |
20457
85414caac94a
refinements to conversion into clause form, esp for the HO case
paulson
parents:
20446
diff
changeset
|
844 |
val logic = case !linkup_logic_mode of |
21588 | 845 |
Auto => problem_logic_goals (map ((map prop_of)) goal_cls) |
846 |
| Fol => FOL |
|
847 |
| Hol => HOL |
|
20526
756c4f1fd04c
Extended the blacklist with higher-order theorems. Restructured. Added checks to
paulson
parents:
20457
diff
changeset
|
848 |
val (included_thms,white_thms) = get_clasimp_atp_lemmas ctxt [] |
756c4f1fd04c
Extended the blacklist with higher-order theorems. Restructured. Added checks to
paulson
parents:
20457
diff
changeset
|
849 |
val included_cls = included_thms |> blacklist_filter |
21588 | 850 |
|> ResAxioms.cnf_rules_pairs |> make_unique |
21431
ef9080e7dbbc
Outputs a minimal number of arity clauses. Tidying of blacklist, fixing the blacklisting of thm lists
paulson
parents:
21397
diff
changeset
|
851 |
|> restrict_to_logic logic |
21470
7c1b59ddcd56
Consolidation of code to "blacklist" unhelpful theorems, including record
paulson
parents:
21431
diff
changeset
|
852 |
|> remove_unwanted_clauses |
21690
552d20ff9a95
Removal of theorem tagging, which the ATP linkup no longer requires.
paulson
parents:
21588
diff
changeset
|
853 |
val _ = Output.debug ("included clauses = " ^ Int.toString(length included_cls)) |
20526
756c4f1fd04c
Extended the blacklist with higher-order theorems. Restructured. Added checks to
paulson
parents:
20457
diff
changeset
|
854 |
val white_cls = ResAxioms.cnf_rules_pairs white_thms |
756c4f1fd04c
Extended the blacklist with higher-order theorems. Restructured. Added checks to
paulson
parents:
20457
diff
changeset
|
855 |
(*clauses relevant to goal gl*) |
21563
b4718f2c15f0
Goals in clause form are sent to the relevance filter.
mengj
parents:
21509
diff
changeset
|
856 |
val axcls_list = map (fn ngcls => get_relevant_clauses thy included_cls white_cls (map prop_of ngcls)) goal_cls |
21070 | 857 |
val _ = app (fn axcls => Output.debug ("filtered clauses = " ^ Int.toString(length axcls))) |
858 |
axcls_list |
|
21588 | 859 |
val writer = if !prover = "spass" then dfg_writer else tptp_writer |
20526
756c4f1fd04c
Extended the blacklist with higher-order theorems. Restructured. Added checks to
paulson
parents:
20457
diff
changeset
|
860 |
fun write_all [] [] _ = [] |
21588 | 861 |
| write_all (ccls::ccls_list) (axcls::axcls_list) k = |
20868
724ab9896068
Improved detection of identical clauses, also in the conjecture
paulson
parents:
20854
diff
changeset
|
862 |
let val fname = probfile k |
724ab9896068
Improved detection of identical clauses, also in the conjecture
paulson
parents:
20854
diff
changeset
|
863 |
val axcls = make_unique axcls |
724ab9896068
Improved detection of identical clauses, also in the conjecture
paulson
parents:
20854
diff
changeset
|
864 |
val ccls = subtract_cls ccls axcls |
21431
ef9080e7dbbc
Outputs a minimal number of arity clauses. Tidying of blacklist, fixing the blacklisting of thm lists
paulson
parents:
21397
diff
changeset
|
865 |
val ccltms = map prop_of ccls |
21373
18f519614978
Arity clauses are now produced only for types and type classes actually used.
paulson
parents:
21311
diff
changeset
|
866 |
and axtms = map (prop_of o #1) axcls |
21431
ef9080e7dbbc
Outputs a minimal number of arity clauses. Tidying of blacklist, fixing the blacklisting of thm lists
paulson
parents:
21397
diff
changeset
|
867 |
val subs = tfree_classes_of_terms ccltms |
ef9080e7dbbc
Outputs a minimal number of arity clauses. Tidying of blacklist, fixing the blacklisting of thm lists
paulson
parents:
21397
diff
changeset
|
868 |
and supers = tvar_classes_of_terms axtms |
ef9080e7dbbc
Outputs a minimal number of arity clauses. Tidying of blacklist, fixing the blacklisting of thm lists
paulson
parents:
21397
diff
changeset
|
869 |
and tycons = type_consts_of_terms thy (ccltms@axtms) |
21290
33b6bb5d6ab8
Improvement to classrel clauses: now outputs the minimum needed.
paulson
parents:
21243
diff
changeset
|
870 |
(*TFrees in conjecture clauses; TVars in axiom clauses*) |
21790
9d2761d09d91
Removal of the "keep_types" flag: we always keep types!
paulson
parents:
21690
diff
changeset
|
871 |
val classrel_clauses = ResClause.make_classrel_clauses thy subs supers |
21290
33b6bb5d6ab8
Improvement to classrel clauses: now outputs the minimum needed.
paulson
parents:
21243
diff
changeset
|
872 |
val _ = Output.debug ("classrel clauses = " ^ Int.toString (length classrel_clauses)) |
21790
9d2761d09d91
Removal of the "keep_types" flag: we always keep types!
paulson
parents:
21690
diff
changeset
|
873 |
val arity_clauses = ResClause.arity_clause_thy thy tycons supers |
21373
18f519614978
Arity clauses are now produced only for types and type classes actually used.
paulson
parents:
21311
diff
changeset
|
874 |
val _ = Output.debug ("arity clauses = " ^ Int.toString (length arity_clauses)) |
20868
724ab9896068
Improved detection of identical clauses, also in the conjecture
paulson
parents:
20854
diff
changeset
|
875 |
val clnames = writer logic ccls fname (axcls,classrel_clauses,arity_clauses) [] |
21888 | 876 |
val thm_names = Vector.fromList clnames |
21588 | 877 |
val _ = if !Output.show_debug_msgs |
21888 | 878 |
then trace_vector (fname ^ "_thm_names") thm_names else () |
20870 | 879 |
in (thm_names,fname) :: write_all ccls_list axcls_list (k+1) end |
880 |
val (thm_names_list, filenames) = ListPair.unzip (write_all goal_cls axcls_list 1) |
|
19194 | 881 |
in |
20870 | 882 |
(filenames, thm_names_list) |
19194 | 883 |
end; |
15644 | 884 |
|
21588 | 885 |
val last_watcher_pid = ref (NONE : (TextIO.instream * TextIO.outstream * |
17775 | 886 |
Posix.Process.pid * string list) option); |
887 |
||
888 |
fun kill_last_watcher () = |
|
21588 | 889 |
(case !last_watcher_pid of |
17775 | 890 |
NONE => () |
21588 | 891 |
| SOME (_, _, pid, files) => |
892 |
(Output.debug ("Killing old watcher, pid = " ^ string_of_pid pid); |
|
893 |
Watcher.killWatcher pid; |
|
894 |
ignore (map (try cond_rm_tmp) files))) |
|
18680 | 895 |
handle OS.SysErr _ => Output.debug "Attempt to kill watcher failed"; |
17525
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17502
diff
changeset
|
896 |
|
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17502
diff
changeset
|
897 |
(*writes out the current clasimpset to a tptp file; |
ae5bb6001afb
tidying, and support for axclass/classrel clauses
paulson
parents:
17502
diff
changeset
|
898 |
turns off xsymbol at start of function, restoring it at end *) |
20954 | 899 |
fun isar_atp_body (ctxt, th) = |
17717 | 900 |
if Thm.no_prems th then () |
16802
6eeee59dac4c
use Toplevel.print_state_hook instead of adhoc Proof.atp_hook;
wenzelm
parents:
16767
diff
changeset
|
901 |
else |
6eeee59dac4c
use Toplevel.print_state_hook instead of adhoc Proof.atp_hook;
wenzelm
parents:
16767
diff
changeset
|
902 |
let |
17775 | 903 |
val _ = kill_last_watcher() |
20870 | 904 |
val (files,thm_names_list) = write_problem_files prob_pathname (ctxt,th) |
905 |
val (childin, childout, pid) = Watcher.createWatcher (th, thm_names_list) |
|
15608 | 906 |
in |
17772
818cec5f82a4
major simplification: removal of the goalstring argument
paulson
parents:
17764
diff
changeset
|
907 |
last_watcher_pid := SOME (childin, childout, pid, files); |
21588 | 908 |
Output.debug ("problem files: " ^ space_implode ", " files); |
18680 | 909 |
Output.debug ("pid: " ^ string_of_pid pid); |
17717 | 910 |
watcher_call_provers (sign_of_thm th) (Thm.prems_of th) (childin, childout, pid) |
20954 | 911 |
end; |
912 |
||
913 |
val isar_atp = setmp print_mode [] isar_atp_body; |
|
914 |
||
915 |
(*For ML scripts, and primarily, for debugging*) |
|
21588 | 916 |
fun callatp () = |
20954 | 917 |
let val th = topthm() |
918 |
val ctxt = ProofContext.init (theory_of_thm th) |
|
919 |
in isar_atp_body (ctxt, th) end; |
|
15608 | 920 |
|
21588 | 921 |
val isar_atp_writeonly = setmp print_mode [] |
17717 | 922 |
(fn (ctxt,th) => |
923 |
if Thm.no_prems th then () |
|
21588 | 924 |
else |
925 |
let val probfile = if Thm.nprems_of th = 1 then probfile_nosuffix |
|
926 |
else prob_pathname |
|
20022 | 927 |
in ignore (write_problem_files probfile (ctxt,th)) end); |
15452 | 928 |
|
16357 | 929 |
|
16802
6eeee59dac4c
use Toplevel.print_state_hook instead of adhoc Proof.atp_hook;
wenzelm
parents:
16767
diff
changeset
|
930 |
(** the Isar toplevel hook **) |
6eeee59dac4c
use Toplevel.print_state_hook instead of adhoc Proof.atp_hook;
wenzelm
parents:
16767
diff
changeset
|
931 |
|
19205
4ec788c69f82
Tidying. New invoke_atp_ml for top-level debugging. Flag to force FOL mode.
paulson
parents:
19194
diff
changeset
|
932 |
fun invoke_atp_ml (ctxt, goal) = |
4ec788c69f82
Tidying. New invoke_atp_ml for top-level debugging. Flag to force FOL mode.
paulson
parents:
19194
diff
changeset
|
933 |
let val thy = ProofContext.theory_of ctxt; |
16802
6eeee59dac4c
use Toplevel.print_state_hook instead of adhoc Proof.atp_hook;
wenzelm
parents:
16767
diff
changeset
|
934 |
in |
21588 | 935 |
Output.debug ("subgoals in isar_atp:\n" ^ |
936 |
Pretty.string_of (ProofContext.pretty_term ctxt |
|
937 |
(Logic.mk_conjunction_list (Thm.prems_of goal)))); |
|
18680 | 938 |
Output.debug ("current theory: " ^ Context.theory_name thy); |
20419 | 939 |
inc hook_count; |
18680 | 940 |
Output.debug ("in hook for time: " ^ Int.toString (!hook_count)); |
16925
0fd7b1438d28
simpler variable names, and no types for monomorphic constants
paulson
parents:
16904
diff
changeset
|
941 |
ResClause.init thy; |
19194 | 942 |
ResHolClause.init thy; |
21132 | 943 |
if !time_limit > 0 then isar_atp (ctxt, goal) |
944 |
else (warning "Writing problem file only"; isar_atp_writeonly (ctxt, goal)) |
|
19205
4ec788c69f82
Tidying. New invoke_atp_ml for top-level debugging. Flag to force FOL mode.
paulson
parents:
19194
diff
changeset
|
945 |
end; |
4ec788c69f82
Tidying. New invoke_atp_ml for top-level debugging. Flag to force FOL mode.
paulson
parents:
19194
diff
changeset
|
946 |
|
4ec788c69f82
Tidying. New invoke_atp_ml for top-level debugging. Flag to force FOL mode.
paulson
parents:
19194
diff
changeset
|
947 |
val invoke_atp = Toplevel.no_timing o Toplevel.unknown_proof o Toplevel.keep |
4ec788c69f82
Tidying. New invoke_atp_ml for top-level debugging. Flag to force FOL mode.
paulson
parents:
19194
diff
changeset
|
948 |
(fn state => |
4ec788c69f82
Tidying. New invoke_atp_ml for top-level debugging. Flag to force FOL mode.
paulson
parents:
19194
diff
changeset
|
949 |
let val (ctxt, (_, goal)) = Proof.get_goal (Toplevel.proof_of state) |
4ec788c69f82
Tidying. New invoke_atp_ml for top-level debugging. Flag to force FOL mode.
paulson
parents:
19194
diff
changeset
|
950 |
in invoke_atp_ml (ctxt, goal) end); |
16357 | 951 |
|
17091 | 952 |
val call_atpP = |
21588 | 953 |
OuterSyntax.command |
954 |
"ProofGeneral.call_atp" |
|
955 |
"call automatic theorem provers" |
|
17091 | 956 |
OuterKeyword.diag |
19205
4ec788c69f82
Tidying. New invoke_atp_ml for top-level debugging. Flag to force FOL mode.
paulson
parents:
19194
diff
changeset
|
957 |
(Scan.succeed invoke_atp); |
17091 | 958 |
|
959 |
val _ = OuterSyntax.add_parsers [call_atpP]; |
|
960 |
||
15347 | 961 |
end; |