[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-step-nontau (conclusion) (back to tree)

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

System applied rule normalize

And obtained the following new goals

Rule argument

Additional information

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

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

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)

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

DQInv(gs, lsf, pcf), bwabs(mkstate(gs0, lsf0, pcf0), durqs0), fininvdeq(pcf), (ca = globalCrash ⊃ mkstate(gs0, lsf0, pcf0) = mkstate(gs, lsf, λ tid. (pcf(tid) = idle ⊃ idle;crashed)) ; pre(gs, lsf(tid), pcf(tid), ca) ∧ mkstate(gs0, lsf0, pcf0) = mkstate(gstepf(gs, lsf(tid), pcf(tid), ca), lsf(tid; lstepf(gs, lsf(tid), pcf(tid), ca)), pcf(tid; pcstepf(gs, lsf(tid), pcf(tid), ca))) ) ⊦ (∃ tid. ca = CheckEmp(tid) ⊃ (durqs0.pcf(ca.tid) = resDeq ⊃ ADoDeq(ca.tid);τ);bwabsa(ca)) = τ, ∃ durqs. DurQstep(durqs, (∃ tid. ca = CheckEmp(tid) ⊃ (durqs0.pcf(ca.tid) = resDeq ⊃ ADoDeq(ca.tid);τ);bwabsa(ca)), durqs0) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 4

Additional information

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

ca = globalCrash, mkstate(gs0, lsf0, pcf0) = mkstate(gs, lsf, λ tid. (pcf(tid) = idle ⊃ idle;crashed)), DQInv(gs, lsf, pcf), bwabs(mkstate(gs0, lsf0, pcf0), durqs0), fininvdeq(pcf) ⊦ (∃ tid. ca = CheckEmp(tid) ⊃ (durqs0.pcf(ca.tid) = resDeq ⊃ ADoDeq(ca.tid);τ);bwabsa(ca)) = τ, ∃ durqs. DurQstep(durqs, (∃ tid. ca = CheckEmp(tid) ⊃ (durqs0.pcf(ca.tid) = resDeq ⊃ ADoDeq(ca.tid);τ);bwabsa(ca)), durqs0) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ globalACrash ≠ τ; (s) ⊦ bwabsa(globalCrash) = globalACrash; (s) ⊦ CheckEmp(tid) ≠ globalCrash; (s) ⊦ mkstate(gstate, lsf, pcf) = mkstate(gstate0, lsf0, pcf0) ↔ gstate = gstate0 ∧ lsf = lsf0 ∧ pcf = pcf0; (ws)

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

DQInv(gs, lsf, pcf), bwabs(mkstate(gs, lsf, λ tid. (pcf(tid) = idle ⊃ idle;crashed)), durqs0), fininvdeq(pcf) ⊦ ∃ durqs. DurQstep(durqs, globalACrash, durqs0) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

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 6 from proof bwsim-step-nontau (previous step) (back to tree)

DQInv(gs, lsf, pcf), bwabs(mkstate(gs, lsf, λ tid. (pcf(tid) = idle ⊃ idle;crashed)), durqs0), fininvdeq(pcf) ⊦ DurQstep(mkstate(mkdgs(gs.queue), λ tid. bwlabsf(lsf(tid)), λ tid. bwabspcf(pcf(tid))), globalACrash, durqs0) ∧ bwabs(mkstate(gs, lsf, pcf), mkstate(mkdgs(gs.queue), λ tid. bwlabsf(lsf(tid)), λ tid. bwabspcf(pcf(tid))))

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)

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

DQInv(gs, lsf, pcf), bwabs(mkstate(gs, lsf, λ tid. (pcf(tid) = idle ⊃ idle;crashed)), durqs0), fininvdeq(pcf) ⊦ DurQstep (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))), globalACrash, durqs0) ∧ 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))))

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 8 from proof bwsim-step-nontau (previous step) (back to tree)

gs = mkgs(queue), DQInv(gs, lsf, pcf), bwabs(mkstate(gs, lsf, λ tid. (pcf(tid) = idle ⊃ idle;crashed)), durqs0), fininvdeq(pcf) ⊦ DurQstep (mkstate(mkdgs(queue), λ tid. mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval), λ tid. bwabspcf(pcf(tid))), globalACrash, durqs0) ∧ 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))))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

DQInv(mkgs(queue), lsf, pcf), bwabs(mkstate(mkgs(queue), lsf, λ tid. (pcf(tid) = idle ⊃ idle;crashed)), durqs0), fininvdeq(pcf) ⊦ DurQstep (mkstate(mkdgs(queue), λ tid. mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval), λ tid. bwabspcf(pcf(tid))), globalACrash, durqs0) ∧ 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: 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] → [durqs0, λ tid. mkls (lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval), globalACrash, mkdgs(queue), λ tid. bwabspcf(pcf(tid))], <all paths>

Additional information

Used terms: durqs0, λ tid. mkls (lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval), globalACrash, mkdgs(queue), λ tid. bwabspcf(pcf(tid))

Proof step 10 from proof bwsim-step-nontau (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 11 from proof bwsim-step-nontau (previous step) (back to tree)

DQInv(mkgs(queue), lsf, pcf), bwabs(mkstate(mkgs(queue), lsf, λ tid. (pcf(tid) = idle ⊃ idle;crashed)), durqs0), fininvdeq(pcf) ⊦ (globalACrash = globalACrash ⊃ durqs0 = mkstate (mkdgs(queue), λ tid. mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval), λ tid. (bwabspcf(pcf(tid)) = idle ⊃ idle;crashed)) ;∃ tid. pre(mkdgs(queue), mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval), bwabspcf(pcf(tid)), globalACrash) ∧ durqs0 = mkstate (gstepf(mkdgs(queue), mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval), bwabspcf(pcf(tid)), globalACrash), (λ tid. mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) )(tid ; lstepf (mkdgs(queue), mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval), bwabspcf(pcf(tid)), globalACrash) ), (λ tid. bwabspcf(pcf(tid)) )(tid ; pcstepf (mkdgs(queue), mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval), bwabspcf(pcf(tid)), globalACrash) )) ) ∧ 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))))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ crashed ≠ invDeq; (s) ⊦ idle ≠ invDeq; (s) ⊦ mkdgs(queue) = mkdgs(queue0) ↔ queue = queue0; (s) ⊦ mkgs(queue).queue = queue; (s) ⊦ bwabs(mkstate(gs, lsf, pcf), mkstate(ags, alsf, apcf)) → ( bwabs(mkstate(gs0, lsf0, pcf0), mkstate(ags0, alsf0, apcf0)) ↔ ags = mkdgs(gs.queue) → ags0 = mkdgs(gs0.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 → alsf0(tid) = mkls (lsf0(tid).tid, lsf0(tid).ival, lsf0(tid).oval, lsf0(tid).value, lsf0(tid).optval) ∧ apcf0(tid) = bwabspcf(pcf0(tid)) ∨ alsf0(tid) = mkls (lsf0(tid).tid, lsf0(tid).ival, Empty, lsf0(tid).value, lsf0(tid).optval) ∧ pcf0(tid) = invDeq ∧ apcf0(tid) = resDeq ∧ lsf0(tid).obsEmpty)); (s)

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

durqs0 ≠ mkstate (mkdgs(queue), λ tid. mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval), λ tid. (bwabspcf(pcf(tid)) = idle ⊃ idle;crashed)), DQInv(mkgs(queue), lsf, pcf), bwabs(mkstate(mkgs(queue), lsf, λ tid. (pcf(tid) = idle ⊃ idle;crashed)), durqs0), fininvdeq(pcf) ⊦

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: durqs0

Additional information

Used simplifier rules: DurQState freely generated by mkstate;;

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

durqs0 = mkstate(ags, alsf, apcf), durqs0 ≠ mkstate (mkdgs(queue), λ tid. mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval), λ tid. (bwabspcf(pcf(tid)) = idle ⊃ idle;crashed)), DQInv(mkgs(queue), lsf, pcf), bwabs(mkstate(mkgs(queue), lsf, λ tid. (pcf(tid) = idle ⊃ idle;crashed)), durqs0), fininvdeq(pcf) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

mkstate(ags, alsf, apcf) ≠ mkstate (mkdgs(queue), λ tid. mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval), λ tid. (bwabspcf(pcf(tid)) = idle ⊃ idle;crashed)), DQInv(mkgs(queue), lsf, pcf), bwabs(mkstate(mkgs(queue), lsf, λ tid. (pcf(tid) = idle ⊃ idle;crashed)), mkstate(ags, alsf, apcf)), fininvdeq(pcf) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DurQ[DurQ-ren], name:inj-mkstate, seq:⊦ mkstate(gstate, lsf, pcf) = mkstate(gstate0, lsf0, pcf0) ↔ gstate = gstate0 ∧ lsf = lsf0 ∧ pcf = pcf0, subst:[gstate, pcf0, lsf0, lsf, gstate0, pcf] → [ags, λ tid. (bwabspcf(pcf(tid)) = idle ⊃ idle;crashed), λ tid. mkls (lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval), alsf, mkdgs(queue), apcf], <all paths>

Additional information

Used terms: ags, λ tid. (bwabspcf(pcf(tid)) = idle ⊃ idle;crashed), λ tid. mkls (lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval), alsf, mkdgs(queue), apcf

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

⊦ mkstate(gstate, lsf, pcf) = mkstate(gstate0, lsf0, pcf0) ↔ gstate = gstate0 ∧ lsf = lsf0 ∧ pcf = pcf0

A spec-lemma

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

DQInv(mkgs(queue), lsf, pcf), bwabs(mkstate(mkgs(queue), lsf, λ tid. (pcf(tid) = idle ⊃ idle;crashed)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ags ≠ mkdgs(queue) ∨ alsf ≠ (λ tid. mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval)) ∨ apcf ≠ (λ tid. (bwabspcf(pcf(tid)) = idle ⊃ idle;crashed)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

DQInv(mkgs(queue), lsf, pcf), bwabs(mkstate(mkgs(queue), lsf, λ tid. (pcf(tid) = idle ⊃ idle;crashed)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ags ≠ mkdgs(queue) ∨ alsf(tid) ≠ mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∨ apcf(tid0) ≠ (bwabspcf(pcf(tid0)) = idle ⊃ idle;crashed) ⊦

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, tid1, 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, tid1, optval

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

lsf(tid) = mkls(tid1, obsEmpty, val, optval, val0, optval0), DQInv(mkgs(queue), lsf, pcf), bwabs(mkstate(mkgs(queue), lsf, λ tid. (pcf(tid) = idle ⊃ idle;crashed)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ags ≠ mkdgs(queue) ∨ alsf(tid) ≠ mkls(tid1, val, optval, val0, optval0) ∨ apcf(tid0) ≠ (bwabspcf(pcf(tid0)) = idle ⊃ idle;crashed) ⊦

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), alsf, lsf, ags, λ tid. (pcf(tid) = idle ⊃ idle;crashed), apcf], <all paths>

Additional information

Used terms: mkgs(queue), alsf, lsf, ags, λ tid. (pcf(tid) = idle ⊃ idle;crashed), apcf

Proof step 19 from proof bwsim-step-nontau (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 20 from proof bwsim-step-nontau (previous step) (back to tree)

ags = mkdgs(mkgs(queue).queue), lsf(tid) = mkls(tid1, obsEmpty, val, optval, val0, optval0), DQInv(mkgs(queue), lsf, pcf), fininvdeq(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) = idle ⊃ idle;crashed)) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ (pcf(tid) = idle ⊃ idle;crashed) = invDeq ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty, ags ≠ mkdgs(queue) ∨ alsf(tid) ≠ mkls(tid1, val, optval, val0, optval0) ∨ apcf(tid0) ≠ (bwabspcf(pcf(tid0)) = idle ⊃ idle;crashed) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ crashed ≠ invDeq; (s) ⊦ idle ≠ invDeq; (s) ⊦ mkdgs(queue) = mkdgs(queue0) ↔ queue = queue0; (s) ⊦ mkgs(queue).queue = queue; (s)

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

lsf(tid) = mkls(tid1, obsEmpty, val, optval, val0, optval0), DQInv(mkgs(queue), lsf, pcf), fininvdeq(pcf), ∀ tid2. alsf(tid2) = mkls(lsf(tid2).tid, lsf(tid2).ival, lsf(tid2).oval, lsf(tid2).value, lsf(tid2).optval) ∧ apcf(tid2) = bwabspcf((pcf(tid2) = idle ⊃ idle;crashed)), alsf(tid) ≠ mkls(tid1, val, optval, val0, optval0) ∨ apcf(tid0) ≠ (bwabspcf(pcf(tid0)) = idle ⊃ idle;crashed) ⊦

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 22 from proof bwsim-step-nontau (previous step) (back to tree)

alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval), apcf(tid) = bwabspcf((pcf(tid) = idle ⊃ idle;crashed)), lsf(tid) = mkls(tid1, obsEmpty, val, optval, val0, optval0), DQInv(mkgs(queue), lsf, pcf), fininvdeq(pcf), ∀ tid2. alsf(tid2) = mkls(lsf(tid2).tid, lsf(tid2).ival, lsf(tid2).oval, lsf(tid2).value, lsf(tid2).optval) ∧ apcf(tid2) = bwabspcf((pcf(tid2) = idle ⊃ idle;crashed)), alsf(tid) ≠ mkls(tid1, val, optval, val0, optval0) ∨ apcf(tid0) ≠ (bwabspcf(pcf(tid0)) = idle ⊃ idle;crashed) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

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) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).optval = oval0; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).value = ival0; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).oval = oval; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).ival = ival; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).tid = tid; (s)

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

alsf(tid) = mkls(tid1, val, optval, val0, optval0), apcf(tid) = bwabspcf((pcf(tid) = idle ⊃ idle;crashed)), lsf(tid) = mkls(tid1, obsEmpty, val, optval, val0, optval0), apcf(tid0) ≠ (bwabspcf(pcf(tid0)) = idle ⊃ idle;crashed), DQInv(mkgs(queue), lsf, pcf), fininvdeq(pcf), ∀ tid2. alsf(tid2) = mkls(lsf(tid2).tid, lsf(tid2).ival, lsf(tid2).oval, lsf(tid2).value, lsf(tid2).optval) ∧ apcf(tid2) = bwabspcf((pcf(tid2) = idle ⊃ idle;crashed)) ⊦

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 24 from proof bwsim-step-nontau (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 25 from proof bwsim-step-nontau (previous step) (back to tree)

alsf(tid) = mkls(tid1, val, optval, val0, optval0), apcf(tid) = bwabspcf((pcf(tid) = idle ⊃ idle;crashed)), lsf(tid) = mkls(tid1, obsEmpty, val, optval, val0, optval0), apcf(tid0) ≠ (bwabspcf(pcf(tid0)) = idle ⊃ idle;crashed), DQGInv(mkgs(queue)), fininvdeq(pcf), ∀ tid2. alsf(tid2) = mkls(lsf(tid2).tid, lsf(tid2).ival, lsf(tid2).oval, lsf(tid2).value, lsf(tid2).optval) ∧ apcf(tid2) = bwabspcf((pcf(tid2) = idle ⊃ idle;crashed)), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 7 terms: tid0 abort: F discard: F computed: T

Additional information

Used terms: tid0

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

alsf(tid) = mkls(tid1, val, optval, val0, optval0), alsf(tid0) = mkls(lsf(tid0).tid, lsf(tid0).ival, lsf(tid0).oval, lsf(tid0).value, lsf(tid0).optval), apcf(tid) = bwabspcf((pcf(tid) = idle ⊃ idle;crashed)), apcf(tid0) = bwabspcf((pcf(tid0) = idle ⊃ idle;crashed)), lsf(tid) = mkls(tid1, obsEmpty, val, optval, val0, optval0), apcf(tid0) ≠ (bwabspcf(pcf(tid0)) = idle ⊃ idle;crashed), DQGInv(mkgs(queue)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ∀ tid2. alsf(tid2) = mkls(lsf(tid2).tid, lsf(tid2).ival, lsf(tid2).oval, lsf(tid2).value, lsf(tid2).optval) ∧ apcf(tid2) = bwabspcf((pcf(tid2) = idle ⊃ idle;crashed)) ⊦

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, obsEmpty0, lsf(tid0), optval1, tid3, 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, obsEmpty0, lsf(tid0), oval, tid2, optval1

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

alsf(tid0) = mkls(tid3, val1, optval1, val2, optval2), alsf(tid) = mkls(tid1, val, optval, val0, optval0), apcf(tid0) = bwabspcf((pcf(tid0) = idle ⊃ idle;crashed)), apcf(tid) = bwabspcf((pcf(tid) = idle ⊃ idle;crashed)), lsf(tid) = mkls(tid1, obsEmpty, val, optval, val0, optval0), lsf(tid0) = mkls(tid3, obsEmpty0, val1, optval1, val2, optval2), apcf(tid0) ≠ (bwabspcf(pcf(tid0)) = idle ⊃ idle;crashed), DQGInv(mkgs(queue)), fininvdeq(pcf), ∀ tid2. alsf(tid2) = mkls(lsf(tid2).tid, lsf(tid2).ival, lsf(tid2).oval, lsf(tid2).value, lsf(tid2).optval) ∧ apcf(tid2) = bwabspcf((pcf(tid2) = idle ⊃ idle;crashed)), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦

User applied rule structural induction

And closed the goal!

Rule argument

term: pcf(tid0)

Additional information

Used simplifier rules: DQPC freely generated by crashed, idle, invDeq, invEnq, ready, resDeq, resEnq;; ⊦ idle ≠ resEnq; (s) ⊦ bwabspcf(crashed) = crashed; (s) ⊦ bwabspcf(resEnq) = resEnq; (s) ⊦ idle ≠ resEnq; (s) ⊦ idle ≠ resDeq; (s) ⊦ bwabspcf(resDeq) = resDeq; (s) ⊦ idle ≠ resDeq; (s) ⊦ idle ≠ ready; (s) ⊦ bwabspcf(ready) = ready; (s) ⊦ idle ≠ ready; (s) ⊦ idle ≠ invEnq; (s) ⊦ bwabspcf(invEnq) = invEnq; (s) ⊦ idle ≠ invEnq; (s) ⊦ idle ≠ invDeq; (s) ⊦ bwabspcf(invDeq) = invDeq; (s) ⊦ idle ≠ invDeq; (s) ⊦ bwabspcf(idle) = idle; (s) ⊦ crashed ≠ idle; (s) ⊦ crashed ≠ idle; (s)

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

mkstate(gs0, lsf0, pcf0) = mkstate(gstepf(gs, lsf(tid), pcf(tid), ca), lsf(tid; lstepf(gs, lsf(tid), pcf(tid), ca)), pcf(tid; pcstepf(gs, lsf(tid), pcf(tid), ca))), ca ≠ globalCrash, DQInv(gs, lsf, pcf), bwabs(mkstate(gs0, lsf0, pcf0), durqs0), fininvdeq(pcf), pre(gs, lsf(tid), pcf(tid), ca) ⊦ (∃ tid. ca = CheckEmp(tid) ⊃ (durqs0.pcf(ca.tid) = resDeq ⊃ ADoDeq(ca.tid);τ);bwabsa(ca)) = τ, ∃ durqs. DurQstep(durqs, (∃ tid. ca = CheckEmp(tid) ⊃ (durqs0.pcf(ca.tid) = resDeq ⊃ ADoDeq(ca.tid);τ);bwabsa(ca)), durqs0) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

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 29 from proof bwsim-step-nontau (previous step) (back to tree)

ca ≠ globalCrash, DQInv(gs, lsf, pcf), bwabs (mkstate(gstepf(gs, lsf(tid), pcf(tid), ca), lsf(tid; lstepf(gs, lsf(tid), pcf(tid), ca)), pcf(tid; pcstepf(gs, lsf(tid), pcf(tid), ca))), durqs0), fininvdeq(pcf), pre(gs, lsf(tid), pcf(tid), ca) ⊦ (∃ tid. ca = CheckEmp(tid) ⊃ (durqs0.pcf(ca.tid) = resDeq ⊃ ADoDeq(ca.tid);τ);bwabsa(ca)) = τ, ∃ durqs. DurQstep(durqs, (∃ tid. ca = CheckEmp(tid) ⊃ (durqs0.pcf(ca.tid) = resDeq ⊃ ADoDeq(ca.tid);τ);bwabsa(ca)), durqs0) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

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 30 from proof bwsim-step-nontau (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 31 from proof bwsim-step-nontau (previous step) (back to tree)

ca ≠ globalCrash, DQGInv(gs), bwabs (mkstate(gstepf(gs, lsf(tid), pcf(tid), ca), lsf(tid; lstepf(gs, lsf(tid), pcf(tid), ca)), pcf(tid; pcstepf(gs, lsf(tid), pcf(tid), ca))), durqs0), fininvdeq(pcf), pre(gs, lsf(tid), pcf(tid), ca), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ (∃ tid. ca = CheckEmp(tid) ⊃ (durqs0.pcf(ca.tid) = resDeq ⊃ ADoDeq(ca.tid);τ);bwabsa(ca)) = τ, ∃ durqs. DurQstep(durqs, (∃ tid. ca = CheckEmp(tid) ⊃ (durqs0.pcf(ca.tid) = resDeq ⊃ ADoDeq(ca.tid);τ);bwabsa(ca)), durqs0) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 6 terms: ca.tid abort: F discard: F computed: F

Additional information

Used terms: ca.tid

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

lsf(ca.tid).tid = ca.tid, ca ≠ globalCrash, DQGInv(gs), DQLInv(gs, lsf(ca.tid), pcf(ca.tid)), bwabs (mkstate(gstepf(gs, lsf(tid), pcf(tid), ca), lsf(tid; lstepf(gs, lsf(tid), pcf(tid), ca)), pcf(tid; pcstepf(gs, lsf(tid), pcf(tid), ca))), durqs0), fininvdeq(pcf), pre(gs, lsf(tid), pcf(tid), ca), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ (∃ tid. ca = CheckEmp(tid) ⊃ (durqs0.pcf(ca.tid) = resDeq ⊃ ADoDeq(ca.tid);τ);bwabsa(ca)) = τ, ∃ durqs. DurQstep(durqs, (∃ tid. ca = CheckEmp(tid) ⊃ (durqs0.pcf(ca.tid) = resDeq ⊃ ADoDeq(ca.tid);τ);bwabsa(ca)), durqs0) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

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(ca.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(ca.tid), oval, tid0, optval

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

lsf(ca.tid) = mkls(tid0, obsEmpty, val, optval, val0, optval0), tid0 = ca.tid, ca ≠ globalCrash, DQGInv(gs), DQLInv(gs, lsf(ca.tid), pcf(ca.tid)), bwabs (mkstate(gstepf(gs, lsf(tid), pcf(tid), ca), lsf(tid; lstepf(gs, lsf(tid), pcf(tid), ca)), pcf(tid; pcstepf(gs, lsf(tid), pcf(tid), ca))), durqs0), fininvdeq(pcf), pre(gs, lsf(tid), pcf(tid), ca), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ (∃ tid. ca = CheckEmp(tid) ⊃ (durqs0.pcf(ca.tid) = resDeq ⊃ ADoDeq(ca.tid);τ);bwabsa(ca)) = τ, ∃ durqs. DurQstep(durqs, (∃ tid. ca = CheckEmp(tid) ⊃ (durqs0.pcf(ca.tid) = resDeq ⊃ ADoDeq(ca.tid);τ);bwabsa(ca)), durqs0) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

lsf(ca.tid) = mkls(ca.tid, obsEmpty, val, optval, val0, optval0), ca ≠ globalCrash, DQGInv(gs), DQLInv(gs, mkls(ca.tid, obsEmpty, val, optval, val0, optval0), pcf(ca.tid)), bwabs (mkstate(gstepf(gs, lsf(tid), pcf(tid), ca), lsf(tid; lstepf(gs, lsf(tid), pcf(tid), ca)), pcf(tid; pcstepf(gs, lsf(tid), pcf(tid), ca))), durqs0), fininvdeq(pcf), pre(gs, lsf(tid), pcf(tid), ca), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ (∃ tid. ca = CheckEmp(tid) ⊃ (durqs0.pcf(ca.tid) = resDeq ⊃ ADoDeq(ca.tid);τ);bwabsa(ca)) = τ, ∃ durqs. DurQstep(durqs, (∃ tid. ca = CheckEmp(tid) ⊃ (durqs0.pcf(ca.tid) = resDeq ⊃ ADoDeq(ca.tid);τ);bwabsa(ca)), durqs0) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: durqs0

Additional information

Used simplifier rules: DurQState freely generated by mkstate;;

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

durqs0 = mkstate(ags, alsf, apcf), lsf(ca.tid) = mkls(ca.tid, obsEmpty, val, optval, val0, optval0), ca ≠ globalCrash, DQGInv(gs), DQLInv(gs, mkls(ca.tid, obsEmpty, val, optval, val0, optval0), pcf(ca.tid)), bwabs (mkstate(gstepf(gs, lsf(tid), pcf(tid), ca), lsf(tid; lstepf(gs, lsf(tid), pcf(tid), ca)), pcf(tid; pcstepf(gs, lsf(tid), pcf(tid), ca))), durqs0), fininvdeq(pcf), pre(gs, lsf(tid), pcf(tid), ca), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ (∃ tid. ca = CheckEmp(tid) ⊃ (durqs0.pcf(ca.tid) = resDeq ⊃ ADoDeq(ca.tid);τ);bwabsa(ca)) = τ, ∃ durqs. DurQstep(durqs, (∃ tid. ca = CheckEmp(tid) ⊃ (durqs0.pcf(ca.tid) = resDeq ⊃ ADoDeq(ca.tid);τ);bwabsa(ca)), durqs0) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ mkstate(gstate, lsf, pcf).pcf = pcf; (s)

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

lsf(ca.tid) = mkls(ca.tid, obsEmpty, val, optval, val0, optval0), ca ≠ globalCrash, DQGInv(gs), DQLInv(gs, mkls(ca.tid, obsEmpty, val, optval, val0, optval0), pcf(ca.tid)), bwabs (mkstate(gstepf(gs, lsf(tid), pcf(tid), ca), lsf(tid; lstepf(gs, lsf(tid), pcf(tid), ca)), pcf(tid; pcstepf(gs, lsf(tid), pcf(tid), ca))), mkstate(ags, alsf, apcf)), fininvdeq(pcf), pre(gs, lsf(tid), pcf(tid), ca), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ (∃ tid. ca = CheckEmp(tid) ⊃ (apcf(ca.tid) = resDeq ⊃ ADoDeq(ca.tid);τ);bwabsa(ca)) = τ, ∃ durqs. DurQstep(durqs, (∃ tid. ca = CheckEmp(tid) ⊃ (apcf(ca.tid) = resDeq ⊃ ADoDeq(ca.tid);τ);bwabsa(ca)), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: ca

Additional information

Used simplifier rules: DQAction freely generated by globalCrash, τ, CheckEmp, DoDeq, DoDeqEmpty, DoEnq, InvDeq, InvEnq, RetDeq, RetEnq, callRun ;; ⊦ DoDeqEmpty(tid) ≠ globalCrash; (s) ⊦ DoDeqEmpty(tid).tid = tid; (s) ⊦ CheckEmp(tid) ≠ DoDeqEmpty(tid0); (s) ⊦ bwabsa(DoDeqEmpty(tid)) = τ; (s) ⊦ globalCrash ≠ τ; (s) ⊦ CheckEmp(tid) ≠ τ; (s) ⊦ bwabsa(τ) = τ; (s)

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

ca = CheckEmp(tid0), lsf(ca.tid) = mkls(ca.tid, obsEmpty, val, optval, val0, optval0), ca ≠ globalCrash, DQGInv(gs), DQLInv(gs, mkls(ca.tid, obsEmpty, val, optval, val0, optval0), pcf(ca.tid)), bwabs (mkstate(gstepf(gs, lsf(tid), pcf(tid), ca), lsf(tid; lstepf(gs, lsf(tid), pcf(tid), ca)), pcf(tid; pcstepf(gs, lsf(tid), pcf(tid), ca))), mkstate(ags, alsf, apcf)), fininvdeq(pcf), pre(gs, lsf(tid), pcf(tid), ca), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ (∃ tid. ca = CheckEmp(tid) ⊃ (apcf(ca.tid) = resDeq ⊃ ADoDeq(ca.tid);τ);bwabsa(ca)) = τ, ∃ durqs. DurQstep(durqs, (∃ tid. ca = CheckEmp(tid) ⊃ (apcf(ca.tid) = resDeq ⊃ ADoDeq(ca.tid);τ);bwabsa(ca)), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ADoDeq(tid) ≠ τ; (s) ⊦ CheckEmp(tid).tid = tid; (s) ⊦ CheckEmp(tid) = CheckEmp(tid0) ↔ tid = tid0; (s) ⊦ CheckEmp(tid) ≠ globalCrash; (s)

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

apcf(tid0) = resDeq, lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), DQGInv(gs), DQLInv(gs, mkls(tid0, obsEmpty, val, optval, val0, optval0), pcf(tid0)), bwabs (mkstate (gstepf(gs, lsf(tid), pcf(tid), CheckEmp(tid0)), lsf(tid; lstepf(gs, lsf(tid), pcf(tid), CheckEmp(tid0))), pcf(tid; pcstepf(gs, lsf(tid), pcf(tid), CheckEmp(tid0)))), mkstate(ags, alsf, apcf)), fininvdeq(pcf), pre(gs, lsf(tid), pcf(tid), CheckEmp(tid0)), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ ∃ durqs. DurQstep(durqs, ADoDeq(tid0), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

User applied rule structural induction

And obtained the following new goals

Rule argument

term: pcf(tid)

Additional information

Used simplifier rules: DQPC freely generated by crashed, idle, invDeq, invEnq, ready, resDeq, resEnq;; ⊦ pre(gs, ls, resEnq, a) ↔ a = RetEnq(ls.tid); (s) ⊦ CheckEmp(tid) ≠ RetEnq(tid0); (s) ⊦ pre(gs, ls, resDeq, a) ↔ a = RetDeq(ls.tid, ls.oval); (s) ⊦ CheckEmp(tid) ≠ RetDeq(tid0, optval); (s) ⊦ gstepf(gs, ls, ready, a) = gs; (s) ⊦ pre(gs, ls, ready, a) ↔ (∃ value. a = InvEnq(ls.tid, value)) ∨ a = InvDeq(ls.tid); (s) ⊦ CheckEmp(tid) ≠ InvEnq(tid0, val); (s) ⊦ CheckEmp(tid) ≠ InvDeq(tid0); (s) ⊦ pre(gs, ls, invEnq, a) ↔ a = DoEnq(ls.tid); (s) ⊦ CheckEmp(tid) ≠ DoEnq(tid0); (s) ⊦ pre(gs, ls, idle, a) ↔ a = callRun(ls.tid); (s) ⊦ CheckEmp(tid) ≠ callRun(tid0); (s) ⊦ pre(gs, ls, crashed, a) ↔ false; (s)

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

apcf(tid0) = resDeq, invDeq = pcf(tid), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), DQGInv(gs), DQLInv(gs, mkls(tid0, obsEmpty, val, optval, val0, optval0), pcf(tid0)), bwabs (mkstate (gstepf(gs, lsf(tid), pcf(tid), CheckEmp(tid0)), lsf(tid; lstepf(gs, lsf(tid), pcf(tid), CheckEmp(tid0))), pcf(tid; pcstepf(gs, lsf(tid), pcf(tid), CheckEmp(tid0)))), mkstate(ags, alsf, apcf)), fininvdeq(pcf), pre(gs, lsf(tid), pcf(tid), CheckEmp(tid0)), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ ∃ durqs. DurQstep(durqs, ADoDeq(tid0), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ pcstepf(gs, ls, invDeq, CheckEmp(ls.tid)) = invDeq; (s) ⊦ lstepf(gs, ls, invDeq, CheckEmp(ls.tid)) = ls.obsEmpty:= true; (s) ⊦ gstepf(gs, ls, invDeq, CheckEmp(ls.tid)) = gs; (s) ⊦ CheckEmp(tid) ≠ DoDeq(tid0); (s) ⊦ CheckEmp(tid) ≠ DoDeqEmpty(tid0); (s) ⊦ CheckEmp(tid) = CheckEmp(tid0) ↔ tid = tid0; (s) ⊦ pre(gs, ls, invDeq, a) ↔ a = CheckEmp(ls.tid) ∧ gs.queue = [] ∨ a = DoDeqEmpty(ls.tid) ∧ ls.obsEmpty ∨ a = DoDeq(ls.tid) ∧ gs.queue ≠ []; (s)

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

gs.queue = [], apcf(lsf(tid).tid) = resDeq, invDeq = pcf(tid), lsf(lsf(tid).tid) = mkls(lsf(tid).tid, obsEmpty, val, optval, val0, optval0), DQGInv(gs), DQLInv(gs, mkls(lsf(tid).tid, obsEmpty, val, optval, val0, optval0), pcf(lsf(tid).tid)), bwabs(mkstate(gs, lsf(tid; lsf(tid).obsEmpty:= true), pcf(tid; invDeq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ ∃ durqs. DurQstep(durqs, ADoDeq(lsf(tid).tid), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

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, obsEmpty0, lsf(tid), optval1, tid0, 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, obsEmpty0, lsf(tid), oval, tid0, optval1

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

gs.queue = [], apcf(tid0) = resDeq, invDeq = pcf(tid), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), DQGInv(gs), DQLInv(gs, mkls(tid0, obsEmpty, val, optval, val0, optval0), pcf(tid0)), bwabs(mkstate(gs, lsf(tid; lsf(tid).obsEmpty:= true), pcf(tid; invDeq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ ∃ durqs. DurQstep(durqs, ADoDeq(tid0), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

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

gs.queue = [], apcf(tid0) = resDeq, invDeq = pcf(tid), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), DQGInv(gs), DQLInv(gs, mkls(tid0, obsEmpty, val, optval, val0, optval0), pcf(tid0)), bwabs(mkstate(gs, lsf(tid; mkls(tid0, true, val1, optval1, val2, optval2)), pcf(tid; invDeq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ ∃ durqs. DurQstep(durqs, ADoDeq(tid0), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

User applied rule all left

And obtained the following new goals

Rule argument

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

Additional information

Used terms: tid

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

gs.queue = [], lsf(tid).tid = tid, apcf(tid0) = resDeq, invDeq = pcf(tid), lsf(tid) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), DQGInv(gs), DQLInv(gs, mkls(tid0, obsEmpty, val, optval, val0, optval0), pcf(tid0)), DQLInv(gs, lsf(tid), pcf(tid)), bwabs(mkstate(gs, lsf(tid; mkls(tid0, true, val1, optval1, val2, optval2)), pcf(tid; invDeq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ ∃ durqs. DurQstep(durqs, ADoDeq(tid0), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

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

gs.queue = [], apcf(tid0) = resDeq, invDeq = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), DQGInv(gs), DQLInv(gs, mkls(tid0, obsEmpty, val, optval, val0, optval0), invDeq), bwabs(mkstate(gs, lsf(tid0; mkls(tid0, true, val, optval, val0, optval0)), pcf(tid0; invDeq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ ∃ durqs. DurQstep(durqs, ADoDeq(tid0), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

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 45 from proof bwsim-step-nontau (previous step) (back to tree)

apcf(tid0) = resDeq, gs = mkgs(queue), invDeq = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), queue = [], DQGInv(gs), DQLInv(gs, mkls(tid0, obsEmpty, val, optval, val0, optval0), invDeq), bwabs(mkstate(gs, lsf(tid0; mkls(tid0, true, val, optval, val0, optval0)), pcf(tid0; invDeq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ ∃ durqs. DurQstep(durqs, ADoDeq(tid0), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

apcf(tid0) = resDeq, invDeq = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), DQGInv(mkgs([])), DQLInv(mkgs([]), mkls(tid0, obsEmpty, val, optval, val0, optval0), invDeq), bwabs(mkstate(mkgs([]), lsf(tid0; mkls(tid0, true, val, optval, val0, optval0)), pcf(tid0; invDeq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs([]), lsf(tid), pcf(tid)) ⊦ ∃ durqs. DurQstep(durqs, ADoDeq(tid0), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(mkgs([]), lsf, pcf), durqs)

User applied rule exists right

And obtained the following new goals

Rule argument

pos: right 1 terms: mkstate(mkdgs([]), alsf(tid0; bwlabsf(lsf(tid0))), apcf(tid0; invDeq)) abort: F discard: T computed: F

Additional information

Used terms: mkstate(mkdgs([]), alsf(tid0; bwlabsf(lsf(tid0))), apcf(tid0; invDeq))

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

apcf(tid0) = resDeq, invDeq = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), DQGInv(mkgs([])), DQLInv(mkgs([]), mkls(tid0, obsEmpty, val, optval, val0, optval0), invDeq), bwabs(mkstate(mkgs([]), lsf(tid0; mkls(tid0, true, val, optval, val0, optval0)), pcf(tid0; invDeq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs([]), lsf(tid), pcf(tid)) ⊦ DurQstep(mkstate(mkdgs([]), alsf(tid0; bwlabsf(lsf(tid0))), apcf(tid0; invDeq)), ADoDeq(tid0), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(mkgs([]), lsf, pcf), mkstate(mkdgs([]), alsf(tid0; bwlabsf(lsf(tid0))), apcf(tid0; invDeq)))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).optval = oval0; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).value = ival0; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).oval = oval; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).ival = ival; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).tid = tid; (s) ⊦ invDeq ≠ resDeq; (s) ⊦ mkdgs(queue) = mkdgs(queue0) ↔ queue = queue0; (s) ⊦ mkgs(queue).queue = queue; (s) ⊦ bwabs(mkstate(gs, lsf, pcf), mkstate(ags, alsf, apcf)) → ( bwabs(mkstate(gs0, lsf0, pcf0), mkstate(ags0, alsf0, apcf0)) ↔ ags = mkdgs(gs.queue) → ags0 = mkdgs(gs0.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 → alsf0(tid) = mkls (lsf0(tid).tid, lsf0(tid).ival, lsf0(tid).oval, lsf0(tid).value, lsf0(tid).optval) ∧ apcf0(tid) = bwabspcf(pcf0(tid)) ∨ alsf0(tid) = mkls (lsf0(tid).tid, lsf0(tid).ival, Empty, lsf0(tid).value, lsf0(tid).optval) ∧ pcf0(tid) = invDeq ∧ apcf0(tid) = resDeq ∧ lsf0(tid).obsEmpty)); (s) ⊦ bwlabsf(ls) = mkls(ls.tid, ls.ival, ls.oval, ls.value, ls.optval); (s)

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

apcf(tid0) = resDeq, invDeq = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), DQGInv(mkgs([])), DQLInv(mkgs([]), mkls(tid0, obsEmpty, val, optval, val0, optval0), invDeq), bwabs(mkstate(mkgs([]), lsf(tid0; mkls(tid0, true, val, optval, val0, optval0)), pcf(tid0; invDeq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs([]), lsf(tid), pcf(tid)) ⊦ DurQstep(mkstate(mkdgs([]), alsf(tid0; mkls(tid0, val, optval, val0, optval0)), apcf(tid0; invDeq)), ADoDeq(tid0), mkstate(ags, alsf, apcf)) ∧ ( ags = mkdgs([]) → alsf(tid) = mkls ((tid0 = tid ⊃ mkls(tid, true, val, optval, val0, optval0);lsf(tid)).tid, (tid0 = tid ⊃ mkls(tid, true, val, optval, val0, optval0);lsf(tid)).ival, (tid0 = tid ⊃ mkls(tid, true, val, optval, val0, optval0);lsf(tid)).oval, (tid0 = tid ⊃ mkls(tid, true, val, optval, val0, optval0);lsf(tid)).value, (tid0 = tid ⊃ mkls(tid, true, val, optval, val0, optval0);lsf(tid)).optval) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ invDeq;pcf(tid))) ∨ alsf(tid) = mkls ((tid0 = tid ⊃ mkls(tid, true, val, optval, val0, optval0);lsf(tid)).tid, (tid0 = tid ⊃ mkls(tid, true, val, optval, val0, optval0);lsf(tid)).ival, Empty, (tid0 = tid ⊃ mkls(tid, true, val, optval, val0, optval0);lsf(tid)).value, (tid0 = tid ⊃ mkls(tid, true, val, optval, val0, optval0);lsf(tid)).optval) ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ (tid0 = tid ⊃ mkls(tid, true, val, optval, val0, optval0);lsf(tid)).obsEmpty → (tid0 = tid ⊃ mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval);alsf(tid)) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ (tid0 = tid ⊃ invDeq;apcf(tid)) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ tid0 ≠ tid ∧ resDeq = apcf(tid) ∧ lsf(tid).obsEmpty)

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, obsEmpty0, (tid0 = tid ⊃ mkls(tid, true, val, optval, val0, optval0);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, obsEmpty0, (tid0 = tid ⊃ mkls(tid, true, val, optval, val0, optval0);lsf(tid)), oval, tid1, optval1

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

(tid0 = tid ⊃ mkls(tid, true, val, optval, val0, optval0);lsf(tid)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), apcf(tid0) = resDeq, invDeq = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), DQGInv(mkgs([])), DQLInv(mkgs([]), mkls(tid0, obsEmpty, val, optval, val0, optval0), invDeq), bwabs(mkstate(mkgs([]), lsf(tid0; mkls(tid0, true, val, optval, val0, optval0)), pcf(tid0; invDeq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs([]), lsf(tid), pcf(tid)) ⊦ DurQstep(mkstate(mkdgs([]), alsf(tid0; mkls(tid0, val, optval, val0, optval0)), apcf(tid0; invDeq)), ADoDeq(tid0), mkstate(ags, alsf, apcf)) ∧ ( ags = mkdgs([]) → alsf(tid) = mkls(tid1, val1, optval1, val2, optval2) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ invDeq;pcf(tid))) ∨ alsf(tid) = mkls(tid1, val1, Empty, val2, optval2) ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ obsEmpty0 → (tid0 = tid ⊃ mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval);alsf(tid)) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ (tid0 = tid ⊃ invDeq;apcf(tid)) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ tid0 ≠ tid ∧ resDeq = apcf(tid) ∧ lsf(tid).obsEmpty)

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] → [val4, val3, obsEmpty1, lsf(tid), optval3, tid2, optval4]

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, obsEmpty1, lsf(tid), oval, tid2, optval3

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

(tid0 = tid ⊃ mkls(tid, true, val, optval, val0, optval0);lsf(tid)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), apcf(tid0) = resDeq, invDeq = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), DQGInv(mkgs([])), DQLInv(mkgs([]), mkls(tid0, obsEmpty, val, optval, val0, optval0), invDeq), bwabs(mkstate(mkgs([]), lsf(tid0; mkls(tid0, true, val, optval, val0, optval0)), pcf(tid0; invDeq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs([]), lsf(tid), pcf(tid)) ⊦ DurQstep(mkstate(mkdgs([]), alsf(tid0; mkls(tid0, val, optval, val0, optval0)), apcf(tid0; invDeq)), ADoDeq(tid0), mkstate(ags, alsf, apcf)) ∧ ( ags = mkdgs([]) → alsf(tid) = mkls(tid1, val1, optval1, val2, optval2) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ invDeq;pcf(tid))) ∨ alsf(tid) = mkls(tid1, val1, Empty, val2, optval2) ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ obsEmpty0 → (tid0 = tid ⊃ mkls(tid2, val3, optval3, val4, optval4);alsf(tid)) = mkls(tid2, val3, optval3, val4, optval4) ∧ (tid0 = tid ⊃ invDeq;apcf(tid)) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(tid2, val3, Empty, val4, optval4) ∧ pcf(tid) = invDeq ∧ tid0 ≠ tid ∧ resDeq = apcf(tid) ∧ obsEmpty1)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

(tid0 = tid ⊃ mkls(tid, true, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), apcf(tid0) = resDeq, invDeq = pcf(tid0), lsf(tid) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), DQGInv(mkgs([])), DQLInv(mkgs([]), mkls(tid0, obsEmpty, val, optval, val0, optval0), invDeq), bwabs(mkstate(mkgs([]), lsf(tid0; mkls(tid0, true, val, optval, val0, optval0)), pcf(tid0; invDeq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs([]), lsf(tid), pcf(tid)) ⊦ DurQstep(mkstate(mkdgs([]), alsf(tid0; mkls(tid0, val, optval, val0, optval0)), apcf(tid0; invDeq)), ADoDeq(tid0), mkstate(ags, alsf, apcf)) ∧ ( ags = mkdgs([]) → alsf(tid) = mkls(tid1, val1, optval1, val2, optval2) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ invDeq;pcf(tid))) ∨ alsf(tid) = mkls(tid1, val1, Empty, val2, optval2) ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ obsEmpty0 → (tid0 = tid ⊃ mkls(tid2, val3, optval3, val4, optval4);alsf(tid)) = mkls(tid2, val3, optval3, val4, optval4) ∧ (tid0 = tid ⊃ invDeq;apcf(tid)) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(tid2, val3, Empty, val4, optval4) ∧ pcf(tid) = invDeq ∧ tid0 ≠ tid ∧ resDeq = apcf(tid) ∧ obsEmpty1)

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(tid0; mkls(tid0, true, val, optval, val0, optval0)), ags, pcf(tid0; invDeq), apcf], <all paths>

Additional information

Used terms: mkgs([]), alsf, lsf(tid0; mkls(tid0, true, val, optval, val0, optval0)), ags, pcf(tid0; invDeq), apcf

Proof step 52 from proof bwsim-step-nontau (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 53 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid ⊃ mkls(tid, true, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), ags = mkdgs(mkgs([]).queue), apcf(tid0) = resDeq, invDeq = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), DQGInv(mkgs([])), DQLInv(mkgs([]), mkls(tid0, obsEmpty, val, optval, val0, optval0), invDeq), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs([]), lsf(tid), pcf(tid)), ∀ tid. alsf(tid) = mkls (lsf(tid0; mkls(tid0, true, val, optval, val0, optval0))(tid).tid, lsf(tid0; mkls(tid0, true, val, optval, val0, optval0))(tid).ival, lsf(tid0; mkls(tid0, true, val, optval, val0, optval0))(tid).oval, lsf(tid0; mkls(tid0, true, val, optval, val0, optval0))(tid).value, lsf(tid0; mkls(tid0, true, val, optval, val0, optval0))(tid).optval) ∧ apcf(tid) = bwabspcf(pcf(tid0; invDeq)(tid)) ∨ alsf(tid) = mkls (lsf(tid0; mkls(tid0, true, val, optval, val0, optval0))(tid).tid, lsf(tid0; mkls(tid0, true, val, optval, val0, optval0))(tid).ival, Empty, lsf(tid0; mkls(tid0, true, val, optval, val0, optval0))(tid).value, lsf(tid0; mkls(tid0, true, val, optval, val0, optval0))(tid).optval) ∧ pcf(tid0; invDeq)(tid) = invDeq ∧ apcf(tid) = resDeq ∧ lsf(tid0; mkls(tid0, true, val, optval, val0, optval0))(tid).obsEmpty ⊦ DurQstep(mkstate(mkdgs([]), alsf(tid0; mkls(tid0, val, optval, val0, optval0)), apcf(tid0; invDeq)), ADoDeq(tid0), mkstate(ags, alsf, apcf)) ∧ ( ags = mkdgs([]) → alsf(tid) = mkls(tid1, val1, optval1, val2, optval2) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ invDeq;pcf(tid))) ∨ alsf(tid) = mkls(tid1, val1, Empty, val2, optval2) ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ obsEmpty0 → (tid0 = tid ⊃ mkls(tid2, val3, optval3, val4, optval4);alsf(tid)) = mkls(tid2, val3, optval3, val4, optval4) ∧ (tid0 = tid ⊃ invDeq;apcf(tid)) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(tid2, val3, Empty, val4, optval4) ∧ pcf(tid) = invDeq ∧ tid0 ≠ tid ∧ resDeq = apcf(tid) ∧ obsEmpty1)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ mkdgs(queue) = mkdgs(queue0) ↔ queue = queue0; (s) ⊦ mkgs(queue).queue = queue; (s)

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

(tid0 = tid ⊃ mkls(tid, true, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), apcf(tid0) = resDeq, invDeq = pcf(tid0), lsf(tid) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), DQGInv(mkgs([])), DQLInv(mkgs([]), mkls(tid0, obsEmpty, val, optval, val0, optval0), invDeq), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs([]), lsf(tid), pcf(tid)), ∀ tid3. alsf(tid3) = mkls ((tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).tid, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).ival, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).oval, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).value, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).optval) ∧ apcf(tid3) = bwabspcf((tid0 = tid3 ⊃ invDeq;pcf(tid3))) ∨ alsf(tid3) = mkls ((tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).tid, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).ival, Empty, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).value, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).optval) ∧ invDeq = pcf(tid3) ∧ apcf(tid3) = resDeq ∧ (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).obsEmpty ⊦ DurQstep(mkstate(mkdgs([]), alsf(tid0; mkls(tid0, val, optval, val0, optval0)), apcf(tid0; invDeq)), ADoDeq(tid0), mkstate(mkdgs([]), alsf, apcf)) ∧ ( alsf(tid) = mkls(tid1, val1, optval1, val2, optval2) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ invDeq;pcf(tid))) ∨ alsf(tid) = mkls(tid1, val1, Empty, val2, optval2) ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ obsEmpty0 → (tid0 = tid ⊃ mkls(tid2, val3, optval3, val4, optval4);alsf(tid)) = mkls(tid2, val3, optval3, val4, optval4) ∧ (tid0 = tid ⊃ invDeq;apcf(tid)) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(tid2, val3, Empty, val4, optval4) ∧ pcf(tid) = invDeq ∧ tid0 ≠ tid ∧ resDeq = apcf(tid) ∧ obsEmpty1)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

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

(tid0 = tid ⊃ mkls(tid, true, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), apcf(tid0) = resDeq, invDeq = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), DQGInv(mkgs([])), DQLInv(mkgs([]), mkls(tid0, obsEmpty, val, optval, val0, optval0), invDeq), fininvdeq(pcf), ¬ DurQstep(mkstate(mkdgs([]), alsf(tid0; mkls(tid0, val, optval, val0, optval0)), apcf(tid0; invDeq)), ADoDeq(tid0), mkstate(mkdgs([]), alsf, apcf)), ∀ tid3. alsf(tid3) = mkls ((tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).tid, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).ival, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).oval, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).value, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).optval) ∧ apcf(tid3) = bwabspcf((tid0 = tid3 ⊃ invDeq;pcf(tid3))) ∨ alsf(tid3) = mkls ((tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).tid, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).ival, Empty, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).value, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).optval) ∧ invDeq = pcf(tid3) ∧ apcf(tid3) = resDeq ∧ (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).obsEmpty, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs([]), lsf(tid), pcf(tid)) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DurQ[DurQ-ren], name:DurQstep, seq:⊦ DurQstep(mkstate(gs, lsf, pcf), a, mkstate(gs0, lsf0, pcf0)) ↔ (∃ tid, ls, pc. lstep(gs, lsf(tid), pcf(tid), a, gs0, ls, pc) ∧ lsf0 = lsf(tid; ls) ∧ pcf0 = pcf(tid; pc)) ∨ a = globalACrash ∧ ⟨ACrash(; pcf)⟩ (gs0 = gs ∧ lsf0 = lsf ∧ pcf0 = pcf), subst:[pcf0, lsf0, lsf, gs0, a, gs, pcf] → [apcf, alsf, alsf(tid0; mkls(tid0, val, optval, val0, optval0)), mkdgs([]), ADoDeq(tid0), mkdgs([]), apcf(tid0; invDeq)], <all paths>

Additional information

Used terms: apcf, alsf, alsf(tid0; mkls(tid0, val, optval, val0, optval0)), mkdgs([]), ADoDeq(tid0), mkdgs([]), apcf(tid0; invDeq)

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

⊦ DurQstep(mkstate(gs, lsf, pcf), a, mkstate(gs0, lsf0, pcf0)) ↔ (∃ tid, ls, pc. lstep(gs, lsf(tid), pcf(tid), a, gs0, ls, pc) ∧ lsf0 = lsf(tid; ls) ∧ pcf0 = pcf(tid; pc)) ∨ a = globalACrash ∧ ⟨ACrash(; pcf)⟩ (gs0 = gs ∧ lsf0 = lsf ∧ pcf0 = pcf)

A spec-lemma

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

a ≠ globalACrash ∨ ¬ ⟨ACrash(; apcf1)⟩ (ags = ags0 ∧ alsf0 = alsf1 ∧ apcf0 = apcf1), (tid0 = tid ⊃ mkls(tid, true, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), a = ADoDeq(tid0), ags = mkdgs([]), ags0 = mkdgs([]), alsf0 = alsf, alsf1 = alsf(tid0; mkls(tid0, val, optval, val0, optval0)), apcf(tid0) = resDeq, apcf0 = apcf, apcf1 = apcf(tid0; invDeq), invDeq = pcf(tid0), lsf(tid) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), DQGInv(mkgs([])), DQLInv(mkgs([]), mkls(tid0, obsEmpty, val, optval, val0, optval0), invDeq), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs([]), lsf(tid), pcf(tid)), ∀ tid3. alsf(tid3) = mkls ((tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).tid, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).ival, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).oval, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).value, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).optval) ∧ apcf(tid3) = bwabspcf((tid0 = tid3 ⊃ invDeq;pcf(tid3))) ∨ alsf(tid3) = mkls ((tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).tid, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).ival, Empty, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).value, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).optval) ∧ invDeq = pcf(tid3) ∧ apcf(tid3) = resDeq ∧ (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).obsEmpty, ∀ tid, als, apc. ¬(lstep(ags0, alsf1(tid), apcf1(tid), a, ags, als, apc) ∧ alsf0 = alsf1(tid; als) ∧ apcf0 = apcf1(tid; apc)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ADoDeq(tid) ≠ globalACrash; (s) ⊦ lstep(gs, ls, pc, a, gs0, ls0, pc0) ↔ pre(gs, ls, pc, a) ∧ ls0 = lstepf(gs, ls, pc, a) ∧ gs0 = gstepf(gs, ls, pc, a) ∧ pc0 = pcstepf(gs, ls, pc, a); (s)

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

(tid0 = tid ⊃ mkls(tid, true, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), apcf(tid0) = resDeq, invDeq = pcf(tid0), lsf(tid) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), DQGInv(mkgs([])), DQLInv(mkgs([]), mkls(tid0, obsEmpty, val, optval, val0, optval0), invDeq), fininvdeq(pcf), ∀ tid3. ¬ pre(mkdgs([]), (tid0 = tid3 ⊃ mkls(tid3, val, optval, val0, optval0);alsf(tid3)), (tid0 = tid3 ⊃ invDeq;apcf(tid3)), ADoDeq(tid0)) ∨ mkdgs([]) ≠ gstepf(mkdgs([]), (tid0 = tid3 ⊃ mkls(tid3, val, optval, val0, optval0);alsf(tid3)), (tid0 = tid3 ⊃ invDeq;apcf(tid3)), ADoDeq(tid0)) ∨ alsf ≠ alsf(tid0; mkls(tid0, val, optval, val0, optval0)) (tid3; lstepf(mkdgs([]), (tid0 = tid3 ⊃ mkls(tid3, val, optval, val0, optval0);alsf(tid3)), (tid0 = tid3 ⊃ invDeq;apcf(tid3)), ADoDeq(tid0))) ∨ apcf ≠ apcf(tid0; invDeq) (tid3; pcstepf(mkdgs([]), (tid0 = tid3 ⊃ mkls(tid3, val, optval, val0, optval0);alsf(tid3)), (tid0 = tid3 ⊃ invDeq;apcf(tid3)), ADoDeq(tid0))), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs([]), lsf(tid), pcf(tid)), ∀ tid3. alsf(tid3) = mkls ((tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).tid, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).ival, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).oval, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).value, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).optval) ∧ apcf(tid3) = bwabspcf((tid0 = tid3 ⊃ invDeq;pcf(tid3))) ∨ alsf(tid3) = mkls ((tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).tid, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).ival, Empty, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).value, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).optval) ∧ invDeq = pcf(tid3) ∧ apcf(tid3) = resDeq ∧ (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).obsEmpty ⊦

User applied rule all left

And obtained the following new goals

Rule argument

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

Additional information

Used terms: tid

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

lsf(tid).tid = tid, (tid0 = tid ⊃ mkls(tid, true, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), apcf(tid0) = resDeq, invDeq = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), DQGInv(mkgs([])), DQLInv(mkgs([]), mkls(tid0, obsEmpty, val, optval, val0, optval0), invDeq), DQLInv(mkgs([]), lsf(tid), pcf(tid)), fininvdeq(pcf), ∀ tid3. alsf(tid3) = mkls ((tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).tid, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).ival, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).oval, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).value, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).optval) ∧ apcf(tid3) = bwabspcf((tid0 = tid3 ⊃ invDeq;pcf(tid3))) ∨ alsf(tid3) = mkls ((tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).tid, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).ival, Empty, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).value, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).optval) ∧ invDeq = pcf(tid3) ∧ apcf(tid3) = resDeq ∧ (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).obsEmpty, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs([]), lsf(tid), pcf(tid)), ∀ tid3. ¬ pre(mkdgs([]), (tid0 = tid3 ⊃ mkls(tid3, val, optval, val0, optval0);alsf(tid3)), (tid0 = tid3 ⊃ invDeq;apcf(tid3)), ADoDeq(tid0)) ∨ mkdgs([]) ≠ gstepf(mkdgs([]), (tid0 = tid3 ⊃ mkls(tid3, val, optval, val0, optval0);alsf(tid3)), (tid0 = tid3 ⊃ invDeq;apcf(tid3)), ADoDeq(tid0)) ∨ alsf ≠ alsf(tid0; mkls(tid0, val, optval, val0, optval0)) (tid3; lstepf(mkdgs([]), (tid0 = tid3 ⊃ mkls(tid3, val, optval, val0, optval0);alsf(tid3)), (tid0 = tid3 ⊃ invDeq;apcf(tid3)), ADoDeq(tid0))) ∨ apcf ≠ apcf(tid0; invDeq) (tid3; pcstepf(mkdgs([]), (tid0 = tid3 ⊃ mkls(tid3, val, optval, val0, optval0);alsf(tid3)), (tid0 = tid3 ⊃ invDeq;apcf(tid3)), ADoDeq(tid0))) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

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

(tid0 = tid2 ⊃ mkls(tid2, true, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), apcf(tid0) = resDeq, invDeq = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), DQGInv(mkgs([])), DQLInv(mkgs([]), mkls(tid0, obsEmpty, val, optval, val0, optval0), invDeq), DQLInv(mkgs([]), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), fininvdeq(pcf), ∀ tid3. alsf(tid3) = mkls ((tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).tid, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).ival, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).oval, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).value, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).optval) ∧ apcf(tid3) = bwabspcf((tid0 = tid3 ⊃ invDeq;pcf(tid3))) ∨ alsf(tid3) = mkls ((tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).tid, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).ival, Empty, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).value, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).optval) ∧ invDeq = pcf(tid3) ∧ apcf(tid3) = resDeq ∧ (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).obsEmpty, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs([]), lsf(tid), pcf(tid)), ∀ tid3. ¬ pre(mkdgs([]), (tid0 = tid3 ⊃ mkls(tid3, val, optval, val0, optval0);alsf(tid3)), (tid0 = tid3 ⊃ invDeq;apcf(tid3)), ADoDeq(tid0)) ∨ mkdgs([]) ≠ gstepf(mkdgs([]), (tid0 = tid3 ⊃ mkls(tid3, val, optval, val0, optval0);alsf(tid3)), (tid0 = tid3 ⊃ invDeq;apcf(tid3)), ADoDeq(tid0)) ∨ alsf ≠ alsf(tid0; mkls(tid0, val, optval, val0, optval0)) (tid3; lstepf(mkdgs([]), (tid0 = tid3 ⊃ mkls(tid3, val, optval, val0, optval0);alsf(tid3)), (tid0 = tid3 ⊃ invDeq;apcf(tid3)), ADoDeq(tid0))) ∨ apcf ≠ apcf(tid0; invDeq) (tid3; pcstepf(mkdgs([]), (tid0 = tid3 ⊃ mkls(tid3, val, optval, val0, optval0);alsf(tid3)), (tid0 = tid3 ⊃ invDeq;apcf(tid3)), ADoDeq(tid0))) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

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

Additional information

Used terms: tid0

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

(tid0 = tid2 ⊃ mkls(tid2, true, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), apcf(tid0) = resDeq, invDeq = pcf(tid0), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), DQGInv(mkgs([])), DQLInv(mkgs([]), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), DQLInv(mkgs([]), mkls(tid0, obsEmpty, val, optval, val0, optval0), invDeq), fininvdeq(pcf), ∀ tid3. ¬ pre(mkdgs([]), (tid0 = tid3 ⊃ mkls(tid3, val, optval, val0, optval0);alsf(tid3)), (tid0 = tid3 ⊃ invDeq;apcf(tid3)), ADoDeq(tid0)) ∨ mkdgs([]) ≠ gstepf(mkdgs([]), (tid0 = tid3 ⊃ mkls(tid3, val, optval, val0, optval0);alsf(tid3)), (tid0 = tid3 ⊃ invDeq;apcf(tid3)), ADoDeq(tid0)) ∨ alsf ≠ alsf(tid0; mkls(tid0, val, optval, val0, optval0)) (tid3; lstepf(mkdgs([]), (tid0 = tid3 ⊃ mkls(tid3, val, optval, val0, optval0);alsf(tid3)), (tid0 = tid3 ⊃ invDeq;apcf(tid3)), ADoDeq(tid0))) ∨ apcf ≠ apcf(tid0; invDeq) (tid3; pcstepf(mkdgs([]), (tid0 = tid3 ⊃ mkls(tid3, val, optval, val0, optval0);alsf(tid3)), (tid0 = tid3 ⊃ invDeq;apcf(tid3)), ADoDeq(tid0))), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs([]), lsf(tid), pcf(tid)), ∀ tid3. alsf(tid3) = mkls ((tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).tid, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).ival, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).oval, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).value, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).optval) ∧ apcf(tid3) = bwabspcf((tid0 = tid3 ⊃ invDeq;pcf(tid3))) ∨ alsf(tid3) = mkls ((tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).tid, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).ival, Empty, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).value, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).optval) ∧ invDeq = pcf(tid3) ∧ apcf(tid3) = resDeq ∧ (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).obsEmpty, ¬ pre(mkdgs([]), (tid0 = tid0 ⊃ mkls(tid0, val, optval, val0, optval0);alsf(tid0)), (tid0 = tid0 ⊃ invDeq;apcf(tid0)), ADoDeq(tid0)) ∨ mkdgs([]) ≠ gstepf(mkdgs([]), (tid0 = tid0 ⊃ mkls(tid0, val, optval, val0, optval0);alsf(tid0)), (tid0 = tid0 ⊃ invDeq;apcf(tid0)), ADoDeq(tid0)) ∨ alsf ≠ alsf(tid0; mkls(tid0, val, optval, val0, optval0)) (tid0; lstepf(mkdgs([]), (tid0 = tid0 ⊃ mkls(tid0, val, optval, val0, optval0);alsf(tid0)), (tid0 = tid0 ⊃ invDeq;apcf(tid0)), ADoDeq(tid0))) ∨ apcf ≠ apcf(tid0; invDeq) (tid0; pcstepf(mkdgs([]), (tid0 = tid0 ⊃ mkls(tid0, val, optval, val0, optval0);alsf(tid0)), (tid0 = tid0 ⊃ invDeq;apcf(tid0)), ADoDeq(tid0))) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ pcstepf(gs, mkls(tid, ival, oval, value, optval), invDeq, ADoDeq(tid)) = resDeq; (s) ⊦ mkdgs(queue).queue = queue; (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) ⊦ mkdgs(queue) = mkdgs(queue0) ↔ queue = queue0; (s) ⊦ gstepf(gs, mkls(tid, ival, oval, value, optval), invDeq, ADoDeq(tid)) = (gs.queue = [] ⊃ gs;gs.queue:= gs.queue.tail); (s) ⊦ ADoDeq(tid) = ADoDeq(tid0) ↔ tid = tid0; (s) ⊦ mkls(tid, ival, oval, ival0, oval0).tid = tid; (s) ⊦ pre(gs, ls, invDeq, a) ↔ a = ADoDeq(ls.tid); (s)

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

(tid0 = tid2 ⊃ mkls(tid2, true, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), apcf(tid0) = resDeq, invDeq = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), DQGInv(mkgs([])), DQLInv(mkgs([]), mkls(tid0, obsEmpty, val, optval, val0, optval0), invDeq), DQLInv(mkgs([]), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), fininvdeq(pcf), ∀ tid3. alsf(tid3) = mkls ((tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).tid, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).ival, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).oval, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).value, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).optval) ∧ apcf(tid3) = bwabspcf((tid0 = tid3 ⊃ invDeq;pcf(tid3))) ∨ alsf(tid3) = mkls ((tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).tid, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).ival, Empty, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).value, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).optval) ∧ invDeq = pcf(tid3) ∧ apcf(tid3) = resDeq ∧ (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).obsEmpty, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs([]), lsf(tid), pcf(tid)), ∀ tid3. ¬ pre(mkdgs([]), (tid0 = tid3 ⊃ mkls(tid3, val, optval, val0, optval0);alsf(tid3)), (tid0 = tid3 ⊃ invDeq;apcf(tid3)), ADoDeq(tid0)) ∨ mkdgs([]) ≠ gstepf(mkdgs([]), (tid0 = tid3 ⊃ mkls(tid3, val, optval, val0, optval0);alsf(tid3)), (tid0 = tid3 ⊃ invDeq;apcf(tid3)), ADoDeq(tid0)) ∨ alsf ≠ alsf(tid0; mkls(tid0, val, optval, val0, optval0)) (tid3; lstepf(mkdgs([]), (tid0 = tid3 ⊃ mkls(tid3, val, optval, val0, optval0);alsf(tid3)), (tid0 = tid3 ⊃ invDeq;apcf(tid3)), ADoDeq(tid0))) ∨ apcf ≠ apcf(tid0; invDeq) (tid3; pcstepf(mkdgs([]), (tid0 = tid3 ⊃ mkls(tid3, val, optval, val0, optval0);alsf(tid3)), (tid0 = tid3 ⊃ invDeq;apcf(tid3)), ADoDeq(tid0))), alsf ≠ alsf(tid0; mkls(tid0, val, optval, val0, optval0))(tid0; mkls(tid0, val, Empty, val0, optval0)) ∨ apcf ≠ apcf(tid0; invDeq)(tid0; resDeq) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 13

Additional information

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

(tid0 = tid2 ⊃ mkls(tid2, true, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), apcf(tid0) = resDeq, invDeq = pcf(tid0), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), alsf ≠ alsf(tid0; mkls(tid0, val, optval, val0, optval0))(tid0; mkls(tid0, val, Empty, val0, optval0)), DQGInv(mkgs([])), DQLInv(mkgs([]), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), DQLInv(mkgs([]), mkls(tid0, obsEmpty, val, optval, val0, optval0), invDeq), fininvdeq(pcf), ∀ tid3. ¬ pre(mkdgs([]), (tid0 = tid3 ⊃ mkls(tid3, val, optval, val0, optval0);alsf(tid3)), (tid0 = tid3 ⊃ invDeq;apcf(tid3)), ADoDeq(tid0)) ∨ mkdgs([]) ≠ gstepf(mkdgs([]), (tid0 = tid3 ⊃ mkls(tid3, val, optval, val0, optval0);alsf(tid3)), (tid0 = tid3 ⊃ invDeq;apcf(tid3)), ADoDeq(tid0)) ∨ alsf ≠ alsf(tid0; mkls(tid0, val, optval, val0, optval0)) (tid3; lstepf(mkdgs([]), (tid0 = tid3 ⊃ mkls(tid3, val, optval, val0, optval0);alsf(tid3)), (tid0 = tid3 ⊃ invDeq;apcf(tid3)), ADoDeq(tid0))) ∨ apcf ≠ apcf(tid0; invDeq) (tid3; pcstepf(mkdgs([]), (tid0 = tid3 ⊃ mkls(tid3, val, optval, val0, optval0);alsf(tid3)), (tid0 = tid3 ⊃ invDeq;apcf(tid3)), ADoDeq(tid0))), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs([]), lsf(tid), pcf(tid)), ∀ tid3. alsf(tid3) = mkls ((tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).tid, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).ival, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).oval, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).value, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).optval) ∧ apcf(tid3) = bwabspcf((tid0 = tid3 ⊃ invDeq;pcf(tid3))) ∨ alsf(tid3) = mkls ((tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).tid, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).ival, Empty, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).value, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).optval) ∧ invDeq = pcf(tid3) ∧ apcf(tid3) = resDeq ∧ (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).obsEmpty ⊦

User applied rule expand left

And obtained the following new goals

Rule argument

pos: left 6

Additional information

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

(tid0 = tid2 ⊃ mkls(tid2, true, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), apcf(tid0) = resDeq, invDeq = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), alsf(tid) ≠ alsf(tid0; mkls(tid0, val, optval, val0, optval0))(tid0; mkls(tid0, val, Empty, val0, optval0))(tid), DQGInv(mkgs([])), DQLInv(mkgs([]), mkls(tid0, obsEmpty, val, optval, val0, optval0), invDeq), DQLInv(mkgs([]), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), fininvdeq(pcf), ∀ tid3. alsf(tid3) = mkls ((tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).tid, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).ival, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).oval, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).value, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).optval) ∧ apcf(tid3) = bwabspcf((tid0 = tid3 ⊃ invDeq;pcf(tid3))) ∨ alsf(tid3) = mkls ((tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).tid, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).ival, Empty, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).value, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).optval) ∧ invDeq = pcf(tid3) ∧ apcf(tid3) = resDeq ∧ (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).obsEmpty, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs([]), lsf(tid), pcf(tid)), ∀ tid3. ¬ pre(mkdgs([]), (tid0 = tid3 ⊃ mkls(tid3, val, optval, val0, optval0);alsf(tid3)), (tid0 = tid3 ⊃ invDeq;apcf(tid3)), ADoDeq(tid0)) ∨ mkdgs([]) ≠ gstepf(mkdgs([]), (tid0 = tid3 ⊃ mkls(tid3, val, optval, val0, optval0);alsf(tid3)), (tid0 = tid3 ⊃ invDeq;apcf(tid3)), ADoDeq(tid0)) ∨ alsf ≠ alsf(tid0; mkls(tid0, val, optval, val0, optval0)) (tid3; lstepf(mkdgs([]), (tid0 = tid3 ⊃ mkls(tid3, val, optval, val0, optval0);alsf(tid3)), (tid0 = tid3 ⊃ invDeq;apcf(tid3)), ADoDeq(tid0))) ∨ apcf ≠ apcf(tid0; invDeq) (tid3; pcstepf(mkdgs([]), (tid0 = tid3 ⊃ mkls(tid3, val, optval, val0, optval0);alsf(tid3)), (tid0 = tid3 ⊃ invDeq;apcf(tid3)), ADoDeq(tid0))) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

(tid0 = tid2 ⊃ mkls(tid2, true, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), apcf(tid0) = resDeq, invDeq = pcf(tid0), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), alsf(tid) ≠ (tid0 = tid ⊃ mkls(tid, val, Empty, val0, optval0);alsf(tid)), DQGInv(mkgs([])), DQLInv(mkgs([]), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), DQLInv(mkgs([]), mkls(tid0, obsEmpty, val, optval, val0, optval0), invDeq), fininvdeq(pcf), ∀ tid3. ¬ pre(mkdgs([]), (tid0 = tid3 ⊃ mkls(tid3, val, optval, val0, optval0);alsf(tid3)), (tid0 = tid3 ⊃ invDeq;apcf(tid3)), ADoDeq(tid0)) ∨ mkdgs([]) ≠ gstepf(mkdgs([]), (tid0 = tid3 ⊃ mkls(tid3, val, optval, val0, optval0);alsf(tid3)), (tid0 = tid3 ⊃ invDeq;apcf(tid3)), ADoDeq(tid0)) ∨ alsf ≠ alsf(tid0; mkls(tid0, val, optval, val0, optval0)) (tid3; lstepf(mkdgs([]), (tid0 = tid3 ⊃ mkls(tid3, val, optval, val0, optval0);alsf(tid3)), (tid0 = tid3 ⊃ invDeq;apcf(tid3)), ADoDeq(tid0))) ∨ apcf ≠ apcf(tid0; invDeq) (tid3; pcstepf(mkdgs([]), (tid0 = tid3 ⊃ mkls(tid3, val, optval, val0, optval0);alsf(tid3)), (tid0 = tid3 ⊃ invDeq;apcf(tid3)), ADoDeq(tid0))), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs([]), lsf(tid), pcf(tid)), ∀ tid3. alsf(tid3) = mkls ((tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).tid, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).ival, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).oval, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).value, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).optval) ∧ apcf(tid3) = bwabspcf((tid0 = tid3 ⊃ invDeq;pcf(tid3))) ∨ alsf(tid3) = mkls ((tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).tid, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).ival, Empty, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).value, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).optval) ∧ invDeq = pcf(tid3) ∧ apcf(tid3) = resDeq ∧ (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).obsEmpty ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 6

Additional information

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

(tid0 = tid2 ⊃ mkls(tid2, true, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), apcf(tid0) = resDeq, invDeq = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), tid0 = tid, alsf(tid) ≠ mkls(tid, val, Empty, val0, optval0), DQGInv(mkgs([])), DQLInv(mkgs([]), mkls(tid0, obsEmpty, val, optval, val0, optval0), invDeq), DQLInv(mkgs([]), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), fininvdeq(pcf), ∀ tid3. alsf(tid3) = mkls ((tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).tid, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).ival, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).oval, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).value, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).optval) ∧ apcf(tid3) = bwabspcf((tid0 = tid3 ⊃ invDeq;pcf(tid3))) ∨ alsf(tid3) = mkls ((tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).tid, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).ival, Empty, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).value, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).optval) ∧ invDeq = pcf(tid3) ∧ apcf(tid3) = resDeq ∧ (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).obsEmpty, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs([]), lsf(tid), pcf(tid)), ∀ tid3. ¬ pre(mkdgs([]), (tid0 = tid3 ⊃ mkls(tid3, val, optval, val0, optval0);alsf(tid3)), (tid0 = tid3 ⊃ invDeq;apcf(tid3)), ADoDeq(tid0)) ∨ mkdgs([]) ≠ gstepf(mkdgs([]), (tid0 = tid3 ⊃ mkls(tid3, val, optval, val0, optval0);alsf(tid3)), (tid0 = tid3 ⊃ invDeq;apcf(tid3)), ADoDeq(tid0)) ∨ alsf ≠ alsf(tid0; mkls(tid0, val, optval, val0, optval0)) (tid3; lstepf(mkdgs([]), (tid0 = tid3 ⊃ mkls(tid3, val, optval, val0, optval0);alsf(tid3)), (tid0 = tid3 ⊃ invDeq;apcf(tid3)), ADoDeq(tid0))) ∨ apcf ≠ apcf(tid0; invDeq) (tid3; pcstepf(mkdgs([]), (tid0 = tid3 ⊃ mkls(tid3, val, optval, val0, optval0);alsf(tid3)), (tid0 = tid3 ⊃ invDeq;apcf(tid3)), ADoDeq(tid0))) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

(tid = tid2 ⊃ mkls(tid2, true, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), apcf(tid) = resDeq, invDeq = pcf(tid), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), alsf(tid) ≠ mkls(tid, val, Empty, val0, optval0), DQGInv(mkgs([])), DQLInv(mkgs([]), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), DQLInv(mkgs([]), mkls(tid, obsEmpty, val, optval, val0, optval0), invDeq), fininvdeq(pcf), ∀ tid3. ¬ pre(mkdgs([]), (tid = tid3 ⊃ mkls(tid3, val, optval, val0, optval0);alsf(tid3)), (tid = tid3 ⊃ invDeq;apcf(tid3)), ADoDeq(tid)) ∨ mkdgs([]) ≠ gstepf(mkdgs([]), (tid = tid3 ⊃ mkls(tid3, val, optval, val0, optval0);alsf(tid3)), (tid = tid3 ⊃ invDeq;apcf(tid3)), ADoDeq(tid)) ∨ alsf ≠ alsf(tid; mkls(tid, val, optval, val0, optval0)) (tid3; lstepf(mkdgs([]), (tid = tid3 ⊃ mkls(tid3, val, optval, val0, optval0);alsf(tid3)), (tid = tid3 ⊃ invDeq;apcf(tid3)), ADoDeq(tid))) ∨ apcf ≠ apcf(tid; invDeq) (tid3; pcstepf(mkdgs([]), (tid = tid3 ⊃ mkls(tid3, val, optval, val0, optval0);alsf(tid3)), (tid = tid3 ⊃ invDeq;apcf(tid3)), ADoDeq(tid))), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs([]), lsf(tid), pcf(tid)), ∀ tid3. alsf(tid3) = mkls ((tid = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).tid, (tid = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).ival, (tid = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).oval, (tid = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).value, (tid = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).optval) ∧ apcf(tid3) = bwabspcf((tid = tid3 ⊃ invDeq;pcf(tid3))) ∨ alsf(tid3) = mkls ((tid = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).tid, (tid = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).ival, Empty, (tid = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).value, (tid = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).optval) ∧ invDeq = pcf(tid3) ∧ apcf(tid3) = resDeq ∧ (tid = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).obsEmpty ⊦

User applied rule all left

And closed the goal!

Rule argument

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

Additional information

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

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

(tid0 = tid2 ⊃ mkls(tid2, true, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), apcf(tid0) = resDeq, invDeq = pcf(tid0), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), apcf ≠ apcf(tid0; invDeq)(tid0; resDeq), DQGInv(mkgs([])), DQLInv(mkgs([]), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), DQLInv(mkgs([]), mkls(tid0, obsEmpty, val, optval, val0, optval0), invDeq), fininvdeq(pcf), ∀ tid3. ¬ pre(mkdgs([]), (tid0 = tid3 ⊃ mkls(tid3, val, optval, val0, optval0);alsf(tid3)), (tid0 = tid3 ⊃ invDeq;apcf(tid3)), ADoDeq(tid0)) ∨ mkdgs([]) ≠ gstepf(mkdgs([]), (tid0 = tid3 ⊃ mkls(tid3, val, optval, val0, optval0);alsf(tid3)), (tid0 = tid3 ⊃ invDeq;apcf(tid3)), ADoDeq(tid0)) ∨ alsf ≠ alsf(tid0; mkls(tid0, val, optval, val0, optval0)) (tid3; lstepf(mkdgs([]), (tid0 = tid3 ⊃ mkls(tid3, val, optval, val0, optval0);alsf(tid3)), (tid0 = tid3 ⊃ invDeq;apcf(tid3)), ADoDeq(tid0))) ∨ apcf ≠ apcf(tid0; invDeq) (tid3; pcstepf(mkdgs([]), (tid0 = tid3 ⊃ mkls(tid3, val, optval, val0, optval0);alsf(tid3)), (tid0 = tid3 ⊃ invDeq;apcf(tid3)), ADoDeq(tid0))), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs([]), lsf(tid), pcf(tid)), ∀ tid3. alsf(tid3) = mkls ((tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).tid, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).ival, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).oval, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).value, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).optval) ∧ apcf(tid3) = bwabspcf((tid0 = tid3 ⊃ invDeq;pcf(tid3))) ∨ alsf(tid3) = mkls ((tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).tid, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).ival, Empty, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).value, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).optval) ∧ invDeq = pcf(tid3) ∧ apcf(tid3) = resDeq ∧ (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).obsEmpty ⊦

User applied rule expand left

And obtained the following new goals

Rule argument

pos: left 6

Additional information

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

(tid0 = tid2 ⊃ mkls(tid2, true, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), apcf(tid0) = resDeq, invDeq = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), apcf(tid) ≠ apcf(tid0; invDeq)(tid0; resDeq)(tid), DQGInv(mkgs([])), DQLInv(mkgs([]), mkls(tid0, obsEmpty, val, optval, val0, optval0), invDeq), DQLInv(mkgs([]), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), fininvdeq(pcf), ∀ tid3. alsf(tid3) = mkls ((tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).tid, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).ival, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).oval, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).value, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).optval) ∧ apcf(tid3) = bwabspcf((tid0 = tid3 ⊃ invDeq;pcf(tid3))) ∨ alsf(tid3) = mkls ((tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).tid, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).ival, Empty, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).value, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).optval) ∧ invDeq = pcf(tid3) ∧ apcf(tid3) = resDeq ∧ (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).obsEmpty, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs([]), lsf(tid), pcf(tid)), ∀ tid3. ¬ pre(mkdgs([]), (tid0 = tid3 ⊃ mkls(tid3, val, optval, val0, optval0);alsf(tid3)), (tid0 = tid3 ⊃ invDeq;apcf(tid3)), ADoDeq(tid0)) ∨ mkdgs([]) ≠ gstepf(mkdgs([]), (tid0 = tid3 ⊃ mkls(tid3, val, optval, val0, optval0);alsf(tid3)), (tid0 = tid3 ⊃ invDeq;apcf(tid3)), ADoDeq(tid0)) ∨ alsf ≠ alsf(tid0; mkls(tid0, val, optval, val0, optval0)) (tid3; lstepf(mkdgs([]), (tid0 = tid3 ⊃ mkls(tid3, val, optval, val0, optval0);alsf(tid3)), (tid0 = tid3 ⊃ invDeq;apcf(tid3)), ADoDeq(tid0))) ∨ apcf ≠ apcf(tid0; invDeq) (tid3; pcstepf(mkdgs([]), (tid0 = tid3 ⊃ mkls(tid3, val, optval, val0, optval0);alsf(tid3)), (tid0 = tid3 ⊃ invDeq;apcf(tid3)), ADoDeq(tid0))) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

(tid0 = tid2 ⊃ mkls(tid2, true, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), apcf(tid0) = resDeq, invDeq = pcf(tid0), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), apcf(tid) ≠ (tid0 = tid ⊃ resDeq;apcf(tid)), DQGInv(mkgs([])), DQLInv(mkgs([]), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), DQLInv(mkgs([]), mkls(tid0, obsEmpty, val, optval, val0, optval0), invDeq), fininvdeq(pcf), ∀ tid3. ¬ pre(mkdgs([]), (tid0 = tid3 ⊃ mkls(tid3, val, optval, val0, optval0);alsf(tid3)), (tid0 = tid3 ⊃ invDeq;apcf(tid3)), ADoDeq(tid0)) ∨ mkdgs([]) ≠ gstepf(mkdgs([]), (tid0 = tid3 ⊃ mkls(tid3, val, optval, val0, optval0);alsf(tid3)), (tid0 = tid3 ⊃ invDeq;apcf(tid3)), ADoDeq(tid0)) ∨ alsf ≠ alsf(tid0; mkls(tid0, val, optval, val0, optval0)) (tid3; lstepf(mkdgs([]), (tid0 = tid3 ⊃ mkls(tid3, val, optval, val0, optval0);alsf(tid3)), (tid0 = tid3 ⊃ invDeq;apcf(tid3)), ADoDeq(tid0))) ∨ apcf ≠ apcf(tid0; invDeq) (tid3; pcstepf(mkdgs([]), (tid0 = tid3 ⊃ mkls(tid3, val, optval, val0, optval0);alsf(tid3)), (tid0 = tid3 ⊃ invDeq;apcf(tid3)), ADoDeq(tid0))), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs([]), lsf(tid), pcf(tid)), ∀ tid3. alsf(tid3) = mkls ((tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).tid, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).ival, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).oval, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).value, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).optval) ∧ apcf(tid3) = bwabspcf((tid0 = tid3 ⊃ invDeq;pcf(tid3))) ∨ alsf(tid3) = mkls ((tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).tid, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).ival, Empty, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).value, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).optval) ∧ invDeq = pcf(tid3) ∧ apcf(tid3) = resDeq ∧ (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).obsEmpty ⊦

User applied rule case distinction

And closed the goal!

Rule argument

pos: left 6

Additional information

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

(tid0 = tid ⊃ mkls(tid, true, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), apcf(tid0) = resDeq, invDeq = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), DQGInv(mkgs([])), DQLInv(mkgs([]), mkls(tid0, obsEmpty, val, optval, val0, optval0), invDeq), fininvdeq(pcf), ∀ tid3. alsf(tid3) = mkls ((tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).tid, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).ival, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).oval, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).value, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).optval) ∧ apcf(tid3) = bwabspcf((tid0 = tid3 ⊃ invDeq;pcf(tid3))) ∨ alsf(tid3) = mkls ((tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).tid, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).ival, Empty, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).value, (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).optval) ∧ invDeq = pcf(tid3) ∧ apcf(tid3) = resDeq ∧ (tid0 = tid3 ⊃ mkls(tid3, true, val, optval, val0, optval0);lsf(tid3)).obsEmpty, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs([]), lsf(tid), pcf(tid)), alsf(tid) = mkls(tid1, val1, optval1, val2, optval2) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ invDeq;pcf(tid))) ∨ alsf(tid) = mkls(tid1, val1, Empty, val2, optval2) ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ obsEmpty0 ⊦ (tid0 = tid ⊃ mkls(tid2, val3, optval3, val4, optval4);alsf(tid)) = mkls(tid2, val3, optval3, val4, optval4) ∧ (tid0 = tid ⊃ invDeq;apcf(tid)) = bwabspcf(pcf(tid)), alsf(tid) = mkls(tid2, val3, Empty, val4, optval4) ∧ pcf(tid) = invDeq ∧ tid0 ≠ tid ∧ resDeq = apcf(tid) ∧ obsEmpty1

User applied rule case distinction

And closed the goal!

Rule argument

pos: left 1

Additional information

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

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

ca = DoDeq(tid0), lsf(ca.tid) = mkls(ca.tid, obsEmpty, val, optval, val0, optval0), ca ≠ globalCrash, DQGInv(gs), DQLInv(gs, mkls(ca.tid, obsEmpty, val, optval, val0, optval0), pcf(ca.tid)), bwabs (mkstate(gstepf(gs, lsf(tid), pcf(tid), ca), lsf(tid; lstepf(gs, lsf(tid), pcf(tid), ca)), pcf(tid; pcstepf(gs, lsf(tid), pcf(tid), ca))), mkstate(ags, alsf, apcf)), fininvdeq(pcf), pre(gs, lsf(tid), pcf(tid), ca), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ (∃ tid. ca = CheckEmp(tid) ⊃ (apcf(ca.tid) = resDeq ⊃ ADoDeq(ca.tid);τ);bwabsa(ca)) = τ, ∃ durqs. DurQstep(durqs, (∃ tid. ca = CheckEmp(tid) ⊃ (apcf(ca.tid) = resDeq ⊃ ADoDeq(ca.tid);τ);bwabsa(ca)), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ADoDeq(tid) ≠ τ; (s) ⊦ bwabsa(DoDeq(tid)) = ADoDeq(tid); (s) ⊦ CheckEmp(tid) ≠ DoDeq(tid0); (s) ⊦ DoDeq(tid).tid = tid; (s) ⊦ DoDeq(tid) ≠ globalCrash; (s)

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

lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), DQGInv(gs), DQLInv(gs, mkls(tid0, obsEmpty, val, optval, val0, optval0), pcf(tid0)), bwabs (mkstate (gstepf(gs, lsf(tid), pcf(tid), DoDeq(tid0)), lsf(tid; lstepf(gs, lsf(tid), pcf(tid), DoDeq(tid0))), pcf(tid; pcstepf(gs, lsf(tid), pcf(tid), DoDeq(tid0)))), mkstate(ags, alsf, apcf)), fininvdeq(pcf), pre(gs, lsf(tid), pcf(tid), DoDeq(tid0)), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ ∃ durqs. DurQstep(durqs, ADoDeq(tid0), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

User applied rule structural induction

And obtained the following new goals

Rule argument

term: pcf(tid)

Additional information

Used simplifier rules: DQPC freely generated by crashed, idle, invDeq, invEnq, ready, resDeq, resEnq;; ⊦ pre(gs, ls, resEnq, a) ↔ a = RetEnq(ls.tid); (s) ⊦ DoDeq(tid) ≠ RetEnq(tid0); (s) ⊦ pre(gs, ls, resDeq, a) ↔ a = RetDeq(ls.tid, ls.oval); (s) ⊦ DoDeq(tid) ≠ RetDeq(tid0, optval); (s) ⊦ gstepf(gs, ls, ready, a) = gs; (s) ⊦ pre(gs, ls, ready, a) ↔ (∃ value. a = InvEnq(ls.tid, value)) ∨ a = InvDeq(ls.tid); (s) ⊦ DoDeq(tid) ≠ InvEnq(tid0, val); (s) ⊦ DoDeq(tid) ≠ InvDeq(tid0); (s) ⊦ pre(gs, ls, invEnq, a) ↔ a = DoEnq(ls.tid); (s) ⊦ DoDeq(tid) ≠ DoEnq(tid0); (s) ⊦ pre(gs, ls, idle, a) ↔ a = callRun(ls.tid); (s) ⊦ DoDeq(tid) ≠ callRun(tid0); (s) ⊦ pre(gs, ls, crashed, a) ↔ false; (s)

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

invDeq = pcf(tid), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), DQGInv(gs), DQLInv(gs, mkls(tid0, obsEmpty, val, optval, val0, optval0), pcf(tid0)), bwabs (mkstate (gstepf(gs, lsf(tid), pcf(tid), DoDeq(tid0)), lsf(tid; lstepf(gs, lsf(tid), pcf(tid), DoDeq(tid0))), pcf(tid; pcstepf(gs, lsf(tid), pcf(tid), DoDeq(tid0)))), mkstate(ags, alsf, apcf)), fininvdeq(pcf), pre(gs, lsf(tid), pcf(tid), DoDeq(tid0)), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ ∃ durqs. DurQstep(durqs, ADoDeq(tid0), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ pcstepf(gs, ls, invDeq, DoDeq(ls.tid)) = resDeq; (s) ⊦ lstepf(gs, ls, invDeq, DoDeq(ls.tid)) = ls.oval:= Val(gs.queue.head); (s) ⊦ gstepf(gs, ls, invDeq, DoDeq(ls.tid)) = gs.queue:= gs.queue.tail; (s) ⊦ DoDeq(tid) = DoDeq(tid0) ↔ tid = tid0; (s) ⊦ DoDeq(tid) ≠ DoDeqEmpty(tid0); (s) ⊦ CheckEmp(tid) ≠ DoDeq(tid0); (s) ⊦ pre(gs, ls, invDeq, a) ↔ a = CheckEmp(ls.tid) ∧ gs.queue = [] ∨ a = DoDeqEmpty(ls.tid) ∧ ls.obsEmpty ∨ a = DoDeq(ls.tid) ∧ gs.queue ≠ []; (s)

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

invDeq = pcf(tid), lsf(lsf(tid).tid) = mkls(lsf(tid).tid, obsEmpty, val, optval, val0, optval0), gs.queue ≠ [], DQGInv(gs), DQLInv(gs, mkls(lsf(tid).tid, obsEmpty, val, optval, val0, optval0), pcf(lsf(tid).tid)), bwabs(mkstate(gs.queue:= gs.queue.tail, lsf(tid; lsf(tid).oval:= Val(gs.queue.head)), pcf(tid; resDeq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ ∃ durqs. DurQstep(durqs, ADoDeq(lsf(tid).tid), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

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, obsEmpty0, lsf(tid), optval1, tid0, 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, obsEmpty0, lsf(tid), oval, tid0, optval1

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

invDeq = pcf(tid), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), gs.queue ≠ [], DQGInv(gs), DQLInv(gs, mkls(tid0, obsEmpty, val, optval, val0, optval0), pcf(tid0)), bwabs(mkstate(gs.queue:= gs.queue.tail, lsf(tid; lsf(tid).oval:= Val(gs.queue.head)), pcf(tid; resDeq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ ∃ durqs. DurQstep(durqs, ADoDeq(tid0), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

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

invDeq = pcf(tid), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), gs.queue ≠ [], DQGInv(gs), DQLInv(gs, mkls(tid0, obsEmpty, val, optval, val0, optval0), pcf(tid0)), bwabs (mkstate(gs.queue:= gs.queue.tail, lsf(tid; mkls(tid0, obsEmpty0, val1, Val(gs.queue.head), val2, optval2)), pcf(tid; resDeq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ ∃ durqs. DurQstep(durqs, ADoDeq(tid0), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 9 terms: tid abort: F discard: F computed: F

Additional information

Used terms: tid

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

lsf(tid).tid = tid, invDeq = pcf(tid), lsf(tid) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), gs.queue ≠ [], DQGInv(gs), DQLInv(gs, mkls(tid0, obsEmpty, val, optval, val0, optval0), pcf(tid0)), DQLInv(gs, lsf(tid), pcf(tid)), bwabs (mkstate(gs.queue:= gs.queue.tail, lsf(tid; mkls(tid0, obsEmpty0, val1, Val(gs.queue.head), val2, optval2)), pcf(tid; resDeq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ ∃ durqs. DurQstep(durqs, ADoDeq(tid0), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

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

invDeq = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), gs.queue ≠ [], DQGInv(gs), DQLInv(gs, mkls(tid0, obsEmpty, val, optval, val0, optval0), invDeq), bwabs (mkstate(gs.queue:= gs.queue.tail, lsf(tid0; mkls(tid0, obsEmpty, val, Val(gs.queue.head), val0, optval0)), pcf(tid0; resDeq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ ∃ durqs. DurQstep(durqs, ADoDeq(tid0), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

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 80 from proof bwsim-step-nontau (previous step) (back to tree)

gs = mkgs(queue), invDeq = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), queue ≠ [], DQGInv(gs), DQLInv(gs, mkls(tid0, obsEmpty, val, optval, val0, optval0), invDeq), bwabs (mkstate(gs.queue:= queue.tail, lsf(tid0; mkls(tid0, obsEmpty, val, Val(queue.head), val0, optval0)), pcf(tid0; resDeq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ ∃ durqs. DurQstep(durqs, ADoDeq(tid0), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ mkgs(queue).queue:= queue0 = mkgs(queue0); (s)

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

invDeq = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), queue ≠ [], DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), invDeq), bwabs(mkstate(mkgs(queue.tail), lsf(tid0; mkls(tid0, obsEmpty, val, Val(queue.head), val0, optval0)), pcf(tid0; resDeq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦ ∃ durqs. DurQstep(durqs, ADoDeq(tid0), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(mkgs(queue), lsf, pcf), durqs)

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: list-data, name:elim-add, seq: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail), subst:[x, head, tail] → [queue, val1, queue0]

Additional information

Used simplifier rules: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: queue, head, tail

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

invDeq = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), queue = val1 + queue0, queue ≠ [], DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), invDeq), bwabs(mkstate(mkgs(queue0), lsf(tid0; mkls(tid0, obsEmpty, val, Val(val1), val0, optval0)), pcf(tid0; resDeq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦ ∃ durqs. DurQstep(durqs, ADoDeq(tid0), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(mkgs(queue), lsf, pcf), durqs)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ a + x = a ' + x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list ⊦ a ' + x ≠ []; (s)

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

invDeq = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), DQGInv(mkgs(val1 ' + queue0)), DQLInv(mkgs(val1 ' + queue0), mkls(tid0, obsEmpty, val, optval, val0, optval0), invDeq), bwabs(mkstate(mkgs(queue0), lsf(tid0; mkls(tid0, obsEmpty, val, Val(val1), val0, optval0)), pcf(tid0; resDeq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(val1 ' + queue0), lsf(tid), pcf(tid)) ⊦ ∃ durqs. DurQstep(durqs, ADoDeq(tid0), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(mkgs(val1 ' + queue0), lsf, pcf), durqs)

User applied rule exists right

And obtained the following new goals

Rule argument

pos: right 1 terms: mkstate (mkdgs(val1 ' + queue0), alsf(tid0; bwlabsf(lsf(tid0))), apcf(tid0; invDeq)) abort: F discard: T computed: F

Additional information

Used terms: mkstate (mkdgs(val1 ' + queue0), alsf(tid0; bwlabsf(lsf(tid0))), apcf(tid0; invDeq))

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

invDeq = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), DQGInv(mkgs(val1 ' + queue0)), DQLInv(mkgs(val1 ' + queue0), mkls(tid0, obsEmpty, val, optval, val0, optval0), invDeq), bwabs(mkstate(mkgs(queue0), lsf(tid0; mkls(tid0, obsEmpty, val, Val(val1), val0, optval0)), pcf(tid0; resDeq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(val1 ' + queue0), lsf(tid), pcf(tid)) ⊦ DurQstep(mkstate(mkdgs(val1 ' + queue0), alsf(tid0; bwlabsf(lsf(tid0))), apcf(tid0; invDeq)), ADoDeq(tid0), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(mkgs(val1 ' + queue0), lsf, pcf), mkstate(mkdgs(val1 ' + queue0), alsf(tid0; bwlabsf(lsf(tid0))), apcf(tid0; invDeq)))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).optval = oval0; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).value = ival0; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).oval = oval; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).ival = ival; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).tid = tid; (s) ⊦ invDeq ≠ resDeq; (s) ⊦ invDeq ≠ resDeq; (s) ⊦ mkdgs(queue) = mkdgs(queue0) ↔ queue = queue0; (s) ⊦ mkgs(queue).queue = queue; (s) ⊦ bwabs(mkstate(gs, lsf, pcf), mkstate(ags, alsf, apcf)) → ( bwabs(mkstate(gs0, lsf0, pcf0), mkstate(ags0, alsf0, apcf0)) ↔ ags = mkdgs(gs.queue) → ags0 = mkdgs(gs0.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 → alsf0(tid) = mkls (lsf0(tid).tid, lsf0(tid).ival, lsf0(tid).oval, lsf0(tid).value, lsf0(tid).optval) ∧ apcf0(tid) = bwabspcf(pcf0(tid)) ∨ alsf0(tid) = mkls (lsf0(tid).tid, lsf0(tid).ival, Empty, lsf0(tid).value, lsf0(tid).optval) ∧ pcf0(tid) = invDeq ∧ apcf0(tid) = resDeq ∧ lsf0(tid).obsEmpty)); (s) ⊦ bwlabsf(ls) = mkls(ls.tid, ls.ival, ls.oval, ls.value, ls.optval); (s)

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

invDeq = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), DQGInv(mkgs(val1 ' + queue0)), DQLInv(mkgs(val1 ' + queue0), mkls(tid0, obsEmpty, val, optval, val0, optval0), invDeq), bwabs(mkstate(mkgs(queue0), lsf(tid0; mkls(tid0, obsEmpty, val, Val(val1), val0, optval0)), pcf(tid0; resDeq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(val1 ' + queue0), lsf(tid), pcf(tid)) ⊦ DurQstep (mkstate(mkdgs(val1 ' + queue0), alsf(tid0; mkls(tid0, val, optval, val0, optval0)), apcf(tid0; invDeq)), ADoDeq(tid0), mkstate(ags, alsf, apcf)) ∧ ( ags = mkdgs(queue0) → alsf(tid) = mkls ((tid0 = tid ⊃ mkls(tid, obsEmpty, val, Val(val1), val0, optval0);lsf(tid)).tid, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, Val(val1), val0, optval0);lsf(tid)).ival, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, Val(val1), val0, optval0);lsf(tid)).oval, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, Val(val1), val0, optval0);lsf(tid)).value, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, Val(val1), val0, optval0);lsf(tid)).optval) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ resDeq;pcf(tid))) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty → (tid0 = tid ⊃ mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval);alsf(tid)) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ (tid0 = tid ⊃ invDeq;apcf(tid)) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ tid0 ≠ tid ∧ resDeq = apcf(tid) ∧ lsf(tid).obsEmpty)

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] → [val3, val2, obsEmpty0, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, Val(val1), val0, optval0) ;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, obsEmpty0, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, Val(val1), val0, optval0);lsf(tid)), oval, tid1, optval1

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

(tid0 = tid ⊃ mkls(tid, obsEmpty, val, Val(val1), val0, optval0);lsf(tid)) = mkls(tid1, obsEmpty0, val2, optval1, val3, optval2), invDeq = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), DQGInv(mkgs(val1 ' + queue0)), DQLInv(mkgs(val1 ' + queue0), mkls(tid0, obsEmpty, val, optval, val0, optval0), invDeq), bwabs(mkstate(mkgs(queue0), lsf(tid0; mkls(tid0, obsEmpty, val, Val(val1), val0, optval0)), pcf(tid0; resDeq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(val1 ' + queue0), lsf(tid), pcf(tid)) ⊦ DurQstep (mkstate(mkdgs(val1 ' + queue0), alsf(tid0; mkls(tid0, val, optval, val0, optval0)), apcf(tid0; invDeq)), ADoDeq(tid0), mkstate(ags, alsf, apcf)) ∧ ( ags = mkdgs(queue0) → alsf(tid) = mkls(tid1, val2, optval1, val3, optval2) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ resDeq;pcf(tid))) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty → (tid0 = tid ⊃ mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval);alsf(tid)) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ (tid0 = tid ⊃ invDeq;apcf(tid)) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ tid0 ≠ tid ∧ resDeq = apcf(tid) ∧ lsf(tid).obsEmpty)

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] → [val5, val4, obsEmpty1, lsf(tid), optval3, tid2, optval4]

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, obsEmpty1, lsf(tid), oval, tid2, optval3

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

(tid0 = tid ⊃ mkls(tid, obsEmpty, val, Val(val1), val0, optval0);lsf(tid)) = mkls(tid1, obsEmpty0, val2, optval1, val3, optval2), invDeq = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid) = mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), DQGInv(mkgs(val1 ' + queue0)), DQLInv(mkgs(val1 ' + queue0), mkls(tid0, obsEmpty, val, optval, val0, optval0), invDeq), bwabs(mkstate(mkgs(queue0), lsf(tid0; mkls(tid0, obsEmpty, val, Val(val1), val0, optval0)), pcf(tid0; resDeq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(val1 ' + queue0), lsf(tid), pcf(tid)) ⊦ DurQstep (mkstate(mkdgs(val1 ' + queue0), alsf(tid0; mkls(tid0, val, optval, val0, optval0)), apcf(tid0; invDeq)), ADoDeq(tid0), mkstate(ags, alsf, apcf)) ∧ ( ags = mkdgs(queue0) → alsf(tid) = mkls(tid1, val2, optval1, val3, optval2) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ resDeq;pcf(tid))) ∨ alsf(tid) = mkls(tid2, val4, Empty, val5, optval4) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ obsEmpty1 → (tid0 = tid ⊃ mkls(tid2, val4, optval3, val5, optval4);alsf(tid)) = mkls(tid2, val4, optval3, val5, optval4) ∧ (tid0 = tid ⊃ invDeq;apcf(tid)) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(tid2, val4, Empty, val5, optval4) ∧ pcf(tid) = invDeq ∧ tid0 ≠ tid ∧ resDeq = apcf(tid) ∧ obsEmpty1)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

(tid0 = tid ⊃ mkls(tid, obsEmpty, val, Val(val1), val0, optval0);mkls(tid2, obsEmpty1, val4, optval3, val5, optval4)) = mkls(tid1, obsEmpty0, val2, optval1, val3, optval2), invDeq = pcf(tid0), lsf(tid) = mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), DQGInv(mkgs(val1 ' + queue0)), DQLInv(mkgs(val1 ' + queue0), mkls(tid0, obsEmpty, val, optval, val0, optval0), invDeq), bwabs(mkstate(mkgs(queue0), lsf(tid0; mkls(tid0, obsEmpty, val, Val(val1), val0, optval0)), pcf(tid0; resDeq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(val1 ' + queue0), lsf(tid), pcf(tid)) ⊦ DurQstep (mkstate(mkdgs(val1 ' + queue0), alsf(tid0; mkls(tid0, val, optval, val0, optval0)), apcf(tid0; invDeq)), ADoDeq(tid0), mkstate(ags, alsf, apcf)) ∧ ( ags = mkdgs(queue0) → alsf(tid) = mkls(tid1, val2, optval1, val3, optval2) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ resDeq;pcf(tid))) ∨ alsf(tid) = mkls(tid2, val4, Empty, val5, optval4) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ obsEmpty1 → (tid0 = tid ⊃ mkls(tid2, val4, optval3, val5, optval4);alsf(tid)) = mkls(tid2, val4, optval3, val5, optval4) ∧ (tid0 = tid ⊃ invDeq;apcf(tid)) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(tid2, val4, Empty, val5, optval4) ∧ pcf(tid) = invDeq ∧ tid0 ≠ tid ∧ resDeq = apcf(tid) ∧ obsEmpty1)

User applied rule all left

And obtained the following new goals

Rule argument

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

Additional information

Used terms: tid

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

lsf(tid).tid = tid, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, Val(val1), val0, optval0);mkls(tid2, obsEmpty1, val4, optval3, val5, optval4)) = mkls(tid1, obsEmpty0, val2, optval1, val3, optval2), invDeq = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid) = mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), DQGInv(mkgs(val1 ' + queue0)), DQLInv(mkgs(val1 ' + queue0), mkls(tid0, obsEmpty, val, optval, val0, optval0), invDeq), DQLInv(mkgs(val1 ' + queue0), lsf(tid), pcf(tid)), bwabs(mkstate(mkgs(queue0), lsf(tid0; mkls(tid0, obsEmpty, val, Val(val1), val0, optval0)), pcf(tid0; resDeq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(val1 ' + queue0), lsf(tid), pcf(tid)) ⊦ DurQstep (mkstate(mkdgs(val1 ' + queue0), alsf(tid0; mkls(tid0, val, optval, val0, optval0)), apcf(tid0; invDeq)), ADoDeq(tid0), mkstate(ags, alsf, apcf)) ∧ ( ags = mkdgs(queue0) → alsf(tid) = mkls(tid1, val2, optval1, val3, optval2) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ resDeq;pcf(tid))) ∨ alsf(tid) = mkls(tid2, val4, Empty, val5, optval4) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ obsEmpty1 → (tid0 = tid ⊃ mkls(tid2, val4, optval3, val5, optval4);alsf(tid)) = mkls(tid2, val4, optval3, val5, optval4) ∧ (tid0 = tid ⊃ invDeq;apcf(tid)) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(tid2, val4, Empty, val5, optval4) ∧ pcf(tid) = invDeq ∧ tid0 ≠ tid ∧ resDeq = apcf(tid) ∧ obsEmpty1)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

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

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty, val, Val(val1), val0, optval0);mkls(tid2, obsEmpty1, val4, optval3, val5, optval4)) = mkls(tid1, obsEmpty0, val2, optval1, val3, optval2), invDeq = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid2) = mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), DQGInv(mkgs(val1 ' + queue0)), DQLInv(mkgs(val1 ' + queue0), mkls(tid0, obsEmpty, val, optval, val0, optval0), invDeq), DQLInv(mkgs(val1 ' + queue0), mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), pcf(tid2)), bwabs(mkstate(mkgs(queue0), lsf(tid0; mkls(tid0, obsEmpty, val, Val(val1), val0, optval0)), pcf(tid0; resDeq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(val1 ' + queue0), lsf(tid), pcf(tid)) ⊦ DurQstep (mkstate(mkdgs(val1 ' + queue0), alsf(tid0; mkls(tid0, val, optval, val0, optval0)), apcf(tid0; invDeq)), ADoDeq(tid0), mkstate(ags, alsf, apcf)) ∧ ( ags = mkdgs(queue0) → alsf(tid2) = mkls(tid1, val2, optval1, val3, optval2) ∧ apcf(tid2) = bwabspcf((tid0 = tid2 ⊃ resDeq;pcf(tid2))) ∨ alsf(tid2) = mkls(tid2, val4, Empty, val5, optval4) ∧ tid0 ≠ tid2 ∧ invDeq = pcf(tid2) ∧ apcf(tid2) = resDeq ∧ obsEmpty1 → (tid0 = tid2 ⊃ mkls(tid2, val4, optval3, val5, optval4);alsf(tid2)) = mkls(tid2, val4, optval3, val5, optval4) ∧ (tid0 = tid2 ⊃ invDeq;apcf(tid2)) = bwabspcf(pcf(tid2)) ∨ alsf(tid2) = mkls(tid2, val4, Empty, val5, optval4) ∧ pcf(tid2) = invDeq ∧ tid0 ≠ tid2 ∧ resDeq = apcf(tid2) ∧ obsEmpty1)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

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

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty, val, Val(val1), val0, optval0);mkls(tid2, obsEmpty1, val4, optval3, val5, optval4)) = mkls(tid1, obsEmpty0, val2, optval1, val3, optval2), invDeq = pcf(tid0), lsf(tid2) = mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), DQGInv(mkgs(val1 ' + queue0)), DQLInv(mkgs(val1 ' + queue0), mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), pcf(tid2)), DQLInv(mkgs(val1 ' + queue0), mkls(tid0, obsEmpty, val, optval, val0, optval0), invDeq), bwabs(mkstate(mkgs(queue0), lsf(tid0; mkls(tid0, obsEmpty, val, Val(val1), val0, optval0)), pcf(tid0; resDeq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ¬ DurQstep (mkstate(mkdgs(val1 ' + queue0), alsf(tid0; mkls(tid0, val, optval, val0, optval0)), apcf(tid0; invDeq)), ADoDeq(tid0), mkstate(ags, alsf, apcf)), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(val1 ' + queue0), lsf(tid), pcf(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), alsf(tid0; mkls(tid0, val, optval, val0, optval0)), ADoDeq(tid0), mkdgs(val1 ' + queue0), apcf(tid0; invDeq)], <all paths>

Additional information

Used terms: mkstate(ags, alsf, apcf), alsf(tid0; mkls(tid0, val, optval, val0, optval0)), ADoDeq(tid0), mkdgs(val1 ' + queue0), apcf(tid0; invDeq)

Proof step 92 from proof bwsim-step-nontau (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 93 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty, val, Val(val1), val0, optval0);mkls(tid2, obsEmpty1, val4, optval3, val5, optval4)) = mkls(tid1, obsEmpty0, val2, optval1, val3, optval2), invDeq = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid2) = mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), DQGInv(mkgs(val1 ' + queue0)), DQLInv(mkgs(val1 ' + queue0), mkls(tid0, obsEmpty, val, optval, val0, optval0), invDeq), DQLInv(mkgs(val1 ' + queue0), mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), pcf(tid2)), bwabs(mkstate(mkgs(queue0), lsf(tid0; mkls(tid0, obsEmpty, val, Val(val1), val0, optval0)), pcf(tid0; resDeq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), (ADoDeq(tid0) = globalACrash ⊃ mkstate(ags, alsf, apcf) ≠ mkstate(mkdgs(val1 ' + queue0), alsf(tid0; mkls(tid0, val, optval, val0, optval0)), λ tid. (apcf(tid0; invDeq)(tid) = idle ⊃ idle;crashed)) ;∀ tid. ¬ ( pre(mkdgs(val1 ' + queue0), alsf(tid0; mkls(tid0, val, optval, val0, optval0))(tid), apcf(tid0; invDeq)(tid), ADoDeq(tid0)) ∧ mkstate(ags, alsf, apcf) = mkstate (gstepf(mkdgs(val1 ' + queue0), alsf(tid0; mkls(tid0, val, optval, val0, optval0))(tid), apcf(tid0; invDeq)(tid), ADoDeq(tid0)), alsf(tid0; mkls(tid0, val, optval, val0, optval0)) (tid; lstepf(mkdgs(val1 ' + queue0), alsf(tid0; mkls(tid0, val, optval, val0, optval0))(tid), apcf(tid0; invDeq)(tid), ADoDeq(tid0))), apcf(tid0; invDeq) (tid; pcstepf(mkdgs(val1 ' + queue0), alsf(tid0; mkls(tid0, val, optval, val0, optval0))(tid), apcf(tid0; invDeq)(tid), ADoDeq(tid0))))) ), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(val1 ' + queue0), lsf(tid), pcf(tid)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ADoDeq(tid) ≠ globalACrash; (s)

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

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty, val, Val(val1), val0, optval0);mkls(tid2, obsEmpty1, val4, optval3, val5, optval4)) = mkls(tid1, obsEmpty0, val2, optval1, val3, optval2), invDeq = pcf(tid0), lsf(tid2) = mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), DQGInv(mkgs(val1 ' + queue0)), DQLInv(mkgs(val1 ' + queue0), mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), pcf(tid2)), DQLInv(mkgs(val1 ' + queue0), mkls(tid0, obsEmpty, val, optval, val0, optval0), invDeq), bwabs(mkstate(mkgs(queue0), lsf(tid0; mkls(tid0, obsEmpty, val, Val(val1), val0, optval0)), pcf(tid0; resDeq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(val1 ' + queue0), lsf(tid), pcf(tid)), ∀ tid. ¬ pre(mkdgs(val1 ' + queue0), (tid0 = tid ⊃ mkls(tid, val, optval, val0, optval0);alsf(tid)), (tid0 = tid ⊃ invDeq;apcf(tid)), ADoDeq(tid0)) ∨ mkstate(ags, alsf, apcf) ≠ mkstate (gstepf(mkdgs(val1 ' + queue0), (tid0 = tid ⊃ mkls(tid, val, optval, val0, optval0);alsf(tid)), (tid0 = tid ⊃ invDeq;apcf(tid)), ADoDeq(tid0)), alsf(tid0; mkls(tid0, val, optval, val0, optval0)) (tid ; lstepf(mkdgs(val1 ' + queue0), (tid0 = tid ⊃ mkls(tid, val, optval, val0, optval0);alsf(tid)), (tid0 = tid ⊃ invDeq;apcf(tid)), ADoDeq(tid0)) ), apcf(tid0; invDeq) (tid ; pcstepf (mkdgs(val1 ' + queue0), (tid0 = tid ⊃ mkls(tid, val, optval, val0, optval0);alsf(tid)), (tid0 = tid ⊃ invDeq;apcf(tid)), ADoDeq(tid0)) )) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

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

Additional information

Used terms: tid0

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

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty, val, Val(val1), val0, optval0);mkls(tid2, obsEmpty1, val4, optval3, val5, optval4)) = mkls(tid1, obsEmpty0, val2, optval1, val3, optval2), invDeq = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid2) = mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), DQGInv(mkgs(val1 ' + queue0)), DQLInv(mkgs(val1 ' + queue0), mkls(tid0, obsEmpty, val, optval, val0, optval0), invDeq), DQLInv(mkgs(val1 ' + queue0), mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), pcf(tid2)), bwabs(mkstate(mkgs(queue0), lsf(tid0; mkls(tid0, obsEmpty, val, Val(val1), val0, optval0)), pcf(tid0; resDeq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(val1 ' + queue0), lsf(tid), pcf(tid)), ¬ pre(mkdgs(val1 ' + queue0), (tid0 = tid0 ⊃ mkls(tid0, val, optval, val0, optval0);alsf(tid0)), (tid0 = tid0 ⊃ invDeq;apcf(tid0)), ADoDeq(tid0)) ∨ mkstate(ags, alsf, apcf) ≠ mkstate (gstepf (mkdgs(val1 ' + queue0), (tid0 = tid0 ⊃ mkls(tid0, val, optval, val0, optval0);alsf(tid0)), (tid0 = tid0 ⊃ invDeq;apcf(tid0)), ADoDeq(tid0)), alsf(tid0; mkls(tid0, val, optval, val0, optval0)) (tid0 ; lstepf (mkdgs(val1 ' + queue0), (tid0 = tid0 ⊃ mkls(tid0, val, optval, val0, optval0);alsf(tid0)), (tid0 = tid0 ⊃ invDeq;apcf(tid0)), ADoDeq(tid0)) ), apcf(tid0; invDeq) (tid0 ; pcstepf (mkdgs(val1 ' + queue0), (tid0 = tid0 ⊃ mkls(tid0, val, optval, val0, optval0);alsf(tid0)), (tid0 = tid0 ⊃ invDeq;apcf(tid0)), ADoDeq(tid0)) )) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ pcstepf(gs, mkls(tid, ival, oval, value, optval), invDeq, ADoDeq(tid)) = resDeq; (s) a: ⊦ (x + y) + z = x + y + z; from specification list ⊦ (a ' + x).head = a; (s) ⊦ mkdgs(queue).queue = queue; (s) ⊦ a ' + x ≠ []; (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) ⊦ mkdgs(queue).queue:= queue0 = mkdgs(queue0); (s) ⊦ (a ' + x).tail = x; (s) ⊦ gstepf(gs, mkls(tid, ival, oval, value, optval), invDeq, ADoDeq(tid)) = (gs.queue = [] ⊃ gs;gs.queue:= gs.queue.tail); (s) ⊦ ADoDeq(tid) = ADoDeq(tid0) ↔ tid = tid0; (s) ⊦ mkls(tid, ival, oval, ival0, oval0).tid = tid; (s) ⊦ pre(gs, ls, invDeq, a) ↔ a = ADoDeq(ls.tid); (s)

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

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty, val, Val(val1), val0, optval0);mkls(tid2, obsEmpty1, val4, optval3, val5, optval4)) = mkls(tid1, obsEmpty0, val2, optval1, val3, optval2), invDeq = pcf(tid0), lsf(tid2) = mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), mkstate(ags, alsf, apcf) ≠ mkstate (mkdgs(queue0), alsf(tid0; mkls(tid0, val, optval, val0, optval0))(tid0; mkls(tid0, val, Val(val1), val0, optval0)), apcf(tid0; invDeq)(tid0; resDeq)), DQGInv(mkgs(val1 ' + queue0)), DQLInv(mkgs(val1 ' + queue0), mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), pcf(tid2)), DQLInv(mkgs(val1 ' + queue0), mkls(tid0, obsEmpty, val, optval, val0, optval0), invDeq), bwabs(mkstate(mkgs(queue0), lsf(tid0; mkls(tid0, obsEmpty, val, Val(val1), val0, optval0)), pcf(tid0; resDeq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(val1 ' + queue0), lsf(tid), pcf(tid)) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DurQ[DurQ-ren], name:inj-mkstate, seq:⊦ mkstate(gstate, lsf, pcf) = mkstate(gstate0, lsf0, pcf0) ↔ gstate = gstate0 ∧ lsf = lsf0 ∧ pcf = pcf0, subst:[gstate, pcf0, lsf0, lsf, gstate0, pcf] → [ags, apcf(tid0; invDeq)(tid0; resDeq), alsf(tid0; mkls(tid0, val, optval, val0, optval0)) (tid0; mkls(tid0, val, Val(val1), val0, optval0)), alsf, mkdgs(queue0), apcf], <all paths>

Additional information

Used terms: ags, apcf(tid0; invDeq)(tid0; resDeq), alsf(tid0; mkls(tid0, val, optval, val0, optval0)) (tid0; mkls(tid0, val, Val(val1), val0, optval0)), alsf, mkdgs(queue0), apcf

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

⊦ mkstate(gstate, lsf, pcf) = mkstate(gstate0, lsf0, pcf0) ↔ gstate = gstate0 ∧ lsf = lsf0 ∧ pcf = pcf0

A spec-lemma

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

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty, val, Val(val1), val0, optval0);mkls(tid2, obsEmpty1, val4, optval3, val5, optval4)) = mkls(tid1, obsEmpty0, val2, optval1, val3, optval2), invDeq = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid2) = mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), DQGInv(mkgs(val1 ' + queue0)), DQLInv(mkgs(val1 ' + queue0), mkls(tid0, obsEmpty, val, optval, val0, optval0), invDeq), DQLInv(mkgs(val1 ' + queue0), mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), pcf(tid2)), bwabs(mkstate(mkgs(queue0), lsf(tid0; mkls(tid0, obsEmpty, val, Val(val1), val0, optval0)), pcf(tid0; resDeq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(val1 ' + queue0), lsf(tid), pcf(tid)), ags ≠ mkdgs(queue0) ∨ alsf ≠ alsf(tid0; mkls(tid0, val, optval, val0, optval0))(tid0; mkls(tid0, val, Val(val1), val0, optval0)) ∨ apcf ≠ apcf(tid0; invDeq)(tid0; resDeq) ⊦

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(queue0), alsf, lsf(tid0; mkls(tid0, obsEmpty, val, Val(val1), val0, optval0)), ags, pcf(tid0; resDeq), apcf], <all paths>

Additional information

Used terms: mkgs(queue0), alsf, lsf(tid0; mkls(tid0, obsEmpty, val, Val(val1), val0, optval0)), ags, pcf(tid0; resDeq), apcf

Proof step 99 from proof bwsim-step-nontau (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 100 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty, val, Val(val1), val0, optval0);mkls(tid2, obsEmpty1, val4, optval3, val5, optval4)) = mkls(tid1, obsEmpty0, val2, optval1, val3, optval2), ags = mkdgs(mkgs(queue0).queue), invDeq = pcf(tid0), lsf(tid2) = mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), DQGInv(mkgs(val1 ' + queue0)), DQLInv(mkgs(val1 ' + queue0), mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), pcf(tid2)), DQLInv(mkgs(val1 ' + queue0), mkls(tid0, obsEmpty, val, optval, val0, optval0), invDeq), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(val1 ' + queue0), lsf(tid), pcf(tid)), ∀ tid. alsf(tid) = mkls (lsf(tid0; mkls(tid0, obsEmpty, val, Val(val1), val0, optval0))(tid).tid, lsf(tid0; mkls(tid0, obsEmpty, val, Val(val1), val0, optval0))(tid).ival, lsf(tid0; mkls(tid0, obsEmpty, val, Val(val1), val0, optval0))(tid).oval, lsf(tid0; mkls(tid0, obsEmpty, val, Val(val1), val0, optval0))(tid).value, lsf(tid0; mkls(tid0, obsEmpty, val, Val(val1), val0, optval0))(tid).optval) ∧ apcf(tid) = bwabspcf(pcf(tid0; resDeq)(tid)) ∨ alsf(tid) = mkls (lsf(tid0; mkls(tid0, obsEmpty, val, Val(val1), val0, optval0))(tid).tid, lsf(tid0; mkls(tid0, obsEmpty, val, Val(val1), val0, optval0))(tid).ival, Empty, lsf(tid0; mkls(tid0, obsEmpty, val, Val(val1), val0, optval0))(tid).value, lsf(tid0; mkls(tid0, obsEmpty, val, Val(val1), val0, optval0))(tid).optval) ∧ pcf(tid0; resDeq)(tid) = invDeq ∧ apcf(tid) = resDeq ∧ lsf(tid0; mkls(tid0, obsEmpty, val, Val(val1), val0, optval0))(tid).obsEmpty, ags ≠ mkdgs(queue0) ∨ alsf ≠ alsf(tid0; mkls(tid0, val, optval, val0, optval0))(tid0; mkls(tid0, val, Val(val1), val0, optval0)) ∨ apcf ≠ apcf(tid0; invDeq)(tid0; resDeq) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ invDeq ≠ resDeq; (s) ⊦ mkdgs(queue) = mkdgs(queue0) ↔ queue = queue0; (s) ⊦ mkgs(queue).queue = queue; (s)

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

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty, val, Val(val1), val0, optval0);mkls(tid2, obsEmpty1, val4, optval3, val5, optval4)) = mkls(tid1, obsEmpty0, val2, optval1, val3, optval2), invDeq = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid2) = mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), DQGInv(mkgs(val1 ' + queue0)), DQLInv(mkgs(val1 ' + queue0), mkls(tid0, obsEmpty, val, optval, val0, optval0), invDeq), DQLInv(mkgs(val1 ' + queue0), mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), pcf(tid2)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(val1 ' + queue0), lsf(tid), pcf(tid)), ∀ tid. alsf(tid) = mkls ((tid0 = tid ⊃ mkls(tid, obsEmpty, val, Val(val1), val0, optval0);lsf(tid)).tid, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, Val(val1), val0, optval0);lsf(tid)).ival, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, Val(val1), val0, optval0);lsf(tid)).oval, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, Val(val1), val0, optval0);lsf(tid)).value, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, Val(val1), val0, optval0);lsf(tid)).optval) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ resDeq;pcf(tid))) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty, alsf ≠ alsf(tid0; mkls(tid0, val, optval, val0, optval0))(tid0; mkls(tid0, val, Val(val1), val0, optval0)) ∨ apcf ≠ apcf(tid0; invDeq)(tid0; resDeq) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 11

Additional information

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

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty, val, Val(val1), val0, optval0);mkls(tid2, obsEmpty1, val4, optval3, val5, optval4)) = mkls(tid1, obsEmpty0, val2, optval1, val3, optval2), invDeq = pcf(tid0), lsf(tid2) = mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), alsf ≠ alsf(tid0; mkls(tid0, val, optval, val0, optval0))(tid0; mkls(tid0, val, Val(val1), val0, optval0)), DQGInv(mkgs(val1 ' + queue0)), DQLInv(mkgs(val1 ' + queue0), mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), pcf(tid2)), DQLInv(mkgs(val1 ' + queue0), mkls(tid0, obsEmpty, val, optval, val0, optval0), invDeq), fininvdeq(pcf), ∀ tid. alsf(tid) = mkls ((tid0 = tid ⊃ mkls(tid, obsEmpty, val, Val(val1), val0, optval0);lsf(tid)).tid, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, Val(val1), val0, optval0);lsf(tid)).ival, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, Val(val1), val0, optval0);lsf(tid)).oval, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, Val(val1), val0, optval0);lsf(tid)).value, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, Val(val1), val0, optval0);lsf(tid)).optval) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ resDeq;pcf(tid))) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(val1 ' + queue0), lsf(tid), pcf(tid)) ⊦

User applied rule expand left

And obtained the following new goals

Rule argument

pos: left 5

Additional information

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

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty, val, Val(val1), val0, optval0);mkls(tid2, obsEmpty1, val4, optval3, val5, optval4)) = mkls(tid1, obsEmpty0, val2, optval1, val3, optval2), invDeq = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid2) = mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), alsf(tid) ≠ alsf(tid0; mkls(tid0, val, optval, val0, optval0))(tid0; mkls(tid0, val, Val(val1), val0, optval0))(tid), DQGInv(mkgs(val1 ' + queue0)), DQLInv(mkgs(val1 ' + queue0), mkls(tid0, obsEmpty, val, optval, val0, optval0), invDeq), DQLInv(mkgs(val1 ' + queue0), mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), pcf(tid2)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(val1 ' + queue0), lsf(tid), pcf(tid)), ∀ tid. alsf(tid) = mkls ((tid0 = tid ⊃ mkls(tid, obsEmpty, val, Val(val1), val0, optval0);lsf(tid)).tid, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, Val(val1), val0, optval0);lsf(tid)).ival, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, Val(val1), val0, optval0);lsf(tid)).oval, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, Val(val1), val0, optval0);lsf(tid)).value, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, Val(val1), val0, optval0);lsf(tid)).optval) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ resDeq;pcf(tid))) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty, val, Val(val1), val0, optval0);mkls(tid2, obsEmpty1, val4, optval3, val5, optval4)) = mkls(tid1, obsEmpty0, val2, optval1, val3, optval2), invDeq = pcf(tid0), lsf(tid2) = mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), alsf(tid) ≠ (tid0 = tid ⊃ mkls(tid, val, Val(val1), val0, optval0);alsf(tid)), DQGInv(mkgs(val1 ' + queue0)), DQLInv(mkgs(val1 ' + queue0), mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), pcf(tid2)), DQLInv(mkgs(val1 ' + queue0), mkls(tid0, obsEmpty, val, optval, val0, optval0), invDeq), fininvdeq(pcf), ∀ tid. alsf(tid) = mkls ((tid0 = tid ⊃ mkls(tid, obsEmpty, val, Val(val1), val0, optval0);lsf(tid)).tid, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, Val(val1), val0, optval0);lsf(tid)).ival, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, Val(val1), val0, optval0);lsf(tid)).oval, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, Val(val1), val0, optval0);lsf(tid)).value, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, Val(val1), val0, optval0);lsf(tid)).optval) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ resDeq;pcf(tid))) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(val1 ' + queue0), lsf(tid), pcf(tid)) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 5

Additional information

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

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty, val, Val(val1), val0, optval0);mkls(tid2, obsEmpty1, val4, optval3, val5, optval4)) = mkls(tid1, obsEmpty0, val2, optval1, val3, optval2), invDeq = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid2) = mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), tid0 = tid, alsf(tid) ≠ mkls(tid, val, Val(val1), val0, optval0), DQGInv(mkgs(val1 ' + queue0)), DQLInv(mkgs(val1 ' + queue0), mkls(tid0, obsEmpty, val, optval, val0, optval0), invDeq), DQLInv(mkgs(val1 ' + queue0), mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), pcf(tid2)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(val1 ' + queue0), lsf(tid), pcf(tid)), ∀ tid. alsf(tid) = mkls ((tid0 = tid ⊃ mkls(tid, obsEmpty, val, Val(val1), val0, optval0);lsf(tid)).tid, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, Val(val1), val0, optval0);lsf(tid)).ival, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, Val(val1), val0, optval0);lsf(tid)).oval, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, Val(val1), val0, optval0);lsf(tid)).value, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, Val(val1), val0, optval0);lsf(tid)).optval) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ resDeq;pcf(tid))) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

(tid = tid2 ⊃ mkls(tid2, obsEmpty, val, Val(val1), val0, optval0);mkls(tid2, obsEmpty1, val4, optval3, val5, optval4)) = mkls(tid1, obsEmpty0, val2, optval1, val3, optval2), invDeq = pcf(tid), lsf(tid2) = mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), alsf(tid) ≠ mkls(tid, val, Val(val1), val0, optval0), DQGInv(mkgs(val1 ' + queue0)), DQLInv(mkgs(val1 ' + queue0), mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), pcf(tid2)), DQLInv(mkgs(val1 ' + queue0), mkls(tid, obsEmpty, val, optval, val0, optval0), invDeq), fininvdeq(pcf), ∀ tid1. alsf(tid1) = mkls ((tid = tid1 ⊃ mkls(tid1, obsEmpty, val, Val(val1), val0, optval0);lsf(tid1)).tid, (tid = tid1 ⊃ mkls(tid1, obsEmpty, val, Val(val1), val0, optval0);lsf(tid1)).ival, (tid = tid1 ⊃ mkls(tid1, obsEmpty, val, Val(val1), val0, optval0);lsf(tid1)).oval, (tid = tid1 ⊃ mkls(tid1, obsEmpty, val, Val(val1), val0, optval0);lsf(tid1)).value, (tid = tid1 ⊃ mkls(tid1, obsEmpty, val, Val(val1), val0, optval0);lsf(tid1)).optval) ∧ apcf(tid1) = bwabspcf((tid = tid1 ⊃ resDeq;pcf(tid1))) ∨ alsf(tid1) = mkls(lsf(tid1).tid, lsf(tid1).ival, Empty, lsf(tid1).value, lsf(tid1).optval) ∧ tid ≠ tid1 ∧ invDeq = pcf(tid1) ∧ apcf(tid1) = resDeq ∧ lsf(tid1).obsEmpty, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(val1 ' + queue0), lsf(tid), pcf(tid)) ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 10 terms: tid

Additional information

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

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

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty, val, Val(val1), val0, optval0);mkls(tid2, obsEmpty1, val4, optval3, val5, optval4)) = mkls(tid1, obsEmpty0, val2, optval1, val3, optval2), invDeq = pcf(tid0), lsf(tid2) = mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), apcf ≠ apcf(tid0; invDeq)(tid0; resDeq), DQGInv(mkgs(val1 ' + queue0)), DQLInv(mkgs(val1 ' + queue0), mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), pcf(tid2)), DQLInv(mkgs(val1 ' + queue0), mkls(tid0, obsEmpty, val, optval, val0, optval0), invDeq), fininvdeq(pcf), ∀ tid. alsf(tid) = mkls ((tid0 = tid ⊃ mkls(tid, obsEmpty, val, Val(val1), val0, optval0);lsf(tid)).tid, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, Val(val1), val0, optval0);lsf(tid)).ival, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, Val(val1), val0, optval0);lsf(tid)).oval, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, Val(val1), val0, optval0);lsf(tid)).value, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, Val(val1), val0, optval0);lsf(tid)).optval) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ resDeq;pcf(tid))) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(val1 ' + queue0), lsf(tid), pcf(tid)) ⊦

User applied rule expand left

And obtained the following new goals

Rule argument

pos: left 5

Additional information

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

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty, val, Val(val1), val0, optval0);mkls(tid2, obsEmpty1, val4, optval3, val5, optval4)) = mkls(tid1, obsEmpty0, val2, optval1, val3, optval2), invDeq = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid2) = mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), apcf(tid) ≠ apcf(tid0; invDeq)(tid0; resDeq)(tid), DQGInv(mkgs(val1 ' + queue0)), DQLInv(mkgs(val1 ' + queue0), mkls(tid0, obsEmpty, val, optval, val0, optval0), invDeq), DQLInv(mkgs(val1 ' + queue0), mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), pcf(tid2)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(val1 ' + queue0), lsf(tid), pcf(tid)), ∀ tid. alsf(tid) = mkls ((tid0 = tid ⊃ mkls(tid, obsEmpty, val, Val(val1), val0, optval0);lsf(tid)).tid, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, Val(val1), val0, optval0);lsf(tid)).ival, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, Val(val1), val0, optval0);lsf(tid)).oval, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, Val(val1), val0, optval0);lsf(tid)).value, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, Val(val1), val0, optval0);lsf(tid)).optval) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ resDeq;pcf(tid))) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty, val, Val(val1), val0, optval0);mkls(tid2, obsEmpty1, val4, optval3, val5, optval4)) = mkls(tid1, obsEmpty0, val2, optval1, val3, optval2), invDeq = pcf(tid0), lsf(tid2) = mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), apcf(tid) ≠ (tid0 = tid ⊃ resDeq;apcf(tid)), DQGInv(mkgs(val1 ' + queue0)), DQLInv(mkgs(val1 ' + queue0), mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), pcf(tid2)), DQLInv(mkgs(val1 ' + queue0), mkls(tid0, obsEmpty, val, optval, val0, optval0), invDeq), fininvdeq(pcf), ∀ tid. alsf(tid) = mkls ((tid0 = tid ⊃ mkls(tid, obsEmpty, val, Val(val1), val0, optval0);lsf(tid)).tid, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, Val(val1), val0, optval0);lsf(tid)).ival, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, Val(val1), val0, optval0);lsf(tid)).oval, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, Val(val1), val0, optval0);lsf(tid)).value, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, Val(val1), val0, optval0);lsf(tid)).optval) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ resDeq;pcf(tid))) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(val1 ' + queue0), lsf(tid), pcf(tid)) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 5

Additional information

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

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty, val, Val(val1), val0, optval0);mkls(tid2, obsEmpty1, val4, optval3, val5, optval4)) = mkls(tid1, obsEmpty0, val2, optval1, val3, optval2), invDeq = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid2) = mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), tid0 = tid, apcf(tid) ≠ resDeq, DQGInv(mkgs(val1 ' + queue0)), DQLInv(mkgs(val1 ' + queue0), mkls(tid0, obsEmpty, val, optval, val0, optval0), invDeq), DQLInv(mkgs(val1 ' + queue0), mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), pcf(tid2)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(val1 ' + queue0), lsf(tid), pcf(tid)), ∀ tid. alsf(tid) = mkls ((tid0 = tid ⊃ mkls(tid, obsEmpty, val, Val(val1), val0, optval0);lsf(tid)).tid, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, Val(val1), val0, optval0);lsf(tid)).ival, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, Val(val1), val0, optval0);lsf(tid)).oval, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, Val(val1), val0, optval0);lsf(tid)).value, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, Val(val1), val0, optval0);lsf(tid)).optval) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ resDeq;pcf(tid))) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

(tid = tid2 ⊃ mkls(tid2, obsEmpty, val, Val(val1), val0, optval0);mkls(tid2, obsEmpty1, val4, optval3, val5, optval4)) = mkls(tid1, obsEmpty0, val2, optval1, val3, optval2), invDeq = pcf(tid), lsf(tid2) = mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), apcf(tid) ≠ resDeq, DQGInv(mkgs(val1 ' + queue0)), DQLInv(mkgs(val1 ' + queue0), mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), pcf(tid2)), DQLInv(mkgs(val1 ' + queue0), mkls(tid, obsEmpty, val, optval, val0, optval0), invDeq), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(val1 ' + queue0), lsf(tid), pcf(tid)), ∀ tid0. alsf(tid0) = mkls ((tid = tid0 ⊃ mkls(tid0, obsEmpty, val, Val(val1), val0, optval0);lsf(tid0)).tid, (tid = tid0 ⊃ mkls(tid0, obsEmpty, val, Val(val1), val0, optval0);lsf(tid0)).ival, (tid = tid0 ⊃ mkls(tid0, obsEmpty, val, Val(val1), val0, optval0);lsf(tid0)).oval, (tid = tid0 ⊃ mkls(tid0, obsEmpty, val, Val(val1), val0, optval0);lsf(tid0)).value, (tid = tid0 ⊃ mkls(tid0, obsEmpty, val, Val(val1), val0, optval0);lsf(tid0)).optval) ∧ apcf(tid0) = bwabspcf((tid = tid0 ⊃ resDeq;pcf(tid0))) ∨ alsf(tid0) = mkls(lsf(tid0).tid, lsf(tid0).ival, Empty, lsf(tid0).value, lsf(tid0).optval) ∧ invDeq = pcf(tid0) ∧ apcf(tid0) = resDeq ∧ lsf(tid0).obsEmpty ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 11 terms: tid

Additional information

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

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

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty, val, Val(val1), val0, optval0);mkls(tid2, obsEmpty1, val4, optval3, val5, optval4)) = mkls(tid1, obsEmpty0, val2, optval1, val3, optval2), ags = mkdgs(queue0), invDeq = pcf(tid0), lsf(tid2) = mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), DQGInv(mkgs(val1 ' + queue0)), DQLInv(mkgs(val1 ' + queue0), mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), pcf(tid2)), DQLInv(mkgs(val1 ' + queue0), mkls(tid0, obsEmpty, val, optval, val0, optval0), invDeq), bwabs(mkstate(mkgs(queue0), lsf(tid0; mkls(tid0, obsEmpty, val, Val(val1), val0, optval0)), pcf(tid0; resDeq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(val1 ' + queue0), lsf(tid), pcf(tid)), alsf(tid2) = mkls(tid1, val2, optval1, val3, optval2) ∧ apcf(tid2) = bwabspcf((tid0 = tid2 ⊃ resDeq;pcf(tid2))) ∨ alsf(tid2) = mkls(tid2, val4, Empty, val5, optval4) ∧ tid0 ≠ tid2 ∧ invDeq = pcf(tid2) ∧ apcf(tid2) = resDeq ∧ obsEmpty1 ⊦ (tid0 = tid2 ⊃ mkls(tid2, val4, optval3, val5, optval4);alsf(tid2)) = mkls(tid2, val4, optval3, val5, optval4) ∧ (tid0 = tid2 ⊃ invDeq;apcf(tid2)) = bwabspcf(pcf(tid2)), alsf(tid2) = mkls(tid2, val4, Empty, val5, optval4) ∧ pcf(tid2) = invDeq ∧ tid0 ≠ tid2 ∧ resDeq = apcf(tid2) ∧ obsEmpty1

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty, val, Val(val1), val0, optval0);mkls(tid2, obsEmpty1, val4, optval3, val5, optval4)) = mkls(tid1, obsEmpty0, val2, optval1, val3, optval2), invDeq = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid2) = mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), DQGInv(mkgs(val1 ' + queue0)), DQLInv(mkgs(val1 ' + queue0), mkls(tid0, obsEmpty, val, optval, val0, optval0), invDeq), DQLInv(mkgs(val1 ' + queue0), mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), pcf(tid2)), bwabs(mkstate(mkgs(queue0), lsf(tid0; mkls(tid0, obsEmpty, val, Val(val1), val0, optval0)), pcf(tid0; resDeq)), mkstate(mkdgs(queue0), alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(val1 ' + queue0), lsf(tid), pcf(tid)), alsf(tid2) = mkls(tid1, val2, optval1, val3, optval2) ∧ apcf(tid2) = bwabspcf((tid0 = tid2 ⊃ resDeq;pcf(tid2))) ∨ alsf(tid2) = mkls(tid2, val4, Empty, val5, optval4) ∧ tid0 ≠ tid2 ∧ invDeq = pcf(tid2) ∧ apcf(tid2) = resDeq ∧ obsEmpty1 ⊦ alsf(tid2) = mkls(tid2, val4, Empty, val5, optval4) ∧ pcf(tid2) = invDeq ∧ tid0 ≠ tid2 ∧ resDeq = apcf(tid2) ∧ obsEmpty1, (tid0 = tid2 ⊃ mkls(tid2, val4, optval3, val5, optval4);alsf(tid2)) = mkls(tid2, val4, optval3, val5, optval4) ∧ (tid0 = tid2 ⊃ invDeq;apcf(tid2)) = bwabspcf(pcf(tid2))

User applied rule case distinction

And closed the goal!

Rule argument

pos: left 1

Additional information

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

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

ca = DoEnq(tid0), lsf(ca.tid) = mkls(ca.tid, obsEmpty, val, optval, val0, optval0), ca ≠ globalCrash, DQGInv(gs), DQLInv(gs, mkls(ca.tid, obsEmpty, val, optval, val0, optval0), pcf(ca.tid)), bwabs (mkstate(gstepf(gs, lsf(tid), pcf(tid), ca), lsf(tid; lstepf(gs, lsf(tid), pcf(tid), ca)), pcf(tid; pcstepf(gs, lsf(tid), pcf(tid), ca))), mkstate(ags, alsf, apcf)), fininvdeq(pcf), pre(gs, lsf(tid), pcf(tid), ca), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ (∃ tid. ca = CheckEmp(tid) ⊃ (apcf(ca.tid) = resDeq ⊃ ADoDeq(ca.tid);τ);bwabsa(ca)) = τ, ∃ durqs. DurQstep(durqs, (∃ tid. ca = CheckEmp(tid) ⊃ (apcf(ca.tid) = resDeq ⊃ ADoDeq(ca.tid);τ);bwabsa(ca)), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ADoEnq(tid) ≠ τ; (s) ⊦ bwabsa(DoEnq(tid)) = ADoEnq(tid); (s) ⊦ CheckEmp(tid) ≠ DoEnq(tid0); (s) ⊦ DoEnq(tid).tid = tid; (s) ⊦ DoEnq(tid) ≠ globalCrash; (s)

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

lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), DQGInv(gs), DQLInv(gs, mkls(tid0, obsEmpty, val, optval, val0, optval0), pcf(tid0)), bwabs (mkstate (gstepf(gs, lsf(tid), pcf(tid), DoEnq(tid0)), lsf(tid; lstepf(gs, lsf(tid), pcf(tid), DoEnq(tid0))), pcf(tid; pcstepf(gs, lsf(tid), pcf(tid), DoEnq(tid0)))), mkstate(ags, alsf, apcf)), fininvdeq(pcf), pre(gs, lsf(tid), pcf(tid), DoEnq(tid0)), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ ∃ durqs. DurQstep(durqs, ADoEnq(tid0), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

User applied rule structural induction

And obtained the following new goals

Rule argument

term: pcf(tid)

Additional information

Used simplifier rules: DQPC freely generated by crashed, idle, invDeq, invEnq, ready, resDeq, resEnq;; ⊦ pre(gs, ls, resEnq, a) ↔ a = RetEnq(ls.tid); (s) ⊦ DoEnq(tid) ≠ RetEnq(tid0); (s) ⊦ pre(gs, ls, resDeq, a) ↔ a = RetDeq(ls.tid, ls.oval); (s) ⊦ DoEnq(tid) ≠ RetDeq(tid0, optval); (s) ⊦ gstepf(gs, ls, ready, a) = gs; (s) ⊦ pre(gs, ls, ready, a) ↔ (∃ value. a = InvEnq(ls.tid, value)) ∨ a = InvDeq(ls.tid); (s) ⊦ DoEnq(tid) ≠ InvEnq(tid0, val); (s) ⊦ DoEnq(tid) ≠ InvDeq(tid0); (s) ⊦ pre(gs, ls, invDeq, a) ↔ a = CheckEmp(ls.tid) ∧ gs.queue = [] ∨ a = DoDeqEmpty(ls.tid) ∧ ls.obsEmpty ∨ a = DoDeq(ls.tid) ∧ gs.queue ≠ []; (s) ⊦ CheckEmp(tid) ≠ DoEnq(tid0); (s) ⊦ DoDeqEmpty(tid) ≠ DoEnq(tid0); (s) ⊦ DoDeq(tid) ≠ DoEnq(tid0); (s) ⊦ pre(gs, ls, idle, a) ↔ a = callRun(ls.tid); (s) ⊦ DoEnq(tid) ≠ callRun(tid0); (s) ⊦ pre(gs, ls, crashed, a) ↔ false; (s)

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

invEnq = pcf(tid), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), DQGInv(gs), DQLInv(gs, mkls(tid0, obsEmpty, val, optval, val0, optval0), pcf(tid0)), bwabs (mkstate (gstepf(gs, lsf(tid), pcf(tid), DoEnq(tid0)), lsf(tid; lstepf(gs, lsf(tid), pcf(tid), DoEnq(tid0))), pcf(tid; pcstepf(gs, lsf(tid), pcf(tid), DoEnq(tid0)))), mkstate(ags, alsf, apcf)), fininvdeq(pcf), pre(gs, lsf(tid), pcf(tid), DoEnq(tid0)), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ ∃ durqs. DurQstep(durqs, ADoEnq(tid0), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ pcstepf(gs, ls, invEnq, DoEnq(ls.tid)) = resEnq; (s) ⊦ lstepf(gs, ls, invEnq, DoEnq(ls.tid)) = ls; (s) ⊦ x + a = x + a '; (s) ⊦ gstepf(gs, ls, invEnq, DoEnq(ls.tid)) = gs.queue:= (gs.queue + ls.ival); (s) ⊦ DoEnq(tid) = DoEnq(tid0) ↔ tid = tid0; (s) ⊦ pre(gs, ls, invEnq, a) ↔ a = DoEnq(ls.tid); (s)

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

invEnq = pcf(tid), lsf(lsf(tid).tid) = mkls(lsf(tid).tid, obsEmpty, val, optval, val0, optval0), DQGInv(gs), DQLInv(gs, mkls(lsf(tid).tid, obsEmpty, val, optval, val0, optval0), pcf(lsf(tid).tid)), bwabs(mkstate(gs.queue:= (gs.queue + lsf(tid).ival '), lsf(tid; lsf(tid)), pcf(tid; resEnq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ ∃ durqs. DurQstep(durqs, ADoEnq(lsf(tid).tid), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

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 118 from proof bwsim-step-nontau (previous step) (back to tree)

gs = mkgs(queue), invEnq = pcf(tid), lsf(lsf(tid).tid) = mkls(lsf(tid).tid, obsEmpty, val, optval, val0, optval0), DQGInv(gs), DQLInv(gs, mkls(lsf(tid).tid, obsEmpty, val, optval, val0, optval0), pcf(lsf(tid).tid)), bwabs(mkstate(gs.queue:= (queue + lsf(tid).ival '), lsf(tid; lsf(tid)), pcf(tid; resEnq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ ∃ durqs. DurQstep(durqs, ADoEnq(lsf(tid).tid), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ mkgs(queue).queue:= queue0 = mkgs(queue0); (s)

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

invEnq = pcf(tid), lsf(lsf(tid).tid) = mkls(lsf(tid).tid, obsEmpty, val, optval, val0, optval0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(lsf(tid).tid, obsEmpty, val, optval, val0, optval0), pcf(lsf(tid).tid)), bwabs(mkstate(mkgs(queue + lsf(tid).ival '), lsf(tid; lsf(tid)), pcf(tid; resEnq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦ ∃ durqs. DurQstep(durqs, ADoEnq(lsf(tid).tid), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(mkgs(queue), lsf, pcf), durqs)

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, obsEmpty0, lsf(tid), optval1, tid0, 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, obsEmpty0, lsf(tid), oval, tid0, optval1

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

invEnq = pcf(tid), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), pcf(tid0)), bwabs(mkstate(mkgs(queue + val1 '), lsf(tid; lsf(tid)), pcf(tid; resEnq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦ ∃ durqs. DurQstep(durqs, ADoEnq(tid0), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(mkgs(queue), lsf, pcf), durqs)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

invEnq = pcf(tid), lsf(tid) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), pcf(tid0)), bwabs(mkstate(mkgs(queue + val1 '), lsf(tid; mkls(tid0, obsEmpty0, val1, optval1, val2, optval2)), pcf(tid; resEnq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦ ∃ durqs. DurQstep(durqs, ADoEnq(tid0), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(mkgs(queue), lsf, pcf), durqs)

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 8 terms: tid abort: F discard: F computed: F

Additional information

Used terms: tid

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

lsf(tid).tid = tid, invEnq = pcf(tid), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), pcf(tid0)), DQLInv(mkgs(queue), lsf(tid), pcf(tid)), bwabs(mkstate(mkgs(queue + val1 '), lsf(tid; mkls(tid0, obsEmpty0, val1, optval1, val2, optval2)), pcf(tid; resEnq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦ ∃ durqs. DurQstep(durqs, ADoEnq(tid0), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(mkgs(queue), lsf, pcf), durqs)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

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

invEnq = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), invEnq), bwabs(mkstate(mkgs(queue + val '), lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0)), pcf(tid0; resEnq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦ ∃ durqs. DurQstep(durqs, ADoEnq(tid0), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(mkgs(queue), lsf, pcf), durqs)

User applied rule exists right

And obtained the following new goals

Rule argument

pos: right 1 terms: mkstate(mkdgs(queue), alsf(tid0; bwlabsf(lsf(tid0))), apcf(tid0; invEnq)) abort: F discard: T computed: F

Additional information

Used terms: mkstate(mkdgs(queue), alsf(tid0; bwlabsf(lsf(tid0))), apcf(tid0; invEnq))

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

invEnq = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), invEnq), bwabs(mkstate(mkgs(queue + val '), lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0)), pcf(tid0; resEnq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦ DurQstep(mkstate(mkdgs(queue), alsf(tid0; bwlabsf(lsf(tid0))), apcf(tid0; invEnq)), ADoEnq(tid0), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(mkgs(queue), lsf, pcf), mkstate(mkdgs(queue), alsf(tid0; bwlabsf(lsf(tid0))), apcf(tid0; invEnq)))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).optval = oval0; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).value = ival0; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).oval = oval; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).ival = ival; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).tid = tid; (s) ⊦ invEnq ≠ resDeq; (s) ⊦ invDeq ≠ resEnq; (s) ⊦ mkdgs(queue) = mkdgs(queue0) ↔ queue = queue0; (s) ⊦ mkgs(queue).queue = queue; (s) ⊦ bwabs(mkstate(gs, lsf, pcf), mkstate(ags, alsf, apcf)) → ( bwabs(mkstate(gs0, lsf0, pcf0), mkstate(ags0, alsf0, apcf0)) ↔ ags = mkdgs(gs.queue) → ags0 = mkdgs(gs0.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 → alsf0(tid) = mkls (lsf0(tid).tid, lsf0(tid).ival, lsf0(tid).oval, lsf0(tid).value, lsf0(tid).optval) ∧ apcf0(tid) = bwabspcf(pcf0(tid)) ∨ alsf0(tid) = mkls (lsf0(tid).tid, lsf0(tid).ival, Empty, lsf0(tid).value, lsf0(tid).optval) ∧ pcf0(tid) = invDeq ∧ apcf0(tid) = resDeq ∧ lsf0(tid).obsEmpty)); (s) ⊦ bwlabsf(ls) = mkls(ls.tid, ls.ival, ls.oval, ls.value, ls.optval); (s)

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

invEnq = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), invEnq), bwabs(mkstate(mkgs(queue + val '), lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0)), pcf(tid0; resEnq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦ DurQstep(mkstate(mkdgs(queue), alsf(tid0; mkls(tid0, val, optval, val0, optval0)), apcf(tid0; invEnq)), ADoEnq(tid0), mkstate(ags, alsf, apcf)) ∧ ( ags = mkdgs(queue + val ') → alsf(tid) = mkls ((tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).tid, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).ival, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).oval, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).value, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).optval) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ resEnq;pcf(tid))) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty → (tid0 = tid ⊃ mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval);alsf(tid)) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ (tid0 = tid ⊃ invEnq;apcf(tid)) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ tid0 ≠ tid ∧ resDeq = apcf(tid) ∧ lsf(tid).obsEmpty)

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, obsEmpty0, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);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, obsEmpty0, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)), oval, tid1, optval1

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

(tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), invEnq = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), invEnq), bwabs(mkstate(mkgs(queue + val '), lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0)), pcf(tid0; resEnq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦ DurQstep(mkstate(mkdgs(queue), alsf(tid0; mkls(tid0, val, optval, val0, optval0)), apcf(tid0; invEnq)), ADoEnq(tid0), mkstate(ags, alsf, apcf)) ∧ ( ags = mkdgs(queue + val ') → alsf(tid) = mkls(tid1, val1, optval1, val2, optval2) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ resEnq;pcf(tid))) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty → (tid0 = tid ⊃ mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval);alsf(tid)) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ (tid0 = tid ⊃ invEnq;apcf(tid)) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ tid0 ≠ tid ∧ resDeq = apcf(tid) ∧ lsf(tid).obsEmpty)

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] → [val4, val3, obsEmpty1, lsf(tid), optval3, tid2, optval4]

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, obsEmpty1, lsf(tid), oval, tid2, optval3

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

(tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), invEnq = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), invEnq), bwabs(mkstate(mkgs(queue + val '), lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0)), pcf(tid0; resEnq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦ DurQstep(mkstate(mkdgs(queue), alsf(tid0; mkls(tid0, val, optval, val0, optval0)), apcf(tid0; invEnq)), ADoEnq(tid0), mkstate(ags, alsf, apcf)) ∧ ( ags = mkdgs(queue + val ') → alsf(tid) = mkls(tid1, val1, optval1, val2, optval2) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ resEnq;pcf(tid))) ∨ alsf(tid) = mkls(tid2, val3, Empty, val4, optval4) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ obsEmpty1 → (tid0 = tid ⊃ mkls(tid2, val3, optval3, val4, optval4);alsf(tid)) = mkls(tid2, val3, optval3, val4, optval4) ∧ (tid0 = tid ⊃ invEnq;apcf(tid)) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(tid2, val3, Empty, val4, optval4) ∧ pcf(tid) = invDeq ∧ tid0 ≠ tid ∧ resDeq = apcf(tid) ∧ obsEmpty1)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

(tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), invEnq = pcf(tid0), lsf(tid) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), invEnq), bwabs(mkstate(mkgs(queue + val '), lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0)), pcf(tid0; resEnq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦ DurQstep(mkstate(mkdgs(queue), alsf(tid0; mkls(tid0, val, optval, val0, optval0)), apcf(tid0; invEnq)), ADoEnq(tid0), mkstate(ags, alsf, apcf)) ∧ ( ags = mkdgs(queue + val ') → alsf(tid) = mkls(tid1, val1, optval1, val2, optval2) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ resEnq;pcf(tid))) ∨ alsf(tid) = mkls(tid2, val3, Empty, val4, optval4) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ obsEmpty1 → (tid0 = tid ⊃ mkls(tid2, val3, optval3, val4, optval4);alsf(tid)) = mkls(tid2, val3, optval3, val4, optval4) ∧ (tid0 = tid ⊃ invEnq;apcf(tid)) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(tid2, val3, Empty, val4, optval4) ∧ pcf(tid) = invDeq ∧ tid0 ≠ tid ∧ resDeq = apcf(tid) ∧ obsEmpty1)

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 9 terms: tid abort: F discard: F computed: F

Additional information

Used terms: tid

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

lsf(tid).tid = tid, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), invEnq = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), invEnq), DQLInv(mkgs(queue), lsf(tid), pcf(tid)), bwabs(mkstate(mkgs(queue + val '), lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0)), pcf(tid0; resEnq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦ DurQstep(mkstate(mkdgs(queue), alsf(tid0; mkls(tid0, val, optval, val0, optval0)), apcf(tid0; invEnq)), ADoEnq(tid0), mkstate(ags, alsf, apcf)) ∧ ( ags = mkdgs(queue + val ') → alsf(tid) = mkls(tid1, val1, optval1, val2, optval2) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ resEnq;pcf(tid))) ∨ alsf(tid) = mkls(tid2, val3, Empty, val4, optval4) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ obsEmpty1 → (tid0 = tid ⊃ mkls(tid2, val3, optval3, val4, optval4);alsf(tid)) = mkls(tid2, val3, optval3, val4, optval4) ∧ (tid0 = tid ⊃ invEnq;apcf(tid)) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(tid2, val3, Empty, val4, optval4) ∧ pcf(tid) = invDeq ∧ tid0 ≠ tid ∧ resDeq = apcf(tid) ∧ obsEmpty1)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

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

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), invEnq = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), invEnq), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), bwabs(mkstate(mkgs(queue + val '), lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0)), pcf(tid0; resEnq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦ DurQstep(mkstate(mkdgs(queue), alsf(tid0; mkls(tid0, val, optval, val0, optval0)), apcf(tid0; invEnq)), ADoEnq(tid0), mkstate(ags, alsf, apcf)) ∧ ( ags = mkdgs(queue + val ') → alsf(tid2) = mkls(tid1, val1, optval1, val2, optval2) ∧ apcf(tid2) = bwabspcf((tid0 = tid2 ⊃ resEnq;pcf(tid2))) ∨ alsf(tid2) = mkls(tid2, val3, Empty, val4, optval4) ∧ tid0 ≠ tid2 ∧ invDeq = pcf(tid2) ∧ apcf(tid2) = resDeq ∧ obsEmpty1 → (tid0 = tid2 ⊃ mkls(tid2, val3, optval3, val4, optval4);alsf(tid2)) = mkls(tid2, val3, optval3, val4, optval4) ∧ (tid0 = tid2 ⊃ invEnq;apcf(tid2)) = bwabspcf(pcf(tid2)) ∨ alsf(tid2) = mkls(tid2, val3, Empty, val4, optval4) ∧ pcf(tid2) = invDeq ∧ tid0 ≠ tid2 ∧ resDeq = apcf(tid2) ∧ obsEmpty1)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

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

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), invEnq = pcf(tid0), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), invEnq), bwabs(mkstate(mkgs(queue + val '), lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0)), pcf(tid0; resEnq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ¬ DurQstep(mkstate(mkdgs(queue), alsf(tid0; mkls(tid0, val, optval, val0, optval0)), apcf(tid0; invEnq)), ADoEnq(tid0), mkstate(ags, alsf, apcf)), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(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), alsf(tid0; mkls(tid0, val, optval, val0, optval0)), ADoEnq(tid0), mkdgs(queue), apcf(tid0; invEnq)], <all paths>

Additional information

Used terms: mkstate(ags, alsf, apcf), alsf(tid0; mkls(tid0, val, optval, val0, optval0)), ADoEnq(tid0), mkdgs(queue), apcf(tid0; invEnq)

Proof step 132 from proof bwsim-step-nontau (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 133 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), invEnq = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), invEnq), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), bwabs(mkstate(mkgs(queue + val '), lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0)), pcf(tid0; resEnq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), (ADoEnq(tid0) = globalACrash ⊃ mkstate(ags, alsf, apcf) ≠ mkstate(mkdgs(queue), alsf(tid0; mkls(tid0, val, optval, val0, optval0)), λ tid. (apcf(tid0; invEnq)(tid) = idle ⊃ idle;crashed)) ;∀ tid. ¬ ( pre(mkdgs(queue), alsf(tid0; mkls(tid0, val, optval, val0, optval0))(tid), apcf(tid0; invEnq)(tid), ADoEnq(tid0)) ∧ mkstate(ags, alsf, apcf) = mkstate (gstepf(mkdgs(queue), alsf(tid0; mkls(tid0, val, optval, val0, optval0))(tid), apcf(tid0; invEnq)(tid), ADoEnq(tid0)), alsf(tid0; mkls(tid0, val, optval, val0, optval0)) (tid; lstepf(mkdgs(queue), alsf(tid0; mkls(tid0, val, optval, val0, optval0))(tid), apcf(tid0; invEnq)(tid), ADoEnq(tid0))), apcf(tid0; invEnq) (tid; pcstepf(mkdgs(queue), alsf(tid0; mkls(tid0, val, optval, val0, optval0))(tid), apcf(tid0; invEnq)(tid), ADoEnq(tid0))))) ), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ADoEnq(tid) ≠ globalACrash; (s)

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

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), invEnq = pcf(tid0), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), invEnq), bwabs(mkstate(mkgs(queue + val '), lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0)), pcf(tid0; resEnq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ∀ tid. ¬ pre(mkdgs(queue), (tid0 = tid ⊃ mkls(tid, val, optval, val0, optval0);alsf(tid)), (tid0 = tid ⊃ invEnq;apcf(tid)), ADoEnq(tid0)) ∨ mkstate(ags, alsf, apcf) ≠ mkstate (gstepf(mkdgs(queue), (tid0 = tid ⊃ mkls(tid, val, optval, val0, optval0);alsf(tid)), (tid0 = tid ⊃ invEnq;apcf(tid)), ADoEnq(tid0)), alsf(tid0; mkls(tid0, val, optval, val0, optval0)) (tid; lstepf(mkdgs(queue), (tid0 = tid ⊃ mkls(tid, val, optval, val0, optval0);alsf(tid)), (tid0 = tid ⊃ invEnq;apcf(tid)), ADoEnq(tid0))), apcf(tid0; invEnq) (tid; pcstepf(mkdgs(queue), (tid0 = tid ⊃ mkls(tid, val, optval, val0, optval0);alsf(tid)), (tid0 = tid ⊃ invEnq;apcf(tid)), ADoEnq(tid0)))) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

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

Additional information

Used terms: tid0

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

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), invEnq = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), invEnq), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), bwabs(mkstate(mkgs(queue + val '), lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0)), pcf(tid0; resEnq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ¬ pre(mkdgs(queue), (tid0 = tid0 ⊃ mkls(tid0, val, optval, val0, optval0);alsf(tid0)), (tid0 = tid0 ⊃ invEnq;apcf(tid0)), ADoEnq(tid0)) ∨ mkstate(ags, alsf, apcf) ≠ mkstate (gstepf(mkdgs(queue), (tid0 = tid0 ⊃ mkls(tid0, val, optval, val0, optval0);alsf(tid0)), (tid0 = tid0 ⊃ invEnq;apcf(tid0)), ADoEnq(tid0)), alsf(tid0; mkls(tid0, val, optval, val0, optval0)) (tid0; lstepf(mkdgs(queue), (tid0 = tid0 ⊃ mkls(tid0, val, optval, val0, optval0);alsf(tid0)), (tid0 = tid0 ⊃ invEnq;apcf(tid0)), ADoEnq(tid0))), apcf(tid0; invEnq) (tid0; pcstepf(mkdgs(queue), (tid0 = tid0 ⊃ mkls(tid0, val, optval, val0, optval0);alsf(tid0)), (tid0 = tid0 ⊃ invEnq;apcf(tid0)), ADoEnq(tid0)))) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ pcstepf(gs, mkls(tid, ival, oval, value, optval), invEnq, ADoEnq(tid)) = resEnq; (s) ⊦ lstepf(gs, mkls(tid, ival, oval, value, optval), invEnq, ADoEnq(tid)) = mkls(tid, ival, oval, value, optval); (s) ⊦ mkdgs(queue).queue:= queue0 = mkdgs(queue0); (s) ⊦ x + a = x + a '; (s) ⊦ mkdgs(queue).queue = queue; (s) ⊦ gstepf(gs, mkls(tid, ival, oval, value, optval), invEnq, ADoEnq(tid)) = gs.queue:= (gs.queue + ival); (s) ⊦ ADoEnq(tid) = ADoEnq(tid0) ↔ tid = tid0; (s) ⊦ mkls(tid, ival, oval, ival0, oval0).tid = tid; (s) ⊦ pre(gs, ls, invEnq, a) ↔ a = ADoEnq(ls.tid); (s)

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

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), invEnq = pcf(tid0), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), mkstate(ags, alsf, apcf) ≠ mkstate (mkdgs(queue + val '), alsf(tid0; mkls(tid0, val, optval, val0, optval0))(tid0; mkls(tid0, val, optval, val0, optval0)), apcf(tid0; invEnq)(tid0; resEnq)), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), invEnq), bwabs(mkstate(mkgs(queue + val '), lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0)), pcf(tid0; resEnq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DurQ[DurQ-ren], name:inj-mkstate, seq:⊦ mkstate(gstate, lsf, pcf) = mkstate(gstate0, lsf0, pcf0) ↔ gstate = gstate0 ∧ lsf = lsf0 ∧ pcf = pcf0, subst:[gstate, pcf0, lsf0, lsf, gstate0, pcf] → [ags, apcf(tid0; invEnq)(tid0; resEnq), alsf(tid0; mkls(tid0, val, optval, val0, optval0)) (tid0; mkls(tid0, val, optval, val0, optval0)), alsf, mkdgs(queue + val '), apcf], <all paths>

Additional information

Used terms: ags, apcf(tid0; invEnq)(tid0; resEnq), alsf(tid0; mkls(tid0, val, optval, val0, optval0)) (tid0; mkls(tid0, val, optval, val0, optval0)), alsf, mkdgs(queue + val '), apcf

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

⊦ mkstate(gstate, lsf, pcf) = mkstate(gstate0, lsf0, pcf0) ↔ gstate = gstate0 ∧ lsf = lsf0 ∧ pcf = pcf0

A spec-lemma

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

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), invEnq = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), invEnq), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), bwabs(mkstate(mkgs(queue + val '), lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0)), pcf(tid0; resEnq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ags ≠ mkdgs(queue + val ') ∨ alsf ≠ alsf(tid0; mkls(tid0, val, optval, val0, optval0))(tid0; mkls(tid0, val, optval, val0, optval0)) ∨ apcf ≠ apcf(tid0; invEnq)(tid0; resEnq) ⊦

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 + val '), alsf, lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0)), ags, pcf(tid0; resEnq), apcf], <all paths>

Additional information

Used terms: mkgs(queue + val '), alsf, lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0)), ags, pcf(tid0; resEnq), apcf

Proof step 139 from proof bwsim-step-nontau (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 140 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), ags = mkdgs(mkgs(queue + val ').queue), invEnq = pcf(tid0), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), invEnq), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ∀ tid. alsf(tid) = mkls (lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0))(tid).tid, lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0))(tid).ival, lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0))(tid).oval, lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0))(tid).value, lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0))(tid).optval) ∧ apcf(tid) = bwabspcf(pcf(tid0; resEnq)(tid)) ∨ alsf(tid) = mkls (lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0))(tid).tid, lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0))(tid).ival, Empty, lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0))(tid).value, lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0))(tid).optval) ∧ pcf(tid0; resEnq)(tid) = invDeq ∧ apcf(tid) = resDeq ∧ lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0))(tid).obsEmpty, ags ≠ mkdgs(queue + val ') ∨ alsf ≠ alsf(tid0; mkls(tid0, val, optval, val0, optval0))(tid0; mkls(tid0, val, optval, val0, optval0)) ∨ apcf ≠ apcf(tid0; invEnq)(tid0; resEnq) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ invDeq ≠ resEnq; (s) ⊦ mkdgs(queue) = mkdgs(queue0) ↔ queue = queue0; (s) ⊦ mkgs(queue).queue = queue; (s)

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

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), invEnq = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), invEnq), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ∀ tid. alsf(tid) = mkls ((tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).tid, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).ival, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).oval, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).value, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).optval) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ resEnq;pcf(tid))) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty, alsf ≠ alsf(tid0; mkls(tid0, val, optval, val0, optval0))(tid0; mkls(tid0, val, optval, val0, optval0)) ∨ apcf ≠ apcf(tid0; invEnq)(tid0; resEnq) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 11

Additional information

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

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), invEnq = pcf(tid0), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), alsf ≠ alsf(tid0; mkls(tid0, val, optval, val0, optval0))(tid0; mkls(tid0, val, optval, val0, optval0)), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), invEnq), fininvdeq(pcf), ∀ tid. alsf(tid) = mkls ((tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).tid, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).ival, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).oval, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).value, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).optval) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ resEnq;pcf(tid))) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦

User applied rule expand left

And obtained the following new goals

Rule argument

pos: left 5

Additional information

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

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), invEnq = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), alsf(tid) ≠ alsf(tid0; mkls(tid0, val, optval, val0, optval0))(tid0; mkls(tid0, val, optval, val0, optval0))(tid), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), invEnq), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ∀ tid. alsf(tid) = mkls ((tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).tid, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).ival, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).oval, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).value, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).optval) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ resEnq;pcf(tid))) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), invEnq = pcf(tid0), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), alsf(tid) ≠ (tid0 = tid ⊃ mkls(tid, val, optval, val0, optval0);alsf(tid)), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), invEnq), fininvdeq(pcf), ∀ tid. alsf(tid) = mkls ((tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).tid, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).ival, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).oval, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).value, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).optval) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ resEnq;pcf(tid))) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 5

Additional information

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

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), invEnq = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), tid0 = tid, alsf(tid) ≠ mkls(tid, val, optval, val0, optval0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), invEnq), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ∀ tid. alsf(tid) = mkls ((tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).tid, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).ival, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).oval, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).value, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).optval) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ resEnq;pcf(tid))) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

(tid = tid2 ⊃ mkls(tid2, obsEmpty, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), invEnq = pcf(tid), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), alsf(tid) ≠ mkls(tid, val, optval, val0, optval0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), DQLInv(mkgs(queue), mkls(tid, obsEmpty, val, optval, val0, optval0), invEnq), fininvdeq(pcf), ∀ tid1. alsf(tid1) = mkls ((tid = tid1 ⊃ mkls(tid1, obsEmpty, val, optval, val0, optval0);lsf(tid1)).tid, (tid = tid1 ⊃ mkls(tid1, obsEmpty, val, optval, val0, optval0);lsf(tid1)).ival, (tid = tid1 ⊃ mkls(tid1, obsEmpty, val, optval, val0, optval0);lsf(tid1)).oval, (tid = tid1 ⊃ mkls(tid1, obsEmpty, val, optval, val0, optval0);lsf(tid1)).value, (tid = tid1 ⊃ mkls(tid1, obsEmpty, val, optval, val0, optval0);lsf(tid1)).optval) ∧ apcf(tid1) = bwabspcf((tid = tid1 ⊃ resEnq;pcf(tid1))) ∨ alsf(tid1) = mkls(lsf(tid1).tid, lsf(tid1).ival, Empty, lsf(tid1).value, lsf(tid1).optval) ∧ tid ≠ tid1 ∧ invDeq = pcf(tid1) ∧ apcf(tid1) = resDeq ∧ lsf(tid1).obsEmpty, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 10 terms: tid

Additional information

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

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

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), invEnq = pcf(tid0), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), apcf ≠ apcf(tid0; invEnq)(tid0; resEnq), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), invEnq), fininvdeq(pcf), ∀ tid. alsf(tid) = mkls ((tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).tid, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).ival, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).oval, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).value, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).optval) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ resEnq;pcf(tid))) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦

User applied rule expand left

And obtained the following new goals

Rule argument

pos: left 5

Additional information

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

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), invEnq = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), apcf(tid) ≠ apcf(tid0; invEnq)(tid0; resEnq)(tid), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), invEnq), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ∀ tid. alsf(tid) = mkls ((tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).tid, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).ival, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).oval, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).value, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).optval) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ resEnq;pcf(tid))) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), invEnq = pcf(tid0), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), apcf(tid) ≠ (tid0 = tid ⊃ resEnq;apcf(tid)), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), invEnq), fininvdeq(pcf), ∀ tid. alsf(tid) = mkls ((tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).tid, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).ival, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).oval, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).value, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).optval) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ resEnq;pcf(tid))) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 5

Additional information

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

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), invEnq = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), tid0 = tid, apcf(tid) ≠ resEnq, DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), invEnq), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ∀ tid. alsf(tid) = mkls ((tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).tid, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).ival, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).oval, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).value, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).optval) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ resEnq;pcf(tid))) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

(tid = tid2 ⊃ mkls(tid2, obsEmpty, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), invEnq = pcf(tid), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), apcf(tid) ≠ resEnq, DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), DQLInv(mkgs(queue), mkls(tid, obsEmpty, val, optval, val0, optval0), invEnq), fininvdeq(pcf), ∀ tid1. alsf(tid1) = mkls ((tid = tid1 ⊃ mkls(tid1, obsEmpty, val, optval, val0, optval0);lsf(tid1)).tid, (tid = tid1 ⊃ mkls(tid1, obsEmpty, val, optval, val0, optval0);lsf(tid1)).ival, (tid = tid1 ⊃ mkls(tid1, obsEmpty, val, optval, val0, optval0);lsf(tid1)).oval, (tid = tid1 ⊃ mkls(tid1, obsEmpty, val, optval, val0, optval0);lsf(tid1)).value, (tid = tid1 ⊃ mkls(tid1, obsEmpty, val, optval, val0, optval0);lsf(tid1)).optval) ∧ apcf(tid1) = bwabspcf((tid = tid1 ⊃ resEnq;pcf(tid1))) ∨ alsf(tid1) = mkls(lsf(tid1).tid, lsf(tid1).ival, Empty, lsf(tid1).value, lsf(tid1).optval) ∧ tid ≠ tid1 ∧ invDeq = pcf(tid1) ∧ apcf(tid1) = resDeq ∧ lsf(tid1).obsEmpty, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 10 terms: tid

Additional information

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

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

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), ags = mkdgs(queue + val '), invEnq = pcf(tid0), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), invEnq), bwabs(mkstate(mkgs(queue + val '), lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0)), pcf(tid0; resEnq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), alsf(tid2) = mkls(tid1, val1, optval1, val2, optval2) ∧ apcf(tid2) = bwabspcf((tid0 = tid2 ⊃ resEnq;pcf(tid2))) ∨ alsf(tid2) = mkls(tid2, val3, Empty, val4, optval4) ∧ tid0 ≠ tid2 ∧ invDeq = pcf(tid2) ∧ apcf(tid2) = resDeq ∧ obsEmpty1 ⊦ (tid0 = tid2 ⊃ mkls(tid2, val3, optval3, val4, optval4);alsf(tid2)) = mkls(tid2, val3, optval3, val4, optval4) ∧ (tid0 = tid2 ⊃ invEnq;apcf(tid2)) = bwabspcf(pcf(tid2)), alsf(tid2) = mkls(tid2, val3, Empty, val4, optval4) ∧ pcf(tid2) = invDeq ∧ tid0 ≠ tid2 ∧ resDeq = apcf(tid2) ∧ obsEmpty1

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), invEnq = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), invEnq), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), bwabs (mkstate(mkgs(queue + val '), lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0)), pcf(tid0; resEnq)), mkstate(mkdgs(queue + val '), alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), alsf(tid2) = mkls(tid1, val1, optval1, val2, optval2) ∧ apcf(tid2) = bwabspcf((tid0 = tid2 ⊃ resEnq;pcf(tid2))) ∨ alsf(tid2) = mkls(tid2, val3, Empty, val4, optval4) ∧ tid0 ≠ tid2 ∧ invDeq = pcf(tid2) ∧ apcf(tid2) = resDeq ∧ obsEmpty1 ⊦ alsf(tid2) = mkls(tid2, val3, Empty, val4, optval4) ∧ pcf(tid2) = invDeq ∧ tid0 ≠ tid2 ∧ resDeq = apcf(tid2) ∧ obsEmpty1, (tid0 = tid2 ⊃ mkls(tid2, val3, optval3, val4, optval4);alsf(tid2)) = mkls(tid2, val3, optval3, val4, optval4) ∧ (tid0 = tid2 ⊃ invEnq;apcf(tid2)) = bwabspcf(pcf(tid2))

User applied rule case distinction

And closed the goal!

Rule argument

pos: left 1

Additional information

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

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

ca = InvDeq(tid0), lsf(ca.tid) = mkls(ca.tid, obsEmpty, val, optval, val0, optval0), ca ≠ globalCrash, DQGInv(gs), DQLInv(gs, mkls(ca.tid, obsEmpty, val, optval, val0, optval0), pcf(ca.tid)), bwabs (mkstate(gstepf(gs, lsf(tid), pcf(tid), ca), lsf(tid; lstepf(gs, lsf(tid), pcf(tid), ca)), pcf(tid; pcstepf(gs, lsf(tid), pcf(tid), ca))), mkstate(ags, alsf, apcf)), fininvdeq(pcf), pre(gs, lsf(tid), pcf(tid), ca), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ (∃ tid. ca = CheckEmp(tid) ⊃ (apcf(ca.tid) = resDeq ⊃ ADoDeq(ca.tid);τ);bwabsa(ca)) = τ, ∃ durqs. DurQstep(durqs, (∃ tid. ca = CheckEmp(tid) ⊃ (apcf(ca.tid) = resDeq ⊃ ADoDeq(ca.tid);τ);bwabsa(ca)), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ AInvDeq(tid) ≠ τ; (s) ⊦ bwabsa(InvDeq(tid)) = AInvDeq(tid); (s) ⊦ CheckEmp(tid) ≠ InvDeq(tid0); (s) ⊦ InvDeq(tid).tid = tid; (s) ⊦ InvDeq(tid) ≠ globalCrash; (s)

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

lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), DQGInv(gs), DQLInv(gs, mkls(tid0, obsEmpty, val, optval, val0, optval0), pcf(tid0)), bwabs (mkstate (gstepf(gs, lsf(tid), pcf(tid), InvDeq(tid0)), lsf(tid; lstepf(gs, lsf(tid), pcf(tid), InvDeq(tid0))), pcf(tid; pcstepf(gs, lsf(tid), pcf(tid), InvDeq(tid0)))), mkstate(ags, alsf, apcf)), fininvdeq(pcf), pre(gs, lsf(tid), pcf(tid), InvDeq(tid0)), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ ∃ durqs. DurQstep(durqs, AInvDeq(tid0), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

User applied rule structural induction

And obtained the following new goals

Rule argument

term: pcf(tid)

Additional information

Used simplifier rules: DQPC freely generated by crashed, idle, invDeq, invEnq, ready, resDeq, resEnq;; ⊦ pre(gs, ls, resEnq, a) ↔ a = RetEnq(ls.tid); (s) ⊦ InvDeq(tid) ≠ RetEnq(tid0); (s) ⊦ pre(gs, ls, resDeq, a) ↔ a = RetDeq(ls.tid, ls.oval); (s) ⊦ InvDeq(tid) ≠ RetDeq(tid0, optval); (s) ⊦ pre(gs, ls, invEnq, a) ↔ a = DoEnq(ls.tid); (s) ⊦ DoEnq(tid) ≠ InvDeq(tid0); (s) ⊦ pre(gs, ls, invDeq, a) ↔ a = CheckEmp(ls.tid) ∧ gs.queue = [] ∨ a = DoDeqEmpty(ls.tid) ∧ ls.obsEmpty ∨ a = DoDeq(ls.tid) ∧ gs.queue ≠ []; (s) ⊦ CheckEmp(tid) ≠ InvDeq(tid0); (s) ⊦ DoDeqEmpty(tid) ≠ InvDeq(tid0); (s) ⊦ DoDeq(tid) ≠ InvDeq(tid0); (s) ⊦ pre(gs, ls, idle, a) ↔ a = callRun(ls.tid); (s) ⊦ InvDeq(tid) ≠ callRun(tid0); (s) ⊦ pre(gs, ls, crashed, a) ↔ false; (s)

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

lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), ready = pcf(tid), DQGInv(gs), DQLInv(gs, mkls(tid0, obsEmpty, val, optval, val0, optval0), pcf(tid0)), bwabs (mkstate (gstepf(gs, lsf(tid), pcf(tid), InvDeq(tid0)), lsf(tid; lstepf(gs, lsf(tid), pcf(tid), InvDeq(tid0))), pcf(tid; pcstepf(gs, lsf(tid), pcf(tid), InvDeq(tid0)))), mkstate(ags, alsf, apcf)), fininvdeq(pcf), pre(gs, lsf(tid), pcf(tid), InvDeq(tid0)), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ ∃ durqs. DurQstep(durqs, AInvDeq(tid0), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ pcstepf(gs, ls, ready, InvDeq(ls.tid)) = invDeq; (s) ⊦ lstepf(gs, ls, ready, InvDeq(ls.tid)) = ls.obsEmpty:= false; (s) ⊦ InvDeq(tid) = InvDeq(tid0) ↔ tid = tid0; (s) ⊦ InvDeq(tid) ≠ InvEnq(tid0, val); (s) ⊦ pre(gs, ls, ready, a) ↔ (∃ value. a = InvEnq(ls.tid, value)) ∨ a = InvDeq(ls.tid); (s) ⊦ gstepf(gs, ls, ready, a) = gs; (s)

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

lsf(lsf(tid).tid) = mkls(lsf(tid).tid, obsEmpty, val, optval, val0, optval0), ready = pcf(tid), DQGInv(gs), DQLInv(gs, mkls(lsf(tid).tid, obsEmpty, val, optval, val0, optval0), pcf(lsf(tid).tid)), bwabs(mkstate(gs, lsf(tid; lsf(tid).obsEmpty:= false), pcf(tid; invDeq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ ∃ durqs. DurQstep(durqs, AInvDeq(lsf(tid).tid), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

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, obsEmpty0, lsf(tid), optval1, tid0, 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, obsEmpty0, lsf(tid), oval, tid0, optval1

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

lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), ready = pcf(tid), DQGInv(gs), DQLInv(gs, mkls(tid0, obsEmpty, val, optval, val0, optval0), pcf(tid0)), bwabs(mkstate(gs, lsf(tid; lsf(tid).obsEmpty:= false), pcf(tid; invDeq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ ∃ durqs. DurQstep(durqs, AInvDeq(tid0), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

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

lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), ready = pcf(tid), DQGInv(gs), DQLInv(gs, mkls(tid0, obsEmpty, val, optval, val0, optval0), pcf(tid0)), bwabs(mkstate(gs, lsf(tid; mkls(tid0, false, val1, optval1, val2, optval2)), pcf(tid; invDeq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ ∃ durqs. DurQstep(durqs, AInvDeq(tid0), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 8 terms: tid abort: F discard: F computed: F

Additional information

Used terms: tid

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

lsf(tid).tid = tid, lsf(tid) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), ready = pcf(tid), DQGInv(gs), DQLInv(gs, mkls(tid0, obsEmpty, val, optval, val0, optval0), pcf(tid0)), DQLInv(gs, lsf(tid), pcf(tid)), bwabs(mkstate(gs, lsf(tid; mkls(tid0, false, val1, optval1, val2, optval2)), pcf(tid; invDeq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ ∃ durqs. DurQstep(durqs, AInvDeq(tid0), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

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

lsf(tid0) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), ready = pcf(tid0), DQGInv(gs), DQLInv(gs, mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), ready), bwabs(mkstate(gs, lsf(tid0; mkls(tid0, false, val1, optval1, val2, optval2)), pcf(tid0; invDeq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ ∃ durqs. DurQstep(durqs, AInvDeq(tid0), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

User applied rule exists right

And obtained the following new goals

Rule argument

pos: right 1 terms: mkstate (mkdgs(gs.queue), alsf(tid0; bwlabsf(lsf(tid0))), apcf(tid0; ready)) abort: F discard: T computed: F

Additional information

Used terms: mkstate(mkdgs(gs.queue), alsf(tid0; bwlabsf(lsf(tid0))), apcf(tid0; ready))

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

lsf(tid0) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), ready = pcf(tid0), DQGInv(gs), DQLInv(gs, mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), ready), bwabs(mkstate(gs, lsf(tid0; mkls(tid0, false, val1, optval1, val2, optval2)), pcf(tid0; invDeq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ DurQstep(mkstate(mkdgs(gs.queue), alsf(tid0; bwlabsf(lsf(tid0))), apcf(tid0; ready)), AInvDeq(tid0), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(gs, lsf, pcf), mkstate(mkdgs(gs.queue), alsf(tid0; bwlabsf(lsf(tid0))), apcf(tid0; ready)))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).optval = oval0; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).value = ival0; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).oval = oval; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).ival = ival; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).tid = tid; (s) ⊦ ready ≠ resDeq; (s) ⊦ bwabs(mkstate(gs, lsf, pcf), mkstate(ags, alsf, apcf)) → ( bwabs(mkstate(gs0, lsf0, pcf0), mkstate(ags0, alsf0, apcf0)) ↔ ags = mkdgs(gs.queue) → ags0 = mkdgs(gs0.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 → alsf0(tid) = mkls (lsf0(tid).tid, lsf0(tid).ival, lsf0(tid).oval, lsf0(tid).value, lsf0(tid).optval) ∧ apcf0(tid) = bwabspcf(pcf0(tid)) ∨ alsf0(tid) = mkls (lsf0(tid).tid, lsf0(tid).ival, Empty, lsf0(tid).value, lsf0(tid).optval) ∧ pcf0(tid) = invDeq ∧ apcf0(tid) = resDeq ∧ lsf0(tid).obsEmpty)); (s) ⊦ bwlabsf(ls) = mkls(ls.tid, ls.ival, ls.oval, ls.value, ls.optval); (s)

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

lsf(tid0) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), ready = pcf(tid0), DQGInv(gs), DQLInv(gs, mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), ready), bwabs(mkstate(gs, lsf(tid0; mkls(tid0, false, val1, optval1, val2, optval2)), pcf(tid0; invDeq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ DurQstep (mkstate(mkdgs(gs.queue), alsf(tid0; mkls(tid0, val1, optval1, val2, optval2)), apcf(tid0; ready)), AInvDeq(tid0), mkstate(ags, alsf, apcf)) ∧ ( ags = mkdgs(gs.queue) → alsf(tid) = mkls ((tid0 = tid ⊃ mkls(tid, false, val1, optval1, val2, optval2);lsf(tid)).tid, (tid0 = tid ⊃ mkls(tid, false, val1, optval1, val2, optval2);lsf(tid)).ival, (tid0 = tid ⊃ mkls(tid, false, val1, optval1, val2, optval2);lsf(tid)).oval, (tid0 = tid ⊃ mkls(tid, false, val1, optval1, val2, optval2);lsf(tid)).value, (tid0 = tid ⊃ mkls(tid, false, val1, optval1, val2, optval2);lsf(tid)).optval) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ invDeq;pcf(tid))) ∨ alsf(tid) = mkls ((tid0 = tid ⊃ mkls(tid, false, val1, optval1, val2, optval2);lsf(tid)).tid, (tid0 = tid ⊃ mkls(tid, false, val1, optval1, val2, optval2);lsf(tid)).ival, Empty, (tid0 = tid ⊃ mkls(tid, false, val1, optval1, val2, optval2);lsf(tid)).value, (tid0 = tid ⊃ mkls(tid, false, val1, optval1, val2, optval2);lsf(tid)).optval) ∧ (tid0 ≠ tid → invDeq = pcf(tid)) ∧ apcf(tid) = resDeq ∧ (tid0 = tid ⊃ mkls(tid, false, val1, optval1, val2, optval2);lsf(tid)).obsEmpty → (tid0 = tid ⊃ mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval);alsf(tid)) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ (tid0 = tid ⊃ ready;apcf(tid)) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ tid0 ≠ tid ∧ resDeq = apcf(tid) ∧ lsf(tid).obsEmpty)

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 164 from proof bwsim-step-nontau (previous step) (back to tree)

gs = mkgs(queue), lsf(tid0) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), ready = pcf(tid0), DQGInv(gs), DQLInv(gs, mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), ready), bwabs(mkstate(gs, lsf(tid0; mkls(tid0, false, val1, optval1, val2, optval2)), pcf(tid0; invDeq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ DurQstep(mkstate(mkdgs(queue), alsf(tid0; mkls(tid0, val1, optval1, val2, optval2)), apcf(tid0; ready)), AInvDeq(tid0), mkstate(ags, alsf, apcf)) ∧ ( ags = mkdgs(queue) → alsf(tid) = mkls ((tid0 = tid ⊃ mkls(tid, false, val1, optval1, val2, optval2);lsf(tid)).tid, (tid0 = tid ⊃ mkls(tid, false, val1, optval1, val2, optval2);lsf(tid)).ival, (tid0 = tid ⊃ mkls(tid, false, val1, optval1, val2, optval2);lsf(tid)).oval, (tid0 = tid ⊃ mkls(tid, false, val1, optval1, val2, optval2);lsf(tid)).value, (tid0 = tid ⊃ mkls(tid, false, val1, optval1, val2, optval2);lsf(tid)).optval) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ invDeq;pcf(tid))) ∨ alsf(tid) = mkls ((tid0 = tid ⊃ mkls(tid, false, val1, optval1, val2, optval2);lsf(tid)).tid, (tid0 = tid ⊃ mkls(tid, false, val1, optval1, val2, optval2);lsf(tid)).ival, Empty, (tid0 = tid ⊃ mkls(tid, false, val1, optval1, val2, optval2);lsf(tid)).value, (tid0 = tid ⊃ mkls(tid, false, val1, optval1, val2, optval2);lsf(tid)).optval) ∧ (tid0 ≠ tid → invDeq = pcf(tid)) ∧ apcf(tid) = resDeq ∧ (tid0 = tid ⊃ mkls(tid, false, val1, optval1, val2, optval2);lsf(tid)).obsEmpty → (tid0 = tid ⊃ mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval);alsf(tid)) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ (tid0 = tid ⊃ ready;apcf(tid)) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ tid0 ≠ tid ∧ resDeq = apcf(tid) ∧ lsf(tid).obsEmpty)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

lsf(tid0) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), ready = pcf(tid0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), ready), bwabs(mkstate(mkgs(queue), lsf(tid0; mkls(tid0, false, val1, optval1, val2, optval2)), pcf(tid0; invDeq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦ DurQstep(mkstate(mkdgs(queue), alsf(tid0; mkls(tid0, val1, optval1, val2, optval2)), apcf(tid0; ready)), AInvDeq(tid0), mkstate(ags, alsf, apcf)) ∧ ( ags = mkdgs(queue) → alsf(tid) = mkls ((tid0 = tid ⊃ mkls(tid, false, val1, optval1, val2, optval2);lsf(tid)).tid, (tid0 = tid ⊃ mkls(tid, false, val1, optval1, val2, optval2);lsf(tid)).ival, (tid0 = tid ⊃ mkls(tid, false, val1, optval1, val2, optval2);lsf(tid)).oval, (tid0 = tid ⊃ mkls(tid, false, val1, optval1, val2, optval2);lsf(tid)).value, (tid0 = tid ⊃ mkls(tid, false, val1, optval1, val2, optval2);lsf(tid)).optval) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ invDeq;pcf(tid))) ∨ alsf(tid) = mkls ((tid0 = tid ⊃ mkls(tid, false, val1, optval1, val2, optval2);lsf(tid)).tid, (tid0 = tid ⊃ mkls(tid, false, val1, optval1, val2, optval2);lsf(tid)).ival, Empty, (tid0 = tid ⊃ mkls(tid, false, val1, optval1, val2, optval2);lsf(tid)).value, (tid0 = tid ⊃ mkls(tid, false, val1, optval1, val2, optval2);lsf(tid)).optval) ∧ (tid0 ≠ tid → invDeq = pcf(tid)) ∧ apcf(tid) = resDeq ∧ (tid0 = tid ⊃ mkls(tid, false, val1, optval1, val2, optval2);lsf(tid)).obsEmpty → (tid0 = tid ⊃ mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval);alsf(tid)) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ (tid0 = tid ⊃ ready;apcf(tid)) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ tid0 ≠ tid ∧ resDeq = apcf(tid) ∧ lsf(tid).obsEmpty)

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, (tid0 = tid ⊃ mkls(tid, false, val1, optval1, val2, optval2);lsf(tid)), optval, tid1, 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, (tid0 = tid ⊃ mkls(tid, false, val1, optval1, val2, optval2);lsf(tid)), oval, tid1, optval

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

(tid0 = tid ⊃ mkls(tid, false, val1, optval1, val2, optval2);lsf(tid)) = mkls(tid1, obsEmpty, val, optval, val0, optval0), lsf(tid0) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), ready = pcf(tid0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), ready), bwabs(mkstate(mkgs(queue), lsf(tid0; mkls(tid0, false, val1, optval1, val2, optval2)), pcf(tid0; invDeq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦ DurQstep(mkstate(mkdgs(queue), alsf(tid0; mkls(tid0, val1, optval1, val2, optval2)), apcf(tid0; ready)), AInvDeq(tid0), mkstate(ags, alsf, apcf)) ∧ ( ags = mkdgs(queue) → alsf(tid) = mkls(tid1, val, optval, val0, optval0) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ invDeq;pcf(tid))) ∨ alsf(tid) = mkls(tid1, val, Empty, val0, optval0) ∧ (tid0 ≠ tid → invDeq = pcf(tid)) ∧ apcf(tid) = resDeq ∧ obsEmpty → (tid0 = tid ⊃ mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval);alsf(tid)) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ (tid0 = tid ⊃ ready;apcf(tid)) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ tid0 ≠ tid ∧ resDeq = apcf(tid) ∧ lsf(tid).obsEmpty)

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] → [val4, val3, obsEmpty1, lsf(tid), optval3, tid2, optval4]

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, obsEmpty1, lsf(tid), oval, tid2, optval3

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

(tid0 = tid ⊃ mkls(tid, false, val1, optval1, val2, optval2);lsf(tid)) = mkls(tid1, obsEmpty, val, optval, val0, optval0), lsf(tid0) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), lsf(tid) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), ready = pcf(tid0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), ready), bwabs(mkstate(mkgs(queue), lsf(tid0; mkls(tid0, false, val1, optval1, val2, optval2)), pcf(tid0; invDeq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦ DurQstep(mkstate(mkdgs(queue), alsf(tid0; mkls(tid0, val1, optval1, val2, optval2)), apcf(tid0; ready)), AInvDeq(tid0), mkstate(ags, alsf, apcf)) ∧ ( ags = mkdgs(queue) → alsf(tid) = mkls(tid1, val, optval, val0, optval0) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ invDeq;pcf(tid))) ∨ alsf(tid) = mkls(tid1, val, Empty, val0, optval0) ∧ (tid0 ≠ tid → invDeq = pcf(tid)) ∧ apcf(tid) = resDeq ∧ obsEmpty → (tid0 = tid ⊃ mkls(tid2, val3, optval3, val4, optval4);alsf(tid)) = mkls(tid2, val3, optval3, val4, optval4) ∧ (tid0 = tid ⊃ ready;apcf(tid)) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(tid2, val3, Empty, val4, optval4) ∧ pcf(tid) = invDeq ∧ tid0 ≠ tid ∧ resDeq = apcf(tid) ∧ obsEmpty1)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

(tid0 = tid ⊃ mkls(tid, false, val1, optval1, val2, optval2);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty, val, optval, val0, optval0), lsf(tid) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), lsf(tid0) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), ready = pcf(tid0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), ready), bwabs(mkstate(mkgs(queue), lsf(tid0; mkls(tid0, false, val1, optval1, val2, optval2)), pcf(tid0; invDeq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦ DurQstep(mkstate(mkdgs(queue), alsf(tid0; mkls(tid0, val1, optval1, val2, optval2)), apcf(tid0; ready)), AInvDeq(tid0), mkstate(ags, alsf, apcf)) ∧ ( ags = mkdgs(queue) → alsf(tid) = mkls(tid1, val, optval, val0, optval0) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ invDeq;pcf(tid))) ∨ alsf(tid) = mkls(tid1, val, Empty, val0, optval0) ∧ (tid0 ≠ tid → invDeq = pcf(tid)) ∧ apcf(tid) = resDeq ∧ obsEmpty → (tid0 = tid ⊃ mkls(tid2, val3, optval3, val4, optval4);alsf(tid)) = mkls(tid2, val3, optval3, val4, optval4) ∧ (tid0 = tid ⊃ ready;apcf(tid)) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(tid2, val3, Empty, val4, optval4) ∧ pcf(tid) = invDeq ∧ tid0 ≠ tid ∧ resDeq = apcf(tid) ∧ obsEmpty1)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

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

(tid0 = tid ⊃ mkls(tid, false, val1, optval1, val2, optval2);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty, val, optval, val0, optval0), lsf(tid0) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), lsf(tid) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), ready = pcf(tid0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), ready), bwabs(mkstate(mkgs(queue), lsf(tid0; mkls(tid0, false, val1, optval1, val2, optval2)), pcf(tid0; invDeq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ¬ DurQstep(mkstate(mkdgs(queue), alsf(tid0; mkls(tid0, val1, optval1, val2, optval2)), apcf(tid0; ready)), AInvDeq(tid0), mkstate(ags, alsf, apcf)), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(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), alsf(tid0; mkls(tid0, val1, optval1, val2, optval2)), AInvDeq(tid0), mkdgs(queue), apcf(tid0; ready)], <all paths>

Additional information

Used terms: mkstate(ags, alsf, apcf), alsf(tid0; mkls(tid0, val1, optval1, val2, optval2)), AInvDeq(tid0), mkdgs(queue), apcf(tid0; ready)

Proof step 170 from proof bwsim-step-nontau (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 171 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid ⊃ mkls(tid, false, val1, optval1, val2, optval2);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty, val, optval, val0, optval0), lsf(tid) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), lsf(tid0) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), ready = pcf(tid0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), ready), bwabs(mkstate(mkgs(queue), lsf(tid0; mkls(tid0, false, val1, optval1, val2, optval2)), pcf(tid0; invDeq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), (AInvDeq(tid0) = globalACrash ⊃ mkstate(ags, alsf, apcf) ≠ mkstate(mkdgs(queue), alsf(tid0; mkls(tid0, val1, optval1, val2, optval2)), λ tid. (apcf(tid0; ready)(tid) = idle ⊃ idle;crashed)) ;∀ tid. ¬ ( pre(mkdgs(queue), alsf(tid0; mkls(tid0, val1, optval1, val2, optval2))(tid), apcf(tid0; ready)(tid), AInvDeq(tid0)) ∧ mkstate(ags, alsf, apcf) = mkstate (gstepf(mkdgs(queue), alsf(tid0; mkls(tid0, val1, optval1, val2, optval2))(tid), apcf(tid0; ready)(tid), AInvDeq(tid0)), alsf(tid0; mkls(tid0, val1, optval1, val2, optval2)) (tid; lstepf(mkdgs(queue), alsf(tid0; mkls(tid0, val1, optval1, val2, optval2))(tid), apcf(tid0; ready)(tid), AInvDeq(tid0))), apcf(tid0; ready) (tid; pcstepf(mkdgs(queue), alsf(tid0; mkls(tid0, val1, optval1, val2, optval2))(tid), apcf(tid0; ready)(tid), AInvDeq(tid0))))) ), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ AInvDeq(tid) ≠ globalACrash; (s)

Proof step 172 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid ⊃ mkls(tid, false, val1, optval1, val2, optval2);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty, val, optval, val0, optval0), lsf(tid0) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), lsf(tid) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), ready = pcf(tid0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), ready), bwabs(mkstate(mkgs(queue), lsf(tid0; mkls(tid0, false, val1, optval1, val2, optval2)), pcf(tid0; invDeq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ∀ tid3. ¬ pre(mkdgs(queue), (tid0 = tid3 ⊃ mkls(tid3, val1, optval1, val2, optval2);alsf(tid3)), (tid0 = tid3 ⊃ ready;apcf(tid3)), AInvDeq(tid0)) ∨ mkstate(ags, alsf, apcf) ≠ mkstate (gstepf(mkdgs(queue), (tid0 = tid3 ⊃ mkls(tid3, val1, optval1, val2, optval2);alsf(tid3)), (tid0 = tid3 ⊃ ready;apcf(tid3)), AInvDeq(tid0)), alsf(tid0; mkls(tid0, val1, optval1, val2, optval2)) (tid3 ; lstepf(mkdgs(queue), (tid0 = tid3 ⊃ mkls(tid3, val1, optval1, val2, optval2);alsf(tid3)), (tid0 = tid3 ⊃ ready;apcf(tid3)), AInvDeq(tid0)) ), apcf(tid0; ready) (tid3 ; pcstepf(mkdgs(queue), (tid0 = tid3 ⊃ mkls(tid3, val1, optval1, val2, optval2);alsf(tid3)), (tid0 = tid3 ⊃ ready;apcf(tid3)), AInvDeq(tid0)) )) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

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

Additional information

Used terms: tid0

Proof step 173 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid ⊃ mkls(tid, false, val1, optval1, val2, optval2);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty, val, optval, val0, optval0), lsf(tid) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), lsf(tid0) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), ready = pcf(tid0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), ready), bwabs(mkstate(mkgs(queue), lsf(tid0; mkls(tid0, false, val1, optval1, val2, optval2)), pcf(tid0; invDeq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ¬ pre(mkdgs(queue), (tid0 = tid0 ⊃ mkls(tid0, val1, optval1, val2, optval2);alsf(tid0)), (tid0 = tid0 ⊃ ready;apcf(tid0)), AInvDeq(tid0)) ∨ mkstate(ags, alsf, apcf) ≠ mkstate (gstepf(mkdgs(queue), (tid0 = tid0 ⊃ mkls(tid0, val1, optval1, val2, optval2);alsf(tid0)), (tid0 = tid0 ⊃ ready;apcf(tid0)), AInvDeq(tid0)), alsf(tid0; mkls(tid0, val1, optval1, val2, optval2)) (tid0 ; lstepf(mkdgs(queue), (tid0 = tid0 ⊃ mkls(tid0, val1, optval1, val2, optval2);alsf(tid0)), (tid0 = tid0 ⊃ ready;apcf(tid0)), AInvDeq(tid0)) ), apcf(tid0; ready) (tid0 ; pcstepf(mkdgs(queue), (tid0 = tid0 ⊃ mkls(tid0, val1, optval1, val2, optval2);alsf(tid0)), (tid0 = tid0 ⊃ ready;apcf(tid0)), AInvDeq(tid0)) )) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ pcstepf(gs, mkls(tid, ival, oval, value, optval), ready, AInvDeq(tid)) = invDeq; (s) ⊦ lstepf(gs, mkls(tid, ival, oval, value, optval), ready, AInvDeq(tid)) = mkls(tid, ival, oval, value, optval); (s) ⊦ gstepf(gs, ls, ready, a) = gs; (s) ⊦ AInvDeq(tid) = AInvDeq(tid0) ↔ tid = tid0; (s) ⊦ mkls(tid, ival, oval, ival0, oval0).tid = tid; (s) ⊦ AInvDeq(tid) ≠ AInvEnq(tid0, val); (s) ⊦ pre(gs, ls, ready, a) ↔ (∃ value. a = AInvEnq(ls.tid, value)) ∨ a = AInvDeq(ls.tid); (s)

Proof step 174 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid ⊃ mkls(tid, false, val1, optval1, val2, optval2);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty, val, optval, val0, optval0), lsf(tid0) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), lsf(tid) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), ready = pcf(tid0), mkstate(ags, alsf, apcf) ≠ mkstate (mkdgs(queue), alsf(tid0; mkls(tid0, val1, optval1, val2, optval2))(tid0; mkls(tid0, val1, optval1, val2, optval2)), apcf(tid0; ready)(tid0; invDeq)), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), ready), bwabs(mkstate(mkgs(queue), lsf(tid0; mkls(tid0, false, val1, optval1, val2, optval2)), pcf(tid0; invDeq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦

User applied rule reduce equation

And obtained the following new goals

Rule argument

pos: left 5

Additional information

Proof step 175 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid ⊃ mkls(tid, false, val1, optval1, val2, optval2);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty, val, optval, val0, optval0), lsf(tid) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), lsf(tid0) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), ready = pcf(tid0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), ready), bwabs(mkstate(mkgs(queue), lsf(tid0; mkls(tid0, false, val1, optval1, val2, optval2)), pcf(tid0; invDeq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦ ags = mkdgs(queue) ∧ alsf = alsf(tid0; mkls(tid0, val1, optval1, val2, optval2))(tid0; mkls(tid0, val1, optval1, val2, optval2)) ∧ apcf = apcf(tid0; ready)(tid0; invDeq)

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), alsf, lsf(tid0; mkls(tid0, false, val1, optval1, val2, optval2)), ags, pcf(tid0; invDeq), apcf], <all paths>

Additional information

Used terms: mkgs(queue), alsf, lsf(tid0; mkls(tid0, false, val1, optval1, val2, optval2)), ags, pcf(tid0; invDeq), apcf

Proof step 176 from proof bwsim-step-nontau (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 177 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid ⊃ mkls(tid, false, val1, optval1, val2, optval2);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty, val, optval, val0, optval0), ags = mkdgs(mkgs(queue).queue), lsf(tid0) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), lsf(tid) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), ready = pcf(tid0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), ready), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ∀ tid. alsf(tid) = mkls (lsf(tid0; mkls(tid0, false, val1, optval1, val2, optval2))(tid).tid, lsf(tid0; mkls(tid0, false, val1, optval1, val2, optval2))(tid).ival, lsf(tid0; mkls(tid0, false, val1, optval1, val2, optval2))(tid).oval, lsf(tid0; mkls(tid0, false, val1, optval1, val2, optval2))(tid).value, lsf(tid0; mkls(tid0, false, val1, optval1, val2, optval2))(tid).optval) ∧ apcf(tid) = bwabspcf(pcf(tid0; invDeq)(tid)) ∨ alsf(tid) = mkls (lsf(tid0; mkls(tid0, false, val1, optval1, val2, optval2))(tid).tid, lsf(tid0; mkls(tid0, false, val1, optval1, val2, optval2))(tid).ival, Empty, lsf(tid0; mkls(tid0, false, val1, optval1, val2, optval2))(tid).value, lsf(tid0; mkls(tid0, false, val1, optval1, val2, optval2))(tid).optval) ∧ pcf(tid0; invDeq)(tid) = invDeq ∧ apcf(tid) = resDeq ∧ lsf(tid0; mkls(tid0, false, val1, optval1, val2, optval2))(tid).obsEmpty ⊦ ags = mkdgs(queue) ∧ alsf = alsf(tid0; mkls(tid0, val1, optval1, val2, optval2))(tid0; mkls(tid0, val1, optval1, val2, optval2)) ∧ apcf = apcf(tid0; ready)(tid0; invDeq)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ mkdgs(queue) = mkdgs(queue0) ↔ queue = queue0; (s) ⊦ mkgs(queue).queue = queue; (s)

Proof step 178 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid ⊃ mkls(tid, false, val1, optval1, val2, optval2);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty, val, optval, val0, optval0), lsf(tid) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), lsf(tid0) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), ready = pcf(tid0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), ready), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ∀ tid3. alsf(tid3) = mkls ((tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).tid, (tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).ival, (tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).oval, (tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).value, (tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).optval) ∧ apcf(tid3) = bwabspcf((tid0 = tid3 ⊃ invDeq;pcf(tid3))) ∨ alsf(tid3) = mkls ((tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).tid, (tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).ival, Empty, (tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).value, (tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).optval) ∧ (tid0 ≠ tid3 → invDeq = pcf(tid3)) ∧ apcf(tid3) = resDeq ∧ (tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).obsEmpty ⊦ alsf = alsf(tid0; mkls(tid0, val1, optval1, val2, optval2))(tid0; mkls(tid0, val1, optval1, val2, optval2)) ∧ apcf = apcf(tid0; ready)(tid0; invDeq)

User applied rule all left

And obtained the following new goals

Rule argument

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

Additional information

Used terms: tid0

Proof step 179 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid ⊃ mkls(tid, false, val1, optval1, val2, optval2);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty, val, optval, val0, optval0), lsf(tid0) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), lsf(tid) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), ready = pcf(tid0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), ready), fininvdeq(pcf), ∀ tid3. alsf(tid3) = mkls ((tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).tid, (tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).ival, (tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).oval, (tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).value, (tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).optval) ∧ apcf(tid3) = bwabspcf((tid0 = tid3 ⊃ invDeq;pcf(tid3))) ∨ alsf(tid3) = mkls ((tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).tid, (tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).ival, Empty, (tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).value, (tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).optval) ∧ (tid0 ≠ tid3 → invDeq = pcf(tid3)) ∧ apcf(tid3) = resDeq ∧ (tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).obsEmpty, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), alsf(tid0) = mkls ((tid0 = tid0 ⊃ mkls(tid0, false, val1, optval1, val2, optval2);lsf(tid0)).tid, (tid0 = tid0 ⊃ mkls(tid0, false, val1, optval1, val2, optval2);lsf(tid0)).ival, (tid0 = tid0 ⊃ mkls(tid0, false, val1, optval1, val2, optval2);lsf(tid0)).oval, (tid0 = tid0 ⊃ mkls(tid0, false, val1, optval1, val2, optval2);lsf(tid0)).value, (tid0 = tid0 ⊃ mkls(tid0, false, val1, optval1, val2, optval2);lsf(tid0)).optval) ∧ apcf(tid0) = bwabspcf((tid0 = tid0 ⊃ invDeq;pcf(tid0))) ∨ alsf(tid0) = mkls ((tid0 = tid0 ⊃ mkls(tid0, false, val1, optval1, val2, optval2);lsf(tid0)).tid, (tid0 = tid0 ⊃ mkls(tid0, false, val1, optval1, val2, optval2);lsf(tid0)).ival, Empty, (tid0 = tid0 ⊃ mkls(tid0, false, val1, optval1, val2, optval2);lsf(tid0)).value, (tid0 = tid0 ⊃ mkls(tid0, false, val1, optval1, val2, optval2);lsf(tid0)).optval) ∧ (tid0 ≠ tid0 → invDeq = pcf(tid0)) ∧ apcf(tid0) = resDeq ∧ (tid0 = tid0 ⊃ mkls(tid0, false, val1, optval1, val2, optval2);lsf(tid0)).obsEmpty ⊦ alsf = alsf(tid0; mkls(tid0, val1, optval1, val2, optval2))(tid0; mkls(tid0, val1, optval1, val2, optval2)) ∧ apcf = apcf(tid0; ready)(tid0; invDeq)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).obsEmpty ↔ obsEmpty; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).optval = oval0; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).value = ival0; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).ival = ival; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).tid = tid; (s) ⊦ bwabspcf(invDeq) = invDeq; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).oval = oval; (s)

Proof step 180 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid ⊃ mkls(tid, false, val1, optval1, val2, optval2);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty, val, optval, val0, optval0), alsf(tid0) = mkls(tid0, val1, optval1, val2, optval2), apcf(tid0) = invDeq, lsf(tid) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), lsf(tid0) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), ready = pcf(tid0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), ready), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ∀ tid3. alsf(tid3) = mkls ((tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).tid, (tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).ival, (tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).oval, (tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).value, (tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).optval) ∧ apcf(tid3) = bwabspcf((tid0 = tid3 ⊃ invDeq;pcf(tid3))) ∨ alsf(tid3) = mkls ((tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).tid, (tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).ival, Empty, (tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).value, (tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).optval) ∧ (tid0 ≠ tid3 → invDeq = pcf(tid3)) ∧ apcf(tid3) = resDeq ∧ (tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).obsEmpty ⊦ alsf = alsf(tid0; mkls(tid0, val1, optval1, val2, optval2))(tid0; mkls(tid0, val1, optval1, val2, optval2)) ∧ apcf = apcf(tid0; ready)(tid0; invDeq)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 181 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid ⊃ mkls(tid, false, val1, optval1, val2, optval2);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty, val, optval, val0, optval0), alsf(tid0) = mkls(tid0, val1, optval1, val2, optval2), apcf(tid0) = invDeq, lsf(tid0) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), lsf(tid) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), ready = pcf(tid0), alsf ≠ alsf(tid0; mkls(tid0, val1, optval1, val2, optval2))(tid0; mkls(tid0, val1, optval1, val2, optval2)), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), ready), fininvdeq(pcf), ∀ tid3. alsf(tid3) = mkls ((tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).tid, (tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).ival, (tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).oval, (tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).value, (tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).optval) ∧ apcf(tid3) = bwabspcf((tid0 = tid3 ⊃ invDeq;pcf(tid3))) ∨ alsf(tid3) = mkls ((tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).tid, (tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).ival, Empty, (tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).value, (tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).optval) ∧ (tid0 ≠ tid3 → invDeq = pcf(tid3)) ∧ apcf(tid3) = resDeq ∧ (tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).obsEmpty, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦

User applied rule expand left

And obtained the following new goals

Rule argument

pos: left 7

Additional information

Proof step 182 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid ⊃ mkls(tid, false, val1, optval1, val2, optval2);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty, val, optval, val0, optval0), alsf(tid0) = mkls(tid0, val1, optval1, val2, optval2), apcf(tid0) = invDeq, lsf(tid) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), lsf(tid0) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), ready = pcf(tid0), alsf(tid3) ≠ alsf(tid0; mkls(tid0, val1, optval1, val2, optval2))(tid0; mkls(tid0, val1, optval1, val2, optval2))(tid3), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), ready), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ∀ tid3. alsf(tid3) = mkls ((tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).tid, (tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).ival, (tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).oval, (tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).value, (tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).optval) ∧ apcf(tid3) = bwabspcf((tid0 = tid3 ⊃ invDeq;pcf(tid3))) ∨ alsf(tid3) = mkls ((tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).tid, (tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).ival, Empty, (tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).value, (tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).optval) ∧ (tid0 ≠ tid3 → invDeq = pcf(tid3)) ∧ apcf(tid3) = resDeq ∧ (tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).obsEmpty ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 183 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid ⊃ mkls(tid, false, val1, optval1, val2, optval2);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty, val, optval, val0, optval0), alsf(tid0) = mkls(tid0, val1, optval1, val2, optval2), apcf(tid0) = invDeq, lsf(tid0) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), lsf(tid) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), ready = pcf(tid0), alsf(tid3) ≠ (tid0 = tid3 ⊃ mkls(tid3, val1, optval1, val2, optval2);alsf(tid3)), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), ready), fininvdeq(pcf), ∀ tid3. alsf(tid3) = mkls ((tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).tid, (tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).ival, (tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).oval, (tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).value, (tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).optval) ∧ apcf(tid3) = bwabspcf((tid0 = tid3 ⊃ invDeq;pcf(tid3))) ∨ alsf(tid3) = mkls ((tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).tid, (tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).ival, Empty, (tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).value, (tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).optval) ∧ (tid0 ≠ tid3 → invDeq = pcf(tid3)) ∧ apcf(tid3) = resDeq ∧ (tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).obsEmpty, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦

User applied rule case distinction

And closed the goal!

Rule argument

pos: left 7

Additional information

Proof step 184 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid ⊃ mkls(tid, false, val1, optval1, val2, optval2);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty, val, optval, val0, optval0), alsf(tid0) = mkls(tid0, val1, optval1, val2, optval2), apcf(tid0) = invDeq, lsf(tid0) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), lsf(tid) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), ready = pcf(tid0), apcf ≠ apcf(tid0; ready)(tid0; invDeq), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), ready), fininvdeq(pcf), ∀ tid3. alsf(tid3) = mkls ((tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).tid, (tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).ival, (tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).oval, (tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).value, (tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).optval) ∧ apcf(tid3) = bwabspcf((tid0 = tid3 ⊃ invDeq;pcf(tid3))) ∨ alsf(tid3) = mkls ((tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).tid, (tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).ival, Empty, (tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).value, (tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).optval) ∧ (tid0 ≠ tid3 → invDeq = pcf(tid3)) ∧ apcf(tid3) = resDeq ∧ (tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).obsEmpty, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦

User applied rule expand left

And obtained the following new goals

Rule argument

pos: left 7

Additional information

Proof step 185 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid ⊃ mkls(tid, false, val1, optval1, val2, optval2);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty, val, optval, val0, optval0), alsf(tid0) = mkls(tid0, val1, optval1, val2, optval2), apcf(tid0) = invDeq, lsf(tid) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), lsf(tid0) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), ready = pcf(tid0), apcf(tid3) ≠ apcf(tid0; ready)(tid0; invDeq)(tid3), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), ready), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ∀ tid3. alsf(tid3) = mkls ((tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).tid, (tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).ival, (tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).oval, (tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).value, (tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).optval) ∧ apcf(tid3) = bwabspcf((tid0 = tid3 ⊃ invDeq;pcf(tid3))) ∨ alsf(tid3) = mkls ((tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).tid, (tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).ival, Empty, (tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).value, (tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).optval) ∧ (tid0 ≠ tid3 → invDeq = pcf(tid3)) ∧ apcf(tid3) = resDeq ∧ (tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).obsEmpty ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 186 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid ⊃ mkls(tid, false, val1, optval1, val2, optval2);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty, val, optval, val0, optval0), alsf(tid0) = mkls(tid0, val1, optval1, val2, optval2), apcf(tid0) = invDeq, lsf(tid0) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), lsf(tid) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), ready = pcf(tid0), apcf(tid3) ≠ (tid0 = tid3 ⊃ invDeq;apcf(tid3)), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), ready), fininvdeq(pcf), ∀ tid3. alsf(tid3) = mkls ((tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).tid, (tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).ival, (tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).oval, (tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).value, (tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).optval) ∧ apcf(tid3) = bwabspcf((tid0 = tid3 ⊃ invDeq;pcf(tid3))) ∨ alsf(tid3) = mkls ((tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).tid, (tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).ival, Empty, (tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).value, (tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).optval) ∧ (tid0 ≠ tid3 → invDeq = pcf(tid3)) ∧ apcf(tid3) = resDeq ∧ (tid0 = tid3 ⊃ mkls(tid3, false, val1, optval1, val2, optval2);lsf(tid3)).obsEmpty, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦

User applied rule case distinction

And closed the goal!

Rule argument

pos: left 7

Additional information

Proof step 187 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid ⊃ mkls(tid, false, val1, optval1, val2, optval2);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty, val, optval, val0, optval0), ags = mkdgs(queue), lsf(tid0) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), lsf(tid) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), ready = pcf(tid0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), ready), bwabs(mkstate(mkgs(queue), lsf(tid0; mkls(tid0, false, val1, optval1, val2, optval2)), pcf(tid0; invDeq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), alsf(tid) = mkls(tid1, val, optval, val0, optval0) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ invDeq;pcf(tid))) ∨ alsf(tid) = mkls(tid1, val, Empty, val0, optval0) ∧ (tid0 ≠ tid → invDeq = pcf(tid)) ∧ apcf(tid) = resDeq ∧ obsEmpty ⊦ (tid0 = tid ⊃ mkls(tid2, val3, optval3, val4, optval4);alsf(tid)) = mkls(tid2, val3, optval3, val4, optval4) ∧ (tid0 = tid ⊃ ready;apcf(tid)) = bwabspcf(pcf(tid)), alsf(tid) = mkls(tid2, val3, Empty, val4, optval4) ∧ pcf(tid) = invDeq ∧ tid0 ≠ tid ∧ resDeq = apcf(tid) ∧ obsEmpty1

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 188 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid ⊃ mkls(tid, false, val1, optval1, val2, optval2);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty, val, optval, val0, optval0), lsf(tid) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), lsf(tid0) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), ready = pcf(tid0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), ready), bwabs(mkstate(mkgs(queue), lsf(tid0; mkls(tid0, false, val1, optval1, val2, optval2)), pcf(tid0; invDeq)), mkstate(mkdgs(queue), alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), alsf(tid) = mkls(tid1, val, optval, val0, optval0) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ invDeq;pcf(tid))) ∨ alsf(tid) = mkls(tid1, val, Empty, val0, optval0) ∧ (tid0 ≠ tid → invDeq = pcf(tid)) ∧ apcf(tid) = resDeq ∧ obsEmpty ⊦ alsf(tid) = mkls(tid2, val3, Empty, val4, optval4) ∧ pcf(tid) = invDeq ∧ tid0 ≠ tid ∧ resDeq = apcf(tid) ∧ obsEmpty1, (tid0 = tid ⊃ mkls(tid2, val3, optval3, val4, optval4);alsf(tid)) = mkls(tid2, val3, optval3, val4, optval4) ∧ (tid0 = tid ⊃ ready;apcf(tid)) = bwabspcf(pcf(tid))

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 9 terms: tid abort: F discard: F computed: F

Additional information

Used terms: tid

Proof step 189 from proof bwsim-step-nontau (previous step) (back to tree)

lsf(tid).tid = tid, (tid0 = tid ⊃ mkls(tid, false, val1, optval1, val2, optval2);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty, val, optval, val0, optval0), lsf(tid0) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), lsf(tid) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), ready = pcf(tid0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), ready), DQLInv(mkgs(queue), lsf(tid), pcf(tid)), bwabs(mkstate(mkgs(queue), lsf(tid0; mkls(tid0, false, val1, optval1, val2, optval2)), pcf(tid0; invDeq)), mkstate(mkdgs(queue), alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), alsf(tid) = mkls(tid1, val, optval, val0, optval0) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ invDeq;pcf(tid))) ∨ alsf(tid) = mkls(tid1, val, Empty, val0, optval0) ∧ (tid0 ≠ tid → invDeq = pcf(tid)) ∧ apcf(tid) = resDeq ∧ obsEmpty ⊦ (tid0 = tid ⊃ mkls(tid2, val3, optval3, val4, optval4);alsf(tid)) = mkls(tid2, val3, optval3, val4, optval4) ∧ (tid0 = tid ⊃ ready;apcf(tid)) = bwabspcf(pcf(tid)), alsf(tid) = mkls(tid2, val3, Empty, val4, optval4) ∧ pcf(tid) = invDeq ∧ tid0 ≠ tid ∧ resDeq = apcf(tid) ∧ obsEmpty1

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 190 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid2 ⊃ mkls(tid2, false, val1, optval1, val2, optval2);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty, val, optval, val0, optval0), lsf(tid0) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), ready = pcf(tid0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), ready), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), bwabs(mkstate(mkgs(queue), lsf(tid0; mkls(tid0, false, val1, optval1, val2, optval2)), pcf(tid0; invDeq)), mkstate(mkdgs(queue), alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), alsf(tid2) = mkls(tid1, val, optval, val0, optval0) ∧ apcf(tid2) = bwabspcf((tid0 = tid2 ⊃ invDeq;pcf(tid2))) ∨ alsf(tid2) = mkls(tid1, val, Empty, val0, optval0) ∧ (tid0 ≠ tid2 → invDeq = pcf(tid2)) ∧ apcf(tid2) = resDeq ∧ obsEmpty ⊦ (tid0 = tid2 ⊃ mkls(tid2, val3, optval3, val4, optval4);alsf(tid2)) = mkls(tid2, val3, optval3, val4, optval4) ∧ (tid0 = tid2 ⊃ ready;apcf(tid2)) = bwabspcf(pcf(tid2)), alsf(tid2) = mkls(tid2, val3, Empty, val4, optval4) ∧ pcf(tid2) = invDeq ∧ tid0 ≠ tid2 ∧ resDeq = apcf(tid2) ∧ obsEmpty1

User applied rule case distinction

And closed the goal!

Rule argument

pos: left 1

Additional information

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

Proof step 191 from proof bwsim-step-nontau (previous step) (back to tree)

ca = InvEnq(tid0, val1), lsf(ca.tid) = mkls(ca.tid, obsEmpty, val, optval, val0, optval0), ca ≠ globalCrash, DQGInv(gs), DQLInv(gs, mkls(ca.tid, obsEmpty, val, optval, val0, optval0), pcf(ca.tid)), bwabs (mkstate(gstepf(gs, lsf(tid), pcf(tid), ca), lsf(tid; lstepf(gs, lsf(tid), pcf(tid), ca)), pcf(tid; pcstepf(gs, lsf(tid), pcf(tid), ca))), mkstate(ags, alsf, apcf)), fininvdeq(pcf), pre(gs, lsf(tid), pcf(tid), ca), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ (∃ tid. ca = CheckEmp(tid) ⊃ (apcf(ca.tid) = resDeq ⊃ ADoDeq(ca.tid);τ);bwabsa(ca)) = τ, ∃ durqs. DurQstep(durqs, (∃ tid. ca = CheckEmp(tid) ⊃ (apcf(ca.tid) = resDeq ⊃ ADoDeq(ca.tid);τ);bwabsa(ca)), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ AInvEnq(tid, val) ≠ τ; (s) ⊦ bwabsa(InvEnq(tid, val)) = AInvEnq(tid, val); (s) ⊦ CheckEmp(tid) ≠ InvEnq(tid0, val); (s) ⊦ InvEnq(tid, val).tid = tid; (s) ⊦ InvEnq(tid, val) ≠ globalCrash; (s)

Proof step 192 from proof bwsim-step-nontau (previous step) (back to tree)

lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), DQGInv(gs), DQLInv(gs, mkls(tid0, obsEmpty, val, optval, val0, optval0), pcf(tid0)), bwabs (mkstate (gstepf(gs, lsf(tid), pcf(tid), InvEnq(tid0, val1)), lsf(tid; lstepf(gs, lsf(tid), pcf(tid), InvEnq(tid0, val1))), pcf(tid; pcstepf(gs, lsf(tid), pcf(tid), InvEnq(tid0, val1)))), mkstate(ags, alsf, apcf)), fininvdeq(pcf), pre(gs, lsf(tid), pcf(tid), InvEnq(tid0, val1)), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ ∃ durqs. DurQstep(durqs, AInvEnq(tid0, val1), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

User applied rule structural induction

And obtained the following new goals

Rule argument

term: pcf(tid)

Additional information

Used simplifier rules: DQPC freely generated by crashed, idle, invDeq, invEnq, ready, resDeq, resEnq;; ⊦ pre(gs, ls, resEnq, a) ↔ a = RetEnq(ls.tid); (s) ⊦ InvEnq(tid, val) ≠ RetEnq(tid0); (s) ⊦ pre(gs, ls, resDeq, a) ↔ a = RetDeq(ls.tid, ls.oval); (s) ⊦ InvEnq(tid, val) ≠ RetDeq(tid0, optval); (s) ⊦ pre(gs, ls, invEnq, a) ↔ a = DoEnq(ls.tid); (s) ⊦ DoEnq(tid) ≠ InvEnq(tid0, val); (s) ⊦ pre(gs, ls, invDeq, a) ↔ a = CheckEmp(ls.tid) ∧ gs.queue = [] ∨ a = DoDeqEmpty(ls.tid) ∧ ls.obsEmpty ∨ a = DoDeq(ls.tid) ∧ gs.queue ≠ []; (s) ⊦ CheckEmp(tid) ≠ InvEnq(tid0, val); (s) ⊦ DoDeqEmpty(tid) ≠ InvEnq(tid0, val); (s) ⊦ DoDeq(tid) ≠ InvEnq(tid0, val); (s) ⊦ pre(gs, ls, idle, a) ↔ a = callRun(ls.tid); (s) ⊦ InvEnq(tid, val) ≠ callRun(tid0); (s) ⊦ pre(gs, ls, crashed, a) ↔ false; (s)

Proof step 193 from proof bwsim-step-nontau (previous step) (back to tree)

lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), ready = pcf(tid), DQGInv(gs), DQLInv(gs, mkls(tid0, obsEmpty, val, optval, val0, optval0), pcf(tid0)), bwabs (mkstate (gstepf(gs, lsf(tid), pcf(tid), InvEnq(tid0, val1)), lsf(tid; lstepf(gs, lsf(tid), pcf(tid), InvEnq(tid0, val1))), pcf(tid; pcstepf(gs, lsf(tid), pcf(tid), InvEnq(tid0, val1)))), mkstate(ags, alsf, apcf)), fininvdeq(pcf), pre(gs, lsf(tid), pcf(tid), InvEnq(tid0, val1)), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ ∃ durqs. DurQstep(durqs, AInvEnq(tid0, val1), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ pcstepf(gs, ls, ready, InvEnq(ls.tid, value)) = invEnq; (s) ⊦ lstepf(gs, ls, ready, InvEnq(ls.tid, value)) = ls.ival:= value; (s) ⊦ InvEnq(tid, val) = InvEnq(tid0, val0) ↔ tid = tid0 ∧ val = val0; (ws) ⊦ InvDeq(tid) ≠ InvEnq(tid0, val); (s) ⊦ pre(gs, ls, ready, a) ↔ (∃ value. a = InvEnq(ls.tid, value)) ∨ a = InvDeq(ls.tid); (s) ⊦ gstepf(gs, ls, ready, a) = gs; (s)

Proof step 194 from proof bwsim-step-nontau (previous step) (back to tree)

lsf(lsf(tid).tid) = mkls(lsf(tid).tid, obsEmpty, val, optval, val0, optval0), ready = pcf(tid), DQGInv(gs), DQLInv(gs, mkls(lsf(tid).tid, obsEmpty, val, optval, val0, optval0), pcf(lsf(tid).tid)), bwabs(mkstate(gs, lsf(tid; lsf(tid).ival:= val1), pcf(tid; invEnq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ ∃ durqs. DurQstep(durqs, AInvEnq(lsf(tid).tid, val1), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

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] → [val3, val2, obsEmpty0, lsf(tid), optval1, tid0, 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, obsEmpty0, lsf(tid), oval, tid0, optval1

Proof step 195 from proof bwsim-step-nontau (previous step) (back to tree)

lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid) = mkls(tid0, obsEmpty0, val2, optval1, val3, optval2), ready = pcf(tid), DQGInv(gs), DQLInv(gs, mkls(tid0, obsEmpty, val, optval, val0, optval0), pcf(tid0)), bwabs(mkstate(gs, lsf(tid; lsf(tid).ival:= val1), pcf(tid; invEnq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ ∃ durqs. DurQstep(durqs, AInvEnq(tid0, val1), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 196 from proof bwsim-step-nontau (previous step) (back to tree)

lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid) = mkls(tid0, obsEmpty0, val2, optval1, val3, optval2), ready = pcf(tid), DQGInv(gs), DQLInv(gs, mkls(tid0, obsEmpty, val, optval, val0, optval0), pcf(tid0)), bwabs(mkstate(gs, lsf(tid; mkls(tid0, obsEmpty0, val1, optval1, val3, optval2)), pcf(tid; invEnq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ ∃ durqs. DurQstep(durqs, AInvEnq(tid0, val1), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 8 terms: tid abort: F discard: F computed: F

Additional information

Used terms: tid

Proof step 197 from proof bwsim-step-nontau (previous step) (back to tree)

lsf(tid).tid = tid, lsf(tid) = mkls(tid0, obsEmpty0, val2, optval1, val3, optval2), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), ready = pcf(tid), DQGInv(gs), DQLInv(gs, mkls(tid0, obsEmpty, val, optval, val0, optval0), pcf(tid0)), DQLInv(gs, lsf(tid), pcf(tid)), bwabs(mkstate(gs, lsf(tid; mkls(tid0, obsEmpty0, val1, optval1, val3, optval2)), pcf(tid; invEnq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ ∃ durqs. DurQstep(durqs, AInvEnq(tid0, val1), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 198 from proof bwsim-step-nontau (previous step) (back to tree)

lsf(tid0) = mkls(tid0, obsEmpty0, val2, optval1, val3, optval2), ready = pcf(tid0), DQGInv(gs), DQLInv(gs, mkls(tid0, obsEmpty0, val2, optval1, val3, optval2), ready), bwabs(mkstate(gs, lsf(tid0; mkls(tid0, obsEmpty0, val1, optval1, val3, optval2)), pcf(tid0; invEnq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ ∃ durqs. DurQstep(durqs, AInvEnq(tid0, val1), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

User applied rule exists right

And obtained the following new goals

Rule argument

pos: right 1 terms: mkstate (mkdgs(gs.queue), alsf(tid0; bwlabsf(lsf(tid0))), apcf(tid0; ready)) abort: F discard: T computed: F

Additional information

Used terms: mkstate(mkdgs(gs.queue), alsf(tid0; bwlabsf(lsf(tid0))), apcf(tid0; ready))

Proof step 199 from proof bwsim-step-nontau (previous step) (back to tree)

lsf(tid0) = mkls(tid0, obsEmpty0, val2, optval1, val3, optval2), ready = pcf(tid0), DQGInv(gs), DQLInv(gs, mkls(tid0, obsEmpty0, val2, optval1, val3, optval2), ready), bwabs(mkstate(gs, lsf(tid0; mkls(tid0, obsEmpty0, val1, optval1, val3, optval2)), pcf(tid0; invEnq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ DurQstep(mkstate(mkdgs(gs.queue), alsf(tid0; bwlabsf(lsf(tid0))), apcf(tid0; ready)), AInvEnq(tid0, val1), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(gs, lsf, pcf), mkstate(mkdgs(gs.queue), alsf(tid0; bwlabsf(lsf(tid0))), apcf(tid0; ready)))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).optval = oval0; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).value = ival0; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).oval = oval; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).ival = ival; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).tid = tid; (s) ⊦ ready ≠ resDeq; (s) ⊦ invDeq ≠ invEnq; (s) ⊦ bwabs(mkstate(gs, lsf, pcf), mkstate(ags, alsf, apcf)) → ( bwabs(mkstate(gs0, lsf0, pcf0), mkstate(ags0, alsf0, apcf0)) ↔ ags = mkdgs(gs.queue) → ags0 = mkdgs(gs0.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 → alsf0(tid) = mkls (lsf0(tid).tid, lsf0(tid).ival, lsf0(tid).oval, lsf0(tid).value, lsf0(tid).optval) ∧ apcf0(tid) = bwabspcf(pcf0(tid)) ∨ alsf0(tid) = mkls (lsf0(tid).tid, lsf0(tid).ival, Empty, lsf0(tid).value, lsf0(tid).optval) ∧ pcf0(tid) = invDeq ∧ apcf0(tid) = resDeq ∧ lsf0(tid).obsEmpty)); (s) ⊦ bwlabsf(ls) = mkls(ls.tid, ls.ival, ls.oval, ls.value, ls.optval); (s)

Proof step 200 from proof bwsim-step-nontau (previous step) (back to tree)

lsf(tid0) = mkls(tid0, obsEmpty0, val2, optval1, val3, optval2), ready = pcf(tid0), DQGInv(gs), DQLInv(gs, mkls(tid0, obsEmpty0, val2, optval1, val3, optval2), ready), bwabs(mkstate(gs, lsf(tid0; mkls(tid0, obsEmpty0, val1, optval1, val3, optval2)), pcf(tid0; invEnq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ DurQstep (mkstate(mkdgs(gs.queue), alsf(tid0; mkls(tid0, val2, optval1, val3, optval2)), apcf(tid0; ready)), AInvEnq(tid0, val1), mkstate(ags, alsf, apcf)) ∧ ( ags = mkdgs(gs.queue) → alsf(tid) = mkls ((tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val3, optval2);lsf(tid)).tid, (tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val3, optval2);lsf(tid)).ival, (tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val3, optval2);lsf(tid)).oval, (tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val3, optval2);lsf(tid)).value, (tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val3, optval2);lsf(tid)).optval) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ invEnq;pcf(tid))) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty → (tid0 = tid ⊃ mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval);alsf(tid)) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ (tid0 = tid ⊃ ready;apcf(tid)) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ tid0 ≠ tid ∧ resDeq = apcf(tid) ∧ lsf(tid).obsEmpty)

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 201 from proof bwsim-step-nontau (previous step) (back to tree)

gs = mkgs(queue), lsf(tid0) = mkls(tid0, obsEmpty0, val2, optval1, val3, optval2), ready = pcf(tid0), DQGInv(gs), DQLInv(gs, mkls(tid0, obsEmpty0, val2, optval1, val3, optval2), ready), bwabs(mkstate(gs, lsf(tid0; mkls(tid0, obsEmpty0, val1, optval1, val3, optval2)), pcf(tid0; invEnq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ DurQstep (mkstate(mkdgs(queue), alsf(tid0; mkls(tid0, val2, optval1, val3, optval2)), apcf(tid0; ready)), AInvEnq(tid0, val1), mkstate(ags, alsf, apcf)) ∧ ( ags = mkdgs(queue) → alsf(tid) = mkls ((tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val3, optval2);lsf(tid)).tid, (tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val3, optval2);lsf(tid)).ival, (tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val3, optval2);lsf(tid)).oval, (tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val3, optval2);lsf(tid)).value, (tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val3, optval2);lsf(tid)).optval) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ invEnq;pcf(tid))) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty → (tid0 = tid ⊃ mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval);alsf(tid)) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ (tid0 = tid ⊃ ready;apcf(tid)) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ tid0 ≠ tid ∧ resDeq = apcf(tid) ∧ lsf(tid).obsEmpty)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 202 from proof bwsim-step-nontau (previous step) (back to tree)

lsf(tid0) = mkls(tid0, obsEmpty0, val2, optval1, val3, optval2), ready = pcf(tid0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val2, optval1, val3, optval2), ready), bwabs(mkstate(mkgs(queue), lsf(tid0; mkls(tid0, obsEmpty0, val1, optval1, val3, optval2)), pcf(tid0; invEnq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦ DurQstep (mkstate(mkdgs(queue), alsf(tid0; mkls(tid0, val2, optval1, val3, optval2)), apcf(tid0; ready)), AInvEnq(tid0, val1), mkstate(ags, alsf, apcf)) ∧ ( ags = mkdgs(queue) → alsf(tid) = mkls ((tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val3, optval2);lsf(tid)).tid, (tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val3, optval2);lsf(tid)).ival, (tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val3, optval2);lsf(tid)).oval, (tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val3, optval2);lsf(tid)).value, (tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val3, optval2);lsf(tid)).optval) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ invEnq;pcf(tid))) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty → (tid0 = tid ⊃ mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval);alsf(tid)) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ (tid0 = tid ⊃ ready;apcf(tid)) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ tid0 ≠ tid ∧ resDeq = apcf(tid) ∧ lsf(tid).obsEmpty)

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, (tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val3, optval2) ;lsf(tid) ), optval, tid1, 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, (tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val3, optval2);lsf(tid)), oval, tid1, optval

Proof step 203 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val3, optval2);lsf(tid)) = mkls(tid1, obsEmpty, val, optval, val0, optval0), lsf(tid0) = mkls(tid0, obsEmpty0, val2, optval1, val3, optval2), ready = pcf(tid0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val2, optval1, val3, optval2), ready), bwabs(mkstate(mkgs(queue), lsf(tid0; mkls(tid0, obsEmpty0, val1, optval1, val3, optval2)), pcf(tid0; invEnq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦ DurQstep (mkstate(mkdgs(queue), alsf(tid0; mkls(tid0, val2, optval1, val3, optval2)), apcf(tid0; ready)), AInvEnq(tid0, val1), mkstate(ags, alsf, apcf)) ∧ ( ags = mkdgs(queue) → alsf(tid) = mkls(tid1, val, optval, val0, optval0) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ invEnq;pcf(tid))) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty → (tid0 = tid ⊃ mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval);alsf(tid)) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ (tid0 = tid ⊃ ready;apcf(tid)) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ tid0 ≠ tid ∧ resDeq = apcf(tid) ∧ lsf(tid).obsEmpty)

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] → [val5, val4, obsEmpty1, lsf(tid), optval3, tid2, optval4]

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, obsEmpty1, lsf(tid), oval, tid2, optval3

Proof step 204 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val3, optval2);lsf(tid)) = mkls(tid1, obsEmpty, val, optval, val0, optval0), lsf(tid0) = mkls(tid0, obsEmpty0, val2, optval1, val3, optval2), lsf(tid) = mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), ready = pcf(tid0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val2, optval1, val3, optval2), ready), bwabs(mkstate(mkgs(queue), lsf(tid0; mkls(tid0, obsEmpty0, val1, optval1, val3, optval2)), pcf(tid0; invEnq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦ DurQstep (mkstate(mkdgs(queue), alsf(tid0; mkls(tid0, val2, optval1, val3, optval2)), apcf(tid0; ready)), AInvEnq(tid0, val1), mkstate(ags, alsf, apcf)) ∧ ( ags = mkdgs(queue) → alsf(tid) = mkls(tid1, val, optval, val0, optval0) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ invEnq;pcf(tid))) ∨ alsf(tid) = mkls(tid2, val4, Empty, val5, optval4) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ obsEmpty1 → (tid0 = tid ⊃ mkls(tid2, val4, optval3, val5, optval4);alsf(tid)) = mkls(tid2, val4, optval3, val5, optval4) ∧ (tid0 = tid ⊃ ready;apcf(tid)) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(tid2, val4, Empty, val5, optval4) ∧ pcf(tid) = invDeq ∧ tid0 ≠ tid ∧ resDeq = apcf(tid) ∧ obsEmpty1)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 205 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val3, optval2);mkls(tid2, obsEmpty1, val4, optval3, val5, optval4)) = mkls(tid1, obsEmpty, val, optval, val0, optval0), lsf(tid) = mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), lsf(tid0) = mkls(tid0, obsEmpty0, val2, optval1, val3, optval2), ready = pcf(tid0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val2, optval1, val3, optval2), ready), bwabs(mkstate(mkgs(queue), lsf(tid0; mkls(tid0, obsEmpty0, val1, optval1, val3, optval2)), pcf(tid0; invEnq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦ DurQstep (mkstate(mkdgs(queue), alsf(tid0; mkls(tid0, val2, optval1, val3, optval2)), apcf(tid0; ready)), AInvEnq(tid0, val1), mkstate(ags, alsf, apcf)) ∧ ( ags = mkdgs(queue) → alsf(tid) = mkls(tid1, val, optval, val0, optval0) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ invEnq;pcf(tid))) ∨ alsf(tid) = mkls(tid2, val4, Empty, val5, optval4) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ obsEmpty1 → (tid0 = tid ⊃ mkls(tid2, val4, optval3, val5, optval4);alsf(tid)) = mkls(tid2, val4, optval3, val5, optval4) ∧ (tid0 = tid ⊃ ready;apcf(tid)) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(tid2, val4, Empty, val5, optval4) ∧ pcf(tid) = invDeq ∧ tid0 ≠ tid ∧ resDeq = apcf(tid) ∧ obsEmpty1)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 206 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val3, optval2);mkls(tid2, obsEmpty1, val4, optval3, val5, optval4)) = mkls(tid1, obsEmpty, val, optval, val0, optval0), lsf(tid0) = mkls(tid0, obsEmpty0, val2, optval1, val3, optval2), lsf(tid) = mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), ready = pcf(tid0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val2, optval1, val3, optval2), ready), bwabs(mkstate(mkgs(queue), lsf(tid0; mkls(tid0, obsEmpty0, val1, optval1, val3, optval2)), pcf(tid0; invEnq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ¬ DurQstep (mkstate(mkdgs(queue), alsf(tid0; mkls(tid0, val2, optval1, val3, optval2)), apcf(tid0; ready)), AInvEnq(tid0, val1), mkstate(ags, alsf, apcf)), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(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), alsf(tid0; mkls(tid0, val2, optval1, val3, optval2)), AInvEnq(tid0, val1), mkdgs(queue), apcf(tid0; ready)], <all paths>

Additional information

Used terms: mkstate(ags, alsf, apcf), alsf(tid0; mkls(tid0, val2, optval1, val3, optval2)), AInvEnq(tid0, val1), mkdgs(queue), apcf(tid0; ready)

Proof step 207 from proof bwsim-step-nontau (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 208 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val3, optval2);mkls(tid2, obsEmpty1, val4, optval3, val5, optval4)) = mkls(tid1, obsEmpty, val, optval, val0, optval0), lsf(tid) = mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), lsf(tid0) = mkls(tid0, obsEmpty0, val2, optval1, val3, optval2), ready = pcf(tid0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val2, optval1, val3, optval2), ready), bwabs(mkstate(mkgs(queue), lsf(tid0; mkls(tid0, obsEmpty0, val1, optval1, val3, optval2)), pcf(tid0; invEnq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), (AInvEnq(tid0, val1) = globalACrash ⊃ mkstate(ags, alsf, apcf) ≠ mkstate(mkdgs(queue), alsf(tid0; mkls(tid0, val2, optval1, val3, optval2)), λ tid. (apcf(tid0; ready)(tid) = idle ⊃ idle;crashed)) ;∀ tid. ¬ ( pre(mkdgs(queue), alsf(tid0; mkls(tid0, val2, optval1, val3, optval2))(tid), apcf(tid0; ready)(tid), AInvEnq(tid0, val1)) ∧ mkstate(ags, alsf, apcf) = mkstate (gstepf(mkdgs(queue), alsf(tid0; mkls(tid0, val2, optval1, val3, optval2))(tid), apcf(tid0; ready)(tid), AInvEnq(tid0, val1)), alsf(tid0; mkls(tid0, val2, optval1, val3, optval2)) (tid; lstepf(mkdgs(queue), alsf(tid0; mkls(tid0, val2, optval1, val3, optval2))(tid), apcf(tid0; ready)(tid), AInvEnq(tid0, val1))), apcf(tid0; ready) (tid; pcstepf(mkdgs(queue), alsf(tid0; mkls(tid0, val2, optval1, val3, optval2))(tid), apcf(tid0; ready)(tid), AInvEnq(tid0, val1))))) ), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ AInvEnq(tid, val) ≠ globalACrash; (s)

Proof step 209 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val3, optval2);mkls(tid2, obsEmpty1, val4, optval3, val5, optval4)) = mkls(tid1, obsEmpty, val, optval, val0, optval0), lsf(tid0) = mkls(tid0, obsEmpty0, val2, optval1, val3, optval2), lsf(tid) = mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), ready = pcf(tid0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val2, optval1, val3, optval2), ready), bwabs(mkstate(mkgs(queue), lsf(tid0; mkls(tid0, obsEmpty0, val1, optval1, val3, optval2)), pcf(tid0; invEnq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ∀ tid3. ¬ pre(mkdgs(queue), (tid0 = tid3 ⊃ mkls(tid3, val2, optval1, val3, optval2);alsf(tid3)), (tid0 = tid3 ⊃ ready;apcf(tid3)), AInvEnq(tid0, val1)) ∨ mkstate(ags, alsf, apcf) ≠ mkstate (gstepf (mkdgs(queue), (tid0 = tid3 ⊃ mkls(tid3, val2, optval1, val3, optval2);alsf(tid3)), (tid0 = tid3 ⊃ ready;apcf(tid3)), AInvEnq(tid0, val1)), alsf(tid0; mkls(tid0, val2, optval1, val3, optval2)) (tid3 ; lstepf (mkdgs(queue), (tid0 = tid3 ⊃ mkls(tid3, val2, optval1, val3, optval2);alsf(tid3)), (tid0 = tid3 ⊃ ready;apcf(tid3)), AInvEnq(tid0, val1)) ), apcf(tid0; ready) (tid3 ; pcstepf (mkdgs(queue), (tid0 = tid3 ⊃ mkls(tid3, val2, optval1, val3, optval2);alsf(tid3)), (tid0 = tid3 ⊃ ready;apcf(tid3)), AInvEnq(tid0, val1)) )) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

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

Additional information

Used terms: tid0

Proof step 210 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val3, optval2);mkls(tid2, obsEmpty1, val4, optval3, val5, optval4)) = mkls(tid1, obsEmpty, val, optval, val0, optval0), lsf(tid) = mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), lsf(tid0) = mkls(tid0, obsEmpty0, val2, optval1, val3, optval2), ready = pcf(tid0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val2, optval1, val3, optval2), ready), bwabs(mkstate(mkgs(queue), lsf(tid0; mkls(tid0, obsEmpty0, val1, optval1, val3, optval2)), pcf(tid0; invEnq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ¬ pre(mkdgs(queue), (tid0 = tid0 ⊃ mkls(tid0, val2, optval1, val3, optval2);alsf(tid0)), (tid0 = tid0 ⊃ ready;apcf(tid0)), AInvEnq(tid0, val1)) ∨ mkstate(ags, alsf, apcf) ≠ mkstate (gstepf(mkdgs(queue), (tid0 = tid0 ⊃ mkls(tid0, val2, optval1, val3, optval2);alsf(tid0)), (tid0 = tid0 ⊃ ready;apcf(tid0)), AInvEnq(tid0, val1)), alsf(tid0; mkls(tid0, val2, optval1, val3, optval2)) (tid0 ; lstepf (mkdgs(queue), (tid0 = tid0 ⊃ mkls(tid0, val2, optval1, val3, optval2);alsf(tid0)), (tid0 = tid0 ⊃ ready;apcf(tid0)), AInvEnq(tid0, val1)) ), apcf(tid0; ready) (tid0 ; pcstepf (mkdgs(queue), (tid0 = tid0 ⊃ mkls(tid0, val2, optval1, val3, optval2);alsf(tid0)), (tid0 = tid0 ⊃ ready;apcf(tid0)), AInvEnq(tid0, val1)) )) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ pcstepf (gs, mkls(tid, ival, oval, value, optval), ready, AInvEnq(tid, value0)) = invEnq; (s) ⊦ lstepf (gs, mkls(tid, ival, oval, value, optval), ready, AInvEnq(tid, value0)) = mkls(tid, value0, oval, value, optval); (s) ⊦ gstepf(gs, ls, ready, a) = gs; (s) ⊦ AInvEnq(tid, val) = AInvEnq(tid0, val0) ↔ tid = tid0 ∧ val = val0; (ws) ⊦ mkls(tid, ival, oval, ival0, oval0).tid = tid; (s) ⊦ pre(gs, ls, ready, a) ↔ (∃ value. a = AInvEnq(ls.tid, value)) ∨ a = AInvDeq(ls.tid); (s)

Proof step 211 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val3, optval2);mkls(tid2, obsEmpty1, val4, optval3, val5, optval4)) = mkls(tid1, obsEmpty, val, optval, val0, optval0), lsf(tid0) = mkls(tid0, obsEmpty0, val2, optval1, val3, optval2), lsf(tid) = mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), ready = pcf(tid0), mkstate(ags, alsf, apcf) ≠ mkstate (mkdgs(queue), alsf(tid0; mkls(tid0, val2, optval1, val3, optval2))(tid0; mkls(tid0, val1, optval1, val3, optval2)), apcf(tid0; ready)(tid0; invEnq)), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val2, optval1, val3, optval2), ready), bwabs(mkstate(mkgs(queue), lsf(tid0; mkls(tid0, obsEmpty0, val1, optval1, val3, optval2)), pcf(tid0; invEnq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦

User applied rule reduce equation

And obtained the following new goals

Rule argument

pos: left 5

Additional information

Proof step 212 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val3, optval2);mkls(tid2, obsEmpty1, val4, optval3, val5, optval4)) = mkls(tid1, obsEmpty, val, optval, val0, optval0), lsf(tid) = mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), lsf(tid0) = mkls(tid0, obsEmpty0, val2, optval1, val3, optval2), ready = pcf(tid0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val2, optval1, val3, optval2), ready), bwabs(mkstate(mkgs(queue), lsf(tid0; mkls(tid0, obsEmpty0, val1, optval1, val3, optval2)), pcf(tid0; invEnq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦ ags = mkdgs(queue) ∧ alsf = alsf(tid0; mkls(tid0, val2, optval1, val3, optval2))(tid0; mkls(tid0, val1, optval1, val3, optval2)) ∧ apcf = apcf(tid0; ready)(tid0; invEnq)

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), alsf, lsf(tid0; mkls(tid0, obsEmpty0, val1, optval1, val3, optval2)), ags, pcf(tid0; invEnq), apcf], <all paths>

Additional information

Used terms: mkgs(queue), alsf, lsf(tid0; mkls(tid0, obsEmpty0, val1, optval1, val3, optval2)), ags, pcf(tid0; invEnq), apcf

Proof step 213 from proof bwsim-step-nontau (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 214 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val3, optval2);mkls(tid2, obsEmpty1, val4, optval3, val5, optval4)) = mkls(tid1, obsEmpty, val, optval, val0, optval0), ags = mkdgs(mkgs(queue).queue), lsf(tid0) = mkls(tid0, obsEmpty0, val2, optval1, val3, optval2), lsf(tid) = mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), ready = pcf(tid0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val2, optval1, val3, optval2), ready), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ∀ tid. alsf(tid) = mkls (lsf(tid0; mkls(tid0, obsEmpty0, val1, optval1, val3, optval2))(tid).tid, lsf(tid0; mkls(tid0, obsEmpty0, val1, optval1, val3, optval2))(tid).ival, lsf(tid0; mkls(tid0, obsEmpty0, val1, optval1, val3, optval2))(tid).oval, lsf(tid0; mkls(tid0, obsEmpty0, val1, optval1, val3, optval2))(tid).value, lsf(tid0; mkls(tid0, obsEmpty0, val1, optval1, val3, optval2))(tid).optval) ∧ apcf(tid) = bwabspcf(pcf(tid0; invEnq)(tid)) ∨ alsf(tid) = mkls (lsf(tid0; mkls(tid0, obsEmpty0, val1, optval1, val3, optval2))(tid).tid, lsf(tid0; mkls(tid0, obsEmpty0, val1, optval1, val3, optval2))(tid).ival, Empty, lsf(tid0; mkls(tid0, obsEmpty0, val1, optval1, val3, optval2))(tid).value, lsf(tid0; mkls(tid0, obsEmpty0, val1, optval1, val3, optval2))(tid).optval) ∧ pcf(tid0; invEnq)(tid) = invDeq ∧ apcf(tid) = resDeq ∧ lsf(tid0; mkls(tid0, obsEmpty0, val1, optval1, val3, optval2))(tid).obsEmpty ⊦ ags = mkdgs(queue) ∧ alsf = alsf(tid0; mkls(tid0, val2, optval1, val3, optval2))(tid0; mkls(tid0, val1, optval1, val3, optval2)) ∧ apcf = apcf(tid0; ready)(tid0; invEnq)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ mkdgs(queue) = mkdgs(queue0) ↔ queue = queue0; (s) ⊦ mkgs(queue).queue = queue; (s) ⊦ invDeq ≠ invEnq; (s)

Proof step 215 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val3, optval2);mkls(tid2, obsEmpty1, val4, optval3, val5, optval4)) = mkls(tid1, obsEmpty, val, optval, val0, optval0), lsf(tid) = mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), lsf(tid0) = mkls(tid0, obsEmpty0, val2, optval1, val3, optval2), ready = pcf(tid0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val2, optval1, val3, optval2), ready), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ∀ tid3. alsf(tid3) = mkls ((tid0 = tid3 ⊃ mkls(tid3, obsEmpty0, val1, optval1, val3, optval2);lsf(tid3)).tid, (tid0 = tid3 ⊃ mkls(tid3, obsEmpty0, val1, optval1, val3, optval2);lsf(tid3)).ival, (tid0 = tid3 ⊃ mkls(tid3, obsEmpty0, val1, optval1, val3, optval2);lsf(tid3)).oval, (tid0 = tid3 ⊃ mkls(tid3, obsEmpty0, val1, optval1, val3, optval2);lsf(tid3)).value, (tid0 = tid3 ⊃ mkls(tid3, obsEmpty0, val1, optval1, val3, optval2);lsf(tid3)).optval) ∧ apcf(tid3) = bwabspcf((tid0 = tid3 ⊃ invEnq;pcf(tid3))) ∨ alsf(tid3) = mkls(lsf(tid3).tid, lsf(tid3).ival, Empty, lsf(tid3).value, lsf(tid3).optval) ∧ tid0 ≠ tid3 ∧ invDeq = pcf(tid3) ∧ apcf(tid3) = resDeq ∧ lsf(tid3).obsEmpty ⊦ alsf = alsf(tid0; mkls(tid0, val2, optval1, val3, optval2))(tid0; mkls(tid0, val1, optval1, val3, optval2)) ∧ apcf = apcf(tid0; ready)(tid0; invEnq)

User applied rule all left

And obtained the following new goals

Rule argument

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

Additional information

Used terms: tid0

Proof step 216 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val3, optval2);mkls(tid2, obsEmpty1, val4, optval3, val5, optval4)) = mkls(tid1, obsEmpty, val, optval, val0, optval0), lsf(tid0) = mkls(tid0, obsEmpty0, val2, optval1, val3, optval2), lsf(tid) = mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), ready = pcf(tid0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val2, optval1, val3, optval2), ready), fininvdeq(pcf), ∀ tid3. alsf(tid3) = mkls ((tid0 = tid3 ⊃ mkls(tid3, obsEmpty0, val1, optval1, val3, optval2);lsf(tid3)).tid, (tid0 = tid3 ⊃ mkls(tid3, obsEmpty0, val1, optval1, val3, optval2);lsf(tid3)).ival, (tid0 = tid3 ⊃ mkls(tid3, obsEmpty0, val1, optval1, val3, optval2);lsf(tid3)).oval, (tid0 = tid3 ⊃ mkls(tid3, obsEmpty0, val1, optval1, val3, optval2);lsf(tid3)).value, (tid0 = tid3 ⊃ mkls(tid3, obsEmpty0, val1, optval1, val3, optval2);lsf(tid3)).optval) ∧ apcf(tid3) = bwabspcf((tid0 = tid3 ⊃ invEnq;pcf(tid3))) ∨ alsf(tid3) = mkls(lsf(tid3).tid, lsf(tid3).ival, Empty, lsf(tid3).value, lsf(tid3).optval) ∧ tid0 ≠ tid3 ∧ invDeq = pcf(tid3) ∧ apcf(tid3) = resDeq ∧ lsf(tid3).obsEmpty, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), alsf(tid0) = mkls ((tid0 = tid0 ⊃ mkls(tid0, obsEmpty0, val1, optval1, val3, optval2);lsf(tid0)).tid, (tid0 = tid0 ⊃ mkls(tid0, obsEmpty0, val1, optval1, val3, optval2);lsf(tid0)).ival, (tid0 = tid0 ⊃ mkls(tid0, obsEmpty0, val1, optval1, val3, optval2);lsf(tid0)).oval, (tid0 = tid0 ⊃ mkls(tid0, obsEmpty0, val1, optval1, val3, optval2);lsf(tid0)).value, (tid0 = tid0 ⊃ mkls(tid0, obsEmpty0, val1, optval1, val3, optval2);lsf(tid0)).optval) ∧ apcf(tid0) = bwabspcf((tid0 = tid0 ⊃ invEnq;pcf(tid0))) ∨ alsf(tid0) = mkls(lsf(tid0).tid, lsf(tid0).ival, Empty, lsf(tid0).value, lsf(tid0).optval) ∧ tid0 ≠ tid0 ∧ invDeq = pcf(tid0) ∧ apcf(tid0) = resDeq ∧ lsf(tid0).obsEmpty ⊦ alsf = alsf(tid0; mkls(tid0, val2, optval1, val3, optval2))(tid0; mkls(tid0, val1, optval1, val3, optval2)) ∧ apcf = apcf(tid0; ready)(tid0; invEnq)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ bwabspcf(invEnq) = invEnq; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).optval = oval0; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).value = ival0; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).oval = oval; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).ival = ival; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).tid = tid; (s)

Proof step 217 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val3, optval2);mkls(tid2, obsEmpty1, val4, optval3, val5, optval4)) = mkls(tid1, obsEmpty, val, optval, val0, optval0), alsf(tid0) = mkls(tid0, val1, optval1, val3, optval2), apcf(tid0) = invEnq, lsf(tid) = mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), lsf(tid0) = mkls(tid0, obsEmpty0, val2, optval1, val3, optval2), ready = pcf(tid0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val2, optval1, val3, optval2), ready), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ∀ tid3. alsf(tid3) = mkls ((tid0 = tid3 ⊃ mkls(tid3, obsEmpty0, val1, optval1, val3, optval2);lsf(tid3)).tid, (tid0 = tid3 ⊃ mkls(tid3, obsEmpty0, val1, optval1, val3, optval2);lsf(tid3)).ival, (tid0 = tid3 ⊃ mkls(tid3, obsEmpty0, val1, optval1, val3, optval2);lsf(tid3)).oval, (tid0 = tid3 ⊃ mkls(tid3, obsEmpty0, val1, optval1, val3, optval2);lsf(tid3)).value, (tid0 = tid3 ⊃ mkls(tid3, obsEmpty0, val1, optval1, val3, optval2);lsf(tid3)).optval) ∧ apcf(tid3) = bwabspcf((tid0 = tid3 ⊃ invEnq;pcf(tid3))) ∨ alsf(tid3) = mkls(lsf(tid3).tid, lsf(tid3).ival, Empty, lsf(tid3).value, lsf(tid3).optval) ∧ tid0 ≠ tid3 ∧ invDeq = pcf(tid3) ∧ apcf(tid3) = resDeq ∧ lsf(tid3).obsEmpty ⊦ alsf = alsf(tid0; mkls(tid0, val2, optval1, val3, optval2))(tid0; mkls(tid0, val1, optval1, val3, optval2)) ∧ apcf = apcf(tid0; ready)(tid0; invEnq)

User applied rule all left

And obtained the following new goals

Rule argument

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

Additional information

Used terms: tid

Proof step 218 from proof bwsim-step-nontau (previous step) (back to tree)

lsf(tid).tid = tid, (tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val3, optval2);mkls(tid2, obsEmpty1, val4, optval3, val5, optval4)) = mkls(tid1, obsEmpty, val, optval, val0, optval0), alsf(tid0) = mkls(tid0, val1, optval1, val3, optval2), apcf(tid0) = invEnq, lsf(tid0) = mkls(tid0, obsEmpty0, val2, optval1, val3, optval2), lsf(tid) = mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), ready = pcf(tid0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val2, optval1, val3, optval2), ready), DQLInv(mkgs(queue), lsf(tid), pcf(tid)), fininvdeq(pcf), ∀ tid3. alsf(tid3) = mkls ((tid0 = tid3 ⊃ mkls(tid3, obsEmpty0, val1, optval1, val3, optval2);lsf(tid3)).tid, (tid0 = tid3 ⊃ mkls(tid3, obsEmpty0, val1, optval1, val3, optval2);lsf(tid3)).ival, (tid0 = tid3 ⊃ mkls(tid3, obsEmpty0, val1, optval1, val3, optval2);lsf(tid3)).oval, (tid0 = tid3 ⊃ mkls(tid3, obsEmpty0, val1, optval1, val3, optval2);lsf(tid3)).value, (tid0 = tid3 ⊃ mkls(tid3, obsEmpty0, val1, optval1, val3, optval2);lsf(tid3)).optval) ∧ apcf(tid3) = bwabspcf((tid0 = tid3 ⊃ invEnq;pcf(tid3))) ∨ alsf(tid3) = mkls(lsf(tid3).tid, lsf(tid3).ival, Empty, lsf(tid3).value, lsf(tid3).optval) ∧ tid0 ≠ tid3 ∧ invDeq = pcf(tid3) ∧ apcf(tid3) = resDeq ∧ lsf(tid3).obsEmpty, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦ alsf = alsf(tid0; mkls(tid0, val2, optval1, val3, optval2))(tid0; mkls(tid0, val1, optval1, val3, optval2)) ∧ apcf = apcf(tid0; ready)(tid0; invEnq)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 219 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty0, val1, optval1, val3, optval2);mkls(tid2, obsEmpty1, val4, optval3, val5, optval4)) = mkls(tid1, obsEmpty, val, optval, val0, optval0), alsf(tid0) = mkls(tid0, val1, optval1, val3, optval2), apcf(tid0) = invEnq, lsf(tid0) = mkls(tid0, obsEmpty0, val2, optval1, val3, optval2), lsf(tid2) = mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), ready = pcf(tid0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val2, optval1, val3, optval2), ready), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), pcf(tid2)), fininvdeq(pcf), ∀ tid3. alsf(tid3) = mkls ((tid0 = tid3 ⊃ mkls(tid3, obsEmpty0, val1, optval1, val3, optval2);lsf(tid3)).tid, (tid0 = tid3 ⊃ mkls(tid3, obsEmpty0, val1, optval1, val3, optval2);lsf(tid3)).ival, (tid0 = tid3 ⊃ mkls(tid3, obsEmpty0, val1, optval1, val3, optval2);lsf(tid3)).oval, (tid0 = tid3 ⊃ mkls(tid3, obsEmpty0, val1, optval1, val3, optval2);lsf(tid3)).value, (tid0 = tid3 ⊃ mkls(tid3, obsEmpty0, val1, optval1, val3, optval2);lsf(tid3)).optval) ∧ apcf(tid3) = bwabspcf((tid0 = tid3 ⊃ invEnq;pcf(tid3))) ∨ alsf(tid3) = mkls(lsf(tid3).tid, lsf(tid3).ival, Empty, lsf(tid3).value, lsf(tid3).optval) ∧ tid0 ≠ tid3 ∧ invDeq = pcf(tid3) ∧ apcf(tid3) = resDeq ∧ lsf(tid3).obsEmpty, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦ alsf = alsf(tid0; mkls(tid0, val2, optval1, val3, optval2))(tid0; mkls(tid0, val1, optval1, val3, optval2)) ∧ apcf = apcf(tid0; ready)(tid0; invEnq)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 220 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty0, val1, optval1, val3, optval2);mkls(tid2, obsEmpty1, val4, optval3, val5, optval4)) = mkls(tid1, obsEmpty, val, optval, val0, optval0), alsf(tid0) = mkls(tid0, val1, optval1, val3, optval2), apcf(tid0) = invEnq, lsf(tid2) = mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), lsf(tid0) = mkls(tid0, obsEmpty0, val2, optval1, val3, optval2), ready = pcf(tid0), alsf ≠ alsf(tid0; mkls(tid0, val2, optval1, val3, optval2))(tid0; mkls(tid0, val1, optval1, val3, optval2)), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), pcf(tid2)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val2, optval1, val3, optval2), ready), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ∀ tid3. alsf(tid3) = mkls ((tid0 = tid3 ⊃ mkls(tid3, obsEmpty0, val1, optval1, val3, optval2);lsf(tid3)).tid, (tid0 = tid3 ⊃ mkls(tid3, obsEmpty0, val1, optval1, val3, optval2);lsf(tid3)).ival, (tid0 = tid3 ⊃ mkls(tid3, obsEmpty0, val1, optval1, val3, optval2);lsf(tid3)).oval, (tid0 = tid3 ⊃ mkls(tid3, obsEmpty0, val1, optval1, val3, optval2);lsf(tid3)).value, (tid0 = tid3 ⊃ mkls(tid3, obsEmpty0, val1, optval1, val3, optval2);lsf(tid3)).optval) ∧ apcf(tid3) = bwabspcf((tid0 = tid3 ⊃ invEnq;pcf(tid3))) ∨ alsf(tid3) = mkls(lsf(tid3).tid, lsf(tid3).ival, Empty, lsf(tid3).value, lsf(tid3).optval) ∧ tid0 ≠ tid3 ∧ invDeq = pcf(tid3) ∧ apcf(tid3) = resDeq ∧ lsf(tid3).obsEmpty ⊦

User applied rule expand left

And obtained the following new goals

Rule argument

pos: left 7

Additional information

Proof step 221 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty0, val1, optval1, val3, optval2);mkls(tid2, obsEmpty1, val4, optval3, val5, optval4)) = mkls(tid1, obsEmpty, val, optval, val0, optval0), alsf(tid0) = mkls(tid0, val1, optval1, val3, optval2), apcf(tid0) = invEnq, lsf(tid0) = mkls(tid0, obsEmpty0, val2, optval1, val3, optval2), lsf(tid2) = mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), ready = pcf(tid0), alsf(tid) ≠ alsf(tid0; mkls(tid0, val2, optval1, val3, optval2))(tid0; mkls(tid0, val1, optval1, val3, optval2))(tid), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val2, optval1, val3, optval2), ready), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), pcf(tid2)), fininvdeq(pcf), ∀ tid3. alsf(tid3) = mkls ((tid0 = tid3 ⊃ mkls(tid3, obsEmpty0, val1, optval1, val3, optval2);lsf(tid3)).tid, (tid0 = tid3 ⊃ mkls(tid3, obsEmpty0, val1, optval1, val3, optval2);lsf(tid3)).ival, (tid0 = tid3 ⊃ mkls(tid3, obsEmpty0, val1, optval1, val3, optval2);lsf(tid3)).oval, (tid0 = tid3 ⊃ mkls(tid3, obsEmpty0, val1, optval1, val3, optval2);lsf(tid3)).value, (tid0 = tid3 ⊃ mkls(tid3, obsEmpty0, val1, optval1, val3, optval2);lsf(tid3)).optval) ∧ apcf(tid3) = bwabspcf((tid0 = tid3 ⊃ invEnq;pcf(tid3))) ∨ alsf(tid3) = mkls(lsf(tid3).tid, lsf(tid3).ival, Empty, lsf(tid3).value, lsf(tid3).optval) ∧ tid0 ≠ tid3 ∧ invDeq = pcf(tid3) ∧ apcf(tid3) = resDeq ∧ lsf(tid3).obsEmpty, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 222 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty0, val1, optval1, val3, optval2);mkls(tid2, obsEmpty1, val4, optval3, val5, optval4)) = mkls(tid1, obsEmpty, val, optval, val0, optval0), alsf(tid0) = mkls(tid0, val1, optval1, val3, optval2), apcf(tid0) = invEnq, lsf(tid2) = mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), lsf(tid0) = mkls(tid0, obsEmpty0, val2, optval1, val3, optval2), ready = pcf(tid0), alsf(tid) ≠ (tid0 = tid ⊃ mkls(tid, val1, optval1, val3, optval2);alsf(tid)), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), pcf(tid2)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val2, optval1, val3, optval2), ready), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ∀ tid3. alsf(tid3) = mkls ((tid0 = tid3 ⊃ mkls(tid3, obsEmpty0, val1, optval1, val3, optval2);lsf(tid3)).tid, (tid0 = tid3 ⊃ mkls(tid3, obsEmpty0, val1, optval1, val3, optval2);lsf(tid3)).ival, (tid0 = tid3 ⊃ mkls(tid3, obsEmpty0, val1, optval1, val3, optval2);lsf(tid3)).oval, (tid0 = tid3 ⊃ mkls(tid3, obsEmpty0, val1, optval1, val3, optval2);lsf(tid3)).value, (tid0 = tid3 ⊃ mkls(tid3, obsEmpty0, val1, optval1, val3, optval2);lsf(tid3)).optval) ∧ apcf(tid3) = bwabspcf((tid0 = tid3 ⊃ invEnq;pcf(tid3))) ∨ alsf(tid3) = mkls(lsf(tid3).tid, lsf(tid3).ival, Empty, lsf(tid3).value, lsf(tid3).optval) ∧ tid0 ≠ tid3 ∧ invDeq = pcf(tid3) ∧ apcf(tid3) = resDeq ∧ lsf(tid3).obsEmpty ⊦

User applied rule case distinction

And closed the goal!

Rule argument

pos: left 7

Additional information

Proof step 223 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty0, val1, optval1, val3, optval2);mkls(tid2, obsEmpty1, val4, optval3, val5, optval4)) = mkls(tid1, obsEmpty, val, optval, val0, optval0), alsf(tid0) = mkls(tid0, val1, optval1, val3, optval2), apcf(tid0) = invEnq, lsf(tid2) = mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), lsf(tid0) = mkls(tid0, obsEmpty0, val2, optval1, val3, optval2), ready = pcf(tid0), apcf ≠ apcf(tid0; ready)(tid0; invEnq), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), pcf(tid2)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val2, optval1, val3, optval2), ready), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ∀ tid3. alsf(tid3) = mkls ((tid0 = tid3 ⊃ mkls(tid3, obsEmpty0, val1, optval1, val3, optval2);lsf(tid3)).tid, (tid0 = tid3 ⊃ mkls(tid3, obsEmpty0, val1, optval1, val3, optval2);lsf(tid3)).ival, (tid0 = tid3 ⊃ mkls(tid3, obsEmpty0, val1, optval1, val3, optval2);lsf(tid3)).oval, (tid0 = tid3 ⊃ mkls(tid3, obsEmpty0, val1, optval1, val3, optval2);lsf(tid3)).value, (tid0 = tid3 ⊃ mkls(tid3, obsEmpty0, val1, optval1, val3, optval2);lsf(tid3)).optval) ∧ apcf(tid3) = bwabspcf((tid0 = tid3 ⊃ invEnq;pcf(tid3))) ∨ alsf(tid3) = mkls(lsf(tid3).tid, lsf(tid3).ival, Empty, lsf(tid3).value, lsf(tid3).optval) ∧ tid0 ≠ tid3 ∧ invDeq = pcf(tid3) ∧ apcf(tid3) = resDeq ∧ lsf(tid3).obsEmpty ⊦

User applied rule expand left

And obtained the following new goals

Rule argument

pos: left 7

Additional information

Proof step 224 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty0, val1, optval1, val3, optval2);mkls(tid2, obsEmpty1, val4, optval3, val5, optval4)) = mkls(tid1, obsEmpty, val, optval, val0, optval0), alsf(tid0) = mkls(tid0, val1, optval1, val3, optval2), apcf(tid0) = invEnq, lsf(tid0) = mkls(tid0, obsEmpty0, val2, optval1, val3, optval2), lsf(tid2) = mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), ready = pcf(tid0), apcf(tid) ≠ apcf(tid0; ready)(tid0; invEnq)(tid), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val2, optval1, val3, optval2), ready), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), pcf(tid2)), fininvdeq(pcf), ∀ tid3. alsf(tid3) = mkls ((tid0 = tid3 ⊃ mkls(tid3, obsEmpty0, val1, optval1, val3, optval2);lsf(tid3)).tid, (tid0 = tid3 ⊃ mkls(tid3, obsEmpty0, val1, optval1, val3, optval2);lsf(tid3)).ival, (tid0 = tid3 ⊃ mkls(tid3, obsEmpty0, val1, optval1, val3, optval2);lsf(tid3)).oval, (tid0 = tid3 ⊃ mkls(tid3, obsEmpty0, val1, optval1, val3, optval2);lsf(tid3)).value, (tid0 = tid3 ⊃ mkls(tid3, obsEmpty0, val1, optval1, val3, optval2);lsf(tid3)).optval) ∧ apcf(tid3) = bwabspcf((tid0 = tid3 ⊃ invEnq;pcf(tid3))) ∨ alsf(tid3) = mkls(lsf(tid3).tid, lsf(tid3).ival, Empty, lsf(tid3).value, lsf(tid3).optval) ∧ tid0 ≠ tid3 ∧ invDeq = pcf(tid3) ∧ apcf(tid3) = resDeq ∧ lsf(tid3).obsEmpty, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 225 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty0, val1, optval1, val3, optval2);mkls(tid2, obsEmpty1, val4, optval3, val5, optval4)) = mkls(tid1, obsEmpty, val, optval, val0, optval0), alsf(tid0) = mkls(tid0, val1, optval1, val3, optval2), apcf(tid0) = invEnq, lsf(tid2) = mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), lsf(tid0) = mkls(tid0, obsEmpty0, val2, optval1, val3, optval2), ready = pcf(tid0), apcf(tid) ≠ (tid0 = tid ⊃ invEnq;apcf(tid)), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), pcf(tid2)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val2, optval1, val3, optval2), ready), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ∀ tid3. alsf(tid3) = mkls ((tid0 = tid3 ⊃ mkls(tid3, obsEmpty0, val1, optval1, val3, optval2);lsf(tid3)).tid, (tid0 = tid3 ⊃ mkls(tid3, obsEmpty0, val1, optval1, val3, optval2);lsf(tid3)).ival, (tid0 = tid3 ⊃ mkls(tid3, obsEmpty0, val1, optval1, val3, optval2);lsf(tid3)).oval, (tid0 = tid3 ⊃ mkls(tid3, obsEmpty0, val1, optval1, val3, optval2);lsf(tid3)).value, (tid0 = tid3 ⊃ mkls(tid3, obsEmpty0, val1, optval1, val3, optval2);lsf(tid3)).optval) ∧ apcf(tid3) = bwabspcf((tid0 = tid3 ⊃ invEnq;pcf(tid3))) ∨ alsf(tid3) = mkls(lsf(tid3).tid, lsf(tid3).ival, Empty, lsf(tid3).value, lsf(tid3).optval) ∧ tid0 ≠ tid3 ∧ invDeq = pcf(tid3) ∧ apcf(tid3) = resDeq ∧ lsf(tid3).obsEmpty ⊦

User applied rule case distinction

And closed the goal!

Rule argument

pos: left 7

Additional information

Proof step 226 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val3, optval2);mkls(tid2, obsEmpty1, val4, optval3, val5, optval4)) = mkls(tid1, obsEmpty, val, optval, val0, optval0), ags = mkdgs(queue), lsf(tid0) = mkls(tid0, obsEmpty0, val2, optval1, val3, optval2), lsf(tid) = mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), ready = pcf(tid0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val2, optval1, val3, optval2), ready), bwabs(mkstate(mkgs(queue), lsf(tid0; mkls(tid0, obsEmpty0, val1, optval1, val3, optval2)), pcf(tid0; invEnq)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), alsf(tid) = mkls(tid1, val, optval, val0, optval0) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ invEnq;pcf(tid))) ∨ alsf(tid) = mkls(tid2, val4, Empty, val5, optval4) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ obsEmpty1 ⊦ (tid0 = tid ⊃ mkls(tid2, val4, optval3, val5, optval4);alsf(tid)) = mkls(tid2, val4, optval3, val5, optval4) ∧ (tid0 = tid ⊃ ready;apcf(tid)) = bwabspcf(pcf(tid)), alsf(tid) = mkls(tid2, val4, Empty, val5, optval4) ∧ pcf(tid) = invDeq ∧ tid0 ≠ tid ∧ resDeq = apcf(tid) ∧ obsEmpty1

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 227 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val3, optval2);mkls(tid2, obsEmpty1, val4, optval3, val5, optval4)) = mkls(tid1, obsEmpty, val, optval, val0, optval0), lsf(tid) = mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), lsf(tid0) = mkls(tid0, obsEmpty0, val2, optval1, val3, optval2), ready = pcf(tid0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val2, optval1, val3, optval2), ready), bwabs(mkstate(mkgs(queue), lsf(tid0; mkls(tid0, obsEmpty0, val1, optval1, val3, optval2)), pcf(tid0; invEnq)), mkstate(mkdgs(queue), alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), alsf(tid) = mkls(tid1, val, optval, val0, optval0) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ invEnq;pcf(tid))) ∨ alsf(tid) = mkls(tid2, val4, Empty, val5, optval4) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ obsEmpty1 ⊦ alsf(tid) = mkls(tid2, val4, Empty, val5, optval4) ∧ pcf(tid) = invDeq ∧ tid0 ≠ tid ∧ resDeq = apcf(tid) ∧ obsEmpty1, (tid0 = tid ⊃ mkls(tid2, val4, optval3, val5, optval4);alsf(tid)) = mkls(tid2, val4, optval3, val5, optval4) ∧ (tid0 = tid ⊃ ready;apcf(tid)) = bwabspcf(pcf(tid))

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 9 terms: tid abort: F discard: F computed: F

Additional information

Used terms: tid

Proof step 228 from proof bwsim-step-nontau (previous step) (back to tree)

lsf(tid).tid = tid, (tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val3, optval2);mkls(tid2, obsEmpty1, val4, optval3, val5, optval4)) = mkls(tid1, obsEmpty, val, optval, val0, optval0), lsf(tid0) = mkls(tid0, obsEmpty0, val2, optval1, val3, optval2), lsf(tid) = mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), ready = pcf(tid0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val2, optval1, val3, optval2), ready), DQLInv(mkgs(queue), lsf(tid), pcf(tid)), bwabs(mkstate(mkgs(queue), lsf(tid0; mkls(tid0, obsEmpty0, val1, optval1, val3, optval2)), pcf(tid0; invEnq)), mkstate(mkdgs(queue), alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), alsf(tid) = mkls(tid1, val, optval, val0, optval0) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ invEnq;pcf(tid))) ∨ alsf(tid) = mkls(tid2, val4, Empty, val5, optval4) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ obsEmpty1 ⊦ (tid0 = tid ⊃ mkls(tid2, val4, optval3, val5, optval4);alsf(tid)) = mkls(tid2, val4, optval3, val5, optval4) ∧ (tid0 = tid ⊃ ready;apcf(tid)) = bwabspcf(pcf(tid)), alsf(tid) = mkls(tid2, val4, Empty, val5, optval4) ∧ pcf(tid) = invDeq ∧ tid0 ≠ tid ∧ resDeq = apcf(tid) ∧ obsEmpty1

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 229 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty0, val1, optval1, val3, optval2);mkls(tid2, obsEmpty1, val4, optval3, val5, optval4)) = mkls(tid1, obsEmpty, val, optval, val0, optval0), lsf(tid0) = mkls(tid0, obsEmpty0, val2, optval1, val3, optval2), lsf(tid2) = mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), ready = pcf(tid0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val2, optval1, val3, optval2), ready), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val4, optval3, val5, optval4), pcf(tid2)), bwabs(mkstate(mkgs(queue), lsf(tid0; mkls(tid0, obsEmpty0, val1, optval1, val3, optval2)), pcf(tid0; invEnq)), mkstate(mkdgs(queue), alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), alsf(tid2) = mkls(tid1, val, optval, val0, optval0) ∧ apcf(tid2) = bwabspcf((tid0 = tid2 ⊃ invEnq;pcf(tid2))) ∨ alsf(tid2) = mkls(tid2, val4, Empty, val5, optval4) ∧ tid0 ≠ tid2 ∧ invDeq = pcf(tid2) ∧ apcf(tid2) = resDeq ∧ obsEmpty1 ⊦ (tid0 = tid2 ⊃ mkls(tid2, val4, optval3, val5, optval4);alsf(tid2)) = mkls(tid2, val4, optval3, val5, optval4) ∧ (tid0 = tid2 ⊃ ready;apcf(tid2)) = bwabspcf(pcf(tid2)), alsf(tid2) = mkls(tid2, val4, Empty, val5, optval4) ∧ pcf(tid2) = invDeq ∧ tid0 ≠ tid2 ∧ resDeq = apcf(tid2) ∧ obsEmpty1

User applied rule case distinction

And closed the goal!

Rule argument

pos: left 1

Additional information

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

Proof step 230 from proof bwsim-step-nontau (previous step) (back to tree)

ca = RetDeq(tid0, optval1), lsf(ca.tid) = mkls(ca.tid, obsEmpty, val, optval, val0, optval0), ca ≠ globalCrash, DQGInv(gs), DQLInv(gs, mkls(ca.tid, obsEmpty, val, optval, val0, optval0), pcf(ca.tid)), bwabs (mkstate(gstepf(gs, lsf(tid), pcf(tid), ca), lsf(tid; lstepf(gs, lsf(tid), pcf(tid), ca)), pcf(tid; pcstepf(gs, lsf(tid), pcf(tid), ca))), mkstate(ags, alsf, apcf)), fininvdeq(pcf), pre(gs, lsf(tid), pcf(tid), ca), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ (∃ tid. ca = CheckEmp(tid) ⊃ (apcf(ca.tid) = resDeq ⊃ ADoDeq(ca.tid);τ);bwabsa(ca)) = τ, ∃ durqs. DurQstep(durqs, (∃ tid. ca = CheckEmp(tid) ⊃ (apcf(ca.tid) = resDeq ⊃ ADoDeq(ca.tid);τ);bwabsa(ca)), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ARetDeq(tid, optval) ≠ τ; (s) ⊦ bwabsa(RetDeq(tid, optval)) = ARetDeq(tid, optval); (s) ⊦ CheckEmp(tid) ≠ RetDeq(tid0, optval); (s) ⊦ RetDeq(tid, optval).tid = tid; (s) ⊦ RetDeq(tid, optval) ≠ globalCrash; (s)

Proof step 231 from proof bwsim-step-nontau (previous step) (back to tree)

lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), DQGInv(gs), DQLInv(gs, mkls(tid0, obsEmpty, val, optval, val0, optval0), pcf(tid0)), bwabs (mkstate (gstepf(gs, lsf(tid), pcf(tid), RetDeq(tid0, optval1)), lsf(tid; lstepf(gs, lsf(tid), pcf(tid), RetDeq(tid0, optval1))), pcf(tid; pcstepf(gs, lsf(tid), pcf(tid), RetDeq(tid0, optval1)))), mkstate(ags, alsf, apcf)), fininvdeq(pcf), pre(gs, lsf(tid), pcf(tid), RetDeq(tid0, optval1)), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ ∃ durqs. DurQstep(durqs, ARetDeq(tid0, optval1), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

User applied rule structural induction

And obtained the following new goals

Rule argument

term: pcf(tid)

Additional information

Used simplifier rules: DQPC freely generated by crashed, idle, invDeq, invEnq, ready, resDeq, resEnq;; ⊦ pre(gs, ls, resEnq, a) ↔ a = RetEnq(ls.tid); (s) ⊦ RetDeq(tid, optval) ≠ RetEnq(tid0); (s) ⊦ gstepf(gs, ls, ready, a) = gs; (s) ⊦ pre(gs, ls, ready, a) ↔ (∃ value. a = InvEnq(ls.tid, value)) ∨ a = InvDeq(ls.tid); (s) ⊦ InvEnq(tid, val) ≠ RetDeq(tid0, optval); (s) ⊦ InvDeq(tid) ≠ RetDeq(tid0, optval); (s) ⊦ pre(gs, ls, invEnq, a) ↔ a = DoEnq(ls.tid); (s) ⊦ DoEnq(tid) ≠ RetDeq(tid0, optval); (s) ⊦ pre(gs, ls, invDeq, a) ↔ a = CheckEmp(ls.tid) ∧ gs.queue = [] ∨ a = DoDeqEmpty(ls.tid) ∧ ls.obsEmpty ∨ a = DoDeq(ls.tid) ∧ gs.queue ≠ []; (s) ⊦ CheckEmp(tid) ≠ RetDeq(tid0, optval); (s) ⊦ DoDeqEmpty(tid) ≠ RetDeq(tid0, optval); (s) ⊦ DoDeq(tid) ≠ RetDeq(tid0, optval); (s) ⊦ pre(gs, ls, idle, a) ↔ a = callRun(ls.tid); (s) ⊦ RetDeq(tid, optval) ≠ callRun(tid0); (s) ⊦ pre(gs, ls, crashed, a) ↔ false; (s)

Proof step 232 from proof bwsim-step-nontau (previous step) (back to tree)

lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), resDeq = pcf(tid), DQGInv(gs), DQLInv(gs, mkls(tid0, obsEmpty, val, optval, val0, optval0), pcf(tid0)), bwabs (mkstate (gstepf(gs, lsf(tid), pcf(tid), RetDeq(tid0, optval1)), lsf(tid; lstepf(gs, lsf(tid), pcf(tid), RetDeq(tid0, optval1))), pcf(tid; pcstepf(gs, lsf(tid), pcf(tid), RetDeq(tid0, optval1)))), mkstate(ags, alsf, apcf)), fininvdeq(pcf), pre(gs, lsf(tid), pcf(tid), RetDeq(tid0, optval1)), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ ∃ durqs. DurQstep(durqs, ARetDeq(tid0, optval1), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ pcstepf(gs, ls, resDeq, RetDeq(ls.tid, ls.oval)) = ready; (s) ⊦ lstepf(gs, ls, resDeq, RetDeq(ls.tid, ls.oval)) = ls.optval:= ls.oval; (s) ⊦ gstepf(gs, ls, resDeq, RetDeq(ls.tid, ls.oval)) = gs; (s) ⊦ RetDeq(tid, optval) = RetDeq(tid0, optval0) ↔ tid = tid0 ∧ optval = optval0; (ws) ⊦ pre(gs, ls, resDeq, a) ↔ a = RetDeq(ls.tid, ls.oval); (s)

Proof step 233 from proof bwsim-step-nontau (previous step) (back to tree)

lsf(lsf(tid).tid) = mkls(lsf(tid).tid, obsEmpty, val, optval, val0, optval0), resDeq = pcf(tid), DQGInv(gs), DQLInv(gs, mkls(lsf(tid).tid, obsEmpty, val, optval, val0, optval0), pcf(lsf(tid).tid)), bwabs(mkstate(gs, lsf(tid; lsf(tid).optval:= lsf(tid).oval), pcf(tid; ready)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ ∃ durqs. DurQstep(durqs, ARetDeq(lsf(tid).tid, lsf(tid).oval), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

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, obsEmpty0, lsf(tid), optval1, tid0, 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, obsEmpty0, lsf(tid), oval, tid0, optval1

Proof step 234 from proof bwsim-step-nontau (previous step) (back to tree)

lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), resDeq = pcf(tid), DQGInv(gs), DQLInv(gs, mkls(tid0, obsEmpty, val, optval, val0, optval0), pcf(tid0)), bwabs(mkstate(gs, lsf(tid; lsf(tid).optval:= optval1), pcf(tid; ready)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ ∃ durqs. DurQstep(durqs, ARetDeq(tid0, optval1), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 235 from proof bwsim-step-nontau (previous step) (back to tree)

lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), resDeq = pcf(tid), DQGInv(gs), DQLInv(gs, mkls(tid0, obsEmpty, val, optval, val0, optval0), pcf(tid0)), bwabs(mkstate(gs, lsf(tid; mkls(tid0, obsEmpty0, val1, optval1, val2, optval1)), pcf(tid; ready)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ ∃ durqs. DurQstep(durqs, ARetDeq(tid0, optval1), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 8 terms: tid abort: F discard: F computed: F

Additional information

Used terms: tid

Proof step 236 from proof bwsim-step-nontau (previous step) (back to tree)

lsf(tid).tid = tid, lsf(tid) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), resDeq = pcf(tid), DQGInv(gs), DQLInv(gs, mkls(tid0, obsEmpty, val, optval, val0, optval0), pcf(tid0)), DQLInv(gs, lsf(tid), pcf(tid)), bwabs(mkstate(gs, lsf(tid; mkls(tid0, obsEmpty0, val1, optval1, val2, optval1)), pcf(tid; ready)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ ∃ durqs. DurQstep(durqs, ARetDeq(tid0, optval1), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 237 from proof bwsim-step-nontau (previous step) (back to tree)

lsf(tid0) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), resDeq = pcf(tid0), DQGInv(gs), DQLInv(gs, mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), resDeq), bwabs(mkstate(gs, lsf(tid0; mkls(tid0, obsEmpty0, val1, optval1, val2, optval1)), pcf(tid0; ready)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ ∃ durqs. DurQstep(durqs, ARetDeq(tid0, optval1), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

User applied rule exists right

And obtained the following new goals

Rule argument

pos: right 1 terms: mkstate (mkdgs(gs.queue), alsf(tid0; bwlabsf(lsf(tid0))), apcf(tid0; resDeq)) abort: F discard: T computed: F

Additional information

Used terms: mkstate(mkdgs(gs.queue), alsf(tid0; bwlabsf(lsf(tid0))), apcf(tid0; resDeq))

Proof step 238 from proof bwsim-step-nontau (previous step) (back to tree)

lsf(tid0) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), resDeq = pcf(tid0), DQGInv(gs), DQLInv(gs, mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), resDeq), bwabs(mkstate(gs, lsf(tid0; mkls(tid0, obsEmpty0, val1, optval1, val2, optval1)), pcf(tid0; ready)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ DurQstep(mkstate(mkdgs(gs.queue), alsf(tid0; bwlabsf(lsf(tid0))), apcf(tid0; resDeq)), ARetDeq(tid0, optval1), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(gs, lsf, pcf), mkstate(mkdgs(gs.queue), alsf(tid0; bwlabsf(lsf(tid0))), apcf(tid0; resDeq)))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).optval = oval0; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).value = ival0; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).oval = oval; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).ival = ival; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).tid = tid; (s) ⊦ invDeq ≠ ready; (s) ⊦ bwabs(mkstate(gs, lsf, pcf), mkstate(ags, alsf, apcf)) → ( bwabs(mkstate(gs0, lsf0, pcf0), mkstate(ags0, alsf0, apcf0)) ↔ ags = mkdgs(gs.queue) → ags0 = mkdgs(gs0.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 → alsf0(tid) = mkls (lsf0(tid).tid, lsf0(tid).ival, lsf0(tid).oval, lsf0(tid).value, lsf0(tid).optval) ∧ apcf0(tid) = bwabspcf(pcf0(tid)) ∨ alsf0(tid) = mkls (lsf0(tid).tid, lsf0(tid).ival, Empty, lsf0(tid).value, lsf0(tid).optval) ∧ pcf0(tid) = invDeq ∧ apcf0(tid) = resDeq ∧ lsf0(tid).obsEmpty)); (s) ⊦ bwlabsf(ls) = mkls(ls.tid, ls.ival, ls.oval, ls.value, ls.optval); (s)

Proof step 239 from proof bwsim-step-nontau (previous step) (back to tree)

lsf(tid0) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), resDeq = pcf(tid0), DQGInv(gs), DQLInv(gs, mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), resDeq), bwabs(mkstate(gs, lsf(tid0; mkls(tid0, obsEmpty0, val1, optval1, val2, optval1)), pcf(tid0; ready)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ DurQstep (mkstate(mkdgs(gs.queue), alsf(tid0; mkls(tid0, val1, optval1, val2, optval2)), apcf(tid0; resDeq)), ARetDeq(tid0, optval1), mkstate(ags, alsf, apcf)) ∧ ( ags = mkdgs(gs.queue) → alsf(tid) = mkls ((tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val2, optval1);lsf(tid)).tid, (tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val2, optval1);lsf(tid)).ival, (tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val2, optval1);lsf(tid)).oval, (tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val2, optval1);lsf(tid)).value, (tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val2, optval1);lsf(tid)).optval) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ ready;pcf(tid))) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty → (tid0 = tid ⊃ mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval);alsf(tid)) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ (tid0 = tid ⊃ resDeq;apcf(tid)) = bwabspcf(pcf(tid)) ∨ (tid0 = tid ⊃ mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval);alsf(tid)) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ (tid0 ≠ tid → resDeq = apcf(tid)) ∧ lsf(tid).obsEmpty)

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 240 from proof bwsim-step-nontau (previous step) (back to tree)

gs = mkgs(queue), lsf(tid0) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), resDeq = pcf(tid0), DQGInv(gs), DQLInv(gs, mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), resDeq), bwabs(mkstate(gs, lsf(tid0; mkls(tid0, obsEmpty0, val1, optval1, val2, optval1)), pcf(tid0; ready)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ DurQstep (mkstate(mkdgs(queue), alsf(tid0; mkls(tid0, val1, optval1, val2, optval2)), apcf(tid0; resDeq)), ARetDeq(tid0, optval1), mkstate(ags, alsf, apcf)) ∧ ( ags = mkdgs(queue) → alsf(tid) = mkls ((tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val2, optval1);lsf(tid)).tid, (tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val2, optval1);lsf(tid)).ival, (tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val2, optval1);lsf(tid)).oval, (tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val2, optval1);lsf(tid)).value, (tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val2, optval1);lsf(tid)).optval) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ ready;pcf(tid))) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty → (tid0 = tid ⊃ mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval);alsf(tid)) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ (tid0 = tid ⊃ resDeq;apcf(tid)) = bwabspcf(pcf(tid)) ∨ (tid0 = tid ⊃ mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval);alsf(tid)) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ (tid0 ≠ tid → resDeq = apcf(tid)) ∧ lsf(tid).obsEmpty)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 241 from proof bwsim-step-nontau (previous step) (back to tree)

lsf(tid0) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), resDeq = pcf(tid0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), resDeq), bwabs(mkstate(mkgs(queue), lsf(tid0; mkls(tid0, obsEmpty0, val1, optval1, val2, optval1)), pcf(tid0; ready)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦ DurQstep (mkstate(mkdgs(queue), alsf(tid0; mkls(tid0, val1, optval1, val2, optval2)), apcf(tid0; resDeq)), ARetDeq(tid0, optval1), mkstate(ags, alsf, apcf)) ∧ ( ags = mkdgs(queue) → alsf(tid) = mkls ((tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val2, optval1);lsf(tid)).tid, (tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val2, optval1);lsf(tid)).ival, (tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val2, optval1);lsf(tid)).oval, (tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val2, optval1);lsf(tid)).value, (tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val2, optval1);lsf(tid)).optval) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ ready;pcf(tid))) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty → (tid0 = tid ⊃ mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval);alsf(tid)) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ (tid0 = tid ⊃ resDeq;apcf(tid)) = bwabspcf(pcf(tid)) ∨ (tid0 = tid ⊃ mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval);alsf(tid)) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ (tid0 ≠ tid → resDeq = apcf(tid)) ∧ lsf(tid).obsEmpty)

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, (tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val2, optval1) ;lsf(tid) ), optval, tid1, 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, (tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val2, optval1);lsf(tid)), oval, tid1, optval

Proof step 242 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val2, optval1);lsf(tid)) = mkls(tid1, obsEmpty, val, optval, val0, optval0), lsf(tid0) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), resDeq = pcf(tid0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), resDeq), bwabs(mkstate(mkgs(queue), lsf(tid0; mkls(tid0, obsEmpty0, val1, optval1, val2, optval1)), pcf(tid0; ready)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦ DurQstep (mkstate(mkdgs(queue), alsf(tid0; mkls(tid0, val1, optval1, val2, optval2)), apcf(tid0; resDeq)), ARetDeq(tid0, optval1), mkstate(ags, alsf, apcf)) ∧ ( ags = mkdgs(queue) → alsf(tid) = mkls(tid1, val, optval, val0, optval0) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ ready;pcf(tid))) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty → (tid0 = tid ⊃ mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval);alsf(tid)) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ (tid0 = tid ⊃ resDeq;apcf(tid)) = bwabspcf(pcf(tid)) ∨ (tid0 = tid ⊃ mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval);alsf(tid)) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ (tid0 ≠ tid → resDeq = apcf(tid)) ∧ lsf(tid).obsEmpty)

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] → [val4, val3, obsEmpty1, lsf(tid), optval3, tid2, optval4]

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, obsEmpty1, lsf(tid), oval, tid2, optval3

Proof step 243 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val2, optval1);lsf(tid)) = mkls(tid1, obsEmpty, val, optval, val0, optval0), lsf(tid0) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), lsf(tid) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), resDeq = pcf(tid0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), resDeq), bwabs(mkstate(mkgs(queue), lsf(tid0; mkls(tid0, obsEmpty0, val1, optval1, val2, optval1)), pcf(tid0; ready)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦ DurQstep (mkstate(mkdgs(queue), alsf(tid0; mkls(tid0, val1, optval1, val2, optval2)), apcf(tid0; resDeq)), ARetDeq(tid0, optval1), mkstate(ags, alsf, apcf)) ∧ ( ags = mkdgs(queue) → alsf(tid) = mkls(tid1, val, optval, val0, optval0) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ ready;pcf(tid))) ∨ alsf(tid) = mkls(tid2, val3, Empty, val4, optval4) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ obsEmpty1 → (tid0 = tid ⊃ mkls(tid2, val3, optval3, val4, optval4);alsf(tid)) = mkls(tid2, val3, optval3, val4, optval4) ∧ (tid0 = tid ⊃ resDeq;apcf(tid)) = bwabspcf(pcf(tid)) ∨ (tid0 = tid ⊃ mkls(tid2, val3, optval3, val4, optval4);alsf(tid)) = mkls(tid2, val3, Empty, val4, optval4) ∧ pcf(tid) = invDeq ∧ (tid0 ≠ tid → resDeq = apcf(tid)) ∧ obsEmpty1)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 244 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val2, optval1);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty, val, optval, val0, optval0), lsf(tid) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), lsf(tid0) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), resDeq = pcf(tid0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), resDeq), bwabs(mkstate(mkgs(queue), lsf(tid0; mkls(tid0, obsEmpty0, val1, optval1, val2, optval1)), pcf(tid0; ready)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦ DurQstep (mkstate(mkdgs(queue), alsf(tid0; mkls(tid0, val1, optval1, val2, optval2)), apcf(tid0; resDeq)), ARetDeq(tid0, optval1), mkstate(ags, alsf, apcf)) ∧ ( ags = mkdgs(queue) → alsf(tid) = mkls(tid1, val, optval, val0, optval0) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ ready;pcf(tid))) ∨ alsf(tid) = mkls(tid2, val3, Empty, val4, optval4) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ obsEmpty1 → (tid0 = tid ⊃ mkls(tid2, val3, optval3, val4, optval4);alsf(tid)) = mkls(tid2, val3, optval3, val4, optval4) ∧ (tid0 = tid ⊃ resDeq;apcf(tid)) = bwabspcf(pcf(tid)) ∨ (tid0 = tid ⊃ mkls(tid2, val3, optval3, val4, optval4);alsf(tid)) = mkls(tid2, val3, Empty, val4, optval4) ∧ pcf(tid) = invDeq ∧ (tid0 ≠ tid → resDeq = apcf(tid)) ∧ obsEmpty1)

User applied rule all left

And obtained the following new goals

Rule argument

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

Additional information

Used terms: tid

Proof step 245 from proof bwsim-step-nontau (previous step) (back to tree)

lsf(tid).tid = tid, (tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val2, optval1);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty, val, optval, val0, optval0), lsf(tid0) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), lsf(tid) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), resDeq = pcf(tid0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), resDeq), DQLInv(mkgs(queue), lsf(tid), pcf(tid)), bwabs(mkstate(mkgs(queue), lsf(tid0; mkls(tid0, obsEmpty0, val1, optval1, val2, optval1)), pcf(tid0; ready)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦ DurQstep (mkstate(mkdgs(queue), alsf(tid0; mkls(tid0, val1, optval1, val2, optval2)), apcf(tid0; resDeq)), ARetDeq(tid0, optval1), mkstate(ags, alsf, apcf)) ∧ ( ags = mkdgs(queue) → alsf(tid) = mkls(tid1, val, optval, val0, optval0) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ ready;pcf(tid))) ∨ alsf(tid) = mkls(tid2, val3, Empty, val4, optval4) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ obsEmpty1 → (tid0 = tid ⊃ mkls(tid2, val3, optval3, val4, optval4);alsf(tid)) = mkls(tid2, val3, optval3, val4, optval4) ∧ (tid0 = tid ⊃ resDeq;apcf(tid)) = bwabspcf(pcf(tid)) ∨ (tid0 = tid ⊃ mkls(tid2, val3, optval3, val4, optval4);alsf(tid)) = mkls(tid2, val3, Empty, val4, optval4) ∧ pcf(tid) = invDeq ∧ (tid0 ≠ tid → resDeq = apcf(tid)) ∧ obsEmpty1)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 246 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty0, val1, optval1, val2, optval1);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty, val, optval, val0, optval0), lsf(tid0) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), resDeq = pcf(tid0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), resDeq), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), bwabs(mkstate(mkgs(queue), lsf(tid0; mkls(tid0, obsEmpty0, val1, optval1, val2, optval1)), pcf(tid0; ready)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦ DurQstep (mkstate(mkdgs(queue), alsf(tid0; mkls(tid0, val1, optval1, val2, optval2)), apcf(tid0; resDeq)), ARetDeq(tid0, optval1), mkstate(ags, alsf, apcf)) ∧ ( ags = mkdgs(queue) → alsf(tid2) = mkls(tid1, val, optval, val0, optval0) ∧ apcf(tid2) = bwabspcf((tid0 = tid2 ⊃ ready;pcf(tid2))) ∨ alsf(tid2) = mkls(tid2, val3, Empty, val4, optval4) ∧ tid0 ≠ tid2 ∧ invDeq = pcf(tid2) ∧ apcf(tid2) = resDeq ∧ obsEmpty1 → (tid0 = tid2 ⊃ mkls(tid2, val3, optval3, val4, optval4);alsf(tid2)) = mkls(tid2, val3, optval3, val4, optval4) ∧ (tid0 = tid2 ⊃ resDeq;apcf(tid2)) = bwabspcf(pcf(tid2)) ∨ (tid0 = tid2 ⊃ mkls(tid2, val3, optval3, val4, optval4);alsf(tid2)) = mkls(tid2, val3, Empty, val4, optval4) ∧ pcf(tid2) = invDeq ∧ (tid0 ≠ tid2 → resDeq = apcf(tid2)) ∧ obsEmpty1)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 247 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty0, val1, optval1, val2, optval1);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty, val, optval, val0, optval0), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), lsf(tid0) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), resDeq = pcf(tid0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), resDeq), bwabs(mkstate(mkgs(queue), lsf(tid0; mkls(tid0, obsEmpty0, val1, optval1, val2, optval1)), pcf(tid0; ready)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ¬ DurQstep (mkstate(mkdgs(queue), alsf(tid0; mkls(tid0, val1, optval1, val2, optval2)), apcf(tid0; resDeq)), ARetDeq(tid0, optval1), mkstate(ags, alsf, apcf)), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(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), alsf(tid0; mkls(tid0, val1, optval1, val2, optval2)), ARetDeq(tid0, optval1), mkdgs(queue), apcf(tid0; resDeq)], <all paths>

Additional information

Used terms: mkstate(ags, alsf, apcf), alsf(tid0; mkls(tid0, val1, optval1, val2, optval2)), ARetDeq(tid0, optval1), mkdgs(queue), apcf(tid0; resDeq)

Proof step 248 from proof bwsim-step-nontau (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 249 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty0, val1, optval1, val2, optval1);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty, val, optval, val0, optval0), lsf(tid0) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), resDeq = pcf(tid0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), resDeq), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), bwabs(mkstate(mkgs(queue), lsf(tid0; mkls(tid0, obsEmpty0, val1, optval1, val2, optval1)), pcf(tid0; ready)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), (ARetDeq(tid0, optval1) = globalACrash ⊃ mkstate(ags, alsf, apcf) ≠ mkstate(mkdgs(queue), alsf(tid0; mkls(tid0, val1, optval1, val2, optval2)), λ tid. (apcf(tid0; resDeq)(tid) = idle ⊃ idle;crashed)) ;∀ tid. ¬ ( pre(mkdgs(queue), alsf(tid0; mkls(tid0, val1, optval1, val2, optval2))(tid), apcf(tid0; resDeq)(tid), ARetDeq(tid0, optval1)) ∧ mkstate(ags, alsf, apcf) = mkstate (gstepf(mkdgs(queue), alsf(tid0; mkls(tid0, val1, optval1, val2, optval2))(tid), apcf(tid0; resDeq)(tid), ARetDeq(tid0, optval1)), alsf(tid0; mkls(tid0, val1, optval1, val2, optval2)) (tid; lstepf(mkdgs(queue), alsf(tid0; mkls(tid0, val1, optval1, val2, optval2))(tid), apcf(tid0; resDeq)(tid), ARetDeq(tid0, optval1))), apcf(tid0; resDeq) (tid; pcstepf(mkdgs(queue), alsf(tid0; mkls(tid0, val1, optval1, val2, optval2))(tid), apcf(tid0; resDeq)(tid), ARetDeq(tid0, optval1))))) ), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ARetDeq(tid, optval) ≠ globalACrash; (s)

Proof step 250 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty0, val1, optval1, val2, optval1);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty, val, optval, val0, optval0), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), lsf(tid0) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), resDeq = pcf(tid0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), resDeq), bwabs(mkstate(mkgs(queue), lsf(tid0; mkls(tid0, obsEmpty0, val1, optval1, val2, optval1)), pcf(tid0; ready)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ∀ tid. ¬ pre(mkdgs(queue), (tid0 = tid ⊃ mkls(tid, val1, optval1, val2, optval2);alsf(tid)), (tid0 = tid ⊃ resDeq;apcf(tid)), ARetDeq(tid0, optval1)) ∨ mkstate(ags, alsf, apcf) ≠ mkstate (gstepf(mkdgs(queue), (tid0 = tid ⊃ mkls(tid, val1, optval1, val2, optval2);alsf(tid)), (tid0 = tid ⊃ resDeq;apcf(tid)), ARetDeq(tid0, optval1)), alsf(tid0; mkls(tid0, val1, optval1, val2, optval2)) (tid ; lstepf (mkdgs(queue), (tid0 = tid ⊃ mkls(tid, val1, optval1, val2, optval2);alsf(tid)), (tid0 = tid ⊃ resDeq;apcf(tid)), ARetDeq(tid0, optval1)) ), apcf(tid0; resDeq) (tid ; pcstepf (mkdgs(queue), (tid0 = tid ⊃ mkls(tid, val1, optval1, val2, optval2);alsf(tid)), (tid0 = tid ⊃ resDeq;apcf(tid)), ARetDeq(tid0, optval1)) )) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

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

Additional information

Used terms: tid0

Proof step 251 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty0, val1, optval1, val2, optval1);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty, val, optval, val0, optval0), lsf(tid0) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), resDeq = pcf(tid0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), resDeq), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), bwabs(mkstate(mkgs(queue), lsf(tid0; mkls(tid0, obsEmpty0, val1, optval1, val2, optval1)), pcf(tid0; ready)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ¬ pre(mkdgs(queue), (tid0 = tid0 ⊃ mkls(tid0, val1, optval1, val2, optval2);alsf(tid0)), (tid0 = tid0 ⊃ resDeq;apcf(tid0)), ARetDeq(tid0, optval1)) ∨ mkstate(ags, alsf, apcf) ≠ mkstate (gstepf (mkdgs(queue), (tid0 = tid0 ⊃ mkls(tid0, val1, optval1, val2, optval2);alsf(tid0)), (tid0 = tid0 ⊃ resDeq;apcf(tid0)), ARetDeq(tid0, optval1)), alsf(tid0; mkls(tid0, val1, optval1, val2, optval2)) (tid0 ; lstepf (mkdgs(queue), (tid0 = tid0 ⊃ mkls(tid0, val1, optval1, val2, optval2);alsf(tid0)), (tid0 = tid0 ⊃ resDeq;apcf(tid0)), ARetDeq(tid0, optval1)) ), apcf(tid0; resDeq) (tid0 ; pcstepf (mkdgs(queue), (tid0 = tid0 ⊃ mkls(tid0, val1, optval1, val2, optval2);alsf(tid0)), (tid0 = tid0 ⊃ resDeq;apcf(tid0)), ARetDeq(tid0, optval1)) )) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ pcstepf (gs, mkls(tid, ival, oval, value, optval), resDeq, ARetDeq(tid, oval)) = ready; (s) ⊦ lstepf(gs, mkls(tid, ival, oval, value, optval), resDeq, ARetDeq(tid, oval)) = mkls(tid, ival, oval, value, oval); (s) ⊦ gstepf(gs, mkls(tid, ival, oval, value, optval), resDeq, ARetDeq(tid, oval)) = gs; (s) ⊦ ARetDeq(tid, optval) = ARetDeq(tid0, optval0) ↔ tid = tid0 ∧ optval = optval0; (ws) ⊦ mkls(tid, ival, oval, ival0, oval0).oval = oval; (s) ⊦ mkls(tid, ival, oval, ival0, oval0).tid = tid; (s) ⊦ pre(gs, ls, resDeq, a) ↔ a = ARetDeq(ls.tid, ls.oval); (s)

Proof step 252 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty0, val1, optval1, val2, optval1);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty, val, optval, val0, optval0), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), lsf(tid0) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), resDeq = pcf(tid0), mkstate(ags, alsf, apcf) ≠ mkstate (mkdgs(queue), alsf(tid0; mkls(tid0, val1, optval1, val2, optval2))(tid0; mkls(tid0, val1, optval1, val2, optval1)), apcf(tid0; resDeq)(tid0; ready)), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), resDeq), bwabs(mkstate(mkgs(queue), lsf(tid0; mkls(tid0, obsEmpty0, val1, optval1, val2, optval1)), pcf(tid0; ready)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DurQ[DurQ-ren], name:inj-mkstate, seq:⊦ mkstate(gstate, lsf, pcf) = mkstate(gstate0, lsf0, pcf0) ↔ gstate = gstate0 ∧ lsf = lsf0 ∧ pcf = pcf0, subst:[gstate, pcf0, lsf0, lsf, gstate0, pcf] → [ags, apcf(tid0; resDeq)(tid0; ready), alsf(tid0; mkls(tid0, val1, optval1, val2, optval2)) (tid0; mkls(tid0, val1, optval1, val2, optval1)), alsf, mkdgs(queue), apcf], <all paths>

Additional information

Used terms: ags, apcf(tid0; resDeq)(tid0; ready), alsf(tid0; mkls(tid0, val1, optval1, val2, optval2)) (tid0; mkls(tid0, val1, optval1, val2, optval1)), alsf, mkdgs(queue), apcf

Proof step 253 from proof bwsim-step-nontau (previous step) (back to tree)

⊦ mkstate(gstate, lsf, pcf) = mkstate(gstate0, lsf0, pcf0) ↔ gstate = gstate0 ∧ lsf = lsf0 ∧ pcf = pcf0

A spec-lemma

Proof step 254 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty0, val1, optval1, val2, optval1);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty, val, optval, val0, optval0), lsf(tid0) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), resDeq = pcf(tid0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), resDeq), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), bwabs(mkstate(mkgs(queue), lsf(tid0; mkls(tid0, obsEmpty0, val1, optval1, val2, optval1)), pcf(tid0; ready)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ags ≠ mkdgs(queue) ∨ alsf ≠ alsf(tid0; mkls(tid0, val1, optval1, val2, optval2))(tid0; mkls(tid0, val1, optval1, val2, optval1)) ∨ apcf ≠ apcf(tid0; resDeq)(tid0; ready) ⊦

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), alsf, lsf(tid0; mkls(tid0, obsEmpty0, val1, optval1, val2, optval1)), ags, pcf(tid0; ready), apcf], <all paths>

Additional information

Used terms: mkgs(queue), alsf, lsf(tid0; mkls(tid0, obsEmpty0, val1, optval1, val2, optval1)), ags, pcf(tid0; ready), apcf

Proof step 255 from proof bwsim-step-nontau (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 256 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty0, val1, optval1, val2, optval1);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty, val, optval, val0, optval0), ags = mkdgs(mkgs(queue).queue), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), lsf(tid0) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), resDeq = pcf(tid0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), resDeq), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ∀ tid. alsf(tid) = mkls (lsf(tid0; mkls(tid0, obsEmpty0, val1, optval1, val2, optval1))(tid).tid, lsf(tid0; mkls(tid0, obsEmpty0, val1, optval1, val2, optval1))(tid).ival, lsf(tid0; mkls(tid0, obsEmpty0, val1, optval1, val2, optval1))(tid).oval, lsf(tid0; mkls(tid0, obsEmpty0, val1, optval1, val2, optval1))(tid).value, lsf(tid0; mkls(tid0, obsEmpty0, val1, optval1, val2, optval1))(tid).optval) ∧ apcf(tid) = bwabspcf(pcf(tid0; ready)(tid)) ∨ alsf(tid) = mkls (lsf(tid0; mkls(tid0, obsEmpty0, val1, optval1, val2, optval1))(tid).tid, lsf(tid0; mkls(tid0, obsEmpty0, val1, optval1, val2, optval1))(tid).ival, Empty, lsf(tid0; mkls(tid0, obsEmpty0, val1, optval1, val2, optval1))(tid).value, lsf(tid0; mkls(tid0, obsEmpty0, val1, optval1, val2, optval1))(tid).optval) ∧ pcf(tid0; ready)(tid) = invDeq ∧ apcf(tid) = resDeq ∧ lsf(tid0; mkls(tid0, obsEmpty0, val1, optval1, val2, optval1))(tid).obsEmpty, ags ≠ mkdgs(queue) ∨ alsf ≠ alsf(tid0; mkls(tid0, val1, optval1, val2, optval2))(tid0; mkls(tid0, val1, optval1, val2, optval1)) ∨ apcf ≠ apcf(tid0; resDeq)(tid0; ready) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ invDeq ≠ ready; (s) ⊦ mkdgs(queue) = mkdgs(queue0) ↔ queue = queue0; (s) ⊦ mkgs(queue).queue = queue; (s)

Proof step 257 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty0, val1, optval1, val2, optval1);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty, val, optval, val0, optval0), lsf(tid0) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), resDeq = pcf(tid0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), resDeq), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ∀ tid. alsf(tid) = mkls ((tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val2, optval1);lsf(tid)).tid, (tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val2, optval1);lsf(tid)).ival, (tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val2, optval1);lsf(tid)).oval, (tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val2, optval1);lsf(tid)).value, (tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val2, optval1);lsf(tid)).optval) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ ready;pcf(tid))) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty, alsf ≠ alsf(tid0; mkls(tid0, val1, optval1, val2, optval2))(tid0; mkls(tid0, val1, optval1, val2, optval1)) ∨ apcf ≠ apcf(tid0; resDeq)(tid0; ready) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

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

Additional information

Used terms: tid0

Proof step 258 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty0, val1, optval1, val2, optval1);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty, val, optval, val0, optval0), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), lsf(tid0) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), resDeq = pcf(tid0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), resDeq), fininvdeq(pcf), ∀ tid. alsf(tid) = mkls ((tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val2, optval1);lsf(tid)).tid, (tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val2, optval1);lsf(tid)).ival, (tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val2, optval1);lsf(tid)).oval, (tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val2, optval1);lsf(tid)).value, (tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val2, optval1);lsf(tid)).optval) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ ready;pcf(tid))) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), alsf ≠ alsf(tid0; mkls(tid0, val1, optval1, val2, optval2))(tid0; mkls(tid0, val1, optval1, val2, optval1)) ∨ apcf ≠ apcf(tid0; resDeq)(tid0; ready), alsf(tid0) = mkls ((tid0 = tid0 ⊃ mkls(tid0, obsEmpty0, val1, optval1, val2, optval1);lsf(tid0)).tid, (tid0 = tid0 ⊃ mkls(tid0, obsEmpty0, val1, optval1, val2, optval1);lsf(tid0)).ival, (tid0 = tid0 ⊃ mkls(tid0, obsEmpty0, val1, optval1, val2, optval1);lsf(tid0)).oval, (tid0 = tid0 ⊃ mkls(tid0, obsEmpty0, val1, optval1, val2, optval1);lsf(tid0)).value, (tid0 = tid0 ⊃ mkls(tid0, obsEmpty0, val1, optval1, val2, optval1);lsf(tid0)).optval) ∧ apcf(tid0) = bwabspcf((tid0 = tid0 ⊃ ready;pcf(tid0))) ∨ alsf(tid0) = mkls(lsf(tid0).tid, lsf(tid0).ival, Empty, lsf(tid0).value, lsf(tid0).optval) ∧ tid0 ≠ tid0 ∧ invDeq = pcf(tid0) ∧ apcf(tid0) = resDeq ∧ lsf(tid0).obsEmpty ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ bwabspcf(ready) = ready; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).optval = oval0; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).value = ival0; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).oval = oval; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).ival = ival; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).tid = tid; (s)

Proof step 259 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty0, val1, optval1, val2, optval1);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty, val, optval, val0, optval0), alsf(tid0) = mkls(tid0, val1, optval1, val2, optval1), apcf(tid0) = ready, lsf(tid0) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), resDeq = pcf(tid0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), resDeq), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ∀ tid. alsf(tid) = mkls ((tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val2, optval1);lsf(tid)).tid, (tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val2, optval1);lsf(tid)).ival, (tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val2, optval1);lsf(tid)).oval, (tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val2, optval1);lsf(tid)).value, (tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val2, optval1);lsf(tid)).optval) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ ready;pcf(tid))) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty, alsf ≠ alsf(tid0; mkls(tid0, val1, optval1, val2, optval2))(tid0; mkls(tid0, val1, optval1, val2, optval1)) ∨ apcf ≠ apcf(tid0; resDeq)(tid0; ready) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 13

Additional information

Proof step 260 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty0, val1, optval1, val2, optval1);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty, val, optval, val0, optval0), alsf(tid0) = mkls(tid0, val1, optval1, val2, optval1), apcf(tid0) = ready, lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), lsf(tid0) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), resDeq = pcf(tid0), alsf ≠ alsf(tid0; mkls(tid0, val1, optval1, val2, optval2))(tid0; mkls(tid0, val1, optval1, val2, optval1)), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), resDeq), fininvdeq(pcf), ∀ tid. alsf(tid) = mkls ((tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val2, optval1);lsf(tid)).tid, (tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val2, optval1);lsf(tid)).ival, (tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val2, optval1);lsf(tid)).oval, (tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val2, optval1);lsf(tid)).value, (tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val2, optval1);lsf(tid)).optval) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ ready;pcf(tid))) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦

User applied rule expand left

And obtained the following new goals

Rule argument

pos: left 7

Additional information

Proof step 261 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty0, val1, optval1, val2, optval1);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty, val, optval, val0, optval0), alsf(tid0) = mkls(tid0, val1, optval1, val2, optval1), apcf(tid0) = ready, lsf(tid0) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), resDeq = pcf(tid0), alsf(tid) ≠ alsf(tid0; mkls(tid0, val1, optval1, val2, optval2))(tid0; mkls(tid0, val1, optval1, val2, optval1))(tid), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), resDeq), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ∀ tid. alsf(tid) = mkls ((tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val2, optval1);lsf(tid)).tid, (tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val2, optval1);lsf(tid)).ival, (tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val2, optval1);lsf(tid)).oval, (tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val2, optval1);lsf(tid)).value, (tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val2, optval1);lsf(tid)).optval) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ ready;pcf(tid))) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 262 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty0, val1, optval1, val2, optval1);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty, val, optval, val0, optval0), alsf(tid0) = mkls(tid0, val1, optval1, val2, optval1), apcf(tid0) = ready, lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), lsf(tid0) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), resDeq = pcf(tid0), alsf(tid) ≠ (tid0 = tid ⊃ mkls(tid, val1, optval1, val2, optval1);alsf(tid)), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), resDeq), fininvdeq(pcf), ∀ tid. alsf(tid) = mkls ((tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val2, optval1);lsf(tid)).tid, (tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val2, optval1);lsf(tid)).ival, (tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val2, optval1);lsf(tid)).oval, (tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val2, optval1);lsf(tid)).value, (tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val2, optval1);lsf(tid)).optval) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ ready;pcf(tid))) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦

User applied rule case distinction

And closed the goal!

Rule argument

pos: left 7

Additional information

Proof step 263 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty0, val1, optval1, val2, optval1);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty, val, optval, val0, optval0), alsf(tid0) = mkls(tid0, val1, optval1, val2, optval1), apcf(tid0) = ready, lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), lsf(tid0) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), resDeq = pcf(tid0), apcf ≠ apcf(tid0; resDeq)(tid0; ready), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), resDeq), fininvdeq(pcf), ∀ tid. alsf(tid) = mkls ((tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val2, optval1);lsf(tid)).tid, (tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val2, optval1);lsf(tid)).ival, (tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val2, optval1);lsf(tid)).oval, (tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val2, optval1);lsf(tid)).value, (tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val2, optval1);lsf(tid)).optval) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ ready;pcf(tid))) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦

User applied rule expand left

And obtained the following new goals

Rule argument

pos: left 7

Additional information

Proof step 264 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty0, val1, optval1, val2, optval1);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty, val, optval, val0, optval0), alsf(tid0) = mkls(tid0, val1, optval1, val2, optval1), apcf(tid0) = ready, lsf(tid0) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), resDeq = pcf(tid0), apcf(tid) ≠ apcf(tid0; resDeq)(tid0; ready)(tid), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), resDeq), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ∀ tid. alsf(tid) = mkls ((tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val2, optval1);lsf(tid)).tid, (tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val2, optval1);lsf(tid)).ival, (tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val2, optval1);lsf(tid)).oval, (tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val2, optval1);lsf(tid)).value, (tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val2, optval1);lsf(tid)).optval) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ ready;pcf(tid))) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 265 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty0, val1, optval1, val2, optval1);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty, val, optval, val0, optval0), alsf(tid0) = mkls(tid0, val1, optval1, val2, optval1), apcf(tid0) = ready, lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), lsf(tid0) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), resDeq = pcf(tid0), apcf(tid) ≠ (tid0 = tid ⊃ ready;apcf(tid)), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), resDeq), fininvdeq(pcf), ∀ tid. alsf(tid) = mkls ((tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val2, optval1);lsf(tid)).tid, (tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val2, optval1);lsf(tid)).ival, (tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val2, optval1);lsf(tid)).oval, (tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val2, optval1);lsf(tid)).value, (tid0 = tid ⊃ mkls(tid, obsEmpty0, val1, optval1, val2, optval1);lsf(tid)).optval) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ ready;pcf(tid))) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦

User applied rule case distinction

And closed the goal!

Rule argument

pos: left 7

Additional information

Proof step 266 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty0, val1, optval1, val2, optval1);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty, val, optval, val0, optval0), ags = mkdgs(queue), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), lsf(tid0) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), resDeq = pcf(tid0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), resDeq), bwabs(mkstate(mkgs(queue), lsf(tid0; mkls(tid0, obsEmpty0, val1, optval1, val2, optval1)), pcf(tid0; ready)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), alsf(tid2) = mkls(tid1, val, optval, val0, optval0) ∧ apcf(tid2) = bwabspcf((tid0 = tid2 ⊃ ready;pcf(tid2))) ∨ alsf(tid2) = mkls(tid2, val3, Empty, val4, optval4) ∧ tid0 ≠ tid2 ∧ invDeq = pcf(tid2) ∧ apcf(tid2) = resDeq ∧ obsEmpty1 ⊦ (tid0 = tid2 ⊃ mkls(tid2, val3, optval3, val4, optval4);alsf(tid2)) = mkls(tid2, val3, optval3, val4, optval4) ∧ (tid0 = tid2 ⊃ resDeq;apcf(tid2)) = bwabspcf(pcf(tid2)), (tid0 = tid2 ⊃ mkls(tid2, val3, optval3, val4, optval4);alsf(tid2)) = mkls(tid2, val3, Empty, val4, optval4) ∧ pcf(tid2) = invDeq ∧ (tid0 ≠ tid2 → resDeq = apcf(tid2)) ∧ obsEmpty1

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 267 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty0, val1, optval1, val2, optval1);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty, val, optval, val0, optval0), lsf(tid0) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), resDeq = pcf(tid0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), resDeq), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), bwabs(mkstate(mkgs(queue), lsf(tid0; mkls(tid0, obsEmpty0, val1, optval1, val2, optval1)), pcf(tid0; ready)), mkstate(mkdgs(queue), alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), alsf(tid2) = mkls(tid1, val, optval, val0, optval0) ∧ apcf(tid2) = bwabspcf((tid0 = tid2 ⊃ ready;pcf(tid2))) ∨ alsf(tid2) = mkls(tid2, val3, Empty, val4, optval4) ∧ tid0 ≠ tid2 ∧ invDeq = pcf(tid2) ∧ apcf(tid2) = resDeq ∧ obsEmpty1 ⊦ (tid0 = tid2 ⊃ mkls(tid2, val3, optval3, val4, optval4);alsf(tid2)) = mkls(tid2, val3, Empty, val4, optval4) ∧ pcf(tid2) = invDeq ∧ (tid0 ≠ tid2 → resDeq = apcf(tid2)) ∧ obsEmpty1, (tid0 = tid2 ⊃ mkls(tid2, val3, optval3, val4, optval4);alsf(tid2)) = mkls(tid2, val3, optval3, val4, optval4) ∧ (tid0 = tid2 ⊃ resDeq;apcf(tid2)) = bwabspcf(pcf(tid2))

User applied rule case distinction

And closed the goal!

Rule argument

pos: left 1

Additional information

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

Proof step 268 from proof bwsim-step-nontau (previous step) (back to tree)

ca = RetEnq(tid0), lsf(ca.tid) = mkls(ca.tid, obsEmpty, val, optval, val0, optval0), ca ≠ globalCrash, DQGInv(gs), DQLInv(gs, mkls(ca.tid, obsEmpty, val, optval, val0, optval0), pcf(ca.tid)), bwabs (mkstate(gstepf(gs, lsf(tid), pcf(tid), ca), lsf(tid; lstepf(gs, lsf(tid), pcf(tid), ca)), pcf(tid; pcstepf(gs, lsf(tid), pcf(tid), ca))), mkstate(ags, alsf, apcf)), fininvdeq(pcf), pre(gs, lsf(tid), pcf(tid), ca), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ (∃ tid. ca = CheckEmp(tid) ⊃ (apcf(ca.tid) = resDeq ⊃ ADoDeq(ca.tid);τ);bwabsa(ca)) = τ, ∃ durqs. DurQstep(durqs, (∃ tid. ca = CheckEmp(tid) ⊃ (apcf(ca.tid) = resDeq ⊃ ADoDeq(ca.tid);τ);bwabsa(ca)), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ARetEnq(tid) ≠ τ; (s) ⊦ bwabsa(RetEnq(tid)) = ARetEnq(tid); (s) ⊦ CheckEmp(tid) ≠ RetEnq(tid0); (s) ⊦ RetEnq(tid).tid = tid; (s) ⊦ RetEnq(tid) ≠ globalCrash; (s)

Proof step 269 from proof bwsim-step-nontau (previous step) (back to tree)

lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), DQGInv(gs), DQLInv(gs, mkls(tid0, obsEmpty, val, optval, val0, optval0), pcf(tid0)), bwabs (mkstate (gstepf(gs, lsf(tid), pcf(tid), RetEnq(tid0)), lsf(tid; lstepf(gs, lsf(tid), pcf(tid), RetEnq(tid0))), pcf(tid; pcstepf(gs, lsf(tid), pcf(tid), RetEnq(tid0)))), mkstate(ags, alsf, apcf)), fininvdeq(pcf), pre(gs, lsf(tid), pcf(tid), RetEnq(tid0)), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ ∃ durqs. DurQstep(durqs, ARetEnq(tid0), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

User applied rule structural induction

And obtained the following new goals

Rule argument

term: pcf(tid)

Additional information

Used simplifier rules: DQPC freely generated by crashed, idle, invDeq, invEnq, ready, resDeq, resEnq;; ⊦ pre(gs, ls, resDeq, a) ↔ a = RetDeq(ls.tid, ls.oval); (s) ⊦ RetDeq(tid, optval) ≠ RetEnq(tid0); (s) ⊦ gstepf(gs, ls, ready, a) = gs; (s) ⊦ pre(gs, ls, ready, a) ↔ (∃ value. a = InvEnq(ls.tid, value)) ∨ a = InvDeq(ls.tid); (s) ⊦ InvEnq(tid, val) ≠ RetEnq(tid0); (s) ⊦ InvDeq(tid) ≠ RetEnq(tid0); (s) ⊦ pre(gs, ls, invEnq, a) ↔ a = DoEnq(ls.tid); (s) ⊦ DoEnq(tid) ≠ RetEnq(tid0); (s) ⊦ pre(gs, ls, invDeq, a) ↔ a = CheckEmp(ls.tid) ∧ gs.queue = [] ∨ a = DoDeqEmpty(ls.tid) ∧ ls.obsEmpty ∨ a = DoDeq(ls.tid) ∧ gs.queue ≠ []; (s) ⊦ CheckEmp(tid) ≠ RetEnq(tid0); (s) ⊦ DoDeqEmpty(tid) ≠ RetEnq(tid0); (s) ⊦ DoDeq(tid) ≠ RetEnq(tid0); (s) ⊦ pre(gs, ls, idle, a) ↔ a = callRun(ls.tid); (s) ⊦ RetEnq(tid) ≠ callRun(tid0); (s) ⊦ pre(gs, ls, crashed, a) ↔ false; (s)

Proof step 270 from proof bwsim-step-nontau (previous step) (back to tree)

lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), resEnq = pcf(tid), DQGInv(gs), DQLInv(gs, mkls(tid0, obsEmpty, val, optval, val0, optval0), pcf(tid0)), bwabs (mkstate (gstepf(gs, lsf(tid), pcf(tid), RetEnq(tid0)), lsf(tid; lstepf(gs, lsf(tid), pcf(tid), RetEnq(tid0))), pcf(tid; pcstepf(gs, lsf(tid), pcf(tid), RetEnq(tid0)))), mkstate(ags, alsf, apcf)), fininvdeq(pcf), pre(gs, lsf(tid), pcf(tid), RetEnq(tid0)), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ ∃ durqs. DurQstep(durqs, ARetEnq(tid0), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ pcstepf(gs, ls, resEnq, RetEnq(ls.tid)) = ready; (s) ⊦ lstepf(gs, ls, resEnq, RetEnq(ls.tid)) = ls; (s) ⊦ gstepf(gs, ls, resEnq, RetEnq(ls.tid)) = gs; (s) ⊦ RetEnq(tid) = RetEnq(tid0) ↔ tid = tid0; (s) ⊦ pre(gs, ls, resEnq, a) ↔ a = RetEnq(ls.tid); (s)

Proof step 271 from proof bwsim-step-nontau (previous step) (back to tree)

lsf(lsf(tid).tid) = mkls(lsf(tid).tid, obsEmpty, val, optval, val0, optval0), resEnq = pcf(tid), DQGInv(gs), DQLInv(gs, mkls(lsf(tid).tid, obsEmpty, val, optval, val0, optval0), pcf(lsf(tid).tid)), bwabs(mkstate(gs, lsf(tid; lsf(tid)), pcf(tid; ready)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ ∃ durqs. DurQstep(durqs, ARetEnq(lsf(tid).tid), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

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, obsEmpty0, lsf(tid), optval1, tid0, 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, obsEmpty0, lsf(tid), oval, tid0, optval1

Proof step 272 from proof bwsim-step-nontau (previous step) (back to tree)

lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), resEnq = pcf(tid), DQGInv(gs), DQLInv(gs, mkls(tid0, obsEmpty, val, optval, val0, optval0), pcf(tid0)), bwabs(mkstate(gs, lsf(tid; lsf(tid)), pcf(tid; ready)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ ∃ durqs. DurQstep(durqs, ARetEnq(tid0), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 273 from proof bwsim-step-nontau (previous step) (back to tree)

lsf(tid) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), resEnq = pcf(tid), DQGInv(gs), DQLInv(gs, mkls(tid0, obsEmpty, val, optval, val0, optval0), pcf(tid0)), bwabs(mkstate(gs, lsf(tid; mkls(tid0, obsEmpty0, val1, optval1, val2, optval2)), pcf(tid; ready)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ ∃ durqs. DurQstep(durqs, ARetEnq(tid0), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 8 terms: tid abort: F discard: F computed: F

Additional information

Used terms: tid

Proof step 274 from proof bwsim-step-nontau (previous step) (back to tree)

lsf(tid).tid = tid, lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), resEnq = pcf(tid), DQGInv(gs), DQLInv(gs, mkls(tid0, obsEmpty, val, optval, val0, optval0), pcf(tid0)), DQLInv(gs, lsf(tid), pcf(tid)), bwabs(mkstate(gs, lsf(tid; mkls(tid0, obsEmpty0, val1, optval1, val2, optval2)), pcf(tid; ready)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ ∃ durqs. DurQstep(durqs, ARetEnq(tid0), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 275 from proof bwsim-step-nontau (previous step) (back to tree)

lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), resEnq = pcf(tid0), DQGInv(gs), DQLInv(gs, mkls(tid0, obsEmpty, val, optval, val0, optval0), resEnq), bwabs(mkstate(gs, lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0)), pcf(tid0; ready)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ ∃ durqs. DurQstep(durqs, ARetEnq(tid0), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

User applied rule exists right

And obtained the following new goals

Rule argument

pos: right 1 terms: mkstate (mkdgs(gs.queue), alsf(tid0; bwlabsf(lsf(tid0))), apcf(tid0; resEnq)) abort: F discard: T computed: F

Additional information

Used terms: mkstate(mkdgs(gs.queue), alsf(tid0; bwlabsf(lsf(tid0))), apcf(tid0; resEnq))

Proof step 276 from proof bwsim-step-nontau (previous step) (back to tree)

lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), resEnq = pcf(tid0), DQGInv(gs), DQLInv(gs, mkls(tid0, obsEmpty, val, optval, val0, optval0), resEnq), bwabs(mkstate(gs, lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0)), pcf(tid0; ready)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ DurQstep(mkstate(mkdgs(gs.queue), alsf(tid0; bwlabsf(lsf(tid0))), apcf(tid0; resEnq)), ARetEnq(tid0), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(gs, lsf, pcf), mkstate(mkdgs(gs.queue), alsf(tid0; bwlabsf(lsf(tid0))), apcf(tid0; resEnq)))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).optval = oval0; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).value = ival0; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).oval = oval; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).ival = ival; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).tid = tid; (s) ⊦ resDeq ≠ resEnq; (s) ⊦ invDeq ≠ ready; (s) ⊦ bwabs(mkstate(gs, lsf, pcf), mkstate(ags, alsf, apcf)) → ( bwabs(mkstate(gs0, lsf0, pcf0), mkstate(ags0, alsf0, apcf0)) ↔ ags = mkdgs(gs.queue) → ags0 = mkdgs(gs0.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 → alsf0(tid) = mkls (lsf0(tid).tid, lsf0(tid).ival, lsf0(tid).oval, lsf0(tid).value, lsf0(tid).optval) ∧ apcf0(tid) = bwabspcf(pcf0(tid)) ∨ alsf0(tid) = mkls (lsf0(tid).tid, lsf0(tid).ival, Empty, lsf0(tid).value, lsf0(tid).optval) ∧ pcf0(tid) = invDeq ∧ apcf0(tid) = resDeq ∧ lsf0(tid).obsEmpty)); (s) ⊦ bwlabsf(ls) = mkls(ls.tid, ls.ival, ls.oval, ls.value, ls.optval); (s)

Proof step 277 from proof bwsim-step-nontau (previous step) (back to tree)

lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), resEnq = pcf(tid0), DQGInv(gs), DQLInv(gs, mkls(tid0, obsEmpty, val, optval, val0, optval0), resEnq), bwabs(mkstate(gs, lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0)), pcf(tid0; ready)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ DurQstep (mkstate(mkdgs(gs.queue), alsf(tid0; mkls(tid0, val, optval, val0, optval0)), apcf(tid0; resEnq)), ARetEnq(tid0), mkstate(ags, alsf, apcf)) ∧ ( ags = mkdgs(gs.queue) → alsf(tid) = mkls ((tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).tid, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).ival, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).oval, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).value, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).optval) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ ready;pcf(tid))) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty → (tid0 = tid ⊃ mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval);alsf(tid)) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ (tid0 = tid ⊃ resEnq;apcf(tid)) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ tid0 ≠ tid ∧ resDeq = apcf(tid) ∧ lsf(tid).obsEmpty)

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 278 from proof bwsim-step-nontau (previous step) (back to tree)

gs = mkgs(queue), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), resEnq = pcf(tid0), DQGInv(gs), DQLInv(gs, mkls(tid0, obsEmpty, val, optval, val0, optval0), resEnq), bwabs(mkstate(gs, lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0)), pcf(tid0; ready)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ DurQstep(mkstate(mkdgs(queue), alsf(tid0; mkls(tid0, val, optval, val0, optval0)), apcf(tid0; resEnq)), ARetEnq(tid0), mkstate(ags, alsf, apcf)) ∧ ( ags = mkdgs(queue) → alsf(tid) = mkls ((tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).tid, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).ival, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).oval, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).value, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).optval) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ ready;pcf(tid))) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty → (tid0 = tid ⊃ mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval);alsf(tid)) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ (tid0 = tid ⊃ resEnq;apcf(tid)) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ tid0 ≠ tid ∧ resDeq = apcf(tid) ∧ lsf(tid).obsEmpty)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 279 from proof bwsim-step-nontau (previous step) (back to tree)

lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), resEnq = pcf(tid0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), resEnq), bwabs(mkstate(mkgs(queue), lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0)), pcf(tid0; ready)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦ DurQstep(mkstate(mkdgs(queue), alsf(tid0; mkls(tid0, val, optval, val0, optval0)), apcf(tid0; resEnq)), ARetEnq(tid0), mkstate(ags, alsf, apcf)) ∧ ( ags = mkdgs(queue) → alsf(tid) = mkls ((tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).tid, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).ival, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).oval, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).value, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).optval) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ ready;pcf(tid))) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty → (tid0 = tid ⊃ mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval);alsf(tid)) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ (tid0 = tid ⊃ resEnq;apcf(tid)) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ tid0 ≠ tid ∧ resDeq = apcf(tid) ∧ lsf(tid).obsEmpty)

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, obsEmpty0, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);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, obsEmpty0, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)), oval, tid1, optval1

Proof step 280 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), resEnq = pcf(tid0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), resEnq), bwabs(mkstate(mkgs(queue), lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0)), pcf(tid0; ready)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦ DurQstep(mkstate(mkdgs(queue), alsf(tid0; mkls(tid0, val, optval, val0, optval0)), apcf(tid0; resEnq)), ARetEnq(tid0), mkstate(ags, alsf, apcf)) ∧ ( ags = mkdgs(queue) → alsf(tid) = mkls(tid1, val1, optval1, val2, optval2) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ ready;pcf(tid))) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty → (tid0 = tid ⊃ mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval);alsf(tid)) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ (tid0 = tid ⊃ resEnq;apcf(tid)) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ tid0 ≠ tid ∧ resDeq = apcf(tid) ∧ lsf(tid).obsEmpty)

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] → [val4, val3, obsEmpty1, lsf(tid), optval3, tid2, optval4]

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, obsEmpty1, lsf(tid), oval, tid2, optval3

Proof step 281 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), resEnq = pcf(tid0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), resEnq), bwabs(mkstate(mkgs(queue), lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0)), pcf(tid0; ready)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦ DurQstep(mkstate(mkdgs(queue), alsf(tid0; mkls(tid0, val, optval, val0, optval0)), apcf(tid0; resEnq)), ARetEnq(tid0), mkstate(ags, alsf, apcf)) ∧ ( ags = mkdgs(queue) → alsf(tid) = mkls(tid1, val1, optval1, val2, optval2) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ ready;pcf(tid))) ∨ alsf(tid) = mkls(tid2, val3, Empty, val4, optval4) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ obsEmpty1 → (tid0 = tid ⊃ mkls(tid2, val3, optval3, val4, optval4);alsf(tid)) = mkls(tid2, val3, optval3, val4, optval4) ∧ (tid0 = tid ⊃ resEnq;apcf(tid)) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(tid2, val3, Empty, val4, optval4) ∧ pcf(tid) = invDeq ∧ tid0 ≠ tid ∧ resDeq = apcf(tid) ∧ obsEmpty1)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 282 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), lsf(tid) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), resEnq = pcf(tid0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), resEnq), bwabs(mkstate(mkgs(queue), lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0)), pcf(tid0; ready)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦ DurQstep(mkstate(mkdgs(queue), alsf(tid0; mkls(tid0, val, optval, val0, optval0)), apcf(tid0; resEnq)), ARetEnq(tid0), mkstate(ags, alsf, apcf)) ∧ ( ags = mkdgs(queue) → alsf(tid) = mkls(tid1, val1, optval1, val2, optval2) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ ready;pcf(tid))) ∨ alsf(tid) = mkls(tid2, val3, Empty, val4, optval4) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ obsEmpty1 → (tid0 = tid ⊃ mkls(tid2, val3, optval3, val4, optval4);alsf(tid)) = mkls(tid2, val3, optval3, val4, optval4) ∧ (tid0 = tid ⊃ resEnq;apcf(tid)) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(tid2, val3, Empty, val4, optval4) ∧ pcf(tid) = invDeq ∧ tid0 ≠ tid ∧ resDeq = apcf(tid) ∧ obsEmpty1)

User applied rule all left

And obtained the following new goals

Rule argument

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

Additional information

Used terms: tid

Proof step 283 from proof bwsim-step-nontau (previous step) (back to tree)

lsf(tid).tid = tid, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), resEnq = pcf(tid0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), resEnq), DQLInv(mkgs(queue), lsf(tid), pcf(tid)), bwabs(mkstate(mkgs(queue), lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0)), pcf(tid0; ready)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦ DurQstep(mkstate(mkdgs(queue), alsf(tid0; mkls(tid0, val, optval, val0, optval0)), apcf(tid0; resEnq)), ARetEnq(tid0), mkstate(ags, alsf, apcf)) ∧ ( ags = mkdgs(queue) → alsf(tid) = mkls(tid1, val1, optval1, val2, optval2) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ ready;pcf(tid))) ∨ alsf(tid) = mkls(tid2, val3, Empty, val4, optval4) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ obsEmpty1 → (tid0 = tid ⊃ mkls(tid2, val3, optval3, val4, optval4);alsf(tid)) = mkls(tid2, val3, optval3, val4, optval4) ∧ (tid0 = tid ⊃ resEnq;apcf(tid)) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(tid2, val3, Empty, val4, optval4) ∧ pcf(tid) = invDeq ∧ tid0 ≠ tid ∧ resDeq = apcf(tid) ∧ obsEmpty1)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 284 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), resEnq = pcf(tid0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), resEnq), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), bwabs(mkstate(mkgs(queue), lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0)), pcf(tid0; ready)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦ DurQstep(mkstate(mkdgs(queue), alsf(tid0; mkls(tid0, val, optval, val0, optval0)), apcf(tid0; resEnq)), ARetEnq(tid0), mkstate(ags, alsf, apcf)) ∧ ( ags = mkdgs(queue) → alsf(tid2) = mkls(tid1, val1, optval1, val2, optval2) ∧ apcf(tid2) = bwabspcf((tid0 = tid2 ⊃ ready;pcf(tid2))) ∨ alsf(tid2) = mkls(tid2, val3, Empty, val4, optval4) ∧ tid0 ≠ tid2 ∧ invDeq = pcf(tid2) ∧ apcf(tid2) = resDeq ∧ obsEmpty1 → (tid0 = tid2 ⊃ mkls(tid2, val3, optval3, val4, optval4);alsf(tid2)) = mkls(tid2, val3, optval3, val4, optval4) ∧ (tid0 = tid2 ⊃ resEnq;apcf(tid2)) = bwabspcf(pcf(tid2)) ∨ alsf(tid2) = mkls(tid2, val3, Empty, val4, optval4) ∧ pcf(tid2) = invDeq ∧ tid0 ≠ tid2 ∧ resDeq = apcf(tid2) ∧ obsEmpty1)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 285 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), resEnq = pcf(tid0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), resEnq), bwabs(mkstate(mkgs(queue), lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0)), pcf(tid0; ready)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ¬ DurQstep(mkstate(mkdgs(queue), alsf(tid0; mkls(tid0, val, optval, val0, optval0)), apcf(tid0; resEnq)), ARetEnq(tid0), mkstate(ags, alsf, apcf)), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(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), alsf(tid0; mkls(tid0, val, optval, val0, optval0)), ARetEnq(tid0), mkdgs(queue), apcf(tid0; resEnq)], <all paths>

Additional information

Used terms: mkstate(ags, alsf, apcf), alsf(tid0; mkls(tid0, val, optval, val0, optval0)), ARetEnq(tid0), mkdgs(queue), apcf(tid0; resEnq)

Proof step 286 from proof bwsim-step-nontau (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 287 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), resEnq = pcf(tid0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), resEnq), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), bwabs(mkstate(mkgs(queue), lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0)), pcf(tid0; ready)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), (ARetEnq(tid0) = globalACrash ⊃ mkstate(ags, alsf, apcf) ≠ mkstate(mkdgs(queue), alsf(tid0; mkls(tid0, val, optval, val0, optval0)), λ tid. (apcf(tid0; resEnq)(tid) = idle ⊃ idle;crashed)) ;∀ tid. ¬ ( pre(mkdgs(queue), alsf(tid0; mkls(tid0, val, optval, val0, optval0))(tid), apcf(tid0; resEnq)(tid), ARetEnq(tid0)) ∧ mkstate(ags, alsf, apcf) = mkstate (gstepf(mkdgs(queue), alsf(tid0; mkls(tid0, val, optval, val0, optval0))(tid), apcf(tid0; resEnq)(tid), ARetEnq(tid0)), alsf(tid0; mkls(tid0, val, optval, val0, optval0)) (tid; lstepf(mkdgs(queue), alsf(tid0; mkls(tid0, val, optval, val0, optval0))(tid), apcf(tid0; resEnq)(tid), ARetEnq(tid0))), apcf(tid0; resEnq) (tid; pcstepf(mkdgs(queue), alsf(tid0; mkls(tid0, val, optval, val0, optval0))(tid), apcf(tid0; resEnq)(tid), ARetEnq(tid0))))) ), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ ARetEnq(tid) ≠ globalACrash; (s)

Proof step 288 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), resEnq = pcf(tid0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), resEnq), bwabs(mkstate(mkgs(queue), lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0)), pcf(tid0; ready)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ∀ tid. ¬ pre(mkdgs(queue), (tid0 = tid ⊃ mkls(tid, val, optval, val0, optval0);alsf(tid)), (tid0 = tid ⊃ resEnq;apcf(tid)), ARetEnq(tid0)) ∨ mkstate(ags, alsf, apcf) ≠ mkstate (gstepf(mkdgs(queue), (tid0 = tid ⊃ mkls(tid, val, optval, val0, optval0);alsf(tid)), (tid0 = tid ⊃ resEnq;apcf(tid)), ARetEnq(tid0)), alsf(tid0; mkls(tid0, val, optval, val0, optval0)) (tid; lstepf(mkdgs(queue), (tid0 = tid ⊃ mkls(tid, val, optval, val0, optval0);alsf(tid)), (tid0 = tid ⊃ resEnq;apcf(tid)), ARetEnq(tid0))), apcf(tid0; resEnq) (tid; pcstepf(mkdgs(queue), (tid0 = tid ⊃ mkls(tid, val, optval, val0, optval0);alsf(tid)), (tid0 = tid ⊃ resEnq;apcf(tid)), ARetEnq(tid0)))) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

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

Additional information

Used terms: tid0

Proof step 289 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), resEnq = pcf(tid0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), resEnq), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), bwabs(mkstate(mkgs(queue), lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0)), pcf(tid0; ready)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ¬ pre(mkdgs(queue), (tid0 = tid0 ⊃ mkls(tid0, val, optval, val0, optval0);alsf(tid0)), (tid0 = tid0 ⊃ resEnq;apcf(tid0)), ARetEnq(tid0)) ∨ mkstate(ags, alsf, apcf) ≠ mkstate (gstepf(mkdgs(queue), (tid0 = tid0 ⊃ mkls(tid0, val, optval, val0, optval0);alsf(tid0)), (tid0 = tid0 ⊃ resEnq;apcf(tid0)), ARetEnq(tid0)), alsf(tid0; mkls(tid0, val, optval, val0, optval0)) (tid0; lstepf(mkdgs(queue), (tid0 = tid0 ⊃ mkls(tid0, val, optval, val0, optval0);alsf(tid0)), (tid0 = tid0 ⊃ resEnq;apcf(tid0)), ARetEnq(tid0))), apcf(tid0; resEnq) (tid0 ; pcstepf(mkdgs(queue), (tid0 = tid0 ⊃ mkls(tid0, val, optval, val0, optval0);alsf(tid0)), (tid0 = tid0 ⊃ resEnq;apcf(tid0)), ARetEnq(tid0)) )) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ pcstepf(gs, mkls(tid, ival, oval, value, optval), resEnq, ARetEnq(tid)) = ready; (s) ⊦ lstepf(gs, mkls(tid, ival, oval, value, optval), resEnq, ARetEnq(tid)) = mkls(tid, ival, oval, value, optval); (s) ⊦ gstepf(gs, mkls(tid, ival, oval, value, optval), resEnq, ARetEnq(tid)) = gs; (s) ⊦ ARetEnq(tid) = ARetEnq(tid0) ↔ tid = tid0; (s) ⊦ mkls(tid, ival, oval, ival0, oval0).tid = tid; (s) ⊦ pre(gs, ls, resEnq, a) ↔ a = ARetEnq(ls.tid); (s)

Proof step 290 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), resEnq = pcf(tid0), mkstate(ags, alsf, apcf) ≠ mkstate (mkdgs(queue), alsf(tid0; mkls(tid0, val, optval, val0, optval0))(tid0; mkls(tid0, val, optval, val0, optval0)), apcf(tid0; resEnq)(tid0; ready)), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), resEnq), bwabs(mkstate(mkgs(queue), lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0)), pcf(tid0; ready)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DurQ[DurQ-ren], name:inj-mkstate, seq:⊦ mkstate(gstate, lsf, pcf) = mkstate(gstate0, lsf0, pcf0) ↔ gstate = gstate0 ∧ lsf = lsf0 ∧ pcf = pcf0, subst:[gstate, pcf0, lsf0, lsf, gstate0, pcf] → [ags, apcf(tid0; resEnq)(tid0; ready), alsf(tid0; mkls(tid0, val, optval, val0, optval0)) (tid0; mkls(tid0, val, optval, val0, optval0)), alsf, mkdgs(queue), apcf], <all paths>

Additional information

Used terms: ags, apcf(tid0; resEnq)(tid0; ready), alsf(tid0; mkls(tid0, val, optval, val0, optval0)) (tid0; mkls(tid0, val, optval, val0, optval0)), alsf, mkdgs(queue), apcf

Proof step 291 from proof bwsim-step-nontau (previous step) (back to tree)

⊦ mkstate(gstate, lsf, pcf) = mkstate(gstate0, lsf0, pcf0) ↔ gstate = gstate0 ∧ lsf = lsf0 ∧ pcf = pcf0

A spec-lemma

Proof step 292 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), resEnq = pcf(tid0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), resEnq), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), bwabs(mkstate(mkgs(queue), lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0)), pcf(tid0; ready)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ags ≠ mkdgs(queue) ∨ alsf ≠ alsf(tid0; mkls(tid0, val, optval, val0, optval0))(tid0; mkls(tid0, val, optval, val0, optval0)) ∨ apcf ≠ apcf(tid0; resEnq)(tid0; ready) ⊦

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), alsf, lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0)), ags, pcf(tid0; ready), apcf], <all paths>

Additional information

Used terms: mkgs(queue), alsf, lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0)), ags, pcf(tid0; ready), apcf

Proof step 293 from proof bwsim-step-nontau (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 294 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), ags = mkdgs(mkgs(queue).queue), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), resEnq = pcf(tid0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), resEnq), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ∀ tid. alsf(tid) = mkls (lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0))(tid).tid, lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0))(tid).ival, lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0))(tid).oval, lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0))(tid).value, lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0))(tid).optval) ∧ apcf(tid) = bwabspcf(pcf(tid0; ready)(tid)) ∨ alsf(tid) = mkls (lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0))(tid).tid, lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0))(tid).ival, Empty, lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0))(tid).value, lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0))(tid).optval) ∧ pcf(tid0; ready)(tid) = invDeq ∧ apcf(tid) = resDeq ∧ lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0))(tid).obsEmpty, ags ≠ mkdgs(queue) ∨ alsf ≠ alsf(tid0; mkls(tid0, val, optval, val0, optval0))(tid0; mkls(tid0, val, optval, val0, optval0)) ∨ apcf ≠ apcf(tid0; resEnq)(tid0; ready) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ invDeq ≠ ready; (s) ⊦ mkdgs(queue) = mkdgs(queue0) ↔ queue = queue0; (s) ⊦ mkgs(queue).queue = queue; (s)

Proof step 295 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), resEnq = pcf(tid0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), resEnq), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ∀ tid. alsf(tid) = mkls ((tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).tid, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).ival, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).oval, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).value, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).optval) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ ready;pcf(tid))) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty, alsf ≠ alsf(tid0; mkls(tid0, val, optval, val0, optval0))(tid0; mkls(tid0, val, optval, val0, optval0)) ∨ apcf ≠ apcf(tid0; resEnq)(tid0; ready) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 11

Additional information

Proof step 296 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), resEnq = pcf(tid0), alsf ≠ alsf(tid0; mkls(tid0, val, optval, val0, optval0))(tid0; mkls(tid0, val, optval, val0, optval0)), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), resEnq), fininvdeq(pcf), ∀ tid. alsf(tid) = mkls ((tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).tid, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).ival, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).oval, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).value, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).optval) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ ready;pcf(tid))) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦

User applied rule expand left

And obtained the following new goals

Rule argument

pos: left 5

Additional information

Proof step 297 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), resEnq = pcf(tid0), alsf(tid) ≠ alsf(tid0; mkls(tid0, val, optval, val0, optval0))(tid0; mkls(tid0, val, optval, val0, optval0))(tid), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), resEnq), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ∀ tid. alsf(tid) = mkls ((tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).tid, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).ival, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).oval, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).value, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).optval) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ ready;pcf(tid))) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 298 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), resEnq = pcf(tid0), alsf(tid) ≠ (tid0 = tid ⊃ mkls(tid, val, optval, val0, optval0);alsf(tid)), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), resEnq), fininvdeq(pcf), ∀ tid. alsf(tid) = mkls ((tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).tid, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).ival, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).oval, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).value, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).optval) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ ready;pcf(tid))) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 5

Additional information

Proof step 299 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), resEnq = pcf(tid0), tid0 = tid, alsf(tid) ≠ mkls(tid, val, optval, val0, optval0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), resEnq), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ∀ tid. alsf(tid) = mkls ((tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).tid, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).ival, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).oval, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).value, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).optval) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ ready;pcf(tid))) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 300 from proof bwsim-step-nontau (previous step) (back to tree)

(tid = tid2 ⊃ mkls(tid2, obsEmpty, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), resEnq = pcf(tid), alsf(tid) ≠ mkls(tid, val, optval, val0, optval0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), DQLInv(mkgs(queue), mkls(tid, obsEmpty, val, optval, val0, optval0), resEnq), fininvdeq(pcf), ∀ tid1. alsf(tid1) = mkls ((tid = tid1 ⊃ mkls(tid1, obsEmpty, val, optval, val0, optval0);lsf(tid1)).tid, (tid = tid1 ⊃ mkls(tid1, obsEmpty, val, optval, val0, optval0);lsf(tid1)).ival, (tid = tid1 ⊃ mkls(tid1, obsEmpty, val, optval, val0, optval0);lsf(tid1)).oval, (tid = tid1 ⊃ mkls(tid1, obsEmpty, val, optval, val0, optval0);lsf(tid1)).value, (tid = tid1 ⊃ mkls(tid1, obsEmpty, val, optval, val0, optval0);lsf(tid1)).optval) ∧ apcf(tid1) = bwabspcf((tid = tid1 ⊃ ready;pcf(tid1))) ∨ alsf(tid1) = mkls(lsf(tid1).tid, lsf(tid1).ival, Empty, lsf(tid1).value, lsf(tid1).optval) ∧ tid ≠ tid1 ∧ invDeq = pcf(tid1) ∧ apcf(tid1) = resDeq ∧ lsf(tid1).obsEmpty, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 10 terms: tid

Additional information

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

Proof step 301 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), resEnq = pcf(tid0), apcf ≠ apcf(tid0; resEnq)(tid0; ready), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), resEnq), fininvdeq(pcf), ∀ tid. alsf(tid) = mkls ((tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).tid, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).ival, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).oval, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).value, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).optval) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ ready;pcf(tid))) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦

User applied rule expand left

And obtained the following new goals

Rule argument

pos: left 5

Additional information

Proof step 302 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), resEnq = pcf(tid0), apcf(tid) ≠ apcf(tid0; resEnq)(tid0; ready)(tid), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), resEnq), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ∀ tid. alsf(tid) = mkls ((tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).tid, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).ival, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).oval, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).value, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).optval) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ ready;pcf(tid))) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 303 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), resEnq = pcf(tid0), apcf(tid) ≠ (tid0 = tid ⊃ ready;apcf(tid)), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), resEnq), fininvdeq(pcf), ∀ tid. alsf(tid) = mkls ((tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).tid, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).ival, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).oval, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).value, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).optval) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ ready;pcf(tid))) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 3, flags: rotate, discard

Additional information

Proof step 304 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), resEnq = pcf(tid0), apcf(tid) ≠ (tid0 = tid ⊃ ready;apcf(tid)), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), lsf(tid0), resEnq), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ∀ tid. alsf(tid) = mkls ((tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).tid, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).ival, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).oval, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).value, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).optval) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ ready;pcf(tid))) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 4

Additional information

Proof step 305 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), resEnq = pcf(tid0), tid0 = tid, apcf(tid) ≠ ready, DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), DQLInv(mkgs(queue), lsf(tid0), resEnq), fininvdeq(pcf), ∀ tid. alsf(tid) = mkls ((tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).tid, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).ival, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).oval, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).value, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).optval) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ ready;pcf(tid))) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 306 from proof bwsim-step-nontau (previous step) (back to tree)

(tid = tid2 ⊃ mkls(tid2, obsEmpty, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), resEnq = pcf(tid), apcf(tid) ≠ ready, DQGInv(mkgs(queue)), DQLInv(mkgs(queue), lsf(tid), resEnq), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ∀ tid1. alsf(tid1) = mkls ((tid = tid1 ⊃ mkls(tid1, obsEmpty, val, optval, val0, optval0);lsf(tid1)).tid, (tid = tid1 ⊃ mkls(tid1, obsEmpty, val, optval, val0, optval0);lsf(tid1)).ival, (tid = tid1 ⊃ mkls(tid1, obsEmpty, val, optval, val0, optval0);lsf(tid1)).oval, (tid = tid1 ⊃ mkls(tid1, obsEmpty, val, optval, val0, optval0);lsf(tid1)).value, (tid = tid1 ⊃ mkls(tid1, obsEmpty, val, optval, val0, optval0);lsf(tid1)).optval) ∧ apcf(tid1) = bwabspcf((tid = tid1 ⊃ ready;pcf(tid1))) ∨ alsf(tid1) = mkls(lsf(tid1).tid, lsf(tid1).ival, Empty, lsf(tid1).value, lsf(tid1).optval) ∧ tid ≠ tid1 ∧ invDeq = pcf(tid1) ∧ apcf(tid1) = resDeq ∧ lsf(tid1).obsEmpty ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 10 terms: tid

Additional information

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

Proof step 307 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), ags = mkdgs(queue), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), resEnq = pcf(tid0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), resEnq), bwabs(mkstate(mkgs(queue), lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0)), pcf(tid0; ready)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), alsf(tid2) = mkls(tid1, val1, optval1, val2, optval2) ∧ apcf(tid2) = bwabspcf((tid0 = tid2 ⊃ ready;pcf(tid2))) ∨ alsf(tid2) = mkls(tid2, val3, Empty, val4, optval4) ∧ tid0 ≠ tid2 ∧ invDeq = pcf(tid2) ∧ apcf(tid2) = resDeq ∧ obsEmpty1 ⊦ (tid0 = tid2 ⊃ mkls(tid2, val3, optval3, val4, optval4);alsf(tid2)) = mkls(tid2, val3, optval3, val4, optval4) ∧ (tid0 = tid2 ⊃ resEnq;apcf(tid2)) = bwabspcf(pcf(tid2)), alsf(tid2) = mkls(tid2, val3, Empty, val4, optval4) ∧ pcf(tid2) = invDeq ∧ tid0 ≠ tid2 ∧ resDeq = apcf(tid2) ∧ obsEmpty1

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 308 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), resEnq = pcf(tid0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), resEnq), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), bwabs(mkstate(mkgs(queue), lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0)), pcf(tid0; ready)), mkstate(mkdgs(queue), alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), alsf(tid2) = mkls(tid1, val1, optval1, val2, optval2) ∧ apcf(tid2) = bwabspcf((tid0 = tid2 ⊃ ready;pcf(tid2))) ∨ alsf(tid2) = mkls(tid2, val3, Empty, val4, optval4) ∧ tid0 ≠ tid2 ∧ invDeq = pcf(tid2) ∧ apcf(tid2) = resDeq ∧ obsEmpty1 ⊦ alsf(tid2) = mkls(tid2, val3, Empty, val4, optval4) ∧ pcf(tid2) = invDeq ∧ tid0 ≠ tid2 ∧ resDeq = apcf(tid2) ∧ obsEmpty1, (tid0 = tid2 ⊃ mkls(tid2, val3, optval3, val4, optval4);alsf(tid2)) = mkls(tid2, val3, optval3, val4, optval4) ∧ (tid0 = tid2 ⊃ resEnq;apcf(tid2)) = bwabspcf(pcf(tid2))

User applied rule case distinction

And closed the goal!

Rule argument

pos: left 1

Additional information

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

Proof step 309 from proof bwsim-step-nontau (previous step) (back to tree)

ca = callRun(tid0), lsf(ca.tid) = mkls(ca.tid, obsEmpty, val, optval, val0, optval0), ca ≠ globalCrash, DQGInv(gs), DQLInv(gs, mkls(ca.tid, obsEmpty, val, optval, val0, optval0), pcf(ca.tid)), bwabs (mkstate(gstepf(gs, lsf(tid), pcf(tid), ca), lsf(tid; lstepf(gs, lsf(tid), pcf(tid), ca)), pcf(tid; pcstepf(gs, lsf(tid), pcf(tid), ca))), mkstate(ags, alsf, apcf)), fininvdeq(pcf), pre(gs, lsf(tid), pcf(tid), ca), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ (∃ tid. ca = CheckEmp(tid) ⊃ (apcf(ca.tid) = resDeq ⊃ ADoDeq(ca.tid);τ);bwabsa(ca)) = τ, ∃ durqs. DurQstep(durqs, (∃ tid. ca = CheckEmp(tid) ⊃ (apcf(ca.tid) = resDeq ⊃ ADoDeq(ca.tid);τ);bwabsa(ca)), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ callARun(tid) ≠ τ; (s) ⊦ bwabsa(callRun(tid)) = callARun(tid); (s) ⊦ CheckEmp(tid) ≠ callRun(tid0); (s) ⊦ callRun(tid).tid = tid; (s) ⊦ callRun(tid) ≠ globalCrash; (s)

Proof step 310 from proof bwsim-step-nontau (previous step) (back to tree)

lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), DQGInv(gs), DQLInv(gs, mkls(tid0, obsEmpty, val, optval, val0, optval0), pcf(tid0)), bwabs (mkstate (gstepf(gs, lsf(tid), pcf(tid), callRun(tid0)), lsf(tid; lstepf(gs, lsf(tid), pcf(tid), callRun(tid0))), pcf(tid; pcstepf(gs, lsf(tid), pcf(tid), callRun(tid0)))), mkstate(ags, alsf, apcf)), fininvdeq(pcf), pre(gs, lsf(tid), pcf(tid), callRun(tid0)), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ ∃ durqs. DurQstep(durqs, callARun(tid0), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

User applied rule structural induction

And obtained the following new goals

Rule argument

term: pcf(tid)

Additional information

Used simplifier rules: DQPC freely generated by crashed, idle, invDeq, invEnq, ready, resDeq, resEnq;; ⊦ pre(gs, ls, resEnq, a) ↔ a = RetEnq(ls.tid); (s) ⊦ RetEnq(tid) ≠ callRun(tid0); (s) ⊦ pre(gs, ls, resDeq, a) ↔ a = RetDeq(ls.tid, ls.oval); (s) ⊦ RetDeq(tid, optval) ≠ callRun(tid0); (s) ⊦ gstepf(gs, ls, ready, a) = gs; (s) ⊦ pre(gs, ls, ready, a) ↔ (∃ value. a = InvEnq(ls.tid, value)) ∨ a = InvDeq(ls.tid); (s) ⊦ InvEnq(tid, val) ≠ callRun(tid0); (s) ⊦ InvDeq(tid) ≠ callRun(tid0); (s) ⊦ pre(gs, ls, invEnq, a) ↔ a = DoEnq(ls.tid); (s) ⊦ DoEnq(tid) ≠ callRun(tid0); (s) ⊦ pre(gs, ls, invDeq, a) ↔ a = CheckEmp(ls.tid) ∧ gs.queue = [] ∨ a = DoDeqEmpty(ls.tid) ∧ ls.obsEmpty ∨ a = DoDeq(ls.tid) ∧ gs.queue ≠ []; (s) ⊦ CheckEmp(tid) ≠ callRun(tid0); (s) ⊦ DoDeqEmpty(tid) ≠ callRun(tid0); (s) ⊦ DoDeq(tid) ≠ callRun(tid0); (s) ⊦ pre(gs, ls, crashed, a) ↔ false; (s)

Proof step 311 from proof bwsim-step-nontau (previous step) (back to tree)

idle = pcf(tid), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), DQGInv(gs), DQLInv(gs, mkls(tid0, obsEmpty, val, optval, val0, optval0), pcf(tid0)), bwabs (mkstate (gstepf(gs, lsf(tid), pcf(tid), callRun(tid0)), lsf(tid; lstepf(gs, lsf(tid), pcf(tid), callRun(tid0))), pcf(tid; pcstepf(gs, lsf(tid), pcf(tid), callRun(tid0)))), mkstate(ags, alsf, apcf)), fininvdeq(pcf), pre(gs, lsf(tid), pcf(tid), callRun(tid0)), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ ∃ durqs. DurQstep(durqs, callARun(tid0), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ pcstepf(gs, ls, idle, callRun(ls.tid)) = ready; (s) ⊦ lstepf(gs, ls, idle, callRun(ls.tid)) = ls; (s) ⊦ gstepf(gs, ls, idle, callRun(ls.tid)) = gs; (s) ⊦ callRun(tid) = callRun(tid0) ↔ tid = tid0; (s) ⊦ pre(gs, ls, idle, a) ↔ a = callRun(ls.tid); (s)

Proof step 312 from proof bwsim-step-nontau (previous step) (back to tree)

idle = pcf(tid), lsf(lsf(tid).tid) = mkls(lsf(tid).tid, obsEmpty, val, optval, val0, optval0), DQGInv(gs), DQLInv(gs, mkls(lsf(tid).tid, obsEmpty, val, optval, val0, optval0), pcf(lsf(tid).tid)), bwabs(mkstate(gs, lsf(tid; lsf(tid)), pcf(tid; ready)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ ∃ durqs. DurQstep(durqs, callARun(lsf(tid).tid), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

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, obsEmpty0, lsf(tid), optval1, tid0, 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, obsEmpty0, lsf(tid), oval, tid0, optval1

Proof step 313 from proof bwsim-step-nontau (previous step) (back to tree)

idle = pcf(tid), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), DQGInv(gs), DQLInv(gs, mkls(tid0, obsEmpty, val, optval, val0, optval0), pcf(tid0)), bwabs(mkstate(gs, lsf(tid; lsf(tid)), pcf(tid; ready)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ ∃ durqs. DurQstep(durqs, callARun(tid0), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 314 from proof bwsim-step-nontau (previous step) (back to tree)

idle = pcf(tid), lsf(tid) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), DQGInv(gs), DQLInv(gs, mkls(tid0, obsEmpty, val, optval, val0, optval0), pcf(tid0)), bwabs(mkstate(gs, lsf(tid; mkls(tid0, obsEmpty0, val1, optval1, val2, optval2)), pcf(tid; ready)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ ∃ durqs. DurQstep(durqs, callARun(tid0), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 8 terms: tid abort: F discard: F computed: F

Additional information

Used terms: tid

Proof step 315 from proof bwsim-step-nontau (previous step) (back to tree)

lsf(tid).tid = tid, idle = pcf(tid), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid) = mkls(tid0, obsEmpty0, val1, optval1, val2, optval2), DQGInv(gs), DQLInv(gs, mkls(tid0, obsEmpty, val, optval, val0, optval0), pcf(tid0)), DQLInv(gs, lsf(tid), pcf(tid)), bwabs(mkstate(gs, lsf(tid; mkls(tid0, obsEmpty0, val1, optval1, val2, optval2)), pcf(tid; ready)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ ∃ durqs. DurQstep(durqs, callARun(tid0), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 316 from proof bwsim-step-nontau (previous step) (back to tree)

idle = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), DQGInv(gs), DQLInv(gs, mkls(tid0, obsEmpty, val, optval, val0, optval0), idle), bwabs(mkstate(gs, lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0)), pcf(tid0; ready)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ ∃ durqs. DurQstep(durqs, callARun(tid0), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)

User applied rule exists right

And obtained the following new goals

Rule argument

pos: right 1 terms: mkstate(mkdgs(gs.queue), alsf, apcf(tid0; idle)) abort: F discard: T computed: F

Additional information

Used terms: mkstate(mkdgs(gs.queue), alsf, apcf(tid0; idle))

Proof step 317 from proof bwsim-step-nontau (previous step) (back to tree)

idle = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), DQGInv(gs), DQLInv(gs, mkls(tid0, obsEmpty, val, optval, val0, optval0), idle), bwabs(mkstate(gs, lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0)), pcf(tid0; ready)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ DurQstep(mkstate(mkdgs(gs.queue), alsf, apcf(tid0; idle)), callARun(tid0), mkstate(ags, alsf, apcf)) ∧ bwabs(mkstate(gs, lsf, pcf), mkstate(mkdgs(gs.queue), alsf, apcf(tid0; idle)))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ idle ≠ resDeq; (s) ⊦ invDeq ≠ ready; (s) ⊦ bwabs(mkstate(gs, lsf, pcf), mkstate(ags, alsf, apcf)) → ( bwabs(mkstate(gs0, lsf0, pcf0), mkstate(ags0, alsf0, apcf0)) ↔ ags = mkdgs(gs.queue) → ags0 = mkdgs(gs0.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 → alsf0(tid) = mkls (lsf0(tid).tid, lsf0(tid).ival, lsf0(tid).oval, lsf0(tid).value, lsf0(tid).optval) ∧ apcf0(tid) = bwabspcf(pcf0(tid)) ∨ alsf0(tid) = mkls (lsf0(tid).tid, lsf0(tid).ival, Empty, lsf0(tid).value, lsf0(tid).optval) ∧ pcf0(tid) = invDeq ∧ apcf0(tid) = resDeq ∧ lsf0(tid).obsEmpty)); (s)

Proof step 318 from proof bwsim-step-nontau (previous step) (back to tree)

idle = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), DQGInv(gs), DQLInv(gs, mkls(tid0, obsEmpty, val, optval, val0, optval0), idle), bwabs(mkstate(gs, lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0)), pcf(tid0; ready)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ DurQstep(mkstate(mkdgs(gs.queue), alsf, apcf(tid0; idle)), callARun(tid0), mkstate(ags, alsf, apcf)) ∧ ( ags = mkdgs(gs.queue) → alsf(tid) = mkls ((tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).tid, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).ival, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).oval, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).value, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).optval) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ ready;pcf(tid))) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty → alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ (tid0 = tid ⊃ idle;apcf(tid)) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ tid0 ≠ tid ∧ resDeq = apcf(tid) ∧ lsf(tid).obsEmpty)

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 319 from proof bwsim-step-nontau (previous step) (back to tree)

gs = mkgs(queue), idle = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), DQGInv(gs), DQLInv(gs, mkls(tid0, obsEmpty, val, optval, val0, optval0), idle), bwabs(mkstate(gs, lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0)), pcf(tid0; ready)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ DurQstep(mkstate(mkdgs(queue), alsf, apcf(tid0; idle)), callARun(tid0), mkstate(ags, alsf, apcf)) ∧ ( ags = mkdgs(queue) → alsf(tid) = mkls ((tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).tid, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).ival, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).oval, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).value, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).optval) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ ready;pcf(tid))) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty → alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ (tid0 = tid ⊃ idle;apcf(tid)) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ tid0 ≠ tid ∧ resDeq = apcf(tid) ∧ lsf(tid).obsEmpty)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 320 from proof bwsim-step-nontau (previous step) (back to tree)

idle = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), idle), bwabs(mkstate(mkgs(queue), lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0)), pcf(tid0; ready)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦ DurQstep(mkstate(mkdgs(queue), alsf, apcf(tid0; idle)), callARun(tid0), mkstate(ags, alsf, apcf)) ∧ ( ags = mkdgs(queue) → alsf(tid) = mkls ((tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).tid, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).ival, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).oval, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).value, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).optval) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ ready;pcf(tid))) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty → alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ (tid0 = tid ⊃ idle;apcf(tid)) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ tid0 ≠ tid ∧ resDeq = apcf(tid) ∧ lsf(tid).obsEmpty)

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, obsEmpty0, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);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, obsEmpty0, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)), oval, tid1, optval1

Proof step 321 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), idle = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), idle), bwabs(mkstate(mkgs(queue), lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0)), pcf(tid0; ready)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦ DurQstep(mkstate(mkdgs(queue), alsf, apcf(tid0; idle)), callARun(tid0), mkstate(ags, alsf, apcf)) ∧ ( ags = mkdgs(queue) → alsf(tid) = mkls(tid1, val1, optval1, val2, optval2) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ ready;pcf(tid))) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty → alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, lsf(tid).oval, lsf(tid).value, lsf(tid).optval) ∧ (tid0 = tid ⊃ idle;apcf(tid)) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ pcf(tid) = invDeq ∧ tid0 ≠ tid ∧ resDeq = apcf(tid) ∧ lsf(tid).obsEmpty)

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] → [val4, val3, obsEmpty1, lsf(tid), optval3, tid2, optval4]

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, obsEmpty1, lsf(tid), oval, tid2, optval3

Proof step 322 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), idle = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), idle), bwabs(mkstate(mkgs(queue), lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0)), pcf(tid0; ready)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦ DurQstep(mkstate(mkdgs(queue), alsf, apcf(tid0; idle)), callARun(tid0), mkstate(ags, alsf, apcf)) ∧ ( ags = mkdgs(queue) → alsf(tid) = mkls(tid1, val1, optval1, val2, optval2) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ ready;pcf(tid))) ∨ alsf(tid) = mkls(tid2, val3, Empty, val4, optval4) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ obsEmpty1 → alsf(tid) = mkls(tid2, val3, optval3, val4, optval4) ∧ (tid0 = tid ⊃ idle;apcf(tid)) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(tid2, val3, Empty, val4, optval4) ∧ pcf(tid) = invDeq ∧ tid0 ≠ tid ∧ resDeq = apcf(tid) ∧ obsEmpty1)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 323 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), idle = pcf(tid0), lsf(tid) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), idle), bwabs(mkstate(mkgs(queue), lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0)), pcf(tid0; ready)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦ DurQstep(mkstate(mkdgs(queue), alsf, apcf(tid0; idle)), callARun(tid0), mkstate(ags, alsf, apcf)) ∧ ( ags = mkdgs(queue) → alsf(tid) = mkls(tid1, val1, optval1, val2, optval2) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ ready;pcf(tid))) ∨ alsf(tid) = mkls(tid2, val3, Empty, val4, optval4) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ obsEmpty1 → alsf(tid) = mkls(tid2, val3, optval3, val4, optval4) ∧ (tid0 = tid ⊃ idle;apcf(tid)) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(tid2, val3, Empty, val4, optval4) ∧ pcf(tid) = invDeq ∧ tid0 ≠ tid ∧ resDeq = apcf(tid) ∧ obsEmpty1)

User applied rule all left

And obtained the following new goals

Rule argument

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

Additional information

Used terms: tid

Proof step 324 from proof bwsim-step-nontau (previous step) (back to tree)

lsf(tid).tid = tid, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), idle = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), idle), DQLInv(mkgs(queue), lsf(tid), pcf(tid)), bwabs(mkstate(mkgs(queue), lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0)), pcf(tid0; ready)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦ DurQstep(mkstate(mkdgs(queue), alsf, apcf(tid0; idle)), callARun(tid0), mkstate(ags, alsf, apcf)) ∧ ( ags = mkdgs(queue) → alsf(tid) = mkls(tid1, val1, optval1, val2, optval2) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ ready;pcf(tid))) ∨ alsf(tid) = mkls(tid2, val3, Empty, val4, optval4) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ obsEmpty1 → alsf(tid) = mkls(tid2, val3, optval3, val4, optval4) ∧ (tid0 = tid ⊃ idle;apcf(tid)) = bwabspcf(pcf(tid)) ∨ alsf(tid) = mkls(tid2, val3, Empty, val4, optval4) ∧ pcf(tid) = invDeq ∧ tid0 ≠ tid ∧ resDeq = apcf(tid) ∧ obsEmpty1)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 325 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), idle = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), idle), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), bwabs(mkstate(mkgs(queue), lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0)), pcf(tid0; ready)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦ DurQstep(mkstate(mkdgs(queue), alsf, apcf(tid0; idle)), callARun(tid0), mkstate(ags, alsf, apcf)) ∧ ( ags = mkdgs(queue) → alsf(tid2) = mkls(tid1, val1, optval1, val2, optval2) ∧ apcf(tid2) = bwabspcf((tid0 = tid2 ⊃ ready;pcf(tid2))) ∨ alsf(tid2) = mkls(tid2, val3, Empty, val4, optval4) ∧ tid0 ≠ tid2 ∧ invDeq = pcf(tid2) ∧ apcf(tid2) = resDeq ∧ obsEmpty1 → alsf(tid2) = mkls(tid2, val3, optval3, val4, optval4) ∧ (tid0 = tid2 ⊃ idle;apcf(tid2)) = bwabspcf(pcf(tid2)) ∨ alsf(tid2) = mkls(tid2, val3, Empty, val4, optval4) ∧ pcf(tid2) = invDeq ∧ tid0 ≠ tid2 ∧ resDeq = apcf(tid2) ∧ obsEmpty1)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 326 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), idle = pcf(tid0), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), idle), bwabs(mkstate(mkgs(queue), lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0)), pcf(tid0; ready)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ¬ DurQstep(mkstate(mkdgs(queue), alsf, apcf(tid0; idle)), callARun(tid0), mkstate(ags, alsf, apcf)), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(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), alsf, callARun(tid0), mkdgs(queue), apcf(tid0; idle)], <all paths>

Additional information

Used terms: mkstate(ags, alsf, apcf), alsf, callARun(tid0), mkdgs(queue), apcf(tid0; idle)

Proof step 327 from proof bwsim-step-nontau (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 328 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), idle = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), idle), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), bwabs(mkstate(mkgs(queue), lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0)), pcf(tid0; ready)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), (callARun(tid0) = globalACrash ⊃ mkstate(ags, alsf, apcf) ≠ mkstate(mkdgs(queue), alsf, λ tid. (apcf(tid0; idle)(tid) = idle ⊃ idle;crashed)) ;∀ tid. ¬ ( pre(mkdgs(queue), alsf(tid), apcf(tid0; idle)(tid), callARun(tid0)) ∧ mkstate(ags, alsf, apcf) = mkstate (gstepf(mkdgs(queue), alsf(tid), apcf(tid0; idle)(tid), callARun(tid0)), alsf(tid; lstepf(mkdgs(queue), alsf(tid), apcf(tid0; idle)(tid), callARun(tid0))), apcf(tid0; idle)(tid; pcstepf(mkdgs(queue), alsf(tid), apcf(tid0; idle)(tid), callARun(tid0))))) ), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ callARun(tid) ≠ globalACrash; (s)

Proof step 329 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), idle = pcf(tid0), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), idle), bwabs(mkstate(mkgs(queue), lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0)), pcf(tid0; ready)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ∀ tid. ¬ pre(mkdgs(queue), alsf(tid), (tid0 = tid ⊃ idle;apcf(tid)), callARun(tid0)) ∨ mkstate(ags, alsf, apcf) ≠ mkstate (gstepf(mkdgs(queue), alsf(tid), (tid0 = tid ⊃ idle;apcf(tid)), callARun(tid0)), alsf(tid; lstepf(mkdgs(queue), alsf(tid), (tid0 = tid ⊃ idle;apcf(tid)), callARun(tid0))), apcf(tid0; idle)(tid; pcstepf(mkdgs(queue), alsf(tid), (tid0 = tid ⊃ idle;apcf(tid)), callARun(tid0)))) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

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

Additional information

Used terms: tid0

Proof step 330 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), idle = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), idle), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), bwabs(mkstate(mkgs(queue), lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0)), pcf(tid0; ready)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ¬ pre(mkdgs(queue), alsf(tid0), (tid0 = tid0 ⊃ idle;apcf(tid0)), callARun(tid0)) ∨ mkstate(ags, alsf, apcf) ≠ mkstate (gstepf(mkdgs(queue), alsf(tid0), (tid0 = tid0 ⊃ idle;apcf(tid0)), callARun(tid0)), alsf(tid0; lstepf(mkdgs(queue), alsf(tid0), (tid0 = tid0 ⊃ idle;apcf(tid0)), callARun(tid0))), apcf(tid0; idle)(tid0; pcstepf(mkdgs(queue), alsf(tid0), (tid0 = tid0 ⊃ idle;apcf(tid0)), callARun(tid0)))) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ callARun(tid) = callARun(tid0) ↔ tid = tid0; (s) ⊦ pre(gs, ls, idle, a) ↔ a = callARun(ls.tid); (s)

Proof step 331 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), idle = pcf(tid0), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), idle), bwabs(mkstate(mkgs(queue), lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0)), pcf(tid0; ready)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), tid0 ≠ alsf(tid0).tid ∨ mkstate(ags, alsf, apcf) ≠ mkstate (gstepf(mkdgs(queue), alsf(tid0), idle, callARun(tid0)), alsf(tid0; lstepf(mkdgs(queue), alsf(tid0), idle, callARun(tid0))), apcf(tid0; idle)(tid0; pcstepf(mkdgs(queue), alsf(tid0), idle, callARun(tid0)))) ⊦

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] → [val6, val5, optval5, tid3, optval6, alsf(tid0)]

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, tid3, optval5, alsf(tid0)

Proof step 332 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), alsf(tid0) = mkls(tid3, val5, optval5, val6, optval6), idle = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), idle), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), bwabs(mkstate(mkgs(queue), lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0)), pcf(tid0; ready)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), tid0 ≠ tid3 ∨ mkstate(ags, alsf, apcf) ≠ mkstate (gstepf(mkdgs(queue), alsf(tid0), idle, callARun(tid0)), alsf(tid0; lstepf(mkdgs(queue), alsf(tid0), idle, callARun(tid0))), apcf(tid0; idle)(tid0; pcstepf(mkdgs(queue), alsf(tid0), idle, callARun(tid0)))) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 333 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), alsf(tid0) = mkls(tid3, val5, optval5, val6, optval6), idle = pcf(tid0), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), idle), bwabs(mkstate(mkgs(queue), lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0)), pcf(tid0; ready)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), tid0 ≠ tid3 ∨ mkstate(ags, alsf, apcf) ≠ mkstate (gstepf(mkdgs(queue), alsf(tid3), idle, callARun(tid3)), alsf(tid3; lstepf(mkdgs(queue), alsf(tid3), idle, callARun(tid3))), apcf(tid3; idle)(tid3; pcstepf(mkdgs(queue), alsf(tid3), idle, callARun(tid3)))) ⊦

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), alsf, lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0)), ags, pcf(tid0; ready), apcf], <all paths>

Additional information

Used terms: mkgs(queue), alsf, lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0)), ags, pcf(tid0; ready), apcf

Proof step 334 from proof bwsim-step-nontau (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 335 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), ags = mkdgs(mkgs(queue).queue), alsf(tid0) = mkls(tid3, val5, optval5, val6, optval6), idle = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), idle), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ∀ tid. alsf(tid) = mkls (lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0))(tid).tid, lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0))(tid).ival, lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0))(tid).oval, lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0))(tid).value, lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0))(tid).optval) ∧ apcf(tid) = bwabspcf(pcf(tid0; ready)(tid)) ∨ alsf(tid) = mkls (lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0))(tid).tid, lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0))(tid).ival, Empty, lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0))(tid).value, lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0))(tid).optval) ∧ pcf(tid0; ready)(tid) = invDeq ∧ apcf(tid) = resDeq ∧ lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0))(tid).obsEmpty, tid0 ≠ tid3 ∨ mkstate(ags, alsf, apcf) ≠ mkstate (gstepf(mkdgs(queue), alsf(tid3), idle, callARun(tid3)), alsf(tid3; lstepf(mkdgs(queue), alsf(tid3), idle, callARun(tid3))), apcf(tid3; idle)(tid3; pcstepf(mkdgs(queue), alsf(tid3), idle, callARun(tid3)))) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ invDeq ≠ ready; (s) ⊦ mkgs(queue).queue = queue; (s)

Proof step 336 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), alsf(tid0) = mkls(tid3, val5, optval5, val6, optval6), idle = pcf(tid0), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), idle), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ∀ tid. alsf(tid) = mkls ((tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).tid, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).ival, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).oval, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).value, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).optval) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ ready;pcf(tid))) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty, tid0 ≠ tid3 ∨ mkstate(mkdgs(queue), alsf, apcf) ≠ mkstate (gstepf(mkdgs(queue), alsf(tid3), idle, callARun(tid3)), alsf(tid3; lstepf(mkdgs(queue), alsf(tid3), idle, callARun(tid3))), apcf(tid3; idle)(tid3; pcstepf(mkdgs(queue), alsf(tid3), idle, callARun(tid3)))) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

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

Additional information

Used terms: tid0

Proof step 337 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), alsf(tid0) = mkls(tid3, val5, optval5, val6, optval6), idle = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), idle), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), fininvdeq(pcf), ∀ tid. alsf(tid) = mkls ((tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).tid, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).ival, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).oval, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).value, (tid0 = tid ⊃ mkls(tid, obsEmpty, val, optval, val0, optval0);lsf(tid)).optval) ∧ apcf(tid) = bwabspcf((tid0 = tid ⊃ ready;pcf(tid))) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ tid0 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), tid0 ≠ tid3 ∨ mkstate(mkdgs(queue), alsf, apcf) ≠ mkstate (gstepf(mkdgs(queue), alsf(tid3), idle, callARun(tid3)), alsf(tid3; lstepf(mkdgs(queue), alsf(tid3), idle, callARun(tid3))), apcf(tid3; idle)(tid3; pcstepf(mkdgs(queue), alsf(tid3), idle, callARun(tid3)))), alsf(tid0) = mkls ((tid0 = tid0 ⊃ mkls(tid0, obsEmpty, val, optval, val0, optval0);lsf(tid0)).tid, (tid0 = tid0 ⊃ mkls(tid0, obsEmpty, val, optval, val0, optval0);lsf(tid0)).ival, (tid0 = tid0 ⊃ mkls(tid0, obsEmpty, val, optval, val0, optval0);lsf(tid0)).oval, (tid0 = tid0 ⊃ mkls(tid0, obsEmpty, val, optval, val0, optval0);lsf(tid0)).value, (tid0 = tid0 ⊃ mkls(tid0, obsEmpty, val, optval, val0, optval0);lsf(tid0)).optval) ∧ apcf(tid0) = bwabspcf((tid0 = tid0 ⊃ ready;pcf(tid0))) ∨ alsf(tid0) = mkls(lsf(tid0).tid, lsf(tid0).ival, Empty, lsf(tid0).value, lsf(tid0).optval) ∧ tid0 ≠ tid0 ∧ invDeq = pcf(tid0) ∧ apcf(tid0) = resDeq ∧ lsf(tid0).obsEmpty ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ pcstepf(gs, mkls(tid, ival, oval, value, optval), idle, callARun(tid)) = ready; (s) ⊦ lstepf(gs, mkls(tid, ival, oval, value, optval), idle, callARun(tid)) = mkls(tid, ival, oval, value, optval); (s) ⊦ gstepf(gs, mkls(tid, ival, oval, value, optval), idle, callARun(tid)) = gs; (s) ⊦ mkls(tid, ival, oval, ival0, oval0) = mkls(tid0, ival1, oval1, ival2, oval2) ↔ tid = tid0 ∧ ival = ival1 ∧ oval = oval1 ∧ ival0 = ival2 ∧ oval0 = oval2; (ws) ⊦ bwabspcf(ready) = ready; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).optval = oval0; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).value = ival0; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).oval = oval; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).ival = ival; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).tid = tid; (s)

Proof step 338 from proof bwsim-step-nontau (previous step) (back to tree)

(tid3 = tid2 ⊃ mkls(tid2, obsEmpty, val5, optval5, val6, optval6);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), alsf(tid3) = mkls(tid3, val5, optval5, val6, optval6), apcf(tid3) = ready, idle = pcf(tid3), lsf(tid3) = mkls(tid3, obsEmpty, val5, optval5, val6, optval6), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), mkstate(mkdgs(queue), alsf, apcf) ≠ mkstate(mkdgs(queue), alsf(tid3; mkls(tid3, val5, optval5, val6, optval6)), apcf(tid3; idle)(tid3; ready)), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid3, obsEmpty, val5, optval5, val6, optval6), idle), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), fininvdeq(pcf), ∀ tid. alsf(tid) = mkls ((tid3 = tid ⊃ mkls(tid, obsEmpty, val5, optval5, val6, optval6);lsf(tid)).tid, (tid3 = tid ⊃ mkls(tid, obsEmpty, val5, optval5, val6, optval6);lsf(tid)).ival, (tid3 = tid ⊃ mkls(tid, obsEmpty, val5, optval5, val6, optval6);lsf(tid)).oval, (tid3 = tid ⊃ mkls(tid, obsEmpty, val5, optval5, val6, optval6);lsf(tid)).value, (tid3 = tid ⊃ mkls(tid, obsEmpty, val5, optval5, val6, optval6);lsf(tid)).optval) ∧ apcf(tid) = bwabspcf((tid3 = tid ⊃ ready;pcf(tid))) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ tid3 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DurQ[DurQ-ren], name:inj-mkstate, seq:⊦ mkstate(gstate, lsf, pcf) = mkstate(gstate0, lsf0, pcf0) ↔ gstate = gstate0 ∧ lsf = lsf0 ∧ pcf = pcf0, subst:[gstate, pcf0, lsf0, lsf, gstate0, pcf] → [mkdgs(queue), apcf(tid3; idle)(tid3; ready), alsf(tid3; mkls(tid3, val5, optval5, val6, optval6)), alsf, mkdgs(queue), apcf], <all paths>

Additional information

Used terms: mkdgs(queue), apcf(tid3; idle)(tid3; ready), alsf(tid3; mkls(tid3, val5, optval5, val6, optval6)), alsf, mkdgs(queue), apcf

Proof step 339 from proof bwsim-step-nontau (previous step) (back to tree)

⊦ mkstate(gstate, lsf, pcf) = mkstate(gstate0, lsf0, pcf0) ↔ gstate = gstate0 ∧ lsf = lsf0 ∧ pcf = pcf0

A spec-lemma

Proof step 340 from proof bwsim-step-nontau (previous step) (back to tree)

(tid3 = tid2 ⊃ mkls(tid2, obsEmpty, val5, optval5, val6, optval6);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), alsf(tid3) = mkls(tid3, val5, optval5, val6, optval6), apcf(tid3) = ready, idle = pcf(tid3), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), lsf(tid3) = mkls(tid3, obsEmpty, val5, optval5, val6, optval6), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), DQLInv(mkgs(queue), mkls(tid3, obsEmpty, val5, optval5, val6, optval6), idle), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ∀ tid. alsf(tid) = mkls ((tid3 = tid ⊃ mkls(tid, obsEmpty, val5, optval5, val6, optval6);lsf(tid)).tid, (tid3 = tid ⊃ mkls(tid, obsEmpty, val5, optval5, val6, optval6);lsf(tid)).ival, (tid3 = tid ⊃ mkls(tid, obsEmpty, val5, optval5, val6, optval6);lsf(tid)).oval, (tid3 = tid ⊃ mkls(tid, obsEmpty, val5, optval5, val6, optval6);lsf(tid)).value, (tid3 = tid ⊃ mkls(tid, obsEmpty, val5, optval5, val6, optval6);lsf(tid)).optval) ∧ apcf(tid) = bwabspcf((tid3 = tid ⊃ ready;pcf(tid))) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ tid3 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty, mkdgs(queue) ≠ mkdgs(queue) ∨ alsf ≠ alsf(tid3; mkls(tid3, val5, optval5, val6, optval6)) ∨ apcf ≠ apcf(tid3; idle)(tid3; ready) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 341 from proof bwsim-step-nontau (previous step) (back to tree)

(tid3 = tid2 ⊃ mkls(tid2, obsEmpty, val5, optval5, val6, optval6);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), alsf(tid3) = mkls(tid3, val5, optval5, val6, optval6), apcf(tid3) = ready, idle = pcf(tid3), lsf(tid3) = mkls(tid3, obsEmpty, val5, optval5, val6, optval6), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), apcf ≠ apcf(tid3; idle)(tid3; ready), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid3, obsEmpty, val5, optval5, val6, optval6), idle), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), fininvdeq(pcf), ∀ tid. alsf(tid) = mkls ((tid3 = tid ⊃ mkls(tid, obsEmpty, val5, optval5, val6, optval6);lsf(tid)).tid, (tid3 = tid ⊃ mkls(tid, obsEmpty, val5, optval5, val6, optval6);lsf(tid)).ival, (tid3 = tid ⊃ mkls(tid, obsEmpty, val5, optval5, val6, optval6);lsf(tid)).oval, (tid3 = tid ⊃ mkls(tid, obsEmpty, val5, optval5, val6, optval6);lsf(tid)).value, (tid3 = tid ⊃ mkls(tid, obsEmpty, val5, optval5, val6, optval6);lsf(tid)).optval) ∧ apcf(tid) = bwabspcf((tid3 = tid ⊃ ready;pcf(tid))) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ tid3 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦

User applied rule expand left

And obtained the following new goals

Rule argument

pos: left 7

Additional information

Proof step 342 from proof bwsim-step-nontau (previous step) (back to tree)

(tid3 = tid2 ⊃ mkls(tid2, obsEmpty, val5, optval5, val6, optval6);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), alsf(tid3) = mkls(tid3, val5, optval5, val6, optval6), apcf(tid3) = ready, idle = pcf(tid3), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), lsf(tid3) = mkls(tid3, obsEmpty, val5, optval5, val6, optval6), apcf(tid) ≠ apcf(tid3; idle)(tid3; ready)(tid), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), DQLInv(mkgs(queue), mkls(tid3, obsEmpty, val5, optval5, val6, optval6), idle), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ∀ tid. alsf(tid) = mkls ((tid3 = tid ⊃ mkls(tid, obsEmpty, val5, optval5, val6, optval6);lsf(tid)).tid, (tid3 = tid ⊃ mkls(tid, obsEmpty, val5, optval5, val6, optval6);lsf(tid)).ival, (tid3 = tid ⊃ mkls(tid, obsEmpty, val5, optval5, val6, optval6);lsf(tid)).oval, (tid3 = tid ⊃ mkls(tid, obsEmpty, val5, optval5, val6, optval6);lsf(tid)).value, (tid3 = tid ⊃ mkls(tid, obsEmpty, val5, optval5, val6, optval6);lsf(tid)).optval) ∧ apcf(tid) = bwabspcf((tid3 = tid ⊃ ready;pcf(tid))) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ tid3 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 343 from proof bwsim-step-nontau (previous step) (back to tree)

(tid3 = tid2 ⊃ mkls(tid2, obsEmpty, val5, optval5, val6, optval6);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), alsf(tid3) = mkls(tid3, val5, optval5, val6, optval6), apcf(tid3) = ready, idle = pcf(tid3), lsf(tid3) = mkls(tid3, obsEmpty, val5, optval5, val6, optval6), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), apcf(tid) ≠ (tid3 = tid ⊃ ready;apcf(tid)), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid3, obsEmpty, val5, optval5, val6, optval6), idle), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), fininvdeq(pcf), ∀ tid. alsf(tid) = mkls ((tid3 = tid ⊃ mkls(tid, obsEmpty, val5, optval5, val6, optval6);lsf(tid)).tid, (tid3 = tid ⊃ mkls(tid, obsEmpty, val5, optval5, val6, optval6);lsf(tid)).ival, (tid3 = tid ⊃ mkls(tid, obsEmpty, val5, optval5, val6, optval6);lsf(tid)).oval, (tid3 = tid ⊃ mkls(tid, obsEmpty, val5, optval5, val6, optval6);lsf(tid)).value, (tid3 = tid ⊃ mkls(tid, obsEmpty, val5, optval5, val6, optval6);lsf(tid)).optval) ∧ apcf(tid) = bwabspcf((tid3 = tid ⊃ ready;pcf(tid))) ∨ alsf(tid) = mkls(lsf(tid).tid, lsf(tid).ival, Empty, lsf(tid).value, lsf(tid).optval) ∧ tid3 ≠ tid ∧ invDeq = pcf(tid) ∧ apcf(tid) = resDeq ∧ lsf(tid).obsEmpty, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦

User applied rule case distinction

And closed the goal!

Rule argument

pos: left 7

Additional information

Proof step 344 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), ags = mkdgs(queue), idle = pcf(tid0), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), idle), bwabs(mkstate(mkgs(queue), lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0)), pcf(tid0; ready)), mkstate(ags, alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), alsf(tid2) = mkls(tid1, val1, optval1, val2, optval2) ∧ apcf(tid2) = bwabspcf((tid0 = tid2 ⊃ ready;pcf(tid2))) ∨ alsf(tid2) = mkls(tid2, val3, Empty, val4, optval4) ∧ tid0 ≠ tid2 ∧ invDeq = pcf(tid2) ∧ apcf(tid2) = resDeq ∧ obsEmpty1 ⊦ alsf(tid2) = mkls(tid2, val3, optval3, val4, optval4) ∧ (tid0 = tid2 ⊃ idle;apcf(tid2)) = bwabspcf(pcf(tid2)), alsf(tid2) = mkls(tid2, val3, Empty, val4, optval4) ∧ pcf(tid2) = invDeq ∧ tid0 ≠ tid2 ∧ resDeq = apcf(tid2) ∧ obsEmpty1

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 345 from proof bwsim-step-nontau (previous step) (back to tree)

(tid0 = tid2 ⊃ mkls(tid2, obsEmpty, val, optval, val0, optval0);mkls(tid2, obsEmpty1, val3, optval3, val4, optval4)) = mkls(tid1, obsEmpty0, val1, optval1, val2, optval2), idle = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), lsf(tid2) = mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), idle), DQLInv(mkgs(queue), mkls(tid2, obsEmpty1, val3, optval3, val4, optval4), pcf(tid2)), bwabs(mkstate(mkgs(queue), lsf(tid0; mkls(tid0, obsEmpty, val, optval, val0, optval0)), pcf(tid0; ready)), mkstate(mkdgs(queue), alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), alsf(tid2) = mkls(tid1, val1, optval1, val2, optval2) ∧ apcf(tid2) = bwabspcf((tid0 = tid2 ⊃ ready;pcf(tid2))) ∨ alsf(tid2) = mkls(tid2, val3, Empty, val4, optval4) ∧ tid0 ≠ tid2 ∧ invDeq = pcf(tid2) ∧ apcf(tid2) = resDeq ∧ obsEmpty1 ⊦ alsf(tid2) = mkls(tid2, val3, Empty, val4, optval4) ∧ pcf(tid2) = invDeq ∧ tid0 ≠ tid2 ∧ resDeq = apcf(tid2) ∧ obsEmpty1, alsf(tid2) = mkls(tid2, val3, optval3, val4, optval4) ∧ (tid0 = tid2 ⊃ idle;apcf(tid2)) = bwabspcf(pcf(tid2))

User applied rule case distinction

And closed the goal!

Rule argument

pos: left 1

Additional information

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

Proof Tree for bwsim-step-nontau (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