author | blanchet |
Sun, 15 Dec 2013 18:54:26 +0100 | |
changeset 54756 | dd0f4d265730 |
parent 54755 | 2eb43ddde491 |
child 54757 | 4960647932ec |
permissions | -rw-r--r-- |
49883 | 1 |
(* Title: HOL/Tools/Sledgehammer/sledgehammer_reconstruct.ML |
2 |
Author: Jasmin Blanchette, TU Muenchen |
|
3 |
Author: Steffen Juilf Smolka, TU Muenchen |
|
4 |
||
49914 | 5 |
Isar proof reconstruction from ATP proofs. |
49883 | 6 |
*) |
7 |
||
52374 | 8 |
signature SLEDGEHAMMER_RECONSTRUCT = |
49883 | 9 |
sig |
54495 | 10 |
type ('a, 'b) atp_step = ('a, 'b) ATP_Proof.atp_step |
53586
bd5fa6425993
prefixed types and some functions with "atp_" for disambiguation
blanchet
parents:
53052
diff
changeset
|
11 |
type 'a atp_proof = 'a ATP_Proof.atp_proof |
49914 | 12 |
type stature = ATP_Problem_Generate.stature |
54495 | 13 |
type one_line_params = Sledgehammer_Reconstructor.one_line_params |
49914 | 14 |
|
15 |
type isar_params = |
|
54505 | 16 |
bool * bool * string * string * Time.time option * real * bool * (term, string) atp_step list * |
17 |
thm |
|
49914 | 18 |
|
49883 | 19 |
val isar_proof_text : |
53052
a0db255af8c5
sledgehammer sendback always uses Markup.padding_command: sensible default for most practical applications -- old-style in-line replacement is superseded by auto mode or panel;
wenzelm
parents:
53047
diff
changeset
|
20 |
Proof.context -> bool option -> isar_params -> one_line_params -> string |
49883 | 21 |
val proof_text : |
54500 | 22 |
Proof.context -> bool option -> (unit -> isar_params) -> int -> one_line_params -> string |
49883 | 23 |
end; |
24 |
||
54751 | 25 |
structure Sledgehammer_Reconstruct : SLEDGEHAMMER_RECONSTRUCT = |
49883 | 26 |
struct |
27 |
||
28 |
open ATP_Util |
|
49914 | 29 |
open ATP_Problem |
49883 | 30 |
open ATP_Proof |
31 |
open ATP_Problem_Generate |
|
32 |
open ATP_Proof_Reconstruct |
|
49918
cf441f4a358b
renamed Isar-proof related options + changed semantics of Isar shrinking
blanchet
parents:
49917
diff
changeset
|
33 |
open Sledgehammer_Util |
52555 | 34 |
open Sledgehammer_Reconstructor |
50264
a9ec48b98734
renamed sledgehammer_isar_reconstruct to sledgehammer_proof
smolkas
parents:
50262
diff
changeset
|
35 |
open Sledgehammer_Proof |
50258 | 36 |
open Sledgehammer_Annotate |
52555 | 37 |
open Sledgehammer_Print |
52556
c8357085217c
completely rewrote SH compress; added two parameters for experimentation/fine grained control
smolkas
parents:
52555
diff
changeset
|
38 |
open Sledgehammer_Preplay |
51130
76d68444cd59
renamed sledgehammer_shrink to sledgehammer_compress
smolkas
parents:
51129
diff
changeset
|
39 |
open Sledgehammer_Compress |
52592
8a25b17e3d79
optimize isar-proofs by trying different proof methods
smolkas
parents:
52556
diff
changeset
|
40 |
open Sledgehammer_Try0 |
52611
831f7479c74f
minimize dependencies (used facts) of Isar proof steps; remove unreferenced steps
smolkas
parents:
52592
diff
changeset
|
41 |
open Sledgehammer_Minimize_Isar |
49914 | 42 |
|
43 |
structure String_Redirect = ATP_Proof_Redirect( |
|
53586
bd5fa6425993
prefixed types and some functions with "atp_" for disambiguation
blanchet
parents:
53052
diff
changeset
|
44 |
type key = atp_step_name |
49914 | 45 |
val ord = fn ((s, _ : string list), (s', _)) => fast_string_ord (s, s') |
46 |
val string_of = fst) |
|
47 |
||
49883 | 48 |
open String_Redirect |
49 |
||
54746 | 50 |
fun maybe_mk_Trueprop t = t |> fastype_of t = HOLogic.boolT ? HOLogic.mk_Trueprop |
51 |
val maybe_dest_Trueprop = perhaps (try HOLogic.dest_Trueprop) |
|
52 |
||
53 |
val e_skolemize_rule = "skolemize" |
|
54 |
val vampire_skolemisation_rule = "skolemisation" |
|
55 |
(* TODO: Use "Z3_Proof.string_of_rule" once it is moved to Isabelle *) |
|
54753 | 56 |
val z3_apply_def_rule = "apply-def" |
54746 | 57 |
val z3_hypothesis_rule = "hypothesis" |
54753 | 58 |
val z3_intro_def_rule = "intro-def" |
54746 | 59 |
val z3_lemma_rule = "lemma" |
54753 | 60 |
val z3_skolemize_rule = "sk" |
61 |
val z3_th_lemma_rule = "th-lemma" |
|
54746 | 62 |
|
63 |
val is_skolemize_rule = |
|
64 |
member (op =) [e_skolemize_rule, vampire_skolemisation_rule, z3_skolemize_rule] |
|
65 |
||
54755 | 66 |
val is_arith_rule = String.isPrefix z3_th_lemma_rule |
67 |
||
54501 | 68 |
fun raw_label_of_num num = (num, 0) |
49914 | 69 |
|
54501 | 70 |
fun label_of_clause [(num, _)] = raw_label_of_num num |
71 |
| label_of_clause c = (space_implode "___" (map (fst o raw_label_of_num o fst) c), 0) |
|
50005 | 72 |
|
54505 | 73 |
fun add_fact_of_dependencies [(_, ss as _ :: _)] = apsnd (union (op =) ss) |
74 |
| add_fact_of_dependencies names = apfst (insert (op =) (label_of_clause names)) |
|
49914 | 75 |
|
76 |
fun replace_one_dependency (old, new) dep = |
|
77 |
if is_same_atp_step dep old then new else [dep] |
|
51201 | 78 |
fun replace_dependencies_in_line p (name, role, t, rule, deps) = |
79 |
(name, role, t, rule, fold (union (op =) o replace_one_dependency p) deps []) |
|
49914 | 80 |
|
54746 | 81 |
fun inline_z3_defs _ [] = [] |
82 |
| inline_z3_defs defs ((line as (name, role, t, rule, deps)) :: lines) = |
|
83 |
if rule = z3_intro_def_rule then |
|
84 |
let val def = t |> maybe_dest_Trueprop |> HOLogic.dest_eq |> swap in |
|
85 |
inline_z3_defs (insert (op =) def defs) |
|
86 |
(map (replace_dependencies_in_line (name, [])) lines) |
|
87 |
end |
|
88 |
else if rule = z3_apply_def_rule then |
|
89 |
inline_z3_defs defs (map (replace_dependencies_in_line (name, [])) lines) |
|
90 |
else |
|
91 |
(name, role, Term.subst_atomic defs t, rule, deps) :: inline_z3_defs defs lines |
|
92 |
||
54750 | 93 |
fun alist_cons_list eq (k, v) = AList.map_default eq (k, []) (cons v) |
94 |
||
95 |
(* FIXME: use "prop_of_clause" defined below *) |
|
96 |
fun add_z3_hypotheses [] = I |
|
97 |
| add_z3_hypotheses hyps = |
|
98 |
HOLogic.dest_Trueprop |
|
99 |
#> curry HOLogic.mk_imp (Library.foldr1 HOLogic.mk_conj (map HOLogic.dest_Trueprop hyps)) |
|
100 |
#> HOLogic.mk_Trueprop |
|
101 |
||
102 |
fun inline_z3_hypotheses _ _ [] = [] |
|
103 |
| inline_z3_hypotheses hyp_names hyps ((name, role, t, rule, deps) :: lines) = |
|
104 |
if rule = z3_hypothesis_rule then |
|
105 |
inline_z3_hypotheses (name :: hyp_names) (alist_cons_list (op =) (t, name) hyps) lines |
|
106 |
else |
|
107 |
let val deps' = subtract (op =) hyp_names deps in |
|
108 |
if rule = z3_lemma_rule then |
|
109 |
(name, role, t, rule, deps') :: inline_z3_hypotheses hyp_names hyps lines |
|
110 |
else |
|
111 |
let |
|
112 |
val add_hyps = filter_out (null o inter (op =) deps o snd) hyps |
|
113 |
val t' = add_z3_hypotheses (map fst add_hyps) t |
|
114 |
val deps' = subtract (op =) hyp_names deps |
|
115 |
val hyps' = fold (AList.update (op =) o apsnd (insert (op =) name)) add_hyps hyps |
|
116 |
in |
|
117 |
(name, role, t', rule, deps') :: inline_z3_hypotheses hyp_names hyps' lines |
|
118 |
end |
|
119 |
end |
|
54746 | 120 |
|
49914 | 121 |
(* No "real" literals means only type information (tfree_tcs, clsrel, or |
122 |
clsarity). *) |
|
123 |
fun is_only_type_information t = t aconv @{term True} |
|
124 |
||
125 |
(* Discard facts; consolidate adjacent lines that prove the same formula, since |
|
126 |
they differ only in type information.*) |
|
54755 | 127 |
fun add_line_pass1 (line as (name as (_, ss), role, t, rule, [])) lines = |
54700 | 128 |
(* No dependencies: lemma (for Z3), fact, conjecture, or (for Vampire) |
129 |
internal facts or definitions. *) |
|
130 |
if role = Lemma orelse role = Conjecture orelse role = Negated_Conjecture orelse |
|
54755 | 131 |
role = Hypothesis orelse is_arith_rule rule then |
54746 | 132 |
line :: lines |
54505 | 133 |
else if role = Axiom then |
49914 | 134 |
(* Facts are not proof lines. *) |
54507 | 135 |
lines |> is_only_type_information t ? map (replace_dependencies_in_line (name, [])) |
49914 | 136 |
else |
137 |
map (replace_dependencies_in_line (name, [])) lines |
|
54755 | 138 |
| add_line_pass1 line lines = line :: lines |
49914 | 139 |
|
140 |
(* Recursively delete empty lines (type information) from the proof. *) |
|
54755 | 141 |
fun add_line_pass2 (line as (name, _, t, _, [])) lines = |
54507 | 142 |
if is_only_type_information t then delete_dependency name lines else line :: lines |
54755 | 143 |
| add_line_pass2 line lines = line :: lines |
49914 | 144 |
and delete_dependency name lines = |
54755 | 145 |
fold_rev add_line_pass2 (map (replace_dependencies_in_line (name, [])) lines) [] |
49914 | 146 |
|
54755 | 147 |
fun add_line_pass3 res [] = rev res |
148 |
| add_line_pass3 res ((line as (name as (_, ss), role, t, rule, deps)) :: lines) = |
|
149 |
if role <> Plain orelse is_skolemize_rule rule orelse is_arith_rule rule orelse |
|
54716
55ed20a29a8c
reverse order in which lines are selected, to ensure that the number of dependencies is accurate
blanchet
parents:
54715
diff
changeset
|
150 |
(* the last line must be kept *) |
55ed20a29a8c
reverse order in which lines are selected, to ensure that the number of dependencies is accurate
blanchet
parents:
54715
diff
changeset
|
151 |
null lines orelse |
54746 | 152 |
(not (is_only_type_information t) andalso null (Term.add_tvars t []) |
153 |
andalso length deps >= 2 andalso |
|
54716
55ed20a29a8c
reverse order in which lines are selected, to ensure that the number of dependencies is accurate
blanchet
parents:
54715
diff
changeset
|
154 |
(* don't keep next to last line, which usually results in a trivial step *) |
55ed20a29a8c
reverse order in which lines are selected, to ensure that the number of dependencies is accurate
blanchet
parents:
54715
diff
changeset
|
155 |
not (can the_single lines)) then |
54755 | 156 |
add_line_pass3 (line :: res) lines |
54716
55ed20a29a8c
reverse order in which lines are selected, to ensure that the number of dependencies is accurate
blanchet
parents:
54715
diff
changeset
|
157 |
else |
54755 | 158 |
add_line_pass3 res (map (replace_dependencies_in_line (name, deps)) lines) |
49914 | 159 |
|
52454 | 160 |
val add_labels_of_proof = |
54700 | 161 |
steps_of_proof |
162 |
#> fold_isar_steps (byline_of_step #> (fn SOME ((ls, _), _) => union (op =) ls | _ => I)) |
|
49914 | 163 |
|
164 |
fun kill_useless_labels_in_proof proof = |
|
165 |
let |
|
51178 | 166 |
val used_ls = add_labels_of_proof proof [] |
54700 | 167 |
fun kill_label l = if member (op =) used_ls l then l else no_label |
168 |
fun kill_assms assms = map (apfst kill_label) assms |
|
169 |
fun kill_step (Prove (qs, xs, l, t, subproofs, by)) = |
|
170 |
Prove (qs, xs, kill_label l, t, map kill_proof subproofs, by) |
|
171 |
| kill_step step = step |
|
172 |
and kill_proof (Proof (fix, assms, steps)) = |
|
173 |
Proof (fix, kill_assms assms, map kill_step steps) |
|
174 |
in |
|
175 |
kill_proof proof |
|
176 |
end |
|
49914 | 177 |
|
51998
f732a674db1b
renamed Sledgehammer functions with 'for' in their names to 'of'
blanchet
parents:
51976
diff
changeset
|
178 |
fun prefix_of_depth n = replicate_string (n + 1) |
49914 | 179 |
|
54501 | 180 |
val assume_prefix = "a" |
181 |
val have_prefix = "f" |
|
182 |
||
49914 | 183 |
val relabel_proof = |
184 |
let |
|
51179
0d5f8812856f
split isar_step into isar_step, fix, assms; made isar_proof explicit; register fixed variables in ctxt and auto_fix terms to avoid superfluous annotations
smolkas
parents:
51178
diff
changeset
|
185 |
fun fresh_label depth prefix (old as (l, subst, next)) = |
50672
ab5b8b5c9cbe
added "obtain" to Isar proof construction data structure
blanchet
parents:
50671
diff
changeset
|
186 |
if l = no_label then |
ab5b8b5c9cbe
added "obtain" to Isar proof construction data structure
blanchet
parents:
50671
diff
changeset
|
187 |
old |
ab5b8b5c9cbe
added "obtain" to Isar proof construction data structure
blanchet
parents:
50671
diff
changeset
|
188 |
else |
51998
f732a674db1b
renamed Sledgehammer functions with 'for' in their names to 'of'
blanchet
parents:
51976
diff
changeset
|
189 |
let val l' = (prefix_of_depth depth prefix, next) in |
51179
0d5f8812856f
split isar_step into isar_step, fix, assms; made isar_proof explicit; register fixed variables in ctxt and auto_fix terms to avoid superfluous annotations
smolkas
parents:
51178
diff
changeset
|
190 |
(l', (l, l') :: subst, next + 1) |
50672
ab5b8b5c9cbe
added "obtain" to Isar proof construction data structure
blanchet
parents:
50671
diff
changeset
|
191 |
end |
54700 | 192 |
|
193 |
fun relabel_facts subst = apfst (maps (the_list o AList.lookup (op =) subst)) |
|
194 |
||
195 |
fun relabel_assm depth (l, t) (subst, next) = |
|
54507 | 196 |
let val (l, subst, next) = (l, subst, next) |> fresh_label depth assume_prefix in |
51179
0d5f8812856f
split isar_step into isar_step, fix, assms; made isar_proof explicit; register fixed variables in ctxt and auto_fix terms to avoid superfluous annotations
smolkas
parents:
51178
diff
changeset
|
197 |
((l, t), (subst, next)) |
0d5f8812856f
split isar_step into isar_step, fix, assms; made isar_proof explicit; register fixed variables in ctxt and auto_fix terms to avoid superfluous annotations
smolkas
parents:
51178
diff
changeset
|
198 |
end |
54700 | 199 |
|
200 |
fun relabel_assms subst depth assms = fold_map (relabel_assm depth) assms (subst, 1) ||> fst |
|
201 |
||
202 |
fun relabel_steps _ _ _ [] = [] |
|
203 |
| relabel_steps subst depth next (Prove (qs, xs, l, t, sub, by) :: steps) = |
|
50672
ab5b8b5c9cbe
added "obtain" to Isar proof construction data structure
blanchet
parents:
50671
diff
changeset
|
204 |
let |
54507 | 205 |
val (l, subst, next) = (l, subst, next) |> fresh_label depth have_prefix |
54700 | 206 |
val sub = relabel_proofs subst depth sub |
207 |
val by = by |> relabel_byline subst |
|
208 |
in |
|
209 |
Prove (qs, xs, l, t, sub, by) :: relabel_steps subst depth next steps |
|
210 |
end |
|
211 |
| relabel_steps subst depth next (step :: steps) = |
|
212 |
step :: relabel_steps subst depth next steps |
|
213 |
and relabel_proof subst depth (Proof (fix, assms, steps)) = |
|
214 |
let val (assms, subst) = relabel_assms subst depth assms in |
|
215 |
Proof (fix, assms, relabel_steps subst depth 1 steps) |
|
51179
0d5f8812856f
split isar_step into isar_step, fix, assms; made isar_proof explicit; register fixed variables in ctxt and auto_fix terms to avoid superfluous annotations
smolkas
parents:
51178
diff
changeset
|
216 |
end |
54700 | 217 |
and relabel_byline subst byline = apfst (relabel_facts subst) byline |
218 |
and relabel_proofs subst depth = map (relabel_proof subst (depth + 1)) |
|
219 |
in |
|
220 |
relabel_proof [] 0 |
|
221 |
end |
|
49914 | 222 |
|
50004
c96e8e40d789
several improvements to Isar proof reconstruction, by Steffen Smolka (step merging in case splits, time measurements, etc.)
blanchet
parents:
49994
diff
changeset
|
223 |
val chain_direct_proof = |
c96e8e40d789
several improvements to Isar proof reconstruction, by Steffen Smolka (step merging in case splits, time measurements, etc.)
blanchet
parents:
49994
diff
changeset
|
224 |
let |
54700 | 225 |
fun chain_qs_lfs NONE lfs = ([], lfs) |
226 |
| chain_qs_lfs (SOME l0) lfs = |
|
227 |
if member (op =) lfs l0 then ([Then], lfs |> remove (op =) l0) else ([], lfs) |
|
228 |
fun chain_step lbl (Prove (qs, xs, l, t, subproofs, ((lfs, gfs), method))) = |
|
229 |
let val (qs', lfs) = chain_qs_lfs lbl lfs in |
|
230 |
Prove (qs' @ qs, xs, l, t, chain_proofs subproofs, ((lfs, gfs), method)) |
|
231 |
end |
|
50672
ab5b8b5c9cbe
added "obtain" to Isar proof construction data structure
blanchet
parents:
50671
diff
changeset
|
232 |
| chain_step _ step = step |
51179
0d5f8812856f
split isar_step into isar_step, fix, assms; made isar_proof explicit; register fixed variables in ctxt and auto_fix terms to avoid superfluous annotations
smolkas
parents:
51178
diff
changeset
|
233 |
and chain_steps _ [] = [] |
0d5f8812856f
split isar_step into isar_step, fix, assms; made isar_proof explicit; register fixed variables in ctxt and auto_fix terms to avoid superfluous annotations
smolkas
parents:
51178
diff
changeset
|
234 |
| chain_steps (prev as SOME _) (i :: is) = |
0d5f8812856f
split isar_step into isar_step, fix, assms; made isar_proof explicit; register fixed variables in ctxt and auto_fix terms to avoid superfluous annotations
smolkas
parents:
51178
diff
changeset
|
235 |
chain_step prev i :: chain_steps (label_of_step i) is |
0d5f8812856f
split isar_step into isar_step, fix, assms; made isar_proof explicit; register fixed variables in ctxt and auto_fix terms to avoid superfluous annotations
smolkas
parents:
51178
diff
changeset
|
236 |
| chain_steps _ (i :: is) = i :: chain_steps (label_of_step i) is |
54700 | 237 |
and chain_proof (Proof (fix, assms, steps)) = |
238 |
Proof (fix, assms, chain_steps (try (List.last #> fst) assms) steps) |
|
51179
0d5f8812856f
split isar_step into isar_step, fix, assms; made isar_proof explicit; register fixed variables in ctxt and auto_fix terms to avoid superfluous annotations
smolkas
parents:
51178
diff
changeset
|
239 |
and chain_proofs proofs = map (chain_proof) proofs |
0d5f8812856f
split isar_step into isar_step, fix, assms; made isar_proof explicit; register fixed variables in ctxt and auto_fix terms to avoid superfluous annotations
smolkas
parents:
51178
diff
changeset
|
240 |
in chain_proof end |
49883 | 241 |
|
49914 | 242 |
type isar_params = |
54505 | 243 |
bool * bool * string * string * Time.time option * real * bool * (term, string) atp_step list * |
244 |
thm |
|
49914 | 245 |
|
53052
a0db255af8c5
sledgehammer sendback always uses Markup.padding_command: sensible default for most practical applications -- old-style in-line replacement is superseded by auto mode or panel;
wenzelm
parents:
53047
diff
changeset
|
246 |
fun isar_proof_text ctxt isar_proofs |
54756 | 247 |
(debug, verbose, metis_type_enc, metis_lam_trans, preplay_timeout, isar_compress, isar_try0, |
248 |
atp_proof, goal) |
|
49918
cf441f4a358b
renamed Isar-proof related options + changed semantics of Isar shrinking
blanchet
parents:
49917
diff
changeset
|
249 |
(one_line_params as (_, _, _, _, subgoal, subgoal_count)) = |
49883 | 250 |
let |
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:
52150
diff
changeset
|
251 |
val (params, hyp_ts, concl_t) = strip_subgoal goal subgoal ctxt |
2281f33e8da6
redid rac7830871177 to avoid duplicate fixed variable (e.g. lemma "P (a::nat)" proof - have "!!a::int. Q a" sledgehammer [e])
blanchet
parents:
52150
diff
changeset
|
252 |
val (_, ctxt) = |
2281f33e8da6
redid rac7830871177 to avoid duplicate fixed variable (e.g. lemma "P (a::nat)" proof - have "!!a::int. Q a" sledgehammer [e])
blanchet
parents:
52150
diff
changeset
|
253 |
params |
2281f33e8da6
redid rac7830871177 to avoid duplicate fixed variable (e.g. lemma "P (a::nat)" proof - have "!!a::int. Q a" sledgehammer [e])
blanchet
parents:
52150
diff
changeset
|
254 |
|> map (fn (s, T) => (Binding.name s, SOME T, NoSyn)) |
54507 | 255 |
|> (fn fixes => ctxt |> Variable.set_body false |> Proof_Context.add_fixes fixes) |
53052
a0db255af8c5
sledgehammer sendback always uses Markup.padding_command: sensible default for most practical applications -- old-style in-line replacement is superseded by auto mode or panel;
wenzelm
parents:
53047
diff
changeset
|
256 |
val one_line_proof = one_line_proof_text 0 one_line_params |
52556
c8357085217c
completely rewrote SH compress; added two parameters for experimentation/fine grained control
smolkas
parents:
52555
diff
changeset
|
257 |
val do_preplay = preplay_timeout <> SOME Time.zeroTime |
49883 | 258 |
|
54751 | 259 |
val is_fixed = Variable.is_declared ctxt orf can Name.dest_skolem |
260 |
fun skolems_of t = Term.add_frees t [] |> filter_out (is_fixed o fst) |> rev |
|
261 |
||
262 |
fun get_role keep_role ((num, _), role, t, rule, _) = |
|
263 |
if keep_role role then SOME ((raw_label_of_num num, t), rule) else NONE |
|
54700 | 264 |
|
49883 | 265 |
fun isar_proof_of () = |
266 |
let |
|
267 |
val atp_proof = |
|
268 |
atp_proof |
|
54746 | 269 |
|> inline_z3_defs [] |
54750 | 270 |
|> inline_z3_hypotheses [] [] |
54755 | 271 |
|> rpair [] |-> fold_rev add_line_pass1 |
272 |
|> rpair [] |-> fold_rev add_line_pass2 |
|
273 |
|> add_line_pass3 [] |
|
54700 | 274 |
|
54535
59737a43e044
support Negated_Conjecture as a TPTP role as well (e.g. for SMT proofs)
blanchet
parents:
54507
diff
changeset
|
275 |
val conjs = |
54700 | 276 |
map_filter (fn (name, role, _, _, _) => |
277 |
if member (op =) [Conjecture, Negated_Conjecture] role then SOME name else NONE) |
|
278 |
atp_proof |
|
54751 | 279 |
val assms = map_filter (Option.map fst o get_role (curry (op =) Hypothesis)) atp_proof |
54700 | 280 |
val lems = |
281 |
map_filter (get_role (curry (op =) Lemma)) atp_proof |
|
54751 | 282 |
|> map (fn ((l, t), rule) => |
54753 | 283 |
let |
284 |
val (skos, meth) = |
|
285 |
if is_skolemize_rule rule then (skolems_of t, MetisM) |
|
54755 | 286 |
else if is_arith_rule rule then ([], ArithM) |
287 |
else ([], AutoM) |
|
54753 | 288 |
in |
289 |
Prove ([], skos, l, maybe_mk_Trueprop t, [], (([], []), meth)) |
|
290 |
end) |
|
54700 | 291 |
|
51212
2bbcc9cc12b4
ensure all conjecture clauses are in the graph -- to prevent exceptions later
blanchet
parents:
51208
diff
changeset
|
292 |
val bot = atp_proof |> List.last |> #1 |
54700 | 293 |
|
51145 | 294 |
val refute_graph = |
51212
2bbcc9cc12b4
ensure all conjecture clauses are in the graph -- to prevent exceptions later
blanchet
parents:
51208
diff
changeset
|
295 |
atp_proof |
2bbcc9cc12b4
ensure all conjecture clauses are in the graph -- to prevent exceptions later
blanchet
parents:
51208
diff
changeset
|
296 |
|> map (fn (name, _, _, _, from) => (from, name)) |
2bbcc9cc12b4
ensure all conjecture clauses are in the graph -- to prevent exceptions later
blanchet
parents:
51208
diff
changeset
|
297 |
|> make_refute_graph bot |
2bbcc9cc12b4
ensure all conjecture clauses are in the graph -- to prevent exceptions later
blanchet
parents:
51208
diff
changeset
|
298 |
|> fold (Atom_Graph.default_node o rpair ()) conjs |
54700 | 299 |
|
51145 | 300 |
val axioms = axioms_of_refute_graph refute_graph conjs |
54700 | 301 |
|
51145 | 302 |
val tainted = tainted_atoms_of_refute_graph refute_graph conjs |
51156 | 303 |
val is_clause_tainted = exists (member (op =) tainted) |
50676
83b8a5a39709
generate "obtain" steps corresponding to skolemization inferences
blanchet
parents:
50675
diff
changeset
|
304 |
val steps = |
49883 | 305 |
Symtab.empty |
51201 | 306 |
|> fold (fn (name as (s, _), role, t, rule, _) => |
50676
83b8a5a39709
generate "obtain" steps corresponding to skolemization inferences
blanchet
parents:
50675
diff
changeset
|
307 |
Symtab.update_new (s, (rule, |
51156 | 308 |
t |> (if is_clause_tainted [name] then |
54712 | 309 |
role <> Conjecture ? (maybe_dest_Trueprop #> s_not) |
50676
83b8a5a39709
generate "obtain" steps corresponding to skolemization inferences
blanchet
parents:
50675
diff
changeset
|
310 |
#> fold exists_of (map Var (Term.add_vars t [])) |
83b8a5a39709
generate "obtain" steps corresponding to skolemization inferences
blanchet
parents:
50675
diff
changeset
|
311 |
else |
83b8a5a39709
generate "obtain" steps corresponding to skolemization inferences
blanchet
parents:
50675
diff
changeset
|
312 |
I)))) |
49883 | 313 |
atp_proof |
54700 | 314 |
|
54755 | 315 |
val rule_of_clause_id = fst o the o Symtab.lookup steps o fst |
54700 | 316 |
|
54712 | 317 |
(* The assumptions and conjecture are "prop"s; the other formulas are "bool"s (for ATPs) or |
318 |
"prop"s (for Z3). TODO: Always use "prop". *) |
|
54505 | 319 |
fun prop_of_clause [(num, _)] = |
320 |
Symtab.lookup steps num |> the |> snd |> maybe_mk_Trueprop |> close_form |
|
50016 | 321 |
| prop_of_clause names = |
50676
83b8a5a39709
generate "obtain" steps corresponding to skolemization inferences
blanchet
parents:
50675
diff
changeset
|
322 |
let |
54712 | 323 |
val lits = |
324 |
map (maybe_dest_Trueprop o snd) (map_filter (Symtab.lookup steps o fst) names) |
|
50676
83b8a5a39709
generate "obtain" steps corresponding to skolemization inferences
blanchet
parents:
50675
diff
changeset
|
325 |
in |
54754 | 326 |
(case List.partition (can HOLogic.dest_not) lits of |
50018
4ea26c74d7ea
use implications rather than disjunctions to improve readability
blanchet
parents:
50017
diff
changeset
|
327 |
(negs as _ :: _, pos as _ :: _) => |
54507 | 328 |
s_imp (Library.foldr1 s_conj (map HOLogic.dest_not negs), Library.foldr1 s_disj pos) |
54754 | 329 |
| _ => fold (curry s_disj) lits @{term False}) |
50018
4ea26c74d7ea
use implications rather than disjunctions to improve readability
blanchet
parents:
50017
diff
changeset
|
330 |
end |
50016 | 331 |
|> HOLogic.mk_Trueprop |> close_form |
54700 | 332 |
|
333 |
fun maybe_show outer c = |
|
334 |
(outer andalso length c = 1 andalso subset (op =) (c, conjs)) ? cons Show |
|
335 |
||
336 |
fun isar_steps outer predecessor accum [] = |
|
337 |
accum |
|
338 |
|> (if tainted = [] then |
|
339 |
cons (Prove (if outer then [Show] else [], [], no_label, concl_t, [], |
|
54755 | 340 |
((the_list predecessor, []), MetisM))) |
54700 | 341 |
else |
342 |
I) |
|
343 |
|> rev |
|
54755 | 344 |
| isar_steps outer _ accum (Have (id, (gamma, c)) :: infs) = |
54700 | 345 |
let |
346 |
val l = label_of_clause c |
|
347 |
val t = prop_of_clause c |
|
54755 | 348 |
val rule = rule_of_clause_id id |
349 |
val skolem = is_skolemize_rule rule |
|
350 |
||
54700 | 351 |
fun prove sub by = Prove (maybe_show outer c [], [], l, t, sub, by) |
352 |
fun do_rest l step = isar_steps outer (SOME l) (step :: accum) infs |
|
54755 | 353 |
|
354 |
val deps = fold add_fact_of_dependencies gamma no_facts |
|
355 |
val meth = if is_arith_rule rule then ArithM else MetisM |
|
356 |
val by = (deps, meth) |
|
54700 | 357 |
in |
358 |
if is_clause_tainted c then |
|
54712 | 359 |
(case gamma of |
54700 | 360 |
[g] => |
54755 | 361 |
if skolem andalso is_clause_tainted g then |
54751 | 362 |
let val subproof = Proof (skolems_of (prop_of_clause g), [], rev accum) in |
54700 | 363 |
isar_steps outer (SOME l) [prove [subproof] (no_facts, MetisM)] [] |
364 |
end |
|
51148
2246a2e17f92
tuning -- refactoring in preparation for handling skolemization of conjecture
blanchet
parents:
51147
diff
changeset
|
365 |
else |
54700 | 366 |
do_rest l (prove [] by) |
54712 | 367 |
| _ => do_rest l (prove [] by)) |
54700 | 368 |
else |
54755 | 369 |
(if skolem then Prove ([], skolems_of t, l, t, [], by) |
54751 | 370 |
else prove [] by) |
371 |
|> do_rest l |
|
54700 | 372 |
end |
373 |
| isar_steps outer predecessor accum (Cases cases :: infs) = |
|
374 |
let |
|
375 |
fun isar_case (c, infs) = |
|
376 |
isar_proof false [] [(label_of_clause c, prop_of_clause c)] [] infs |
|
377 |
val c = succedent_of_cases cases |
|
378 |
val l = label_of_clause c |
|
379 |
val t = prop_of_clause c |
|
380 |
val step = |
|
381 |
Prove (maybe_show outer c [], [], l, t, map isar_case cases, |
|
382 |
((the_list predecessor, []), MetisM)) |
|
383 |
in |
|
384 |
isar_steps outer (SOME l) (step :: accum) infs |
|
385 |
end |
|
386 |
and isar_proof outer fix assms lems infs = |
|
387 |
Proof (fix, assms, lems @ isar_steps outer NONE [] infs) |
|
388 |
||
52592
8a25b17e3d79
optimize isar-proofs by trying different proof methods
smolkas
parents:
52556
diff
changeset
|
389 |
(* 60 seconds seems like a good interpreation of "no timeout" *) |
8a25b17e3d79
optimize isar-proofs by trying different proof methods
smolkas
parents:
52556
diff
changeset
|
390 |
val preplay_timeout = preplay_timeout |> the_default (seconds 60.0) |
8a25b17e3d79
optimize isar-proofs by trying different proof methods
smolkas
parents:
52556
diff
changeset
|
391 |
|
53761
4d34e267fba9
use configuration mechanism for low-level tracing
blanchet
parents:
53586
diff
changeset
|
392 |
val (preplay_interface as {overall_preplay_stats, ...}, isar_proof) = |
51145 | 393 |
refute_graph |
54699 | 394 |
(* |
54751 | 395 |
|> tap (tracing o prefix "Refute graph: " o string_of_refute_graph) |
54699 | 396 |
*) |
51031
63d71b247323
more robustness in Isar proof reconstruction (cf. bug report by Ondrej)
blanchet
parents:
51026
diff
changeset
|
397 |
|> redirect_graph axioms tainted bot |
54699 | 398 |
(* |
54751 | 399 |
|> tap (tracing o prefix "Direct proof: " o string_of_direct_proof) |
54699 | 400 |
*) |
54754 | 401 |
|> isar_proof true params assms lems |
54712 | 402 |
|> postprocess_remove_unreferenced_steps I |
52556
c8357085217c
completely rewrote SH compress; added two parameters for experimentation/fine grained control
smolkas
parents:
52555
diff
changeset
|
403 |
|> relabel_proof_canonically |
54500 | 404 |
|> `(proof_preplay_interface debug ctxt metis_type_enc metis_lam_trans do_preplay |
53761
4d34e267fba9
use configuration mechanism for low-level tracing
blanchet
parents:
53586
diff
changeset
|
405 |
preplay_timeout) |
54754 | 406 |
|
52626 | 407 |
val ((preplay_time, preplay_fail), isar_proof) = |
52556
c8357085217c
completely rewrote SH compress; added two parameters for experimentation/fine grained control
smolkas
parents:
52555
diff
changeset
|
408 |
isar_proof |
54501 | 409 |
|> compress_proof (if isar_proofs = SOME true then isar_compress else 1000.0) |
53762 | 410 |
preplay_interface |
52632
23393c31c7fe
added sledgehammer parameters isar_try0 and isar_minimize and their negative aliases
smolkas
parents:
52626
diff
changeset
|
411 |
|> isar_try0 ? try0 preplay_timeout preplay_interface |
54712 | 412 |
|> postprocess_remove_unreferenced_steps (isar_try0 ? min_deps_of_step preplay_interface) |
52626 | 413 |
|> `overall_preplay_stats |
54754 | 414 |
||> (chain_direct_proof |
415 |
#> kill_useless_labels_in_proof |
|
416 |
#> relabel_proof) |
|
417 |
||
54500 | 418 |
val isar_text = |
419 |
string_of_proof ctxt metis_type_enc metis_lam_trans subgoal subgoal_count isar_proof |
|
49883 | 420 |
in |
54754 | 421 |
(case isar_text of |
49883 | 422 |
"" => |
51190
2654b3965c8d
made "isar_proofs" a 3-way option, to provide a way to totally disable isar_proofs if desired
blanchet
parents:
51187
diff
changeset
|
423 |
if isar_proofs = SOME true then |
50671 | 424 |
"\nNo structured proof available (proof too simple)." |
49883 | 425 |
else |
426 |
"" |
|
427 |
| _ => |
|
50670
eaa540986291
properly take the existential closure of skolems
blanchet
parents:
50557
diff
changeset
|
428 |
let |
eaa540986291
properly take the existential closure of skolems
blanchet
parents:
50557
diff
changeset
|
429 |
val msg = |
51203 | 430 |
(if verbose then |
431 |
let |
|
52592
8a25b17e3d79
optimize isar-proofs by trying different proof methods
smolkas
parents:
52556
diff
changeset
|
432 |
val num_steps = add_proof_steps (steps_of_proof isar_proof) 0 |
51203 | 433 |
in [string_of_int num_steps ^ " step" ^ plural_s num_steps] end |
434 |
else |
|
435 |
[]) @ |
|
52556
c8357085217c
completely rewrote SH compress; added two parameters for experimentation/fine grained control
smolkas
parents:
52555
diff
changeset
|
436 |
(if do_preplay then |
50924 | 437 |
[(if preplay_fail then "may fail, " else "") ^ |
52556
c8357085217c
completely rewrote SH compress; added two parameters for experimentation/fine grained control
smolkas
parents:
52555
diff
changeset
|
438 |
string_of_preplay_time preplay_time] |
50670
eaa540986291
properly take the existential closure of skolems
blanchet
parents:
50557
diff
changeset
|
439 |
else |
eaa540986291
properly take the existential closure of skolems
blanchet
parents:
50557
diff
changeset
|
440 |
[]) |
50277 | 441 |
in |
54507 | 442 |
"\n\nStructured proof" ^ (commas msg |> not (null msg) ? enclose " (" ")") ^ ":\n" ^ |
443 |
Active.sendback_markup [Markup.padding_command] isar_text |
|
54754 | 444 |
end) |
49883 | 445 |
end |
446 |
val isar_proof = |
|
447 |
if debug then |
|
448 |
isar_proof_of () |
|
54754 | 449 |
else |
450 |
(case try isar_proof_of () of |
|
451 |
SOME s => s |
|
452 |
| NONE => |
|
453 |
if isar_proofs = SOME true then "\nWarning: The Isar proof construction failed." else "") |
|
49883 | 454 |
in one_line_proof ^ isar_proof end |
455 |
||
51187
c344cf148e8f
avoid using "smt" for minimization -- better use the prover itself, since then Sledgehammer gets to try metis again and gives the opportunity to output an Isar proof -- and show Isar proof as fallback for SMT proofs
blanchet
parents:
51179
diff
changeset
|
456 |
fun isar_proof_would_be_a_good_idea preplay = |
54754 | 457 |
(case preplay of |
51187
c344cf148e8f
avoid using "smt" for minimization -- better use the prover itself, since then Sledgehammer gets to try metis again and gives the opportunity to output an Isar proof -- and show Isar proof as fallback for SMT proofs
blanchet
parents:
51179
diff
changeset
|
458 |
Played (reconstr, _) => reconstr = SMT |
54093 | 459 |
| Trust_Playable _ => false |
54754 | 460 |
| Failed_to_Play _ => true) |
51187
c344cf148e8f
avoid using "smt" for minimization -- better use the prover itself, since then Sledgehammer gets to try metis again and gives the opportunity to output an Isar proof -- and show Isar proof as fallback for SMT proofs
blanchet
parents:
51179
diff
changeset
|
461 |
|
53052
a0db255af8c5
sledgehammer sendback always uses Markup.padding_command: sensible default for most practical applications -- old-style in-line replacement is superseded by auto mode or panel;
wenzelm
parents:
53047
diff
changeset
|
462 |
fun proof_text ctxt isar_proofs isar_params num_chained |
49883 | 463 |
(one_line_params as (preplay, _, _, _, _, _)) = |
51190
2654b3965c8d
made "isar_proofs" a 3-way option, to provide a way to totally disable isar_proofs if desired
blanchet
parents:
51187
diff
changeset
|
464 |
(if isar_proofs = SOME true orelse |
2654b3965c8d
made "isar_proofs" a 3-way option, to provide a way to totally disable isar_proofs if desired
blanchet
parents:
51187
diff
changeset
|
465 |
(isar_proofs = NONE andalso isar_proof_would_be_a_good_idea preplay) then |
54500 | 466 |
isar_proof_text ctxt isar_proofs (isar_params ()) |
49883 | 467 |
else |
53052
a0db255af8c5
sledgehammer sendback always uses Markup.padding_command: sensible default for most practical applications -- old-style in-line replacement is superseded by auto mode or panel;
wenzelm
parents:
53047
diff
changeset
|
468 |
one_line_proof_text num_chained) one_line_params |
49883 | 469 |
|
470 |
end; |