author | wenzelm |
Mon, 13 Aug 2007 18:10:24 +0200 | |
changeset 24247 | 9d0bb01f6634 |
parent 23841 | 598839baafed |
child 29269 | 5c25a2012975 |
permissions | -rw-r--r-- |
23178 | 1 |
(* Title: Pure/search.ML |
1588 | 2 |
ID: $Id$ |
23178 | 3 |
Author: Lawrence C Paulson and Norbert Voelker |
1588 | 4 |
|
16179 | 5 |
Search tacticals. |
1588 | 6 |
*) |
7 |
||
2672
85d7e800d754
Replaced "flat" by the Basis Library function List.concat
paulson
parents:
2143
diff
changeset
|
8 |
infix 1 THEN_MAYBE THEN_MAYBE'; |
85d7e800d754
Replaced "flat" by the Basis Library function List.concat
paulson
parents:
2143
diff
changeset
|
9 |
|
1588 | 10 |
signature SEARCH = |
11 |
sig |
|
23178 | 12 |
val DEEPEN : int*int -> (int->int->tactic) -> int -> int -> tactic |
2869
acee08856cc9
DEEPEN now takes an upper bound for terminating searches
paulson
parents:
2672
diff
changeset
|
13 |
|
23178 | 14 |
val THEN_MAYBE : tactic * tactic -> tactic |
15 |
val THEN_MAYBE' : ('a -> tactic) * ('a -> tactic) -> ('a -> tactic) |
|
2672
85d7e800d754
Replaced "flat" by the Basis Library function List.concat
paulson
parents:
2143
diff
changeset
|
16 |
|
23178 | 17 |
val trace_DEPTH_FIRST : bool ref |
18 |
val DEPTH_FIRST : (thm -> bool) -> tactic -> tactic |
|
19 |
val DEPTH_SOLVE : tactic -> tactic |
|
20 |
val DEPTH_SOLVE_1 : tactic -> tactic |
|
21 |
val ITER_DEEPEN : (thm->bool) -> (int->tactic) -> tactic |
|
22 |
val THEN_ITER_DEEPEN : tactic -> (thm->bool) -> (int->tactic) -> tactic |
|
22025
7c5896919eb8
Introduction of a bound on DEPTH_ITER, to prevent the meson method from running forever
paulson
parents:
20852
diff
changeset
|
23 |
val iter_deepen_limit : int ref |
1588 | 24 |
|
23178 | 25 |
val has_fewer_prems : int -> thm -> bool |
26 |
val IF_UNSOLVED : tactic -> tactic |
|
27 |
val SOLVE : tactic -> tactic |
|
8149
941afb897532
added tacticals DETERM_UNTIL and DETERM_UNTIL_SOLVED
oheimb
parents:
5956
diff
changeset
|
28 |
val DETERM_UNTIL_SOLVED: tactic -> tactic |
23178 | 29 |
val trace_BEST_FIRST : bool ref |
30 |
val BEST_FIRST : (thm -> bool) * (thm -> int) -> tactic -> tactic |
|
31 |
val THEN_BEST_FIRST : tactic -> (thm->bool) * (thm->int) -> tactic |
|
32 |
-> tactic |
|
33 |
val trace_ASTAR : bool ref |
|
34 |
val ASTAR : (thm -> bool) * (int->thm->int) -> tactic -> tactic |
|
35 |
val THEN_ASTAR : tactic -> (thm->bool) * (int->thm->int) -> tactic |
|
36 |
-> tactic |
|
37 |
val BREADTH_FIRST : (thm -> bool) -> tactic -> tactic |
|
38 |
val QUIET_BREADTH_FIRST : (thm -> bool) -> tactic -> tactic |
|
1588 | 39 |
end; |
40 |
||
9094 | 41 |
|
9411 | 42 |
(** Instantiation of heaps for best-first search **) |
9094 | 43 |
|
9411 | 44 |
(*total ordering on theorems, allowing duplicates to be found*) |
45 |
structure ThmHeap = |
|
46 |
HeapFun (type elem = int * thm |
|
47 |
val ord = Library.prod_ord Library.int_ord |
|
48 |
(Term.term_ord o Library.pairself (#prop o Thm.rep_thm))); |
|
9094 | 49 |
|
50 |
||
23178 | 51 |
structure Search : SEARCH = |
1588 | 52 |
struct |
53 |
||
54 |
(**** Depth-first search ****) |
|
55 |
||
56 |
val trace_DEPTH_FIRST = ref false; |
|
57 |
||
58 |
(*Searches until "satp" reports proof tree as satisfied. |
|
59 |
Suppresses duplicate solutions to minimize search space.*) |
|
23178 | 60 |
fun DEPTH_FIRST satp tac = |
1588 | 61 |
let val tac = tracify trace_DEPTH_FIRST tac |
15531 | 62 |
fun depth used [] = NONE |
1588 | 63 |
| depth used (q::qs) = |
23178 | 64 |
case Seq.pull q of |
65 |
NONE => depth used qs |
|
66 |
| SOME(st,stq) => |
|
67 |
if satp st andalso not (member Thm.eq_thm used st) |
|
68 |
then SOME(st, Seq.make |
|
69 |
(fn()=> depth (st::used) (stq::qs))) |
|
70 |
else depth used (tac st :: stq :: qs) |
|
20852 | 71 |
in traced_tac (fn st => depth [] [Seq.single st]) end; |
1588 | 72 |
|
73 |
||
74 |
||
75 |
(*Predicate: Does the rule have fewer than n premises?*) |
|
76 |
fun has_fewer_prems n rule = (nprems_of rule < n); |
|
77 |
||
78 |
(*Apply a tactic if subgoals remain, else do nothing.*) |
|
79 |
val IF_UNSOLVED = COND (has_fewer_prems 1) all_tac; |
|
80 |
||
5754 | 81 |
(*Force a tactic to solve its goal completely, otherwise fail *) |
82 |
fun SOLVE tac = tac THEN COND (has_fewer_prems 1) all_tac no_tac; |
|
83 |
||
8149
941afb897532
added tacticals DETERM_UNTIL and DETERM_UNTIL_SOLVED
oheimb
parents:
5956
diff
changeset
|
84 |
(*Force repeated application of tactic until goal is solved completely *) |
941afb897532
added tacticals DETERM_UNTIL and DETERM_UNTIL_SOLVED
oheimb
parents:
5956
diff
changeset
|
85 |
val DETERM_UNTIL_SOLVED = DETERM_UNTIL (has_fewer_prems 1); |
941afb897532
added tacticals DETERM_UNTIL and DETERM_UNTIL_SOLVED
oheimb
parents:
5956
diff
changeset
|
86 |
|
2672
85d7e800d754
Replaced "flat" by the Basis Library function List.concat
paulson
parents:
2143
diff
changeset
|
87 |
(*Execute tac1, but only execute tac2 if there are at least as many subgoals |
85d7e800d754
Replaced "flat" by the Basis Library function List.concat
paulson
parents:
2143
diff
changeset
|
88 |
as before. This ensures that tac2 is only applied to an outcome of tac1.*) |
23178 | 89 |
fun (tac1 THEN_MAYBE tac2) st = |
3538 | 90 |
(tac1 THEN COND (has_fewer_prems (nprems_of st)) all_tac tac2) st; |
2672
85d7e800d754
Replaced "flat" by the Basis Library function List.concat
paulson
parents:
2143
diff
changeset
|
91 |
|
85d7e800d754
Replaced "flat" by the Basis Library function List.concat
paulson
parents:
2143
diff
changeset
|
92 |
fun (tac1 THEN_MAYBE' tac2) x = tac1 x THEN_MAYBE tac2 x; |
85d7e800d754
Replaced "flat" by the Basis Library function List.concat
paulson
parents:
2143
diff
changeset
|
93 |
|
1588 | 94 |
(*Tactical to reduce the number of premises by 1. |
95 |
If no subgoals then it must fail! *) |
|
3538 | 96 |
fun DEPTH_SOLVE_1 tac st = st |> |
1588 | 97 |
(case nprems_of st of |
23178 | 98 |
0 => no_tac |
3538 | 99 |
| n => DEPTH_FIRST (has_fewer_prems n) tac); |
1588 | 100 |
|
101 |
(*Uses depth-first search to solve ALL subgoals*) |
|
102 |
val DEPTH_SOLVE = DEPTH_FIRST (has_fewer_prems 1); |
|
103 |
||
104 |
||
105 |
||
2869
acee08856cc9
DEEPEN now takes an upper bound for terminating searches
paulson
parents:
2672
diff
changeset
|
106 |
(**** Iterative deepening with pruning ****) |
1588 | 107 |
|
108 |
fun has_vars (Var _) = true |
|
109 |
| has_vars (Abs (_,_,t)) = has_vars t |
|
110 |
| has_vars (f$t) = has_vars f orelse has_vars t |
|
111 |
| has_vars _ = false; |
|
112 |
||
113 |
(*Counting of primitive inferences is APPROXIMATE, as the step tactic |
|
114 |
may perform >1 inference*) |
|
115 |
||
116 |
(*Pruning of rigid ancestor to prevent backtracking*) |
|
23178 | 117 |
fun prune (new as (k', np':int, rgd', stq), qs) = |
1588 | 118 |
let fun prune_aux (qs, []) = new::qs |
119 |
| prune_aux (qs, (k,np,rgd,q)::rqs) = |
|
23178 | 120 |
if np'+1 = np andalso rgd then |
121 |
(if !trace_DEPTH_FIRST then |
|
122 |
tracing ("Pruning " ^ |
|
123 |
string_of_int (1+length rqs) ^ " levels") |
|
124 |
else (); |
|
125 |
(*Use OLD k: zero-cost solution; see Stickel, p 365*) |
|
126 |
(k, np', rgd', stq) :: qs) |
|
127 |
else prune_aux ((k,np,rgd,q)::qs, rqs) |
|
1588 | 128 |
fun take ([], rqs) = ([], rqs) |
23178 | 129 |
| take (arg as ((k,np,rgd,stq)::qs, rqs)) = |
130 |
if np' < np then take (qs, (k,np,rgd,stq)::rqs) |
|
131 |
else arg |
|
1588 | 132 |
in prune_aux (take (qs, [])) end; |
133 |
||
134 |
||
22025
7c5896919eb8
Introduction of a bound on DEPTH_ITER, to prevent the meson method from running forever
paulson
parents:
20852
diff
changeset
|
135 |
(*No known example (on 1-5-2007) needs even thirty*) |
7c5896919eb8
Introduction of a bound on DEPTH_ITER, to prevent the meson method from running forever
paulson
parents:
20852
diff
changeset
|
136 |
val iter_deepen_limit = ref 50; |
7c5896919eb8
Introduction of a bound on DEPTH_ITER, to prevent the meson method from running forever
paulson
parents:
20852
diff
changeset
|
137 |
|
1588 | 138 |
(*Depth-first iterative deepening search for a state that satisfies satp |
139 |
tactic tac0 sets up the initial goal queue, while tac1 searches it. |
|
140 |
The solution sequence is redundant: the cutoff heuristic makes it impossible |
|
141 |
to suppress solutions arising from earlier searches, as the accumulated cost |
|
142 |
(k) can be wrong.*) |
|
23178 | 143 |
fun THEN_ITER_DEEPEN tac0 satp tac1 = traced_tac (fn st => |
1588 | 144 |
let val countr = ref 0 |
145 |
and tf = tracify trace_DEPTH_FIRST (tac1 1) |
|
146 |
and qs0 = tac0 st |
|
147 |
(*bnd = depth bound; inc = estimate of increment required next*) |
|
23178 | 148 |
fun depth (bnd,inc) [] = |
22025
7c5896919eb8
Introduction of a bound on DEPTH_ITER, to prevent the meson method from running forever
paulson
parents:
20852
diff
changeset
|
149 |
if bnd > !iter_deepen_limit then |
23178 | 150 |
(tracing (string_of_int (!countr) ^ |
151 |
" inferences so far. Giving up at " ^ string_of_int bnd); |
|
152 |
NONE) |
|
22025
7c5896919eb8
Introduction of a bound on DEPTH_ITER, to prevent the meson method from running forever
paulson
parents:
20852
diff
changeset
|
153 |
else |
23178 | 154 |
(tracing (string_of_int (!countr) ^ |
155 |
" inferences so far. Searching to depth " ^ |
|
156 |
string_of_int bnd); |
|
157 |
(*larger increments make it run slower for the hard problems*) |
|
158 |
depth (bnd+inc, 10)) [(0, 1, false, qs0)] |
|
1588 | 159 |
| depth (bnd,inc) ((k,np,rgd,q)::qs) = |
23178 | 160 |
if k>=bnd then depth (bnd,inc) qs |
1588 | 161 |
else |
23178 | 162 |
case (countr := !countr+1; |
163 |
if !trace_DEPTH_FIRST then |
|
164 |
tracing (string_of_int np ^ implode (map (fn _ => "*") qs)) |
|
165 |
else (); |
|
166 |
Seq.pull q) of |
|
167 |
NONE => depth (bnd,inc) qs |
|
168 |
| SOME(st,stq) => |
|
169 |
if satp st (*solution!*) |
|
170 |
then SOME(st, Seq.make |
|
171 |
(fn()=> depth (bnd,inc) ((k,np,rgd,stq)::qs))) |
|
1588 | 172 |
|
23178 | 173 |
else |
1588 | 174 |
let val np' = nprems_of st |
23178 | 175 |
(*rgd' calculation assumes tactic operates on subgoal 1*) |
1588 | 176 |
val rgd' = not (has_vars (hd (prems_of st))) |
177 |
val k' = k+np'-np+1 (*difference in # of subgoals, +1*) |
|
23178 | 178 |
in if k'+np' >= bnd |
179 |
then depth (bnd, Int.min(inc, k'+np'+1-bnd)) qs |
|
180 |
else if np' < np (*solved a subgoal; prune rigid ancestors*) |
|
181 |
then depth (bnd,inc) |
|
182 |
(prune ((k', np', rgd', tf st), (k,np,rgd,stq) :: qs)) |
|
183 |
else depth (bnd,inc) ((k', np', rgd', tf st) :: |
|
184 |
(k,np,rgd,stq) :: qs) |
|
185 |
end |
|
1588 | 186 |
in depth (0,5) [] end); |
187 |
||
188 |
val ITER_DEEPEN = THEN_ITER_DEEPEN all_tac; |
|
189 |
||
190 |
||
2869
acee08856cc9
DEEPEN now takes an upper bound for terminating searches
paulson
parents:
2672
diff
changeset
|
191 |
(*Simple iterative deepening tactical. It merely "deepens" any search tactic |
acee08856cc9
DEEPEN now takes an upper bound for terminating searches
paulson
parents:
2672
diff
changeset
|
192 |
using increment "inc" up to limit "lim". *) |
23178 | 193 |
fun DEEPEN (inc,lim) tacf m i = |
194 |
let fun dpn m st = |
|
14160
6750ff1dfc32
Change from "tracing" to "warning", as requested by David Aspinall
paulson
parents:
12262
diff
changeset
|
195 |
st |> (if has_fewer_prems i st then no_tac |
23178 | 196 |
else if m>lim then |
197 |
(warning "Search depth limit exceeded: giving up"; |
|
198 |
no_tac) |
|
23841
598839baafed
DEEPEN: Use priority message channel for interim messages (not warnings).
aspinall
parents:
23178
diff
changeset
|
199 |
else (priority ("Search depth = " ^ string_of_int m); |
23178 | 200 |
tacf m i ORELSE dpn (m+inc))) |
2869
acee08856cc9
DEEPEN now takes an upper bound for terminating searches
paulson
parents:
2672
diff
changeset
|
201 |
in dpn m end; |
23178 | 202 |
|
1588 | 203 |
(*** Best-first search ***) |
204 |
||
205 |
val trace_BEST_FIRST = ref false; |
|
206 |
||
207 |
(*For creating output sequence*) |
|
15531 | 208 |
fun some_of_list [] = NONE |
209 |
| some_of_list (x::l) = SOME (x, Seq.make (fn () => some_of_list l)); |
|
1588 | 210 |
|
9094 | 211 |
(*Check for and delete duplicate proof states*) |
23178 | 212 |
fun deleteAllMin prf heap = |
9411 | 213 |
if ThmHeap.is_empty heap then heap |
22360
26ead7ed4f4b
moved eq_thm etc. to structure Thm in Pure/more_thm.ML;
wenzelm
parents:
22025
diff
changeset
|
214 |
else if Thm.eq_thm (prf, #2 (ThmHeap.min heap)) |
9411 | 215 |
then deleteAllMin prf (ThmHeap.delete_min heap) |
9094 | 216 |
else heap; |
1588 | 217 |
|
218 |
(*Best-first search for a state that satisfies satp (incl initial state) |
|
219 |
Function sizef estimates size of problem remaining (smaller means better). |
|
220 |
tactic tac0 sets up the initial priority queue, while tac1 searches it. *) |
|
23178 | 221 |
fun THEN_BEST_FIRST tac0 (satp, sizef) tac1 = |
1588 | 222 |
let val tac = tracify trace_BEST_FIRST tac1 |
223 |
fun pairsize th = (sizef th, th); |
|
9094 | 224 |
fun bfs (news,nprf_heap) = |
23178 | 225 |
(case List.partition satp news of |
226 |
([],nonsats) => next(fold_rev ThmHeap.insert (map pairsize nonsats) nprf_heap) |
|
227 |
| (sats,_) => some_of_list sats) |
|
9094 | 228 |
and next nprf_heap = |
15531 | 229 |
if ThmHeap.is_empty nprf_heap then NONE |
23178 | 230 |
else |
231 |
let val (n,prf) = ThmHeap.min nprf_heap |
|
232 |
in if !trace_BEST_FIRST |
|
233 |
then tracing("state size = " ^ string_of_int n) |
|
1588 | 234 |
else (); |
23178 | 235 |
bfs (Seq.list_of (tac prf), |
236 |
deleteAllMin prf (ThmHeap.delete_min nprf_heap)) |
|
9094 | 237 |
end |
9411 | 238 |
fun btac st = bfs (Seq.list_of (tac0 st), ThmHeap.empty) |
1588 | 239 |
in traced_tac btac end; |
240 |
||
241 |
(*Ordinary best-first search, with no initial tactic*) |
|
242 |
val BEST_FIRST = THEN_BEST_FIRST all_tac; |
|
243 |
||
23178 | 244 |
(*Breadth-first search to satisfy satpred (including initial state) |
1588 | 245 |
SLOW -- SHOULD NOT USE APPEND!*) |
23178 | 246 |
fun gen_BREADTH_FIRST message satpred (tac:tactic) = |
4270 | 247 |
let val tacf = Seq.list_of o tac; |
1588 | 248 |
fun bfs prfs = |
23178 | 249 |
(case List.partition satpred prfs of |
250 |
([],[]) => [] |
|
251 |
| ([],nonsats) => |
|
252 |
(message("breadth=" ^ string_of_int(length nonsats)); |
|
253 |
bfs (maps tacf nonsats)) |
|
254 |
| (sats,_) => sats) |
|
4270 | 255 |
in (fn st => Seq.of_list (bfs [st])) end; |
1588 | 256 |
|
12262 | 257 |
val BREADTH_FIRST = gen_BREADTH_FIRST tracing; |
5693 | 258 |
val QUIET_BREADTH_FIRST = gen_BREADTH_FIRST (K ()); |
259 |
||
1588 | 260 |
|
23178 | 261 |
(* Author: Norbert Voelker, FernUniversitaet Hagen |
1588 | 262 |
Remarks: Implementation of A*-like proof procedure by modification |
23178 | 263 |
of the existing code for BEST_FIRST and best_tac so that the |
264 |
current level of search is taken into account. |
|
265 |
*) |
|
1588 | 266 |
|
267 |
(*Insertion into priority queue of states, marked with level *) |
|
268 |
fun insert_with_level (lnth: int*int*thm, []) = [lnth] |
|
23178 | 269 |
| insert_with_level ((l,m,th), (l',n,th')::nths) = |
1588 | 270 |
if n<m then (l',n,th') :: insert_with_level ((l,m,th), nths) |
22360
26ead7ed4f4b
moved eq_thm etc. to structure Thm in Pure/more_thm.ML;
wenzelm
parents:
22025
diff
changeset
|
271 |
else if n=m andalso Thm.eq_thm(th,th') |
1588 | 272 |
then (l',n,th')::nths |
273 |
else (l,m,th)::(l',n,th')::nths; |
|
274 |
||
275 |
(*For creating output sequence*) |
|
15531 | 276 |
fun some_of_list [] = NONE |
277 |
| some_of_list (x::l) = SOME (x, Seq.make (fn () => some_of_list l)); |
|
1588 | 278 |
|
23178 | 279 |
val trace_ASTAR = ref false; |
1588 | 280 |
|
23178 | 281 |
fun THEN_ASTAR tac0 (satp, costf) tac1 = |
282 |
let val tf = tracify trace_ASTAR tac1; |
|
1588 | 283 |
fun bfs (news,nprfs,level) = |
284 |
let fun cost thm = (level, costf level thm, thm) |
|
15570 | 285 |
in (case List.partition satp news of |
23178 | 286 |
([],nonsats) |
287 |
=> next (List.foldr insert_with_level nprfs (map cost nonsats)) |
|
1588 | 288 |
| (sats,_) => some_of_list sats) |
23178 | 289 |
end and |
15531 | 290 |
next [] = NONE |
1588 | 291 |
| next ((level,n,prf)::nprfs) = |
23178 | 292 |
(if !trace_ASTAR |
12262 | 293 |
then tracing("level = " ^ string_of_int level ^ |
23178 | 294 |
" cost = " ^ string_of_int n ^ |
295 |
" queue length =" ^ string_of_int (length nprfs)) |
|
1588 | 296 |
else (); |
4270 | 297 |
bfs (Seq.list_of (tf prf), nprfs,level+1)) |
298 |
fun tf st = bfs (Seq.list_of (tac0 st), [], 0) |
|
1588 | 299 |
in traced_tac tf end; |
300 |
||
301 |
(*Ordinary ASTAR, with no initial tactic*) |
|
302 |
val ASTAR = THEN_ASTAR all_tac; |
|
303 |
||
304 |
end; |
|
305 |
||
306 |
open Search; |