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

bwabs(mkstate(gs0, lsf0, pcf0), durqs), DQInv(gs, lsf, pcf), fininvdeq(pcf), absa(ca, durqs.pcf) = τ, DQstep(mkstate(gs, lsf, pcf), ca, mkstate(gs0, lsf0, pcf0)) ⊦ 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-tau (previous step) (back to tree)

absa(ca, durqs.pcf) = τ, DQInv(gs, lsf, pcf), DQstep(mkstate(gs, lsf, pcf), ca, mkstate(gs0, lsf0, pcf0)), bwabs(mkstate(gs0, lsf0, pcf0), durqs), fininvdeq(pcf), ¬ 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-tau (previous step) (back to tree)

DQInv(gs, lsf, pcf), bwabs(mkstate(gs0, lsf0, pcf0), durqs), fininvdeq(pcf), ¬ bwabs(mkstate(gs, lsf, pcf), durqs), (∃ tid. ca = CheckEmp(tid) ⊃ (durqs.pcf(ca.tid) = resDeq ⊃ ADoDeq(ca.tid);τ);bwabsa(ca)) = τ, (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))) ) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 5

Additional information

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

(durqs.pcf(ca.tid) = resDeq ⊃ ADoDeq(ca.tid);τ) = τ, DQInv(gs, lsf, pcf), bwabs(mkstate(gs0, lsf0, pcf0), durqs), fininvdeq(pcf), ¬ bwabs(mkstate(gs, lsf, pcf), durqs), (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) ⊦

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) ⊦ CheckEmp(tid) ≠ globalCrash; (s) ⊦ ADoDeq(tid) ≠ τ; (s) ⊦ CheckEmp(tid).tid = tid; (s)

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

durqs.pcf(tid0) ≠ resDeq, DQInv(gs, lsf, pcf), 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)))), durqs), fininvdeq(pcf), pre(gs, lsf(tid), pcf(tid), CheckEmp(tid0)), ¬ bwabs(mkstate(gs, lsf, pcf), durqs) ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

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

Additional information

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

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

durqs = mkstate(ags, alsf, apcf), apcf(tid0) ≠ resDeq, DQInv(gs, lsf, pcf), 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)))), durqs), fininvdeq(pcf), pre(gs, lsf(tid), pcf(tid), CheckEmp(tid0)), ¬ bwabs(mkstate(gs, lsf, pcf), durqs) ⊦

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

apcf(tid0) ≠ resDeq, DQInv(gs, lsf, pcf), 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(mkdgs(gstepf(gs, lsf(tid), pcf(tid), CheckEmp(tid0)).queue), alsf, apcf)), fininvdeq(pcf), pre(gs, lsf(tid), pcf(tid), CheckEmp(tid0)) ⊦ gstepf(gs, lsf(tid), pcf(tid), CheckEmp(tid0)).queue = gs.queue ∧ ( alsf(tid1) = mkls ((tid = tid1 ⊃ lstepf(gs, lsf(tid1), pcf(tid1), CheckEmp(tid0));lsf(tid1)).tid, (tid = tid1 ⊃ lstepf(gs, lsf(tid1), pcf(tid1), CheckEmp(tid0));lsf(tid1)).ival, (tid = tid1 ⊃ lstepf(gs, lsf(tid1), pcf(tid1), CheckEmp(tid0));lsf(tid1)).oval, (tid = tid1 ⊃ lstepf(gs, lsf(tid1), pcf(tid1), CheckEmp(tid0));lsf(tid1)).value, (tid = tid1 ⊃ lstepf(gs, lsf(tid1), pcf(tid1), CheckEmp(tid0));lsf(tid1)).optval) ∧ apcf(tid1) = bwabspcf((tid = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), CheckEmp(tid0));pcf(tid1))) ∨ alsf(tid1) = mkls ((tid = tid1 ⊃ lstepf(gs, lsf(tid1), pcf(tid1), CheckEmp(tid0));lsf(tid1)).tid, (tid = tid1 ⊃ lstepf(gs, lsf(tid1), pcf(tid1), CheckEmp(tid0));lsf(tid1)).ival, Empty, (tid = tid1 ⊃ lstepf(gs, lsf(tid1), pcf(tid1), CheckEmp(tid0));lsf(tid1)).value, (tid = tid1 ⊃ lstepf(gs, lsf(tid1), pcf(tid1), CheckEmp(tid0));lsf(tid1)).optval) ∧ (tid = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), CheckEmp(tid0));pcf(tid1)) = invDeq ∧ apcf(tid1) = resDeq ∧ (tid = tid1 ⊃ lstepf(gs, lsf(tid1), pcf(tid1), CheckEmp(tid0));lsf(tid1)).obsEmpty → alsf(tid1) = mkls(lsf(tid1).tid, lsf(tid1).ival, lsf(tid1).oval, lsf(tid1).value, lsf(tid1).optval) ∧ apcf(tid1) = bwabspcf(pcf(tid1)) ∨ alsf(tid1) = mkls(lsf(tid1).tid, lsf(tid1).ival, Empty, lsf(tid1).value, lsf(tid1).optval) ∧ pcf(tid1) = invDeq ∧ apcf(tid1) = resDeq ∧ lsf(tid1).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 8 from proof bwsim-step-tau (previous step) (back to tree)

gs = mkgs(queue), apcf(tid0) ≠ resDeq, DQInv(gs, lsf, pcf), 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(mkdgs(gstepf(gs, lsf(tid), pcf(tid), CheckEmp(tid0)).queue), alsf, apcf)), fininvdeq(pcf), pre(gs, lsf(tid), pcf(tid), CheckEmp(tid0)) ⊦ gstepf(gs, lsf(tid), pcf(tid), CheckEmp(tid0)).queue = queue ∧ ( alsf(tid1) = mkls ((tid = tid1 ⊃ lstepf(gs, lsf(tid1), pcf(tid1), CheckEmp(tid0));lsf(tid1)).tid, (tid = tid1 ⊃ lstepf(gs, lsf(tid1), pcf(tid1), CheckEmp(tid0));lsf(tid1)).ival, (tid = tid1 ⊃ lstepf(gs, lsf(tid1), pcf(tid1), CheckEmp(tid0));lsf(tid1)).oval, (tid = tid1 ⊃ lstepf(gs, lsf(tid1), pcf(tid1), CheckEmp(tid0));lsf(tid1)).value, (tid = tid1 ⊃ lstepf(gs, lsf(tid1), pcf(tid1), CheckEmp(tid0));lsf(tid1)).optval) ∧ apcf(tid1) = bwabspcf((tid = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), CheckEmp(tid0));pcf(tid1))) ∨ alsf(tid1) = mkls ((tid = tid1 ⊃ lstepf(gs, lsf(tid1), pcf(tid1), CheckEmp(tid0));lsf(tid1)).tid, (tid = tid1 ⊃ lstepf(gs, lsf(tid1), pcf(tid1), CheckEmp(tid0));lsf(tid1)).ival, Empty, (tid = tid1 ⊃ lstepf(gs, lsf(tid1), pcf(tid1), CheckEmp(tid0));lsf(tid1)).value, (tid = tid1 ⊃ lstepf(gs, lsf(tid1), pcf(tid1), CheckEmp(tid0));lsf(tid1)).optval) ∧ (tid = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), CheckEmp(tid0));pcf(tid1)) = invDeq ∧ apcf(tid1) = resDeq ∧ (tid = tid1 ⊃ lstepf(gs, lsf(tid1), pcf(tid1), CheckEmp(tid0));lsf(tid1)).obsEmpty → alsf(tid1) = mkls(lsf(tid1).tid, lsf(tid1).ival, lsf(tid1).oval, lsf(tid1).value, lsf(tid1).optval) ∧ apcf(tid1) = bwabspcf(pcf(tid1)) ∨ alsf(tid1) = mkls(lsf(tid1).tid, lsf(tid1).ival, Empty, lsf(tid1).value, lsf(tid1).optval) ∧ pcf(tid1) = invDeq ∧ apcf(tid1) = resDeq ∧ lsf(tid1).obsEmpty)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

apcf(tid0) ≠ resDeq, DQInv(mkgs(queue), lsf, pcf), bwabs (mkstate (gstepf(mkgs(queue), lsf(tid), pcf(tid), CheckEmp(tid0)), lsf(tid; lstepf(mkgs(queue), lsf(tid), pcf(tid), CheckEmp(tid0))), pcf(tid; pcstepf(mkgs(queue), lsf(tid), pcf(tid), CheckEmp(tid0)))), mkstate(mkdgs(gstepf(mkgs(queue), lsf(tid), pcf(tid), CheckEmp(tid0)).queue), alsf, apcf)), fininvdeq(pcf), pre(mkgs(queue), lsf(tid), pcf(tid), CheckEmp(tid0)) ⊦ gstepf(mkgs(queue), lsf(tid), pcf(tid), CheckEmp(tid0)).queue = queue ∧ ( alsf(tid1) = mkls ((tid = tid1 ⊃ lstepf(mkgs(queue), lsf(tid1), pcf(tid1), CheckEmp(tid0));lsf(tid1)).tid, (tid = tid1 ⊃ lstepf(mkgs(queue), lsf(tid1), pcf(tid1), CheckEmp(tid0));lsf(tid1)).ival, (tid = tid1 ⊃ lstepf(mkgs(queue), lsf(tid1), pcf(tid1), CheckEmp(tid0));lsf(tid1)).oval, (tid = tid1 ⊃ lstepf(mkgs(queue), lsf(tid1), pcf(tid1), CheckEmp(tid0));lsf(tid1)).value, (tid = tid1 ⊃ lstepf(mkgs(queue), lsf(tid1), pcf(tid1), CheckEmp(tid0));lsf(tid1)).optval) ∧ apcf(tid1) = bwabspcf((tid = tid1 ⊃ pcstepf(mkgs(queue), lsf(tid1), pcf(tid1), CheckEmp(tid0));pcf(tid1))) ∨ alsf(tid1) = mkls ((tid = tid1 ⊃ lstepf(mkgs(queue), lsf(tid1), pcf(tid1), CheckEmp(tid0));lsf(tid1)).tid, (tid = tid1 ⊃ lstepf(mkgs(queue), lsf(tid1), pcf(tid1), CheckEmp(tid0));lsf(tid1)).ival, Empty, (tid = tid1 ⊃ lstepf(mkgs(queue), lsf(tid1), pcf(tid1), CheckEmp(tid0));lsf(tid1)).value, (tid = tid1 ⊃ lstepf(mkgs(queue), lsf(tid1), pcf(tid1), CheckEmp(tid0));lsf(tid1)).optval) ∧ (tid = tid1 ⊃ pcstepf(mkgs(queue), lsf(tid1), pcf(tid1), CheckEmp(tid0));pcf(tid1)) = invDeq ∧ apcf(tid1) = resDeq ∧ (tid = tid1 ⊃ lstepf(mkgs(queue), lsf(tid1), pcf(tid1), CheckEmp(tid0));lsf(tid1)).obsEmpty → alsf(tid1) = mkls(lsf(tid1).tid, lsf(tid1).ival, lsf(tid1).oval, lsf(tid1).value, lsf(tid1).optval) ∧ apcf(tid1) = bwabspcf(pcf(tid1)) ∨ alsf(tid1) = mkls(lsf(tid1).tid, lsf(tid1).ival, Empty, lsf(tid1).value, lsf(tid1).optval) ∧ pcf(tid1) = invDeq ∧ apcf(tid1) = resDeq ∧ lsf(tid1).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] → [gstepf(mkgs(queue), lsf(tid), pcf(tid), CheckEmp(tid0)), queue0]

Additional information

Used simplifier rules: ⊦ queue = gs.queue ↔ gs = mkgs(queue); (elim) Used terms: gstepf(mkgs(queue), lsf(tid), pcf(tid), CheckEmp(tid0)), queue0

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

gstepf(mkgs(queue), lsf(tid), pcf(tid), CheckEmp(tid0)) = mkgs(queue0), apcf(tid0) ≠ resDeq, DQInv(mkgs(queue), lsf, pcf), bwabs (mkstate (gstepf(mkgs(queue), lsf(tid), pcf(tid), CheckEmp(tid0)), lsf(tid; lstepf(mkgs(queue), lsf(tid), pcf(tid), CheckEmp(tid0))), pcf(tid; pcstepf(mkgs(queue), lsf(tid), pcf(tid), CheckEmp(tid0)))), mkstate(mkdgs(queue0), alsf, apcf)), fininvdeq(pcf), pre(mkgs(queue), lsf(tid), pcf(tid), CheckEmp(tid0)) ⊦ queue0 = queue ∧ ( alsf(tid1) = mkls ((tid = tid1 ⊃ lstepf(mkgs(queue), lsf(tid1), pcf(tid1), CheckEmp(tid0));lsf(tid1)).tid, (tid = tid1 ⊃ lstepf(mkgs(queue), lsf(tid1), pcf(tid1), CheckEmp(tid0));lsf(tid1)).ival, (tid = tid1 ⊃ lstepf(mkgs(queue), lsf(tid1), pcf(tid1), CheckEmp(tid0));lsf(tid1)).oval, (tid = tid1 ⊃ lstepf(mkgs(queue), lsf(tid1), pcf(tid1), CheckEmp(tid0));lsf(tid1)).value, (tid = tid1 ⊃ lstepf(mkgs(queue), lsf(tid1), pcf(tid1), CheckEmp(tid0));lsf(tid1)).optval) ∧ apcf(tid1) = bwabspcf((tid = tid1 ⊃ pcstepf(mkgs(queue), lsf(tid1), pcf(tid1), CheckEmp(tid0));pcf(tid1))) ∨ alsf(tid1) = mkls ((tid = tid1 ⊃ lstepf(mkgs(queue), lsf(tid1), pcf(tid1), CheckEmp(tid0));lsf(tid1)).tid, (tid = tid1 ⊃ lstepf(mkgs(queue), lsf(tid1), pcf(tid1), CheckEmp(tid0));lsf(tid1)).ival, Empty, (tid = tid1 ⊃ lstepf(mkgs(queue), lsf(tid1), pcf(tid1), CheckEmp(tid0));lsf(tid1)).value, (tid = tid1 ⊃ lstepf(mkgs(queue), lsf(tid1), pcf(tid1), CheckEmp(tid0));lsf(tid1)).optval) ∧ (tid = tid1 ⊃ pcstepf(mkgs(queue), lsf(tid1), pcf(tid1), CheckEmp(tid0));pcf(tid1)) = invDeq ∧ apcf(tid1) = resDeq ∧ (tid = tid1 ⊃ lstepf(mkgs(queue), lsf(tid1), pcf(tid1), CheckEmp(tid0));lsf(tid1)).obsEmpty → alsf(tid1) = mkls(lsf(tid1).tid, lsf(tid1).ival, lsf(tid1).oval, lsf(tid1).value, lsf(tid1).optval) ∧ apcf(tid1) = bwabspcf(pcf(tid1)) ∨ alsf(tid1) = mkls(lsf(tid1).tid, lsf(tid1).ival, Empty, lsf(tid1).value, lsf(tid1).optval) ∧ pcf(tid1) = invDeq ∧ apcf(tid1) = resDeq ∧ lsf(tid1).obsEmpty)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

gstepf(mkgs(queue), lsf(tid), pcf(tid), CheckEmp(tid0)) = mkgs(queue0), apcf(tid0) ≠ resDeq, DQInv(mkgs(queue), lsf, pcf), bwabs (mkstate (mkgs(queue0), lsf(tid; lstepf(mkgs(queue), lsf(tid), pcf(tid), CheckEmp(tid0))), pcf(tid; pcstepf(mkgs(queue), lsf(tid), pcf(tid), CheckEmp(tid0)))), mkstate(mkdgs(queue0), alsf, apcf)), fininvdeq(pcf), pre(mkgs(queue), lsf(tid), pcf(tid), CheckEmp(tid0)) ⊦ queue0 = queue ∧ ( alsf(tid1) = mkls ((tid = tid1 ⊃ lstepf(mkgs(queue), lsf(tid1), pcf(tid1), CheckEmp(tid0));lsf(tid1)).tid, (tid = tid1 ⊃ lstepf(mkgs(queue), lsf(tid1), pcf(tid1), CheckEmp(tid0));lsf(tid1)).ival, (tid = tid1 ⊃ lstepf(mkgs(queue), lsf(tid1), pcf(tid1), CheckEmp(tid0));lsf(tid1)).oval, (tid = tid1 ⊃ lstepf(mkgs(queue), lsf(tid1), pcf(tid1), CheckEmp(tid0));lsf(tid1)).value, (tid = tid1 ⊃ lstepf(mkgs(queue), lsf(tid1), pcf(tid1), CheckEmp(tid0));lsf(tid1)).optval) ∧ apcf(tid1) = bwabspcf((tid = tid1 ⊃ pcstepf(mkgs(queue), lsf(tid1), pcf(tid1), CheckEmp(tid0));pcf(tid1))) ∨ alsf(tid1) = mkls ((tid = tid1 ⊃ lstepf(mkgs(queue), lsf(tid1), pcf(tid1), CheckEmp(tid0));lsf(tid1)).tid, (tid = tid1 ⊃ lstepf(mkgs(queue), lsf(tid1), pcf(tid1), CheckEmp(tid0));lsf(tid1)).ival, Empty, (tid = tid1 ⊃ lstepf(mkgs(queue), lsf(tid1), pcf(tid1), CheckEmp(tid0));lsf(tid1)).value, (tid = tid1 ⊃ lstepf(mkgs(queue), lsf(tid1), pcf(tid1), CheckEmp(tid0));lsf(tid1)).optval) ∧ (tid = tid1 ⊃ pcstepf(mkgs(queue), lsf(tid1), pcf(tid1), CheckEmp(tid0));pcf(tid1)) = invDeq ∧ apcf(tid1) = resDeq ∧ (tid = tid1 ⊃ lstepf(mkgs(queue), lsf(tid1), pcf(tid1), CheckEmp(tid0));lsf(tid1)).obsEmpty → alsf(tid1) = mkls(lsf(tid1).tid, lsf(tid1).ival, lsf(tid1).oval, lsf(tid1).value, lsf(tid1).optval) ∧ apcf(tid1) = bwabspcf(pcf(tid1)) ∨ alsf(tid1) = mkls(lsf(tid1).tid, lsf(tid1).ival, Empty, lsf(tid1).value, lsf(tid1).optval) ∧ pcf(tid1) = invDeq ∧ apcf(tid1) = resDeq ∧ lsf(tid1).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, (tid = tid1 ⊃ lstepf(mkgs(queue), lsf(tid1), pcf(tid1), CheckEmp(tid0)) ;lsf(tid1) ), optval, tid2, 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, (tid = tid1 ⊃ lstepf(mkgs(queue), lsf(tid1), pcf(tid1), CheckEmp(tid0)) ;lsf(tid1) ), oval, tid2, optval

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

(tid = tid1 ⊃ lstepf(mkgs(queue), lsf(tid1), pcf(tid1), CheckEmp(tid0));lsf(tid1)) = mkls(tid2, obsEmpty, val, optval, val0, optval0), gstepf(mkgs(queue), lsf(tid), pcf(tid), CheckEmp(tid0)) = mkgs(queue0), apcf(tid0) ≠ resDeq, DQInv(mkgs(queue), lsf, pcf), bwabs (mkstate (mkgs(queue0), lsf(tid; lstepf(mkgs(queue), lsf(tid), pcf(tid), CheckEmp(tid0))), pcf(tid; pcstepf(mkgs(queue), lsf(tid), pcf(tid), CheckEmp(tid0)))), mkstate(mkdgs(queue0), alsf, apcf)), fininvdeq(pcf), pre(mkgs(queue), lsf(tid), pcf(tid), CheckEmp(tid0)) ⊦ queue0 = queue ∧ ( alsf(tid1) = mkls(tid2, val, optval, val0, optval0) ∧ apcf(tid1) = bwabspcf((tid = tid1 ⊃ pcstepf(mkgs(queue), lsf(tid1), pcf(tid1), CheckEmp(tid0));pcf(tid1))) ∨ alsf(tid1) = mkls(tid2, val, Empty, val0, optval0) ∧ (tid = tid1 ⊃ pcstepf(mkgs(queue), lsf(tid1), pcf(tid1), CheckEmp(tid0));pcf(tid1)) = invDeq ∧ apcf(tid1) = resDeq ∧ obsEmpty → alsf(tid1) = mkls(lsf(tid1).tid, lsf(tid1).ival, lsf(tid1).oval, lsf(tid1).value, lsf(tid1).optval) ∧ apcf(tid1) = bwabspcf(pcf(tid1)) ∨ alsf(tid1) = mkls(lsf(tid1).tid, lsf(tid1).ival, Empty, lsf(tid1).value, lsf(tid1).optval) ∧ pcf(tid1) = invDeq ∧ apcf(tid1) = resDeq ∧ lsf(tid1).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, lsf(tid1), 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(tid1), oval, tid3, optval1

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

(tid = tid1 ⊃ lstepf(mkgs(queue), lsf(tid1), pcf(tid1), CheckEmp(tid0));lsf(tid1)) = mkls(tid2, obsEmpty, val, optval, val0, optval0), gstepf(mkgs(queue), lsf(tid), pcf(tid), CheckEmp(tid0)) = mkgs(queue0), lsf(tid1) = mkls(tid3, obsEmpty0, val1, optval1, val2, optval2), apcf(tid0) ≠ resDeq, DQInv(mkgs(queue), lsf, pcf), bwabs (mkstate (mkgs(queue0), lsf(tid; lstepf(mkgs(queue), lsf(tid), pcf(tid), CheckEmp(tid0))), pcf(tid; pcstepf(mkgs(queue), lsf(tid), pcf(tid), CheckEmp(tid0)))), mkstate(mkdgs(queue0), alsf, apcf)), fininvdeq(pcf), pre(mkgs(queue), lsf(tid), pcf(tid), CheckEmp(tid0)) ⊦ queue0 = queue ∧ ( alsf(tid1) = mkls(tid2, val, optval, val0, optval0) ∧ apcf(tid1) = bwabspcf((tid = tid1 ⊃ pcstepf(mkgs(queue), lsf(tid1), pcf(tid1), CheckEmp(tid0));pcf(tid1))) ∨ alsf(tid1) = mkls(tid2, val, Empty, val0, optval0) ∧ (tid = tid1 ⊃ pcstepf(mkgs(queue), lsf(tid1), pcf(tid1), CheckEmp(tid0));pcf(tid1)) = invDeq ∧ apcf(tid1) = resDeq ∧ obsEmpty → alsf(tid1) = mkls(tid3, val1, optval1, val2, optval2) ∧ apcf(tid1) = bwabspcf(pcf(tid1)) ∨ alsf(tid1) = mkls(tid3, val1, Empty, val2, optval2) ∧ pcf(tid1) = invDeq ∧ apcf(tid1) = resDeq ∧ obsEmpty0)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

(tid = tid1 ⊃ lstepf(mkgs(queue), mkls(tid3, obsEmpty0, val1, optval1, val2, optval2), pcf(tid1), CheckEmp(tid0)) ;mkls(tid3, obsEmpty0, val1, optval1, val2, optval2) ) = mkls(tid2, obsEmpty, val, optval, val0, optval0), gstepf(mkgs(queue), lsf(tid), pcf(tid), CheckEmp(tid0)) = mkgs(queue0), lsf(tid1) = mkls(tid3, obsEmpty0, val1, optval1, val2, optval2), apcf(tid0) ≠ resDeq, DQInv(mkgs(queue), lsf, pcf), bwabs (mkstate (mkgs(queue0), lsf(tid; lstepf(mkgs(queue), lsf(tid), pcf(tid), CheckEmp(tid0))), pcf(tid; pcstepf(mkgs(queue), lsf(tid), pcf(tid), CheckEmp(tid0)))), mkstate(mkdgs(queue0), alsf, apcf)), fininvdeq(pcf), pre(mkgs(queue), lsf(tid), pcf(tid), CheckEmp(tid0)) ⊦ queue0 = queue ∧ ( alsf(tid1) = mkls(tid2, val, optval, val0, optval0) ∧ apcf(tid1) = bwabspcf((tid = tid1 ⊃ pcstepf(mkgs(queue), mkls(tid3, obsEmpty0, val1, optval1, val2, optval2), pcf(tid1), CheckEmp(tid0));pcf(tid1))) ∨ alsf(tid1) = mkls(tid2, val, Empty, val0, optval0) ∧ (tid = tid1 ⊃ pcstepf(mkgs(queue), mkls(tid3, obsEmpty0, val1, optval1, val2, optval2), pcf(tid1), CheckEmp(tid0));pcf(tid1)) = invDeq ∧ apcf(tid1) = resDeq ∧ obsEmpty → alsf(tid1) = mkls(tid3, val1, optval1, val2, optval2) ∧ apcf(tid1) = bwabspcf(pcf(tid1)) ∨ alsf(tid1) = mkls(tid3, val1, Empty, val2, optval2) ∧ pcf(tid1) = invDeq ∧ apcf(tid1) = resDeq ∧ obsEmpty0)

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 15 from proof bwsim-step-tau (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 16 from proof bwsim-step-tau (previous step) (back to tree)

(tid = tid1 ⊃ lstepf(mkgs(queue), mkls(tid3, obsEmpty0, val1, optval1, val2, optval2), pcf(tid1), CheckEmp(tid0)) ;mkls(tid3, obsEmpty0, val1, optval1, val2, optval2) ) = mkls(tid2, obsEmpty, val, optval, val0, optval0), gstepf(mkgs(queue), lsf(tid), pcf(tid), CheckEmp(tid0)) = mkgs(queue0), lsf(tid1) = mkls(tid3, obsEmpty0, val1, optval1, val2, optval2), apcf(tid0) ≠ resDeq, DQGInv(mkgs(queue)), bwabs (mkstate (mkgs(queue0), lsf(tid; lstepf(mkgs(queue), lsf(tid), pcf(tid), CheckEmp(tid0))), pcf(tid; pcstepf(mkgs(queue), lsf(tid), pcf(tid), CheckEmp(tid0)))), mkstate(mkdgs(queue0), alsf, apcf)), fininvdeq(pcf), pre(mkgs(queue), lsf(tid), pcf(tid), CheckEmp(tid0)), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦ queue0 = queue ∧ ( alsf(tid1) = mkls(tid2, val, optval, val0, optval0) ∧ apcf(tid1) = bwabspcf((tid = tid1 ⊃ pcstepf(mkgs(queue), mkls(tid3, obsEmpty0, val1, optval1, val2, optval2), pcf(tid1), CheckEmp(tid0));pcf(tid1))) ∨ alsf(tid1) = mkls(tid2, val, Empty, val0, optval0) ∧ (tid = tid1 ⊃ pcstepf(mkgs(queue), mkls(tid3, obsEmpty0, val1, optval1, val2, optval2), pcf(tid1), CheckEmp(tid0));pcf(tid1)) = invDeq ∧ apcf(tid1) = resDeq ∧ obsEmpty → alsf(tid1) = mkls(tid3, val1, optval1, val2, optval2) ∧ apcf(tid1) = bwabspcf(pcf(tid1)) ∨ alsf(tid1) = mkls(tid3, val1, Empty, val2, optval2) ∧ pcf(tid1) = invDeq ∧ apcf(tid1) = resDeq ∧ obsEmpty0)

User applied rule all left

And obtained the following new goals

Rule argument

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

Additional information

Used terms: tid1

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

lsf(tid1).tid = tid1, (tid = tid1 ⊃ lstepf(mkgs(queue), mkls(tid3, obsEmpty0, val1, optval1, val2, optval2), pcf(tid1), CheckEmp(tid0)) ;mkls(tid3, obsEmpty0, val1, optval1, val2, optval2) ) = mkls(tid2, obsEmpty, val, optval, val0, optval0), gstepf(mkgs(queue), lsf(tid), pcf(tid), CheckEmp(tid0)) = mkgs(queue0), lsf(tid1) = mkls(tid3, obsEmpty0, val1, optval1, val2, optval2), apcf(tid0) ≠ resDeq, DQGInv(mkgs(queue)), DQLInv(mkgs(queue), lsf(tid1), pcf(tid1)), bwabs (mkstate (mkgs(queue0), lsf(tid; lstepf(mkgs(queue), lsf(tid), pcf(tid), CheckEmp(tid0))), pcf(tid; pcstepf(mkgs(queue), lsf(tid), pcf(tid), CheckEmp(tid0)))), mkstate(mkdgs(queue0), alsf, apcf)), fininvdeq(pcf), pre(mkgs(queue), lsf(tid), pcf(tid), CheckEmp(tid0)), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦ queue0 = queue ∧ ( alsf(tid1) = mkls(tid2, val, optval, val0, optval0) ∧ apcf(tid1) = bwabspcf((tid = tid1 ⊃ pcstepf(mkgs(queue), mkls(tid3, obsEmpty0, val1, optval1, val2, optval2), pcf(tid1), CheckEmp(tid0));pcf(tid1))) ∨ alsf(tid1) = mkls(tid2, val, Empty, val0, optval0) ∧ (tid = tid1 ⊃ pcstepf(mkgs(queue), mkls(tid3, obsEmpty0, val1, optval1, val2, optval2), pcf(tid1), CheckEmp(tid0));pcf(tid1)) = invDeq ∧ apcf(tid1) = resDeq ∧ obsEmpty → alsf(tid1) = mkls(tid3, val1, optval1, val2, optval2) ∧ apcf(tid1) = bwabspcf(pcf(tid1)) ∨ alsf(tid1) = mkls(tid3, val1, Empty, val2, optval2) ∧ pcf(tid1) = invDeq ∧ apcf(tid1) = resDeq ∧ obsEmpty0)

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

(tid = tid3 ⊃ lstepf(mkgs(queue), mkls(tid3, obsEmpty0, val1, optval1, val2, optval2), pcf(tid3), CheckEmp(tid0)) ;mkls(tid3, obsEmpty0, val1, optval1, val2, optval2) ) = mkls(tid2, obsEmpty, val, optval, val0, optval0), gstepf(mkgs(queue), lsf(tid), pcf(tid), CheckEmp(tid0)) = mkgs(queue0), lsf(tid3) = mkls(tid3, obsEmpty0, val1, optval1, val2, optval2), apcf(tid0) ≠ resDeq, DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid3, obsEmpty0, val1, optval1, val2, optval2), pcf(tid3)), bwabs (mkstate (mkgs(queue0), lsf(tid; lstepf(mkgs(queue), lsf(tid), pcf(tid), CheckEmp(tid0))), pcf(tid; pcstepf(mkgs(queue), lsf(tid), pcf(tid), CheckEmp(tid0)))), mkstate(mkdgs(queue0), alsf, apcf)), fininvdeq(pcf), pre(mkgs(queue), lsf(tid), pcf(tid), CheckEmp(tid0)), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦ queue0 = queue ∧ ( alsf(tid3) = mkls(tid2, val, optval, val0, optval0) ∧ apcf(tid3) = bwabspcf((tid = tid3 ⊃ pcstepf(mkgs(queue), mkls(tid3, obsEmpty0, val1, optval1, val2, optval2), pcf(tid3), CheckEmp(tid0));pcf(tid3))) ∨ alsf(tid3) = mkls(tid2, val, Empty, val0, optval0) ∧ (tid = tid3 ⊃ pcstepf(mkgs(queue), mkls(tid3, obsEmpty0, val1, optval1, val2, optval2), pcf(tid3), CheckEmp(tid0));pcf(tid3)) = invDeq ∧ apcf(tid3) = resDeq ∧ obsEmpty → alsf(tid3) = mkls(tid3, val1, optval1, val2, optval2) ∧ apcf(tid3) = bwabspcf(pcf(tid3)) ∨ alsf(tid3) = mkls(tid3, val1, Empty, val2, optval2) ∧ pcf(tid3) = invDeq ∧ apcf(tid3) = resDeq ∧ obsEmpty0)

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) ⊦ mkgs(queue) = mkgs(queue0) ↔ queue = queue0; (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 19 from proof bwsim-step-tau (previous step) (back to tree)

(tid = tid3 ⊃ lstepf(mkgs(queue), mkls(tid3, obsEmpty0, val1, optval1, val2, optval2), pcf(tid3), CheckEmp(tid0)) ;mkls(tid3, obsEmpty0, val1, optval1, val2, optval2) ) = mkls(tid2, obsEmpty, val, optval, val0, optval0), gstepf(mkgs(queue), lsf(tid), pcf(tid), CheckEmp(tid0)) = mkgs(queue0), invDeq = pcf(tid), lsf(tid3) = mkls(tid3, obsEmpty0, val1, optval1, val2, optval2), apcf(tid0) ≠ resDeq, DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid3, obsEmpty0, val1, optval1, val2, optval2), pcf(tid3)), bwabs (mkstate (mkgs(queue0), lsf(tid; lstepf(mkgs(queue), lsf(tid), pcf(tid), CheckEmp(tid0))), pcf(tid; pcstepf(mkgs(queue), lsf(tid), pcf(tid), CheckEmp(tid0)))), mkstate(mkdgs(queue0), alsf, apcf)), fininvdeq(pcf), pre(mkgs(queue), lsf(tid), pcf(tid), CheckEmp(tid0)), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦ queue0 = queue ∧ ( alsf(tid3) = mkls(tid2, val, optval, val0, optval0) ∧ apcf(tid3) = bwabspcf((tid = tid3 ⊃ pcstepf(mkgs(queue), mkls(tid3, obsEmpty0, val1, optval1, val2, optval2), pcf(tid3), CheckEmp(tid0));pcf(tid3))) ∨ alsf(tid3) = mkls(tid2, val, Empty, val0, optval0) ∧ (tid = tid3 ⊃ pcstepf(mkgs(queue), mkls(tid3, obsEmpty0, val1, optval1, val2, optval2), pcf(tid3), CheckEmp(tid0));pcf(tid3)) = invDeq ∧ apcf(tid3) = resDeq ∧ obsEmpty → alsf(tid3) = mkls(tid3, val1, optval1, val2, optval2) ∧ apcf(tid3) = bwabspcf(pcf(tid3)) ∨ alsf(tid3) = mkls(tid3, val1, Empty, val2, optval2) ∧ pcf(tid3) = invDeq ∧ apcf(tid3) = resDeq ∧ obsEmpty0)

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) ⊦ pcstepf(gs, ls, invDeq, CheckEmp(ls.tid)) = invDeq; (s) ⊦ lstepf(gs, ls, invDeq, CheckEmp(ls.tid)) = ls.obsEmpty:= true; (s) ⊦ mkgs(queue) = mkgs(queue0) ↔ queue = queue0; (s) ⊦ gstepf(gs, ls, invDeq, CheckEmp(ls.tid)) = gs; (s) ⊦ CheckEmp(tid) ≠ DoDeq(tid0); (s) ⊦ CheckEmp(tid) ≠ DoDeqEmpty(tid0); (s) ⊦ mkgs(queue).queue = queue; (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 20 from proof bwsim-step-tau (previous step) (back to tree)

(tid = tid3 ⊃ lstepf(mkgs([]), mkls(tid3, obsEmpty0, val1, optval1, val2, optval2), pcf(tid3), CheckEmp(tid3)) ;mkls(tid3, obsEmpty0, val1, optval1, val2, optval2) ) = mkls(tid2, obsEmpty, val, optval, val0, optval0), invDeq = pcf(tid), lsf(tid3) = mkls(tid3, obsEmpty0, val1, optval1, val2, optval2), apcf(lsf(tid).tid) ≠ resDeq, DQGInv(mkgs([])), DQLInv(mkgs([]), mkls(tid3, obsEmpty0, val1, optval1, val2, optval2), pcf(tid3)), bwabs(mkstate(mkgs([]), lsf(tid; lsf(tid).obsEmpty:= true), pcf(tid; invDeq)), mkstate(mkdgs([]), alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs([]), lsf(tid), pcf(tid)), alsf(tid3) = mkls(tid2, val, optval, val0, optval0) ∧ apcf(tid3) = bwabspcf((tid = tid3 ⊃ pcstepf(mkgs([]), mkls(tid3, obsEmpty0, val1, optval1, val2, optval2), pcf(tid3), CheckEmp(tid3));pcf(tid3))) ∨ alsf(tid3) = mkls(tid2, val, Empty, val0, optval0) ∧ (tid = tid3 ⊃ pcstepf(mkgs([]), mkls(tid3, obsEmpty0, val1, optval1, val2, optval2), pcf(tid3), CheckEmp(tid3));pcf(tid3)) = invDeq ∧ apcf(tid3) = resDeq ∧ obsEmpty ⊦ alsf(tid3) = mkls(tid3, val1, Empty, val2, optval2) ∧ pcf(tid3) = invDeq ∧ apcf(tid3) = resDeq ∧ obsEmpty0, alsf(tid3) = mkls(tid3, val1, optval1, val2, optval2) ∧ apcf(tid3) = bwabspcf(pcf(tid3))

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, tid0, 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, tid0, optval3

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

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

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

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

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

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

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

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

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) ⊦ pcstepf (gs, mkls(tid, obsEmpty, ival, oval, value, optval), invDeq, CheckEmp(tid)) = invDeq; (s) ⊦ lstepf (gs, mkls(tid, obsEmpty, ival, oval, value, optval), invDeq, CheckEmp(tid)) = mkls(tid, true, ival, oval, value, optval); (s) ⊦ mkls(tid, ival, oval, ival0, oval0) = mkls(tid0, ival1, oval1, ival2, oval2) ↔ tid = tid0 ∧ ival = ival1 ∧ oval = oval1 ∧ ival0 = ival2 ∧ oval0 = oval2; (ws) ⊦ bwabspcf(invDeq) = invDeq; (s)

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

bwabsa(ca) = τ, DQInv(gs, lsf, pcf), bwabs(mkstate(gs0, lsf0, pcf0), durqs), fininvdeq(pcf), ¬ bwabs(mkstate(gs, lsf, pcf), durqs), (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) ⊦

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) ⊦ globalACrash ≠ τ; (s) ⊦ bwabsa(globalCrash) = globalACrash; (s)

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

bwabsa(ca) = τ, 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))), durqs), fininvdeq(pcf), pre(gs, lsf(tid), pcf(tid), ca), ¬ bwabs(mkstate(gs, lsf, pcf), durqs), ∀ tid. ca ≠ CheckEmp(tid) ⊦

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: durqs

Additional information

Used simplifier rules: DurQState freely generated by mkstate;;

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

bwabsa(ca) = τ, durqs = mkstate(ags, alsf, apcf), 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))), durqs), fininvdeq(pcf), pre(gs, lsf(tid), pcf(tid), ca), ¬ bwabs(mkstate(gs, lsf, pcf), durqs), ∀ tid. ca ≠ CheckEmp(tid) ⊦

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) ⊦ 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 28 from proof bwsim-step-tau (previous step) (back to tree)

bwabsa(ca) = τ, 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))), mkstate(mkdgs(gstepf(gs, lsf(tid), pcf(tid), ca).queue), alsf, apcf)), fininvdeq(pcf), pre(gs, lsf(tid), pcf(tid), ca), ∀ tid. ca ≠ CheckEmp(tid) ⊦ gstepf(gs, lsf(tid), pcf(tid), ca).queue = gs.queue ∧ ( alsf(tid0) = mkls ((tid = tid0 ⊃ lstepf(gs, lsf(tid0), pcf(tid0), ca);lsf(tid0)).tid, (tid = tid0 ⊃ lstepf(gs, lsf(tid0), pcf(tid0), ca);lsf(tid0)).ival, (tid = tid0 ⊃ lstepf(gs, lsf(tid0), pcf(tid0), ca);lsf(tid0)).oval, (tid = tid0 ⊃ lstepf(gs, lsf(tid0), pcf(tid0), ca);lsf(tid0)).value, (tid = tid0 ⊃ lstepf(gs, lsf(tid0), pcf(tid0), ca);lsf(tid0)).optval) ∧ apcf(tid0) = bwabspcf((tid = tid0 ⊃ pcstepf(gs, lsf(tid0), pcf(tid0), ca);pcf(tid0))) ∨ alsf(tid0) = mkls ((tid = tid0 ⊃ lstepf(gs, lsf(tid0), pcf(tid0), ca);lsf(tid0)).tid, (tid = tid0 ⊃ lstepf(gs, lsf(tid0), pcf(tid0), ca);lsf(tid0)).ival, Empty, (tid = tid0 ⊃ lstepf(gs, lsf(tid0), pcf(tid0), ca);lsf(tid0)).value, (tid = tid0 ⊃ lstepf(gs, lsf(tid0), pcf(tid0), ca);lsf(tid0)).optval) ∧ (tid = tid0 ⊃ pcstepf(gs, lsf(tid0), pcf(tid0), ca);pcf(tid0)) = invDeq ∧ apcf(tid0) = resDeq ∧ (tid = tid0 ⊃ lstepf(gs, lsf(tid0), pcf(tid0), ca);lsf(tid0)).obsEmpty → alsf(tid0) = mkls(lsf(tid0).tid, lsf(tid0).ival, lsf(tid0).oval, lsf(tid0).value, lsf(tid0).optval) ∧ apcf(tid0) = bwabspcf(pcf(tid0)) ∨ alsf(tid0) = mkls(lsf(tid0).tid, lsf(tid0).ival, Empty, lsf(tid0).value, lsf(tid0).optval) ∧ pcf(tid0) = invDeq ∧ apcf(tid0) = resDeq ∧ lsf(tid0).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 29 from proof bwsim-step-tau (previous step) (back to tree)

bwabsa(ca) = τ, gs = mkgs(queue), 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))), mkstate(mkdgs(gstepf(gs, lsf(tid), pcf(tid), ca).queue), alsf, apcf)), fininvdeq(pcf), pre(gs, lsf(tid), pcf(tid), ca), ∀ tid. ca ≠ CheckEmp(tid) ⊦ gstepf(gs, lsf(tid), pcf(tid), ca).queue = queue ∧ ( alsf(tid0) = mkls ((tid = tid0 ⊃ lstepf(gs, lsf(tid0), pcf(tid0), ca);lsf(tid0)).tid, (tid = tid0 ⊃ lstepf(gs, lsf(tid0), pcf(tid0), ca);lsf(tid0)).ival, (tid = tid0 ⊃ lstepf(gs, lsf(tid0), pcf(tid0), ca);lsf(tid0)).oval, (tid = tid0 ⊃ lstepf(gs, lsf(tid0), pcf(tid0), ca);lsf(tid0)).value, (tid = tid0 ⊃ lstepf(gs, lsf(tid0), pcf(tid0), ca);lsf(tid0)).optval) ∧ apcf(tid0) = bwabspcf((tid = tid0 ⊃ pcstepf(gs, lsf(tid0), pcf(tid0), ca);pcf(tid0))) ∨ alsf(tid0) = mkls ((tid = tid0 ⊃ lstepf(gs, lsf(tid0), pcf(tid0), ca);lsf(tid0)).tid, (tid = tid0 ⊃ lstepf(gs, lsf(tid0), pcf(tid0), ca);lsf(tid0)).ival, Empty, (tid = tid0 ⊃ lstepf(gs, lsf(tid0), pcf(tid0), ca);lsf(tid0)).value, (tid = tid0 ⊃ lstepf(gs, lsf(tid0), pcf(tid0), ca);lsf(tid0)).optval) ∧ (tid = tid0 ⊃ pcstepf(gs, lsf(tid0), pcf(tid0), ca);pcf(tid0)) = invDeq ∧ apcf(tid0) = resDeq ∧ (tid = tid0 ⊃ lstepf(gs, lsf(tid0), pcf(tid0), ca);lsf(tid0)).obsEmpty → alsf(tid0) = mkls(lsf(tid0).tid, lsf(tid0).ival, lsf(tid0).oval, lsf(tid0).value, lsf(tid0).optval) ∧ apcf(tid0) = bwabspcf(pcf(tid0)) ∨ alsf(tid0) = mkls(lsf(tid0).tid, lsf(tid0).ival, Empty, lsf(tid0).value, lsf(tid0).optval) ∧ pcf(tid0) = invDeq ∧ apcf(tid0) = resDeq ∧ lsf(tid0).obsEmpty)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

bwabsa(ca) = τ, ca ≠ globalCrash, DQInv(mkgs(queue), lsf, pcf), bwabs (mkstate (gstepf(mkgs(queue), lsf(tid), pcf(tid), ca), lsf(tid; lstepf(mkgs(queue), lsf(tid), pcf(tid), ca)), pcf(tid; pcstepf(mkgs(queue), lsf(tid), pcf(tid), ca))), mkstate(mkdgs(gstepf(mkgs(queue), lsf(tid), pcf(tid), ca).queue), alsf, apcf)), fininvdeq(pcf), pre(mkgs(queue), lsf(tid), pcf(tid), ca), ∀ tid. ca ≠ CheckEmp(tid) ⊦ gstepf(mkgs(queue), lsf(tid), pcf(tid), ca).queue = queue ∧ ( alsf(tid0) = mkls ((tid = tid0 ⊃ lstepf(mkgs(queue), lsf(tid0), pcf(tid0), ca);lsf(tid0)).tid, (tid = tid0 ⊃ lstepf(mkgs(queue), lsf(tid0), pcf(tid0), ca);lsf(tid0)).ival, (tid = tid0 ⊃ lstepf(mkgs(queue), lsf(tid0), pcf(tid0), ca);lsf(tid0)).oval, (tid = tid0 ⊃ lstepf(mkgs(queue), lsf(tid0), pcf(tid0), ca);lsf(tid0)).value, (tid = tid0 ⊃ lstepf(mkgs(queue), lsf(tid0), pcf(tid0), ca);lsf(tid0)).optval) ∧ apcf(tid0) = bwabspcf((tid = tid0 ⊃ pcstepf(mkgs(queue), lsf(tid0), pcf(tid0), ca);pcf(tid0))) ∨ alsf(tid0) = mkls ((tid = tid0 ⊃ lstepf(mkgs(queue), lsf(tid0), pcf(tid0), ca);lsf(tid0)).tid, (tid = tid0 ⊃ lstepf(mkgs(queue), lsf(tid0), pcf(tid0), ca);lsf(tid0)).ival, Empty, (tid = tid0 ⊃ lstepf(mkgs(queue), lsf(tid0), pcf(tid0), ca);lsf(tid0)).value, (tid = tid0 ⊃ lstepf(mkgs(queue), lsf(tid0), pcf(tid0), ca);lsf(tid0)).optval) ∧ (tid = tid0 ⊃ pcstepf(mkgs(queue), lsf(tid0), pcf(tid0), ca);pcf(tid0)) = invDeq ∧ apcf(tid0) = resDeq ∧ (tid = tid0 ⊃ lstepf(mkgs(queue), lsf(tid0), pcf(tid0), ca);lsf(tid0)).obsEmpty → alsf(tid0) = mkls(lsf(tid0).tid, lsf(tid0).ival, lsf(tid0).oval, lsf(tid0).value, lsf(tid0).optval) ∧ apcf(tid0) = bwabspcf(pcf(tid0)) ∨ alsf(tid0) = mkls(lsf(tid0).tid, lsf(tid0).ival, Empty, lsf(tid0).value, lsf(tid0).optval) ∧ pcf(tid0) = invDeq ∧ apcf(tid0) = resDeq ∧ lsf(tid0).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] → [gstepf(mkgs(queue), lsf(tid), pcf(tid), ca), queue0]

Additional information

Used simplifier rules: ⊦ queue = gs.queue ↔ gs = mkgs(queue); (elim) Used terms: gstepf(mkgs(queue), lsf(tid), pcf(tid), ca), queue0

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

bwabsa(ca) = τ, gstepf(mkgs(queue), lsf(tid), pcf(tid), ca) = mkgs(queue0), ca ≠ globalCrash, DQInv(mkgs(queue), lsf, pcf), bwabs (mkstate (gstepf(mkgs(queue), lsf(tid), pcf(tid), ca), lsf(tid; lstepf(mkgs(queue), lsf(tid), pcf(tid), ca)), pcf(tid; pcstepf(mkgs(queue), lsf(tid), pcf(tid), ca))), mkstate(mkdgs(queue0), alsf, apcf)), fininvdeq(pcf), pre(mkgs(queue), lsf(tid), pcf(tid), ca), ∀ tid. ca ≠ CheckEmp(tid) ⊦ queue0 = queue ∧ ( alsf(tid0) = mkls ((tid = tid0 ⊃ lstepf(mkgs(queue), lsf(tid0), pcf(tid0), ca);lsf(tid0)).tid, (tid = tid0 ⊃ lstepf(mkgs(queue), lsf(tid0), pcf(tid0), ca);lsf(tid0)).ival, (tid = tid0 ⊃ lstepf(mkgs(queue), lsf(tid0), pcf(tid0), ca);lsf(tid0)).oval, (tid = tid0 ⊃ lstepf(mkgs(queue), lsf(tid0), pcf(tid0), ca);lsf(tid0)).value, (tid = tid0 ⊃ lstepf(mkgs(queue), lsf(tid0), pcf(tid0), ca);lsf(tid0)).optval) ∧ apcf(tid0) = bwabspcf((tid = tid0 ⊃ pcstepf(mkgs(queue), lsf(tid0), pcf(tid0), ca);pcf(tid0))) ∨ alsf(tid0) = mkls ((tid = tid0 ⊃ lstepf(mkgs(queue), lsf(tid0), pcf(tid0), ca);lsf(tid0)).tid, (tid = tid0 ⊃ lstepf(mkgs(queue), lsf(tid0), pcf(tid0), ca);lsf(tid0)).ival, Empty, (tid = tid0 ⊃ lstepf(mkgs(queue), lsf(tid0), pcf(tid0), ca);lsf(tid0)).value, (tid = tid0 ⊃ lstepf(mkgs(queue), lsf(tid0), pcf(tid0), ca);lsf(tid0)).optval) ∧ (tid = tid0 ⊃ pcstepf(mkgs(queue), lsf(tid0), pcf(tid0), ca);pcf(tid0)) = invDeq ∧ apcf(tid0) = resDeq ∧ (tid = tid0 ⊃ lstepf(mkgs(queue), lsf(tid0), pcf(tid0), ca);lsf(tid0)).obsEmpty → alsf(tid0) = mkls(lsf(tid0).tid, lsf(tid0).ival, lsf(tid0).oval, lsf(tid0).value, lsf(tid0).optval) ∧ apcf(tid0) = bwabspcf(pcf(tid0)) ∨ alsf(tid0) = mkls(lsf(tid0).tid, lsf(tid0).ival, Empty, lsf(tid0).value, lsf(tid0).optval) ∧ pcf(tid0) = invDeq ∧ apcf(tid0) = resDeq ∧ lsf(tid0).obsEmpty)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

bwabsa(ca) = τ, gstepf(mkgs(queue), lsf(tid), pcf(tid), ca) = mkgs(queue0), ca ≠ globalCrash, DQInv(mkgs(queue), lsf, pcf), bwabs (mkstate(mkgs(queue0), lsf(tid; lstepf(mkgs(queue), lsf(tid), pcf(tid), ca)), pcf(tid; pcstepf(mkgs(queue), lsf(tid), pcf(tid), ca))), mkstate(mkdgs(queue0), alsf, apcf)), fininvdeq(pcf), pre(mkgs(queue), lsf(tid), pcf(tid), ca), ∀ tid. ca ≠ CheckEmp(tid) ⊦ queue0 = queue ∧ ( alsf(tid0) = mkls ((tid = tid0 ⊃ lstepf(mkgs(queue), lsf(tid0), pcf(tid0), ca);lsf(tid0)).tid, (tid = tid0 ⊃ lstepf(mkgs(queue), lsf(tid0), pcf(tid0), ca);lsf(tid0)).ival, (tid = tid0 ⊃ lstepf(mkgs(queue), lsf(tid0), pcf(tid0), ca);lsf(tid0)).oval, (tid = tid0 ⊃ lstepf(mkgs(queue), lsf(tid0), pcf(tid0), ca);lsf(tid0)).value, (tid = tid0 ⊃ lstepf(mkgs(queue), lsf(tid0), pcf(tid0), ca);lsf(tid0)).optval) ∧ apcf(tid0) = bwabspcf((tid = tid0 ⊃ pcstepf(mkgs(queue), lsf(tid0), pcf(tid0), ca);pcf(tid0))) ∨ alsf(tid0) = mkls ((tid = tid0 ⊃ lstepf(mkgs(queue), lsf(tid0), pcf(tid0), ca);lsf(tid0)).tid, (tid = tid0 ⊃ lstepf(mkgs(queue), lsf(tid0), pcf(tid0), ca);lsf(tid0)).ival, Empty, (tid = tid0 ⊃ lstepf(mkgs(queue), lsf(tid0), pcf(tid0), ca);lsf(tid0)).value, (tid = tid0 ⊃ lstepf(mkgs(queue), lsf(tid0), pcf(tid0), ca);lsf(tid0)).optval) ∧ (tid = tid0 ⊃ pcstepf(mkgs(queue), lsf(tid0), pcf(tid0), ca);pcf(tid0)) = invDeq ∧ apcf(tid0) = resDeq ∧ (tid = tid0 ⊃ lstepf(mkgs(queue), lsf(tid0), pcf(tid0), ca);lsf(tid0)).obsEmpty → alsf(tid0) = mkls(lsf(tid0).tid, lsf(tid0).ival, lsf(tid0).oval, lsf(tid0).value, lsf(tid0).optval) ∧ apcf(tid0) = bwabspcf(pcf(tid0)) ∨ alsf(tid0) = mkls(lsf(tid0).tid, lsf(tid0).ival, Empty, lsf(tid0).value, lsf(tid0).optval) ∧ pcf(tid0) = invDeq ∧ apcf(tid0) = resDeq ∧ lsf(tid0).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, (tid = tid0 ⊃ lstepf(mkgs(queue), lsf(tid0), pcf(tid0), ca);lsf(tid0)), 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, (tid = tid0 ⊃ lstepf(mkgs(queue), lsf(tid0), pcf(tid0), ca);lsf(tid0)), oval, tid1, optval

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

(tid = tid0 ⊃ lstepf(mkgs(queue), lsf(tid0), pcf(tid0), ca);lsf(tid0)) = mkls(tid1, obsEmpty, val, optval, val0, optval0), bwabsa(ca) = τ, gstepf(mkgs(queue), lsf(tid), pcf(tid), ca) = mkgs(queue0), ca ≠ globalCrash, DQInv(mkgs(queue), lsf, pcf), bwabs (mkstate(mkgs(queue0), lsf(tid; lstepf(mkgs(queue), lsf(tid), pcf(tid), ca)), pcf(tid; pcstepf(mkgs(queue), lsf(tid), pcf(tid), ca))), mkstate(mkdgs(queue0), alsf, apcf)), fininvdeq(pcf), pre(mkgs(queue), lsf(tid), pcf(tid), ca), ∀ tid. ca ≠ CheckEmp(tid) ⊦ queue0 = queue ∧ ( alsf(tid0) = mkls(tid1, val, optval, val0, optval0) ∧ apcf(tid0) = bwabspcf((tid = tid0 ⊃ pcstepf(mkgs(queue), lsf(tid0), pcf(tid0), ca);pcf(tid0))) ∨ alsf(tid0) = mkls(tid1, val, Empty, val0, optval0) ∧ (tid = tid0 ⊃ pcstepf(mkgs(queue), lsf(tid0), pcf(tid0), ca);pcf(tid0)) = invDeq ∧ apcf(tid0) = resDeq ∧ obsEmpty → alsf(tid0) = mkls(lsf(tid0).tid, lsf(tid0).ival, lsf(tid0).oval, lsf(tid0).value, lsf(tid0).optval) ∧ apcf(tid0) = bwabspcf(pcf(tid0)) ∨ alsf(tid0) = mkls(lsf(tid0).tid, lsf(tid0).ival, Empty, lsf(tid0).value, lsf(tid0).optval) ∧ pcf(tid0) = invDeq ∧ apcf(tid0) = resDeq ∧ lsf(tid0).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, lsf(tid0), optval1, tid2, 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 34 from proof bwsim-step-tau (previous step) (back to tree)

(tid = tid0 ⊃ lstepf(mkgs(queue), lsf(tid0), pcf(tid0), ca);lsf(tid0)) = mkls(tid1, obsEmpty, val, optval, val0, optval0), bwabsa(ca) = τ, gstepf(mkgs(queue), lsf(tid), pcf(tid), ca) = mkgs(queue0), lsf(tid0) = mkls(tid2, obsEmpty0, val1, optval1, val2, optval2), ca ≠ globalCrash, DQInv(mkgs(queue), lsf, pcf), bwabs (mkstate(mkgs(queue0), lsf(tid; lstepf(mkgs(queue), lsf(tid), pcf(tid), ca)), pcf(tid; pcstepf(mkgs(queue), lsf(tid), pcf(tid), ca))), mkstate(mkdgs(queue0), alsf, apcf)), fininvdeq(pcf), pre(mkgs(queue), lsf(tid), pcf(tid), ca), ∀ tid. ca ≠ CheckEmp(tid) ⊦ queue0 = queue ∧ ( alsf(tid0) = mkls(tid1, val, optval, val0, optval0) ∧ apcf(tid0) = bwabspcf((tid = tid0 ⊃ pcstepf(mkgs(queue), lsf(tid0), pcf(tid0), ca);pcf(tid0))) ∨ alsf(tid0) = mkls(tid1, val, Empty, val0, optval0) ∧ (tid = tid0 ⊃ pcstepf(mkgs(queue), lsf(tid0), pcf(tid0), ca);pcf(tid0)) = invDeq ∧ apcf(tid0) = resDeq ∧ obsEmpty → alsf(tid0) = mkls(tid2, val1, optval1, val2, optval2) ∧ apcf(tid0) = bwabspcf(pcf(tid0)) ∨ alsf(tid0) = mkls(tid2, val1, Empty, val2, optval2) ∧ pcf(tid0) = invDeq ∧ apcf(tid0) = resDeq ∧ obsEmpty0)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

(tid = tid0 ⊃ lstepf(mkgs(queue), mkls(tid2, obsEmpty0, val1, optval1, val2, optval2), pcf(tid0), ca) ;mkls(tid2, obsEmpty0, val1, optval1, val2, optval2) ) = mkls(tid1, obsEmpty, val, optval, val0, optval0), bwabsa(ca) = τ, gstepf(mkgs(queue), lsf(tid), pcf(tid), ca) = mkgs(queue0), lsf(tid0) = mkls(tid2, obsEmpty0, val1, optval1, val2, optval2), ca ≠ globalCrash, DQInv(mkgs(queue), lsf, pcf), bwabs (mkstate(mkgs(queue0), lsf(tid; lstepf(mkgs(queue), lsf(tid), pcf(tid), ca)), pcf(tid; pcstepf(mkgs(queue), lsf(tid), pcf(tid), ca))), mkstate(mkdgs(queue0), alsf, apcf)), fininvdeq(pcf), pre(mkgs(queue), lsf(tid), pcf(tid), ca), ∀ tid. ca ≠ CheckEmp(tid) ⊦ queue0 = queue ∧ ( alsf(tid0) = mkls(tid1, val, optval, val0, optval0) ∧ apcf(tid0) = bwabspcf((tid = tid0 ⊃ pcstepf(mkgs(queue), mkls(tid2, obsEmpty0, val1, optval1, val2, optval2), pcf(tid0), ca);pcf(tid0))) ∨ alsf(tid0) = mkls(tid1, val, Empty, val0, optval0) ∧ (tid = tid0 ⊃ pcstepf(mkgs(queue), mkls(tid2, obsEmpty0, val1, optval1, val2, optval2), pcf(tid0), ca);pcf(tid0)) = invDeq ∧ apcf(tid0) = resDeq ∧ obsEmpty → alsf(tid0) = mkls(tid2, val1, optval1, val2, optval2) ∧ apcf(tid0) = bwabspcf(pcf(tid0)) ∨ alsf(tid0) = mkls(tid2, val1, Empty, val2, optval2) ∧ pcf(tid0) = invDeq ∧ apcf(tid0) = resDeq ∧ obsEmpty0)

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 36 from proof bwsim-step-tau (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 37 from proof bwsim-step-tau (previous step) (back to tree)

(tid = tid0 ⊃ lstepf(mkgs(queue), mkls(tid2, obsEmpty0, val1, optval1, val2, optval2), pcf(tid0), ca) ;mkls(tid2, obsEmpty0, val1, optval1, val2, optval2) ) = mkls(tid1, obsEmpty, val, optval, val0, optval0), bwabsa(ca) = τ, gstepf(mkgs(queue), lsf(tid), pcf(tid), ca) = mkgs(queue0), lsf(tid0) = mkls(tid2, obsEmpty0, val1, optval1, val2, optval2), ca ≠ globalCrash, DQGInv(mkgs(queue)), bwabs (mkstate(mkgs(queue0), lsf(tid; lstepf(mkgs(queue), lsf(tid), pcf(tid), ca)), pcf(tid; pcstepf(mkgs(queue), lsf(tid), pcf(tid), ca))), mkstate(mkdgs(queue0), alsf, apcf)), fininvdeq(pcf), pre(mkgs(queue), lsf(tid), pcf(tid), ca), ∀ tid. ca ≠ CheckEmp(tid), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦ queue0 = queue ∧ ( alsf(tid0) = mkls(tid1, val, optval, val0, optval0) ∧ apcf(tid0) = bwabspcf((tid = tid0 ⊃ pcstepf(mkgs(queue), mkls(tid2, obsEmpty0, val1, optval1, val2, optval2), pcf(tid0), ca);pcf(tid0))) ∨ alsf(tid0) = mkls(tid1, val, Empty, val0, optval0) ∧ (tid = tid0 ⊃ pcstepf(mkgs(queue), mkls(tid2, obsEmpty0, val1, optval1, val2, optval2), pcf(tid0), ca);pcf(tid0)) = invDeq ∧ apcf(tid0) = resDeq ∧ obsEmpty → alsf(tid0) = mkls(tid2, val1, optval1, val2, optval2) ∧ apcf(tid0) = bwabspcf(pcf(tid0)) ∨ alsf(tid0) = mkls(tid2, val1, Empty, val2, optval2) ∧ pcf(tid0) = invDeq ∧ apcf(tid0) = resDeq ∧ obsEmpty0)

User applied rule all left

And obtained the following new goals

Rule argument

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

Additional information

Used terms: tid0

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

lsf(tid0).tid = tid0, (tid = tid0 ⊃ lstepf(mkgs(queue), mkls(tid2, obsEmpty0, val1, optval1, val2, optval2), pcf(tid0), ca) ;mkls(tid2, obsEmpty0, val1, optval1, val2, optval2) ) = mkls(tid1, obsEmpty, val, optval, val0, optval0), bwabsa(ca) = τ, gstepf(mkgs(queue), lsf(tid), pcf(tid), ca) = mkgs(queue0), lsf(tid0) = mkls(tid2, obsEmpty0, val1, optval1, val2, optval2), ca ≠ globalCrash, DQGInv(mkgs(queue)), DQLInv(mkgs(queue), lsf(tid0), pcf(tid0)), bwabs (mkstate(mkgs(queue0), lsf(tid; lstepf(mkgs(queue), lsf(tid), pcf(tid), ca)), pcf(tid; pcstepf(mkgs(queue), lsf(tid), pcf(tid), ca))), mkstate(mkdgs(queue0), alsf, apcf)), fininvdeq(pcf), pre(mkgs(queue), lsf(tid), pcf(tid), ca), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ∀ tid. ca ≠ CheckEmp(tid) ⊦ queue0 = queue ∧ ( alsf(tid0) = mkls(tid1, val, optval, val0, optval0) ∧ apcf(tid0) = bwabspcf((tid = tid0 ⊃ pcstepf(mkgs(queue), mkls(tid2, obsEmpty0, val1, optval1, val2, optval2), pcf(tid0), ca);pcf(tid0))) ∨ alsf(tid0) = mkls(tid1, val, Empty, val0, optval0) ∧ (tid = tid0 ⊃ pcstepf(mkgs(queue), mkls(tid2, obsEmpty0, val1, optval1, val2, optval2), pcf(tid0), ca);pcf(tid0)) = invDeq ∧ apcf(tid0) = resDeq ∧ obsEmpty → alsf(tid0) = mkls(tid2, val1, optval1, val2, optval2) ∧ apcf(tid0) = bwabspcf(pcf(tid0)) ∨ alsf(tid0) = mkls(tid2, val1, Empty, val2, optval2) ∧ pcf(tid0) = invDeq ∧ apcf(tid0) = resDeq ∧ obsEmpty0)

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

(tid = tid2 ⊃ lstepf(mkgs(queue), mkls(tid2, obsEmpty0, val1, optval1, val2, optval2), pcf(tid2), ca) ;mkls(tid2, obsEmpty0, val1, optval1, val2, optval2) ) = mkls(tid1, obsEmpty, val, optval, val0, optval0), bwabsa(ca) = τ, gstepf(mkgs(queue), lsf(tid), pcf(tid), ca) = mkgs(queue0), lsf(tid2) = mkls(tid2, obsEmpty0, val1, optval1, val2, optval2), ca ≠ globalCrash, DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid2, obsEmpty0, val1, optval1, val2, optval2), pcf(tid2)), bwabs (mkstate(mkgs(queue0), lsf(tid; lstepf(mkgs(queue), lsf(tid), pcf(tid), ca)), pcf(tid; pcstepf(mkgs(queue), lsf(tid), pcf(tid), ca))), mkstate(mkdgs(queue0), alsf, apcf)), fininvdeq(pcf), pre(mkgs(queue), lsf(tid), pcf(tid), ca), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ∀ tid. ca ≠ CheckEmp(tid) ⊦ queue0 = queue ∧ ( alsf(tid2) = mkls(tid1, val, optval, val0, optval0) ∧ apcf(tid2) = bwabspcf((tid = tid2 ⊃ pcstepf(mkgs(queue), mkls(tid2, obsEmpty0, val1, optval1, val2, optval2), pcf(tid2), ca);pcf(tid2))) ∨ alsf(tid2) = mkls(tid1, val, Empty, val0, optval0) ∧ (tid = tid2 ⊃ pcstepf(mkgs(queue), mkls(tid2, obsEmpty0, val1, optval1, val2, optval2), pcf(tid2), ca);pcf(tid2)) = invDeq ∧ apcf(tid2) = resDeq ∧ obsEmpty → alsf(tid2) = mkls(tid2, val1, optval1, val2, optval2) ∧ apcf(tid2) = bwabspcf(pcf(tid2)) ∨ alsf(tid2) = mkls(tid2, val1, Empty, val2, optval2) ∧ pcf(tid2) = invDeq ∧ apcf(tid2) = resDeq ∧ obsEmpty0)

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 ;; ⊦ bwabsa(callRun(tid)) = callARun(tid); (s) ⊦ callARun(tid) ≠ τ; (s) ⊦ bwabsa(RetEnq(tid)) = ARetEnq(tid); (s) ⊦ ARetEnq(tid) ≠ τ; (s) ⊦ bwabsa(RetDeq(tid, optval)) = ARetDeq(tid, optval); (s) ⊦ ARetDeq(tid, optval) ≠ τ; (s) ⊦ bwabsa(InvEnq(tid, val)) = AInvEnq(tid, val); (s) ⊦ AInvEnq(tid, val) ≠ τ; (s) ⊦ bwabsa(InvDeq(tid)) = AInvDeq(tid); (s) ⊦ AInvDeq(tid) ≠ τ; (s) ⊦ bwabsa(DoEnq(tid)) = ADoEnq(tid); (s) ⊦ ADoEnq(tid) ≠ τ; (s) ⊦ bwabsa(DoDeq(tid)) = ADoDeq(tid); (s) ⊦ ADoDeq(tid) ≠ τ; (s) ⊦ bwabsa(CheckEmp(tid)) = ADoDeq(tid); (s)

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

(tid = tid2 ⊃ lstepf(mkgs(queue), mkls(tid2, obsEmpty0, val1, optval1, val2, optval2), pcf(tid2), ca) ;mkls(tid2, obsEmpty0, val1, optval1, val2, optval2) ) = mkls(tid1, obsEmpty, val, optval, val0, optval0), bwabsa(ca) = τ, ca = τ, gstepf(mkgs(queue), lsf(tid), pcf(tid), ca) = mkgs(queue0), lsf(tid2) = mkls(tid2, obsEmpty0, val1, optval1, val2, optval2), ca ≠ globalCrash, DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid2, obsEmpty0, val1, optval1, val2, optval2), pcf(tid2)), bwabs (mkstate(mkgs(queue0), lsf(tid; lstepf(mkgs(queue), lsf(tid), pcf(tid), ca)), pcf(tid; pcstepf(mkgs(queue), lsf(tid), pcf(tid), ca))), mkstate(mkdgs(queue0), alsf, apcf)), fininvdeq(pcf), pre(mkgs(queue), lsf(tid), pcf(tid), ca), ∀ tid. ca ≠ CheckEmp(tid), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦ queue0 = queue ∧ ( alsf(tid2) = mkls(tid1, val, optval, val0, optval0) ∧ apcf(tid2) = bwabspcf((tid = tid2 ⊃ pcstepf(mkgs(queue), mkls(tid2, obsEmpty0, val1, optval1, val2, optval2), pcf(tid2), ca);pcf(tid2))) ∨ alsf(tid2) = mkls(tid1, val, Empty, val0, optval0) ∧ (tid = tid2 ⊃ pcstepf(mkgs(queue), mkls(tid2, obsEmpty0, val1, optval1, val2, optval2), pcf(tid2), ca);pcf(tid2)) = invDeq ∧ apcf(tid2) = resDeq ∧ obsEmpty → alsf(tid2) = mkls(tid2, val1, optval1, val2, optval2) ∧ apcf(tid2) = bwabspcf(pcf(tid2)) ∨ alsf(tid2) = mkls(tid2, val1, Empty, val2, optval2) ∧ pcf(tid2) = invDeq ∧ apcf(tid2) = resDeq ∧ obsEmpty0)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

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

(tid = tid2 ⊃ lstepf(mkgs(queue), mkls(tid2, obsEmpty0, val1, optval1, val2, optval2), pcf(tid2), τ) ;mkls(tid2, obsEmpty0, val1, optval1, val2, optval2) ) = mkls(tid1, obsEmpty, val, optval, val0, optval0), gstepf(mkgs(queue), lsf(tid), pcf(tid), τ) = mkgs(queue0), lsf(tid2) = mkls(tid2, obsEmpty0, val1, optval1, val2, optval2), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid2, obsEmpty0, val1, optval1, val2, optval2), pcf(tid2)), bwabs (mkstate(mkgs(queue0), lsf(tid; lstepf(mkgs(queue), lsf(tid), pcf(tid), τ)), pcf(tid; pcstepf(mkgs(queue), lsf(tid), pcf(tid), τ))), mkstate(mkdgs(queue0), alsf, apcf)), fininvdeq(pcf), pre(mkgs(queue), lsf(tid), pcf(tid), τ), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦ queue0 = queue ∧ ( alsf(tid2) = mkls(tid1, val, optval, val0, optval0) ∧ apcf(tid2) = bwabspcf((tid = tid2 ⊃ pcstepf(mkgs(queue), mkls(tid2, obsEmpty0, val1, optval1, val2, optval2), pcf(tid2), τ);pcf(tid2))) ∨ alsf(tid2) = mkls(tid1, val, Empty, val0, optval0) ∧ (tid = tid2 ⊃ pcstepf(mkgs(queue), mkls(tid2, obsEmpty0, val1, optval1, val2, optval2), pcf(tid2), τ);pcf(tid2)) = invDeq ∧ apcf(tid2) = resDeq ∧ obsEmpty → alsf(tid2) = mkls(tid2, val1, optval1, val2, optval2) ∧ apcf(tid2) = bwabspcf(pcf(tid2)) ∨ alsf(tid2) = mkls(tid2, val1, Empty, val2, optval2) ∧ pcf(tid2) = invDeq ∧ apcf(tid2) = resDeq ∧ obsEmpty0)

User applied rule structural induction

And closed the goal!

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) ≠ τ; (s) ⊦ pre(gs, ls, resDeq, a) ↔ a = RetDeq(ls.tid, ls.oval); (s) ⊦ RetDeq(tid, optval) ≠ τ; (s) ⊦ gstepf(gs, ls, ready, a) = gs; (s) ⊦ mkgs(queue) = mkgs(queue0) ↔ queue = queue0; (s) ⊦ pre(gs, ls, ready, a) ↔ (∃ value. a = InvEnq(ls.tid, value)) ∨ a = InvDeq(ls.tid); (s) ⊦ InvEnq(tid, val) ≠ τ; (s) ⊦ InvDeq(tid) ≠ τ; (s) ⊦ pre(gs, ls, invEnq, a) ↔ a = DoEnq(ls.tid); (s) ⊦ DoEnq(tid) ≠ τ; (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) ≠ τ; (s) ⊦ DoDeqEmpty(tid) ≠ τ; (s) ⊦ DoDeq(tid) ≠ τ; (s) ⊦ pre(gs, ls, idle, a) ↔ a = callRun(ls.tid); (s) ⊦ callRun(tid) ≠ τ; (s) ⊦ pre(gs, ls, crashed, a) ↔ false; (s)

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

(tid = tid2 ⊃ lstepf(mkgs(queue), mkls(tid2, obsEmpty0, val1, optval1, val2, optval2), pcf(tid2), ca) ;mkls(tid2, obsEmpty0, val1, optval1, val2, optval2) ) = mkls(tid1, obsEmpty, val, optval, val0, optval0), bwabsa(ca) = τ, ca = DoDeqEmpty(tid0), gstepf(mkgs(queue), lsf(tid), pcf(tid), ca) = mkgs(queue0), lsf(tid2) = mkls(tid2, obsEmpty0, val1, optval1, val2, optval2), ca ≠ globalCrash, DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid2, obsEmpty0, val1, optval1, val2, optval2), pcf(tid2)), bwabs (mkstate(mkgs(queue0), lsf(tid; lstepf(mkgs(queue), lsf(tid), pcf(tid), ca)), pcf(tid; pcstepf(mkgs(queue), lsf(tid), pcf(tid), ca))), mkstate(mkdgs(queue0), alsf, apcf)), fininvdeq(pcf), pre(mkgs(queue), lsf(tid), pcf(tid), ca), ∀ tid. ca ≠ CheckEmp(tid), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦ queue0 = queue ∧ ( alsf(tid2) = mkls(tid1, val, optval, val0, optval0) ∧ apcf(tid2) = bwabspcf((tid = tid2 ⊃ pcstepf(mkgs(queue), mkls(tid2, obsEmpty0, val1, optval1, val2, optval2), pcf(tid2), ca);pcf(tid2))) ∨ alsf(tid2) = mkls(tid1, val, Empty, val0, optval0) ∧ (tid = tid2 ⊃ pcstepf(mkgs(queue), mkls(tid2, obsEmpty0, val1, optval1, val2, optval2), pcf(tid2), ca);pcf(tid2)) = invDeq ∧ apcf(tid2) = resDeq ∧ obsEmpty → alsf(tid2) = mkls(tid2, val1, optval1, val2, optval2) ∧ apcf(tid2) = bwabspcf(pcf(tid2)) ∨ alsf(tid2) = mkls(tid2, val1, Empty, val2, optval2) ∧ pcf(tid2) = invDeq ∧ apcf(tid2) = resDeq ∧ obsEmpty0)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

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

(tid = tid2 ⊃ lstepf(mkgs(queue), mkls(tid2, obsEmpty0, val1, optval1, val2, optval2), pcf(tid2), DoDeqEmpty(tid0)) ;mkls(tid2, obsEmpty0, val1, optval1, val2, optval2) ) = mkls(tid1, obsEmpty, val, optval, val0, optval0), gstepf(mkgs(queue), lsf(tid), pcf(tid), DoDeqEmpty(tid0)) = mkgs(queue0), lsf(tid2) = mkls(tid2, obsEmpty0, val1, optval1, val2, optval2), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid2, obsEmpty0, val1, optval1, val2, optval2), pcf(tid2)), bwabs (mkstate (mkgs(queue0), lsf(tid; lstepf(mkgs(queue), lsf(tid), pcf(tid), DoDeqEmpty(tid0))), pcf(tid; pcstepf(mkgs(queue), lsf(tid), pcf(tid), DoDeqEmpty(tid0)))), mkstate(mkdgs(queue0), alsf, apcf)), fininvdeq(pcf), pre(mkgs(queue), lsf(tid), pcf(tid), DoDeqEmpty(tid0)), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦ queue0 = queue ∧ ( alsf(tid2) = mkls(tid1, val, optval, val0, optval0) ∧ apcf(tid2) = bwabspcf((tid = tid2 ⊃ pcstepf(mkgs(queue), mkls(tid2, obsEmpty0, val1, optval1, val2, optval2), pcf(tid2), DoDeqEmpty(tid0));pcf(tid2))) ∨ alsf(tid2) = mkls(tid1, val, Empty, val0, optval0) ∧ (tid = tid2 ⊃ pcstepf(mkgs(queue), mkls(tid2, obsEmpty0, val1, optval1, val2, optval2), pcf(tid2), DoDeqEmpty(tid0));pcf(tid2)) = invDeq ∧ apcf(tid2) = resDeq ∧ obsEmpty → alsf(tid2) = mkls(tid2, val1, optval1, val2, optval2) ∧ apcf(tid2) = bwabspcf(pcf(tid2)) ∨ alsf(tid2) = mkls(tid2, val1, Empty, val2, optval2) ∧ pcf(tid2) = invDeq ∧ apcf(tid2) = resDeq ∧ obsEmpty0)

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) ⊦ DoDeqEmpty(tid) ≠ RetEnq(tid0); (s) ⊦ pre(gs, ls, resDeq, a) ↔ a = RetDeq(ls.tid, ls.oval); (s) ⊦ DoDeqEmpty(tid) ≠ RetDeq(tid0, optval); (s) ⊦ gstepf(gs, ls, ready, a) = gs; (s) ⊦ mkgs(queue) = mkgs(queue0) ↔ queue = queue0; (s) ⊦ pre(gs, ls, ready, a) ↔ (∃ value. a = InvEnq(ls.tid, value)) ∨ a = InvDeq(ls.tid); (s) ⊦ DoDeqEmpty(tid) ≠ InvEnq(tid0, val); (s) ⊦ DoDeqEmpty(tid) ≠ InvDeq(tid0); (s) ⊦ pre(gs, ls, invEnq, a) ↔ a = DoEnq(ls.tid); (s) ⊦ DoDeqEmpty(tid) ≠ DoEnq(tid0); (s) ⊦ pre(gs, ls, idle, a) ↔ a = callRun(ls.tid); (s) ⊦ DoDeqEmpty(tid) ≠ callRun(tid0); (s) ⊦ pre(gs, ls, crashed, a) ↔ false; (s)

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

(tid = tid2 ⊃ lstepf(mkgs(queue), mkls(tid2, obsEmpty0, val1, optval1, val2, optval2), pcf(tid2), DoDeqEmpty(tid0)) ;mkls(tid2, obsEmpty0, val1, optval1, val2, optval2) ) = mkls(tid1, obsEmpty, val, optval, val0, optval0), gstepf(mkgs(queue), lsf(tid), pcf(tid), DoDeqEmpty(tid0)) = mkgs(queue0), invDeq = pcf(tid), lsf(tid2) = mkls(tid2, obsEmpty0, val1, optval1, val2, optval2), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid2, obsEmpty0, val1, optval1, val2, optval2), pcf(tid2)), bwabs (mkstate (mkgs(queue0), lsf(tid; lstepf(mkgs(queue), lsf(tid), pcf(tid), DoDeqEmpty(tid0))), pcf(tid; pcstepf(mkgs(queue), lsf(tid), pcf(tid), DoDeqEmpty(tid0)))), mkstate(mkdgs(queue0), alsf, apcf)), fininvdeq(pcf), pre(mkgs(queue), lsf(tid), pcf(tid), DoDeqEmpty(tid0)), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦ queue0 = queue ∧ ( alsf(tid2) = mkls(tid1, val, optval, val0, optval0) ∧ apcf(tid2) = bwabspcf((tid = tid2 ⊃ pcstepf(mkgs(queue), mkls(tid2, obsEmpty0, val1, optval1, val2, optval2), pcf(tid2), DoDeqEmpty(tid0));pcf(tid2))) ∨ alsf(tid2) = mkls(tid1, val, Empty, val0, optval0) ∧ (tid = tid2 ⊃ pcstepf(mkgs(queue), mkls(tid2, obsEmpty0, val1, optval1, val2, optval2), pcf(tid2), DoDeqEmpty(tid0));pcf(tid2)) = invDeq ∧ apcf(tid2) = resDeq ∧ obsEmpty → alsf(tid2) = mkls(tid2, val1, optval1, val2, optval2) ∧ apcf(tid2) = bwabspcf(pcf(tid2)) ∨ alsf(tid2) = mkls(tid2, val1, Empty, val2, optval2) ∧ pcf(tid2) = invDeq ∧ apcf(tid2) = resDeq ∧ obsEmpty0)

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) ⊦ pcstepf(gs, ls, invDeq, DoDeqEmpty(ls.tid)) = resDeq; (s) ⊦ lstepf(gs, ls, invDeq, DoDeqEmpty(ls.tid)) = ls.oval:= Empty; (s) ⊦ mkgs(queue) = mkgs(queue0) ↔ queue = queue0; (s) ⊦ gstepf(gs, ls, invDeq, DoDeqEmpty(ls.tid)) = gs; (s) ⊦ DoDeq(tid) ≠ DoDeqEmpty(tid0); (s) ⊦ DoDeqEmpty(tid) = DoDeqEmpty(tid0) ↔ tid = tid0; (s) ⊦ CheckEmp(tid) ≠ DoDeqEmpty(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 45 from proof bwsim-step-tau (previous step) (back to tree)

(tid = tid2 ⊃ lstepf(mkgs(queue0), mkls(tid2, obsEmpty0, val1, optval1, val2, optval2), pcf(tid2), DoDeqEmpty(tid2)) ;mkls(tid2, obsEmpty0, val1, optval1, val2, optval2) ) = mkls(tid1, obsEmpty, val, optval, val0, optval0), invDeq = pcf(tid), lsf(tid2) = mkls(tid2, obsEmpty0, val1, optval1, val2, optval2), lsf(tid).obsEmpty, DQGInv(mkgs(queue0)), DQLInv(mkgs(queue0), mkls(tid2, obsEmpty0, val1, optval1, val2, optval2), pcf(tid2)), bwabs(mkstate(mkgs(queue0), lsf(tid; lsf(tid).oval:= Empty), pcf(tid; resDeq)), mkstate(mkdgs(queue0), alsf, apcf)), fininvdeq(pcf), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue0), lsf(tid), pcf(tid)), alsf(tid2) = mkls(tid1, val, optval, val0, optval0) ∧ apcf(tid2) = bwabspcf((tid = tid2 ⊃ pcstepf(mkgs(queue0), mkls(tid2, obsEmpty0, val1, optval1, val2, optval2), pcf(tid2), DoDeqEmpty(tid2));pcf(tid2))) ∨ alsf(tid2) = mkls(tid1, val, Empty, val0, optval0) ∧ (tid = tid2 ⊃ pcstepf(mkgs(queue0), mkls(tid2, obsEmpty0, val1, optval1, val2, optval2), pcf(tid2), DoDeqEmpty(tid2));pcf(tid2)) = invDeq ∧ apcf(tid2) = resDeq ∧ obsEmpty ⊦ alsf(tid2) = mkls(tid2, val1, Empty, val2, optval2) ∧ pcf(tid2) = invDeq ∧ apcf(tid2) = resDeq ∧ obsEmpty0, alsf(tid2) = mkls(tid2, val1, optval1, val2, optval2) ∧ apcf(tid2) = bwabspcf(pcf(tid2))

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, tid0, 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, tid0, optval3

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

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

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

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

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) ⊦ lstepf (gs, mkls(tid, obsEmpty, ival, oval, value, optval), invDeq, DoDeqEmpty(tid)) = mkls(tid, obsEmpty, ival, Empty, value, optval); (s) ⊦ bwabspcf(resDeq) = resDeq; (s) ⊦ pcstepf (gs, mkls(tid, obsEmpty, ival, oval, value, optval), invDeq, DoDeqEmpty(tid)) = resDeq; (s) ⊦ invDeq ≠ resDeq; (s) ⊦ bwabspcf(invDeq) = invDeq; (s)

Proof Tree for bwsim-step-tau (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