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

⊦ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, ready, a) ∧ pcstepf(gs, ls, ready, a) = D1 → ( listp (gstepf(gs, ls, ready, a).orl + gstepf(gs, ls, ready, a).qrl, gstepf(gs, ls, ready, a).vs, gstepf(gs, ls, ready, a).ps, gstepf(gs, ls, ready, a).owns) ∧ ¬ dups(gstepf(gs, ls, ready, a).orl + gstepf(gs, ls, ready, a).qrl) ∧ markedp(gstepf(gs, ls, ready, a).orl, gstepf(gs, ls, ready, a).ps) ∧ markedp(gstepf(gs, ls, ready, a).orl, gstepf(gs, ls, ready, a).vs) ∧ unmarkedp(gstepf(gs, ls, ready, a).qrl, gstepf(gs, ls, ready, a).ps) ∧ gstepf(gs, ls, ready, a).orl ≠ [] ∧ gstepf(gs, ls, ready, a).phead ∈ gstepf(gs, ls, ready, a).orl ∧ rvownerok(gstepf(gs, ls, ready, a).vretRefs, gstepf(gs, ls, ready, a).vrvHp, gstepf(gs, ls, ready, a).rvowns) ∧ allocrv(gstepf(gs, ls, ready, a).vretRefs, gstepf(gs, ls, ready, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, ready, a).orl + gstepf(gs, ls, ready, a).qrl, gstepf(gs, ls, ready, a).vs, gstepf(gs, ls, ready, a).vretRefs, gstepf(gs, ls, ready, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, ready, a).pretRefs, gstepf(gs, ls, ready, a).prvHp, gstepf(gs, ls, ready, a).rvowns) ∧ allocrv(gstepf(gs, ls, ready, a).pretRefs, gstepf(gs, ls, ready, a).prvHp) ∧ dom gstepf(gs, ls, ready, a).vrvHp = dom gstepf(gs, ls, ready, a).prvHp ∧ ( gstepf(gs, ls, ready, a).vs[gstepf(gs, ls, ready, a).vhead].next ≠ null ∧ gstepf(gs, ls, ready, a).vs[gstepf(gs, ls, ready, a).vs[gstepf(gs, ls, ready, a).vhead].next].deqID ≠ None → gstepf(gs, ls, ready, a).rvowns (gstepf(gs, ls, ready, a).vretRefs (gstepf(gs, ls, ready, a).vs[gstepf(gs, ls, ready, a).vs[gstepf(gs, ls, ready, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, ready, a).vs[gstepf(gs, ls, ready, a).vs[gstepf(gs, ls, ready, a).vhead].next].deqID.tid, gstepf(gs, ls, ready, a).vs[gstepf(gs, ls, ready, a).vs[gstepf(gs, ls, ready, a).vhead].next].val)) ∧ ( gstepf(gs, ls, ready, a).orl.last = gstepf(gs, ls, ready, a).vhead ∧ (gstepf(gs, ls, ready, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, ready, a).qrl.tail, gstepf(gs, ls, ready, a).vs)) ∨ gstepf(gs, ls, ready, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, ready, a).orl.butlast.last = gstepf(gs, ls, ready, a).vhead ∧ gstepf(gs, ls, ready, a).phead ≠ gstepf(gs, ls, ready, a).orl.last ∧ unmarkedp(gstepf(gs, ls, ready, a).qrl, gstepf(gs, ls, ready, a).vs)) ∧ ( gstepf(gs, ls, ready, a).vtail = (gstepf(gs, ls, ready, a).orl + gstepf(gs, ls, ready, a).qrl).last ∨ gstepf(gs, ls, ready, a).qrl ≠ [] ∧ gstepf(gs, ls, ready, a).vtail = (gstepf(gs, ls, ready, a).orl + gstepf(gs, ls, ready, a).qrl.butlast).last ∧ gstepf(gs, ls, ready, a).vs[gstepf(gs, ls, ready, a).qrl.last].deqID = None ∧ gstepf(gs, ls, ready, a).vs[(gstepf(gs, ls, ready, a).orl + gstepf(gs, ls, ready, a).qrl).last].next = null)) ∧ nextnottid(lstepf(gs, ls, ready, a).tid, gstepf(gs, ls, ready, a).vhead, gstepf(gs, ls, ready, a).vs) ∧ noid (lstepf(gs, ls, ready, a).tid, gstepf(gs, ls, ready, a).orl + gstepf(gs, ls, ready, a).qrl, gstepf(gs, ls, ready, a).vhead, gstepf(gs, ls, ready, a).vs) ∧ noowns(lstepf(gs, ls, ready, a).tid, gstepf(gs, ls, ready, a).owns)

System applied rule normalize

And obtained the following new goals

Rule argument

Additional information

Proof step 2 from proof step-ready-D1 (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, pcstepf(gs, ls, ready, a) = D1, gs.orl ≠ [], allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nextnottid(ls.tid, gs.vhead, gs.vs), noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), noowns(ls.tid, gs.owns), pre(gs, ls, ready, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( listp (gstepf(gs, ls, ready, a).orl + gstepf(gs, ls, ready, a).qrl, gstepf(gs, ls, ready, a).vs, gstepf(gs, ls, ready, a).ps, gstepf(gs, ls, ready, a).owns) ∧ ¬ dups(gstepf(gs, ls, ready, a).orl + gstepf(gs, ls, ready, a).qrl) ∧ markedp(gstepf(gs, ls, ready, a).orl, gstepf(gs, ls, ready, a).ps) ∧ markedp(gstepf(gs, ls, ready, a).orl, gstepf(gs, ls, ready, a).vs) ∧ unmarkedp(gstepf(gs, ls, ready, a).qrl, gstepf(gs, ls, ready, a).ps) ∧ gstepf(gs, ls, ready, a).orl ≠ [] ∧ gstepf(gs, ls, ready, a).phead ∈ gstepf(gs, ls, ready, a).orl ∧ rvownerok(gstepf(gs, ls, ready, a).vretRefs, gstepf(gs, ls, ready, a).vrvHp, gstepf(gs, ls, ready, a).rvowns) ∧ allocrv(gstepf(gs, ls, ready, a).vretRefs, gstepf(gs, ls, ready, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, ready, a).orl + gstepf(gs, ls, ready, a).qrl, gstepf(gs, ls, ready, a).vs, gstepf(gs, ls, ready, a).vretRefs, gstepf(gs, ls, ready, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, ready, a).pretRefs, gstepf(gs, ls, ready, a).prvHp, gstepf(gs, ls, ready, a).rvowns) ∧ allocrv(gstepf(gs, ls, ready, a).pretRefs, gstepf(gs, ls, ready, a).prvHp) ∧ dom gstepf(gs, ls, ready, a).vrvHp = dom gstepf(gs, ls, ready, a).prvHp ∧ ( gstepf(gs, ls, ready, a).vs[gstepf(gs, ls, ready, a).vhead].next ≠ null ∧ gstepf(gs, ls, ready, a).vs[gstepf(gs, ls, ready, a).vs[gstepf(gs, ls, ready, a).vhead].next].deqID ≠ None → gstepf(gs, ls, ready, a).rvowns (gstepf(gs, ls, ready, a).vretRefs (gstepf(gs, ls, ready, a).vs[gstepf(gs, ls, ready, a).vs[gstepf(gs, ls, ready, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, ready, a).vs[gstepf(gs, ls, ready, a).vs[gstepf(gs, ls, ready, a).vhead].next].deqID.tid, gstepf(gs, ls, ready, a).vs[gstepf(gs, ls, ready, a).vs[gstepf(gs, ls, ready, a).vhead].next].val)) ∧ ( gstepf(gs, ls, ready, a).orl.last = gstepf(gs, ls, ready, a).vhead ∧ (gstepf(gs, ls, ready, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, ready, a).qrl.tail, gstepf(gs, ls, ready, a).vs)) ∨ gstepf(gs, ls, ready, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, ready, a).orl.butlast.last = gstepf(gs, ls, ready, a).vhead ∧ gstepf(gs, ls, ready, a).phead ≠ gstepf(gs, ls, ready, a).orl.last ∧ unmarkedp(gstepf(gs, ls, ready, a).qrl, gstepf(gs, ls, ready, a).vs)) ∧ ( gstepf(gs, ls, ready, a).vtail = (gstepf(gs, ls, ready, a).orl + gstepf(gs, ls, ready, a).qrl).last ∨ gstepf(gs, ls, ready, a).qrl ≠ [] ∧ gstepf(gs, ls, ready, a).vtail = (gstepf(gs, ls, ready, a).orl + gstepf(gs, ls, ready, a).qrl.butlast).last ∧ gstepf(gs, ls, ready, a).vs[gstepf(gs, ls, ready, a).qrl.last].deqID = None ∧ gstepf(gs, ls, ready, a).vs[(gstepf(gs, ls, ready, a).orl + gstepf(gs, ls, ready, a).qrl).last].next = null)) ∧ nextnottid(lstepf(gs, ls, ready, a).tid, gstepf(gs, ls, ready, a).vhead, gstepf(gs, ls, ready, a).vs) ∧ noid (lstepf(gs, ls, ready, a).tid, gstepf(gs, ls, ready, a).orl + gstepf(gs, ls, ready, a).qrl, gstepf(gs, ls, ready, a).vhead, gstepf(gs, ls, ready, a).vs) ∧ noowns(lstepf(gs, ls, ready, a).tid, gstepf(gs, ls, ready, a).owns)

Heuristic simplifier applied rule simplifier

And closed the goal!

Rule argument

Additional information

Used simplifier rules: ⊦ lstepf(gs, ls, ready, invDEQ(ls.tid)) = ls; (s) ⊦ invDEQ(tid) ≠ invENQ(tid0, invENQvalue); (s) ⊦ pcstepf(gs, ls, ready, invDEQ(ls.tid)) = D1; (s) ⊦ D1 ≠ E1; (s) ⊦ pcstepf(gs, ls, ready, invENQ(ls.tid, value0)) = E1; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ ⊦ gstepf(gs, ls, ready, a) = gs; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ pre(gs, ls, ready, a) ↔ (∃ value0. a = invENQ(ls.tid, value0)) ∨ a = invDEQ(ls.tid); (s)

Proof Tree for step-ready-D1 (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