author | blanchet |
Tue, 15 Nov 2011 22:13:39 +0100 | |
changeset 45508 | b216dc1b3630 |
parent 45401 | 36478a5f6104 |
child 45509 | 624872fc47bf |
permissions | -rw-r--r-- |
43283 | 1 |
(* Title: HOL/Tools/ATP/atp_translate.ML |
38282
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
2 |
Author: Fabian Immler, TU Muenchen |
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
3 |
Author: Makarius |
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
4 |
Author: Jasmin Blanchette, TU Muenchen |
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
5 |
|
43863
a43d61270142
ensure that the lambda translation procedure is called only once with all the facts, which is necessary for soundness of lambda-lifting (freshness of new names)
blanchet
parents:
43862
diff
changeset
|
6 |
Translation of HOL to FOL for Metis and Sledgehammer. |
38282
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
7 |
*) |
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
8 |
|
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
9 |
signature ATP_TRANSLATE = |
38282
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
10 |
sig |
43676
3b0b448b4d69
add support for lambdas in TPTP THF generator + killed an unsound type encoding (because the monotonicity calculus assumes first-order)
nik
parents:
43628
diff
changeset
|
11 |
type ('a, 'b) ho_term = ('a, 'b) ATP_Problem.ho_term |
43136
cf5cda219058
handle lightweight tags sym theorems gracefully in the presence of TVars with interesting type classes
blanchet
parents:
43130
diff
changeset
|
12 |
type connective = ATP_Problem.connective |
cf5cda219058
handle lightweight tags sym theorems gracefully in the presence of TVars with interesting type classes
blanchet
parents:
43130
diff
changeset
|
13 |
type ('a, 'b, 'c) formula = ('a, 'b, 'c) ATP_Problem.formula |
45301
866b075aa99b
added sorted DFG output for coming version of SPASS
blanchet
parents:
45299
diff
changeset
|
14 |
type atp_format = ATP_Problem.atp_format |
42709
e7af132d48fe
allow each prover to specify its own formula kind for symbols occurring in the conjecture
blanchet
parents:
42701
diff
changeset
|
15 |
type formula_kind = ATP_Problem.formula_kind |
38282
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
16 |
type 'a problem = 'a ATP_Problem.problem |
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
17 |
|
43421 | 18 |
datatype locality = |
44783 | 19 |
General | Helper | Induction | Intro | Elim | Simp | Local | Assum | Chained |
42613
23b13b1bd565
use strings to encode type systems in ATP module, to reduce the amount of out-of-place information and also to make it easier to print the type system used
blanchet
parents:
42612
diff
changeset
|
20 |
|
44494
a77901b3774e
rationalized option names -- mono becomes raw_mono and mangled becomes mono
blanchet
parents:
44493
diff
changeset
|
21 |
datatype polymorphism = Polymorphic | Raw_Monomorphic | Mangled_Monomorphic |
45299
ee584ff987c3
check "sound" flag before doing something unsound...
blanchet
parents:
45202
diff
changeset
|
22 |
datatype soundness = Sound_Modulo_Infinity | Sound |
44811 | 23 |
datatype granularity = All_Vars | Positively_Naked_Vars | Ghost_Type_Arg_Vars |
42613
23b13b1bd565
use strings to encode type systems in ATP module, to reduce the amount of out-of-place information and also to make it easier to print the type system used
blanchet
parents:
42612
diff
changeset
|
24 |
datatype type_level = |
44397
06375952f1fa
cleaner handling of polymorphic monotonicity inference
blanchet
parents:
44396
diff
changeset
|
25 |
All_Types | |
44811 | 26 |
Noninf_Nonmono_Types of soundness * granularity | |
27 |
Fin_Nonmono_Types of granularity | |
|
44397
06375952f1fa
cleaner handling of polymorphic monotonicity inference
blanchet
parents:
44396
diff
changeset
|
28 |
Const_Arg_Types | |
43362 | 29 |
No_Types |
44782 | 30 |
type type_enc |
42613
23b13b1bd565
use strings to encode type systems in ATP module, to reduce the amount of out-of-place information and also to make it easier to print the type system used
blanchet
parents:
42612
diff
changeset
|
31 |
|
44496
c1884789ff80
added config options to control two aspects of the translation, for evaluation purposes
blanchet
parents:
44495
diff
changeset
|
32 |
val type_tag_idempotence : bool Config.T |
c1884789ff80
added config options to control two aspects of the translation, for evaluation purposes
blanchet
parents:
44495
diff
changeset
|
33 |
val type_tag_arguments : bool Config.T |
44088
3693baa6befb
move lambda-lifting code to ATP encoding, so it can be used by Metis
blanchet
parents:
44003
diff
changeset
|
34 |
val no_lambdasN : string |
3693baa6befb
move lambda-lifting code to ATP encoding, so it can be used by Metis
blanchet
parents:
44003
diff
changeset
|
35 |
val concealedN : string |
3693baa6befb
move lambda-lifting code to ATP encoding, so it can be used by Metis
blanchet
parents:
44003
diff
changeset
|
36 |
val liftingN : string |
3693baa6befb
move lambda-lifting code to ATP encoding, so it can be used by Metis
blanchet
parents:
44003
diff
changeset
|
37 |
val combinatorsN : string |
3693baa6befb
move lambda-lifting code to ATP encoding, so it can be used by Metis
blanchet
parents:
44003
diff
changeset
|
38 |
val hybridN : string |
3693baa6befb
move lambda-lifting code to ATP encoding, so it can be used by Metis
blanchet
parents:
44003
diff
changeset
|
39 |
val lambdasN : string |
3693baa6befb
move lambda-lifting code to ATP encoding, so it can be used by Metis
blanchet
parents:
44003
diff
changeset
|
40 |
val smartN : string |
43496
92f5a4c78b37
remove historical bloat -- another benefit of merging Metis's and Sledgehammer's translations
blanchet
parents:
43495
diff
changeset
|
41 |
val schematic_var_prefix : string |
92f5a4c78b37
remove historical bloat -- another benefit of merging Metis's and Sledgehammer's translations
blanchet
parents:
43495
diff
changeset
|
42 |
val fixed_var_prefix : string |
92f5a4c78b37
remove historical bloat -- another benefit of merging Metis's and Sledgehammer's translations
blanchet
parents:
43495
diff
changeset
|
43 |
val tvar_prefix : string |
92f5a4c78b37
remove historical bloat -- another benefit of merging Metis's and Sledgehammer's translations
blanchet
parents:
43495
diff
changeset
|
44 |
val tfree_prefix : string |
92f5a4c78b37
remove historical bloat -- another benefit of merging Metis's and Sledgehammer's translations
blanchet
parents:
43495
diff
changeset
|
45 |
val const_prefix : string |
92f5a4c78b37
remove historical bloat -- another benefit of merging Metis's and Sledgehammer's translations
blanchet
parents:
43495
diff
changeset
|
46 |
val type_const_prefix : string |
92f5a4c78b37
remove historical bloat -- another benefit of merging Metis's and Sledgehammer's translations
blanchet
parents:
43495
diff
changeset
|
47 |
val class_prefix : string |
45508 | 48 |
val lambda_lifted_prefix : string |
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
49 |
val skolem_const_prefix : string |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
50 |
val old_skolem_const_prefix : string |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
51 |
val new_skolem_const_prefix : string |
43125
ddf63baabdec
distinguish different kinds of typing informations in the fact name
blanchet
parents:
43121
diff
changeset
|
52 |
val type_decl_prefix : string |
ddf63baabdec
distinguish different kinds of typing informations in the fact name
blanchet
parents:
43121
diff
changeset
|
53 |
val sym_decl_prefix : string |
43989 | 54 |
val guards_sym_formula_prefix : string |
44396
66b9b3fcd608
started cleaning up polymorphic monotonicity-based encodings, based on discussions with Nick Smallbone
blanchet
parents:
44394
diff
changeset
|
55 |
val tags_sym_formula_prefix : string |
40204
da97d75e20e6
standardize on "fact" terminology (vs. "axiom" or "theorem") in Sledgehammer -- but keep "Axiom" in the lower-level "ATP_Problem" module
blanchet
parents:
40145
diff
changeset
|
56 |
val fact_prefix : string |
38282
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
57 |
val conjecture_prefix : string |
42881
dbdfe2d5b6ab
automatically use "metisFT" when typed helpers are necessary
blanchet
parents:
42879
diff
changeset
|
58 |
val helper_prefix : string |
43125
ddf63baabdec
distinguish different kinds of typing informations in the fact name
blanchet
parents:
43121
diff
changeset
|
59 |
val class_rel_clause_prefix : string |
ddf63baabdec
distinguish different kinds of typing informations in the fact name
blanchet
parents:
43121
diff
changeset
|
60 |
val arity_clause_prefix : string |
ddf63baabdec
distinguish different kinds of typing informations in the fact name
blanchet
parents:
43121
diff
changeset
|
61 |
val tfree_clause_prefix : string |
42881
dbdfe2d5b6ab
automatically use "metisFT" when typed helpers are necessary
blanchet
parents:
42879
diff
changeset
|
62 |
val typed_helper_suffix : string |
43125
ddf63baabdec
distinguish different kinds of typing informations in the fact name
blanchet
parents:
43121
diff
changeset
|
63 |
val untyped_helper_suffix : string |
43159
29b55f292e0b
added support for helpers in new Metis, so far only for polymorphic type encodings
blanchet
parents:
43139
diff
changeset
|
64 |
val type_tag_idempotence_helper_name : string |
42966
4e2d6c1e5392
more work on parsing LEO-II proofs without lambdas
blanchet
parents:
42963
diff
changeset
|
65 |
val predicator_name : string |
4e2d6c1e5392
more work on parsing LEO-II proofs without lambdas
blanchet
parents:
42963
diff
changeset
|
66 |
val app_op_name : string |
44396
66b9b3fcd608
started cleaning up polymorphic monotonicity-based encodings, based on discussions with Nick Smallbone
blanchet
parents:
44394
diff
changeset
|
67 |
val type_guard_name : string |
43104
81d1b15aa0ae
use ":" for type information (looks good in Metis's output) and handle it in new path finder
blanchet
parents:
43102
diff
changeset
|
68 |
val type_tag_name : string |
42962
3b50fdeb6cfc
started adding support for THF output (but no lambdas)
blanchet
parents:
42956
diff
changeset
|
69 |
val simple_type_prefix : string |
43174 | 70 |
val prefixed_predicator_name : string |
43130
d73fc2e55308
implemented missing hAPP and ti cases of new path finder
blanchet
parents:
43129
diff
changeset
|
71 |
val prefixed_app_op_name : string |
d73fc2e55308
implemented missing hAPP and ti cases of new path finder
blanchet
parents:
43129
diff
changeset
|
72 |
val prefixed_type_tag_name : string |
43496
92f5a4c78b37
remove historical bloat -- another benefit of merging Metis's and Sledgehammer's translations
blanchet
parents:
43495
diff
changeset
|
73 |
val ascii_of : string -> string |
92f5a4c78b37
remove historical bloat -- another benefit of merging Metis's and Sledgehammer's translations
blanchet
parents:
43495
diff
changeset
|
74 |
val unascii_of : string -> string |
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
75 |
val strip_prefix_and_unascii : string -> string -> string option |
43159
29b55f292e0b
added support for helpers in new Metis, so far only for polymorphic type encodings
blanchet
parents:
43139
diff
changeset
|
76 |
val proxy_table : (string * (string * (thm * (string * string)))) list |
29b55f292e0b
added support for helpers in new Metis, so far only for polymorphic type encodings
blanchet
parents:
43139
diff
changeset
|
77 |
val proxify_const : string -> (string * string) option |
43496
92f5a4c78b37
remove historical bloat -- another benefit of merging Metis's and Sledgehammer's translations
blanchet
parents:
43495
diff
changeset
|
78 |
val invert_const : string -> string |
92f5a4c78b37
remove historical bloat -- another benefit of merging Metis's and Sledgehammer's translations
blanchet
parents:
43495
diff
changeset
|
79 |
val unproxify_const : string -> string |
43093 | 80 |
val new_skolem_var_name_from_const : string -> string |
43248
69375eaa9016
more suitable implementation of "schematic_consts_of" for monomorphizer, for ATPs
blanchet
parents:
43222
diff
changeset
|
81 |
val atp_irrelevant_consts : string list |
69375eaa9016
more suitable implementation of "schematic_consts_of" for monomorphizer, for ATPs
blanchet
parents:
43222
diff
changeset
|
82 |
val atp_schematic_consts_of : term -> typ list Symtab.table |
43828
e07a2c4cbad8
move lambda translation option from ATP to Sledgehammer, to avoid accidentally breaking Metis (its reconstruction code can only deal with combinators)
blanchet
parents:
43827
diff
changeset
|
83 |
val is_type_enc_higher_order : type_enc -> bool |
43626
a867ebb12209
renamed "type_sys" to "type_enc", which is more accurate
blanchet
parents:
43624
diff
changeset
|
84 |
val polymorphism_of_type_enc : type_enc -> polymorphism |
a867ebb12209
renamed "type_sys" to "type_enc", which is more accurate
blanchet
parents:
43624
diff
changeset
|
85 |
val level_of_type_enc : type_enc -> type_level |
44397
06375952f1fa
cleaner handling of polymorphic monotonicity inference
blanchet
parents:
44396
diff
changeset
|
86 |
val is_type_enc_quasi_sound : type_enc -> bool |
43626
a867ebb12209
renamed "type_sys" to "type_enc", which is more accurate
blanchet
parents:
43624
diff
changeset
|
87 |
val is_type_enc_fairly_sound : type_enc -> bool |
44768 | 88 |
val type_enc_from_string : soundness -> string -> type_enc |
45301
866b075aa99b
added sorted DFG output for coming version of SPASS
blanchet
parents:
45299
diff
changeset
|
89 |
val adjust_type_enc : atp_format -> type_enc -> type_enc |
45508 | 90 |
val lift_lambdas : |
91 |
Proof.context -> type_enc -> term list -> term list * term list |
|
43136
cf5cda219058
handle lightweight tags sym theorems gracefully in the presence of TVars with interesting type classes
blanchet
parents:
43130
diff
changeset
|
92 |
val mk_aconns : |
cf5cda219058
handle lightweight tags sym theorems gracefully in the presence of TVars with interesting type classes
blanchet
parents:
43130
diff
changeset
|
93 |
connective -> ('a, 'b, 'c) formula list -> ('a, 'b, 'c) formula |
43676
3b0b448b4d69
add support for lambdas in TPTP THF generator + killed an unsound type encoding (because the monotonicity calculus assumes first-order)
nik
parents:
43628
diff
changeset
|
94 |
val unmangled_const : string -> string * (string, 'b) ho_term list |
43130
d73fc2e55308
implemented missing hAPP and ti cases of new path finder
blanchet
parents:
43129
diff
changeset
|
95 |
val unmangled_const_name : string -> string |
43194 | 96 |
val helper_table : ((string * bool) * thm list) list |
43501
0e422a84d0b2
don't change the way helpers are generated for the exporter's sake
blanchet
parents:
43496
diff
changeset
|
97 |
val factsN : string |
40059
6ad9081665db
use consistent terminology in Sledgehammer: "prover = ATP or SMT solver or ..."
blanchet
parents:
39975
diff
changeset
|
98 |
val prepare_atp_problem : |
45301
866b075aa99b
added sorted DFG output for coming version of SPASS
blanchet
parents:
45299
diff
changeset
|
99 |
Proof.context -> atp_format -> formula_kind -> formula_kind -> type_enc |
44397
06375952f1fa
cleaner handling of polymorphic monotonicity inference
blanchet
parents:
44396
diff
changeset
|
100 |
-> bool -> string -> bool -> bool -> term list -> term |
44088
3693baa6befb
move lambda-lifting code to ATP encoding, so it can be used by Metis
blanchet
parents:
44003
diff
changeset
|
101 |
-> ((string * locality) * term) list |
42541
8938507b2054
move type declarations to the front, for TFF-compliance
blanchet
parents:
42540
diff
changeset
|
102 |
-> string problem * string Symtab.table * int * int |
45508 | 103 |
* (string * locality) list vector * int list * (string * term) list |
104 |
* int Symtab.table |
|
41313
a96ac4d180b7
optionally supply constant weights to E -- turned off by default until properly parameterized
blanchet
parents:
41211
diff
changeset
|
105 |
val atp_problem_weights : string problem -> (string * real) list |
38282
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
106 |
end; |
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
107 |
|
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
108 |
structure ATP_Translate : ATP_TRANSLATE = |
38282
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
109 |
struct |
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
110 |
|
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
111 |
open ATP_Util |
38282
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
112 |
open ATP_Problem |
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
113 |
|
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
114 |
type name = string * string |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
115 |
|
44496
c1884789ff80
added config options to control two aspects of the translation, for evaluation purposes
blanchet
parents:
44495
diff
changeset
|
116 |
val type_tag_idempotence = |
44540
968115499161
change default for generation of tag idempotence and tag argument equations
blanchet
parents:
44508
diff
changeset
|
117 |
Attrib.setup_config_bool @{binding atp_type_tag_idempotence} (K false) |
44496
c1884789ff80
added config options to control two aspects of the translation, for evaluation purposes
blanchet
parents:
44495
diff
changeset
|
118 |
val type_tag_arguments = |
44540
968115499161
change default for generation of tag idempotence and tag argument equations
blanchet
parents:
44508
diff
changeset
|
119 |
Attrib.setup_config_bool @{binding atp_type_tag_arguments} (K false) |
44496
c1884789ff80
added config options to control two aspects of the translation, for evaluation purposes
blanchet
parents:
44495
diff
changeset
|
120 |
|
44088
3693baa6befb
move lambda-lifting code to ATP encoding, so it can be used by Metis
blanchet
parents:
44003
diff
changeset
|
121 |
val no_lambdasN = "no_lambdas" |
3693baa6befb
move lambda-lifting code to ATP encoding, so it can be used by Metis
blanchet
parents:
44003
diff
changeset
|
122 |
val concealedN = "concealed" |
3693baa6befb
move lambda-lifting code to ATP encoding, so it can be used by Metis
blanchet
parents:
44003
diff
changeset
|
123 |
val liftingN = "lifting" |
3693baa6befb
move lambda-lifting code to ATP encoding, so it can be used by Metis
blanchet
parents:
44003
diff
changeset
|
124 |
val combinatorsN = "combinators" |
3693baa6befb
move lambda-lifting code to ATP encoding, so it can be used by Metis
blanchet
parents:
44003
diff
changeset
|
125 |
val hybridN = "hybrid" |
3693baa6befb
move lambda-lifting code to ATP encoding, so it can be used by Metis
blanchet
parents:
44003
diff
changeset
|
126 |
val lambdasN = "lambdas" |
3693baa6befb
move lambda-lifting code to ATP encoding, so it can be used by Metis
blanchet
parents:
44003
diff
changeset
|
127 |
val smartN = "smart" |
3693baa6befb
move lambda-lifting code to ATP encoding, so it can be used by Metis
blanchet
parents:
44003
diff
changeset
|
128 |
|
44622 | 129 |
(* TFF1 is still in development, and it is still unclear whether symbols will be |
130 |
allowed to have types like "$tType > $o" (i.e., "![A : $tType] : $o"), with |
|
45301
866b075aa99b
added sorted DFG output for coming version of SPASS
blanchet
parents:
45299
diff
changeset
|
131 |
ghost type variables. *) |
866b075aa99b
added sorted DFG output for coming version of SPASS
blanchet
parents:
45299
diff
changeset
|
132 |
val avoid_first_order_ghost_type_vars = true |
44622 | 133 |
|
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
134 |
val bound_var_prefix = "B_" |
44403
15160cdc4688
precisely distinguish between universal and existential quantifiers, instead of assuming the worst (universal), for monotonicity analysis
blanchet
parents:
44402
diff
changeset
|
135 |
val all_bound_var_prefix = "BA_" |
15160cdc4688
precisely distinguish between universal and existential quantifiers, instead of assuming the worst (universal), for monotonicity analysis
blanchet
parents:
44402
diff
changeset
|
136 |
val exist_bound_var_prefix = "BE_" |
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
137 |
val schematic_var_prefix = "V_" |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
138 |
val fixed_var_prefix = "v_" |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
139 |
val tvar_prefix = "T_" |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
140 |
val tfree_prefix = "t_" |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
141 |
val const_prefix = "c_" |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
142 |
val type_const_prefix = "tc_" |
44491
ba22ed224b20
fixed bang encoding detection of which types to encode
blanchet
parents:
44463
diff
changeset
|
143 |
val simple_type_prefix = "s_" |
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
144 |
val class_prefix = "cl_" |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
145 |
|
45508 | 146 |
val lambda_lifted_prefix = "lambda" |
147 |
val lambda_lifted_poly_prefix = lambda_lifted_prefix ^ "_poly" |
|
43907
073ab5379842
pass type arguments to lambda-lifted Frees, to account for polymorphism
blanchet
parents:
43906
diff
changeset
|
148 |
|
43863
a43d61270142
ensure that the lambda translation procedure is called only once with all the facts, which is necessary for soundness of lambda-lifting (freshness of new names)
blanchet
parents:
43862
diff
changeset
|
149 |
val skolem_const_prefix = "ATP" ^ Long_Name.separator ^ "Sko" |
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
150 |
val old_skolem_const_prefix = skolem_const_prefix ^ "o" |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
151 |
val new_skolem_const_prefix = skolem_const_prefix ^ "n" |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
152 |
|
42998
1c80902d0456
fully support all type system encodings in typed formats (TFF, THF)
blanchet
parents:
42994
diff
changeset
|
153 |
val type_decl_prefix = "ty_" |
1c80902d0456
fully support all type system encodings in typed formats (TFF, THF)
blanchet
parents:
42994
diff
changeset
|
154 |
val sym_decl_prefix = "sy_" |
43989 | 155 |
val guards_sym_formula_prefix = "gsy_" |
44396
66b9b3fcd608
started cleaning up polymorphic monotonicity-based encodings, based on discussions with Nick Smallbone
blanchet
parents:
44394
diff
changeset
|
156 |
val tags_sym_formula_prefix = "tsy_" |
40204
da97d75e20e6
standardize on "fact" terminology (vs. "axiom" or "theorem") in Sledgehammer -- but keep "Axiom" in the lower-level "ATP_Problem" module
blanchet
parents:
40145
diff
changeset
|
157 |
val fact_prefix = "fact_" |
38282
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
158 |
val conjecture_prefix = "conj_" |
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
159 |
val helper_prefix = "help_" |
43159
29b55f292e0b
added support for helpers in new Metis, so far only for polymorphic type encodings
blanchet
parents:
43139
diff
changeset
|
160 |
val class_rel_clause_prefix = "clar_" |
38282
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
161 |
val arity_clause_prefix = "arity_" |
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
162 |
val tfree_clause_prefix = "tfree_" |
38282
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
163 |
|
43863
a43d61270142
ensure that the lambda translation procedure is called only once with all the facts, which is necessary for soundness of lambda-lifting (freshness of new names)
blanchet
parents:
43862
diff
changeset
|
164 |
val lambda_fact_prefix = "ATP.lambda_" |
42881
dbdfe2d5b6ab
automatically use "metisFT" when typed helpers are necessary
blanchet
parents:
42879
diff
changeset
|
165 |
val typed_helper_suffix = "_T" |
dbdfe2d5b6ab
automatically use "metisFT" when typed helpers are necessary
blanchet
parents:
42879
diff
changeset
|
166 |
val untyped_helper_suffix = "_U" |
43159
29b55f292e0b
added support for helpers in new Metis, so far only for polymorphic type encodings
blanchet
parents:
43139
diff
changeset
|
167 |
val type_tag_idempotence_helper_name = helper_prefix ^ "ti_idem" |
42881
dbdfe2d5b6ab
automatically use "metisFT" when typed helpers are necessary
blanchet
parents:
42879
diff
changeset
|
168 |
|
44491
ba22ed224b20
fixed bang encoding detection of which types to encode
blanchet
parents:
44463
diff
changeset
|
169 |
val predicator_name = "pp" |
ba22ed224b20
fixed bang encoding detection of which types to encode
blanchet
parents:
44463
diff
changeset
|
170 |
val app_op_name = "aa" |
ba22ed224b20
fixed bang encoding detection of which types to encode
blanchet
parents:
44463
diff
changeset
|
171 |
val type_guard_name = "gg" |
ba22ed224b20
fixed bang encoding detection of which types to encode
blanchet
parents:
44463
diff
changeset
|
172 |
val type_tag_name = "tt" |
42531
a462dbaa584f
added more rudimentary type support to Sledgehammer's ATP encoding
blanchet
parents:
42530
diff
changeset
|
173 |
|
43174 | 174 |
val prefixed_predicator_name = const_prefix ^ predicator_name |
43130
d73fc2e55308
implemented missing hAPP and ti cases of new path finder
blanchet
parents:
43129
diff
changeset
|
175 |
val prefixed_app_op_name = const_prefix ^ app_op_name |
d73fc2e55308
implemented missing hAPP and ti cases of new path finder
blanchet
parents:
43129
diff
changeset
|
176 |
val prefixed_type_tag_name = const_prefix ^ type_tag_name |
d73fc2e55308
implemented missing hAPP and ti cases of new path finder
blanchet
parents:
43129
diff
changeset
|
177 |
|
38282
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
178 |
(* Freshness almost guaranteed! *) |
43863
a43d61270142
ensure that the lambda translation procedure is called only once with all the facts, which is necessary for soundness of lambda-lifting (freshness of new names)
blanchet
parents:
43862
diff
changeset
|
179 |
val atp_weak_prefix = "ATP:" |
38282
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
180 |
|
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
181 |
(*Escaping of special characters. |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
182 |
Alphanumeric characters are left unchanged. |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
183 |
The character _ goes to __ |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
184 |
Characters in the range ASCII space to / go to _A to _P, respectively. |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
185 |
Other characters go to _nnn where nnn is the decimal ASCII code.*) |
43093 | 186 |
val upper_a_minus_space = Char.ord #"A" - Char.ord #" " |
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
187 |
|
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
188 |
fun stringN_of_int 0 _ = "" |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
189 |
| stringN_of_int k n = |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
190 |
stringN_of_int (k - 1) (n div 10) ^ string_of_int (n mod 10) |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
191 |
|
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
192 |
fun ascii_of_char c = |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
193 |
if Char.isAlphaNum c then |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
194 |
String.str c |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
195 |
else if c = #"_" then |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
196 |
"__" |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
197 |
else if #" " <= c andalso c <= #"/" then |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
198 |
"_" ^ String.str (Char.chr (Char.ord c + upper_a_minus_space)) |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
199 |
else |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
200 |
(* fixed width, in case more digits follow *) |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
201 |
"_" ^ stringN_of_int 3 (Char.ord c) |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
202 |
|
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
203 |
val ascii_of = String.translate ascii_of_char |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
204 |
|
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
205 |
(** Remove ASCII armoring from names in proof files **) |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
206 |
|
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
207 |
(* We don't raise error exceptions because this code can run inside a worker |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
208 |
thread. Also, the errors are impossible. *) |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
209 |
val unascii_of = |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
210 |
let |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
211 |
fun un rcs [] = String.implode(rev rcs) |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
212 |
| un rcs [#"_"] = un (#"_" :: rcs) [] (* ERROR *) |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
213 |
(* Three types of _ escapes: __, _A to _P, _nnn *) |
43496
92f5a4c78b37
remove historical bloat -- another benefit of merging Metis's and Sledgehammer's translations
blanchet
parents:
43495
diff
changeset
|
214 |
| un rcs (#"_" :: #"_" :: cs) = un (#"_" :: rcs) cs |
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
215 |
| un rcs (#"_" :: c :: cs) = |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
216 |
if #"A" <= c andalso c<= #"P" then |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
217 |
(* translation of #" " to #"/" *) |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
218 |
un (Char.chr (Char.ord c - upper_a_minus_space) :: rcs) cs |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
219 |
else |
43496
92f5a4c78b37
remove historical bloat -- another benefit of merging Metis's and Sledgehammer's translations
blanchet
parents:
43495
diff
changeset
|
220 |
let val digits = List.take (c :: cs, 3) handle General.Subscript => [] in |
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
221 |
case Int.fromString (String.implode digits) of |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
222 |
SOME n => un (Char.chr n :: rcs) (List.drop (cs, 2)) |
43496
92f5a4c78b37
remove historical bloat -- another benefit of merging Metis's and Sledgehammer's translations
blanchet
parents:
43495
diff
changeset
|
223 |
| NONE => un (c :: #"_" :: rcs) cs (* ERROR *) |
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
224 |
end |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
225 |
| un rcs (c :: cs) = un (c :: rcs) cs |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
226 |
in un [] o String.explode end |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
227 |
|
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
228 |
(* If string s has the prefix s1, return the result of deleting it, |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
229 |
un-ASCII'd. *) |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
230 |
fun strip_prefix_and_unascii s1 s = |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
231 |
if String.isPrefix s1 s then |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
232 |
SOME (unascii_of (String.extract (s, size s1, NONE))) |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
233 |
else |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
234 |
NONE |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
235 |
|
43159
29b55f292e0b
added support for helpers in new Metis, so far only for polymorphic type encodings
blanchet
parents:
43139
diff
changeset
|
236 |
val proxy_table = |
29b55f292e0b
added support for helpers in new Metis, so far only for polymorphic type encodings
blanchet
parents:
43139
diff
changeset
|
237 |
[("c_False", (@{const_name False}, (@{thm fFalse_def}, |
29b55f292e0b
added support for helpers in new Metis, so far only for polymorphic type encodings
blanchet
parents:
43139
diff
changeset
|
238 |
("fFalse", @{const_name ATP.fFalse})))), |
29b55f292e0b
added support for helpers in new Metis, so far only for polymorphic type encodings
blanchet
parents:
43139
diff
changeset
|
239 |
("c_True", (@{const_name True}, (@{thm fTrue_def}, |
29b55f292e0b
added support for helpers in new Metis, so far only for polymorphic type encodings
blanchet
parents:
43139
diff
changeset
|
240 |
("fTrue", @{const_name ATP.fTrue})))), |
29b55f292e0b
added support for helpers in new Metis, so far only for polymorphic type encodings
blanchet
parents:
43139
diff
changeset
|
241 |
("c_Not", (@{const_name Not}, (@{thm fNot_def}, |
29b55f292e0b
added support for helpers in new Metis, so far only for polymorphic type encodings
blanchet
parents:
43139
diff
changeset
|
242 |
("fNot", @{const_name ATP.fNot})))), |
29b55f292e0b
added support for helpers in new Metis, so far only for polymorphic type encodings
blanchet
parents:
43139
diff
changeset
|
243 |
("c_conj", (@{const_name conj}, (@{thm fconj_def}, |
29b55f292e0b
added support for helpers in new Metis, so far only for polymorphic type encodings
blanchet
parents:
43139
diff
changeset
|
244 |
("fconj", @{const_name ATP.fconj})))), |
29b55f292e0b
added support for helpers in new Metis, so far only for polymorphic type encodings
blanchet
parents:
43139
diff
changeset
|
245 |
("c_disj", (@{const_name disj}, (@{thm fdisj_def}, |
29b55f292e0b
added support for helpers in new Metis, so far only for polymorphic type encodings
blanchet
parents:
43139
diff
changeset
|
246 |
("fdisj", @{const_name ATP.fdisj})))), |
29b55f292e0b
added support for helpers in new Metis, so far only for polymorphic type encodings
blanchet
parents:
43139
diff
changeset
|
247 |
("c_implies", (@{const_name implies}, (@{thm fimplies_def}, |
29b55f292e0b
added support for helpers in new Metis, so far only for polymorphic type encodings
blanchet
parents:
43139
diff
changeset
|
248 |
("fimplies", @{const_name ATP.fimplies})))), |
29b55f292e0b
added support for helpers in new Metis, so far only for polymorphic type encodings
blanchet
parents:
43139
diff
changeset
|
249 |
("equal", (@{const_name HOL.eq}, (@{thm fequal_def}, |
43678 | 250 |
("fequal", @{const_name ATP.fequal})))), |
251 |
("c_All", (@{const_name All}, (@{thm fAll_def}, |
|
252 |
("fAll", @{const_name ATP.fAll})))), |
|
253 |
("c_Ex", (@{const_name Ex}, (@{thm fEx_def}, |
|
254 |
("fEx", @{const_name ATP.fEx}))))] |
|
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
255 |
|
43159
29b55f292e0b
added support for helpers in new Metis, so far only for polymorphic type encodings
blanchet
parents:
43139
diff
changeset
|
256 |
val proxify_const = AList.lookup (op =) proxy_table #> Option.map (snd o snd) |
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
257 |
|
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
258 |
(* Readable names for the more common symbolic functions. Do not mess with the |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
259 |
table unless you know what you are doing. *) |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
260 |
val const_trans_table = |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
261 |
[(@{type_name Product_Type.prod}, "prod"), |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
262 |
(@{type_name Sum_Type.sum}, "sum"), |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
263 |
(@{const_name False}, "False"), |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
264 |
(@{const_name True}, "True"), |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
265 |
(@{const_name Not}, "Not"), |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
266 |
(@{const_name conj}, "conj"), |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
267 |
(@{const_name disj}, "disj"), |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
268 |
(@{const_name implies}, "implies"), |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
269 |
(@{const_name HOL.eq}, "equal"), |
43678 | 270 |
(@{const_name All}, "All"), |
271 |
(@{const_name Ex}, "Ex"), |
|
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
272 |
(@{const_name If}, "If"), |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
273 |
(@{const_name Set.member}, "member"), |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
274 |
(@{const_name Meson.COMBI}, "COMBI"), |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
275 |
(@{const_name Meson.COMBK}, "COMBK"), |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
276 |
(@{const_name Meson.COMBB}, "COMBB"), |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
277 |
(@{const_name Meson.COMBC}, "COMBC"), |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
278 |
(@{const_name Meson.COMBS}, "COMBS")] |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
279 |
|> Symtab.make |
43159
29b55f292e0b
added support for helpers in new Metis, so far only for polymorphic type encodings
blanchet
parents:
43139
diff
changeset
|
280 |
|> fold (Symtab.update o swap o snd o snd o snd) proxy_table |
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
281 |
|
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
282 |
(* Invert the table of translations between Isabelle and ATPs. *) |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
283 |
val const_trans_table_inv = |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
284 |
const_trans_table |> Symtab.dest |> map swap |> Symtab.make |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
285 |
val const_trans_table_unprox = |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
286 |
Symtab.empty |
43159
29b55f292e0b
added support for helpers in new Metis, so far only for polymorphic type encodings
blanchet
parents:
43139
diff
changeset
|
287 |
|> fold (fn (_, (isa, (_, (_, atp)))) => Symtab.update (atp, isa)) proxy_table |
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
288 |
|
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
289 |
val invert_const = perhaps (Symtab.lookup const_trans_table_inv) |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
290 |
val unproxify_const = perhaps (Symtab.lookup const_trans_table_unprox) |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
291 |
|
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
292 |
fun lookup_const c = |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
293 |
case Symtab.lookup const_trans_table c of |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
294 |
SOME c' => c' |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
295 |
| NONE => ascii_of c |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
296 |
|
43622 | 297 |
fun ascii_of_indexname (v, 0) = ascii_of v |
298 |
| ascii_of_indexname (v, i) = ascii_of v ^ "_" ^ string_of_int i |
|
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
299 |
|
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
300 |
fun make_bound_var x = bound_var_prefix ^ ascii_of x |
44403
15160cdc4688
precisely distinguish between universal and existential quantifiers, instead of assuming the worst (universal), for monotonicity analysis
blanchet
parents:
44402
diff
changeset
|
301 |
fun make_all_bound_var x = all_bound_var_prefix ^ ascii_of x |
15160cdc4688
precisely distinguish between universal and existential quantifiers, instead of assuming the worst (universal), for monotonicity analysis
blanchet
parents:
44402
diff
changeset
|
302 |
fun make_exist_bound_var x = exist_bound_var_prefix ^ ascii_of x |
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
303 |
fun make_schematic_var v = schematic_var_prefix ^ ascii_of_indexname v |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
304 |
fun make_fixed_var x = fixed_var_prefix ^ ascii_of x |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
305 |
|
43622 | 306 |
fun make_schematic_type_var (x, i) = |
44595
444d111bde7d
generate properly typed TFF1 (PFF) problems in the presence of type class predicates
blanchet
parents:
44594
diff
changeset
|
307 |
tvar_prefix ^ (ascii_of_indexname (unprefix "'" x, i)) |
43622 | 308 |
fun make_fixed_type_var x = tfree_prefix ^ (ascii_of (unprefix "'" x)) |
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
309 |
|
45301
866b075aa99b
added sorted DFG output for coming version of SPASS
blanchet
parents:
45299
diff
changeset
|
310 |
(* "HOL.eq" and choice are mapped to the ATP's equivalents *) |
44587 | 311 |
local |
312 |
val choice_const = (fst o dest_Const o HOLogic.choice_const) Term.dummyT |
|
313 |
fun default c = const_prefix ^ lookup_const c |
|
314 |
in |
|
315 |
fun make_fixed_const _ @{const_name HOL.eq} = tptp_old_equal |
|
44754 | 316 |
| make_fixed_const (SOME (THF (_, _, THF_With_Choice))) c = |
317 |
if c = choice_const then tptp_choice else default c |
|
44587 | 318 |
| make_fixed_const _ c = default c |
319 |
end |
|
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
320 |
|
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
321 |
fun make_fixed_type_const c = type_const_prefix ^ lookup_const c |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
322 |
|
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
323 |
fun make_type_class clas = class_prefix ^ ascii_of clas |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
324 |
|
43093 | 325 |
fun new_skolem_var_name_from_const s = |
326 |
let val ss = s |> space_explode Long_Name.separator in |
|
327 |
nth ss (length ss - 2) |
|
328 |
end |
|
329 |
||
43248
69375eaa9016
more suitable implementation of "schematic_consts_of" for monomorphizer, for ATPs
blanchet
parents:
43222
diff
changeset
|
330 |
(* These are either simplified away by "Meson.presimplify" (most of the time) or |
69375eaa9016
more suitable implementation of "schematic_consts_of" for monomorphizer, for ATPs
blanchet
parents:
43222
diff
changeset
|
331 |
handled specially via "fFalse", "fTrue", ..., "fequal". *) |
69375eaa9016
more suitable implementation of "schematic_consts_of" for monomorphizer, for ATPs
blanchet
parents:
43222
diff
changeset
|
332 |
val atp_irrelevant_consts = |
69375eaa9016
more suitable implementation of "schematic_consts_of" for monomorphizer, for ATPs
blanchet
parents:
43222
diff
changeset
|
333 |
[@{const_name False}, @{const_name True}, @{const_name Not}, |
69375eaa9016
more suitable implementation of "schematic_consts_of" for monomorphizer, for ATPs
blanchet
parents:
43222
diff
changeset
|
334 |
@{const_name conj}, @{const_name disj}, @{const_name implies}, |
69375eaa9016
more suitable implementation of "schematic_consts_of" for monomorphizer, for ATPs
blanchet
parents:
43222
diff
changeset
|
335 |
@{const_name HOL.eq}, @{const_name If}, @{const_name Let}] |
69375eaa9016
more suitable implementation of "schematic_consts_of" for monomorphizer, for ATPs
blanchet
parents:
43222
diff
changeset
|
336 |
|
69375eaa9016
more suitable implementation of "schematic_consts_of" for monomorphizer, for ATPs
blanchet
parents:
43222
diff
changeset
|
337 |
val atp_monomorph_bad_consts = |
69375eaa9016
more suitable implementation of "schematic_consts_of" for monomorphizer, for ATPs
blanchet
parents:
43222
diff
changeset
|
338 |
atp_irrelevant_consts @ |
69375eaa9016
more suitable implementation of "schematic_consts_of" for monomorphizer, for ATPs
blanchet
parents:
43222
diff
changeset
|
339 |
(* These are ignored anyway by the relevance filter (unless they appear in |
69375eaa9016
more suitable implementation of "schematic_consts_of" for monomorphizer, for ATPs
blanchet
parents:
43222
diff
changeset
|
340 |
higher-order places) but not by the monomorphizer. *) |
69375eaa9016
more suitable implementation of "schematic_consts_of" for monomorphizer, for ATPs
blanchet
parents:
43222
diff
changeset
|
341 |
[@{const_name all}, @{const_name "==>"}, @{const_name "=="}, |
69375eaa9016
more suitable implementation of "schematic_consts_of" for monomorphizer, for ATPs
blanchet
parents:
43222
diff
changeset
|
342 |
@{const_name Trueprop}, @{const_name All}, @{const_name Ex}, |
69375eaa9016
more suitable implementation of "schematic_consts_of" for monomorphizer, for ATPs
blanchet
parents:
43222
diff
changeset
|
343 |
@{const_name Ex1}, @{const_name Ball}, @{const_name Bex}] |
69375eaa9016
more suitable implementation of "schematic_consts_of" for monomorphizer, for ATPs
blanchet
parents:
43222
diff
changeset
|
344 |
|
43258
956895f99904
slightly faster/cleaner accumulation of polymorphic consts
blanchet
parents:
43248
diff
changeset
|
345 |
fun add_schematic_const (x as (_, T)) = |
956895f99904
slightly faster/cleaner accumulation of polymorphic consts
blanchet
parents:
43248
diff
changeset
|
346 |
Monomorph.typ_has_tvars T ? Symtab.insert_list (op =) x |
956895f99904
slightly faster/cleaner accumulation of polymorphic consts
blanchet
parents:
43248
diff
changeset
|
347 |
val add_schematic_consts_of = |
956895f99904
slightly faster/cleaner accumulation of polymorphic consts
blanchet
parents:
43248
diff
changeset
|
348 |
Term.fold_aterms (fn Const (x as (s, _)) => |
956895f99904
slightly faster/cleaner accumulation of polymorphic consts
blanchet
parents:
43248
diff
changeset
|
349 |
not (member (op =) atp_monomorph_bad_consts s) |
956895f99904
slightly faster/cleaner accumulation of polymorphic consts
blanchet
parents:
43248
diff
changeset
|
350 |
? add_schematic_const x |
956895f99904
slightly faster/cleaner accumulation of polymorphic consts
blanchet
parents:
43248
diff
changeset
|
351 |
| _ => I) |
956895f99904
slightly faster/cleaner accumulation of polymorphic consts
blanchet
parents:
43248
diff
changeset
|
352 |
fun atp_schematic_consts_of t = add_schematic_consts_of t Symtab.empty |
43248
69375eaa9016
more suitable implementation of "schematic_consts_of" for monomorphizer, for ATPs
blanchet
parents:
43222
diff
changeset
|
353 |
|
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
354 |
(** Definitions and functions for FOL clauses and formulas for TPTP **) |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
355 |
|
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
356 |
(** Isabelle arities **) |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
357 |
|
44625 | 358 |
type arity_atom = name * name * name list |
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
359 |
|
43263 | 360 |
val type_class = the_single @{sort type} |
361 |
||
43086 | 362 |
type arity_clause = |
43496
92f5a4c78b37
remove historical bloat -- another benefit of merging Metis's and Sledgehammer's translations
blanchet
parents:
43495
diff
changeset
|
363 |
{name : string, |
44625 | 364 |
prem_atoms : arity_atom list, |
365 |
concl_atom : arity_atom} |
|
366 |
||
367 |
fun add_prem_atom tvar = |
|
368 |
fold (fn s => s <> type_class ? cons (`make_type_class s, `I tvar, [])) |
|
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
369 |
|
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
370 |
(* Arity of type constructor "tcon :: (arg1, ..., argN) res" *) |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
371 |
fun make_axiom_arity_clause (tcons, name, (cls, args)) = |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
372 |
let |
44595
444d111bde7d
generate properly typed TFF1 (PFF) problems in the presence of type class predicates
blanchet
parents:
44594
diff
changeset
|
373 |
val tvars = map (prefix tvar_prefix o string_of_int) (1 upto length args) |
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
374 |
val tvars_srts = ListPair.zip (tvars, args) |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
375 |
in |
43086 | 376 |
{name = name, |
44625 | 377 |
prem_atoms = [] |> fold (uncurry add_prem_atom) tvars_srts, |
378 |
concl_atom = (`make_type_class cls, `make_fixed_type_const tcons, |
|
379 |
tvars ~~ tvars)} |
|
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
380 |
end |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
381 |
|
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
382 |
fun arity_clause _ _ (_, []) = [] |
43495 | 383 |
| arity_clause seen n (tcons, ("HOL.type", _) :: ars) = (* ignore *) |
384 |
arity_clause seen n (tcons, ars) |
|
385 |
| arity_clause seen n (tcons, (ar as (class, _)) :: ars) = |
|
386 |
if member (op =) seen class then |
|
387 |
(* multiple arities for the same (tycon, class) pair *) |
|
388 |
make_axiom_arity_clause (tcons, |
|
389 |
lookup_const tcons ^ "___" ^ ascii_of class ^ "_" ^ string_of_int n, |
|
390 |
ar) :: |
|
391 |
arity_clause seen (n + 1) (tcons, ars) |
|
392 |
else |
|
393 |
make_axiom_arity_clause (tcons, lookup_const tcons ^ "___" ^ |
|
394 |
ascii_of class, ar) :: |
|
395 |
arity_clause (class :: seen) n (tcons, ars) |
|
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
396 |
|
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
397 |
fun multi_arity_clause [] = [] |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
398 |
| multi_arity_clause ((tcons, ars) :: tc_arlists) = |
44772 | 399 |
arity_clause [] 1 (tcons, ars) @ multi_arity_clause tc_arlists |
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
400 |
|
43622 | 401 |
(* Generate all pairs (tycon, class, sorts) such that tycon belongs to class in |
402 |
theory thy provided its arguments have the corresponding sorts. *) |
|
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
403 |
fun type_class_pairs thy tycons classes = |
43093 | 404 |
let |
405 |
val alg = Sign.classes_of thy |
|
406 |
fun domain_sorts tycon = Sorts.mg_domain alg tycon o single |
|
407 |
fun add_class tycon class = |
|
408 |
cons (class, domain_sorts tycon class) |
|
409 |
handle Sorts.CLASS_ERROR _ => I |
|
410 |
fun try_classes tycon = (tycon, fold (add_class tycon) classes []) |
|
411 |
in map try_classes tycons end |
|
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
412 |
|
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
413 |
(*Proving one (tycon, class) membership may require proving others, so iterate.*) |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
414 |
fun iter_type_class_pairs _ _ [] = ([], []) |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
415 |
| iter_type_class_pairs thy tycons classes = |
43263 | 416 |
let |
417 |
fun maybe_insert_class s = |
|
418 |
(s <> type_class andalso not (member (op =) classes s)) |
|
419 |
? insert (op =) s |
|
420 |
val cpairs = type_class_pairs thy tycons classes |
|
421 |
val newclasses = |
|
422 |
[] |> fold (fold (fold (fold maybe_insert_class) o snd) o snd) cpairs |
|
423 |
val (classes', cpairs') = iter_type_class_pairs thy tycons newclasses |
|
43266 | 424 |
in (classes' @ classes, union (op =) cpairs' cpairs) end |
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
425 |
|
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
426 |
fun make_arity_clauses thy tycons = |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
427 |
iter_type_class_pairs thy tycons ##> multi_arity_clause |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
428 |
|
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
429 |
|
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
430 |
(** Isabelle class relations **) |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
431 |
|
43086 | 432 |
type class_rel_clause = |
43496
92f5a4c78b37
remove historical bloat -- another benefit of merging Metis's and Sledgehammer's translations
blanchet
parents:
43495
diff
changeset
|
433 |
{name : string, |
92f5a4c78b37
remove historical bloat -- another benefit of merging Metis's and Sledgehammer's translations
blanchet
parents:
43495
diff
changeset
|
434 |
subclass : name, |
92f5a4c78b37
remove historical bloat -- another benefit of merging Metis's and Sledgehammer's translations
blanchet
parents:
43495
diff
changeset
|
435 |
superclass : name} |
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
436 |
|
43622 | 437 |
(* Generate all pairs (sub, super) such that sub is a proper subclass of super |
438 |
in theory "thy". *) |
|
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
439 |
fun class_pairs _ [] _ = [] |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
440 |
| class_pairs thy subs supers = |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
441 |
let |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
442 |
val class_less = Sorts.class_less (Sign.classes_of thy) |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
443 |
fun add_super sub super = class_less (sub, super) ? cons (sub, super) |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
444 |
fun add_supers sub = fold (add_super sub) supers |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
445 |
in fold add_supers subs [] end |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
446 |
|
43622 | 447 |
fun make_class_rel_clause (sub, super) = |
448 |
{name = sub ^ "_" ^ super, subclass = `make_type_class sub, |
|
43086 | 449 |
superclass = `make_type_class super} |
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
450 |
|
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
451 |
fun make_class_rel_clauses thy subs supers = |
43093 | 452 |
map make_class_rel_clause (class_pairs thy subs supers) |
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
453 |
|
43859 | 454 |
(* intermediate terms *) |
455 |
datatype iterm = |
|
456 |
IConst of name * typ * typ list | |
|
457 |
IVar of name * typ | |
|
458 |
IApp of iterm * iterm | |
|
459 |
IAbs of (name * typ) * iterm |
|
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
460 |
|
43859 | 461 |
fun ityp_of (IConst (_, T, _)) = T |
462 |
| ityp_of (IVar (_, T)) = T |
|
463 |
| ityp_of (IApp (t1, _)) = snd (dest_funT (ityp_of t1)) |
|
464 |
| ityp_of (IAbs ((_, T), tm)) = T --> ityp_of tm |
|
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
465 |
|
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
466 |
(*gets the head of a combinator application, along with the list of arguments*) |
43859 | 467 |
fun strip_iterm_comb u = |
43496
92f5a4c78b37
remove historical bloat -- another benefit of merging Metis's and Sledgehammer's translations
blanchet
parents:
43495
diff
changeset
|
468 |
let |
43859 | 469 |
fun stripc (IApp (t, u), ts) = stripc (t, u :: ts) |
43496
92f5a4c78b37
remove historical bloat -- another benefit of merging Metis's and Sledgehammer's translations
blanchet
parents:
43495
diff
changeset
|
470 |
| stripc x = x |
92f5a4c78b37
remove historical bloat -- another benefit of merging Metis's and Sledgehammer's translations
blanchet
parents:
43495
diff
changeset
|
471 |
in stripc (u, []) end |
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
472 |
|
45316
08d84bdd5b37
improve handling of bound type variables (esp. for TFF1)
blanchet
parents:
45315
diff
changeset
|
473 |
fun atomic_types_of T = fold_atyps (insert (op =)) T [] |
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
474 |
|
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
475 |
fun new_skolem_const_name s num_T_args = |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
476 |
[new_skolem_const_prefix, s, string_of_int num_T_args] |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
477 |
|> space_implode Long_Name.separator |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
478 |
|
44594
ae82943481e9
added type abstractions (for declaring polymorphic constants) to TFF syntax
blanchet
parents:
44593
diff
changeset
|
479 |
fun robust_const_type thy s = |
ae82943481e9
added type abstractions (for declaring polymorphic constants) to TFF syntax
blanchet
parents:
44593
diff
changeset
|
480 |
if s = app_op_name then Logic.varifyT_global @{typ "('a => 'b) => 'a => 'b"} |
ae82943481e9
added type abstractions (for declaring polymorphic constants) to TFF syntax
blanchet
parents:
44593
diff
changeset
|
481 |
else s |> Sign.the_const_type thy |
ae82943481e9
added type abstractions (for declaring polymorphic constants) to TFF syntax
blanchet
parents:
44593
diff
changeset
|
482 |
|
ae82943481e9
added type abstractions (for declaring polymorphic constants) to TFF syntax
blanchet
parents:
44593
diff
changeset
|
483 |
(* This function only makes sense if "T" is as general as possible. *) |
ae82943481e9
added type abstractions (for declaring polymorphic constants) to TFF syntax
blanchet
parents:
44593
diff
changeset
|
484 |
fun robust_const_typargs thy (s, T) = |
ae82943481e9
added type abstractions (for declaring polymorphic constants) to TFF syntax
blanchet
parents:
44593
diff
changeset
|
485 |
(s, T) |> Sign.const_typargs thy |
ae82943481e9
added type abstractions (for declaring polymorphic constants) to TFF syntax
blanchet
parents:
44593
diff
changeset
|
486 |
handle TYPE _ => [] |> Term.add_tvarsT T |> rev |> map TVar |
ae82943481e9
added type abstractions (for declaring polymorphic constants) to TFF syntax
blanchet
parents:
44593
diff
changeset
|
487 |
|
43859 | 488 |
(* Converts an Isabelle/HOL term (with combinators) into an intermediate term. |
489 |
Also accumulates sort infomation. *) |
|
44495 | 490 |
fun iterm_from_term thy format bs (P $ Q) = |
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
491 |
let |
44495 | 492 |
val (P', P_atomics_Ts) = iterm_from_term thy format bs P |
493 |
val (Q', Q_atomics_Ts) = iterm_from_term thy format bs Q |
|
43859 | 494 |
in (IApp (P', Q'), union (op =) P_atomics_Ts Q_atomics_Ts) end |
44495 | 495 |
| iterm_from_term thy format _ (Const (c, T)) = |
496 |
(IConst (`(make_fixed_const (SOME format)) c, T, |
|
44594
ae82943481e9
added type abstractions (for declaring polymorphic constants) to TFF syntax
blanchet
parents:
44593
diff
changeset
|
497 |
robust_const_typargs thy (c, T)), |
45316
08d84bdd5b37
improve handling of bound type variables (esp. for TFF1)
blanchet
parents:
45315
diff
changeset
|
498 |
atomic_types_of T) |
44495 | 499 |
| iterm_from_term _ _ _ (Free (s, T)) = |
43907
073ab5379842
pass type arguments to lambda-lifted Frees, to account for polymorphism
blanchet
parents:
43906
diff
changeset
|
500 |
(IConst (`make_fixed_var s, T, |
45508 | 501 |
if String.isPrefix lambda_lifted_poly_prefix s then [T] else []), |
45316
08d84bdd5b37
improve handling of bound type variables (esp. for TFF1)
blanchet
parents:
45315
diff
changeset
|
502 |
atomic_types_of T) |
44495 | 503 |
| iterm_from_term _ format _ (Var (v as (s, _), T)) = |
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
504 |
(if String.isPrefix Meson_Clausify.new_skolem_var_prefix s then |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
505 |
let |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
506 |
val Ts = T |> strip_type |> swap |> op :: |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
507 |
val s' = new_skolem_const_name s (length Ts) |
44495 | 508 |
in IConst (`(make_fixed_const (SOME format)) s', T, Ts) end |
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
509 |
else |
45316
08d84bdd5b37
improve handling of bound type variables (esp. for TFF1)
blanchet
parents:
45315
diff
changeset
|
510 |
IVar ((make_schematic_var v, s), T), atomic_types_of T) |
44495 | 511 |
| iterm_from_term _ _ bs (Bound j) = |
45316
08d84bdd5b37
improve handling of bound type variables (esp. for TFF1)
blanchet
parents:
45315
diff
changeset
|
512 |
nth bs j |> (fn (_, (name, T)) => (IConst (name, T, []), atomic_types_of T)) |
44495 | 513 |
| iterm_from_term thy format bs (Abs (s, T, t)) = |
43678 | 514 |
let |
515 |
fun vary s = s |> AList.defined (op =) bs s ? vary o Symbol.bump_string |
|
516 |
val s = vary s |
|
44403
15160cdc4688
precisely distinguish between universal and existential quantifiers, instead of assuming the worst (universal), for monotonicity analysis
blanchet
parents:
44402
diff
changeset
|
517 |
val name = `make_bound_var s |
44495 | 518 |
val (tm, atomic_Ts) = iterm_from_term thy format ((s, (name, T)) :: bs) t |
45316
08d84bdd5b37
improve handling of bound type variables (esp. for TFF1)
blanchet
parents:
45315
diff
changeset
|
519 |
in (IAbs ((name, T), tm), union (op =) atomic_Ts (atomic_types_of T)) end |
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
520 |
|
43421 | 521 |
datatype locality = |
44783 | 522 |
General | Helper | Induction | Intro | Elim | Simp | Local | Assum | Chained |
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
523 |
|
43624
de026aecab9b
cleaner handling of higher-order simple types, so that it's also possible to use first-order simple types with LEO-II and company
blanchet
parents:
43623
diff
changeset
|
524 |
datatype order = First_Order | Higher_Order |
44494
a77901b3774e
rationalized option names -- mono becomes raw_mono and mangled becomes mono
blanchet
parents:
44493
diff
changeset
|
525 |
datatype polymorphism = Polymorphic | Raw_Monomorphic | Mangled_Monomorphic |
45299
ee584ff987c3
check "sound" flag before doing something unsound...
blanchet
parents:
45202
diff
changeset
|
526 |
datatype soundness = Sound_Modulo_Infinity | Sound |
44811 | 527 |
datatype granularity = All_Vars | Positively_Naked_Vars | Ghost_Type_Arg_Vars |
42613
23b13b1bd565
use strings to encode type systems in ATP module, to reduce the amount of out-of-place information and also to make it easier to print the type system used
blanchet
parents:
42612
diff
changeset
|
528 |
datatype type_level = |
44397
06375952f1fa
cleaner handling of polymorphic monotonicity inference
blanchet
parents:
44396
diff
changeset
|
529 |
All_Types | |
44811 | 530 |
Noninf_Nonmono_Types of soundness * granularity | |
531 |
Fin_Nonmono_Types of granularity | |
|
44397
06375952f1fa
cleaner handling of polymorphic monotonicity inference
blanchet
parents:
44396
diff
changeset
|
532 |
Const_Arg_Types | |
43362 | 533 |
No_Types |
42613
23b13b1bd565
use strings to encode type systems in ATP module, to reduce the amount of out-of-place information and also to make it easier to print the type system used
blanchet
parents:
42612
diff
changeset
|
534 |
|
43626
a867ebb12209
renamed "type_sys" to "type_enc", which is more accurate
blanchet
parents:
43624
diff
changeset
|
535 |
datatype type_enc = |
44591
0b107d11f634
extended simple types with polymorphism -- the implementation still needs some work though
blanchet
parents:
44589
diff
changeset
|
536 |
Simple_Types of order * polymorphism * type_level | |
44768 | 537 |
Guards of polymorphism * type_level | |
538 |
Tags of polymorphism * type_level |
|
539 |
||
540 |
fun is_type_enc_higher_order (Simple_Types (Higher_Order, _, _)) = true |
|
541 |
| is_type_enc_higher_order _ = false |
|
542 |
||
543 |
fun polymorphism_of_type_enc (Simple_Types (_, poly, _)) = poly |
|
544 |
| polymorphism_of_type_enc (Guards (poly, _)) = poly |
|
545 |
| polymorphism_of_type_enc (Tags (poly, _)) = poly |
|
546 |
||
547 |
fun level_of_type_enc (Simple_Types (_, _, level)) = level |
|
548 |
| level_of_type_enc (Guards (_, level)) = level |
|
549 |
| level_of_type_enc (Tags (_, level)) = level |
|
550 |
||
44811 | 551 |
fun granularity_of_type_level (Noninf_Nonmono_Types (_, grain)) = grain |
552 |
| granularity_of_type_level (Fin_Nonmono_Types grain) = grain |
|
553 |
| granularity_of_type_level _ = All_Vars |
|
44768 | 554 |
|
555 |
fun is_type_level_quasi_sound All_Types = true |
|
556 |
| is_type_level_quasi_sound (Noninf_Nonmono_Types _) = true |
|
557 |
| is_type_level_quasi_sound _ = false |
|
558 |
val is_type_enc_quasi_sound = is_type_level_quasi_sound o level_of_type_enc |
|
559 |
||
560 |
fun is_type_level_fairly_sound (Fin_Nonmono_Types _) = true |
|
561 |
| is_type_level_fairly_sound level = is_type_level_quasi_sound level |
|
562 |
val is_type_enc_fairly_sound = is_type_level_fairly_sound o level_of_type_enc |
|
563 |
||
564 |
fun is_type_level_monotonicity_based (Noninf_Nonmono_Types _) = true |
|
565 |
| is_type_level_monotonicity_based (Fin_Nonmono_Types _) = true |
|
566 |
| is_type_level_monotonicity_based _ = false |
|
42613
23b13b1bd565
use strings to encode type systems in ATP module, to reduce the amount of out-of-place information and also to make it easier to print the type system used
blanchet
parents:
42612
diff
changeset
|
567 |
|
44785 | 568 |
(* "_query", "_bang", and "_at" are for the ASCII-challenged Metis and |
569 |
Mirabelle. *) |
|
570 |
val queries = ["?", "_query"] |
|
571 |
val bangs = ["!", "_bang"] |
|
572 |
val ats = ["@", "_at"] |
|
573 |
||
42689
e38590764c34
versions of ! and ? for the ASCII-challenged Mirabelle
blanchet
parents:
42688
diff
changeset
|
574 |
fun try_unsuffixes ss s = |
e38590764c34
versions of ! and ? for the ASCII-challenged Mirabelle
blanchet
parents:
42688
diff
changeset
|
575 |
fold (fn s' => fn NONE => try (unsuffix s') s | some => some) ss NONE |
e38590764c34
versions of ! and ? for the ASCII-challenged Mirabelle
blanchet
parents:
42688
diff
changeset
|
576 |
|
44785 | 577 |
fun try_nonmono constr suffixes fallback s = |
578 |
case try_unsuffixes suffixes s of |
|
579 |
SOME s => |
|
580 |
(case try_unsuffixes suffixes s of |
|
44811 | 581 |
SOME s => (constr Positively_Naked_Vars, s) |
44785 | 582 |
| NONE => |
583 |
case try_unsuffixes ats s of |
|
44811 | 584 |
SOME s => (constr Ghost_Type_Arg_Vars, s) |
585 |
| NONE => (constr All_Vars, s)) |
|
44785 | 586 |
| NONE => fallback s |
44768 | 587 |
|
44811 | 588 |
fun is_incompatible_type_level poly level = |
589 |
poly = Mangled_Monomorphic andalso |
|
590 |
granularity_of_type_level level = Ghost_Type_Arg_Vars |
|
44810 | 591 |
|
44397
06375952f1fa
cleaner handling of polymorphic monotonicity inference
blanchet
parents:
44396
diff
changeset
|
592 |
fun type_enc_from_string soundness s = |
42722 | 593 |
(case try (unprefix "poly_") s of |
594 |
SOME s => (SOME Polymorphic, s) |
|
42613
23b13b1bd565
use strings to encode type systems in ATP module, to reduce the amount of out-of-place information and also to make it easier to print the type system used
blanchet
parents:
42612
diff
changeset
|
595 |
| NONE => |
44494
a77901b3774e
rationalized option names -- mono becomes raw_mono and mangled becomes mono
blanchet
parents:
44493
diff
changeset
|
596 |
case try (unprefix "raw_mono_") s of |
a77901b3774e
rationalized option names -- mono becomes raw_mono and mangled becomes mono
blanchet
parents:
44493
diff
changeset
|
597 |
SOME s => (SOME Raw_Monomorphic, s) |
42722 | 598 |
| NONE => |
44494
a77901b3774e
rationalized option names -- mono becomes raw_mono and mangled becomes mono
blanchet
parents:
44493
diff
changeset
|
599 |
case try (unprefix "mono_") s of |
42722 | 600 |
SOME s => (SOME Mangled_Monomorphic, s) |
601 |
| NONE => (NONE, s)) |
|
44785 | 602 |
||> (pair All_Types |
603 |
|> try_nonmono Fin_Nonmono_Types bangs |
|
604 |
|> try_nonmono (curry Noninf_Nonmono_Types soundness) queries) |
|
44768 | 605 |
|> (fn (poly, (level, core)) => |
606 |
case (core, (poly, level)) of |
|
607 |
("simple", (SOME poly, _)) => |
|
44742 | 608 |
(case (poly, level) of |
609 |
(Polymorphic, All_Types) => |
|
610 |
Simple_Types (First_Order, Polymorphic, All_Types) |
|
611 |
| (Mangled_Monomorphic, _) => |
|
44811 | 612 |
if granularity_of_type_level level = All_Vars then |
44768 | 613 |
Simple_Types (First_Order, Mangled_Monomorphic, level) |
614 |
else |
|
615 |
raise Same.SAME |
|
44742 | 616 |
| _ => raise Same.SAME) |
44768 | 617 |
| ("simple_higher", (SOME poly, _)) => |
44591
0b107d11f634
extended simple types with polymorphism -- the implementation still needs some work though
blanchet
parents:
44589
diff
changeset
|
618 |
(case (poly, level) of |
44754 | 619 |
(Polymorphic, All_Types) => |
620 |
Simple_Types (Higher_Order, Polymorphic, All_Types) |
|
621 |
| (_, Noninf_Nonmono_Types _) => raise Same.SAME |
|
44742 | 622 |
| (Mangled_Monomorphic, _) => |
44811 | 623 |
if granularity_of_type_level level = All_Vars then |
44768 | 624 |
Simple_Types (Higher_Order, Mangled_Monomorphic, level) |
625 |
else |
|
626 |
raise Same.SAME |
|
44742 | 627 |
| _ => raise Same.SAME) |
44810 | 628 |
| ("guards", (SOME poly, _)) => |
44811 | 629 |
if is_incompatible_type_level poly level then raise Same.SAME |
44810 | 630 |
else Guards (poly, level) |
631 |
| ("tags", (SOME poly, _)) => |
|
44811 | 632 |
if is_incompatible_type_level poly level then raise Same.SAME |
44810 | 633 |
else Tags (poly, level) |
44768 | 634 |
| ("args", (SOME poly, All_Types (* naja *))) => |
635 |
Guards (poly, Const_Arg_Types) |
|
636 |
| ("erased", (NONE, All_Types (* naja *))) => |
|
637 |
Guards (Polymorphic, No_Types) |
|
42753
c9552e617acc
drop some type arguments to constants in unsound type systems + remove a few type systems that make no sense from the circulation
blanchet
parents:
42750
diff
changeset
|
638 |
| _ => raise Same.SAME) |
44785 | 639 |
handle Same.SAME => error ("Unknown type encoding: " ^ quote s ^ ".") |
42613
23b13b1bd565
use strings to encode type systems in ATP module, to reduce the amount of out-of-place information and also to make it easier to print the type system used
blanchet
parents:
42612
diff
changeset
|
640 |
|
44754 | 641 |
fun adjust_type_enc (THF (TPTP_Monomorphic, _, _)) |
642 |
(Simple_Types (order, _, level)) = |
|
44591
0b107d11f634
extended simple types with polymorphism -- the implementation still needs some work though
blanchet
parents:
44589
diff
changeset
|
643 |
Simple_Types (order, Mangled_Monomorphic, level) |
44754 | 644 |
| adjust_type_enc (THF _) type_enc = type_enc |
645 |
| adjust_type_enc (TFF (TPTP_Monomorphic, _)) (Simple_Types (_, _, level)) = |
|
44591
0b107d11f634
extended simple types with polymorphism -- the implementation still needs some work though
blanchet
parents:
44589
diff
changeset
|
646 |
Simple_Types (First_Order, Mangled_Monomorphic, level) |
45303
bd03b08161ac
added DFG unsorted support (like in the old days)
blanchet
parents:
45301
diff
changeset
|
647 |
| adjust_type_enc (DFG DFG_Sorted) (Simple_Types (_, _, level)) = |
45301
866b075aa99b
added sorted DFG output for coming version of SPASS
blanchet
parents:
45299
diff
changeset
|
648 |
Simple_Types (First_Order, Mangled_Monomorphic, level) |
44754 | 649 |
| adjust_type_enc (TFF _) (Simple_Types (_, poly, level)) = |
44591
0b107d11f634
extended simple types with polymorphism -- the implementation still needs some work though
blanchet
parents:
44589
diff
changeset
|
650 |
Simple_Types (First_Order, poly, level) |
0b107d11f634
extended simple types with polymorphism -- the implementation still needs some work though
blanchet
parents:
44589
diff
changeset
|
651 |
| adjust_type_enc format (Simple_Types (_, poly, level)) = |
44768 | 652 |
adjust_type_enc format (Guards (poly, level)) |
44416
cabd06b69c18
added formats to the slice and use TFF for remote Vampire
blanchet
parents:
44410
diff
changeset
|
653 |
| adjust_type_enc CNF_UEQ (type_enc as Guards stuff) = |
cabd06b69c18
added formats to the slice and use TFF for remote Vampire
blanchet
parents:
44410
diff
changeset
|
654 |
(if is_type_enc_fairly_sound type_enc then Tags else Guards) stuff |
cabd06b69c18
added formats to the slice and use TFF for remote Vampire
blanchet
parents:
44410
diff
changeset
|
655 |
| adjust_type_enc _ type_enc = type_enc |
43101
1d46d85cd78b
make "prepare_atp_problem" more robust w.r.t. choice of type system
blanchet
parents:
43098
diff
changeset
|
656 |
|
44088
3693baa6befb
move lambda-lifting code to ATP encoding, so it can be used by Metis
blanchet
parents:
44003
diff
changeset
|
657 |
fun lift_lambdas ctxt type_enc = |
3693baa6befb
move lambda-lifting code to ATP encoding, so it can be used by Metis
blanchet
parents:
44003
diff
changeset
|
658 |
map (close_form o Envir.eta_contract) #> rpair ctxt |
3693baa6befb
move lambda-lifting code to ATP encoding, so it can be used by Metis
blanchet
parents:
44003
diff
changeset
|
659 |
#-> Lambda_Lifting.lift_lambdas |
45508 | 660 |
(SOME (if polymorphism_of_type_enc type_enc = Polymorphic then |
661 |
lambda_lifted_poly_prefix |
|
662 |
else |
|
663 |
lambda_lifted_prefix)) |
|
44088
3693baa6befb
move lambda-lifting code to ATP encoding, so it can be used by Metis
blanchet
parents:
44003
diff
changeset
|
664 |
Lambda_Lifting.is_quantifier |
3693baa6befb
move lambda-lifting code to ATP encoding, so it can be used by Metis
blanchet
parents:
44003
diff
changeset
|
665 |
#> fst |
3693baa6befb
move lambda-lifting code to ATP encoding, so it can be used by Metis
blanchet
parents:
44003
diff
changeset
|
666 |
|
3693baa6befb
move lambda-lifting code to ATP encoding, so it can be used by Metis
blanchet
parents:
44003
diff
changeset
|
667 |
fun intentionalize_def (Const (@{const_name All}, _) $ Abs (_, _, t)) = |
3693baa6befb
move lambda-lifting code to ATP encoding, so it can be used by Metis
blanchet
parents:
44003
diff
changeset
|
668 |
intentionalize_def t |
3693baa6befb
move lambda-lifting code to ATP encoding, so it can be used by Metis
blanchet
parents:
44003
diff
changeset
|
669 |
| intentionalize_def (Const (@{const_name HOL.eq}, _) $ t $ u) = |
3693baa6befb
move lambda-lifting code to ATP encoding, so it can be used by Metis
blanchet
parents:
44003
diff
changeset
|
670 |
let |
3693baa6befb
move lambda-lifting code to ATP encoding, so it can be used by Metis
blanchet
parents:
44003
diff
changeset
|
671 |
fun lam T t = Abs (Name.uu, T, t) |
3693baa6befb
move lambda-lifting code to ATP encoding, so it can be used by Metis
blanchet
parents:
44003
diff
changeset
|
672 |
val (head, args) = strip_comb t ||> rev |
3693baa6befb
move lambda-lifting code to ATP encoding, so it can be used by Metis
blanchet
parents:
44003
diff
changeset
|
673 |
val head_T = fastype_of head |
3693baa6befb
move lambda-lifting code to ATP encoding, so it can be used by Metis
blanchet
parents:
44003
diff
changeset
|
674 |
val n = length args |
3693baa6befb
move lambda-lifting code to ATP encoding, so it can be used by Metis
blanchet
parents:
44003
diff
changeset
|
675 |
val arg_Ts = head_T |> binder_types |> take n |> rev |
3693baa6befb
move lambda-lifting code to ATP encoding, so it can be used by Metis
blanchet
parents:
44003
diff
changeset
|
676 |
val u = u |> subst_atomic (args ~~ map Bound (0 upto n - 1)) |
3693baa6befb
move lambda-lifting code to ATP encoding, so it can be used by Metis
blanchet
parents:
44003
diff
changeset
|
677 |
in HOLogic.eq_const head_T $ head $ fold lam arg_Ts u end |
3693baa6befb
move lambda-lifting code to ATP encoding, so it can be used by Metis
blanchet
parents:
44003
diff
changeset
|
678 |
| intentionalize_def t = t |
3693baa6befb
move lambda-lifting code to ATP encoding, so it can be used by Metis
blanchet
parents:
44003
diff
changeset
|
679 |
|
40114 | 680 |
type translated_formula = |
43496
92f5a4c78b37
remove historical bloat -- another benefit of merging Metis's and Sledgehammer's translations
blanchet
parents:
43495
diff
changeset
|
681 |
{name : string, |
92f5a4c78b37
remove historical bloat -- another benefit of merging Metis's and Sledgehammer's translations
blanchet
parents:
43495
diff
changeset
|
682 |
locality : locality, |
92f5a4c78b37
remove historical bloat -- another benefit of merging Metis's and Sledgehammer's translations
blanchet
parents:
43495
diff
changeset
|
683 |
kind : formula_kind, |
43859 | 684 |
iformula : (name, typ, iterm) formula, |
43496
92f5a4c78b37
remove historical bloat -- another benefit of merging Metis's and Sledgehammer's translations
blanchet
parents:
43495
diff
changeset
|
685 |
atomic_types : typ list} |
38282
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
686 |
|
43859 | 687 |
fun update_iformula f ({name, locality, kind, iformula, atomic_types} |
688 |
: translated_formula) = |
|
689 |
{name = name, locality = locality, kind = kind, iformula = f iformula, |
|
42562 | 690 |
atomic_types = atomic_types} : translated_formula |
42542
024920b65ce2
perform constant mangling and/or removal of its type args in an earlier phase, so that the rest of the code doesn't need to worry about it
blanchet
parents:
42541
diff
changeset
|
691 |
|
43859 | 692 |
fun fact_lift f ({iformula, ...} : translated_formula) = f iformula |
42558
3d9930cb6770
cleaned up "explicit_apply" so that it shares most of its code path with the default mode of operation
blanchet
parents:
42557
diff
changeset
|
693 |
|
43064
b6e61d22fa61
made "explicit_apply" smarter -- no need to force explicit applications in minimizer on all constants, better do it more fine granularly
blanchet
parents:
43039
diff
changeset
|
694 |
fun insert_type ctxt get_T x xs = |
b6e61d22fa61
made "explicit_apply" smarter -- no need to force explicit applications in minimizer on all constants, better do it more fine granularly
blanchet
parents:
43039
diff
changeset
|
695 |
let val T = get_T x in |
44399 | 696 |
if exists (type_instance ctxt T o get_T) xs then xs |
697 |
else x :: filter_out (type_generalization ctxt T o get_T) xs |
|
43064
b6e61d22fa61
made "explicit_apply" smarter -- no need to force explicit applications in minimizer on all constants, better do it more fine granularly
blanchet
parents:
43039
diff
changeset
|
698 |
end |
42677
25496cd3c199
monotonic type inference in ATP Sledgehammer problems -- based on Claessen & al.'s CADE 2011 paper, Sect. 2.3.
blanchet
parents:
42675
diff
changeset
|
699 |
|
42753
c9552e617acc
drop some type arguments to constants in unsound type systems + remove a few type systems that make no sense from the circulation
blanchet
parents:
42750
diff
changeset
|
700 |
(* The Booleans indicate whether all type arguments should be kept. *) |
c9552e617acc
drop some type arguments to constants in unsound type systems + remove a few type systems that make no sense from the circulation
blanchet
parents:
42750
diff
changeset
|
701 |
datatype type_arg_policy = |
c9552e617acc
drop some type arguments to constants in unsound type systems + remove a few type systems that make no sense from the circulation
blanchet
parents:
42750
diff
changeset
|
702 |
Explicit_Type_Args of bool | |
44771 | 703 |
Mangled_Type_Args | |
42753
c9552e617acc
drop some type arguments to constants in unsound type systems + remove a few type systems that make no sense from the circulation
blanchet
parents:
42750
diff
changeset
|
704 |
No_Type_Args |
41136
30bedf58b177
implemented new type system encoding "overload_args", which is more lightweight than "const_args" (the unsound default) and hopefully almost as sound
blanchet
parents:
41134
diff
changeset
|
705 |
|
43626
a867ebb12209
renamed "type_sys" to "type_enc", which is more accurate
blanchet
parents:
43624
diff
changeset
|
706 |
fun type_arg_policy type_enc s = |
45315 | 707 |
let val poly = polymorphism_of_type_enc type_enc in |
44774
72785558a6ff
separate mangling, which can (and should) be done before the formulas are first-orderized, and type arg filtering, which must be done after once the min arities have been computed
blanchet
parents:
44773
diff
changeset
|
708 |
if s = type_tag_name then |
45315 | 709 |
if poly = Mangled_Monomorphic then Mangled_Type_Args |
710 |
else Explicit_Type_Args false |
|
44774
72785558a6ff
separate mangling, which can (and should) be done before the formulas are first-orderized, and type arg filtering, which must be done after once the min arities have been computed
blanchet
parents:
44773
diff
changeset
|
711 |
else case type_enc of |
45315 | 712 |
Simple_Types (_, Polymorphic, _) => Explicit_Type_Args false |
713 |
| Tags (_, All_Types) => No_Type_Args |
|
44774
72785558a6ff
separate mangling, which can (and should) be done before the formulas are first-orderized, and type arg filtering, which must be done after once the min arities have been computed
blanchet
parents:
44773
diff
changeset
|
714 |
| _ => |
72785558a6ff
separate mangling, which can (and should) be done before the formulas are first-orderized, and type arg filtering, which must be done after once the min arities have been computed
blanchet
parents:
44773
diff
changeset
|
715 |
let val level = level_of_type_enc type_enc in |
72785558a6ff
separate mangling, which can (and should) be done before the formulas are first-orderized, and type arg filtering, which must be done after once the min arities have been computed
blanchet
parents:
44773
diff
changeset
|
716 |
if level = No_Types orelse s = @{const_name HOL.eq} orelse |
72785558a6ff
separate mangling, which can (and should) be done before the formulas are first-orderized, and type arg filtering, which must be done after once the min arities have been computed
blanchet
parents:
44773
diff
changeset
|
717 |
(s = app_op_name andalso level = Const_Arg_Types) then |
72785558a6ff
separate mangling, which can (and should) be done before the formulas are first-orderized, and type arg filtering, which must be done after once the min arities have been computed
blanchet
parents:
44773
diff
changeset
|
718 |
No_Type_Args |
45315 | 719 |
else if poly = Mangled_Monomorphic then |
44774
72785558a6ff
separate mangling, which can (and should) be done before the formulas are first-orderized, and type arg filtering, which must be done after once the min arities have been computed
blanchet
parents:
44773
diff
changeset
|
720 |
Mangled_Type_Args |
72785558a6ff
separate mangling, which can (and should) be done before the formulas are first-orderized, and type arg filtering, which must be done after once the min arities have been computed
blanchet
parents:
44773
diff
changeset
|
721 |
else |
44811 | 722 |
Explicit_Type_Args |
723 |
(level = All_Types orelse |
|
724 |
granularity_of_type_level level = Ghost_Type_Arg_Vars) |
|
44774
72785558a6ff
separate mangling, which can (and should) be done before the formulas are first-orderized, and type arg filtering, which must be done after once the min arities have been computed
blanchet
parents:
44773
diff
changeset
|
725 |
end |
72785558a6ff
separate mangling, which can (and should) be done before the formulas are first-orderized, and type arg filtering, which must be done after once the min arities have been computed
blanchet
parents:
44773
diff
changeset
|
726 |
end |
42227
662b50b7126f
if "monomorphize" is enabled, mangle the type information in the names by default
blanchet
parents:
42180
diff
changeset
|
727 |
|
44625 | 728 |
(* Make atoms for sorted type variables. *) |
43263 | 729 |
fun generic_add_sorts_on_type (_, []) = I |
730 |
| generic_add_sorts_on_type ((x, i), s :: ss) = |
|
731 |
generic_add_sorts_on_type ((x, i), ss) |
|
732 |
#> (if s = the_single @{sort HOL.type} then |
|
43093 | 733 |
I |
734 |
else if i = ~1 then |
|
44623 | 735 |
insert (op =) (`make_type_class s, `make_fixed_type_var x) |
43093 | 736 |
else |
44623 | 737 |
insert (op =) (`make_type_class s, |
738 |
(make_schematic_type_var (x, i), x))) |
|
43263 | 739 |
fun add_sorts_on_tfree (TFree (s, S)) = generic_add_sorts_on_type ((s, ~1), S) |
740 |
| add_sorts_on_tfree _ = I |
|
741 |
fun add_sorts_on_tvar (TVar z) = generic_add_sorts_on_type z |
|
742 |
| add_sorts_on_tvar _ = I |
|
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
743 |
|
44625 | 744 |
val tvar_a_str = "'a" |
745 |
val tvar_a = TVar ((tvar_a_str, 0), HOLogic.typeS) |
|
746 |
val tvar_a_name = (make_schematic_type_var (tvar_a_str, 0), tvar_a_str) |
|
747 |
val itself_name = `make_fixed_type_const @{type_name itself} |
|
748 |
val TYPE_name = `(make_fixed_const NONE) @{const_name TYPE} |
|
749 |
val tvar_a_atype = AType (tvar_a_name, []) |
|
750 |
val a_itself_atype = AType (itself_name, [tvar_a_atype]) |
|
751 |
||
752 |
fun type_class_formula type_enc class arg = |
|
753 |
AAtom (ATerm (class, arg :: |
|
754 |
(case type_enc of |
|
44754 | 755 |
Simple_Types (First_Order, Polymorphic, _) => |
45301
866b075aa99b
added sorted DFG output for coming version of SPASS
blanchet
parents:
45299
diff
changeset
|
756 |
if avoid_first_order_ghost_type_vars then [ATerm (TYPE_name, [arg])] |
44754 | 757 |
else [] |
44625 | 758 |
| _ => []))) |
759 |
fun formulas_for_types type_enc add_sorts_on_typ Ts = |
|
43626
a867ebb12209
renamed "type_sys" to "type_enc", which is more accurate
blanchet
parents:
43624
diff
changeset
|
760 |
[] |> level_of_type_enc type_enc <> No_Types ? fold add_sorts_on_typ Ts |
44625 | 761 |
|> map (fn (class, name) => |
762 |
type_class_formula type_enc class (ATerm (name, []))) |
|
41137
8b634031b2a5
implemented "no_types" encoding, which is too unsound to be useful but can come in handy for evaluations
blanchet
parents:
41136
diff
changeset
|
763 |
|
42534
46e690db16b8
fake type declarations for full-type args and mangled type encodings, so that type assumptions can be discharged
blanchet
parents:
42533
diff
changeset
|
764 |
fun mk_aconns c phis = |
46e690db16b8
fake type declarations for full-type args and mangled type encodings, so that type assumptions can be discharged
blanchet
parents:
42533
diff
changeset
|
765 |
let val (phis', phi') = split_last phis in |
46e690db16b8
fake type declarations for full-type args and mangled type encodings, so that type assumptions can be discharged
blanchet
parents:
42533
diff
changeset
|
766 |
fold_rev (mk_aconn c) phis' phi' |
46e690db16b8
fake type declarations for full-type args and mangled type encodings, so that type assumptions can be discharged
blanchet
parents:
42533
diff
changeset
|
767 |
end |
38282
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
768 |
fun mk_ahorn [] phi = phi |
42534
46e690db16b8
fake type declarations for full-type args and mangled type encodings, so that type assumptions can be discharged
blanchet
parents:
42533
diff
changeset
|
769 |
| mk_ahorn phis psi = AConn (AImplies, [mk_aconns AAnd phis, psi]) |
42522
413b56894f82
close ATP formulas universally earlier, so that we can add type predicates
blanchet
parents:
42521
diff
changeset
|
770 |
fun mk_aquant _ [] phi = phi |
413b56894f82
close ATP formulas universally earlier, so that we can add type predicates
blanchet
parents:
42521
diff
changeset
|
771 |
| mk_aquant q xs (phi as AQuant (q', xs', phi')) = |
413b56894f82
close ATP formulas universally earlier, so that we can add type predicates
blanchet
parents:
42521
diff
changeset
|
772 |
if q = q' then AQuant (q, xs @ xs', phi') else AQuant (q, xs, phi) |
413b56894f82
close ATP formulas universally earlier, so that we can add type predicates
blanchet
parents:
42521
diff
changeset
|
773 |
| mk_aquant q xs phi = AQuant (q, xs, phi) |
38282
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
774 |
|
45315 | 775 |
fun close_universally add_term_vars phi = |
41145
a5ee3b8e5a90
improve partially tagged encoding by adding a helper fact that coalesces consecutive "ti" tags
blanchet
parents:
41140
diff
changeset
|
776 |
let |
45315 | 777 |
fun add_formula_vars bounds (AQuant (_, xs, phi)) = |
778 |
add_formula_vars (map fst xs @ bounds) phi |
|
779 |
| add_formula_vars bounds (AConn (_, phis)) = |
|
780 |
fold (add_formula_vars bounds) phis |
|
781 |
| add_formula_vars bounds (AAtom tm) = add_term_vars bounds tm |
|
782 |
in mk_aquant AForall (add_formula_vars [] phi []) phi end |
|
42522
413b56894f82
close ATP formulas universally earlier, so that we can add type predicates
blanchet
parents:
42521
diff
changeset
|
783 |
|
45377 | 784 |
fun add_term_vars bounds (ATerm (name as (s, _), tms)) = |
785 |
(if is_tptp_variable s andalso |
|
786 |
not (String.isPrefix tvar_prefix s) andalso |
|
787 |
not (member (op =) bounds name) then |
|
788 |
insert (op =) (name, NONE) |
|
789 |
else |
|
790 |
I) |
|
791 |
#> fold (add_term_vars bounds) tms |
|
792 |
| add_term_vars bounds (AAbs ((name, _), tm)) = |
|
793 |
add_term_vars (name :: bounds) tm |
|
45401 | 794 |
fun close_formula_universally phi = close_universally add_term_vars phi |
45315 | 795 |
|
796 |
fun add_iterm_vars bounds (IApp (tm1, tm2)) = |
|
797 |
fold (add_iterm_vars bounds) [tm1, tm2] |
|
798 |
| add_iterm_vars _ (IConst _) = I |
|
799 |
| add_iterm_vars bounds (IVar (name, T)) = |
|
800 |
not (member (op =) bounds name) ? insert (op =) (name, SOME T) |
|
801 |
| add_iterm_vars bounds (IAbs (_, tm)) = add_iterm_vars bounds tm |
|
802 |
fun close_iformula_universally phi = close_universally add_iterm_vars phi |
|
41145
a5ee3b8e5a90
improve partially tagged encoding by adding a helper fact that coalesces consecutive "ti" tags
blanchet
parents:
41140
diff
changeset
|
803 |
|
44594
ae82943481e9
added type abstractions (for declaring polymorphic constants) to TFF syntax
blanchet
parents:
44593
diff
changeset
|
804 |
val fused_infinite_type_name = @{type_name ind} (* any infinite type *) |
ae82943481e9
added type abstractions (for declaring polymorphic constants) to TFF syntax
blanchet
parents:
44593
diff
changeset
|
805 |
val fused_infinite_type = Type (fused_infinite_type_name, []) |
ae82943481e9
added type abstractions (for declaring polymorphic constants) to TFF syntax
blanchet
parents:
44593
diff
changeset
|
806 |
|
ae82943481e9
added type abstractions (for declaring polymorphic constants) to TFF syntax
blanchet
parents:
44593
diff
changeset
|
807 |
fun tvar_name (x as (s, _)) = (make_schematic_type_var x, s) |
42994
fe291ab75eb5
towards supporting non-simply-typed encodings for TFF and THF (for orthogonality and experiments)
blanchet
parents:
42966
diff
changeset
|
808 |
|
43676
3b0b448b4d69
add support for lambdas in TPTP THF generator + killed an unsound type encoding (because the monotonicity calculus assumes first-order)
nik
parents:
43628
diff
changeset
|
809 |
fun ho_term_from_typ format type_enc = |
42994
fe291ab75eb5
towards supporting non-simply-typed encodings for TFF and THF (for orthogonality and experiments)
blanchet
parents:
42966
diff
changeset
|
810 |
let |
fe291ab75eb5
towards supporting non-simply-typed encodings for TFF and THF (for orthogonality and experiments)
blanchet
parents:
42966
diff
changeset
|
811 |
fun term (Type (s, Ts)) = |
43626
a867ebb12209
renamed "type_sys" to "type_enc", which is more accurate
blanchet
parents:
43624
diff
changeset
|
812 |
ATerm (case (is_type_enc_higher_order type_enc, s) of |
42994
fe291ab75eb5
towards supporting non-simply-typed encodings for TFF and THF (for orthogonality and experiments)
blanchet
parents:
42966
diff
changeset
|
813 |
(true, @{type_name bool}) => `I tptp_bool_type |
fe291ab75eb5
towards supporting non-simply-typed encodings for TFF and THF (for orthogonality and experiments)
blanchet
parents:
42966
diff
changeset
|
814 |
| (true, @{type_name fun}) => `I tptp_fun_type |
44594
ae82943481e9
added type abstractions (for declaring polymorphic constants) to TFF syntax
blanchet
parents:
44593
diff
changeset
|
815 |
| _ => if s = fused_infinite_type_name andalso |
44235
85e9dad3c187
distinguish THF syntax with and without choice (Satallax vs. LEO-II)
blanchet
parents:
44121
diff
changeset
|
816 |
is_format_typed format then |
43178
b5862142d378
use "" type only in THF and TFF -- might cause strange failures if used in FOF or CNF, depending on how liberal the prover is
blanchet
parents:
43175
diff
changeset
|
817 |
`I tptp_individual_type |
b5862142d378
use "" type only in THF and TFF -- might cause strange failures if used in FOF or CNF, depending on how liberal the prover is
blanchet
parents:
43175
diff
changeset
|
818 |
else |
b5862142d378
use "" type only in THF and TFF -- might cause strange failures if used in FOF or CNF, depending on how liberal the prover is
blanchet
parents:
43175
diff
changeset
|
819 |
`make_fixed_type_const s, |
42994
fe291ab75eb5
towards supporting non-simply-typed encodings for TFF and THF (for orthogonality and experiments)
blanchet
parents:
42966
diff
changeset
|
820 |
map term Ts) |
fe291ab75eb5
towards supporting non-simply-typed encodings for TFF and THF (for orthogonality and experiments)
blanchet
parents:
42966
diff
changeset
|
821 |
| term (TFree (s, _)) = ATerm (`make_fixed_type_var s, []) |
44594
ae82943481e9
added type abstractions (for declaring polymorphic constants) to TFF syntax
blanchet
parents:
44593
diff
changeset
|
822 |
| term (TVar (x, _)) = ATerm (tvar_name x, []) |
42994
fe291ab75eb5
towards supporting non-simply-typed encodings for TFF and THF (for orthogonality and experiments)
blanchet
parents:
42966
diff
changeset
|
823 |
in term end |
42562 | 824 |
|
43676
3b0b448b4d69
add support for lambdas in TPTP THF generator + killed an unsound type encoding (because the monotonicity calculus assumes first-order)
nik
parents:
43628
diff
changeset
|
825 |
fun ho_term_for_type_arg format type_enc T = |
3b0b448b4d69
add support for lambdas in TPTP THF generator + killed an unsound type encoding (because the monotonicity calculus assumes first-order)
nik
parents:
43628
diff
changeset
|
826 |
if T = dummyT then NONE else SOME (ho_term_from_typ format type_enc T) |
43401
e93dfcb53535
fixed soundness bug made more visible by previous change
blanchet
parents:
43399
diff
changeset
|
827 |
|
42562 | 828 |
(* This shouldn't clash with anything else. *) |
42542
024920b65ce2
perform constant mangling and/or removal of its type args in an earlier phase, so that the rest of the code doesn't need to worry about it
blanchet
parents:
42541
diff
changeset
|
829 |
val mangled_type_sep = "\000" |
024920b65ce2
perform constant mangling and/or removal of its type args in an earlier phase, so that the rest of the code doesn't need to worry about it
blanchet
parents:
42541
diff
changeset
|
830 |
|
42562 | 831 |
fun generic_mangled_type_name f (ATerm (name, [])) = f name |
832 |
| generic_mangled_type_name f (ATerm (name, tys)) = |
|
42761
8ea9c6fa8b53
fixed several bugs in Isar proof reconstruction, in particular w.r.t. mangled types and hAPP
blanchet
parents:
42755
diff
changeset
|
833 |
f name ^ "(" ^ space_implode "," (map (generic_mangled_type_name f) tys) |
8ea9c6fa8b53
fixed several bugs in Isar proof reconstruction, in particular w.r.t. mangled types and hAPP
blanchet
parents:
42755
diff
changeset
|
834 |
^ ")" |
43692 | 835 |
| generic_mangled_type_name _ _ = raise Fail "unexpected type abstraction" |
42542
024920b65ce2
perform constant mangling and/or removal of its type args in an earlier phase, so that the rest of the code doesn't need to worry about it
blanchet
parents:
42541
diff
changeset
|
836 |
|
44396
66b9b3fcd608
started cleaning up polymorphic monotonicity-based encodings, based on discussions with Nick Smallbone
blanchet
parents:
44394
diff
changeset
|
837 |
fun mangled_type format type_enc = |
66b9b3fcd608
started cleaning up polymorphic monotonicity-based encodings, based on discussions with Nick Smallbone
blanchet
parents:
44394
diff
changeset
|
838 |
generic_mangled_type_name fst o ho_term_from_typ format type_enc |
66b9b3fcd608
started cleaning up polymorphic monotonicity-based encodings, based on discussions with Nick Smallbone
blanchet
parents:
44394
diff
changeset
|
839 |
|
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
840 |
fun make_simple_type s = |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
841 |
if s = tptp_bool_type orelse s = tptp_fun_type orelse |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
842 |
s = tptp_individual_type then |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
843 |
s |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
844 |
else |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
845 |
simple_type_prefix ^ ascii_of s |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
846 |
|
43676
3b0b448b4d69
add support for lambdas in TPTP THF generator + killed an unsound type encoding (because the monotonicity calculus assumes first-order)
nik
parents:
43628
diff
changeset
|
847 |
fun ho_type_from_ho_term type_enc pred_sym ary = |
42963 | 848 |
let |
44593
ccf40af26ae9
implement more of the polymorphic simply typed format TFF(1)
blanchet
parents:
44591
diff
changeset
|
849 |
fun to_mangled_atype ty = |
42963 | 850 |
AType ((make_simple_type (generic_mangled_type_name fst ty), |
44593
ccf40af26ae9
implement more of the polymorphic simply typed format TFF(1)
blanchet
parents:
44591
diff
changeset
|
851 |
generic_mangled_type_name snd ty), []) |
ccf40af26ae9
implement more of the polymorphic simply typed format TFF(1)
blanchet
parents:
44591
diff
changeset
|
852 |
fun to_poly_atype (ATerm (name, tys)) = AType (name, map to_poly_atype tys) |
ccf40af26ae9
implement more of the polymorphic simply typed format TFF(1)
blanchet
parents:
44591
diff
changeset
|
853 |
| to_poly_atype _ = raise Fail "unexpected type abstraction" |
ccf40af26ae9
implement more of the polymorphic simply typed format TFF(1)
blanchet
parents:
44591
diff
changeset
|
854 |
val to_atype = |
ccf40af26ae9
implement more of the polymorphic simply typed format TFF(1)
blanchet
parents:
44591
diff
changeset
|
855 |
if polymorphism_of_type_enc type_enc = Polymorphic then to_poly_atype |
ccf40af26ae9
implement more of the polymorphic simply typed format TFF(1)
blanchet
parents:
44591
diff
changeset
|
856 |
else to_mangled_atype |
42963 | 857 |
fun to_afun f1 f2 tys = AFun (f1 (hd tys), f2 (nth tys 1)) |
42998
1c80902d0456
fully support all type system encodings in typed formats (TFF, THF)
blanchet
parents:
42994
diff
changeset
|
858 |
fun to_fo 0 ty = if pred_sym then bool_atype else to_atype ty |
42994
fe291ab75eb5
towards supporting non-simply-typed encodings for TFF and THF (for orthogonality and experiments)
blanchet
parents:
42966
diff
changeset
|
859 |
| to_fo ary (ATerm (_, tys)) = to_afun to_atype (to_fo (ary - 1)) tys |
43692 | 860 |
| to_fo _ _ = raise Fail "unexpected type abstraction" |
42994
fe291ab75eb5
towards supporting non-simply-typed encodings for TFF and THF (for orthogonality and experiments)
blanchet
parents:
42966
diff
changeset
|
861 |
fun to_ho (ty as ATerm ((s, _), tys)) = |
43676
3b0b448b4d69
add support for lambdas in TPTP THF generator + killed an unsound type encoding (because the monotonicity calculus assumes first-order)
nik
parents:
43628
diff
changeset
|
862 |
if s = tptp_fun_type then to_afun to_ho to_ho tys else to_atype ty |
3b0b448b4d69
add support for lambdas in TPTP THF generator + killed an unsound type encoding (because the monotonicity calculus assumes first-order)
nik
parents:
43628
diff
changeset
|
863 |
| to_ho _ = raise Fail "unexpected type abstraction" |
43626
a867ebb12209
renamed "type_sys" to "type_enc", which is more accurate
blanchet
parents:
43624
diff
changeset
|
864 |
in if is_type_enc_higher_order type_enc then to_ho else to_fo ary end |
42963 | 865 |
|
43677 | 866 |
fun ho_type_from_typ format type_enc pred_sym ary = |
43676
3b0b448b4d69
add support for lambdas in TPTP THF generator + killed an unsound type encoding (because the monotonicity calculus assumes first-order)
nik
parents:
43628
diff
changeset
|
867 |
ho_type_from_ho_term type_enc pred_sym ary |
3b0b448b4d69
add support for lambdas in TPTP THF generator + killed an unsound type encoding (because the monotonicity calculus assumes first-order)
nik
parents:
43628
diff
changeset
|
868 |
o ho_term_from_typ format type_enc |
42963 | 869 |
|
43626
a867ebb12209
renamed "type_sys" to "type_enc", which is more accurate
blanchet
parents:
43624
diff
changeset
|
870 |
fun mangled_const_name format type_enc T_args (s, s') = |
42963 | 871 |
let |
43676
3b0b448b4d69
add support for lambdas in TPTP THF generator + killed an unsound type encoding (because the monotonicity calculus assumes first-order)
nik
parents:
43628
diff
changeset
|
872 |
val ty_args = T_args |> map_filter (ho_term_for_type_arg format type_enc) |
42963 | 873 |
fun type_suffix f g = |
874 |
fold_rev (curry (op ^) o g o prefix mangled_type_sep |
|
875 |
o generic_mangled_type_name f) ty_args "" |
|
876 |
in (s ^ type_suffix fst ascii_of, s' ^ type_suffix snd I) end |
|
42542
024920b65ce2
perform constant mangling and/or removal of its type args in an earlier phase, so that the rest of the code doesn't need to worry about it
blanchet
parents:
42541
diff
changeset
|
877 |
|
024920b65ce2
perform constant mangling and/or removal of its type args in an earlier phase, so that the rest of the code doesn't need to worry about it
blanchet
parents:
42541
diff
changeset
|
878 |
val parse_mangled_ident = |
024920b65ce2
perform constant mangling and/or removal of its type args in an earlier phase, so that the rest of the code doesn't need to worry about it
blanchet
parents:
42541
diff
changeset
|
879 |
Scan.many1 (not o member (op =) ["(", ")", ","]) >> implode |
024920b65ce2
perform constant mangling and/or removal of its type args in an earlier phase, so that the rest of the code doesn't need to worry about it
blanchet
parents:
42541
diff
changeset
|
880 |
|
024920b65ce2
perform constant mangling and/or removal of its type args in an earlier phase, so that the rest of the code doesn't need to worry about it
blanchet
parents:
42541
diff
changeset
|
881 |
fun parse_mangled_type x = |
024920b65ce2
perform constant mangling and/or removal of its type args in an earlier phase, so that the rest of the code doesn't need to worry about it
blanchet
parents:
42541
diff
changeset
|
882 |
(parse_mangled_ident |
024920b65ce2
perform constant mangling and/or removal of its type args in an earlier phase, so that the rest of the code doesn't need to worry about it
blanchet
parents:
42541
diff
changeset
|
883 |
-- Scan.optional ($$ "(" |-- Scan.optional parse_mangled_types [] --| $$ ")") |
024920b65ce2
perform constant mangling and/or removal of its type args in an earlier phase, so that the rest of the code doesn't need to worry about it
blanchet
parents:
42541
diff
changeset
|
884 |
[] >> ATerm) x |
024920b65ce2
perform constant mangling and/or removal of its type args in an earlier phase, so that the rest of the code doesn't need to worry about it
blanchet
parents:
42541
diff
changeset
|
885 |
and parse_mangled_types x = |
024920b65ce2
perform constant mangling and/or removal of its type args in an earlier phase, so that the rest of the code doesn't need to worry about it
blanchet
parents:
42541
diff
changeset
|
886 |
(parse_mangled_type ::: Scan.repeat ($$ "," |-- parse_mangled_type)) x |
024920b65ce2
perform constant mangling and/or removal of its type args in an earlier phase, so that the rest of the code doesn't need to worry about it
blanchet
parents:
42541
diff
changeset
|
887 |
|
024920b65ce2
perform constant mangling and/or removal of its type args in an earlier phase, so that the rest of the code doesn't need to worry about it
blanchet
parents:
42541
diff
changeset
|
888 |
fun unmangled_type s = |
024920b65ce2
perform constant mangling and/or removal of its type args in an earlier phase, so that the rest of the code doesn't need to worry about it
blanchet
parents:
42541
diff
changeset
|
889 |
s |> suffix ")" |> raw_explode |
024920b65ce2
perform constant mangling and/or removal of its type args in an earlier phase, so that the rest of the code doesn't need to worry about it
blanchet
parents:
42541
diff
changeset
|
890 |
|> Scan.finite Symbol.stopper |
024920b65ce2
perform constant mangling and/or removal of its type args in an earlier phase, so that the rest of the code doesn't need to worry about it
blanchet
parents:
42541
diff
changeset
|
891 |
(Scan.error (!! (fn _ => raise Fail ("unrecognized mangled type " ^ |
024920b65ce2
perform constant mangling and/or removal of its type args in an earlier phase, so that the rest of the code doesn't need to worry about it
blanchet
parents:
42541
diff
changeset
|
892 |
quote s)) parse_mangled_type)) |
024920b65ce2
perform constant mangling and/or removal of its type args in an earlier phase, so that the rest of the code doesn't need to worry about it
blanchet
parents:
42541
diff
changeset
|
893 |
|> fst |
024920b65ce2
perform constant mangling and/or removal of its type args in an earlier phase, so that the rest of the code doesn't need to worry about it
blanchet
parents:
42541
diff
changeset
|
894 |
|
42561
23ddc4e3d19c
have properly type-instantiated helper facts (combinators and If)
blanchet
parents:
42560
diff
changeset
|
895 |
val unmangled_const_name = space_explode mangled_type_sep #> hd |
42542
024920b65ce2
perform constant mangling and/or removal of its type args in an earlier phase, so that the rest of the code doesn't need to worry about it
blanchet
parents:
42541
diff
changeset
|
896 |
fun unmangled_const s = |
024920b65ce2
perform constant mangling and/or removal of its type args in an earlier phase, so that the rest of the code doesn't need to worry about it
blanchet
parents:
42541
diff
changeset
|
897 |
let val ss = space_explode mangled_type_sep s in |
024920b65ce2
perform constant mangling and/or removal of its type args in an earlier phase, so that the rest of the code doesn't need to worry about it
blanchet
parents:
42541
diff
changeset
|
898 |
(hd ss, map unmangled_type (tl ss)) |
024920b65ce2
perform constant mangling and/or removal of its type args in an earlier phase, so that the rest of the code doesn't need to worry about it
blanchet
parents:
42541
diff
changeset
|
899 |
end |
024920b65ce2
perform constant mangling and/or removal of its type args in an earlier phase, so that the rest of the code doesn't need to worry about it
blanchet
parents:
42541
diff
changeset
|
900 |
|
44773
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
901 |
fun introduce_proxies_in_iterm type_enc = |
42568
7b9801a34836
no needless "fequal" proxies if "explicit_apply" is set + always have readable names
blanchet
parents:
42566
diff
changeset
|
902 |
let |
43987
2850b7dc27a4
further worked around LEO-II parser limitation, with eta-expansion
blanchet
parents:
43985
diff
changeset
|
903 |
fun tweak_ho_quant ho_quant T [IAbs _] = IConst (`I ho_quant, T, []) |
2850b7dc27a4
further worked around LEO-II parser limitation, with eta-expansion
blanchet
parents:
43985
diff
changeset
|
904 |
| tweak_ho_quant ho_quant (T as Type (_, [p_T as Type (_, [x_T, _]), _])) |
2850b7dc27a4
further worked around LEO-II parser limitation, with eta-expansion
blanchet
parents:
43985
diff
changeset
|
905 |
_ = |
2850b7dc27a4
further worked around LEO-II parser limitation, with eta-expansion
blanchet
parents:
43985
diff
changeset
|
906 |
(* Eta-expand "!!" and "??", to work around LEO-II 1.2.8 parser |
2850b7dc27a4
further worked around LEO-II parser limitation, with eta-expansion
blanchet
parents:
43985
diff
changeset
|
907 |
limitation. This works in conjuction with special code in |
2850b7dc27a4
further worked around LEO-II parser limitation, with eta-expansion
blanchet
parents:
43985
diff
changeset
|
908 |
"ATP_Problem" that uses the syntactic sugar "!" and "?" whenever |
2850b7dc27a4
further worked around LEO-II parser limitation, with eta-expansion
blanchet
parents:
43985
diff
changeset
|
909 |
possible. *) |
2850b7dc27a4
further worked around LEO-II parser limitation, with eta-expansion
blanchet
parents:
43985
diff
changeset
|
910 |
IAbs ((`I "P", p_T), |
2850b7dc27a4
further worked around LEO-II parser limitation, with eta-expansion
blanchet
parents:
43985
diff
changeset
|
911 |
IApp (IConst (`I ho_quant, T, []), |
2850b7dc27a4
further worked around LEO-II parser limitation, with eta-expansion
blanchet
parents:
43985
diff
changeset
|
912 |
IAbs ((`I "X", x_T), |
2850b7dc27a4
further worked around LEO-II parser limitation, with eta-expansion
blanchet
parents:
43985
diff
changeset
|
913 |
IApp (IConst (`I "P", p_T, []), |
2850b7dc27a4
further worked around LEO-II parser limitation, with eta-expansion
blanchet
parents:
43985
diff
changeset
|
914 |
IConst (`I "X", x_T, []))))) |
2850b7dc27a4
further worked around LEO-II parser limitation, with eta-expansion
blanchet
parents:
43985
diff
changeset
|
915 |
| tweak_ho_quant _ _ _ = raise Fail "unexpected type for quantifier" |
2850b7dc27a4
further worked around LEO-II parser limitation, with eta-expansion
blanchet
parents:
43985
diff
changeset
|
916 |
fun intro top_level args (IApp (tm1, tm2)) = |
2850b7dc27a4
further worked around LEO-II parser limitation, with eta-expansion
blanchet
parents:
43985
diff
changeset
|
917 |
IApp (intro top_level (tm2 :: args) tm1, intro false [] tm2) |
2850b7dc27a4
further worked around LEO-II parser limitation, with eta-expansion
blanchet
parents:
43985
diff
changeset
|
918 |
| intro top_level args (IConst (name as (s, _), T, T_args)) = |
42570
77f94ac04f32
cleanup proxification/unproxification and make sure that "num_atp_type_args" is called on the proxy in the reconstruction code, since "c_fequal" has one type arg but the unproxified equal has 0
blanchet
parents:
42569
diff
changeset
|
919 |
(case proxify_const s of |
43159
29b55f292e0b
added support for helpers in new Metis, so far only for polymorphic type encodings
blanchet
parents:
43139
diff
changeset
|
920 |
SOME proxy_base => |
43626
a867ebb12209
renamed "type_sys" to "type_enc", which is more accurate
blanchet
parents:
43624
diff
changeset
|
921 |
if top_level orelse is_type_enc_higher_order type_enc then |
43000
bd424c3dde46
cleaner handling of equality and proxies (esp. for THF)
blanchet
parents:
42998
diff
changeset
|
922 |
case (top_level, s) of |
43987
2850b7dc27a4
further worked around LEO-II parser limitation, with eta-expansion
blanchet
parents:
43985
diff
changeset
|
923 |
(_, "c_False") => IConst (`I tptp_false, T, []) |
2850b7dc27a4
further worked around LEO-II parser limitation, with eta-expansion
blanchet
parents:
43985
diff
changeset
|
924 |
| (_, "c_True") => IConst (`I tptp_true, T, []) |
2850b7dc27a4
further worked around LEO-II parser limitation, with eta-expansion
blanchet
parents:
43985
diff
changeset
|
925 |
| (false, "c_Not") => IConst (`I tptp_not, T, []) |
2850b7dc27a4
further worked around LEO-II parser limitation, with eta-expansion
blanchet
parents:
43985
diff
changeset
|
926 |
| (false, "c_conj") => IConst (`I tptp_and, T, []) |
2850b7dc27a4
further worked around LEO-II parser limitation, with eta-expansion
blanchet
parents:
43985
diff
changeset
|
927 |
| (false, "c_disj") => IConst (`I tptp_or, T, []) |
2850b7dc27a4
further worked around LEO-II parser limitation, with eta-expansion
blanchet
parents:
43985
diff
changeset
|
928 |
| (false, "c_implies") => IConst (`I tptp_implies, T, []) |
2850b7dc27a4
further worked around LEO-II parser limitation, with eta-expansion
blanchet
parents:
43985
diff
changeset
|
929 |
| (false, "c_All") => tweak_ho_quant tptp_ho_forall T args |
2850b7dc27a4
further worked around LEO-II parser limitation, with eta-expansion
blanchet
parents:
43985
diff
changeset
|
930 |
| (false, "c_Ex") => tweak_ho_quant tptp_ho_exists T args |
43000
bd424c3dde46
cleaner handling of equality and proxies (esp. for THF)
blanchet
parents:
42998
diff
changeset
|
931 |
| (false, s) => |
44097 | 932 |
if is_tptp_equal s andalso length args = 2 then |
933 |
IConst (`I tptp_equal, T, []) |
|
934 |
else |
|
44589
0a1dfc6365e9
first step towards polymorphic TFF + changed defaults for Vampire
blanchet
parents:
44587
diff
changeset
|
935 |
(* Use a proxy even for partially applied THF0 equality, |
0a1dfc6365e9
first step towards polymorphic TFF + changed defaults for Vampire
blanchet
parents:
44587
diff
changeset
|
936 |
because the LEO-II and Satallax parsers complain about not |
0a1dfc6365e9
first step towards polymorphic TFF + changed defaults for Vampire
blanchet
parents:
44587
diff
changeset
|
937 |
being able to infer the type of "=". *) |
44097 | 938 |
IConst (proxy_base |>> prefix const_prefix, T, T_args) |
43987
2850b7dc27a4
further worked around LEO-II parser limitation, with eta-expansion
blanchet
parents:
43985
diff
changeset
|
939 |
| _ => IConst (name, T, []) |
42569
5737947e4c77
make sure that fequal keeps its type arguments for mangled type systems
blanchet
parents:
42568
diff
changeset
|
940 |
else |
43987
2850b7dc27a4
further worked around LEO-II parser limitation, with eta-expansion
blanchet
parents:
43985
diff
changeset
|
941 |
IConst (proxy_base |>> prefix const_prefix, T, T_args) |
45167
6bc8d260d459
gracefully handle quantifiers of the form "All $ t" where "t" is not a lambda-abstraction in higher-order translations
blanchet
parents:
44859
diff
changeset
|
942 |
| NONE => if s = tptp_choice then tweak_ho_quant tptp_choice T args |
6bc8d260d459
gracefully handle quantifiers of the form "All $ t" where "t" is not a lambda-abstraction in higher-order translations
blanchet
parents:
44859
diff
changeset
|
943 |
else IConst (name, T, T_args)) |
43987
2850b7dc27a4
further worked around LEO-II parser limitation, with eta-expansion
blanchet
parents:
43985
diff
changeset
|
944 |
| intro _ _ (IAbs (bound, tm)) = IAbs (bound, intro false [] tm) |
2850b7dc27a4
further worked around LEO-II parser limitation, with eta-expansion
blanchet
parents:
43985
diff
changeset
|
945 |
| intro _ _ tm = tm |
2850b7dc27a4
further worked around LEO-II parser limitation, with eta-expansion
blanchet
parents:
43985
diff
changeset
|
946 |
in intro true [] end |
42568
7b9801a34836
no needless "fequal" proxies if "explicit_apply" is set + always have readable names
blanchet
parents:
42566
diff
changeset
|
947 |
|
44774
72785558a6ff
separate mangling, which can (and should) be done before the formulas are first-orderized, and type arg filtering, which must be done after once the min arities have been computed
blanchet
parents:
44773
diff
changeset
|
948 |
fun mangle_type_args_in_iterm format type_enc = |
72785558a6ff
separate mangling, which can (and should) be done before the formulas are first-orderized, and type arg filtering, which must be done after once the min arities have been computed
blanchet
parents:
44773
diff
changeset
|
949 |
if polymorphism_of_type_enc type_enc = Mangled_Monomorphic then |
72785558a6ff
separate mangling, which can (and should) be done before the formulas are first-orderized, and type arg filtering, which must be done after once the min arities have been computed
blanchet
parents:
44773
diff
changeset
|
950 |
let |
72785558a6ff
separate mangling, which can (and should) be done before the formulas are first-orderized, and type arg filtering, which must be done after once the min arities have been computed
blanchet
parents:
44773
diff
changeset
|
951 |
fun mangle (IApp (tm1, tm2)) = IApp (mangle tm1, mangle tm2) |
72785558a6ff
separate mangling, which can (and should) be done before the formulas are first-orderized, and type arg filtering, which must be done after once the min arities have been computed
blanchet
parents:
44773
diff
changeset
|
952 |
| mangle (tm as IConst (_, _, [])) = tm |
72785558a6ff
separate mangling, which can (and should) be done before the formulas are first-orderized, and type arg filtering, which must be done after once the min arities have been computed
blanchet
parents:
44773
diff
changeset
|
953 |
| mangle (tm as IConst (name as (s, _), T, T_args)) = |
72785558a6ff
separate mangling, which can (and should) be done before the formulas are first-orderized, and type arg filtering, which must be done after once the min arities have been computed
blanchet
parents:
44773
diff
changeset
|
954 |
(case strip_prefix_and_unascii const_prefix s of |
72785558a6ff
separate mangling, which can (and should) be done before the formulas are first-orderized, and type arg filtering, which must be done after once the min arities have been computed
blanchet
parents:
44773
diff
changeset
|
955 |
NONE => tm |
72785558a6ff
separate mangling, which can (and should) be done before the formulas are first-orderized, and type arg filtering, which must be done after once the min arities have been computed
blanchet
parents:
44773
diff
changeset
|
956 |
| SOME s'' => |
72785558a6ff
separate mangling, which can (and should) be done before the formulas are first-orderized, and type arg filtering, which must be done after once the min arities have been computed
blanchet
parents:
44773
diff
changeset
|
957 |
case type_arg_policy type_enc (invert_const s'') of |
72785558a6ff
separate mangling, which can (and should) be done before the formulas are first-orderized, and type arg filtering, which must be done after once the min arities have been computed
blanchet
parents:
44773
diff
changeset
|
958 |
Mangled_Type_Args => |
72785558a6ff
separate mangling, which can (and should) be done before the formulas are first-orderized, and type arg filtering, which must be done after once the min arities have been computed
blanchet
parents:
44773
diff
changeset
|
959 |
IConst (mangled_const_name format type_enc T_args name, T, []) |
72785558a6ff
separate mangling, which can (and should) be done before the formulas are first-orderized, and type arg filtering, which must be done after once the min arities have been computed
blanchet
parents:
44773
diff
changeset
|
960 |
| _ => tm) |
72785558a6ff
separate mangling, which can (and should) be done before the formulas are first-orderized, and type arg filtering, which must be done after once the min arities have been computed
blanchet
parents:
44773
diff
changeset
|
961 |
| mangle (IAbs (bound, tm)) = IAbs (bound, mangle tm) |
72785558a6ff
separate mangling, which can (and should) be done before the formulas are first-orderized, and type arg filtering, which must be done after once the min arities have been computed
blanchet
parents:
44773
diff
changeset
|
962 |
| mangle tm = tm |
72785558a6ff
separate mangling, which can (and should) be done before the formulas are first-orderized, and type arg filtering, which must be done after once the min arities have been computed
blanchet
parents:
44773
diff
changeset
|
963 |
in mangle end |
72785558a6ff
separate mangling, which can (and should) be done before the formulas are first-orderized, and type arg filtering, which must be done after once the min arities have been computed
blanchet
parents:
44773
diff
changeset
|
964 |
else |
72785558a6ff
separate mangling, which can (and should) be done before the formulas are first-orderized, and type arg filtering, which must be done after once the min arities have been computed
blanchet
parents:
44773
diff
changeset
|
965 |
I |
72785558a6ff
separate mangling, which can (and should) be done before the formulas are first-orderized, and type arg filtering, which must be done after once the min arities have been computed
blanchet
parents:
44773
diff
changeset
|
966 |
|
44773
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
967 |
fun chop_fun 0 T = ([], T) |
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
968 |
| chop_fun n (Type (@{type_name fun}, [dom_T, ran_T])) = |
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
969 |
chop_fun (n - 1) ran_T |>> cons dom_T |
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
970 |
| chop_fun _ T = ([], T) |
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
971 |
|
44774
72785558a6ff
separate mangling, which can (and should) be done before the formulas are first-orderized, and type arg filtering, which must be done after once the min arities have been computed
blanchet
parents:
44773
diff
changeset
|
972 |
fun filter_const_type_args _ _ _ [] = [] |
72785558a6ff
separate mangling, which can (and should) be done before the formulas are first-orderized, and type arg filtering, which must be done after once the min arities have been computed
blanchet
parents:
44773
diff
changeset
|
973 |
| filter_const_type_args thy s ary T_args = |
44773
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
974 |
let |
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
975 |
val U = robust_const_type thy s |
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
976 |
val arg_U_vars = fold Term.add_tvarsT (U |> chop_fun ary |> fst) [] |
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
977 |
val U_args = (s, U) |> robust_const_typargs thy |
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
978 |
in |
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
979 |
U_args ~~ T_args |
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
980 |
|> map (fn (U, T) => |
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
981 |
if member (op =) arg_U_vars (dest_TVar U) then dummyT else T) |
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
982 |
end |
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
983 |
handle TYPE _ => T_args |
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
984 |
|
44774
72785558a6ff
separate mangling, which can (and should) be done before the formulas are first-orderized, and type arg filtering, which must be done after once the min arities have been computed
blanchet
parents:
44773
diff
changeset
|
985 |
fun filter_type_args_in_iterm thy type_enc = |
38282
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
986 |
let |
44774
72785558a6ff
separate mangling, which can (and should) be done before the formulas are first-orderized, and type arg filtering, which must be done after once the min arities have been computed
blanchet
parents:
44773
diff
changeset
|
987 |
fun filt ary (IApp (tm1, tm2)) = IApp (filt (ary + 1) tm1, filt 0 tm2) |
72785558a6ff
separate mangling, which can (and should) be done before the formulas are first-orderized, and type arg filtering, which must be done after once the min arities have been computed
blanchet
parents:
44773
diff
changeset
|
988 |
| filt _ (tm as IConst (_, _, [])) = tm |
72785558a6ff
separate mangling, which can (and should) be done before the formulas are first-orderized, and type arg filtering, which must be done after once the min arities have been computed
blanchet
parents:
44773
diff
changeset
|
989 |
| filt ary (IConst (name as (s, _), T, T_args)) = |
44773
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
990 |
(case strip_prefix_and_unascii const_prefix s of |
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
991 |
NONE => |
44774
72785558a6ff
separate mangling, which can (and should) be done before the formulas are first-orderized, and type arg filtering, which must be done after once the min arities have been computed
blanchet
parents:
44773
diff
changeset
|
992 |
(name, |
72785558a6ff
separate mangling, which can (and should) be done before the formulas are first-orderized, and type arg filtering, which must be done after once the min arities have been computed
blanchet
parents:
44773
diff
changeset
|
993 |
if level_of_type_enc type_enc = No_Types orelse s = tptp_choice then |
72785558a6ff
separate mangling, which can (and should) be done before the formulas are first-orderized, and type arg filtering, which must be done after once the min arities have been computed
blanchet
parents:
44773
diff
changeset
|
994 |
[] |
72785558a6ff
separate mangling, which can (and should) be done before the formulas are first-orderized, and type arg filtering, which must be done after once the min arities have been computed
blanchet
parents:
44773
diff
changeset
|
995 |
else |
72785558a6ff
separate mangling, which can (and should) be done before the formulas are first-orderized, and type arg filtering, which must be done after once the min arities have been computed
blanchet
parents:
44773
diff
changeset
|
996 |
T_args) |
44773
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
997 |
| SOME s'' => |
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
998 |
let |
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
999 |
val s'' = invert_const s'' |
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
1000 |
fun filter_T_args false = T_args |
44774
72785558a6ff
separate mangling, which can (and should) be done before the formulas are first-orderized, and type arg filtering, which must be done after once the min arities have been computed
blanchet
parents:
44773
diff
changeset
|
1001 |
| filter_T_args true = filter_const_type_args thy s'' ary T_args |
44773
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
1002 |
in |
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
1003 |
case type_arg_policy type_enc s'' of |
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
1004 |
Explicit_Type_Args drop_args => (name, filter_T_args drop_args) |
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
1005 |
| No_Type_Args => (name, []) |
44774
72785558a6ff
separate mangling, which can (and should) be done before the formulas are first-orderized, and type arg filtering, which must be done after once the min arities have been computed
blanchet
parents:
44773
diff
changeset
|
1006 |
| Mangled_Type_Args => raise Fail "unexpected (un)mangled symbol" |
44773
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
1007 |
end) |
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
1008 |
|> (fn (name, T_args) => IConst (name, T, T_args)) |
44774
72785558a6ff
separate mangling, which can (and should) be done before the formulas are first-orderized, and type arg filtering, which must be done after once the min arities have been computed
blanchet
parents:
44773
diff
changeset
|
1009 |
| filt _ (IAbs (bound, tm)) = IAbs (bound, filt 0 tm) |
72785558a6ff
separate mangling, which can (and should) be done before the formulas are first-orderized, and type arg filtering, which must be done after once the min arities have been computed
blanchet
parents:
44773
diff
changeset
|
1010 |
| filt _ tm = tm |
72785558a6ff
separate mangling, which can (and should) be done before the formulas are first-orderized, and type arg filtering, which must be done after once the min arities have been computed
blanchet
parents:
44773
diff
changeset
|
1011 |
in filt 0 end |
44773
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
1012 |
|
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
1013 |
fun iformula_from_prop ctxt format type_enc eq_as_iff = |
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
1014 |
let |
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
1015 |
val thy = Proof_Context.theory_of ctxt |
45316
08d84bdd5b37
improve handling of bound type variables (esp. for TFF1)
blanchet
parents:
45315
diff
changeset
|
1016 |
fun do_term bs t atomic_Ts = |
44495 | 1017 |
iterm_from_term thy format bs (Envir.eta_contract t) |
44773
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
1018 |
|>> (introduce_proxies_in_iterm type_enc |
44774
72785558a6ff
separate mangling, which can (and should) be done before the formulas are first-orderized, and type arg filtering, which must be done after once the min arities have been computed
blanchet
parents:
44773
diff
changeset
|
1019 |
#> mangle_type_args_in_iterm format type_enc |
44773
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
1020 |
#> AAtom) |
45316
08d84bdd5b37
improve handling of bound type variables (esp. for TFF1)
blanchet
parents:
45315
diff
changeset
|
1021 |
||> union (op =) atomic_Ts |
44403
15160cdc4688
precisely distinguish between universal and existential quantifiers, instead of assuming the worst (universal), for monotonicity analysis
blanchet
parents:
44402
diff
changeset
|
1022 |
fun do_quant bs q pos s T t' = |
15160cdc4688
precisely distinguish between universal and existential quantifiers, instead of assuming the worst (universal), for monotonicity analysis
blanchet
parents:
44402
diff
changeset
|
1023 |
let |
15160cdc4688
precisely distinguish between universal and existential quantifiers, instead of assuming the worst (universal), for monotonicity analysis
blanchet
parents:
44402
diff
changeset
|
1024 |
val s = singleton (Name.variant_list (map fst bs)) s |
15160cdc4688
precisely distinguish between universal and existential quantifiers, instead of assuming the worst (universal), for monotonicity analysis
blanchet
parents:
44402
diff
changeset
|
1025 |
val universal = Option.map (q = AExists ? not) pos |
15160cdc4688
precisely distinguish between universal and existential quantifiers, instead of assuming the worst (universal), for monotonicity analysis
blanchet
parents:
44402
diff
changeset
|
1026 |
val name = |
15160cdc4688
precisely distinguish between universal and existential quantifiers, instead of assuming the worst (universal), for monotonicity analysis
blanchet
parents:
44402
diff
changeset
|
1027 |
s |> `(case universal of |
15160cdc4688
precisely distinguish between universal and existential quantifiers, instead of assuming the worst (universal), for monotonicity analysis
blanchet
parents:
44402
diff
changeset
|
1028 |
SOME true => make_all_bound_var |
15160cdc4688
precisely distinguish between universal and existential quantifiers, instead of assuming the worst (universal), for monotonicity analysis
blanchet
parents:
44402
diff
changeset
|
1029 |
| SOME false => make_exist_bound_var |
15160cdc4688
precisely distinguish between universal and existential quantifiers, instead of assuming the worst (universal), for monotonicity analysis
blanchet
parents:
44402
diff
changeset
|
1030 |
| NONE => make_bound_var) |
15160cdc4688
precisely distinguish between universal and existential quantifiers, instead of assuming the worst (universal), for monotonicity analysis
blanchet
parents:
44402
diff
changeset
|
1031 |
in |
15160cdc4688
precisely distinguish between universal and existential quantifiers, instead of assuming the worst (universal), for monotonicity analysis
blanchet
parents:
44402
diff
changeset
|
1032 |
do_formula ((s, (name, T)) :: bs) pos t' |
15160cdc4688
precisely distinguish between universal and existential quantifiers, instead of assuming the worst (universal), for monotonicity analysis
blanchet
parents:
44402
diff
changeset
|
1033 |
#>> mk_aquant q [(name, SOME T)] |
45316
08d84bdd5b37
improve handling of bound type variables (esp. for TFF1)
blanchet
parents:
45315
diff
changeset
|
1034 |
##> union (op =) (atomic_types_of T) |
38518
54727b44e277
handle bound name conflicts gracefully in FOF translation
blanchet
parents:
38496
diff
changeset
|
1035 |
end |
44403
15160cdc4688
precisely distinguish between universal and existential quantifiers, instead of assuming the worst (universal), for monotonicity analysis
blanchet
parents:
44402
diff
changeset
|
1036 |
and do_conn bs c pos1 t1 pos2 t2 = |
15160cdc4688
precisely distinguish between universal and existential quantifiers, instead of assuming the worst (universal), for monotonicity analysis
blanchet
parents:
44402
diff
changeset
|
1037 |
do_formula bs pos1 t1 ##>> do_formula bs pos2 t2 #>> uncurry (mk_aconn c) |
15160cdc4688
precisely distinguish between universal and existential quantifiers, instead of assuming the worst (universal), for monotonicity analysis
blanchet
parents:
44402
diff
changeset
|
1038 |
and do_formula bs pos t = |
38282
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
1039 |
case t of |
44403
15160cdc4688
precisely distinguish between universal and existential quantifiers, instead of assuming the worst (universal), for monotonicity analysis
blanchet
parents:
44402
diff
changeset
|
1040 |
@{const Trueprop} $ t1 => do_formula bs pos t1 |
15160cdc4688
precisely distinguish between universal and existential quantifiers, instead of assuming the worst (universal), for monotonicity analysis
blanchet
parents:
44402
diff
changeset
|
1041 |
| @{const Not} $ t1 => do_formula bs (Option.map not pos) t1 #>> mk_anot |
38282
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
1042 |
| Const (@{const_name All}, _) $ Abs (s, T, t') => |
44403
15160cdc4688
precisely distinguish between universal and existential quantifiers, instead of assuming the worst (universal), for monotonicity analysis
blanchet
parents:
44402
diff
changeset
|
1043 |
do_quant bs AForall pos s T t' |
45167
6bc8d260d459
gracefully handle quantifiers of the form "All $ t" where "t" is not a lambda-abstraction in higher-order translations
blanchet
parents:
44859
diff
changeset
|
1044 |
| (t0 as Const (@{const_name All}, _)) $ t1 => |
6bc8d260d459
gracefully handle quantifiers of the form "All $ t" where "t" is not a lambda-abstraction in higher-order translations
blanchet
parents:
44859
diff
changeset
|
1045 |
do_formula bs pos (t0 $ eta_expand (map (snd o snd) bs) t1 1) |
38282
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
1046 |
| Const (@{const_name Ex}, _) $ Abs (s, T, t') => |
44403
15160cdc4688
precisely distinguish between universal and existential quantifiers, instead of assuming the worst (universal), for monotonicity analysis
blanchet
parents:
44402
diff
changeset
|
1047 |
do_quant bs AExists pos s T t' |
45167
6bc8d260d459
gracefully handle quantifiers of the form "All $ t" where "t" is not a lambda-abstraction in higher-order translations
blanchet
parents:
44859
diff
changeset
|
1048 |
| (t0 as Const (@{const_name Ex}, _)) $ t1 => |
6bc8d260d459
gracefully handle quantifiers of the form "All $ t" where "t" is not a lambda-abstraction in higher-order translations
blanchet
parents:
44859
diff
changeset
|
1049 |
do_formula bs pos (t0 $ eta_expand (map (snd o snd) bs) t1 1) |
44403
15160cdc4688
precisely distinguish between universal and existential quantifiers, instead of assuming the worst (universal), for monotonicity analysis
blanchet
parents:
44402
diff
changeset
|
1050 |
| @{const HOL.conj} $ t1 $ t2 => do_conn bs AAnd pos t1 pos t2 |
15160cdc4688
precisely distinguish between universal and existential quantifiers, instead of assuming the worst (universal), for monotonicity analysis
blanchet
parents:
44402
diff
changeset
|
1051 |
| @{const HOL.disj} $ t1 $ t2 => do_conn bs AOr pos t1 pos t2 |
15160cdc4688
precisely distinguish between universal and existential quantifiers, instead of assuming the worst (universal), for monotonicity analysis
blanchet
parents:
44402
diff
changeset
|
1052 |
| @{const HOL.implies} $ t1 $ t2 => |
15160cdc4688
precisely distinguish between universal and existential quantifiers, instead of assuming the worst (universal), for monotonicity analysis
blanchet
parents:
44402
diff
changeset
|
1053 |
do_conn bs AImplies (Option.map not pos) t1 pos t2 |
38864
4abe644fcea5
formerly unnamed infix equality now named HOL.eq
haftmann
parents:
38829
diff
changeset
|
1054 |
| Const (@{const_name HOL.eq}, Type (_, [@{typ bool}, _])) $ t1 $ t2 => |
44403
15160cdc4688
precisely distinguish between universal and existential quantifiers, instead of assuming the worst (universal), for monotonicity analysis
blanchet
parents:
44402
diff
changeset
|
1055 |
if eq_as_iff then do_conn bs AIff NONE t1 NONE t2 else do_term bs t |
41140
9c68004b8c9d
added Sledgehammer support for higher-order propositional reasoning
blanchet
parents:
41138
diff
changeset
|
1056 |
| _ => do_term bs t |
38282
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
1057 |
in do_formula [] end |
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
1058 |
|
43264
a1a48c69d623
don't needlessly presimplify -- makes ATP problem preparation much faster
blanchet
parents:
43263
diff
changeset
|
1059 |
fun presimplify_term _ [] t = t |
a1a48c69d623
don't needlessly presimplify -- makes ATP problem preparation much faster
blanchet
parents:
43263
diff
changeset
|
1060 |
| presimplify_term ctxt presimp_consts t = |
a1a48c69d623
don't needlessly presimplify -- makes ATP problem preparation much faster
blanchet
parents:
43263
diff
changeset
|
1061 |
t |> exists_Const (member (op =) presimp_consts o fst) t |
a1a48c69d623
don't needlessly presimplify -- makes ATP problem preparation much faster
blanchet
parents:
43263
diff
changeset
|
1062 |
? (Skip_Proof.make_thm (Proof_Context.theory_of ctxt) |
a1a48c69d623
don't needlessly presimplify -- makes ATP problem preparation much faster
blanchet
parents:
43263
diff
changeset
|
1063 |
#> Meson.presimplify ctxt |
a1a48c69d623
don't needlessly presimplify -- makes ATP problem preparation much faster
blanchet
parents:
43263
diff
changeset
|
1064 |
#> prop_of) |
38282
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
1065 |
|
43863
a43d61270142
ensure that the lambda translation procedure is called only once with all the facts, which is necessary for soundness of lambda-lifting (freshness of new names)
blanchet
parents:
43862
diff
changeset
|
1066 |
fun concealed_bound_name j = atp_weak_prefix ^ string_of_int j |
38282
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
1067 |
fun conceal_bounds Ts t = |
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
1068 |
subst_bounds (map (Free o apfst concealed_bound_name) |
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
1069 |
(0 upto length Ts - 1 ~~ Ts), t) |
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
1070 |
fun reveal_bounds Ts = |
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
1071 |
subst_atomic (map (fn (j, T) => (Free (concealed_bound_name j, T), Bound j)) |
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
1072 |
(0 upto length Ts - 1 ~~ Ts)) |
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
1073 |
|
43265 | 1074 |
fun is_fun_equality (@{const_name HOL.eq}, |
1075 |
Type (_, [Type (@{type_name fun}, _), _])) = true |
|
1076 |
| is_fun_equality _ = false |
|
1077 |
||
42747
f132d13fcf75
use the same code for extensionalization in Metis and Sledgehammer and generalize that code so that it gracefully handles negations (e.g. negated conjecture), formulas of the form (%x. t) = u, etc.
blanchet
parents:
42742
diff
changeset
|
1078 |
fun extensionalize_term ctxt t = |
43265 | 1079 |
if exists_Const is_fun_equality t then |
1080 |
let val thy = Proof_Context.theory_of ctxt in |
|
1081 |
t |> cterm_of thy |> Meson.extensionalize_conv ctxt |
|
1082 |
|> prop_of |> Logic.dest_equals |> snd |
|
1083 |
end |
|
1084 |
else |
|
1085 |
t |
|
38608
01ed56c46259
beta eta contract the Sledgehammer conjecture (and also the axioms, although this might not be needed), just like Metis does (implicitly);
blanchet
parents:
38606
diff
changeset
|
1086 |
|
43862 | 1087 |
fun simple_translate_lambdas do_lambdas ctxt t = |
43863
a43d61270142
ensure that the lambda translation procedure is called only once with all the facts, which is necessary for soundness of lambda-lifting (freshness of new names)
blanchet
parents:
43862
diff
changeset
|
1088 |
let val thy = Proof_Context.theory_of ctxt in |
a43d61270142
ensure that the lambda translation procedure is called only once with all the facts, which is necessary for soundness of lambda-lifting (freshness of new names)
blanchet
parents:
43862
diff
changeset
|
1089 |
if Meson.is_fol_term thy t then |
a43d61270142
ensure that the lambda translation procedure is called only once with all the facts, which is necessary for soundness of lambda-lifting (freshness of new names)
blanchet
parents:
43862
diff
changeset
|
1090 |
t |
a43d61270142
ensure that the lambda translation procedure is called only once with all the facts, which is necessary for soundness of lambda-lifting (freshness of new names)
blanchet
parents:
43862
diff
changeset
|
1091 |
else |
a43d61270142
ensure that the lambda translation procedure is called only once with all the facts, which is necessary for soundness of lambda-lifting (freshness of new names)
blanchet
parents:
43862
diff
changeset
|
1092 |
let |
44814
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
1093 |
fun trans Ts t = |
43863
a43d61270142
ensure that the lambda translation procedure is called only once with all the facts, which is necessary for soundness of lambda-lifting (freshness of new names)
blanchet
parents:
43862
diff
changeset
|
1094 |
case t of |
44814
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
1095 |
@{const Not} $ t1 => @{const Not} $ trans Ts t1 |
43863
a43d61270142
ensure that the lambda translation procedure is called only once with all the facts, which is necessary for soundness of lambda-lifting (freshness of new names)
blanchet
parents:
43862
diff
changeset
|
1096 |
| (t0 as Const (@{const_name All}, _)) $ Abs (s, T, t') => |
44814
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
1097 |
t0 $ Abs (s, T, trans (T :: Ts) t') |
43863
a43d61270142
ensure that the lambda translation procedure is called only once with all the facts, which is necessary for soundness of lambda-lifting (freshness of new names)
blanchet
parents:
43862
diff
changeset
|
1098 |
| (t0 as Const (@{const_name All}, _)) $ t1 => |
44814
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
1099 |
trans Ts (t0 $ eta_expand Ts t1 1) |
43863
a43d61270142
ensure that the lambda translation procedure is called only once with all the facts, which is necessary for soundness of lambda-lifting (freshness of new names)
blanchet
parents:
43862
diff
changeset
|
1100 |
| (t0 as Const (@{const_name Ex}, _)) $ Abs (s, T, t') => |
44814
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
1101 |
t0 $ Abs (s, T, trans (T :: Ts) t') |
43863
a43d61270142
ensure that the lambda translation procedure is called only once with all the facts, which is necessary for soundness of lambda-lifting (freshness of new names)
blanchet
parents:
43862
diff
changeset
|
1102 |
| (t0 as Const (@{const_name Ex}, _)) $ t1 => |
44814
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
1103 |
trans Ts (t0 $ eta_expand Ts t1 1) |
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
1104 |
| (t0 as @{const HOL.conj}) $ t1 $ t2 => |
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
1105 |
t0 $ trans Ts t1 $ trans Ts t2 |
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
1106 |
| (t0 as @{const HOL.disj}) $ t1 $ t2 => |
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
1107 |
t0 $ trans Ts t1 $ trans Ts t2 |
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
1108 |
| (t0 as @{const HOL.implies}) $ t1 $ t2 => |
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
1109 |
t0 $ trans Ts t1 $ trans Ts t2 |
43863
a43d61270142
ensure that the lambda translation procedure is called only once with all the facts, which is necessary for soundness of lambda-lifting (freshness of new names)
blanchet
parents:
43862
diff
changeset
|
1110 |
| (t0 as Const (@{const_name HOL.eq}, Type (_, [@{typ bool}, _]))) |
a43d61270142
ensure that the lambda translation procedure is called only once with all the facts, which is necessary for soundness of lambda-lifting (freshness of new names)
blanchet
parents:
43862
diff
changeset
|
1111 |
$ t1 $ t2 => |
44814
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
1112 |
t0 $ trans Ts t1 $ trans Ts t2 |
43863
a43d61270142
ensure that the lambda translation procedure is called only once with all the facts, which is necessary for soundness of lambda-lifting (freshness of new names)
blanchet
parents:
43862
diff
changeset
|
1113 |
| _ => |
a43d61270142
ensure that the lambda translation procedure is called only once with all the facts, which is necessary for soundness of lambda-lifting (freshness of new names)
blanchet
parents:
43862
diff
changeset
|
1114 |
if not (exists_subterm (fn Abs _ => true | _ => false) t) then t |
a43d61270142
ensure that the lambda translation procedure is called only once with all the facts, which is necessary for soundness of lambda-lifting (freshness of new names)
blanchet
parents:
43862
diff
changeset
|
1115 |
else t |> Envir.eta_contract |> do_lambdas ctxt Ts |
a43d61270142
ensure that the lambda translation procedure is called only once with all the facts, which is necessary for soundness of lambda-lifting (freshness of new names)
blanchet
parents:
43862
diff
changeset
|
1116 |
val (t, ctxt') = Variable.import_terms true [t] ctxt |>> the_single |
44814
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
1117 |
in t |> trans [] |> singleton (Variable.export_terms ctxt' ctxt) end |
43863
a43d61270142
ensure that the lambda translation procedure is called only once with all the facts, which is necessary for soundness of lambda-lifting (freshness of new names)
blanchet
parents:
43862
diff
changeset
|
1118 |
end |
43856
d636b053d4ff
move more lambda-handling logic to Sledgehammer, from ATP module, for formal dependency reasons
blanchet
parents:
43830
diff
changeset
|
1119 |
|
43997 | 1120 |
fun do_cheaply_conceal_lambdas Ts (t1 $ t2) = |
1121 |
do_cheaply_conceal_lambdas Ts t1 |
|
1122 |
$ do_cheaply_conceal_lambdas Ts t2 |
|
1123 |
| do_cheaply_conceal_lambdas Ts (Abs (_, T, t)) = |
|
45508 | 1124 |
Free (lambda_lifted_poly_prefix ^ serial_string (), |
43997 | 1125 |
T --> fastype_of1 (T :: Ts, t)) |
1126 |
| do_cheaply_conceal_lambdas _ t = t |
|
43856
d636b053d4ff
move more lambda-handling logic to Sledgehammer, from ATP module, for formal dependency reasons
blanchet
parents:
43830
diff
changeset
|
1127 |
|
43862 | 1128 |
fun do_introduce_combinators ctxt Ts t = |
42361 | 1129 |
let val thy = Proof_Context.theory_of ctxt in |
43905
1ace987e22e5
avoid calling "Term.is_first_order" (indirectly) on a term with loose de Bruijns -- this is not necessary anyway because of the Abs check in "simple_translate_lambdas"
blanchet
parents:
43864
diff
changeset
|
1130 |
t |> conceal_bounds Ts |
1ace987e22e5
avoid calling "Term.is_first_order" (indirectly) on a term with loose de Bruijns -- this is not necessary anyway because of the Abs check in "simple_translate_lambdas"
blanchet
parents:
43864
diff
changeset
|
1131 |
|> cterm_of thy |
1ace987e22e5
avoid calling "Term.is_first_order" (indirectly) on a term with loose de Bruijns -- this is not necessary anyway because of the Abs check in "simple_translate_lambdas"
blanchet
parents:
43864
diff
changeset
|
1132 |
|> Meson_Clausify.introduce_combinators_in_cterm |
1ace987e22e5
avoid calling "Term.is_first_order" (indirectly) on a term with loose de Bruijns -- this is not necessary anyway because of the Abs check in "simple_translate_lambdas"
blanchet
parents:
43864
diff
changeset
|
1133 |
|> prop_of |> Logic.dest_equals |> snd |
1ace987e22e5
avoid calling "Term.is_first_order" (indirectly) on a term with loose de Bruijns -- this is not necessary anyway because of the Abs check in "simple_translate_lambdas"
blanchet
parents:
43864
diff
changeset
|
1134 |
|> reveal_bounds Ts |
38491
f7e51d981a9f
invoke Variable.export/import_term on the entire formula, to make sure that schematic variables don't get different indices in different subterms;
blanchet
parents:
38282
diff
changeset
|
1135 |
end |
43862 | 1136 |
(* A type variable of sort "{}" will make abstraction fail. *) |
43997 | 1137 |
handle THM _ => t |> do_cheaply_conceal_lambdas Ts |
43862 | 1138 |
val introduce_combinators = simple_translate_lambdas do_introduce_combinators |
1139 |
||
43864
58a7b3fdc193
fixed lambda-liftg: must ensure the formulas are in close form
blanchet
parents:
43863
diff
changeset
|
1140 |
fun preprocess_abstractions_in_terms trans_lambdas facts = |
43862 | 1141 |
let |
43863
a43d61270142
ensure that the lambda translation procedure is called only once with all the facts, which is necessary for soundness of lambda-lifting (freshness of new names)
blanchet
parents:
43862
diff
changeset
|
1142 |
val (facts, lambda_ts) = |
44501 | 1143 |
facts |> map (snd o snd) |> trans_lambdas |
43863
a43d61270142
ensure that the lambda translation procedure is called only once with all the facts, which is necessary for soundness of lambda-lifting (freshness of new names)
blanchet
parents:
43862
diff
changeset
|
1144 |
|>> map2 (fn (name, (kind, _)) => fn t => (name, (kind, t))) facts |
a43d61270142
ensure that the lambda translation procedure is called only once with all the facts, which is necessary for soundness of lambda-lifting (freshness of new names)
blanchet
parents:
43862
diff
changeset
|
1145 |
val lambda_facts = |
a43d61270142
ensure that the lambda translation procedure is called only once with all the facts, which is necessary for soundness of lambda-lifting (freshness of new names)
blanchet
parents:
43862
diff
changeset
|
1146 |
map2 (fn t => fn j => |
a43d61270142
ensure that the lambda translation procedure is called only once with all the facts, which is necessary for soundness of lambda-lifting (freshness of new names)
blanchet
parents:
43862
diff
changeset
|
1147 |
((lambda_fact_prefix ^ Int.toString j, Helper), (Axiom, t))) |
a43d61270142
ensure that the lambda translation procedure is called only once with all the facts, which is necessary for soundness of lambda-lifting (freshness of new names)
blanchet
parents:
43862
diff
changeset
|
1148 |
lambda_ts (1 upto length lambda_ts) |
a43d61270142
ensure that the lambda translation procedure is called only once with all the facts, which is necessary for soundness of lambda-lifting (freshness of new names)
blanchet
parents:
43862
diff
changeset
|
1149 |
in (facts, lambda_facts) end |
38282
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
1150 |
|
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
1151 |
(* Metis's use of "resolve_tac" freezes the schematic variables. We simulate the |
42353
7797efa897a1
correctly handle TFrees that occur in (local) facts -- Metis did the right thing here but Sledgehammer was incorrectly generating spurious preconditions such as "dense_linorder(t_a)"
blanchet
parents:
42237
diff
changeset
|
1152 |
same in Sledgehammer to prevent the discovery of unreplayable proofs. *) |
38282
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
1153 |
fun freeze_term t = |
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
1154 |
let |
44814
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
1155 |
fun freeze (t $ u) = freeze t $ freeze u |
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
1156 |
| freeze (Abs (s, T, t)) = Abs (s, T, freeze t) |
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
1157 |
| freeze (Var ((s, i), T)) = |
43863
a43d61270142
ensure that the lambda translation procedure is called only once with all the facts, which is necessary for soundness of lambda-lifting (freshness of new names)
blanchet
parents:
43862
diff
changeset
|
1158 |
Free (atp_weak_prefix ^ s ^ "_" ^ string_of_int i, T) |
44814
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
1159 |
| freeze t = t |
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
1160 |
in t |> exists_subterm is_Var t ? freeze end |
38282
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
1161 |
|
45202
62b8bcf24773
avoid generating too meta theorems -- this sometimes leads to type errors, e.g. when "pp" is applied to a "prop" instead of a "bool"
blanchet
parents:
45168
diff
changeset
|
1162 |
fun presimp_prop ctxt presimp_consts role t = |
62b8bcf24773
avoid generating too meta theorems -- this sometimes leads to type errors, e.g. when "pp" is applied to a "prop" instead of a "bool"
blanchet
parents:
45168
diff
changeset
|
1163 |
(let |
62b8bcf24773
avoid generating too meta theorems -- this sometimes leads to type errors, e.g. when "pp" is applied to a "prop" instead of a "bool"
blanchet
parents:
45168
diff
changeset
|
1164 |
val thy = Proof_Context.theory_of ctxt |
62b8bcf24773
avoid generating too meta theorems -- this sometimes leads to type errors, e.g. when "pp" is applied to a "prop" instead of a "bool"
blanchet
parents:
45168
diff
changeset
|
1165 |
val t = t |> Envir.beta_eta_contract |
62b8bcf24773
avoid generating too meta theorems -- this sometimes leads to type errors, e.g. when "pp" is applied to a "prop" instead of a "bool"
blanchet
parents:
45168
diff
changeset
|
1166 |
|> transform_elim_prop |
62b8bcf24773
avoid generating too meta theorems -- this sometimes leads to type errors, e.g. when "pp" is applied to a "prop" instead of a "bool"
blanchet
parents:
45168
diff
changeset
|
1167 |
|> Object_Logic.atomize_term thy |
62b8bcf24773
avoid generating too meta theorems -- this sometimes leads to type errors, e.g. when "pp" is applied to a "prop" instead of a "bool"
blanchet
parents:
45168
diff
changeset
|
1168 |
val need_trueprop = (fastype_of t = @{typ bool}) |
62b8bcf24773
avoid generating too meta theorems -- this sometimes leads to type errors, e.g. when "pp" is applied to a "prop" instead of a "bool"
blanchet
parents:
45168
diff
changeset
|
1169 |
in |
62b8bcf24773
avoid generating too meta theorems -- this sometimes leads to type errors, e.g. when "pp" is applied to a "prop" instead of a "bool"
blanchet
parents:
45168
diff
changeset
|
1170 |
t |> need_trueprop ? HOLogic.mk_Trueprop |
62b8bcf24773
avoid generating too meta theorems -- this sometimes leads to type errors, e.g. when "pp" is applied to a "prop" instead of a "bool"
blanchet
parents:
45168
diff
changeset
|
1171 |
|> Raw_Simplifier.rewrite_term thy (Meson.unfold_set_const_simps ctxt) [] |
62b8bcf24773
avoid generating too meta theorems -- this sometimes leads to type errors, e.g. when "pp" is applied to a "prop" instead of a "bool"
blanchet
parents:
45168
diff
changeset
|
1172 |
|> extensionalize_term ctxt |
62b8bcf24773
avoid generating too meta theorems -- this sometimes leads to type errors, e.g. when "pp" is applied to a "prop" instead of a "bool"
blanchet
parents:
45168
diff
changeset
|
1173 |
|> presimplify_term ctxt presimp_consts |
62b8bcf24773
avoid generating too meta theorems -- this sometimes leads to type errors, e.g. when "pp" is applied to a "prop" instead of a "bool"
blanchet
parents:
45168
diff
changeset
|
1174 |
|> HOLogic.dest_Trueprop |
62b8bcf24773
avoid generating too meta theorems -- this sometimes leads to type errors, e.g. when "pp" is applied to a "prop" instead of a "bool"
blanchet
parents:
45168
diff
changeset
|
1175 |
end |
62b8bcf24773
avoid generating too meta theorems -- this sometimes leads to type errors, e.g. when "pp" is applied to a "prop" instead of a "bool"
blanchet
parents:
45168
diff
changeset
|
1176 |
handle TERM _ => if role = Conjecture then @{term False} else @{term True}) |
62b8bcf24773
avoid generating too meta theorems -- this sometimes leads to type errors, e.g. when "pp" is applied to a "prop" instead of a "bool"
blanchet
parents:
45168
diff
changeset
|
1177 |
|> pair role |
43096 | 1178 |
|
44773
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
1179 |
fun make_formula ctxt format type_enc eq_as_iff name loc kind t = |
43096 | 1180 |
let |
45316
08d84bdd5b37
improve handling of bound type variables (esp. for TFF1)
blanchet
parents:
45315
diff
changeset
|
1181 |
val (iformula, atomic_Ts) = |
44773
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
1182 |
iformula_from_prop ctxt format type_enc eq_as_iff |
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
1183 |
(SOME (kind <> Conjecture)) t [] |
45316
08d84bdd5b37
improve handling of bound type variables (esp. for TFF1)
blanchet
parents:
45315
diff
changeset
|
1184 |
|>> close_iformula_universally |
38282
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
1185 |
in |
43859 | 1186 |
{name = name, locality = loc, kind = kind, iformula = iformula, |
45316
08d84bdd5b37
improve handling of bound type variables (esp. for TFF1)
blanchet
parents:
45315
diff
changeset
|
1187 |
atomic_types = atomic_Ts} |
38282
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
1188 |
end |
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
1189 |
|
43860
57ef3cd4126e
more refactoring of preprocessing, so as to be able to centralize it
blanchet
parents:
43859
diff
changeset
|
1190 |
fun make_fact ctxt format type_enc eq_as_iff ((name, loc), t) = |
44773
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
1191 |
case t |> make_formula ctxt format type_enc (eq_as_iff andalso format <> CNF) |
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
1192 |
name loc Axiom of |
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
1193 |
formula as {iformula = AAtom (IConst ((s, _), _, _)), ...} => |
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
1194 |
if s = tptp_true then NONE else SOME formula |
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
1195 |
| formula => SOME formula |
42561
23ddc4e3d19c
have properly type-instantiated helper facts (combinators and If)
blanchet
parents:
42560
diff
changeset
|
1196 |
|
44460 | 1197 |
fun s_not_trueprop (@{const Trueprop} $ t) = @{const Trueprop} $ s_not t |
45202
62b8bcf24773
avoid generating too meta theorems -- this sometimes leads to type errors, e.g. when "pp" is applied to a "prop" instead of a "bool"
blanchet
parents:
45168
diff
changeset
|
1198 |
| s_not_trueprop t = |
62b8bcf24773
avoid generating too meta theorems -- this sometimes leads to type errors, e.g. when "pp" is applied to a "prop" instead of a "bool"
blanchet
parents:
45168
diff
changeset
|
1199 |
if fastype_of t = @{typ bool} then s_not t else @{prop False} (* too meta *) |
44460 | 1200 |
|
44773
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
1201 |
fun make_conjecture ctxt format type_enc = |
44463
c471a2b48fa1
make sure that all facts are passed to ATP from minimizer
blanchet
parents:
44460
diff
changeset
|
1202 |
map (fn ((name, loc), (kind, t)) => |
c471a2b48fa1
make sure that all facts are passed to ATP from minimizer
blanchet
parents:
44460
diff
changeset
|
1203 |
t |> kind = Conjecture ? s_not_trueprop |
44773
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
1204 |
|> make_formula ctxt format type_enc (format <> CNF) name loc kind) |
38282
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
1205 |
|
42682
562046fd8e0c
added type homogenization, whereby all (isomorphic) infinite types are mapped to the same type (to reduce the number of different predicates/TFF-types)
blanchet
parents:
42680
diff
changeset
|
1206 |
(** Finite and infinite type inference **) |
562046fd8e0c
added type homogenization, whereby all (isomorphic) infinite types are mapped to the same type (to reduce the number of different predicates/TFF-types)
blanchet
parents:
42680
diff
changeset
|
1207 |
|
44814
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
1208 |
fun tvar_footprint thy s ary = |
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
1209 |
(case strip_prefix_and_unascii const_prefix s of |
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
1210 |
SOME s => |
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
1211 |
s |> invert_const |> robust_const_type thy |> chop_fun ary |> fst |
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
1212 |
|> map (fn T => Term.add_tvarsT T [] |> map fst) |
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
1213 |
| NONE => []) |
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
1214 |
handle TYPE _ => [] |
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
1215 |
|
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
1216 |
fun ghost_type_args thy s ary = |
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
1217 |
let |
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
1218 |
val footprint = tvar_footprint thy s ary |
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
1219 |
fun ghosts _ [] = [] |
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
1220 |
| ghosts seen ((i, tvars) :: args) = |
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
1221 |
ghosts (union (op =) seen tvars) args |
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
1222 |
|> exists (not o member (op =) seen) tvars ? cons i |
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
1223 |
in |
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
1224 |
if forall null footprint then |
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
1225 |
[] |
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
1226 |
else |
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
1227 |
0 upto length footprint - 1 ~~ footprint |
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
1228 |
|> sort (rev_order o list_ord Term_Ord.indexname_ord o pairself snd) |
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
1229 |
|> ghosts [] |
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
1230 |
end |
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
1231 |
|
44399 | 1232 |
type monotonicity_info = |
1233 |
{maybe_finite_Ts : typ list, |
|
1234 |
surely_finite_Ts : typ list, |
|
1235 |
maybe_infinite_Ts : typ list, |
|
1236 |
surely_infinite_Ts : typ list, |
|
1237 |
maybe_nonmono_Ts : typ list} |
|
1238 |
||
44397
06375952f1fa
cleaner handling of polymorphic monotonicity inference
blanchet
parents:
44396
diff
changeset
|
1239 |
(* These types witness that the type classes they belong to allow infinite |
06375952f1fa
cleaner handling of polymorphic monotonicity inference
blanchet
parents:
44396
diff
changeset
|
1240 |
models and hence that any types with these type classes is monotonic. *) |
06375952f1fa
cleaner handling of polymorphic monotonicity inference
blanchet
parents:
44396
diff
changeset
|
1241 |
val known_infinite_types = |
44634
2ac4ff398bc3
make "sound" sound and "unsound" more sound, based on evaluation
blanchet
parents:
44626
diff
changeset
|
1242 |
[@{typ nat}, HOLogic.intT, HOLogic.realT, @{typ "nat => bool"}] |
44397
06375952f1fa
cleaner handling of polymorphic monotonicity inference
blanchet
parents:
44396
diff
changeset
|
1243 |
|
44500 | 1244 |
fun is_type_kind_of_surely_infinite ctxt soundness cached_Ts T = |
44634
2ac4ff398bc3
make "sound" sound and "unsound" more sound, based on evaluation
blanchet
parents:
44626
diff
changeset
|
1245 |
soundness <> Sound andalso is_type_surely_infinite ctxt true cached_Ts T |
42886
208ec29cc013
improved "poly_preds_{bang,query}" by picking up good witnesses for the possible infinity of common type classes and ensuring that "?'a::type" doesn't ruin everything
blanchet
parents:
42885
diff
changeset
|
1246 |
|
42682
562046fd8e0c
added type homogenization, whereby all (isomorphic) infinite types are mapped to the same type (to reduce the number of different predicates/TFF-types)
blanchet
parents:
42680
diff
changeset
|
1247 |
(* Finite types such as "unit", "bool", "bool * bool", and "bool => bool" are |
562046fd8e0c
added type homogenization, whereby all (isomorphic) infinite types are mapped to the same type (to reduce the number of different predicates/TFF-types)
blanchet
parents:
42680
diff
changeset
|
1248 |
dangerous because their "exhaust" properties can easily lead to unsound ATP |
562046fd8e0c
added type homogenization, whereby all (isomorphic) infinite types are mapped to the same type (to reduce the number of different predicates/TFF-types)
blanchet
parents:
42680
diff
changeset
|
1249 |
proofs. On the other hand, all HOL infinite types can be given the same |
562046fd8e0c
added type homogenization, whereby all (isomorphic) infinite types are mapped to the same type (to reduce the number of different predicates/TFF-types)
blanchet
parents:
42680
diff
changeset
|
1250 |
models in first-order logic (via Löwenheim-Skolem). *) |
562046fd8e0c
added type homogenization, whereby all (isomorphic) infinite types are mapped to the same type (to reduce the number of different predicates/TFF-types)
blanchet
parents:
42680
diff
changeset
|
1251 |
|
44399 | 1252 |
fun should_encode_type _ (_ : monotonicity_info) All_Types _ = true |
1253 |
| should_encode_type ctxt {maybe_finite_Ts, surely_infinite_Ts, |
|
1254 |
maybe_nonmono_Ts, ...} |
|
44811 | 1255 |
(Noninf_Nonmono_Types (soundness, grain)) T = |
1256 |
grain = Ghost_Type_Arg_Vars orelse |
|
1257 |
(exists (type_intersect ctxt T) maybe_nonmono_Ts andalso |
|
1258 |
not (exists (type_instance ctxt T) surely_infinite_Ts orelse |
|
44859
237ba63d6041
fixed definition of type intersection (soundness bug)
blanchet
parents:
44853
diff
changeset
|
1259 |
(not (member (type_equiv ctxt) maybe_finite_Ts T) andalso |
44811 | 1260 |
is_type_kind_of_surely_infinite ctxt soundness surely_infinite_Ts |
1261 |
T))) |
|
44399 | 1262 |
| should_encode_type ctxt {surely_finite_Ts, maybe_infinite_Ts, |
1263 |
maybe_nonmono_Ts, ...} |
|
44811 | 1264 |
(Fin_Nonmono_Types grain) T = |
1265 |
grain = Ghost_Type_Arg_Vars orelse |
|
1266 |
(exists (type_intersect ctxt T) maybe_nonmono_Ts andalso |
|
1267 |
(exists (type_generalization ctxt T) surely_finite_Ts orelse |
|
44859
237ba63d6041
fixed definition of type intersection (soundness bug)
blanchet
parents:
44853
diff
changeset
|
1268 |
(not (member (type_equiv ctxt) maybe_infinite_Ts T) andalso |
44811 | 1269 |
is_type_surely_finite ctxt T))) |
42682
562046fd8e0c
added type homogenization, whereby all (isomorphic) infinite types are mapped to the same type (to reduce the number of different predicates/TFF-types)
blanchet
parents:
42680
diff
changeset
|
1270 |
| should_encode_type _ _ _ _ = false |
562046fd8e0c
added type homogenization, whereby all (isomorphic) infinite types are mapped to the same type (to reduce the number of different predicates/TFF-types)
blanchet
parents:
42680
diff
changeset
|
1271 |
|
44768 | 1272 |
fun should_guard_type ctxt mono (Guards (_, level)) should_guard_var T = |
44811 | 1273 |
should_guard_var () andalso should_encode_type ctxt mono level T |
44399 | 1274 |
| should_guard_type _ _ _ _ _ = false |
42682
562046fd8e0c
added type homogenization, whereby all (isomorphic) infinite types are mapped to the same type (to reduce the number of different predicates/TFF-types)
blanchet
parents:
42680
diff
changeset
|
1275 |
|
44403
15160cdc4688
precisely distinguish between universal and existential quantifiers, instead of assuming the worst (universal), for monotonicity analysis
blanchet
parents:
44402
diff
changeset
|
1276 |
fun is_maybe_universal_var (IConst ((s, _), _, _)) = |
15160cdc4688
precisely distinguish between universal and existential quantifiers, instead of assuming the worst (universal), for monotonicity analysis
blanchet
parents:
44402
diff
changeset
|
1277 |
String.isPrefix bound_var_prefix s orelse |
15160cdc4688
precisely distinguish between universal and existential quantifiers, instead of assuming the worst (universal), for monotonicity analysis
blanchet
parents:
44402
diff
changeset
|
1278 |
String.isPrefix all_bound_var_prefix s |
15160cdc4688
precisely distinguish between universal and existential quantifiers, instead of assuming the worst (universal), for monotonicity analysis
blanchet
parents:
44402
diff
changeset
|
1279 |
| is_maybe_universal_var (IVar _) = true |
15160cdc4688
precisely distinguish between universal and existential quantifiers, instead of assuming the worst (universal), for monotonicity analysis
blanchet
parents:
44402
diff
changeset
|
1280 |
| is_maybe_universal_var _ = false |
42836 | 1281 |
|
43361
e37b54d429f5
revived the lightweight "poly_tags_{query,bang}" type encodings by fixing their soundness bug
blanchet
parents:
43324
diff
changeset
|
1282 |
datatype tag_site = |
e37b54d429f5
revived the lightweight "poly_tags_{query,bang}" type encodings by fixing their soundness bug
blanchet
parents:
43324
diff
changeset
|
1283 |
Top_Level of bool option | |
e37b54d429f5
revived the lightweight "poly_tags_{query,bang}" type encodings by fixing their soundness bug
blanchet
parents:
43324
diff
changeset
|
1284 |
Eq_Arg of bool option | |
44814
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
1285 |
Arg of string * int | |
43361
e37b54d429f5
revived the lightweight "poly_tags_{query,bang}" type encodings by fixing their soundness bug
blanchet
parents:
43324
diff
changeset
|
1286 |
Elsewhere |
42829
1558741f8a72
started implementing "shallow" type systems, based on ideas by Claessen et al.
blanchet
parents:
42828
diff
changeset
|
1287 |
|
43361
e37b54d429f5
revived the lightweight "poly_tags_{query,bang}" type encodings by fixing their soundness bug
blanchet
parents:
43324
diff
changeset
|
1288 |
fun should_tag_with_type _ _ _ (Top_Level _) _ _ = false |
44768 | 1289 |
| should_tag_with_type ctxt mono (Tags (_, level)) site u T = |
44814
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
1290 |
(case granularity_of_type_level level of |
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
1291 |
All_Vars => should_encode_type ctxt mono level T |
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
1292 |
| grain => |
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
1293 |
case (site, is_maybe_universal_var u) of |
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
1294 |
(Eq_Arg _, true) => should_encode_type ctxt mono level T |
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
1295 |
| (Arg (s, j), true) => |
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
1296 |
grain = Ghost_Type_Arg_Vars andalso |
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
1297 |
member (op =) |
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
1298 |
(ghost_type_args (Proof_Context.theory_of ctxt) s (j + 1)) j |
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
1299 |
| _ => false) |
42829
1558741f8a72
started implementing "shallow" type systems, based on ideas by Claessen et al.
blanchet
parents:
42828
diff
changeset
|
1300 |
| should_tag_with_type _ _ _ _ _ _ = false |
42682
562046fd8e0c
added type homogenization, whereby all (isomorphic) infinite types are mapped to the same type (to reduce the number of different predicates/TFF-types)
blanchet
parents:
42680
diff
changeset
|
1301 |
|
44594
ae82943481e9
added type abstractions (for declaring polymorphic constants) to TFF syntax
blanchet
parents:
44593
diff
changeset
|
1302 |
fun fused_type ctxt mono level = |
42994
fe291ab75eb5
towards supporting non-simply-typed encodings for TFF and THF (for orthogonality and experiments)
blanchet
parents:
42966
diff
changeset
|
1303 |
let |
44399 | 1304 |
val should_encode = should_encode_type ctxt mono level |
44594
ae82943481e9
added type abstractions (for declaring polymorphic constants) to TFF syntax
blanchet
parents:
44593
diff
changeset
|
1305 |
fun fuse 0 T = if should_encode T then T else fused_infinite_type |
ae82943481e9
added type abstractions (for declaring polymorphic constants) to TFF syntax
blanchet
parents:
44593
diff
changeset
|
1306 |
| fuse ary (Type (@{type_name fun}, [T1, T2])) = |
ae82943481e9
added type abstractions (for declaring polymorphic constants) to TFF syntax
blanchet
parents:
44593
diff
changeset
|
1307 |
fuse 0 T1 --> fuse (ary - 1) T2 |
ae82943481e9
added type abstractions (for declaring polymorphic constants) to TFF syntax
blanchet
parents:
44593
diff
changeset
|
1308 |
| fuse _ _ = raise Fail "expected function type" |
ae82943481e9
added type abstractions (for declaring polymorphic constants) to TFF syntax
blanchet
parents:
44593
diff
changeset
|
1309 |
in fuse end |
42682
562046fd8e0c
added type homogenization, whereby all (isomorphic) infinite types are mapped to the same type (to reduce the number of different predicates/TFF-types)
blanchet
parents:
42680
diff
changeset
|
1310 |
|
44450
d848dd7b21f4
fixed "hBOOL" of existential variables, and generate more helpers
blanchet
parents:
44418
diff
changeset
|
1311 |
(** predicators and application operators **) |
41313
a96ac4d180b7
optionally supply constant weights to E -- turned off by default until properly parameterized
blanchet
parents:
41211
diff
changeset
|
1312 |
|
42574 | 1313 |
type sym_info = |
44829
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1314 |
{pred_sym : bool, min_ary : int, max_ary : int, types : typ list, |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1315 |
in_conj : bool} |
42563 | 1316 |
|
44829
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1317 |
fun default_sym_tab_entries type_enc = |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1318 |
(make_fixed_const NONE @{const_name undefined}, |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1319 |
{pred_sym = false, min_ary = 0, max_ary = 0, types = [], |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1320 |
in_conj = false}) :: |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1321 |
([tptp_false, tptp_true] |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1322 |
|> map (rpair {pred_sym = true, min_ary = 0, max_ary = 0, types = [], |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1323 |
in_conj = false})) @ |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1324 |
([tptp_equal, tptp_old_equal] |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1325 |
|> map (rpair {pred_sym = true, min_ary = 2, max_ary = 2, types = [], |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1326 |
in_conj = false})) |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1327 |
|> not (is_type_enc_higher_order type_enc) |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1328 |
? cons (prefixed_predicator_name, |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1329 |
{pred_sym = true, min_ary = 1, max_ary = 1, types = [], |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1330 |
in_conj = false}) |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1331 |
|
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1332 |
fun sym_table_for_facts ctxt type_enc explicit_apply conjs facts = |
42558
3d9930cb6770
cleaned up "explicit_apply" so that it shares most of its code path with the default mode of operation
blanchet
parents:
42557
diff
changeset
|
1333 |
let |
44772 | 1334 |
fun consider_var_ary const_T var_T max_ary = |
43064
b6e61d22fa61
made "explicit_apply" smarter -- no need to force explicit applications in minimizer on all constants, better do it more fine granularly
blanchet
parents:
43039
diff
changeset
|
1335 |
let |
b6e61d22fa61
made "explicit_apply" smarter -- no need to force explicit applications in minimizer on all constants, better do it more fine granularly
blanchet
parents:
43039
diff
changeset
|
1336 |
fun iter ary T = |
44399 | 1337 |
if ary = max_ary orelse type_instance ctxt var_T T orelse |
1338 |
type_instance ctxt T var_T then |
|
43210
7384b771805d
made "explicit_apply"'s smart mode (more) complete
blanchet
parents:
43207
diff
changeset
|
1339 |
ary |
7384b771805d
made "explicit_apply"'s smart mode (more) complete
blanchet
parents:
43207
diff
changeset
|
1340 |
else |
7384b771805d
made "explicit_apply"'s smart mode (more) complete
blanchet
parents:
43207
diff
changeset
|
1341 |
iter (ary + 1) (range_type T) |
43064
b6e61d22fa61
made "explicit_apply" smarter -- no need to force explicit applications in minimizer on all constants, better do it more fine granularly
blanchet
parents:
43039
diff
changeset
|
1342 |
in iter 0 const_T end |
44403
15160cdc4688
precisely distinguish between universal and existential quantifiers, instead of assuming the worst (universal), for monotonicity analysis
blanchet
parents:
44402
diff
changeset
|
1343 |
fun add_universal_var T (accum as ((bool_vars, fun_var_Ts), sym_tab)) = |
43201
0c9bf1a8e0d8
make "smart" mode of "explicit_apply" smarter, by also detecting the other kind of higher-order quantification, namely "bool"s
blanchet
parents:
43198
diff
changeset
|
1344 |
if explicit_apply = NONE andalso |
0c9bf1a8e0d8
make "smart" mode of "explicit_apply" smarter, by also detecting the other kind of higher-order quantification, namely "bool"s
blanchet
parents:
43198
diff
changeset
|
1345 |
(can dest_funT T orelse T = @{typ bool}) then |
0c9bf1a8e0d8
make "smart" mode of "explicit_apply" smarter, by also detecting the other kind of higher-order quantification, namely "bool"s
blanchet
parents:
43198
diff
changeset
|
1346 |
let |
0c9bf1a8e0d8
make "smart" mode of "explicit_apply" smarter, by also detecting the other kind of higher-order quantification, namely "bool"s
blanchet
parents:
43198
diff
changeset
|
1347 |
val bool_vars' = bool_vars orelse body_type T = @{typ bool} |
44829
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1348 |
fun repair_min_ary {pred_sym, min_ary, max_ary, types, in_conj} = |
43201
0c9bf1a8e0d8
make "smart" mode of "explicit_apply" smarter, by also detecting the other kind of higher-order quantification, namely "bool"s
blanchet
parents:
43198
diff
changeset
|
1349 |
{pred_sym = pred_sym andalso not bool_vars', |
44772 | 1350 |
min_ary = fold (fn T' => consider_var_ary T' T) types min_ary, |
44829
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1351 |
max_ary = max_ary, types = types, in_conj = in_conj} |
43201
0c9bf1a8e0d8
make "smart" mode of "explicit_apply" smarter, by also detecting the other kind of higher-order quantification, namely "bool"s
blanchet
parents:
43198
diff
changeset
|
1352 |
val fun_var_Ts' = |
0c9bf1a8e0d8
make "smart" mode of "explicit_apply" smarter, by also detecting the other kind of higher-order quantification, namely "bool"s
blanchet
parents:
43198
diff
changeset
|
1353 |
fun_var_Ts |> can dest_funT T ? insert_type ctxt I T |
0c9bf1a8e0d8
make "smart" mode of "explicit_apply" smarter, by also detecting the other kind of higher-order quantification, namely "bool"s
blanchet
parents:
43198
diff
changeset
|
1354 |
in |
0c9bf1a8e0d8
make "smart" mode of "explicit_apply" smarter, by also detecting the other kind of higher-order quantification, namely "bool"s
blanchet
parents:
43198
diff
changeset
|
1355 |
if bool_vars' = bool_vars andalso |
0c9bf1a8e0d8
make "smart" mode of "explicit_apply" smarter, by also detecting the other kind of higher-order quantification, namely "bool"s
blanchet
parents:
43198
diff
changeset
|
1356 |
pointer_eq (fun_var_Ts', fun_var_Ts) then |
0c9bf1a8e0d8
make "smart" mode of "explicit_apply" smarter, by also detecting the other kind of higher-order quantification, namely "bool"s
blanchet
parents:
43198
diff
changeset
|
1357 |
accum |
43167
839f599bc7ed
ensured that the logic for "explicit_apply = smart" also works on CNF (i.e. new Metis)
blanchet
parents:
43159
diff
changeset
|
1358 |
else |
44772 | 1359 |
((bool_vars', fun_var_Ts'), Symtab.map (K repair_min_ary) sym_tab) |
43201
0c9bf1a8e0d8
make "smart" mode of "explicit_apply" smarter, by also detecting the other kind of higher-order quantification, namely "bool"s
blanchet
parents:
43198
diff
changeset
|
1360 |
end |
0c9bf1a8e0d8
make "smart" mode of "explicit_apply" smarter, by also detecting the other kind of higher-order quantification, namely "bool"s
blanchet
parents:
43198
diff
changeset
|
1361 |
else |
0c9bf1a8e0d8
make "smart" mode of "explicit_apply" smarter, by also detecting the other kind of higher-order quantification, namely "bool"s
blanchet
parents:
43198
diff
changeset
|
1362 |
accum |
44829
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1363 |
fun add_fact_syms conj_fact = |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1364 |
let |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1365 |
fun add_iterm_syms top_level tm |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1366 |
(accum as ((bool_vars, fun_var_Ts), sym_tab)) = |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1367 |
let val (head, args) = strip_iterm_comb tm in |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1368 |
(case head of |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1369 |
IConst ((s, _), T, _) => |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1370 |
if String.isPrefix bound_var_prefix s orelse |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1371 |
String.isPrefix all_bound_var_prefix s then |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1372 |
add_universal_var T accum |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1373 |
else if String.isPrefix exist_bound_var_prefix s then |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1374 |
accum |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1375 |
else |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1376 |
let val ary = length args in |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1377 |
((bool_vars, fun_var_Ts), |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1378 |
case Symtab.lookup sym_tab s of |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1379 |
SOME {pred_sym, min_ary, max_ary, types, in_conj} => |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1380 |
let |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1381 |
val pred_sym = |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1382 |
pred_sym andalso top_level andalso not bool_vars |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1383 |
val types' = types |> insert_type ctxt I T |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1384 |
val in_conj = in_conj orelse conj_fact |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1385 |
val min_ary = |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1386 |
if is_some explicit_apply orelse |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1387 |
pointer_eq (types', types) then |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1388 |
min_ary |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1389 |
else |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1390 |
fold (consider_var_ary T) fun_var_Ts min_ary |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1391 |
in |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1392 |
Symtab.update (s, {pred_sym = pred_sym, |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1393 |
min_ary = Int.min (ary, min_ary), |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1394 |
max_ary = Int.max (ary, max_ary), |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1395 |
types = types', in_conj = in_conj}) |
43064
b6e61d22fa61
made "explicit_apply" smarter -- no need to force explicit applications in minimizer on all constants, better do it more fine granularly
blanchet
parents:
43039
diff
changeset
|
1396 |
sym_tab |
44829
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1397 |
end |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1398 |
| NONE => |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1399 |
let |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1400 |
val pred_sym = top_level andalso not bool_vars |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1401 |
val min_ary = |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1402 |
case explicit_apply of |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1403 |
SOME true => 0 |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1404 |
| SOME false => ary |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1405 |
| NONE => fold (consider_var_ary T) fun_var_Ts ary |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1406 |
in |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1407 |
Symtab.update_new (s, |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1408 |
{pred_sym = pred_sym, min_ary = min_ary, |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1409 |
max_ary = ary, types = [T], in_conj = conj_fact}) |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1410 |
sym_tab |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1411 |
end) |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1412 |
end |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1413 |
| IVar (_, T) => add_universal_var T accum |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1414 |
| IAbs ((_, T), tm) => |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1415 |
accum |> add_universal_var T |> add_iterm_syms false tm |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1416 |
| _ => accum) |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1417 |
|> fold (add_iterm_syms false) args |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1418 |
end |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1419 |
in K (add_iterm_syms true) |> formula_fold NONE |> fact_lift end |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1420 |
in |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1421 |
((false, []), Symtab.empty) |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1422 |
|> fold (add_fact_syms true) conjs |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1423 |
|> fold (add_fact_syms false) facts |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1424 |
|> snd |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1425 |
|> fold Symtab.update (default_sym_tab_entries type_enc) |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1426 |
end |
38282
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
1427 |
|
44772 | 1428 |
fun min_ary_of sym_tab s = |
42558
3d9930cb6770
cleaned up "explicit_apply" so that it shares most of its code path with the default mode of operation
blanchet
parents:
42557
diff
changeset
|
1429 |
case Symtab.lookup sym_tab s of |
42574 | 1430 |
SOME ({min_ary, ...} : sym_info) => min_ary |
42558
3d9930cb6770
cleaned up "explicit_apply" so that it shares most of its code path with the default mode of operation
blanchet
parents:
42557
diff
changeset
|
1431 |
| NONE => |
3d9930cb6770
cleaned up "explicit_apply" so that it shares most of its code path with the default mode of operation
blanchet
parents:
42557
diff
changeset
|
1432 |
case strip_prefix_and_unascii const_prefix s of |
42547
b5eec0c99528
fixed arity of special constants if "explicit_apply" is set
blanchet
parents:
42546
diff
changeset
|
1433 |
SOME s => |
42570
77f94ac04f32
cleanup proxification/unproxification and make sure that "num_atp_type_args" is called on the proxy in the reconstruction code, since "c_fequal" has one type arg but the unproxified equal has 0
blanchet
parents:
42569
diff
changeset
|
1434 |
let val s = s |> unmangled_const_name |> invert_const in |
42966
4e2d6c1e5392
more work on parsing LEO-II proofs without lambdas
blanchet
parents:
42963
diff
changeset
|
1435 |
if s = predicator_name then 1 |
4e2d6c1e5392
more work on parsing LEO-II proofs without lambdas
blanchet
parents:
42963
diff
changeset
|
1436 |
else if s = app_op_name then 2 |
44396
66b9b3fcd608
started cleaning up polymorphic monotonicity-based encodings, based on discussions with Nick Smallbone
blanchet
parents:
44394
diff
changeset
|
1437 |
else if s = type_guard_name then 1 |
42557
ae0deb39a254
fixed min-arity computation when "explicit_apply" is specified
blanchet
parents:
42556
diff
changeset
|
1438 |
else 0 |
42547
b5eec0c99528
fixed arity of special constants if "explicit_apply" is set
blanchet
parents:
42546
diff
changeset
|
1439 |
end |
42544
75cb06eee990
reimplemented the hAPP introduction code so that it's done earlier, when the types are still available
blanchet
parents:
42543
diff
changeset
|
1440 |
| NONE => 0 |
38282
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
1441 |
|
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
1442 |
(* True if the constant ever appears outside of the top-level position in |
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
1443 |
literals, or if it appears with different arities (e.g., because of different |
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
1444 |
type instantiations). If false, the constant always receives all of its |
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
1445 |
arguments and is used as a predicate. *) |
42558
3d9930cb6770
cleaned up "explicit_apply" so that it shares most of its code path with the default mode of operation
blanchet
parents:
42557
diff
changeset
|
1446 |
fun is_pred_sym sym_tab s = |
3d9930cb6770
cleaned up "explicit_apply" so that it shares most of its code path with the default mode of operation
blanchet
parents:
42557
diff
changeset
|
1447 |
case Symtab.lookup sym_tab s of |
42574 | 1448 |
SOME ({pred_sym, min_ary, max_ary, ...} : sym_info) => |
1449 |
pred_sym andalso min_ary = max_ary |
|
42558
3d9930cb6770
cleaned up "explicit_apply" so that it shares most of its code path with the default mode of operation
blanchet
parents:
42557
diff
changeset
|
1450 |
| NONE => false |
38282
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
1451 |
|
44773
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
1452 |
val app_op = `(make_fixed_const NONE) app_op_name |
42568
7b9801a34836
no needless "fequal" proxies if "explicit_apply" is set + always have readable names
blanchet
parents:
42566
diff
changeset
|
1453 |
val predicator_combconst = |
44495 | 1454 |
IConst (`(make_fixed_const NONE) predicator_name, @{typ "bool => bool"}, []) |
42542
024920b65ce2
perform constant mangling and/or removal of its type args in an earlier phase, so that the rest of the code doesn't need to worry about it
blanchet
parents:
42541
diff
changeset
|
1455 |
|
43859 | 1456 |
fun list_app head args = fold (curry (IApp o swap)) args head |
44773
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
1457 |
fun predicator tm = IApp (predicator_combconst, tm) |
42544
75cb06eee990
reimplemented the hAPP introduction code so that it's done earlier, when the types are still available
blanchet
parents:
42543
diff
changeset
|
1458 |
|
44774
72785558a6ff
separate mangling, which can (and should) be done before the formulas are first-orderized, and type arg filtering, which must be done after once the min arities have been computed
blanchet
parents:
44773
diff
changeset
|
1459 |
fun firstorderize_fact thy format type_enc sym_tab = |
42544
75cb06eee990
reimplemented the hAPP introduction code so that it's done earlier, when the types are still available
blanchet
parents:
42543
diff
changeset
|
1460 |
let |
44773
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
1461 |
fun do_app arg head = |
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
1462 |
let |
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
1463 |
val head_T = ityp_of head |
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
1464 |
val (arg_T, res_T) = dest_funT head_T |
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
1465 |
val app = |
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
1466 |
IConst (app_op, head_T --> head_T, [arg_T, res_T]) |
44774
72785558a6ff
separate mangling, which can (and should) be done before the formulas are first-orderized, and type arg filtering, which must be done after once the min arities have been computed
blanchet
parents:
44773
diff
changeset
|
1467 |
|> mangle_type_args_in_iterm format type_enc |
44773
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
1468 |
in list_app app [head, arg] end |
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
1469 |
fun list_app_ops head args = fold do_app args head |
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
1470 |
fun introduce_app_ops tm = |
43859 | 1471 |
case strip_iterm_comb tm of |
1472 |
(head as IConst ((s, _), _, _), args) => |
|
44773
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
1473 |
args |> map introduce_app_ops |
44772 | 1474 |
|> chop (min_ary_of sym_tab s) |
42544
75cb06eee990
reimplemented the hAPP introduction code so that it's done earlier, when the types are still available
blanchet
parents:
42543
diff
changeset
|
1475 |
|>> list_app head |
44773
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
1476 |
|-> list_app_ops |
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
1477 |
| (head, args) => list_app_ops head (map introduce_app_ops args) |
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
1478 |
fun introduce_predicators tm = |
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
1479 |
case strip_iterm_comb tm of |
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
1480 |
(IConst ((s, _), _, _), _) => |
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
1481 |
if is_pred_sym sym_tab s then tm else predicator tm |
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
1482 |
| _ => predicator tm |
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
1483 |
val do_iterm = |
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
1484 |
not (is_type_enc_higher_order type_enc) |
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
1485 |
? (introduce_app_ops #> introduce_predicators) |
44774
72785558a6ff
separate mangling, which can (and should) be done before the formulas are first-orderized, and type arg filtering, which must be done after once the min arities have been computed
blanchet
parents:
44773
diff
changeset
|
1486 |
#> filter_type_args_in_iterm thy type_enc |
44773
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
1487 |
in update_iformula (formula_map do_iterm) end |
42573
744215c3e90c
got rid of one "sym_table" in "prepare_atp_problem" now that proxies are always handled first, and tuned accordingly
blanchet
parents:
42572
diff
changeset
|
1488 |
|
744215c3e90c
got rid of one "sym_table" in "prepare_atp_problem" now that proxies are always handled first, and tuned accordingly
blanchet
parents:
42572
diff
changeset
|
1489 |
(** Helper facts **) |
744215c3e90c
got rid of one "sym_table" in "prepare_atp_problem" now that proxies are always handled first, and tuned accordingly
blanchet
parents:
42572
diff
changeset
|
1490 |
|
44450
d848dd7b21f4
fixed "hBOOL" of existential variables, and generate more helpers
blanchet
parents:
44418
diff
changeset
|
1491 |
val not_ffalse = @{lemma "~ fFalse" by (unfold fFalse_def) fast} |
d848dd7b21f4
fixed "hBOOL" of existential variables, and generate more helpers
blanchet
parents:
44418
diff
changeset
|
1492 |
val ftrue = @{lemma "fTrue" by (unfold fTrue_def) fast} |
d848dd7b21f4
fixed "hBOOL" of existential variables, and generate more helpers
blanchet
parents:
44418
diff
changeset
|
1493 |
|
43194 | 1494 |
(* The Boolean indicates that a fairly sound type encoding is needed. *) |
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
1495 |
val helper_table = |
43194 | 1496 |
[(("COMBI", false), @{thms Meson.COMBI_def}), |
1497 |
(("COMBK", false), @{thms Meson.COMBK_def}), |
|
1498 |
(("COMBB", false), @{thms Meson.COMBB_def}), |
|
1499 |
(("COMBC", false), @{thms Meson.COMBC_def}), |
|
1500 |
(("COMBS", false), @{thms Meson.COMBS_def}), |
|
44450
d848dd7b21f4
fixed "hBOOL" of existential variables, and generate more helpers
blanchet
parents:
44418
diff
changeset
|
1501 |
((predicator_name, false), [not_ffalse, ftrue]), |
d848dd7b21f4
fixed "hBOOL" of existential variables, and generate more helpers
blanchet
parents:
44418
diff
changeset
|
1502 |
(("fFalse", false), [not_ffalse]), |
43194 | 1503 |
(("fFalse", true), @{thms True_or_False}), |
44450
d848dd7b21f4
fixed "hBOOL" of existential variables, and generate more helpers
blanchet
parents:
44418
diff
changeset
|
1504 |
(("fTrue", false), [ftrue]), |
43194 | 1505 |
(("fTrue", true), @{thms True_or_False}), |
1506 |
(("fNot", false), |
|
1507 |
@{thms fNot_def [THEN Meson.iff_to_disjD, THEN conjunct1] |
|
1508 |
fNot_def [THEN Meson.iff_to_disjD, THEN conjunct2]}), |
|
1509 |
(("fconj", false), |
|
1510 |
@{lemma "~ P | ~ Q | fconj P Q" "~ fconj P Q | P" "~ fconj P Q | Q" |
|
1511 |
by (unfold fconj_def) fast+}), |
|
1512 |
(("fdisj", false), |
|
1513 |
@{lemma "~ P | fdisj P Q" "~ Q | fdisj P Q" "~ fdisj P Q | P | Q" |
|
1514 |
by (unfold fdisj_def) fast+}), |
|
1515 |
(("fimplies", false), |
|
43210
7384b771805d
made "explicit_apply"'s smart mode (more) complete
blanchet
parents:
43207
diff
changeset
|
1516 |
@{lemma "P | fimplies P Q" "~ Q | fimplies P Q" "~ fimplies P Q | ~ P | Q" |
43194 | 1517 |
by (unfold fimplies_def) fast+}), |
43678 | 1518 |
(("fequal", true), |
1519 |
(* This is a lie: Higher-order equality doesn't need a sound type encoding. |
|
1520 |
However, this is done so for backward compatibility: Including the |
|
1521 |
equality helpers by default in Metis breaks a few existing proofs. *) |
|
1522 |
@{thms fequal_def [THEN Meson.iff_to_disjD, THEN conjunct1] |
|
1523 |
fequal_def [THEN Meson.iff_to_disjD, THEN conjunct2]}), |
|
44003 | 1524 |
(* Partial characterization of "fAll" and "fEx". A complete characterization |
1525 |
would require the axiom of choice for replay with Metis. *) |
|
1526 |
(("fAll", false), [@{lemma "~ fAll P | P x" by (auto simp: fAll_def)}]), |
|
1527 |
(("fEx", false), [@{lemma "~ P x | fEx P" by (auto simp: fEx_def)}]), |
|
43194 | 1528 |
(("If", true), @{thms if_True if_False True_or_False})] |
1529 |
|> map (apsnd (map zero_var_indexes)) |
|
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
1530 |
|
45364
d00339ae7fff
repaired quantification over type variables for non-TFF1/THF encodings
blanchet
parents:
45316
diff
changeset
|
1531 |
fun atype_of_type_vars (Simple_Types (_, Polymorphic, _)) = SOME atype_of_types |
d00339ae7fff
repaired quantification over type variables for non-TFF1/THF encodings
blanchet
parents:
45316
diff
changeset
|
1532 |
| atype_of_type_vars _ = NONE |
d00339ae7fff
repaired quantification over type variables for non-TFF1/THF encodings
blanchet
parents:
45316
diff
changeset
|
1533 |
|
45316
08d84bdd5b37
improve handling of bound type variables (esp. for TFF1)
blanchet
parents:
45315
diff
changeset
|
1534 |
fun bound_tvars type_enc Ts = |
08d84bdd5b37
improve handling of bound type variables (esp. for TFF1)
blanchet
parents:
45315
diff
changeset
|
1535 |
mk_ahorn (formulas_for_types type_enc add_sorts_on_tvar Ts) |
08d84bdd5b37
improve handling of bound type variables (esp. for TFF1)
blanchet
parents:
45315
diff
changeset
|
1536 |
#> mk_aquant AForall |
08d84bdd5b37
improve handling of bound type variables (esp. for TFF1)
blanchet
parents:
45315
diff
changeset
|
1537 |
(map_filter (fn TVar (x as (s, _), _) => |
08d84bdd5b37
improve handling of bound type variables (esp. for TFF1)
blanchet
parents:
45315
diff
changeset
|
1538 |
SOME ((make_schematic_type_var x, s), |
45364
d00339ae7fff
repaired quantification over type variables for non-TFF1/THF encodings
blanchet
parents:
45316
diff
changeset
|
1539 |
atype_of_type_vars type_enc) |
45316
08d84bdd5b37
improve handling of bound type variables (esp. for TFF1)
blanchet
parents:
45315
diff
changeset
|
1540 |
| _ => NONE) Ts) |
44404
3111af540141
tuning, plus started implementing tag equation generation for existential variables
blanchet
parents:
44403
diff
changeset
|
1541 |
|
3111af540141
tuning, plus started implementing tag equation generation for existential variables
blanchet
parents:
44403
diff
changeset
|
1542 |
fun eq_formula type_enc atomic_Ts pred_sym tm1 tm2 = |
3111af540141
tuning, plus started implementing tag equation generation for existential variables
blanchet
parents:
44403
diff
changeset
|
1543 |
(if pred_sym then AConn (AIff, [AAtom tm1, AAtom tm2]) |
3111af540141
tuning, plus started implementing tag equation generation for existential variables
blanchet
parents:
44403
diff
changeset
|
1544 |
else AAtom (ATerm (`I tptp_equal, [tm1, tm2]))) |
45377 | 1545 |
|> close_formula_universally |
44404
3111af540141
tuning, plus started implementing tag equation generation for existential variables
blanchet
parents:
44403
diff
changeset
|
1546 |
|> bound_tvars type_enc atomic_Ts |
3111af540141
tuning, plus started implementing tag equation generation for existential variables
blanchet
parents:
44403
diff
changeset
|
1547 |
|
44495 | 1548 |
val type_tag = `(make_fixed_const NONE) type_tag_name |
43130
d73fc2e55308
implemented missing hAPP and ti cases of new path finder
blanchet
parents:
43129
diff
changeset
|
1549 |
|
45301
866b075aa99b
added sorted DFG output for coming version of SPASS
blanchet
parents:
45299
diff
changeset
|
1550 |
fun type_tag_idempotence_fact format type_enc = |
42573
744215c3e90c
got rid of one "sym_table" in "prepare_atp_problem" now that proxies are always handled first, and tuned accordingly
blanchet
parents:
42572
diff
changeset
|
1551 |
let |
744215c3e90c
got rid of one "sym_table" in "prepare_atp_problem" now that proxies are always handled first, and tuned accordingly
blanchet
parents:
42572
diff
changeset
|
1552 |
fun var s = ATerm (`I s, []) |
44408
30ea62ab4f16
made reconstruction of type tag equalities "\?x = \?x" reliable
blanchet
parents:
44406
diff
changeset
|
1553 |
fun tag tm = ATerm (type_tag, [var "A", tm]) |
30ea62ab4f16
made reconstruction of type tag equalities "\?x = \?x" reliable
blanchet
parents:
44406
diff
changeset
|
1554 |
val tagged_var = tag (var "X") |
42573
744215c3e90c
got rid of one "sym_table" in "prepare_atp_problem" now that proxies are always handled first, and tuned accordingly
blanchet
parents:
42572
diff
changeset
|
1555 |
in |
43159
29b55f292e0b
added support for helpers in new Metis, so far only for polymorphic type encodings
blanchet
parents:
43139
diff
changeset
|
1556 |
Formula (type_tag_idempotence_helper_name, Axiom, |
44405
6fe1a89bb69a
generate tag equations for existential variables
blanchet
parents:
44404
diff
changeset
|
1557 |
eq_formula type_enc [] false (tag tagged_var) tagged_var, |
45301
866b075aa99b
added sorted DFG output for coming version of SPASS
blanchet
parents:
45299
diff
changeset
|
1558 |
isabelle_info format simpN, NONE) |
42573
744215c3e90c
got rid of one "sym_table" in "prepare_atp_problem" now that proxies are always handled first, and tuned accordingly
blanchet
parents:
42572
diff
changeset
|
1559 |
end |
744215c3e90c
got rid of one "sym_table" in "prepare_atp_problem" now that proxies are always handled first, and tuned accordingly
blanchet
parents:
42572
diff
changeset
|
1560 |
|
43626
a867ebb12209
renamed "type_sys" to "type_enc", which is more accurate
blanchet
parents:
43624
diff
changeset
|
1561 |
fun should_specialize_helper type_enc t = |
44493
c2602c5d4b0a
handle nonmangled monomorphich the same way as mangled monomorphic when it comes to helper -- otherwise we can end up generating too tight type guards
blanchet
parents:
44491
diff
changeset
|
1562 |
polymorphism_of_type_enc type_enc <> Polymorphic andalso |
43628
996b2022ff78
further repair "mangled_tags", now that tags are also mangled
blanchet
parents:
43626
diff
changeset
|
1563 |
level_of_type_enc type_enc <> No_Types andalso |
996b2022ff78
further repair "mangled_tags", now that tags are also mangled
blanchet
parents:
43626
diff
changeset
|
1564 |
not (null (Term.hidden_polymorphism t)) |
43159
29b55f292e0b
added support for helpers in new Metis, so far only for polymorphic type encodings
blanchet
parents:
43139
diff
changeset
|
1565 |
|
43858
be41d12de6fa
simplify code -- there are no lambdas in helpers anyway
blanchet
parents:
43857
diff
changeset
|
1566 |
fun helper_facts_for_sym ctxt format type_enc (s, {types, ...} : sym_info) = |
42573
744215c3e90c
got rid of one "sym_table" in "prepare_atp_problem" now that proxies are always handled first, and tuned accordingly
blanchet
parents:
42572
diff
changeset
|
1567 |
case strip_prefix_and_unascii const_prefix s of |
744215c3e90c
got rid of one "sym_table" in "prepare_atp_problem" now that proxies are always handled first, and tuned accordingly
blanchet
parents:
42572
diff
changeset
|
1568 |
SOME mangled_s => |
744215c3e90c
got rid of one "sym_table" in "prepare_atp_problem" now that proxies are always handled first, and tuned accordingly
blanchet
parents:
42572
diff
changeset
|
1569 |
let |
744215c3e90c
got rid of one "sym_table" in "prepare_atp_problem" now that proxies are always handled first, and tuned accordingly
blanchet
parents:
42572
diff
changeset
|
1570 |
val thy = Proof_Context.theory_of ctxt |
744215c3e90c
got rid of one "sym_table" in "prepare_atp_problem" now that proxies are always handled first, and tuned accordingly
blanchet
parents:
42572
diff
changeset
|
1571 |
val unmangled_s = mangled_s |> unmangled_const_name |
43628
996b2022ff78
further repair "mangled_tags", now that tags are also mangled
blanchet
parents:
43626
diff
changeset
|
1572 |
fun dub needs_fairly_sound j k = |
996b2022ff78
further repair "mangled_tags", now that tags are also mangled
blanchet
parents:
43626
diff
changeset
|
1573 |
(unmangled_s ^ "_" ^ string_of_int j ^ "_" ^ string_of_int k ^ |
996b2022ff78
further repair "mangled_tags", now that tags are also mangled
blanchet
parents:
43626
diff
changeset
|
1574 |
(if mangled_s = unmangled_s then "" else "_" ^ ascii_of mangled_s) ^ |
996b2022ff78
further repair "mangled_tags", now that tags are also mangled
blanchet
parents:
43626
diff
changeset
|
1575 |
(if needs_fairly_sound then typed_helper_suffix |
996b2022ff78
further repair "mangled_tags", now that tags are also mangled
blanchet
parents:
43626
diff
changeset
|
1576 |
else untyped_helper_suffix), |
996b2022ff78
further repair "mangled_tags", now that tags are also mangled
blanchet
parents:
43626
diff
changeset
|
1577 |
Helper) |
43159
29b55f292e0b
added support for helpers in new Metis, so far only for polymorphic type encodings
blanchet
parents:
43139
diff
changeset
|
1578 |
fun dub_and_inst needs_fairly_sound (th, j) = |
43628
996b2022ff78
further repair "mangled_tags", now that tags are also mangled
blanchet
parents:
43626
diff
changeset
|
1579 |
let val t = prop_of th in |
996b2022ff78
further repair "mangled_tags", now that tags are also mangled
blanchet
parents:
43626
diff
changeset
|
1580 |
if should_specialize_helper type_enc t then |
996b2022ff78
further repair "mangled_tags", now that tags are also mangled
blanchet
parents:
43626
diff
changeset
|
1581 |
map (fn T => specialize_type thy (invert_const unmangled_s, T) t) |
996b2022ff78
further repair "mangled_tags", now that tags are also mangled
blanchet
parents:
43626
diff
changeset
|
1582 |
types |
996b2022ff78
further repair "mangled_tags", now that tags are also mangled
blanchet
parents:
43626
diff
changeset
|
1583 |
else |
996b2022ff78
further repair "mangled_tags", now that tags are also mangled
blanchet
parents:
43626
diff
changeset
|
1584 |
[t] |
996b2022ff78
further repair "mangled_tags", now that tags are also mangled
blanchet
parents:
43626
diff
changeset
|
1585 |
end |
996b2022ff78
further repair "mangled_tags", now that tags are also mangled
blanchet
parents:
43626
diff
changeset
|
1586 |
|> map (fn (k, t) => (dub needs_fairly_sound j k, t)) o tag_list 1 |
43860
57ef3cd4126e
more refactoring of preprocessing, so as to be able to centralize it
blanchet
parents:
43859
diff
changeset
|
1587 |
val make_facts = map_filter (make_fact ctxt format type_enc false) |
43626
a867ebb12209
renamed "type_sys" to "type_enc", which is more accurate
blanchet
parents:
43624
diff
changeset
|
1588 |
val fairly_sound = is_type_enc_fairly_sound type_enc |
42573
744215c3e90c
got rid of one "sym_table" in "prepare_atp_problem" now that proxies are always handled first, and tuned accordingly
blanchet
parents:
42572
diff
changeset
|
1589 |
in |
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
1590 |
helper_table |
43194 | 1591 |
|> maps (fn ((helper_s, needs_fairly_sound), ths) => |
43159
29b55f292e0b
added support for helpers in new Metis, so far only for polymorphic type encodings
blanchet
parents:
43139
diff
changeset
|
1592 |
if helper_s <> unmangled_s orelse |
42894
ce269ee43800
further improvements to "poly_{preds,tags}_{bang,query}" -- better solution to the combinator problem + make sure type assumptions can be discharged
blanchet
parents:
42893
diff
changeset
|
1593 |
(needs_fairly_sound andalso not fairly_sound) then |
42573
744215c3e90c
got rid of one "sym_table" in "prepare_atp_problem" now that proxies are always handled first, and tuned accordingly
blanchet
parents:
42572
diff
changeset
|
1594 |
[] |
744215c3e90c
got rid of one "sym_table" in "prepare_atp_problem" now that proxies are always handled first, and tuned accordingly
blanchet
parents:
42572
diff
changeset
|
1595 |
else |
744215c3e90c
got rid of one "sym_table" in "prepare_atp_problem" now that proxies are always handled first, and tuned accordingly
blanchet
parents:
42572
diff
changeset
|
1596 |
ths ~~ (1 upto length ths) |
43628
996b2022ff78
further repair "mangled_tags", now that tags are also mangled
blanchet
parents:
43626
diff
changeset
|
1597 |
|> maps (dub_and_inst needs_fairly_sound) |
43159
29b55f292e0b
added support for helpers in new Metis, so far only for polymorphic type encodings
blanchet
parents:
43139
diff
changeset
|
1598 |
|> make_facts) |
42573
744215c3e90c
got rid of one "sym_table" in "prepare_atp_problem" now that proxies are always handled first, and tuned accordingly
blanchet
parents:
42572
diff
changeset
|
1599 |
end |
744215c3e90c
got rid of one "sym_table" in "prepare_atp_problem" now that proxies are always handled first, and tuned accordingly
blanchet
parents:
42572
diff
changeset
|
1600 |
| NONE => [] |
43858
be41d12de6fa
simplify code -- there are no lambdas in helpers anyway
blanchet
parents:
43857
diff
changeset
|
1601 |
fun helper_facts_for_sym_table ctxt format type_enc sym_tab = |
be41d12de6fa
simplify code -- there are no lambdas in helpers anyway
blanchet
parents:
43857
diff
changeset
|
1602 |
Symtab.fold_rev (append o helper_facts_for_sym ctxt format type_enc) sym_tab |
be41d12de6fa
simplify code -- there are no lambdas in helpers anyway
blanchet
parents:
43857
diff
changeset
|
1603 |
[] |
42573
744215c3e90c
got rid of one "sym_table" in "prepare_atp_problem" now that proxies are always handled first, and tuned accordingly
blanchet
parents:
42572
diff
changeset
|
1604 |
|
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
1605 |
(***************************************************************) |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
1606 |
(* Type Classes Present in the Axiom or Conjecture Clauses *) |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
1607 |
(***************************************************************) |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
1608 |
|
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
1609 |
fun set_insert (x, s) = Symtab.update (x, ()) s |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
1610 |
|
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
1611 |
fun add_classes (sorts, cset) = List.foldl set_insert cset (flat sorts) |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
1612 |
|
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
1613 |
(* Remove this trivial type class (FIXME: similar code elsewhere) *) |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
1614 |
fun delete_type cset = Symtab.delete_safe (the_single @{sort HOL.type}) cset |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
1615 |
|
43093 | 1616 |
fun classes_of_terms get_Ts = |
43121 | 1617 |
map (map snd o get_Ts) |
43093 | 1618 |
#> List.foldl add_classes Symtab.empty |
1619 |
#> delete_type #> Symtab.keys |
|
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
1620 |
|
44121 | 1621 |
val tfree_classes_of_terms = classes_of_terms Misc_Legacy.term_tfrees |
1622 |
val tvar_classes_of_terms = classes_of_terms Misc_Legacy.term_tvars |
|
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
1623 |
|
43622 | 1624 |
fun fold_type_constrs f (Type (s, Ts)) x = |
1625 |
fold (fold_type_constrs f) Ts (f (s, x)) |
|
43189 | 1626 |
| fold_type_constrs _ _ x = x |
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
1627 |
|
43907
073ab5379842
pass type arguments to lambda-lifted Frees, to account for polymorphism
blanchet
parents:
43906
diff
changeset
|
1628 |
(* Type constructors used to instantiate overloaded constants are the only ones |
073ab5379842
pass type arguments to lambda-lifted Frees, to account for polymorphism
blanchet
parents:
43906
diff
changeset
|
1629 |
needed. *) |
43189 | 1630 |
fun add_type_constrs_in_term thy = |
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
1631 |
let |
43188
0c36ae874fcc
fixed detection of Skolem constants in type construction detection code
blanchet
parents:
43185
diff
changeset
|
1632 |
fun add (Const (@{const_name Meson.skolem}, _) $ _) = I |
43181 | 1633 |
| add (t $ u) = add t #> add u |
44738
1b333e4173a2
drop more type arguments soundly, when they can be deduced from the arg types
blanchet
parents:
44634
diff
changeset
|
1634 |
| add (Const x) = |
1b333e4173a2
drop more type arguments soundly, when they can be deduced from the arg types
blanchet
parents:
44634
diff
changeset
|
1635 |
x |> robust_const_typargs thy |> fold (fold_type_constrs set_insert) |
43907
073ab5379842
pass type arguments to lambda-lifted Frees, to account for polymorphism
blanchet
parents:
43906
diff
changeset
|
1636 |
| add (Free (s, T)) = |
45508 | 1637 |
if String.isPrefix lambda_lifted_poly_prefix s then |
43907
073ab5379842
pass type arguments to lambda-lifted Frees, to account for polymorphism
blanchet
parents:
43906
diff
changeset
|
1638 |
T |> fold_type_constrs set_insert |
073ab5379842
pass type arguments to lambda-lifted Frees, to account for polymorphism
blanchet
parents:
43906
diff
changeset
|
1639 |
else |
073ab5379842
pass type arguments to lambda-lifted Frees, to account for polymorphism
blanchet
parents:
43906
diff
changeset
|
1640 |
I |
43181 | 1641 |
| add (Abs (_, _, u)) = add u |
1642 |
| add _ = I |
|
1643 |
in add end |
|
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
1644 |
|
43189 | 1645 |
fun type_constrs_of_terms thy ts = |
1646 |
Symtab.keys (fold (add_type_constrs_in_term thy) ts Symtab.empty) |
|
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
1647 |
|
45508 | 1648 |
val extract_lambda_def = |
1649 |
let |
|
1650 |
fun extr [] (@{const Trueprop} $ t) = extr [] t |
|
1651 |
| extr bs (Const (@{const_name All}, _) $ Abs (s, T, t)) = |
|
1652 |
extr ((s, T) :: bs) t |
|
1653 |
| extr bs (Const (@{const_name HOL.eq}, _) $ t $ u) = |
|
1654 |
(t |> head_of |> dest_Free |> fst, |
|
1655 |
fold_rev (fn (s, T) => fn u => Abs (s, T, u)) bs u) |
|
1656 |
| extr _ _ = raise Fail "malformed lifted lambda" |
|
1657 |
in extr [] end |
|
1658 |
||
43856
d636b053d4ff
move more lambda-handling logic to Sledgehammer, from ATP module, for formal dependency reasons
blanchet
parents:
43830
diff
changeset
|
1659 |
fun translate_formulas ctxt format prem_kind type_enc trans_lambdas preproc |
43828
e07a2c4cbad8
move lambda translation option from ATP to Sledgehammer, to avoid accidentally breaking Metis (its reconstruction code can only deal with combinators)
blanchet
parents:
43827
diff
changeset
|
1660 |
hyp_ts concl_t facts = |
42573
744215c3e90c
got rid of one "sym_table" in "prepare_atp_problem" now that proxies are always handled first, and tuned accordingly
blanchet
parents:
42572
diff
changeset
|
1661 |
let |
744215c3e90c
got rid of one "sym_table" in "prepare_atp_problem" now that proxies are always handled first, and tuned accordingly
blanchet
parents:
42572
diff
changeset
|
1662 |
val thy = Proof_Context.theory_of ctxt |
43264
a1a48c69d623
don't needlessly presimplify -- makes ATP problem preparation much faster
blanchet
parents:
43263
diff
changeset
|
1663 |
val presimp_consts = Meson.presimplified_consts ctxt |
43861 | 1664 |
val fact_ts = facts |> map snd |
42573
744215c3e90c
got rid of one "sym_table" in "prepare_atp_problem" now that proxies are always handled first, and tuned accordingly
blanchet
parents:
42572
diff
changeset
|
1665 |
(* Remove existing facts from the conjecture, as this can dramatically |
744215c3e90c
got rid of one "sym_table" in "prepare_atp_problem" now that proxies are always handled first, and tuned accordingly
blanchet
parents:
42572
diff
changeset
|
1666 |
boost an ATP's performance (for some reason). *) |
43192 | 1667 |
val hyp_ts = |
1668 |
hyp_ts |
|
1669 |
|> map (fn t => if member (op aconv) fact_ts t then @{prop True} else t) |
|
43864
58a7b3fdc193
fixed lambda-liftg: must ensure the formulas are in close form
blanchet
parents:
43863
diff
changeset
|
1670 |
val facts = facts |> map (apsnd (pair Axiom)) |
58a7b3fdc193
fixed lambda-liftg: must ensure the formulas are in close form
blanchet
parents:
43863
diff
changeset
|
1671 |
val conjs = |
44460 | 1672 |
map (pair prem_kind) hyp_ts @ [(Conjecture, s_not_trueprop concl_t)] |
45168
0e8e662013f9
freeze conjecture schematics before applying lambda-translation, which sometimes calls "close_form" and ruins it for freezing
blanchet
parents:
45167
diff
changeset
|
1673 |
|> map (apsnd freeze_term) |
43863
a43d61270142
ensure that the lambda translation procedure is called only once with all the facts, which is necessary for soundness of lambda-lifting (freshness of new names)
blanchet
parents:
43862
diff
changeset
|
1674 |
|> map2 (pair o rpair Local o string_of_int) (0 upto length hyp_ts) |
45508 | 1675 |
val ((conjs, facts), lambda_facts) = |
43864
58a7b3fdc193
fixed lambda-liftg: must ensure the formulas are in close form
blanchet
parents:
43863
diff
changeset
|
1676 |
if preproc then |
58a7b3fdc193
fixed lambda-liftg: must ensure the formulas are in close form
blanchet
parents:
43863
diff
changeset
|
1677 |
conjs @ facts |
45202
62b8bcf24773
avoid generating too meta theorems -- this sometimes leads to type errors, e.g. when "pp" is applied to a "prop" instead of a "bool"
blanchet
parents:
45168
diff
changeset
|
1678 |
|> map (apsnd (uncurry (presimp_prop ctxt presimp_consts))) |
43864
58a7b3fdc193
fixed lambda-liftg: must ensure the formulas are in close form
blanchet
parents:
43863
diff
changeset
|
1679 |
|> preprocess_abstractions_in_terms trans_lambdas |
58a7b3fdc193
fixed lambda-liftg: must ensure the formulas are in close form
blanchet
parents:
43863
diff
changeset
|
1680 |
|>> chop (length conjs) |
58a7b3fdc193
fixed lambda-liftg: must ensure the formulas are in close form
blanchet
parents:
43863
diff
changeset
|
1681 |
else |
58a7b3fdc193
fixed lambda-liftg: must ensure the formulas are in close form
blanchet
parents:
43863
diff
changeset
|
1682 |
((conjs, facts), []) |
44773
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
1683 |
val conjs = conjs |> make_conjecture ctxt format type_enc |
43863
a43d61270142
ensure that the lambda translation procedure is called only once with all the facts, which is necessary for soundness of lambda-lifting (freshness of new names)
blanchet
parents:
43862
diff
changeset
|
1684 |
val (fact_names, facts) = |
43864
58a7b3fdc193
fixed lambda-liftg: must ensure the formulas are in close form
blanchet
parents:
43863
diff
changeset
|
1685 |
facts |
43863
a43d61270142
ensure that the lambda translation procedure is called only once with all the facts, which is necessary for soundness of lambda-lifting (freshness of new names)
blanchet
parents:
43862
diff
changeset
|
1686 |
|> map_filter (fn (name, (_, t)) => |
a43d61270142
ensure that the lambda translation procedure is called only once with all the facts, which is necessary for soundness of lambda-lifting (freshness of new names)
blanchet
parents:
43862
diff
changeset
|
1687 |
make_fact ctxt format type_enc true (name, t) |
a43d61270142
ensure that the lambda translation procedure is called only once with all the facts, which is necessary for soundness of lambda-lifting (freshness of new names)
blanchet
parents:
43862
diff
changeset
|
1688 |
|> Option.map (pair name)) |
43861 | 1689 |
|> ListPair.unzip |
45508 | 1690 |
val lifted = lambda_facts |> map (extract_lambda_def o snd o snd) |
1691 |
val lambda_facts = |
|
1692 |
lambda_facts |
|
1693 |
|> map_filter (make_fact ctxt format type_enc true o apsnd snd) |
|
43861 | 1694 |
val all_ts = concl_t :: hyp_ts @ fact_ts |
42573
744215c3e90c
got rid of one "sym_table" in "prepare_atp_problem" now that proxies are always handled first, and tuned accordingly
blanchet
parents:
42572
diff
changeset
|
1695 |
val subs = tfree_classes_of_terms all_ts |
744215c3e90c
got rid of one "sym_table" in "prepare_atp_problem" now that proxies are always handled first, and tuned accordingly
blanchet
parents:
42572
diff
changeset
|
1696 |
val supers = tvar_classes_of_terms all_ts |
43189 | 1697 |
val tycons = type_constrs_of_terms thy all_ts |
43861 | 1698 |
val (supers, arity_clauses) = |
43626
a867ebb12209
renamed "type_sys" to "type_enc", which is more accurate
blanchet
parents:
43624
diff
changeset
|
1699 |
if level_of_type_enc type_enc = No_Types then ([], []) |
42573
744215c3e90c
got rid of one "sym_table" in "prepare_atp_problem" now that proxies are always handled first, and tuned accordingly
blanchet
parents:
42572
diff
changeset
|
1700 |
else make_arity_clauses thy tycons supers |
43861 | 1701 |
val class_rel_clauses = make_class_rel_clauses thy subs supers |
42573
744215c3e90c
got rid of one "sym_table" in "prepare_atp_problem" now that proxies are always handled first, and tuned accordingly
blanchet
parents:
42572
diff
changeset
|
1702 |
in |
45508 | 1703 |
(fact_names |> map single, union (op =) subs supers, conjs, |
1704 |
facts @ lambda_facts, class_rel_clauses, arity_clauses, lifted) |
|
42573
744215c3e90c
got rid of one "sym_table" in "prepare_atp_problem" now that proxies are always handled first, and tuned accordingly
blanchet
parents:
42572
diff
changeset
|
1705 |
end |
744215c3e90c
got rid of one "sym_table" in "prepare_atp_problem" now that proxies are always handled first, and tuned accordingly
blanchet
parents:
42572
diff
changeset
|
1706 |
|
44495 | 1707 |
val type_guard = `(make_fixed_const NONE) type_guard_name |
43130
d73fc2e55308
implemented missing hAPP and ti cases of new path finder
blanchet
parents:
43129
diff
changeset
|
1708 |
|
44774
72785558a6ff
separate mangling, which can (and should) be done before the formulas are first-orderized, and type arg filtering, which must be done after once the min arities have been computed
blanchet
parents:
44773
diff
changeset
|
1709 |
fun type_guard_iterm format type_enc T tm = |
44396
66b9b3fcd608
started cleaning up polymorphic monotonicity-based encodings, based on discussions with Nick Smallbone
blanchet
parents:
44394
diff
changeset
|
1710 |
IApp (IConst (type_guard, T --> @{typ bool}, [T]) |
44774
72785558a6ff
separate mangling, which can (and should) be done before the formulas are first-orderized, and type arg filtering, which must be done after once the min arities have been computed
blanchet
parents:
44773
diff
changeset
|
1711 |
|> mangle_type_args_in_iterm format type_enc, tm) |
42573
744215c3e90c
got rid of one "sym_table" in "prepare_atp_problem" now that proxies are always handled first, and tuned accordingly
blanchet
parents:
42572
diff
changeset
|
1712 |
|
43421 | 1713 |
fun is_var_positively_naked_in_term _ (SOME false) _ accum = accum |
1714 |
| is_var_positively_naked_in_term name _ (ATerm ((s, _), tms)) accum = |
|
43000
bd424c3dde46
cleaner handling of equality and proxies (esp. for THF)
blanchet
parents:
42998
diff
changeset
|
1715 |
accum orelse (is_tptp_equal s andalso member (op =) tms (ATerm (name, []))) |
43692 | 1716 |
| is_var_positively_naked_in_term _ _ _ _ = true |
44403
15160cdc4688
precisely distinguish between universal and existential quantifiers, instead of assuming the worst (universal), for monotonicity analysis
blanchet
parents:
44402
diff
changeset
|
1717 |
|
44811 | 1718 |
fun is_var_ghost_type_arg_in_term thy name pos tm accum = |
1719 |
is_var_positively_naked_in_term name pos tm accum orelse |
|
1720 |
let |
|
1721 |
val var = ATerm (name, []) |
|
1722 |
fun is_nasty_in_term (ATerm (_, [])) = false |
|
1723 |
| is_nasty_in_term (ATerm ((s, _), tms)) = |
|
1724 |
(member (op =) tms var andalso |
|
1725 |
let val ary = length tms in |
|
1726 |
case ghost_type_args thy s ary of |
|
1727 |
[] => false |
|
1728 |
| ghosts => |
|
1729 |
exists (fn (j, tm) => tm = var andalso member (op =) ghosts j) |
|
1730 |
(0 upto length tms - 1 ~~ tms) |
|
1731 |
end) orelse |
|
1732 |
exists is_nasty_in_term tms |
|
1733 |
| is_nasty_in_term _ = true |
|
1734 |
in is_nasty_in_term tm end |
|
1735 |
||
1736 |
fun should_guard_var_in_formula thy level pos phi (SOME true) name = |
|
1737 |
(case granularity_of_type_level level of |
|
1738 |
All_Vars => true |
|
1739 |
| Positively_Naked_Vars => |
|
1740 |
formula_fold pos (is_var_positively_naked_in_term name) phi false |
|
1741 |
| Ghost_Type_Arg_Vars => |
|
1742 |
formula_fold pos (is_var_ghost_type_arg_in_term thy name) phi false) |
|
1743 |
| should_guard_var_in_formula _ _ _ _ _ _ = true |
|
42834
40f7691d0539
implemented thin versions of "preds" type systems + fixed various issues with type args
blanchet
parents:
42832
diff
changeset
|
1744 |
|
44405
6fe1a89bb69a
generate tag equations for existential variables
blanchet
parents:
44404
diff
changeset
|
1745 |
fun should_generate_tag_bound_decl _ _ _ (SOME true) _ = false |
44768 | 1746 |
| should_generate_tag_bound_decl ctxt mono (Tags (_, level)) _ T = |
44811 | 1747 |
granularity_of_type_level level <> All_Vars andalso |
44782 | 1748 |
should_encode_type ctxt mono level T |
44405
6fe1a89bb69a
generate tag equations for existential variables
blanchet
parents:
44404
diff
changeset
|
1749 |
| should_generate_tag_bound_decl _ _ _ _ _ = false |
44404
3111af540141
tuning, plus started implementing tag equation generation for existential variables
blanchet
parents:
44403
diff
changeset
|
1750 |
|
43677 | 1751 |
fun mk_aterm format type_enc name T_args args = |
1752 |
ATerm (name, map_filter (ho_term_for_type_arg format type_enc) T_args @ args) |
|
42994
fe291ab75eb5
towards supporting non-simply-typed encodings for TFF and THF (for orthogonality and experiments)
blanchet
parents:
42966
diff
changeset
|
1753 |
|
44399 | 1754 |
fun tag_with_type ctxt format mono type_enc pos T tm = |
43859 | 1755 |
IConst (type_tag, T --> T, [T]) |
44774
72785558a6ff
separate mangling, which can (and should) be done before the formulas are first-orderized, and type arg filtering, which must be done after once the min arities have been computed
blanchet
parents:
44773
diff
changeset
|
1756 |
|> mangle_type_args_in_iterm format type_enc |
44399 | 1757 |
|> ho_term_from_iterm ctxt format mono type_enc (Top_Level pos) |
43692 | 1758 |
|> (fn ATerm (s, tms) => ATerm (s, tms @ [tm]) |
1759 |
| _ => raise Fail "unexpected lambda-abstraction") |
|
44399 | 1760 |
and ho_term_from_iterm ctxt format mono type_enc = |
42573
744215c3e90c
got rid of one "sym_table" in "prepare_atp_problem" now that proxies are always handled first, and tuned accordingly
blanchet
parents:
42572
diff
changeset
|
1761 |
let |
44814
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
1762 |
fun term site u = |
42962
3b50fdeb6cfc
started adding support for THF output (but no lambdas)
blanchet
parents:
42956
diff
changeset
|
1763 |
let |
43859 | 1764 |
val (head, args) = strip_iterm_comb u |
43677 | 1765 |
val pos = |
43361
e37b54d429f5
revived the lightweight "poly_tags_{query,bang}" type encodings by fixing their soundness bug
blanchet
parents:
43324
diff
changeset
|
1766 |
case site of |
43677 | 1767 |
Top_Level pos => pos |
1768 |
| Eq_Arg pos => pos |
|
44814
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
1769 |
| _ => NONE |
43677 | 1770 |
val t = |
1771 |
case head of |
|
43859 | 1772 |
IConst (name as (s, _), _, T_args) => |
43677 | 1773 |
let |
44814
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
1774 |
fun arg_site j = |
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
1775 |
if is_tptp_equal s then Eq_Arg pos else Arg (s, j) |
43677 | 1776 |
in |
44814
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
1777 |
mk_aterm format type_enc name T_args |
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
1778 |
(map2 (term o arg_site) (0 upto length args - 1) args) |
43677 | 1779 |
end |
43859 | 1780 |
| IVar (name, _) => |
44814
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
1781 |
mk_aterm format type_enc name [] (map (term Elsewhere) args) |
43859 | 1782 |
| IAbs ((name, T), tm) => |
1783 |
AAbs ((name, ho_type_from_typ format type_enc true 0 T), |
|
44814
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
1784 |
term Elsewhere tm) |
43859 | 1785 |
| IApp _ => raise Fail "impossible \"IApp\"" |
1786 |
val T = ityp_of u |
|
42962
3b50fdeb6cfc
started adding support for THF output (but no lambdas)
blanchet
parents:
42956
diff
changeset
|
1787 |
in |
44399 | 1788 |
t |> (if should_tag_with_type ctxt mono type_enc site u T then |
1789 |
tag_with_type ctxt format mono type_enc pos T |
|
42962
3b50fdeb6cfc
started adding support for THF output (but no lambdas)
blanchet
parents:
42956
diff
changeset
|
1790 |
else |
3b50fdeb6cfc
started adding support for THF output (but no lambdas)
blanchet
parents:
42956
diff
changeset
|
1791 |
I) |
3b50fdeb6cfc
started adding support for THF output (but no lambdas)
blanchet
parents:
42956
diff
changeset
|
1792 |
end |
44814
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
1793 |
in term end |
44399 | 1794 |
and formula_from_iformula ctxt format mono type_enc should_guard_var = |
42829
1558741f8a72
started implementing "shallow" type systems, based on ideas by Claessen et al.
blanchet
parents:
42828
diff
changeset
|
1795 |
let |
44811 | 1796 |
val thy = Proof_Context.theory_of ctxt |
1797 |
val level = level_of_type_enc type_enc |
|
44399 | 1798 |
val do_term = ho_term_from_iterm ctxt format mono type_enc o Top_Level |
42573
744215c3e90c
got rid of one "sym_table" in "prepare_atp_problem" now that proxies are always handled first, and tuned accordingly
blanchet
parents:
42572
diff
changeset
|
1799 |
val do_bound_type = |
43626
a867ebb12209
renamed "type_sys" to "type_enc", which is more accurate
blanchet
parents:
43624
diff
changeset
|
1800 |
case type_enc of |
44811 | 1801 |
Simple_Types _ => fused_type ctxt mono level 0 |
43677 | 1802 |
#> ho_type_from_typ format type_enc false 0 #> SOME |
42682
562046fd8e0c
added type homogenization, whereby all (isomorphic) infinite types are mapped to the same type (to reduce the number of different predicates/TFF-types)
blanchet
parents:
42680
diff
changeset
|
1803 |
| _ => K NONE |
42878
85ac4c12a4b7
slightly fewer type predicates introduced in the lightweight encoding, based on the observation that only universal positive equalities are dangerous
blanchet
parents:
42855
diff
changeset
|
1804 |
fun do_out_of_bound_type pos phi universal (name, T) = |
44399 | 1805 |
if should_guard_type ctxt mono type_enc |
44811 | 1806 |
(fn () => should_guard_var thy level pos phi universal name) T then |
43859 | 1807 |
IVar (name, T) |
44774
72785558a6ff
separate mangling, which can (and should) be done before the formulas are first-orderized, and type arg filtering, which must be done after once the min arities have been computed
blanchet
parents:
44773
diff
changeset
|
1808 |
|> type_guard_iterm format type_enc T |
43361
e37b54d429f5
revived the lightweight "poly_tags_{query,bang}" type encodings by fixing their soundness bug
blanchet
parents:
43324
diff
changeset
|
1809 |
|> do_term pos |> AAtom |> SOME |
44405
6fe1a89bb69a
generate tag equations for existential variables
blanchet
parents:
44404
diff
changeset
|
1810 |
else if should_generate_tag_bound_decl ctxt mono type_enc universal T then |
6fe1a89bb69a
generate tag equations for existential variables
blanchet
parents:
44404
diff
changeset
|
1811 |
let |
6fe1a89bb69a
generate tag equations for existential variables
blanchet
parents:
44404
diff
changeset
|
1812 |
val var = ATerm (name, []) |
44505 | 1813 |
val tagged_var = var |> tag_with_type ctxt format mono type_enc pos T |
44405
6fe1a89bb69a
generate tag equations for existential variables
blanchet
parents:
44404
diff
changeset
|
1814 |
in SOME (AAtom (ATerm (`I tptp_equal, [tagged_var, var]))) end |
42573
744215c3e90c
got rid of one "sym_table" in "prepare_atp_problem" now that proxies are always handled first, and tuned accordingly
blanchet
parents:
42572
diff
changeset
|
1815 |
else |
744215c3e90c
got rid of one "sym_table" in "prepare_atp_problem" now that proxies are always handled first, and tuned accordingly
blanchet
parents:
42572
diff
changeset
|
1816 |
NONE |
42878
85ac4c12a4b7
slightly fewer type predicates introduced in the lightweight encoding, based on the observation that only universal positive equalities are dangerous
blanchet
parents:
42855
diff
changeset
|
1817 |
fun do_formula pos (AQuant (q, xs, phi)) = |
85ac4c12a4b7
slightly fewer type predicates introduced in the lightweight encoding, based on the observation that only universal positive equalities are dangerous
blanchet
parents:
42855
diff
changeset
|
1818 |
let |
85ac4c12a4b7
slightly fewer type predicates introduced in the lightweight encoding, based on the observation that only universal positive equalities are dangerous
blanchet
parents:
42855
diff
changeset
|
1819 |
val phi = phi |> do_formula pos |
85ac4c12a4b7
slightly fewer type predicates introduced in the lightweight encoding, based on the observation that only universal positive equalities are dangerous
blanchet
parents:
42855
diff
changeset
|
1820 |
val universal = Option.map (q = AExists ? not) pos |
85ac4c12a4b7
slightly fewer type predicates introduced in the lightweight encoding, based on the observation that only universal positive equalities are dangerous
blanchet
parents:
42855
diff
changeset
|
1821 |
in |
42834
40f7691d0539
implemented thin versions of "preds" type systems + fixed various issues with type args
blanchet
parents:
42832
diff
changeset
|
1822 |
AQuant (q, xs |> map (apsnd (fn NONE => NONE |
40f7691d0539
implemented thin versions of "preds" type systems + fixed various issues with type args
blanchet
parents:
42832
diff
changeset
|
1823 |
| SOME T => do_bound_type T)), |
40f7691d0539
implemented thin versions of "preds" type systems + fixed various issues with type args
blanchet
parents:
42832
diff
changeset
|
1824 |
(if q = AForall then mk_ahorn else fold_rev (mk_aconn AAnd)) |
40f7691d0539
implemented thin versions of "preds" type systems + fixed various issues with type args
blanchet
parents:
42832
diff
changeset
|
1825 |
(map_filter |
40f7691d0539
implemented thin versions of "preds" type systems + fixed various issues with type args
blanchet
parents:
42832
diff
changeset
|
1826 |
(fn (_, NONE) => NONE |
40f7691d0539
implemented thin versions of "preds" type systems + fixed various issues with type args
blanchet
parents:
42832
diff
changeset
|
1827 |
| (s, SOME T) => |
42878
85ac4c12a4b7
slightly fewer type predicates introduced in the lightweight encoding, based on the observation that only universal positive equalities are dangerous
blanchet
parents:
42855
diff
changeset
|
1828 |
do_out_of_bound_type pos phi universal (s, T)) |
85ac4c12a4b7
slightly fewer type predicates introduced in the lightweight encoding, based on the observation that only universal positive equalities are dangerous
blanchet
parents:
42855
diff
changeset
|
1829 |
xs) |
42834
40f7691d0539
implemented thin versions of "preds" type systems + fixed various issues with type args
blanchet
parents:
42832
diff
changeset
|
1830 |
phi) |
40f7691d0539
implemented thin versions of "preds" type systems + fixed various issues with type args
blanchet
parents:
42832
diff
changeset
|
1831 |
end |
42878
85ac4c12a4b7
slightly fewer type predicates introduced in the lightweight encoding, based on the observation that only universal positive equalities are dangerous
blanchet
parents:
42855
diff
changeset
|
1832 |
| do_formula pos (AConn conn) = aconn_map pos do_formula conn |
43361
e37b54d429f5
revived the lightweight "poly_tags_{query,bang}" type encodings by fixing their soundness bug
blanchet
parents:
43324
diff
changeset
|
1833 |
| do_formula pos (AAtom tm) = AAtom (do_term pos tm) |
43493
bdb11c68f142
generate type predicates for existentials/skolems, otherwise some problems might not be provable
blanchet
parents:
43423
diff
changeset
|
1834 |
in do_formula end |
42573
744215c3e90c
got rid of one "sym_table" in "prepare_atp_problem" now that proxies are always handled first, and tuned accordingly
blanchet
parents:
42572
diff
changeset
|
1835 |
|
744215c3e90c
got rid of one "sym_table" in "prepare_atp_problem" now that proxies are always handled first, and tuned accordingly
blanchet
parents:
42572
diff
changeset
|
1836 |
(* Each fact is given a unique fact number to avoid name clashes (e.g., because |
744215c3e90c
got rid of one "sym_table" in "prepare_atp_problem" now that proxies are always handled first, and tuned accordingly
blanchet
parents:
42572
diff
changeset
|
1837 |
of monomorphization). The TPTP explicitly forbids name clashes, and some of |
744215c3e90c
got rid of one "sym_table" in "prepare_atp_problem" now that proxies are always handled first, and tuned accordingly
blanchet
parents:
42572
diff
changeset
|
1838 |
the remote provers might care. *) |
44399 | 1839 |
fun formula_line_for_fact ctxt format prefix encode freshen pos mono type_enc |
1840 |
(j, {name, locality, kind, iformula, atomic_types}) = |
|
43864
58a7b3fdc193
fixed lambda-liftg: must ensure the formulas are in close form
blanchet
parents:
43863
diff
changeset
|
1841 |
(prefix ^ (if freshen then string_of_int j ^ "_" else "") ^ encode name, kind, |
43859 | 1842 |
iformula |
44399 | 1843 |
|> formula_from_iformula ctxt format mono type_enc |
1844 |
should_guard_var_in_formula |
|
43859 | 1845 |
(if pos then SOME true else NONE) |
45377 | 1846 |
|> close_formula_universally |
45315 | 1847 |
|> bound_tvars type_enc atomic_types, |
43493
bdb11c68f142
generate type predicates for existentials/skolems, otherwise some problems might not be provable
blanchet
parents:
43423
diff
changeset
|
1848 |
NONE, |
bdb11c68f142
generate type predicates for existentials/skolems, otherwise some problems might not be provable
blanchet
parents:
43423
diff
changeset
|
1849 |
case locality of |
45301
866b075aa99b
added sorted DFG output for coming version of SPASS
blanchet
parents:
45299
diff
changeset
|
1850 |
Intro => isabelle_info format introN |
866b075aa99b
added sorted DFG output for coming version of SPASS
blanchet
parents:
45299
diff
changeset
|
1851 |
| Elim => isabelle_info format elimN |
866b075aa99b
added sorted DFG output for coming version of SPASS
blanchet
parents:
45299
diff
changeset
|
1852 |
| Simp => isabelle_info format simpN |
43493
bdb11c68f142
generate type predicates for existentials/skolems, otherwise some problems might not be provable
blanchet
parents:
43423
diff
changeset
|
1853 |
| _ => NONE) |
bdb11c68f142
generate type predicates for existentials/skolems, otherwise some problems might not be provable
blanchet
parents:
43423
diff
changeset
|
1854 |
|> Formula |
42573
744215c3e90c
got rid of one "sym_table" in "prepare_atp_problem" now that proxies are always handled first, and tuned accordingly
blanchet
parents:
42572
diff
changeset
|
1855 |
|
45301
866b075aa99b
added sorted DFG output for coming version of SPASS
blanchet
parents:
45299
diff
changeset
|
1856 |
fun formula_line_for_class_rel_clause format type_enc |
44593
ccf40af26ae9
implement more of the polymorphic simply typed format TFF(1)
blanchet
parents:
44591
diff
changeset
|
1857 |
({name, subclass, superclass, ...} : class_rel_clause) = |
44622 | 1858 |
let val ty_arg = ATerm (tvar_a_name, []) in |
42577
78414ec6fa4e
made the format (TFF or FOF) of the TPTP problem a global argument of the problem again and have the ATPs report which formats they support
blanchet
parents:
42576
diff
changeset
|
1859 |
Formula (class_rel_clause_prefix ^ ascii_of name, Axiom, |
44622 | 1860 |
AConn (AImplies, |
44625 | 1861 |
[type_class_formula type_enc subclass ty_arg, |
1862 |
type_class_formula type_enc superclass ty_arg]) |
|
45377 | 1863 |
|> close_formula_universally, |
45301
866b075aa99b
added sorted DFG output for coming version of SPASS
blanchet
parents:
45299
diff
changeset
|
1864 |
isabelle_info format introN, NONE) |
42573
744215c3e90c
got rid of one "sym_table" in "prepare_atp_problem" now that proxies are always handled first, and tuned accordingly
blanchet
parents:
42572
diff
changeset
|
1865 |
end |
744215c3e90c
got rid of one "sym_table" in "prepare_atp_problem" now that proxies are always handled first, and tuned accordingly
blanchet
parents:
42572
diff
changeset
|
1866 |
|
44625 | 1867 |
fun formula_from_arity_atom type_enc (class, t, args) = |
1868 |
ATerm (t, map (fn arg => ATerm (arg, [])) args) |
|
1869 |
|> type_class_formula type_enc class |
|
42573
744215c3e90c
got rid of one "sym_table" in "prepare_atp_problem" now that proxies are always handled first, and tuned accordingly
blanchet
parents:
42572
diff
changeset
|
1870 |
|
45301
866b075aa99b
added sorted DFG output for coming version of SPASS
blanchet
parents:
45299
diff
changeset
|
1871 |
fun formula_line_for_arity_clause format type_enc |
45364
d00339ae7fff
repaired quantification over type variables for non-TFF1/THF encodings
blanchet
parents:
45316
diff
changeset
|
1872 |
({name, prem_atoms, concl_atom} : arity_clause) = |
43495 | 1873 |
Formula (arity_clause_prefix ^ name, Axiom, |
44625 | 1874 |
mk_ahorn (map (formula_from_arity_atom type_enc) prem_atoms) |
1875 |
(formula_from_arity_atom type_enc concl_atom) |
|
45364
d00339ae7fff
repaired quantification over type variables for non-TFF1/THF encodings
blanchet
parents:
45316
diff
changeset
|
1876 |
|> mk_aquant AForall |
d00339ae7fff
repaired quantification over type variables for non-TFF1/THF encodings
blanchet
parents:
45316
diff
changeset
|
1877 |
(map (rpair (atype_of_type_vars type_enc)) (#3 concl_atom)), |
45301
866b075aa99b
added sorted DFG output for coming version of SPASS
blanchet
parents:
45299
diff
changeset
|
1878 |
isabelle_info format introN, NONE) |
42573
744215c3e90c
got rid of one "sym_table" in "prepare_atp_problem" now that proxies are always handled first, and tuned accordingly
blanchet
parents:
42572
diff
changeset
|
1879 |
|
44399 | 1880 |
fun formula_line_for_conjecture ctxt format mono type_enc |
43859 | 1881 |
({name, kind, iformula, atomic_types, ...} : translated_formula) = |
42577
78414ec6fa4e
made the format (TFF or FOF) of the TPTP problem a global argument of the problem again and have the ATPs report which formats they support
blanchet
parents:
42576
diff
changeset
|
1882 |
Formula (conjecture_prefix ^ name, kind, |
45316
08d84bdd5b37
improve handling of bound type variables (esp. for TFF1)
blanchet
parents:
45315
diff
changeset
|
1883 |
iformula |
08d84bdd5b37
improve handling of bound type variables (esp. for TFF1)
blanchet
parents:
45315
diff
changeset
|
1884 |
|> formula_from_iformula ctxt format mono type_enc |
08d84bdd5b37
improve handling of bound type variables (esp. for TFF1)
blanchet
parents:
45315
diff
changeset
|
1885 |
should_guard_var_in_formula (SOME false) |
45377 | 1886 |
|> close_formula_universally |
45315 | 1887 |
|> bound_tvars type_enc atomic_types, NONE, NONE) |
42573
744215c3e90c
got rid of one "sym_table" in "prepare_atp_problem" now that proxies are always handled first, and tuned accordingly
blanchet
parents:
42572
diff
changeset
|
1888 |
|
44625 | 1889 |
fun formula_line_for_free_type j phi = |
1890 |
Formula (tfree_clause_prefix ^ string_of_int j, Hypothesis, phi, NONE, NONE) |
|
44626 | 1891 |
fun formula_lines_for_free_types type_enc (facts : translated_formula list) = |
42573
744215c3e90c
got rid of one "sym_table" in "prepare_atp_problem" now that proxies are always handled first, and tuned accordingly
blanchet
parents:
42572
diff
changeset
|
1892 |
let |
44625 | 1893 |
val phis = |
1894 |
fold (union (op =)) (map #atomic_types facts) [] |
|
1895 |
|> formulas_for_types type_enc add_sorts_on_tfree |
|
1896 |
in map2 formula_line_for_free_type (0 upto length phis - 1) phis end |
|
42573
744215c3e90c
got rid of one "sym_table" in "prepare_atp_problem" now that proxies are always handled first, and tuned accordingly
blanchet
parents:
42572
diff
changeset
|
1897 |
|
744215c3e90c
got rid of one "sym_table" in "prepare_atp_problem" now that proxies are always handled first, and tuned accordingly
blanchet
parents:
42572
diff
changeset
|
1898 |
(** Symbol declarations **) |
42544
75cb06eee990
reimplemented the hAPP introduction code so that it's done earlier, when the types are still available
blanchet
parents:
42543
diff
changeset
|
1899 |
|
44754 | 1900 |
fun decl_line_for_class order s = |
44595
444d111bde7d
generate properly typed TFF1 (PFF) problems in the presence of type class predicates
blanchet
parents:
44594
diff
changeset
|
1901 |
let val name as (s, _) = `make_type_class s in |
44622 | 1902 |
Decl (sym_decl_prefix ^ s, name, |
45301
866b075aa99b
added sorted DFG output for coming version of SPASS
blanchet
parents:
45299
diff
changeset
|
1903 |
if order = First_Order andalso avoid_first_order_ghost_type_vars then |
44754 | 1904 |
ATyAbs ([tvar_a_name], AFun (a_itself_atype, bool_atype)) |
44622 | 1905 |
else |
44754 | 1906 |
AFun (atype_of_types, bool_atype)) |
44595
444d111bde7d
generate properly typed TFF1 (PFF) problems in the presence of type class predicates
blanchet
parents:
44594
diff
changeset
|
1907 |
end |
444d111bde7d
generate properly typed TFF1 (PFF) problems in the presence of type class predicates
blanchet
parents:
44594
diff
changeset
|
1908 |
|
444d111bde7d
generate properly typed TFF1 (PFF) problems in the presence of type class predicates
blanchet
parents:
44594
diff
changeset
|
1909 |
fun decl_lines_for_classes type_enc classes = |
444d111bde7d
generate properly typed TFF1 (PFF) problems in the presence of type class predicates
blanchet
parents:
44594
diff
changeset
|
1910 |
case type_enc of |
44754 | 1911 |
Simple_Types (order, Polymorphic, _) => |
1912 |
map (decl_line_for_class order) classes |
|
44595
444d111bde7d
generate properly typed TFF1 (PFF) problems in the presence of type class predicates
blanchet
parents:
44594
diff
changeset
|
1913 |
| _ => [] |
444d111bde7d
generate properly typed TFF1 (PFF) problems in the presence of type class predicates
blanchet
parents:
44594
diff
changeset
|
1914 |
|
44773
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
1915 |
fun sym_decl_table_for_facts ctxt format type_enc sym_tab (conjs, facts) = |
42574 | 1916 |
let |
44829
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1917 |
fun add_iterm_syms tm = |
43859 | 1918 |
let val (head, args) = strip_iterm_comb tm in |
42574 | 1919 |
(case head of |
43859 | 1920 |
IConst ((s, s'), T, T_args) => |
44594
ae82943481e9
added type abstractions (for declaring polymorphic constants) to TFF syntax
blanchet
parents:
44593
diff
changeset
|
1921 |
let |
44829
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1922 |
val (pred_sym, in_conj) = |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1923 |
case Symtab.lookup sym_tab s of |
44853 | 1924 |
SOME ({pred_sym, in_conj, ...} : sym_info) => |
1925 |
(pred_sym, in_conj) |
|
44829
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1926 |
| NONE => (false, false) |
44594
ae82943481e9
added type abstractions (for declaring polymorphic constants) to TFF syntax
blanchet
parents:
44593
diff
changeset
|
1927 |
val decl_sym = |
ae82943481e9
added type abstractions (for declaring polymorphic constants) to TFF syntax
blanchet
parents:
44593
diff
changeset
|
1928 |
(case type_enc of |
ae82943481e9
added type abstractions (for declaring polymorphic constants) to TFF syntax
blanchet
parents:
44593
diff
changeset
|
1929 |
Guards _ => not pred_sym |
ae82943481e9
added type abstractions (for declaring polymorphic constants) to TFF syntax
blanchet
parents:
44593
diff
changeset
|
1930 |
| _ => true) andalso |
ae82943481e9
added type abstractions (for declaring polymorphic constants) to TFF syntax
blanchet
parents:
44593
diff
changeset
|
1931 |
is_tptp_user_symbol s |
ae82943481e9
added type abstractions (for declaring polymorphic constants) to TFF syntax
blanchet
parents:
44593
diff
changeset
|
1932 |
in |
ae82943481e9
added type abstractions (for declaring polymorphic constants) to TFF syntax
blanchet
parents:
44593
diff
changeset
|
1933 |
if decl_sym then |
42576
a8a80a2a34be
merge symbol declarations that are type-instances of each other -- useful for type system "Args true" with monomorphization turned off
blanchet
parents:
42575
diff
changeset
|
1934 |
Symtab.map_default (s, []) |
42886
208ec29cc013
improved "poly_preds_{bang,query}" by picking up good witnesses for the possible infinity of common type classes and ensuring that "?'a::type" doesn't ruin everything
blanchet
parents:
42885
diff
changeset
|
1935 |
(insert_type ctxt #3 (s', T_args, T, pred_sym, length args, |
208ec29cc013
improved "poly_preds_{bang,query}" by picking up good witnesses for the possible infinity of common type classes and ensuring that "?'a::type" doesn't ruin everything
blanchet
parents:
42885
diff
changeset
|
1936 |
in_conj)) |
42574 | 1937 |
else |
1938 |
I |
|
1939 |
end |
|
44829
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1940 |
| IAbs (_, tm) => add_iterm_syms tm |
42574 | 1941 |
| _ => I) |
44829
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1942 |
#> fold add_iterm_syms args |
42574 | 1943 |
end |
44829
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1944 |
val add_fact_syms = K add_iterm_syms |> formula_fold NONE |> fact_lift |
43966 | 1945 |
fun add_formula_var_types (AQuant (_, xs, phi)) = |
1946 |
fold (fn (_, SOME T) => insert_type ctxt I T | _ => I) xs |
|
1947 |
#> add_formula_var_types phi |
|
1948 |
| add_formula_var_types (AConn (_, phis)) = |
|
1949 |
fold add_formula_var_types phis |
|
1950 |
| add_formula_var_types _ = I |
|
1951 |
fun var_types () = |
|
1952 |
if polymorphism_of_type_enc type_enc = Polymorphic then [tvar_a] |
|
1953 |
else fold (fact_lift add_formula_var_types) (conjs @ facts) [] |
|
1954 |
fun add_undefined_const T = |
|
43984 | 1955 |
let |
1956 |
val (s, s') = |
|
44622 | 1957 |
`(make_fixed_const NONE) @{const_name undefined} |
44001 | 1958 |
|> (case type_arg_policy type_enc @{const_name undefined} of |
44771 | 1959 |
Mangled_Type_Args => mangled_const_name format type_enc [T] |
44001 | 1960 |
| _ => I) |
43984 | 1961 |
in |
1962 |
Symtab.map_default (s, []) |
|
1963 |
(insert_type ctxt #3 (s', [T], T, false, 0, false)) |
|
1964 |
end |
|
44622 | 1965 |
fun add_TYPE_const () = |
1966 |
let val (s, s') = TYPE_name in |
|
1967 |
Symtab.map_default (s, []) |
|
1968 |
(insert_type ctxt #3 |
|
1969 |
(s', [tvar_a], @{typ "'a itself"}, false, 0, false)) |
|
1970 |
end |
|
42698
ffd1ae4ff5c6
help SOS by ensuring that typing information is marked as part of the conjecture + be more precise w.r.t. typedefs in monotonicity check
blanchet
parents:
42697
diff
changeset
|
1971 |
in |
ffd1ae4ff5c6
help SOS by ensuring that typing information is marked as part of the conjecture + be more precise w.r.t. typedefs in monotonicity check
blanchet
parents:
42697
diff
changeset
|
1972 |
Symtab.empty |
43626
a867ebb12209
renamed "type_sys" to "type_enc", which is more accurate
blanchet
parents:
43624
diff
changeset
|
1973 |
|> is_type_enc_fairly_sound type_enc |
44829
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1974 |
? (fold (fold add_fact_syms) [conjs, facts] |
43985
33d8b99531c2
no need for existential witnesses for sorts in TFF and THF formats
blanchet
parents:
43984
diff
changeset
|
1975 |
#> (case type_enc of |
44786 | 1976 |
Simple_Types (First_Order, Polymorphic, _) => add_TYPE_const () |
1977 |
| Simple_Types _ => I |
|
43985
33d8b99531c2
no need for existential witnesses for sorts in TFF and THF formats
blanchet
parents:
43984
diff
changeset
|
1978 |
| _ => fold add_undefined_const (var_types ()))) |
42698
ffd1ae4ff5c6
help SOS by ensuring that typing information is marked as part of the conjecture + be more precise w.r.t. typedefs in monotonicity check
blanchet
parents:
42697
diff
changeset
|
1979 |
end |
42533 | 1980 |
|
44399 | 1981 |
(* We add "bool" in case the helper "True_or_False" is included later. *) |
44634
2ac4ff398bc3
make "sound" sound and "unsound" more sound, based on evaluation
blanchet
parents:
44626
diff
changeset
|
1982 |
fun default_mono level = |
44399 | 1983 |
{maybe_finite_Ts = [@{typ bool}], |
1984 |
surely_finite_Ts = [@{typ bool}], |
|
1985 |
maybe_infinite_Ts = known_infinite_types, |
|
44634
2ac4ff398bc3
make "sound" sound and "unsound" more sound, based on evaluation
blanchet
parents:
44626
diff
changeset
|
1986 |
surely_infinite_Ts = |
2ac4ff398bc3
make "sound" sound and "unsound" more sound, based on evaluation
blanchet
parents:
44626
diff
changeset
|
1987 |
case level of |
44768 | 1988 |
Noninf_Nonmono_Types (Sound, _) => [] |
44634
2ac4ff398bc3
make "sound" sound and "unsound" more sound, based on evaluation
blanchet
parents:
44626
diff
changeset
|
1989 |
| _ => known_infinite_types, |
44399 | 1990 |
maybe_nonmono_Ts = [@{typ bool}]} |
1991 |
||
42685 | 1992 |
(* This inference is described in section 2.3 of Claessen et al.'s "Sorting it |
1993 |
out with monotonicity" paper presented at CADE 2011. *) |
|
44399 | 1994 |
fun add_iterm_mononotonicity_info _ _ (SOME false) _ mono = mono |
1995 |
| add_iterm_mononotonicity_info ctxt level _ |
|
1996 |
(IApp (IApp (IConst ((s, _), Type (_, [T, _]), _), tm1), tm2)) |
|
1997 |
(mono as {maybe_finite_Ts, surely_finite_Ts, maybe_infinite_Ts, |
|
1998 |
surely_infinite_Ts, maybe_nonmono_Ts}) = |
|
44403
15160cdc4688
precisely distinguish between universal and existential quantifiers, instead of assuming the worst (universal), for monotonicity analysis
blanchet
parents:
44402
diff
changeset
|
1999 |
if is_tptp_equal s andalso exists is_maybe_universal_var [tm1, tm2] then |
44399 | 2000 |
case level of |
44768 | 2001 |
Noninf_Nonmono_Types (soundness, _) => |
44399 | 2002 |
if exists (type_instance ctxt T) surely_infinite_Ts orelse |
44859
237ba63d6041
fixed definition of type intersection (soundness bug)
blanchet
parents:
44853
diff
changeset
|
2003 |
member (type_equiv ctxt) maybe_finite_Ts T then |
44399 | 2004 |
mono |
44500 | 2005 |
else if is_type_kind_of_surely_infinite ctxt soundness |
2006 |
surely_infinite_Ts T then |
|
44399 | 2007 |
{maybe_finite_Ts = maybe_finite_Ts, |
2008 |
surely_finite_Ts = surely_finite_Ts, |
|
2009 |
maybe_infinite_Ts = maybe_infinite_Ts, |
|
2010 |
surely_infinite_Ts = surely_infinite_Ts |> insert_type ctxt I T, |
|
2011 |
maybe_nonmono_Ts = maybe_nonmono_Ts} |
|
2012 |
else |
|
44859
237ba63d6041
fixed definition of type intersection (soundness bug)
blanchet
parents:
44853
diff
changeset
|
2013 |
{maybe_finite_Ts = maybe_finite_Ts |> insert (type_equiv ctxt) T, |
44399 | 2014 |
surely_finite_Ts = surely_finite_Ts, |
2015 |
maybe_infinite_Ts = maybe_infinite_Ts, |
|
2016 |
surely_infinite_Ts = surely_infinite_Ts, |
|
2017 |
maybe_nonmono_Ts = maybe_nonmono_Ts |> insert_type ctxt I T} |
|
44768 | 2018 |
| Fin_Nonmono_Types _ => |
44399 | 2019 |
if exists (type_instance ctxt T) surely_finite_Ts orelse |
44859
237ba63d6041
fixed definition of type intersection (soundness bug)
blanchet
parents:
44853
diff
changeset
|
2020 |
member (type_equiv ctxt) maybe_infinite_Ts T then |
44399 | 2021 |
mono |
2022 |
else if is_type_surely_finite ctxt T then |
|
2023 |
{maybe_finite_Ts = maybe_finite_Ts, |
|
2024 |
surely_finite_Ts = surely_finite_Ts |> insert_type ctxt I T, |
|
2025 |
maybe_infinite_Ts = maybe_infinite_Ts, |
|
2026 |
surely_infinite_Ts = surely_infinite_Ts, |
|
2027 |
maybe_nonmono_Ts = maybe_nonmono_Ts |> insert_type ctxt I T} |
|
2028 |
else |
|
2029 |
{maybe_finite_Ts = maybe_finite_Ts, |
|
2030 |
surely_finite_Ts = surely_finite_Ts, |
|
44859
237ba63d6041
fixed definition of type intersection (soundness bug)
blanchet
parents:
44853
diff
changeset
|
2031 |
maybe_infinite_Ts = maybe_infinite_Ts |> insert (type_equiv ctxt) T, |
44399 | 2032 |
surely_infinite_Ts = surely_infinite_Ts, |
2033 |
maybe_nonmono_Ts = maybe_nonmono_Ts} |
|
2034 |
| _ => mono |
|
2035 |
else |
|
2036 |
mono |
|
2037 |
| add_iterm_mononotonicity_info _ _ _ _ mono = mono |
|
2038 |
fun add_fact_mononotonicity_info ctxt level |
|
2039 |
({kind, iformula, ...} : translated_formula) = |
|
42834
40f7691d0539
implemented thin versions of "preds" type systems + fixed various issues with type args
blanchet
parents:
42832
diff
changeset
|
2040 |
formula_fold (SOME (kind <> Conjecture)) |
44399 | 2041 |
(add_iterm_mononotonicity_info ctxt level) iformula |
2042 |
fun mononotonicity_info_for_facts ctxt type_enc facts = |
|
43626
a867ebb12209
renamed "type_sys" to "type_enc", which is more accurate
blanchet
parents:
43624
diff
changeset
|
2043 |
let val level = level_of_type_enc type_enc in |
44634
2ac4ff398bc3
make "sound" sound and "unsound" more sound, based on evaluation
blanchet
parents:
44626
diff
changeset
|
2044 |
default_mono level |
44399 | 2045 |
|> is_type_level_monotonicity_based level |
2046 |
? fold (add_fact_mononotonicity_info ctxt level) facts |
|
42829
1558741f8a72
started implementing "shallow" type systems, based on ideas by Claessen et al.
blanchet
parents:
42828
diff
changeset
|
2047 |
end |
42677
25496cd3c199
monotonic type inference in ATP Sledgehammer problems -- based on Claessen & al.'s CADE 2011 paper, Sect. 2.3.
blanchet
parents:
42675
diff
changeset
|
2048 |
|
44501 | 2049 |
fun add_iformula_monotonic_types ctxt mono type_enc = |
2050 |
let |
|
2051 |
val level = level_of_type_enc type_enc |
|
2052 |
val should_encode = should_encode_type ctxt mono level |
|
44504
6f29df8d2007
fixed inverted logic and improve precision when handling monotonic types in polymorphic encodings
blanchet
parents:
44502
diff
changeset
|
2053 |
fun add_type T = not (should_encode T) ? insert_type ctxt I T |
44506 | 2054 |
fun add_args (IApp (tm1, tm2)) = add_args tm1 #> add_term tm2 |
2055 |
| add_args _ = I |
|
2056 |
and add_term tm = add_type (ityp_of tm) #> add_args tm |
|
44501 | 2057 |
in formula_fold NONE (K add_term) end |
2058 |
fun add_fact_monotonic_types ctxt mono type_enc = |
|
2059 |
add_iformula_monotonic_types ctxt mono type_enc |> fact_lift |
|
2060 |
fun monotonic_types_for_facts ctxt mono type_enc facts = |
|
44811 | 2061 |
let val level = level_of_type_enc type_enc in |
2062 |
[] |> (polymorphism_of_type_enc type_enc = Polymorphic andalso |
|
2063 |
is_type_level_monotonicity_based level andalso |
|
2064 |
granularity_of_type_level level <> Ghost_Type_Arg_Vars) |
|
2065 |
? fold (add_fact_monotonic_types ctxt mono type_enc) facts |
|
2066 |
end |
|
44501 | 2067 |
|
44399 | 2068 |
fun formula_line_for_guards_mono_type ctxt format mono type_enc T = |
44396
66b9b3fcd608
started cleaning up polymorphic monotonicity-based encodings, based on discussions with Nick Smallbone
blanchet
parents:
44394
diff
changeset
|
2069 |
Formula (guards_sym_formula_prefix ^ |
66b9b3fcd608
started cleaning up polymorphic monotonicity-based encodings, based on discussions with Nick Smallbone
blanchet
parents:
44394
diff
changeset
|
2070 |
ascii_of (mangled_type format type_enc T), |
66b9b3fcd608
started cleaning up polymorphic monotonicity-based encodings, based on discussions with Nick Smallbone
blanchet
parents:
44394
diff
changeset
|
2071 |
Axiom, |
66b9b3fcd608
started cleaning up polymorphic monotonicity-based encodings, based on discussions with Nick Smallbone
blanchet
parents:
44394
diff
changeset
|
2072 |
IConst (`make_bound_var "X", T, []) |
44774
72785558a6ff
separate mangling, which can (and should) be done before the formulas are first-orderized, and type arg filtering, which must be done after once the min arities have been computed
blanchet
parents:
44773
diff
changeset
|
2073 |
|> type_guard_iterm format type_enc T |
44396
66b9b3fcd608
started cleaning up polymorphic monotonicity-based encodings, based on discussions with Nick Smallbone
blanchet
parents:
44394
diff
changeset
|
2074 |
|> AAtom |
44399 | 2075 |
|> formula_from_iformula ctxt format mono type_enc |
44811 | 2076 |
(K (K (K (K (K (K true)))))) (SOME true) |
45377 | 2077 |
|> close_formula_universally |
45316
08d84bdd5b37
improve handling of bound type variables (esp. for TFF1)
blanchet
parents:
45315
diff
changeset
|
2078 |
|> bound_tvars type_enc (atomic_types_of T), |
45301
866b075aa99b
added sorted DFG output for coming version of SPASS
blanchet
parents:
45299
diff
changeset
|
2079 |
isabelle_info format introN, NONE) |
44396
66b9b3fcd608
started cleaning up polymorphic monotonicity-based encodings, based on discussions with Nick Smallbone
blanchet
parents:
44394
diff
changeset
|
2080 |
|
44399 | 2081 |
fun formula_line_for_tags_mono_type ctxt format mono type_enc T = |
44396
66b9b3fcd608
started cleaning up polymorphic monotonicity-based encodings, based on discussions with Nick Smallbone
blanchet
parents:
44394
diff
changeset
|
2082 |
let val x_var = ATerm (`make_bound_var "X", []) in |
66b9b3fcd608
started cleaning up polymorphic monotonicity-based encodings, based on discussions with Nick Smallbone
blanchet
parents:
44394
diff
changeset
|
2083 |
Formula (tags_sym_formula_prefix ^ |
66b9b3fcd608
started cleaning up polymorphic monotonicity-based encodings, based on discussions with Nick Smallbone
blanchet
parents:
44394
diff
changeset
|
2084 |
ascii_of (mangled_type format type_enc T), |
66b9b3fcd608
started cleaning up polymorphic monotonicity-based encodings, based on discussions with Nick Smallbone
blanchet
parents:
44394
diff
changeset
|
2085 |
Axiom, |
45316
08d84bdd5b37
improve handling of bound type variables (esp. for TFF1)
blanchet
parents:
45315
diff
changeset
|
2086 |
eq_formula type_enc (atomic_types_of T) false |
44399 | 2087 |
(tag_with_type ctxt format mono type_enc NONE T x_var) |
44396
66b9b3fcd608
started cleaning up polymorphic monotonicity-based encodings, based on discussions with Nick Smallbone
blanchet
parents:
44394
diff
changeset
|
2088 |
x_var, |
45301
866b075aa99b
added sorted DFG output for coming version of SPASS
blanchet
parents:
45299
diff
changeset
|
2089 |
isabelle_info format simpN, NONE) |
44396
66b9b3fcd608
started cleaning up polymorphic monotonicity-based encodings, based on discussions with Nick Smallbone
blanchet
parents:
44394
diff
changeset
|
2090 |
end |
66b9b3fcd608
started cleaning up polymorphic monotonicity-based encodings, based on discussions with Nick Smallbone
blanchet
parents:
44394
diff
changeset
|
2091 |
|
44399 | 2092 |
fun problem_lines_for_mono_types ctxt format mono type_enc Ts = |
44396
66b9b3fcd608
started cleaning up polymorphic monotonicity-based encodings, based on discussions with Nick Smallbone
blanchet
parents:
44394
diff
changeset
|
2093 |
case type_enc of |
66b9b3fcd608
started cleaning up polymorphic monotonicity-based encodings, based on discussions with Nick Smallbone
blanchet
parents:
44394
diff
changeset
|
2094 |
Simple_Types _ => [] |
66b9b3fcd608
started cleaning up polymorphic monotonicity-based encodings, based on discussions with Nick Smallbone
blanchet
parents:
44394
diff
changeset
|
2095 |
| Guards _ => |
44399 | 2096 |
map (formula_line_for_guards_mono_type ctxt format mono type_enc) Ts |
2097 |
| Tags _ => map (formula_line_for_tags_mono_type ctxt format mono type_enc) Ts |
|
44396
66b9b3fcd608
started cleaning up polymorphic monotonicity-based encodings, based on discussions with Nick Smallbone
blanchet
parents:
44394
diff
changeset
|
2098 |
|
44399 | 2099 |
fun decl_line_for_sym ctxt format mono type_enc s |
42994
fe291ab75eb5
towards supporting non-simply-typed encodings for TFF and THF (for orthogonality and experiments)
blanchet
parents:
42966
diff
changeset
|
2100 |
(s', T_args, T, pred_sym, ary, _) = |
fe291ab75eb5
towards supporting non-simply-typed encodings for TFF and THF (for orthogonality and experiments)
blanchet
parents:
42966
diff
changeset
|
2101 |
let |
44594
ae82943481e9
added type abstractions (for declaring polymorphic constants) to TFF syntax
blanchet
parents:
44593
diff
changeset
|
2102 |
val thy = Proof_Context.theory_of ctxt |
ae82943481e9
added type abstractions (for declaring polymorphic constants) to TFF syntax
blanchet
parents:
44593
diff
changeset
|
2103 |
val (T, T_args) = |
ae82943481e9
added type abstractions (for declaring polymorphic constants) to TFF syntax
blanchet
parents:
44593
diff
changeset
|
2104 |
if null T_args then |
ae82943481e9
added type abstractions (for declaring polymorphic constants) to TFF syntax
blanchet
parents:
44593
diff
changeset
|
2105 |
(T, []) |
ae82943481e9
added type abstractions (for declaring polymorphic constants) to TFF syntax
blanchet
parents:
44593
diff
changeset
|
2106 |
else case strip_prefix_and_unascii const_prefix s of |
ae82943481e9
added type abstractions (for declaring polymorphic constants) to TFF syntax
blanchet
parents:
44593
diff
changeset
|
2107 |
SOME s' => |
ae82943481e9
added type abstractions (for declaring polymorphic constants) to TFF syntax
blanchet
parents:
44593
diff
changeset
|
2108 |
let |
ae82943481e9
added type abstractions (for declaring polymorphic constants) to TFF syntax
blanchet
parents:
44593
diff
changeset
|
2109 |
val s' = s' |> invert_const |
ae82943481e9
added type abstractions (for declaring polymorphic constants) to TFF syntax
blanchet
parents:
44593
diff
changeset
|
2110 |
val T = s' |> robust_const_type thy |
ae82943481e9
added type abstractions (for declaring polymorphic constants) to TFF syntax
blanchet
parents:
44593
diff
changeset
|
2111 |
in (T, robust_const_typargs thy (s', T)) end |
ae82943481e9
added type abstractions (for declaring polymorphic constants) to TFF syntax
blanchet
parents:
44593
diff
changeset
|
2112 |
| NONE => |
ae82943481e9
added type abstractions (for declaring polymorphic constants) to TFF syntax
blanchet
parents:
44593
diff
changeset
|
2113 |
case strip_prefix_and_unascii fixed_var_prefix s of |
ae82943481e9
added type abstractions (for declaring polymorphic constants) to TFF syntax
blanchet
parents:
44593
diff
changeset
|
2114 |
SOME s' => |
45508 | 2115 |
if String.isPrefix lambda_lifted_poly_prefix s' then |
2116 |
(tvar_a, [tvar_a]) |
|
2117 |
else |
|
2118 |
raise Fail "unexpected type arguments to free variable" |
|
44594
ae82943481e9
added type abstractions (for declaring polymorphic constants) to TFF syntax
blanchet
parents:
44593
diff
changeset
|
2119 |
| NONE => raise Fail "unexpected type arguments" |
42994
fe291ab75eb5
towards supporting non-simply-typed encodings for TFF and THF (for orthogonality and experiments)
blanchet
parents:
42966
diff
changeset
|
2120 |
in |
42998
1c80902d0456
fully support all type system encodings in typed formats (TFF, THF)
blanchet
parents:
42994
diff
changeset
|
2121 |
Decl (sym_decl_prefix ^ s, (s, s'), |
44594
ae82943481e9
added type abstractions (for declaring polymorphic constants) to TFF syntax
blanchet
parents:
44593
diff
changeset
|
2122 |
T |> fused_type ctxt mono (level_of_type_enc type_enc) ary |
ae82943481e9
added type abstractions (for declaring polymorphic constants) to TFF syntax
blanchet
parents:
44593
diff
changeset
|
2123 |
|> ho_type_from_typ format type_enc pred_sym ary |
ae82943481e9
added type abstractions (for declaring polymorphic constants) to TFF syntax
blanchet
parents:
44593
diff
changeset
|
2124 |
|> not (null T_args) |
ae82943481e9
added type abstractions (for declaring polymorphic constants) to TFF syntax
blanchet
parents:
44593
diff
changeset
|
2125 |
? curry ATyAbs (map (tvar_name o fst o dest_TVar) T_args)) |
42994
fe291ab75eb5
towards supporting non-simply-typed encodings for TFF and THF (for orthogonality and experiments)
blanchet
parents:
42966
diff
changeset
|
2126 |
end |
42579
2552c09b1a72
implement the new ATP type system in Sledgehammer
blanchet
parents:
42577
diff
changeset
|
2127 |
|
44399 | 2128 |
fun formula_line_for_guards_sym_decl ctxt format conj_sym_kind mono type_enc n s |
2129 |
j (s', T_args, T, _, ary, in_conj) = |
|
42579
2552c09b1a72
implement the new ATP type system in Sledgehammer
blanchet
parents:
42577
diff
changeset
|
2130 |
let |
44811 | 2131 |
val thy = Proof_Context.theory_of ctxt |
42709
e7af132d48fe
allow each prover to specify its own formula kind for symbols occurring in the conjecture
blanchet
parents:
42701
diff
changeset
|
2132 |
val (kind, maybe_negate) = |
e7af132d48fe
allow each prover to specify its own formula kind for symbols occurring in the conjecture
blanchet
parents:
42701
diff
changeset
|
2133 |
if in_conj then (conj_sym_kind, conj_sym_kind = Conjecture ? mk_anot) |
e7af132d48fe
allow each prover to specify its own formula kind for symbols occurring in the conjecture
blanchet
parents:
42701
diff
changeset
|
2134 |
else (Axiom, I) |
42753
c9552e617acc
drop some type arguments to constants in unsound type systems + remove a few type systems that make no sense from the circulation
blanchet
parents:
42750
diff
changeset
|
2135 |
val (arg_Ts, res_T) = chop_fun ary T |
44814
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
2136 |
val bound_names = 1 upto ary |> map (`I o make_bound_var o string_of_int) |
42829
1558741f8a72
started implementing "shallow" type systems, based on ideas by Claessen et al.
blanchet
parents:
42828
diff
changeset
|
2137 |
val bounds = |
43859 | 2138 |
bound_names ~~ arg_Ts |> map (fn (name, T) => IConst (name, T, [])) |
42579
2552c09b1a72
implement the new ATP type system in Sledgehammer
blanchet
parents:
42577
diff
changeset
|
2139 |
val bound_Ts = |
44811 | 2140 |
if exists (curry (op =) dummyT) T_args then |
2141 |
case level_of_type_enc type_enc of |
|
2142 |
All_Types => map SOME arg_Ts |
|
2143 |
| level => |
|
2144 |
if granularity_of_type_level level = Ghost_Type_Arg_Vars then |
|
2145 |
let val ghosts = ghost_type_args thy s ary in |
|
2146 |
map2 (fn j => if member (op =) ghosts j then SOME else K NONE) |
|
44814
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
2147 |
(0 upto ary - 1) arg_Ts |
44811 | 2148 |
end |
2149 |
else |
|
44814
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
2150 |
replicate ary NONE |
44811 | 2151 |
else |
44814
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
2152 |
replicate ary NONE |
42579
2552c09b1a72
implement the new ATP type system in Sledgehammer
blanchet
parents:
42577
diff
changeset
|
2153 |
in |
43989 | 2154 |
Formula (guards_sym_formula_prefix ^ s ^ |
42709
e7af132d48fe
allow each prover to specify its own formula kind for symbols occurring in the conjecture
blanchet
parents:
42701
diff
changeset
|
2155 |
(if n > 1 then "_" ^ string_of_int j else ""), kind, |
43859 | 2156 |
IConst ((s, s'), T, T_args) |
2157 |
|> fold (curry (IApp o swap)) bounds |
|
44774
72785558a6ff
separate mangling, which can (and should) be done before the formulas are first-orderized, and type arg filtering, which must be done after once the min arities have been computed
blanchet
parents:
44773
diff
changeset
|
2158 |
|> type_guard_iterm format type_enc res_T |
42963 | 2159 |
|> AAtom |> mk_aquant AForall (bound_names ~~ bound_Ts) |
44399 | 2160 |
|> formula_from_iformula ctxt format mono type_enc |
44811 | 2161 |
(K (K (K (K (K (K true)))))) (SOME true) |
45377 | 2162 |
|> close_formula_universally |
45316
08d84bdd5b37
improve handling of bound type variables (esp. for TFF1)
blanchet
parents:
45315
diff
changeset
|
2163 |
|> n > 1 ? bound_tvars type_enc (atomic_types_of T) |
42709
e7af132d48fe
allow each prover to specify its own formula kind for symbols occurring in the conjecture
blanchet
parents:
42701
diff
changeset
|
2164 |
|> maybe_negate, |
45301
866b075aa99b
added sorted DFG output for coming version of SPASS
blanchet
parents:
45299
diff
changeset
|
2165 |
isabelle_info format introN, NONE) |
42579
2552c09b1a72
implement the new ATP type system in Sledgehammer
blanchet
parents:
42577
diff
changeset
|
2166 |
end |
2552c09b1a72
implement the new ATP type system in Sledgehammer
blanchet
parents:
42577
diff
changeset
|
2167 |
|
44811 | 2168 |
fun formula_lines_for_tags_sym_decl ctxt format conj_sym_kind mono type_enc n s |
2169 |
(j, (s', T_args, T, pred_sym, ary, in_conj)) = |
|
42829
1558741f8a72
started implementing "shallow" type systems, based on ideas by Claessen et al.
blanchet
parents:
42828
diff
changeset
|
2170 |
let |
44814
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
2171 |
val thy = Proof_Context.theory_of ctxt |
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
2172 |
val level = level_of_type_enc type_enc |
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
2173 |
val grain = granularity_of_type_level level |
42829
1558741f8a72
started implementing "shallow" type systems, based on ideas by Claessen et al.
blanchet
parents:
42828
diff
changeset
|
2174 |
val ident_base = |
44396
66b9b3fcd608
started cleaning up polymorphic monotonicity-based encodings, based on discussions with Nick Smallbone
blanchet
parents:
44394
diff
changeset
|
2175 |
tags_sym_formula_prefix ^ s ^ |
43125
ddf63baabdec
distinguish different kinds of typing informations in the fact name
blanchet
parents:
43121
diff
changeset
|
2176 |
(if n > 1 then "_" ^ string_of_int j else "") |
42852
40649ab0cead
honor "conj_sym_kind" also for tag symbol declarations
blanchet
parents:
42851
diff
changeset
|
2177 |
val (kind, maybe_negate) = |
40649ab0cead
honor "conj_sym_kind" also for tag symbol declarations
blanchet
parents:
42851
diff
changeset
|
2178 |
if in_conj then (conj_sym_kind, conj_sym_kind = Conjecture ? mk_anot) |
40649ab0cead
honor "conj_sym_kind" also for tag symbol declarations
blanchet
parents:
42851
diff
changeset
|
2179 |
else (Axiom, I) |
42829
1558741f8a72
started implementing "shallow" type systems, based on ideas by Claessen et al.
blanchet
parents:
42828
diff
changeset
|
2180 |
val (arg_Ts, res_T) = chop_fun ary T |
44814
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
2181 |
val bound_names = 1 upto ary |> map (`I o make_bound_var o string_of_int) |
42829
1558741f8a72
started implementing "shallow" type systems, based on ideas by Claessen et al.
blanchet
parents:
42828
diff
changeset
|
2182 |
val bounds = bound_names |> map (fn name => ATerm (name, [])) |
43677 | 2183 |
val cst = mk_aterm format type_enc (s, s') T_args |
45316
08d84bdd5b37
improve handling of bound type variables (esp. for TFF1)
blanchet
parents:
45315
diff
changeset
|
2184 |
val eq = maybe_negate oo eq_formula type_enc (atomic_types_of T) pred_sym |
44814
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
2185 |
val should_encode = should_encode_type ctxt mono level |
44399 | 2186 |
val tag_with = tag_with_type ctxt format mono type_enc NONE |
42829
1558741f8a72
started implementing "shallow" type systems, based on ideas by Claessen et al.
blanchet
parents:
42828
diff
changeset
|
2187 |
val add_formula_for_res = |
1558741f8a72
started implementing "shallow" type systems, based on ideas by Claessen et al.
blanchet
parents:
42828
diff
changeset
|
2188 |
if should_encode res_T then |
44814
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
2189 |
let |
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
2190 |
val tagged_bounds = |
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
2191 |
if grain = Ghost_Type_Arg_Vars then |
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
2192 |
let val ghosts = ghost_type_args thy s ary in |
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
2193 |
map2 (fn (j, arg_T) => member (op =) ghosts j ? tag_with arg_T) |
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
2194 |
(0 upto ary - 1 ~~ arg_Ts) bounds |
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
2195 |
end |
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
2196 |
else |
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
2197 |
bounds |
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
2198 |
in |
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
2199 |
cons (Formula (ident_base ^ "_res", kind, |
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
2200 |
eq (tag_with res_T (cst bounds)) (cst tagged_bounds), |
45301
866b075aa99b
added sorted DFG output for coming version of SPASS
blanchet
parents:
45299
diff
changeset
|
2201 |
isabelle_info format simpN, NONE)) |
44814
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
2202 |
end |
42829
1558741f8a72
started implementing "shallow" type systems, based on ideas by Claessen et al.
blanchet
parents:
42828
diff
changeset
|
2203 |
else |
1558741f8a72
started implementing "shallow" type systems, based on ideas by Claessen et al.
blanchet
parents:
42828
diff
changeset
|
2204 |
I |
1558741f8a72
started implementing "shallow" type systems, based on ideas by Claessen et al.
blanchet
parents:
42828
diff
changeset
|
2205 |
fun add_formula_for_arg k = |
1558741f8a72
started implementing "shallow" type systems, based on ideas by Claessen et al.
blanchet
parents:
42828
diff
changeset
|
2206 |
let val arg_T = nth arg_Ts k in |
1558741f8a72
started implementing "shallow" type systems, based on ideas by Claessen et al.
blanchet
parents:
42828
diff
changeset
|
2207 |
if should_encode arg_T then |
1558741f8a72
started implementing "shallow" type systems, based on ideas by Claessen et al.
blanchet
parents:
42828
diff
changeset
|
2208 |
case chop k bounds of |
1558741f8a72
started implementing "shallow" type systems, based on ideas by Claessen et al.
blanchet
parents:
42828
diff
changeset
|
2209 |
(bounds1, bound :: bounds2) => |
42852
40649ab0cead
honor "conj_sym_kind" also for tag symbol declarations
blanchet
parents:
42851
diff
changeset
|
2210 |
cons (Formula (ident_base ^ "_arg" ^ string_of_int (k + 1), kind, |
44396
66b9b3fcd608
started cleaning up polymorphic monotonicity-based encodings, based on discussions with Nick Smallbone
blanchet
parents:
44394
diff
changeset
|
2211 |
eq (cst (bounds1 @ tag_with arg_T bound :: bounds2)) |
66b9b3fcd608
started cleaning up polymorphic monotonicity-based encodings, based on discussions with Nick Smallbone
blanchet
parents:
44394
diff
changeset
|
2212 |
(cst bounds), |
45301
866b075aa99b
added sorted DFG output for coming version of SPASS
blanchet
parents:
45299
diff
changeset
|
2213 |
isabelle_info format simpN, NONE)) |
42829
1558741f8a72
started implementing "shallow" type systems, based on ideas by Claessen et al.
blanchet
parents:
42828
diff
changeset
|
2214 |
| _ => raise Fail "expected nonempty tail" |
1558741f8a72
started implementing "shallow" type systems, based on ideas by Claessen et al.
blanchet
parents:
42828
diff
changeset
|
2215 |
else |
1558741f8a72
started implementing "shallow" type systems, based on ideas by Claessen et al.
blanchet
parents:
42828
diff
changeset
|
2216 |
I |
1558741f8a72
started implementing "shallow" type systems, based on ideas by Claessen et al.
blanchet
parents:
42828
diff
changeset
|
2217 |
end |
1558741f8a72
started implementing "shallow" type systems, based on ideas by Claessen et al.
blanchet
parents:
42828
diff
changeset
|
2218 |
in |
42834
40f7691d0539
implemented thin versions of "preds" type systems + fixed various issues with type args
blanchet
parents:
42832
diff
changeset
|
2219 |
[] |> not pred_sym ? add_formula_for_res |
44814
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
2220 |
|> (Config.get ctxt type_tag_arguments andalso |
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
2221 |
grain = Positively_Naked_Vars) |
44496
c1884789ff80
added config options to control two aspects of the translation, for evaluation purposes
blanchet
parents:
44495
diff
changeset
|
2222 |
? fold add_formula_for_arg (ary - 1 downto 0) |
42829
1558741f8a72
started implementing "shallow" type systems, based on ideas by Claessen et al.
blanchet
parents:
42828
diff
changeset
|
2223 |
end |
1558741f8a72
started implementing "shallow" type systems, based on ideas by Claessen et al.
blanchet
parents:
42828
diff
changeset
|
2224 |
|
42836 | 2225 |
fun result_type_of_decl (_, _, T, _, ary, _) = chop_fun ary T |> snd |
2226 |
||
44399 | 2227 |
fun problem_lines_for_sym_decls ctxt format conj_sym_kind mono type_enc |
44396
66b9b3fcd608
started cleaning up polymorphic monotonicity-based encodings, based on discussions with Nick Smallbone
blanchet
parents:
44394
diff
changeset
|
2228 |
(s, decls) = |
43626
a867ebb12209
renamed "type_sys" to "type_enc", which is more accurate
blanchet
parents:
43624
diff
changeset
|
2229 |
case type_enc of |
42998
1c80902d0456
fully support all type system encodings in typed formats (TFF, THF)
blanchet
parents:
42994
diff
changeset
|
2230 |
Simple_Types _ => |
44399 | 2231 |
decls |> map (decl_line_for_sym ctxt format mono type_enc s) |
44768 | 2232 |
| Guards (_, level) => |
42998
1c80902d0456
fully support all type system encodings in typed formats (TFF, THF)
blanchet
parents:
42994
diff
changeset
|
2233 |
let |
1c80902d0456
fully support all type system encodings in typed formats (TFF, THF)
blanchet
parents:
42994
diff
changeset
|
2234 |
val decls = |
1c80902d0456
fully support all type system encodings in typed formats (TFF, THF)
blanchet
parents:
42994
diff
changeset
|
2235 |
case decls of |
1c80902d0456
fully support all type system encodings in typed formats (TFF, THF)
blanchet
parents:
42994
diff
changeset
|
2236 |
decl :: (decls' as _ :: _) => |
1c80902d0456
fully support all type system encodings in typed formats (TFF, THF)
blanchet
parents:
42994
diff
changeset
|
2237 |
let val T = result_type_of_decl decl in |
44399 | 2238 |
if forall (type_generalization ctxt T o result_type_of_decl) |
2239 |
decls' then |
|
42998
1c80902d0456
fully support all type system encodings in typed formats (TFF, THF)
blanchet
parents:
42994
diff
changeset
|
2240 |
[decl] |
1c80902d0456
fully support all type system encodings in typed formats (TFF, THF)
blanchet
parents:
42994
diff
changeset
|
2241 |
else |
1c80902d0456
fully support all type system encodings in typed formats (TFF, THF)
blanchet
parents:
42994
diff
changeset
|
2242 |
decls |
1c80902d0456
fully support all type system encodings in typed formats (TFF, THF)
blanchet
parents:
42994
diff
changeset
|
2243 |
end |
1c80902d0456
fully support all type system encodings in typed formats (TFF, THF)
blanchet
parents:
42994
diff
changeset
|
2244 |
| _ => decls |
1c80902d0456
fully support all type system encodings in typed formats (TFF, THF)
blanchet
parents:
42994
diff
changeset
|
2245 |
val n = length decls |
1c80902d0456
fully support all type system encodings in typed formats (TFF, THF)
blanchet
parents:
42994
diff
changeset
|
2246 |
val decls = |
44399 | 2247 |
decls |> filter (should_encode_type ctxt mono level |
43401
e93dfcb53535
fixed soundness bug made more visible by previous change
blanchet
parents:
43399
diff
changeset
|
2248 |
o result_type_of_decl) |
42998
1c80902d0456
fully support all type system encodings in typed formats (TFF, THF)
blanchet
parents:
42994
diff
changeset
|
2249 |
in |
1c80902d0456
fully support all type system encodings in typed formats (TFF, THF)
blanchet
parents:
42994
diff
changeset
|
2250 |
(0 upto length decls - 1, decls) |
44399 | 2251 |
|-> map2 (formula_line_for_guards_sym_decl ctxt format conj_sym_kind mono |
2252 |
type_enc n s) |
|
42998
1c80902d0456
fully support all type system encodings in typed formats (TFF, THF)
blanchet
parents:
42994
diff
changeset
|
2253 |
end |
44768 | 2254 |
| Tags (_, level) => |
44811 | 2255 |
if granularity_of_type_level level = All_Vars then |
44768 | 2256 |
[] |
2257 |
else |
|
2258 |
let val n = length decls in |
|
2259 |
(0 upto n - 1 ~~ decls) |
|
44811 | 2260 |
|> maps (formula_lines_for_tags_sym_decl ctxt format conj_sym_kind mono |
2261 |
type_enc n s) |
|
44768 | 2262 |
end |
42579
2552c09b1a72
implement the new ATP type system in Sledgehammer
blanchet
parents:
42577
diff
changeset
|
2263 |
|
44399 | 2264 |
fun problem_lines_for_sym_decl_table ctxt format conj_sym_kind mono type_enc |
44501 | 2265 |
mono_Ts sym_decl_tab = |
44396
66b9b3fcd608
started cleaning up polymorphic monotonicity-based encodings, based on discussions with Nick Smallbone
blanchet
parents:
44394
diff
changeset
|
2266 |
let |
66b9b3fcd608
started cleaning up polymorphic monotonicity-based encodings, based on discussions with Nick Smallbone
blanchet
parents:
44394
diff
changeset
|
2267 |
val syms = sym_decl_tab |> Symtab.dest |> sort_wrt fst |
66b9b3fcd608
started cleaning up polymorphic monotonicity-based encodings, based on discussions with Nick Smallbone
blanchet
parents:
44394
diff
changeset
|
2268 |
val mono_lines = |
44399 | 2269 |
problem_lines_for_mono_types ctxt format mono type_enc mono_Ts |
44396
66b9b3fcd608
started cleaning up polymorphic monotonicity-based encodings, based on discussions with Nick Smallbone
blanchet
parents:
44394
diff
changeset
|
2270 |
val decl_lines = |
66b9b3fcd608
started cleaning up polymorphic monotonicity-based encodings, based on discussions with Nick Smallbone
blanchet
parents:
44394
diff
changeset
|
2271 |
fold_rev (append o problem_lines_for_sym_decls ctxt format conj_sym_kind |
44399 | 2272 |
mono type_enc) |
44396
66b9b3fcd608
started cleaning up polymorphic monotonicity-based encodings, based on discussions with Nick Smallbone
blanchet
parents:
44394
diff
changeset
|
2273 |
syms [] |
66b9b3fcd608
started cleaning up polymorphic monotonicity-based encodings, based on discussions with Nick Smallbone
blanchet
parents:
44394
diff
changeset
|
2274 |
in mono_lines @ decl_lines end |
42543
f9d402d144d4
declare TFF types so that SNARK can be used with types
blanchet
parents:
42542
diff
changeset
|
2275 |
|
44768 | 2276 |
fun needs_type_tag_idempotence ctxt (Tags (poly, level)) = |
44496
c1884789ff80
added config options to control two aspects of the translation, for evaluation purposes
blanchet
parents:
44495
diff
changeset
|
2277 |
Config.get ctxt type_tag_idempotence andalso |
44768 | 2278 |
is_type_level_monotonicity_based level andalso |
2279 |
poly <> Mangled_Monomorphic |
|
44496
c1884789ff80
added config options to control two aspects of the translation, for evaluation purposes
blanchet
parents:
44495
diff
changeset
|
2280 |
| needs_type_tag_idempotence _ _ = false |
42831
c9b0968484fb
more work on "shallow" encoding + adjustments to other encodings
blanchet
parents:
42830
diff
changeset
|
2281 |
|
42939 | 2282 |
fun offset_of_heading_in_problem _ [] j = j |
2283 |
| offset_of_heading_in_problem needle ((heading, lines) :: problem) j = |
|
2284 |
if heading = needle then j |
|
2285 |
else offset_of_heading_in_problem needle problem (j + length lines) |
|
2286 |
||
42998
1c80902d0456
fully support all type system encodings in typed formats (TFF, THF)
blanchet
parents:
42994
diff
changeset
|
2287 |
val implicit_declsN = "Should-be-implicit typings" |
1c80902d0456
fully support all type system encodings in typed formats (TFF, THF)
blanchet
parents:
42994
diff
changeset
|
2288 |
val explicit_declsN = "Explicit typings" |
41157 | 2289 |
val factsN = "Relevant facts" |
2290 |
val class_relsN = "Class relationships" |
|
42543
f9d402d144d4
declare TFF types so that SNARK can be used with types
blanchet
parents:
42542
diff
changeset
|
2291 |
val aritiesN = "Arities" |
41157 | 2292 |
val helpersN = "Helper facts" |
2293 |
val conjsN = "Conjectures" |
|
41313
a96ac4d180b7
optionally supply constant weights to E -- turned off by default until properly parameterized
blanchet
parents:
41211
diff
changeset
|
2294 |
val free_typesN = "Type variables" |
41157 | 2295 |
|
44812 | 2296 |
val explicit_apply_threshold = 50 |
43259
30c141dc22d6
killed "explicit_apply" option in Sledgehammer -- the "smart" default is about as lightweight as "false" and just as complete as "true"
blanchet
parents:
43258
diff
changeset
|
2297 |
|
44397
06375952f1fa
cleaner handling of polymorphic monotonicity inference
blanchet
parents:
44396
diff
changeset
|
2298 |
fun prepare_atp_problem ctxt format conj_sym_kind prem_kind type_enc exporter |
06375952f1fa
cleaner handling of polymorphic monotonicity inference
blanchet
parents:
44396
diff
changeset
|
2299 |
lambda_trans readable_names preproc hyp_ts concl_t facts = |
38282
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
2300 |
let |
44774
72785558a6ff
separate mangling, which can (and should) be done before the formulas are first-orderized, and type arg filtering, which must be done after once the min arities have been computed
blanchet
parents:
44773
diff
changeset
|
2301 |
val thy = Proof_Context.theory_of ctxt |
44416
cabd06b69c18
added formats to the slice and use TFF for remote Vampire
blanchet
parents:
44410
diff
changeset
|
2302 |
val type_enc = type_enc |> adjust_type_enc format |
44812 | 2303 |
(* Forcing explicit applications is expensive for polymorphic encodings, |
2304 |
because it takes only one existential variable ranging over "'a => 'b" to |
|
2305 |
ruin everything. Hence we do it only if there are few facts. *) |
|
2306 |
val explicit_apply = |
|
2307 |
if polymorphism_of_type_enc type_enc <> Polymorphic orelse |
|
2308 |
length facts <= explicit_apply_threshold then |
|
2309 |
NONE |
|
2310 |
else |
|
2311 |
SOME false |
|
44088
3693baa6befb
move lambda-lifting code to ATP encoding, so it can be used by Metis
blanchet
parents:
44003
diff
changeset
|
2312 |
val lambda_trans = |
3693baa6befb
move lambda-lifting code to ATP encoding, so it can be used by Metis
blanchet
parents:
44003
diff
changeset
|
2313 |
if lambda_trans = smartN then |
3693baa6befb
move lambda-lifting code to ATP encoding, so it can be used by Metis
blanchet
parents:
44003
diff
changeset
|
2314 |
if is_type_enc_higher_order type_enc then lambdasN else combinatorsN |
3693baa6befb
move lambda-lifting code to ATP encoding, so it can be used by Metis
blanchet
parents:
44003
diff
changeset
|
2315 |
else if lambda_trans = lambdasN andalso |
3693baa6befb
move lambda-lifting code to ATP encoding, so it can be used by Metis
blanchet
parents:
44003
diff
changeset
|
2316 |
not (is_type_enc_higher_order type_enc) then |
3693baa6befb
move lambda-lifting code to ATP encoding, so it can be used by Metis
blanchet
parents:
44003
diff
changeset
|
2317 |
error ("Lambda translation method incompatible with first-order \ |
3693baa6befb
move lambda-lifting code to ATP encoding, so it can be used by Metis
blanchet
parents:
44003
diff
changeset
|
2318 |
\encoding.") |
3693baa6befb
move lambda-lifting code to ATP encoding, so it can be used by Metis
blanchet
parents:
44003
diff
changeset
|
2319 |
else |
3693baa6befb
move lambda-lifting code to ATP encoding, so it can be used by Metis
blanchet
parents:
44003
diff
changeset
|
2320 |
lambda_trans |
3693baa6befb
move lambda-lifting code to ATP encoding, so it can be used by Metis
blanchet
parents:
44003
diff
changeset
|
2321 |
val trans_lambdas = |
3693baa6befb
move lambda-lifting code to ATP encoding, so it can be used by Metis
blanchet
parents:
44003
diff
changeset
|
2322 |
if lambda_trans = no_lambdasN then |
3693baa6befb
move lambda-lifting code to ATP encoding, so it can be used by Metis
blanchet
parents:
44003
diff
changeset
|
2323 |
rpair [] |
3693baa6befb
move lambda-lifting code to ATP encoding, so it can be used by Metis
blanchet
parents:
44003
diff
changeset
|
2324 |
else if lambda_trans = concealedN then |
3693baa6befb
move lambda-lifting code to ATP encoding, so it can be used by Metis
blanchet
parents:
44003
diff
changeset
|
2325 |
lift_lambdas ctxt type_enc ##> K [] |
3693baa6befb
move lambda-lifting code to ATP encoding, so it can be used by Metis
blanchet
parents:
44003
diff
changeset
|
2326 |
else if lambda_trans = liftingN then |
3693baa6befb
move lambda-lifting code to ATP encoding, so it can be used by Metis
blanchet
parents:
44003
diff
changeset
|
2327 |
lift_lambdas ctxt type_enc |
3693baa6befb
move lambda-lifting code to ATP encoding, so it can be used by Metis
blanchet
parents:
44003
diff
changeset
|
2328 |
else if lambda_trans = combinatorsN then |
3693baa6befb
move lambda-lifting code to ATP encoding, so it can be used by Metis
blanchet
parents:
44003
diff
changeset
|
2329 |
map (introduce_combinators ctxt) #> rpair [] |
3693baa6befb
move lambda-lifting code to ATP encoding, so it can be used by Metis
blanchet
parents:
44003
diff
changeset
|
2330 |
else if lambda_trans = hybridN then |
3693baa6befb
move lambda-lifting code to ATP encoding, so it can be used by Metis
blanchet
parents:
44003
diff
changeset
|
2331 |
lift_lambdas ctxt type_enc |
3693baa6befb
move lambda-lifting code to ATP encoding, so it can be used by Metis
blanchet
parents:
44003
diff
changeset
|
2332 |
##> maps (fn t => [t, introduce_combinators ctxt |
3693baa6befb
move lambda-lifting code to ATP encoding, so it can be used by Metis
blanchet
parents:
44003
diff
changeset
|
2333 |
(intentionalize_def t)]) |
3693baa6befb
move lambda-lifting code to ATP encoding, so it can be used by Metis
blanchet
parents:
44003
diff
changeset
|
2334 |
else if lambda_trans = lambdasN then |
3693baa6befb
move lambda-lifting code to ATP encoding, so it can be used by Metis
blanchet
parents:
44003
diff
changeset
|
2335 |
map (Envir.eta_contract) #> rpair [] |
3693baa6befb
move lambda-lifting code to ATP encoding, so it can be used by Metis
blanchet
parents:
44003
diff
changeset
|
2336 |
else |
3693baa6befb
move lambda-lifting code to ATP encoding, so it can be used by Metis
blanchet
parents:
44003
diff
changeset
|
2337 |
error ("Unknown lambda translation method: " ^ |
3693baa6befb
move lambda-lifting code to ATP encoding, so it can be used by Metis
blanchet
parents:
44003
diff
changeset
|
2338 |
quote lambda_trans ^ ".") |
45508 | 2339 |
val (fact_names, classes, conjs, facts, class_rel_clauses, arity_clauses, |
2340 |
lifted) = |
|
43856
d636b053d4ff
move more lambda-handling logic to Sledgehammer, from ATP module, for formal dependency reasons
blanchet
parents:
43830
diff
changeset
|
2341 |
translate_formulas ctxt format prem_kind type_enc trans_lambdas preproc |
43828
e07a2c4cbad8
move lambda translation option from ATP to Sledgehammer, to avoid accidentally breaking Metis (its reconstruction code can only deal with combinators)
blanchet
parents:
43827
diff
changeset
|
2342 |
hyp_ts concl_t facts |
44786 | 2343 |
val sym_tab = |
44829
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
2344 |
sym_table_for_facts ctxt type_enc explicit_apply conjs facts |
44399 | 2345 |
val mono = conjs @ facts |> mononotonicity_info_for_facts ctxt type_enc |
44774
72785558a6ff
separate mangling, which can (and should) be done before the formulas are first-orderized, and type arg filtering, which must be done after once the min arities have been computed
blanchet
parents:
44773
diff
changeset
|
2346 |
val firstorderize = firstorderize_fact thy format type_enc sym_tab |
44773
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
2347 |
val (conjs, facts) = (conjs, facts) |> pairself (map firstorderize) |
44829
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
2348 |
val sym_tab = sym_table_for_facts ctxt type_enc (SOME false) conjs facts |
42573
744215c3e90c
got rid of one "sym_table" in "prepare_atp_problem" now that proxies are always handled first, and tuned accordingly
blanchet
parents:
42572
diff
changeset
|
2349 |
val helpers = |
44773
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
2350 |
sym_tab |> helper_facts_for_sym_table ctxt format type_enc |
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
2351 |
|> map firstorderize |
44501 | 2352 |
val mono_Ts = |
2353 |
helpers @ conjs @ facts |
|
2354 |
|> monotonic_types_for_facts ctxt mono type_enc |
|
44595
444d111bde7d
generate properly typed TFF1 (PFF) problems in the presence of type class predicates
blanchet
parents:
44594
diff
changeset
|
2355 |
val class_decl_lines = decl_lines_for_classes type_enc classes |
42680 | 2356 |
val sym_decl_lines = |
42731
2490e5e2f3f5
gracefully declare fTrue and fFalse proxies' types if the constants only appear in the helpers
blanchet
parents:
42730
diff
changeset
|
2357 |
(conjs, helpers @ facts) |
44773
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
2358 |
|> sym_decl_table_for_facts ctxt format type_enc sym_tab |
44399 | 2359 |
|> problem_lines_for_sym_decl_table ctxt format conj_sym_kind mono |
44501 | 2360 |
type_enc mono_Ts |
42881
dbdfe2d5b6ab
automatically use "metisFT" when typed helpers are necessary
blanchet
parents:
42879
diff
changeset
|
2361 |
val helper_lines = |
42956
9aeb0f6ad971
filter Waldmeister facts better -- and don't encode type classes as predicates, since it doesn't like conditional equations
blanchet
parents:
42951
diff
changeset
|
2362 |
0 upto length helpers - 1 ~~ helpers |
44399 | 2363 |
|> map (formula_line_for_fact ctxt format helper_prefix I false true mono |
2364 |
type_enc) |
|
44496
c1884789ff80
added config options to control two aspects of the translation, for evaluation purposes
blanchet
parents:
44495
diff
changeset
|
2365 |
|> (if needs_type_tag_idempotence ctxt type_enc then |
45301
866b075aa99b
added sorted DFG output for coming version of SPASS
blanchet
parents:
45299
diff
changeset
|
2366 |
cons (type_tag_idempotence_fact format type_enc) |
43159
29b55f292e0b
added support for helpers in new Metis, so far only for polymorphic type encodings
blanchet
parents:
43139
diff
changeset
|
2367 |
else |
29b55f292e0b
added support for helpers in new Metis, so far only for polymorphic type encodings
blanchet
parents:
43139
diff
changeset
|
2368 |
I) |
42522
413b56894f82
close ATP formulas universally earlier, so that we can add type predicates
blanchet
parents:
42521
diff
changeset
|
2369 |
(* Reordering these might confuse the proof reconstruction code or the SPASS |
43039 | 2370 |
FLOTTER hack. *) |
38282
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
2371 |
val problem = |
44595
444d111bde7d
generate properly typed TFF1 (PFF) problems in the presence of type class predicates
blanchet
parents:
44594
diff
changeset
|
2372 |
[(explicit_declsN, class_decl_lines @ sym_decl_lines), |
42956
9aeb0f6ad971
filter Waldmeister facts better -- and don't encode type classes as predicates, since it doesn't like conditional equations
blanchet
parents:
42951
diff
changeset
|
2373 |
(factsN, |
43501
0e422a84d0b2
don't change the way helpers are generated for the exporter's sake
blanchet
parents:
43496
diff
changeset
|
2374 |
map (formula_line_for_fact ctxt format fact_prefix ascii_of |
44595
444d111bde7d
generate properly typed TFF1 (PFF) problems in the presence of type class predicates
blanchet
parents:
44594
diff
changeset
|
2375 |
(not exporter) (not exporter) mono type_enc) |
42956
9aeb0f6ad971
filter Waldmeister facts better -- and don't encode type classes as predicates, since it doesn't like conditional equations
blanchet
parents:
42951
diff
changeset
|
2376 |
(0 upto length facts - 1 ~~ facts)), |
44593
ccf40af26ae9
implement more of the polymorphic simply typed format TFF(1)
blanchet
parents:
44591
diff
changeset
|
2377 |
(class_relsN, |
45301
866b075aa99b
added sorted DFG output for coming version of SPASS
blanchet
parents:
45299
diff
changeset
|
2378 |
map (formula_line_for_class_rel_clause format type_enc) |
866b075aa99b
added sorted DFG output for coming version of SPASS
blanchet
parents:
45299
diff
changeset
|
2379 |
class_rel_clauses), |
866b075aa99b
added sorted DFG output for coming version of SPASS
blanchet
parents:
45299
diff
changeset
|
2380 |
(aritiesN, |
866b075aa99b
added sorted DFG output for coming version of SPASS
blanchet
parents:
45299
diff
changeset
|
2381 |
map (formula_line_for_arity_clause format type_enc) arity_clauses), |
42881
dbdfe2d5b6ab
automatically use "metisFT" when typed helpers are necessary
blanchet
parents:
42879
diff
changeset
|
2382 |
(helpersN, helper_lines), |
42962
3b50fdeb6cfc
started adding support for THF output (but no lambdas)
blanchet
parents:
42956
diff
changeset
|
2383 |
(conjsN, |
44399 | 2384 |
map (formula_line_for_conjecture ctxt format mono type_enc) conjs), |
43626
a867ebb12209
renamed "type_sys" to "type_enc", which is more accurate
blanchet
parents:
43624
diff
changeset
|
2385 |
(free_typesN, formula_lines_for_free_types type_enc (facts @ conjs))] |
42543
f9d402d144d4
declare TFF types so that SNARK can be used with types
blanchet
parents:
42542
diff
changeset
|
2386 |
val problem = |
42561
23ddc4e3d19c
have properly type-instantiated helper facts (combinators and If)
blanchet
parents:
42560
diff
changeset
|
2387 |
problem |
43092
93ec303e1917
more work on new metis that exploits the powerful new type encodings
blanchet
parents:
43086
diff
changeset
|
2388 |
|> (case format of |
93ec303e1917
more work on new metis that exploits the powerful new type encodings
blanchet
parents:
43086
diff
changeset
|
2389 |
CNF => ensure_cnf_problem |
93ec303e1917
more work on new metis that exploits the powerful new type encodings
blanchet
parents:
43086
diff
changeset
|
2390 |
| CNF_UEQ => filter_cnf_ueq_problem |
44589
0a1dfc6365e9
first step towards polymorphic TFF + changed defaults for Vampire
blanchet
parents:
44587
diff
changeset
|
2391 |
| FOF => I |
44754 | 2392 |
| TFF (_, TPTP_Implicit) => I |
2393 |
| THF (_, TPTP_Implicit, _) => I |
|
44589
0a1dfc6365e9
first step towards polymorphic TFF + changed defaults for Vampire
blanchet
parents:
44587
diff
changeset
|
2394 |
| _ => declare_undeclared_syms_in_atp_problem type_decl_prefix |
0a1dfc6365e9
first step towards polymorphic TFF + changed defaults for Vampire
blanchet
parents:
44587
diff
changeset
|
2395 |
implicit_declsN) |
43092
93ec303e1917
more work on new metis that exploits the powerful new type encodings
blanchet
parents:
43086
diff
changeset
|
2396 |
val (problem, pool) = problem |> nice_atp_problem readable_names |
42881
dbdfe2d5b6ab
automatically use "metisFT" when typed helpers are necessary
blanchet
parents:
42879
diff
changeset
|
2397 |
val helpers_offset = offset_of_heading_in_problem helpersN problem 0 |
dbdfe2d5b6ab
automatically use "metisFT" when typed helpers are necessary
blanchet
parents:
42879
diff
changeset
|
2398 |
val typed_helpers = |
dbdfe2d5b6ab
automatically use "metisFT" when typed helpers are necessary
blanchet
parents:
42879
diff
changeset
|
2399 |
map_filter (fn (j, {name, ...}) => |
dbdfe2d5b6ab
automatically use "metisFT" when typed helpers are necessary
blanchet
parents:
42879
diff
changeset
|
2400 |
if String.isSuffix typed_helper_suffix name then SOME j |
dbdfe2d5b6ab
automatically use "metisFT" when typed helpers are necessary
blanchet
parents:
42879
diff
changeset
|
2401 |
else NONE) |
dbdfe2d5b6ab
automatically use "metisFT" when typed helpers are necessary
blanchet
parents:
42879
diff
changeset
|
2402 |
((helpers_offset + 1 upto helpers_offset + length helpers) |
dbdfe2d5b6ab
automatically use "metisFT" when typed helpers are necessary
blanchet
parents:
42879
diff
changeset
|
2403 |
~~ helpers) |
44772 | 2404 |
fun add_sym_ary (s, {min_ary, ...} : sym_info) = |
44773
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
2405 |
min_ary > 0 ? Symtab.insert (op =) (s, min_ary) |
38282
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
2406 |
in |
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
2407 |
(problem, |
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
2408 |
case pool of SOME the_pool => snd the_pool | NONE => Symtab.empty, |
42585
723b9d1e8ba5
fixed embarrassing bug where conjecture and fact offsets were swapped
blanchet
parents:
42579
diff
changeset
|
2409 |
offset_of_heading_in_problem conjsN problem 0, |
42541
8938507b2054
move type declarations to the front, for TFF-compliance
blanchet
parents:
42540
diff
changeset
|
2410 |
offset_of_heading_in_problem factsN problem 0, |
42755
4603154a3018
robustly detect how many type args were passed to the ATP, even if some of them were omitted
blanchet
parents:
42754
diff
changeset
|
2411 |
fact_names |> Vector.fromList, |
42881
dbdfe2d5b6ab
automatically use "metisFT" when typed helpers are necessary
blanchet
parents:
42879
diff
changeset
|
2412 |
typed_helpers, |
45508 | 2413 |
lifted, |
44772 | 2414 |
Symtab.empty |> Symtab.fold add_sym_ary sym_tab) |
38282
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
2415 |
end |
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
2416 |
|
41313
a96ac4d180b7
optionally supply constant weights to E -- turned off by default until properly parameterized
blanchet
parents:
41211
diff
changeset
|
2417 |
(* FUDGE *) |
a96ac4d180b7
optionally supply constant weights to E -- turned off by default until properly parameterized
blanchet
parents:
41211
diff
changeset
|
2418 |
val conj_weight = 0.0 |
41770 | 2419 |
val hyp_weight = 0.1 |
2420 |
val fact_min_weight = 0.2 |
|
41313
a96ac4d180b7
optionally supply constant weights to E -- turned off by default until properly parameterized
blanchet
parents:
41211
diff
changeset
|
2421 |
val fact_max_weight = 1.0 |
42608
6ef61823b63b
make sure E type information constants are given a weight, even if they don't appear anywhere else
blanchet
parents:
42592
diff
changeset
|
2422 |
val type_info_default_weight = 0.8 |
41313
a96ac4d180b7
optionally supply constant weights to E -- turned off by default until properly parameterized
blanchet
parents:
41211
diff
changeset
|
2423 |
|
a96ac4d180b7
optionally supply constant weights to E -- turned off by default until properly parameterized
blanchet
parents:
41211
diff
changeset
|
2424 |
fun add_term_weights weight (ATerm (s, tms)) = |
43676
3b0b448b4d69
add support for lambdas in TPTP THF generator + killed an unsound type encoding (because the monotonicity calculus assumes first-order)
nik
parents:
43628
diff
changeset
|
2425 |
is_tptp_user_symbol s ? Symtab.default (s, weight) |
3b0b448b4d69
add support for lambdas in TPTP THF generator + killed an unsound type encoding (because the monotonicity calculus assumes first-order)
nik
parents:
43628
diff
changeset
|
2426 |
#> fold (add_term_weights weight) tms |
3b0b448b4d69
add support for lambdas in TPTP THF generator + killed an unsound type encoding (because the monotonicity calculus assumes first-order)
nik
parents:
43628
diff
changeset
|
2427 |
| add_term_weights weight (AAbs (_, tm)) = add_term_weights weight tm |
42577
78414ec6fa4e
made the format (TFF or FOF) of the TPTP problem a global argument of the problem again and have the ATPs report which formats they support
blanchet
parents:
42576
diff
changeset
|
2428 |
fun add_problem_line_weights weight (Formula (_, _, phi, _, _)) = |
42834
40f7691d0539
implemented thin versions of "preds" type systems + fixed various issues with type args
blanchet
parents:
42832
diff
changeset
|
2429 |
formula_fold NONE (K (add_term_weights weight)) phi |
42528 | 2430 |
| add_problem_line_weights _ _ = I |
41313
a96ac4d180b7
optionally supply constant weights to E -- turned off by default until properly parameterized
blanchet
parents:
41211
diff
changeset
|
2431 |
|
a96ac4d180b7
optionally supply constant weights to E -- turned off by default until properly parameterized
blanchet
parents:
41211
diff
changeset
|
2432 |
fun add_conjectures_weights [] = I |
a96ac4d180b7
optionally supply constant weights to E -- turned off by default until properly parameterized
blanchet
parents:
41211
diff
changeset
|
2433 |
| add_conjectures_weights conjs = |
a96ac4d180b7
optionally supply constant weights to E -- turned off by default until properly parameterized
blanchet
parents:
41211
diff
changeset
|
2434 |
let val (hyps, conj) = split_last conjs in |
a96ac4d180b7
optionally supply constant weights to E -- turned off by default until properly parameterized
blanchet
parents:
41211
diff
changeset
|
2435 |
add_problem_line_weights conj_weight conj |
a96ac4d180b7
optionally supply constant weights to E -- turned off by default until properly parameterized
blanchet
parents:
41211
diff
changeset
|
2436 |
#> fold (add_problem_line_weights hyp_weight) hyps |
a96ac4d180b7
optionally supply constant weights to E -- turned off by default until properly parameterized
blanchet
parents:
41211
diff
changeset
|
2437 |
end |
a96ac4d180b7
optionally supply constant weights to E -- turned off by default until properly parameterized
blanchet
parents:
41211
diff
changeset
|
2438 |
|
a96ac4d180b7
optionally supply constant weights to E -- turned off by default until properly parameterized
blanchet
parents:
41211
diff
changeset
|
2439 |
fun add_facts_weights facts = |
a96ac4d180b7
optionally supply constant weights to E -- turned off by default until properly parameterized
blanchet
parents:
41211
diff
changeset
|
2440 |
let |
a96ac4d180b7
optionally supply constant weights to E -- turned off by default until properly parameterized
blanchet
parents:
41211
diff
changeset
|
2441 |
val num_facts = length facts |
a96ac4d180b7
optionally supply constant weights to E -- turned off by default until properly parameterized
blanchet
parents:
41211
diff
changeset
|
2442 |
fun weight_of j = |
a96ac4d180b7
optionally supply constant weights to E -- turned off by default until properly parameterized
blanchet
parents:
41211
diff
changeset
|
2443 |
fact_min_weight + (fact_max_weight - fact_min_weight) * Real.fromInt j |
a96ac4d180b7
optionally supply constant weights to E -- turned off by default until properly parameterized
blanchet
parents:
41211
diff
changeset
|
2444 |
/ Real.fromInt num_facts |
a96ac4d180b7
optionally supply constant weights to E -- turned off by default until properly parameterized
blanchet
parents:
41211
diff
changeset
|
2445 |
in |
a96ac4d180b7
optionally supply constant weights to E -- turned off by default until properly parameterized
blanchet
parents:
41211
diff
changeset
|
2446 |
map weight_of (0 upto num_facts - 1) ~~ facts |
a96ac4d180b7
optionally supply constant weights to E -- turned off by default until properly parameterized
blanchet
parents:
41211
diff
changeset
|
2447 |
|> fold (uncurry add_problem_line_weights) |
a96ac4d180b7
optionally supply constant weights to E -- turned off by default until properly parameterized
blanchet
parents:
41211
diff
changeset
|
2448 |
end |
a96ac4d180b7
optionally supply constant weights to E -- turned off by default until properly parameterized
blanchet
parents:
41211
diff
changeset
|
2449 |
|
a96ac4d180b7
optionally supply constant weights to E -- turned off by default until properly parameterized
blanchet
parents:
41211
diff
changeset
|
2450 |
(* Weights are from 0.0 (most important) to 1.0 (least important). *) |
a96ac4d180b7
optionally supply constant weights to E -- turned off by default until properly parameterized
blanchet
parents:
41211
diff
changeset
|
2451 |
fun atp_problem_weights problem = |
42608
6ef61823b63b
make sure E type information constants are given a weight, even if they don't appear anywhere else
blanchet
parents:
42592
diff
changeset
|
2452 |
let val get = these o AList.lookup (op =) problem in |
6ef61823b63b
make sure E type information constants are given a weight, even if they don't appear anywhere else
blanchet
parents:
42592
diff
changeset
|
2453 |
Symtab.empty |
6ef61823b63b
make sure E type information constants are given a weight, even if they don't appear anywhere else
blanchet
parents:
42592
diff
changeset
|
2454 |
|> add_conjectures_weights (get free_typesN @ get conjsN) |
6ef61823b63b
make sure E type information constants are given a weight, even if they don't appear anywhere else
blanchet
parents:
42592
diff
changeset
|
2455 |
|> add_facts_weights (get factsN) |
6ef61823b63b
make sure E type information constants are given a weight, even if they don't appear anywhere else
blanchet
parents:
42592
diff
changeset
|
2456 |
|> fold (fold (add_problem_line_weights type_info_default_weight) o get) |
42998
1c80902d0456
fully support all type system encodings in typed formats (TFF, THF)
blanchet
parents:
42994
diff
changeset
|
2457 |
[explicit_declsN, class_relsN, aritiesN] |
42608
6ef61823b63b
make sure E type information constants are given a weight, even if they don't appear anywhere else
blanchet
parents:
42592
diff
changeset
|
2458 |
|> Symtab.dest |
6ef61823b63b
make sure E type information constants are given a weight, even if they don't appear anywhere else
blanchet
parents:
42592
diff
changeset
|
2459 |
|> sort (prod_ord Real.compare string_ord o pairself swap) |
6ef61823b63b
make sure E type information constants are given a weight, even if they don't appear anywhere else
blanchet
parents:
42592
diff
changeset
|
2460 |
end |
41313
a96ac4d180b7
optionally supply constant weights to E -- turned off by default until properly parameterized
blanchet
parents:
41211
diff
changeset
|
2461 |
|
38282
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
2462 |
end; |