File size: 23,151 Bytes
4a56cd6 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 | import OAI.Algorithms.SubexponentialSAT.SqrtLogSpace.DifferencePairsProgram
import OAI.Algorithms.SubexponentialSAT.SqrtLogSpace.StreamResources
import OAI.Algorithms.SubexponentialSAT.ProgramStateFrames
/-! Every source prefix of the actual pruned pair traversal. The two masks
carry the DFS phases; the resource invariant counts all caller stacks as well
as the four controller stacks. Callback time never contributes to the space
bound. -/
namespace OAI.Algorithms.SubexponentialSAT.SqrtLogSpace.DifferencePairsSpace
open BitProgram StructuredCalls DifferencePairsProgram
variable {r s : β}
private theorem short_prefix (p : Ports r s) {c : Cmd r s} {d : State r s}
{B t : β} (hb : β i, (d.stacks i).length β€ B) (ht : t β€ 13) :
β q e, q β€ t β
Trace (compiled c (p.stack 0) (p.stack 2)) q
(d.withPC (some (compiled c (p.stack 0) (p.stack 2)).entry)) e β
β i, (e.stacks i).length β€ s * B + 13 := by
intro q e hq he i
exact StructuredSpace.local_stack_bound (compiled c (p.stack 0) (p.stack 2))
(steps := 13) (StreamResources.dataBits_le_mul _ hb) q e (hq.trans ht) he i
private theorem cursor_bound (p : Ports r s) {N J B n j : β}
{pre : List (Option Bool)} {down : Bool} {a d : State r s}
(hN : N β€ B) (hJ : J β€ B) (hn : n + pre.length = N)
(hj : j + pre.countP Option.isSome = J) (hc : Cursor p n j pre down d)
(ha : β i, (a.stacks i).length β€ B)
(hf : β i, (β k, i β p.stack k) β d.stacks i = a.stacks i) :
β i, (d.stacks i).length β€ B := by
intro i
by_cases h : β k, i = p.stack k
Β· obtain β¨k, rflβ© := h
fin_cases k
Β· change (d.stacks (p.stack 0)).length β€ B
rw [hc.depth, List.length_replicate]; omega
Β· change (d.stacks (p.stack 1)).length β€ B
rw [hc.budget, List.length_replicate]; omega
Β· change (d.stacks (p.stack 2)).length β€ B
rw [hc.outer, List.length_reverse, List.length_map]; omega
Β· change (d.stacks (p.stack 3)).length β€ B
rw [hc.inner, List.length_reverse, List.length_map]; omega
Β· rw [hf i (by simpa using h)]
exact ha i
/-- The callback branch has three control instructions before the callback and
two register updates after it. The callback's own uniform bound is retained. -/
theorem callback_prefix (p : Ports r s) (callback : Cmd r s)
{d e : State r s} {t B D : β}
(hd : d.regs (p.register 0) = true) (hn : d.stacks (p.stack 0) = [])
(hb : β i, (d.stacks i).length β€ B)
(he : β i, (e.stacks i).length β€ B)
(hc : Eval callback t (popped p 0 2 d) e)
(hp : β q z, q β€ t β
Trace (compiled callback (p.stack 0) (p.stack 2)) q
((popped p 0 2 d).withPC
(some (compiled callback (p.stack 0) (p.stack 2)).entry)) z β
β i, (z.stacks i).length β€ D) :
β q z, q β€ t + 5 β
Trace (compiled (body p callback) (p.stack 0) (p.stack 2)) q
(d.withPC (some (compiled (body p callback) (p.stack 0) (p.stack 2)).entry)) z β
β i, (z.stacks i).length β€ max D (s * B + 13) := by
let tail : Cmd r s := atoms [.set (p.register 0) false, .set (p.register 1) true]
have htail : Eval tail 2 e (returned p e) := atoms_eval _ e
have ht := short_prefix p (c := tail) he (show 2 β€ 13 by omega)
have ht' : β q z, q β€ 2 β
Trace (compiled tail (p.stack 0) (p.stack 2)) q
(e.withPC (some (compiled tail (p.stack 0) (p.stack 2)).entry)) z β
β i, (z.stacks i).length β€ max D (s * B + 13) := by
intro q z hq hz i
exact (ht q z hq hz i).trans (Nat.le_max_right _ _)
have hp' : β q z, q β€ t β
Trace (compiled callback (p.stack 0) (p.stack 2)) q
((popped p 0 2 d).withPC
(some (compiled callback (p.stack 0) (p.stack 2)).entry)) z β
β i, (z.stacks i).length β€ max D (s * B + 13) := by
intro q z hq hz i
exact (hp q z hq hz i).trans (Nat.le_max_left _ _)
have hseq := StructuredSpace.sequence_stack_bound hc htail (p.stack 0) (p.stack 2)
hp' ht' (compiled (.seq callback tail) (p.stack 0) (p.stack 2))
(siteAddress (.seq callback tail)) (exitAddress (.seq callback tail))
(compiled_site _ (p.stack 0) (p.stack 2))
have hfalse : (popped p 0 2 d).regs (p.register 3) = false := by
simp [popped, StructuredProgram.Atom.eval, StructuredProgram.Atom.instr,
StructuredProgram.State.ofCfg, execInstr, readRegs, hn]
have hcond := StructuredSpace.conditional_false_stack_bound
(yes := enter p false false) hfalse (hc.seq htail) (p.stack 0) (p.stack 2) hseq
(compiled (.ite (p.register 3) (enter p false false) (.seq callback tail))
(p.stack 0) (p.stack 2))
(siteAddress _) (exitAddress _) (compiled_site _ (p.stack 0) (p.stack 2))
have hpop : Eval (atoms [.pop (p.stack 0) (p.register 2) (p.register 3)])
1 d (popped p 0 2 d) := atoms_eval _ d
have hpop' : β q z, q β€ 1 β
Trace (compiled (atoms [.pop (p.stack 0) (p.register 2) (p.register 3)])
(p.stack 0) (p.stack 2)) q
(d.withPC (some (compiled
(atoms [.pop (p.stack 0) (p.register 2) (p.register 3)])
(p.stack 0) (p.stack 2)).entry)) z β
β i, (z.stacks i).length β€ max D (s * B + 13) := by
intro q z hq hz i
exact (short_prefix p hb (show 1 β€ 13 by omega) q z hq hz i).trans
(Nat.le_max_right _ _)
have hdesc := StructuredSpace.sequence_stack_bound hpop
(Eval.ite_false hfalse (hc.seq htail)) (p.stack 0) (p.stack 2) hpop' hcond
(compiled (descend p callback) (p.stack 0) (p.stack 2))
(siteAddress _) (exitAddress _) (compiled_site _ (p.stack 0) (p.stack 2))
have h := StructuredSpace.conditional_true_stack_bound (no := backtrack p) hd
(hpop.seq (Eval.ite_false hfalse (hc.seq htail))) (p.stack 0) (p.stack 2) hdesc
(compiled (body p callback) (p.stack 0) (p.stack 2))
(siteAddress _) (exitAddress _) (compiled_site _ (p.stack 0) (p.stack 2))
intro q z hq hz
exact h q z (by omega) hz
/-- One real DFS body step preserves the bounded controller geometry and all
persistent stack bounds. The only unbounded-time branch is split around its
actual callback. -/
theorem body_resources (p : Ports r s) (callback : Cmd r s) (output : Fin s)
(visit : List (Option Bool) β List Bool β List Bool) (I : State r s β Prop)
(C N J B D : β)
(spec : CallbackSpec p callback output visit C N I) (hN : N β€ B) (hJ : J β€ B)
(hcallback : β j pre a b t, pre.length = N β
(j + 1) + pre.countP Option.isSome = J β Cursor p 0 (j + 1) pre true a β I a β
(β i, (a.stacks i).length β€ B) β Eval callback t (popped p 0 2 a) b β
(β i, (b.stacks i).length β€ B) β§
β q z, q β€ t β Trace (compiled callback (p.stack 0) (p.stack 2)) q
((popped p 0 2 a).withPC
(some (compiled callback (p.stack 0) (p.stack 2)).entry)) z β
β i, (z.stacks i).length β€ D)
{n j : β} {pre : List (Option Bool)} {down : Bool} {d : State r s}
(hc : Cursor p n (j + 1) pre down d) (hn : n + pre.length = N)
(hj : (j + 1) + pre.countP Option.isSome = J)
(hb : β i, (d.stacks i).length β€ B) (hI : I d) :
β t e, Eval (body p callback) t d e β§ I e β§
(β i, (e.stacks i).length β€ B) β§
(e.regs (p.register 1) = true β
β n j pre down, Cursor p n (j + 1) pre down e β§
n + pre.length = N β§ (j + 1) + pre.countP Option.isSome = J) β§
β q z, q β€ t β Trace (compiled (body p callback) (p.stack 0) (p.stack 2)) q
(d.withPC (some (compiled (body p callback) (p.stack 0) (p.stack 2)).entry)) z β
β i, (z.stacks i).length β€ max D (s * B + 13) := by
have short {e : State r s} {t n' j' : β} {pre' : List (Option Bool)} {down' : Bool}
(heval : Eval (body p callback) t d e) (ht : t β€ 13)
(hc' : Cursor p n' (j' + 1) pre' down' e)
(hn' : n' + pre'.length = N)
(hj' : (j' + 1) + pre'.countP Option.isSome = J)
(hf : β i, (β k, i β p.stack k) β e.stacks i = d.stacks i) :
β t e, Eval (body p callback) t d e β§ I e β§
(β i, (e.stacks i).length β€ B) β§
(e.regs (p.register 1) = true β
β n j pre down, Cursor p n (j + 1) pre down e β§
n + pre.length = N β§ (j + 1) + pre.countP Option.isSome = J) β§
β q z, q β€ t β Trace (compiled (body p callback) (p.stack 0) (p.stack 2)) q
(d.withPC (some (compiled (body p callback) (p.stack 0) (p.stack 2)).entry)) z β
β i, (z.stacks i).length β€ max D (s * B + 13) := by
refine β¨t, e, heval, spec.stable d e hf hI, cursor_bound p hN hJ hn' hj' hc' hb hf,
(fun _ => β¨n', j', pre', down', hc', hn', hj'β©), ?_β©
intro q z hq hz i
exact (short_prefix p hb ht q z hq hz i).trans (Nat.le_max_right _ _)
cases down with
| true =>
cases n with
| zero =>
obtain β¨t, e, _, he, hf, _, hIeβ© := spec.run j pre d (by omega) hc hI
obtain β¨heB, heDβ© := hcallback j pre d e t (by simpa using hn) hj hc hI hb he
have hr : Cursor p 0 (j + 1) pre false (returned p e) :=
β¨(hf 0).trans hc.depth, (hf 1).trans hc.budget, (hf 2).trans hc.outer,
(hf 3).trans hc.inner, returned_descending p e, returned_active p eβ©
refine β¨t + 5, returned p e,
body_callback p callback d e hc.descending (by simpa using hc.depth) t he,
spec.stable e (returned p e) (by intros; rfl) hIe,
heB, (fun _ => β¨0, j, pre, false, hr, hn, hjβ©), ?_β©
exact callback_prefix p callback hc.descending (by simpa using hc.depth) hb heB he heD
| succ n =>
apply short (body_descend p callback d hc.descending true (List.replicate n true)
(by simpa [List.replicate_succ] using hc.depth)) (by omega)
(cursor_descend p n (j + 1) pre d hc)
Β· simpa [Nat.add_assoc, Nat.add_comm, Nat.add_left_comm] using hn
Β· simpa using hj
Β· intro i hi
simp [descended, entered_frame _ _ _ _ _ (hi 2) (hi 3), popped_frame,
hi 0]
| false =>
rcases List.eq_nil_or_concat' pre with rfl | β¨pre, last, rflβ©
Β· have hs : (stopped p d).stacks = d.stacks := by
funext i
simp [stopped, popped, StructuredProgram.Atom.eval, StructuredProgram.Atom.instr,
StructuredProgram.State.ofCfg, execInstr,
hc.outer]
rw [β (show d.stacks (p.stack 2) = [] from by simpa using hc.outer),
Function.update_eq_self]
refine β¨4, stopped p d, body_stop p callback d hc.descending
(by simpa using hc.outer), ?_, ?_, ?_, ?_β©
Β· exact spec.stable d (stopped p d) (by intros; simp only [hs]) hI
Β· simpa only [hs] using hb
Β· intro hactive
simp [stopped, StructuredProgram.Atom.eval, StructuredProgram.Atom.instr,
StructuredProgram.State.ofCfg, execInstr] at hactive
Β· intro q z hq hz i
exact (short_prefix p hb (show 4 β€ 13 by omega) q z hq hz i).trans
(Nat.le_max_right _ _)
Β· cases last with
| none =>
cases j with
| zero =>
apply short (body_prune p callback d hc.descending
(pre.map Option.isSome).reverse true (by simpa using hc.outer)
(by simpa using hc.budget)) (by omega) (cursor_pruned p n pre d hc)
Β· simpa [Nat.add_assoc, Nat.add_comm, Nat.add_left_comm] using hn
Β· simpa using hj
Β· intro i hi
simp [pruned, testedOutside_stacks, backed, pushed_frame, popped_frame,
hi 0, hi 1, hi 2, hi 3]
| succ j =>
apply short (body_next_outer p callback d hc.descending
(pre.map Option.isSome).reverse (List.replicate j true) true true
(by simpa using hc.outer) (by simpa [List.replicate_succ] using hc.budget))
(by omega) (cursor_next_outer p n j pre d hc)
Β· simpa using hn
Β· simp at hj β’
omega
Β· intro i hi
simp [testedOutside_stacks, backed, popped_frame, hi 1, hi 2, hi 3]
| some bit =>
cases bit with
| false =>
apply short (body_next_inner p callback d hc.descending
(pre.map Option.isSome).reverse (pre.map (fun a => a.getD false)).reverse
(by simpa using hc.outer) (by simpa using hc.inner)) (by omega)
(cursor_next_inner p n (j + 1) pre d hc)
Β· simpa using hn
Β· simpa using hj
Β· intro i hi
simp [backed, popped_frame, hi 2, hi 3]
| true =>
apply short (body_finish p callback d hc.descending
(pre.map Option.isSome).reverse (pre.map (fun a => a.getD false)).reverse
(by simpa using hc.outer) (by simpa using hc.inner)) (by omega)
(cursor_finished p n (j + 1) pre d hc)
Β· simpa [Nat.add_assoc, Nat.add_comm, Nat.add_left_comm] using hn
Β· simp at hj β’
omega
Β· intro i hi
simp [finished, backed, pushed_frame, popped_frame, hi 0, hi 1, hi 2, hi 3]
/-- The complete actual loop has a bound independent of the number of pairs.
The conserved depth and strict budget bound every DFS controller word. -/
theorem loop_stack_bound (p : Ports r s) (callback : Cmd r s) (output : Fin s)
(visit : List (Option Bool) β List Bool β List Bool) (I : State r s β Prop)
(C N J B D : β)
(spec : CallbackSpec p callback output visit C N I) (hN : N β€ B) (hJ : J β€ B)
(hcallback : β j pre a b t, pre.length = N β
(j + 1) + pre.countP Option.isSome = J β Cursor p 0 (j + 1) pre true a β I a β
(β i, (a.stacks i).length β€ B) β Eval callback t (popped p 0 2 a) b β
(β i, (b.stacks i).length β€ B) β§
β q z, q β€ t β Trace (compiled callback (p.stack 0) (p.stack 2)) q
((popped p 0 2 a).withPC
(some (compiled callback (p.stack 0) (p.stack 2)).entry)) z β
β i, (z.stacks i).length β€ D)
{steps : β} {a b : State r s}
(heval : Eval (.while (p.register 1) (body p callback)) steps a b)
(ha : β i, (a.stacks i).length β€ B) (hIa : I a)
(hcursor : a.regs (p.register 1) = true β
β n j pre down, Cursor p n (j + 1) pre down a β§
n + pre.length = N β§ (j + 1) + pre.countP Option.isSome = J) :
β q z, q β€ steps β
Trace (compiled (.while (p.register 1) (body p callback)) (p.stack 0) (p.stack 2)) q
(a.withPC (some (compiled (.while (p.register 1) (body p callback))
(p.stack 0) (p.stack 2)).entry)) z β
β i, (z.stacks i).length β€ max D (s * B + 13) := by
let Inv := fun a : State r s => I a β§ (β i, (a.stacks i).length β€ B) β§
(a.regs (p.register 1) = true β
β n j pre down, Cursor p n (j + 1) pre down a β§
n + pre.length = N β§ (j + 1) + pre.countP Option.isSome = J)
have hB : B β€ max D (s * B + 13) := by
have hs : 1 β€ s := by have := (p.stack 0).isLt; omega
have hm : B β€ s * B := by simpa using Nat.mul_le_mul_right B hs
exact hm.trans ((Nat.le_add_right _ _).trans (Nat.le_max_right _ _))
apply StructuredSpace.loop_stack_bound (body p callback) (p.register 1)
(p.stack 0) (p.stack 2) Inv (max D (s * B + 13)) _ _ _ heval β¨hIa, ha, hcursorβ©
Β· intro d hd i
exact (hd.2.1 i).trans hB
Β· intro t d e he hd hactive
obtain β¨n, j, pre, down, hc, hn, hjβ© := hd.2.2 hactive
obtain β¨t', e', he', hIe, hb', hc', _β© :=
body_resources p callback output visit I C N J B D spec hN hJ hcallback hc hn hj hd.2.1 hd.1
have heq := Eval.final_unique (p.stack 0) he he'
subst e'
exact β¨hIe, hb', hc'β©
Β· intro t d e he hd hactive
obtain β¨n, j, pre, down, hc, hn, hjβ© := hd.2.2 hactive
obtain β¨t', e', he', _, _, _, hpβ© :=
body_resources p callback output visit I C N J B D spec hN hJ hcallback hc hn hj hd.2.1 hd.1
have heq := StreamResources.eval_steps_eq (p.stack 0) (p.stack 2) he he'
subst t'
exact hp
/-- Initialization, every DFS iteration, and the concrete final halt share one
space bound on the same actual source execution. Zero budget performs no
callback and is covered as well. -/
theorem program_stack_bound (p : Ports r s) (callback : Cmd r s) (output : Fin s)
(visit : List (Option Bool) β List Bool β List Bool) (I : State r s β Prop)
(C N J B D : β)
(spec : CallbackSpec p callback output visit C N I)
(hcallback : β j pre a b t, pre.length = N β
(j + 1) + pre.countP Option.isSome = J β Cursor p 0 (j + 1) pre true a β I a β
(β i, (a.stacks i).length β€ B) β Eval callback t (popped p 0 2 a) b β
(β i, (b.stacks i).length β€ B) β§
β q z, q β€ t β Trace (compiled callback (p.stack 0) (p.stack 2)) q
((popped p 0 2 a).withPC
(some (compiled callback (p.stack 0) (p.stack 2)).entry)) z β
β i, (z.stacks i).length β€ D)
{steps : β} {a b : State r s} (heval : Eval (command p callback) steps a b)
(ha : β i, (a.stacks i).length β€ B) (hIa : I a)
(hdepth : a.stacks (p.stack 0) = List.replicate N true)
(hbudget : a.stacks (p.stack 1) = List.replicate J true)
(houter : a.stacks (p.stack 2) = []) (hinner : a.stacks (p.stack 3) = []) :
β q z, q β€ steps + 1 β Trace (program p callback) q
(a.withPC (some (program p callback).entry)) z β
β i, (z.stacks i).length β€ max D (s * B + 13) := by
have hN : N β€ B := by simpa [hdepth] using ha (p.stack 0)
have hJ : J β€ B := by simpa [hbudget] using ha (p.stack 1)
apply StructuredSpace.compiled_halt_stack_bound heval (p.stack 0) (p.stack 2)
change Eval (.seq _ _) steps a b at heval
cases heval with
| @seq first second n m a middle b hinit hwhile =>
have hi := atoms_eval [.peek (p.stack 1) (p.register 2) (p.register 3),
.copy (p.register 1) (p.register 3), .set (p.register 0) true] a
have hmid : middle = initialized p a := Eval.final_unique (p.stack 0) hinit hi
subst middle
have hn : n = 3 := StreamResources.eval_steps_eq (p.stack 0) (p.stack 2) hinit hi
subst n
have hcursor : (initialized p a).regs (p.register 1) = true β
β n j pre down, Cursor p n (j + 1) pre down (initialized p a) β§
n + pre.length = N β§ (j + 1) + pre.countP Option.isSome = J := by
intro hactive
cases J with
| zero =>
simp [initialized, StructuredProgram.Atom.eval, StructuredProgram.Atom.instr,
StructuredProgram.State.ofCfg, execInstr,
readRegs, hbudget] at hactive
| succ J =>
refine β¨N, J, [], true, ?_, by simp, by simpβ©
refine β¨hdepth, hbudget, houter, hinner, ?_, hactiveβ©
simp [initialized, StructuredProgram.Atom.eval, StructuredProgram.Atom.instr,
StructuredProgram.State.ofCfg, execInstr]
have hloop := loop_stack_bound p callback output visit I C N J B D spec hN hJ
hcallback hwhile ha (spec.stable a (initialized p a) (by intros; rfl) hIa) hcursor
have hp : β q z, q β€ 3 β Trace (compiled
(atoms [.peek (p.stack 1) (p.register 2) (p.register 3),
.copy (p.register 1) (p.register 3), .set (p.register 0) true])
(p.stack 0) (p.stack 2)) q
(a.withPC (some (compiled
(atoms [.peek (p.stack 1) (p.register 2) (p.register 3),
.copy (p.register 1) (p.register 3), .set (p.register 0) true])
(p.stack 0) (p.stack 2)).entry)) z β
β i, (z.stacks i).length β€ max D (s * B + 13) := by
intro q z hq hz i
exact (short_prefix p ha (show 3 β€ 13 by omega) q z hq hz i).trans
(Nat.le_max_right _ _)
exact StructuredSpace.sequence_stack_bound hinit hwhile (p.stack 0) (p.stack 2)
hp hloop (program p callback) (siteAddress (command p callback))
(exitAddress (command p callback)) (compiled_site _ (p.stack 0) (p.stack 2))
/-- Exact callback fold, the measured pair-count budget, and every source
prefix bound hold for one and the same finite-program run. The concrete query
callback must instantiate the explicit correctness and resource contracts. -/
theorem program_resources (p : Ports r s) (callback : Cmd r s) (output : Fin s)
(houtput : β i, output β p.stack i)
(visit : List (Option Bool) β List Bool β List Bool) (I : State r s β Prop)
(C N J B D : β) (spec : CallbackSpec p callback output visit C N I)
(hcallback : β j pre a b t, pre.length = N β
(j + 1) + pre.countP Option.isSome = J β Cursor p 0 (j + 1) pre true a β I a β
(β i, (a.stacks i).length β€ B) β Eval callback t (popped p 0 2 a) b β
(β i, (b.stacks i).length β€ B) β§
β q z, q β€ t β Trace (compiled callback (p.stack 0) (p.stack 2)) q
((popped p 0 2 a).withPC
(some (compiled callback (p.stack 0) (p.stack 2)).entry)) z β
β i, (z.stacks i).length β€ D)
(a : State r s) (ha : β i, (a.stacks i).length β€ B) (hIa : I a)
(hdepth : a.stacks (p.stack 0) = List.replicate N true)
(hbudget : a.stacks (p.stack 1) = List.replicate J true)
(houter : a.stacks (p.stack 2) = []) (hinner : a.stacks (p.stack 3) = []) :
β t e, t β€ cost C N J β§ Trace (program p callback) t
(a.withPC (some (program p callback).entry)) (e.withPC none) β§
e.stacks output = DifferencePairs.fold visit N J [] (a.stacks output) β§
(β i, e.stacks (p.stack i) = a.stacks (p.stack i)) β§ I e β§
β q z, q β€ t β Trace (program p callback) q
(a.withPC (some (program p callback).entry)) z β
β i, (z.stacks i).length β€ max D (s * B + 13) := by
cases J with
| zero =>
have heval := command_eval_zero p callback a (by simpa using hbudget)
refine β¨5, initialized p a, by simp [cost],
compiled_halt_trace heval (p.stack 0) (p.stack 2),
by simp [DifferencePairs.fold], (fun _ => rfl),
spec.stable a _ (fun _ _ => rfl) hIa, ?_β©
exact program_stack_bound p callback output visit I C N 0 B D spec hcallback
heval ha hIa hdepth hbudget houter hinner
| succ J =>
obtain β¨t, e, ht, heval, ho, hf, hIeβ© := command_eval p callback output houtput
visit C N J I spec a hdepth hbudget houter hinner hIa
refine β¨t + 1, e, ?_, compiled_halt_trace heval (p.stack 0) (p.stack 2), ho, hf, hIe,
program_stack_bound p callback output visit I C N (J + 1) B D spec hcallback
heval ha hIa hdepth hbudget houter hinnerβ©
have hc := DifferencePairs.calls_le N (J + 1) (Nat.succ_pos J)
unfold cost
nlinarith
end OAI.Algorithms.SubexponentialSAT.SqrtLogSpace.DifferencePairsSpace
|