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

⊦ ( ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = 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)) ∧ listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∧ (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, ls.tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(ls.tid) = gs0.vretRefs(ls.tid) ∧ (gs.pretRefs(ls.tid) = gs0.pretRefs(ls.tid) ∨ gs.vretRefs(ls.tid) = gs0.pretRefs(ls.tid)) ∧ rvownsrely(ls.tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(ls.tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(ls.tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(ls.tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(ls.tid, gs.owns, gs0.owns) → (ls.lst ∈ gs0.orl + gs0.qrl ∧ gs0.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ (¬ ls.success ∧ gs0.rvowns(gs0.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs0.orl ∧ gs0.vhead ∈ gs0.orl from ls.first) ∧ (gs0.vretRefs(ls.tid) = ls.rvref ∧ gs0.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs0.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs0.vhead, gs0.vs) ∧ noid(ls.tid, gs0.orl + gs0.qrl, ls.first, gs0.vs) ∧ noowns(ls.tid, gs0.owns)

System applied rule normalize

And obtained the following new goals

Rule argument

Additional information

Proof step 2 from proof stable-D14 (previous step) (back to tree)

ls.nxt = null, gs.pretRefs(ls.tid) = ls.rvref, gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid), gs.vretRefs(ls.tid) = ls.rvref, gs.vretRefs(ls.tid) = gs0.vretRefs(ls.tid), gs.vrvHp[ls.rvref] = Empty, dom gs.vrvHp = dom gs.prvHp, dom gs0.vrvHp = dom gs0.prvHp, gs0.orl ≠ [], gs.orl ≠ [], ls.rvref ≠ null, allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), allocrv(gs0.vretRefs, gs0.vrvHp), allocrv(gs0.pretRefs, gs0.prvHp), equalowns(gs.vs, gs.ps, gs.owns, ls.tid, gs0.vs, gs0.ps, gs0.owns), equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), markedp(gs0.orl, gs0.ps), markedp(gs0.orl, gs0.vs), nextnottid(ls.tid, gs.vhead, gs.vs), nextnottidRely(ls.tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs), noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs), noidRely(ls.tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), noowns(ls.tid, gs.owns), ownsRely(ls.tid, gs.owns, gs0.owns), prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownsrely(ls.tid, gs.rvowns, gs0.rvowns, gs.vrvHp), rvrely(ls.tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp), unmarkedp(gs.qrl, gs.ps), unmarkedp(gs0.qrl, gs0.ps), gs.phead ∈ gs.orl, ls.lst ∈ gs.orl + gs.qrl, ls.first ∈ gs.orl, gs.vhead ∈ gs.orl from ls.first, ls.rvref ∈ gs.vrvHp, gs0.phead ∈ gs0.orl, gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail, gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead, gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead, dom gs.vrvHp ⊆ dom gs0.vrvHp, ¬ ls.success, ¬ dups(gs0.orl + gs0.qrl), ¬ 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), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl, ∃ rl0. gs.orl + rl0 = gs0.orl, 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, gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null, gs.pretRefs(ls.tid) = gs0.pretRefs(ls.tid) ∨ gs.vretRefs(ls.tid) = gs0.pretRefs(ls.tid) ⊦ (ls.lst ∈ gs0.orl + gs0.qrl ∧ gs0.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ (¬ ls.success ∧ gs0.rvowns(gs0.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs0.orl ∧ gs0.vhead ∈ gs0.orl from ls.first) ∧ (gs0.vretRefs(ls.tid) = ls.rvref ∧ gs0.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs0.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs0.vhead, gs0.vs) ∧ noid(ls.tid, gs0.orl + gs0.qrl, ls.first, gs0.vs) ∧ noowns(ls.tid, gs0.owns)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ rvownsrely(tid, rvowns, rvowns0, vrvHp) ∧ rvowns(addr) = Pending(tid) ∧ addr ∈ vrvHp ∧ addr ≠ null → (rvowns0(addr) = Pending(tid) ↔ true); (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 ⊦ noowns(tid, owns) ∧ ownsRely(tid, owns, owns0) → noowns(tid, owns0); (ss) ⊦ nextnottidRely(tid, vhead, vs, vhead0, vs0) ∧ nextnottid(tid, vhead, vs) → nextnottid(tid, vhead0, vs0); (ss) ⊦ dom vrvHp ⊆ dom vrvHp0 ∧ rvref ∈ vrvHp → rvref ∈ vrvHp0; (ss) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s)

Proof step 3 from proof stable-D14 (previous step) (back to tree)

gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl, gs.orl + rl0 = gs0.orl, ls.nxt = null, gs.pretRefs(ls.tid) = ls.rvref, gs.rvowns(ls.rvref) = Pending(ls.tid), ls.rvref = gs0.vretRefs(ls.tid), ls.rvref = gs0.pretRefs(ls.tid), gs.vretRefs(ls.tid) = ls.rvref, gs.vrvHp[ls.rvref] = Empty, dom gs.vrvHp = dom gs.prvHp, dom gs0.vrvHp = dom gs0.prvHp, gs.orl ≠ [], gs0.orl ≠ [], ls.rvref ≠ null, allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), allocrv(gs0.vretRefs, gs0.vrvHp), allocrv(gs0.pretRefs, gs0.prvHp), equalowns(gs.vs, gs.ps, gs.owns, ls.tid, gs0.vs, gs0.ps, gs0.owns), equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), markedp(gs0.orl, gs0.ps), markedp(gs0.orl, gs0.vs), nextnottid(ls.tid, gs.vhead, gs.vs), nextnottidRely(ls.tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs), noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs), noidRely(ls.tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), noowns(ls.tid, gs.owns), ownsRely(ls.tid, gs.owns, gs0.owns), prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownsrely(ls.tid, gs.rvowns, gs0.rvowns, gs.vrvHp), rvrely(ls.tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp), unmarkedp(gs.qrl, gs.ps), unmarkedp(gs0.qrl, gs0.ps), gs.phead ∈ gs.ps, ls.first ∈ gs.ps, gs.phead ∈ gs.vs, ls.first ∈ gs.vs, gs0.phead ∈ gs0.ps, gs0.phead ∈ gs0.vs, gs.phead ∈ gs.orl, ls.first ∈ gs.orl, gs.vhead ∈ gs.orl from ls.first, ls.rvref ∈ gs.vrvHp, gs0.phead ∈ gs0.orl, gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail, gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead, gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead, dom gs.prvHp ⊆ dom gs0.prvHp, ¬ ls.success, ¬ dups(gs0.qrl), ¬ dups(gs0.orl), ¬ dups(gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.orl + gs.qrl), ¬ dups(gs0.orl + gs0.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), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.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, gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[gs0.qrl.last].next = null, ls.lst ∈ gs.orl ∨ ls.lst ∈ gs.qrl, 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), gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs) ⊦ (ls.lst ∈ gs0.orl ∨ ls.lst ∈ gs0.qrl) ∧ gs0.vrvHp[ls.rvref] = Empty ∧ ls.first ∈ gs0.orl ∧ gs0.vhead ∈ gs0.orl from ls.first ∧ noid(ls.tid, gs0.orl + gs0.qrl, ls.first, gs0.vs)

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 stable-D14 (previous step) (back to tree)

orl + rl0 = gs0.orl, orl + qrl + rl = gs0.orl + gs0.qrl, ls.nxt = null, ls.rvref = gs0.pretRefs(ls.tid), ls.rvref = gs0.vretRefs(ls.tid), vrvHp[ls.rvref] = Empty, dom gs0.vrvHp = dom gs0.prvHp, 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, gs0.orl ≠ [], ls.rvref ≠ null, orl ≠ [], allocrv(gs0.pretRefs, gs0.prvHp), allocrv(gs0.vretRefs, gs0.vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, ls.tid, gs0.vs, gs0.ps, gs0.owns), equalrl(orl + qrl, vs, ps, gs0.vs, gs0.ps), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), listp(orl + qrl, vs, ps, owns), markedp(gs0.orl, gs0.vs), markedp(gs0.orl, gs0.ps), markedp(orl, vs), markedp(orl, ps), nextnottid(ls.tid, vhead, vs), nextnottidRely(ls.tid, vhead, vs, gs0.vhead, gs0.vs), noid(ls.tid, orl + qrl, ls.first, vs), noidRely(ls.tid, orl + qrl, vs, gs0.orl + gs0.qrl, gs0.vs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(ls.tid, owns), ownsRely(ls.tid, owns, gs0.owns), prvHpRely(vrvHp, prvHp, gs0.prvHp), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(ls.tid, rvowns, gs0.rvowns, vrvHp), rvrely(ls.tid, rvowns, vretRefs, vrvHp, gs0.vretRefs, gs0.vrvHp), unmarkedp(gs0.qrl, gs0.ps), unmarkedp(qrl, ps), gs0.vhead ∈ gs0.orl + gs0.qrl from vhead, gs0.phead ∈ gs0.orl + gs0.qrl from phead, gs0.vtail ∈ gs0.orl + gs0.qrl from vtail, gs0.phead ∈ gs0.orl, ls.rvref ∈ vrvHp, vhead ∈ orl from ls.first, ls.first ∈ orl, phead ∈ orl, gs0.phead ∈ gs0.vs, gs0.phead ∈ gs0.ps, ls.first ∈ vs, phead ∈ vs, ls.first ∈ ps, phead ∈ ps, dom prvHp ⊆ dom gs0.prvHp, ¬ ls.success, ¬ dups(gs0.qrl), ¬ dups(gs0.orl), ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), 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), gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), 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, gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[gs0.qrl.last].next = null, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (ls.lst ∈ gs0.orl ∨ ls.lst ∈ gs0.qrl) ∧ gs0.vrvHp[ls.rvref] = Empty ∧ ls.first ∈ gs0.orl ∧ gs0.vhead ∈ gs0.orl from ls.first ∧ noid(ls.tid, gs0.orl + gs0.qrl, ls.first, gs0.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] ⊦ noidRely(tid, orl + qrl, vs, orl + rl0 + qrl0, vs0) ∧ noid(tid, orl + qrl, first, vs) → noid(tid, orl + rl0 + qrl0, first, vs0); (ss) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x → a ∈ x + y; (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ # x = # z → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) 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 stable-D14 (previous step) (back to tree)

orl + rl0 = gs0.orl, qrl + rl = rl0 + gs0.qrl, ls.nxt = null, ls.rvref = gs0.pretRefs(ls.tid), ls.rvref = gs0.vretRefs(ls.tid), vrvHp[ls.rvref] = Empty, dom gs0.vrvHp = dom gs0.prvHp, dom vrvHp = dom prvHp, pretRefs(ls.tid) = ls.rvref, rvowns(ls.rvref) = Pending(ls.tid), vretRefs(ls.tid) = ls.rvref, orl + rl0 ≠ [], ls.rvref ≠ null, orl ≠ [], allocrv(gs0.pretRefs, gs0.prvHp), allocrv(gs0.vretRefs, gs0.vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, ls.tid, gs0.vs, gs0.ps, gs0.owns), equalrl(orl + qrl, vs, ps, gs0.vs, gs0.ps), listp((orl + rl0) + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), markedp(orl, gs0.vs), markedp(rl0, gs0.vs), markedp(orl, gs0.ps), markedp(rl0, gs0.ps), nextnottid(ls.tid, vhead, vs), nextnottidRely(ls.tid, vhead, vs, gs0.vhead, gs0.vs), noid(ls.tid, orl + qrl, ls.first, vs), noidRely(ls.tid, orl + qrl, vs, (orl + rl0) + gs0.qrl, gs0.vs), nonullRetRefs((orl + rl0) + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(ls.tid, owns), ownsRely(ls.tid, owns, gs0.owns), prvHpRely(vrvHp, prvHp, gs0.prvHp), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(ls.tid, rvowns, gs0.rvowns, vrvHp), rvrely(ls.tid, rvowns, vretRefs, vrvHp, gs0.vretRefs, gs0.vrvHp), unmarkedp(gs0.qrl, gs0.ps), unmarkedp(qrl, ps), gs0.vhead ∈ (orl + rl0) + gs0.qrl from vhead, gs0.vtail ∈ (orl + rl0) + gs0.qrl from vtail, ls.rvref ∈ vrvHp, vhead ∈ orl from ls.first, ls.first ∈ orl, phead ∈ orl, gs0.phead ∈ gs0.vs, gs0.phead ∈ gs0.ps, ls.first ∈ gs0.ps, phead ∈ gs0.ps, ls.first ∈ gs0.vs, phead ∈ gs0.vs, ls.first ∈ ps, phead ∈ ps, ls.first ∈ vs, phead ∈ vs, dom prvHp ⊆ dom gs0.prvHp, ¬ ls.success, ¬ dups(rl0), ¬ dups(gs0.qrl), ¬ dups(orl + rl0), ¬ dups(qrl + rl), ¬ dups(orl), ¬ dups((orl + rl0) + gs0.qrl), ¬ dups(orl + qrl), ¬ dups(qrl), ¬ dups(rl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), 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 + rl0).last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = gs0.vhead ∧ gs0.phead ≠ (orl + rl0).last ∧ unmarkedp(gs0.qrl, gs0.vs), 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, gs0.vtail = ((orl + rl0) + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = ((orl + rl0) + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[gs0.qrl.last].next = null, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, gs0.phead ∈ orl from phead ∨ gs0.phead ∈ rl0 ∨ gs0.phead ∈ gs0.qrl, gs0.phead ∈ orl ∨ gs0.phead ∈ rl0 ⊦ (ls.lst ∈ orl ∨ ls.lst ∈ rl0 ∨ ls.lst ∈ gs0.qrl) ∧ gs0.vrvHp[ls.rvref] = Empty ∧ (gs0.vhead ∈ orl from ls.first ∨ gs0.vhead ∈ rl0)

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] → [qrl0, ps0, phead0, vrvHp0, vretRefs0, vhead0, vtail0, gs0, owns0, rvowns0, orl0, prvHp0, pretRefs0, vs0]

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: qrl0, ps0, phead0, vrvHp0, vretRefs0, vhead0, vtail0, gs0, owns0, rvowns0, orl0, prvHp0, pretRefs0, vs0

Proof step 6 from proof stable-D14 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, orl + rl0 = orl0, ls.nxt = null, ls.rvref = vretRefs0(ls.tid), ls.rvref = pretRefs0(ls.tid), vrvHp[ls.rvref] = Empty, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, gs0 = mkgs(ps0, vs0, phead0, vhead0, vtail0, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), pretRefs(ls.tid) = ls.rvref, rvowns(ls.rvref) = Pending(ls.tid), vretRefs(ls.tid) = ls.rvref, orl + rl0 ≠ [], ls.rvref ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, ls.tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), markedp(rl0, ps0), markedp(orl, ps0), markedp(rl0, vs0), markedp(orl, vs0), markedp(orl, ps), markedp(orl, vs), nextnottid(ls.tid, vhead, vs), nextnottidRely(ls.tid, vhead, vs, vhead0, vs0), noid(ls.tid, orl + qrl, ls.first, vs), noidRely(ls.tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), noowns(ls.tid, owns), ownsRely(ls.tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(ls.tid, rvowns, rvowns0, vrvHp), rvrely(ls.tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), phead ∈ vs, ls.first ∈ vs, phead ∈ ps, ls.first ∈ ps, phead ∈ vs0, ls.first ∈ vs0, phead ∈ ps0, ls.first ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, ls.first ∈ orl, vhead ∈ orl from ls.first, ls.rvref ∈ vrvHp, vtail0 ∈ (orl + rl0) + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ ls.success, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(orl + rl0), ¬ dups(qrl + rl), ¬ dups(orl), ¬ dups((orl + rl0) + qrl0), ¬ dups(orl + qrl), ¬ dups(qrl), ¬ dups(rl), 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), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.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), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0) ⊦ (ls.lst ∈ orl ∨ ls.lst ∈ rl0 ∨ ls.lst ∈ qrl0) ∧ vrvHp0[ls.rvref] = Empty ∧ (vhead0 ∈ orl from ls.first ∨ vhead0 ∈ rl0)

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 7 from proof stable-D14 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, ls.nxt = null, ls.rvref = pretRefs0(ls.tid), ls.rvref = vretRefs0(ls.tid), vrvHp[ls.rvref] = Empty, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(ls.tid) = ls.rvref, rvowns(ls.rvref) = Pending(ls.tid), vretRefs(ls.tid) = ls.rvref, orl + rl0 ≠ [], ls.rvref ≠ null, orl ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, ls.tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), markedp(orl, vs0), markedp(rl0, vs0), markedp(orl, ps0), markedp(rl0, ps0), nextnottid(ls.tid, vhead, vs), nextnottidRely(ls.tid, vhead, vs, vhead0, vs0), noid(ls.tid, orl + qrl, ls.first, vs), noidRely(ls.tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(ls.tid, owns), ownsRely(ls.tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(ls.tid, rvowns, rvowns0, vrvHp), rvrely(ls.tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from vtail, ls.rvref ∈ vrvHp, vhead ∈ orl from ls.first, ls.first ∈ orl, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, ls.first ∈ ps, phead ∈ ps, ls.first ∈ vs, phead ∈ vs, ls.first ∈ vs0, phead ∈ vs0, ls.first ∈ ps0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ ls.success, ¬ dups((orl + rl0) + qrl0), ¬ dups(orl + qrl), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), 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 + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), 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, vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0 ⊦ (ls.lst ∈ orl ∨ ls.lst ∈ rl0 ∨ ls.lst ∈ qrl0) ∧ vrvHp0[ls.rvref] = Empty ∧ (vhead0 ∈ orl from ls.first ∨ vhead0 ∈ rl0)

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

qrl + rl = rl0 + qrl0, vrvHp[rvref] = Empty, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, ls = mkls(tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), nxt = null, pretRefs(tid) = rvref, rvowns(rvref) = Pending(tid), rvref = vretRefs0(tid), rvref = pretRefs0(tid), ¬ success, vretRefs(tid) = rvref, orl + rl0 ≠ [], orl ≠ [], rvref ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), markedp(rl0, ps0), markedp(orl, ps0), markedp(rl0, vs0), markedp(orl, vs0), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, first, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), phead ∈ ps0, first ∈ ps0, phead ∈ vs0, first ∈ vs0, phead ∈ vs, first ∈ vs, phead ∈ ps, first ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, first ∈ orl, vhead ∈ orl from first, rvref ∈ vrvHp, vtail0 ∈ (orl + rl0) + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups((orl + rl0) + qrl0), ¬ dups(orl + qrl), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), 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), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.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), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0) ⊦ (lst ∈ orl ∨ lst ∈ rl0 ∨ lst ∈ qrl0) ∧ vrvHp0[rvref] = Empty ∧ (vhead0 ∈ orl from first ∨ vhead0 ∈ rl0)

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 9 from proof stable-D14 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vrvHp[pretRefs0(tid)] = Empty, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], orl ≠ [], pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), markedp(orl, vs0), markedp(rl0, vs0), markedp(orl, ps0), markedp(rl0, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, first, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vhead ∈ orl from first, first ∈ orl, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups((orl + rl0) + qrl0), ¬ dups(orl + qrl), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), 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 + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), lst ∈ orl ∨ lst ∈ qrl, vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0 ⊦ (lst ∈ orl ∨ lst ∈ rl0 ∨ lst ∈ qrl0) ∧ vrvHp0[pretRefs0(tid)] = Empty ∧ (vhead0 ∈ orl from first ∨ vhead0 ∈ rl0)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 10 from proof stable-D14 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vrvHp[pretRefs0(tid)] = Empty, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], orl ≠ [], pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), markedp(rl0, ps0), markedp(orl, ps0), markedp(rl0, vs0), markedp(orl, vs0), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, first, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, first ∈ orl, vhead ∈ orl from first, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (orl + rl0) + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups((orl + rl0) + qrl0), ¬ dups(orl + qrl), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ lst ∈ orl, ¬ lst ∈ rl0, ¬ lst ∈ qrl0, 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), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.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), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0) ⊦

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-app21: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app22: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ ps; (forward) from specification DMSQ

Proof step 11 from proof stable-D14 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vrvHp[pretRefs0(tid)] = Empty, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], orl ≠ [], pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), markedp(orl, vs0), markedp(rl0, vs0), markedp(orl, ps0), markedp(rl0, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, first, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vhead ∈ orl from first, first ∈ orl, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, lst ∈ qrl, lst ∈ vs, lst ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups((orl + rl0) + qrl0), ¬ dups(orl + qrl), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ lst ∈ orl, ¬ lst ∈ rl0, ¬ lst ∈ qrl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), 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 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0, (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

Heuristic elimination applied rule apply elim lemma

And closed the goal!

Rule argument

spec: list-data[reflist], name:elim-list-c, seq:x ≠ [] ⊦ a = x.head ∧ y = x.tail ↔ x = a + y, subst:[x, a, y] → [qrl, lst0, orl0]

Additional information

Used simplifier rules: ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ a ' + x ≠ []; (s) ⊦ a + x = a ' + x; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) notin-forward: ⊦ rl + rl0 = rl1 + rl2 + rl3 ∧ ¬ r ∈ rl ∧ ¬ r ∈ rl0 → ¬ r ∈ rl1 ∧ ¬ r ∈ rl2 ∧ ¬ r ∈ rl3; (forward) from specification DMSQ in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ [] + x = x; (s) ⊦ ¬ a ∈ []; (s) x ≠ [] ⊦ a = x.head ∧ y = x.tail ↔ x = a + y; (elim) Used terms: qrl, lst0, y

Proof step 12 from proof stable-D14 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vrvHp[pretRefs0(tid)] = Empty, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], vrvHp0[pretRefs0(tid)] ≠ Empty, orl ≠ [], pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), markedp(rl0, ps0), markedp(orl, ps0), markedp(rl0, vs0), markedp(orl, vs0), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, first, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, first ∈ orl, vhead ∈ orl from first, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (orl + rl0) + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups((orl + rl0) + qrl0), ¬ dups(orl + qrl), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), 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), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.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), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:rvrely-def, seq:⊦ rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0) ↔ vrvHp[vretRefs(tid)] = vrvHp0[vretRefs0(tid)] ∨ ¬ rvowns(vretRefs(tid)).pending? ∧ vrvHp0[vretRefs0(tid)] = Val(rvowns(vretRefs(tid)).val), subst:[vrvHp, vretRefs, tid, rvowns, vrvHp0, vretRefs0] → [vrvHp, vretRefs, tid, rvowns, vrvHp0, vretRefs0], <all paths>

Additional information

Used simplifier rules: ⊦ Pending(tid).pending?; (s) Used terms: vrvHp, vretRefs, tid, rvowns, vrvHp0, vretRefs0

Proof step 13 from proof stable-D14 (previous step) (back to tree)

⊦ rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0) ↔ vrvHp[vretRefs(tid)] = vrvHp0[vretRefs0(tid)] ∨ ¬ rvowns(vretRefs(tid)).pending? ∧ vrvHp0[vretRefs0(tid)] = Val(rvowns(vretRefs(tid)).val)

A spec-lemma

Proof step 14 from proof stable-D14 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vrvHp[pretRefs0(tid)] = Empty, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], orl ≠ [], pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), markedp(rl0, ps0), markedp(orl, ps0), markedp(rl0, vs0), markedp(orl, vs0), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, first, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, first ∈ orl, vhead ∈ orl from first, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (orl + rl0) + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups((orl + rl0) + qrl0), ¬ dups(orl + qrl), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ vhead0 ∈ orl from first, ¬ vhead0 ∈ rl0, 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), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.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), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 79

Additional information

Proof step 15 from proof stable-D14 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, (orl + rl0).last = vhead0, vrvHp[pretRefs0(tid)] = Empty, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], orl ≠ [], pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), markedp(orl, vs0), markedp(rl0, vs0), markedp(orl, ps0), markedp(rl0, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, first, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vhead ∈ orl from first, first ∈ orl, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups((orl + rl0) + qrl0), ¬ dups(orl + qrl), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ vhead0 ∈ orl from first, ¬ vhead0 ∈ rl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), 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), qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), lst ∈ orl ∨ lst ∈ qrl, vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 16 from proof stable-D14 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vrvHp[pretRefs0(tid)] = Empty, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], orl ≠ [], pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), markedp(rl0, ps0), markedp(orl, ps0), markedp(rl0, vs0), markedp(orl, vs0), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, (orl + rl0).last, vs0), noid(tid, orl + qrl, first, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, first ∈ orl, vhead ∈ orl from first, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (orl + rl0) + qrl0 from vtail, (orl + rl0).last ∈ (orl + rl0) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups((orl + rl0) + qrl0), ¬ dups(orl + qrl), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ (orl + rl0).last ∈ orl from first, ¬ (orl + rl0).last ∈ rl0, qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0), 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), vs0[(orl + rl0).last].next ≠ null ∧ vs0[vs0[(orl + rl0).last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[(orl + rl0).last].next].deqID.tid)) = Claimed(vs0[vs0[(orl + rl0).last].next].deqID.tid, vs0[vs0[(orl + rl0).last].next].val), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.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) ⊦

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] → [orl, rl0], <all paths>

Additional information

Used simplifier rules: ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ markedp([], vs); (s) ⊦ [] + x = x; (s) ⊦ ¬ dups([]); (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ rl.last ∈ rl from r ↔ r ∈ rl; (s) Used terms: orl, rl0

Proof step 17 from proof stable-D14 (previous step) (back to tree)

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

A spec-lemma

Proof step 18 from proof stable-D14 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, (orl + rl0).butlast.last = vhead0, vrvHp[pretRefs0(tid)] = Empty, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], (orl + rl0).butlast ≠ [], orl ≠ [], phead0 ≠ (orl + rl0).last, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), markedp(orl, vs0), markedp(rl0, vs0), markedp(orl, ps0), markedp(rl0, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, first, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), unmarkedp(qrl0, vs0), vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vhead ∈ orl from first, first ∈ orl, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups((orl + rl0) + qrl0), ¬ dups(orl + qrl), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ vhead0 ∈ orl from first, ¬ vhead0 ∈ rl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), 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, vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0 ⊦

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) ⊦ x ≠ [] → (x.butlast = [] ↔ x = x.head '); (ss)

Proof step 19 from proof stable-D14 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vrvHp[pretRefs0(tid)] = Empty, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], orl + rl0 ≠ orl.head ', orl ≠ [], phead0 ≠ (orl + rl0).last, pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), markedp(rl0, ps0), markedp(orl, ps0), markedp(rl0, vs0), markedp(orl, vs0), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, (orl + rl0).butlast.last, vs0), noid(tid, orl + qrl, first, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, vs0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, first ∈ orl, vhead ∈ orl from first, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (orl + rl0) + qrl0 from vtail, (orl + rl0).butlast.last ∈ (orl + rl0) + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups((orl + rl0) + qrl0), ¬ dups(orl + qrl), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ (orl + rl0).butlast.last ∈ orl from first, ¬ (orl + rl0).butlast.last ∈ rl0, 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), vs0[(orl + rl0).butlast.last].next ≠ null ∧ vs0[vs0[(orl + rl0).butlast.last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[(orl + rl0).butlast.last].next].deqID.tid)) = Claimed(vs0[vs0[(orl + rl0).butlast.last].next].deqID.tid, vs0[vs0[(orl + rl0).butlast.last].next].val), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.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 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, lst0, orl0]

Additional information

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

Proof step 20 from proof stable-D14 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vrvHp[pretRefs0(tid)] = Empty, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, orl = lst0 + orl0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], orl + rl0 ≠ lst0 ', orl ≠ [], phead0 ≠ (orl + rl0).last, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), markedp(orl, vs0), markedp(rl0, vs0), markedp(orl, ps0), markedp(rl0, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, (orl + rl0).butlast.last, vs0), noid(tid, orl + qrl, first, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), unmarkedp(qrl0, vs0), (orl + rl0).butlast.last ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vhead ∈ orl from first, first ∈ orl, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups((orl + rl0) + qrl0), ¬ dups(orl + qrl), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ (orl + rl0).butlast.last ∈ orl from first, ¬ (orl + rl0).butlast.last ∈ rl0, vs0[(orl + rl0).butlast.last].next ≠ null ∧ vs0[vs0[(orl + rl0).butlast.last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[(orl + rl0).butlast.last].next].deqID.tid)) = Claimed(vs0[vs0[(orl + rl0).butlast.last].next].deqID.tid, vs0[vs0[(orl + rl0).butlast.last].next].val), 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, vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0 ⊦

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 ' + x).butlast = a ' + x.butlast; (s) ⊦ a + x = a ' + x; (s) ⊦ x ≠ [] → (a ' + x).last = x.last; (s) ⊦ (a ' + x).butlast = [] ↔ x = []; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ y ≠ [] → (x + y + z).last = (y + z).last; (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 ' + x ≠ []; (s) ⊦ a ' = b ' + x ↔ a = b ∧ x = []; (ws)

Proof step 21 from proof stable-D14 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vrvHp[pretRefs0(tid)] = Empty, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl0 + rl0 ≠ [], phead0 ≠ (orl0 + rl0).last, pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((lst0 ' + orl0) + qrl, vs, ps, vs0, ps0), listp((lst0 ' + orl0) + qrl, vs, ps, owns), listp((lst0 ' + orl0) + rl0 + qrl0, vs0, ps0, owns0), markedp(rl0, ps0), markedp(orl0, ps0), markedp(rl0, vs0), markedp(orl0, vs0), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, (lst0 ' + (orl0 + rl0).butlast).last, vs0), noid(tid, (lst0 ' + orl0) + qrl, first, vs), noidRely(tid, (lst0 ' + orl0) + qrl, vs, (lst0 ' + orl0) + rl0 + qrl0, vs0), nonullRetRefs((lst0 ' + orl0) + qrl, vs, vretRefs, pretRefs), nonullRetRefs((lst0 ' + orl0) + rl0 + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[lst0].deqID), some?(vs0[lst0].deqID), some?(ps[lst0].deqID), some?(vs[lst0].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vhead ∈ lst0 ' + orl0 from first, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (lst0 ' + orl0) + rl0 + qrl0 from vtail, (lst0 ' + (orl0 + rl0).butlast).last ∈ (lst0 ' + orl0) + rl0 + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(orl0 + rl0 + qrl0), ¬ dups(orl0 + qrl), ¬ dups(rl), ¬ dups(orl0), ¬ dups(rl0), ¬ dups(qrl), ¬ dups(rl0 + qrl0), ¬ dups(orl0 + rl0), ¬ dups(qrl0), ¬ lst0 ∈ orl0, ¬ lst0 ∈ rl0, ¬ lst0 ∈ qrl0, ¬ lst0 ∈ qrl, ¬ (lst0 ' + (orl0 + rl0).butlast).last ∈ lst0 ' + orl0 from first, ¬ (lst0 ' + (orl0 + rl0).butlast).last ∈ rl0, 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), vs0[(lst0 ' + (orl0 + rl0).butlast).last].next ≠ null ∧ vs0[vs0[(lst0 ' + (orl0 + rl0).butlast).last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[(lst0 ' + (orl0 + rl0).butlast).last].next].deqID.tid)) = Claimed(vs0[vs0[(lst0 ' + (orl0 + rl0).butlast).last].next].deqID.tid, vs0[vs0[(lst0 ' + (orl0 + rl0).butlast).last].next].val), phead = lst0 ∨ phead ∈ orl0, first = lst0 ∨ first ∈ orl0, phead0 = lst0 ∨ phead0 ∈ orl0 ∨ phead0 ∈ rl0, phead0 ∈ lst0 ' + orl0 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, vtail = ((lst0 ' + orl0) + qrl).last ∨ qrl ≠ [] ∧ vtail = ((lst0 ' + orl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = ((orl0 + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl0 + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst = lst0 ∨ lst ∈ orl0 ∨ lst ∈ qrl, (lst0 ' + orl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl0 ≠ [] ∧ (lst0 ' + orl0.butlast).last = vhead ∧ phead ≠ orl0.last ∧ unmarkedp(qrl, vs) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:bapp, seq: ⊦ y ≠ [] → (x + y).butlast = x + y.butlast, subst:[x, y] → [orl0, rl0], <all paths>

Additional information

Used terms: orl0, rl0

Proof step 22 from proof stable-D14 (previous step) (back to tree)

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

A spec-lemma

Proof step 23 from proof stable-D14 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vrvHp[pretRefs0(tid)] = Empty, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rl0 = [], rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl0 + rl0 ≠ [], phead0 ≠ (orl0 + rl0).last, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((lst0 ' + orl0) + qrl, vs, ps, vs0, ps0), listp((lst0 ' + orl0) + rl0 + qrl0, vs0, ps0, owns0), listp((lst0 ' + orl0) + qrl, vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), markedp(orl0, vs0), markedp(rl0, vs0), markedp(orl0, ps0), markedp(rl0, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, (lst0 ' + (orl0 + rl0).butlast).last, vs0), noid(tid, (lst0 ' + orl0) + qrl, first, vs), noidRely(tid, (lst0 ' + orl0) + qrl, vs, (lst0 ' + orl0) + rl0 + qrl0, vs0), nonullRetRefs((lst0 ' + orl0) + rl0 + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((lst0 ' + orl0) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[lst0].deqID), some?(ps[lst0].deqID), some?(vs0[lst0].deqID), some?(ps0[lst0].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), unmarkedp(qrl0, vs0), (lst0 ' + (orl0 + rl0).butlast).last ∈ (lst0 ' + orl0) + rl0 + qrl0 from vhead, vtail0 ∈ (lst0 ' + orl0) + rl0 + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vhead ∈ lst0 ' + orl0 from first, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(orl0 + rl0 + qrl0), ¬ dups(orl0 + qrl), ¬ dups(rl), ¬ dups(orl0), ¬ dups(rl0), ¬ dups(qrl), ¬ dups(rl0 + qrl0), ¬ dups(orl0 + rl0), ¬ dups(qrl0), ¬ lst0 ∈ orl0, ¬ lst0 ∈ rl0, ¬ lst0 ∈ qrl0, ¬ lst0 ∈ qrl, ¬ (lst0 ' + (orl0 + rl0).butlast).last ∈ lst0 ' + orl0 from first, ¬ (lst0 ' + (orl0 + rl0).butlast).last ∈ rl0, vs0[(lst0 ' + (orl0 + rl0).butlast).last].next ≠ null ∧ vs0[vs0[(lst0 ' + (orl0 + rl0).butlast).last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[(lst0 ' + (orl0 + rl0).butlast).last].next].deqID.tid)) = Claimed(vs0[vs0[(lst0 ' + (orl0 + rl0).butlast).last].next].deqID.tid, vs0[vs0[(lst0 ' + (orl0 + rl0).butlast).last].next].val), 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), (lst0 ' + orl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl0 ≠ [] ∧ (lst0 ' + orl0.butlast).last = vhead ∧ phead ≠ orl0.last ∧ unmarkedp(qrl, vs), lst = lst0 ∨ lst ∈ orl0 ∨ lst ∈ qrl, vtail0 = ((orl0 + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl0 + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = ((lst0 ' + orl0) + qrl).last ∨ qrl ≠ [] ∧ vtail = ((lst0 ' + orl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ lst0 ' + orl0 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 = lst0 ∨ phead0 ∈ orl0 ∨ phead0 ∈ rl0, first = lst0 ∨ first ∈ orl0, phead = lst0 ∨ phead ∈ orl0 ⊦

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

Proof step 24 from proof stable-D14 (previous step) (back to tree)

vrvHp[pretRefs0(tid)] = Empty, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl0 ≠ [], phead0 ≠ orl0.last, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((lst0 ' + orl0) + qrl, vs, ps, vs0, ps0), listp(lst0 ' + orl0 + qrl + rl, vs0, ps0, owns0), listp((lst0 ' + orl0) + qrl, vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, orl0.last, vs), nextnottidRely(tid, orl0.last, vs, (lst0 ' + orl0.butlast).last, vs0), noid(tid, (lst0 ' + orl0) + qrl, first, vs), noidRely(tid, (lst0 ' + orl0) + qrl, vs, lst0 ' + orl0 + qrl + rl, vs0), nonullRetRefs(lst0 ' + orl0 + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((lst0 ' + orl0) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[lst0].deqID), some?(ps[lst0].deqID), some?(vs0[lst0].deqID), some?(ps0[lst0].deqID), unmarkedp(qrl, ps0), unmarkedp(rl, ps0), unmarkedp(qrl, ps), unmarkedp(qrl, vs0), unmarkedp(rl, vs0), (lst0 ' + orl0.butlast).last ∈ lst0 ' + orl0 + qrl + rl from orl0.last, vtail0 ∈ lst0 ' + orl0 + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, orl0.last ∈ lst0 ' + orl0 from first, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl), ¬ dups(orl0 + qrl + rl), ¬ dups(orl0), ¬ dups(qrl + rl), ¬ dups(orl0 + qrl), ¬ dups(rl), ¬ lst0 ∈ orl0, ¬ (lst0 ' + orl0.butlast).last ∈ lst0 ' + orl0 from first, ¬ lst0 ∈ qrl, ¬ lst0 ∈ rl, vs0[(lst0 ' + orl0.butlast).last].next ≠ null ∧ vs0[vs0[(lst0 ' + orl0.butlast).last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[(lst0 ' + orl0.butlast).last].next].deqID.tid)) = Claimed(vs0[vs0[(lst0 ' + orl0.butlast).last].next].deqID.tid, vs0[vs0[(lst0 ' + orl0.butlast).last].next].val), qrl ≠ [] → unmarkedp(qrl.tail, vs), vs[orl0.last].next ≠ null ∧ vs[vs[orl0.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[orl0.last].next].deqID.tid)) = Claimed(vs[vs[orl0.last].next].deqID.tid, vs[vs[orl0.last].next].val), lst = lst0 ∨ lst ∈ orl0 ∨ lst ∈ qrl, first = lst0 ∨ first ∈ orl0, phead = lst0 ∨ phead ∈ orl0, vtail0 = (orl0 + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (orl0 + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, vtail = (orl0 + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl0 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 = lst0 ∨ phead0 ∈ orl0, phead0 ∈ lst0 ' + orl0 from phead ∨ phead0 ∈ qrl ∨ phead0 ∈ rl ⊦

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] → [orl0, vtail1, rl0]

Additional information

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

Proof step 25 from proof stable-D14 (previous step) (back to tree)

vrvHp[pretRefs0(tid)] = Empty, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, orl0 = rl0 + vtail1 ', pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl0 ≠ [], phead0 ≠ vtail1, pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((lst0 ' + orl0) + qrl, vs, ps, vs0, ps0), listp((lst0 ' + orl0) + qrl, vs, ps, owns), listp(lst0 ' + orl0 + qrl + rl, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vtail1, vs), nextnottidRely(tid, vtail1, vs, (lst0 ' + rl0).last, vs0), noid(tid, (lst0 ' + orl0) + qrl, first, vs), noidRely(tid, (lst0 ' + orl0) + qrl, vs, lst0 ' + orl0 + qrl + rl, vs0), nonullRetRefs((lst0 ' + orl0) + qrl, vs, vretRefs, pretRefs), nonullRetRefs(lst0 ' + orl0 + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[lst0].deqID), some?(vs0[lst0].deqID), some?(ps[lst0].deqID), some?(vs[lst0].deqID), unmarkedp(rl, vs0), unmarkedp(qrl, vs0), unmarkedp(qrl, ps), unmarkedp(rl, ps0), unmarkedp(qrl, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail1 ∈ lst0 ' + orl0 from first, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ lst0 ' + orl0 + qrl + rl from vtail, (lst0 ' + rl0).last ∈ lst0 ' + orl0 + qrl + rl from vtail1, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl), ¬ dups(orl0 + qrl + rl), ¬ dups(orl0), ¬ dups(qrl + rl), ¬ dups(orl0 + qrl), ¬ dups(rl), ¬ lst0 ∈ orl0, ¬ (lst0 ' + rl0).last ∈ lst0 ' + orl0 from first, ¬ lst0 ∈ qrl, ¬ lst0 ∈ rl, vs[vtail1].next ≠ null ∧ vs[vs[vtail1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vtail1].next].deqID.tid)) = Claimed(vs[vs[vtail1].next].deqID.tid, vs[vs[vtail1].next].val), qrl ≠ [] → unmarkedp(qrl.tail, vs), vs0[(lst0 ' + rl0).last].next ≠ null ∧ vs0[vs0[(lst0 ' + rl0).last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[(lst0 ' + rl0).last].next].deqID.tid)) = Claimed(vs0[vs0[(lst0 ' + rl0).last].next].deqID.tid, vs0[vs0[(lst0 ' + rl0).last].next].val), phead0 ∈ lst0 ' + orl0 from phead ∨ phead0 ∈ qrl ∨ phead0 ∈ rl, phead0 = lst0 ∨ phead0 ∈ orl0, vtail = (orl0 + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl0 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (orl0 + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (orl0 + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, phead = lst0 ∨ phead ∈ orl0, first = lst0 ∨ first ∈ orl0, lst = lst0 ∨ lst ∈ orl0 ∨ lst ∈ 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] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + 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 26 from proof stable-D14 (previous step) (back to tree)

vrvHp[pretRefs0(tid)] = Empty, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), lst0 ≠ vtail1, phead0 ≠ vtail1, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((lst0 ' + rl0 + vtail1 ') + qrl, vs, ps, vs0, ps0), listp(lst0 ' + (rl0 + vtail1 ') + qrl + rl, vs0, ps0, owns0), listp((lst0 ' + rl0 + vtail1 ') + qrl, vs, ps, owns), markedp(rl0, vs), markedp(rl0, ps), markedp(rl0, vs0), markedp(rl0, ps0), nextnottid(tid, vtail1, vs), nextnottidRely(tid, vtail1, vs, (lst0 ' + rl0).last, vs0), noid(tid, (lst0 ' + rl0 + vtail1 ') + qrl, first, vs), noidRely(tid, (lst0 ' + rl0 + vtail1 ') + qrl, vs, lst0 ' + (rl0 + vtail1 ') + qrl + rl, vs0), nonullRetRefs(lst0 ' + (rl0 + vtail1 ') + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((lst0 ' + rl0 + vtail1 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[lst0].deqID), some?(ps[lst0].deqID), some?(vs0[lst0].deqID), some?(ps0[lst0].deqID), some?(vs[vtail1].deqID), some?(ps[vtail1].deqID), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), unmarkedp(qrl, ps0), unmarkedp(rl, ps0), unmarkedp(qrl, ps), unmarkedp(qrl, vs0), unmarkedp(rl, vs0), vtail0 ∈ lst0 ' + (rl0 + vtail1 ') + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail1 ∈ lst0 ' + rl0 + vtail1 ' from first, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0 + qrl + rl), ¬ dups(rl0), ¬ dups(qrl), ¬ dups(qrl + rl), ¬ dups(rl0 + qrl), ¬ dups(rl), ¬ (lst0 ' + rl0).last ∈ lst0 ' + rl0 + vtail1 ' from first, ¬ lst0 ∈ qrl, ¬ lst0 ∈ rl, ¬ vtail1 ∈ rl0, ¬ vtail1 ∈ qrl, ¬ vtail1 ∈ rl, ¬ lst0 ∈ rl0, vs0[(lst0 ' + rl0).last].next ≠ null ∧ vs0[vs0[(lst0 ' + rl0).last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[(lst0 ' + rl0).last].next].deqID.tid)) = Claimed(vs0[vs0[(lst0 ' + rl0).last].next].deqID.tid, vs0[vs0[(lst0 ' + rl0).last].next].val), qrl ≠ [] → unmarkedp(qrl.tail, vs), vs[vtail1].next ≠ null ∧ vs[vs[vtail1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vtail1].next].deqID.tid)) = Claimed(vs[vs[vtail1].next].deqID.tid, vs[vs[vtail1].next].val), phead0 ∈ lst0 ' + rl0 + vtail1 ' from phead ∨ phead0 ∈ qrl ∨ phead0 ∈ rl, (lst0 ' + rl0).last ∈ qrl ∨ (lst0 ' + rl0).last ∈ rl, first = lst0 ∨ first ∈ rl0 ∨ first = vtail1, phead = lst0 ∨ phead ∈ rl0 ∨ phead = vtail1, vtail0 = (vtail1 ' + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (vtail1 ' + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, vtail = (vtail1 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail1 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 = lst0 ∨ phead0 ∈ rl0, lst = lst0 ∨ lst ∈ rl0 ∨ lst = vtail1 ∨ lst ∈ qrl ⊦

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] → [lst0 ', rl0], <all paths>

Additional information

Used simplifier rules: ⊦ markedp([], vs); (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([]); (s) ⊦ ¬ a ∈ []; (s) ⊦ [] + x = x; (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a '.last = a; (s) Used terms: lst0 ', rl0

Proof step 27 from proof stable-D14 (previous step) (back to tree)

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

A spec-lemma

Proof step 28 from proof stable-D14 (previous step) (back to tree)

vrvHp[pretRefs0(tid)] = Empty, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), lst0 ≠ vtail1, phead0 ≠ vtail1, pretRefs0(tid) ≠ null, rl0 ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((lst0 ' + rl0 + vtail1 ') + qrl, vs, ps, vs0, ps0), listp((lst0 ' + rl0 + vtail1 ') + qrl, vs, ps, owns), listp(lst0 ' + (rl0 + vtail1 ') + qrl + rl, vs0, ps0, owns0), markedp(rl0, ps0), markedp(rl0, vs0), markedp(rl0, ps), markedp(rl0, vs), nextnottid(tid, vtail1, vs), nextnottidRely(tid, vtail1, vs, rl0.last, vs0), noid(tid, (lst0 ' + rl0 + vtail1 ') + qrl, first, vs), noidRely(tid, (lst0 ' + rl0 + vtail1 ') + qrl, vs, lst0 ' + (rl0 + vtail1 ') + qrl + rl, vs0), nonullRetRefs((lst0 ' + rl0 + vtail1 ') + qrl, vs, vretRefs, pretRefs), nonullRetRefs(lst0 ' + (rl0 + vtail1 ') + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), some?(ps[vtail1].deqID), some?(vs[vtail1].deqID), some?(ps0[lst0].deqID), some?(vs0[lst0].deqID), some?(ps[lst0].deqID), some?(vs[lst0].deqID), unmarkedp(rl, vs0), unmarkedp(qrl, vs0), unmarkedp(qrl, ps), unmarkedp(rl, ps0), unmarkedp(qrl, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vtail1 ∈ lst0 ' + rl0 + vtail1 ' from first, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ lst0 ' + (rl0 + vtail1 ') + qrl + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0 + qrl + rl), ¬ dups(rl0), ¬ dups(qrl), ¬ dups(qrl + rl), ¬ dups(rl0 + qrl), ¬ dups(rl), ¬ rl0.last ∈ lst0 ' + rl0 + vtail1 ' from first, ¬ lst0 ∈ qrl, ¬ lst0 ∈ rl, ¬ vtail1 ∈ rl0, ¬ vtail1 ∈ qrl, ¬ vtail1 ∈ rl, ¬ lst0 ∈ rl0, vs[vtail1].next ≠ null ∧ vs[vs[vtail1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vtail1].next].deqID.tid)) = Claimed(vs[vs[vtail1].next].deqID.tid, vs[vs[vtail1].next].val), qrl ≠ [] → unmarkedp(qrl.tail, vs), vs0[rl0.last].next ≠ null ∧ vs0[vs0[rl0.last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[rl0.last].next].deqID.tid)) = Claimed(vs0[vs0[rl0.last].next].deqID.tid, vs0[vs0[rl0.last].next].val), lst = lst0 ∨ lst ∈ rl0 ∨ lst = vtail1 ∨ lst ∈ qrl, phead0 = lst0 ∨ phead0 ∈ rl0, vtail = (vtail1 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail1 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (vtail1 ' + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (vtail1 ' + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, phead = lst0 ∨ phead ∈ rl0 ∨ phead = vtail1, first = lst0 ∨ first ∈ rl0 ∨ first = vtail1, rl0.last ∈ qrl ∨ rl0.last ∈ rl, phead0 ∈ lst0 ' + rl0 + vtail1 ' from phead ∨ phead0 ∈ qrl ∨ phead0 ∈ rl ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 29 from proof stable-D14 (previous step) (back to tree)

vrvHp[pretRefs0(tid)] = Empty, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), rl0.last ≠ vtail1, lst0 ≠ vtail1, phead0 ≠ vtail1, pretRefs0(tid) ≠ null, rl0 ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((lst0 ' + rl0 + vtail1 ') + qrl, vs, ps, vs0, ps0), listp(lst0 ' + (rl0 + vtail1 ') + qrl + rl, vs0, ps0, owns0), listp((lst0 ' + rl0 + vtail1 ') + qrl, vs, ps, owns), markedp(rl0, vs), markedp(rl0, ps), markedp(rl0, vs0), markedp(rl0, ps0), nextnottid(tid, vtail1, vs), nextnottidRely(tid, vtail1, vs, rl0.last, vs0), noid(tid, (lst0 ' + rl0 + vtail1 ') + qrl, vtail1, vs), noidRely(tid, (lst0 ' + rl0 + vtail1 ') + qrl, vs, lst0 ' + (rl0 + vtail1 ') + qrl + rl, vs0), nonullRetRefs(lst0 ' + (rl0 + vtail1 ') + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((lst0 ' + rl0 + vtail1 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[lst0].deqID), some?(ps[lst0].deqID), some?(vs0[lst0].deqID), some?(ps0[lst0].deqID), some?(vs[vtail1].deqID), some?(ps[vtail1].deqID), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), unmarkedp(qrl, ps0), unmarkedp(rl, ps0), unmarkedp(qrl, ps), unmarkedp(qrl, vs0), unmarkedp(rl, vs0), phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, vtail1 ∈ vs0, vtail1 ∈ ps0, vtail1 ∈ vs, vtail1 ∈ ps, vtail0 ∈ lst0 ' + (rl0 + vtail1 ') + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0 + qrl + rl), ¬ dups(rl0), ¬ dups(qrl), ¬ dups(qrl + rl), ¬ dups(rl0 + qrl), ¬ dups(rl), ¬ lst0 ∈ qrl, ¬ lst0 ∈ rl, ¬ vtail1 ∈ qrl, ¬ vtail1 ∈ rl, ¬ lst0 ∈ rl0, ¬ vtail1 ∈ rl0, vs0[rl0.last].next ≠ null ∧ vs0[vs0[rl0.last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[rl0.last].next].deqID.tid)) = Claimed(vs0[vs0[rl0.last].next].deqID.tid, vs0[vs0[rl0.last].next].val), qrl ≠ [] → unmarkedp(qrl.tail, vs), vs[vtail1].next ≠ null ∧ vs[vs[vtail1].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vtail1].next].deqID.tid)) = Claimed(vs[vs[vtail1].next].deqID.tid, vs[vs[vtail1].next].val), phead = lst0 ∨ phead ∈ rl0 ∨ phead = vtail1, vtail0 = (vtail1 ' + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (vtail1 ' + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, vtail = (vtail1 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail1 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 = lst0 ∨ phead0 ∈ rl0, lst = lst0 ∨ lst ∈ rl0 ∨ lst = vtail1 ∨ lst ∈ qrl, phead0 ∈ lst0 ' + rl0 + vtail1 ' from phead ∨ phead0 ∈ qrl ∨ phead0 ∈ rl, rl0.last ∈ qrl ∨ rl0.last ∈ rl ⊦

User applied rule apply elim lemma

And closed the goal!

Rule argument

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

Additional information

Used simplifier rules: ⊦ x + a ' ≠ []; (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: rl0, phead1, y

Proof step 30 from proof stable-D14 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vrvHp[pretRefs0(tid)] = Empty, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl0 + rl0 ≠ [], phead0 ≠ (orl0 + rl0).last, pretRefs0(tid) ≠ null, rl0 ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((lst0 ' + orl0) + qrl, vs, ps, vs0, ps0), listp((lst0 ' + orl0) + rl0 + qrl0, vs0, ps0, owns0), listp((lst0 ' + orl0) + qrl, vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), markedp(orl0, vs0), markedp(rl0, vs0), markedp(orl0, ps0), markedp(rl0, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, (lst0 ' + orl0 + rl0.butlast).last, vs0), noid(tid, (lst0 ' + orl0) + qrl, first, vs), noidRely(tid, (lst0 ' + orl0) + qrl, vs, (lst0 ' + orl0) + rl0 + qrl0, vs0), nonullRetRefs((lst0 ' + orl0) + rl0 + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((lst0 ' + orl0) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[lst0].deqID), some?(ps[lst0].deqID), some?(vs0[lst0].deqID), some?(ps0[lst0].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), unmarkedp(qrl0, vs0), (lst0 ' + orl0 + rl0.butlast).last ∈ (lst0 ' + orl0) + rl0 + qrl0 from vhead, vtail0 ∈ (lst0 ' + orl0) + rl0 + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vhead ∈ lst0 ' + orl0 from first, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(orl0 + rl0 + qrl0), ¬ dups(orl0 + qrl), ¬ dups(rl), ¬ dups(orl0), ¬ dups(rl0), ¬ dups(qrl), ¬ dups(rl0 + qrl0), ¬ dups(orl0 + rl0), ¬ dups(qrl0), ¬ lst0 ∈ orl0, ¬ lst0 ∈ rl0, ¬ lst0 ∈ qrl0, ¬ lst0 ∈ qrl, ¬ (lst0 ' + orl0 + rl0.butlast).last ∈ lst0 ' + orl0 from first, ¬ (lst0 ' + orl0 + rl0.butlast).last ∈ rl0, vs0[(lst0 ' + orl0 + rl0.butlast).last].next ≠ null ∧ vs0[vs0[(lst0 ' + orl0 + rl0.butlast).last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[(lst0 ' + orl0 + rl0.butlast).last].next].deqID.tid)) = Claimed(vs0[vs0[(lst0 ' + orl0 + rl0.butlast).last].next].deqID.tid, vs0[vs0[(lst0 ' + orl0 + rl0.butlast).last].next].val), 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), (lst0 ' + orl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl0 ≠ [] ∧ (lst0 ' + orl0.butlast).last = vhead ∧ phead ≠ orl0.last ∧ unmarkedp(qrl, vs), lst = lst0 ∨ lst ∈ orl0 ∨ lst ∈ qrl, vtail0 = ((orl0 + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl0 + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = ((lst0 ' + orl0) + qrl).last ∨ qrl ≠ [] ∧ vtail = ((lst0 ' + orl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ lst0 ' + orl0 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 = lst0 ∨ phead0 ∈ orl0 ∨ phead0 ∈ rl0, first = lst0 ∨ first ∈ orl0, phead = lst0 ∨ phead ∈ orl0 ⊦

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] ⊦ y ≠ [] → (x + y + z).last = (y + z).last; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s)

Proof step 31 from proof stable-D14 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vrvHp[pretRefs0(tid)] = Empty, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl0 + rl0 ≠ [], phead0 ≠ rl0.last, pretRefs0(tid) ≠ null, rl0 ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((lst0 ' + orl0) + qrl, vs, ps, vs0, ps0), listp((lst0 ' + orl0) + qrl, vs, ps, owns), listp((lst0 ' + orl0) + rl0 + qrl0, vs0, ps0, owns0), markedp(rl0, ps0), markedp(orl0, ps0), markedp(rl0, vs0), markedp(orl0, vs0), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, (lst0 ' + orl0 + rl0.butlast).last, vs0), noid(tid, (lst0 ' + orl0) + qrl, first, vs), noidRely(tid, (lst0 ' + orl0) + qrl, vs, (lst0 ' + orl0) + rl0 + qrl0, vs0), nonullRetRefs((lst0 ' + orl0) + qrl, vs, vretRefs, pretRefs), nonullRetRefs((lst0 ' + orl0) + rl0 + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[lst0].deqID), some?(vs0[lst0].deqID), some?(ps[lst0].deqID), some?(vs[lst0].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vhead ∈ lst0 ' + orl0 from first, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (lst0 ' + orl0) + rl0 + qrl0 from vtail, (lst0 ' + orl0 + rl0.butlast).last ∈ (lst0 ' + orl0) + rl0 + qrl0 from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(orl0 + rl0 + qrl0), ¬ dups(orl0 + qrl), ¬ dups(rl), ¬ dups(orl0), ¬ dups(rl0), ¬ dups(qrl), ¬ dups(rl0 + qrl0), ¬ dups(orl0 + rl0), ¬ dups(qrl0), ¬ lst0 ∈ orl0, ¬ lst0 ∈ rl0, ¬ lst0 ∈ qrl0, ¬ lst0 ∈ qrl, ¬ (lst0 ' + orl0 + rl0.butlast).last ∈ lst0 ' + orl0 from first, ¬ (lst0 ' + orl0 + rl0.butlast).last ∈ rl0, 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), vs0[(lst0 ' + orl0 + rl0.butlast).last].next ≠ null ∧ vs0[vs0[(lst0 ' + orl0 + rl0.butlast).last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[(lst0 ' + orl0 + rl0.butlast).last].next].deqID.tid)) = Claimed(vs0[vs0[(lst0 ' + orl0 + rl0.butlast).last].next].deqID.tid, vs0[vs0[(lst0 ' + orl0 + rl0.butlast).last].next].val), phead = lst0 ∨ phead ∈ orl0, first = lst0 ∨ first ∈ orl0, phead0 = lst0 ∨ phead0 ∈ orl0 ∨ phead0 ∈ rl0, phead0 ∈ lst0 ' + orl0 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, vtail = ((lst0 ' + orl0) + qrl).last ∨ qrl ≠ [] ∧ vtail = ((lst0 ' + orl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst = lst0 ∨ lst ∈ orl0 ∨ lst ∈ qrl, (lst0 ' + orl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl0 ≠ [] ∧ (lst0 ' + orl0.butlast).last = vhead ∧ phead ≠ orl0.last ∧ unmarkedp(qrl, vs), vtail0 = (rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.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] → [rl0, vtail1, orl]

Additional information

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

Proof step 32 from proof stable-D14 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vrvHp[pretRefs0(tid)] = Empty, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rl0 = orl + vtail1 ', rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl0 + rl0 ≠ [], phead0 ≠ vtail1, pretRefs0(tid) ≠ null, rl0 ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((lst0 ' + orl0) + qrl, vs, ps, vs0, ps0), listp((lst0 ' + orl0) + rl0 + qrl0, vs0, ps0, owns0), listp((lst0 ' + orl0) + qrl, vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), markedp(orl0, vs0), markedp(rl0, vs0), markedp(orl0, ps0), markedp(rl0, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, (lst0 ' + orl0 + orl).last, vs0), noid(tid, (lst0 ' + orl0) + qrl, first, vs), noidRely(tid, (lst0 ' + orl0) + qrl, vs, (lst0 ' + orl0) + rl0 + qrl0, vs0), nonullRetRefs((lst0 ' + orl0) + rl0 + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((lst0 ' + orl0) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs[lst0].deqID), some?(ps[lst0].deqID), some?(vs0[lst0].deqID), some?(ps0[lst0].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), unmarkedp(qrl0, vs0), (lst0 ' + orl0 + orl).last ∈ (lst0 ' + orl0) + rl0 + qrl0 from vhead, vtail0 ∈ (lst0 ' + orl0) + rl0 + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vhead ∈ lst0 ' + orl0 from first, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(orl0 + rl0 + qrl0), ¬ dups(orl0 + qrl), ¬ dups(rl), ¬ dups(orl0), ¬ dups(rl0), ¬ dups(qrl), ¬ dups(rl0 + qrl0), ¬ dups(orl0 + rl0), ¬ dups(qrl0), ¬ lst0 ∈ orl0, ¬ lst0 ∈ rl0, ¬ lst0 ∈ qrl0, ¬ lst0 ∈ qrl, ¬ (lst0 ' + orl0 + orl).last ∈ lst0 ' + orl0 from first, ¬ (lst0 ' + orl0 + orl).last ∈ rl0, vs0[(lst0 ' + orl0 + orl).last].next ≠ null ∧ vs0[vs0[(lst0 ' + orl0 + orl).last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[(lst0 ' + orl0 + orl).last].next].deqID.tid)) = Claimed(vs0[vs0[(lst0 ' + orl0 + orl).last].next].deqID.tid, vs0[vs0[(lst0 ' + orl0 + orl).last].next].val), 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 = (rl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (rl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, (lst0 ' + orl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl0 ≠ [] ∧ (lst0 ' + orl0.butlast).last = vhead ∧ phead ≠ orl0.last ∧ unmarkedp(qrl, vs), lst = lst0 ∨ lst ∈ orl0 ∨ lst ∈ qrl, vtail = ((lst0 ' + orl0) + qrl).last ∨ qrl ≠ [] ∧ vtail = ((lst0 ' + orl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ lst0 ' + orl0 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 = lst0 ∨ phead0 ∈ orl0 ∨ phead0 ∈ rl0, first = lst0 ∨ first ∈ orl0, phead = lst0 ∨ phead ∈ orl0 ⊦

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) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + 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 33 from proof stable-D14 (previous step) (back to tree)

qrl + rl = (orl + vtail1 ') + qrl0, vrvHp[pretRefs0(tid)] = Empty, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), (lst0 ' + orl0 + orl).last ≠ vtail1, lst0 ≠ vtail1, phead0 ≠ vtail1, pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((lst0 ' + orl0) + qrl, vs, ps, vs0, ps0), listp((lst0 ' + orl0) + qrl, vs, ps, owns), listp((lst0 ' + orl0) + qrl + rl, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps), markedp(orl0, vs), markedp(orl, ps0), markedp(orl0, ps0), markedp(orl, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, (lst0 ' + orl0 + orl).last, vs0), noid(tid, (lst0 ' + orl0) + qrl, first, vs), noidRely(tid, (lst0 ' + orl0) + qrl, vs, (lst0 ' + orl0) + qrl + rl, vs0), nonullRetRefs((lst0 ' + orl0) + qrl, vs, vretRefs, pretRefs), nonullRetRefs((lst0 ' + orl0) + qrl + rl, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(ps0[lst0].deqID), some?(vs0[lst0].deqID), some?(ps[lst0].deqID), some?(vs[lst0].deqID), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), unmarkedp(qrl0, vs0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead0 ∈ ps0, phead0 ∈ vs0, vhead ∈ lst0 ' + orl0 from first, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (lst0 ' + orl0) + qrl + rl from vtail, (lst0 ' + orl0 + orl).last ∈ (lst0 ' + orl0) + qrl + rl from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups((orl0 + orl) + qrl0), ¬ dups(orl0 + qrl), ¬ dups(rl), ¬ dups(qrl), ¬ dups(orl0), ¬ dups(orl), ¬ dups(qrl0), ¬ dups(orl + qrl0), ¬ dups(orl0 + orl), ¬ vtail1 ∈ orl0, ¬ vtail1 ∈ orl, ¬ vtail1 ∈ qrl0, ¬ lst0 ∈ orl0, ¬ lst0 ∈ orl, ¬ lst0 ∈ qrl0, ¬ lst0 ∈ qrl, ¬ (lst0 ' + orl0 + orl).last ∈ lst0 ' + orl0 from first, ¬ (lst0 ' + orl0 + orl).last ∈ orl, 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), vs0[(lst0 ' + orl0 + orl).last].next ≠ null ∧ vs0[vs0[(lst0 ' + orl0 + orl).last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[(lst0 ' + orl0 + orl).last].next].deqID.tid)) = Claimed(vs0[vs0[(lst0 ' + orl0 + orl).last].next].deqID.tid, vs0[vs0[(lst0 ' + orl0 + orl).last].next].val), phead = lst0 ∨ phead ∈ orl0, first = lst0 ∨ first ∈ orl0, vtail = ((lst0 ' + orl0) + qrl).last ∨ qrl ≠ [] ∧ vtail = ((lst0 ' + orl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst = lst0 ∨ lst ∈ orl0 ∨ lst ∈ qrl, (lst0 ' + orl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl0 ≠ [] ∧ (lst0 ' + orl0.butlast).last = vhead ∧ phead ≠ orl0.last ∧ unmarkedp(qrl, vs), phead0 = lst0 ∨ phead0 ∈ orl0 ∨ phead0 ∈ orl, phead0 ∈ lst0 ' + orl0 from phead ∨ phead0 ∈ orl ∨ phead0 ∈ qrl0, vtail0 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.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] → [lst0 ', orl0 + orl], <all paths>

Additional information

Used simplifier rules: ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ markedp([], vs); (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ ¬ a ∈ []; (s) ⊦ [] + x = x; (s) ⊦ a '.last = a; (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) Used terms: lst0 ', orl0 + orl

Proof step 34 from proof stable-D14 (previous step) (back to tree)

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

A spec-lemma

Proof step 35 from proof stable-D14 (previous step) (back to tree)

qrl + rl = (orl + vtail1 ') + qrl0, vrvHp[pretRefs0(tid)] = Empty, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl0 + orl ≠ [], (orl0 + orl).last ≠ vtail1, lst0 ≠ vtail1, phead0 ≠ vtail1, pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((lst0 ' + orl0) + qrl, vs, ps, vs0, ps0), listp((lst0 ' + orl0) + qrl + rl, vs0, ps0, owns0), listp((lst0 ' + orl0) + qrl, vs, ps, owns), markedp(orl, vs0), markedp(orl0, ps0), markedp(orl, ps0), markedp(orl0, vs), markedp(orl0, ps), markedp(orl0, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, (orl0 + orl).last, vs0), noid(tid, (lst0 ' + orl0) + qrl, first, vs), noidRely(tid, (lst0 ' + orl0) + qrl, vs, (lst0 ' + orl0) + qrl + rl, vs0), nonullRetRefs((lst0 ' + orl0) + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((lst0 ' + orl0) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), some?(vs[lst0].deqID), some?(ps[lst0].deqID), some?(vs0[lst0].deqID), some?(ps0[lst0].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), unmarkedp(qrl0, vs0), (orl0 + orl).last ∈ (lst0 ' + orl0) + qrl + rl from vhead, vtail0 ∈ (lst0 ' + orl0) + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vhead ∈ lst0 ' + orl0 from first, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups((orl0 + orl) + qrl0), ¬ dups(orl0 + qrl), ¬ dups(rl), ¬ dups(qrl), ¬ dups(orl0), ¬ dups(orl), ¬ dups(qrl0), ¬ dups(orl + qrl0), ¬ dups(orl0 + orl), ¬ vtail1 ∈ orl0, ¬ vtail1 ∈ orl, ¬ vtail1 ∈ qrl0, ¬ lst0 ∈ orl0, ¬ lst0 ∈ orl, ¬ lst0 ∈ qrl0, ¬ lst0 ∈ qrl, ¬ (orl0 + orl).last ∈ lst0 ' + orl0 from first, ¬ (orl0 + orl).last ∈ orl, vs0[(orl0 + orl).last].next ≠ null ∧ vs0[vs0[(orl0 + orl).last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[(orl0 + orl).last].next].deqID.tid)) = Claimed(vs0[vs0[(orl0 + orl).last].next].deqID.tid, vs0[vs0[(orl0 + orl).last].next].val), 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 = (vtail1 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vtail1 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ lst0 ' + orl0 from phead ∨ phead0 ∈ orl ∨ phead0 ∈ qrl0, phead0 = lst0 ∨ phead0 ∈ orl0 ∨ phead0 ∈ orl, (lst0 ' + orl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl0 ≠ [] ∧ (lst0 ' + orl0.butlast).last = vhead ∧ phead ≠ orl0.last ∧ unmarkedp(qrl, vs), lst = lst0 ∨ lst ∈ orl0 ∨ lst ∈ qrl, vtail = ((lst0 ' + orl0) + qrl).last ∨ qrl ≠ [] ∧ vtail = ((lst0 ' + orl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, first = lst0 ∨ first ∈ orl0, phead = lst0 ∨ phead ∈ orl0 ⊦

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] → [orl0, orl], <all paths>

Additional information

Used simplifier rules: ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ markedp([], vs); (s) ⊦ ¬ dups([]); (s) ⊦ [] + x = x; (s) ⊦ ¬ a ∈ []; (s) ⊦ x ≠ [] → (a ' + x).last = x.last; (s) ⊦ y ≠ [] → (x + y + z).last = (y + z).last; (s) ⊦ x + [] = x; (s) in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ rl.last ∈ rl from r ↔ r ∈ rl; (s) Used terms: orl0, orl

Proof step 36 from proof stable-D14 (previous step) (back to tree)

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

A spec-lemma

Proof Tree for stable-D14 (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