author | blanchet |
Mon, 03 Feb 2014 10:14:18 +0100 | |
changeset 55269 | aae87746f412 |
parent 55268 | a46458d368d5 |
child 55272 | 236114c5eb44 |
permissions | -rw-r--r-- |
55202
824c48a539c9
renamed many Sledgehammer ML files to clarify structure
blanchet
parents:
55194
diff
changeset
|
1 |
(* Title: HOL/Tools/Sledgehammer/sledgehammer_isar_preplay.ML |
54712 | 2 |
Author: Steffen Juilf Smolka, TU Muenchen |
50923 | 3 |
Author: Jasmin Blanchette, TU Muenchen |
4 |
||
54763 | 5 |
Preplaying of Isar proofs. |
50923 | 6 |
*) |
7 |
||
55202
824c48a539c9
renamed many Sledgehammer ML files to clarify structure
blanchet
parents:
55194
diff
changeset
|
8 |
signature SLEDGEHAMMER_ISAR_PREPLAY = |
50923 | 9 |
sig |
54828 | 10 |
type play_outcome = Sledgehammer_Reconstructor.play_outcome |
55223
3c593bad6b31
generalized preplaying infrastructure to store various results for various methods
blanchet
parents:
55221
diff
changeset
|
11 |
type proof_method = Sledgehammer_Isar_Proof.proof_method |
55212 | 12 |
type isar_step = Sledgehammer_Isar_Proof.isar_step |
55202
824c48a539c9
renamed many Sledgehammer ML files to clarify structure
blanchet
parents:
55194
diff
changeset
|
13 |
type isar_proof = Sledgehammer_Isar_Proof.isar_proof |
824c48a539c9
renamed many Sledgehammer ML files to clarify structure
blanchet
parents:
55194
diff
changeset
|
14 |
type label = Sledgehammer_Isar_Proof.label |
52556
c8357085217c
completely rewrote SH compress; added two parameters for experimentation/fine grained control
smolkas
parents:
52454
diff
changeset
|
15 |
|
55212 | 16 |
val trace : bool Config.T |
52556
c8357085217c
completely rewrote SH compress; added two parameters for experimentation/fine grained control
smolkas
parents:
52454
diff
changeset
|
17 |
|
55260 | 18 |
type isar_preplay_data |
52556
c8357085217c
completely rewrote SH compress; added two parameters for experimentation/fine grained control
smolkas
parents:
52454
diff
changeset
|
19 |
|
55256 | 20 |
val enrich_context_with_local_facts : isar_proof -> Proof.context -> Proof.context |
55258 | 21 |
val preplay_isar_step : Proof.context -> Time.time -> proof_method -> isar_step -> play_outcome |
55264 | 22 |
val set_preplay_outcomes_of_isar_step : Proof.context -> Time.time -> |
23 |
isar_preplay_data Unsynchronized.ref -> isar_step -> |
|
55260 | 24 |
(proof_method * play_outcome Lazy.lazy) list -> unit |
55269 | 25 |
val forced_preplay_outcome_of_isar_step : isar_preplay_data -> label -> play_outcome |
55266 | 26 |
val preplay_outcome_of_isar_step_for_method : isar_preplay_data -> label -> proof_method -> |
55260 | 27 |
play_outcome Lazy.lazy |
55266 | 28 |
val fastest_method_of_isar_step : isar_preplay_data -> label -> proof_method |
55260 | 29 |
val preplay_outcome_of_isar_proof : isar_preplay_data -> isar_proof -> play_outcome |
54504 | 30 |
end; |
50923 | 31 |
|
55202
824c48a539c9
renamed many Sledgehammer ML files to clarify structure
blanchet
parents:
55194
diff
changeset
|
32 |
structure Sledgehammer_Isar_Preplay : SLEDGEHAMMER_ISAR_PREPLAY = |
50923 | 33 |
struct |
34 |
||
55257 | 35 |
open ATP_Proof_Reconstruct |
50923 | 36 |
open Sledgehammer_Util |
54828 | 37 |
open Sledgehammer_Reconstructor |
55202
824c48a539c9
renamed many Sledgehammer ML files to clarify structure
blanchet
parents:
55194
diff
changeset
|
38 |
open Sledgehammer_Isar_Proof |
50923 | 39 |
|
54763 | 40 |
val trace = Attrib.setup_config_bool @{binding sledgehammer_preplay_trace} (K false) |
50924 | 41 |
|
55256 | 42 |
fun enrich_context_with_local_facts proof ctxt = |
43 |
let |
|
44 |
val thy = Proof_Context.theory_of ctxt |
|
45 |
||
46 |
fun enrich_with_fact l t = |
|
47 |
Proof_Context.put_thms false (string_of_label l, SOME [Skip_Proof.make_thm thy t]) |
|
48 |
||
49 |
val enrich_with_assms = fold (uncurry enrich_with_fact) |
|
50 |
||
51 |
fun enrich_with_proof (Proof (_, assms, isar_steps)) = |
|
52 |
enrich_with_assms assms #> fold enrich_with_step isar_steps |
|
53 |
and enrich_with_step (Let _) = I |
|
54 |
| enrich_with_step (Prove (_, _, l, t, subproofs, _)) = |
|
55 |
enrich_with_fact l t #> fold enrich_with_proof subproofs |
|
56 |
in |
|
57 |
enrich_with_proof proof ctxt |
|
58 |
end |
|
59 |
||
55260 | 60 |
fun preplay_trace ctxt assmsp concl outcome = |
51879 | 61 |
let |
62 |
val ctxt = ctxt |> Config.put show_markup true |
|
55194 | 63 |
val assms = op @ assmsp |
55260 | 64 |
val time = Pretty.str ("[" ^ string_of_play_outcome outcome ^ "]") |
55251 | 65 |
val assms = Pretty.enum " and " "using " " shows " (map (Display.pretty_thm ctxt) assms) |
66 |
val concl = Syntax.pretty_term ctxt concl |
|
54761
0ef52f40d419
use consistent condition for setting 'metis_new_skolem' (in preplaying and in output printing) + tuning
blanchet
parents:
54712
diff
changeset
|
67 |
in |
55251 | 68 |
tracing (Pretty.string_of (Pretty.blk (2, Pretty.breaks [time, assms, concl]))) |
54761
0ef52f40d419
use consistent condition for setting 'metis_new_skolem' (in preplaying and in output printing) + tuning
blanchet
parents:
54712
diff
changeset
|
69 |
end |
51879 | 70 |
|
50923 | 71 |
fun take_time timeout tac arg = |
54761
0ef52f40d419
use consistent condition for setting 'metis_new_skolem' (in preplaying and in output printing) + tuning
blanchet
parents:
54712
diff
changeset
|
72 |
let val timing = Timing.start () in |
54828 | 73 |
(TimeLimit.timeLimit timeout tac arg; Played (#cpu (Timing.result timing))) |
74 |
handle TimeLimit.TimeOut => Play_Timed_Out timeout |
|
50923 | 75 |
end |
76 |
||
77 |
fun resolve_fact_names ctxt names = |
|
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
|
78 |
(names |
54761
0ef52f40d419
use consistent condition for setting 'metis_new_skolem' (in preplaying and in output printing) + tuning
blanchet
parents:
54712
diff
changeset
|
79 |
|>> map string_of_label |
55194 | 80 |
|> pairself (maps (thms_of_name ctxt))) |
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
|
81 |
handle ERROR msg => error ("preplay error: " ^ msg) |
50923 | 82 |
|
54700 | 83 |
fun thm_of_proof ctxt (Proof (fixed_frees, assms, steps)) = |
50923 | 84 |
let |
54761
0ef52f40d419
use consistent condition for setting 'metis_new_skolem' (in preplaying and in output printing) + tuning
blanchet
parents:
54712
diff
changeset
|
85 |
val thy = Proof_Context.theory_of ctxt |
0ef52f40d419
use consistent condition for setting 'metis_new_skolem' (in preplaying and in output printing) + tuning
blanchet
parents:
54712
diff
changeset
|
86 |
|
54700 | 87 |
val concl = |
88 |
(case try List.last steps of |
|
89 |
SOME (Prove (_, [], _, t, _, _)) => t |
|
90 |
| _ => raise Fail "preplay error: malformed subproof") |
|
54761
0ef52f40d419
use consistent condition for setting 'metis_new_skolem' (in preplaying and in output printing) + tuning
blanchet
parents:
54712
diff
changeset
|
91 |
|
51178 | 92 |
val var_idx = maxidx_of_term concl + 1 |
54761
0ef52f40d419
use consistent condition for setting 'metis_new_skolem' (in preplaying and in output printing) + tuning
blanchet
parents:
54712
diff
changeset
|
93 |
fun var_of_free (x, T) = Var ((x, var_idx), T) |
0ef52f40d419
use consistent condition for setting 'metis_new_skolem' (in preplaying and in output printing) + tuning
blanchet
parents:
54712
diff
changeset
|
94 |
val subst = map (`var_of_free #> swap #> apfst Free) fixed_frees |
51178 | 95 |
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
|
96 |
Logic.list_implies (assms |> map snd, concl) |
54761
0ef52f40d419
use consistent condition for setting 'metis_new_skolem' (in preplaying and in output printing) + tuning
blanchet
parents:
54712
diff
changeset
|
97 |
|> subst_free subst |
0ef52f40d419
use consistent condition for setting 'metis_new_skolem' (in preplaying and in output printing) + tuning
blanchet
parents:
54712
diff
changeset
|
98 |
|> Skip_Proof.make_thm thy |
51178 | 99 |
end |
100 |
||
55257 | 101 |
fun tac_of_method ctxt (local_facts, global_facts) meth = |
55194 | 102 |
Method.insert_tac local_facts THEN' |
54766
6ac273f176cd
store alternative proof methods in Isar data structure
blanchet
parents:
54765
diff
changeset
|
103 |
(case meth of |
55194 | 104 |
Meson_Method => Meson.meson_tac ctxt global_facts |
55257 | 105 |
| Metis_Method (type_enc_opt, lam_trans_opt) => |
106 |
Metis_Tactic.metis_tac [type_enc_opt |> the_default partial_type_enc] |
|
107 |
(the_default default_metis_lam_trans lam_trans_opt) ctxt global_facts |
|
52592
8a25b17e3d79
optimize isar-proofs by trying different proof methods
smolkas
parents:
52575
diff
changeset
|
108 |
| _ => |
55194 | 109 |
Method.insert_tac global_facts THEN' |
54766
6ac273f176cd
store alternative proof methods in Isar data structure
blanchet
parents:
54765
diff
changeset
|
110 |
(case meth of |
55194 | 111 |
Simp_Method => Simplifier.asm_full_simp_tac ctxt |
54838
16511f84913c
reconstruct SPASS-Pirate steps of the form 'x ~= C x' (or more complicated)
blanchet
parents:
54831
diff
changeset
|
112 |
| Simp_Size_Method => |
16511f84913c
reconstruct SPASS-Pirate steps of the form 'x ~= C x' (or more complicated)
blanchet
parents:
54831
diff
changeset
|
113 |
Simplifier.asm_full_simp_tac (Simplifier.add_simp @{thm size_ne_size_imp_ne} ctxt) |
54765 | 114 |
| Auto_Method => K (Clasimp.auto_tac ctxt) |
115 |
| Fastforce_Method => Clasimp.fast_force_tac ctxt |
|
116 |
| Force_Method => Clasimp.force_tac ctxt |
|
117 |
| Arith_Method => Arith_Data.arith_tac ctxt |
|
118 |
| Blast_Method => blast_tac ctxt |
|
55219 | 119 |
| Algebra_Method => Groebner.algebra_tac [] [] ctxt |
55202
824c48a539c9
renamed many Sledgehammer ML files to clarify structure
blanchet
parents:
55194
diff
changeset
|
120 |
| _ => raise Fail "Sledgehammer_Isar_Preplay: tac_of_method")) |
52592
8a25b17e3d79
optimize isar-proofs by trying different proof methods
smolkas
parents:
52575
diff
changeset
|
121 |
|
54761
0ef52f40d419
use consistent condition for setting 'metis_new_skolem' (in preplaying and in output printing) + tuning
blanchet
parents:
54712
diff
changeset
|
122 |
(* main function for preplaying Isar steps; may throw exceptions *) |
55258 | 123 |
fun raw_preplay_step ctxt timeout meth (Prove (_, xs, _, t, subproofs, (fact_names, _))) = |
124 |
let |
|
125 |
val goal = |
|
126 |
(case xs of |
|
127 |
[] => t |
|
128 |
| _ => |
|
129 |
(* proof obligation: !!thesis. (!!x. A x ==> thesis) ==> thesis |
|
130 |
(cf. "~~/src/Pure/Isar/obtain.ML") *) |
|
131 |
let |
|
132 |
(* FIXME: generate fresh name *) |
|
133 |
val thesis = Free ("thesis_preplay", HOLogic.boolT) |
|
134 |
val thesis_prop = HOLogic.mk_Trueprop thesis |
|
135 |
val frees = map Free xs |
|
50923 | 136 |
|
55258 | 137 |
(* !!x1..xn. t ==> thesis (xs = [x1, .., xn]) *) |
138 |
val inner_prop = fold_rev Logic.all frees (Logic.mk_implies (t, thesis_prop)) |
|
139 |
in |
|
140 |
(* !!thesis. (!!x1..xn. t ==> thesis) ==> thesis *) |
|
141 |
Logic.all thesis (Logic.mk_implies (inner_prop, thesis_prop)) |
|
142 |
end) |
|
54761
0ef52f40d419
use consistent condition for setting 'metis_new_skolem' (in preplaying and in output printing) + tuning
blanchet
parents:
54712
diff
changeset
|
143 |
|
55258 | 144 |
val facts = |
145 |
resolve_fact_names ctxt fact_names |
|
146 |
|>> append (map (thm_of_proof ctxt) subproofs) |
|
55194 | 147 |
|
55258 | 148 |
fun prove () = |
149 |
Goal.prove ctxt [] [] goal (fn {context = ctxt, ...} => |
|
150 |
HEADGOAL (tac_of_method ctxt facts meth)) |
|
151 |
handle ERROR msg => error ("Preplay error: " ^ msg) |
|
54761
0ef52f40d419
use consistent condition for setting 'metis_new_skolem' (in preplaying and in output printing) + tuning
blanchet
parents:
54712
diff
changeset
|
152 |
|
55258 | 153 |
val play_outcome = take_time timeout prove () |
154 |
in |
|
155 |
(if Config.get ctxt trace then preplay_trace ctxt facts goal play_outcome else (); |
|
156 |
play_outcome) |
|
157 |
end |
|
158 |
||
159 |
fun preplay_isar_step ctxt timeout meth = |
|
55260 | 160 |
try (raw_preplay_step ctxt timeout meth) #> the_default Play_Failed |
52556
c8357085217c
completely rewrote SH compress; added two parameters for experimentation/fine grained control
smolkas
parents:
52454
diff
changeset
|
161 |
|
55260 | 162 |
type isar_preplay_data = (proof_method * play_outcome Lazy.lazy) list Canonical_Label_Tab.table |
52556
c8357085217c
completely rewrote SH compress; added two parameters for experimentation/fine grained control
smolkas
parents:
52454
diff
changeset
|
163 |
|
55256 | 164 |
fun time_of_play (Played time) = time |
165 |
| time_of_play (Play_Timed_Out time) = time |
|
50923 | 166 |
|
55260 | 167 |
fun add_preplay_outcomes Play_Failed _ = Play_Failed |
168 |
| add_preplay_outcomes _ Play_Failed = Play_Failed |
|
169 |
| add_preplay_outcomes (Played time1) (Played time2) = Played (Time.+ (time1, time2)) |
|
170 |
| add_preplay_outcomes play1 play2 = |
|
55256 | 171 |
Play_Timed_Out (Time.+ (pairself time_of_play (play1, play2))) |
54827 | 172 |
|
55264 | 173 |
fun set_preplay_outcomes_of_isar_step ctxt timeout preplay_data |
174 |
(step as Prove (_, _, l, _, _, (_, meths))) meths_outcomes0 = |
|
175 |
let |
|
176 |
fun preplay meth = Lazy.lazy (fn () => preplay_isar_step ctxt timeout meth step) |
|
177 |
val meths_outcomes = |
|
178 |
fold (fn meth => AList.default (op =) (meth, preplay meth)) meths meths_outcomes0 |
|
179 |
in |
|
180 |
preplay_data := Canonical_Label_Tab.map_default (l, []) |
|
181 |
(fold (AList.update (op =)) meths_outcomes) (!preplay_data) |
|
182 |
end |
|
183 |
| set_preplay_outcomes_of_isar_step _ _ _ _ _ = () |
|
52556
c8357085217c
completely rewrote SH compress; added two parameters for experimentation/fine grained control
smolkas
parents:
52454
diff
changeset
|
184 |
|
55269 | 185 |
fun peek_at_outcome outcome = if Lazy.is_finished outcome then Lazy.force outcome else Not_Played |
186 |
||
187 |
(* |
|
188 |
*) |
|
189 |
fun forced_preplay_outcome_of_isar_step preplay_data l = |
|
190 |
let |
|
191 |
fun get_best_outcome_available get_one = |
|
192 |
the (Canonical_Label_Tab.lookup preplay_data l) |
|
193 |
|> map (apsnd get_one) |
|
194 |
|> sort (play_outcome_ord o pairself snd) |
|
195 |
|> hd |> snd |
|
196 |
in |
|
197 |
(case get_best_outcome_available peek_at_outcome of |
|
198 |
Not_Played => get_best_outcome_available Lazy.force |
|
199 |
| outcome => outcome) |
|
200 |
end |
|
201 |
||
55268 | 202 |
fun preplay_outcome_of_isar_step_for_method preplay_data l = |
203 |
the o AList.lookup (op =) (the (Canonical_Label_Tab.lookup preplay_data l)) |
|
55252 | 204 |
|
55268 | 205 |
fun fastest_method_of_isar_step preplay_data = |
55269 | 206 |
the o Canonical_Label_Tab.lookup preplay_data |
207 |
#> tap (List.app (K () o Lazy.future Future.default_params o snd)) (* optional parallelism *) |
|
208 |
#> map (apsnd Lazy.force) |
|
209 |
#> sort (play_outcome_ord o pairself snd) |
|
55268 | 210 |
#> hd #> fst |
55266 | 211 |
|
212 |
fun forced_outcome_of_step preplay_data (Prove (_, _, l, _, _, (_, meths))) = |
|
213 |
Lazy.force (preplay_outcome_of_isar_step_for_method preplay_data l (the_single meths)) |
|
55260 | 214 |
| forced_outcome_of_step _ _ = Played Time.zeroTime |
55252 | 215 |
|
55260 | 216 |
fun preplay_outcome_of_isar_proof preplay_data (Proof (_, _, steps)) = |
217 |
fold_isar_steps (add_preplay_outcomes o forced_outcome_of_step preplay_data) steps |
|
218 |
(Played Time.zeroTime) |
|
50923 | 219 |
|
54504 | 220 |
end; |