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

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

System applied rule normalize

And obtained the following new goals

Rule argument

Additional information

Proof step 2 from proof step-D3-D4 (previous step) (back to tree)

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ (gs.vretRefs:= vretRefs).owns = gs.owns; (s) ⊦ gstepf(gs, ls, D3, τ) = gs.vretRefs:= gs.vretRefs(ls.tid; ls.rvref); (s) ⊦ lstepf(gs, ls, D3, τ) = ls; (s) ⊦ (gs.vretRefs:= vretRefs).vs = gs.vs; (s) ⊦ (gs.vretRefs:= vretRefs).vhead = gs.vhead; (s) ⊦ (gs.vretRefs:= vretRefs).qrl = gs.qrl; (s) ⊦ (gs.vretRefs:= vretRefs).orl = gs.orl; (s) ⊦ (gs.vretRefs:= vretRefs).vtail = gs.vtail; (s) ⊦ (gs.vretRefs:= vretRefs).phead = gs.phead; (s) ⊦ (gs.vretRefs:= vretRefs).rvowns = gs.rvowns; (s) ⊦ (gs.vretRefs:= vretRefs).vretRefs = vretRefs; (s) ⊦ (gs.vretRefs:= vretRefs).prvHp = gs.prvHp; (s) ⊦ (gs.vretRefs:= vretRefs).vrvHp = gs.vrvHp; (s) ⊦ (gs.vretRefs:= vretRefs).pretRefs = gs.pretRefs; (s) ⊦ (gs.vretRefs:= vretRefs).ps = gs.ps; (s) ⊦ dom st0 = dom st1 ∧ a ∈ st0 → a ∈ st1; (ss) 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, D3, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, D3, a) = D4; (s)

Proof step 3 from proof step-D3-D4 (previous step) (back to tree)

gs.rvowns(ls.rvref) = Pending(ls.tid), dom gs.vrvHp = dom gs.prvHp, 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, gs.vhead, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), noowns(ls.tid, gs.owns), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.ps, gs.phead ∈ gs.vs, ls.rvref ∈ gs.vrvHp, ls.rvref ∈ gs.prvHp, gs.phead ∈ gs.orl, ¬ dups(gs.qrl), ¬ dups(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.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, 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) ⊦ rvownerok(gs.vretRefs(ls.tid; ls.rvref), gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs(ls.tid; ls.rvref), gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs(ls.tid; ls.rvref), gs.pretRefs) ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns((ls.tid = gs.vs[gs.vs[gs.vhead].next].deqID.tid ⊃ ls.rvref;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))

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-D3-D4 (previous step) (back to tree)

dom vrvHp = dom prvHp, gs = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), rvowns(ls.rvref) = Pending(ls.tid), 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, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(ls.tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, ls.rvref ∈ prvHp, ls.rvref ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + 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), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ rvownerok(vretRefs(ls.tid; ls.rvref), vrvHp, rvowns) ∧ allocrv(vretRefs(ls.tid; ls.rvref), vrvHp) ∧ nonullRetRefs(orl + qrl, vs, vretRefs(ls.tid; ls.rvref), pretRefs) ∧ ( vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns((ls.tid = vs[vs[vhead].next].deqID.tid ⊃ ls.rvref;vretRefs(vs[vs[vhead].next].deqID.tid))) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val))

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-D3-D4 (previous step) (back to tree)

dom vrvHp = dom prvHp, rvowns(ls.rvref) = Pending(ls.tid), 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, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(ls.tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), ls.rvref ∈ vrvHp, ls.rvref ∈ prvHp, phead ∈ orl, phead ∈ vs, phead ∈ 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), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ rvownerok(vretRefs(ls.tid; ls.rvref), vrvHp, rvowns) ∧ allocrv(vretRefs(ls.tid; ls.rvref), vrvHp) ∧ nonullRetRefs(orl + qrl, vs, vretRefs(ls.tid; ls.rvref), pretRefs) ∧ ( vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns((ls.tid = vs[vs[vhead].next].deqID.tid ⊃ ls.rvref;vretRefs(vs[vs[vhead].next].deqID.tid))) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val))

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-D3-D4 (previous step) (back to tree)

dom vrvHp = dom prvHp, ls = mkls(tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), rvowns(rvref) = Pending(tid), orl ≠ [], rvref ≠ 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, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, rvref ∈ prvHp, rvref ∈ 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), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ rvownerok(vretRefs(tid; rvref), vrvHp, rvowns) ∧ allocrv(vretRefs(tid; rvref), vrvHp) ∧ nonullRetRefs(orl + qrl, vs, vretRefs(tid; rvref), pretRefs) ∧ ( vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns((tid = vs[vs[vhead].next].deqID.tid ⊃ rvref;vretRefs(vs[vs[vhead].next].deqID.tid))) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 7 from proof step-D3-D4 (previous step) (back to tree)

dom vrvHp = dom prvHp, rvowns(rvref) = Pending(tid), 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, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), rvref ∈ vrvHp, rvref ∈ prvHp, phead ∈ orl, phead ∈ vs, phead ∈ 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), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ rvownerok(vretRefs(tid; rvref), vrvHp, rvowns) ∧ allocrv(vretRefs(tid; rvref), vrvHp) ∧ nonullRetRefs(orl + qrl, vs, vretRefs(tid; rvref), pretRefs) ∧ ( vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns((tid = vs[vs[vhead].next].deqID.tid ⊃ rvref;vretRefs(vs[vs[vhead].next].deqID.tid))) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val))

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 8 from proof step-D3-D4 (previous step) (back to tree)

dom vrvHp = dom prvHp, rvowns(rvref) = Pending(tid), orl ≠ [], rvref ≠ 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, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, rvref ∈ prvHp, rvref ∈ vrvHp, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ rvownerok(vretRefs(tid; rvref), vrvHp, rvowns), 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), 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:rvownerok-reduce, seq:⊦ rvownerok(vretRefs, vrvHp, rvowns) → ( rvownerok(vretRefs0, vrvHp0, rvowns0) ↔ (∀ tid. ( vretRefs(tid) ≠ null → vretRefs(tid) ∈ vrvHp ∧ rvowns(vretRefs(tid)).tid = tid) → vretRefs0(tid) ≠ null → vretRefs0(tid) ∈ vrvHp0 ∧ rvowns0(vretRefs0(tid)).tid = tid)), subst:[vrvHp, rvowns0, vretRefs, rvowns, vrvHp0, vretRefs0] → [vrvHp, rvowns, vretRefs, rvowns, vrvHp, vretRefs(tid; rvref)], <all paths>

Additional information

Used terms: vrvHp, rvowns, vretRefs, rvowns, vrvHp, vretRefs(tid; rvref)

Proof step 9 from proof step-D3-D4 (previous step) (back to tree)

⊦ rvownerok(vretRefs, vrvHp, rvowns) → ( rvownerok(vretRefs0, vrvHp0, rvowns0) ↔ (∀ tid. (vretRefs(tid) ≠ null → vretRefs(tid) ∈ vrvHp ∧ rvowns(vretRefs(tid)).tid = tid) → vretRefs0(tid) ≠ null → vretRefs0(tid) ∈ vrvHp0 ∧ rvowns0(vretRefs0(tid)).tid = tid))

A spec-lemma

Proof step 10 from proof step-D3-D4 (previous step) (back to tree)

dom vrvHp = dom prvHp, rvowns(rvref) = Pending(tid), 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, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), rvref ∈ vrvHp, rvref ∈ prvHp, phead ∈ orl, phead ∈ vs, phead ∈ 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), ∃ tid0. ¬ ( (vretRefs(tid0) ≠ null → vretRefs(tid0) ∈ vrvHp ∧ rvowns(vretRefs(tid0)).tid = tid0) → vretRefs(tid; rvref)(tid0) ≠ null → vretRefs(tid; rvref)(tid0) ∈ vrvHp ∧ rvowns(vretRefs(tid; rvref)(tid0)).tid = tid0), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, 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 11 from proof step-D3-D4 (previous step) (back to tree)

dom vrvHp = dom prvHp, rvowns(rvref) = Pending(tid), (tid = tid0 ⊃ rvref;vretRefs(tid0)) ≠ null, orl ≠ [], rvref ≠ 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, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, rvref ∈ prvHp, rvref ∈ vrvHp, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vretRefs(tid0) ≠ null → vretRefs(tid0) ∈ vrvHp ∧ rvowns(vretRefs(tid0)).tid = tid0, 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), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (tid = tid0 ⊃ rvref;vretRefs(tid0)) ∈ vrvHp ∧ rvowns((tid = tid0 ⊃ rvref;vretRefs(tid0))).tid = tid0

User applied rule case distinction

And closed the goal!

Rule argument

pos: left 3

Additional information

Used simplifier rules: ⊦ dom st0 = dom st1 ∧ a ∈ st0 → a ∈ st1; (ss) ⊦ Pending(tid).tid = tid; (s)

Proof step 12 from proof step-D3-D4 (previous step) (back to tree)

dom vrvHp = dom prvHp, rvowns(rvref) = Pending(tid), orl ≠ [], rvref ≠ 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, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, rvref ∈ prvHp, rvref ∈ vrvHp, ¬ allocrv(vretRefs(tid; rvref), 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), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), 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:allocrv-reduce, seq:⊦ allocrv(vretRefs, vrvHp) → ( allocrv(vretRefs0, vrvHp0) ↔ (∀ tid. vretRefs(tid) = null ∨ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ≠ null → vretRefs0(tid) = null ∨ vretRefs0(tid) ∈ vrvHp0 ∧ vretRefs0(tid) ≠ null)), subst:[vretRefs, vrvHp, vretRefs0, vrvHp0] → [vretRefs, vrvHp, vretRefs(tid; rvref), vrvHp], <all paths>

Additional information

Used terms: vretRefs, vrvHp, vretRefs(tid; rvref), vrvHp

Proof step 13 from proof step-D3-D4 (previous step) (back to tree)

⊦ allocrv(vretRefs, vrvHp) → ( allocrv(vretRefs0, vrvHp0) ↔ (∀ tid. vretRefs(tid) = null ∨ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ≠ null → vretRefs0(tid) = null ∨ vretRefs0(tid) ∈ vrvHp0 ∧ vretRefs0(tid) ≠ null))

A spec-lemma

Proof step 14 from proof step-D3-D4 (previous step) (back to tree)

dom vrvHp = dom prvHp, rvowns(rvref) = Pending(tid), orl ≠ [], rvref ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), rvref ∈ vrvHp, rvref ∈ prvHp, phead ∈ orl, phead ∈ vs, phead ∈ 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), ∃ tid0. ¬ ( vretRefs(tid0) = null ∨ vretRefs(tid0) ∈ vrvHp ∧ vretRefs(tid0) ≠ null → vretRefs(tid; rvref)(tid0) = null ∨ vretRefs(tid; rvref)(tid0) ∈ vrvHp ∧ vretRefs(tid; rvref)(tid0) ≠ null), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, 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-D3-D4 (previous step) (back to tree)

dom vrvHp = dom prvHp, rvowns(rvref) = Pending(tid), (tid = tid0 ⊃ rvref;vretRefs(tid0)) ≠ null, orl ≠ [], rvref ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, rvref ∈ prvHp, rvref ∈ vrvHp, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ (tid = tid0 ⊃ rvref;vretRefs(tid0)) ∈ vrvHp, 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), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vretRefs(tid0) = null ∨ vretRefs(tid0) ∈ vrvHp ⊦

User applied rule case distinction

And closed the goal!

Rule argument

pos: left 3

Additional information

Used simplifier rules: ⊦ dom st0 = dom st1 ∧ a ∈ st0 → a ∈ st1; (ss)

Proof step 16 from proof step-D3-D4 (previous step) (back to tree)

dom vrvHp = dom prvHp, rvowns(rvref) = Pending(tid), orl ≠ [], rvref ≠ 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, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, rvref ∈ prvHp, rvref ∈ vrvHp, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ nonullRetRefs(orl + qrl, vs, vretRefs(tid; rvref), pretRefs), 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), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

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] ⊦ x ≠ [] → (x + y).head = x.head; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ nonullRetRefs(rl, vs, vretRefs, pretRefs) → ( nonullRetRefs(rl0, vs0, vretRefs0, pretRefs0) ↔ (∀ r. ( r ∈ rl ∧ r ≠ rl.head ∧ vs[r].deqID ≠ None → vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null) → r ∈ rl0 ∧ r ≠ rl0.head ∧ vs0[r].deqID ≠ None → vretRefs0(vs0[r].deqID.tid) ≠ null ∧ pretRefs0(vs0[r].deqID.tid) ≠ null)); (ss)

Proof step 17 from proof step-D3-D4 (previous step) (back to tree)

(tid = vs[r].deqID.tid ⊃ rvref;vretRefs(vs[r].deqID.tid)) = null, dom vrvHp = dom prvHp, rvowns(rvref) = Pending(tid), vs[r].deqID ≠ None, orl ≠ [], pretRefs(vs[r].deqID.tid) ≠ null, r ≠ orl.head, rvref ≠ null, vretRefs(vs[r].deqID.tid) ≠ 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, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), rvref ∈ vrvHp, rvref ∈ prvHp, phead ∈ orl, phead ∈ vs, phead ∈ 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), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), r ∈ orl ∨ r ∈ qrl ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: list-data[reflist], name:elim-add, seq: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail), subst:[x, head, tail] → [orl, vtail0, qrl0]

Additional information

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

Proof step 18 from proof step-D3-D4 (previous step) (back to tree)

(tid = vs[r].deqID.tid ⊃ rvref;vretRefs(vs[r].deqID.tid)) = null, dom vrvHp = dom prvHp, orl = vtail0 + qrl0, rvowns(rvref) = Pending(tid), vs[r].deqID ≠ None, orl ≠ [], pretRefs(vs[r].deqID.tid) ≠ null, r ≠ vtail0, rvref ≠ null, vretRefs(vs[r].deqID.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, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, rvref ∈ prvHp, rvref ∈ 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), r ∈ orl ∨ r ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

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

Proof step 19 from proof step-D3-D4 (previous step) (back to tree)

(tid = vs[r].deqID.tid ⊃ rvref;vretRefs(vs[r].deqID.tid)) = null, dom vrvHp = dom prvHp, rvowns(rvref) = Pending(tid), vs[r].deqID ≠ None, pretRefs(vs[r].deqID.tid) ≠ null, r ≠ vtail0, rvref ≠ null, vretRefs(vs[r].deqID.tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((vtail0 ' + qrl0) + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nextnottid(tid, vhead, vs), noid(tid, (vtail0 ' + qrl0) + qrl, vhead, vs), nonullRetRefs((vtail0 ' + qrl0) + 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), rvref ∈ vrvHp, rvref ∈ prvHp, phead ∈ vs, phead ∈ 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), phead = vtail0 ∨ phead ∈ qrl0, vtail = ((vtail0 ' + qrl0) + qrl).last ∨ qrl ≠ [] ∧ vtail = ((vtail0 ' + qrl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, (vtail0 ' + qrl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ (vtail0 ' + qrl0.butlast).last = vhead ∧ phead ≠ qrl0.last ∧ unmarkedp(qrl, vs), r ∈ qrl0 ∨ r ∈ qrl ⊦

User applied rule case distinction

And closed the goal!

Rule argument

pos: left 1

Additional information

Proof step 20 from proof step-D3-D4 (previous step) (back to tree)

dom vrvHp = dom prvHp, rvowns(rvref) = Pending(tid), vs[vs[vhead].next].deqID ≠ None, vs[vhead].next ≠ null, orl ≠ [], rvowns((tid = vs[vs[vhead].next].deqID.tid ⊃ rvref;vretRefs(vs[vs[vhead].next].deqID.tid))) ≠ Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), rvref ≠ 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, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, rvref ∈ prvHp, rvref ∈ 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), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 21 from proof step-D3-D4 (previous step) (back to tree)

dom vrvHp = dom prvHp, rvowns(rvref) = Pending(tid), rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[vs[vhead].next].deqID ≠ None, vs[vhead].next ≠ null, orl ≠ [], rvowns((tid = vs[vs[vhead].next].deqID.tid ⊃ rvref;vretRefs(vs[vs[vhead].next].deqID.tid))) ≠ Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), rvref ∈ vrvHp, rvref ∈ prvHp, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 7

Additional information

Proof step 22 from proof step-D3-D4 (previous step) (back to tree)

dom vrvHp = dom prvHp, rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), rvowns(rvref) = Pending(tid), tid = vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].deqID ≠ None, vs[vhead].next ≠ null, orl ≠ [], rvowns(rvref) ≠ Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), rvref ≠ 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, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, rvref ∈ prvHp, rvref ∈ vrvHp, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ Pending(tid) ≠ Claimed(tid0, val); (s)

Proof step 23 from proof step-D3-D4 (previous step) (back to tree)

dom vrvHp = dom prvHp, rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), rvowns(rvref) = Pending(vs[vs[vhead].next].deqID.tid), vs[vs[vhead].next].deqID ≠ None, vs[vhead].next ≠ null, orl ≠ [], rvref ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(vs[vs[vhead].next].deqID.tid, vhead, vs), noid(vs[vs[vhead].next].deqID.tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(vs[vs[vhead].next].deqID.tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, rvref ∈ prvHp, rvref ∈ vrvHp, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), 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:nextnottid-def, seq:⊦ nextnottid(tid, vhead, vs) ↔ vs[vhead].next ≠ null → vs[vs[vhead].next].deqID ≠ Some(tid), subst:[tid, vhead, vs] → [vs[vs[vhead].next].deqID.tid, vhead, vs], <all paths>

Additional information

Used terms: vs[vs[vhead].next].deqID.tid, vhead, vs

Proof step 24 from proof step-D3-D4 (previous step) (back to tree)

⊦ nextnottid(tid, vhead, vs) ↔ vs[vhead].next ≠ null → vs[vs[vhead].next].deqID ≠ Some(tid)

A spec-lemma

Proof step 25 from proof step-D3-D4 (previous step) (back to tree)

dom vrvHp = dom prvHp, rvowns(rvref) = Pending(vs[vs[vhead].next].deqID.tid), rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[vs[vhead].next].deqID ≠ None, vs[vhead].next ≠ null, orl ≠ [], rvref ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), noid(vs[vs[vhead].next].deqID.tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(vs[vs[vhead].next].deqID.tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), rvref ∈ vrvHp, rvref ∈ prvHp, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vs[vhead].next ≠ null → vs[vs[vhead].next].deqID ≠ Some(vs[vs[vhead].next].deqID.tid), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, 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 26 from proof step-D3-D4 (previous step) (back to tree)

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

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:listp-in-postfix1, seq:⊦ listp(rl + rl0, vs, ps, owns) ∧ r ∈ rl → (∃ rl1, rl2. rl = rl1 + r ' + rl2 ∧ listp(r ' + rl2 + rl0, vs, ps, owns)), subst:[ps, rl, owns, r, rl0, vs] → [ps, orl, owns, vhead, qrl, vs]

Additional information

Used terms: ps, orl, owns, vhead, qrl, vs

Proof step 27 from proof step-D3-D4 (previous step) (back to tree)

⊦ listp(rl + rl0, vs, ps, owns) ∧ r ∈ rl → (∃ rl1, rl2. rl = rl1 + r ' + rl2 ∧ listp(r ' + rl2 + rl0, vs, ps, owns))

A spec-lemma

Proof step 28 from proof step-D3-D4 (previous step) (back to tree)

dom vrvHp = dom prvHp, rvowns(rvref) = Pending(vs[vs[vhead].next].deqID.tid), rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[vs[vhead].next].deqID ≠ None, vs[vs[vhead].next].deqID ≠ Some(vs[vs[vhead].next].deqID.tid), vs[vhead].next ≠ null, orl ≠ [], rvref ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), noid(vs[vs[vhead].next].deqID.tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(vs[vs[vhead].next].deqID.tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), rvref ∈ vrvHp, rvref ∈ prvHp, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), listp(orl + qrl, vs, ps, owns) ∧ vhead ∈ orl → (∃ rl1, rl2. orl = rl1 + vhead ' + rl2 ∧ listp(vhead ' + rl2 + qrl, vs, ps, owns)), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, 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 29 from proof step-D3-D4 (previous step) (back to tree)

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

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 28

Additional information

Proof step 30 from proof step-D3-D4 (previous step) (back to tree)

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

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 30

Additional information

Used simplifier rules: ⊦ x.last ∈ x ↔ x ≠ []; (s)

Proof step 31 from proof step-D3-D4 (previous step) (back to tree)

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ x ≠ [] → (x.butlast = [] ↔ x = x.head '); (ss)

Proof step 32 from proof step-D3-D4 (previous step) (back to tree)

dom vrvHp = dom prvHp, rvowns(rvref) = Pending(vs[vs[orl.butlast.last].next].deqID.tid), rvowns(vretRefs(vs[vs[orl.butlast.last].next].deqID.tid)) = Claimed(vs[vs[orl.butlast.last].next].deqID.tid, vs[vs[orl.butlast.last].next].val), vs[vs[orl.butlast.last].next].deqID ≠ None, vs[vs[orl.butlast.last].next].deqID ≠ Some(vs[vs[orl.butlast.last].next].deqID.tid), vs[orl.butlast.last].next ≠ null, orl ≠ [], orl ≠ orl.head ', phead ≠ orl.last, rvref ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), noid(vs[vs[orl.butlast.last].next].deqID.tid, orl + qrl, orl.butlast.last, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(vs[vs[orl.butlast.last].next].deqID.tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, vs), unmarkedp(qrl, ps), rvref ∈ vrvHp, rvref ∈ prvHp, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ orl.butlast.last ∈ orl, 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: list-data[reflist], name:elim-add, seq: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail), subst:[x, head, tail] → [orl, vtail0, qrl0]

Additional information

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

Proof step 33 from proof step-D3-D4 (previous step) (back to tree)

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

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

Proof step 34 from proof step-D3-D4 (previous step) (back to tree)

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

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] → [qrl0, phead0, qrl1]

Additional information

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

Proof step 35 from proof step-D3-D4 (previous step) (back to tree)

dom vrvHp = dom prvHp, qrl0 = qrl1 + phead0 ', rvowns(vretRefs(vs[vs[(vtail0 ' + qrl1).last].next].deqID.tid)) = Claimed(vs[vs[(vtail0 ' + qrl1).last].next].deqID.tid, vs[vs[(vtail0 ' + qrl1).last].next].val), rvowns(rvref) = Pending(vs[vs[(vtail0 ' + qrl1).last].next].deqID.tid), vs[vs[(vtail0 ' + qrl1).last].next].deqID ≠ None, vs[vs[(vtail0 ' + qrl1).last].next].deqID ≠ Some(vs[vs[(vtail0 ' + qrl1).last].next].deqID.tid), (vtail0 ' + qrl1).last ≠ vtail0, vs[(vtail0 ' + qrl1).last].next ≠ null, phead ≠ phead0, qrl0 ≠ [], rvref ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((vtail0 ' + qrl0) + qrl, vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), noid(vs[vs[(vtail0 ' + qrl1).last].next].deqID.tid, (vtail0 ' + qrl0) + qrl, (vtail0 ' + qrl1).last, vs), nonullRetRefs((vtail0 ' + qrl0) + qrl, vs, vretRefs, pretRefs), noowns(vs[vs[(vtail0 ' + qrl1).last].next].deqID.tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vtail0].deqID), some?(ps[vtail0].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, vs), phead ∈ ps, phead ∈ vs, rvref ∈ prvHp, rvref ∈ vrvHp, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, ¬ (vtail0 ' + qrl1).last ∈ qrl0, vtail = (qrl0 + qrl).last ∨ qrl ≠ [] ∧ vtail = (qrl0 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead = vtail0 ∨ phead ∈ qrl0 ⊦

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 36 from proof step-D3-D4 (previous step) (back to tree)

dom vrvHp = dom prvHp, rvowns(rvref) = Pending(vs[vs[(vtail0 ' + qrl1).last].next].deqID.tid), rvowns(vretRefs(vs[vs[(vtail0 ' + qrl1).last].next].deqID.tid)) = Claimed(vs[vs[(vtail0 ' + qrl1).last].next].deqID.tid, vs[vs[(vtail0 ' + qrl1).last].next].val), vs[vs[(vtail0 ' + qrl1).last].next].deqID ≠ None, vs[vs[(vtail0 ' + qrl1).last].next].deqID ≠ Some(vs[vs[(vtail0 ' + qrl1).last].next].deqID.tid), (vtail0 ' + qrl1).last ≠ vtail0, (vtail0 ' + qrl1).last ≠ phead0, vs[(vtail0 ' + qrl1).last].next ≠ null, phead ≠ phead0, rvref ≠ null, vtail0 ≠ phead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((vtail0 ' + qrl1 + phead0 ') + qrl, vs, ps, owns), markedp(qrl1, ps), markedp(qrl1, vs), noid(vs[vs[(vtail0 ' + qrl1).last].next].deqID.tid, (vtail0 ' + qrl1 + phead0 ') + qrl, (vtail0 ' + qrl1).last, vs), nonullRetRefs((vtail0 ' + qrl1 + phead0 ') + qrl, vs, vretRefs, pretRefs), noowns(vs[vs[(vtail0 ' + qrl1).last].next].deqID.tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), some?(ps[phead0].deqID), some?(vs[phead0].deqID), unmarkedp(qrl, vs), unmarkedp(qrl, ps), rvref ∈ vrvHp, rvref ∈ prvHp, phead ∈ vs, phead ∈ ps, ¬ dups(qrl1 + qrl), ¬ dups(qrl1), ¬ dups(qrl), ¬ phead0 ∈ qrl1, ¬ phead0 ∈ qrl, ¬ vtail0 ∈ qrl1, ¬ vtail0 ∈ qrl, ¬ (vtail0 ' + qrl1).last ∈ qrl1, phead = vtail0 ∨ phead ∈ qrl1, vtail = (phead0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (phead0 ' + 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: list-last[reflist], name:lapp, seq: ⊦ y ≠ [] → (x + y).last = y.last, subst:[x, y] → [vtail0 ', qrl1], <all paths>

Additional information

Used simplifier rules: ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a '.last = a; (s) Used terms: vtail0 ', qrl1

Proof step 37 from proof step-D3-D4 (previous step) (back to tree)

⊦ y ≠ [] → (x + y).last = y.last

A spec-lemma

Proof step 38 from proof step-D3-D4 (previous step) (back to tree)

dom vrvHp = dom prvHp, orl = rl1 + vhead ' + rl2, rvowns(rvref) = Pending(vs[vs[vhead].next].deqID.tid), rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[vs[vhead].next].deqID ≠ None, vs[vs[vhead].next].deqID ≠ Some(vs[vs[vhead].next].deqID.tid), vs[vhead].next ≠ null, orl ≠ [], rvref ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), listp(vhead ' + rl2 + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), noid(vs[vs[vhead].next].deqID.tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(vs[vs[vhead].next].deqID.tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), rvref ∈ vrvHp, rvref ∈ prvHp, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, 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] ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ (x + a ' + y).butlast = x + (a ' + y).butlast; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (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) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ x + a ' + y ≠ []; (s)

Proof step 39 from proof step-D3-D4 (previous step) (back to tree)

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

User applied rule structural induction

And obtained the following new goals

Rule argument

term: vs[vs[vhead].next].deqID

Additional information

Used simplifier rules: OptTid freely generated by None, Some, Weak;; ⊦ None ≠ Some(tid); (s) ⊦ Some(tid).tid = tid; (s) ⊦ Some(tid) = Some(tid0) ↔ tid = tid0; (s)

Proof step 40 from proof step-D3-D4 (previous step) (back to tree)

Weak(tid) = vs[vs[vhead].next].deqID, dom vrvHp = dom prvHp, rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), rvowns(rvref) = Pending(vs[vs[vhead].next].deqID.tid), vs[vs[vhead].next].deqID ≠ Some(vs[vs[vhead].next].deqID.tid), vs[vs[vhead].next].deqID ≠ None, vs[vhead].next ≠ null, rvref ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vhead ' + rl2 + qrl, vs, ps, owns), listp((rl1 + vhead ' + rl2) + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl2, vs), markedp(rl1, ps), markedp(rl2, ps), noid(vs[vs[vhead].next].deqID.tid, (rl1 + vhead ' + rl2) + qrl, vhead, vs), nonullRetRefs((rl1 + vhead ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(vs[vs[vhead].next].deqID.tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead].deqID), some?(ps[vhead].deqID), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, rvref ∈ prvHp, rvref ∈ vrvHp, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl2), ¬ dups(qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ rl2, ¬ vhead ∈ rl1, phead ∈ rl1 ∨ phead = vhead ∨ phead ∈ rl2, (vhead ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (vhead ' + rl2).butlast ≠ [] ∧ (rl1 + (vhead ' + rl2).butlast).last = vhead ∧ phead ≠ (vhead ' + rl2).last ∧ unmarkedp(qrl, vs), vtail = (vhead ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (vhead ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ Weak(tid).tid = tid; (s) ⊦ Some(tid) ≠ Weak(tid0); (s) ⊦ None ≠ Weak(tid); (s)

Proof step 41 from proof step-D3-D4 (previous step) (back to tree)

Weak(tid) = vs[vs[vhead].next].deqID, dom vrvHp = dom prvHp, rvowns(vretRefs(tid)) = Claimed(tid, vs[vs[vhead].next].val), rvowns(rvref) = Pending(tid), vs[vhead].next ≠ null, rvref ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vhead ' + rl2 + qrl, vs, ps, owns), listp((rl1 + vhead ' + rl2) + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl2, vs), markedp(rl1, ps), markedp(rl2, ps), noid(tid, (rl1 + vhead ' + rl2) + qrl, vhead, vs), nonullRetRefs((rl1 + vhead ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead].deqID), some?(ps[vhead].deqID), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, rvref ∈ prvHp, rvref ∈ vrvHp, ¬ dups(qrl), ¬ dups(rl2), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1), ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2), ¬ vhead ∈ rl1, ¬ vhead ∈ rl2, ¬ vhead ∈ qrl, phead ∈ rl1 ∨ phead = vhead ∨ phead ∈ rl2, (vhead ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (vhead ' + rl2).butlast ≠ [] ∧ (rl1 + (vhead ' + rl2).butlast).last = vhead ∧ phead ≠ (vhead ' + rl2).last ∧ unmarkedp(qrl, vs), vtail = (vhead ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (vhead ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: rl2

Additional information

Used simplifier rules: reflist freely generated by [], +;; ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ listp(r ' + r0 ' + rl, vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = vs[r].next ∧ ps[r].next = r0 ∧ listp(r0 ' + rl, vs, ps, owns); (s) ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ x + a ' + y ≠ []; (s) ⊦ (a ' + b ' + x).butlast = a ' + (b ' + x).butlast; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ a + x = a ' + x; (s) ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ ¬ some?(Weak(tid)); (s)

Proof step 42 from proof step-D3-D4 (previous step) (back to tree)

Weak(tid) = vs[vs[vhead].next].deqID, dom vrvHp = dom prvHp, rl2 = [], rvowns(rvref) = Pending(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[vs[vhead].next].val), vs[vhead].next ≠ null, rvref ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((rl1 + vhead ' + rl2) + qrl, vs, ps, owns), listp(vhead ' + rl2 + qrl, vs, ps, owns), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs), markedp(rl1, vs), noid(tid, (rl1 + vhead ' + rl2) + qrl, vhead, vs), nonullRetRefs((rl1 + vhead ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead].deqID), some?(vs[vhead].deqID), unmarkedp(qrl, ps), rvref ∈ vrvHp, rvref ∈ prvHp, phead ∈ vs, phead ∈ ps, ¬ dups(qrl), ¬ dups(rl2), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1), ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2), ¬ vhead ∈ rl1, ¬ vhead ∈ rl2, ¬ vhead ∈ qrl, vtail = (vhead ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (vhead ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, (vhead ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (vhead ' + rl2).butlast ≠ [] ∧ (rl1 + (vhead ' + rl2).butlast).last = vhead ∧ phead ≠ (vhead ' + rl2).last ∧ unmarkedp(qrl, vs), phead ∈ rl1 ∨ phead = vhead ∨ phead ∈ rl2 ⊦

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 = x; (s) ⊦ a '.last = a; (s) ⊦ x + [] = x; (s) ⊦ a '.butlast = []; (s) ⊦ ¬ a ∈ []; (s) ⊦ ¬ dups([]); (s) ⊦ markedp([], vs); (s)

Proof step 43 from proof step-D3-D4 (previous step) (back to tree)

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

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: qrl

Additional information

Used simplifier rules: reflist freely generated by [], +;; ⊦ unmarkedp([], vs); (s) ⊦ listp(r ', vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = null ∧ ( vs[r].next ≠ null → vs[r].next ∈ vs ∧ vs[r].next ∈ ps ∧ ps[vs[r].next] = vs[vs[r].next] ∧ ps[vs[r].next].deqID = None ∧ ps[vs[r].next].next = null ∧ weak?(owns(vs[r].next))); (s) ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ ¬ dups([]); (s) ⊦ ¬ a ∈ []; (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a '.last = a; (s) ⊦ None ≠ Weak(tid); (s)

Proof step 44 from proof step-D3-D4 (previous step) (back to tree)

Weak(tid) = vs[vs[vhead].next].deqID, dom vrvHp = dom prvHp, qrl = vhead0 + qrl0, rvowns(rvref) = Pending(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[vs[vhead].next].val), vs[vhead].next ≠ null, rvref ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + vhead ' + qrl, vs, ps, owns), listp(vhead ' + qrl, vs, ps, owns), markedp(rl1, ps), markedp(rl1, vs), noid(tid, rl1 + vhead ' + qrl, vhead, vs), nonullRetRefs(rl1 + vhead ' + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead].deqID), some?(vs[vhead].deqID), unmarkedp(qrl, ps), rvref ∈ vrvHp, rvref ∈ prvHp, phead ∈ vs, phead ∈ ps, ¬ dups(rl1 + qrl), ¬ dups(rl1), ¬ dups(qrl), ¬ vhead ∈ rl1, ¬ vhead ∈ qrl, vtail = (vhead ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vhead ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 ≠ [] ∧ rl1.last = vhead ∧ phead ≠ rl1.last ∧ unmarkedp(qrl, vs), phead ∈ rl1 ∨ phead = vhead ⊦

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] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a + x = a ' + x; (s) ⊦ a ' + x ≠ []; (s) ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ (a ' + x).tail = x; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ listp(r ' + r0 ' + rl, vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = vs[r].next ∧ ps[r].next = r0 ∧ listp(r0 ' + rl, vs, ps, owns); (s)

Proof step 45 from proof step-D3-D4 (previous step) (back to tree)

ps[vhead].deqID = vs[vhead].deqID, ps[vs[vhead].next].deqID = None, ps[vhead].next = vs[vhead].next, ps[vhead].val = vs[vhead].val, Weak(tid) = vs[vs[vhead].next].deqID, dom vrvHp = dom prvHp, owns(vhead) = None, rvowns(rvref) = Pending(tid), rvowns(vretRefs(tid)) = Claimed(tid, vs[vs[vhead].next].val), vs[vhead].next ≠ null, rvref ≠ null, vhead ≠ vs[vhead].next, vhead ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + vhead ' + vs[vhead].next ' + qrl0, vs, ps, owns), listp(vs[vhead].next ' + qrl0, vs, ps, owns), markedp(rl1, ps), markedp(rl1, vs), noid(tid, rl1 + vhead ' + vs[vhead].next ' + qrl0, vhead, vs), nonullRetRefs(rl1 + vhead ' + vs[vhead].next ' + qrl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[vhead].deqID), unmarkedp(qrl0, vs), unmarkedp(qrl0, ps), vhead ∈ ps, vhead ∈ vs, rvref ∈ vrvHp, rvref ∈ prvHp, phead ∈ vs, phead ∈ ps, ¬ dups(qrl0), ¬ dups(rl1), ¬ dups(rl1 + qrl0), ¬ weak?(vs[vhead].deqID), ¬ vhead ∈ qrl0, ¬ vhead ∈ rl1, ¬ vs[vhead].next ∈ qrl0, ¬ vs[vhead].next ∈ rl1, vtail = (vs[vhead].next ' + qrl0).last ∨ vtail = (vhead ' + (vs[vhead].next ' + qrl0).butlast).last ∧ vs[(vs[vhead].next ' + qrl0).last].deqID = None ∧ vs[(vs[vhead].next ' + qrl0).last].next = null, phead ∈ rl1 ∨ phead = vhead ⊦

User applied rule constructor cut

And closed the goal!

Rule argument

var: qrl0

Additional information

Used simplifier rules: reflist freely generated by [], +;; ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ listp(r ' + r0 ' + rl, vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = vs[r].next ∧ ps[r].next = r0 ∧ listp(r0 ' + rl, vs, ps, owns); (s) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ (a ' + b ' + x).butlast = a ' + (b ' + x).butlast; (s) ⊦ a + x = a ' + x; (s) ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ weak?(Weak(tid)); (s) ⊦ unmarkedp([], vs); (s) ⊦ listp(r ', vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = null ∧ ( vs[r].next ≠ null → vs[r].next ∈ vs ∧ vs[r].next ∈ ps ∧ ps[vs[r].next] = vs[vs[r].next] ∧ ps[vs[r].next].deqID = None ∧ ps[vs[r].next].next = null ∧ weak?(owns(vs[r].next))); (s) ⊦ ¬ dups([]); (s) ⊦ ¬ a ∈ []; (s) ⊦ a '.butlast = []; (s) ⊦ x + [] = x; (s) ⊦ a '.last = a; (s)

Proof Tree for step-D3-D4 (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