author | blanchet |
Wed, 21 Aug 2013 14:54:25 +0200 | |
changeset 53127 | 60801776d8af |
parent 53121 | 5f727525b1ac |
child 53140 | a1235e90da5f |
permissions | -rw-r--r-- |
48234 | 1 |
(* Title: HOL/TPTP/mash_export.ML |
2 |
Author: Jasmin Blanchette, TU Muenchen |
|
3 |
Copyright 2012 |
|
4 |
||
5 |
Export Isabelle theory information for MaSh (Machine-learning for Sledgehammer). |
|
6 |
*) |
|
7 |
||
8 |
signature MASH_EXPORT = |
|
9 |
sig |
|
48251
6cdcfbddc077
moved most of MaSh exporter code to Sledgehammer
blanchet
parents:
48250
diff
changeset
|
10 |
type params = Sledgehammer_Provers.params |
48235 | 11 |
|
50349 | 12 |
val generate_accessibility : |
13 |
Proof.context -> theory list -> bool -> string -> unit |
|
48318 | 14 |
val generate_features : |
51182
962190eab40d
provide two modes for MaSh driver: linearized or real visibility
blanchet
parents:
51177
diff
changeset
|
15 |
Proof.context -> string -> theory list -> string -> unit |
48333 | 16 |
val generate_isar_dependencies : |
50349 | 17 |
Proof.context -> theory list -> bool -> string -> unit |
50484
8ec31bdb9d36
adopt the neutral "prover" terminology for MaSh rather than the ambiguous/wrong ATP terminology (which sometimes excludes SMT solvers)
blanchet
parents:
50442
diff
changeset
|
18 |
val generate_prover_dependencies : |
50559
89c0d2f13cca
MaSh exporter can now export subsets of the facts, as consecutive ranges
blanchet
parents:
50523
diff
changeset
|
19 |
Proof.context -> params -> int * int option -> theory list -> bool -> string |
89c0d2f13cca
MaSh exporter can now export subsets of the facts, as consecutive ranges
blanchet
parents:
50523
diff
changeset
|
20 |
-> unit |
50411 | 21 |
val generate_isar_commands : |
51182
962190eab40d
provide two modes for MaSh driver: linearized or real visibility
blanchet
parents:
51177
diff
changeset
|
22 |
Proof.context -> string -> (int * int option) * int -> theory list -> bool |
53120 | 23 |
-> int -> string -> unit |
50484
8ec31bdb9d36
adopt the neutral "prover" terminology for MaSh rather than the ambiguous/wrong ATP terminology (which sometimes excludes SMT solvers)
blanchet
parents:
50442
diff
changeset
|
24 |
val generate_prover_commands : |
51182
962190eab40d
provide two modes for MaSh driver: linearized or real visibility
blanchet
parents:
51177
diff
changeset
|
25 |
Proof.context -> params -> (int * int option) * int -> theory list -> bool |
53120 | 26 |
-> int -> string -> unit |
48379
2b5ad61e2ccc
renamed "iter" fact filter to "MePo" (Meng--Paulson)
blanchet
parents:
48378
diff
changeset
|
27 |
val generate_mepo_suggestions : |
51182
962190eab40d
provide two modes for MaSh driver: linearized or real visibility
blanchet
parents:
51177
diff
changeset
|
28 |
Proof.context -> params -> (int * int option) * int -> theory list -> bool |
962190eab40d
provide two modes for MaSh driver: linearized or real visibility
blanchet
parents:
51177
diff
changeset
|
29 |
-> int -> string -> unit |
50814 | 30 |
val generate_mesh_suggestions : int -> string -> string -> string -> unit |
48234 | 31 |
end; |
32 |
||
33 |
structure MaSh_Export : MASH_EXPORT = |
|
34 |
struct |
|
35 |
||
50485
3c6ac2da2f45
merge aliased theorems in MaSh dependencies, modulo symmetry of equality
blanchet
parents:
50484
diff
changeset
|
36 |
open Sledgehammer_Fact |
48381 | 37 |
open Sledgehammer_MePo |
38 |
open Sledgehammer_MaSh |
|
48245 | 39 |
|
50559
89c0d2f13cca
MaSh exporter can now export subsets of the facts, as consecutive ranges
blanchet
parents:
50523
diff
changeset
|
40 |
fun in_range (from, to) j = |
89c0d2f13cca
MaSh exporter can now export subsets of the facts, as consecutive ranges
blanchet
parents:
50523
diff
changeset
|
41 |
j >= from andalso (to = NONE orelse j <= the to) |
89c0d2f13cca
MaSh exporter can now export subsets of the facts, as consecutive ranges
blanchet
parents:
50523
diff
changeset
|
42 |
|
50349 | 43 |
fun has_thm_thy th thy = |
48316
252f45c04042
drastic overhaul of MaSh data structures + fixed a few performance issues
blanchet
parents:
48315
diff
changeset
|
44 |
Context.theory_name thy = Context.theory_name (theory_of_thm th) |
252f45c04042
drastic overhaul of MaSh data structures + fixed a few performance issues
blanchet
parents:
48315
diff
changeset
|
45 |
|
50349 | 46 |
fun has_thys thys th = exists (has_thm_thy th) thys |
47 |
||
48 |
fun all_facts ctxt = |
|
48531 | 49 |
let val css = Sledgehammer_Fact.clasimpset_rule_table_of ctxt in |
50442
4f6a4d32522c
don't blacklist "case" theorems -- this causes problems in MaSh later
blanchet
parents:
50434
diff
changeset
|
50 |
Sledgehammer_Fact.all_facts ctxt true false Symtab.empty [] [] css |
51135 | 51 |
|> sort (crude_thm_ord o pairself snd) |
48531 | 52 |
end |
53 |
||
51182
962190eab40d
provide two modes for MaSh driver: linearized or real visibility
blanchet
parents:
51177
diff
changeset
|
54 |
fun filter_accessible_from th = filter (fn (_, th') => thm_less (th', th)) |
962190eab40d
provide two modes for MaSh driver: linearized or real visibility
blanchet
parents:
51177
diff
changeset
|
55 |
|
962190eab40d
provide two modes for MaSh driver: linearized or real visibility
blanchet
parents:
51177
diff
changeset
|
56 |
fun generate_accessibility ctxt thys linearize file_name = |
48304 | 57 |
let |
58 |
val path = file_name |> Path.explode |
|
59 |
val _ = File.write path "" |
|
51182
962190eab40d
provide two modes for MaSh driver: linearized or real visibility
blanchet
parents:
51177
diff
changeset
|
60 |
fun do_fact (parents, fact) prevs = |
48304 | 61 |
let |
51182
962190eab40d
provide two modes for MaSh driver: linearized or real visibility
blanchet
parents:
51177
diff
changeset
|
62 |
val parents = if linearize then prevs else parents |
962190eab40d
provide two modes for MaSh driver: linearized or real visibility
blanchet
parents:
51177
diff
changeset
|
63 |
val s = encode_str fact ^ ": " ^ encode_strs parents ^ "\n" |
48304 | 64 |
val _ = File.append path s |
65 |
in [fact] end |
|
50611
99af6b652b3a
linearize eval driver, to work around horrible bug in previous implementation
blanchet
parents:
50582
diff
changeset
|
66 |
val facts = |
50349 | 67 |
all_facts ctxt |
51182
962190eab40d
provide two modes for MaSh driver: linearized or real visibility
blanchet
parents:
51177
diff
changeset
|
68 |
|> filter_out (has_thys thys o snd) |
962190eab40d
provide two modes for MaSh driver: linearized or real visibility
blanchet
parents:
51177
diff
changeset
|
69 |
|> attach_parents_to_facts [] |
962190eab40d
provide two modes for MaSh driver: linearized or real visibility
blanchet
parents:
51177
diff
changeset
|
70 |
|> map (apsnd (nickname_of_thm o snd)) |
50611
99af6b652b3a
linearize eval driver, to work around horrible bug in previous implementation
blanchet
parents:
50582
diff
changeset
|
71 |
in fold do_fact facts []; () end |
48304 | 72 |
|
51182
962190eab40d
provide two modes for MaSh driver: linearized or real visibility
blanchet
parents:
51177
diff
changeset
|
73 |
fun generate_features ctxt prover thys file_name = |
48304 | 74 |
let |
75 |
val path = file_name |> Path.explode |
|
76 |
val _ = File.write path "" |
|
51182
962190eab40d
provide two modes for MaSh driver: linearized or real visibility
blanchet
parents:
51177
diff
changeset
|
77 |
val facts = all_facts ctxt |> filter_out (has_thys thys o snd) |
48385 | 78 |
fun do_fact ((_, stature), th) = |
48304 | 79 |
let |
50624
4d0997abce79
improved thm order hack, in case the default names are overridden
blanchet
parents:
50611
diff
changeset
|
80 |
val name = nickname_of_thm th |
48318 | 81 |
val feats = |
53127 | 82 |
features_of ctxt prover (theory_of_thm th) 0 Symtab.empty stature |
83 |
[prop_of th] |
|
84 |
|> map fst |
|
50582 | 85 |
val s = |
53127 | 86 |
encode_str name ^ ": " ^ encode_strs (sort string_ord feats) ^ "\n" |
48304 | 87 |
in File.append path s end |
88 |
in List.app do_fact facts end |
|
89 |
||
51034 | 90 |
val prover_marker = "$a" |
51033
177db6811f11
added markers in proofs identifying origin of proofs, in eval driver
blanchet
parents:
51020
diff
changeset
|
91 |
val isar_marker = "$i" |
177db6811f11
added markers in proofs identifying origin of proofs, in eval driver
blanchet
parents:
51020
diff
changeset
|
92 |
val omitted_marker = "$o" |
51034 | 93 |
val unprovable_marker = "$u" (* axiom or definition or characteristic theorem *) |
51033
177db6811f11
added markers in proofs identifying origin of proofs, in eval driver
blanchet
parents:
51020
diff
changeset
|
94 |
val prover_failed_marker = "$x" |
177db6811f11
added markers in proofs identifying origin of proofs, in eval driver
blanchet
parents:
51020
diff
changeset
|
95 |
|
177db6811f11
added markers in proofs identifying origin of proofs, in eval driver
blanchet
parents:
51020
diff
changeset
|
96 |
fun smart_dependencies_of ctxt params_opt facts name_tabs th isar_deps_opt = |
177db6811f11
added markers in proofs identifying origin of proofs, in eval driver
blanchet
parents:
51020
diff
changeset
|
97 |
let |
177db6811f11
added markers in proofs identifying origin of proofs, in eval driver
blanchet
parents:
51020
diff
changeset
|
98 |
val (marker, deps) = |
177db6811f11
added markers in proofs identifying origin of proofs, in eval driver
blanchet
parents:
51020
diff
changeset
|
99 |
case params_opt of |
177db6811f11
added markers in proofs identifying origin of proofs, in eval driver
blanchet
parents:
51020
diff
changeset
|
100 |
SOME (params as {provers = prover :: _, ...}) => |
177db6811f11
added markers in proofs identifying origin of proofs, in eval driver
blanchet
parents:
51020
diff
changeset
|
101 |
prover_dependencies_of ctxt params prover 0 facts name_tabs th |
177db6811f11
added markers in proofs identifying origin of proofs, in eval driver
blanchet
parents:
51020
diff
changeset
|
102 |
|>> (fn true => prover_marker | false => prover_failed_marker) |
177db6811f11
added markers in proofs identifying origin of proofs, in eval driver
blanchet
parents:
51020
diff
changeset
|
103 |
| NONE => |
177db6811f11
added markers in proofs identifying origin of proofs, in eval driver
blanchet
parents:
51020
diff
changeset
|
104 |
let |
177db6811f11
added markers in proofs identifying origin of proofs, in eval driver
blanchet
parents:
51020
diff
changeset
|
105 |
val deps = |
177db6811f11
added markers in proofs identifying origin of proofs, in eval driver
blanchet
parents:
51020
diff
changeset
|
106 |
case isar_deps_opt of |
177db6811f11
added markers in proofs identifying origin of proofs, in eval driver
blanchet
parents:
51020
diff
changeset
|
107 |
SOME deps => deps |
177db6811f11
added markers in proofs identifying origin of proofs, in eval driver
blanchet
parents:
51020
diff
changeset
|
108 |
| NONE => isar_dependencies_of name_tabs th |
51034 | 109 |
in (if null deps then unprovable_marker else isar_marker, deps) end |
51033
177db6811f11
added markers in proofs identifying origin of proofs, in eval driver
blanchet
parents:
51020
diff
changeset
|
110 |
in |
51177 | 111 |
case trim_dependencies deps of |
51033
177db6811f11
added markers in proofs identifying origin of proofs, in eval driver
blanchet
parents:
51020
diff
changeset
|
112 |
SOME deps => (marker, deps) |
177db6811f11
added markers in proofs identifying origin of proofs, in eval driver
blanchet
parents:
51020
diff
changeset
|
113 |
| NONE => (omitted_marker, []) |
177db6811f11
added markers in proofs identifying origin of proofs, in eval driver
blanchet
parents:
51020
diff
changeset
|
114 |
end |
50411 | 115 |
|
51182
962190eab40d
provide two modes for MaSh driver: linearized or real visibility
blanchet
parents:
51177
diff
changeset
|
116 |
fun generate_isar_or_prover_dependencies ctxt params_opt range thys linearize |
50484
8ec31bdb9d36
adopt the neutral "prover" terminology for MaSh rather than the ambiguous/wrong ATP terminology (which sometimes excludes SMT solvers)
blanchet
parents:
50442
diff
changeset
|
117 |
file_name = |
48304 | 118 |
let |
119 |
val path = file_name |> Path.explode |
|
51182
962190eab40d
provide two modes for MaSh driver: linearized or real visibility
blanchet
parents:
51177
diff
changeset
|
120 |
val facts = all_facts ctxt |> filter_out (has_thys thys o snd) |
50735
6b232d76cbc9
refined class handling, to prevent cycles in fact graph
blanchet
parents:
50624
diff
changeset
|
121 |
val name_tabs = build_name_tables nickname_of_thm facts |
50559
89c0d2f13cca
MaSh exporter can now export subsets of the facts, as consecutive ranges
blanchet
parents:
50523
diff
changeset
|
122 |
fun do_fact (j, (_, th)) = |
89c0d2f13cca
MaSh exporter can now export subsets of the facts, as consecutive ranges
blanchet
parents:
50523
diff
changeset
|
123 |
if in_range range j then |
89c0d2f13cca
MaSh exporter can now export subsets of the facts, as consecutive ranges
blanchet
parents:
50523
diff
changeset
|
124 |
let |
50624
4d0997abce79
improved thm order hack, in case the default names are overridden
blanchet
parents:
50611
diff
changeset
|
125 |
val name = nickname_of_thm th |
50561 | 126 |
val _ = tracing ("Fact " ^ string_of_int j ^ ": " ^ name) |
51182
962190eab40d
provide two modes for MaSh driver: linearized or real visibility
blanchet
parents:
51177
diff
changeset
|
127 |
val access_facts = |
962190eab40d
provide two modes for MaSh driver: linearized or real visibility
blanchet
parents:
51177
diff
changeset
|
128 |
if linearize then take (j - 1) facts |
962190eab40d
provide two modes for MaSh driver: linearized or real visibility
blanchet
parents:
51177
diff
changeset
|
129 |
else facts |> filter_accessible_from th |
51033
177db6811f11
added markers in proofs identifying origin of proofs, in eval driver
blanchet
parents:
51020
diff
changeset
|
130 |
val (marker, deps) = |
51182
962190eab40d
provide two modes for MaSh driver: linearized or real visibility
blanchet
parents:
51177
diff
changeset
|
131 |
smart_dependencies_of ctxt params_opt access_facts name_tabs th NONE |
51033
177db6811f11
added markers in proofs identifying origin of proofs, in eval driver
blanchet
parents:
51020
diff
changeset
|
132 |
in encode_str name ^ ": " ^ marker ^ " " ^ encode_strs deps ^ "\n" end |
50559
89c0d2f13cca
MaSh exporter can now export subsets of the facts, as consecutive ranges
blanchet
parents:
50523
diff
changeset
|
133 |
else |
89c0d2f13cca
MaSh exporter can now export subsets of the facts, as consecutive ranges
blanchet
parents:
50523
diff
changeset
|
134 |
"" |
89c0d2f13cca
MaSh exporter can now export subsets of the facts, as consecutive ranges
blanchet
parents:
50523
diff
changeset
|
135 |
val lines = Par_List.map do_fact (tag_list 1 facts) |
50519 | 136 |
in File.write_list path lines end |
48304 | 137 |
|
50411 | 138 |
fun generate_isar_dependencies ctxt = |
50559
89c0d2f13cca
MaSh exporter can now export subsets of the facts, as consecutive ranges
blanchet
parents:
50523
diff
changeset
|
139 |
generate_isar_or_prover_dependencies ctxt NONE (1, NONE) |
50411 | 140 |
|
50484
8ec31bdb9d36
adopt the neutral "prover" terminology for MaSh rather than the ambiguous/wrong ATP terminology (which sometimes excludes SMT solvers)
blanchet
parents:
50442
diff
changeset
|
141 |
fun generate_prover_dependencies ctxt params = |
8ec31bdb9d36
adopt the neutral "prover" terminology for MaSh rather than the ambiguous/wrong ATP terminology (which sometimes excludes SMT solvers)
blanchet
parents:
50442
diff
changeset
|
142 |
generate_isar_or_prover_dependencies ctxt (SOME params) |
50411 | 143 |
|
50954 | 144 |
fun is_bad_query ctxt ho_atp step j th isar_deps = |
145 |
j mod step <> 0 orelse |
|
50859
c0f38015a632
don't generate queries with empty dependency list
blanchet
parents:
50829
diff
changeset
|
146 |
Thm.legacy_get_kind th = "" orelse |
51020 | 147 |
null isar_deps orelse |
50523
0799339fea0f
get rid of some junk facts in the MaSh evaluation driver
blanchet
parents:
50519
diff
changeset
|
148 |
is_blacklisted_or_something ctxt ho_atp (Thm.get_name_hint th) |
50515
c4a27ab89c9b
shared bad MaSh query detection between MePo and MaSh, so that the generated files mirror each other
blanchet
parents:
50511
diff
changeset
|
149 |
|
50954 | 150 |
fun generate_isar_or_prover_commands ctxt prover params_opt (range, step) thys |
53120 | 151 |
linearize max_suggs file_name = |
48234 | 152 |
let |
50511
8825c36cb1ce
don't query blacklisted theorems in evaluation driver
blanchet
parents:
50485
diff
changeset
|
153 |
val ho_atp = Sledgehammer_Provers.is_ho_atp ctxt prover |
48234 | 154 |
val path = file_name |> Path.explode |
50349 | 155 |
val facts = all_facts ctxt |
50485
3c6ac2da2f45
merge aliased theorems in MaSh dependencies, modulo symmetry of equality
blanchet
parents:
50484
diff
changeset
|
156 |
val (new_facts, old_facts) = facts |> List.partition (has_thys thys o snd) |
53127 | 157 |
val num_old_facts = length old_facts |
50735
6b232d76cbc9
refined class handling, to prevent cycles in fact graph
blanchet
parents:
50624
diff
changeset
|
158 |
val name_tabs = build_name_tables nickname_of_thm facts |
53127 | 159 |
fun do_fact (j, |
160 |
(((name, (parents, ((_, stature), th))), prevs), const_tab)) = |
|
50559
89c0d2f13cca
MaSh exporter can now export subsets of the facts, as consecutive ranges
blanchet
parents:
50523
diff
changeset
|
161 |
if in_range range j then |
89c0d2f13cca
MaSh exporter can now export subsets of the facts, as consecutive ranges
blanchet
parents:
50523
diff
changeset
|
162 |
let |
50561 | 163 |
val _ = tracing ("Fact " ^ string_of_int j ^ ": " ^ name) |
53127 | 164 |
val isar_deps = isar_dependencies_of name_tabs th |
165 |
val do_query = not (is_bad_query ctxt ho_atp step j th isar_deps) |
|
50559
89c0d2f13cca
MaSh exporter can now export subsets of the facts, as consecutive ranges
blanchet
parents:
50523
diff
changeset
|
166 |
val feats = |
53127 | 167 |
features_of ctxt prover (theory_of_thm th) (num_old_facts + j) |
168 |
const_tab stature [prop_of th] |
|
53121
5f727525b1ac
only generate feature weights for queries -- they're not used elsewhere
blanchet
parents:
53120
diff
changeset
|
169 |
|> sort_wrt fst |
51182
962190eab40d
provide two modes for MaSh driver: linearized or real visibility
blanchet
parents:
51177
diff
changeset
|
170 |
val access_facts = |
962190eab40d
provide two modes for MaSh driver: linearized or real visibility
blanchet
parents:
51177
diff
changeset
|
171 |
(if linearize then take (j - 1) new_facts |
962190eab40d
provide two modes for MaSh driver: linearized or real visibility
blanchet
parents:
51177
diff
changeset
|
172 |
else new_facts |> filter_accessible_from th) @ old_facts |
51033
177db6811f11
added markers in proofs identifying origin of proofs, in eval driver
blanchet
parents:
51020
diff
changeset
|
173 |
val (marker, deps) = |
51182
962190eab40d
provide two modes for MaSh driver: linearized or real visibility
blanchet
parents:
51177
diff
changeset
|
174 |
smart_dependencies_of ctxt params_opt access_facts name_tabs th |
51033
177db6811f11
added markers in proofs identifying origin of proofs, in eval driver
blanchet
parents:
51020
diff
changeset
|
175 |
(SOME isar_deps) |
51182
962190eab40d
provide two modes for MaSh driver: linearized or real visibility
blanchet
parents:
51177
diff
changeset
|
176 |
val parents = if linearize then prevs else parents |
50559
89c0d2f13cca
MaSh exporter can now export subsets of the facts, as consecutive ranges
blanchet
parents:
50523
diff
changeset
|
177 |
val query = |
53127 | 178 |
if do_query then |
53121
5f727525b1ac
only generate feature weights for queries -- they're not used elsewhere
blanchet
parents:
53120
diff
changeset
|
179 |
"? " ^ string_of_int max_suggs ^ " # " ^ |
5f727525b1ac
only generate feature weights for queries -- they're not used elsewhere
blanchet
parents:
53120
diff
changeset
|
180 |
encode_str name ^ ": " ^ encode_strs parents ^ "; " ^ |
5f727525b1ac
only generate feature weights for queries -- they're not used elsewhere
blanchet
parents:
53120
diff
changeset
|
181 |
encode_features feats ^ "\n" |
53127 | 182 |
else |
183 |
"" |
|
50754
74a6adcb96ac
also generate queries for goals with too many Isar dependencies
blanchet
parents:
50735
diff
changeset
|
184 |
val update = |
53121
5f727525b1ac
only generate feature weights for queries -- they're not used elsewhere
blanchet
parents:
53120
diff
changeset
|
185 |
"! " ^ encode_str name ^ ": " ^ encode_strs parents ^ "; " ^ |
5f727525b1ac
only generate feature weights for queries -- they're not used elsewhere
blanchet
parents:
53120
diff
changeset
|
186 |
encode_strs (map fst feats) ^ "; " ^ marker ^ " " ^ |
5f727525b1ac
only generate feature weights for queries -- they're not used elsewhere
blanchet
parents:
53120
diff
changeset
|
187 |
encode_strs deps ^ "\n" |
50559
89c0d2f13cca
MaSh exporter can now export subsets of the facts, as consecutive ranges
blanchet
parents:
50523
diff
changeset
|
188 |
in query ^ update end |
89c0d2f13cca
MaSh exporter can now export subsets of the facts, as consecutive ranges
blanchet
parents:
50523
diff
changeset
|
189 |
else |
89c0d2f13cca
MaSh exporter can now export subsets of the facts, as consecutive ranges
blanchet
parents:
50523
diff
changeset
|
190 |
"" |
51182
962190eab40d
provide two modes for MaSh driver: linearized or real visibility
blanchet
parents:
51177
diff
changeset
|
191 |
val new_facts = |
962190eab40d
provide two modes for MaSh driver: linearized or real visibility
blanchet
parents:
51177
diff
changeset
|
192 |
new_facts |> attach_parents_to_facts old_facts |
962190eab40d
provide two modes for MaSh driver: linearized or real visibility
blanchet
parents:
51177
diff
changeset
|
193 |
|> map (`(nickname_of_thm o snd o snd)) |
962190eab40d
provide two modes for MaSh driver: linearized or real visibility
blanchet
parents:
51177
diff
changeset
|
194 |
val hd_prevs = |
50624
4d0997abce79
improved thm order hack, in case the default names are overridden
blanchet
parents:
50611
diff
changeset
|
195 |
map (nickname_of_thm o snd) (the_list (try List.last old_facts)) |
53127 | 196 |
val prevss = hd_prevs :: map (single o fst) new_facts |> split_last |> fst |
197 |
val hd_const_tabs = |
|
198 |
fold (add_const_counts o prop_of o snd) old_facts Symtab.empty |
|
199 |
val (const_tabs, _) = |
|
200 |
fold_map (`I oo add_const_counts o prop_of o snd o snd o snd) new_facts |
|
201 |
hd_const_tabs |
|
202 |
val lines = |
|
203 |
Par_List.map do_fact (tag_list 1 (new_facts ~~ prevss ~~ const_tabs)) |
|
50519 | 204 |
in File.write_list path lines end |
48239
0016290f904c
generate Meng--Paulson facts for evaluation purposes
blanchet
parents:
48235
diff
changeset
|
205 |
|
50411 | 206 |
fun generate_isar_commands ctxt prover = |
50954 | 207 |
generate_isar_or_prover_commands ctxt prover NONE |
50411 | 208 |
|
50484
8ec31bdb9d36
adopt the neutral "prover" terminology for MaSh rather than the ambiguous/wrong ATP terminology (which sometimes excludes SMT solvers)
blanchet
parents:
50442
diff
changeset
|
209 |
fun generate_prover_commands ctxt (params as {provers = prover :: _, ...}) = |
8ec31bdb9d36
adopt the neutral "prover" terminology for MaSh rather than the ambiguous/wrong ATP terminology (which sometimes excludes SMT solvers)
blanchet
parents:
50442
diff
changeset
|
210 |
generate_isar_or_prover_commands ctxt prover (SOME params) |
50411 | 211 |
|
50906 | 212 |
fun generate_mepo_suggestions ctxt (params as {provers = prover :: _, ...}) |
51182
962190eab40d
provide two modes for MaSh driver: linearized or real visibility
blanchet
parents:
51177
diff
changeset
|
213 |
(range, step) thys linearize max_suggs file_name = |
48239
0016290f904c
generate Meng--Paulson facts for evaluation purposes
blanchet
parents:
48235
diff
changeset
|
214 |
let |
50515
c4a27ab89c9b
shared bad MaSh query detection between MePo and MaSh, so that the generated files mirror each other
blanchet
parents:
50511
diff
changeset
|
215 |
val ho_atp = Sledgehammer_Provers.is_ho_atp ctxt prover |
48239
0016290f904c
generate Meng--Paulson facts for evaluation purposes
blanchet
parents:
48235
diff
changeset
|
216 |
val path = file_name |> Path.explode |
50349 | 217 |
val facts = all_facts ctxt |
50485
3c6ac2da2f45
merge aliased theorems in MaSh dependencies, modulo symmetry of equality
blanchet
parents:
50484
diff
changeset
|
218 |
val (new_facts, old_facts) = facts |> List.partition (has_thys thys o snd) |
50735
6b232d76cbc9
refined class handling, to prevent cycles in fact graph
blanchet
parents:
50624
diff
changeset
|
219 |
val name_tabs = build_name_tables nickname_of_thm facts |
50814 | 220 |
fun do_fact (j, ((_, th), old_facts)) = |
50906 | 221 |
if in_range range j then |
222 |
let |
|
223 |
val name = nickname_of_thm th |
|
224 |
val _ = tracing ("Fact " ^ string_of_int j ^ ": " ^ name) |
|
225 |
val goal = goal_of_thm (Proof_Context.theory_of ctxt) th |
|
52196
2281f33e8da6
redid rac7830871177 to avoid duplicate fixed variable (e.g. lemma "P (a::nat)" proof - have "!!a::int. Q a" sledgehammer [e])
blanchet
parents:
52125
diff
changeset
|
226 |
val (_, hyp_ts, concl_t) = ATP_Util.strip_subgoal goal 1 ctxt |
50906 | 227 |
val isar_deps = isar_dependencies_of name_tabs th |
228 |
in |
|
50954 | 229 |
if is_bad_query ctxt ho_atp step j th isar_deps then |
50906 | 230 |
"" |
231 |
else |
|
232 |
let |
|
233 |
val suggs = |
|
234 |
old_facts |
|
51182
962190eab40d
provide two modes for MaSh driver: linearized or real visibility
blanchet
parents:
51177
diff
changeset
|
235 |
|> linearize ? filter_accessible_from th |
50906 | 236 |
|> Sledgehammer_MePo.mepo_suggested_facts ctxt params prover |
237 |
max_suggs NONE hyp_ts concl_t |
|
238 |
|> map (nickname_of_thm o snd) |
|
239 |
in encode_str name ^ ": " ^ encode_strs suggs ^ "\n" end |
|
240 |
end |
|
241 |
else |
|
242 |
"" |
|
50519 | 243 |
fun accum x (yss as ys :: _) = (x :: ys) :: yss |
244 |
val old_factss = tl (fold accum new_facts [old_facts]) |
|
50814 | 245 |
val lines = Par_List.map do_fact (tag_list 1 (new_facts ~~ rev old_factss)) |
50519 | 246 |
in File.write_list path lines end |
48234 | 247 |
|
50814 | 248 |
fun generate_mesh_suggestions max_suggs mash_file_name mepo_file_name |
249 |
mesh_file_name = |
|
250 |
let |
|
251 |
val mesh_path = Path.explode mesh_file_name |
|
252 |
val _ = File.write mesh_path "" |
|
253 |
fun do_fact (mash_line, mepo_line) = |
|
254 |
let |
|
50829 | 255 |
val (name, mash_suggs) = |
50814 | 256 |
extract_suggestions mash_line |
50965 | 257 |
||> weight_mash_facts |
50829 | 258 |
val (name', mepo_suggs) = |
50814 | 259 |
extract_suggestions mepo_line |
50965 | 260 |
||> weight_mepo_facts |
50829 | 261 |
val _ = if name = name' then () else error "Input files out of sync." |
50814 | 262 |
val mess = |
263 |
[(mepo_weight, (mepo_suggs, [])), |
|
264 |
(mash_weight, (mash_suggs, []))] |
|
265 |
val mesh_suggs = mesh_facts (op =) max_suggs mess |
|
50829 | 266 |
val mesh_line = encode_str name ^ ": " ^ encode_strs mesh_suggs ^ "\n" |
50814 | 267 |
in File.append mesh_path mesh_line end |
268 |
val mash_lines = Path.explode mash_file_name |> File.read_lines |
|
269 |
val mepo_lines = Path.explode mepo_file_name |> File.read_lines |
|
50907 | 270 |
in |
271 |
if length mash_lines = length mepo_lines then |
|
272 |
List.app do_fact (mash_lines ~~ mepo_lines) |
|
273 |
else |
|
274 |
warning "Skipped: MaSh file missing or out of sync with MePo file." |
|
275 |
end |
|
50814 | 276 |
|
48234 | 277 |
end; |