[Imprint][Data Privacy Statement][E-Mail]



View long theorem info. View the proof. Back to main index. View the specification. View theorem base summary, View theorem base listing, the used properties by spec, the dependency list, the symbol table,

Proof step 1 from proof bwsim (conclusion) (back to tree)

⊦ imfinbwsim(CIOAut(DQinit, DQstep), AIOAut(DurQinit, DurQstep), bwabs, DQINV, λ durqs. DurQInv(durqs.gstate, durqs.lsf, durqs.pcf))

System applied rule normalize

And obtained the following new goals

Rule argument

Additional information

Proof step 2 from proof bwsim (previous step) (back to tree)

¬ imfinbwsim(CIOAut(DQinit, DQstep), AIOAut(DurQinit, DurQstep), bwabs, DQINV, λ durqs. DurQInv(durqs.gstate, durqs.lsf, durqs.pcf)) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: imfinIObackward-INV[DQ-refines-DurQ-instance], name:proofobls-imfinbackwardsim, seq:⊦ imfinbwsim (CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV) ↔ bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV) ∧ (∀ cs. cINV(cs) → (∃ ass. ∀ as. t(cs, as) ∧ aINV(as) ↔ as ∈ ass)), subst:[astartf, cstartf, cINV, cstepf, t, astepf, aINV] → [DurQinit, DQinit, DQINV, DQstep, bwabs, DurQstep, λ durqs. DurQInv(durqs.gstate, durqs.lsf, durqs.pcf)], <all paths>

Additional information

Used terms: DurQinit, DQinit, DQINV, DQstep, bwabs, DurQstep, λ durqs. DurQInv(durqs.gstate, durqs.lsf, durqs.pcf)

Proof step 3 from proof bwsim (previous step) (back to tree)

⊦ imfinbwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV) ↔ bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV) ∧ (∀ cs. cINV(cs) → (∃ ass. ∀ as. t(cs, as) ∧ aINV(as) ↔ as ∈ ass))

A spec-lemma

Proof step 4 from proof bwsim (previous step) (back to tree)

¬ bwsim(CIOAut(DQinit, DQstep), AIOAut(DurQinit, DurQstep), bwabs, DQINV, λ durqs. DurQInv(durqs.gstate, durqs.lsf, durqs.pcf)) ∨ (∃ cs. ¬(DQINV(cs) → (∃ ass. ∀ as. bwabs(cs, as) ∧ DurQInv(as.gstate, as.lsf, as.pcf) ↔ as ∈ ass))) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: DQINV-def: ⊦ DQINV(dqs) ↔ DQInv(dqs.gstate, dqs.lsf, dqs.pcf) ∧ fininvdeq(dqs.pcf); ⊦ DurQLInv(gs, ls, pc) ↔ true; (s) ⊦ DurQGInv(gs) ↔ true; (s) ⊦ DurQInv(gs, lsf, pcf) ↔ DurQGInv(gs) ∧ (∀ tid. lsf(tid).tid = tid ∧ DurQLInv(gs, lsf(tid), pcf(tid))); (s)

Proof step 5 from proof bwsim (previous step) (back to tree)

¬ bwsim(CIOAut(DQinit, DQstep), AIOAut(DurQinit, DurQstep), bwabs, DQINV, λ durqs. ∀ tid. durqs.lsf(tid).tid = tid) ∨ ¬(DQInv(dqs.gstate, dqs.lsf, dqs.pcf) ∧ fininvdeq(dqs.pcf) → (∃ ass. ∀ durqs. bwabs(dqs, durqs) ∧ (∀ tid. durqs.lsf(tid).tid = tid) ↔ durqs ∈ ass)) ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DQ, name:elim-mkstate, seq:⊦ (gstate = s.gstate ∧ lsf = s.lsf) ∧ pcf = s.pcf ↔ s = mkstate(gstate, lsf, pcf), subst:[s, gstate, lsf, pcf] → [dqs, gs, lsf, pcf]

Additional information

Used simplifier rules: ⊦ (gstate = s.gstate ∧ lsf = s.lsf) ∧ pcf = s.pcf ↔ s = mkstate(gstate, lsf, pcf); (elim) Used terms: dqs, gstate, lsf, pcf

Proof step 6 from proof bwsim (previous step) (back to tree)

dqs = mkstate(gs, lsf, pcf), ¬ bwsim(CIOAut(DQinit, DQstep), AIOAut(DurQinit, DurQstep), bwabs, DQINV, λ durqs. ∀ tid. durqs.lsf(tid).tid = tid) ∨ ¬(DQInv(gs, lsf, pcf) ∧ fininvdeq(pcf) → (∃ ass. ∀ durqs. bwabs(dqs, durqs) ∧ (∀ tid. durqs.lsf(tid).tid = tid) ↔ durqs ∈ ass)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 7 from proof bwsim (previous step) (back to tree)

¬ bwsim(CIOAut(DQinit, DQstep), AIOAut(DurQinit, DurQstep), bwabs, DQINV, λ durqs. ∀ tid. durqs.lsf(tid).tid = tid) ∨ ¬(DQInv(gs, lsf, pcf) ∧ fininvdeq(pcf) → (∃ ass. ∀ durqs. bwabs(mkstate(gs, lsf, pcf), durqs) ∧ (∀ tid. durqs.lsf(tid).tid = tid) ↔ durqs ∈ ass)) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 1

Additional information

Proof step 8 from proof bwsim (previous step) (back to tree)

⊦ bwsim(CIOAut(DQinit, DQstep), AIOAut(DurQinit, DurQstep), bwabs, DQINV, λ durqs. ∀ tid. durqs.lsf(tid).tid = tid)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IObackward-INV[DQ-refines-DurQ-instance], name:proofobls-backwardsiminv, seq:⊦ bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV) ↔ (∀ cs. cstartf(cs) → cINV(cs)) ∧ (∀ as. astartf(as) → aINV(as)) ∧ (∀ cs, a, cs0. cINV(cs) ∧ cstepf(cs, a, cs0) → cINV(cs0)) ∧ (∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0)) ∧ (∀ cs. cINV(cs) → (∃ as. t(cs, as) ∧ aINV(as))) ∧ (∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as)) ∧ (∀ cs, a, cs0, as0. cINV(cs) ∧ cstepf(cs, a, cs0) ∧ t(cs0, as0) ∧ aINV(as0) → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as))), subst:[astartf, cstartf, cINV, cstepf, t, astepf, aINV] → [DurQinit, DQinit, DQINV, DQstep, bwabs, DurQstep, λ durqs. ∀ tid. durqs.lsf(tid).tid = tid], <all paths>

Additional information

Used terms: DurQinit, DQinit, DQINV, DQstep, bwabs, DurQstep, λ durqs. ∀ tid. durqs.lsf(tid).tid = tid

Proof step 9 from proof bwsim (previous step) (back to tree)

⊦ bwsim(CIOAut(cstartf, cstepf), AIOAut(astartf, astepf), t, cINV, aINV) ↔ (∀ cs. cstartf(cs) → cINV(cs)) ∧ (∀ as. astartf(as) → aINV(as)) ∧ (∀ cs, a, cs0. cINV(cs) ∧ cstepf(cs, a, cs0) → cINV(cs0)) ∧ (∀ as, a, as0. aINV(as) ∧ astepf(as, a, as0) → aINV(as0)) ∧ (∀ cs. cINV(cs) → (∃ as. t(cs, as) ∧ aINV(as))) ∧ (∀ cs, as. cstartf(cs) ∧ t(cs, as) ∧ aINV(as) → astartf(as)) ∧ (∀ cs, a, cs0, as0. cINV(cs) ∧ cstepf(cs, a, cs0) ∧ t(cs0, as0) ∧ aINV(as0) → (∃ as. aINV(as) ∧ amove(AIOAut(astartf, astepf))(as, ⌜a '⌝ ^, as0) ∧ t(cs, as)))

A spec-lemma

Proof step 10 from proof bwsim (previous step) (back to tree)

⊦ (∀ cs. DQinit(cs) → DQINV(cs)) ∧ (∀ as. DurQinit(as) → (∀ tid. as.lsf(tid).tid = tid)) ∧ (∀ cs, aa, cs0. DQINV(cs) ∧ DQstep(cs, aa, cs0) → DQINV(cs0)) ∧ (∀ as, aa, as0. (∀ tid. as.lsf(tid).tid = tid) ∧ DurQstep(as, aa, as0) → (∀ tid. as0.lsf(tid).tid = tid)) ∧ (∀ cs. DQINV(cs) → (∃ as. bwabs(cs, as) ∧ (∀ tid. as.lsf(tid).tid = tid))) ∧ (∀ cs, as. DQinit(cs) ∧ bwabs(cs, as) ∧ (∀ tid. as.lsf(tid).tid = tid) → DurQinit(as)) ∧ (∀ cs, aa, cs0, as0. DQINV(cs) ∧ DQstep(cs, aa, cs0) ∧ bwabs(cs0, as0) ∧ (∀ tid. as0.lsf(tid).tid = tid) → (∃ as. (∀ tid. as.lsf(tid).tid = tid) ∧ amove(AIOAut(DurQinit, DurQstep))(as, ⌜aa '⌝ ^, as0) ∧ bwabs(cs, as)))

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 11 from proof bwsim (previous step) (back to tree)

⊦ ∀ cs. DQinit(cs) → DQINV(cs)

User applied rule all right

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 12 from proof bwsim (previous step) (back to tree)

DQinit(dqs), ¬ DQINV(dqs) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:DQINV-Init, seq: ⊦ DQinit(dqs) → DQINV(dqs), subst:[dqs] → [dqs], <all paths>

Additional information

Used terms: dqs

Proof step 13 from proof bwsim (previous step) (back to tree)

⊦ DQinit(dqs) → DQINV(dqs)

Lemma DQINV-Init

Proof step 14 from proof bwsim (previous step) (back to tree)

⊦ ∀ as. DurQinit(as) → (∀ tid. as.lsf(tid).tid = tid)

User applied rule all right

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 15 from proof bwsim (previous step) (back to tree)

DurQinit(durqs) ⊦ ∀ tid. durqs.lsf(tid).tid = tid

User applied rule all right

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 16 from proof bwsim (previous step) (back to tree)

durqs.lsf(tid).tid ≠ tid, DurQinit(durqs) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:DurQinit, seq:⊦ DurQinit(durqs) ↔ durqs.gstate.queue = [] ∧ (∀ tid. durqs.pcf(tid) = idle ∧ durqs.lsf(tid).tid = tid), subst:[durqs] → [durqs], <all paths>

Additional information

Used terms: durqs

Proof step 17 from proof bwsim (previous step) (back to tree)

⊦ DurQinit(durqs) ↔ durqs.gstate.queue = [] ∧ (∀ tid. durqs.pcf(tid) = idle ∧ durqs.lsf(tid).tid = tid)

Lemma DurQinit

Proof step 18 from proof bwsim (previous step) (back to tree)

durqs.gstate.queue = [], durqs.lsf(tid).tid ≠ tid, ∀ tid. durqs.pcf(tid) = idle ∧ durqs.lsf(tid).tid = tid ⊦

User applied rule all left

And closed the goal!

Rule argument

pos: left 3 terms: tid abort: F discard: T computed: T

Additional information

Used terms: tid

Proof step 19 from proof bwsim (previous step) (back to tree)

⊦ ∀ cs, aa, cs0. DQINV(cs) ∧ DQstep(cs, aa, cs0) → DQINV(cs0)

User applied rule all right

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 20 from proof bwsim (previous step) (back to tree)

DQINV(dqs), DQstep(dqs, aa, dqs0), ¬ DQINV(dqs0) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:DQstep, seq: ⊦ DQstep(dqs, aa, dqs0) ↔ (∃ ca. DQstep(dqs, ca, dqs0) ∧ aa = aabs(ca)), subst:[dqs, aa, dqs0] → [dqs, aa, dqs0], <all paths>

Additional information

Used terms: dqs, aa, dqs0

Proof step 21 from proof bwsim (previous step) (back to tree)

⊦ DQstep(dqs, aa, dqs0) ↔ (∃ ca. DQstep(dqs, ca, dqs0) ∧ aa = aabs(ca))

Lemma DQstep

Proof step 22 from proof bwsim (previous step) (back to tree)

DQINV(dqs), ¬ DQINV(dqs0), ∃ ca. DQstep(dqs, ca, dqs0) ∧ aa = aabs(ca) ⊦

User applied rule exists left

And obtained the following new goals

Rule argument

pos: left 3

Additional information

Proof step 23 from proof bwsim (previous step) (back to tree)

aa = aabs(ca), DQINV(dqs), DQstep(dqs, ca, dqs0), ¬ DQINV(dqs0) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:DQINV-Step, seq: ⊦ DQINV(dqs) ∧ DQstep(dqs, ca, dqs0) → DQINV(dqs0), subst:[dqs, ca, dqs0] → [dqs, ca, dqs0], <all paths>

Additional information

Used simplifier rules: DQINV-def: ⊦ DQINV(dqs) ↔ DQInv(dqs.gstate, dqs.lsf, dqs.pcf) ∧ fininvdeq(dqs.pcf); Used terms: dqs, ca, dqs0

Proof step 24 from proof bwsim (previous step) (back to tree)

⊦ DQINV(dqs) ∧ DQstep(dqs, ca, dqs0) → DQINV(dqs0)

Lemma DQINV-Step

Proof step 25 from proof bwsim (previous step) (back to tree)

⊦ ∀ as, aa, as0. (∀ tid. as.lsf(tid).tid = tid) ∧ DurQstep(as, aa, as0) → (∀ tid. as0.lsf(tid).tid = tid)

User applied rule all right

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 26 from proof bwsim (previous step) (back to tree)

DurQstep(durqs, aa, durqs0), ∀ tid. durqs.lsf(tid).tid = tid ⊦ ∀ tid. durqs0.lsf(tid).tid = tid

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 27 from proof bwsim (previous step) (back to tree)

durqs0.lsf(tid).tid ≠ tid, DurQstep(durqs, aa, durqs0), ∀ tid. durqs.lsf(tid).tid = tid ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DurQ[DurQ-ren], name:elim-mkstate, seq:⊦ (gstate = s.gstate ∧ lsf = s.lsf) ∧ pcf = s.pcf ↔ s = mkstate(gstate, lsf, pcf), subst:[s, gstate, lsf, pcf] → [durqs0, ags, alsf, apcf]

Additional information

Used simplifier rules: ⊦ (gstate = s.gstate ∧ lsf = s.lsf) ∧ pcf = s.pcf ↔ s = mkstate(gstate, lsf, pcf); (elim) Used terms: durqs0, gstate, alsf, apcf

Proof step 28 from proof bwsim (previous step) (back to tree)

durqs0 = mkstate(ags, alsf, apcf), alsf(tid).tid ≠ tid, DurQstep(durqs, aa, durqs0), ∀ tid. durqs.lsf(tid).tid = tid ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 29 from proof bwsim (previous step) (back to tree)

alsf(tid).tid ≠ tid, DurQstep(durqs, aa, mkstate(ags, alsf, apcf)), ∀ tid. durqs.lsf(tid).tid = tid ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DurQ[DurQ-ren], name:elim-mkls, seq:⊦ (((tid = ls.tid ∧ ival = ls.ival) ∧ oval = ls.oval) ∧ value = ls.value) ∧ optval = ls.optval ↔ ls = mkls(tid, ival, oval, value, optval), subst:[value, ival, oval, tid, optval, ls] → [val0, val, optval, tid0, optval0, alsf(tid)]

Additional information

Used simplifier rules: ⊦ (((tid = ls.tid ∧ ival = ls.ival) ∧ oval = ls.oval) ∧ value = ls.value) ∧ optval = ls.optval ↔ ls = mkls(tid, ival, oval, value, optval); (elim) Used terms: value, ival, oval, tid0, optval, alsf(tid)

Proof step 30 from proof bwsim (previous step) (back to tree)

alsf(tid) = mkls(tid0, val, optval, val0, optval0), tid0 ≠ tid, DurQstep(durqs, aa, mkstate(ags, alsf, apcf)), ∀ tid. durqs.lsf(tid).tid = tid ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 4 terms: tid abort: F discard: F computed: T

Additional information

Used terms: tid

Proof step 31 from proof bwsim (previous step) (back to tree)

durqs.lsf(tid).tid = tid, alsf(tid) = mkls(tid0, val, optval, val0, optval0), tid0 ≠ tid, DurQstep(durqs, aa, mkstate(ags, alsf, apcf)), ∀ tid. durqs.lsf(tid).tid = tid ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DurQ[DurQ-ren], name:elim-mkstate, seq:⊦ (gstate = s.gstate ∧ lsf = s.lsf) ∧ pcf = s.pcf ↔ s = mkstate(gstate, lsf, pcf), subst:[s, gstate, lsf, pcf] → [durqs, ags0, alsf0, apcf0]

Additional information

Used simplifier rules: ⊦ (gstate = s.gstate ∧ lsf = s.lsf) ∧ pcf = s.pcf ↔ s = mkstate(gstate, lsf, pcf); (elim) Used terms: durqs, gstate, alsf0, apcf0

Proof step 32 from proof bwsim (previous step) (back to tree)

alsf0(tid).tid = tid, alsf(tid) = mkls(tid0, val, optval, val0, optval0), durqs = mkstate(ags0, alsf0, apcf0), tid0 ≠ tid, DurQstep(durqs, aa, mkstate(ags, alsf, apcf)), ∀ tid. alsf0(tid).tid = tid ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 33 from proof bwsim (previous step) (back to tree)

alsf0(tid).tid = tid, alsf(tid) = mkls(tid0, val, optval, val0, optval0), tid0 ≠ tid, DurQstep(mkstate(ags0, alsf0, apcf0), aa, mkstate(ags, alsf, apcf)), ∀ tid. alsf0(tid).tid = tid ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DurQ[DurQ-ren], name:elim-mkls, seq:⊦ (((tid = ls.tid ∧ ival = ls.ival) ∧ oval = ls.oval) ∧ value = ls.value) ∧ optval = ls.optval ↔ ls = mkls(tid, ival, oval, value, optval), subst:[value, ival, oval, tid, optval, ls] → [val2, val1, optval1, tid1, optval2, alsf0(tid)]

Additional information

Used simplifier rules: ⊦ (((tid = ls.tid ∧ ival = ls.ival) ∧ oval = ls.oval) ∧ value = ls.value) ∧ optval = ls.optval ↔ ls = mkls(tid, ival, oval, value, optval); (elim) Used terms: value, ival, oval, tid1, optval1, alsf0(tid)

Proof step 34 from proof bwsim (previous step) (back to tree)

alsf(tid) = mkls(tid0, val, optval, val0, optval0), alsf0(tid) = mkls(tid1, val1, optval1, val2, optval2), tid1 = tid, tid0 ≠ tid, DurQstep(mkstate(ags0, alsf0, apcf0), aa, mkstate(ags, alsf, apcf)), ∀ tid. alsf0(tid).tid = tid ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 35 from proof bwsim (previous step) (back to tree)

alsf(tid) = mkls(tid0, val, optval, val0, optval0), alsf0(tid) = mkls(tid, val1, optval1, val2, optval2), tid0 ≠ tid, DurQstep(mkstate(ags0, alsf0, apcf0), aa, mkstate(ags, alsf, apcf)), ∀ tid. alsf0(tid).tid = tid ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:DurQstep, seq:⊦ DurQstep(durqs, aa, durqs0) ↔ (∃ a. DurQstep(durqs, a, durqs0) ∧ aa = aabs(a)), subst:[durqs, aa, durqs0] → [mkstate(ags0, alsf0, apcf0), aa, mkstate(ags, alsf, apcf)], <all paths>

Additional information

Used terms: mkstate(ags0, alsf0, apcf0), aa, mkstate(ags, alsf, apcf)

Proof step 36 from proof bwsim (previous step) (back to tree)

⊦ DurQstep(durqs, aa, durqs0) ↔ (∃ a. DurQstep(durqs, a, durqs0) ∧ aa = aabs(a))

Lemma DurQstep

Proof step 37 from proof bwsim (previous step) (back to tree)

alsf(tid) = mkls(tid0, val, optval, val0, optval0), alsf0(tid) = mkls(tid, val1, optval1, val2, optval2), tid0 ≠ tid, ∀ tid. alsf0(tid).tid = tid, ∃ a. DurQstep(mkstate(ags0, alsf0, apcf0), a, mkstate(ags, alsf, apcf)) ∧ aa = aabs(a) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 38 from proof bwsim (previous step) (back to tree)

alsf(tid) = mkls(tid0, val, optval, val0, optval0), alsf0(tid) = mkls(tid, val1, optval1, val2, optval2), tid0 ≠ tid, DurQstep(mkstate(ags0, alsf0, apcf0), a, mkstate(ags, alsf, apcf)), ∀ tid. alsf0(tid).tid = tid ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DurQ[DurQ-ren], name:DurQstep-def0, seq:⊦ DurQstep(mkstate(gs, lsf, pcf), a, durqs0) ↔ (a = globalACrash ⊃ durqs0 = mkstate(gs, lsf, λ tid. (pcf(tid) = idle ⊃ idle;crashed)) ;∃ tid. pre(gs, lsf(tid), pcf(tid), a) ∧ durqs0 = mkstate (gstepf(gs, lsf(tid), pcf(tid), a), lsf(tid; lstepf(gs, lsf(tid), pcf(tid), a)), pcf(tid; pcstepf(gs, lsf(tid), pcf(tid), a))) ), subst:[durqs0, lsf, a, gs, pcf] → [mkstate(ags, alsf, apcf), alsf0, a, ags0, apcf0], <all paths>

Additional information

Used terms: mkstate(ags, alsf, apcf), alsf0, a, ags0, apcf0

Proof step 39 from proof bwsim (previous step) (back to tree)

⊦ DurQstep(mkstate(gs, lsf, pcf), a, durqs0) ↔ (a = globalACrash ⊃ durqs0 = mkstate(gs, lsf, λ tid. (pcf(tid) = idle ⊃ idle;crashed)) ;∃ tid. pre(gs, lsf(tid), pcf(tid), a) ∧ durqs0 = mkstate(gstepf(gs, lsf(tid), pcf(tid), a), lsf(tid; lstepf(gs, lsf(tid), pcf(tid), a)), pcf(tid; pcstepf(gs, lsf(tid), pcf(tid), a))) )

A spec-lemma

Proof step 40 from proof bwsim (previous step) (back to tree)

alsf(tid) = mkls(tid0, val, optval, val0, optval0), alsf0(tid) = mkls(tid, val1, optval1, val2, optval2), tid0 ≠ tid, (a = globalACrash ⊃ mkstate(ags, alsf, apcf) = mkstate(ags0, alsf0, λ tid. (apcf0(tid) = idle ⊃ idle;crashed)) ;∃ tid. pre(ags0, alsf0(tid), apcf0(tid), a) ∧ mkstate(ags, alsf, apcf) = mkstate (gstepf(ags0, alsf0(tid), apcf0(tid), a), alsf0(tid; lstepf(ags0, alsf0(tid), apcf0(tid), a)), apcf0(tid; pcstepf(ags0, alsf0(tid), apcf0(tid), a))) ), ∀ tid. alsf0(tid).tid = tid ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 41 from proof bwsim (previous step) (back to tree)

alsf(tid) = mkls(tid0, val, optval, val0, optval0), alsf0(tid) = mkls(tid, val1, optval1, val2, optval2), tid0 ≠ tid, (a = globalACrash ⊃ mkstate(ags, alsf, apcf) = mkstate(ags0, alsf0, λ tid. (apcf0(tid) = idle ⊃ idle;crashed)) ; pre(ags0, alsf0(tid1), apcf0(tid1), a) ∧ mkstate(ags, alsf, apcf) = mkstate (gstepf(ags0, alsf0(tid1), apcf0(tid1), a), alsf0(tid1; lstepf(ags0, alsf0(tid1), apcf0(tid1), a)), apcf0(tid1; pcstepf(ags0, alsf0(tid1), apcf0(tid1), a))) ), ∀ tid. alsf0(tid).tid = tid ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 4

Additional information

Used simplifier rules: ⊦ mkstate(gstate, lsf, pcf) = mkstate(gstate0, lsf0, pcf0) ↔ gstate = gstate0 ∧ lsf = lsf0 ∧ pcf = pcf0; (ws) ⊦ mkls(tid, ival, oval, ival0, oval0) = mkls(tid0, ival1, oval1, ival2, oval2) ↔ tid = tid0 ∧ ival = ival1 ∧ oval = oval1 ∧ ival0 = ival2 ∧ oval0 = oval2; (ws)

Proof step 42 from proof bwsim (previous step) (back to tree)

alsf(tid) = mkls(tid0, val, optval, val0, optval0), alsf0(tid) = mkls(tid, val1, optval1, val2, optval2), mkstate(ags, alsf, apcf) = mkstate (gstepf(ags0, alsf0(tid1), apcf0(tid1), a), alsf0(tid1; lstepf(ags0, alsf0(tid1), apcf0(tid1), a)), apcf0(tid1; pcstepf(ags0, alsf0(tid1), apcf0(tid1), a))), a ≠ globalACrash, tid0 ≠ tid, pre(ags0, alsf0(tid1), apcf0(tid1), a), ∀ tid. alsf0(tid).tid = tid ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ mkstate(gstate, lsf, pcf) = mkstate(gstate0, lsf0, pcf0) ↔ gstate = gstate0 ∧ lsf = lsf0 ∧ pcf = pcf0; (ws)

Proof step 43 from proof bwsim (previous step) (back to tree)

(tid1 = tid ⊃ lstepf(ags0, mkls(tid, val1, optval1, val2, optval2), apcf0(tid), a);mkls(tid, val1, optval1, val2, optval2)) = mkls(tid0, val, optval, val0, optval0), alsf0(tid) = mkls(tid, val1, optval1, val2, optval2), a ≠ globalACrash, tid0 ≠ tid, pre(ags0, alsf0(tid1), apcf0(tid1), a), ∀ tid. alsf0(tid).tid = tid ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 1

Additional information

Used simplifier rules: ⊦ mkls(tid, ival, oval, ival0, oval0) = mkls(tid0, ival1, oval1, ival2, oval2) ↔ tid = tid0 ∧ ival = ival1 ∧ oval = oval1 ∧ ival0 = ival2 ∧ oval0 = oval2; (ws)

Proof step 44 from proof bwsim (previous step) (back to tree)

alsf0(tid) = mkls(tid, val1, optval1, val2, optval2), lstepf(ags0, mkls(tid, val1, optval1, val2, optval2), apcf0(tid), a) = mkls(tid0, val, optval, val0, optval0), tid1 = tid, a ≠ globalACrash, tid0 ≠ tid, pre(ags0, alsf0(tid1), apcf0(tid1), a), ∀ tid. alsf0(tid).tid = tid ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 45 from proof bwsim (previous step) (back to tree)

alsf0(tid) = mkls(tid, val1, optval1, val2, optval2), lstepf(ags0, mkls(tid, val1, optval1, val2, optval2), apcf0(tid), a) = mkls(tid0, val, optval, val0, optval0), a ≠ globalACrash, tid0 ≠ tid, pre(ags0, mkls(tid, val1, optval1, val2, optval2), apcf0(tid), a), ∀ tid. alsf0(tid).tid = tid ⊦

User applied rule structural induction

And closed the goal!

Rule argument

term: apcf0(tid)

Additional information

Used simplifier rules: DurQPC freely generated by crashed, idle, invDeq, invEnq, ready, resDeq, resEnq;; ⊦ pre(gs, ls, resEnq, a) ↔ a = ARetEnq(ls.tid); (s) ⊦ mkls(tid, ival, oval, ival0, oval0).tid = tid; (s) ⊦ lstepf(gs, mkls(tid, ival, oval, value, optval), resEnq, ARetEnq(tid)) = mkls(tid, ival, oval, value, optval); (s) ⊦ mkls(tid, ival, oval, ival0, oval0) = mkls(tid0, ival1, oval1, ival2, oval2) ↔ tid = tid0 ∧ ival = ival1 ∧ oval = oval1 ∧ ival0 = ival2 ∧ oval0 = oval2; (ws) ⊦ pre(gs, ls, resDeq, a) ↔ a = ARetDeq(ls.tid, ls.oval); (s) ⊦ mkls(tid, ival, oval, ival0, oval0).oval = oval; (s) ⊦ lstepf(gs, mkls(tid, ival, oval, value, optval), resDeq, ARetDeq(tid, oval)) = mkls(tid, ival, oval, value, oval); (s) ⊦ pre(gs, ls, ready, a) ↔ (∃ value. a = AInvEnq(ls.tid, value)) ∨ a = AInvDeq(ls.tid); (s) ⊦ lstepf (gs, mkls(tid, ival, oval, value, optval), ready, AInvEnq(tid, value0)) = mkls(tid, value0, oval, value, optval); (s) ⊦ lstepf(gs, mkls(tid, ival, oval, value, optval), ready, AInvDeq(tid)) = mkls(tid, ival, oval, value, optval); (s) ⊦ pre(gs, ls, invEnq, a) ↔ a = ADoEnq(ls.tid); (s) ⊦ lstepf(gs, mkls(tid, ival, oval, value, optval), invEnq, ADoEnq(tid)) = mkls(tid, ival, oval, value, optval); (s) ⊦ pre(gs, ls, invDeq, a) ↔ a = ADoDeq(ls.tid); (s) ⊦ lstepf(gs, mkls(tid, ival, oval, value, optval), invDeq, ADoDeq(tid)) = mkls(tid, ival, (gs.queue = [] ⊃ Empty;Val(gs.queue.head)), value, optval); (s) ⊦ pre(gs, ls, idle, a) ↔ a = callARun(ls.tid); (s) ⊦ lstepf(gs, mkls(tid, ival, oval, value, optval), idle, callARun(tid)) = mkls(tid, ival, oval, value, optval); (s) ⊦ pre(gs, ls, crashed, a) ↔ false; (s)

Proof step 46 from proof bwsim (previous step) (back to tree)

⊦ ∀ cs. DQINV(cs) → (∃ as. bwabs(cs, as) ∧ (∀ tid. as.lsf(tid).tid = tid))

User applied rule all right

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 47 from proof bwsim (previous step) (back to tree)

DQINV(dqs) ⊦ ∃ as. bwabs(dqs, as) ∧ (∀ tid. as.lsf(tid).tid = tid)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: DQINV-def: ⊦ DQINV(dqs) ↔ DQInv(dqs.gstate, dqs.lsf, dqs.pcf) ∧ fininvdeq(dqs.pcf);

Proof step 48 from proof bwsim (previous step) (back to tree)

DQInv(dqs.gstate, dqs.lsf, dqs.pcf), fininvdeq(dqs.pcf) ⊦ ∃ as. bwabs(dqs, as) ∧ (∀ tid. as.lsf(tid).tid = tid)

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DQ, name:elim-mkstate, seq:⊦ (gstate = s.gstate ∧ lsf = s.lsf) ∧ pcf = s.pcf ↔ s = mkstate(gstate, lsf, pcf), subst:[s, gstate, lsf, pcf] → [dqs, gs, lsf, pcf]

Additional information

Used simplifier rules: ⊦ (gstate = s.gstate ∧ lsf = s.lsf) ∧ pcf = s.pcf ↔ s = mkstate(gstate, lsf, pcf); (elim) Used terms: dqs, gstate, lsf, pcf

Proof step 49 from proof bwsim (previous step) (back to tree)

dqs = mkstate(gs, lsf, pcf), DQInv(gs, lsf, pcf), fininvdeq(pcf) ⊦ ∃ as. bwabs(dqs, as) ∧ (∀ tid. as.lsf(tid).tid = tid)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 50 from proof bwsim (previous step) (back to tree)

DQInv(gs, lsf, pcf), fininvdeq(pcf) ⊦ ∃ as. bwabs(mkstate(gs, lsf, pcf), as) ∧ (∀ tid. as.lsf(tid).tid = tid)

User applied rule exists right

And obtained the following new goals

Rule argument

pos: right 1 terms: mkstate (mkdgs(gs.queue), λ tid. bwlabsf(lsf(tid)), λ tid. bwabspcf(pcf(tid))) abort: F discard: T computed: F

Additional information

Used terms: mkstate(mkdgs(gs.queue), λ tid. bwlabsf(lsf(tid)), λ tid. bwabspcf(pcf(tid)))

Proof step 51 from proof bwsim (previous step) (back to tree)

DQInv(gs, lsf, pcf), fininvdeq(pcf) ⊦ bwabs(mkstate(gs, lsf, pcf), mkstate(mkdgs(gs.queue), λ tid. bwlabsf(lsf(tid)), λ tid. bwabspcf(pcf(tid)))) ∧ (∀ tid. mkstate(mkdgs(gs.queue), λ tid. bwlabsf(lsf(tid)), λ tid. bwabspcf(pcf(tid))).lsf(tid).tid = tid)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ mkls(tid, ival, oval, ival0, oval0).tid = tid; (s) ⊦ mkstate(gstate, lsf, pcf).lsf = lsf; (s) ⊦ bwlabsf(ls) = mkls(ls.tid, ls.ival, ls.oval, ls.value, ls.optval); (s)

Proof step 52 from proof bwsim (previous step) (back to tree)

DQInv(gs, lsf, pcf), fininvdeq(pcf) ⊦ bwabs (mkstate(gs, lsf, pcf), mkstate(mkdgs(gs.queue), λ tid. mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval), λ tid. bwabspcf(pcf(tid)))) ∧ lsf(tid).tid = tid

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DQ, name:elim-mkgs, seq: ⊦ queue = gs.queue ↔ gs = mkgs(queue), subst:[gs, queue] → [gs, queue]

Additional information

Used simplifier rules: ⊦ queue = gs.queue ↔ gs = mkgs(queue); (elim) Used terms: gs, queue

Proof step 53 from proof bwsim (previous step) (back to tree)

gs = mkgs(queue), DQInv(gs, lsf, pcf), fininvdeq(pcf) ⊦ bwabs (mkstate(gs, lsf, pcf), mkstate(mkdgs(queue), λ tid. mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval), λ tid. bwabspcf(pcf(tid)))) ∧ lsf(tid).tid = tid

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 54 from proof bwsim (previous step) (back to tree)

DQInv(mkgs(queue), lsf, pcf), fininvdeq(pcf) ⊦ bwabs (mkstate(mkgs(queue), lsf, pcf), mkstate(mkdgs(queue), λ tid. mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval), λ tid. bwabspcf(pcf(tid)))) ∧ lsf(tid).tid = tid

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DQ, name:elim-mkls, seq:⊦ ( ( ((tid = ls.tid ∧ (obsEmpty ↔ ls.obsEmpty)) ∧ ival = ls.ival) ∧ oval = ls.oval) ∧ value = ls.value) ∧ optval = ls.optval ↔ ls = mkls(tid, obsEmpty, ival, oval, value, optval), subst:[value, ival, obsEmpty, ls, oval, tid, optval] → [val0, val, obsEmpty, lsf(tid), optval, tid0, optval0]

Additional information

Used simplifier rules: ⊦ ( ( ((tid = ls.tid ∧ (obsEmpty ↔ ls.obsEmpty)) ∧ ival = ls.ival) ∧ oval = ls.oval) ∧ value = ls.value) ∧ optval = ls.optval ↔ ls = mkls(tid, obsEmpty, ival, oval, value, optval); (elim) Used terms: value, ival, obsEmpty, lsf(tid), oval, tid0, optval

Proof step 55 from proof bwsim (previous step) (back to tree)

lsf(tid) = mkls(tid0, obsEmpty, val, optval, val0, optval0), DQInv(mkgs(queue), lsf, pcf), fininvdeq(pcf) ⊦ bwabs (mkstate(mkgs(queue), lsf, pcf), mkstate(mkdgs(queue), λ tid. mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval), λ tid. bwabspcf(pcf(tid)))) ∧ tid0 = tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 56 from proof bwsim (previous step) (back to tree)

lsf(tid) = mkls(tid0, obsEmpty, val, optval, val0, optval0), DQInv(mkgs(queue), lsf, pcf), fininvdeq(pcf), ¬ bwabs (mkstate(mkgs(queue), lsf, pcf), mkstate(mkdgs(queue), λ tid. mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval), λ tid. bwabspcf(pcf(tid)))) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: bwabs, name:bwabs-def, seq:⊦ bwabs(mkstate(gs, lsf, pcf), mkstate(ags, alsf, apcf)) ↔ ags = mkdgs(gs.queue) ∧ (∀ tid. alsf(tid) = mkls (lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ apcf(tid) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls (lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty), subst:[gs, alsf, lsf, ags, pcf, apcf] → [mkgs(queue), λ tid. mkls (lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval), lsf, mkdgs(queue), pcf, λ tid. bwabspcf(pcf(tid))], <all paths>

Additional information

Used simplifier rules: ⊦ mkgs(queue).queue = queue; (s) ⊦ mkdgs(queue) = mkdgs(queue0) ↔ queue = queue0; (s) Used terms: mkgs(queue), λ tid. mkls (lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval), lsf, mkdgs(queue), pcf, λ tid. bwabspcf(pcf(tid))

Proof step 57 from proof bwsim (previous step) (back to tree)

⊦ bwabs(mkstate(gs, lsf, pcf), mkstate(ags, alsf, apcf)) ↔ ags = mkdgs(gs.queue) ∧ (∀ tid. alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ apcf(tid) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty)

A spec-lemma

Proof step 58 from proof bwsim (previous step) (back to tree)

lsf(tid) = mkls(tid0, obsEmpty, val, optval, val0, optval0), tid0 ≠ tid, DQInv(mkgs(queue), lsf, pcf), fininvdeq(pcf) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DQ, name:DQInv, seq:⊦ DQInv(gs, lsf, pcf) ↔ DQGInv(gs) ∧ (∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid))), subst:[gs, lsf, pcf] → [mkgs(queue), lsf, pcf], <all paths>

Additional information

Used terms: mkgs(queue), lsf, pcf

Proof step 59 from proof bwsim (previous step) (back to tree)

⊦ DQInv(gs, lsf, pcf) ↔ DQGInv(gs) ∧ (∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)))

A spec-lemma

Proof step 60 from proof bwsim (previous step) (back to tree)

lsf(tid) = mkls(tid0, obsEmpty, val, optval, val0, optval0), tid0 ≠ tid, DQGInv(mkgs(queue)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦

User applied rule all left

And closed the goal!

Rule argument

pos: left 5 terms: tid abort: F discard: T computed: T

Additional information

Used simplifier rules: ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).tid = tid; (s) Used terms: tid

Proof step 61 from proof bwsim (previous step) (back to tree)

⊦ ∀ cs, as. DQinit(cs) ∧ bwabs(cs, as) ∧ (∀ tid. as.lsf(tid).tid = tid) → DurQinit(as)

User applied rule all right

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 62 from proof bwsim (previous step) (back to tree)

DQinit(dqs), bwabs(dqs, durqs), ¬ DurQinit(durqs), ∀ tid. durqs.lsf(tid).tid = tid ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:DurQinit, seq:⊦ DurQinit(durqs) ↔ durqs.gstate.queue = [] ∧ (∀ tid. durqs.pcf(tid) = idle ∧ durqs.lsf(tid).tid = tid), subst:[durqs] → [durqs], <all paths>

Additional information

Used terms: durqs

Proof step 63 from proof bwsim (previous step) (back to tree)

⊦ DurQinit(durqs) ↔ durqs.gstate.queue = [] ∧ (∀ tid. durqs.pcf(tid) = idle ∧ durqs.lsf(tid).tid = tid)

Lemma DurQinit

Proof step 64 from proof bwsim (previous step) (back to tree)

DQinit(dqs), bwabs(dqs, durqs), ∀ tid. durqs.lsf(tid).tid = tid, durqs.gstate.queue ≠ [] ∨ (∃ tid. ¬(durqs.pcf(tid) = idle ∧ durqs.lsf(tid).tid = tid)) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:DQinit, seq:⊦ DQinit(dqs) ↔ dqs.gstate.queue = [] ∧ (∀ tid. dqs.pcf(tid) = idle ∧ dqs.lsf(tid).tid = tid), subst:[dqs] → [dqs], <all paths>

Additional information

Used terms: dqs

Proof step 65 from proof bwsim (previous step) (back to tree)

⊦ DQinit(dqs) ↔ dqs.gstate.queue = [] ∧ (∀ tid. dqs.pcf(tid) = idle ∧ dqs.lsf(tid).tid = tid)

Lemma DQinit

Proof step 66 from proof bwsim (previous step) (back to tree)

dqs.gstate.queue = [], bwabs(dqs, durqs), ∀ tid. durqs.lsf(tid).tid = tid, ∀ tid. dqs.pcf(tid) = idle ∧ dqs.lsf(tid).tid = tid, durqs.gstate.queue ≠ [] ∨ (∃ tid. ¬(durqs.pcf(tid) = idle ∧ durqs.lsf(tid).tid = tid)) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 5

Additional information

Proof step 67 from proof bwsim (previous step) (back to tree)

dqs.gstate.queue = [], durqs.gstate.queue ≠ [], bwabs(dqs, durqs), ∀ tid. dqs.pcf(tid) = idle ∧ dqs.lsf(tid).tid = tid, ∀ tid. durqs.lsf(tid).tid = tid ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DurQ[DurQ-ren], name:elim-mkstate, seq:⊦ (gstate = s.gstate ∧ lsf = s.lsf) ∧ pcf = s.pcf ↔ s = mkstate(gstate, lsf, pcf), subst:[s, gstate, lsf, pcf] → [durqs, ags, alsf, apcf]

Additional information

Used simplifier rules: ⊦ (gstate = s.gstate ∧ lsf = s.lsf) ∧ pcf = s.pcf ↔ s = mkstate(gstate, lsf, pcf); (elim) Used terms: durqs, gstate, alsf, apcf

Proof step 68 from proof bwsim (previous step) (back to tree)

dqs.gstate.queue = [], durqs = mkstate(ags, alsf, apcf), ags.queue ≠ [], bwabs(dqs, durqs), ∀ tid. alsf(tid).tid = tid, ∀ tid. dqs.pcf(tid) = idle ∧ dqs.lsf(tid).tid = tid ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 69 from proof bwsim (previous step) (back to tree)

dqs.gstate.queue = [], ags.queue ≠ [], bwabs(dqs, mkstate(ags, alsf, apcf)), ∀ tid. dqs.pcf(tid) = idle ∧ dqs.lsf(tid).tid = tid, ∀ tid. alsf(tid).tid = tid ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DurQ[DurQ-ren], name:elim-mkgs, seq: ⊦ queue = gs.queue ↔ gs = mkdgs(queue), subst:[gs, queue] → [ags, queue]

Additional information

Used simplifier rules: ⊦ queue = gs.queue ↔ gs = mkdgs(queue); (elim) Used terms: ags, queue

Proof step 70 from proof bwsim (previous step) (back to tree)

dqs.gstate.queue = [], ags = mkdgs(queue), queue ≠ [], bwabs(dqs, mkstate(ags, alsf, apcf)), ∀ tid. alsf(tid).tid = tid, ∀ tid. dqs.pcf(tid) = idle ∧ dqs.lsf(tid).tid = tid ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 71 from proof bwsim (previous step) (back to tree)

dqs.gstate.queue = [], queue ≠ [], bwabs(dqs, mkstate(mkdgs(queue), alsf, apcf)), ∀ tid. dqs.pcf(tid) = idle ∧ dqs.lsf(tid).tid = tid, ∀ tid. alsf(tid).tid = tid ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DQ, name:elim-mkstate, seq:⊦ (gstate = s.gstate ∧ lsf = s.lsf) ∧ pcf = s.pcf ↔ s = mkstate(gstate, lsf, pcf), subst:[s, gstate, lsf, pcf] → [dqs, gs, lsf, pcf]

Additional information

Used simplifier rules: ⊦ (gstate = s.gstate ∧ lsf = s.lsf) ∧ pcf = s.pcf ↔ s = mkstate(gstate, lsf, pcf); (elim) Used terms: dqs, gstate, lsf, pcf

Proof step 72 from proof bwsim (previous step) (back to tree)

gs.queue = [], dqs = mkstate(gs, lsf, pcf), queue ≠ [], bwabs(dqs, mkstate(mkdgs(queue), alsf, apcf)), ∀ tid. alsf(tid).tid = tid, ∀ tid. pcf(tid) = idle ∧ lsf(tid).tid = tid ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 73 from proof bwsim (previous step) (back to tree)

gs.queue = [], queue ≠ [], bwabs(mkstate(gs, lsf, pcf), mkstate(mkdgs(queue), alsf, apcf)), ∀ tid. pcf(tid) = idle ∧ lsf(tid).tid = tid, ∀ tid. alsf(tid).tid = tid ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DQ, name:elim-mkgs, seq: ⊦ queue = gs.queue ↔ gs = mkgs(queue), subst:[gs, queue] → [gs, queue0]

Additional information

Used simplifier rules: ⊦ queue = gs.queue ↔ gs = mkgs(queue); (elim) Used terms: gs, queue0

Proof step 74 from proof bwsim (previous step) (back to tree)

gs = mkgs(queue0), queue0 = [], queue ≠ [], bwabs(mkstate(gs, lsf, pcf), mkstate(mkdgs(queue), alsf, apcf)), ∀ tid. alsf(tid).tid = tid, ∀ tid. pcf(tid) = idle ∧ lsf(tid).tid = tid ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 75 from proof bwsim (previous step) (back to tree)

queue ≠ [], bwabs(mkstate(mkgs([]), lsf, pcf), mkstate(mkdgs(queue), alsf, apcf)), ∀ tid. pcf(tid) = idle ∧ lsf(tid).tid = tid, ∀ tid. alsf(tid).tid = tid ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: bwabs, name:bwabs-def, seq:⊦ bwabs(mkstate(gs, lsf, pcf), mkstate(ags, alsf, apcf)) ↔ ags = mkdgs(gs.queue) ∧ (∀ tid. alsf(tid) = mkls (lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ apcf(tid) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls (lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty), subst:[gs, alsf, lsf, ags, pcf, apcf] → [mkgs([]), alsf, lsf, mkdgs(queue), pcf, apcf], <all paths>

Additional information

Used simplifier rules: ⊦ mkgs(queue).queue = queue; (s) ⊦ mkdgs(queue) = mkdgs(queue0) ↔ queue = queue0; (s) Used terms: mkgs([]), alsf, lsf, mkdgs(queue), pcf, apcf

Proof step 76 from proof bwsim (previous step) (back to tree)

⊦ bwabs(mkstate(gs, lsf, pcf), mkstate(ags, alsf, apcf)) ↔ ags = mkdgs(gs.queue) ∧ (∀ tid. alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ apcf(tid) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty)

A spec-lemma

Proof step 77 from proof bwsim (previous step) (back to tree)

dqs.gstate.queue = [], bwabs(dqs, durqs), ∀ tid. dqs.pcf(tid) = idle ∧ dqs.lsf(tid).tid = tid, ∀ tid. durqs.lsf(tid).tid = tid, ∃ tid. ¬(durqs.pcf(tid) = idle ∧ durqs.lsf(tid).tid = tid) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 78 from proof bwsim (previous step) (back to tree)

dqs.gstate.queue = [], bwabs(dqs, durqs), ∀ tid. durqs.lsf(tid).tid = tid, ∀ tid. dqs.pcf(tid) = idle ∧ dqs.lsf(tid).tid = tid ⊦ durqs.pcf(tid) = idle ∧ durqs.lsf(tid).tid = tid

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DurQ[DurQ-ren], name:elim-mkstate, seq:⊦ (gstate = s.gstate ∧ lsf = s.lsf) ∧ pcf = s.pcf ↔ s = mkstate(gstate, lsf, pcf), subst:[s, gstate, lsf, pcf] → [durqs, ags, alsf, apcf]

Additional information

Used simplifier rules: ⊦ (gstate = s.gstate ∧ lsf = s.lsf) ∧ pcf = s.pcf ↔ s = mkstate(gstate, lsf, pcf); (elim) Used terms: durqs, gstate, alsf, apcf

Proof step 79 from proof bwsim (previous step) (back to tree)

dqs.gstate.queue = [], durqs = mkstate(ags, alsf, apcf), bwabs(dqs, durqs), ∀ tid. dqs.pcf(tid) = idle ∧ dqs.lsf(tid).tid = tid, ∀ tid. alsf(tid).tid = tid ⊦ apcf(tid) = idle ∧ alsf(tid).tid = tid

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 80 from proof bwsim (previous step) (back to tree)

dqs.gstate.queue = [], bwabs(dqs, mkstate(ags, alsf, apcf)), ∀ tid. alsf(tid).tid = tid, ∀ tid. dqs.pcf(tid) = idle ∧ dqs.lsf(tid).tid = tid ⊦ apcf(tid) = idle ∧ alsf(tid).tid = tid

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DQ, name:elim-mkstate, seq:⊦ (gstate = s.gstate ∧ lsf = s.lsf) ∧ pcf = s.pcf ↔ s = mkstate(gstate, lsf, pcf), subst:[s, gstate, lsf, pcf] → [dqs, gs, lsf, pcf]

Additional information

Used simplifier rules: ⊦ (gstate = s.gstate ∧ lsf = s.lsf) ∧ pcf = s.pcf ↔ s = mkstate(gstate, lsf, pcf); (elim) Used terms: dqs, gstate, lsf, pcf

Proof step 81 from proof bwsim (previous step) (back to tree)

gs.queue = [], dqs = mkstate(gs, lsf, pcf), bwabs(dqs, mkstate(ags, alsf, apcf)), ∀ tid. pcf(tid) = idle ∧ lsf(tid).tid = tid, ∀ tid. alsf(tid).tid = tid ⊦ apcf(tid) = idle ∧ alsf(tid).tid = tid

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 82 from proof bwsim (previous step) (back to tree)

gs.queue = [], bwabs(mkstate(gs, lsf, pcf), mkstate(ags, alsf, apcf)), ∀ tid. alsf(tid).tid = tid, ∀ tid. pcf(tid) = idle ∧ lsf(tid).tid = tid ⊦ apcf(tid) = idle ∧ alsf(tid).tid = tid

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DQ, name:elim-mkgs, seq: ⊦ queue = gs.queue ↔ gs = mkgs(queue), subst:[gs, queue] → [gs, queue]

Additional information

Used simplifier rules: ⊦ queue = gs.queue ↔ gs = mkgs(queue); (elim) Used terms: gs, queue

Proof step 83 from proof bwsim (previous step) (back to tree)

gs = mkgs(queue), queue = [], bwabs(mkstate(gs, lsf, pcf), mkstate(ags, alsf, apcf)), ∀ tid. pcf(tid) = idle ∧ lsf(tid).tid = tid, ∀ tid. alsf(tid).tid = tid ⊦ apcf(tid) = idle ∧ alsf(tid).tid = tid

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 84 from proof bwsim (previous step) (back to tree)

bwabs(mkstate(mkgs([]), lsf, pcf), mkstate(ags, alsf, apcf)), ∀ tid. alsf(tid).tid = tid, ∀ tid. pcf(tid) = idle ∧ lsf(tid).tid = tid ⊦ apcf(tid) = idle ∧ alsf(tid).tid = tid

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DurQ[DurQ-ren], name:elim-mkls, seq:⊦ (((tid = ls.tid ∧ ival = ls.ival) ∧ oval = ls.oval) ∧ value = ls.value) ∧ optval = ls.optval ↔ ls = mkls(tid, ival, oval, value, optval), subst:[value, ival, oval, tid, optval, ls] → [val0, val, optval, tid0, optval0, alsf(tid)]

Additional information

Used simplifier rules: ⊦ (((tid = ls.tid ∧ ival = ls.ival) ∧ oval = ls.oval) ∧ value = ls.value) ∧ optval = ls.optval ↔ ls = mkls(tid, ival, oval, value, optval); (elim) Used terms: value, ival, oval, tid0, optval, alsf(tid)

Proof step 85 from proof bwsim (previous step) (back to tree)

alsf(tid) = mkls(tid0, val, optval, val0, optval0), bwabs(mkstate(mkgs([]), lsf, pcf), mkstate(ags, alsf, apcf)), ∀ tid. pcf(tid) = idle ∧ lsf(tid).tid = tid, ∀ tid. alsf(tid).tid = tid ⊦ apcf(tid) = idle ∧ tid0 = tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: bwabs, name:bwabs-def, seq:⊦ bwabs(mkstate(gs, lsf, pcf), mkstate(ags, alsf, apcf)) ↔ ags = mkdgs(gs.queue) ∧ (∀ tid. alsf(tid) = mkls (lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ apcf(tid) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls (lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty), subst:[gs, alsf, lsf, ags, pcf, apcf] → [mkgs([]), alsf, lsf, ags, pcf, apcf], <all paths>

Additional information

Used terms: mkgs([]), alsf, lsf, ags, pcf, apcf

Proof step 86 from proof bwsim (previous step) (back to tree)

⊦ bwabs(mkstate(gs, lsf, pcf), mkstate(ags, alsf, apcf)) ↔ ags = mkdgs(gs.queue) ∧ (∀ tid. alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ apcf(tid) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty)

A spec-lemma

Proof step 87 from proof bwsim (previous step) (back to tree)

ags = mkdgs(mkgs([]).queue), alsf(tid) = mkls(tid0, val, optval, val0, optval0), ∀ tid. alsf(tid).tid = tid, ∀ tid. pcf(tid) = idle ∧ lsf(tid).tid = tid, ∀ tid. alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ apcf(tid) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty ⊦ apcf(tid) = idle ∧ tid0 = tid

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 88 from proof bwsim (previous step) (back to tree)

alsf(tid) = mkls(tid0, val, optval, val0, optval0), ∀ tid. alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ apcf(tid) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty, ∀ tid. pcf(tid) = idle ∧ lsf(tid).tid = tid, ∀ tid. alsf(tid).tid = tid ⊦ apcf(tid) = idle ∧ tid0 = tid

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 2 terms: tid abort: F discard: T computed: T

Additional information

Used terms: tid

Proof step 89 from proof bwsim (previous step) (back to tree)

alsf(tid) = mkls(tid0, val, optval, val0, optval0), ∀ tid. alsf(tid).tid = tid, ∀ tid. pcf(tid) = idle ∧ lsf(tid).tid = tid, alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ apcf(tid) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty ⊦ apcf(tid) = idle ∧ tid0 = tid

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 90 from proof bwsim (previous step) (back to tree)

alsf(tid) = mkls(tid0, val, optval, val0, optval0), ∀ tid. pcf(tid) = idle ∧ lsf(tid).tid = tid, ∀ tid. alsf(tid).tid = tid, mkls(tid0, val, optval, val0, optval0) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ apcf(tid) = bwabspcf(pcf(tid)) ∨ mkls(tid0, val, optval, val0, optval0) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty ⊦ apcf(tid) = idle ∧ tid0 = tid

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DQ, name:elim-mkls, seq:⊦ ( ( ((tid = ls.tid ∧ (obsEmpty ↔ ls.obsEmpty)) ∧ ival = ls.ival) ∧ oval = ls.oval) ∧ value = ls.value) ∧ optval = ls.optval ↔ ls = mkls(tid, obsEmpty, ival, oval, value, optval), subst:[value, ival, obsEmpty, ls, oval, tid, optval] → [val2, val1, obsEmpty, lsf(tid), optval1, tid1, optval2]

Additional information

Used simplifier rules: ⊦ ( ( ((tid = ls.tid ∧ (obsEmpty ↔ ls.obsEmpty)) ∧ ival = ls.ival) ∧ oval = ls.oval) ∧ value = ls.value) ∧ optval = ls.optval ↔ ls = mkls(tid, obsEmpty, ival, oval, value, optval); (elim) Used terms: value, ival, obsEmpty, lsf(tid), oval, tid1, optval1

Proof step 91 from proof bwsim (previous step) (back to tree)

alsf(tid) = mkls(tid0, val, optval, val0, optval0), lsf(tid) = mkls(tid1, obsEmpty, val1, optval1, val2, optval2), ∀ tid. alsf(tid).tid = tid, ∀ tid. pcf(tid) = idle ∧ lsf(tid).tid = tid, mkls(tid0, val, optval, val0, optval0) = mkls(tid1, val1, optval1, val2, optval2) ∧ apcf(tid) = bwabspcf(pcf(tid)) ∨ mkls(tid0, val, optval, val0, optval0) = mkls(tid1, val1, Empty, val2, optval2) ∧ pcf(tid) = invDeq ∧ apcf(tid) = resDeq ∧ obsEmpty ⊦ apcf(tid) = idle ∧ tid0 = tid

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 3 terms: tid abort: F discard: F computed: T

Additional information

Used terms: tid

Proof step 92 from proof bwsim (previous step) (back to tree)

alsf(tid).tid = tid, alsf(tid) = mkls(tid0, val, optval, val0, optval0), lsf(tid) = mkls(tid1, obsEmpty, val1, optval1, val2, optval2), ∀ tid. pcf(tid) = idle ∧ lsf(tid).tid = tid, ∀ tid. alsf(tid).tid = tid, mkls(tid0, val, optval, val0, optval0) = mkls(tid1, val1, optval1, val2, optval2) ∧ apcf(tid) = bwabspcf(pcf(tid)) ∨ mkls(tid0, val, optval, val0, optval0) = mkls(tid1, val1, Empty, val2, optval2) ∧ pcf(tid) = invDeq ∧ apcf(tid) = resDeq ∧ obsEmpty ⊦ apcf(tid) = idle ∧ tid0 = tid

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ mkls(tid, ival, oval, ival0, oval0).tid = tid; (s)

Proof step 93 from proof bwsim (previous step) (back to tree)

alsf(tid0) = mkls(tid0, val, optval, val0, optval0), lsf(tid0) = mkls(tid1, obsEmpty, val1, optval1, val2, optval2), apcf(tid0) ≠ idle, ∀ tid. pcf(tid) = idle ∧ lsf(tid).tid = tid, ∀ tid. alsf(tid).tid = tid, mkls(tid0, val, optval, val0, optval0) = mkls(tid1, val1, optval1, val2, optval2) ∧ apcf(tid0) = bwabspcf(pcf(tid0)) ∨ mkls(tid0, val, optval, val0, optval0) = mkls(tid1, val1, Empty, val2, optval2) ∧ pcf(tid0) = invDeq ∧ apcf(tid0) = resDeq ∧ obsEmpty ⊦

User applied rule all left

And closed the goal!

Rule argument

pos: left 4 terms: tid0 abort: F discard: F computed: F

Additional information

Used simplifier rules: ⊦ bwabspcf(idle) = idle; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).tid = tid; (s) ⊦ idle ≠ invDeq; (s) Used terms: tid0

Proof step 94 from proof bwsim (previous step) (back to tree)

⊦ ∀ cs, aa, cs0, as0. DQINV(cs) ∧ DQstep(cs, aa, cs0) ∧ bwabs(cs0, as0) ∧ (∀ tid. as0.lsf(tid).tid = tid) → (∃ as. (∀ tid. as.lsf(tid).tid = tid) ∧ amove(AIOAut(DurQinit, DurQstep))(as, ⌜aa '⌝ ^, as0) ∧ bwabs(cs, as))

User applied rule all right

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 95 from proof bwsim (previous step) (back to tree)

DQINV(dqs), DQstep(dqs, aa, dqs0), bwabs(dqs0, durqs), ∀ tid. durqs.lsf(tid).tid = tid ⊦ ∃ as. (∀ tid. as.lsf(tid).tid = tid) ∧ amove(AIOAut(DurQinit, DurQstep))(as, ⌜aa '⌝ ^, durqs) ∧ bwabs(dqs, as)

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: dqs

Additional information

Used simplifier rules: DQState freely generated by mkstate;;

Proof step 96 from proof bwsim (previous step) (back to tree)

dqs = mkstate(gs, lsf, pcf), DQINV(dqs), DQstep(dqs, aa, dqs0), bwabs(dqs0, durqs), ∀ tid. durqs.lsf(tid).tid = tid ⊦ ∃ as. (∀ tid. as.lsf(tid).tid = tid) ∧ amove(AIOAut(DurQinit, DurQstep))(as, ⌜aa '⌝ ^, durqs) ∧ bwabs(dqs, as)

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 1, flags: discard

Additional information

Proof step 97 from proof bwsim (previous step) (back to tree)

DQINV(mkstate(gs, lsf, pcf)), DQstep(mkstate(gs, lsf, pcf), aa, dqs0), bwabs(dqs0, durqs), ∀ tid. durqs.lsf(tid).tid = tid ⊦ ∃ as. (∀ tid. as.lsf(tid).tid = tid) ∧ amove(AIOAut(DurQinit, DurQstep))(as, ⌜aa '⌝ ^, durqs) ∧ bwabs(mkstate(gs, lsf, pcf), as)

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: dqs0

Additional information

Used simplifier rules: DQState freely generated by mkstate;;

Proof step 98 from proof bwsim (previous step) (back to tree)

dqs0 = mkstate(gs0, lsf0, pcf0), DQINV(mkstate(gs, lsf, pcf)), DQstep(mkstate(gs, lsf, pcf), aa, dqs0), bwabs(dqs0, durqs), ∀ tid. durqs.lsf(tid).tid = tid ⊦ ∃ as. (∀ tid. as.lsf(tid).tid = tid) ∧ amove(AIOAut(DurQinit, DurQstep))(as, ⌜aa '⌝ ^, durqs) ∧ bwabs(mkstate(gs, lsf, pcf), as)

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 1, flags: discard

Additional information

Proof step 99 from proof bwsim (previous step) (back to tree)

DQINV(mkstate(gs, lsf, pcf)), DQstep(mkstate(gs, lsf, pcf), aa, mkstate(gs0, lsf0, pcf0)), bwabs(mkstate(gs0, lsf0, pcf0), durqs), ∀ tid. durqs.lsf(tid).tid = tid ⊦ ∃ as. (∀ tid. as.lsf(tid).tid = tid) ∧ amove(AIOAut(DurQinit, DurQstep))(as, ⌜aa '⌝ ^, durqs) ∧ bwabs(mkstate(gs, lsf, pcf), as)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: DQINV-def: ⊦ DQINV(dqs) ↔ DQInv(dqs.gstate, dqs.lsf, dqs.pcf) ∧ fininvdeq(dqs.pcf); ⊦ mkstate(gstate, lsf, pcf).pcf = pcf; (s) ⊦ mkstate(gstate, lsf, pcf).lsf = lsf; (s) ⊦ mkstate(gstate, lsf, pcf).gstate = gstate; (s)

Proof step 100 from proof bwsim (previous step) (back to tree)

DQInv(gs, lsf, pcf), DQstep(mkstate(gs, lsf, pcf), aa, mkstate(gs0, lsf0, pcf0)), bwabs(mkstate(gs0, lsf0, pcf0), durqs), fininvdeq(pcf), ∀ tid. durqs.lsf(tid).tid = tid ⊦ ∃ as. (∀ tid. as.lsf(tid).tid = tid) ∧ amove(AIOAut(DurQinit, DurQstep))(as, ⌜aa '⌝ ^, durqs) ∧ bwabs(mkstate(gs, lsf, pcf), as)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:DQstep, seq: ⊦ DQstep(dqs, aa, dqs0) ↔ (∃ ca. DQstep(dqs, ca, dqs0) ∧ aa = aabs(ca)), subst:[dqs, aa, dqs0] → [mkstate(gs, lsf, pcf), aa, mkstate(gs0, lsf0, pcf0)], <all paths>

Additional information

Used terms: mkstate(gs, lsf, pcf), aa, mkstate(gs0, lsf0, pcf0)

Proof step 101 from proof bwsim (previous step) (back to tree)

⊦ DQstep(dqs, aa, dqs0) ↔ (∃ ca. DQstep(dqs, ca, dqs0) ∧ aa = aabs(ca))

Lemma DQstep

Proof step 102 from proof bwsim (previous step) (back to tree)

DQInv(gs, lsf, pcf), bwabs(mkstate(gs0, lsf0, pcf0), durqs), fininvdeq(pcf), ∀ tid. durqs.lsf(tid).tid = tid, ∃ ca. DQstep(mkstate(gs, lsf, pcf), ca, mkstate(gs0, lsf0, pcf0)) ∧ aa = aabs(ca) ⊦ ∃ as. (∀ tid. as.lsf(tid).tid = tid) ∧ amove(AIOAut(DurQinit, DurQstep))(as, ⌜aa '⌝ ^, durqs) ∧ bwabs(mkstate(gs, lsf, pcf), as)

User applied rule exists left

And obtained the following new goals

Rule argument

pos: left 5

Additional information

Proof step 103 from proof bwsim (previous step) (back to tree)

aa = aabs(ca), DQInv(gs, lsf, pcf), DQstep(mkstate(gs, lsf, pcf), ca, mkstate(gs0, lsf0, pcf0)), bwabs(mkstate(gs0, lsf0, pcf0), durqs), fininvdeq(pcf), ∀ tid. durqs.lsf(tid).tid = tid ⊦ ∃ as. (∀ tid. as.lsf(tid).tid = tid) ∧ amove(AIOAut(DurQinit, DurQstep))(as, ⌜aa '⌝ ^, durqs) ∧ bwabs(mkstate(gs, lsf, pcf), as)

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:bwsim-step, seq:⊦ bwabs(mkstate(gs0, lsf0, pcf0), durqs0) ∧ DQstep(mkstate(gs, lsf, pcf), ca, mkstate(gs0, lsf0, pcf0)) ∧ DQInv(gs, lsf, pcf) ∧ fininvdeq(pcf) ∧ a = absa(ca, durqs0.pcf) → (∃ durqs. (a = τ ⊃ durqs = durqs0;DurQstep(durqs, a, durqs0)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)), subst:[gs, lsf0, gs0, durqs0, lsf, pcf0, ca, a, pcf] → [gs, lsf0, gs0, durqs, lsf, pcf0, ca, absa(ca, durqs.pcf), pcf]

Additional information

Used terms: gs, lsf0, gs0, durqs, lsf, pcf0, ca, absa(ca, durqs.pcf), pcf

Proof step 104 from proof bwsim (previous step) (back to tree)

⊦ bwabs(mkstate(gs0, lsf0, pcf0), durqs0) ∧ DQstep(mkstate(gs, lsf, pcf), ca, mkstate(gs0, lsf0, pcf0)) ∧ DQInv(gs, lsf, pcf) ∧ fininvdeq(pcf) ∧ a = absa(ca, durqs0.pcf) → (∃ durqs. (a = τ ⊃ durqs = durqs0;DurQstep(durqs, a, durqs0)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs))

Lemma bwsim-step

Proof step 105 from proof bwsim (previous step) (back to tree)

aa = aabs(ca), DQInv(gs, lsf, pcf), DQstep(mkstate(gs, lsf, pcf), ca, mkstate(gs0, lsf0, pcf0)), bwabs(mkstate(gs0, lsf0, pcf0), durqs), fininvdeq(pcf), bwabs(mkstate(gs0, lsf0, pcf0), durqs) ∧ DQstep(mkstate(gs, lsf, pcf), ca, mkstate(gs0, lsf0, pcf0)) ∧ DQInv(gs, lsf, pcf) ∧ fininvdeq(pcf) ∧ absa(ca, durqs.pcf) = absa(ca, durqs.pcf) → (∃ durqs1. (absa(ca, durqs.pcf) = τ ⊃ durqs1 = durqs;DurQstep(durqs1, absa(ca, durqs.pcf), durqs)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs1)), ∀ tid. durqs.lsf(tid).tid = tid ⊦ ∃ as. (∀ tid. as.lsf(tid).tid = tid) ∧ amove(AIOAut(DurQinit, DurQstep))(as, ⌜aa '⌝ ^, durqs) ∧ bwabs(mkstate(gs, lsf, pcf), as)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 6

Additional information

Proof step 106 from proof bwsim (previous step) (back to tree)

aa = aabs(ca), DQInv(gs, lsf, pcf), DQstep(mkstate(gs, lsf, pcf), ca, mkstate(gs0, lsf0, pcf0)), bwabs(mkstate(gs0, lsf0, pcf0), durqs), fininvdeq(pcf), ∀ tid. durqs.lsf(tid).tid = tid ⊦ ∃ as. (∀ tid. as.lsf(tid).tid = tid) ∧ amove(AIOAut(DurQinit, DurQstep))(as, ⌜aa '⌝ ^, durqs) ∧ bwabs(mkstate(gs, lsf, pcf), as), bwabs(mkstate(gs0, lsf0, pcf0), durqs) ∧ DQstep(mkstate(gs, lsf, pcf), ca, mkstate(gs0, lsf0, pcf0)) ∧ DQInv(gs, lsf, pcf) ∧ fininvdeq(pcf) ∧ absa(ca, durqs.pcf) = absa(ca, durqs.pcf)

User applied rule case distinction

And closed the goal!

Rule argument

pos: right 2

Additional information

Proof step 107 from proof bwsim (previous step) (back to tree)

aa = aabs(ca), DQInv(gs, lsf, pcf), DQstep(mkstate(gs, lsf, pcf), ca, mkstate(gs0, lsf0, pcf0)), bwabs(mkstate(gs0, lsf0, pcf0), durqs), fininvdeq(pcf), ∀ tid. durqs.lsf(tid).tid = tid, ∃ durqs1. (absa(ca, durqs.pcf) = τ ⊃ durqs1 = durqs;DurQstep(durqs1, absa(ca, durqs.pcf), durqs)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs1) ⊦ ∃ as. (∀ tid. as.lsf(tid).tid = tid) ∧ amove(AIOAut(DurQinit, DurQstep))(as, ⌜aa '⌝ ^, durqs) ∧ bwabs(mkstate(gs, lsf, pcf), as)

User applied rule exists left

And obtained the following new goals

Rule argument

pos: left 7

Additional information

Proof step 108 from proof bwsim (previous step) (back to tree)

aa = aabs(ca), DQInv(gs, lsf, pcf), DQstep(mkstate(gs, lsf, pcf), ca, mkstate(gs0, lsf0, pcf0)), bwabs(mkstate(gs0, lsf0, pcf0), durqs), bwabs(mkstate(gs, lsf, pcf), durqs1), fininvdeq(pcf), (absa(ca, durqs.pcf) = τ ⊃ durqs1 = durqs;DurQstep(durqs1, absa(ca, durqs.pcf), durqs)), ∀ tid. durqs.lsf(tid).tid = tid ⊦ ∃ as. (∀ tid. as.lsf(tid).tid = tid) ∧ amove(AIOAut(DurQinit, DurQstep))(as, ⌜aa '⌝ ^, durqs) ∧ bwabs(mkstate(gs, lsf, pcf), as)

User applied rule exists right

And obtained the following new goals

Rule argument

pos: right 1 terms: durqs1 abort: F discard: T computed: F

Additional information

Used terms: durqs1

Proof step 109 from proof bwsim (previous step) (back to tree)

aa = aabs(ca), DQInv(gs, lsf, pcf), DQstep(mkstate(gs, lsf, pcf), ca, mkstate(gs0, lsf0, pcf0)), bwabs(mkstate(gs, lsf, pcf), durqs1), bwabs(mkstate(gs0, lsf0, pcf0), durqs), fininvdeq(pcf), (absa(ca, durqs.pcf) = τ ⊃ durqs1 = durqs;DurQstep(durqs1, absa(ca, durqs.pcf), durqs)), ∀ tid. durqs.lsf(tid).tid = tid ⊦ (∀ tid. durqs1.lsf(tid).tid = tid) ∧ amove(AIOAut(DurQinit, DurQstep))(durqs1, ⌜aa '⌝ ^, durqs) ∧ bwabs(mkstate(gs, lsf, pcf), durqs1)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 110 from proof bwsim (previous step) (back to tree)

aa = aabs(ca), DQInv(gs, lsf, pcf), DQstep(mkstate(gs, lsf, pcf), ca, mkstate(gs0, lsf0, pcf0)), bwabs(mkstate(gs0, lsf0, pcf0), durqs), bwabs(mkstate(gs, lsf, pcf), durqs1), fininvdeq(pcf), (absa(ca, durqs.pcf) = τ ⊃ durqs1 = durqs;DurQstep(durqs1, absa(ca, durqs.pcf), durqs)), ∀ tid. durqs.lsf(tid).tid = tid ⊦ ∀ tid. durqs1.lsf(tid).tid = tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 7

Additional information

Proof step 111 from proof bwsim (previous step) (back to tree)

aa = aabs(ca), absa(ca, durqs.pcf) = τ, durqs1 = durqs, DQInv(gs, lsf, pcf), DQstep(mkstate(gs, lsf, pcf), ca, mkstate(gs0, lsf0, pcf0)), bwabs(mkstate(gs, lsf, pcf), durqs1), bwabs(mkstate(gs0, lsf0, pcf0), durqs), fininvdeq(pcf), ∀ tid. durqs.lsf(tid).tid = tid ⊦ ∀ tid. durqs1.lsf(tid).tid = tid

User applied rule all right

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 112 from proof bwsim (previous step) (back to tree)

aa = aabs(ca), absa(ca, durqs.pcf) = τ, durqs1 = durqs, durqs1.lsf(tid).tid ≠ tid, DQInv(gs, lsf, pcf), DQstep(mkstate(gs, lsf, pcf), ca, mkstate(gs0, lsf0, pcf0)), bwabs(mkstate(gs0, lsf0, pcf0), durqs), bwabs(mkstate(gs, lsf, pcf), durqs1), fininvdeq(pcf), ∀ tid. durqs.lsf(tid).tid = tid ⊦

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 3, flags: discard

Additional information

Proof step 113 from proof bwsim (previous step) (back to tree)

aa = aabs(ca), absa(ca, durqs.pcf) = τ, durqs.lsf(tid).tid ≠ tid, DQInv(gs, lsf, pcf), DQstep(mkstate(gs, lsf, pcf), ca, mkstate(gs0, lsf0, pcf0)), bwabs(mkstate(gs, lsf, pcf), durqs), bwabs(mkstate(gs0, lsf0, pcf0), durqs), fininvdeq(pcf), ∀ tid. durqs.lsf(tid).tid = tid ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DQ, name:DQInv, seq:⊦ DQInv(gs, lsf, pcf) ↔ DQGInv(gs) ∧ (∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid))), subst:[gs, lsf, pcf] → [gs, lsf, pcf], <all paths>

Additional information

Used terms: gs, lsf, pcf

Proof step 114 from proof bwsim (previous step) (back to tree)

⊦ DQInv(gs, lsf, pcf) ↔ DQGInv(gs) ∧ (∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)))

A spec-lemma

Proof step 115 from proof bwsim (previous step) (back to tree)

aa = aabs(ca), absa(ca, durqs.pcf) = τ, durqs.lsf(tid).tid ≠ tid, DQGInv(gs), DQstep(mkstate(gs, lsf, pcf), ca, mkstate(gs0, lsf0, pcf0)), bwabs(mkstate(gs0, lsf0, pcf0), durqs), bwabs(mkstate(gs, lsf, pcf), durqs), fininvdeq(pcf), ∀ tid. durqs.lsf(tid).tid = tid, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 10 terms: tid abort: F discard: T computed: T

Additional information

Used terms: tid

Proof step 116 from proof bwsim (previous step) (back to tree)

lsf(tid).tid = tid, aa = aabs(ca), absa(ca, durqs.pcf) = τ, durqs.lsf(tid).tid ≠ tid, DQGInv(gs), DQLInv(gs, lsf(tid), pcf(tid)), DQstep(mkstate(gs, lsf, pcf), ca, mkstate(gs0, lsf0, pcf0)), bwabs(mkstate(gs, lsf, pcf), durqs), bwabs(mkstate(gs0, lsf0, pcf0), durqs), fininvdeq(pcf), ∀ tid. durqs.lsf(tid).tid = tid ⊦

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: durqs

Additional information

Used simplifier rules: DurQState freely generated by mkstate;;

Proof step 117 from proof bwsim (previous step) (back to tree)

lsf(tid).tid = tid, aa = aabs(ca), absa(ca, durqs.pcf) = τ, durqs = mkstate(ags, alsf, apcf), durqs.lsf(tid).tid ≠ tid, DQGInv(gs), DQLInv(gs, lsf(tid), pcf(tid)), DQstep(mkstate(gs, lsf, pcf), ca, mkstate(gs0, lsf0, pcf0)), bwabs(mkstate(gs0, lsf0, pcf0), durqs), bwabs(mkstate(gs, lsf, pcf), durqs), fininvdeq(pcf), ∀ tid. durqs.lsf(tid).tid = tid ⊦

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 4, flags: discard

Additional information

Proof step 118 from proof bwsim (previous step) (back to tree)

lsf(tid).tid = tid, aa = aabs(ca), absa(ca, mkstate(ags, alsf, apcf).pcf) = τ, mkstate(ags, alsf, apcf).lsf(tid).tid ≠ tid, DQGInv(gs), DQLInv(gs, lsf(tid), pcf(tid)), DQstep(mkstate(gs, lsf, pcf), ca, mkstate(gs0, lsf0, pcf0)), bwabs(mkstate(gs, lsf, pcf), mkstate(ags, alsf, apcf)), bwabs(mkstate(gs0, lsf0, pcf0), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. mkstate(ags, alsf, apcf).lsf(tid).tid = tid ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DurQ[DurQ-ren], name:sel-mkstate-dotlsf, seq: ⊦ mkstate(gstate, lsf, pcf).lsf = lsf, subst:[gstate, lsf, pcf] → [ags, alsf, apcf], <all paths>

Additional information

Used terms: ags, alsf, apcf

Proof step 119 from proof bwsim (previous step) (back to tree)

⊦ mkstate(gstate, lsf, pcf).lsf = lsf

A spec-lemma

Proof step 120 from proof bwsim (previous step) (back to tree)

lsf(tid).tid = tid, aa = aabs(ca), absa(ca, mkstate(ags, alsf, apcf).pcf) = τ, alsf(tid).tid ≠ tid, DQGInv(gs), DQLInv(gs, lsf(tid), pcf(tid)), DQstep(mkstate(gs, lsf, pcf), ca, mkstate(gs0, lsf0, pcf0)), bwabs(mkstate(gs0, lsf0, pcf0), mkstate(ags, alsf, apcf)), bwabs(mkstate(gs, lsf, pcf), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. alsf(tid).tid = tid ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: bwabs, name:bwabs-def, seq:⊦ bwabs(mkstate(gs, lsf, pcf), mkstate(ags, alsf, apcf)) ↔ ags = mkdgs(gs.queue) ∧ (∀ tid. alsf(tid) = mkls (lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ apcf(tid) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls (lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty), subst:[gs, alsf, lsf, ags, pcf, apcf] → [gs, alsf, lsf, ags, pcf, apcf], <all paths>

Additional information

Used terms: gs, alsf, lsf, ags, pcf, apcf

Proof step 121 from proof bwsim (previous step) (back to tree)

⊦ bwabs(mkstate(gs, lsf, pcf), mkstate(ags, alsf, apcf)) ↔ ags = mkdgs(gs.queue) ∧ (∀ tid. alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ apcf(tid) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty)

A spec-lemma

Proof step 122 from proof bwsim (previous step) (back to tree)

lsf(tid).tid = tid, aa = aabs(ca), absa(ca, mkstate(ags, alsf, apcf).pcf) = τ, ags = mkdgs(gs.queue), alsf(tid).tid ≠ tid, DQGInv(gs), DQLInv(gs, lsf(tid), pcf(tid)), DQstep(mkstate(gs, lsf, pcf), ca, mkstate(gs0, lsf0, pcf0)), bwabs(mkstate(gs0, lsf0, pcf0), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. alsf(tid).tid = tid, ∀ tid. alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ apcf(tid) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 12 terms: tid abort: F discard: T computed: F

Additional information

Used terms: tid

Proof step 123 from proof bwsim (previous step) (back to tree)

lsf(tid).tid = tid, aa = aabs(ca), absa(ca, mkstate(ags, alsf, apcf).pcf) = τ, ags = mkdgs(gs.queue), alsf(tid).tid ≠ tid, DQGInv(gs), DQLInv(gs, lsf(tid), pcf(tid)), DQstep(mkstate(gs, lsf, pcf), ca, mkstate(gs0, lsf0, pcf0)), bwabs(mkstate(gs0, lsf0, pcf0), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. alsf(tid).tid = tid, alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ apcf(tid) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty ⊦

User applied rule case distinction

And closed the goal!

Rule argument

pos: left 12

Additional information

Used simplifier rules: absa-def: ⊦ absa(ca, apcf0) = (∃ tid. ca = CheckEmp(tid) ⊃ (apcf0(ca.tid) = resDeq ⊃ ADoDeq(ca.tid);τ) ;bwabsa(ca) ); absa-def: ⊦ absa(ca, apcf0) = (∃ tid. ca = CheckEmp(tid) ⊃ (apcf0(ca.tid) = resDeq ⊃ ADoDeq(ca.tid);τ) ;bwabsa(ca) ); ⊦ mkstate(gstate, lsf, pcf).pcf = pcf; (s) ⊦ DQstep(mkstate(gs, lsf, pcf), a, dqs0) ↔ (a = globalCrash ⊃ dqs0 = mkstate(gs, lsf, λ tid. (pcf(tid) = idle ⊃ idle;crashed)) ;∃ tid. pre(gs, lsf(tid), pcf(tid), a) ∧ dqs0 = mkstate (gstepf(gs, lsf(tid), pcf(tid), a), lsf(tid; lstepf(gs, lsf(tid), pcf(tid), a)), pcf(tid; pcstepf(gs, lsf(tid), pcf(tid), a))) ); (s) ⊦ mkls(tid, ival, oval, ival0, oval0).tid = tid; (s)

Proof step 124 from proof bwsim (previous step) (back to tree)

aa = aabs(ca), absa(ca, durqs.pcf) ≠ τ, DQInv(gs, lsf, pcf), DQstep(mkstate(gs, lsf, pcf), ca, mkstate(gs0, lsf0, pcf0)), DurQstep(durqs1, absa(ca, durqs.pcf), durqs), bwabs(mkstate(gs, lsf, pcf), durqs1), bwabs(mkstate(gs0, lsf0, pcf0), durqs), fininvdeq(pcf), ∀ tid. durqs.lsf(tid).tid = tid ⊦ ∀ tid. durqs1.lsf(tid).tid = tid

User applied rule all right

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 125 from proof bwsim (previous step) (back to tree)

aa = aabs(ca), durqs1.lsf(tid).tid ≠ tid, absa(ca, durqs.pcf) ≠ τ, DQInv(gs, lsf, pcf), DQstep(mkstate(gs, lsf, pcf), ca, mkstate(gs0, lsf0, pcf0)), DurQstep(durqs1, absa(ca, durqs.pcf), durqs), bwabs(mkstate(gs0, lsf0, pcf0), durqs), bwabs(mkstate(gs, lsf, pcf), durqs1), fininvdeq(pcf), ∀ tid. durqs.lsf(tid).tid = tid ⊦

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: durqs1

Additional information

Used simplifier rules: DurQState freely generated by mkstate;;

Proof step 126 from proof bwsim (previous step) (back to tree)

aa = aabs(ca), durqs1 = mkstate(ags, alsf, apcf), durqs1.lsf(tid).tid ≠ tid, absa(ca, durqs.pcf) ≠ τ, DQInv(gs, lsf, pcf), DQstep(mkstate(gs, lsf, pcf), ca, mkstate(gs0, lsf0, pcf0)), DurQstep(durqs1, absa(ca, durqs.pcf), durqs), bwabs(mkstate(gs, lsf, pcf), durqs1), bwabs(mkstate(gs0, lsf0, pcf0), durqs), fininvdeq(pcf), ∀ tid. durqs.lsf(tid).tid = tid ⊦

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 2, flags: discard

Additional information

Proof step 127 from proof bwsim (previous step) (back to tree)

aa = aabs(ca), mkstate(ags, alsf, apcf).lsf(tid).tid ≠ tid, absa(ca, durqs.pcf) ≠ τ, DQInv(gs, lsf, pcf), DQstep(mkstate(gs, lsf, pcf), ca, mkstate(gs0, lsf0, pcf0)), DurQstep(mkstate(ags, alsf, apcf), absa(ca, durqs.pcf), durqs), bwabs(mkstate(gs0, lsf0, pcf0), durqs), bwabs(mkstate(gs, lsf, pcf), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. durqs.lsf(tid).tid = tid ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DurQ[DurQ-ren], name:sel-mkstate-dotlsf, seq: ⊦ mkstate(gstate, lsf, pcf).lsf = lsf, subst:[gstate, lsf, pcf] → [ags, alsf, apcf], <all paths>

Additional information

Used terms: ags, alsf, apcf

Proof step 128 from proof bwsim (previous step) (back to tree)

⊦ mkstate(gstate, lsf, pcf).lsf = lsf

A spec-lemma

Proof step 129 from proof bwsim (previous step) (back to tree)

aa = aabs(ca), alsf(tid).tid ≠ tid, absa(ca, durqs.pcf) ≠ τ, DQInv(gs, lsf, pcf), DQstep(mkstate(gs, lsf, pcf), ca, mkstate(gs0, lsf0, pcf0)), DurQstep(mkstate(ags, alsf, apcf), absa(ca, durqs.pcf), durqs), bwabs(mkstate(gs, lsf, pcf), mkstate(ags, alsf, apcf)), bwabs(mkstate(gs0, lsf0, pcf0), durqs), fininvdeq(pcf), ∀ tid. durqs.lsf(tid).tid = tid ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: bwabs, name:bwabs-def, seq:⊦ bwabs(mkstate(gs, lsf, pcf), mkstate(ags, alsf, apcf)) ↔ ags = mkdgs(gs.queue) ∧ (∀ tid. alsf(tid) = mkls (lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ apcf(tid) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls (lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty), subst:[gs, alsf, lsf, ags, pcf, apcf] → [gs, alsf, lsf, ags, pcf, apcf], <all paths>

Additional information

Used terms: gs, alsf, lsf, ags, pcf, apcf

Proof step 130 from proof bwsim (previous step) (back to tree)

⊦ bwabs(mkstate(gs, lsf, pcf), mkstate(ags, alsf, apcf)) ↔ ags = mkdgs(gs.queue) ∧ (∀ tid. alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ apcf(tid) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty)

A spec-lemma

Proof step 131 from proof bwsim (previous step) (back to tree)

aa = aabs(ca), ags = mkdgs(gs.queue), alsf(tid).tid ≠ tid, absa(ca, durqs.pcf) ≠ τ, DQInv(gs, lsf, pcf), DQstep(mkstate(gs, lsf, pcf), ca, mkstate(gs0, lsf0, pcf0)), DurQstep(mkstate(ags, alsf, apcf), absa(ca, durqs.pcf), durqs), bwabs(mkstate(gs0, lsf0, pcf0), durqs), fininvdeq(pcf), ∀ tid. durqs.lsf(tid).tid = tid, ∀ tid. alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ apcf(tid) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 11 terms: tid abort: F discard: T computed: F

Additional information

Used terms: tid

Proof step 132 from proof bwsim (previous step) (back to tree)

aa = aabs(ca), ags = mkdgs(gs.queue), alsf(tid).tid ≠ tid, absa(ca, durqs.pcf) ≠ τ, DQInv(gs, lsf, pcf), DQstep(mkstate(gs, lsf, pcf), ca, mkstate(gs0, lsf0, pcf0)), DurQstep(mkstate(ags, alsf, apcf), absa(ca, durqs.pcf), durqs), bwabs(mkstate(gs0, lsf0, pcf0), durqs), fininvdeq(pcf), ∀ tid. durqs.lsf(tid).tid = tid, alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ apcf(tid) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DQ, name:DQInv, seq:⊦ DQInv(gs, lsf, pcf) ↔ DQGInv(gs) ∧ (∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid))), subst:[gs, lsf, pcf] → [gs, lsf, pcf], <all paths>

Additional information

Used terms: gs, lsf, pcf

Proof step 133 from proof bwsim (previous step) (back to tree)

⊦ DQInv(gs, lsf, pcf) ↔ DQGInv(gs) ∧ (∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)))

A spec-lemma

Proof step 134 from proof bwsim (previous step) (back to tree)

aa = aabs(ca), ags = mkdgs(gs.queue), alsf(tid).tid ≠ tid, absa(ca, durqs.pcf) ≠ τ, DQGInv(gs), DQstep(mkstate(gs, lsf, pcf), ca, mkstate(gs0, lsf0, pcf0)), DurQstep(mkstate(ags, alsf, apcf), absa(ca, durqs.pcf), durqs), bwabs(mkstate(gs0, lsf0, pcf0), durqs), fininvdeq(pcf), ∀ tid. durqs.lsf(tid).tid = tid, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)), alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ apcf(tid) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 11 terms: tid abort: F discard: T computed: T

Additional information

Used terms: tid

Proof step 135 from proof bwsim (previous step) (back to tree)

lsf(tid).tid = tid, aa = aabs(ca), ags = mkdgs(gs.queue), alsf(tid).tid ≠ tid, absa(ca, durqs.pcf) ≠ τ, DQGInv(gs), DQLInv(gs, lsf(tid), pcf(tid)), DQstep(mkstate(gs, lsf, pcf), ca, mkstate(gs0, lsf0, pcf0)), DurQstep(mkstate(ags, alsf, apcf), absa(ca, durqs.pcf), durqs), bwabs(mkstate(gs0, lsf0, pcf0), durqs), fininvdeq(pcf), ∀ tid. durqs.lsf(tid).tid = tid, alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ apcf(tid) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty ⊦

User applied rule case distinction

And closed the goal!

Rule argument

pos: left 13

Additional information

Used simplifier rules: absa-def: ⊦ absa(ca, apcf0) = (∃ tid. ca = CheckEmp(tid) ⊃ (apcf0(ca.tid) = resDeq ⊃ ADoDeq(ca.tid);τ) ;bwabsa(ca) ); absa-def: ⊦ absa(ca, apcf0) = (∃ tid. ca = CheckEmp(tid) ⊃ (apcf0(ca.tid) = resDeq ⊃ ADoDeq(ca.tid);τ) ;bwabsa(ca) ); ⊦ DQstep(mkstate(gs, lsf, pcf), a, dqs0) ↔ (a = globalCrash ⊃ dqs0 = mkstate(gs, lsf, λ tid. (pcf(tid) = idle ⊃ idle;crashed)) ;∃ tid. pre(gs, lsf(tid), pcf(tid), a) ∧ dqs0 = mkstate (gstepf(gs, lsf(tid), pcf(tid), a), lsf(tid; lstepf(gs, lsf(tid), pcf(tid), a)), pcf(tid; pcstepf(gs, lsf(tid), pcf(tid), a))) ); (s) ⊦ mkls(tid, ival, oval, ival0, oval0).tid = tid; (s)

Proof step 136 from proof bwsim (previous step) (back to tree)

aa = aabs(ca), DQInv(gs, lsf, pcf), DQstep(mkstate(gs, lsf, pcf), ca, mkstate(gs0, lsf0, pcf0)), bwabs(mkstate(gs0, lsf0, pcf0), durqs), bwabs(mkstate(gs, lsf, pcf), durqs1), fininvdeq(pcf), ¬ amove(AIOAut(DurQinit, DurQstep))(durqs1, ⌜aa '⌝ ^, durqs), (absa(ca, durqs.pcf) = τ ⊃ durqs1 = durqs;DurQstep(durqs1, absa(ca, durqs.pcf), durqs)), ∀ tid. durqs.lsf(tid).tid = tid ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 8

Additional information

Proof step 137 from proof bwsim (previous step) (back to tree)

aa = aabs(ca), absa(ca, durqs.pcf) = τ, durqs1 = durqs, DQInv(gs, lsf, pcf), DQstep(mkstate(gs, lsf, pcf), ca, mkstate(gs0, lsf0, pcf0)), bwabs(mkstate(gs, lsf, pcf), durqs1), bwabs(mkstate(gs0, lsf0, pcf0), durqs), fininvdeq(pcf), ¬ amove(AIOAut(DurQinit, DurQstep))(durqs1, ⌜aa '⌝ ^, durqs), ∀ tid. durqs.lsf(tid).tid = tid ⊦

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: aa = τ

Additional information

Used simplifier rules: absa-def: ⊦ absa(ca, apcf0) = (∃ tid. ca = CheckEmp(tid) ⊃ (apcf0(ca.tid) = resDeq ⊃ ADoDeq(ca.tid);τ) ;bwabsa(ca) ); ⊦ DQstep(mkstate(gs, lsf, pcf), a, dqs0) ↔ (a = globalCrash ⊃ dqs0 = mkstate(gs, lsf, λ tid. (pcf(tid) = idle ⊃ idle;crashed)) ;∃ tid. pre(gs, lsf(tid), pcf(tid), a) ∧ dqs0 = mkstate (gstepf(gs, lsf(tid), pcf(tid), a), lsf(tid; lstepf(gs, lsf(tid), pcf(tid), a)), pcf(tid; pcstepf(gs, lsf(tid), pcf(tid), a))) ); (s) ⊦ ⌜τ '⌝ ^ = []; (s) ⊦ amove(AIOAut(startf, stepf))(s, [], s); (s) Used formulas: aa = τ

Proof step 138 from proof bwsim (previous step) (back to tree)

aa = aabs(ca), absa(ca, durqs.pcf) = τ, durqs1 = durqs, aa ≠ τ, DQInv(gs, lsf, pcf), DQstep(mkstate(gs, lsf, pcf), ca, mkstate(gs0, lsf0, pcf0)), bwabs(mkstate(gs0, lsf0, pcf0), durqs), bwabs(mkstate(gs, lsf, pcf), durqs1), fininvdeq(pcf), ¬ amove(AIOAut(DurQinit, DurQstep))(durqs1, ⌜aa '⌝ ^, durqs), ∀ tid. durqs.lsf(tid).tid = tid ⊦

User applied rule constructor cut

And closed the goal!

Rule argument

var: ca

Additional information

Used simplifier rules: absa-def: ⊦ absa(ca, apcf0) = (∃ tid. ca = CheckEmp(tid) ⊃ (apcf0(ca.tid) = resDeq ⊃ ADoDeq(ca.tid);τ) ;bwabsa(ca) ); absa-def: ⊦ absa(ca, apcf0) = (∃ tid. ca = CheckEmp(tid) ⊃ (apcf0(ca.tid) = resDeq ⊃ ADoDeq(ca.tid);τ) ;bwabsa(ca) ); absa-def: ⊦ absa(ca, apcf0) = (∃ tid. ca = CheckEmp(tid) ⊃ (apcf0(ca.tid) = resDeq ⊃ ADoDeq(ca.tid);τ) ;bwabsa(ca) ); absa-def: ⊦ absa(ca, apcf0) = (∃ tid. ca = CheckEmp(tid) ⊃ (apcf0(ca.tid) = resDeq ⊃ ADoDeq(ca.tid);τ) ;bwabsa(ca) ); absa-def: ⊦ absa(ca, apcf0) = (∃ tid. ca = CheckEmp(tid) ⊃ (apcf0(ca.tid) = resDeq ⊃ ADoDeq(ca.tid);τ) ;bwabsa(ca) ); absa-def: ⊦ absa(ca, apcf0) = (∃ tid. ca = CheckEmp(tid) ⊃ (apcf0(ca.tid) = resDeq ⊃ ADoDeq(ca.tid);τ) ;bwabsa(ca) ); absa-def: ⊦ absa(ca, apcf0) = (∃ tid. ca = CheckEmp(tid) ⊃ (apcf0(ca.tid) = resDeq ⊃ ADoDeq(ca.tid);τ) ;bwabsa(ca) ); absa-def: ⊦ absa(ca, apcf0) = (∃ tid. ca = CheckEmp(tid) ⊃ (apcf0(ca.tid) = resDeq ⊃ ADoDeq(ca.tid);τ) ;bwabsa(ca) ); absa-def: ⊦ absa(ca, apcf0) = (∃ tid. ca = CheckEmp(tid) ⊃ (apcf0(ca.tid) = resDeq ⊃ ADoDeq(ca.tid);τ) ;bwabsa(ca) ); absa-def: ⊦ absa(ca, apcf0) = (∃ tid. ca = CheckEmp(tid) ⊃ (apcf0(ca.tid) = resDeq ⊃ ADoDeq(ca.tid);τ) ;bwabsa(ca) ); absa-def: ⊦ absa(ca, apcf0) = (∃ tid. ca = CheckEmp(tid) ⊃ (apcf0(ca.tid) = resDeq ⊃ ADoDeq(ca.tid);τ) ;bwabsa(ca) ); DQAction freely generated by globalCrash, τ, CheckEmp, DoDeq, DoDeqEmpty, DoEnq, InvDeq, InvEnq, RetDeq, RetEnq, callRun ;; ⊦ CheckEmp(tid) ≠ callRun(tid0); (s) ⊦ bwabsa(callRun(tid)) = callARun(tid); (s) ⊦ callARun(tid) ≠ τ; (s) ⊦ CheckEmp(tid) ≠ RetEnq(tid0); (s) ⊦ bwabsa(RetEnq(tid)) = ARetEnq(tid); (s) ⊦ ARetEnq(tid) ≠ τ; (s) ⊦ CheckEmp(tid) ≠ RetDeq(tid0, optval); (s) ⊦ bwabsa(RetDeq(tid, optval)) = ARetDeq(tid, optval); (s) ⊦ ARetDeq(tid, optval) ≠ τ; (s) ⊦ CheckEmp(tid) ≠ InvEnq(tid0, val); (s) ⊦ bwabsa(InvEnq(tid, val)) = AInvEnq(tid, val); (s) ⊦ AInvEnq(tid, val) ≠ τ; (s) ⊦ CheckEmp(tid) ≠ InvDeq(tid0); (s) ⊦ bwabsa(InvDeq(tid)) = AInvDeq(tid); (s) ⊦ AInvDeq(tid) ≠ τ; (s) ⊦ CheckEmp(tid) ≠ DoEnq(tid0); (s) ⊦ bwabsa(DoEnq(tid)) = ADoEnq(tid); (s) ⊦ ADoEnq(tid) ≠ τ; (s) ⊦ CheckEmp(tid) ≠ DoDeqEmpty(tid0); (s) ⊦ bwabsa(DoDeqEmpty(tid)) = τ; (s) ⊦ aabs(DoDeqEmpty(tid)) = τ; (s) ⊦ CheckEmp(tid) ≠ DoDeq(tid0); (s) ⊦ bwabsa(DoDeq(tid)) = ADoDeq(tid); (s) ⊦ ADoDeq(tid) ≠ τ; (s) ⊦ CheckEmp(tid) = CheckEmp(tid0) ↔ tid = tid0; (s) ⊦ CheckEmp(tid).tid = tid; (s) ⊦ aabs(CheckEmp(tid)) = τ; (s) ⊦ CheckEmp(tid) ≠ τ; (s) ⊦ bwabsa(τ) = τ; (s) ⊦ aabs(τ) = τ; (s) ⊦ CheckEmp(tid) ≠ globalCrash; (s) ⊦ bwabsa(globalCrash) = globalACrash; (s) ⊦ globalACrash ≠ τ; (s)

Proof step 139 from proof bwsim (previous step) (back to tree)

aa = aabs(ca), absa(ca, durqs.pcf) ≠ τ, DQInv(gs, lsf, pcf), DQstep(mkstate(gs, lsf, pcf), ca, mkstate(gs0, lsf0, pcf0)), DurQstep(durqs1, absa(ca, durqs.pcf), durqs), bwabs(mkstate(gs, lsf, pcf), durqs1), bwabs(mkstate(gs0, lsf0, pcf0), durqs), fininvdeq(pcf), ¬ amove(AIOAut(DurQinit, DurQstep))(durqs1, ⌜aa '⌝ ^, durqs), ∀ tid. durqs.lsf(tid).tid = tid ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: IOtrace[DurQ-trace], name:move-one, seq:⊦ stepf(s, a, s0) ∧ AIOAut?(AIOAut(startf, stepf)) → amove(AIOAut(startf, stepf))(s, ⌜a '⌝ ^, s0), subst:[stepf, startf, s, a, s0] → [DurQstep, DurQinit, durqs1, aa, durqs], <all paths>

Additional information

Used terms: DurQstep, DurQinit, durqs1, aa, durqs

Proof step 140 from proof bwsim (previous step) (back to tree)

⊦ stepf(s, a, s0) ∧ AIOAut?(AIOAut(startf, stepf)) → amove(AIOAut(startf, stepf))(s, ⌜a '⌝ ^, s0)

A spec-lemma

Proof step 141 from proof bwsim (previous step) (back to tree)

aa = aabs(ca), absa(ca, durqs.pcf) ≠ τ, DQInv(gs, lsf, pcf), DQstep(mkstate(gs, lsf, pcf), ca, mkstate(gs0, lsf0, pcf0)), DurQstep(durqs1, absa(ca, durqs.pcf), durqs), bwabs(mkstate(gs0, lsf0, pcf0), durqs), bwabs(mkstate(gs, lsf, pcf), durqs1), fininvdeq(pcf), ¬ amove(AIOAut(DurQinit, DurQstep))(durqs1, ⌜aa '⌝ ^, durqs), ∀ tid. durqs.lsf(tid).tid = tid ⊦ DurQstep(durqs1, aa, durqs) ∧ AIOAut?(AIOAut(DurQinit, DurQstep))

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Used simplifier rules: absa-def: ⊦ absa(ca, apcf0) = (∃ tid. ca = CheckEmp(tid) ⊃ (apcf0(ca.tid) = resDeq ⊃ ADoDeq(ca.tid);τ) ;bwabsa(ca) ); DurQ-Automaton: ⊦ AIOAut?(AIOAut(DurQinit, DurQstep)); ⊦ DQstep(mkstate(gs, lsf, pcf), a, dqs0) ↔ (a = globalCrash ⊃ dqs0 = mkstate(gs, lsf, λ tid. (pcf(tid) = idle ⊃ idle;crashed)) ;∃ tid. pre(gs, lsf(tid), pcf(tid), a) ∧ dqs0 = mkstate (gstepf(gs, lsf(tid), pcf(tid), a), lsf(tid; lstepf(gs, lsf(tid), pcf(tid), a)), pcf(tid; pcstepf(gs, lsf(tid), pcf(tid), a))) ); (s)

Proof step 142 from proof bwsim (previous step) (back to tree)

aa = aabs(ca), absa(ca, durqs.pcf) ≠ τ, DQInv(gs, lsf, pcf), DQstep(mkstate(gs, lsf, pcf), ca, mkstate(gs0, lsf0, pcf0)), DurQstep(durqs1, absa(ca, durqs.pcf), durqs), bwabs(mkstate(gs, lsf, pcf), durqs1), bwabs(mkstate(gs0, lsf0, pcf0), durqs), fininvdeq(pcf), ¬ DurQstep(durqs1, aa, durqs), ¬ amove(AIOAut(DurQinit, DurQstep))(durqs1, ⌜aa '⌝ ^, durqs), ∀ tid. durqs.lsf(tid).tid = tid ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:DurQstep, seq:⊦ DurQstep(durqs, aa, durqs0) ↔ (∃ a. DurQstep(durqs, a, durqs0) ∧ aa = aabs(a)), subst:[durqs, aa, durqs0] → [durqs1, aa, durqs], <all paths>

Additional information

Used terms: durqs1, aa, durqs

Proof step 143 from proof bwsim (previous step) (back to tree)

⊦ DurQstep(durqs, aa, durqs0) ↔ (∃ a. DurQstep(durqs, a, durqs0) ∧ aa = aabs(a))

Lemma DurQstep

Proof step 144 from proof bwsim (previous step) (back to tree)

aa = aabs(ca), absa(ca, durqs.pcf) ≠ τ, DQInv(gs, lsf, pcf), DQstep(mkstate(gs, lsf, pcf), ca, mkstate(gs0, lsf0, pcf0)), DurQstep(durqs1, absa(ca, durqs.pcf), durqs), bwabs(mkstate(gs0, lsf0, pcf0), durqs), bwabs(mkstate(gs, lsf, pcf), durqs1), fininvdeq(pcf), ¬ amove(AIOAut(DurQinit, DurQstep))(durqs1, ⌜aa '⌝ ^, durqs), ∀ tid. durqs.lsf(tid).tid = tid, ∀ a. ¬(DurQstep(durqs1, a, durqs) ∧ aa = aabs(a)) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 11 terms: absa(ca, durqs.pcf) abort: F discard: T computed: T

Additional information

Used terms: absa(ca, durqs.pcf)

Proof step 145 from proof bwsim (previous step) (back to tree)

aa = aabs(ca), absa(ca, durqs.pcf) ≠ τ, DQInv(gs, lsf, pcf), DQstep(mkstate(gs, lsf, pcf), ca, mkstate(gs0, lsf0, pcf0)), DurQstep(durqs1, absa(ca, durqs.pcf), durqs), bwabs(mkstate(gs, lsf, pcf), durqs1), bwabs(mkstate(gs0, lsf0, pcf0), durqs), fininvdeq(pcf), ¬ amove(AIOAut(DurQinit, DurQstep))(durqs1, ⌜aa '⌝ ^, durqs), ∀ tid. durqs.lsf(tid).tid = tid ⊦ DurQstep(durqs1, absa(ca, durqs.pcf), durqs) ∧ aa = aabs(absa(ca, durqs.pcf))

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 146 from proof bwsim (previous step) (back to tree)

aa = aabs(ca), aa ≠ aabs(absa(ca, durqs.pcf)), absa(ca, durqs.pcf) ≠ τ, DQInv(gs, lsf, pcf), DQstep(mkstate(gs, lsf, pcf), ca, mkstate(gs0, lsf0, pcf0)), DurQstep(durqs1, absa(ca, durqs.pcf), durqs), bwabs(mkstate(gs0, lsf0, pcf0), durqs), bwabs(mkstate(gs, lsf, pcf), durqs1), fininvdeq(pcf), ¬ amove(AIOAut(DurQinit, DurQstep))(durqs1, ⌜aa '⌝ ^, durqs), ∀ tid. durqs.lsf(tid).tid = tid ⊦

User applied rule constructor cut

And closed the goal!

Rule argument

var: ca

Additional information

Used simplifier rules: absa-def: ⊦ absa(ca, apcf0) = (∃ tid. ca = CheckEmp(tid) ⊃ (apcf0(ca.tid) = resDeq ⊃ ADoDeq(ca.tid);τ) ;bwabsa(ca) ); aabs-Acrash: ⊦ aabs(globalACrash) = globalCRASH; absa-def: ⊦ absa(ca, apcf0) = (∃ tid. ca = CheckEmp(tid) ⊃ (apcf0(ca.tid) = resDeq ⊃ ADoDeq(ca.tid);τ) ;bwabsa(ca) ); aabs-DurQtau: ⊦ aabs(τ) = τ; absa-def: ⊦ absa(ca, apcf0) = (∃ tid. ca = CheckEmp(tid) ⊃ (apcf0(ca.tid) = resDeq ⊃ ADoDeq(ca.tid);τ) ;bwabsa(ca) ); aabs-ADoDeq: ⊦ aabs(ADoDeq(tid)) = τ; absa-def: ⊦ absa(ca, apcf0) = (∃ tid. ca = CheckEmp(tid) ⊃ (apcf0(ca.tid) = resDeq ⊃ ADoDeq(ca.tid);τ) ;bwabsa(ca) ); aabs-ADoDeq: ⊦ aabs(ADoDeq(tid)) = τ; absa-def: ⊦ absa(ca, apcf0) = (∃ tid. ca = CheckEmp(tid) ⊃ (apcf0(ca.tid) = resDeq ⊃ ADoDeq(ca.tid);τ) ;bwabsa(ca) ); aabs-DurQtau: ⊦ aabs(τ) = τ; absa-def: ⊦ absa(ca, apcf0) = (∃ tid. ca = CheckEmp(tid) ⊃ (apcf0(ca.tid) = resDeq ⊃ ADoDeq(ca.tid);τ) ;bwabsa(ca) ); aabs-ADoEnq: ⊦ aabs(ADoEnq(tid)) = τ; absa-def: ⊦ absa(ca, apcf0) = (∃ tid. ca = CheckEmp(tid) ⊃ (apcf0(ca.tid) = resDeq ⊃ ADoDeq(ca.tid);τ) ;bwabsa(ca) ); aabs-AInvDeq: ⊦ aabs(AInvDeq(tid)) = InvDEQ(tid); absa-def: ⊦ absa(ca, apcf0) = (∃ tid. ca = CheckEmp(tid) ⊃ (apcf0(ca.tid) = resDeq ⊃ ADoDeq(ca.tid);τ) ;bwabsa(ca) ); aabs-AInvEnq: ⊦ aabs(AInvEnq(tid, val)) = InvENQ(tid, val); absa-def: ⊦ absa(ca, apcf0) = (∃ tid. ca = CheckEmp(tid) ⊃ (apcf0(ca.tid) = resDeq ⊃ ADoDeq(ca.tid);τ) ;bwabsa(ca) ); aabs-AResDeq: ⊦ aabs(ARetDeq(tid, optval)) = ResDEQ(tid, optval); absa-def: ⊦ absa(ca, apcf0) = (∃ tid. ca = CheckEmp(tid) ⊃ (apcf0(ca.tid) = resDeq ⊃ ADoDeq(ca.tid);τ) ;bwabsa(ca) ); aabs-AResEnq: ⊦ aabs(ARetEnq(tid)) = ResENQ(tid); absa-def: ⊦ absa(ca, apcf0) = (∃ tid. ca = CheckEmp(tid) ⊃ (apcf0(ca.tid) = resDeq ⊃ ADoDeq(ca.tid);τ) ;bwabsa(ca) ); aabs-callARun: ⊦ aabs(callARun(tid)) = CallRUN(tid); DQAction freely generated by globalCrash, τ, CheckEmp, DoDeq, DoDeqEmpty, DoEnq, InvDeq, InvEnq, RetDeq, RetEnq, callRun ;; ⊦ aabs(callRun(tid)) = CallRUN(tid); (s) ⊦ CheckEmp(tid) ≠ callRun(tid0); (s) ⊦ bwabsa(callRun(tid)) = callARun(tid); (s) ⊦ CallRUN(tid) = CallRUN(tid0) ↔ tid = tid0; (s) ⊦ aabs(RetEnq(tid)) = ResENQ(tid); (s) ⊦ CheckEmp(tid) ≠ RetEnq(tid0); (s) ⊦ bwabsa(RetEnq(tid)) = ARetEnq(tid); (s) ⊦ ResENQ(tid) = ResENQ(tid0) ↔ tid = tid0; (s) ⊦ aabs(RetDeq(tid, optval)) = ResDEQ(tid, optval); (s) ⊦ CheckEmp(tid) ≠ RetDeq(tid0, optval); (s) ⊦ bwabsa(RetDeq(tid, optval)) = ARetDeq(tid, optval); (s) ⊦ ResDEQ(tid, optval) = ResDEQ(tid0, optval0) ↔ tid = tid0 ∧ optval = optval0; (ws) ⊦ aabs(InvEnq(tid, val)) = InvENQ(tid, val); (s) ⊦ CheckEmp(tid) ≠ InvEnq(tid0, val); (s) ⊦ bwabsa(InvEnq(tid, val)) = AInvEnq(tid, val); (s) ⊦ InvENQ(tid, val) = InvENQ(tid0, val0) ↔ tid = tid0 ∧ val = val0; (ws) ⊦ aabs(InvDeq(tid)) = InvDEQ(tid); (s) ⊦ CheckEmp(tid) ≠ InvDeq(tid0); (s) ⊦ bwabsa(InvDeq(tid)) = AInvDeq(tid); (s) ⊦ InvDEQ(tid) = InvDEQ(tid0) ↔ tid = tid0; (s) ⊦ aabs(DoEnq(tid)) = τ; (s) ⊦ CheckEmp(tid) ≠ DoEnq(tid0); (s) ⊦ bwabsa(DoEnq(tid)) = ADoEnq(tid); (s) ⊦ aabs(DoDeqEmpty(tid)) = τ; (s) ⊦ CheckEmp(tid) ≠ DoDeqEmpty(tid0); (s) ⊦ bwabsa(DoDeqEmpty(tid)) = τ; (s) ⊦ aabs(DoDeq(tid)) = τ; (s) ⊦ CheckEmp(tid) ≠ DoDeq(tid0); (s) ⊦ bwabsa(DoDeq(tid)) = ADoDeq(tid); (s) ⊦ aabs(CheckEmp(tid)) = τ; (s) ⊦ CheckEmp(tid) = CheckEmp(tid0) ↔ tid = tid0; (s) ⊦ CheckEmp(tid).tid = tid; (s) ⊦ ADoDeq(tid) ≠ τ; (s) ⊦ aabs(τ) = τ; (s) ⊦ CheckEmp(tid) ≠ τ; (s) ⊦ bwabsa(τ) = τ; (s) ⊦ aabs(globalCrash) = globalCRASH; (s) ⊦ CheckEmp(tid) ≠ globalCrash; (s) ⊦ bwabsa(globalCrash) = globalACrash; (s)

Proof step 147 from proof bwsim (previous step) (back to tree)

DQInv(gs, lsf, pcf), fininvdeq(pcf) ⊦ ∃ ass. ∀ durqs. bwabs(mkstate(gs, lsf, pcf), durqs) ∧ (∀ tid. durqs.lsf(tid).tid = tid) ↔ durqs ∈ ass

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:fininvdeq, seq: ⊦ fininvdeq(pcf) ↔ (∃ tids. ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids), subst:[pcf] → [pcf], <all paths>

Additional information

Used terms: pcf

Proof step 148 from proof bwsim (previous step) (back to tree)

⊦ fininvdeq(pcf) ↔ (∃ tids. ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids)

Lemma fininvdeq

Proof step 149 from proof bwsim (previous step) (back to tree)

DQInv(gs, lsf, pcf), ∃ tids. ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦ ∃ ass. ∀ durqs. bwabs(mkstate(gs, lsf, pcf), durqs) ∧ (∀ tid. durqs.lsf(tid).tid = tid) ↔ durqs ∈ ass

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 150 from proof bwsim (previous step) (back to tree)

DQInv(gs, lsf, pcf), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦ ∃ ass. ∀ durqs. bwabs(mkstate(gs, lsf, pcf), durqs) ∧ (∀ tid. durqs.lsf(tid).tid = tid) ↔ durqs ∈ ass

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:imfin-lemma, seq:∀ tid. tid ∈ tids ↔ pcf(tid) = invDeq, DQInv(gs, lsf, pcf), tids0 ⊆ tids ⊦ ∃ ass. ∀ as. bwabs(mkstate(gs, lsf, pcf), as) ∧ DurQInv(as.gstate, as.lsf, as.pcf) ∧ (∀ tid. ¬ tid ∈ tids0 → as.pcf(tid) = bwabspcf(pcf(tid)) ∧ as.lsf(tid) = bwlabsf(lsf(tid))) ↔ as ∈ ass, subst:[gs, tids, lsf, tids0, pcf] → [gs, tids, lsf, tids, pcf]

Additional information

Used terms: gs, tids, lsf, tids, pcf

Proof step 151 from proof bwsim (previous step) (back to tree)

∀ tid. tid ∈ tids ↔ pcf(tid) = invDeq, DQInv(gs, lsf, pcf), tids0 ⊆ tids ⊦ ∃ ass. ∀ as. bwabs(mkstate(gs, lsf, pcf), as) ∧ DurQInv(as.gstate, as.lsf, as.pcf) ∧ (∀ tid. ¬ tid ∈ tids0 → as.pcf(tid) = bwabspcf(pcf(tid)) ∧ as.lsf(tid) = bwlabsf(lsf(tid))) ↔ as ∈ ass

Lemma imfin-lemma

Proof step 152 from proof bwsim (previous step) (back to tree)

DQInv(gs, lsf, pcf), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦ ∃ ass. ∀ durqs. bwabs(mkstate(gs, lsf, pcf), durqs) ∧ (∀ tid. durqs.lsf(tid).tid = tid) ↔ durqs ∈ ass, (∀ tid. tid ∈ tids ↔ pcf(tid) = invDeq) ∧ tids ⊆ tids

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ # s = # s0 → (s ⊆ s0 ↔ s = s0); (s)

Proof step 153 from proof bwsim (previous step) (back to tree)

¬(tid ∈ tids ↔ pcf(tid) = invDeq), DQInv(gs, lsf, pcf), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦ ∃ ass. ∀ durqs. bwabs(mkstate(gs, lsf, pcf), durqs) ∧ (∀ tid. durqs.lsf(tid).tid = tid) ↔ durqs ∈ ass

User applied rule all left

And closed the goal!

Rule argument

pos: left 3 terms: tid abort: F discard: T computed: T

Additional information

Used terms: tid

Proof step 154 from proof bwsim (previous step) (back to tree)

DQInv(gs, lsf, pcf), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∃ ass. ∀ as. bwabs(mkstate(gs, lsf, pcf), as) ∧ DurQInv(as.gstate, as.lsf, as.pcf) ∧ (∀ tid. ¬ tid ∈ tids → as.pcf(tid) = bwabspcf(pcf(tid)) ∧ as.lsf(tid) = bwlabsf(lsf(tid))) ↔ as ∈ ass ⊦ ∃ ass. ∀ durqs. bwabs(mkstate(gs, lsf, pcf), durqs) ∧ (∀ tid. durqs.lsf(tid).tid = tid) ↔ durqs ∈ ass

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ bwlabsf(ls) = mkls(ls.tid, ls.ival, ls.oval, ls.value, ls.optval); (s) ⊦ DurQLInv(gs, ls, pc) ↔ true; (s) ⊦ DurQGInv(gs) ↔ true; (s) ⊦ DurQInv(gs, lsf, pcf) ↔ DurQGInv(gs) ∧ (∀ tid. lsf(tid).tid = tid ∧ DurQLInv(gs, lsf(tid), pcf(tid))); (s)

Proof step 155 from proof bwsim (previous step) (back to tree)

DQInv(gs, lsf, pcf), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ as. bwabs(mkstate(gs, lsf, pcf), as) ∧ (∀ tid. as.lsf(tid).tid = tid) ∧ (∀ tid. ¬ tid ∈ tids → as.pcf(tid) = bwabspcf(pcf(tid)) ∧ as.lsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval)) ↔ as ∈ ass ⊦ ∃ ass. ∀ durqs. bwabs(mkstate(gs, lsf, pcf), durqs) ∧ (∀ tid. durqs.lsf(tid).tid = tid) ↔ durqs ∈ ass

User applied rule exists right

And obtained the following new goals

Rule argument

pos: right 1 terms: ass abort: F discard: T computed: T

Additional information

Used terms: ass

Proof step 156 from proof bwsim (previous step) (back to tree)

DQInv(gs, lsf, pcf), ∀ as. bwabs(mkstate(gs, lsf, pcf), as) ∧ (∀ tid. as.lsf(tid).tid = tid) ∧ (∀ tid. ¬ tid ∈ tids → as.pcf(tid) = bwabspcf(pcf(tid)) ∧ as.lsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval)) ↔ as ∈ ass, ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦ ∀ durqs. bwabs(mkstate(gs, lsf, pcf), durqs) ∧ (∀ tid. durqs.lsf(tid).tid = tid) ↔ durqs ∈ ass

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 157 from proof bwsim (previous step) (back to tree)

DQInv(gs, lsf, pcf), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ as. bwabs(mkstate(gs, lsf, pcf), as) ∧ (∀ tid. as.lsf(tid).tid = tid) ∧ (∀ tid. ¬ tid ∈ tids → as.pcf(tid) = bwabspcf(pcf(tid)) ∧ as.lsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval)) ↔ as ∈ ass ⊦ bwabs(mkstate(gs, lsf, pcf), durqs) ∧ (∀ tid. durqs.lsf(tid).tid = tid) ↔ durqs ∈ ass

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 3 terms: durqs abort: F discard: T computed: T

Additional information

Used terms: durqs

Proof step 158 from proof bwsim (previous step) (back to tree)

DQInv(gs, lsf, pcf), bwabs(mkstate(gs, lsf, pcf), durqs) ∧ (∀ tid. durqs.lsf(tid).tid = tid) ∧ (∀ tid. ¬ tid ∈ tids → durqs.pcf(tid) = bwabspcf(pcf(tid)) ∧ durqs.lsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval)) ↔ durqs ∈ ass, ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦ bwabs(mkstate(gs, lsf, pcf), durqs) ∧ (∀ tid. durqs.lsf(tid).tid = tid) ↔ durqs ∈ ass

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 159 from proof bwsim (previous step) (back to tree)

DQInv(gs, lsf, pcf), bwabs(mkstate(gs, lsf, pcf), durqs), ¬ durqs ∈ ass, bwabs(mkstate(gs, lsf, pcf), durqs) ∧ (∀ tid. durqs.lsf(tid).tid = tid) ∧ (∀ tid. ¬ tid ∈ tids → durqs.pcf(tid) = bwabspcf(pcf(tid)) ∧ durqs.lsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval)) ↔ durqs ∈ ass, ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. durqs.lsf(tid).tid = tid ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 160 from proof bwsim (previous step) (back to tree)

DQInv(gs, lsf, pcf), bwabs(mkstate(gs, lsf, pcf), durqs), ¬ durqs ∈ ass, ¬ tid ∈ tids, ∀ tid. durqs.lsf(tid).tid = tid, ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦ durqs.pcf(tid) = bwabspcf(pcf(tid)) ∧ durqs.lsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval)

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DurQ[DurQ-ren], name:elim-mkstate, seq:⊦ (gstate = s.gstate ∧ lsf = s.lsf) ∧ pcf = s.pcf ↔ s = mkstate(gstate, lsf, pcf), subst:[s, gstate, lsf, pcf] → [durqs, ags, alsf, apcf]

Additional information

Used simplifier rules: ⊦ (gstate = s.gstate ∧ lsf = s.lsf) ∧ pcf = s.pcf ↔ s = mkstate(gstate, lsf, pcf); (elim) Used terms: durqs, gstate, alsf, apcf

Proof step 161 from proof bwsim (previous step) (back to tree)

durqs = mkstate(ags, alsf, apcf), DQInv(gs, lsf, pcf), bwabs(mkstate(gs, lsf, pcf), durqs), ¬ durqs ∈ ass, ¬ tid ∈ tids, ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. alsf(tid).tid = tid ⊦ apcf(tid) = bwabspcf(pcf(tid)) ∧ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 162 from proof bwsim (previous step) (back to tree)

DQInv(gs, lsf, pcf), bwabs(mkstate(gs, lsf, pcf), mkstate(ags, alsf, apcf)), ¬ mkstate(ags, alsf, apcf) ∈ ass, ¬ tid ∈ tids, ∀ tid. alsf(tid).tid = tid, ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦ apcf(tid) = bwabspcf(pcf(tid)) ∧ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: bwabs, name:bwabs-def, seq:⊦ bwabs(mkstate(gs, lsf, pcf), mkstate(ags, alsf, apcf)) ↔ ags = mkdgs(gs.queue) ∧ (∀ tid. alsf(tid) = mkls (lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ apcf(tid) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls (lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty), subst:[gs, alsf, lsf, ags, pcf, apcf] → [gs, alsf, lsf, ags, pcf, apcf], <all paths>

Additional information

Used terms: gs, alsf, lsf, ags, pcf, apcf

Proof step 163 from proof bwsim (previous step) (back to tree)

⊦ bwabs(mkstate(gs, lsf, pcf), mkstate(ags, alsf, apcf)) ↔ ags = mkdgs(gs.queue) ∧ (∀ tid. alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ apcf(tid) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty)

A spec-lemma

Proof step 164 from proof bwsim (previous step) (back to tree)

ags = mkdgs(gs.queue), DQInv(gs, lsf, pcf), ¬ mkstate(ags, alsf, apcf) ∈ ass, ¬ tid ∈ tids, ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. alsf(tid).tid = tid, ∀ tid. alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ apcf(tid) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty ⊦ apcf(tid) = bwabspcf(pcf(tid)) ∧ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 165 from proof bwsim (previous step) (back to tree)

DQInv(gs, lsf, pcf), ¬ mkstate(mkdgs(gs.queue), alsf, apcf) ∈ ass, ¬ tid ∈ tids, ∀ tid. alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ apcf(tid) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty, ∀ tid. alsf(tid).tid = tid, ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦ apcf(tid) = bwabspcf(pcf(tid)) ∧ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval)

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DQ, name:elim-mkgs, seq: ⊦ queue = gs.queue ↔ gs = mkgs(queue), subst:[gs, queue] → [gs, queue]

Additional information

Used simplifier rules: ⊦ queue = gs.queue ↔ gs = mkgs(queue); (elim) Used terms: gs, queue

Proof step 166 from proof bwsim (previous step) (back to tree)

gs = mkgs(queue), DQInv(gs, lsf, pcf), ¬ mkstate(mkdgs(queue), alsf, apcf) ∈ ass, ¬ tid ∈ tids, ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. alsf(tid).tid = tid, ∀ tid. alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ apcf(tid) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty ⊦ apcf(tid) = bwabspcf(pcf(tid)) ∧ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 167 from proof bwsim (previous step) (back to tree)

DQInv(mkgs(queue), lsf, pcf), ¬ mkstate(mkdgs(queue), alsf, apcf) ∈ ass, ¬ tid ∈ tids, ∀ tid. alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ apcf(tid) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty, ∀ tid. alsf(tid).tid = tid, ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦ apcf(tid) = bwabspcf(pcf(tid)) ∧ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval)

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 4 terms: tid abort: F discard: F computed: T

Additional information

Used terms: tid

Proof step 168 from proof bwsim (previous step) (back to tree)

DQInv(mkgs(queue), lsf, pcf), ¬ mkstate(mkdgs(queue), alsf, apcf) ∈ ass, ¬ tid ∈ tids, ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. alsf(tid).tid = tid, ∀ tid. alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ apcf(tid) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty, alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ apcf(tid) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty ⊦ apcf(tid) = bwabspcf(pcf(tid)) ∧ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 169 from proof bwsim (previous step) (back to tree)

DQInv(mkgs(queue), lsf, pcf), ¬ mkstate(mkdgs(queue), alsf, apcf) ∈ ass, ¬ tid ∈ tids, ∀ tid. alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ apcf(tid) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty, ∀ tid. alsf(tid).tid = tid, ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ apcf(tid) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty ⊦ apcf(tid) = bwabspcf(pcf(tid)) ∧ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval)

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DQ, name:elim-mkls, seq:⊦ ( ( ((tid = ls.tid ∧ (obsEmpty ↔ ls.obsEmpty)) ∧ ival = ls.ival) ∧ oval = ls.oval) ∧ value = ls.value) ∧ optval = ls.optval ↔ ls = mkls(tid, obsEmpty, ival, oval, value, optval), subst:[value, ival, obsEmpty, ls, oval, tid, optval] → [val0, val, obsEmpty, lsf(tid), optval, tid0, optval0]

Additional information

Used simplifier rules: ⊦ ( ( ((tid = ls.tid ∧ (obsEmpty ↔ ls.obsEmpty)) ∧ ival = ls.ival) ∧ oval = ls.oval) ∧ value = ls.value) ∧ optval = ls.optval ↔ ls = mkls(tid, obsEmpty, ival, oval, value, optval); (elim) Used terms: value, ival, obsEmpty, lsf(tid), oval, tid0, optval

Proof step 170 from proof bwsim (previous step) (back to tree)

lsf(tid) = mkls(tid0, obsEmpty, val, optval, val0, optval0), DQInv(mkgs(queue), lsf, pcf), ¬ mkstate(mkdgs(queue), alsf, apcf) ∈ ass, ¬ tid ∈ tids, ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. alsf(tid).tid = tid, ∀ tid. alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ apcf(tid) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty, alsf(tid) = mkls(tid0, val, optval, val0, optval0) ∧ apcf(tid) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(tid0, val, Empty, val0, optval0) ∧ pcf(tid) = invDeq ∧ apcf(tid) = resDeq ∧ obsEmpty ⊦ apcf(tid) = bwabspcf(pcf(tid)) ∧ alsf(tid) = mkls(tid0, val, optval, val0, optval0)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 171 from proof bwsim (previous step) (back to tree)

lsf(tid) = mkls(tid0, obsEmpty, val, optval, val0, optval0), DQInv(mkgs(queue), lsf, pcf), ¬ mkstate(mkdgs(queue), alsf, apcf) ∈ ass, ¬ tid ∈ tids, ∀ tid. alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ apcf(tid) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty, ∀ tid. alsf(tid).tid = tid, ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, alsf(tid) = mkls(tid0, val, optval, val0, optval0) ∧ apcf(tid) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(tid0, val, Empty, val0, optval0) ∧ pcf(tid) = invDeq ∧ apcf(tid) = resDeq ∧ obsEmpty ⊦ apcf(tid) = bwabspcf(pcf(tid)) ∧ alsf(tid) = mkls(tid0, val, optval, val0, optval0)

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 7 terms: tid

Additional information

Used terms: tid

Proof Tree for bwsim (View conclusion)

The following image shows the proof tree of sequent calculus. The proved goal is at the bottom. You can click on the nodes to view additional rules. See here for details on colors in a proof tree.

the proof tree