author | blanchet |
Mon, 28 Mar 2016 12:05:47 +0200 | |
changeset 62718 | 27333dc58e28 |
parent 62218 | 42202671777c |
child 63692 | 1bc4bc2c9fd1 |
permissions | -rw-r--r-- |
46320 | 1 |
(* Title: HOL/Tools/ATP/atp_problem_generate.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 |
|
46320 | 9 |
signature ATP_PROBLEM_GENERATE = |
38282
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
10 |
sig |
53586
bd5fa6425993
prefixed types and some functions with "atp_" for disambiguation
blanchet
parents:
52995
diff
changeset
|
11 |
type ('a, 'b) atp_term = ('a, 'b) ATP_Problem.atp_term |
bd5fa6425993
prefixed types and some functions with "atp_" for disambiguation
blanchet
parents:
52995
diff
changeset
|
12 |
type atp_connective = ATP_Problem.atp_connective |
bd5fa6425993
prefixed types and some functions with "atp_" for disambiguation
blanchet
parents:
52995
diff
changeset
|
13 |
type ('a, 'b, 'c, 'd) atp_formula = ('a, 'b, 'c, 'd) ATP_Problem.atp_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 |
53586
bd5fa6425993
prefixed types and some functions with "atp_" for disambiguation
blanchet
parents:
52995
diff
changeset
|
15 |
type atp_formula_role = ATP_Problem.atp_formula_role |
bd5fa6425993
prefixed types and some functions with "atp_" for disambiguation
blanchet
parents:
52995
diff
changeset
|
16 |
type 'a atp_problem = 'a ATP_Problem.atp_problem |
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
17 |
|
62718 | 18 |
datatype mode = Metis | Sledgehammer | Sledgehammer_Completish of int | Exporter | Translator |
47946
33afcfad3f8d
add an experimental "aggressive" mode to Sledgehammer, to experiment with more complete translations of higher-order features without breaking "metis"
blanchet
parents:
47944
diff
changeset
|
19 |
|
46340 | 20 |
datatype scope = Global | Local | Assum | Chained |
55212 | 21 |
datatype status = General | Induction | Intro | Inductive | Elim | Simp | Non_Rec_Def | Rec_Def |
22 |
||
46340 | 23 |
type stature = scope * status |
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 |
|
46301 | 25 |
datatype strictness = Strict | Non_Strict |
48183 | 26 |
datatype uniformity = Uniform | Non_Uniform |
52026 | 27 |
datatype ctr_optim = With_Ctr_Optim | Without_Ctr_Optim |
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
|
28 |
datatype type_level = |
44397
06375952f1fa
cleaner handling of polymorphic monotonicity inference
blanchet
parents:
44396
diff
changeset
|
29 |
All_Types | |
48200
5156cadedfa5
fiddled with "tags_at" a bit -- the only non-tuning part of the change is a slight simplification of the typing axioms
blanchet
parents:
48199
diff
changeset
|
30 |
Undercover_Types | |
48183 | 31 |
Nonmono_Types of strictness * uniformity | |
52026 | 32 |
Const_Types of ctr_optim | |
43362 | 33 |
No_Types |
44782 | 34 |
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
|
35 |
|
45513
25388cf06437
rename the lambda translation schemes, so that they are understandable out of context
blanchet
parents:
45511
diff
changeset
|
36 |
val no_lamsN : string |
25388cf06437
rename the lambda translation schemes, so that they are understandable out of context
blanchet
parents:
45511
diff
changeset
|
37 |
val hide_lamsN : string |
46365 | 38 |
val liftingN : string |
39 |
val combsN : string |
|
40 |
val combs_and_liftingN : string |
|
41 |
val combs_or_liftingN : string |
|
45513
25388cf06437
rename the lambda translation schemes, so that they are understandable out of context
blanchet
parents:
45511
diff
changeset
|
42 |
val lam_liftingN : string |
25388cf06437
rename the lambda translation schemes, so that they are understandable out of context
blanchet
parents:
45511
diff
changeset
|
43 |
val keep_lamsN : string |
43496
92f5a4c78b37
remove historical bloat -- another benefit of merging Metis's and Sledgehammer's translations
blanchet
parents:
43495
diff
changeset
|
44 |
val schematic_var_prefix : string |
92f5a4c78b37
remove historical bloat -- another benefit of merging Metis's and Sledgehammer's translations
blanchet
parents:
43495
diff
changeset
|
45 |
val fixed_var_prefix : string |
92f5a4c78b37
remove historical bloat -- another benefit of merging Metis's and Sledgehammer's translations
blanchet
parents:
43495
diff
changeset
|
46 |
val tvar_prefix : string |
92f5a4c78b37
remove historical bloat -- another benefit of merging Metis's and Sledgehammer's translations
blanchet
parents:
43495
diff
changeset
|
47 |
val tfree_prefix : string |
92f5a4c78b37
remove historical bloat -- another benefit of merging Metis's and Sledgehammer's translations
blanchet
parents:
43495
diff
changeset
|
48 |
val const_prefix : string |
92f5a4c78b37
remove historical bloat -- another benefit of merging Metis's and Sledgehammer's translations
blanchet
parents:
43495
diff
changeset
|
49 |
val type_const_prefix : string |
92f5a4c78b37
remove historical bloat -- another benefit of merging Metis's and Sledgehammer's translations
blanchet
parents:
43495
diff
changeset
|
50 |
val class_prefix : string |
45554
09ad83de849c
don't pass "lam_lifted" option to "metis" unless there's a good reason
blanchet
parents:
45551
diff
changeset
|
51 |
val lam_lifted_prefix : string |
09ad83de849c
don't pass "lam_lifted" option to "metis" unless there's a good reason
blanchet
parents:
45551
diff
changeset
|
52 |
val lam_lifted_mono_prefix : string |
09ad83de849c
don't pass "lam_lifted" option to "metis" unless there's a good reason
blanchet
parents:
45551
diff
changeset
|
53 |
val lam_lifted_poly_prefix : string |
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
54 |
val skolem_const_prefix : string |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
55 |
val old_skolem_const_prefix : string |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
56 |
val new_skolem_const_prefix : string |
45554
09ad83de849c
don't pass "lam_lifted" option to "metis" unless there's a good reason
blanchet
parents:
45551
diff
changeset
|
57 |
val combinator_prefix : string |
48142
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
58 |
val class_decl_prefix : string |
43125
ddf63baabdec
distinguish different kinds of typing informations in the fact name
blanchet
parents:
43121
diff
changeset
|
59 |
val type_decl_prefix : string |
ddf63baabdec
distinguish different kinds of typing informations in the fact name
blanchet
parents:
43121
diff
changeset
|
60 |
val sym_decl_prefix : string |
52004 | 61 |
val datatype_decl_prefix : string |
48142
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
62 |
val class_memb_prefix : string |
43989 | 63 |
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
|
64 |
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
|
65 |
val fact_prefix : string |
38282
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
66 |
val conjecture_prefix : string |
42881
dbdfe2d5b6ab
automatically use "metisFT" when typed helpers are necessary
blanchet
parents:
42879
diff
changeset
|
67 |
val helper_prefix : string |
48142
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
68 |
val subclass_prefix : string |
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
69 |
val tcon_clause_prefix : string |
43125
ddf63baabdec
distinguish different kinds of typing informations in the fact name
blanchet
parents:
43121
diff
changeset
|
70 |
val tfree_clause_prefix : string |
45554
09ad83de849c
don't pass "lam_lifted" option to "metis" unless there's a good reason
blanchet
parents:
45551
diff
changeset
|
71 |
val lam_fact_prefix : string |
42881
dbdfe2d5b6ab
automatically use "metisFT" when typed helpers are necessary
blanchet
parents:
42879
diff
changeset
|
72 |
val typed_helper_suffix : string |
43125
ddf63baabdec
distinguish different kinds of typing informations in the fact name
blanchet
parents:
43121
diff
changeset
|
73 |
val untyped_helper_suffix : string |
42966
4e2d6c1e5392
more work on parsing LEO-II proofs without lambdas
blanchet
parents:
42963
diff
changeset
|
74 |
val predicator_name : string |
4e2d6c1e5392
more work on parsing LEO-II proofs without lambdas
blanchet
parents:
42963
diff
changeset
|
75 |
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
|
76 |
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
|
77 |
val type_tag_name : string |
46435 | 78 |
val native_type_prefix : string |
43174 | 79 |
val prefixed_predicator_name : string |
43130
d73fc2e55308
implemented missing hAPP and ti cases of new path finder
blanchet
parents:
43129
diff
changeset
|
80 |
val prefixed_app_op_name : string |
d73fc2e55308
implemented missing hAPP and ti cases of new path finder
blanchet
parents:
43129
diff
changeset
|
81 |
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
|
82 |
val ascii_of : string -> string |
92f5a4c78b37
remove historical bloat -- another benefit of merging Metis's and Sledgehammer's translations
blanchet
parents:
43495
diff
changeset
|
83 |
val unascii_of : string -> string |
45511
9b0f8ca4388e
continued implementation of lambda-lifting in Metis
blanchet
parents:
45509
diff
changeset
|
84 |
val unprefix_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
|
85 |
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
|
86 |
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
|
87 |
val invert_const : string -> string |
92f5a4c78b37
remove historical bloat -- another benefit of merging Metis's and Sledgehammer's translations
blanchet
parents:
43495
diff
changeset
|
88 |
val unproxify_const : string -> string |
52031
9a9238342963
tuning -- renamed '_from_' to '_of_' in Sledgehammer
blanchet
parents:
52030
diff
changeset
|
89 |
val new_skolem_var_name_of_const : string -> string |
48318 | 90 |
val atp_logical_consts : string list |
43248
69375eaa9016
more suitable implementation of "schematic_consts_of" for monomorphizer, for ATPs
blanchet
parents:
43222
diff
changeset
|
91 |
val atp_irrelevant_consts : string list |
48324 | 92 |
val atp_widely_irrelevant_consts : string list |
54089
b13f6731f873
use same relevance filter for ATP and SMT solvers -- attempting to filter out certain ground instances of polymorphic symbols like + and 0 has unexpected side-effects that lead to incompletenesses (relevant facts not being selected)
blanchet
parents:
53586
diff
changeset
|
93 |
val is_irrelevant_const : string -> bool |
b13f6731f873
use same relevance filter for ATP and SMT solvers -- attempting to filter out certain ground instances of polymorphic symbols like + and 0 has unexpected side-effects that lead to incompletenesses (relevant facts not being selected)
blanchet
parents:
53586
diff
changeset
|
94 |
val is_widely_irrelevant_const : string -> bool |
43248
69375eaa9016
more suitable implementation of "schematic_consts_of" for monomorphizer, for ATPs
blanchet
parents:
43222
diff
changeset
|
95 |
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
|
96 |
val is_type_enc_higher_order : type_enc -> bool |
48131 | 97 |
val is_type_enc_polymorphic : type_enc -> bool |
43626
a867ebb12209
renamed "type_sys" to "type_enc", which is more accurate
blanchet
parents:
43624
diff
changeset
|
98 |
val level_of_type_enc : type_enc -> type_level |
48089 | 99 |
val is_type_enc_sound : type_enc -> bool |
52031
9a9238342963
tuning -- renamed '_from_' to '_of_' in Sledgehammer
blanchet
parents:
52030
diff
changeset
|
100 |
val type_enc_of_string : strictness -> string -> type_enc |
45301
866b075aa99b
added sorted DFG output for coming version of SPASS
blanchet
parents:
45299
diff
changeset
|
101 |
val adjust_type_enc : atp_format -> type_enc -> type_enc |
48302 | 102 |
val is_lambda_free : term -> bool |
58200
d95055489fce
Added translation for lambda expressions in terms.
steckerm
parents:
57547
diff
changeset
|
103 |
val do_cheaply_conceal_lambdas : typ list -> term -> term |
43136
cf5cda219058
handle lightweight tags sym theorems gracefully in the presence of TVars with interesting type classes
blanchet
parents:
43130
diff
changeset
|
104 |
val mk_aconns : |
53586
bd5fa6425993
prefixed types and some functions with "atp_" for disambiguation
blanchet
parents:
52995
diff
changeset
|
105 |
atp_connective -> ('a, 'b, 'c, 'd) atp_formula list |
bd5fa6425993
prefixed types and some functions with "atp_" for disambiguation
blanchet
parents:
52995
diff
changeset
|
106 |
-> ('a, 'b, 'c, 'd) atp_formula |
58477 | 107 |
val unmangled_type : string -> (string, 'a) ATP_Problem.atp_term |
53586
bd5fa6425993
prefixed types and some functions with "atp_" for disambiguation
blanchet
parents:
52995
diff
changeset
|
108 |
val unmangled_const : string -> string * (string, 'b) atp_term list |
46392
676a4b4b6e73
implemented partial application aliases (for SPASS mainly)
blanchet
parents:
46389
diff
changeset
|
109 |
val unmangled_const_name : string -> string list |
47946
33afcfad3f8d
add an experimental "aggressive" mode to Sledgehammer, to experiment with more complete translations of higher-order features without breaking "metis"
blanchet
parents:
47944
diff
changeset
|
110 |
val helper_table : ((string * bool) * (status * thm) list) list |
52031
9a9238342963
tuning -- renamed '_from_' to '_of_' in Sledgehammer
blanchet
parents:
52030
diff
changeset
|
111 |
val trans_lams_of_string : |
45514 | 112 |
Proof.context -> type_enc -> string -> term list -> term list * term list |
48438
3e45c98fe127
distinguish between recursive and nonrecursive definitions + clean up typedef dependencies in MaSh
blanchet
parents:
48324
diff
changeset
|
113 |
val string_of_status : status -> string |
43501
0e422a84d0b2
don't change the way helpers are generated for the exporter's sake
blanchet
parents:
43496
diff
changeset
|
114 |
val factsN : string |
61860
2ce3d12015b3
cleaner generation of metainformation in DFG format and TPTP theory exporter for Sledgehammer
blanchet
parents:
61770
diff
changeset
|
115 |
val generate_atp_problem : Proof.context -> bool -> atp_format -> atp_formula_role -> type_enc -> |
2ce3d12015b3
cleaner generation of metainformation in DFG format and TPTP theory exporter for Sledgehammer
blanchet
parents:
61770
diff
changeset
|
116 |
mode -> string -> bool -> bool -> bool -> term list -> term -> |
2ce3d12015b3
cleaner generation of metainformation in DFG format and TPTP theory exporter for Sledgehammer
blanchet
parents:
61770
diff
changeset
|
117 |
((string * stature) * term) list -> string atp_problem * string Symtab.table |
2ce3d12015b3
cleaner generation of metainformation in DFG format and TPTP theory exporter for Sledgehammer
blanchet
parents:
61770
diff
changeset
|
118 |
* (string * term) list * int Symtab.table |
53586
bd5fa6425993
prefixed types and some functions with "atp_" for disambiguation
blanchet
parents:
52995
diff
changeset
|
119 |
val atp_problem_selection_weights : string atp_problem -> (string * real) list |
bd5fa6425993
prefixed types and some functions with "atp_" for disambiguation
blanchet
parents:
52995
diff
changeset
|
120 |
val atp_problem_term_order_info : string atp_problem -> (string * int) list |
38282
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
121 |
end; |
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
122 |
|
46320 | 123 |
structure ATP_Problem_Generate : ATP_PROBLEM_GENERATE = |
38282
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
124 |
struct |
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
125 |
|
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
126 |
open ATP_Util |
38282
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
127 |
open ATP_Problem |
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
128 |
|
62718 | 129 |
datatype mode = Metis | Sledgehammer | Sledgehammer_Completish of int | Exporter | Translator |
47946
33afcfad3f8d
add an experimental "aggressive" mode to Sledgehammer, to experiment with more complete translations of higher-order features without breaking "metis"
blanchet
parents:
47944
diff
changeset
|
130 |
|
47768
0b2b7ff31867
don't use the native choice operator if the type encoding isn't higher-order
blanchet
parents:
47767
diff
changeset
|
131 |
datatype scope = Global | Local | Assum | Chained |
55212 | 132 |
datatype status = General | Induction | Intro | Inductive | Elim | Simp | Non_Rec_Def | Rec_Def |
133 |
||
47768
0b2b7ff31867
don't use the native choice operator if the type encoding isn't higher-order
blanchet
parents:
47767
diff
changeset
|
134 |
type stature = scope * status |
0b2b7ff31867
don't use the native choice operator if the type encoding isn't higher-order
blanchet
parents:
47767
diff
changeset
|
135 |
|
0b2b7ff31867
don't use the native choice operator if the type encoding isn't higher-order
blanchet
parents:
47767
diff
changeset
|
136 |
datatype order = |
0b2b7ff31867
don't use the native choice operator if the type encoding isn't higher-order
blanchet
parents:
47767
diff
changeset
|
137 |
First_Order | |
48004
989a34fa72b3
don't generate definitions for LEO-II -- this cuases more harm than good
blanchet
parents:
47991
diff
changeset
|
138 |
Higher_Order of thf_choice |
48131 | 139 |
datatype phantom_policy = Without_Phantom_Type_Vars | With_Phantom_Type_Vars |
140 |
datatype polymorphism = |
|
141 |
Type_Class_Polymorphic | |
|
142 |
Raw_Polymorphic of phantom_policy | |
|
143 |
Raw_Monomorphic | |
|
144 |
Mangled_Monomorphic |
|
47768
0b2b7ff31867
don't use the native choice operator if the type encoding isn't higher-order
blanchet
parents:
47767
diff
changeset
|
145 |
datatype strictness = Strict | Non_Strict |
48183 | 146 |
datatype uniformity = Uniform | Non_Uniform |
52026 | 147 |
datatype ctr_optim = With_Ctr_Optim | Without_Ctr_Optim |
47768
0b2b7ff31867
don't use the native choice operator if the type encoding isn't higher-order
blanchet
parents:
47767
diff
changeset
|
148 |
datatype type_level = |
0b2b7ff31867
don't use the native choice operator if the type encoding isn't higher-order
blanchet
parents:
47767
diff
changeset
|
149 |
All_Types | |
48200
5156cadedfa5
fiddled with "tags_at" a bit -- the only non-tuning part of the change is a slight simplification of the typing axioms
blanchet
parents:
48199
diff
changeset
|
150 |
Undercover_Types | |
48183 | 151 |
Nonmono_Types of strictness * uniformity | |
52026 | 152 |
Const_Types of ctr_optim | |
47768
0b2b7ff31867
don't use the native choice operator if the type encoding isn't higher-order
blanchet
parents:
47767
diff
changeset
|
153 |
No_Types |
0b2b7ff31867
don't use the native choice operator if the type encoding isn't higher-order
blanchet
parents:
47767
diff
changeset
|
154 |
|
0b2b7ff31867
don't use the native choice operator if the type encoding isn't higher-order
blanchet
parents:
47767
diff
changeset
|
155 |
datatype type_enc = |
0b2b7ff31867
don't use the native choice operator if the type encoding isn't higher-order
blanchet
parents:
47767
diff
changeset
|
156 |
Native of order * polymorphism * type_level | |
0b2b7ff31867
don't use the native choice operator if the type encoding isn't higher-order
blanchet
parents:
47767
diff
changeset
|
157 |
Guards of polymorphism * type_level | |
0b2b7ff31867
don't use the native choice operator if the type encoding isn't higher-order
blanchet
parents:
47767
diff
changeset
|
158 |
Tags of polymorphism * type_level |
0b2b7ff31867
don't use the native choice operator if the type encoding isn't higher-order
blanchet
parents:
47767
diff
changeset
|
159 |
|
48654 | 160 |
(* not clear whether ATPs prefer to have their negative variables tagged *) |
161 |
val tag_neg_vars = false |
|
162 |
||
47768
0b2b7ff31867
don't use the native choice operator if the type encoding isn't higher-order
blanchet
parents:
47767
diff
changeset
|
163 |
fun is_type_enc_native (Native _) = true |
0b2b7ff31867
don't use the native choice operator if the type encoding isn't higher-order
blanchet
parents:
47767
diff
changeset
|
164 |
| is_type_enc_native _ = false |
0b2b7ff31867
don't use the native choice operator if the type encoding isn't higher-order
blanchet
parents:
47767
diff
changeset
|
165 |
fun is_type_enc_higher_order (Native (Higher_Order _, _, _)) = true |
0b2b7ff31867
don't use the native choice operator if the type encoding isn't higher-order
blanchet
parents:
47767
diff
changeset
|
166 |
| is_type_enc_higher_order _ = false |
0b2b7ff31867
don't use the native choice operator if the type encoding isn't higher-order
blanchet
parents:
47767
diff
changeset
|
167 |
|
0b2b7ff31867
don't use the native choice operator if the type encoding isn't higher-order
blanchet
parents:
47767
diff
changeset
|
168 |
fun polymorphism_of_type_enc (Native (_, poly, _)) = poly |
0b2b7ff31867
don't use the native choice operator if the type encoding isn't higher-order
blanchet
parents:
47767
diff
changeset
|
169 |
| polymorphism_of_type_enc (Guards (poly, _)) = poly |
0b2b7ff31867
don't use the native choice operator if the type encoding isn't higher-order
blanchet
parents:
47767
diff
changeset
|
170 |
| polymorphism_of_type_enc (Tags (poly, _)) = poly |
0b2b7ff31867
don't use the native choice operator if the type encoding isn't higher-order
blanchet
parents:
47767
diff
changeset
|
171 |
|
48131 | 172 |
fun is_type_enc_polymorphic type_enc = |
54829 | 173 |
(case polymorphism_of_type_enc type_enc of |
48131 | 174 |
Raw_Polymorphic _ => true |
175 |
| Type_Class_Polymorphic => true |
|
54829 | 176 |
| _ => false) |
48131 | 177 |
|
48201 | 178 |
fun is_type_enc_mangling type_enc = |
179 |
polymorphism_of_type_enc type_enc = Mangled_Monomorphic |
|
180 |
||
47768
0b2b7ff31867
don't use the native choice operator if the type encoding isn't higher-order
blanchet
parents:
47767
diff
changeset
|
181 |
fun level_of_type_enc (Native (_, _, level)) = level |
0b2b7ff31867
don't use the native choice operator if the type encoding isn't higher-order
blanchet
parents:
47767
diff
changeset
|
182 |
| level_of_type_enc (Guards (_, level)) = level |
0b2b7ff31867
don't use the native choice operator if the type encoding isn't higher-order
blanchet
parents:
47767
diff
changeset
|
183 |
| level_of_type_enc (Tags (_, level)) = level |
0b2b7ff31867
don't use the native choice operator if the type encoding isn't higher-order
blanchet
parents:
47767
diff
changeset
|
184 |
|
48183 | 185 |
fun is_type_level_uniform (Nonmono_Types (_, Non_Uniform)) = false |
186 |
| is_type_level_uniform Undercover_Types = false |
|
187 |
| is_type_level_uniform _ = true |
|
47768
0b2b7ff31867
don't use the native choice operator if the type encoding isn't higher-order
blanchet
parents:
47767
diff
changeset
|
188 |
|
48183 | 189 |
fun is_type_level_sound (Const_Types _) = false |
190 |
| is_type_level_sound No_Types = false |
|
191 |
| is_type_level_sound _ = true |
|
48089 | 192 |
val is_type_enc_sound = is_type_level_sound o level_of_type_enc |
47768
0b2b7ff31867
don't use the native choice operator if the type encoding isn't higher-order
blanchet
parents:
47767
diff
changeset
|
193 |
|
48092 | 194 |
fun is_type_level_monotonicity_based (Nonmono_Types _) = true |
47768
0b2b7ff31867
don't use the native choice operator if the type encoding isn't higher-order
blanchet
parents:
47767
diff
changeset
|
195 |
| is_type_level_monotonicity_based _ = false |
0b2b7ff31867
don't use the native choice operator if the type encoding isn't higher-order
blanchet
parents:
47767
diff
changeset
|
196 |
|
45516 | 197 |
val no_lamsN = "no_lams" (* used internally; undocumented *) |
45513
25388cf06437
rename the lambda translation schemes, so that they are understandable out of context
blanchet
parents:
45511
diff
changeset
|
198 |
val hide_lamsN = "hide_lams" |
46365 | 199 |
val liftingN = "lifting" |
200 |
val combsN = "combs" |
|
201 |
val combs_and_liftingN = "combs_and_lifting" |
|
202 |
val combs_or_liftingN = "combs_or_lifting" |
|
45513
25388cf06437
rename the lambda translation schemes, so that they are understandable out of context
blanchet
parents:
45511
diff
changeset
|
203 |
val keep_lamsN = "keep_lams" |
48144 | 204 |
val lam_liftingN = "lam_lifting" (* legacy FIXME: remove *) |
44088
3693baa6befb
move lambda-lifting code to ATP encoding, so it can be used by Metis
blanchet
parents:
44003
diff
changeset
|
205 |
|
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
206 |
val bound_var_prefix = "B_" |
47150 | 207 |
val all_bound_var_prefix = "A_" |
208 |
val exist_bound_var_prefix = "E_" |
|
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
209 |
val schematic_var_prefix = "V_" |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
210 |
val fixed_var_prefix = "v_" |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
211 |
val tvar_prefix = "T_" |
48219 | 212 |
val tfree_prefix = "tf_" |
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
213 |
val const_prefix = "c_" |
48219 | 214 |
val type_const_prefix = "t_" |
46435 | 215 |
val native_type_prefix = "n_" |
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
216 |
val class_prefix = "cl_" |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
217 |
|
45509 | 218 |
(* Freshness almost guaranteed! *) |
46392
676a4b4b6e73
implemented partial application aliases (for SPASS mainly)
blanchet
parents:
46389
diff
changeset
|
219 |
val atp_prefix = "ATP" ^ Long_Name.separator |
45509 | 220 |
val atp_weak_prefix = "ATP:" |
52076
bfa28e1cba77
freeze types in Sledgehammer goal, not just terms
blanchet
parents:
52071
diff
changeset
|
221 |
val atp_weak_suffix = ":ATP" |
45509 | 222 |
|
45554
09ad83de849c
don't pass "lam_lifted" option to "metis" unless there's a good reason
blanchet
parents:
45551
diff
changeset
|
223 |
val lam_lifted_prefix = atp_weak_prefix ^ "Lam" |
09ad83de849c
don't pass "lam_lifted" option to "metis" unless there's a good reason
blanchet
parents:
45551
diff
changeset
|
224 |
val lam_lifted_mono_prefix = lam_lifted_prefix ^ "m" |
09ad83de849c
don't pass "lam_lifted" option to "metis" unless there's a good reason
blanchet
parents:
45551
diff
changeset
|
225 |
val lam_lifted_poly_prefix = lam_lifted_prefix ^ "p" |
43907
073ab5379842
pass type arguments to lambda-lifted Frees, to account for polymorphism
blanchet
parents:
43906
diff
changeset
|
226 |
|
46392
676a4b4b6e73
implemented partial application aliases (for SPASS mainly)
blanchet
parents:
46389
diff
changeset
|
227 |
val skolem_const_prefix = atp_prefix ^ "Sko" |
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
228 |
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
|
229 |
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
|
230 |
|
45554
09ad83de849c
don't pass "lam_lifted" option to "metis" unless there's a good reason
blanchet
parents:
45551
diff
changeset
|
231 |
val combinator_prefix = "COMB" |
09ad83de849c
don't pass "lam_lifted" option to "metis" unless there's a good reason
blanchet
parents:
45551
diff
changeset
|
232 |
|
48142
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
233 |
val class_decl_prefix = "cl_" |
42998
1c80902d0456
fully support all type system encodings in typed formats (TFF, THF)
blanchet
parents:
42994
diff
changeset
|
234 |
val type_decl_prefix = "ty_" |
1c80902d0456
fully support all type system encodings in typed formats (TFF, THF)
blanchet
parents:
42994
diff
changeset
|
235 |
val sym_decl_prefix = "sy_" |
52004 | 236 |
val datatype_decl_prefix = "dt_" |
237 |
val class_memb_prefix = "cm_" |
|
43989 | 238 |
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
|
239 |
val tags_sym_formula_prefix = "tsy_" |
46409
d4754183ccce
made option available to users (mostly for experiments)
blanchet
parents:
46406
diff
changeset
|
240 |
val uncurried_alias_eq_prefix = "unc_" |
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
|
241 |
val fact_prefix = "fact_" |
38282
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
242 |
val conjecture_prefix = "conj_" |
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
243 |
val helper_prefix = "help_" |
48142
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
244 |
val subclass_prefix = "subcl_" |
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
245 |
val tcon_clause_prefix = "tcon_" |
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
246 |
val tfree_clause_prefix = "tfree_" |
38282
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
247 |
|
45554
09ad83de849c
don't pass "lam_lifted" option to "metis" unless there's a good reason
blanchet
parents:
45551
diff
changeset
|
248 |
val lam_fact_prefix = "ATP.lambda_" |
42881
dbdfe2d5b6ab
automatically use "metisFT" when typed helpers are necessary
blanchet
parents:
42879
diff
changeset
|
249 |
val typed_helper_suffix = "_T" |
dbdfe2d5b6ab
automatically use "metisFT" when typed helpers are necessary
blanchet
parents:
42879
diff
changeset
|
250 |
val untyped_helper_suffix = "_U" |
dbdfe2d5b6ab
automatically use "metisFT" when typed helpers are necessary
blanchet
parents:
42879
diff
changeset
|
251 |
|
44491
ba22ed224b20
fixed bang encoding detection of which types to encode
blanchet
parents:
44463
diff
changeset
|
252 |
val predicator_name = "pp" |
ba22ed224b20
fixed bang encoding detection of which types to encode
blanchet
parents:
44463
diff
changeset
|
253 |
val app_op_name = "aa" |
ba22ed224b20
fixed bang encoding detection of which types to encode
blanchet
parents:
44463
diff
changeset
|
254 |
val type_guard_name = "gg" |
ba22ed224b20
fixed bang encoding detection of which types to encode
blanchet
parents:
44463
diff
changeset
|
255 |
val type_tag_name = "tt" |
42531
a462dbaa584f
added more rudimentary type support to Sledgehammer's ATP encoding
blanchet
parents:
42530
diff
changeset
|
256 |
|
43174 | 257 |
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
|
258 |
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
|
259 |
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
|
260 |
|
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
261 |
(*Escaping of special characters. |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
262 |
Alphanumeric characters are left unchanged. |
54798 | 263 |
The character _ goes to __. |
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
264 |
Characters in the range ASCII space to / go to _A to _P, respectively. |
54798 | 265 |
Other characters go to _nnn where nnn is the decimal ASCII code. *) |
43093 | 266 |
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
|
267 |
|
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
268 |
fun ascii_of_char c = |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
269 |
if Char.isAlphaNum c then |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
270 |
String.str c |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
271 |
else if c = #"_" then |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
272 |
"__" |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
273 |
else if #" " <= c andalso c <= #"/" then |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
274 |
"_" ^ 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
|
275 |
else |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
276 |
(* fixed width, in case more digits follow *) |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
277 |
"_" ^ stringN_of_int 3 (Char.ord c) |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
278 |
|
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
279 |
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
|
280 |
|
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
281 |
(** 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
|
282 |
|
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
283 |
(* 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
|
284 |
thread. Also, the errors are impossible. *) |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
285 |
val unascii_of = |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
286 |
let |
47975
adc977fec17e
order LEO-II/Satallax definitions so that they build on each other (cf. Satallax's THF policy)
blanchet
parents:
47971
diff
changeset
|
287 |
fun un rcs [] = String.implode (rev rcs) |
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
288 |
| un rcs [#"_"] = un (#"_" :: rcs) [] (* ERROR *) |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
289 |
(* 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
|
290 |
| un rcs (#"_" :: #"_" :: cs) = un (#"_" :: rcs) cs |
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
291 |
| un rcs (#"_" :: c :: cs) = |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
292 |
if #"A" <= c andalso c<= #"P" then |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
293 |
(* translation of #" " to #"/" *) |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
294 |
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
|
295 |
else |
43496
92f5a4c78b37
remove historical bloat -- another benefit of merging Metis's and Sledgehammer's translations
blanchet
parents:
43495
diff
changeset
|
296 |
let val digits = List.take (c :: cs, 3) handle General.Subscript => [] in |
54829 | 297 |
(case Int.fromString (String.implode digits) of |
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
298 |
SOME n => un (Char.chr n :: rcs) (List.drop (cs, 2)) |
54829 | 299 |
| NONE => un (c :: #"_" :: rcs) cs (* ERROR *)) |
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
300 |
end |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
301 |
| 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
|
302 |
in un [] o String.explode end |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
303 |
|
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
304 |
(* 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
|
305 |
un-ASCII'd. *) |
45511
9b0f8ca4388e
continued implementation of lambda-lifting in Metis
blanchet
parents:
45509
diff
changeset
|
306 |
fun unprefix_and_unascii s1 s = |
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
307 |
if String.isPrefix s1 s then |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
308 |
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
|
309 |
else |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
310 |
NONE |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
311 |
|
43159
29b55f292e0b
added support for helpers in new Metis, so far only for polymorphic type encodings
blanchet
parents:
43139
diff
changeset
|
312 |
val proxy_table = |
61329
426c9c858099
added "!=" (disequality) as a TPTP binary operator, since it pops up in LEO-II proofs
blanchet
parents:
60924
diff
changeset
|
313 |
[("c_False", (@{const_name False}, (@{thm fFalse_def}, ("fFalse", @{const_name fFalse})))), |
426c9c858099
added "!=" (disequality) as a TPTP binary operator, since it pops up in LEO-II proofs
blanchet
parents:
60924
diff
changeset
|
314 |
("c_True", (@{const_name True}, (@{thm fTrue_def}, ("fTrue", @{const_name fTrue})))), |
426c9c858099
added "!=" (disequality) as a TPTP binary operator, since it pops up in LEO-II proofs
blanchet
parents:
60924
diff
changeset
|
315 |
("c_Not", (@{const_name Not}, (@{thm fNot_def}, ("fNot", @{const_name fNot})))), |
426c9c858099
added "!=" (disequality) as a TPTP binary operator, since it pops up in LEO-II proofs
blanchet
parents:
60924
diff
changeset
|
316 |
("c_conj", (@{const_name conj}, (@{thm fconj_def}, ("fconj", @{const_name fconj})))), |
426c9c858099
added "!=" (disequality) as a TPTP binary operator, since it pops up in LEO-II proofs
blanchet
parents:
60924
diff
changeset
|
317 |
("c_disj", (@{const_name disj}, (@{thm fdisj_def}, ("fdisj", @{const_name fdisj})))), |
426c9c858099
added "!=" (disequality) as a TPTP binary operator, since it pops up in LEO-II proofs
blanchet
parents:
60924
diff
changeset
|
318 |
("c_implies", (@{const_name implies}, (@{thm fimplies_def}, ("fimplies", @{const_name fimplies})))), |
426c9c858099
added "!=" (disequality) as a TPTP binary operator, since it pops up in LEO-II proofs
blanchet
parents:
60924
diff
changeset
|
319 |
("equal", (@{const_name HOL.eq}, (@{thm fequal_def}, ("fequal", @{const_name fequal})))), |
426c9c858099
added "!=" (disequality) as a TPTP binary operator, since it pops up in LEO-II proofs
blanchet
parents:
60924
diff
changeset
|
320 |
("c_All", (@{const_name All}, (@{thm fAll_def}, ("fAll", @{const_name fAll})))), |
426c9c858099
added "!=" (disequality) as a TPTP binary operator, since it pops up in LEO-II proofs
blanchet
parents:
60924
diff
changeset
|
321 |
("c_Ex", (@{const_name Ex}, (@{thm fEx_def}, ("fEx", @{const_name fEx}))))] |
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
322 |
|
43159
29b55f292e0b
added support for helpers in new Metis, so far only for polymorphic type encodings
blanchet
parents:
43139
diff
changeset
|
323 |
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
|
324 |
|
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
325 |
(* 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
|
326 |
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
|
327 |
val const_trans_table = |
54554
b8d0d8407c3b
eliminated Sledgehammer's dependency on old-style datatypes
blanchet
parents:
54434
diff
changeset
|
328 |
[(@{const_name False}, "False"), |
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
329 |
(@{const_name True}, "True"), |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
330 |
(@{const_name Not}, "Not"), |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
331 |
(@{const_name conj}, "conj"), |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
332 |
(@{const_name disj}, "disj"), |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
333 |
(@{const_name implies}, "implies"), |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
334 |
(@{const_name HOL.eq}, "equal"), |
43678 | 335 |
(@{const_name All}, "All"), |
336 |
(@{const_name Ex}, "Ex"), |
|
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
337 |
(@{const_name If}, "If"), |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
338 |
(@{const_name Set.member}, "member"), |
45554
09ad83de849c
don't pass "lam_lifted" option to "metis" unless there's a good reason
blanchet
parents:
45551
diff
changeset
|
339 |
(@{const_name Meson.COMBI}, combinator_prefix ^ "I"), |
09ad83de849c
don't pass "lam_lifted" option to "metis" unless there's a good reason
blanchet
parents:
45551
diff
changeset
|
340 |
(@{const_name Meson.COMBK}, combinator_prefix ^ "K"), |
09ad83de849c
don't pass "lam_lifted" option to "metis" unless there's a good reason
blanchet
parents:
45551
diff
changeset
|
341 |
(@{const_name Meson.COMBB}, combinator_prefix ^ "B"), |
09ad83de849c
don't pass "lam_lifted" option to "metis" unless there's a good reason
blanchet
parents:
45551
diff
changeset
|
342 |
(@{const_name Meson.COMBC}, combinator_prefix ^ "C"), |
09ad83de849c
don't pass "lam_lifted" option to "metis" unless there's a good reason
blanchet
parents:
45551
diff
changeset
|
343 |
(@{const_name Meson.COMBS}, combinator_prefix ^ "S")] |
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
344 |
|> Symtab.make |
43159
29b55f292e0b
added support for helpers in new Metis, so far only for polymorphic type encodings
blanchet
parents:
43139
diff
changeset
|
345 |
|> 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
|
346 |
|
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
347 |
(* 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
|
348 |
val const_trans_table_inv = |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
349 |
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
|
350 |
val const_trans_table_unprox = |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
351 |
Symtab.empty |
43159
29b55f292e0b
added support for helpers in new Metis, so far only for polymorphic type encodings
blanchet
parents:
43139
diff
changeset
|
352 |
|> 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
|
353 |
|
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
354 |
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
|
355 |
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
|
356 |
|
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
357 |
fun lookup_const c = |
54829 | 358 |
(case Symtab.lookup const_trans_table c of |
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
359 |
SOME c' => c' |
54829 | 360 |
| NONE => ascii_of c) |
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
361 |
|
43622 | 362 |
fun ascii_of_indexname (v, 0) = ascii_of v |
363 |
| 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
|
364 |
|
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
365 |
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
|
366 |
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
|
367 |
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
|
368 |
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
|
369 |
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
|
370 |
|
52076
bfa28e1cba77
freeze types in Sledgehammer goal, not just terms
blanchet
parents:
52071
diff
changeset
|
371 |
fun make_tvar (s, i) = tvar_prefix ^ ascii_of_indexname (unquote_tvar s, i) |
bfa28e1cba77
freeze types in Sledgehammer goal, not just terms
blanchet
parents:
52071
diff
changeset
|
372 |
fun make_tfree s = tfree_prefix ^ ascii_of (unquote_tvar s) |
48142
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
373 |
fun tvar_name ((x as (s, _)), _) = (make_tvar x, s) |
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
374 |
|
45301
866b075aa99b
added sorted DFG output for coming version of SPASS
blanchet
parents:
45299
diff
changeset
|
375 |
(* "HOL.eq" and choice are mapped to the ATP's equivalents *) |
44587 | 376 |
local |
49323 | 377 |
val choice_const = (fst o dest_Const o HOLogic.choice_const) dummyT |
44587 | 378 |
fun default c = const_prefix ^ lookup_const c |
379 |
in |
|
380 |
fun make_fixed_const _ @{const_name HOL.eq} = tptp_old_equal |
|
47768
0b2b7ff31867
don't use the native choice operator if the type encoding isn't higher-order
blanchet
parents:
47767
diff
changeset
|
381 |
| make_fixed_const (SOME (Native (Higher_Order THF_With_Choice, _, _))) c = |
44754 | 382 |
if c = choice_const then tptp_choice else default c |
44587 | 383 |
| make_fixed_const _ c = default c |
384 |
end |
|
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
385 |
|
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
386 |
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
|
387 |
|
48142
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
388 |
fun make_class clas = class_prefix ^ ascii_of clas |
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
389 |
|
52031
9a9238342963
tuning -- renamed '_from_' to '_of_' in Sledgehammer
blanchet
parents:
52030
diff
changeset
|
390 |
fun new_skolem_var_name_of_const s = |
59877 | 391 |
let val ss = Long_Name.explode s |
392 |
in nth ss (length ss - 2) end |
|
43093 | 393 |
|
48318 | 394 |
(* These are ignored anyway by the relevance filter (unless they appear in |
395 |
higher-order places) but not by the monomorphizer. *) |
|
396 |
val atp_logical_consts = |
|
56245 | 397 |
[@{const_name Pure.prop}, @{const_name Pure.conjunction}, |
398 |
@{const_name Pure.all}, @{const_name Pure.imp}, @{const_name Pure.eq}, |
|
399 |
@{const_name Trueprop}, @{const_name All}, @{const_name Ex}, |
|
48318 | 400 |
@{const_name Ex1}, @{const_name Ball}, @{const_name Bex}] |
401 |
||
43248
69375eaa9016
more suitable implementation of "schematic_consts_of" for monomorphizer, for ATPs
blanchet
parents:
43222
diff
changeset
|
402 |
(* 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
|
403 |
handled specially via "fFalse", "fTrue", ..., "fequal". *) |
69375eaa9016
more suitable implementation of "schematic_consts_of" for monomorphizer, for ATPs
blanchet
parents:
43222
diff
changeset
|
404 |
val atp_irrelevant_consts = |
54089
b13f6731f873
use same relevance filter for ATP and SMT solvers -- attempting to filter out certain ground instances of polymorphic symbols like + and 0 has unexpected side-effects that lead to incompletenesses (relevant facts not being selected)
blanchet
parents:
53586
diff
changeset
|
405 |
[@{const_name False}, @{const_name True}, @{const_name Not}, @{const_name conj}, |
b13f6731f873
use same relevance filter for ATP and SMT solvers -- attempting to filter out certain ground instances of polymorphic symbols like + and 0 has unexpected side-effects that lead to incompletenesses (relevant facts not being selected)
blanchet
parents:
53586
diff
changeset
|
406 |
@{const_name disj}, @{const_name implies}, @{const_name HOL.eq}, @{const_name If}, |
b13f6731f873
use same relevance filter for ATP and SMT solvers -- attempting to filter out certain ground instances of polymorphic symbols like + and 0 has unexpected side-effects that lead to incompletenesses (relevant facts not being selected)
blanchet
parents:
53586
diff
changeset
|
407 |
@{const_name Let}] |
43248
69375eaa9016
more suitable implementation of "schematic_consts_of" for monomorphizer, for ATPs
blanchet
parents:
43222
diff
changeset
|
408 |
|
48318 | 409 |
val atp_widely_irrelevant_consts = atp_logical_consts @ atp_irrelevant_consts |
43248
69375eaa9016
more suitable implementation of "schematic_consts_of" for monomorphizer, for ATPs
blanchet
parents:
43222
diff
changeset
|
410 |
|
54089
b13f6731f873
use same relevance filter for ATP and SMT solvers -- attempting to filter out certain ground instances of polymorphic symbols like + and 0 has unexpected side-effects that lead to incompletenesses (relevant facts not being selected)
blanchet
parents:
53586
diff
changeset
|
411 |
val atp_irrelevant_const_tab = Symtab.make (map (rpair ()) atp_irrelevant_consts) |
b13f6731f873
use same relevance filter for ATP and SMT solvers -- attempting to filter out certain ground instances of polymorphic symbols like + and 0 has unexpected side-effects that lead to incompletenesses (relevant facts not being selected)
blanchet
parents:
53586
diff
changeset
|
412 |
val atp_widely_irrelevant_const_tab = Symtab.make (map (rpair ()) atp_widely_irrelevant_consts) |
b13f6731f873
use same relevance filter for ATP and SMT solvers -- attempting to filter out certain ground instances of polymorphic symbols like + and 0 has unexpected side-effects that lead to incompletenesses (relevant facts not being selected)
blanchet
parents:
53586
diff
changeset
|
413 |
|
b13f6731f873
use same relevance filter for ATP and SMT solvers -- attempting to filter out certain ground instances of polymorphic symbols like + and 0 has unexpected side-effects that lead to incompletenesses (relevant facts not being selected)
blanchet
parents:
53586
diff
changeset
|
414 |
val is_irrelevant_const = Symtab.defined atp_irrelevant_const_tab |
b13f6731f873
use same relevance filter for ATP and SMT solvers -- attempting to filter out certain ground instances of polymorphic symbols like + and 0 has unexpected side-effects that lead to incompletenesses (relevant facts not being selected)
blanchet
parents:
53586
diff
changeset
|
415 |
val is_widely_irrelevant_const = Symtab.defined atp_widely_irrelevant_const_tab |
b13f6731f873
use same relevance filter for ATP and SMT solvers -- attempting to filter out certain ground instances of polymorphic symbols like + and 0 has unexpected side-effects that lead to incompletenesses (relevant facts not being selected)
blanchet
parents:
53586
diff
changeset
|
416 |
|
43258
956895f99904
slightly faster/cleaner accumulation of polymorphic consts
blanchet
parents:
43248
diff
changeset
|
417 |
fun add_schematic_const (x as (_, T)) = |
956895f99904
slightly faster/cleaner accumulation of polymorphic consts
blanchet
parents:
43248
diff
changeset
|
418 |
Monomorph.typ_has_tvars T ? Symtab.insert_list (op =) x |
956895f99904
slightly faster/cleaner accumulation of polymorphic consts
blanchet
parents:
43248
diff
changeset
|
419 |
val add_schematic_consts_of = |
956895f99904
slightly faster/cleaner accumulation of polymorphic consts
blanchet
parents:
43248
diff
changeset
|
420 |
Term.fold_aterms (fn Const (x as (s, _)) => |
48227 | 421 |
not (member (op =) atp_widely_irrelevant_consts s) |
43258
956895f99904
slightly faster/cleaner accumulation of polymorphic consts
blanchet
parents:
43248
diff
changeset
|
422 |
? add_schematic_const x |
956895f99904
slightly faster/cleaner accumulation of polymorphic consts
blanchet
parents:
43248
diff
changeset
|
423 |
| _ => I) |
956895f99904
slightly faster/cleaner accumulation of polymorphic consts
blanchet
parents:
43248
diff
changeset
|
424 |
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
|
425 |
|
48133
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
426 |
val tvar_a_str = "'a" |
56254 | 427 |
val tvar_a_z = ((tvar_a_str, 0), @{sort type}) |
48142
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
428 |
val tvar_a = TVar tvar_a_z |
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
429 |
val tvar_a_name = tvar_name tvar_a_z |
48133
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
430 |
val itself_name = `make_fixed_type_const @{type_name itself} |
56243 | 431 |
val TYPE_name = `(make_fixed_const NONE) @{const_name Pure.type} |
54820 | 432 |
val tvar_a_atype = AType ((tvar_a_name, []), []) |
433 |
val a_itself_atype = AType ((itself_name, []), [tvar_a_atype]) |
|
48133
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
434 |
|
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
435 |
(** 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
|
436 |
|
48142
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
437 |
(** Type class membership **) |
43263 | 438 |
|
48142
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
439 |
(* In our data structures, [] exceptionally refers to the top class, not to |
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
440 |
the empty class. *) |
44625 | 441 |
|
48142
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
442 |
val class_of_types = the_single @{sort type} |
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
443 |
|
48142
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
444 |
fun normalize_classes cls = if member (op =) cls class_of_types then [] else cls |
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
445 |
|
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
446 |
(* Arity of type constructor "s :: (arg1, ..., argN) res" *) |
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
447 |
fun make_axiom_tcon_clause (s, name, (cl, args)) = |
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
448 |
let |
48142
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
449 |
val args = args |> map normalize_classes |
48133
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
450 |
val tvars = |
48142
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
451 |
1 upto length args |> map (fn j => TVar ((tvar_a_str, j), @{sort type})) |
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
452 |
in (name, args ~~ tvars, (cl, Type (s, tvars))) end |
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
453 |
|
43622 | 454 |
(* Generate all pairs (tycon, class, sorts) such that tycon belongs to class in |
455 |
theory thy provided its arguments have the corresponding sorts. *) |
|
48142
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
456 |
fun class_pairs thy tycons cls = |
43093 | 457 |
let |
458 |
val alg = Sign.classes_of thy |
|
459 |
fun domain_sorts tycon = Sorts.mg_domain alg tycon o single |
|
48142
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
460 |
fun add_class tycon cl = |
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
461 |
cons (cl, domain_sorts tycon cl) |
43093 | 462 |
handle Sorts.CLASS_ERROR _ => I |
48142
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
463 |
fun try_classes tycon = (tycon, fold (add_class tycon) cls []) |
43093 | 464 |
in map try_classes tycons end |
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
465 |
|
48141 | 466 |
(* Proving one (tycon, class) membership may require proving others, so |
467 |
iterate. *) |
|
57539
353fd3326835
avoid loop in 'all_class_pairs' (caused by e.g. loading the 'Ceta' theory and calling Sledgehammer with the two facts 'fun_of_map.cases' and 'Lattices.bounded_lattice_top_class.sup_top_left' with a polymorphic type encoding)
blanchet
parents:
57533
diff
changeset
|
468 |
fun all_class_pairs _ _ _ [] = ([], []) |
353fd3326835
avoid loop in 'all_class_pairs' (caused by e.g. loading the 'Ceta' theory and calling Sledgehammer with the two facts 'fun_of_map.cases' and 'Lattices.bounded_lattice_top_class.sup_top_left' with a polymorphic type encoding)
blanchet
parents:
57533
diff
changeset
|
469 |
| all_class_pairs thy tycons old_cls cls = |
48141 | 470 |
let |
57539
353fd3326835
avoid loop in 'all_class_pairs' (caused by e.g. loading the 'Ceta' theory and calling Sledgehammer with the two facts 'fun_of_map.cases' and 'Lattices.bounded_lattice_top_class.sup_top_left' with a polymorphic type encoding)
blanchet
parents:
57533
diff
changeset
|
471 |
val old_cls' = cls @ old_cls |
353fd3326835
avoid loop in 'all_class_pairs' (caused by e.g. loading the 'Ceta' theory and calling Sledgehammer with the two facts 'fun_of_map.cases' and 'Lattices.bounded_lattice_top_class.sup_top_left' with a polymorphic type encoding)
blanchet
parents:
57533
diff
changeset
|
472 |
fun maybe_insert_class s = not (member (op =) old_cls' s) ? insert (op =) s |
353fd3326835
avoid loop in 'all_class_pairs' (caused by e.g. loading the 'Ceta' theory and calling Sledgehammer with the two facts 'fun_of_map.cases' and 'Lattices.bounded_lattice_top_class.sup_top_left' with a polymorphic type encoding)
blanchet
parents:
57533
diff
changeset
|
473 |
|
48142
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
474 |
val pairs = class_pairs thy tycons cls |
57539
353fd3326835
avoid loop in 'all_class_pairs' (caused by e.g. loading the 'Ceta' theory and calling Sledgehammer with the two facts 'fun_of_map.cases' and 'Lattices.bounded_lattice_top_class.sup_top_left' with a polymorphic type encoding)
blanchet
parents:
57533
diff
changeset
|
475 |
val new_cls = fold (fold (fold (fold maybe_insert_class) o snd) o snd) pairs [] |
353fd3326835
avoid loop in 'all_class_pairs' (caused by e.g. loading the 'Ceta' theory and calling Sledgehammer with the two facts 'fun_of_map.cases' and 'Lattices.bounded_lattice_top_class.sup_top_left' with a polymorphic type encoding)
blanchet
parents:
57533
diff
changeset
|
476 |
val (cls', pairs') = all_class_pairs thy tycons old_cls' new_cls |
48142
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
477 |
in (cls' @ cls, union (op =) pairs' pairs) end |
48141 | 478 |
|
51651 | 479 |
fun tcon_clause _ _ [] = [] |
480 |
| tcon_clause seen n ((_, []) :: rest) = tcon_clause seen n rest |
|
481 |
| tcon_clause seen n ((tcons, (ar as (cl, _)) :: ars) :: rest) = |
|
48142
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
482 |
if cl = class_of_types then |
51651 | 483 |
tcon_clause seen n ((tcons, ars) :: rest) |
48142
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
484 |
else if member (op =) seen cl then |
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
485 |
(* multiple clauses for the same (tycon, cl) pair *) |
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
486 |
make_axiom_tcon_clause (tcons, |
54820 | 487 |
lookup_const tcons ^ "___" ^ ascii_of cl ^ "_" ^ string_of_int n, ar) :: |
51651 | 488 |
tcon_clause seen (n + 1) ((tcons, ars) :: rest) |
48141 | 489 |
else |
54820 | 490 |
make_axiom_tcon_clause (tcons, lookup_const tcons ^ "___" ^ ascii_of cl, ar) :: |
51651 | 491 |
tcon_clause (cl :: seen) n ((tcons, ars) :: rest) |
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
492 |
|
48142
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
493 |
fun make_tcon_clauses thy tycons = |
57539
353fd3326835
avoid loop in 'all_class_pairs' (caused by e.g. loading the 'Ceta' theory and calling Sledgehammer with the two facts 'fun_of_map.cases' and 'Lattices.bounded_lattice_top_class.sup_top_left' with a polymorphic type encoding)
blanchet
parents:
57533
diff
changeset
|
494 |
all_class_pairs thy tycons [] ##> tcon_clause [] 1 |
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
495 |
|
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
496 |
|
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
497 |
(** Isabelle class relations **) |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
498 |
|
48142
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
499 |
(* Generate a list ("sub", "supers") such that "sub" is a proper subclass of all |
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
500 |
"supers". *) |
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
501 |
fun make_subclass_pairs thy subs supers = |
48141 | 502 |
let |
48142
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
503 |
val class_less = curry (Sorts.class_less (Sign.classes_of thy)) |
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
504 |
fun supers_of sub = (sub, filter (class_less sub) supers) |
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
505 |
in map supers_of subs |> filter_out (null o snd) end |
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
506 |
|
43859 | 507 |
(* intermediate terms *) |
508 |
datatype iterm = |
|
48135 | 509 |
IConst of (string * string) * typ * typ list | |
510 |
IVar of (string * string) * typ | |
|
43859 | 511 |
IApp of iterm * iterm | |
48135 | 512 |
IAbs of ((string * string) * typ) * iterm |
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
513 |
|
43859 | 514 |
fun ityp_of (IConst (_, T, _)) = T |
515 |
| ityp_of (IVar (_, T)) = T |
|
516 |
| ityp_of (IApp (t1, _)) = snd (dest_funT (ityp_of t1)) |
|
517 |
| 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
|
518 |
|
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
519 |
(*gets the head of a combinator application, along with the list of arguments*) |
43859 | 520 |
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
|
521 |
let |
43859 | 522 |
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
|
523 |
| stripc x = x |
92f5a4c78b37
remove historical bloat -- another benefit of merging Metis's and Sledgehammer's translations
blanchet
parents:
43495
diff
changeset
|
524 |
in stripc (u, []) end |
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
525 |
|
45316
08d84bdd5b37
improve handling of bound type variables (esp. for TFF1)
blanchet
parents:
45315
diff
changeset
|
526 |
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
|
527 |
|
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
528 |
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
|
529 |
[new_skolem_const_prefix, s, string_of_int num_T_args] |
46711
f745bcc4a1e5
more explicit Long_Name operations (NB: analyzing qualifiers is inherently fragile);
wenzelm
parents:
46643
diff
changeset
|
530 |
|> Long_Name.implode |
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
531 |
|
47932
ce4178e037a7
get ready for automatic generation of extensionality helpers
blanchet
parents:
47925
diff
changeset
|
532 |
val alpha_to_beta = Logic.varifyT_global @{typ "'a => 'b"} |
ce4178e037a7
get ready for automatic generation of extensionality helpers
blanchet
parents:
47925
diff
changeset
|
533 |
val alpha_to_beta_to_alpha_to_beta = alpha_to_beta --> alpha_to_beta |
ce4178e037a7
get ready for automatic generation of extensionality helpers
blanchet
parents:
47925
diff
changeset
|
534 |
|
44594
ae82943481e9
added type abstractions (for declaring polymorphic constants) to TFF syntax
blanchet
parents:
44593
diff
changeset
|
535 |
fun robust_const_type thy s = |
45509 | 536 |
if s = app_op_name then |
47932
ce4178e037a7
get ready for automatic generation of extensionality helpers
blanchet
parents:
47925
diff
changeset
|
537 |
alpha_to_beta_to_alpha_to_beta |
45554
09ad83de849c
don't pass "lam_lifted" option to "metis" unless there's a good reason
blanchet
parents:
45551
diff
changeset
|
538 |
else if String.isPrefix lam_lifted_prefix s then |
47932
ce4178e037a7
get ready for automatic generation of extensionality helpers
blanchet
parents:
47925
diff
changeset
|
539 |
alpha_to_beta |
45509 | 540 |
else |
541 |
(* Old Skolems throw a "TYPE" exception here, which will be caught. *) |
|
542 |
s |> Sign.the_const_type thy |
|
44594
ae82943481e9
added type abstractions (for declaring polymorphic constants) to TFF syntax
blanchet
parents:
44593
diff
changeset
|
543 |
|
52038
a354c83dee43
properly handle SPASS constructors w.r.t. partially applied functions
blanchet
parents:
52035
diff
changeset
|
544 |
fun ary_of (Type (@{type_name fun}, [_, T])) = 1 + ary_of T |
a354c83dee43
properly handle SPASS constructors w.r.t. partially applied functions
blanchet
parents:
52035
diff
changeset
|
545 |
| ary_of _ = 0 |
46642
37a055f37224
general solution to the arity bug that occasionally plagues Sledgehammer -- short story, lots of things go kaputt when a polymorphic symbol's arity in the translation is higher than the arity of the fully polymorphic HOL constant
blanchet
parents:
46639
diff
changeset
|
546 |
|
44594
ae82943481e9
added type abstractions (for declaring polymorphic constants) to TFF syntax
blanchet
parents:
44593
diff
changeset
|
547 |
(* This function only makes sense if "T" is as general as possible. *) |
51920
16f3b9d4e515
proper unmangling -- the bug is visible when "uncurried_aliases" is enabled with Alt-Ergo or Poly. SPASS
blanchet
parents:
51717
diff
changeset
|
548 |
fun robust_const_type_args thy (s, T) = |
45509 | 549 |
if s = app_op_name then |
550 |
let val (T1, T2) = T |> domain_type |> dest_funT in [T1, T2] end |
|
551 |
else if String.isPrefix old_skolem_const_prefix s then |
|
552 |
[] |> Term.add_tvarsT T |> rev |> map TVar |
|
45554
09ad83de849c
don't pass "lam_lifted" option to "metis" unless there's a good reason
blanchet
parents:
45551
diff
changeset
|
553 |
else if String.isPrefix lam_lifted_prefix s then |
09ad83de849c
don't pass "lam_lifted" option to "metis" unless there's a good reason
blanchet
parents:
45551
diff
changeset
|
554 |
if String.isPrefix lam_lifted_poly_prefix s then |
45511
9b0f8ca4388e
continued implementation of lambda-lifting in Metis
blanchet
parents:
45509
diff
changeset
|
555 |
let val (T1, T2) = T |> dest_funT in [T1, T2] end |
9b0f8ca4388e
continued implementation of lambda-lifting in Metis
blanchet
parents:
45509
diff
changeset
|
556 |
else |
9b0f8ca4388e
continued implementation of lambda-lifting in Metis
blanchet
parents:
45509
diff
changeset
|
557 |
[] |
45509 | 558 |
else |
559 |
(s, T) |> Sign.const_typargs thy |
|
44594
ae82943481e9
added type abstractions (for declaring polymorphic constants) to TFF syntax
blanchet
parents:
44593
diff
changeset
|
560 |
|
54798 | 561 |
(* Converts an Isabelle/HOL term (with combinators) into an intermediate term. Also accumulates sort |
562 |
infomation. *) |
|
52031
9a9238342963
tuning -- renamed '_from_' to '_of_' in Sledgehammer
blanchet
parents:
52030
diff
changeset
|
563 |
fun iterm_of_term thy type_enc bs (P $ Q) = |
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
564 |
let |
52031
9a9238342963
tuning -- renamed '_from_' to '_of_' in Sledgehammer
blanchet
parents:
52030
diff
changeset
|
565 |
val (P', P_atomics_Ts) = iterm_of_term thy type_enc bs P |
9a9238342963
tuning -- renamed '_from_' to '_of_' in Sledgehammer
blanchet
parents:
52030
diff
changeset
|
566 |
val (Q', Q_atomics_Ts) = iterm_of_term thy type_enc bs Q |
43859 | 567 |
in (IApp (P', Q'), union (op =) P_atomics_Ts Q_atomics_Ts) end |
52031
9a9238342963
tuning -- renamed '_from_' to '_of_' in Sledgehammer
blanchet
parents:
52030
diff
changeset
|
568 |
| iterm_of_term thy type_enc _ (Const (c, T)) = |
54798 | 569 |
(IConst (`(make_fixed_const (SOME type_enc)) c, T, robust_const_type_args thy (c, T)), |
45316
08d84bdd5b37
improve handling of bound type variables (esp. for TFF1)
blanchet
parents:
45315
diff
changeset
|
570 |
atomic_types_of T) |
54798 | 571 |
| iterm_of_term _ _ _ (Free (s, T)) = (IConst (`make_fixed_var s, T, []), atomic_types_of T) |
52031
9a9238342963
tuning -- renamed '_from_' to '_of_' in Sledgehammer
blanchet
parents:
52030
diff
changeset
|
572 |
| iterm_of_term _ type_enc _ (Var (v as (s, _), T)) = |
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
573 |
(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
|
574 |
let |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
575 |
val Ts = T |> strip_type |> swap |> op :: |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
576 |
val s' = new_skolem_const_name s (length Ts) |
47768
0b2b7ff31867
don't use the native choice operator if the type encoding isn't higher-order
blanchet
parents:
47767
diff
changeset
|
577 |
in IConst (`(make_fixed_const (SOME type_enc)) s', T, Ts) end |
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
578 |
else |
45316
08d84bdd5b37
improve handling of bound type variables (esp. for TFF1)
blanchet
parents:
45315
diff
changeset
|
579 |
IVar ((make_schematic_var v, s), T), atomic_types_of T) |
52031
9a9238342963
tuning -- renamed '_from_' to '_of_' in Sledgehammer
blanchet
parents:
52030
diff
changeset
|
580 |
| iterm_of_term _ _ bs (Bound j) = |
45316
08d84bdd5b37
improve handling of bound type variables (esp. for TFF1)
blanchet
parents:
45315
diff
changeset
|
581 |
nth bs j |> (fn (_, (name, T)) => (IConst (name, T, []), atomic_types_of T)) |
52031
9a9238342963
tuning -- renamed '_from_' to '_of_' in Sledgehammer
blanchet
parents:
52030
diff
changeset
|
582 |
| iterm_of_term thy type_enc bs (Abs (s, T, t)) = |
43678 | 583 |
let |
584 |
fun vary s = s |> AList.defined (op =) bs s ? vary o Symbol.bump_string |
|
585 |
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
|
586 |
val name = `make_bound_var s |
52031
9a9238342963
tuning -- renamed '_from_' to '_of_' in Sledgehammer
blanchet
parents:
52030
diff
changeset
|
587 |
val (tm, atomic_Ts) = iterm_of_term thy type_enc ((s, (name, T)) :: bs) t |
54798 | 588 |
in |
589 |
(IAbs ((name, T), tm), union (op =) atomic_Ts (atomic_types_of T)) |
|
590 |
end |
|
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
591 |
|
48089 | 592 |
(* "_query" and "_at" are for the ASCII-challenged Metis and Mirabelle. *) |
44785 | 593 |
val queries = ["?", "_query"] |
594 |
val ats = ["@", "_at"] |
|
595 |
||
42689
e38590764c34
versions of ! and ? for the ASCII-challenged Mirabelle
blanchet
parents:
42688
diff
changeset
|
596 |
fun try_unsuffixes ss s = |
e38590764c34
versions of ! and ? for the ASCII-challenged Mirabelle
blanchet
parents:
42688
diff
changeset
|
597 |
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
|
598 |
|
52031
9a9238342963
tuning -- renamed '_from_' to '_of_' in Sledgehammer
blanchet
parents:
52030
diff
changeset
|
599 |
fun type_enc_of_string strictness s = |
48131 | 600 |
(case try (unprefix "tc_") s of |
54829 | 601 |
SOME s => (SOME Type_Class_Polymorphic, s) |
602 |
| NONE => |
|
603 |
(case try (unprefix "poly_") s of |
|
604 |
SOME s => (SOME (Raw_Polymorphic With_Phantom_Type_Vars), s) |
|
605 |
| NONE => |
|
57293
4e619ee65a61
added 'dummy_thf_ml' prover for experiments with HOLyHammer
blanchet
parents:
57292
diff
changeset
|
606 |
(case try (unprefix "ml_poly_") s of |
4e619ee65a61
added 'dummy_thf_ml' prover for experiments with HOLyHammer
blanchet
parents:
57292
diff
changeset
|
607 |
SOME s => (SOME (Raw_Polymorphic Without_Phantom_Type_Vars), s) |
54829 | 608 |
| NONE => |
57293
4e619ee65a61
added 'dummy_thf_ml' prover for experiments with HOLyHammer
blanchet
parents:
57292
diff
changeset
|
609 |
(case try (unprefix "raw_mono_") s of |
4e619ee65a61
added 'dummy_thf_ml' prover for experiments with HOLyHammer
blanchet
parents:
57292
diff
changeset
|
610 |
SOME s => (SOME Raw_Monomorphic, s) |
4e619ee65a61
added 'dummy_thf_ml' prover for experiments with HOLyHammer
blanchet
parents:
57292
diff
changeset
|
611 |
| NONE => |
4e619ee65a61
added 'dummy_thf_ml' prover for experiments with HOLyHammer
blanchet
parents:
57292
diff
changeset
|
612 |
(case try (unprefix "mono_") s of |
4e619ee65a61
added 'dummy_thf_ml' prover for experiments with HOLyHammer
blanchet
parents:
57292
diff
changeset
|
613 |
SOME s => (SOME Mangled_Monomorphic, s) |
4e619ee65a61
added 'dummy_thf_ml' prover for experiments with HOLyHammer
blanchet
parents:
57292
diff
changeset
|
614 |
| NONE => (NONE, s)))))) |
48092 | 615 |
||> (fn s => |
54829 | 616 |
(case try_unsuffixes queries s of |
617 |
SOME s => |
|
618 |
(case try_unsuffixes queries s of |
|
619 |
SOME s => (Nonmono_Types (strictness, Non_Uniform), s) |
|
620 |
| NONE => (Nonmono_Types (strictness, Uniform), s)) |
|
621 |
| NONE => |
|
622 |
(case try_unsuffixes ats s of |
|
623 |
SOME s => (Undercover_Types, s) |
|
624 |
| NONE => (All_Types, s)))) |
|
44768 | 625 |
|> (fn (poly, (level, core)) => |
54829 | 626 |
(case (core, (poly, level)) of |
627 |
("native", (SOME poly, _)) => |
|
628 |
(case (poly, level) of |
|
629 |
(Mangled_Monomorphic, _) => |
|
630 |
if is_type_level_uniform level then Native (First_Order, Mangled_Monomorphic, level) |
|
631 |
else raise Same.SAME |
|
632 |
| (Raw_Monomorphic, _) => raise Same.SAME |
|
633 |
| (poly, All_Types) => Native (First_Order, poly, All_Types)) |
|
634 |
| ("native_higher", (SOME poly, _)) => |
|
635 |
(case (poly, level) of |
|
636 |
(_, Nonmono_Types _) => raise Same.SAME |
|
637 |
| (_, Undercover_Types) => raise Same.SAME |
|
638 |
| (Mangled_Monomorphic, _) => |
|
639 |
if is_type_level_uniform level then |
|
640 |
Native (Higher_Order THF_With_Choice, Mangled_Monomorphic, level) |
|
641 |
else |
|
642 |
raise Same.SAME |
|
643 |
| (poly as Raw_Polymorphic _, All_Types) => |
|
644 |
Native (Higher_Order THF_With_Choice, poly, All_Types) |
|
645 |
| _ => raise Same.SAME) |
|
646 |
| ("guards", (SOME poly, _)) => |
|
57264 | 647 |
if (poly = Mangled_Monomorphic andalso level = Undercover_Types) orelse |
54829 | 648 |
poly = Type_Class_Polymorphic then |
649 |
raise Same.SAME |
|
650 |
else |
|
651 |
Guards (poly, level) |
|
652 |
| ("tags", (SOME poly, _)) => |
|
57264 | 653 |
if (poly = Mangled_Monomorphic andalso level = Undercover_Types) orelse |
54829 | 654 |
poly = Type_Class_Polymorphic then |
655 |
raise Same.SAME |
|
656 |
else |
|
657 |
Tags (poly, level) |
|
658 |
| ("args", (SOME poly, All_Types (* naja *))) => |
|
659 |
if poly = Type_Class_Polymorphic then raise Same.SAME |
|
660 |
else Guards (poly, Const_Types Without_Ctr_Optim) |
|
661 |
| ("args", (SOME poly, Nonmono_Types (_, Uniform) (* naja *))) => |
|
57264 | 662 |
if poly = Mangled_Monomorphic orelse poly = Type_Class_Polymorphic then |
54829 | 663 |
raise Same.SAME |
664 |
else |
|
665 |
Guards (poly, Const_Types With_Ctr_Optim) |
|
666 |
| ("erased", (NONE, All_Types (* naja *))) => |
|
667 |
Guards (Raw_Polymorphic With_Phantom_Type_Vars, No_Types) |
|
668 |
| _ => raise Same.SAME)) |
|
44785 | 669 |
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
|
670 |
|
47768
0b2b7ff31867
don't use the native choice operator if the type encoding isn't higher-order
blanchet
parents:
47767
diff
changeset
|
671 |
fun adjust_order THF_Without_Choice (Higher_Order _) = |
0b2b7ff31867
don't use the native choice operator if the type encoding isn't higher-order
blanchet
parents:
47767
diff
changeset
|
672 |
Higher_Order THF_Without_Choice |
0b2b7ff31867
don't use the native choice operator if the type encoding isn't higher-order
blanchet
parents:
47767
diff
changeset
|
673 |
| adjust_order _ type_enc = type_enc |
0b2b7ff31867
don't use the native choice operator if the type encoding isn't higher-order
blanchet
parents:
47767
diff
changeset
|
674 |
|
57264 | 675 |
fun no_type_classes Type_Class_Polymorphic = Raw_Polymorphic With_Phantom_Type_Vars |
48134
fa23e699494c
robustness -- TFF1 does not support type classes
blanchet
parents:
48133
diff
changeset
|
676 |
| no_type_classes poly = poly |
fa23e699494c
robustness -- TFF1 does not support type classes
blanchet
parents:
48133
diff
changeset
|
677 |
|
54197
994ebb795b75
use definitions for LEO-II as well -- this simplifies the code and matches some users' expectations
blanchet
parents:
54109
diff
changeset
|
678 |
fun adjust_type_enc (THF (Polymorphic, choice)) (Native (order, poly, level)) = |
48134
fa23e699494c
robustness -- TFF1 does not support type classes
blanchet
parents:
48133
diff
changeset
|
679 |
Native (adjust_order choice order, no_type_classes poly, level) |
54197
994ebb795b75
use definitions for LEO-II as well -- this simplifies the code and matches some users' expectations
blanchet
parents:
54109
diff
changeset
|
680 |
| adjust_type_enc (THF (Monomorphic, choice)) (Native (order, _, level)) = |
48004
989a34fa72b3
don't generate definitions for LEO-II -- this cuases more harm than good
blanchet
parents:
47991
diff
changeset
|
681 |
Native (adjust_order choice order, Mangled_Monomorphic, level) |
52995
ab98feb66684
Vampire 3.0 requires types to be declared -- make it happy (and get rid of "implicit" types since only Satallax seems to support them anymore)
blanchet
parents:
52125
diff
changeset
|
682 |
| adjust_type_enc (TFF Monomorphic) (Native (_, _, level)) = |
47767 | 683 |
Native (First_Order, Mangled_Monomorphic, level) |
48131 | 684 |
| adjust_type_enc (DFG Polymorphic) (Native (_, poly, level)) = |
685 |
Native (First_Order, poly, level) |
|
686 |
| adjust_type_enc (DFG Monomorphic) (Native (_, _, level)) = |
|
47767 | 687 |
Native (First_Order, Mangled_Monomorphic, level) |
688 |
| adjust_type_enc (TFF _) (Native (_, poly, level)) = |
|
48134
fa23e699494c
robustness -- TFF1 does not support type classes
blanchet
parents:
48133
diff
changeset
|
689 |
Native (First_Order, no_type_classes poly, level) |
47767 | 690 |
| adjust_type_enc format (Native (_, poly, level)) = |
48134
fa23e699494c
robustness -- TFF1 does not support type classes
blanchet
parents:
48133
diff
changeset
|
691 |
adjust_type_enc format (Guards (no_type_classes poly, level)) |
44416
cabd06b69c18
added formats to the slice and use TFF for remote Vampire
blanchet
parents:
44410
diff
changeset
|
692 |
| adjust_type_enc CNF_UEQ (type_enc as Guards stuff) = |
48089 | 693 |
(if is_type_enc_sound type_enc then Tags else Guards) stuff |
44416
cabd06b69c18
added formats to the slice and use TFF for remote Vampire
blanchet
parents:
44410
diff
changeset
|
694 |
| 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
|
695 |
|
48302 | 696 |
fun is_lambda_free t = |
54829 | 697 |
(case t of |
48302 | 698 |
@{const Not} $ t1 => is_lambda_free t1 |
699 |
| Const (@{const_name All}, _) $ Abs (_, _, t') => is_lambda_free t' |
|
700 |
| Const (@{const_name All}, _) $ t1 => is_lambda_free t1 |
|
701 |
| Const (@{const_name Ex}, _) $ Abs (_, _, t') => is_lambda_free t' |
|
702 |
| Const (@{const_name Ex}, _) $ t1 => is_lambda_free t1 |
|
703 |
| @{const HOL.conj} $ t1 $ t2 => is_lambda_free t1 andalso is_lambda_free t2 |
|
704 |
| @{const HOL.disj} $ t1 $ t2 => is_lambda_free t1 andalso is_lambda_free t2 |
|
705 |
| @{const HOL.implies} $ t1 $ t2 => is_lambda_free t1 andalso is_lambda_free t2 |
|
46818
2a28e66e2e4c
ensure no abstractions leak through after lambda-lifting (for formulas with higher-order occurrences of quantifiers)
blanchet
parents:
46711
diff
changeset
|
706 |
| Const (@{const_name HOL.eq}, Type (_, [@{typ bool}, _])) $ t1 $ t2 => |
48302 | 707 |
is_lambda_free t1 andalso is_lambda_free t2 |
54829 | 708 |
| _ => not (exists_subterm (fn Abs _ => true | _ => false) t)) |
46818
2a28e66e2e4c
ensure no abstractions leak through after lambda-lifting (for formulas with higher-order occurrences of quantifiers)
blanchet
parents:
46711
diff
changeset
|
709 |
|
2a28e66e2e4c
ensure no abstractions leak through after lambda-lifting (for formulas with higher-order occurrences of quantifiers)
blanchet
parents:
46711
diff
changeset
|
710 |
fun simple_translate_lambdas do_lambdas ctxt t = |
48302 | 711 |
if is_lambda_free t then |
46818
2a28e66e2e4c
ensure no abstractions leak through after lambda-lifting (for formulas with higher-order occurrences of quantifiers)
blanchet
parents:
46711
diff
changeset
|
712 |
t |
2a28e66e2e4c
ensure no abstractions leak through after lambda-lifting (for formulas with higher-order occurrences of quantifiers)
blanchet
parents:
46711
diff
changeset
|
713 |
else |
2a28e66e2e4c
ensure no abstractions leak through after lambda-lifting (for formulas with higher-order occurrences of quantifiers)
blanchet
parents:
46711
diff
changeset
|
714 |
let |
2a28e66e2e4c
ensure no abstractions leak through after lambda-lifting (for formulas with higher-order occurrences of quantifiers)
blanchet
parents:
46711
diff
changeset
|
715 |
fun trans Ts t = |
54829 | 716 |
(case t of |
46818
2a28e66e2e4c
ensure no abstractions leak through after lambda-lifting (for formulas with higher-order occurrences of quantifiers)
blanchet
parents:
46711
diff
changeset
|
717 |
@{const Not} $ t1 => @{const Not} $ trans Ts t1 |
2a28e66e2e4c
ensure no abstractions leak through after lambda-lifting (for formulas with higher-order occurrences of quantifiers)
blanchet
parents:
46711
diff
changeset
|
718 |
| (t0 as Const (@{const_name All}, _)) $ Abs (s, T, t') => |
2a28e66e2e4c
ensure no abstractions leak through after lambda-lifting (for formulas with higher-order occurrences of quantifiers)
blanchet
parents:
46711
diff
changeset
|
719 |
t0 $ Abs (s, T, trans (T :: Ts) t') |
54829 | 720 |
| (t0 as Const (@{const_name All}, _)) $ t1 => trans Ts (t0 $ eta_expand Ts t1 1) |
46818
2a28e66e2e4c
ensure no abstractions leak through after lambda-lifting (for formulas with higher-order occurrences of quantifiers)
blanchet
parents:
46711
diff
changeset
|
721 |
| (t0 as Const (@{const_name Ex}, _)) $ Abs (s, T, t') => |
2a28e66e2e4c
ensure no abstractions leak through after lambda-lifting (for formulas with higher-order occurrences of quantifiers)
blanchet
parents:
46711
diff
changeset
|
722 |
t0 $ Abs (s, T, trans (T :: Ts) t') |
54829 | 723 |
| (t0 as Const (@{const_name Ex}, _)) $ t1 => trans Ts (t0 $ eta_expand Ts t1 1) |
724 |
| (t0 as @{const HOL.conj}) $ t1 $ t2 => t0 $ trans Ts t1 $ trans Ts t2 |
|
725 |
| (t0 as @{const HOL.disj}) $ t1 $ t2 => t0 $ trans Ts t1 $ trans Ts t2 |
|
726 |
| (t0 as @{const HOL.implies}) $ t1 $ t2 => t0 $ trans Ts t1 $ trans Ts t2 |
|
727 |
| (t0 as Const (@{const_name HOL.eq}, Type (_, [@{typ bool}, _]))) $ t1 $ t2 => |
|
46818
2a28e66e2e4c
ensure no abstractions leak through after lambda-lifting (for formulas with higher-order occurrences of quantifiers)
blanchet
parents:
46711
diff
changeset
|
728 |
t0 $ trans Ts t1 $ trans Ts t2 |
2a28e66e2e4c
ensure no abstractions leak through after lambda-lifting (for formulas with higher-order occurrences of quantifiers)
blanchet
parents:
46711
diff
changeset
|
729 |
| _ => |
2a28e66e2e4c
ensure no abstractions leak through after lambda-lifting (for formulas with higher-order occurrences of quantifiers)
blanchet
parents:
46711
diff
changeset
|
730 |
if not (exists_subterm (fn Abs _ => true | _ => false) t) then t |
54829 | 731 |
else t |> Envir.eta_contract |> do_lambdas ctxt Ts) |
46818
2a28e66e2e4c
ensure no abstractions leak through after lambda-lifting (for formulas with higher-order occurrences of quantifiers)
blanchet
parents:
46711
diff
changeset
|
732 |
val (t, ctxt') = Variable.import_terms true [t] ctxt |>> the_single |
2a28e66e2e4c
ensure no abstractions leak through after lambda-lifting (for formulas with higher-order occurrences of quantifiers)
blanchet
parents:
46711
diff
changeset
|
733 |
in t |> trans [] |> singleton (Variable.export_terms ctxt' ctxt) end |
2a28e66e2e4c
ensure no abstractions leak through after lambda-lifting (for formulas with higher-order occurrences of quantifiers)
blanchet
parents:
46711
diff
changeset
|
734 |
|
2a28e66e2e4c
ensure no abstractions leak through after lambda-lifting (for formulas with higher-order occurrences of quantifiers)
blanchet
parents:
46711
diff
changeset
|
735 |
fun do_cheaply_conceal_lambdas Ts (t1 $ t2) = |
2a28e66e2e4c
ensure no abstractions leak through after lambda-lifting (for formulas with higher-order occurrences of quantifiers)
blanchet
parents:
46711
diff
changeset
|
736 |
do_cheaply_conceal_lambdas Ts t1 |
2a28e66e2e4c
ensure no abstractions leak through after lambda-lifting (for formulas with higher-order occurrences of quantifiers)
blanchet
parents:
46711
diff
changeset
|
737 |
$ do_cheaply_conceal_lambdas Ts t2 |
2a28e66e2e4c
ensure no abstractions leak through after lambda-lifting (for formulas with higher-order occurrences of quantifiers)
blanchet
parents:
46711
diff
changeset
|
738 |
| do_cheaply_conceal_lambdas Ts (Abs (_, T, t)) = |
2a28e66e2e4c
ensure no abstractions leak through after lambda-lifting (for formulas with higher-order occurrences of quantifiers)
blanchet
parents:
46711
diff
changeset
|
739 |
Const (lam_lifted_poly_prefix ^ serial_string (), |
2a28e66e2e4c
ensure no abstractions leak through after lambda-lifting (for formulas with higher-order occurrences of quantifiers)
blanchet
parents:
46711
diff
changeset
|
740 |
T --> fastype_of1 (T :: Ts, t)) |
2a28e66e2e4c
ensure no abstractions leak through after lambda-lifting (for formulas with higher-order occurrences of quantifiers)
blanchet
parents:
46711
diff
changeset
|
741 |
| do_cheaply_conceal_lambdas _ t = t |
2a28e66e2e4c
ensure no abstractions leak through after lambda-lifting (for formulas with higher-order occurrences of quantifiers)
blanchet
parents:
46711
diff
changeset
|
742 |
|
2a28e66e2e4c
ensure no abstractions leak through after lambda-lifting (for formulas with higher-order occurrences of quantifiers)
blanchet
parents:
46711
diff
changeset
|
743 |
fun concealed_bound_name j = atp_weak_prefix ^ string_of_int j |
2a28e66e2e4c
ensure no abstractions leak through after lambda-lifting (for formulas with higher-order occurrences of quantifiers)
blanchet
parents:
46711
diff
changeset
|
744 |
fun conceal_bounds Ts t = |
57481
84bbdbf1b2da
reverted 9512b867259c -- appears to break 'metis'
blanchet
parents:
57470
diff
changeset
|
745 |
subst_bounds (map (Free o apfst concealed_bound_name) |
84bbdbf1b2da
reverted 9512b867259c -- appears to break 'metis'
blanchet
parents:
57470
diff
changeset
|
746 |
(0 upto length Ts - 1 ~~ Ts), t) |
46818
2a28e66e2e4c
ensure no abstractions leak through after lambda-lifting (for formulas with higher-order occurrences of quantifiers)
blanchet
parents:
46711
diff
changeset
|
747 |
fun reveal_bounds Ts = |
57481
84bbdbf1b2da
reverted 9512b867259c -- appears to break 'metis'
blanchet
parents:
57470
diff
changeset
|
748 |
subst_atomic (map (fn (j, T) => (Free (concealed_bound_name j, T), Bound j)) |
84bbdbf1b2da
reverted 9512b867259c -- appears to break 'metis'
blanchet
parents:
57470
diff
changeset
|
749 |
(0 upto length Ts - 1 ~~ Ts)) |
46818
2a28e66e2e4c
ensure no abstractions leak through after lambda-lifting (for formulas with higher-order occurrences of quantifiers)
blanchet
parents:
46711
diff
changeset
|
750 |
|
2a28e66e2e4c
ensure no abstractions leak through after lambda-lifting (for formulas with higher-order occurrences of quantifiers)
blanchet
parents:
46711
diff
changeset
|
751 |
fun do_introduce_combinators ctxt Ts t = |
59632 | 752 |
(t |> conceal_bounds Ts |
753 |
|> Thm.cterm_of ctxt |
|
60328 | 754 |
|> Meson_Clausify.introduce_combinators_in_cterm ctxt |
59632 | 755 |
|> Thm.prop_of |> Logic.dest_equals |> snd |
756 |
|> reveal_bounds Ts) |
|
46818
2a28e66e2e4c
ensure no abstractions leak through after lambda-lifting (for formulas with higher-order occurrences of quantifiers)
blanchet
parents:
46711
diff
changeset
|
757 |
(* A type variable of sort "{}" will make abstraction fail. *) |
2a28e66e2e4c
ensure no abstractions leak through after lambda-lifting (for formulas with higher-order occurrences of quantifiers)
blanchet
parents:
46711
diff
changeset
|
758 |
handle THM _ => t |> do_cheaply_conceal_lambdas Ts |
2a28e66e2e4c
ensure no abstractions leak through after lambda-lifting (for formulas with higher-order occurrences of quantifiers)
blanchet
parents:
46711
diff
changeset
|
759 |
val introduce_combinators = simple_translate_lambdas do_introduce_combinators |
2a28e66e2e4c
ensure no abstractions leak through after lambda-lifting (for formulas with higher-order occurrences of quantifiers)
blanchet
parents:
46711
diff
changeset
|
760 |
|
45509 | 761 |
fun constify_lifted (t $ u) = constify_lifted t $ constify_lifted u |
762 |
| constify_lifted (Abs (s, T, t)) = Abs (s, T, constify_lifted t) |
|
763 |
| constify_lifted (Free (x as (s, _))) = |
|
45554
09ad83de849c
don't pass "lam_lifted" option to "metis" unless there's a good reason
blanchet
parents:
45551
diff
changeset
|
764 |
(if String.isPrefix lam_lifted_prefix s then Const else Free) x |
45509 | 765 |
| constify_lifted t = t |
766 |
||
45554
09ad83de849c
don't pass "lam_lifted" option to "metis" unless there's a good reason
blanchet
parents:
45551
diff
changeset
|
767 |
fun lift_lams_part_1 ctxt type_enc = |
49982 | 768 |
map hol_close_form #> rpair ctxt |
44088
3693baa6befb
move lambda-lifting code to ATP encoding, so it can be used by Metis
blanchet
parents:
44003
diff
changeset
|
769 |
#-> Lambda_Lifting.lift_lambdas |
48131 | 770 |
(SOME ((if is_type_enc_polymorphic type_enc then |
45564 | 771 |
lam_lifted_poly_prefix |
772 |
else |
|
773 |
lam_lifted_mono_prefix) ^ "_a")) |
|
44088
3693baa6befb
move lambda-lifting code to ATP encoding, so it can be used by Metis
blanchet
parents:
44003
diff
changeset
|
774 |
Lambda_Lifting.is_quantifier |
45554
09ad83de849c
don't pass "lam_lifted" option to "metis" unless there's a good reason
blanchet
parents:
45551
diff
changeset
|
775 |
#> fst |
46818
2a28e66e2e4c
ensure no abstractions leak through after lambda-lifting (for formulas with higher-order occurrences of quantifiers)
blanchet
parents:
46711
diff
changeset
|
776 |
|
2a28e66e2e4c
ensure no abstractions leak through after lambda-lifting (for formulas with higher-order occurrences of quantifiers)
blanchet
parents:
46711
diff
changeset
|
777 |
fun lift_lams_part_2 ctxt (facts, lifted) = |
2a28e66e2e4c
ensure no abstractions leak through after lambda-lifting (for formulas with higher-order occurrences of quantifiers)
blanchet
parents:
46711
diff
changeset
|
778 |
(facts, lifted) |
52125
ac7830871177
improved handling of free variables' types in Isar proofs
blanchet
parents:
52076
diff
changeset
|
779 |
(* Lambda-lifting sometimes leaves some lambdas around; we need some way to |
ac7830871177
improved handling of free variables' types in Isar proofs
blanchet
parents:
52076
diff
changeset
|
780 |
get rid of them *) |
59058
a78612c67ec0
renamed "pairself" to "apply2", in accordance to @{apply 2};
wenzelm
parents:
58477
diff
changeset
|
781 |
|> apply2 (map (introduce_combinators ctxt)) |
a78612c67ec0
renamed "pairself" to "apply2", in accordance to @{apply 2};
wenzelm
parents:
58477
diff
changeset
|
782 |
|> apply2 (map constify_lifted) |
47718
39229c760636
smoother handling of conjecture, so that its Skolem constants get displayed in countermodels
blanchet
parents:
47715
diff
changeset
|
783 |
(* Requires bound variables not to clash with any schematic variables (as |
39229c760636
smoother handling of conjecture, so that its Skolem constants get displayed in countermodels
blanchet
parents:
47715
diff
changeset
|
784 |
should be the case right after lambda-lifting). *) |
49982 | 785 |
|>> map (hol_open_form (unprefix hol_close_form_prefix)) |
786 |
||> map (hol_open_form I) |
|
46818
2a28e66e2e4c
ensure no abstractions leak through after lambda-lifting (for formulas with higher-order occurrences of quantifiers)
blanchet
parents:
46711
diff
changeset
|
787 |
|
2a28e66e2e4c
ensure no abstractions leak through after lambda-lifting (for formulas with higher-order occurrences of quantifiers)
blanchet
parents:
46711
diff
changeset
|
788 |
fun lift_lams ctxt = lift_lams_part_2 ctxt oo lift_lams_part_1 ctxt |
44088
3693baa6befb
move lambda-lifting code to ATP encoding, so it can be used by Metis
blanchet
parents:
44003
diff
changeset
|
789 |
|
3693baa6befb
move lambda-lifting code to ATP encoding, so it can be used by Metis
blanchet
parents:
44003
diff
changeset
|
790 |
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
|
791 |
intentionalize_def t |
3693baa6befb
move lambda-lifting code to ATP encoding, so it can be used by Metis
blanchet
parents:
44003
diff
changeset
|
792 |
| 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
|
793 |
let |
3693baa6befb
move lambda-lifting code to ATP encoding, so it can be used by Metis
blanchet
parents:
44003
diff
changeset
|
794 |
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
|
795 |
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
|
796 |
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
|
797 |
val n = length args |
3693baa6befb
move lambda-lifting code to ATP encoding, so it can be used by Metis
blanchet
parents:
44003
diff
changeset
|
798 |
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
|
799 |
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
|
800 |
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
|
801 |
| intentionalize_def t = t |
3693baa6befb
move lambda-lifting code to ATP encoding, so it can be used by Metis
blanchet
parents:
44003
diff
changeset
|
802 |
|
47981 | 803 |
type ifact = |
43496
92f5a4c78b37
remove historical bloat -- another benefit of merging Metis's and Sledgehammer's translations
blanchet
parents:
43495
diff
changeset
|
804 |
{name : string, |
46340 | 805 |
stature : stature, |
53586
bd5fa6425993
prefixed types and some functions with "atp_" for disambiguation
blanchet
parents:
52995
diff
changeset
|
806 |
role : atp_formula_role, |
bd5fa6425993
prefixed types and some functions with "atp_" for disambiguation
blanchet
parents:
52995
diff
changeset
|
807 |
iformula : (string * string, typ, iterm, string * string) atp_formula, |
43496
92f5a4c78b37
remove historical bloat -- another benefit of merging Metis's and Sledgehammer's translations
blanchet
parents:
43495
diff
changeset
|
808 |
atomic_types : typ list} |
38282
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
809 |
|
47981 | 810 |
fun update_iformula f ({name, stature, role, iformula, atomic_types} : ifact) = |
54798 | 811 |
{name = name, stature = stature, role = role, iformula = f iformula, atomic_types = atomic_types} |
812 |
: ifact |
|
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
|
813 |
|
47981 | 814 |
fun ifact_lift f ({iformula, ...} : ifact) = 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
|
815 |
|
47150 | 816 |
fun insert_type thy get_T x 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
|
817 |
let val T = get_T x in |
47150 | 818 |
if exists (type_instance thy T o get_T) xs then xs |
819 |
else x :: filter_out (type_generalization thy 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
|
820 |
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
|
821 |
|
48202 | 822 |
fun chop_fun 0 T = ([], T) |
823 |
| chop_fun n (Type (@{type_name fun}, [dom_T, ran_T])) = |
|
824 |
chop_fun (n - 1) ran_T |>> cons dom_T |
|
825 |
| chop_fun _ T = ([], T) |
|
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
|
826 |
|
52032 | 827 |
fun filter_type_args thy ctrss type_enc s ary T_args = |
45315 | 828 |
let val poly = polymorphism_of_type_enc type_enc in |
50968
3686bc0d4df2
pass correct index to "Sign.typ_unify" -- this is important to avoid what appears to be an infinite loop in the unifier
blanchet
parents:
50758
diff
changeset
|
829 |
if s = type_tag_name then (* FIXME: why not "type_guard_name" as well? *) |
48202 | 830 |
T_args |
54829 | 831 |
else |
832 |
(case type_enc of |
|
833 |
Native (_, Raw_Polymorphic _, _) => T_args |
|
834 |
| Native (_, Type_Class_Polymorphic, _) => T_args |
|
835 |
| _ => |
|
836 |
let |
|
837 |
fun gen_type_args _ _ [] = [] |
|
838 |
| gen_type_args keep strip_ty T_args = |
|
839 |
let |
|
840 |
val U = robust_const_type thy s |
|
841 |
val (binder_Us, body_U) = strip_ty U |
|
842 |
val in_U_vars = fold Term.add_tvarsT binder_Us [] |
|
843 |
val out_U_vars = Term.add_tvarsT body_U [] |
|
844 |
fun filt (U_var, T) = |
|
845 |
if keep (member (op =) in_U_vars U_var, |
|
846 |
member (op =) out_U_vars U_var) then |
|
847 |
T |
|
848 |
else |
|
849 |
dummyT |
|
850 |
val U_args = (s, U) |> robust_const_type_args thy |
|
851 |
in map (filt o apfst dest_TVar) (U_args ~~ T_args) end |
|
852 |
handle TYPE _ => T_args |
|
853 |
fun is_always_ctr (s', T') = |
|
854 |
s' = s andalso type_equiv thy (T', robust_const_type thy s') |
|
855 |
val noninfer_type_args = gen_type_args (not o fst) (chop_fun ary) |
|
856 |
val ctr_infer_type_args = gen_type_args fst strip_type |
|
857 |
val level = level_of_type_enc type_enc |
|
858 |
in |
|
859 |
if level = No_Types orelse s = @{const_name HOL.eq} orelse |
|
860 |
(case level of Const_Types _ => s = app_op_name | _ => false) then |
|
861 |
[] |
|
862 |
else if poly = Mangled_Monomorphic then |
|
863 |
T_args |
|
864 |
else if level = All_Types then |
|
865 |
(case type_enc of |
|
866 |
Guards _ => noninfer_type_args T_args |
|
867 |
| Tags _ => []) |
|
868 |
else if level = Undercover_Types then |
|
869 |
noninfer_type_args T_args |
|
870 |
else if level <> Const_Types Without_Ctr_Optim andalso |
|
871 |
exists (exists is_always_ctr) ctrss then |
|
872 |
ctr_infer_type_args T_args |
|
873 |
else |
|
874 |
T_args |
|
875 |
end) |
|
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
|
876 |
end |
42227
662b50b7126f
if "monomorphize" is enabled, mangle the type information in the names by default
blanchet
parents:
42180
diff
changeset
|
877 |
|
46338
b02ff6b17599
better handling of individual type for DFG format (SPASS)
blanchet
parents:
46320
diff
changeset
|
878 |
val fused_infinite_type_name = "ATP.fused_inf" (* shouldn't clash *) |
44594
ae82943481e9
added type abstractions (for declaring polymorphic constants) to TFF syntax
blanchet
parents:
44593
diff
changeset
|
879 |
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
|
880 |
|
54820 | 881 |
fun raw_atp_type_of_typ type_enc = |
42994
fe291ab75eb5
towards supporting non-simply-typed encodings for TFF and THF (for orthogonality and experiments)
blanchet
parents:
42966
diff
changeset
|
882 |
let |
fe291ab75eb5
towards supporting non-simply-typed encodings for TFF and THF (for orthogonality and experiments)
blanchet
parents:
42966
diff
changeset
|
883 |
fun term (Type (s, Ts)) = |
54820 | 884 |
AType ((case (is_type_enc_higher_order type_enc, s) of |
48138 | 885 |
(true, @{type_name bool}) => `I tptp_bool_type |
886 |
| (true, @{type_name fun}) => `I tptp_fun_type |
|
54820 | 887 |
| _ => |
888 |
if s = fused_infinite_type_name andalso is_type_enc_native type_enc then |
|
889 |
`I tptp_individual_type |
|
890 |
else |
|
891 |
`make_fixed_type_const s, []), map term Ts) |
|
892 |
| term (TFree (s, _)) = AType ((`make_tfree s, []), []) |
|
55212 | 893 |
| term (TVar z) = AType ((tvar_name z, []), []) |
42994
fe291ab75eb5
towards supporting non-simply-typed encodings for TFF and THF (for orthogonality and experiments)
blanchet
parents:
42966
diff
changeset
|
894 |
in term end |
42562 | 895 |
|
54820 | 896 |
fun atp_term_of_atp_type (AType ((name, _), tys)) = ATerm ((name, []), map atp_term_of_atp_type tys) |
897 |
| atp_term_of_atp_type _ = raise Fail "unexpected type" |
|
48138 | 898 |
|
54820 | 899 |
fun atp_type_of_type_arg type_enc T = |
900 |
if T = dummyT then NONE else SOME (raw_atp_type_of_typ type_enc T) |
|
43401
e93dfcb53535
fixed soundness bug made more visible by previous change
blanchet
parents:
43399
diff
changeset
|
901 |
|
42562 | 902 |
(* This shouldn't clash with anything else. *) |
46409
d4754183ccce
made option available to users (mostly for experiments)
blanchet
parents:
46406
diff
changeset
|
903 |
val uncurried_alias_sep = "\000" |
46392
676a4b4b6e73
implemented partial application aliases (for SPASS mainly)
blanchet
parents:
46389
diff
changeset
|
904 |
val mangled_type_sep = "\001" |
676a4b4b6e73
implemented partial application aliases (for SPASS mainly)
blanchet
parents:
46389
diff
changeset
|
905 |
|
46409
d4754183ccce
made option available to users (mostly for experiments)
blanchet
parents:
46406
diff
changeset
|
906 |
val ascii_of_uncurried_alias_sep = ascii_of uncurried_alias_sep |
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
|
907 |
|
54820 | 908 |
fun generic_mangled_type_name f (AType ((name, _), [])) = f name |
909 |
| generic_mangled_type_name f (AType ((name, _), tys)) = |
|
910 |
f name ^ "(" ^ space_implode "," (map (generic_mangled_type_name f) tys) ^ ")" |
|
48138 | 911 |
| generic_mangled_type_name _ _ = raise Fail "unexpected type" |
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
|
912 |
|
54820 | 913 |
fun mangled_type type_enc = generic_mangled_type_name fst o raw_atp_type_of_typ type_enc |
44396
66b9b3fcd608
started cleaning up polymorphic monotonicity-based encodings, based on discussions with Nick Smallbone
blanchet
parents:
44394
diff
changeset
|
914 |
|
46435 | 915 |
fun make_native_type s = |
54820 | 916 |
if s = tptp_bool_type orelse s = tptp_fun_type orelse s = tptp_individual_type then s |
917 |
else native_type_prefix ^ ascii_of s |
|
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
918 |
|
54820 | 919 |
fun native_atp_type_of_raw_atp_type type_enc pred_sym ary = |
42963 | 920 |
let |
44593
ccf40af26ae9
implement more of the polymorphic simply typed format TFF(1)
blanchet
parents:
44591
diff
changeset
|
921 |
fun to_mangled_atype ty = |
54820 | 922 |
AType (((make_native_type (generic_mangled_type_name fst ty), |
923 |
generic_mangled_type_name snd ty), []), []) |
|
924 |
fun to_poly_atype (AType ((name, clss), tys)) = AType ((name, clss), map to_poly_atype tys) |
|
48138 | 925 |
| to_poly_atype _ = raise Fail "unexpected type" |
44593
ccf40af26ae9
implement more of the polymorphic simply typed format TFF(1)
blanchet
parents:
44591
diff
changeset
|
926 |
val to_atype = |
48131 | 927 |
if is_type_enc_polymorphic type_enc then to_poly_atype |
44593
ccf40af26ae9
implement more of the polymorphic simply typed format TFF(1)
blanchet
parents:
44591
diff
changeset
|
928 |
else to_mangled_atype |
42963 | 929 |
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
|
930 |
fun to_fo 0 ty = if pred_sym then bool_atype else to_atype ty |
48138 | 931 |
| to_fo ary (AType (_, tys)) = to_afun to_atype (to_fo (ary - 1)) tys |
932 |
| to_fo _ _ = raise Fail "unexpected type" |
|
54820 | 933 |
fun to_ho (ty as AType (((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
|
934 |
if s = tptp_fun_type then to_afun to_ho to_ho tys else to_atype ty |
48138 | 935 |
| to_ho _ = raise Fail "unexpected type" |
43626
a867ebb12209
renamed "type_sys" to "type_enc", which is more accurate
blanchet
parents:
43624
diff
changeset
|
936 |
in if is_type_enc_higher_order type_enc then to_ho else to_fo ary end |
42963 | 937 |
|
54820 | 938 |
fun native_atp_type_of_typ type_enc pred_sym ary = |
939 |
native_atp_type_of_raw_atp_type type_enc pred_sym ary o raw_atp_type_of_typ type_enc |
|
42963 | 940 |
|
48133
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
941 |
(* Make atoms for sorted type variables. *) |
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
942 |
fun generic_add_sorts_on_type _ [] = I |
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
943 |
| generic_add_sorts_on_type T (s :: ss) = |
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
944 |
generic_add_sorts_on_type T ss |
48142
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
945 |
#> (if s = the_single @{sort type} then I else insert (op =) (s, T)) |
48133
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
946 |
fun add_sorts_on_tfree (T as TFree (_, S)) = generic_add_sorts_on_type T S |
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
947 |
| add_sorts_on_tfree _ = I |
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
948 |
fun add_sorts_on_tvar (T as TVar (_, S)) = generic_add_sorts_on_type T S |
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
949 |
| add_sorts_on_tvar _ = I |
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
950 |
|
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
951 |
fun process_type_args type_enc T_args = |
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
952 |
if is_type_enc_native type_enc then |
54820 | 953 |
(map (native_atp_type_of_typ type_enc false 0) T_args, []) |
48133
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
954 |
else |
54820 | 955 |
([], map_filter (Option.map atp_term_of_atp_type o atp_type_of_type_arg type_enc) T_args) |
48133
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
956 |
|
48142
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
957 |
fun class_atom type_enc (cl, T) = |
48133
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
958 |
let |
48142
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
959 |
val cl = `make_class cl |
48133
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
960 |
val (ty_args, tm_args) = process_type_args type_enc [T] |
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
961 |
val tm_args = |
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
962 |
tm_args @ |
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
963 |
(case type_enc of |
57292 | 964 |
Native (_, Raw_Polymorphic Without_Phantom_Type_Vars, _) => |
54820 | 965 |
[ATerm ((TYPE_name, ty_args), [])] |
966 |
| _ => []) |
|
48142
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
967 |
in AAtom (ATerm ((cl, ty_args), tm_args)) end |
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
968 |
|
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
969 |
fun class_atoms type_enc (cls, T) = |
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
970 |
map (fn cl => class_atom type_enc (cl, T)) cls |
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
971 |
|
51998
f732a674db1b
renamed Sledgehammer functions with 'for' in their names to 'of'
blanchet
parents:
51921
diff
changeset
|
972 |
fun class_membs_of_types type_enc add_sorts_on_typ Ts = |
54798 | 973 |
[] |> level_of_type_enc type_enc <> No_Types ? fold add_sorts_on_typ Ts |
48133
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
974 |
|
48141 | 975 |
fun mk_aconns c = split_last #> uncurry (fold_rev (mk_aconn c)) |
48133
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
976 |
|
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
977 |
fun mk_ahorn [] phi = phi |
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
978 |
| mk_ahorn phis psi = AConn (AImplies, [mk_aconns AAnd phis, psi]) |
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
979 |
|
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
980 |
fun mk_aquant _ [] phi = phi |
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
981 |
| mk_aquant q xs (phi as AQuant (q', xs', phi')) = |
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
982 |
if q = q' then AQuant (q, xs @ xs', phi') else AQuant (q, xs, phi) |
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
983 |
| mk_aquant q xs phi = AQuant (q, xs, phi) |
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
984 |
|
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
985 |
fun mk_atyquant _ [] phi = phi |
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
986 |
| mk_atyquant q xs (phi as ATyQuant (q', xs', phi')) = |
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
987 |
if q = q' then ATyQuant (q, xs @ xs', phi') else ATyQuant (q, xs, phi) |
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
988 |
| mk_atyquant q xs phi = ATyQuant (q, xs, phi) |
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
989 |
|
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
990 |
fun close_universally add_term_vars phi = |
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
991 |
let |
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
992 |
fun add_formula_vars bounds (ATyQuant (_, _, phi)) = |
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
993 |
add_formula_vars bounds phi |
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
994 |
| add_formula_vars bounds (AQuant (_, xs, phi)) = |
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
995 |
add_formula_vars (map fst xs @ bounds) phi |
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
996 |
| add_formula_vars bounds (AConn (_, phis)) = |
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
997 |
fold (add_formula_vars bounds) phis |
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
998 |
| add_formula_vars bounds (AAtom tm) = add_term_vars bounds tm |
50706
573d84e08f3f
close formulas in the natural order, not its reverse -- so that Skolem arguments appear in the right order in Isar proofs
blanchet
parents:
50521
diff
changeset
|
999 |
in mk_aquant AForall (rev (add_formula_vars [] phi [])) phi end |
48133
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
1000 |
|
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
1001 |
fun add_term_vars bounds (ATerm ((name as (s, _), _), tms)) = |
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
1002 |
(if is_tptp_variable s andalso |
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
1003 |
not (String.isPrefix tvar_prefix s) andalso |
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
1004 |
not (member (op =) bounds name) then |
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
1005 |
insert (op =) (name, NONE) |
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
1006 |
else |
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
1007 |
I) |
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
1008 |
#> fold (add_term_vars bounds) tms |
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
1009 |
| add_term_vars bounds (AAbs (((name, _), tm), args)) = |
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
1010 |
add_term_vars (name :: bounds) tm #> fold (add_term_vars bounds) args |
50706
573d84e08f3f
close formulas in the natural order, not its reverse -- so that Skolem arguments appear in the right order in Isar proofs
blanchet
parents:
50521
diff
changeset
|
1011 |
|
48133
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
1012 |
fun close_formula_universally phi = close_universally add_term_vars phi |
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
1013 |
|
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
1014 |
fun add_iterm_vars bounds (IApp (tm1, tm2)) = |
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
1015 |
fold (add_iterm_vars bounds) [tm1, tm2] |
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
1016 |
| add_iterm_vars _ (IConst _) = I |
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
1017 |
| add_iterm_vars bounds (IVar (name, T)) = |
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
1018 |
not (member (op =) bounds name) ? insert (op =) (name, SOME T) |
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
1019 |
| add_iterm_vars bounds (IAbs (_, tm)) = add_iterm_vars bounds tm |
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
1020 |
|
46409
d4754183ccce
made option available to users (mostly for experiments)
blanchet
parents:
46406
diff
changeset
|
1021 |
fun aliased_uncurried ary (s, s') = |
d4754183ccce
made option available to users (mostly for experiments)
blanchet
parents:
46406
diff
changeset
|
1022 |
(s ^ ascii_of_uncurried_alias_sep ^ string_of_int ary, s' ^ string_of_int ary) |
d4754183ccce
made option available to users (mostly for experiments)
blanchet
parents:
46406
diff
changeset
|
1023 |
fun unaliased_uncurried (s, s') = |
54829 | 1024 |
(case space_explode uncurried_alias_sep s of |
46392
676a4b4b6e73
implemented partial application aliases (for SPASS mainly)
blanchet
parents:
46389
diff
changeset
|
1025 |
[_] => (s, s') |
676a4b4b6e73
implemented partial application aliases (for SPASS mainly)
blanchet
parents:
46389
diff
changeset
|
1026 |
| [s1, s2] => (s1, unsuffix s2 s') |
54829 | 1027 |
| _ => raise Fail "ill-formed explicit application alias") |
46392
676a4b4b6e73
implemented partial application aliases (for SPASS mainly)
blanchet
parents:
46389
diff
changeset
|
1028 |
|
676a4b4b6e73
implemented partial application aliases (for SPASS mainly)
blanchet
parents:
46389
diff
changeset
|
1029 |
fun raw_mangled_const_name type_name ty_args (s, s') = |
42963 | 1030 |
let |
1031 |
fun type_suffix f g = |
|
46392
676a4b4b6e73
implemented partial application aliases (for SPASS mainly)
blanchet
parents:
46389
diff
changeset
|
1032 |
fold_rev (curry (op ^) o g o prefix mangled_type_sep o type_name f) |
676a4b4b6e73
implemented partial application aliases (for SPASS mainly)
blanchet
parents:
46389
diff
changeset
|
1033 |
ty_args "" |
42963 | 1034 |
in (s ^ type_suffix fst ascii_of, s' ^ type_suffix snd I) end |
47768
0b2b7ff31867
don't use the native choice operator if the type encoding isn't higher-order
blanchet
parents:
47767
diff
changeset
|
1035 |
fun mangled_const_name type_enc = |
54820 | 1036 |
map_filter (atp_type_of_type_arg type_enc) |
46392
676a4b4b6e73
implemented partial application aliases (for SPASS mainly)
blanchet
parents:
46389
diff
changeset
|
1037 |
#> raw_mangled_const_name generic_mangled_type_name |
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
|
1038 |
|
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
|
1039 |
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
|
1040 |
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
|
1041 |
|
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
|
1042 |
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
|
1043 |
(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
|
1044 |
-- Scan.optional ($$ "(" |-- Scan.optional parse_mangled_types [] --| $$ ")") |
48132
9aa0fad4e864
added type arguments to "ATerm" constructor -- but don't use them yet
blanchet
parents:
48131
diff
changeset
|
1045 |
[] >> (ATerm o apfst (rpair []))) x |
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
|
1046 |
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
|
1047 |
(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
|
1048 |
|
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
|
1049 |
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
|
1050 |
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
|
1051 |
|> 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
|
1052 |
(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
|
1053 |
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
|
1054 |
|> 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
|
1055 |
|
46392
676a4b4b6e73
implemented partial application aliases (for SPASS mainly)
blanchet
parents:
46389
diff
changeset
|
1056 |
fun unmangled_const_name s = |
46409
d4754183ccce
made option available to users (mostly for experiments)
blanchet
parents:
46406
diff
changeset
|
1057 |
(s, s) |> unaliased_uncurried |> fst |> space_explode mangled_type_sep |
51920
16f3b9d4e515
proper unmangling -- the bug is visible when "uncurried_aliases" is enabled with Alt-Ergo or Poly. SPASS
blanchet
parents:
51717
diff
changeset
|
1058 |
|
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
|
1059 |
fun unmangled_const s = |
46392
676a4b4b6e73
implemented partial application aliases (for SPASS mainly)
blanchet
parents:
46389
diff
changeset
|
1060 |
let val ss = unmangled_const_name s in |
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
|
1061 |
(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
|
1062 |
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
|
1063 |
|
51920
16f3b9d4e515
proper unmangling -- the bug is visible when "uncurried_aliases" is enabled with Alt-Ergo or Poly. SPASS
blanchet
parents:
51717
diff
changeset
|
1064 |
val unmangled_invert_const = invert_const o hd o unmangled_const_name |
16f3b9d4e515
proper unmangling -- the bug is visible when "uncurried_aliases" is enabled with Alt-Ergo or Poly. SPASS
blanchet
parents:
51717
diff
changeset
|
1065 |
|
44773
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
1066 |
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
|
1067 |
let |
43987
2850b7dc27a4
further worked around LEO-II parser limitation, with eta-expansion
blanchet
parents:
43985
diff
changeset
|
1068 |
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
|
1069 |
| 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
|
1070 |
_ = |
2850b7dc27a4
further worked around LEO-II parser limitation, with eta-expansion
blanchet
parents:
43985
diff
changeset
|
1071 |
(* 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
|
1072 |
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
|
1073 |
"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
|
1074 |
possible. *) |
2850b7dc27a4
further worked around LEO-II parser limitation, with eta-expansion
blanchet
parents:
43985
diff
changeset
|
1075 |
IAbs ((`I "P", p_T), |
2850b7dc27a4
further worked around LEO-II parser limitation, with eta-expansion
blanchet
parents:
43985
diff
changeset
|
1076 |
IApp (IConst (`I ho_quant, T, []), |
2850b7dc27a4
further worked around LEO-II parser limitation, with eta-expansion
blanchet
parents:
43985
diff
changeset
|
1077 |
IAbs ((`I "X", x_T), |
2850b7dc27a4
further worked around LEO-II parser limitation, with eta-expansion
blanchet
parents:
43985
diff
changeset
|
1078 |
IApp (IConst (`I "P", p_T, []), |
2850b7dc27a4
further worked around LEO-II parser limitation, with eta-expansion
blanchet
parents:
43985
diff
changeset
|
1079 |
IConst (`I "X", x_T, []))))) |
2850b7dc27a4
further worked around LEO-II parser limitation, with eta-expansion
blanchet
parents:
43985
diff
changeset
|
1080 |
| 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
|
1081 |
fun intro top_level args (IApp (tm1, tm2)) = |
2850b7dc27a4
further worked around LEO-II parser limitation, with eta-expansion
blanchet
parents:
43985
diff
changeset
|
1082 |
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
|
1083 |
| 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
|
1084 |
(case proxify_const s of |
54829 | 1085 |
SOME proxy_base => |
1086 |
if top_level orelse is_type_enc_higher_order type_enc then |
|
1087 |
(case (top_level, s) of |
|
1088 |
(_, "c_False") => IConst (`I tptp_false, T, []) |
|
1089 |
| (_, "c_True") => IConst (`I tptp_true, T, []) |
|
1090 |
| (false, "c_Not") => IConst (`I tptp_not, T, []) |
|
1091 |
| (false, "c_conj") => IConst (`I tptp_and, T, []) |
|
1092 |
| (false, "c_disj") => IConst (`I tptp_or, T, []) |
|
1093 |
| (false, "c_implies") => IConst (`I tptp_implies, T, []) |
|
1094 |
| (false, "c_All") => tweak_ho_quant tptp_ho_forall T args |
|
1095 |
| (false, "c_Ex") => tweak_ho_quant tptp_ho_exists T args |
|
1096 |
| (false, s) => |
|
1097 |
if is_tptp_equal s then |
|
1098 |
if length args = 2 then |
|
1099 |
IConst (`I tptp_equal, T, []) |
|
1100 |
else |
|
1101 |
(* Eta-expand partially applied THF equality, because the |
|
1102 |
LEO-II and Satallax parsers complain about not being able to |
|
1103 |
infer the type of "=". *) |
|
1104 |
let val i_T = domain_type T in |
|
1105 |
IAbs ((`I "Y", i_T), |
|
1106 |
IAbs ((`I "Z", i_T), |
|
1107 |
IApp (IApp (IConst (`I tptp_equal, T, []), |
|
1108 |
IConst (`I "Y", i_T, [])), |
|
1109 |
IConst (`I "Z", i_T, [])))) |
|
1110 |
end |
|
1111 |
else |
|
1112 |
IConst (name, T, []) |
|
1113 |
| _ => IConst (name, T, [])) |
|
1114 |
else |
|
1115 |
IConst (proxy_base |>> prefix const_prefix, T, T_args) |
|
1116 |
| NONE => if s = tptp_choice then tweak_ho_quant tptp_choice T args |
|
1117 |
else IConst (name, T, T_args)) |
|
43987
2850b7dc27a4
further worked around LEO-II parser limitation, with eta-expansion
blanchet
parents:
43985
diff
changeset
|
1118 |
| 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
|
1119 |
| intro _ _ tm = tm |
2850b7dc27a4
further worked around LEO-II parser limitation, with eta-expansion
blanchet
parents:
43985
diff
changeset
|
1120 |
in intro true [] end |
42568
7b9801a34836
no needless "fequal" proxies if "explicit_apply" is set + always have readable names
blanchet
parents:
42566
diff
changeset
|
1121 |
|
47768
0b2b7ff31867
don't use the native choice operator if the type encoding isn't higher-order
blanchet
parents:
47767
diff
changeset
|
1122 |
fun mangle_type_args_in_const type_enc (name as (s, _)) T_args = |
48203 | 1123 |
if String.isPrefix const_prefix s andalso is_type_enc_mangling type_enc then |
1124 |
(mangled_const_name type_enc T_args name, []) |
|
1125 |
else |
|
1126 |
(name, T_args) |
|
47768
0b2b7ff31867
don't use the native choice operator if the type encoding isn't higher-order
blanchet
parents:
47767
diff
changeset
|
1127 |
fun mangle_type_args_in_iterm type_enc = |
48201 | 1128 |
if is_type_enc_mangling type_enc 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
|
1129 |
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
|
1130 |
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
|
1131 |
| mangle (tm as IConst (_, _, [])) = tm |
46392
676a4b4b6e73
implemented partial application aliases (for SPASS mainly)
blanchet
parents:
46389
diff
changeset
|
1132 |
| mangle (IConst (name, T, T_args)) = |
47768
0b2b7ff31867
don't use the native choice operator if the type encoding isn't higher-order
blanchet
parents:
47767
diff
changeset
|
1133 |
mangle_type_args_in_const type_enc name T_args |
46392
676a4b4b6e73
implemented partial application aliases (for SPASS mainly)
blanchet
parents:
46389
diff
changeset
|
1134 |
|> (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
|
1135 |
| 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
|
1136 |
| 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
|
1137 |
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
|
1138 |
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
|
1139 |
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
|
1140 |
|
52032 | 1141 |
fun filter_type_args_in_const _ _ _ _ _ [] = [] |
1142 |
| filter_type_args_in_const thy ctrss type_enc ary s T_args = |
|
54829 | 1143 |
(case unprefix_and_unascii const_prefix s of |
1144 |
NONE => if level_of_type_enc type_enc = No_Types orelse s = tptp_choice then [] else T_args |
|
1145 |
| SOME s'' => filter_type_args thy ctrss type_enc (unmangled_invert_const s'') ary T_args) |
|
52029
1eefb69cb9c1
don't recognize overloaded constants as constructors for the purpose of removing type arguments
blanchet
parents:
52028
diff
changeset
|
1146 |
|
52028 | 1147 |
fun filter_type_args_in_iterm thy ctrss type_enc = |
38282
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
1148 |
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
|
1149 |
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
|
1150 |
| filt ary (IConst (name as (s, _), T, T_args)) = |
52032 | 1151 |
filter_type_args_in_const thy ctrss type_enc ary s T_args |
46392
676a4b4b6e73
implemented partial application aliases (for SPASS mainly)
blanchet
parents:
46389
diff
changeset
|
1152 |
|> (fn 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
|
1153 |
| 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
|
1154 |
| 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
|
1155 |
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
|
1156 |
|
52031
9a9238342963
tuning -- renamed '_from_' to '_of_' in Sledgehammer
blanchet
parents:
52030
diff
changeset
|
1157 |
fun iformula_of_prop ctxt type_enc iff_for_eq = |
44773
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
1158 |
let |
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
1159 |
val thy = Proof_Context.theory_of ctxt |
45316
08d84bdd5b37
improve handling of bound type variables (esp. for TFF1)
blanchet
parents:
45315
diff
changeset
|
1160 |
fun do_term bs t atomic_Ts = |
52031
9a9238342963
tuning -- renamed '_from_' to '_of_' in Sledgehammer
blanchet
parents:
52030
diff
changeset
|
1161 |
iterm_of_term thy type_enc 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
|
1162 |
|>> (introduce_proxies_in_iterm type_enc |
47768
0b2b7ff31867
don't use the native choice operator if the type encoding isn't higher-order
blanchet
parents:
47767
diff
changeset
|
1163 |
#> mangle_type_args_in_iterm type_enc #> AAtom) |
45316
08d84bdd5b37
improve handling of bound type variables (esp. for TFF1)
blanchet
parents:
45315
diff
changeset
|
1164 |
||> 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
|
1165 |
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
|
1166 |
let |
15160cdc4688
precisely distinguish between universal and existential quantifiers, instead of assuming the worst (universal), for monotonicity analysis
blanchet
parents:
44402
diff
changeset
|
1167 |
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
|
1168 |
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
|
1169 |
val name = |
15160cdc4688
precisely distinguish between universal and existential quantifiers, instead of assuming the worst (universal), for monotonicity analysis
blanchet
parents:
44402
diff
changeset
|
1170 |
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
|
1171 |
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
|
1172 |
| 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
|
1173 |
| 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
|
1174 |
in |
15160cdc4688
precisely distinguish between universal and existential quantifiers, instead of assuming the worst (universal), for monotonicity analysis
blanchet
parents:
44402
diff
changeset
|
1175 |
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
|
1176 |
#>> mk_aquant q [(name, SOME T)] |
45316
08d84bdd5b37
improve handling of bound type variables (esp. for TFF1)
blanchet
parents:
45315
diff
changeset
|
1177 |
##> union (op =) (atomic_types_of T) |
38518
54727b44e277
handle bound name conflicts gracefully in FOF translation
blanchet
parents:
38496
diff
changeset
|
1178 |
end |
44403
15160cdc4688
precisely distinguish between universal and existential quantifiers, instead of assuming the worst (universal), for monotonicity analysis
blanchet
parents:
44402
diff
changeset
|
1179 |
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
|
1180 |
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
|
1181 |
and do_formula bs pos t = |
54829 | 1182 |
(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
|
1183 |
@{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
|
1184 |
| @{const Not} $ t1 => do_formula bs (Option.map not pos) t1 #>> mk_anot |
54829 | 1185 |
| Const (@{const_name All}, _) $ Abs (s, T, t') => 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
|
1186 |
| (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
|
1187 |
do_formula bs pos (t0 $ eta_expand (map (snd o snd) bs) t1 1) |
54829 | 1188 |
| Const (@{const_name Ex}, _) $ Abs (s, T, t') => 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
|
1189 |
| (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
|
1190 |
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
|
1191 |
| @{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
|
1192 |
| @{const HOL.disj} $ t1 $ t2 => do_conn bs AOr pos t1 pos t2 |
54829 | 1193 |
| @{const HOL.implies} $ t1 $ t2 => 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
|
1194 |
| Const (@{const_name HOL.eq}, Type (_, [@{typ bool}, _])) $ t1 $ t2 => |
47905
9b6afe0eb69c
cleaner handling of bi-implication for THF output of first-order type encodings
blanchet
parents:
47810
diff
changeset
|
1195 |
if iff_for_eq then do_conn bs AIff NONE t1 NONE t2 else do_term bs t |
54829 | 1196 |
| _ => do_term bs t) |
38282
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
1197 |
in do_formula [] end |
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
1198 |
|
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51651
diff
changeset
|
1199 |
fun presimplify_term ctxt t = |
47151 | 1200 |
if exists_Const (member (op =) Meson.presimplified_consts o fst) t then |
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51651
diff
changeset
|
1201 |
t |> Skip_Proof.make_thm (Proof_Context.theory_of ctxt) |
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51651
diff
changeset
|
1202 |
|> Meson.presimplify ctxt |
59582 | 1203 |
|> Thm.prop_of |
47151 | 1204 |
else |
1205 |
t |
|
38282
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
1206 |
|
45514 | 1207 |
fun preprocess_abstractions_in_terms trans_lams facts = |
43862 | 1208 |
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
|
1209 |
val (facts, lambda_ts) = |
45514 | 1210 |
facts |> map (snd o snd) |> trans_lams |
47975
adc977fec17e
order LEO-II/Satallax definitions so that they build on each other (cf. Satallax's THF policy)
blanchet
parents:
47971
diff
changeset
|
1211 |
|>> map2 (fn (name, (role, _)) => fn t => (name, (role, t))) facts |
45554
09ad83de849c
don't pass "lam_lifted" option to "metis" unless there's a good reason
blanchet
parents:
45551
diff
changeset
|
1212 |
val lam_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
|
1213 |
map2 (fn t => fn j => |
48438
3e45c98fe127
distinguish between recursive and nonrecursive definitions + clean up typedef dependencies in MaSh
blanchet
parents:
48324
diff
changeset
|
1214 |
((lam_fact_prefix ^ Int.toString j, |
3e45c98fe127
distinguish between recursive and nonrecursive definitions + clean up typedef dependencies in MaSh
blanchet
parents:
48324
diff
changeset
|
1215 |
(Global, Non_Rec_Def)), (Axiom, 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
|
1216 |
lambda_ts (1 upto length lambda_ts) |
45554
09ad83de849c
don't pass "lam_lifted" option to "metis" unless there's a good reason
blanchet
parents:
45551
diff
changeset
|
1217 |
in (facts, lam_facts) end |
38282
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
1218 |
|
62126
2d187ace2827
avoid generating TFF1 or polymorphic DFG constructs in Vampire or SPASS problems for goals containing schematic type variables
blanchet
parents:
61940
diff
changeset
|
1219 |
(* Metis's use of "resolve_tac" freezes the schematic variables. We simulate this in Sledgehammer to |
2d187ace2827
avoid generating TFF1 or polymorphic DFG constructs in Vampire or SPASS problems for goals containing schematic type variables
blanchet
parents:
61940
diff
changeset
|
1220 |
prevent the discovery of unreplayable proofs. *) |
38282
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
1221 |
fun freeze_term t = |
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
1222 |
let |
52076
bfa28e1cba77
freeze types in Sledgehammer goal, not just terms
blanchet
parents:
52071
diff
changeset
|
1223 |
(* Freshness is desirable for completeness, but not for soundness. *) |
bfa28e1cba77
freeze types in Sledgehammer goal, not just terms
blanchet
parents:
52071
diff
changeset
|
1224 |
fun indexed_name (s, i) = s ^ "_" ^ string_of_int i ^ atp_weak_suffix |
44814
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
1225 |
fun freeze (t $ u) = freeze t $ freeze u |
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
1226 |
| freeze (Abs (s, T, t)) = Abs (s, T, freeze t) |
52076
bfa28e1cba77
freeze types in Sledgehammer goal, not just terms
blanchet
parents:
52071
diff
changeset
|
1227 |
| freeze (Var (x, T)) = Free (indexed_name x, T) |
44814
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
1228 |
| freeze t = t |
52076
bfa28e1cba77
freeze types in Sledgehammer goal, not just terms
blanchet
parents:
52071
diff
changeset
|
1229 |
fun freeze_tvar (x, S) = TFree (indexed_name x, S) |
bfa28e1cba77
freeze types in Sledgehammer goal, not just terms
blanchet
parents:
52071
diff
changeset
|
1230 |
in |
bfa28e1cba77
freeze types in Sledgehammer goal, not just terms
blanchet
parents:
52071
diff
changeset
|
1231 |
t |> exists_subterm is_Var t ? freeze |
bfa28e1cba77
freeze types in Sledgehammer goal, not just terms
blanchet
parents:
52071
diff
changeset
|
1232 |
|> exists_type (exists_subtype is_TVar) t |
bfa28e1cba77
freeze types in Sledgehammer goal, not just terms
blanchet
parents:
52071
diff
changeset
|
1233 |
? map_types (map_type_tvar freeze_tvar) |
bfa28e1cba77
freeze types in Sledgehammer goal, not just terms
blanchet
parents:
52071
diff
changeset
|
1234 |
end |
38282
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
1235 |
|
47769
249a940953b0
don't extensionalize formulas for higher-order provers -- Satallax in particular will only expand definitions of the form "constant = ..."
blanchet
parents:
47768
diff
changeset
|
1236 |
fun presimp_prop ctxt type_enc t = |
47713
bd0683000a0f
fix handling of atomizable conjectures without a top-level "Trueprop" (e.g. "x == (y::nat)")
blanchet
parents:
47153
diff
changeset
|
1237 |
let |
bd0683000a0f
fix handling of atomizable conjectures without a top-level "Trueprop" (e.g. "x == (y::nat)")
blanchet
parents:
47153
diff
changeset
|
1238 |
val t = t |> Envir.beta_eta_contract |
bd0683000a0f
fix handling of atomizable conjectures without a top-level "Trueprop" (e.g. "x == (y::nat)")
blanchet
parents:
47153
diff
changeset
|
1239 |
|> transform_elim_prop |
59970 | 1240 |
|> Object_Logic.atomize_term ctxt |
47713
bd0683000a0f
fix handling of atomizable conjectures without a top-level "Trueprop" (e.g. "x == (y::nat)")
blanchet
parents:
47153
diff
changeset
|
1241 |
val need_trueprop = (fastype_of t = @{typ bool}) |
47913
b12e1fa43ad1
eta-reduce definition-like equations for THF provers; Satallax in particular seems to love that
blanchet
parents:
47912
diff
changeset
|
1242 |
val is_ho = is_type_enc_higher_order type_enc |
47713
bd0683000a0f
fix handling of atomizable conjectures without a top-level "Trueprop" (e.g. "x == (y::nat)")
blanchet
parents:
47153
diff
changeset
|
1243 |
in |
bd0683000a0f
fix handling of atomizable conjectures without a top-level "Trueprop" (e.g. "x == (y::nat)")
blanchet
parents:
47153
diff
changeset
|
1244 |
t |> need_trueprop ? HOLogic.mk_Trueprop |
47954
aada9fd08b58
make higher-order goals more first-order via extensionality
blanchet
parents:
47953
diff
changeset
|
1245 |
|> (if is_ho then unextensionalize_def |
59632 | 1246 |
else cong_extensionalize_term ctxt #> abs_extensionalize_term ctxt) |
51717
9e7d1c139569
simplifier uses proper Proof.context instead of historic type simpset;
wenzelm
parents:
51651
diff
changeset
|
1247 |
|> presimplify_term ctxt |
47713
bd0683000a0f
fix handling of atomizable conjectures without a top-level "Trueprop" (e.g. "x == (y::nat)")
blanchet
parents:
47153
diff
changeset
|
1248 |
|> HOLogic.dest_Trueprop |
bd0683000a0f
fix handling of atomizable conjectures without a top-level "Trueprop" (e.g. "x == (y::nat)")
blanchet
parents:
47153
diff
changeset
|
1249 |
end |
bd0683000a0f
fix handling of atomizable conjectures without a top-level "Trueprop" (e.g. "x == (y::nat)")
blanchet
parents:
47153
diff
changeset
|
1250 |
handle TERM _ => @{const True} |
43096 | 1251 |
|
55212 | 1252 |
(* Satallax prefers "=" to "<=>" (for definitions) and Metis (CNF) requires "=" for technical |
1253 |
reasons. *) |
|
47905
9b6afe0eb69c
cleaner handling of bi-implication for THF output of first-order type encodings
blanchet
parents:
47810
diff
changeset
|
1254 |
fun should_use_iff_for_eq CNF _ = false |
9b6afe0eb69c
cleaner handling of bi-implication for THF output of first-order type encodings
blanchet
parents:
47810
diff
changeset
|
1255 |
| should_use_iff_for_eq (THF _) format = not (is_type_enc_higher_order format) |
9b6afe0eb69c
cleaner handling of bi-implication for THF output of first-order type encodings
blanchet
parents:
47810
diff
changeset
|
1256 |
| should_use_iff_for_eq _ _ = true |
9b6afe0eb69c
cleaner handling of bi-implication for THF output of first-order type encodings
blanchet
parents:
47810
diff
changeset
|
1257 |
|
47975
adc977fec17e
order LEO-II/Satallax definitions so that they build on each other (cf. Satallax's THF policy)
blanchet
parents:
47971
diff
changeset
|
1258 |
fun make_formula ctxt format type_enc iff_for_eq name stature role t = |
43096 | 1259 |
let |
47905
9b6afe0eb69c
cleaner handling of bi-implication for THF output of first-order type encodings
blanchet
parents:
47810
diff
changeset
|
1260 |
val iff_for_eq = iff_for_eq andalso should_use_iff_for_eq format type_enc |
45316
08d84bdd5b37
improve handling of bound type variables (esp. for TFF1)
blanchet
parents:
45315
diff
changeset
|
1261 |
val (iformula, atomic_Ts) = |
52031
9a9238342963
tuning -- renamed '_from_' to '_of_' in Sledgehammer
blanchet
parents:
52030
diff
changeset
|
1262 |
iformula_of_prop ctxt type_enc iff_for_eq (SOME (role <> Conjecture)) t [] |
48144 | 1263 |
|>> close_universally add_iterm_vars |
38282
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
1264 |
in |
57263 | 1265 |
{name = name, stature = stature, role = role, iformula = iformula, atomic_types = atomic_Ts} |
38282
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
1266 |
end |
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
1267 |
|
57547
677b07d777c3
don't generate TPTP THF 'Definition's, because they complicate reconstruction for AgsyHOL and Satallax
blanchet
parents:
57541
diff
changeset
|
1268 |
fun make_fact ctxt format type_enc iff_for_eq ((name, stature), t) = |
677b07d777c3
don't generate TPTP THF 'Definition's, because they complicate reconstruction for AgsyHOL and Satallax
blanchet
parents:
57541
diff
changeset
|
1269 |
(case make_formula ctxt format type_enc iff_for_eq name stature Axiom t of |
677b07d777c3
don't generate TPTP THF 'Definition's, because they complicate reconstruction for AgsyHOL and Satallax
blanchet
parents:
57541
diff
changeset
|
1270 |
formula as {iformula = AAtom (IConst ((s, _), _, _)), ...} => |
677b07d777c3
don't generate TPTP THF 'Definition's, because they complicate reconstruction for AgsyHOL and Satallax
blanchet
parents:
57541
diff
changeset
|
1271 |
if s = tptp_true then NONE else SOME formula |
677b07d777c3
don't generate TPTP THF 'Definition's, because they complicate reconstruction for AgsyHOL and Satallax
blanchet
parents:
57541
diff
changeset
|
1272 |
| formula => SOME formula) |
42561
23ddc4e3d19c
have properly type-instantiated helper facts (combinators and If)
blanchet
parents:
42560
diff
changeset
|
1273 |
|
44773
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
1274 |
fun make_conjecture ctxt format type_enc = |
47975
adc977fec17e
order LEO-II/Satallax definitions so that they build on each other (cf. Satallax's THF policy)
blanchet
parents:
47971
diff
changeset
|
1275 |
map (fn ((name, stature), (role, t)) => |
57547
677b07d777c3
don't generate TPTP THF 'Definition's, because they complicate reconstruction for AgsyHOL and Satallax
blanchet
parents:
57541
diff
changeset
|
1276 |
let val t' = t |> role = Conjecture ? s_not in |
677b07d777c3
don't generate TPTP THF 'Definition's, because they complicate reconstruction for AgsyHOL and Satallax
blanchet
parents:
57541
diff
changeset
|
1277 |
make_formula ctxt format type_enc true name stature role t' |
677b07d777c3
don't generate TPTP THF 'Definition's, because they complicate reconstruction for AgsyHOL and Satallax
blanchet
parents:
57541
diff
changeset
|
1278 |
end) |
38282
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
1279 |
|
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
|
1280 |
(** 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
|
1281 |
|
48200
5156cadedfa5
fiddled with "tags_at" a bit -- the only non-tuning part of the change is a slight simplification of the typing axioms
blanchet
parents:
48199
diff
changeset
|
1282 |
fun tvar_footprint thy s ary = |
45511
9b0f8ca4388e
continued implementation of lambda-lifting in Metis
blanchet
parents:
45509
diff
changeset
|
1283 |
(case unprefix_and_unascii const_prefix s of |
54829 | 1284 |
SOME s => |
1285 |
let fun tvars_of T = [] |> Term.add_tvarsT T |> map fst in |
|
1286 |
s |> unmangled_invert_const |> robust_const_type thy |> chop_fun ary |> fst |> map tvars_of |
|
1287 |
end |
|
1288 |
| NONE => []) |
|
44814
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
1289 |
handle TYPE _ => [] |
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
1290 |
|
48200
5156cadedfa5
fiddled with "tags_at" a bit -- the only non-tuning part of the change is a slight simplification of the typing axioms
blanchet
parents:
48199
diff
changeset
|
1291 |
fun type_arg_cover thy pos s ary = |
45948
f88f502d635f
extend previous optimizations to guard-based encodings
blanchet
parents:
45947
diff
changeset
|
1292 |
if is_tptp_equal s then |
48186 | 1293 |
if pos = SOME false then [] else 0 upto ary - 1 |
45948
f88f502d635f
extend previous optimizations to guard-based encodings
blanchet
parents:
45947
diff
changeset
|
1294 |
else |
f88f502d635f
extend previous optimizations to guard-based encodings
blanchet
parents:
45947
diff
changeset
|
1295 |
let |
48200
5156cadedfa5
fiddled with "tags_at" a bit -- the only non-tuning part of the change is a slight simplification of the typing axioms
blanchet
parents:
48199
diff
changeset
|
1296 |
val footprint = tvar_footprint thy s ary |
45948
f88f502d635f
extend previous optimizations to guard-based encodings
blanchet
parents:
45947
diff
changeset
|
1297 |
val eq = (s = @{const_name HOL.eq}) |
48080 | 1298 |
fun cover _ [] = [] |
1299 |
| cover seen ((i, tvars) :: args) = |
|
1300 |
cover (union (op =) seen tvars) args |
|
45948
f88f502d635f
extend previous optimizations to guard-based encodings
blanchet
parents:
45947
diff
changeset
|
1301 |
|> (eq orelse exists (fn tvar => not (member (op =) seen tvar)) tvars) |
f88f502d635f
extend previous optimizations to guard-based encodings
blanchet
parents:
45947
diff
changeset
|
1302 |
? cons i |
f88f502d635f
extend previous optimizations to guard-based encodings
blanchet
parents:
45947
diff
changeset
|
1303 |
in |
f88f502d635f
extend previous optimizations to guard-based encodings
blanchet
parents:
45947
diff
changeset
|
1304 |
if forall null footprint then |
f88f502d635f
extend previous optimizations to guard-based encodings
blanchet
parents:
45947
diff
changeset
|
1305 |
[] |
f88f502d635f
extend previous optimizations to guard-based encodings
blanchet
parents:
45947
diff
changeset
|
1306 |
else |
57481
84bbdbf1b2da
reverted 9512b867259c -- appears to break 'metis'
blanchet
parents:
57470
diff
changeset
|
1307 |
0 upto length footprint - 1 ~~ footprint |
59058
a78612c67ec0
renamed "pairself" to "apply2", in accordance to @{apply 2};
wenzelm
parents:
58477
diff
changeset
|
1308 |
|> sort (rev_order o list_ord Term_Ord.indexname_ord o apply2 snd) |
48080 | 1309 |
|> cover [] |
45948
f88f502d635f
extend previous optimizations to guard-based encodings
blanchet
parents:
45947
diff
changeset
|
1310 |
end |
44814
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
1311 |
|
44399 | 1312 |
type monotonicity_info = |
1313 |
{maybe_finite_Ts : typ list, |
|
1314 |
surely_infinite_Ts : typ list, |
|
1315 |
maybe_nonmono_Ts : typ list} |
|
1316 |
||
44397
06375952f1fa
cleaner handling of polymorphic monotonicity inference
blanchet
parents:
44396
diff
changeset
|
1317 |
(* These types witness that the type classes they belong to allow infinite |
06375952f1fa
cleaner handling of polymorphic monotonicity inference
blanchet
parents:
44396
diff
changeset
|
1318 |
models and hence that any types with these type classes is monotonic. *) |
57396 | 1319 |
val known_infinite_types = [@{typ nat}, HOLogic.intT, HOLogic.realT, @{typ "nat => bool"}] |
44397
06375952f1fa
cleaner handling of polymorphic monotonicity inference
blanchet
parents:
44396
diff
changeset
|
1320 |
|
46301 | 1321 |
fun is_type_kind_of_surely_infinite ctxt strictness cached_Ts T = |
1322 |
strictness <> Strict 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
|
1323 |
|
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
|
1324 |
(* 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
|
1325 |
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
|
1326 |
proofs. On the other hand, all HOL infinite types can be given the same |
50969 | 1327 |
models in first-order logic (via Loewenheim-Skolem). *) |
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
|
1328 |
|
57396 | 1329 |
fun should_encode_type ctxt {maybe_finite_Ts, surely_infinite_Ts, maybe_nonmono_Ts} |
1330 |
(Nonmono_Types (strictness, _)) T = |
|
47150 | 1331 |
let val thy = Proof_Context.theory_of ctxt in |
1332 |
(exists (type_intersect thy T) maybe_nonmono_Ts andalso |
|
1333 |
not (exists (type_instance thy T) surely_infinite_Ts orelse |
|
1334 |
(not (member (type_equiv thy) maybe_finite_Ts T) andalso |
|
57396 | 1335 |
is_type_kind_of_surely_infinite ctxt strictness surely_infinite_Ts T))) |
47150 | 1336 |
end |
57396 | 1337 |
| should_encode_type _ _ level _ = (level = All_Types orelse level = Undercover_Types) |
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
|
1338 |
|
44768 | 1339 |
fun should_guard_type ctxt mono (Guards (_, level)) should_guard_var T = |
44811 | 1340 |
should_guard_var () andalso should_encode_type ctxt mono level T |
44399 | 1341 |
| 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
|
1342 |
|
48200
5156cadedfa5
fiddled with "tags_at" a bit -- the only non-tuning part of the change is a slight simplification of the typing axioms
blanchet
parents:
48199
diff
changeset
|
1343 |
fun is_maybe_universal_name s = |
5156cadedfa5
fiddled with "tags_at" a bit -- the only non-tuning part of the change is a slight simplification of the typing axioms
blanchet
parents:
48199
diff
changeset
|
1344 |
String.isPrefix bound_var_prefix s orelse |
5156cadedfa5
fiddled with "tags_at" a bit -- the only non-tuning part of the change is a slight simplification of the typing axioms
blanchet
parents:
48199
diff
changeset
|
1345 |
String.isPrefix all_bound_var_prefix s |
5156cadedfa5
fiddled with "tags_at" a bit -- the only non-tuning part of the change is a slight simplification of the typing axioms
blanchet
parents:
48199
diff
changeset
|
1346 |
|
5156cadedfa5
fiddled with "tags_at" a bit -- the only non-tuning part of the change is a slight simplification of the typing axioms
blanchet
parents:
48199
diff
changeset
|
1347 |
fun is_maybe_universal_var (IConst ((s, _), _, _)) = is_maybe_universal_name s |
44403
15160cdc4688
precisely distinguish between universal and existential quantifiers, instead of assuming the worst (universal), for monotonicity analysis
blanchet
parents:
44402
diff
changeset
|
1348 |
| 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
|
1349 |
| is_maybe_universal_var _ = false |
42836 | 1350 |
|
45947
7eccf8147f57
treat polymorphic constructors specially in @? encodings
blanchet
parents:
45946
diff
changeset
|
1351 |
datatype site = |
43361
e37b54d429f5
revived the lightweight "poly_tags_{query,bang}" type encodings by fixing their soundness bug
blanchet
parents:
43324
diff
changeset
|
1352 |
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
|
1353 |
Eq_Arg of bool option | |
48146 | 1354 |
Arg of string * int * int | |
43361
e37b54d429f5
revived the lightweight "poly_tags_{query,bang}" type encodings by fixing their soundness bug
blanchet
parents:
43324
diff
changeset
|
1355 |
Elsewhere |
42829
1558741f8a72
started implementing "shallow" type systems, based on ideas by Claessen et al.
blanchet
parents:
42828
diff
changeset
|
1356 |
|
45949
70b9d1e9fddc
killed "guard@?" encodings -- they were found to be unsound
blanchet
parents:
45948
diff
changeset
|
1357 |
fun should_tag_with_type _ _ _ (Top_Level _) _ _ = false |
70b9d1e9fddc
killed "guard@?" encodings -- they were found to be unsound
blanchet
parents:
45948
diff
changeset
|
1358 |
| should_tag_with_type ctxt mono (Tags (_, level)) site u T = |
48146 | 1359 |
let val thy = Proof_Context.theory_of ctxt in |
54829 | 1360 |
(case level of |
48183 | 1361 |
Nonmono_Types (_, Non_Uniform) => |
48146 | 1362 |
(case (site, is_maybe_universal_var u) of |
54829 | 1363 |
(Eq_Arg pos, true) => |
1364 |
(pos <> SOME false orelse tag_neg_vars) andalso should_encode_type ctxt mono level T |
|
1365 |
| _ => false) |
|
48183 | 1366 |
| Undercover_Types => |
1367 |
(case (site, is_maybe_universal_var u) of |
|
54829 | 1368 |
(Eq_Arg pos, true) => pos <> SOME false |
1369 |
| (Arg (s, j, ary), true) => member (op =) (type_arg_cover thy NONE s ary) j |
|
1370 |
| _ => false) |
|
1371 |
| _ => should_encode_type ctxt mono level T) |
|
48146 | 1372 |
end |
45949
70b9d1e9fddc
killed "guard@?" encodings -- they were found to be unsound
blanchet
parents:
45948
diff
changeset
|
1373 |
| 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
|
1374 |
|
44594
ae82943481e9
added type abstractions (for declaring polymorphic constants) to TFF syntax
blanchet
parents:
44593
diff
changeset
|
1375 |
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
|
1376 |
let |
44399 | 1377 |
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
|
1378 |
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
|
1379 |
| fuse ary (Type (@{type_name fun}, [T1, T2])) = |
ae82943481e9
added type abstractions (for declaring polymorphic constants) to TFF syntax
blanchet
parents:
44593
diff
changeset
|
1380 |
fuse 0 T1 --> fuse (ary - 1) T2 |
ae82943481e9
added type abstractions (for declaring polymorphic constants) to TFF syntax
blanchet
parents:
44593
diff
changeset
|
1381 |
| fuse _ _ = raise Fail "expected function type" |
ae82943481e9
added type abstractions (for declaring polymorphic constants) to TFF syntax
blanchet
parents:
44593
diff
changeset
|
1382 |
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
|
1383 |
|
44450
d848dd7b21f4
fixed "hBOOL" of existential variables, and generate more helpers
blanchet
parents:
44418
diff
changeset
|
1384 |
(** predicators and application operators **) |
41313
a96ac4d180b7
optionally supply constant weights to E -- turned off by default until properly parameterized
blanchet
parents:
41211
diff
changeset
|
1385 |
|
42574 | 1386 |
type sym_info = |
44829
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1387 |
{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
|
1388 |
in_conj : bool} |
42563 | 1389 |
|
44829
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1390 |
fun default_sym_tab_entries type_enc = |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1391 |
(make_fixed_const NONE @{const_name undefined}, |
54829 | 1392 |
{pred_sym = false, min_ary = 0, max_ary = 0, types = [], in_conj = false}) :: |
44829
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1393 |
([tptp_false, tptp_true] |
54829 | 1394 |
|> map (rpair {pred_sym = true, min_ary = 0, max_ary = 0, types = [], in_conj = false})) @ |
44829
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1395 |
([tptp_equal, tptp_old_equal] |
54829 | 1396 |
|> map (rpair {pred_sym = true, min_ary = 2, max_ary = 2, types = [], in_conj = false})) |
44829
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1397 |
|> not (is_type_enc_higher_order type_enc) |
54829 | 1398 |
? cons (prefixed_predicator_name, |
1399 |
{pred_sym = true, min_ary = 1, max_ary = 1, types = [], in_conj = false}) |
|
44829
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1400 |
|
47073
c73f7b0c7ebc
generate weights and precedences for predicates as well
blanchet
parents:
47046
diff
changeset
|
1401 |
datatype app_op_level = |
c73f7b0c7ebc
generate weights and precedences for predicates as well
blanchet
parents:
47046
diff
changeset
|
1402 |
Min_App_Op | |
c73f7b0c7ebc
generate weights and precedences for predicates as well
blanchet
parents:
47046
diff
changeset
|
1403 |
Sufficient_App_Op | |
c73f7b0c7ebc
generate weights and precedences for predicates as well
blanchet
parents:
47046
diff
changeset
|
1404 |
Sufficient_App_Op_And_Predicator | |
c73f7b0c7ebc
generate weights and precedences for predicates as well
blanchet
parents:
47046
diff
changeset
|
1405 |
Full_App_Op_And_Predicator |
46389 | 1406 |
|
47932
ce4178e037a7
get ready for automatic generation of extensionality helpers
blanchet
parents:
47925
diff
changeset
|
1407 |
fun add_iterm_syms_to_sym_table ctxt app_op_level conj_fact = |
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
|
1408 |
let |
46642
37a055f37224
general solution to the arity bug that occasionally plagues Sledgehammer -- short story, lots of things go kaputt when a polymorphic symbol's arity in the translation is higher than the arity of the fully polymorphic HOL constant
blanchet
parents:
46639
diff
changeset
|
1409 |
val thy = Proof_Context.theory_of ctxt |
44772 | 1410 |
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
|
1411 |
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
|
1412 |
fun iter ary T = |
54829 | 1413 |
if ary = max_ary orelse type_instance thy var_T T orelse type_instance thy T var_T then |
43210
7384b771805d
made "explicit_apply"'s smart mode (more) complete
blanchet
parents:
43207
diff
changeset
|
1414 |
ary |
7384b771805d
made "explicit_apply"'s smart mode (more) complete
blanchet
parents:
43207
diff
changeset
|
1415 |
else |
7384b771805d
made "explicit_apply"'s smart mode (more) complete
blanchet
parents:
43207
diff
changeset
|
1416 |
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
|
1417 |
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
|
1418 |
fun add_universal_var T (accum as ((bool_vars, fun_var_Ts), sym_tab)) = |
47073
c73f7b0c7ebc
generate weights and precedences for predicates as well
blanchet
parents:
47046
diff
changeset
|
1419 |
if (app_op_level = Sufficient_App_Op andalso can dest_funT T) orelse |
c73f7b0c7ebc
generate weights and precedences for predicates as well
blanchet
parents:
47046
diff
changeset
|
1420 |
(app_op_level = Sufficient_App_Op_And_Predicator andalso |
c73f7b0c7ebc
generate weights and precedences for predicates as well
blanchet
parents:
47046
diff
changeset
|
1421 |
(can dest_funT T orelse T = @{typ bool})) then |
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
|
1422 |
let |
47073
c73f7b0c7ebc
generate weights and precedences for predicates as well
blanchet
parents:
47046
diff
changeset
|
1423 |
val bool_vars' = |
c73f7b0c7ebc
generate weights and precedences for predicates as well
blanchet
parents:
47046
diff
changeset
|
1424 |
bool_vars orelse |
54829 | 1425 |
(app_op_level = Sufficient_App_Op_And_Predicator andalso body_type T = @{typ bool}) |
44829
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1426 |
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
|
1427 |
{pred_sym = pred_sym andalso not bool_vars', |
44772 | 1428 |
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
|
1429 |
max_ary = max_ary, types = types, in_conj = in_conj} |
54829 | 1430 |
val fun_var_Ts' = fun_var_Ts |> can dest_funT T ? insert_type thy I T |
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
|
1431 |
in |
57533 | 1432 |
if bool_vars' = bool_vars andalso fun_var_Ts' = fun_var_Ts then accum |
54829 | 1433 |
else ((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
|
1434 |
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
|
1435 |
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
|
1436 |
accum |
54829 | 1437 |
fun add_iterm_syms top_level tm (accum as ((bool_vars, fun_var_Ts), sym_tab)) = |
47932
ce4178e037a7
get ready for automatic generation of extensionality helpers
blanchet
parents:
47925
diff
changeset
|
1438 |
let val (head, args) = strip_iterm_comb tm in |
ce4178e037a7
get ready for automatic generation of extensionality helpers
blanchet
parents:
47925
diff
changeset
|
1439 |
(case head of |
54829 | 1440 |
IConst ((s, _), T, _) => |
1441 |
if is_maybe_universal_name s then |
|
1442 |
add_universal_var T accum |
|
1443 |
else if String.isPrefix exist_bound_var_prefix s then |
|
1444 |
accum |
|
1445 |
else |
|
1446 |
let val ary = length args in |
|
1447 |
((bool_vars, fun_var_Ts), |
|
1448 |
(case Symtab.lookup sym_tab s of |
|
1449 |
SOME {pred_sym, min_ary, max_ary, types, in_conj} => |
|
1450 |
let |
|
1451 |
val pred_sym = pred_sym andalso top_level andalso not bool_vars |
|
1452 |
val types' = types |> insert_type thy I T |
|
1453 |
val in_conj = in_conj orelse conj_fact |
|
1454 |
val min_ary = |
|
1455 |
if (app_op_level = Sufficient_App_Op orelse |
|
1456 |
app_op_level = Sufficient_App_Op_And_Predicator) |
|
57533 | 1457 |
andalso types' <> types then |
54829 | 1458 |
fold (consider_var_ary T) fun_var_Ts min_ary |
1459 |
else |
|
1460 |
min_ary |
|
1461 |
in |
|
1462 |
Symtab.update (s, {pred_sym = pred_sym, min_ary = Int.min (ary, min_ary), |
|
1463 |
max_ary = Int.max (ary, max_ary), types = types', in_conj = in_conj}) sym_tab |
|
1464 |
end |
|
1465 |
| NONE => |
|
1466 |
let |
|
1467 |
val max_ary = |
|
1468 |
(case unprefix_and_unascii const_prefix s of |
|
1469 |
SOME s => |
|
1470 |
(if String.isSubstring uncurried_alias_sep s then |
|
1471 |
ary |
|
1472 |
else |
|
1473 |
(case try (ary_of o robust_const_type thy o unmangled_invert_const) s of |
|
1474 |
SOME ary0 => Int.min (ary0, ary) |
|
1475 |
| NONE => ary)) |
|
1476 |
| NONE => ary) |
|
1477 |
val pred_sym = top_level andalso max_ary = ary andalso not bool_vars |
|
1478 |
val min_ary = |
|
1479 |
(case app_op_level of |
|
1480 |
Min_App_Op => max_ary |
|
1481 |
| Full_App_Op_And_Predicator => 0 |
|
1482 |
| _ => fold (consider_var_ary T) fun_var_Ts max_ary) |
|
1483 |
in |
|
1484 |
Symtab.update_new (s, {pred_sym = pred_sym, min_ary = min_ary, max_ary = max_ary, |
|
1485 |
types = [T], in_conj = conj_fact}) sym_tab |
|
1486 |
end)) |
|
1487 |
end |
|
1488 |
| IVar (_, T) => add_universal_var T accum |
|
1489 |
| IAbs ((_, T), tm) => accum |> add_universal_var T |> add_iterm_syms false tm |
|
1490 |
| _ => accum) |
|
47932
ce4178e037a7
get ready for automatic generation of extensionality helpers
blanchet
parents:
47925
diff
changeset
|
1491 |
|> fold (add_iterm_syms false) args |
ce4178e037a7
get ready for automatic generation of extensionality helpers
blanchet
parents:
47925
diff
changeset
|
1492 |
end |
ce4178e037a7
get ready for automatic generation of extensionality helpers
blanchet
parents:
47925
diff
changeset
|
1493 |
in add_iterm_syms end |
ce4178e037a7
get ready for automatic generation of extensionality helpers
blanchet
parents:
47925
diff
changeset
|
1494 |
|
51998
f732a674db1b
renamed Sledgehammer functions with 'for' in their names to 'of'
blanchet
parents:
51921
diff
changeset
|
1495 |
fun sym_table_of_facts ctxt type_enc app_op_level conjs facts = |
47932
ce4178e037a7
get ready for automatic generation of extensionality helpers
blanchet
parents:
47925
diff
changeset
|
1496 |
let |
54829 | 1497 |
fun add_iterm_syms conj_fact = add_iterm_syms_to_sym_table ctxt app_op_level conj_fact true |
1498 |
fun add_fact_syms conj_fact = ifact_lift (formula_fold NONE (K (add_iterm_syms conj_fact))) |
|
44829
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1499 |
in |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1500 |
((false, []), Symtab.empty) |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1501 |
|> fold (add_fact_syms true) conjs |
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1502 |
|> fold (add_fact_syms false) facts |
47932
ce4178e037a7
get ready for automatic generation of extensionality helpers
blanchet
parents:
47925
diff
changeset
|
1503 |
||> fold Symtab.update (default_sym_tab_entries type_enc) |
44829
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
1504 |
end |
38282
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
1505 |
|
44772 | 1506 |
fun min_ary_of sym_tab s = |
54829 | 1507 |
(case Symtab.lookup sym_tab s of |
42574 | 1508 |
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
|
1509 |
| NONE => |
54829 | 1510 |
(case unprefix_and_unascii const_prefix s of |
42547
b5eec0c99528
fixed arity of special constants if "explicit_apply" is set
blanchet
parents:
42546
diff
changeset
|
1511 |
SOME s => |
51920
16f3b9d4e515
proper unmangling -- the bug is visible when "uncurried_aliases" is enabled with Alt-Ergo or Poly. SPASS
blanchet
parents:
51717
diff
changeset
|
1512 |
let val s = s |> unmangled_invert_const in |
42966
4e2d6c1e5392
more work on parsing LEO-II proofs without lambdas
blanchet
parents:
42963
diff
changeset
|
1513 |
if s = predicator_name then 1 |
4e2d6c1e5392
more work on parsing LEO-II proofs without lambdas
blanchet
parents:
42963
diff
changeset
|
1514 |
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
|
1515 |
else if s = type_guard_name then 1 |
42557
ae0deb39a254
fixed min-arity computation when "explicit_apply" is specified
blanchet
parents:
42556
diff
changeset
|
1516 |
else 0 |
42547
b5eec0c99528
fixed arity of special constants if "explicit_apply" is set
blanchet
parents:
42546
diff
changeset
|
1517 |
end |
54829 | 1518 |
| NONE => 0)) |
38282
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
1519 |
|
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
1520 |
(* 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
|
1521 |
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
|
1522 |
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
|
1523 |
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
|
1524 |
fun is_pred_sym sym_tab s = |
54829 | 1525 |
(case Symtab.lookup sym_tab s of |
1526 |
SOME ({pred_sym, min_ary, max_ary, ...} : sym_info) => pred_sym andalso min_ary = max_ary |
|
1527 |
| NONE => false) |
|
38282
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
1528 |
|
61329
426c9c858099
added "!=" (disequality) as a TPTP binary operator, since it pops up in LEO-II proofs
blanchet
parents:
60924
diff
changeset
|
1529 |
val fTrue_iconst = IConst ((const_prefix ^ "fTrue", @{const_name fTrue}), @{typ bool}, []) |
54829 | 1530 |
val predicator_iconst = 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
|
1531 |
|
48143 | 1532 |
fun predicatify completish tm = |
62718 | 1533 |
if completish > 0 then |
54829 | 1534 |
IApp (IApp (IConst (`I tptp_equal, @{typ "bool => bool => bool"}, []), tm), fTrue_iconst) |
47946
33afcfad3f8d
add an experimental "aggressive" mode to Sledgehammer, to experiment with more complete translations of higher-order features without breaking "metis"
blanchet
parents:
47944
diff
changeset
|
1535 |
else |
33afcfad3f8d
add an experimental "aggressive" mode to Sledgehammer, to experiment with more complete translations of higher-order features without breaking "metis"
blanchet
parents:
47944
diff
changeset
|
1536 |
IApp (predicator_iconst, tm) |
33afcfad3f8d
add an experimental "aggressive" mode to Sledgehammer, to experiment with more complete translations of higher-order features without breaking "metis"
blanchet
parents:
47944
diff
changeset
|
1537 |
|
33afcfad3f8d
add an experimental "aggressive" mode to Sledgehammer, to experiment with more complete translations of higher-order features without breaking "metis"
blanchet
parents:
47944
diff
changeset
|
1538 |
val app_op = `(make_fixed_const NONE) app_op_name |
33afcfad3f8d
add an experimental "aggressive" mode to Sledgehammer, to experiment with more complete translations of higher-order features without breaking "metis"
blanchet
parents:
47944
diff
changeset
|
1539 |
|
43859 | 1540 |
fun list_app head args = fold (curry (IApp o swap)) args head |
42544
75cb06eee990
reimplemented the hAPP introduction code so that it's done earlier, when the types are still available
blanchet
parents:
42543
diff
changeset
|
1541 |
|
47768
0b2b7ff31867
don't use the native choice operator if the type encoding isn't higher-order
blanchet
parents:
47767
diff
changeset
|
1542 |
fun mk_app_op type_enc head arg = |
42544
75cb06eee990
reimplemented the hAPP introduction code so that it's done earlier, when the types are still available
blanchet
parents:
42543
diff
changeset
|
1543 |
let |
46392
676a4b4b6e73
implemented partial application aliases (for SPASS mainly)
blanchet
parents:
46389
diff
changeset
|
1544 |
val head_T = ityp_of head |
676a4b4b6e73
implemented partial application aliases (for SPASS mainly)
blanchet
parents:
46389
diff
changeset
|
1545 |
val (arg_T, res_T) = dest_funT head_T |
676a4b4b6e73
implemented partial application aliases (for SPASS mainly)
blanchet
parents:
46389
diff
changeset
|
1546 |
val app = |
676a4b4b6e73
implemented partial application aliases (for SPASS mainly)
blanchet
parents:
46389
diff
changeset
|
1547 |
IConst (app_op, head_T --> head_T, [arg_T, res_T]) |
47768
0b2b7ff31867
don't use the native choice operator if the type encoding isn't higher-order
blanchet
parents:
47767
diff
changeset
|
1548 |
|> mangle_type_args_in_iterm type_enc |
46392
676a4b4b6e73
implemented partial application aliases (for SPASS mainly)
blanchet
parents:
46389
diff
changeset
|
1549 |
in list_app app [head, arg] end |
676a4b4b6e73
implemented partial application aliases (for SPASS mainly)
blanchet
parents:
46389
diff
changeset
|
1550 |
|
52038
a354c83dee43
properly handle SPASS constructors w.r.t. partially applied functions
blanchet
parents:
52035
diff
changeset
|
1551 |
fun firstorderize_fact thy ctrss type_enc uncurried_aliases completish sym_tab = |
46392
676a4b4b6e73
implemented partial application aliases (for SPASS mainly)
blanchet
parents:
46389
diff
changeset
|
1552 |
let |
47768
0b2b7ff31867
don't use the native choice operator if the type encoding isn't higher-order
blanchet
parents:
47767
diff
changeset
|
1553 |
fun do_app arg head = mk_app_op type_enc head arg |
51921
bbbacaef19a6
avoid polymorphic uncurried aliases with more arguments than there are arguments in the most general type of a HOL constant, to dodge issues at declaration time
blanchet
parents:
51920
diff
changeset
|
1554 |
fun list_app_ops (head, args) = fold do_app args head |
44773
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
1555 |
fun introduce_app_ops tm = |
46392
676a4b4b6e73
implemented partial application aliases (for SPASS mainly)
blanchet
parents:
46389
diff
changeset
|
1556 |
let val (head, args) = tm |> strip_iterm_comb ||> map introduce_app_ops in |
54829 | 1557 |
(case head of |
46392
676a4b4b6e73
implemented partial application aliases (for SPASS mainly)
blanchet
parents:
46389
diff
changeset
|
1558 |
IConst (name as (s, _), T, T_args) => |
51921
bbbacaef19a6
avoid polymorphic uncurried aliases with more arguments than there are arguments in the most general type of a HOL constant, to dodge issues at declaration time
blanchet
parents:
51920
diff
changeset
|
1559 |
let |
bbbacaef19a6
avoid polymorphic uncurried aliases with more arguments than there are arguments in the most general type of a HOL constant, to dodge issues at declaration time
blanchet
parents:
51920
diff
changeset
|
1560 |
val min_ary = min_ary_of sym_tab s |
bbbacaef19a6
avoid polymorphic uncurried aliases with more arguments than there are arguments in the most general type of a HOL constant, to dodge issues at declaration time
blanchet
parents:
51920
diff
changeset
|
1561 |
val ary = |
bbbacaef19a6
avoid polymorphic uncurried aliases with more arguments than there are arguments in the most general type of a HOL constant, to dodge issues at declaration time
blanchet
parents:
51920
diff
changeset
|
1562 |
if uncurried_aliases andalso String.isPrefix const_prefix s then |
bbbacaef19a6
avoid polymorphic uncurried aliases with more arguments than there are arguments in the most general type of a HOL constant, to dodge issues at declaration time
blanchet
parents:
51920
diff
changeset
|
1563 |
let |
bbbacaef19a6
avoid polymorphic uncurried aliases with more arguments than there are arguments in the most general type of a HOL constant, to dodge issues at declaration time
blanchet
parents:
51920
diff
changeset
|
1564 |
val ary = length args |
bbbacaef19a6
avoid polymorphic uncurried aliases with more arguments than there are arguments in the most general type of a HOL constant, to dodge issues at declaration time
blanchet
parents:
51920
diff
changeset
|
1565 |
(* In polymorphic native type encodings, it is impossible to |
52038
a354c83dee43
properly handle SPASS constructors w.r.t. partially applied functions
blanchet
parents:
52035
diff
changeset
|
1566 |
declare a fully polymorphic symbol that takes more |
a354c83dee43
properly handle SPASS constructors w.r.t. partially applied functions
blanchet
parents:
52035
diff
changeset
|
1567 |
arguments than its signature (even though such concrete |
a354c83dee43
properly handle SPASS constructors w.r.t. partially applied functions
blanchet
parents:
52035
diff
changeset
|
1568 |
instances, where a type variable is instantiated by a |
a354c83dee43
properly handle SPASS constructors w.r.t. partially applied functions
blanchet
parents:
52035
diff
changeset
|
1569 |
function type, are possible.) *) |
51921
bbbacaef19a6
avoid polymorphic uncurried aliases with more arguments than there are arguments in the most general type of a HOL constant, to dodge issues at declaration time
blanchet
parents:
51920
diff
changeset
|
1570 |
val official_ary = |
bbbacaef19a6
avoid polymorphic uncurried aliases with more arguments than there are arguments in the most general type of a HOL constant, to dodge issues at declaration time
blanchet
parents:
51920
diff
changeset
|
1571 |
if is_type_enc_polymorphic type_enc then |
54829 | 1572 |
(case unprefix_and_unascii const_prefix s of |
51921
bbbacaef19a6
avoid polymorphic uncurried aliases with more arguments than there are arguments in the most general type of a HOL constant, to dodge issues at declaration time
blanchet
parents:
51920
diff
changeset
|
1573 |
SOME s' => |
54829 | 1574 |
(case try (ary_of o robust_const_type thy) (invert_const s') of |
1575 |
SOME ary => ary |
|
1576 |
| NONE => min_ary) |
|
1577 |
| NONE => min_ary) |
|
51921
bbbacaef19a6
avoid polymorphic uncurried aliases with more arguments than there are arguments in the most general type of a HOL constant, to dodge issues at declaration time
blanchet
parents:
51920
diff
changeset
|
1578 |
else |
bbbacaef19a6
avoid polymorphic uncurried aliases with more arguments than there are arguments in the most general type of a HOL constant, to dodge issues at declaration time
blanchet
parents:
51920
diff
changeset
|
1579 |
1000000000 (* irrealistically big arity *) |
bbbacaef19a6
avoid polymorphic uncurried aliases with more arguments than there are arguments in the most general type of a HOL constant, to dodge issues at declaration time
blanchet
parents:
51920
diff
changeset
|
1580 |
in Int.min (ary, official_ary) end |
bbbacaef19a6
avoid polymorphic uncurried aliases with more arguments than there are arguments in the most general type of a HOL constant, to dodge issues at declaration time
blanchet
parents:
51920
diff
changeset
|
1581 |
else |
bbbacaef19a6
avoid polymorphic uncurried aliases with more arguments than there are arguments in the most general type of a HOL constant, to dodge issues at declaration time
blanchet
parents:
51920
diff
changeset
|
1582 |
min_ary |
bbbacaef19a6
avoid polymorphic uncurried aliases with more arguments than there are arguments in the most general type of a HOL constant, to dodge issues at declaration time
blanchet
parents:
51920
diff
changeset
|
1583 |
val head = |
54829 | 1584 |
if ary = min_ary then head else IConst (aliased_uncurried ary name, T, T_args) |
51921
bbbacaef19a6
avoid polymorphic uncurried aliases with more arguments than there are arguments in the most general type of a HOL constant, to dodge issues at declaration time
blanchet
parents:
51920
diff
changeset
|
1585 |
in |
bbbacaef19a6
avoid polymorphic uncurried aliases with more arguments than there are arguments in the most general type of a HOL constant, to dodge issues at declaration time
blanchet
parents:
51920
diff
changeset
|
1586 |
args |> chop ary |>> list_app head |> list_app_ops |
bbbacaef19a6
avoid polymorphic uncurried aliases with more arguments than there are arguments in the most general type of a HOL constant, to dodge issues at declaration time
blanchet
parents:
51920
diff
changeset
|
1587 |
end |
54829 | 1588 |
| _ => list_app_ops (head, args)) |
46392
676a4b4b6e73
implemented partial application aliases (for SPASS mainly)
blanchet
parents:
46389
diff
changeset
|
1589 |
end |
44773
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
1590 |
fun introduce_predicators tm = |
54829 | 1591 |
(case strip_iterm_comb tm of |
44773
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
1592 |
(IConst ((s, _), _, _), _) => |
48143 | 1593 |
if is_pred_sym sym_tab s then tm else predicatify completish tm |
54829 | 1594 |
| _ => predicatify completish tm) |
44773
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
1595 |
val do_iterm = |
54829 | 1596 |
not (is_type_enc_higher_order type_enc) ? (introduce_app_ops #> introduce_predicators) |
52028 | 1597 |
#> filter_type_args_in_iterm thy ctrss type_enc |
44773
e701dabbfe37
perform mangling before computing symbol arity, to avoid needless "hAPP"s and "hBOOL"s
blanchet
parents:
44772
diff
changeset
|
1598 |
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
|
1599 |
|
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 |
(** 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
|
1601 |
|
44450
d848dd7b21f4
fixed "hBOOL" of existential variables, and generate more helpers
blanchet
parents:
44418
diff
changeset
|
1602 |
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
|
1603 |
val ftrue = @{lemma "fTrue" by (unfold fTrue_def) fast} |
d848dd7b21f4
fixed "hBOOL" of existential variables, and generate more helpers
blanchet
parents:
44418
diff
changeset
|
1604 |
|
43194 | 1605 |
(* The Boolean indicates that a fairly sound type encoding is needed. *) |
47946
33afcfad3f8d
add an experimental "aggressive" mode to Sledgehammer, to experiment with more complete translations of higher-order features without breaking "metis"
blanchet
parents:
47944
diff
changeset
|
1606 |
val base_helper_table = |
48438
3e45c98fe127
distinguish between recursive and nonrecursive definitions + clean up typedef dependencies in MaSh
blanchet
parents:
48324
diff
changeset
|
1607 |
[(("COMBI", false), [(Non_Rec_Def, @{thm Meson.COMBI_def})]), |
3e45c98fe127
distinguish between recursive and nonrecursive definitions + clean up typedef dependencies in MaSh
blanchet
parents:
48324
diff
changeset
|
1608 |
(("COMBK", false), [(Non_Rec_Def, @{thm Meson.COMBK_def})]), |
3e45c98fe127
distinguish between recursive and nonrecursive definitions + clean up typedef dependencies in MaSh
blanchet
parents:
48324
diff
changeset
|
1609 |
(("COMBB", false), [(Non_Rec_Def, @{thm Meson.COMBB_def})]), |
3e45c98fe127
distinguish between recursive and nonrecursive definitions + clean up typedef dependencies in MaSh
blanchet
parents:
48324
diff
changeset
|
1610 |
(("COMBC", false), [(Non_Rec_Def, @{thm Meson.COMBC_def})]), |
3e45c98fe127
distinguish between recursive and nonrecursive definitions + clean up typedef dependencies in MaSh
blanchet
parents:
48324
diff
changeset
|
1611 |
(("COMBS", false), [(Non_Rec_Def, @{thm Meson.COMBS_def})]), |
47946
33afcfad3f8d
add an experimental "aggressive" mode to Sledgehammer, to experiment with more complete translations of higher-order features without breaking "metis"
blanchet
parents:
47944
diff
changeset
|
1612 |
((predicator_name, false), [(General, not_ffalse), (General, ftrue)]), |
33afcfad3f8d
add an experimental "aggressive" mode to Sledgehammer, to experiment with more complete translations of higher-order features without breaking "metis"
blanchet
parents:
47944
diff
changeset
|
1613 |
(("fFalse", false), [(General, not_ffalse)]), |
33afcfad3f8d
add an experimental "aggressive" mode to Sledgehammer, to experiment with more complete translations of higher-order features without breaking "metis"
blanchet
parents:
47944
diff
changeset
|
1614 |
(("fFalse", true), [(General, @{thm True_or_False})]), |
33afcfad3f8d
add an experimental "aggressive" mode to Sledgehammer, to experiment with more complete translations of higher-order features without breaking "metis"
blanchet
parents:
47944
diff
changeset
|
1615 |
(("fTrue", false), [(General, ftrue)]), |
33afcfad3f8d
add an experimental "aggressive" mode to Sledgehammer, to experiment with more complete translations of higher-order features without breaking "metis"
blanchet
parents:
47944
diff
changeset
|
1616 |
(("fTrue", true), [(General, @{thm True_or_False})]), |
33afcfad3f8d
add an experimental "aggressive" mode to Sledgehammer, to experiment with more complete translations of higher-order features without breaking "metis"
blanchet
parents:
47944
diff
changeset
|
1617 |
(("If", true), |
48438
3e45c98fe127
distinguish between recursive and nonrecursive definitions + clean up typedef dependencies in MaSh
blanchet
parents:
48324
diff
changeset
|
1618 |
[(Non_Rec_Def, @{thm if_True}), (Non_Rec_Def, @{thm if_False}), |
47946
33afcfad3f8d
add an experimental "aggressive" mode to Sledgehammer, to experiment with more complete translations of higher-order features without breaking "metis"
blanchet
parents:
47944
diff
changeset
|
1619 |
(General, @{thm True_or_False})])] |
33afcfad3f8d
add an experimental "aggressive" mode to Sledgehammer, to experiment with more complete translations of higher-order features without breaking "metis"
blanchet
parents:
47944
diff
changeset
|
1620 |
|
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
1621 |
val helper_table = |
47946
33afcfad3f8d
add an experimental "aggressive" mode to Sledgehammer, to experiment with more complete translations of higher-order features without breaking "metis"
blanchet
parents:
47944
diff
changeset
|
1622 |
base_helper_table @ |
33afcfad3f8d
add an experimental "aggressive" mode to Sledgehammer, to experiment with more complete translations of higher-order features without breaking "metis"
blanchet
parents:
47944
diff
changeset
|
1623 |
[(("fNot", false), |
43194 | 1624 |
@{thms fNot_def [THEN Meson.iff_to_disjD, THEN conjunct1] |
47946
33afcfad3f8d
add an experimental "aggressive" mode to Sledgehammer, to experiment with more complete translations of higher-order features without breaking "metis"
blanchet
parents:
47944
diff
changeset
|
1625 |
fNot_def [THEN Meson.iff_to_disjD, THEN conjunct2]} |
48438
3e45c98fe127
distinguish between recursive and nonrecursive definitions + clean up typedef dependencies in MaSh
blanchet
parents:
48324
diff
changeset
|
1626 |
|> map (pair Non_Rec_Def)), |
43194 | 1627 |
(("fconj", false), |
54829 | 1628 |
@{lemma "~ P | ~ Q | fconj P Q" "~ fconj P Q | P" "~ fconj P Q | Q" by (unfold fconj_def) fast+} |
47946
33afcfad3f8d
add an experimental "aggressive" mode to Sledgehammer, to experiment with more complete translations of higher-order features without breaking "metis"
blanchet
parents:
47944
diff
changeset
|
1629 |
|> map (pair General)), |
43194 | 1630 |
(("fdisj", false), |
54829 | 1631 |
@{lemma "~ P | fdisj P Q" "~ Q | fdisj P Q" "~ fdisj P Q | P | Q" by (unfold fdisj_def) fast+} |
47946
33afcfad3f8d
add an experimental "aggressive" mode to Sledgehammer, to experiment with more complete translations of higher-order features without breaking "metis"
blanchet
parents:
47944
diff
changeset
|
1632 |
|> map (pair General)), |
43194 | 1633 |
(("fimplies", false), |
43210
7384b771805d
made "explicit_apply"'s smart mode (more) complete
blanchet
parents:
43207
diff
changeset
|
1634 |
@{lemma "P | fimplies P Q" "~ Q | fimplies P Q" "~ fimplies P Q | ~ P | Q" |
47946
33afcfad3f8d
add an experimental "aggressive" mode to Sledgehammer, to experiment with more complete translations of higher-order features without breaking "metis"
blanchet
parents:
47944
diff
changeset
|
1635 |
by (unfold fimplies_def) fast+} |
33afcfad3f8d
add an experimental "aggressive" mode to Sledgehammer, to experiment with more complete translations of higher-order features without breaking "metis"
blanchet
parents:
47944
diff
changeset
|
1636 |
|> map (pair General)), |
43678 | 1637 |
(("fequal", true), |
1638 |
(* This is a lie: Higher-order equality doesn't need a sound type encoding. |
|
1639 |
However, this is done so for backward compatibility: Including the |
|
1640 |
equality helpers by default in Metis breaks a few existing proofs. *) |
|
1641 |
@{thms fequal_def [THEN Meson.iff_to_disjD, THEN conjunct1] |
|
47946
33afcfad3f8d
add an experimental "aggressive" mode to Sledgehammer, to experiment with more complete translations of higher-order features without breaking "metis"
blanchet
parents:
47944
diff
changeset
|
1642 |
fequal_def [THEN Meson.iff_to_disjD, THEN conjunct2]} |
33afcfad3f8d
add an experimental "aggressive" mode to Sledgehammer, to experiment with more complete translations of higher-order features without breaking "metis"
blanchet
parents:
47944
diff
changeset
|
1643 |
|> map (pair General)), |
44003 | 1644 |
(* Partial characterization of "fAll" and "fEx". A complete characterization |
1645 |
would require the axiom of choice for replay with Metis. *) |
|
54829 | 1646 |
(("fAll", false), [(General, @{lemma "~ fAll P | P x" by (auto simp: fAll_def)})]), |
1647 |
(("fEx", false), [(General, @{lemma "~ P x | fEx P" by (auto simp: fEx_def)})])] |
|
47946
33afcfad3f8d
add an experimental "aggressive" mode to Sledgehammer, to experiment with more complete translations of higher-order features without breaking "metis"
blanchet
parents:
47944
diff
changeset
|
1648 |
|> map (apsnd (map (apsnd zero_var_indexes))) |
33afcfad3f8d
add an experimental "aggressive" mode to Sledgehammer, to experiment with more complete translations of higher-order features without breaking "metis"
blanchet
parents:
47944
diff
changeset
|
1649 |
|
48143 | 1650 |
val completish_helper_table = |
52071 | 1651 |
helper_table @ |
47946
33afcfad3f8d
add an experimental "aggressive" mode to Sledgehammer, to experiment with more complete translations of higher-order features without breaking "metis"
blanchet
parents:
47944
diff
changeset
|
1652 |
[((predicator_name, true), |
33afcfad3f8d
add an experimental "aggressive" mode to Sledgehammer, to experiment with more complete translations of higher-order features without breaking "metis"
blanchet
parents:
47944
diff
changeset
|
1653 |
@{thms True_or_False fTrue_ne_fFalse} |> map (pair General)), |
33afcfad3f8d
add an experimental "aggressive" mode to Sledgehammer, to experiment with more complete translations of higher-order features without breaking "metis"
blanchet
parents:
47944
diff
changeset
|
1654 |
((app_op_name, true), |
61940 | 1655 |
[(General, @{lemma "\<exists>x. \<not> f x = g x \<or> f = g" by blast}), |
1656 |
(General, @{lemma "\<exists>p. (p x \<longleftrightarrow> p y) \<longrightarrow> x = y" by blast})]), |
|
54829 | 1657 |
(("fconj", false), @{thms fconj_table fconj_laws fdisj_laws} |> map (pair Non_Rec_Def)), |
1658 |
(("fdisj", false), @{thms fdisj_table fconj_laws fdisj_laws} |> map (pair Non_Rec_Def)), |
|
47946
33afcfad3f8d
add an experimental "aggressive" mode to Sledgehammer, to experiment with more complete translations of higher-order features without breaking "metis"
blanchet
parents:
47944
diff
changeset
|
1659 |
(("fimplies", false), |
33afcfad3f8d
add an experimental "aggressive" mode to Sledgehammer, to experiment with more complete translations of higher-order features without breaking "metis"
blanchet
parents:
47944
diff
changeset
|
1660 |
@{thms fimplies_table fconj_laws fdisj_laws fimplies_laws} |
48438
3e45c98fe127
distinguish between recursive and nonrecursive definitions + clean up typedef dependencies in MaSh
blanchet
parents:
48324
diff
changeset
|
1661 |
|> map (pair Non_Rec_Def)), |
47946
33afcfad3f8d
add an experimental "aggressive" mode to Sledgehammer, to experiment with more complete translations of higher-order features without breaking "metis"
blanchet
parents:
47944
diff
changeset
|
1662 |
(("fequal", false), |
48438
3e45c98fe127
distinguish between recursive and nonrecursive definitions + clean up typedef dependencies in MaSh
blanchet
parents:
48324
diff
changeset
|
1663 |
(@{thms fequal_table} |> map (pair Non_Rec_Def)) @ |
47946
33afcfad3f8d
add an experimental "aggressive" mode to Sledgehammer, to experiment with more complete translations of higher-order features without breaking "metis"
blanchet
parents:
47944
diff
changeset
|
1664 |
(@{thms fequal_laws} |> map (pair General))), |
54829 | 1665 |
(("fAll", false), @{thms fAll_table fComp_law fAll_law fEx_law} |> map (pair Non_Rec_Def)), |
1666 |
(("fEx", false), @{thms fEx_table fComp_law fAll_law fEx_law} |> map (pair Non_Rec_Def))] |
|
47946
33afcfad3f8d
add an experimental "aggressive" mode to Sledgehammer, to experiment with more complete translations of higher-order features without breaking "metis"
blanchet
parents:
47944
diff
changeset
|
1667 |
|> map (apsnd (map (apsnd zero_var_indexes))) |
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
1668 |
|
45920 | 1669 |
fun bound_tvars type_enc sorts Ts = |
54798 | 1670 |
(case filter is_TVar Ts of |
48133
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
1671 |
[] => I |
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
1672 |
| Ts => |
54798 | 1673 |
((sorts andalso polymorphism_of_type_enc type_enc <> Type_Class_Polymorphic) |
1674 |
? mk_ahorn (Ts |
|
1675 |
|> class_membs_of_types type_enc add_sorts_on_tvar |
|
1676 |
|> map (class_atom type_enc))) |
|
48139
b755096701ec
generate type classes for polymorphic DFG format (SPASS)
blanchet
parents:
48138
diff
changeset
|
1677 |
#> (case type_enc of |
62218
42202671777c
avoid generating polymorphic SPASS constructs to monomorphic SPASS
blanchet
parents:
62126
diff
changeset
|
1678 |
Native (_, Type_Class_Polymorphic, _) => |
54798 | 1679 |
mk_atyquant AForall (map (fn TVar (z as (_, S)) => |
62218
42202671777c
avoid generating polymorphic SPASS constructs to monomorphic SPASS
blanchet
parents:
62126
diff
changeset
|
1680 |
(AType ((tvar_name z, []), []), map (`make_class) (normalize_classes S) )) Ts) |
42202671777c
avoid generating polymorphic SPASS constructs to monomorphic SPASS
blanchet
parents:
62126
diff
changeset
|
1681 |
| Native (_, Raw_Polymorphic _, _) => |
42202671777c
avoid generating polymorphic SPASS constructs to monomorphic SPASS
blanchet
parents:
62126
diff
changeset
|
1682 |
mk_atyquant AForall (map (fn TVar (z as (_, S)) => (AType ((tvar_name z, []), []), [])) Ts) |
42202671777c
avoid generating polymorphic SPASS constructs to monomorphic SPASS
blanchet
parents:
62126
diff
changeset
|
1683 |
| _ => mk_aquant AForall (map (fn TVar z => (tvar_name z, NONE)) Ts))) |
44404
3111af540141
tuning, plus started implementing tag equation generation for existential variables
blanchet
parents:
44403
diff
changeset
|
1684 |
|
46392
676a4b4b6e73
implemented partial application aliases (for SPASS mainly)
blanchet
parents:
46389
diff
changeset
|
1685 |
fun eq_formula type_enc atomic_Ts bounds pred_sym tm1 tm2 = |
44404
3111af540141
tuning, plus started implementing tag equation generation for existential variables
blanchet
parents:
44403
diff
changeset
|
1686 |
(if pred_sym then AConn (AIff, [AAtom tm1, AAtom tm2]) |
48132
9aa0fad4e864
added type arguments to "ATerm" constructor -- but don't use them yet
blanchet
parents:
48131
diff
changeset
|
1687 |
else AAtom (ATerm ((`I tptp_equal, []), [tm1, tm2]))) |
46392
676a4b4b6e73
implemented partial application aliases (for SPASS mainly)
blanchet
parents:
46389
diff
changeset
|
1688 |
|> mk_aquant AForall bounds |
45377 | 1689 |
|> close_formula_universally |
45920 | 1690 |
|> bound_tvars type_enc true atomic_Ts |
44404
3111af540141
tuning, plus started implementing tag equation generation for existential variables
blanchet
parents:
44403
diff
changeset
|
1691 |
|
46406 | 1692 |
val helper_rank = default_rank |
1693 |
val min_rank = 9 * helper_rank div 10 |
|
1694 |
val max_rank = 4 * min_rank |
|
1695 |
||
1696 |
fun rank_of_fact_num n j = min_rank + (max_rank - min_rank) * j div n |
|
1697 |
||
44495 | 1698 |
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
|
1699 |
|
47946
33afcfad3f8d
add an experimental "aggressive" mode to Sledgehammer, to experiment with more complete translations of higher-order features without breaking "metis"
blanchet
parents:
47944
diff
changeset
|
1700 |
fun could_specialize_helpers type_enc = |
54829 | 1701 |
not (is_type_enc_polymorphic type_enc) andalso level_of_type_enc type_enc <> No_Types |
52071 | 1702 |
|
47946
33afcfad3f8d
add an experimental "aggressive" mode to Sledgehammer, to experiment with more complete translations of higher-order features without breaking "metis"
blanchet
parents:
47944
diff
changeset
|
1703 |
fun should_specialize_helper type_enc t = |
54829 | 1704 |
could_specialize_helpers type_enc andalso 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
|
1705 |
|
56636
bb8b37480d3f
declare 'bool' and its proxies as a datatype for SPASS-Pirate
blanchet
parents:
56254
diff
changeset
|
1706 |
fun add_helper_facts_of_sym ctxt format type_enc completish (s, {types, ...} : sym_info) = |
54829 | 1707 |
(case unprefix_and_unascii const_prefix s of |
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
|
1708 |
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
|
1709 |
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
|
1710 |
val thy = Proof_Context.theory_of ctxt |
46392
676a4b4b6e73
implemented partial application aliases (for SPASS mainly)
blanchet
parents:
46389
diff
changeset
|
1711 |
val unmangled_s = mangled_s |> unmangled_const_name |> hd |
48089 | 1712 |
fun dub needs_sound j k = |
47946
33afcfad3f8d
add an experimental "aggressive" mode to Sledgehammer, to experiment with more complete translations of higher-order features without breaking "metis"
blanchet
parents:
47944
diff
changeset
|
1713 |
ascii_of unmangled_s ^ "_" ^ string_of_int j ^ "_" ^ string_of_int k ^ |
46339
6268c5b3efdc
generate left-to-right rewrite tag for combinator helpers for SPASS 3.8
blanchet
parents:
46338
diff
changeset
|
1714 |
(if mangled_s = unmangled_s then "" else "_" ^ ascii_of mangled_s) ^ |
48089 | 1715 |
(if needs_sound then typed_helper_suffix else untyped_helper_suffix) |
47932
ce4178e037a7
get ready for automatic generation of extensionality helpers
blanchet
parents:
47925
diff
changeset
|
1716 |
fun specialize_helper t T = |
ce4178e037a7
get ready for automatic generation of extensionality helpers
blanchet
parents:
47925
diff
changeset
|
1717 |
if unmangled_s = app_op_name then |
54829 | 1718 |
let val tyenv = Sign.typ_match thy (alpha_to_beta, domain_type T) Vartab.empty in |
61770 | 1719 |
Envir.subst_term_types tyenv t |
54829 | 1720 |
end |
47932
ce4178e037a7
get ready for automatic generation of extensionality helpers
blanchet
parents:
47925
diff
changeset
|
1721 |
else |
ce4178e037a7
get ready for automatic generation of extensionality helpers
blanchet
parents:
47925
diff
changeset
|
1722 |
specialize_type thy (invert_const unmangled_s, T) t |
48089 | 1723 |
fun dub_and_inst needs_sound ((status, t), j) = |
47932
ce4178e037a7
get ready for automatic generation of extensionality helpers
blanchet
parents:
47925
diff
changeset
|
1724 |
(if should_specialize_helper type_enc t then |
47946
33afcfad3f8d
add an experimental "aggressive" mode to Sledgehammer, to experiment with more complete translations of higher-order features without breaking "metis"
blanchet
parents:
47944
diff
changeset
|
1725 |
map_filter (try (specialize_helper t)) types |
47932
ce4178e037a7
get ready for automatic generation of extensionality helpers
blanchet
parents:
47925
diff
changeset
|
1726 |
else |
ce4178e037a7
get ready for automatic generation of extensionality helpers
blanchet
parents:
47925
diff
changeset
|
1727 |
[t]) |
46339
6268c5b3efdc
generate left-to-right rewrite tag for combinator helpers for SPASS 3.8
blanchet
parents:
46338
diff
changeset
|
1728 |
|> tag_list 1 |
48089 | 1729 |
|> map (fn (k, t) => ((dub needs_sound j k, (Global, status)), t)) |
43860
57ef3cd4126e
more refactoring of preprocessing, so as to be able to centralize it
blanchet
parents:
43859
diff
changeset
|
1730 |
val make_facts = map_filter (make_fact ctxt format type_enc false) |
48089 | 1731 |
val sound = is_type_enc_sound type_enc |
47946
33afcfad3f8d
add an experimental "aggressive" mode to Sledgehammer, to experiment with more complete translations of higher-order features without breaking "metis"
blanchet
parents:
47944
diff
changeset
|
1732 |
val could_specialize = could_specialize_helpers 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
|
1733 |
in |
48089 | 1734 |
fold (fn ((helper_s, needs_sound), ths) => |
1735 |
if (needs_sound andalso not sound) orelse |
|
47946
33afcfad3f8d
add an experimental "aggressive" mode to Sledgehammer, to experiment with more complete translations of higher-order features without breaking "metis"
blanchet
parents:
47944
diff
changeset
|
1736 |
(helper_s <> unmangled_s andalso |
62718 | 1737 |
(completish < 2 orelse could_specialize)) then |
47810 | 1738 |
I |
1739 |
else |
|
1740 |
ths ~~ (1 upto length ths) |
|
59582 | 1741 |
|> maps (dub_and_inst needs_sound o apfst (apsnd Thm.prop_of)) |
47810 | 1742 |
|> make_facts |
59058
a78612c67ec0
renamed "pairself" to "apply2", in accordance to @{apply 2};
wenzelm
parents:
58477
diff
changeset
|
1743 |
|> union (op = o apply2 #iformula)) |
62718 | 1744 |
(if completish >= 2 then completish_helper_table else helper_table) |
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
|
1745 |
end |
54829 | 1746 |
| NONE => I) |
51998
f732a674db1b
renamed Sledgehammer functions with 'for' in their names to 'of'
blanchet
parents:
51921
diff
changeset
|
1747 |
fun helper_facts_of_sym_table ctxt format type_enc completish sym_tab = |
56636
bb8b37480d3f
declare 'bool' and its proxies as a datatype for SPASS-Pirate
blanchet
parents:
56254
diff
changeset
|
1748 |
Symtab.fold_rev (add_helper_facts_of_sym ctxt format type_enc completish) sym_tab [] |
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
|
1749 |
|
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
1750 |
(***************************************************************) |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
1751 |
(* 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
|
1752 |
(***************************************************************) |
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
1753 |
|
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
1754 |
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
|
1755 |
|
48142
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
1756 |
fun add_classes (cls, cset) = List.foldl set_insert cset (flat cls) |
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
1757 |
|
43093 | 1758 |
fun classes_of_terms get_Ts = |
43121 | 1759 |
map (map snd o get_Ts) |
48142
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
1760 |
#> List.foldl add_classes Symtab.empty #> Symtab.delete_safe class_of_types |
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
1761 |
#> Symtab.keys |
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
1762 |
|
44121 | 1763 |
val tfree_classes_of_terms = classes_of_terms Misc_Legacy.term_tfrees |
1764 |
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
|
1765 |
|
52026 | 1766 |
fun fold_type_ctrs f (Type (s, Ts)) x = fold (fold_type_ctrs f) Ts (f (s, x)) |
1767 |
| fold_type_ctrs _ _ x = x |
|
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
1768 |
|
43907
073ab5379842
pass type arguments to lambda-lifted Frees, to account for polymorphism
blanchet
parents:
43906
diff
changeset
|
1769 |
(* 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
|
1770 |
needed. *) |
52026 | 1771 |
fun add_type_ctrs_in_term thy = |
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
1772 |
let |
43188
0c36ae874fcc
fixed detection of Skolem constants in type construction detection code
blanchet
parents:
43185
diff
changeset
|
1773 |
fun add (Const (@{const_name Meson.skolem}, _) $ _) = I |
43181 | 1774 |
| 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
|
1775 |
| add (Const x) = |
52026 | 1776 |
x |> robust_const_type_args thy |> fold (fold_type_ctrs set_insert) |
43181 | 1777 |
| add (Abs (_, _, u)) = add u |
1778 |
| add _ = I |
|
1779 |
in add end |
|
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
1780 |
|
52026 | 1781 |
fun type_ctrs_of_terms thy ts = |
1782 |
Symtab.keys (fold (add_type_ctrs_in_term thy) ts Symtab.empty) |
|
43085
0a2f5b86bdd7
first step in sharing more code between ATP and Metis translation
blanchet
parents:
43064
diff
changeset
|
1783 |
|
52031
9a9238342963
tuning -- renamed '_from_' to '_of_' in Sledgehammer
blanchet
parents:
52030
diff
changeset
|
1784 |
fun trans_lams_of_string ctxt type_enc lam_trans = |
45514 | 1785 |
if lam_trans = no_lamsN then |
1786 |
rpair [] |
|
1787 |
else if lam_trans = hide_lamsN then |
|
1788 |
lift_lams ctxt type_enc ##> K [] |
|
46365 | 1789 |
else if lam_trans = liftingN orelse lam_trans = lam_liftingN then |
45514 | 1790 |
lift_lams ctxt type_enc |
46365 | 1791 |
else if lam_trans = combsN then |
45514 | 1792 |
map (introduce_combinators ctxt) #> rpair [] |
46365 | 1793 |
else if lam_trans = combs_and_liftingN then |
1794 |
lift_lams_part_1 ctxt type_enc |
|
1795 |
##> maps (fn t => [t, introduce_combinators ctxt (intentionalize_def t)]) |
|
46818
2a28e66e2e4c
ensure no abstractions leak through after lambda-lifting (for formulas with higher-order occurrences of quantifiers)
blanchet
parents:
46711
diff
changeset
|
1796 |
#> lift_lams_part_2 ctxt |
46368 | 1797 |
else if lam_trans = combs_or_liftingN then |
45554
09ad83de849c
don't pass "lam_lifted" option to "metis" unless there's a good reason
blanchet
parents:
45551
diff
changeset
|
1798 |
lift_lams_part_1 ctxt type_enc |
54829 | 1799 |
##> map (fn t => (case head_of (strip_qnt_body @{const_name All} t) of |
46368 | 1800 |
@{term "op =::bool => bool => bool"} => t |
54829 | 1801 |
| _ => introduce_combinators ctxt (intentionalize_def t))) |
46818
2a28e66e2e4c
ensure no abstractions leak through after lambda-lifting (for formulas with higher-order occurrences of quantifiers)
blanchet
parents:
46711
diff
changeset
|
1802 |
#> lift_lams_part_2 ctxt |
45514 | 1803 |
else if lam_trans = keep_lamsN then |
1804 |
map (Envir.eta_contract) #> rpair [] |
|
1805 |
else |
|
45519
cd6e78cb6ee8
make metis reconstruction handling more flexible
blanchet
parents:
45516
diff
changeset
|
1806 |
error ("Unknown lambda translation scheme: " ^ quote lam_trans ^ ".") |
45514 | 1807 |
|
47981 | 1808 |
val pull_and_reorder_definitions = |
47975
adc977fec17e
order LEO-II/Satallax definitions so that they build on each other (cf. Satallax's THF policy)
blanchet
parents:
47971
diff
changeset
|
1809 |
let |
adc977fec17e
order LEO-II/Satallax definitions so that they build on each other (cf. Satallax's THF policy)
blanchet
parents:
47971
diff
changeset
|
1810 |
fun add_consts (IApp (t, u)) = fold add_consts [t, u] |
adc977fec17e
order LEO-II/Satallax definitions so that they build on each other (cf. Satallax's THF policy)
blanchet
parents:
47971
diff
changeset
|
1811 |
| add_consts (IAbs (_, t)) = add_consts t |
adc977fec17e
order LEO-II/Satallax definitions so that they build on each other (cf. Satallax's THF policy)
blanchet
parents:
47971
diff
changeset
|
1812 |
| add_consts (IConst (name, _, _)) = insert (op =) name |
adc977fec17e
order LEO-II/Satallax definitions so that they build on each other (cf. Satallax's THF policy)
blanchet
parents:
47971
diff
changeset
|
1813 |
| add_consts (IVar _) = I |
47981 | 1814 |
fun consts_of_hs l_or_r ({iformula, ...} : ifact) = |
54829 | 1815 |
(case iformula of |
47975
adc977fec17e
order LEO-II/Satallax definitions so that they build on each other (cf. Satallax's THF policy)
blanchet
parents:
47971
diff
changeset
|
1816 |
AAtom (IApp (IApp (IConst _, t), u)) => add_consts (l_or_r (t, u)) [] |
54829 | 1817 |
| _ => []) |
47975
adc977fec17e
order LEO-II/Satallax definitions so that they build on each other (cf. Satallax's THF policy)
blanchet
parents:
47971
diff
changeset
|
1818 |
(* Quadratic, but usually OK. *) |
47981 | 1819 |
fun reorder [] [] = [] |
1820 |
| reorder (fact :: skipped) [] = |
|
1821 |
fact :: reorder [] skipped (* break cycle *) |
|
1822 |
| reorder skipped (fact :: facts) = |
|
47975
adc977fec17e
order LEO-II/Satallax definitions so that they build on each other (cf. Satallax's THF policy)
blanchet
parents:
47971
diff
changeset
|
1823 |
let val rhs_consts = consts_of_hs snd fact in |
48096
60a09522c65e
prevent an "Empty" exception (e.g. with Satallax, "mono_native")
blanchet
parents:
48095
diff
changeset
|
1824 |
if exists (exists (exists (member (op =) rhs_consts) |
60a09522c65e
prevent an "Empty" exception (e.g. with Satallax, "mono_native")
blanchet
parents:
48095
diff
changeset
|
1825 |
o consts_of_hs fst)) [skipped, facts] then |
47981 | 1826 |
reorder (fact :: skipped) facts |
47975
adc977fec17e
order LEO-II/Satallax definitions so that they build on each other (cf. Satallax's THF policy)
blanchet
parents:
47971
diff
changeset
|
1827 |
else |
47981 | 1828 |
fact :: reorder [] (facts @ skipped) |
47975
adc977fec17e
order LEO-II/Satallax definitions so that they build on each other (cf. Satallax's THF policy)
blanchet
parents:
47971
diff
changeset
|
1829 |
end |
47981 | 1830 |
in List.partition (curry (op =) Definition o #role) #>> reorder [] #> op @ end |
47975
adc977fec17e
order LEO-II/Satallax definitions so that they build on each other (cf. Satallax's THF policy)
blanchet
parents:
47971
diff
changeset
|
1831 |
|
54768
ee0881a54c72
fixed confusion between 'prop' and 'bool' introduced in 4960647932ec
blanchet
parents:
54757
diff
changeset
|
1832 |
fun s_not_prop (@{const Trueprop} $ t) = @{const Trueprop} $ s_not t |
56245 | 1833 |
| s_not_prop (@{const Pure.imp} $ t $ @{prop False}) = t |
1834 |
| s_not_prop t = @{const Pure.imp} $ t $ @{prop False} |
|
54768
ee0881a54c72
fixed confusion between 'prop' and 'bool' introduced in 4960647932ec
blanchet
parents:
54757
diff
changeset
|
1835 |
|
57541 | 1836 |
fun translate_formulas ctxt prem_role format type_enc lam_trans presimp 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
|
1837 |
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
|
1838 |
val thy = Proof_Context.theory_of ctxt |
52031
9a9238342963
tuning -- renamed '_from_' to '_of_' in Sledgehammer
blanchet
parents:
52030
diff
changeset
|
1839 |
val trans_lams = trans_lams_of_string ctxt type_enc lam_trans |
43861 | 1840 |
val fact_ts = facts |> map snd |
54829 | 1841 |
(* Remove existing facts from the conjecture, as this can dramatically boost an ATP's |
1842 |
performance (for some reason). *) |
|
1843 |
val hyp_ts = hyp_ts |> map (fn t => if member (op aconv) fact_ts t then @{prop True} else t) |
|
62126
2d187ace2827
avoid generating TFF1 or polymorphic DFG constructs in Vampire or SPASS problems for goals containing schematic type variables
blanchet
parents:
61940
diff
changeset
|
1844 |
|
2d187ace2827
avoid generating TFF1 or polymorphic DFG constructs in Vampire or SPASS problems for goals containing schematic type variables
blanchet
parents:
61940
diff
changeset
|
1845 |
val hyp_ts = map freeze_term hyp_ts; |
2d187ace2827
avoid generating TFF1 or polymorphic DFG constructs in Vampire or SPASS problems for goals containing schematic type variables
blanchet
parents:
61940
diff
changeset
|
1846 |
val concl_t = freeze_term concl_t; |
2d187ace2827
avoid generating TFF1 or polymorphic DFG constructs in Vampire or SPASS problems for goals containing schematic type variables
blanchet
parents:
61940
diff
changeset
|
1847 |
|
43864
58a7b3fdc193
fixed lambda-liftg: must ensure the formulas are in close form
blanchet
parents:
43863
diff
changeset
|
1848 |
val facts = facts |> map (apsnd (pair Axiom)) |
58a7b3fdc193
fixed lambda-liftg: must ensure the formulas are in close form
blanchet
parents:
43863
diff
changeset
|
1849 |
val conjs = |
47975
adc977fec17e
order LEO-II/Satallax definitions so that they build on each other (cf. Satallax's THF policy)
blanchet
parents:
47971
diff
changeset
|
1850 |
map (pair prem_role) hyp_ts @ [(Conjecture, s_not_prop concl_t)] |
57481
84bbdbf1b2da
reverted 9512b867259c -- appears to break 'metis'
blanchet
parents:
57470
diff
changeset
|
1851 |
|> map2 (pair o rpair (Local, General) o string_of_int) (0 upto length hyp_ts) |
45554
09ad83de849c
don't pass "lam_lifted" option to "metis" unless there's a good reason
blanchet
parents:
45551
diff
changeset
|
1852 |
val ((conjs, facts), lam_facts) = |
45511
9b0f8ca4388e
continued implementation of lambda-lifting in Metis
blanchet
parents:
45509
diff
changeset
|
1853 |
(conjs, facts) |
59058
a78612c67ec0
renamed "pairself" to "apply2", in accordance to @{apply 2};
wenzelm
parents:
58477
diff
changeset
|
1854 |
|> presimp ? apply2 (map (apsnd (apsnd (presimp_prop ctxt type_enc)))) |
45514 | 1855 |
|> (if lam_trans = no_lamsN then |
45511
9b0f8ca4388e
continued implementation of lambda-lifting in Metis
blanchet
parents:
45509
diff
changeset
|
1856 |
rpair [] |
9b0f8ca4388e
continued implementation of lambda-lifting in Metis
blanchet
parents:
45509
diff
changeset
|
1857 |
else |
9b0f8ca4388e
continued implementation of lambda-lifting in Metis
blanchet
parents:
45509
diff
changeset
|
1858 |
op @ |
45514 | 1859 |
#> preprocess_abstractions_in_terms trans_lams |
45511
9b0f8ca4388e
continued implementation of lambda-lifting in Metis
blanchet
parents:
45509
diff
changeset
|
1860 |
#>> chop (length conjs)) |
47981 | 1861 |
val conjs = |
1862 |
conjs |> make_conjecture ctxt format type_enc |
|
1863 |
|> pull_and_reorder_definitions |
|
1864 |
val facts = |
|
57263 | 1865 |
facts |> map_filter (fn (name, (_, t)) => make_fact ctxt format type_enc true (name, t)) |
47981 | 1866 |
|> pull_and_reorder_definitions |
57541 | 1867 |
val lifted = lam_facts |> map (extract_lambda_def dest_Const o snd o snd) |
54829 | 1868 |
val lam_facts = lam_facts |> map_filter (make_fact ctxt format type_enc true o apsnd snd) |
43861 | 1869 |
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
|
1870 |
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
|
1871 |
val supers = tvar_classes_of_terms all_ts |
52026 | 1872 |
val tycons = type_ctrs_of_terms thy all_ts |
48142
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
1873 |
val (supers, tcon_clauses) = |
43626
a867ebb12209
renamed "type_sys" to "type_enc", which is more accurate
blanchet
parents:
43624
diff
changeset
|
1874 |
if level_of_type_enc type_enc = No_Types then ([], []) |
48142
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
1875 |
else make_tcon_clauses thy tycons supers |
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
1876 |
val subclass_pairs = make_subclass_pairs 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
|
1877 |
in |
57263 | 1878 |
(union (op =) subs supers, conjs, facts @ lam_facts, subclass_pairs, tcon_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
|
1879 |
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
|
1880 |
|
44495 | 1881 |
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
|
1882 |
|
47768
0b2b7ff31867
don't use the native choice operator if the type encoding isn't higher-order
blanchet
parents:
47767
diff
changeset
|
1883 |
fun type_guard_iterm type_enc T tm = |
44396
66b9b3fcd608
started cleaning up polymorphic monotonicity-based encodings, based on discussions with Nick Smallbone
blanchet
parents:
44394
diff
changeset
|
1884 |
IApp (IConst (type_guard, T --> @{typ bool}, [T]) |
47768
0b2b7ff31867
don't use the native choice operator if the type encoding isn't higher-order
blanchet
parents:
47767
diff
changeset
|
1885 |
|> mangle_type_args_in_iterm 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
|
1886 |
|
43421 | 1887 |
fun is_var_positively_naked_in_term _ (SOME false) _ accum = accum |
48132
9aa0fad4e864
added type arguments to "ATerm" constructor -- but don't use them yet
blanchet
parents:
48131
diff
changeset
|
1888 |
| is_var_positively_naked_in_term name _ (ATerm (((s, _), _), tms)) accum = |
54829 | 1889 |
accum orelse (is_tptp_equal s andalso member (op =) tms (ATerm ((name, []), []))) |
43692 | 1890 |
| 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
|
1891 |
|
48186 | 1892 |
fun is_var_undercover_in_term thy name pos tm accum = |
1893 |
accum orelse |
|
44811 | 1894 |
let |
48132
9aa0fad4e864
added type arguments to "ATerm" constructor -- but don't use them yet
blanchet
parents:
48131
diff
changeset
|
1895 |
val var = ATerm ((name, []), []) |
48095 | 1896 |
fun is_undercover (ATerm (_, [])) = false |
48132
9aa0fad4e864
added type arguments to "ATerm" constructor -- but don't use them yet
blanchet
parents:
48131
diff
changeset
|
1897 |
| is_undercover (ATerm (((s, _), _), tms)) = |
45948
f88f502d635f
extend previous optimizations to guard-based encodings
blanchet
parents:
45947
diff
changeset
|
1898 |
let |
f88f502d635f
extend previous optimizations to guard-based encodings
blanchet
parents:
45947
diff
changeset
|
1899 |
val ary = length tms |
48200
5156cadedfa5
fiddled with "tags_at" a bit -- the only non-tuning part of the change is a slight simplification of the typing axioms
blanchet
parents:
48199
diff
changeset
|
1900 |
val cover = type_arg_cover thy pos s ary |
45948
f88f502d635f
extend previous optimizations to guard-based encodings
blanchet
parents:
45947
diff
changeset
|
1901 |
in |
48087
94835838ed2c
removed micro-optimization whose justification I can't recall
blanchet
parents:
48081
diff
changeset
|
1902 |
exists (fn (j, tm) => tm = var andalso member (op =) cover j) |
57481
84bbdbf1b2da
reverted 9512b867259c -- appears to break 'metis'
blanchet
parents:
57470
diff
changeset
|
1903 |
(0 upto ary - 1 ~~ tms) orelse |
48095 | 1904 |
exists is_undercover tms |
45948
f88f502d635f
extend previous optimizations to guard-based encodings
blanchet
parents:
45947
diff
changeset
|
1905 |
end |
48095 | 1906 |
| is_undercover _ = true |
1907 |
in is_undercover tm end |
|
44811 | 1908 |
|
48087
94835838ed2c
removed micro-optimization whose justification I can't recall
blanchet
parents:
48081
diff
changeset
|
1909 |
fun should_guard_var_in_formula thy level pos phi (SOME true) name = |
48183 | 1910 |
(case level of |
54829 | 1911 |
All_Types => true |
1912 |
| Undercover_Types => formula_fold pos (is_var_undercover_in_term thy name) phi false |
|
1913 |
| Nonmono_Types (_, Uniform) => true |
|
1914 |
| Nonmono_Types (_, Non_Uniform) => |
|
1915 |
formula_fold pos (is_var_positively_naked_in_term name) phi false |
|
1916 |
| _ => false) |
|
48087
94835838ed2c
removed micro-optimization whose justification I can't recall
blanchet
parents:
48081
diff
changeset
|
1917 |
| should_guard_var_in_formula _ _ _ _ _ _ = true |
45948
f88f502d635f
extend previous optimizations to guard-based encodings
blanchet
parents:
45947
diff
changeset
|
1918 |
|
48087
94835838ed2c
removed micro-optimization whose justification I can't recall
blanchet
parents:
48081
diff
changeset
|
1919 |
fun always_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
|
1920 |
|
44405
6fe1a89bb69a
generate tag equations for existential variables
blanchet
parents:
44404
diff
changeset
|
1921 |
fun should_generate_tag_bound_decl _ _ _ (SOME true) _ = false |
44768 | 1922 |
| should_generate_tag_bound_decl ctxt mono (Tags (_, level)) _ T = |
57396 | 1923 |
not (is_type_level_uniform level) andalso should_encode_type ctxt mono level T |
44405
6fe1a89bb69a
generate tag equations for existential variables
blanchet
parents:
44404
diff
changeset
|
1924 |
| should_generate_tag_bound_decl _ _ _ _ _ = false |
44404
3111af540141
tuning, plus started implementing tag equation generation for existential variables
blanchet
parents:
44403
diff
changeset
|
1925 |
|
47768
0b2b7ff31867
don't use the native choice operator if the type encoding isn't higher-order
blanchet
parents:
47767
diff
changeset
|
1926 |
fun mk_aterm type_enc name T_args args = |
48133
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
1927 |
let val (ty_args, tm_args) = process_type_args type_enc T_args in |
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
1928 |
ATerm ((name, ty_args), tm_args @ args) |
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
1929 |
end |
42994
fe291ab75eb5
towards supporting non-simply-typed encodings for TFF and THF (for orthogonality and experiments)
blanchet
parents:
42966
diff
changeset
|
1930 |
|
47768
0b2b7ff31867
don't use the native choice operator if the type encoding isn't higher-order
blanchet
parents:
47767
diff
changeset
|
1931 |
fun do_bound_type ctxt mono type_enc = |
54820 | 1932 |
(case type_enc of |
47767 | 1933 |
Native (_, _, level) => |
54820 | 1934 |
fused_type ctxt mono level 0 #> native_atp_type_of_typ type_enc false 0 #> SOME |
1935 |
| _ => K NONE) |
|
46392
676a4b4b6e73
implemented partial application aliases (for SPASS mainly)
blanchet
parents:
46389
diff
changeset
|
1936 |
|
47768
0b2b7ff31867
don't use the native choice operator if the type encoding isn't higher-order
blanchet
parents:
47767
diff
changeset
|
1937 |
fun tag_with_type ctxt mono type_enc pos T tm = |
43859 | 1938 |
IConst (type_tag, T --> T, [T]) |
47768
0b2b7ff31867
don't use the native choice operator if the type encoding isn't higher-order
blanchet
parents:
47767
diff
changeset
|
1939 |
|> mangle_type_args_in_iterm type_enc |
53586
bd5fa6425993
prefixed types and some functions with "atp_" for disambiguation
blanchet
parents:
52995
diff
changeset
|
1940 |
|> atp_term_of_iterm ctxt mono type_enc pos |
48132
9aa0fad4e864
added type arguments to "ATerm" constructor -- but don't use them yet
blanchet
parents:
48131
diff
changeset
|
1941 |
|> (fn ATerm ((s, tys), tms) => ATerm ((s, tys), tms @ [tm]) |
43692 | 1942 |
| _ => raise Fail "unexpected lambda-abstraction") |
53586
bd5fa6425993
prefixed types and some functions with "atp_" for disambiguation
blanchet
parents:
52995
diff
changeset
|
1943 |
and atp_term_of_iterm ctxt mono type_enc pos = |
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
|
1944 |
let |
45949
70b9d1e9fddc
killed "guard@?" encodings -- they were found to be unsound
blanchet
parents:
45948
diff
changeset
|
1945 |
fun term site u = |
42962
3b50fdeb6cfc
started adding support for THF output (but no lambdas)
blanchet
parents:
42956
diff
changeset
|
1946 |
let |
43859 | 1947 |
val (head, args) = strip_iterm_comb u |
54829 | 1948 |
val pos = (case site of Top_Level pos => pos | Eq_Arg pos => pos | _ => NONE) |
48200
5156cadedfa5
fiddled with "tags_at" a bit -- the only non-tuning part of the change is a slight simplification of the typing axioms
blanchet
parents:
48199
diff
changeset
|
1949 |
val T = ityp_of u |
43677 | 1950 |
val t = |
54829 | 1951 |
(case head of |
43859 | 1952 |
IConst (name as (s, _), _, T_args) => |
47153
4d4f2721b3ef
fixed eta-extension of higher-order quantifiers in THF output
blanchet
parents:
47151
diff
changeset
|
1953 |
let |
48146 | 1954 |
val ary = length args |
54829 | 1955 |
fun arg_site j = if is_tptp_equal s then Eq_Arg pos else Arg (s, j, ary) |
48146 | 1956 |
in |
57481
84bbdbf1b2da
reverted 9512b867259c -- appears to break 'metis'
blanchet
parents:
57470
diff
changeset
|
1957 |
map2 (fn j => term (arg_site j)) (0 upto ary - 1) args |
48146 | 1958 |
|> mk_aterm type_enc name T_args |
1959 |
end |
|
43859 | 1960 |
| IVar (name, _) => |
47768
0b2b7ff31867
don't use the native choice operator if the type encoding isn't higher-order
blanchet
parents:
47767
diff
changeset
|
1961 |
map (term Elsewhere) args |> mk_aterm type_enc name [] |
43859 | 1962 |
| IAbs ((name, T), tm) => |
46818
2a28e66e2e4c
ensure no abstractions leak through after lambda-lifting (for formulas with higher-order occurrences of quantifiers)
blanchet
parents:
46711
diff
changeset
|
1963 |
if is_type_enc_higher_order type_enc then |
54820 | 1964 |
AAbs (((name, native_atp_type_of_typ type_enc true 0 T), (* FIXME? why "true"? *) |
47911
2168126446bb
extend ATP data structure to avoid having to perform ((non-)capture avoiding) beta reduction -- fixes a bug in the THF translation of "is_measure.simps"
blanchet
parents:
47905
diff
changeset
|
1965 |
term Elsewhere tm), map (term Elsewhere) args) |
46818
2a28e66e2e4c
ensure no abstractions leak through after lambda-lifting (for formulas with higher-order occurrences of quantifiers)
blanchet
parents:
46711
diff
changeset
|
1966 |
else |
2a28e66e2e4c
ensure no abstractions leak through after lambda-lifting (for formulas with higher-order occurrences of quantifiers)
blanchet
parents:
46711
diff
changeset
|
1967 |
raise Fail "unexpected lambda-abstraction" |
54829 | 1968 |
| IApp _ => raise Fail "impossible \"IApp\"") |
48200
5156cadedfa5
fiddled with "tags_at" a bit -- the only non-tuning part of the change is a slight simplification of the typing axioms
blanchet
parents:
48199
diff
changeset
|
1969 |
val tag = should_tag_with_type ctxt mono type_enc site u T |
5156cadedfa5
fiddled with "tags_at" a bit -- the only non-tuning part of the change is a slight simplification of the typing axioms
blanchet
parents:
48199
diff
changeset
|
1970 |
in t |> tag ? tag_with_type ctxt mono type_enc pos T end |
47911
2168126446bb
extend ATP data structure to avoid having to perform ((non-)capture avoiding) beta reduction -- fixes a bug in the THF translation of "is_measure.simps"
blanchet
parents:
47905
diff
changeset
|
1971 |
in term (Top_Level pos) end |
52031
9a9238342963
tuning -- renamed '_from_' to '_of_' in Sledgehammer
blanchet
parents:
52030
diff
changeset
|
1972 |
and formula_of_iformula ctxt 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
|
1973 |
let |
44811 | 1974 |
val thy = Proof_Context.theory_of ctxt |
1975 |
val level = level_of_type_enc type_enc |
|
53586
bd5fa6425993
prefixed types and some functions with "atp_" for disambiguation
blanchet
parents:
52995
diff
changeset
|
1976 |
val do_term = atp_term_of_iterm ctxt mono type_enc |
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
|
1977 |
fun do_out_of_bound_type pos phi universal (name, T) = |
44399 | 1978 |
if should_guard_type ctxt mono type_enc |
48087
94835838ed2c
removed micro-optimization whose justification I can't recall
blanchet
parents:
48081
diff
changeset
|
1979 |
(fn () => should_guard_var thy level pos phi universal name) T then |
43859 | 1980 |
IVar (name, T) |
47768
0b2b7ff31867
don't use the native choice operator if the type encoding isn't higher-order
blanchet
parents:
47767
diff
changeset
|
1981 |
|> type_guard_iterm type_enc T |
43361
e37b54d429f5
revived the lightweight "poly_tags_{query,bang}" type encodings by fixing their soundness bug
blanchet
parents:
43324
diff
changeset
|
1982 |
|> do_term pos |> AAtom |> SOME |
44405
6fe1a89bb69a
generate tag equations for existential variables
blanchet
parents:
44404
diff
changeset
|
1983 |
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
|
1984 |
let |
48132
9aa0fad4e864
added type arguments to "ATerm" constructor -- but don't use them yet
blanchet
parents:
48131
diff
changeset
|
1985 |
val var = ATerm ((name, []), []) |
47768
0b2b7ff31867
don't use the native choice operator if the type encoding isn't higher-order
blanchet
parents:
47767
diff
changeset
|
1986 |
val tagged_var = tag_with_type ctxt mono type_enc pos T var |
48132
9aa0fad4e864
added type arguments to "ATerm" constructor -- but don't use them yet
blanchet
parents:
48131
diff
changeset
|
1987 |
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
|
1988 |
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
|
1989 |
NONE |
48133
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
1990 |
fun do_formula pos (ATyQuant (q, xs, phi)) = |
54820 | 1991 |
ATyQuant (q, map (apfst (native_atp_type_of_typ type_enc false 0)) xs, do_formula pos phi) |
48133
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
1992 |
| do_formula pos (AQuant (q, xs, phi)) = |
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
|
1993 |
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
|
1994 |
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
|
1995 |
val universal = Option.map (q = AExists ? not) pos |
47768
0b2b7ff31867
don't use the native choice operator if the type encoding isn't higher-order
blanchet
parents:
47767
diff
changeset
|
1996 |
val do_bound_type = do_bound_type ctxt mono type_enc |
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
|
1997 |
in |
42834
40f7691d0539
implemented thin versions of "preds" type systems + fixed various issues with type args
blanchet
parents:
42832
diff
changeset
|
1998 |
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
|
1999 |
| 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
|
2000 |
(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
|
2001 |
(map_filter |
40f7691d0539
implemented thin versions of "preds" type systems + fixed various issues with type args
blanchet
parents:
42832
diff
changeset
|
2002 |
(fn (_, NONE) => NONE |
40f7691d0539
implemented thin versions of "preds" type systems + fixed various issues with type args
blanchet
parents:
42832
diff
changeset
|
2003 |
| (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
|
2004 |
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
|
2005 |
xs) |
42834
40f7691d0539
implemented thin versions of "preds" type systems + fixed various issues with type args
blanchet
parents:
42832
diff
changeset
|
2006 |
phi) |
40f7691d0539
implemented thin versions of "preds" type systems + fixed various issues with type args
blanchet
parents:
42832
diff
changeset
|
2007 |
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
|
2008 |
| 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
|
2009 |
| 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
|
2010 |
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
|
2011 |
|
48438
3e45c98fe127
distinguish between recursive and nonrecursive definitions + clean up typedef dependencies in MaSh
blanchet
parents:
48324
diff
changeset
|
2012 |
fun string_of_status General = "" |
3e45c98fe127
distinguish between recursive and nonrecursive definitions + clean up typedef dependencies in MaSh
blanchet
parents:
48324
diff
changeset
|
2013 |
| string_of_status Induction = inductionN |
3e45c98fe127
distinguish between recursive and nonrecursive definitions + clean up typedef dependencies in MaSh
blanchet
parents:
48324
diff
changeset
|
2014 |
| string_of_status Intro = introN |
3e45c98fe127
distinguish between recursive and nonrecursive definitions + clean up typedef dependencies in MaSh
blanchet
parents:
48324
diff
changeset
|
2015 |
| string_of_status Inductive = inductiveN |
3e45c98fe127
distinguish between recursive and nonrecursive definitions + clean up typedef dependencies in MaSh
blanchet
parents:
48324
diff
changeset
|
2016 |
| string_of_status Elim = elimN |
3e45c98fe127
distinguish between recursive and nonrecursive definitions + clean up typedef dependencies in MaSh
blanchet
parents:
48324
diff
changeset
|
2017 |
| string_of_status Simp = simpN |
3e45c98fe127
distinguish between recursive and nonrecursive definitions + clean up typedef dependencies in MaSh
blanchet
parents:
48324
diff
changeset
|
2018 |
| string_of_status Non_Rec_Def = non_rec_defN |
3e45c98fe127
distinguish between recursive and nonrecursive definitions + clean up typedef dependencies in MaSh
blanchet
parents:
48324
diff
changeset
|
2019 |
| string_of_status Rec_Def = rec_defN |
3e45c98fe127
distinguish between recursive and nonrecursive definitions + clean up typedef dependencies in MaSh
blanchet
parents:
48324
diff
changeset
|
2020 |
|
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
|
2021 |
(* Each fact is given a unique fact number to avoid name clashes (e.g., because |
52032 | 2022 |
of monomorphization). The TPTP forbids name clashes, and some of the remote |
2023 |
provers might care. *) |
|
61860
2ce3d12015b3
cleaner generation of metainformation in DFG format and TPTP theory exporter for Sledgehammer
blanchet
parents:
61770
diff
changeset
|
2024 |
fun line_of_fact ctxt generate_info prefix encode alt freshen pos mono type_enc rank |
48438
3e45c98fe127
distinguish between recursive and nonrecursive definitions + clean up typedef dependencies in MaSh
blanchet
parents:
48324
diff
changeset
|
2025 |
(j, {name, stature = (_, status), role, iformula, atomic_types}) = |
50521
bec828f3364e
generate comments with original names for debugging
blanchet
parents:
49982
diff
changeset
|
2026 |
Formula ((prefix ^ (if freshen then string_of_int j ^ "_" else "") ^ |
50758 | 2027 |
encode name, alt name), |
48438
3e45c98fe127
distinguish between recursive and nonrecursive definitions + clean up typedef dependencies in MaSh
blanchet
parents:
48324
diff
changeset
|
2028 |
role, |
3e45c98fe127
distinguish between recursive and nonrecursive definitions + clean up typedef dependencies in MaSh
blanchet
parents:
48324
diff
changeset
|
2029 |
iformula |
52031
9a9238342963
tuning -- renamed '_from_' to '_of_' in Sledgehammer
blanchet
parents:
52030
diff
changeset
|
2030 |
|> formula_of_iformula ctxt mono type_enc |
48438
3e45c98fe127
distinguish between recursive and nonrecursive definitions + clean up typedef dependencies in MaSh
blanchet
parents:
48324
diff
changeset
|
2031 |
should_guard_var_in_formula (if pos then SOME true else NONE) |
3e45c98fe127
distinguish between recursive and nonrecursive definitions + clean up typedef dependencies in MaSh
blanchet
parents:
48324
diff
changeset
|
2032 |
|> close_formula_universally |
3e45c98fe127
distinguish between recursive and nonrecursive definitions + clean up typedef dependencies in MaSh
blanchet
parents:
48324
diff
changeset
|
2033 |
|> bound_tvars type_enc true atomic_types, |
61860
2ce3d12015b3
cleaner generation of metainformation in DFG format and TPTP theory exporter for Sledgehammer
blanchet
parents:
61770
diff
changeset
|
2034 |
NONE, isabelle_info generate_info (string_of_status status) (rank j)) |
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
|
2035 |
|
61860
2ce3d12015b3
cleaner generation of metainformation in DFG format and TPTP theory exporter for Sledgehammer
blanchet
parents:
61770
diff
changeset
|
2036 |
fun lines_of_subclass generate_info type_enc sub super = |
50521
bec828f3364e
generate comments with original names for debugging
blanchet
parents:
49982
diff
changeset
|
2037 |
Formula ((subclass_prefix ^ ascii_of sub ^ "___" ^ ascii_of super, ""), Axiom, |
48133
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
2038 |
AConn (AImplies, |
48142
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
2039 |
[sub, super] |> map (fn s => class_atom type_enc (s, tvar_a))) |
48133
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
2040 |
|> bound_tvars type_enc false [tvar_a], |
61860
2ce3d12015b3
cleaner generation of metainformation in DFG format and TPTP theory exporter for Sledgehammer
blanchet
parents:
61770
diff
changeset
|
2041 |
NONE, isabelle_info generate_info inductiveN helper_rank) |
48133
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
2042 |
|
61860
2ce3d12015b3
cleaner generation of metainformation in DFG format and TPTP theory exporter for Sledgehammer
blanchet
parents:
61770
diff
changeset
|
2043 |
fun lines_of_subclass_pair generate_info type_enc (sub, supers) = |
48142
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
2044 |
if polymorphism_of_type_enc type_enc = Type_Class_Polymorphic then |
61860
2ce3d12015b3
cleaner generation of metainformation in DFG format and TPTP theory exporter for Sledgehammer
blanchet
parents:
61770
diff
changeset
|
2045 |
[Class_Decl (class_decl_prefix ^ ascii_of sub, `make_class sub, map (`make_class) supers)] |
48142
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
2046 |
else |
61860
2ce3d12015b3
cleaner generation of metainformation in DFG format and TPTP theory exporter for Sledgehammer
blanchet
parents:
61770
diff
changeset
|
2047 |
map (lines_of_subclass generate_info type_enc sub) supers |
48142
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
2048 |
|
61860
2ce3d12015b3
cleaner generation of metainformation in DFG format and TPTP theory exporter for Sledgehammer
blanchet
parents:
61770
diff
changeset
|
2049 |
fun line_of_tcon_clause generate_info type_enc (name, prems, (cl, T)) = |
48142
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
2050 |
if polymorphism_of_type_enc type_enc = Type_Class_Polymorphic then |
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
2051 |
Class_Memb (class_memb_prefix ^ name, |
54820 | 2052 |
map (fn (cls, T) => (T |> dest_TVar |> tvar_name, map (`make_class) cls)) prems, |
2053 |
native_atp_type_of_typ type_enc false 0 T, `make_class cl) |
|
48142
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
2054 |
else |
50521
bec828f3364e
generate comments with original names for debugging
blanchet
parents:
49982
diff
changeset
|
2055 |
Formula ((tcon_clause_prefix ^ name, ""), Axiom, |
48142
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
2056 |
mk_ahorn (maps (class_atoms type_enc) prems) |
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
2057 |
(class_atom type_enc (cl, T)) |
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
2058 |
|> bound_tvars type_enc true (snd (dest_Type T)), |
61860
2ce3d12015b3
cleaner generation of metainformation in DFG format and TPTP theory exporter for Sledgehammer
blanchet
parents:
61770
diff
changeset
|
2059 |
NONE, isabelle_info generate_info inductiveN helper_rank) |
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
|
2060 |
|
61860
2ce3d12015b3
cleaner generation of metainformation in DFG format and TPTP theory exporter for Sledgehammer
blanchet
parents:
61770
diff
changeset
|
2061 |
fun line_of_conjecture ctxt mono type_enc ({name, role, iformula, atomic_types, ...} : ifact) = |
50521
bec828f3364e
generate comments with original names for debugging
blanchet
parents:
49982
diff
changeset
|
2062 |
Formula ((conjecture_prefix ^ name, ""), role, |
45316
08d84bdd5b37
improve handling of bound type variables (esp. for TFF1)
blanchet
parents:
45315
diff
changeset
|
2063 |
iformula |
61860
2ce3d12015b3
cleaner generation of metainformation in DFG format and TPTP theory exporter for Sledgehammer
blanchet
parents:
61770
diff
changeset
|
2064 |
|> formula_of_iformula ctxt mono type_enc should_guard_var_in_formula (SOME false) |
45377 | 2065 |
|> close_formula_universally |
46406 | 2066 |
|> bound_tvars type_enc true atomic_types, 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
|
2067 |
|
51998
f732a674db1b
renamed Sledgehammer functions with 'for' in their names to 'of'
blanchet
parents:
51921
diff
changeset
|
2068 |
fun lines_of_free_types type_enc (facts : ifact list) = |
48185
086d9bb80d46
don't generate any type class axioms for free types for monomorphic encodings
blanchet
parents:
48183
diff
changeset
|
2069 |
if is_type_enc_polymorphic type_enc then |
086d9bb80d46
don't generate any type class axioms for free types for monomorphic encodings
blanchet
parents:
48183
diff
changeset
|
2070 |
let |
54798 | 2071 |
val type_classes = (polymorphism_of_type_enc type_enc = Type_Class_Polymorphic) |
57481
84bbdbf1b2da
reverted 9512b867259c -- appears to break 'metis'
blanchet
parents:
57470
diff
changeset
|
2072 |
fun line j (cl, T) = |
48185
086d9bb80d46
don't generate any type class axioms for free types for monomorphic encodings
blanchet
parents:
48183
diff
changeset
|
2073 |
if type_classes then |
086d9bb80d46
don't generate any type class axioms for free types for monomorphic encodings
blanchet
parents:
48183
diff
changeset
|
2074 |
Class_Memb (class_memb_prefix ^ string_of_int j, [], |
54820 | 2075 |
native_atp_type_of_typ type_enc false 0 T, `make_class cl) |
48185
086d9bb80d46
don't generate any type class axioms for free types for monomorphic encodings
blanchet
parents:
48183
diff
changeset
|
2076 |
else |
50521
bec828f3364e
generate comments with original names for debugging
blanchet
parents:
49982
diff
changeset
|
2077 |
Formula ((tfree_clause_prefix ^ string_of_int j, ""), Hypothesis, |
54820 | 2078 |
class_atom type_enc (cl, T), NONE, []) |
48185
086d9bb80d46
don't generate any type class axioms for free types for monomorphic encodings
blanchet
parents:
48183
diff
changeset
|
2079 |
val membs = |
086d9bb80d46
don't generate any type class axioms for free types for monomorphic encodings
blanchet
parents:
48183
diff
changeset
|
2080 |
fold (union (op =)) (map #atomic_types facts) [] |
51998
f732a674db1b
renamed Sledgehammer functions with 'for' in their names to 'of'
blanchet
parents:
51921
diff
changeset
|
2081 |
|> class_membs_of_types type_enc add_sorts_on_tfree |
54798 | 2082 |
in |
57481
84bbdbf1b2da
reverted 9512b867259c -- appears to break 'metis'
blanchet
parents:
57470
diff
changeset
|
2083 |
map2 line (0 upto length membs - 1) membs |
54798 | 2084 |
end |
48185
086d9bb80d46
don't generate any type class axioms for free types for monomorphic encodings
blanchet
parents:
48183
diff
changeset
|
2085 |
else |
086d9bb80d46
don't generate any type class axioms for free types for monomorphic encodings
blanchet
parents:
48183
diff
changeset
|
2086 |
[] |
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
|
2087 |
|
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
|
2088 |
(** 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
|
2089 |
|
51998
f732a674db1b
renamed Sledgehammer functions with 'for' in their names to 'of'
blanchet
parents:
51921
diff
changeset
|
2090 |
fun decl_line_of_class phantoms s = |
48142
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
2091 |
let val name as (s, _) = `make_class s in |
48137
6f524f2066e3
cleanly distinguish between type declarations and symbol declarations
blanchet
parents:
48136
diff
changeset
|
2092 |
Sym_Decl (sym_decl_prefix ^ s, name, |
6f524f2066e3
cleanly distinguish between type declarations and symbol declarations
blanchet
parents:
48136
diff
changeset
|
2093 |
APi ([tvar_a_name], |
6f524f2066e3
cleanly distinguish between type declarations and symbol declarations
blanchet
parents:
48136
diff
changeset
|
2094 |
if phantoms = Without_Phantom_Type_Vars then |
6f524f2066e3
cleanly distinguish between type declarations and symbol declarations
blanchet
parents:
48136
diff
changeset
|
2095 |
AFun (a_itself_atype, bool_atype) |
6f524f2066e3
cleanly distinguish between type declarations and symbol declarations
blanchet
parents:
48136
diff
changeset
|
2096 |
else |
6f524f2066e3
cleanly distinguish between type declarations and symbol declarations
blanchet
parents:
48136
diff
changeset
|
2097 |
bool_atype)) |
44595
444d111bde7d
generate properly typed TFF1 (PFF) problems in the presence of type class predicates
blanchet
parents:
44594
diff
changeset
|
2098 |
end |
444d111bde7d
generate properly typed TFF1 (PFF) problems in the presence of type class predicates
blanchet
parents:
44594
diff
changeset
|
2099 |
|
51998
f732a674db1b
renamed Sledgehammer functions with 'for' in their names to 'of'
blanchet
parents:
51921
diff
changeset
|
2100 |
fun decl_lines_of_classes type_enc = |
54829 | 2101 |
(case type_enc of |
2102 |
Native (_, Raw_Polymorphic phantoms, _) => map (decl_line_of_class phantoms) |
|
2103 |
| _ => K []) |
|
44595
444d111bde7d
generate properly typed TFF1 (PFF) problems in the presence of type class predicates
blanchet
parents:
44594
diff
changeset
|
2104 |
|
51998
f732a674db1b
renamed Sledgehammer functions with 'for' in their names to 'of'
blanchet
parents:
51921
diff
changeset
|
2105 |
fun sym_decl_table_of_facts thy type_enc sym_tab (conjs, facts, extra_tms) = |
42574 | 2106 |
let |
44829
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
2107 |
fun add_iterm_syms tm = |
43859 | 2108 |
let val (head, args) = strip_iterm_comb tm in |
42574 | 2109 |
(case head of |
54829 | 2110 |
IConst ((s, s'), T, T_args) => |
2111 |
let |
|
2112 |
val (pred_sym, in_conj) = |
|
2113 |
(case Symtab.lookup sym_tab s of |
|
2114 |
SOME ({pred_sym, in_conj, ...} : sym_info) => (pred_sym, in_conj) |
|
2115 |
| NONE => (false, false)) |
|
2116 |
val decl_sym = |
|
2117 |
(case type_enc of Guards _ => not pred_sym | _ => true) andalso is_tptp_user_symbol s |
|
2118 |
in |
|
2119 |
if decl_sym then |
|
2120 |
Symtab.map_default (s, []) |
|
2121 |
(insert_type thy #3 (s', T_args, T, pred_sym, length args, in_conj)) |
|
2122 |
else |
|
2123 |
I |
|
2124 |
end |
|
2125 |
| IAbs (_, tm) => add_iterm_syms tm |
|
2126 |
| _ => I) |
|
44829
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
2127 |
#> fold add_iterm_syms args |
42574 | 2128 |
end |
50968
3686bc0d4df2
pass correct index to "Sign.typ_unify" -- this is important to avoid what appears to be an infinite loop in the unifier
blanchet
parents:
50758
diff
changeset
|
2129 |
val add_fact_syms = ifact_lift (formula_fold NONE (K add_iterm_syms)) |
48133
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
2130 |
fun add_formula_var_types (ATyQuant (_, _, phi)) = add_formula_var_types phi |
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
2131 |
| add_formula_var_types (AQuant (_, xs, phi)) = |
47150 | 2132 |
fold (fn (_, SOME T) => insert_type thy I T | _ => I) xs |
43966 | 2133 |
#> add_formula_var_types phi |
2134 |
| add_formula_var_types (AConn (_, phis)) = |
|
2135 |
fold add_formula_var_types phis |
|
2136 |
| add_formula_var_types _ = I |
|
2137 |
fun var_types () = |
|
48131 | 2138 |
if is_type_enc_polymorphic type_enc then [tvar_a] |
47981 | 2139 |
else fold (ifact_lift add_formula_var_types) (conjs @ facts) [] |
43966 | 2140 |
fun add_undefined_const T = |
43984 | 2141 |
let |
48200
5156cadedfa5
fiddled with "tags_at" a bit -- the only non-tuning part of the change is a slight simplification of the typing axioms
blanchet
parents:
48199
diff
changeset
|
2142 |
(* FIXME: make sure type arguments are filtered / clean up code *) |
43984 | 2143 |
val (s, s') = |
44622 | 2144 |
`(make_fixed_const NONE) @{const_name undefined} |
48201 | 2145 |
|> (is_type_enc_mangling type_enc ? mangled_const_name type_enc [T]) |
43984 | 2146 |
in |
2147 |
Symtab.map_default (s, []) |
|
47150 | 2148 |
(insert_type thy #3 (s', [T], T, false, 0, false)) |
43984 | 2149 |
end |
44622 | 2150 |
fun add_TYPE_const () = |
2151 |
let val (s, s') = TYPE_name in |
|
2152 |
Symtab.map_default (s, []) |
|
47150 | 2153 |
(insert_type thy #3 |
44622 | 2154 |
(s', [tvar_a], @{typ "'a itself"}, false, 0, false)) |
2155 |
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
|
2156 |
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
|
2157 |
Symtab.empty |
48089 | 2158 |
|> is_type_enc_sound type_enc |
44829
5a2cd5db0a11
fixed computation of "in_conj" for polymorphic encodings
blanchet
parents:
44814
diff
changeset
|
2159 |
? (fold (fold add_fact_syms) [conjs, facts] |
46392
676a4b4b6e73
implemented partial application aliases (for SPASS mainly)
blanchet
parents:
46389
diff
changeset
|
2160 |
#> fold add_iterm_syms extra_tms |
43985
33d8b99531c2
no need for existential witnesses for sorts in TFF and THF formats
blanchet
parents:
43984
diff
changeset
|
2161 |
#> (case type_enc of |
57292 | 2162 |
Native (_, Raw_Polymorphic phantoms, _) => |
48131 | 2163 |
phantoms = Without_Phantom_Type_Vars ? add_TYPE_const () |
47767 | 2164 |
| Native _ => I |
43985
33d8b99531c2
no need for existential witnesses for sorts in TFF and THF formats
blanchet
parents:
43984
diff
changeset
|
2165 |
| _ => 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
|
2166 |
end |
42533 | 2167 |
|
44399 | 2168 |
(* We add "bool" in case the helper "True_or_False" is included later. *) |
48143 | 2169 |
fun default_mono level completish = |
44399 | 2170 |
{maybe_finite_Ts = [@{typ bool}], |
54829 | 2171 |
surely_infinite_Ts = (case level of Nonmono_Types (Strict, _) => [] | _ => known_infinite_types), |
62718 | 2172 |
maybe_nonmono_Ts = [if completish >= 2 then tvar_a else @{typ bool}]} |
44399 | 2173 |
|
50968
3686bc0d4df2
pass correct index to "Sign.typ_unify" -- this is important to avoid what appears to be an infinite loop in the unifier
blanchet
parents:
50758
diff
changeset
|
2174 |
(* This inference is described in section 4 of Blanchette et al., "Encoding |
3686bc0d4df2
pass correct index to "Sign.typ_unify" -- this is important to avoid what appears to be an infinite loop in the unifier
blanchet
parents:
50758
diff
changeset
|
2175 |
monomorphic and polymorphic types", TACAS 2013. *) |
44399 | 2176 |
fun add_iterm_mononotonicity_info _ _ (SOME false) _ mono = mono |
2177 |
| add_iterm_mononotonicity_info ctxt level _ |
|
2178 |
(IApp (IApp (IConst ((s, _), Type (_, [T, _]), _), tm1), tm2)) |
|
48103 | 2179 |
(mono as {maybe_finite_Ts, surely_infinite_Ts, maybe_nonmono_Ts}) = |
47150 | 2180 |
let val thy = Proof_Context.theory_of ctxt in |
2181 |
if is_tptp_equal s andalso exists is_maybe_universal_var [tm1, tm2] then |
|
54829 | 2182 |
(case level of |
48092 | 2183 |
Nonmono_Types (strictness, _) => |
47150 | 2184 |
if exists (type_instance thy T) surely_infinite_Ts orelse |
2185 |
member (type_equiv thy) maybe_finite_Ts T then |
|
2186 |
mono |
|
2187 |
else if is_type_kind_of_surely_infinite ctxt strictness |
|
2188 |
surely_infinite_Ts T then |
|
2189 |
{maybe_finite_Ts = maybe_finite_Ts, |
|
2190 |
surely_infinite_Ts = surely_infinite_Ts |> insert_type thy I T, |
|
2191 |
maybe_nonmono_Ts = maybe_nonmono_Ts} |
|
2192 |
else |
|
2193 |
{maybe_finite_Ts = maybe_finite_Ts |> insert (type_equiv thy) T, |
|
2194 |
surely_infinite_Ts = surely_infinite_Ts, |
|
2195 |
maybe_nonmono_Ts = maybe_nonmono_Ts |> insert_type thy I T} |
|
54829 | 2196 |
| _ => mono) |
47150 | 2197 |
else |
2198 |
mono |
|
2199 |
end |
|
44399 | 2200 |
| add_iterm_mononotonicity_info _ _ _ _ mono = mono |
47981 | 2201 |
fun add_fact_mononotonicity_info ctxt level ({role, iformula, ...} : ifact) = |
47975
adc977fec17e
order LEO-II/Satallax definitions so that they build on each other (cf. Satallax's THF policy)
blanchet
parents:
47971
diff
changeset
|
2202 |
formula_fold (SOME (role <> Conjecture)) |
44399 | 2203 |
(add_iterm_mononotonicity_info ctxt level) iformula |
51998
f732a674db1b
renamed Sledgehammer functions with 'for' in their names to 'of'
blanchet
parents:
51921
diff
changeset
|
2204 |
fun mononotonicity_info_of_facts ctxt type_enc completish facts = |
43626
a867ebb12209
renamed "type_sys" to "type_enc", which is more accurate
blanchet
parents:
43624
diff
changeset
|
2205 |
let val level = level_of_type_enc type_enc in |
48143 | 2206 |
default_mono level completish |
44399 | 2207 |
|> is_type_level_monotonicity_based level |
2208 |
? 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
|
2209 |
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
|
2210 |
|
52005 | 2211 |
fun fold_arg_types f (IApp (tm1, tm2)) = |
2212 |
fold_arg_types f tm1 #> fold_term_types f tm2 |
|
2213 |
| fold_arg_types _ _ = I |
|
2214 |
and fold_term_types f tm = f (ityp_of tm) #> fold_arg_types f tm |
|
2215 |
||
44501 | 2216 |
fun add_iformula_monotonic_types ctxt mono type_enc = |
2217 |
let |
|
47150 | 2218 |
val thy = Proof_Context.theory_of ctxt |
44501 | 2219 |
val level = level_of_type_enc type_enc |
2220 |
val should_encode = should_encode_type ctxt mono level |
|
47150 | 2221 |
fun add_type T = not (should_encode T) ? insert_type thy I T |
52005 | 2222 |
in formula_fold NONE (K (fold_term_types add_type)) end |
50968
3686bc0d4df2
pass correct index to "Sign.typ_unify" -- this is important to avoid what appears to be an infinite loop in the unifier
blanchet
parents:
50758
diff
changeset
|
2223 |
|
44501 | 2224 |
fun add_fact_monotonic_types ctxt mono type_enc = |
50968
3686bc0d4df2
pass correct index to "Sign.typ_unify" -- this is important to avoid what appears to be an infinite loop in the unifier
blanchet
parents:
50758
diff
changeset
|
2225 |
ifact_lift (add_iformula_monotonic_types ctxt mono type_enc) |
3686bc0d4df2
pass correct index to "Sign.typ_unify" -- this is important to avoid what appears to be an infinite loop in the unifier
blanchet
parents:
50758
diff
changeset
|
2226 |
|
51998
f732a674db1b
renamed Sledgehammer functions with 'for' in their names to 'of'
blanchet
parents:
51921
diff
changeset
|
2227 |
fun monotonic_types_of_facts ctxt mono type_enc facts = |
44811 | 2228 |
let val level = level_of_type_enc type_enc in |
48131 | 2229 |
[] |> (is_type_enc_polymorphic type_enc andalso |
48183 | 2230 |
is_type_level_monotonicity_based level) |
44811 | 2231 |
? fold (add_fact_monotonic_types ctxt mono type_enc) facts |
2232 |
end |
|
44501 | 2233 |
|
61860
2ce3d12015b3
cleaner generation of metainformation in DFG format and TPTP theory exporter for Sledgehammer
blanchet
parents:
61770
diff
changeset
|
2234 |
fun line_of_guards_mono_type ctxt generate_info mono type_enc T = |
50521
bec828f3364e
generate comments with original names for debugging
blanchet
parents:
49982
diff
changeset
|
2235 |
Formula ((guards_sym_formula_prefix ^ ascii_of (mangled_type type_enc T), ""), |
44396
66b9b3fcd608
started cleaning up polymorphic monotonicity-based encodings, based on discussions with Nick Smallbone
blanchet
parents:
44394
diff
changeset
|
2236 |
Axiom, |
66b9b3fcd608
started cleaning up polymorphic monotonicity-based encodings, based on discussions with Nick Smallbone
blanchet
parents:
44394
diff
changeset
|
2237 |
IConst (`make_bound_var "X", T, []) |
47768
0b2b7ff31867
don't use the native choice operator if the type encoding isn't higher-order
blanchet
parents:
47767
diff
changeset
|
2238 |
|> type_guard_iterm type_enc T |
44396
66b9b3fcd608
started cleaning up polymorphic monotonicity-based encodings, based on discussions with Nick Smallbone
blanchet
parents:
44394
diff
changeset
|
2239 |
|> AAtom |
52031
9a9238342963
tuning -- renamed '_from_' to '_of_' in Sledgehammer
blanchet
parents:
52030
diff
changeset
|
2240 |
|> formula_of_iformula ctxt mono type_enc always_guard_var_in_formula |
9a9238342963
tuning -- renamed '_from_' to '_of_' in Sledgehammer
blanchet
parents:
52030
diff
changeset
|
2241 |
(SOME true) |
45377 | 2242 |
|> close_formula_universally |
45920 | 2243 |
|> bound_tvars type_enc true (atomic_types_of T), |
61860
2ce3d12015b3
cleaner generation of metainformation in DFG format and TPTP theory exporter for Sledgehammer
blanchet
parents:
61770
diff
changeset
|
2244 |
NONE, isabelle_info generate_info inductiveN helper_rank) |
44396
66b9b3fcd608
started cleaning up polymorphic monotonicity-based encodings, based on discussions with Nick Smallbone
blanchet
parents:
44394
diff
changeset
|
2245 |
|
61860
2ce3d12015b3
cleaner generation of metainformation in DFG format and TPTP theory exporter for Sledgehammer
blanchet
parents:
61770
diff
changeset
|
2246 |
fun line_of_tags_mono_type ctxt generate_info mono type_enc T = |
48132
9aa0fad4e864
added type arguments to "ATerm" constructor -- but don't use them yet
blanchet
parents:
48131
diff
changeset
|
2247 |
let val x_var = ATerm ((`make_bound_var "X", []), []) in |
54798 | 2248 |
Formula ((tags_sym_formula_prefix ^ ascii_of (mangled_type type_enc T), ""), Axiom, |
46392
676a4b4b6e73
implemented partial application aliases (for SPASS mainly)
blanchet
parents:
46389
diff
changeset
|
2249 |
eq_formula type_enc (atomic_types_of T) [] false |
47768
0b2b7ff31867
don't use the native choice operator if the type encoding isn't higher-order
blanchet
parents:
47767
diff
changeset
|
2250 |
(tag_with_type ctxt mono type_enc NONE T x_var) x_var, |
61860
2ce3d12015b3
cleaner generation of metainformation in DFG format and TPTP theory exporter for Sledgehammer
blanchet
parents:
61770
diff
changeset
|
2251 |
NONE, isabelle_info generate_info non_rec_defN helper_rank) |
44396
66b9b3fcd608
started cleaning up polymorphic monotonicity-based encodings, based on discussions with Nick Smallbone
blanchet
parents:
44394
diff
changeset
|
2252 |
end |
66b9b3fcd608
started cleaning up polymorphic monotonicity-based encodings, based on discussions with Nick Smallbone
blanchet
parents:
44394
diff
changeset
|
2253 |
|
61860
2ce3d12015b3
cleaner generation of metainformation in DFG format and TPTP theory exporter for Sledgehammer
blanchet
parents:
61770
diff
changeset
|
2254 |
fun lines_of_mono_types ctxt generate_info mono type_enc = |
54829 | 2255 |
(case type_enc of |
51998
f732a674db1b
renamed Sledgehammer functions with 'for' in their names to 'of'
blanchet
parents:
51921
diff
changeset
|
2256 |
Native _ => K [] |
61860
2ce3d12015b3
cleaner generation of metainformation in DFG format and TPTP theory exporter for Sledgehammer
blanchet
parents:
61770
diff
changeset
|
2257 |
| Guards _ => map (line_of_guards_mono_type ctxt generate_info mono type_enc) |
2ce3d12015b3
cleaner generation of metainformation in DFG format and TPTP theory exporter for Sledgehammer
blanchet
parents:
61770
diff
changeset
|
2258 |
| Tags _ => map (line_of_tags_mono_type ctxt generate_info mono type_enc)) |
44396
66b9b3fcd608
started cleaning up polymorphic monotonicity-based encodings, based on discussions with Nick Smallbone
blanchet
parents:
44394
diff
changeset
|
2259 |
|
51998
f732a674db1b
renamed Sledgehammer functions with 'for' in their names to 'of'
blanchet
parents:
51921
diff
changeset
|
2260 |
fun decl_line_of_sym ctxt mono type_enc s (s', T_args, T, pred_sym, ary, _) = |
42994
fe291ab75eb5
towards supporting non-simply-typed encodings for TFF and THF (for orthogonality and experiments)
blanchet
parents:
42966
diff
changeset
|
2261 |
let |
44594
ae82943481e9
added type abstractions (for declaring polymorphic constants) to TFF syntax
blanchet
parents:
44593
diff
changeset
|
2262 |
val thy = Proof_Context.theory_of ctxt |
ae82943481e9
added type abstractions (for declaring polymorphic constants) to TFF syntax
blanchet
parents:
44593
diff
changeset
|
2263 |
val (T, T_args) = |
ae82943481e9
added type abstractions (for declaring polymorphic constants) to TFF syntax
blanchet
parents:
44593
diff
changeset
|
2264 |
if null T_args then |
ae82943481e9
added type abstractions (for declaring polymorphic constants) to TFF syntax
blanchet
parents:
44593
diff
changeset
|
2265 |
(T, []) |
54829 | 2266 |
else |
2267 |
(case unprefix_and_unascii const_prefix s of |
|
2268 |
SOME s' => |
|
2269 |
let |
|
2270 |
val s' = s' |> unmangled_invert_const |
|
2271 |
val T = s' |> robust_const_type thy |
|
2272 |
in (T, robust_const_type_args thy (s', T)) end |
|
2273 |
| 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
|
2274 |
in |
48137
6f524f2066e3
cleanly distinguish between type declarations and symbol declarations
blanchet
parents:
48136
diff
changeset
|
2275 |
Sym_Decl (sym_decl_prefix ^ s, (s, s'), |
6f524f2066e3
cleanly distinguish between type declarations and symbol declarations
blanchet
parents:
48136
diff
changeset
|
2276 |
T |> fused_type ctxt mono (level_of_type_enc type_enc) ary |
54820 | 2277 |
|> native_atp_type_of_typ type_enc pred_sym ary |
48137
6f524f2066e3
cleanly distinguish between type declarations and symbol declarations
blanchet
parents:
48136
diff
changeset
|
2278 |
|> not (null T_args) |
48142
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
2279 |
? curry APi (map (tvar_name 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
|
2280 |
end |
42579
2552c09b1a72
implement the new ATP type system in Sledgehammer
blanchet
parents:
42577
diff
changeset
|
2281 |
|
50968
3686bc0d4df2
pass correct index to "Sign.typ_unify" -- this is important to avoid what appears to be an infinite loop in the unifier
blanchet
parents:
50758
diff
changeset
|
2282 |
fun honor_conj_sym_role in_conj = (if in_conj then Hypothesis else Axiom, I) |
46392
676a4b4b6e73
implemented partial application aliases (for SPASS mainly)
blanchet
parents:
46389
diff
changeset
|
2283 |
|
61860
2ce3d12015b3
cleaner generation of metainformation in DFG format and TPTP theory exporter for Sledgehammer
blanchet
parents:
61770
diff
changeset
|
2284 |
fun line_of_guards_sym_decl ctxt generate_info mono type_enc n s j |
2ce3d12015b3
cleaner generation of metainformation in DFG format and TPTP theory exporter for Sledgehammer
blanchet
parents:
61770
diff
changeset
|
2285 |
(s', T_args, T, _, ary, in_conj) = |
42579
2552c09b1a72
implement the new ATP type system in Sledgehammer
blanchet
parents:
42577
diff
changeset
|
2286 |
let |
44811 | 2287 |
val thy = Proof_Context.theory_of ctxt |
47975
adc977fec17e
order LEO-II/Satallax definitions so that they build on each other (cf. Satallax's THF policy)
blanchet
parents:
47971
diff
changeset
|
2288 |
val (role, maybe_negate) = honor_conj_sym_role in_conj |
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
|
2289 |
val (arg_Ts, res_T) = chop_fun ary T |
44814
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
2290 |
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
|
2291 |
val bounds = |
43859 | 2292 |
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
|
2293 |
val bound_Ts = |
54829 | 2294 |
(case level_of_type_enc type_enc of |
48538
726590131ca1
bring implementation of traditional encoding in line with paper
blanchet
parents:
48438
diff
changeset
|
2295 |
All_Types => if null T_args then replicate ary NONE else map SOME arg_Ts |
726590131ca1
bring implementation of traditional encoding in line with paper
blanchet
parents:
48438
diff
changeset
|
2296 |
| Undercover_Types => |
48200
5156cadedfa5
fiddled with "tags_at" a bit -- the only non-tuning part of the change is a slight simplification of the typing axioms
blanchet
parents:
48199
diff
changeset
|
2297 |
let val cover = type_arg_cover thy NONE s ary in |
57481
84bbdbf1b2da
reverted 9512b867259c -- appears to break 'metis'
blanchet
parents:
57470
diff
changeset
|
2298 |
map2 (fn j => if member (op =) cover j then SOME else K NONE) (0 upto ary - 1) arg_Ts |
48080 | 2299 |
end |
54829 | 2300 |
| _ => replicate ary NONE) |
42579
2552c09b1a72
implement the new ATP type system in Sledgehammer
blanchet
parents:
42577
diff
changeset
|
2301 |
in |
50521
bec828f3364e
generate comments with original names for debugging
blanchet
parents:
49982
diff
changeset
|
2302 |
Formula ((guards_sym_formula_prefix ^ s ^ |
bec828f3364e
generate comments with original names for debugging
blanchet
parents:
49982
diff
changeset
|
2303 |
(if n > 1 then "_" ^ string_of_int j else ""), ""), |
bec828f3364e
generate comments with original names for debugging
blanchet
parents:
49982
diff
changeset
|
2304 |
role, |
43859 | 2305 |
IConst ((s, s'), T, T_args) |
2306 |
|> fold (curry (IApp o swap)) bounds |
|
47768
0b2b7ff31867
don't use the native choice operator if the type encoding isn't higher-order
blanchet
parents:
47767
diff
changeset
|
2307 |
|> type_guard_iterm type_enc res_T |
42963 | 2308 |
|> AAtom |> mk_aquant AForall (bound_names ~~ bound_Ts) |
52031
9a9238342963
tuning -- renamed '_from_' to '_of_' in Sledgehammer
blanchet
parents:
52030
diff
changeset
|
2309 |
|> formula_of_iformula ctxt mono type_enc |
9a9238342963
tuning -- renamed '_from_' to '_of_' in Sledgehammer
blanchet
parents:
52030
diff
changeset
|
2310 |
always_guard_var_in_formula (SOME true) |
45377 | 2311 |
|> close_formula_universally |
45920 | 2312 |
|> bound_tvars type_enc (n > 1) (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
|
2313 |
|> maybe_negate, |
61860
2ce3d12015b3
cleaner generation of metainformation in DFG format and TPTP theory exporter for Sledgehammer
blanchet
parents:
61770
diff
changeset
|
2314 |
NONE, isabelle_info generate_info inductiveN helper_rank) |
42579
2552c09b1a72
implement the new ATP type system in Sledgehammer
blanchet
parents:
42577
diff
changeset
|
2315 |
end |
2552c09b1a72
implement the new ATP type system in Sledgehammer
blanchet
parents:
42577
diff
changeset
|
2316 |
|
61860
2ce3d12015b3
cleaner generation of metainformation in DFG format and TPTP theory exporter for Sledgehammer
blanchet
parents:
61770
diff
changeset
|
2317 |
fun lines_of_tags_sym_decl ctxt generate_info mono type_enc n s |
2ce3d12015b3
cleaner generation of metainformation in DFG format and TPTP theory exporter for Sledgehammer
blanchet
parents:
61770
diff
changeset
|
2318 |
(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
|
2319 |
let |
44814
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
2320 |
val thy = Proof_Context.theory_of ctxt |
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
2321 |
val level = level_of_type_enc type_enc |
48183 | 2322 |
val ident = |
44396
66b9b3fcd608
started cleaning up polymorphic monotonicity-based encodings, based on discussions with Nick Smallbone
blanchet
parents:
44394
diff
changeset
|
2323 |
tags_sym_formula_prefix ^ s ^ |
43125
ddf63baabdec
distinguish different kinds of typing informations in the fact name
blanchet
parents:
43121
diff
changeset
|
2324 |
(if n > 1 then "_" ^ string_of_int j else "") |
47975
adc977fec17e
order LEO-II/Satallax definitions so that they build on each other (cf. Satallax's THF policy)
blanchet
parents:
47971
diff
changeset
|
2325 |
val (role, maybe_negate) = honor_conj_sym_role in_conj |
42829
1558741f8a72
started implementing "shallow" type systems, based on ideas by Claessen et al.
blanchet
parents:
42828
diff
changeset
|
2326 |
val (arg_Ts, res_T) = chop_fun ary T |
44814
52318464c73b
also implemented ghost version of the tagged encodings
blanchet
parents:
44812
diff
changeset
|
2327 |
val bound_names = 1 upto ary |> map (`I o make_bound_var o string_of_int) |
48132
9aa0fad4e864
added type arguments to "ATerm" constructor -- but don't use them yet
blanchet
parents:
48131
diff
changeset
|
2328 |
val bounds = bound_names |> map (fn name => ATerm ((name, []), [])) |
47768
0b2b7ff31867
don't use the native choice operator if the type encoding isn't higher-order
blanchet
parents:
47767
diff
changeset
|
2329 |
val cst = mk_aterm type_enc (s, s') T_args |
46392
676a4b4b6e73
implemented partial application aliases (for SPASS mainly)
blanchet
parents:
46389
diff
changeset
|
2330 |
val eq = maybe_negate oo eq_formula type_enc (atomic_types_of T) [] pred_sym |
47768
0b2b7ff31867
don't use the native choice operator if the type encoding isn't higher-order
blanchet
parents:
47767
diff
changeset
|
2331 |
val tag_with = tag_with_type ctxt mono type_enc NONE |
48200
5156cadedfa5
fiddled with "tags_at" a bit -- the only non-tuning part of the change is a slight simplification of the typing axioms
blanchet
parents:
48199
diff
changeset
|
2332 |
fun formula c = |
50521
bec828f3364e
generate comments with original names for debugging
blanchet
parents:
49982
diff
changeset
|
2333 |
[Formula ((ident, ""), role, eq (tag_with res_T c) c, NONE, |
61860
2ce3d12015b3
cleaner generation of metainformation in DFG format and TPTP theory exporter for Sledgehammer
blanchet
parents:
61770
diff
changeset
|
2334 |
isabelle_info generate_info non_rec_defN helper_rank)] |
48200
5156cadedfa5
fiddled with "tags_at" a bit -- the only non-tuning part of the change is a slight simplification of the typing axioms
blanchet
parents:
48199
diff
changeset
|
2335 |
in |
5156cadedfa5
fiddled with "tags_at" a bit -- the only non-tuning part of the change is a slight simplification of the typing axioms
blanchet
parents:
48199
diff
changeset
|
2336 |
if pred_sym orelse not (should_encode_type ctxt mono level res_T) then |
5156cadedfa5
fiddled with "tags_at" a bit -- the only non-tuning part of the change is a slight simplification of the typing axioms
blanchet
parents:
48199
diff
changeset
|
2337 |
[] |
5156cadedfa5
fiddled with "tags_at" a bit -- the only non-tuning part of the change is a slight simplification of the typing axioms
blanchet
parents:
48199
diff
changeset
|
2338 |
else if level = Undercover_Types then |
5156cadedfa5
fiddled with "tags_at" a bit -- the only non-tuning part of the change is a slight simplification of the typing axioms
blanchet
parents:
48199
diff
changeset
|
2339 |
let |
5156cadedfa5
fiddled with "tags_at" a bit -- the only non-tuning part of the change is a slight simplification of the typing axioms
blanchet
parents:
48199
diff
changeset
|
2340 |
val cover = type_arg_cover thy NONE s ary |
5156cadedfa5
fiddled with "tags_at" a bit -- the only non-tuning part of the change is a slight simplification of the typing axioms
blanchet
parents:
48199
diff
changeset
|
2341 |
fun maybe_tag (j, arg_T) = member (op =) cover j ? tag_with arg_T |
57481
84bbdbf1b2da
reverted 9512b867259c -- appears to break 'metis'
blanchet
parents:
57470
diff
changeset
|
2342 |
val bounds = bounds |> map2 maybe_tag (0 upto ary - 1 ~~ arg_Ts) |
48200
5156cadedfa5
fiddled with "tags_at" a bit -- the only non-tuning part of the change is a slight simplification of the typing axioms
blanchet
parents:
48199
diff
changeset
|
2343 |
in formula (cst bounds) end |
5156cadedfa5
fiddled with "tags_at" a bit -- the only non-tuning part of the change is a slight simplification of the typing axioms
blanchet
parents:
48199
diff
changeset
|
2344 |
else |
5156cadedfa5
fiddled with "tags_at" a bit -- the only non-tuning part of the change is a slight simplification of the typing axioms
blanchet
parents:
48199
diff
changeset
|
2345 |
formula (cst bounds) |
5156cadedfa5
fiddled with "tags_at" a bit -- the only non-tuning part of the change is a slight simplification of the typing axioms
blanchet
parents:
48199
diff
changeset
|
2346 |
end |
42829
1558741f8a72
started implementing "shallow" type systems, based on ideas by Claessen et al.
blanchet
parents:
42828
diff
changeset
|
2347 |
|
42836 | 2348 |
fun result_type_of_decl (_, _, T, _, ary, _) = chop_fun ary T |> snd |
2349 |
||
47150 | 2350 |
fun rationalize_decls thy (decls as decl :: (decls' as _ :: _)) = |
45780 | 2351 |
let |
56254 | 2352 |
val T = result_type_of_decl decl |> map_type_tvar (fn (z, _) => TVar (z, @{sort type})) |
45780 | 2353 |
in |
54829 | 2354 |
if forall (type_generalization thy T o result_type_of_decl) decls' then [decl] |
2355 |
else decls |
|
45780 | 2356 |
end |
2357 |
| rationalize_decls _ decls = decls |
|
2358 |
||
61860
2ce3d12015b3
cleaner generation of metainformation in DFG format and TPTP theory exporter for Sledgehammer
blanchet
parents:
61770
diff
changeset
|
2359 |
fun lines_of_sym_decls ctxt generate_info mono type_enc (s, decls) = |
54829 | 2360 |
(case type_enc of |
51998
f732a674db1b
renamed Sledgehammer functions with 'for' in their names to 'of'
blanchet
parents:
51921
diff
changeset
|
2361 |
Native _ => [decl_line_of_sym ctxt mono type_enc s (hd decls)] |
44768 | 2362 |
| Guards (_, level) => |
42998
1c80902d0456
fully support all type system encodings in typed formats (TFF, THF)
blanchet
parents:
42994
diff
changeset
|
2363 |
let |
47150 | 2364 |
val thy = Proof_Context.theory_of ctxt |
2365 |
val decls = decls |> rationalize_decls thy |
|
42998
1c80902d0456
fully support all type system encodings in typed formats (TFF, THF)
blanchet
parents:
42994
diff
changeset
|
2366 |
val n = length decls |
54829 | 2367 |
val decls = decls |> filter (should_encode_type ctxt mono level o result_type_of_decl) |
42998
1c80902d0456
fully support all type system encodings in typed formats (TFF, THF)
blanchet
parents:
42994
diff
changeset
|
2368 |
in |
61860
2ce3d12015b3
cleaner generation of metainformation in DFG format and TPTP theory exporter for Sledgehammer
blanchet
parents:
61770
diff
changeset
|
2369 |
(0 upto length decls - 1, decls) |
2ce3d12015b3
cleaner generation of metainformation in DFG format and TPTP theory exporter for Sledgehammer
blanchet
parents:
61770
diff
changeset
|
2370 |
|-> map2 (line_of_guards_sym_decl ctxt generate_info mono type_enc n s) |
42998
1c80902d0456
fully support all type system encodings in typed formats (TFF, THF)
blanchet
parents:
42994
diff
changeset
|
2371 |
end |
44768 | 2372 |
| Tags (_, level) => |
48183 | 2373 |
if is_type_level_uniform level then |
44768 | 2374 |
[] |
2375 |
else |
|
2376 |
let val n = length decls in |
|
61860
2ce3d12015b3
cleaner generation of metainformation in DFG format and TPTP theory exporter for Sledgehammer
blanchet
parents:
61770
diff
changeset
|
2377 |
(0 upto n - 1 ~~ decls) |
2ce3d12015b3
cleaner generation of metainformation in DFG format and TPTP theory exporter for Sledgehammer
blanchet
parents:
61770
diff
changeset
|
2378 |
|> maps (lines_of_tags_sym_decl ctxt generate_info mono type_enc n s) |
54829 | 2379 |
end) |
42579
2552c09b1a72
implement the new ATP type system in Sledgehammer
blanchet
parents:
42577
diff
changeset
|
2380 |
|
61860
2ce3d12015b3
cleaner generation of metainformation in DFG format and TPTP theory exporter for Sledgehammer
blanchet
parents:
61770
diff
changeset
|
2381 |
fun lines_of_sym_decl_table ctxt generate_info mono type_enc 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
|
2382 |
let |
60924
610794dff23c
tuned signature, in accordance to sortBy in Scala;
wenzelm
parents:
60328
diff
changeset
|
2383 |
val syms = sym_decl_tab |> Symtab.dest |> sort_by fst |
61860
2ce3d12015b3
cleaner generation of metainformation in DFG format and TPTP theory exporter for Sledgehammer
blanchet
parents:
61770
diff
changeset
|
2384 |
val mono_lines = lines_of_mono_types ctxt generate_info mono type_enc mono_Ts |
2ce3d12015b3
cleaner generation of metainformation in DFG format and TPTP theory exporter for Sledgehammer
blanchet
parents:
61770
diff
changeset
|
2385 |
val decl_lines = maps (lines_of_sym_decls ctxt generate_info mono type_enc) syms |
44396
66b9b3fcd608
started cleaning up polymorphic monotonicity-based encodings, based on discussions with Nick Smallbone
blanchet
parents:
44394
diff
changeset
|
2386 |
in mono_lines @ decl_lines end |
42543
f9d402d144d4
declare TFF types so that SNARK can be used with types
blanchet
parents:
42542
diff
changeset
|
2387 |
|
56636
bb8b37480d3f
declare 'bool' and its proxies as a datatype for SPASS-Pirate
blanchet
parents:
56254
diff
changeset
|
2388 |
fun datatypes_of_sym_table ctxt ctrss (DFG Polymorphic) (type_enc as Native _) uncurried_aliases |
bb8b37480d3f
declare 'bool' and its proxies as a datatype for SPASS-Pirate
blanchet
parents:
56254
diff
changeset
|
2389 |
sym_tab = |
52032 | 2390 |
if is_type_enc_polymorphic type_enc then |
2391 |
let |
|
2392 |
val thy = Proof_Context.theory_of ctxt |
|
56636
bb8b37480d3f
declare 'bool' and its proxies as a datatype for SPASS-Pirate
blanchet
parents:
56254
diff
changeset
|
2393 |
|
52032 | 2394 |
fun do_ctr (s, T) = |
2395 |
let |
|
2396 |
val s' = make_fixed_const (SOME type_enc) s |
|
52038
a354c83dee43
properly handle SPASS constructors w.r.t. partially applied functions
blanchet
parents:
52035
diff
changeset
|
2397 |
val ary = ary_of T |
56636
bb8b37480d3f
declare 'bool' and its proxies as a datatype for SPASS-Pirate
blanchet
parents:
56254
diff
changeset
|
2398 |
fun mk name = SOME (mk_aterm type_enc name (robust_const_type_args thy (s, T)) []) |
52038
a354c83dee43
properly handle SPASS constructors w.r.t. partially applied functions
blanchet
parents:
52035
diff
changeset
|
2399 |
in |
56636
bb8b37480d3f
declare 'bool' and its proxies as a datatype for SPASS-Pirate
blanchet
parents:
56254
diff
changeset
|
2400 |
if T = HOLogic.boolT then |
bb8b37480d3f
declare 'bool' and its proxies as a datatype for SPASS-Pirate
blanchet
parents:
56254
diff
changeset
|
2401 |
(case proxify_const s' of |
bb8b37480d3f
declare 'bool' and its proxies as a datatype for SPASS-Pirate
blanchet
parents:
56254
diff
changeset
|
2402 |
SOME proxy_base => mk (proxy_base |>> prefix const_prefix) |
bb8b37480d3f
declare 'bool' and its proxies as a datatype for SPASS-Pirate
blanchet
parents:
56254
diff
changeset
|
2403 |
| NONE => NONE) |
bb8b37480d3f
declare 'bool' and its proxies as a datatype for SPASS-Pirate
blanchet
parents:
56254
diff
changeset
|
2404 |
else |
bb8b37480d3f
declare 'bool' and its proxies as a datatype for SPASS-Pirate
blanchet
parents:
56254
diff
changeset
|
2405 |
(case Symtab.lookup sym_tab s' of |
bb8b37480d3f
declare 'bool' and its proxies as a datatype for SPASS-Pirate
blanchet
parents:
56254
diff
changeset
|
2406 |
NONE => NONE |
bb8b37480d3f
declare 'bool' and its proxies as a datatype for SPASS-Pirate
blanchet
parents:
56254
diff
changeset
|
2407 |
| SOME ({min_ary, ...} : sym_info) => |
bb8b37480d3f
declare 'bool' and its proxies as a datatype for SPASS-Pirate
blanchet
parents:
56254
diff
changeset
|
2408 |
if ary = min_ary then mk (s', s) |
bb8b37480d3f
declare 'bool' and its proxies as a datatype for SPASS-Pirate
blanchet
parents:
56254
diff
changeset
|
2409 |
else if uncurried_aliases then mk (aliased_uncurried ary (s', s)) |
bb8b37480d3f
declare 'bool' and its proxies as a datatype for SPASS-Pirate
blanchet
parents:
56254
diff
changeset
|
2410 |
else NONE) |
52038
a354c83dee43
properly handle SPASS constructors w.r.t. partially applied functions
blanchet
parents:
52035
diff
changeset
|
2411 |
end |
56636
bb8b37480d3f
declare 'bool' and its proxies as a datatype for SPASS-Pirate
blanchet
parents:
56254
diff
changeset
|
2412 |
|
52032 | 2413 |
fun datatype_of_ctrs (ctrs as (_, T1) :: _) = |
2414 |
let val ctrs' = map do_ctr ctrs in |
|
56683
7f4ae504e059
reintroduced '...' (nonexhaustive) syntax for SPASS-Pirate
blanchet
parents:
56636
diff
changeset
|
2415 |
(native_atp_type_of_typ type_enc false 0 (body_type T1), map_filter I ctrs', |
7f4ae504e059
reintroduced '...' (nonexhaustive) syntax for SPASS-Pirate
blanchet
parents:
56636
diff
changeset
|
2416 |
forall is_some ctrs') |
52032 | 2417 |
end |
54788
a898e15b522a
primitive support for SPASS-Pirate (Daniel Wand's polymorphic SPASS prototype)
blanchet
parents:
54768
diff
changeset
|
2418 |
in |
59709 | 2419 |
ctrss |> map datatype_of_ctrs |> filter #3 |
54788
a898e15b522a
primitive support for SPASS-Pirate (Daniel Wand's polymorphic SPASS prototype)
blanchet
parents:
54768
diff
changeset
|
2420 |
end |
52032 | 2421 |
else |
2422 |
[] |
|
52038
a354c83dee43
properly handle SPASS constructors w.r.t. partially applied functions
blanchet
parents:
52035
diff
changeset
|
2423 |
| datatypes_of_sym_table _ _ _ _ _ _ = [] |
52004 | 2424 |
|
56683
7f4ae504e059
reintroduced '...' (nonexhaustive) syntax for SPASS-Pirate
blanchet
parents:
56636
diff
changeset
|
2425 |
fun decl_line_of_datatype (ty as AType (((_, s'), _), ty_args), ctrs, exhaust) = |
54820 | 2426 |
let val xs = map (fn AType ((name, _), []) => name) ty_args in |
56683
7f4ae504e059
reintroduced '...' (nonexhaustive) syntax for SPASS-Pirate
blanchet
parents:
56636
diff
changeset
|
2427 |
Datatype_Decl (datatype_decl_prefix ^ ascii_of s', map (rpair []) xs, ty, ctrs, exhaust) |
52025 | 2428 |
end |
52001
2fb33d73c366
more work on implementing datatype output for new SPASS
blanchet
parents:
51998
diff
changeset
|
2429 |
|
46392
676a4b4b6e73
implemented partial application aliases (for SPASS mainly)
blanchet
parents:
46389
diff
changeset
|
2430 |
fun pair_append (xs1, xs2) (ys1, ys2) = (xs1 @ ys1, xs2 @ ys2) |
676a4b4b6e73
implemented partial application aliases (for SPASS mainly)
blanchet
parents:
46389
diff
changeset
|
2431 |
|
61860
2ce3d12015b3
cleaner generation of metainformation in DFG format and TPTP theory exporter for Sledgehammer
blanchet
parents:
61770
diff
changeset
|
2432 |
fun do_uncurried_alias_lines_of_sym ctxt generate_info ctrss mono type_enc sym_tab0 sym_tab base_s0 |
2ce3d12015b3
cleaner generation of metainformation in DFG format and TPTP theory exporter for Sledgehammer
blanchet
parents:
61770
diff
changeset
|
2433 |
types in_conj = |
46392
676a4b4b6e73
implemented partial application aliases (for SPASS mainly)
blanchet
parents:
46389
diff
changeset
|
2434 |
let |
676a4b4b6e73
implemented partial application aliases (for SPASS mainly)
blanchet
parents:
46389
diff
changeset
|
2435 |
fun do_alias ary = |
676a4b4b6e73
implemented partial application aliases (for SPASS mainly)
blanchet
parents:
46389
diff
changeset
|
2436 |
let |
676a4b4b6e73
implemented partial application aliases (for SPASS mainly)
blanchet
parents:
46389
diff
changeset
|
2437 |
val thy = Proof_Context.theory_of ctxt |
47975
adc977fec17e
order LEO-II/Satallax definitions so that they build on each other (cf. Satallax's THF policy)
blanchet
parents:
47971
diff
changeset
|
2438 |
val (role, maybe_negate) = honor_conj_sym_role in_conj |
47768
0b2b7ff31867
don't use the native choice operator if the type encoding isn't higher-order
blanchet
parents:
47767
diff
changeset
|
2439 |
val base_name = base_s0 |> `(make_fixed_const (SOME type_enc)) |
54829 | 2440 |
val T = (case types of [T] => T | _ => robust_const_type thy base_s0) |
51920
16f3b9d4e515
proper unmangling -- the bug is visible when "uncurried_aliases" is enabled with Alt-Ergo or Poly. SPASS
blanchet
parents:
51717
diff
changeset
|
2441 |
val T_args = robust_const_type_args thy (base_s0, T) |
46392
676a4b4b6e73
implemented partial application aliases (for SPASS mainly)
blanchet
parents:
46389
diff
changeset
|
2442 |
val (base_name as (base_s, _), T_args) = |
47768
0b2b7ff31867
don't use the native choice operator if the type encoding isn't higher-order
blanchet
parents:
47767
diff
changeset
|
2443 |
mangle_type_args_in_const type_enc base_name T_args |
46402
ef8d65f64f77
change 9ce354a77908 wasn't quite right -- here's an improvement
blanchet
parents:
46400
diff
changeset
|
2444 |
val base_ary = min_ary_of sym_tab0 base_s |
46392
676a4b4b6e73
implemented partial application aliases (for SPASS mainly)
blanchet
parents:
46389
diff
changeset
|
2445 |
fun do_const name = IConst (name, T, T_args) |
52028 | 2446 |
val filter_ty_args = filter_type_args_in_iterm thy ctrss type_enc |
53586
bd5fa6425993
prefixed types and some functions with "atp_" for disambiguation
blanchet
parents:
52995
diff
changeset
|
2447 |
val atp_term_of = atp_term_of_iterm ctxt mono type_enc (SOME true) |
46392
676a4b4b6e73
implemented partial application aliases (for SPASS mainly)
blanchet
parents:
46389
diff
changeset
|
2448 |
val name1 as (s1, _) = |
46409
d4754183ccce
made option available to users (mostly for experiments)
blanchet
parents:
46406
diff
changeset
|
2449 |
base_name |> ary - 1 > base_ary ? aliased_uncurried (ary - 1) |
d4754183ccce
made option available to users (mostly for experiments)
blanchet
parents:
46406
diff
changeset
|
2450 |
val name2 as (s2, _) = base_name |> aliased_uncurried ary |
46392
676a4b4b6e73
implemented partial application aliases (for SPASS mainly)
blanchet
parents:
46389
diff
changeset
|
2451 |
val (arg_Ts, _) = chop_fun ary T |
676a4b4b6e73
implemented partial application aliases (for SPASS mainly)
blanchet
parents:
46389
diff
changeset
|
2452 |
val bound_names = |
676a4b4b6e73
implemented partial application aliases (for SPASS mainly)
blanchet
parents:
46389
diff
changeset
|
2453 |
1 upto ary |> map (`I o make_bound_var o string_of_int) |
676a4b4b6e73
implemented partial application aliases (for SPASS mainly)
blanchet
parents:
46389
diff
changeset
|
2454 |
val bounds = bound_names ~~ arg_Ts |
676a4b4b6e73
implemented partial application aliases (for SPASS mainly)
blanchet
parents:
46389
diff
changeset
|
2455 |
val (first_bounds, last_bound) = |
676a4b4b6e73
implemented partial application aliases (for SPASS mainly)
blanchet
parents:
46389
diff
changeset
|
2456 |
bounds |> map (fn (name, T) => IConst (name, T, [])) |> split_last |
676a4b4b6e73
implemented partial application aliases (for SPASS mainly)
blanchet
parents:
46389
diff
changeset
|
2457 |
val tm1 = |
47768
0b2b7ff31867
don't use the native choice operator if the type encoding isn't higher-order
blanchet
parents:
47767
diff
changeset
|
2458 |
mk_app_op type_enc (list_app (do_const name1) first_bounds) last_bound |
46437 | 2459 |
|> filter_ty_args |
2460 |
val tm2 = |
|
2461 |
list_app (do_const name2) (first_bounds @ [last_bound]) |
|
2462 |
|> filter_ty_args |
|
47768
0b2b7ff31867
don't use the native choice operator if the type encoding isn't higher-order
blanchet
parents:
47767
diff
changeset
|
2463 |
val do_bound_type = do_bound_type ctxt mono type_enc |
46392
676a4b4b6e73
implemented partial application aliases (for SPASS mainly)
blanchet
parents:
46389
diff
changeset
|
2464 |
val eq = |
54829 | 2465 |
eq_formula type_enc (atomic_types_of T) (map (apsnd do_bound_type) bounds) false |
2466 |
(atp_term_of tm1) (atp_term_of tm2) |
|
46392
676a4b4b6e73
implemented partial application aliases (for SPASS mainly)
blanchet
parents:
46389
diff
changeset
|
2467 |
in |
676a4b4b6e73
implemented partial application aliases (for SPASS mainly)
blanchet
parents:
46389
diff
changeset
|
2468 |
([tm1, tm2], |
54829 | 2469 |
[Formula ((uncurried_alias_eq_prefix ^ s2, ""), role, eq |> maybe_negate, NONE, |
61860
2ce3d12015b3
cleaner generation of metainformation in DFG format and TPTP theory exporter for Sledgehammer
blanchet
parents:
61770
diff
changeset
|
2470 |
isabelle_info generate_info non_rec_defN helper_rank)]) |
46392
676a4b4b6e73
implemented partial application aliases (for SPASS mainly)
blanchet
parents:
46389
diff
changeset
|
2471 |
|> (if ary - 1 = base_ary orelse Symtab.defined sym_tab s1 then I |
676a4b4b6e73
implemented partial application aliases (for SPASS mainly)
blanchet
parents:
46389
diff
changeset
|
2472 |
else pair_append (do_alias (ary - 1))) |
676a4b4b6e73
implemented partial application aliases (for SPASS mainly)
blanchet
parents:
46389
diff
changeset
|
2473 |
end |
676a4b4b6e73
implemented partial application aliases (for SPASS mainly)
blanchet
parents:
46389
diff
changeset
|
2474 |
in do_alias end |
55212 | 2475 |
|
61860
2ce3d12015b3
cleaner generation of metainformation in DFG format and TPTP theory exporter for Sledgehammer
blanchet
parents:
61770
diff
changeset
|
2476 |
fun uncurried_alias_lines_of_sym ctxt generate_info ctrss mono type_enc sym_tab0 sym_tab |
52026 | 2477 |
(s, {min_ary, types, in_conj, ...} : sym_info) = |
54829 | 2478 |
(case unprefix_and_unascii const_prefix s of |
46392
676a4b4b6e73
implemented partial application aliases (for SPASS mainly)
blanchet
parents:
46389
diff
changeset
|
2479 |
SOME mangled_s => |
46409
d4754183ccce
made option available to users (mostly for experiments)
blanchet
parents:
46406
diff
changeset
|
2480 |
if String.isSubstring uncurried_alias_sep mangled_s then |
54829 | 2481 |
let val base_s0 = mangled_s |> unmangled_invert_const in |
61860
2ce3d12015b3
cleaner generation of metainformation in DFG format and TPTP theory exporter for Sledgehammer
blanchet
parents:
61770
diff
changeset
|
2482 |
do_uncurried_alias_lines_of_sym ctxt generate_info ctrss mono type_enc sym_tab0 sym_tab |
2ce3d12015b3
cleaner generation of metainformation in DFG format and TPTP theory exporter for Sledgehammer
blanchet
parents:
61770
diff
changeset
|
2483 |
base_s0 types in_conj min_ary |
46392
676a4b4b6e73
implemented partial application aliases (for SPASS mainly)
blanchet
parents:
46389
diff
changeset
|
2484 |
end |
676a4b4b6e73
implemented partial application aliases (for SPASS mainly)
blanchet
parents:
46389
diff
changeset
|
2485 |
else |
676a4b4b6e73
implemented partial application aliases (for SPASS mainly)
blanchet
parents:
46389
diff
changeset
|
2486 |
([], []) |
54829 | 2487 |
| NONE => ([], [])) |
55212 | 2488 |
|
61860
2ce3d12015b3
cleaner generation of metainformation in DFG format and TPTP theory exporter for Sledgehammer
blanchet
parents:
61770
diff
changeset
|
2489 |
fun uncurried_alias_lines_of_sym_table ctxt generate_info ctrss mono type_enc uncurried_aliases |
2ce3d12015b3
cleaner generation of metainformation in DFG format and TPTP theory exporter for Sledgehammer
blanchet
parents:
61770
diff
changeset
|
2490 |
sym_tab0 sym_tab = |
46392
676a4b4b6e73
implemented partial application aliases (for SPASS mainly)
blanchet
parents:
46389
diff
changeset
|
2491 |
([], []) |
46409
d4754183ccce
made option available to users (mostly for experiments)
blanchet
parents:
46406
diff
changeset
|
2492 |
|> uncurried_aliases |
61860
2ce3d12015b3
cleaner generation of metainformation in DFG format and TPTP theory exporter for Sledgehammer
blanchet
parents:
61770
diff
changeset
|
2493 |
? Symtab.fold_rev (pair_append |
2ce3d12015b3
cleaner generation of metainformation in DFG format and TPTP theory exporter for Sledgehammer
blanchet
parents:
61770
diff
changeset
|
2494 |
o uncurried_alias_lines_of_sym ctxt generate_info ctrss mono type_enc sym_tab0 sym_tab) |
2ce3d12015b3
cleaner generation of metainformation in DFG format and TPTP theory exporter for Sledgehammer
blanchet
parents:
61770
diff
changeset
|
2495 |
sym_tab |
46392
676a4b4b6e73
implemented partial application aliases (for SPASS mainly)
blanchet
parents:
46389
diff
changeset
|
2496 |
|
52995
ab98feb66684
Vampire 3.0 requires types to be declared -- make it happy (and get rid of "implicit" types since only Satallax seems to support them anymore)
blanchet
parents:
52125
diff
changeset
|
2497 |
val implicit_declsN = "Could-be-implicit typings" |
42998
1c80902d0456
fully support all type system encodings in typed formats (TFF, THF)
blanchet
parents:
42994
diff
changeset
|
2498 |
val explicit_declsN = "Explicit typings" |
46409
d4754183ccce
made option available to users (mostly for experiments)
blanchet
parents:
46406
diff
changeset
|
2499 |
val uncurried_alias_eqsN = "Uncurried aliases" |
41157 | 2500 |
val factsN = "Relevant facts" |
48142
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
2501 |
val subclassesN = "Subclasses" |
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
2502 |
val tconsN = "Type constructors" |
41157 | 2503 |
val helpersN = "Helper facts" |
2504 |
val conjsN = "Conjectures" |
|
48142
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
2505 |
val free_typesN = "Free types" |
41157 | 2506 |
|
45828
3b8606fba2dd
correctly declare implicit TFF1 types that appear first as type arguments with "$tType" and not "$i
blanchet
parents:
45780
diff
changeset
|
2507 |
(* TFF allows implicit declarations of types, function symbols, and predicate |
3b8606fba2dd
correctly declare implicit TFF1 types that appear first as type arguments with "$tType" and not "$i
blanchet
parents:
45780
diff
changeset
|
2508 |
symbols (with "$i" as the type of individuals), but some provers (e.g., |
3b8606fba2dd
correctly declare implicit TFF1 types that appear first as type arguments with "$tType" and not "$i
blanchet
parents:
45780
diff
changeset
|
2509 |
SNARK) require explicit declarations. The situation is similar for THF. *) |
3b8606fba2dd
correctly declare implicit TFF1 types that appear first as type arguments with "$tType" and not "$i
blanchet
parents:
45780
diff
changeset
|
2510 |
|
48141 | 2511 |
fun default_type pred_sym = |
45828
3b8606fba2dd
correctly declare implicit TFF1 types that appear first as type arguments with "$tType" and not "$i
blanchet
parents:
45780
diff
changeset
|
2512 |
let |
48136
0f9939676088
removed old hack now that types and terms are cleanly distinguished in the data structure
blanchet
parents:
48135
diff
changeset
|
2513 |
fun typ 0 0 = if pred_sym then bool_atype else individual_atype |
0f9939676088
removed old hack now that types and terms are cleanly distinguished in the data structure
blanchet
parents:
48135
diff
changeset
|
2514 |
| typ 0 tm_ary = AFun (individual_atype, typ 0 (tm_ary - 1)) |
48133
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
2515 |
| typ ty_ary tm_ary = APi (replicate ty_ary tvar_a_name, typ 0 tm_ary) |
45828
3b8606fba2dd
correctly declare implicit TFF1 types that appear first as type arguments with "$tType" and not "$i
blanchet
parents:
45780
diff
changeset
|
2516 |
in typ end |
3b8606fba2dd
correctly declare implicit TFF1 types that appear first as type arguments with "$tType" and not "$i
blanchet
parents:
45780
diff
changeset
|
2517 |
|
48140 | 2518 |
fun undeclared_in_problem problem = |
45828
3b8606fba2dd
correctly declare implicit TFF1 types that appear first as type arguments with "$tType" and not "$i
blanchet
parents:
45780
diff
changeset
|
2519 |
let |
48137
6f524f2066e3
cleanly distinguish between type declarations and symbol declarations
blanchet
parents:
48136
diff
changeset
|
2520 |
fun do_sym (name as (s, _)) value = |
6f524f2066e3
cleanly distinguish between type declarations and symbol declarations
blanchet
parents:
48136
diff
changeset
|
2521 |
if is_tptp_user_symbol s then Symtab.default (s, (name, value)) else I |
48142
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
2522 |
fun do_class name = apfst (apfst (do_sym name ())) |
52001
2fb33d73c366
more work on implementing datatype output for new SPASS
blanchet
parents:
51998
diff
changeset
|
2523 |
val do_bound_tvars = fold do_class o snd |
54820 | 2524 |
fun do_type (AType ((name, _), tys)) = |
48141 | 2525 |
apfst (apsnd (do_sym name (length tys))) #> fold do_type tys |
45828
3b8606fba2dd
correctly declare implicit TFF1 types that appear first as type arguments with "$tType" and not "$i
blanchet
parents:
45780
diff
changeset
|
2526 |
| do_type (AFun (ty1, ty2)) = do_type ty1 #> do_type ty2 |
48133
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
2527 |
| do_type (APi (_, ty)) = do_type ty |
48141 | 2528 |
fun do_term pred_sym (ATerm ((name, tys), tms)) = |
54830 | 2529 |
apsnd (do_sym name (fn _ => default_type pred_sym (length tys) (length tms))) |
48132
9aa0fad4e864
added type arguments to "ATerm" constructor -- but don't use them yet
blanchet
parents:
48131
diff
changeset
|
2530 |
#> fold do_type tys #> fold (do_term false) tms |
47911
2168126446bb
extend ATP data structure to avoid having to perform ((non-)capture avoiding) beta reduction -- fixes a bug in the THF translation of "is_measure.simps"
blanchet
parents:
47905
diff
changeset
|
2531 |
| do_term _ (AAbs (((_, ty), tm), args)) = |
2168126446bb
extend ATP data structure to avoid having to perform ((non-)capture avoiding) beta reduction -- fixes a bug in the THF translation of "is_measure.simps"
blanchet
parents:
47905
diff
changeset
|
2532 |
do_type ty #> do_term false tm #> fold (do_term false) args |
48141 | 2533 |
fun do_formula (ATyQuant (_, xs, phi)) = |
54791 | 2534 |
fold (do_type o fst) xs #> fold (fold do_class o snd) xs #> do_formula phi |
2535 |
| do_formula (AQuant (_, xs, phi)) = fold do_type (map_filter snd xs) #> do_formula phi |
|
45828
3b8606fba2dd
correctly declare implicit TFF1 types that appear first as type arguments with "$tType" and not "$i
blanchet
parents:
45780
diff
changeset
|
2536 |
| do_formula (AConn (_, phis)) = fold do_formula phis |
3b8606fba2dd
correctly declare implicit TFF1 types that appear first as type arguments with "$tType" and not "$i
blanchet
parents:
45780
diff
changeset
|
2537 |
| do_formula (AAtom tm) = do_term true tm |
48142
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
2538 |
fun do_line (Class_Decl (_, _, cls)) = fold do_class cls |
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
2539 |
| do_line (Type_Decl _) = I |
48140 | 2540 |
| do_line (Sym_Decl (_, _, ty)) = do_type ty |
56683
7f4ae504e059
reintroduced '...' (nonexhaustive) syntax for SPASS-Pirate
blanchet
parents:
56636
diff
changeset
|
2541 |
| do_line (Datatype_Decl (_, xs, ty, tms, _)) = |
52001
2fb33d73c366
more work on implementing datatype output for new SPASS
blanchet
parents:
51998
diff
changeset
|
2542 |
fold do_bound_tvars xs #> do_type ty #> fold (do_term false) tms |
54791 | 2543 |
| do_line (Class_Memb (_, xs, ty, cl)) = fold do_bound_tvars xs #> do_type ty #> do_class cl |
48140 | 2544 |
| do_line (Formula (_, _, phi, _, _)) = do_formula phi |
48141 | 2545 |
val ((cls, tys), syms) = declared_in_atp_problem problem |
45828
3b8606fba2dd
correctly declare implicit TFF1 types that appear first as type arguments with "$tType" and not "$i
blanchet
parents:
45780
diff
changeset
|
2546 |
in |
48141 | 2547 |
((Symtab.empty, Symtab.empty), Symtab.empty) |
2548 |
|>> apfst (fold (fn (s, _) => Symtab.default (s, (("", ""), ()))) cls) |
|
2549 |
|>> apsnd (fold (fn (s, _) => Symtab.default (s, (("", ""), 0))) tys) |
|
48137
6f524f2066e3
cleanly distinguish between type declarations and symbol declarations
blanchet
parents:
48136
diff
changeset
|
2550 |
||> fold (fn (s, _) => Symtab.default (s, (("", ""), K tvar_a_atype))) syms |
48140 | 2551 |
|> fold (fold do_line o snd) problem |
45828
3b8606fba2dd
correctly declare implicit TFF1 types that appear first as type arguments with "$tType" and not "$i
blanchet
parents:
45780
diff
changeset
|
2552 |
end |
3b8606fba2dd
correctly declare implicit TFF1 types that appear first as type arguments with "$tType" and not "$i
blanchet
parents:
45780
diff
changeset
|
2553 |
|
48141 | 2554 |
fun declare_undeclared_in_problem heading problem = |
45828
3b8606fba2dd
correctly declare implicit TFF1 types that appear first as type arguments with "$tType" and not "$i
blanchet
parents:
45780
diff
changeset
|
2555 |
let |
48141 | 2556 |
val ((cls, tys), syms) = undeclared_in_problem problem |
45828
3b8606fba2dd
correctly declare implicit TFF1 types that appear first as type arguments with "$tType" and not "$i
blanchet
parents:
45780
diff
changeset
|
2557 |
val decls = |
47150 | 2558 |
Symtab.fold (fn (_, (("", ""), _)) => I (* already declared *) |
54830 | 2559 |
| (s, (cls, ())) => cons (Class_Decl (class_decl_prefix ^ s, cls, []))) cls [] @ |
48141 | 2560 |
Symtab.fold (fn (_, (("", ""), _)) => I (* already declared *) |
54830 | 2561 |
| (s, (ty, ary)) => cons (Type_Decl (type_decl_prefix ^ s, ty, ary))) tys [] @ |
48137
6f524f2066e3
cleanly distinguish between type declarations and symbol declarations
blanchet
parents:
48136
diff
changeset
|
2562 |
Symtab.fold (fn (_, (("", ""), _)) => I (* already declared *) |
54830 | 2563 |
| (s, (sym, ty)) => cons (Sym_Decl (sym_decl_prefix ^ s, sym, ty ()))) syms [] |
48141 | 2564 |
in (heading, decls) :: problem end |
45828
3b8606fba2dd
correctly declare implicit TFF1 types that appear first as type arguments with "$tType" and not "$i
blanchet
parents:
45780
diff
changeset
|
2565 |
|
56636
bb8b37480d3f
declare 'bool' and its proxies as a datatype for SPASS-Pirate
blanchet
parents:
56254
diff
changeset
|
2566 |
val all_ctrss_of_datatypes = map (map_filter (try dest_Const) o #ctrs) o Ctr_Sugar.ctr_sugars_of |
45945
aa8100cc02dc
no need for type arguments for monomorphic constructors of polymorphic datatypes (e.g. "Nil")
blanchet
parents:
45939
diff
changeset
|
2567 |
|
48558
fabbed3abc1e
tweaks in preparation for type encoding evaluation
blanchet
parents:
48538
diff
changeset
|
2568 |
val app_op_and_predicator_threshold = 45 |
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
|
2569 |
|
61860
2ce3d12015b3
cleaner generation of metainformation in DFG format and TPTP theory exporter for Sledgehammer
blanchet
parents:
61770
diff
changeset
|
2570 |
fun generate_atp_problem ctxt generate_info format prem_role type_enc mode lam_trans |
2ce3d12015b3
cleaner generation of metainformation in DFG format and TPTP theory exporter for Sledgehammer
blanchet
parents:
61770
diff
changeset
|
2571 |
uncurried_aliases readable_names presimp hyp_ts concl_t facts = |
38282
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
2572 |
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
|
2573 |
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
|
2574 |
val type_enc = type_enc |> adjust_type_enc format |
62718 | 2575 |
val completish = (case mode of Sledgehammer_Completish k => k | _ => 0) |
46389 | 2576 |
(* Forcing explicit applications is expensive for polymorphic encodings, |
2577 |
because it takes only one existential variable ranging over "'a => 'b" to |
|
2578 |
ruin everything. Hence we do it only if there are few facts (which is |
|
2579 |
normally the case for "metis" and the minimizer). *) |
|
46392
676a4b4b6e73
implemented partial application aliases (for SPASS mainly)
blanchet
parents:
46389
diff
changeset
|
2580 |
val app_op_level = |
62718 | 2581 |
if completish > 0 then |
47946
33afcfad3f8d
add an experimental "aggressive" mode to Sledgehammer, to experiment with more complete translations of higher-order features without breaking "metis"
blanchet
parents:
47944
diff
changeset
|
2582 |
Full_App_Op_And_Predicator |
54109
80660c529d74
addressed rare case where the same symbol would be treated alternately as a function and as a predicate -- adding "top2I top_boolI" to a problem that didn't talk about "top" was a way to trigger the issue
blanchet
parents:
54089
diff
changeset
|
2583 |
else if length facts + length hyp_ts >= app_op_and_predicator_threshold then |
80660c529d74
addressed rare case where the same symbol would be treated alternately as a function and as a predicate -- adding "top2I top_boolI" to a problem that didn't talk about "top" was a way to trigger the issue
blanchet
parents:
54089
diff
changeset
|
2584 |
if is_type_enc_polymorphic type_enc then Min_App_Op else Sufficient_App_Op |
46370 | 2585 |
else |
47073
c73f7b0c7ebc
generate weights and precedences for predicates as well
blanchet
parents:
47046
diff
changeset
|
2586 |
Sufficient_App_Op_And_Predicator |
45514 | 2587 |
val lam_trans = |
54109
80660c529d74
addressed rare case where the same symbol would be treated alternately as a function and as a predicate -- adding "top2I top_boolI" to a problem that didn't talk about "top" was a way to trigger the issue
blanchet
parents:
54089
diff
changeset
|
2588 |
if lam_trans = keep_lamsN andalso not (is_type_enc_higher_order type_enc) then liftingN |
80660c529d74
addressed rare case where the same symbol would be treated alternately as a function and as a predicate -- adding "top2I top_boolI" to a problem that didn't talk about "top" was a way to trigger the issue
blanchet
parents:
54089
diff
changeset
|
2589 |
else lam_trans |
57263 | 2590 |
val (classes, conjs, facts, subclass_pairs, tcon_clauses, lifted) = |
54434 | 2591 |
translate_formulas ctxt prem_role format type_enc lam_trans presimp hyp_ts concl_t facts |
54109
80660c529d74
addressed rare case where the same symbol would be treated alternately as a function and as a predicate -- adding "top2I top_boolI" to a problem that didn't talk about "top" was a way to trigger the issue
blanchet
parents:
54089
diff
changeset
|
2592 |
val (_, sym_tab0) = sym_table_of_facts ctxt type_enc app_op_level conjs facts |
57481
84bbdbf1b2da
reverted 9512b867259c -- appears to break 'metis'
blanchet
parents:
57470
diff
changeset
|
2593 |
val mono = conjs @ facts |> mononotonicity_info_of_facts ctxt type_enc completish |
54554
b8d0d8407c3b
eliminated Sledgehammer's dependency on old-style datatypes
blanchet
parents:
54434
diff
changeset
|
2594 |
val ctrss = all_ctrss_of_datatypes ctxt |
46400
9ce354a77908
don't introduce new symbols in helpers -- makes problems unprovable
blanchet
parents:
46399
diff
changeset
|
2595 |
fun firstorderize in_helper = |
54830 | 2596 |
firstorderize_fact thy ctrss type_enc (uncurried_aliases andalso not in_helper) completish |
2597 |
sym_tab0 |
|
59058
a78612c67ec0
renamed "pairself" to "apply2", in accordance to @{apply 2};
wenzelm
parents:
58477
diff
changeset
|
2598 |
val (conjs, facts) = (conjs, facts) |> apply2 (map (firstorderize false)) |
47932
ce4178e037a7
get ready for automatic generation of extensionality helpers
blanchet
parents:
47925
diff
changeset
|
2599 |
val (ho_stuff, sym_tab) = |
51998
f732a674db1b
renamed Sledgehammer functions with 'for' in their names to 'of'
blanchet
parents:
51921
diff
changeset
|
2600 |
sym_table_of_facts ctxt type_enc Min_App_Op conjs facts |
47932
ce4178e037a7
get ready for automatic generation of extensionality helpers
blanchet
parents:
47925
diff
changeset
|
2601 |
val (uncurried_alias_eq_tms, uncurried_alias_eq_lines) = |
61860
2ce3d12015b3
cleaner generation of metainformation in DFG format and TPTP theory exporter for Sledgehammer
blanchet
parents:
61770
diff
changeset
|
2602 |
uncurried_alias_lines_of_sym_table ctxt generate_info ctrss mono type_enc uncurried_aliases |
2ce3d12015b3
cleaner generation of metainformation in DFG format and TPTP theory exporter for Sledgehammer
blanchet
parents:
61770
diff
changeset
|
2603 |
sym_tab0 sym_tab |
47932
ce4178e037a7
get ready for automatic generation of extensionality helpers
blanchet
parents:
47925
diff
changeset
|
2604 |
val (_, sym_tab) = |
ce4178e037a7
get ready for automatic generation of extensionality helpers
blanchet
parents:
47925
diff
changeset
|
2605 |
(ho_stuff, sym_tab) |
ce4178e037a7
get ready for automatic generation of extensionality helpers
blanchet
parents:
47925
diff
changeset
|
2606 |
|> fold (add_iterm_syms_to_sym_table ctxt Min_App_Op false false) |
ce4178e037a7
get ready for automatic generation of extensionality helpers
blanchet
parents:
47925
diff
changeset
|
2607 |
uncurried_alias_eq_tms |
57481
84bbdbf1b2da
reverted 9512b867259c -- appears to break 'metis'
blanchet
parents:
57470
diff
changeset
|
2608 |
val helpers = |
84bbdbf1b2da
reverted 9512b867259c -- appears to break 'metis'
blanchet
parents:
57470
diff
changeset
|
2609 |
sym_tab |> helper_facts_of_sym_table ctxt format type_enc completish |
84bbdbf1b2da
reverted 9512b867259c -- appears to break 'metis'
blanchet
parents:
57470
diff
changeset
|
2610 |
|> map (firstorderize true) |
84bbdbf1b2da
reverted 9512b867259c -- appears to break 'metis'
blanchet
parents:
57470
diff
changeset
|
2611 |
val all_facts = helpers @ conjs @ facts |
84bbdbf1b2da
reverted 9512b867259c -- appears to break 'metis'
blanchet
parents:
57470
diff
changeset
|
2612 |
val mono_Ts = monotonic_types_of_facts ctxt mono type_enc all_facts |
54830 | 2613 |
val datatypes = datatypes_of_sym_table ctxt ctrss format type_enc uncurried_aliases sym_tab |
51998
f732a674db1b
renamed Sledgehammer functions with 'for' in their names to 'of'
blanchet
parents:
51921
diff
changeset
|
2614 |
val class_decl_lines = decl_lines_of_classes type_enc classes |
42680 | 2615 |
val sym_decl_lines = |
46409
d4754183ccce
made option available to users (mostly for experiments)
blanchet
parents:
46406
diff
changeset
|
2616 |
(conjs, helpers @ facts, uncurried_alias_eq_tms) |
51998
f732a674db1b
renamed Sledgehammer functions with 'for' in their names to 'of'
blanchet
parents:
51921
diff
changeset
|
2617 |
|> sym_decl_table_of_facts thy type_enc sym_tab |
61860
2ce3d12015b3
cleaner generation of metainformation in DFG format and TPTP theory exporter for Sledgehammer
blanchet
parents:
61770
diff
changeset
|
2618 |
|> lines_of_sym_decl_table ctxt generate_info mono type_enc mono_Ts |
52025 | 2619 |
val datatype_decl_lines = map decl_line_of_datatype datatypes |
52001
2fb33d73c366
more work on implementing datatype output for new SPASS
blanchet
parents:
51998
diff
changeset
|
2620 |
val decl_lines = class_decl_lines @ sym_decl_lines @ datatype_decl_lines |
57481
84bbdbf1b2da
reverted 9512b867259c -- appears to break 'metis'
blanchet
parents:
57470
diff
changeset
|
2621 |
val num_facts = length facts |
84bbdbf1b2da
reverted 9512b867259c -- appears to break 'metis'
blanchet
parents:
57470
diff
changeset
|
2622 |
val freshen = mode <> Exporter andalso mode <> Translator |
84bbdbf1b2da
reverted 9512b867259c -- appears to break 'metis'
blanchet
parents:
57470
diff
changeset
|
2623 |
val pos = mode <> Exporter |
84bbdbf1b2da
reverted 9512b867259c -- appears to break 'metis'
blanchet
parents:
57470
diff
changeset
|
2624 |
val rank_of = rank_of_fact_num num_facts |
46406 | 2625 |
val fact_lines = |
61860
2ce3d12015b3
cleaner generation of metainformation in DFG format and TPTP theory exporter for Sledgehammer
blanchet
parents:
61770
diff
changeset
|
2626 |
map (line_of_fact ctxt generate_info fact_prefix ascii_of I freshen pos mono type_enc rank_of) |
57481
84bbdbf1b2da
reverted 9512b867259c -- appears to break 'metis'
blanchet
parents:
57470
diff
changeset
|
2627 |
(0 upto num_facts - 1 ~~ facts) |
61860
2ce3d12015b3
cleaner generation of metainformation in DFG format and TPTP theory exporter for Sledgehammer
blanchet
parents:
61770
diff
changeset
|
2628 |
val subclass_lines = maps (lines_of_subclass_pair generate_info type_enc) subclass_pairs |
2ce3d12015b3
cleaner generation of metainformation in DFG format and TPTP theory exporter for Sledgehammer
blanchet
parents:
61770
diff
changeset
|
2629 |
val tcon_lines = map (line_of_tcon_clause generate_info type_enc) tcon_clauses |
42881
dbdfe2d5b6ab
automatically use "metisFT" when typed helpers are necessary
blanchet
parents:
42879
diff
changeset
|
2630 |
val helper_lines = |
57481
84bbdbf1b2da
reverted 9512b867259c -- appears to break 'metis'
blanchet
parents:
57470
diff
changeset
|
2631 |
0 upto length helpers - 1 ~~ helpers |
61860
2ce3d12015b3
cleaner generation of metainformation in DFG format and TPTP theory exporter for Sledgehammer
blanchet
parents:
61770
diff
changeset
|
2632 |
|> map (line_of_fact ctxt generate_info helper_prefix I (K "") false true mono type_enc |
2ce3d12015b3
cleaner generation of metainformation in DFG format and TPTP theory exporter for Sledgehammer
blanchet
parents:
61770
diff
changeset
|
2633 |
(K default_rank)) |
51998
f732a674db1b
renamed Sledgehammer functions with 'for' in their names to 'of'
blanchet
parents:
51921
diff
changeset
|
2634 |
val free_type_lines = lines_of_free_types type_enc (facts @ conjs) |
f732a674db1b
renamed Sledgehammer functions with 'for' in their names to 'of'
blanchet
parents:
51921
diff
changeset
|
2635 |
val conj_lines = map (line_of_conjecture ctxt mono type_enc) conjs |
48005
eeede26f2721
killed SPASS 3.5/3.7 FLOTTER hack -- requires users to upgrade to SPASS 3.8
blanchet
parents:
48004
diff
changeset
|
2636 |
(* Reordering these might confuse the proof reconstruction code. *) |
57481
84bbdbf1b2da
reverted 9512b867259c -- appears to break 'metis'
blanchet
parents:
57470
diff
changeset
|
2637 |
val problem = |
52001
2fb33d73c366
more work on implementing datatype output for new SPASS
blanchet
parents:
51998
diff
changeset
|
2638 |
[(explicit_declsN, decl_lines), |
46409
d4754183ccce
made option available to users (mostly for experiments)
blanchet
parents:
46406
diff
changeset
|
2639 |
(uncurried_alias_eqsN, uncurried_alias_eq_lines), |
46406 | 2640 |
(factsN, fact_lines), |
48142
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
2641 |
(subclassesN, subclass_lines), |
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
2642 |
(tconsN, tcon_lines), |
42881
dbdfe2d5b6ab
automatically use "metisFT" when typed helpers are necessary
blanchet
parents:
42879
diff
changeset
|
2643 |
(helpersN, helper_lines), |
48141 | 2644 |
(free_typesN, free_type_lines), |
48146 | 2645 |
(conjsN, conj_lines)] |
57481
84bbdbf1b2da
reverted 9512b867259c -- appears to break 'metis'
blanchet
parents:
57470
diff
changeset
|
2646 |
val problem = |
84bbdbf1b2da
reverted 9512b867259c -- appears to break 'metis'
blanchet
parents:
57470
diff
changeset
|
2647 |
problem |
54830 | 2648 |
|> (case format of |
2649 |
CNF => ensure_cnf_problem |
|
2650 |
| CNF_UEQ => filter_cnf_ueq_problem |
|
2651 |
| FOF => I |
|
2652 |
| _ => declare_undeclared_in_problem implicit_declsN) |
|
57481
84bbdbf1b2da
reverted 9512b867259c -- appears to break 'metis'
blanchet
parents:
57470
diff
changeset
|
2653 |
val (problem, pool) = problem |> nice_atp_problem readable_names format |
54830 | 2654 |
fun add_sym_ary (s, {min_ary, ...} : sym_info) = 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
|
2655 |
in |
57263 | 2656 |
(problem, Option.map snd pool |> the_default Symtab.empty, lifted, |
2657 |
Symtab.fold add_sym_ary sym_tab Symtab.empty) |
|
38282
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
2658 |
end |
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
2659 |
|
41313
a96ac4d180b7
optionally supply constant weights to E -- turned off by default until properly parameterized
blanchet
parents:
41211
diff
changeset
|
2660 |
(* FUDGE *) |
a96ac4d180b7
optionally supply constant weights to E -- turned off by default until properly parameterized
blanchet
parents:
41211
diff
changeset
|
2661 |
val conj_weight = 0.0 |
41770 | 2662 |
val hyp_weight = 0.1 |
2663 |
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
|
2664 |
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
|
2665 |
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
|
2666 |
|
46442
1e07620d724c
added possibility of generating KBO weights to DFG problems
blanchet
parents:
46437
diff
changeset
|
2667 |
(* Weights are from 0.0 (most important) to 1.0 (least important). *) |
47030 | 2668 |
fun atp_problem_selection_weights problem = |
41313
a96ac4d180b7
optionally supply constant weights to E -- turned off by default until properly parameterized
blanchet
parents:
41211
diff
changeset
|
2669 |
let |
48132
9aa0fad4e864
added type arguments to "ATerm" constructor -- but don't use them yet
blanchet
parents:
48131
diff
changeset
|
2670 |
fun add_term_weights weight (ATerm ((s, _), tms)) = |
54830 | 2671 |
is_tptp_user_symbol s ? Symtab.default (s, weight) #> fold (add_term_weights weight) tms |
47911
2168126446bb
extend ATP data structure to avoid having to perform ((non-)capture avoiding) beta reduction -- fixes a bug in the THF translation of "is_measure.simps"
blanchet
parents:
47905
diff
changeset
|
2672 |
| add_term_weights weight (AAbs ((_, tm), args)) = |
2168126446bb
extend ATP data structure to avoid having to perform ((non-)capture avoiding) beta reduction -- fixes a bug in the THF translation of "is_measure.simps"
blanchet
parents:
47905
diff
changeset
|
2673 |
add_term_weights weight tm #> fold (add_term_weights weight) args |
46442
1e07620d724c
added possibility of generating KBO weights to DFG problems
blanchet
parents:
46437
diff
changeset
|
2674 |
fun add_line_weights weight (Formula (_, _, phi, _, _)) = |
1e07620d724c
added possibility of generating KBO weights to DFG problems
blanchet
parents:
46437
diff
changeset
|
2675 |
formula_fold NONE (K (add_term_weights weight)) phi |
1e07620d724c
added possibility of generating KBO weights to DFG problems
blanchet
parents:
46437
diff
changeset
|
2676 |
| add_line_weights _ _ = I |
1e07620d724c
added possibility of generating KBO weights to DFG problems
blanchet
parents:
46437
diff
changeset
|
2677 |
fun add_conjectures_weights [] = I |
1e07620d724c
added possibility of generating KBO weights to DFG problems
blanchet
parents:
46437
diff
changeset
|
2678 |
| add_conjectures_weights conjs = |
1e07620d724c
added possibility of generating KBO weights to DFG problems
blanchet
parents:
46437
diff
changeset
|
2679 |
let val (hyps, conj) = split_last conjs in |
1e07620d724c
added possibility of generating KBO weights to DFG problems
blanchet
parents:
46437
diff
changeset
|
2680 |
add_line_weights conj_weight conj |
1e07620d724c
added possibility of generating KBO weights to DFG problems
blanchet
parents:
46437
diff
changeset
|
2681 |
#> fold (add_line_weights hyp_weight) hyps |
1e07620d724c
added possibility of generating KBO weights to DFG problems
blanchet
parents:
46437
diff
changeset
|
2682 |
end |
1e07620d724c
added possibility of generating KBO weights to DFG problems
blanchet
parents:
46437
diff
changeset
|
2683 |
fun add_facts_weights facts = |
1e07620d724c
added possibility of generating KBO weights to DFG problems
blanchet
parents:
46437
diff
changeset
|
2684 |
let |
1e07620d724c
added possibility of generating KBO weights to DFG problems
blanchet
parents:
46437
diff
changeset
|
2685 |
val num_facts = length facts |
1e07620d724c
added possibility of generating KBO weights to DFG problems
blanchet
parents:
46437
diff
changeset
|
2686 |
fun weight_of j = |
1e07620d724c
added possibility of generating KBO weights to DFG problems
blanchet
parents:
46437
diff
changeset
|
2687 |
fact_min_weight + (fact_max_weight - fact_min_weight) * Real.fromInt j |
1e07620d724c
added possibility of generating KBO weights to DFG problems
blanchet
parents:
46437
diff
changeset
|
2688 |
/ Real.fromInt num_facts |
1e07620d724c
added possibility of generating KBO weights to DFG problems
blanchet
parents:
46437
diff
changeset
|
2689 |
in |
57481
84bbdbf1b2da
reverted 9512b867259c -- appears to break 'metis'
blanchet
parents:
57470
diff
changeset
|
2690 |
map weight_of (0 upto num_facts - 1) ~~ facts |
46442
1e07620d724c
added possibility of generating KBO weights to DFG problems
blanchet
parents:
46437
diff
changeset
|
2691 |
|> fold (uncurry add_line_weights) |
1e07620d724c
added possibility of generating KBO weights to DFG problems
blanchet
parents:
46437
diff
changeset
|
2692 |
end |
1e07620d724c
added possibility of generating KBO weights to DFG problems
blanchet
parents:
46437
diff
changeset
|
2693 |
val get = these o AList.lookup (op =) problem |
41313
a96ac4d180b7
optionally supply constant weights to E -- turned off by default until properly parameterized
blanchet
parents:
41211
diff
changeset
|
2694 |
in |
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
|
2695 |
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
|
2696 |
|> 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
|
2697 |
|> add_facts_weights (get factsN) |
46442
1e07620d724c
added possibility of generating KBO weights to DFG problems
blanchet
parents:
46437
diff
changeset
|
2698 |
|> fold (fold (add_line_weights type_info_default_weight) o get) |
48142
efaff8206967
finished implementation of DFG type class output
blanchet
parents:
48141
diff
changeset
|
2699 |
[explicit_declsN, subclassesN, tconsN] |
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
|
2700 |
|> Symtab.dest |
59058
a78612c67ec0
renamed "pairself" to "apply2", in accordance to @{apply 2};
wenzelm
parents:
58477
diff
changeset
|
2701 |
|> sort (prod_ord Real.compare string_ord o apply2 swap) |
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
|
2702 |
end |
41313
a96ac4d180b7
optionally supply constant weights to E -- turned off by default until properly parameterized
blanchet
parents:
41211
diff
changeset
|
2703 |
|
47073
c73f7b0c7ebc
generate weights and precedences for predicates as well
blanchet
parents:
47046
diff
changeset
|
2704 |
(* Ugly hack: may make innocent victims (collateral damage) *) |
c73f7b0c7ebc
generate weights and precedences for predicates as well
blanchet
parents:
47046
diff
changeset
|
2705 |
fun may_be_app s args = String.isPrefix app_op_name s andalso length args = 2 |
c73f7b0c7ebc
generate weights and precedences for predicates as well
blanchet
parents:
47046
diff
changeset
|
2706 |
fun may_be_predicator s = |
c73f7b0c7ebc
generate weights and precedences for predicates as well
blanchet
parents:
47046
diff
changeset
|
2707 |
member (op =) [predicator_name, prefixed_predicator_name] s |
c73f7b0c7ebc
generate weights and precedences for predicates as well
blanchet
parents:
47046
diff
changeset
|
2708 |
|
54830 | 2709 |
fun strip_predicator (tm as ATerm ((s, _), [tm'])) = if may_be_predicator s then tm' else tm |
47073
c73f7b0c7ebc
generate weights and precedences for predicates as well
blanchet
parents:
47046
diff
changeset
|
2710 |
| strip_predicator tm = tm |
c73f7b0c7ebc
generate weights and precedences for predicates as well
blanchet
parents:
47046
diff
changeset
|
2711 |
|
48132
9aa0fad4e864
added type arguments to "ATerm" constructor -- but don't use them yet
blanchet
parents:
48131
diff
changeset
|
2712 |
fun make_head_roll (ATerm ((s, _), tms)) = |
54830 | 2713 |
if may_be_app s tms then make_head_roll (hd tms) ||> append (tl tms) else (s, tms) |
47032 | 2714 |
| make_head_roll _ = ("", []) |
46443
c86276014571
improved KBO weights -- beware of explicit applications
blanchet
parents:
46442
diff
changeset
|
2715 |
|
48133
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
2716 |
fun strip_up_to_predicator (ATyQuant (_, _, phi)) = strip_up_to_predicator phi |
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
2717 |
| strip_up_to_predicator (AQuant (_, _, phi)) = strip_up_to_predicator phi |
47073
c73f7b0c7ebc
generate weights and precedences for predicates as well
blanchet
parents:
47046
diff
changeset
|
2718 |
| strip_up_to_predicator (AConn (_, phis)) = maps strip_up_to_predicator phis |
c73f7b0c7ebc
generate weights and precedences for predicates as well
blanchet
parents:
47046
diff
changeset
|
2719 |
| strip_up_to_predicator (AAtom tm) = [strip_predicator tm] |
c73f7b0c7ebc
generate weights and precedences for predicates as well
blanchet
parents:
47046
diff
changeset
|
2720 |
|
48133
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
2721 |
fun strip_ahorn_etc (ATyQuant (_, _, phi)) = strip_ahorn_etc phi |
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
2722 |
| strip_ahorn_etc (AQuant (_, _, phi)) = strip_ahorn_etc phi |
47073
c73f7b0c7ebc
generate weights and precedences for predicates as well
blanchet
parents:
47046
diff
changeset
|
2723 |
| strip_ahorn_etc (AConn (AImplies, [phi1, phi2])) = |
c73f7b0c7ebc
generate weights and precedences for predicates as well
blanchet
parents:
47046
diff
changeset
|
2724 |
strip_ahorn_etc phi2 |>> append (strip_up_to_predicator phi1) |
c73f7b0c7ebc
generate weights and precedences for predicates as well
blanchet
parents:
47046
diff
changeset
|
2725 |
| strip_ahorn_etc phi = ([], hd (strip_up_to_predicator phi)) |
c73f7b0c7ebc
generate weights and precedences for predicates as well
blanchet
parents:
47046
diff
changeset
|
2726 |
|
48133
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
2727 |
fun strip_iff_etc (ATyQuant (_, _, phi)) = strip_iff_etc phi |
a5ab5964065f
implement polymorphic DFG output, without type classes for now
blanchet
parents:
48132
diff
changeset
|
2728 |
| strip_iff_etc (AQuant (_, _, phi)) = strip_iff_etc phi |
59058
a78612c67ec0
renamed "pairself" to "apply2", in accordance to @{apply 2};
wenzelm
parents:
58477
diff
changeset
|
2729 |
| strip_iff_etc (AConn (AIff, [phi1, phi2])) = apply2 strip_up_to_predicator (phi1, phi2) |
47073
c73f7b0c7ebc
generate weights and precedences for predicates as well
blanchet
parents:
47046
diff
changeset
|
2730 |
| strip_iff_etc _ = ([], []) |
c73f7b0c7ebc
generate weights and precedences for predicates as well
blanchet
parents:
47046
diff
changeset
|
2731 |
|
47030 | 2732 |
val max_term_order_weight = 2147483647 |
46450 | 2733 |
|
47038
2409b484e1cc
continued implementation of term ordering attributes
blanchet
parents:
47032
diff
changeset
|
2734 |
fun atp_problem_term_order_info problem = |
46442
1e07620d724c
added possibility of generating KBO weights to DFG problems
blanchet
parents:
46437
diff
changeset
|
2735 |
let |
47038
2409b484e1cc
continued implementation of term ordering attributes
blanchet
parents:
47032
diff
changeset
|
2736 |
fun add_edge s s' = |
2409b484e1cc
continued implementation of term ordering attributes
blanchet
parents:
47032
diff
changeset
|
2737 |
Graph.default_node (s, ()) |
2409b484e1cc
continued implementation of term ordering attributes
blanchet
parents:
47032
diff
changeset
|
2738 |
#> Graph.default_node (s', ()) |
2409b484e1cc
continued implementation of term ordering attributes
blanchet
parents:
47032
diff
changeset
|
2739 |
#> Graph.add_edge_acyclic (s, s') |
48132
9aa0fad4e864
added type arguments to "ATerm" constructor -- but don't use them yet
blanchet
parents:
48131
diff
changeset
|
2740 |
fun add_term_deps head (ATerm ((s, _), args)) = |
47073
c73f7b0c7ebc
generate weights and precedences for predicates as well
blanchet
parents:
47046
diff
changeset
|
2741 |
if is_tptp_user_symbol head then |
c73f7b0c7ebc
generate weights and precedences for predicates as well
blanchet
parents:
47046
diff
changeset
|
2742 |
(if is_tptp_user_symbol s then perhaps (try (add_edge s head)) else I) |
c73f7b0c7ebc
generate weights and precedences for predicates as well
blanchet
parents:
47046
diff
changeset
|
2743 |
#> fold (add_term_deps head) args |
c73f7b0c7ebc
generate weights and precedences for predicates as well
blanchet
parents:
47046
diff
changeset
|
2744 |
else |
c73f7b0c7ebc
generate weights and precedences for predicates as well
blanchet
parents:
47046
diff
changeset
|
2745 |
I |
47911
2168126446bb
extend ATP data structure to avoid having to perform ((non-)capture avoiding) beta reduction -- fixes a bug in the THF translation of "is_measure.simps"
blanchet
parents:
47905
diff
changeset
|
2746 |
| add_term_deps head (AAbs ((_, tm), args)) = |
2168126446bb
extend ATP data structure to avoid having to perform ((non-)capture avoiding) beta reduction -- fixes a bug in the THF translation of "is_measure.simps"
blanchet
parents:
47905
diff
changeset
|
2747 |
add_term_deps head tm #> fold (add_term_deps head) args |
47073
c73f7b0c7ebc
generate weights and precedences for predicates as well
blanchet
parents:
47046
diff
changeset
|
2748 |
fun add_intro_deps pred (Formula (_, role, phi, _, info)) = |
c73f7b0c7ebc
generate weights and precedences for predicates as well
blanchet
parents:
47046
diff
changeset
|
2749 |
if pred (role, info) then |
c73f7b0c7ebc
generate weights and precedences for predicates as well
blanchet
parents:
47046
diff
changeset
|
2750 |
let val (hyps, concl) = strip_ahorn_etc phi in |
54829 | 2751 |
(case make_head_roll concl of |
47073
c73f7b0c7ebc
generate weights and precedences for predicates as well
blanchet
parents:
47046
diff
changeset
|
2752 |
(head, args as _ :: _) => fold (add_term_deps head) (hyps @ args) |
54829 | 2753 |
| _ => I) |
47073
c73f7b0c7ebc
generate weights and precedences for predicates as well
blanchet
parents:
47046
diff
changeset
|
2754 |
end |
c73f7b0c7ebc
generate weights and precedences for predicates as well
blanchet
parents:
47046
diff
changeset
|
2755 |
else |
c73f7b0c7ebc
generate weights and precedences for predicates as well
blanchet
parents:
47046
diff
changeset
|
2756 |
I |
c73f7b0c7ebc
generate weights and precedences for predicates as well
blanchet
parents:
47046
diff
changeset
|
2757 |
| add_intro_deps _ _ = I |
48132
9aa0fad4e864
added type arguments to "ATerm" constructor -- but don't use them yet
blanchet
parents:
48131
diff
changeset
|
2758 |
fun add_atom_eq_deps (SOME true) (ATerm ((s, _), [lhs as _, rhs])) = |
46443
c86276014571
improved KBO weights -- beware of explicit applications
blanchet
parents:
46442
diff
changeset
|
2759 |
if is_tptp_equal s then |
54829 | 2760 |
(case make_head_roll lhs of |
47073
c73f7b0c7ebc
generate weights and precedences for predicates as well
blanchet
parents:
47046
diff
changeset
|
2761 |
(head, args as _ :: _) => fold (add_term_deps head) (rhs :: args) |
54829 | 2762 |
| _ => I) |
46443
c86276014571
improved KBO weights -- beware of explicit applications
blanchet
parents:
46442
diff
changeset
|
2763 |
else |
c86276014571
improved KBO weights -- beware of explicit applications
blanchet
parents:
46442
diff
changeset
|
2764 |
I |
47073
c73f7b0c7ebc
generate weights and precedences for predicates as well
blanchet
parents:
47046
diff
changeset
|
2765 |
| add_atom_eq_deps _ _ = I |
c73f7b0c7ebc
generate weights and precedences for predicates as well
blanchet
parents:
47046
diff
changeset
|
2766 |
fun add_eq_deps pred (Formula (_, role, phi, _, info)) = |
47039
1b36a05a070d
added "metis_advisory_simp" option to orient as many equations as possible in Metis the right way (cf. "More SPASS with Isabelle")
blanchet
parents:
47038
diff
changeset
|
2767 |
if pred (role, info) then |
54829 | 2768 |
(case strip_iff_etc phi of |
47073
c73f7b0c7ebc
generate weights and precedences for predicates as well
blanchet
parents:
47046
diff
changeset
|
2769 |
([lhs], rhs) => |
c73f7b0c7ebc
generate weights and precedences for predicates as well
blanchet
parents:
47046
diff
changeset
|
2770 |
(case make_head_roll lhs of |
54829 | 2771 |
(head, args as _ :: _) => fold (add_term_deps head) (rhs @ args) |
2772 |
| _ => I) |
|
2773 |
| _ => formula_fold (SOME (role <> Conjecture)) add_atom_eq_deps phi) |
|
46442
1e07620d724c
added possibility of generating KBO weights to DFG problems
blanchet
parents:
46437
diff
changeset
|
2774 |
else |
1e07620d724c
added possibility of generating KBO weights to DFG problems
blanchet
parents:
46437
diff
changeset
|
2775 |
I |
47073
c73f7b0c7ebc
generate weights and precedences for predicates as well
blanchet
parents:
47046
diff
changeset
|
2776 |
| add_eq_deps _ _ = I |
47971 | 2777 |
fun has_status status (_, info) = extract_isabelle_status info = SOME status |
47039
1b36a05a070d
added "metis_advisory_simp" option to orient as many equations as possible in Metis the right way (cf. "More SPASS with Isabelle")
blanchet
parents:
47038
diff
changeset
|
2778 |
fun is_conj (role, _) = (role = Conjecture orelse role = Hypothesis) |
46442
1e07620d724c
added possibility of generating KBO weights to DFG problems
blanchet
parents:
46437
diff
changeset
|
2779 |
val graph = |
47039
1b36a05a070d
added "metis_advisory_simp" option to orient as many equations as possible in Metis the right way (cf. "More SPASS with Isabelle")
blanchet
parents:
47038
diff
changeset
|
2780 |
Graph.empty |
48438
3e45c98fe127
distinguish between recursive and nonrecursive definitions + clean up typedef dependencies in MaSh
blanchet
parents:
48324
diff
changeset
|
2781 |
|> fold (fold (add_eq_deps (has_status non_rec_defN)) o snd) problem |
3e45c98fe127
distinguish between recursive and nonrecursive definitions + clean up typedef dependencies in MaSh
blanchet
parents:
48324
diff
changeset
|
2782 |
|> fold (fold (add_eq_deps (has_status rec_defN orf has_status simpN |
3e45c98fe127
distinguish between recursive and nonrecursive definitions + clean up typedef dependencies in MaSh
blanchet
parents:
48324
diff
changeset
|
2783 |
orf is_conj)) o snd) problem |
47148
7b5846065c1b
be less forceful about ":lt" to make infinite loops less likely (could still fail with mutually recursive tail rec functions)
blanchet
parents:
47145
diff
changeset
|
2784 |
|> fold (fold (add_intro_deps (has_status inductiveN)) o snd) problem |
47073
c73f7b0c7ebc
generate weights and precedences for predicates as well
blanchet
parents:
47046
diff
changeset
|
2785 |
|> fold (fold (add_intro_deps (has_status introN)) o snd) problem |
47030 | 2786 |
fun next_weight w = if w + w <= max_term_order_weight then w + w else w + 1 |
46442
1e07620d724c
added possibility of generating KBO weights to DFG problems
blanchet
parents:
46437
diff
changeset
|
2787 |
fun add_weights _ [] = I |
1e07620d724c
added possibility of generating KBO weights to DFG problems
blanchet
parents:
46437
diff
changeset
|
2788 |
| add_weights weight syms = |
1e07620d724c
added possibility of generating KBO weights to DFG problems
blanchet
parents:
46437
diff
changeset
|
2789 |
fold (AList.update (op =) o rpair weight) syms |
1e07620d724c
added possibility of generating KBO weights to DFG problems
blanchet
parents:
46437
diff
changeset
|
2790 |
#> add_weights (next_weight weight) |
1e07620d724c
added possibility of generating KBO weights to DFG problems
blanchet
parents:
46437
diff
changeset
|
2791 |
(fold (union (op =) o Graph.immediate_succs graph) syms []) |
1e07620d724c
added possibility of generating KBO weights to DFG problems
blanchet
parents:
46437
diff
changeset
|
2792 |
in |
52030 | 2793 |
(* Sorting is not just for aesthetics: It specifies the precedence order for |
2794 |
the term ordering (KBO or LPO), from smaller to larger values. *) |
|
59058
a78612c67ec0
renamed "pairself" to "apply2", in accordance to @{apply 2};
wenzelm
parents:
58477
diff
changeset
|
2795 |
[] |> add_weights 1 (Graph.minimals graph) |> sort (int_ord o apply2 snd) |
46442
1e07620d724c
added possibility of generating KBO weights to DFG problems
blanchet
parents:
46437
diff
changeset
|
2796 |
end |
1e07620d724c
added possibility of generating KBO weights to DFG problems
blanchet
parents:
46437
diff
changeset
|
2797 |
|
38282
319c59682c51
move Sledgehammer's HOL -> FOL translation to separate file (sledgehammer_translate.ML)
blanchet
parents:
diff
changeset
|
2798 |
end; |