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

⊦ ( (ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ ( 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)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D15, a) ∧ pcstepf(gs, ls, D15, a) = D6 → ( ( lstepf(gs, ls, D15, a).success → lstepf(gs, ls, D15, a).optval = gstepf(gs, ls, D15, a).vrvHp[lstepf(gs, ls, D15, a).rvref] ∧ lstepf(gs, ls, D15, a).optval = gstepf(gs, ls, D15, a).prvHp[lstepf(gs, ls, D15, a).rvref]) ∧ gstepf(gs, ls, D15, a).rvowns(gstepf(gs, ls, D15, a).vretRefs(lstepf(gs, ls, D15, a).tid)) = (lstepf(gs, ls, D15, a).optval = Empty ∨ ¬ lstepf(gs, ls, D15, a).success ⊃ Pending(lstepf(gs, ls, D15, a).tid) ;Claimed(lstepf(gs, ls, D15, a).tid, lstepf(gs, ls, D15, a).optval.val) )) ∧ ( listp (gstepf(gs, ls, D15, a).orl + gstepf(gs, ls, D15, a).qrl, gstepf(gs, ls, D15, a).vs, gstepf(gs, ls, D15, a).ps, gstepf(gs, ls, D15, a).owns) ∧ ¬ dups(gstepf(gs, ls, D15, a).orl + gstepf(gs, ls, D15, a).qrl) ∧ markedp(gstepf(gs, ls, D15, a).orl, gstepf(gs, ls, D15, a).ps) ∧ markedp(gstepf(gs, ls, D15, a).orl, gstepf(gs, ls, D15, a).vs) ∧ unmarkedp(gstepf(gs, ls, D15, a).qrl, gstepf(gs, ls, D15, a).ps) ∧ gstepf(gs, ls, D15, a).orl ≠ [] ∧ gstepf(gs, ls, D15, a).phead ∈ gstepf(gs, ls, D15, a).orl ∧ rvownerok(gstepf(gs, ls, D15, a).vretRefs, gstepf(gs, ls, D15, a).vrvHp, gstepf(gs, ls, D15, a).rvowns) ∧ allocrv(gstepf(gs, ls, D15, a).vretRefs, gstepf(gs, ls, D15, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D15, a).orl + gstepf(gs, ls, D15, a).qrl, gstepf(gs, ls, D15, a).vs, gstepf(gs, ls, D15, a).vretRefs, gstepf(gs, ls, D15, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D15, a).pretRefs, gstepf(gs, ls, D15, a).prvHp, gstepf(gs, ls, D15, a).rvowns) ∧ allocrv(gstepf(gs, ls, D15, a).pretRefs, gstepf(gs, ls, D15, a).prvHp) ∧ dom gstepf(gs, ls, D15, a).vrvHp = dom gstepf(gs, ls, D15, a).prvHp ∧ ( gstepf(gs, ls, D15, a).vs[gstepf(gs, ls, D15, a).vhead].next ≠ null ∧ gstepf(gs, ls, D15, a).vs[gstepf(gs, ls, D15, a).vs[gstepf(gs, ls, D15, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D15, a).rvowns (gstepf(gs, ls, D15, a).vretRefs(gstepf(gs, ls, D15, a).vs[gstepf(gs, ls, D15, a).vs[gstepf(gs, ls, D15, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D15, a).vs[gstepf(gs, ls, D15, a).vs[gstepf(gs, ls, D15, a).vhead].next].deqID.tid, gstepf(gs, ls, D15, a).vs[gstepf(gs, ls, D15, a).vs[gstepf(gs, ls, D15, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D15, a).orl.last = gstepf(gs, ls, D15, a).vhead ∧ (gstepf(gs, ls, D15, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D15, a).qrl.tail, gstepf(gs, ls, D15, a).vs)) ∨ gstepf(gs, ls, D15, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D15, a).orl.butlast.last = gstepf(gs, ls, D15, a).vhead ∧ gstepf(gs, ls, D15, a).phead ≠ gstepf(gs, ls, D15, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D15, a).qrl, gstepf(gs, ls, D15, a).vs)) ∧ ( gstepf(gs, ls, D15, a).vtail = (gstepf(gs, ls, D15, a).orl + gstepf(gs, ls, D15, a).qrl).last ∨ gstepf(gs, ls, D15, a).qrl ≠ [] ∧ gstepf(gs, ls, D15, a).vtail = (gstepf(gs, ls, D15, a).orl + gstepf(gs, ls, D15, a).qrl.butlast).last ∧ gstepf(gs, ls, D15, a).vs[gstepf(gs, ls, D15, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D15, a).vs[(gstepf(gs, ls, D15, a).orl + gstepf(gs, ls, D15, a).qrl).last].next = null)) ∧ ( gstepf(gs, ls, D15, a).vretRefs(lstepf(gs, ls, D15, a).tid) = lstepf(gs, ls, D15, a).rvref ∧ gstepf(gs, ls, D15, a).pretRefs(lstepf(gs, ls, D15, a).tid) = lstepf(gs, ls, D15, a).rvref ∧ lstepf(gs, ls, D15, a).rvref ∈ gstepf(gs, ls, D15, a).vrvHp ∧ lstepf(gs, ls, D15, a).rvref ≠ null) ∧ nextnottid(lstepf(gs, ls, D15, a).tid, gstepf(gs, ls, D15, a).vhead, gstepf(gs, ls, D15, a).vs) ∧ noid (lstepf(gs, ls, D15, a).tid, gstepf(gs, ls, D15, a).orl + gstepf(gs, ls, D15, a).qrl, gstepf(gs, ls, D15, a).vhead, gstepf(gs, ls, D15, a).vs) ∧ noowns(lstepf(gs, ls, D15, a).tid, gstepf(gs, ls, D15, a).owns)

System applied rule normalize

And obtained the following new goals

Rule argument

Additional information

Proof step 2 from proof step-D15-D6 (previous step) (back to tree)

gs.pretRefs(ls.tid) = ls.rvref, gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid), gs.vretRefs(ls.tid) = ls.rvref, gs.vrvHp[ls.rvref] = Empty, gs.prvHp[ls.rvref] = Empty, dom gs.vrvHp = dom gs.prvHp, pcstepf(gs, ls, D15, a) = D6, gs.orl ≠ [], ls.rvref ≠ null, 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, ls.first, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), noowns(ls.tid, gs.owns), pre(gs, ls, D15, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), ls.lst ∈ gs.orl + gs.qrl, gs.phead ∈ gs.orl, ls.first ∈ gs.orl, gs.vhead ∈ gs.orl from ls.first, ls.rvref ∈ gs.vrvHp, ¬ ls.success, ¬ 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 ⊦ ( ( lstepf(gs, ls, D15, a).success → lstepf(gs, ls, D15, a).optval = gstepf(gs, ls, D15, a).vrvHp[lstepf(gs, ls, D15, a).rvref] ∧ lstepf(gs, ls, D15, a).optval = gstepf(gs, ls, D15, a).prvHp[lstepf(gs, ls, D15, a).rvref]) ∧ gstepf(gs, ls, D15, a).rvowns(gstepf(gs, ls, D15, a).vretRefs(lstepf(gs, ls, D15, a).tid)) = (lstepf(gs, ls, D15, a).optval = Empty ∨ ¬ lstepf(gs, ls, D15, a).success ⊃ Pending(lstepf(gs, ls, D15, a).tid) ;Claimed(lstepf(gs, ls, D15, a).tid, lstepf(gs, ls, D15, a).optval.val) )) ∧ ( listp (gstepf(gs, ls, D15, a).orl + gstepf(gs, ls, D15, a).qrl, gstepf(gs, ls, D15, a).vs, gstepf(gs, ls, D15, a).ps, gstepf(gs, ls, D15, a).owns) ∧ ¬ dups(gstepf(gs, ls, D15, a).orl + gstepf(gs, ls, D15, a).qrl) ∧ markedp(gstepf(gs, ls, D15, a).orl, gstepf(gs, ls, D15, a).ps) ∧ markedp(gstepf(gs, ls, D15, a).orl, gstepf(gs, ls, D15, a).vs) ∧ unmarkedp(gstepf(gs, ls, D15, a).qrl, gstepf(gs, ls, D15, a).ps) ∧ gstepf(gs, ls, D15, a).orl ≠ [] ∧ gstepf(gs, ls, D15, a).phead ∈ gstepf(gs, ls, D15, a).orl ∧ rvownerok(gstepf(gs, ls, D15, a).vretRefs, gstepf(gs, ls, D15, a).vrvHp, gstepf(gs, ls, D15, a).rvowns) ∧ allocrv(gstepf(gs, ls, D15, a).vretRefs, gstepf(gs, ls, D15, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D15, a).orl + gstepf(gs, ls, D15, a).qrl, gstepf(gs, ls, D15, a).vs, gstepf(gs, ls, D15, a).vretRefs, gstepf(gs, ls, D15, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D15, a).pretRefs, gstepf(gs, ls, D15, a).prvHp, gstepf(gs, ls, D15, a).rvowns) ∧ allocrv(gstepf(gs, ls, D15, a).pretRefs, gstepf(gs, ls, D15, a).prvHp) ∧ dom gstepf(gs, ls, D15, a).vrvHp = dom gstepf(gs, ls, D15, a).prvHp ∧ ( gstepf(gs, ls, D15, a).vs[gstepf(gs, ls, D15, a).vhead].next ≠ null ∧ gstepf(gs, ls, D15, a).vs[gstepf(gs, ls, D15, a).vs[gstepf(gs, ls, D15, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D15, a).rvowns (gstepf(gs, ls, D15, a).vretRefs(gstepf(gs, ls, D15, a).vs[gstepf(gs, ls, D15, a).vs[gstepf(gs, ls, D15, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D15, a).vs[gstepf(gs, ls, D15, a).vs[gstepf(gs, ls, D15, a).vhead].next].deqID.tid, gstepf(gs, ls, D15, a).vs[gstepf(gs, ls, D15, a).vs[gstepf(gs, ls, D15, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D15, a).orl.last = gstepf(gs, ls, D15, a).vhead ∧ (gstepf(gs, ls, D15, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D15, a).qrl.tail, gstepf(gs, ls, D15, a).vs)) ∨ gstepf(gs, ls, D15, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D15, a).orl.butlast.last = gstepf(gs, ls, D15, a).vhead ∧ gstepf(gs, ls, D15, a).phead ≠ gstepf(gs, ls, D15, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D15, a).qrl, gstepf(gs, ls, D15, a).vs)) ∧ ( gstepf(gs, ls, D15, a).vtail = (gstepf(gs, ls, D15, a).orl + gstepf(gs, ls, D15, a).qrl).last ∨ gstepf(gs, ls, D15, a).qrl ≠ [] ∧ gstepf(gs, ls, D15, a).vtail = (gstepf(gs, ls, D15, a).orl + gstepf(gs, ls, D15, a).qrl.butlast).last ∧ gstepf(gs, ls, D15, a).vs[gstepf(gs, ls, D15, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D15, a).vs[(gstepf(gs, ls, D15, a).orl + gstepf(gs, ls, D15, a).qrl).last].next = null)) ∧ ( gstepf(gs, ls, D15, a).vretRefs(lstepf(gs, ls, D15, a).tid) = lstepf(gs, ls, D15, a).rvref ∧ gstepf(gs, ls, D15, a).pretRefs(lstepf(gs, ls, D15, a).tid) = lstepf(gs, ls, D15, a).rvref ∧ lstepf(gs, ls, D15, a).rvref ∈ gstepf(gs, ls, D15, a).vrvHp ∧ lstepf(gs, ls, D15, a).rvref ≠ null) ∧ nextnottid(lstepf(gs, ls, D15, a).tid, gstepf(gs, ls, D15, a).vhead, gstepf(gs, ls, D15, a).vs) ∧ noid(lstepf(gs, ls, D15, a).tid, gstepf(gs, ls, D15, a).orl + gstepf(gs, ls, D15, a).qrl, gstepf(gs, ls, D15, a).vhead, gstepf(gs, ls, D15, a).vs) ∧ noowns(lstepf(gs, ls, D15, a).tid, gstepf(gs, ls, D15, a).owns)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ gstepf(gs, ls, D15, τ) = gs; (s) ⊦ (ls.success:= success).tid = ls.tid; (s) ⊦ (ls.optval:= optval).tid = ls.tid; (s) ⊦ lstepf(gs, ls, D15, τ) = (ls.success:= true).optval:= Empty; (s) ⊦ (ls.success:= success).rvref = ls.rvref; (s) ⊦ (ls.optval:= optval).rvref = ls.rvref; (s) ⊦ (ls.optval:= optval).optval = optval; (s) ⊦ (ls.success:= success).success ↔ success; (s) ⊦ (ls.optval:= optval).success ↔ ls.success; (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 ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ pre(gs, ls, D15, a) ↔ a = τ; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ pcstepf(gs, ls, D15, a) = D6; (s)

Proof step 3 from proof step-D15-D6 (previous step) (back to tree)

gs.pretRefs(ls.tid) = ls.rvref, gs.rvowns(ls.rvref) = Pending(ls.tid), gs.vretRefs(ls.tid) = ls.rvref, gs.prvHp[ls.rvref] = Empty, gs.vrvHp[ls.rvref] = Empty, dom gs.vrvHp = dom gs.prvHp, gs.orl ≠ [], ls.rvref ≠ null, allocrv(gs.pretRefs, gs.prvHp), allocrv(gs.vretRefs, gs.vrvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.vs), markedp(gs.orl, gs.ps), nextnottid(ls.tid, gs.vhead, gs.vs), noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), noowns(ls.tid, gs.owns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), ls.rvref ∈ gs.vrvHp, gs.vhead ∈ gs.orl from ls.first, ls.first ∈ gs.orl, gs.phead ∈ gs.orl, ls.first ∈ gs.vs, gs.phead ∈ gs.vs, ls.first ∈ gs.ps, gs.phead ∈ gs.ps, ¬ ls.success, ¬ dups(gs.orl + gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.qrl), ¬ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), 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), ls.lst ∈ gs.orl ∨ ls.lst ∈ gs.qrl, 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.qrl.last].next = null ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:elim-mkgs, seq:⊦ ( ( ( ( ( ( ( ( ( ( (ps = gs.ps ∧ vs = gs.vs) ∧ phead = gs.phead) ∧ vhead = gs.vhead) ∧ vtail = gs.vtail) ∧ vretRefs = gs.vretRefs) ∧ pretRefs = gs.pretRefs) ∧ vrvHp = gs.vrvHp) ∧ prvHp = gs.prvHp) ∧ qrl = gs.qrl) ∧ orl = gs.orl) ∧ owns = gs.owns) ∧ rvowns = gs.rvowns ↔ gs = mkgs (ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), subst:[qrl, ps, phead, vrvHp, vretRefs, vhead, vtail, gs, owns, rvowns, orl, prvHp, pretRefs, vs] → [qrl, ps, phead, vrvHp, vretRefs, vhead, vtail, gs, owns, rvowns, orl, prvHp, pretRefs, vs]

Additional information

Used simplifier rules: ⊦ ( ( ( ( ( ( ( ( ( ((ps = gs.ps ∧ vs = gs.vs) ∧ phead = gs.phead) ∧ vhead = gs.vhead) ∧ vtail = gs.vtail) ∧ vretRefs = gs.vretRefs) ∧ pretRefs = gs.pretRefs) ∧ vrvHp = gs.vrvHp) ∧ prvHp = gs.prvHp) ∧ qrl = gs.qrl) ∧ orl = gs.orl) ∧ owns = gs.owns) ∧ rvowns = gs.rvowns ↔ gs = mkgs (ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns); (elim) Used terms: qrl, ps, phead, vrvHp, vretRefs, vhead, vtail, gs, owns, rvowns, orl, prvHp, pretRefs, vs

Proof step 4 from proof step-D15-D6 (previous step) (back to tree)

vrvHp[ls.rvref] = Empty, prvHp[ls.rvref] = Empty, dom vrvHp = dom prvHp, gs = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), pretRefs(ls.tid) = ls.rvref, rvowns(ls.rvref) = Pending(ls.tid), vretRefs(ls.tid) = ls.rvref, ls.rvref ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(ls.tid, vhead, vs), noid(ls.tid, orl + qrl, ls.first, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(ls.tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, ls.first ∈ ps, phead ∈ vs, ls.first ∈ vs, phead ∈ orl, ls.first ∈ orl, vhead ∈ orl from ls.first, ls.rvref ∈ vrvHp, ¬ ls.success, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ noid(ls.tid, orl + qrl, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, ls.lst ∈ orl ∨ ls.lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: 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

Proof step 5 from proof step-D15-D6 (previous step) (back to tree)

prvHp[ls.rvref] = Empty, vrvHp[ls.rvref] = Empty, dom vrvHp = dom prvHp, pretRefs(ls.tid) = ls.rvref, rvowns(ls.rvref) = Pending(ls.tid), vretRefs(ls.tid) = ls.rvref, ls.rvref ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(ls.tid, vhead, vs), noid(ls.tid, orl + qrl, ls.first, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(ls.tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), ls.rvref ∈ vrvHp, vhead ∈ orl from ls.first, ls.first ∈ orl, phead ∈ orl, ls.first ∈ vs, phead ∈ vs, ls.first ∈ ps, phead ∈ ps, ¬ ls.success, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ noid(ls.tid, orl + qrl, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), ls.lst ∈ orl ∨ ls.lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:elim-mkls, seq:⊦ ( ( ( ( ( ( ( ( ( ( (tid = ls.tid ∧ value = ls.value) ∧ optval = ls.optval) ∧ node = ls.node) ∧ nd = ls.nd) ∧ (success ↔ ls.success)) ∧ lst = ls.lst) ∧ nxt = ls.nxt) ∧ rvref = ls.rvref) ∧ optval0 = ls.optval0) ∧ first = ls.first) ∧ othertid = ls.othertid) ∧ addr = ls.addr ↔ ls = mkls (tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), subst:[value, nxt, optval0, node, nd, ls, addr, tid, lst, first, rvref, othertid, success, optval] → [value, nxt, optval0, node, nd, ls, addr, tid, lst, first, rvref, othertid, success, optval]

Additional information

Used simplifier rules: ⊦ ( ( ( ( ( ( ( ( ( ( (tid = ls.tid ∧ value = ls.value) ∧ optval = ls.optval) ∧ node = ls.node) ∧ nd = ls.nd) ∧ (success ↔ ls.success)) ∧ lst = ls.lst) ∧ nxt = ls.nxt) ∧ rvref = ls.rvref) ∧ optval0 = ls.optval0) ∧ first = ls.first) ∧ othertid = ls.othertid) ∧ addr = ls.addr ↔ ls = mkls (tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr); (elim) Used terms: value, nxt, optval, node, nd, ls, addr, tid, lst, first, rvref, othertid, success, optval

Proof step 6 from proof step-D15-D6 (previous step) (back to tree)

vrvHp[rvref] = Empty, prvHp[rvref] = Empty, dom vrvHp = dom prvHp, ls = mkls(tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), pretRefs(tid) = rvref, rvowns(rvref) = Pending(tid), ¬ success, vretRefs(tid) = rvref, orl ≠ [], rvref ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, first, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, first ∈ ps, phead ∈ vs, first ∈ vs, phead ∈ orl, first ∈ orl, vhead ∈ orl from first, rvref ∈ vrvHp, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ noid(tid, orl + qrl, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[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

Proof step 7 from proof step-D15-D6 (previous step) (back to tree)

prvHp[vretRefs(tid)] = Empty, vrvHp[vretRefs(tid)] = Empty, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), orl ≠ [], vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, first, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), vretRefs(tid) ∈ vrvHp, vhead ∈ orl from first, first ∈ orl, phead ∈ orl, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ noid(tid, orl + qrl, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), lst ∈ orl ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:noid-def, seq:⊦ noid(tid, rl, r, vs) ↔ (∀ r0. r0 ≠ r ∧ r0 ∈ rl from r → vs[r0].deqID ≠ Some(tid)), subst:[tid, rl, r, vs] → [tid, orl + qrl, first, vs], <all paths>

Additional information

Used terms: tid, orl + qrl, first, vs

Proof step 8 from proof step-D15-D6 (previous step) (back to tree)

⊦ noid(tid, rl, r, vs) ↔ (∀ r0. r0 ≠ r ∧ r0 ∈ rl from r → vs[r0].deqID ≠ Some(tid))

A spec-lemma

Proof step 9 from proof step-D15-D6 (previous step) (back to tree)

vrvHp[vretRefs(tid)] = Empty, prvHp[vretRefs(tid)] = Empty, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), orl ≠ [], vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, phead ∈ orl, first ∈ orl, vhead ∈ orl from first, vretRefs(tid) ∈ vrvHp, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ noid(tid, orl + qrl, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r0. r0 ≠ first ∧ r0 ∈ orl + qrl from first → vs[r0].deqID ≠ Some(tid), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s)

Proof step 10 from proof step-D15-D6 (previous step) (back to tree)

prvHp[vretRefs(tid)] = Empty, vrvHp[vretRefs(tid)] = Empty, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), orl ≠ [], vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), vretRefs(tid) ∈ vrvHp, vhead ∈ orl from first, first ∈ orl, phead ∈ orl, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ noid(tid, orl + qrl, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r0. r0 ≠ first ∧ (r0 ∈ orl from first ∨ r0 ∈ qrl) → vs[r0].deqID ≠ Some(tid), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), lst ∈ orl ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:noid-def, seq:⊦ noid(tid, rl, r, vs) ↔ (∀ r0. r0 ≠ r ∧ r0 ∈ rl from r → vs[r0].deqID ≠ Some(tid)), subst:[tid, rl, r, vs] → [tid, orl + qrl, vhead, vs], <all paths>

Additional information

Used terms: tid, orl + qrl, vhead, vs

Proof step 11 from proof step-D15-D6 (previous step) (back to tree)

⊦ noid(tid, rl, r, vs) ↔ (∀ r0. r0 ≠ r ∧ r0 ∈ rl from r → vs[r0].deqID ≠ Some(tid))

A spec-lemma

Proof step 12 from proof step-D15-D6 (previous step) (back to tree)

vrvHp[vretRefs(tid)] = Empty, prvHp[vretRefs(tid)] = Empty, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), orl ≠ [], vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, phead ∈ orl, first ∈ orl, vhead ∈ orl from first, vretRefs(tid) ∈ vrvHp, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r0. r0 ≠ first ∧ (r0 ∈ orl from first ∨ r0 ∈ qrl) → vs[r0].deqID ≠ Some(tid), ∃ r0. ¬(r0 ≠ vhead ∧ r0 ∈ orl + qrl from vhead → vs[r0].deqID ≠ Some(tid)), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 13 from proof step-D15-D6 (previous step) (back to tree)

vs[r0].deqID = Some(tid), prvHp[vretRefs(tid)] = Empty, vrvHp[vretRefs(tid)] = Empty, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), orl ≠ [], r0 ≠ vhead, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), r0 ∈ orl + qrl from vhead, vretRefs(tid) ∈ vrvHp, vhead ∈ orl from first, first ∈ orl, phead ∈ orl, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r0. r0 ≠ first ∧ (r0 ∈ orl from first ∨ r0 ∈ qrl) → vs[r0].deqID ≠ Some(tid), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), lst ∈ orl ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 34 terms: r0 abort: F discard: T computed: T

Additional information

Used terms: r0

Proof step 14 from proof step-D15-D6 (previous step) (back to tree)

vs[r0].deqID = Some(tid), vrvHp[vretRefs(tid)] = Empty, prvHp[vretRefs(tid)] = Empty, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), orl ≠ [], r0 ≠ vhead, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, phead ∈ orl, first ∈ orl, vhead ∈ orl from first, vretRefs(tid) ∈ vrvHp, r0 ∈ orl + qrl from vhead, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), r0 ≠ first ∧ (r0 ∈ orl from first ∨ r0 ∈ qrl) → vs[r0].deqID ≠ Some(tid), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 15 from proof step-D15-D6 (previous step) (back to tree)

vs[r0].deqID = Some(tid), prvHp[vretRefs(tid)] = Empty, vrvHp[vretRefs(tid)] = Empty, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), orl ≠ [], r0 ≠ vhead, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), r0 ∈ orl + qrl from vhead, vretRefs(tid) ∈ vrvHp, vhead ∈ orl from first, first ∈ orl, phead ∈ orl, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), lst ∈ orl ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ r0 ≠ first ∧ (r0 ∈ orl from first ∨ r0 ∈ qrl)

User applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:last-elim, seq:x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a ', subst:[x, a, y] → [orl, vtail0, qrl0]

Additional information

Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl, vtail0, y

Proof step 16 from proof step-D15-D6 (previous step) (back to tree)

vs[r0].deqID = Some(tid), vrvHp[vretRefs(tid)] = Empty, prvHp[vretRefs(tid)] = Empty, dom vrvHp = dom prvHp, orl = qrl0 + vtail0 ', pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), orl ≠ [], r0 ≠ vhead, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, phead ∈ orl, first ∈ orl, vhead ∈ orl from first, vretRefs(tid) ∈ vrvHp, r0 ∈ orl + qrl from vhead, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl ∨ lst ∈ qrl, vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs) ⊦ r0 ≠ first ∧ (r0 ∈ orl from first ∨ r0 ∈ qrl)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: 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] ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' ≠ []; (s)

Proof step 17 from proof step-D15-D6 (previous step) (back to tree)

vs[r0].deqID = Some(tid), prvHp[vretRefs(tid)] = Empty, vrvHp[vretRefs(tid)] = Empty, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), r0 ≠ vhead, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nextnottid(tid, vhead, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vtail0].deqID), some?(ps[vtail0].deqID), unmarkedp(qrl, ps), r0 ∈ (qrl0 + vtail0 ') + qrl from vhead, vretRefs(tid) ∈ vrvHp, vhead ∈ qrl0 + vtail0 ' from first, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs), first ∈ qrl0 ∨ first = vtail0, phead ∈ qrl0 ∨ phead = vtail0, lst ∈ qrl0 ∨ lst = vtail0 ∨ lst ∈ qrl, vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ r0 ≠ first ∧ (r0 ∈ qrl0 + vtail0 ' from first ∨ r0 ∈ qrl)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:from-append-fst, seq: ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl, subst:[orl, qrl, r] → [qrl0 + vtail0 ', qrl, vhead], <all paths>

Additional information

Used simplifier rules: ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' ↔ a = b; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x.last = a ∧ x ≠ [] → a ∈ x; (s) Used terms: qrl0 + vtail0 ', qrl, vhead

Proof step 18 from proof step-D15-D6 (previous step) (back to tree)

⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl

A spec-lemma

Proof step 19 from proof step-D15-D6 (previous step) (back to tree)

vs[r0].deqID = Some(tid), vrvHp[vretRefs(tid)] = Empty, prvHp[vretRefs(tid)] = Empty, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), r0 ≠ vhead, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, vhead, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vhead ∈ qrl0 + vtail0 ' from first, vretRefs(tid) ∈ vrvHp, r0 ∈ (qrl0 + vtail0 ' from vhead) + qrl, vhead ∈ qrl0 + vtail0 ', ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ qrl0 ∨ lst = vtail0 ∨ lst ∈ qrl, phead ∈ qrl0 ∨ phead = vtail0, first ∈ qrl0 ∨ first = vtail0, vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs) ⊦ r0 ≠ first ∧ (r0 ∈ qrl0 + vtail0 ' from first ∨ r0 ∈ qrl)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' ↔ a = b; (s)

Proof step 20 from proof step-D15-D6 (previous step) (back to tree)

vs[r0].deqID = Some(tid), prvHp[vretRefs(tid)] = Empty, vrvHp[vretRefs(tid)] = Empty, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), r0 ≠ vhead, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nextnottid(tid, vhead, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vtail0].deqID), some?(ps[vtail0].deqID), unmarkedp(qrl, ps), vretRefs(tid) ∈ vrvHp, vhead ∈ qrl0 + vtail0 ' from first, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs), first ∈ qrl0 ∨ first = vtail0, phead ∈ qrl0 ∨ phead = vtail0, lst ∈ qrl0 ∨ lst = vtail0 ∨ lst ∈ qrl, vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vhead ∈ qrl0 ∨ vhead = vtail0, r0 ∈ qrl0 + vtail0 ' from vhead ∨ r0 ∈ qrl ⊦ r0 ≠ first ∧ (r0 ∈ qrl0 + vtail0 ' from first ∨ r0 ∈ qrl)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:from-append-fst, seq: ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl, subst:[orl, qrl, r] → [qrl0, vtail0 ', first], <all paths>

Additional information

Used simplifier rules: ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s) Used terms: qrl0, vtail0 ', first

Proof step 21 from proof step-D15-D6 (previous step) (back to tree)

⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl

A spec-lemma

Proof step 22 from proof step-D15-D6 (previous step) (back to tree)

vs[r0].deqID = Some(tid), vrvHp[vretRefs(tid)] = Empty, prvHp[vretRefs(tid)] = Empty, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), r0 ≠ vhead, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, vhead, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vhead ∈ (qrl0 from first) + vtail0 ', vretRefs(tid) ∈ vrvHp, first ∈ qrl0, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), r0 ∈ qrl0 + vtail0 ' from vhead ∨ r0 ∈ qrl, vhead ∈ qrl0 ∨ vhead = vtail0, vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ qrl0 ∨ lst = vtail0 ∨ lst ∈ qrl, phead ∈ qrl0 ∨ phead = vtail0, first ∈ qrl0 ∨ first = vtail0, vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs) ⊦ r0 ≠ first ∧ (r0 ∈ (qrl0 from first) + vtail0 ' ∨ r0 ∈ qrl)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s)

Proof step 23 from proof step-D15-D6 (previous step) (back to tree)

vs[r0].deqID = Some(tid), prvHp[vretRefs(tid)] = Empty, vrvHp[vretRefs(tid)] = Empty, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), r0 ≠ vhead, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nextnottid(tid, vhead, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vtail0].deqID), some?(ps[vtail0].deqID), unmarkedp(qrl, ps), first ∈ qrl0, vretRefs(tid) ∈ vrvHp, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs), phead ∈ qrl0 ∨ phead = vtail0, lst ∈ qrl0 ∨ lst = vtail0 ∨ lst ∈ qrl, vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vhead ∈ qrl0 ∨ vhead = vtail0, r0 ∈ qrl0 + vtail0 ' from vhead ∨ r0 ∈ qrl, vhead ∈ qrl0 from first ∨ vhead = vtail0 ⊦ r0 ≠ first ∧ (r0 ∈ qrl0 from first ∨ r0 = vtail0 ∨ r0 ∈ qrl)

User applied rule case distinction

And closed the goal!

Rule argument

pos: right 1

Additional information

Used simplifier rules: ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x.last = a ∧ x ≠ [] → a ∈ x; (s) ⊦ rl.last ∈ rl from r ↔ r ∈ rl; (s) rl ≠ [] ⊦ ¬ dups(rl) → rl from rl.last = rl.last '; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x ∧ a ∈ y → dups(x + y); (s)

Proof Tree for step-D15-D6 (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