[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-D18 (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.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl 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.nxt ≠ null ∧ ls.nxt = gs0.ps[ls.first].next) ∧ (¬ ls.success ∧ gs0.rvowns(gs0.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs0.orl ∧ gs0.vhead ∈ gs0.orl from ls.first) ∧ (ls.first ≠ ls.lst ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from ls.lst) ∧ ls.lst ∈ gs0.orl + gs0.qrl 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-D18 (previous step) (back to tree)

ls.nxt = gs.ps[ls.first].next, 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), dom gs.vrvHp = dom gs.prvHp, dom gs0.vrvHp = dom gs0.prvHp, ls.first ≠ ls.lst, ls.nxt ≠ null, 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.first ∈ gs.orl, gs.vhead ∈ gs.orl from ls.first, gs.vtail ∈ gs.orl + gs.qrl from ls.lst, ls.lst ∈ gs.orl + gs.qrl 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.nxt ≠ null ∧ ls.nxt = gs0.ps[ls.first].next) ∧ (¬ ls.success ∧ gs0.rvowns(gs0.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs0.orl ∧ gs0.vhead ∈ gs0.orl from ls.first) ∧ (ls.first ≠ ls.lst ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from ls.lst) ∧ ls.lst ∈ gs0.orl + gs0.qrl 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) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s)

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

gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl, gs.orl + rl0 = gs0.orl, ls.nxt = gs.ps[ls.first].next, 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, dom gs.vrvHp = dom gs.prvHp, dom gs0.vrvHp = dom gs0.prvHp, ls.first ≠ ls.lst, ls.nxt ≠ null, 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, gs.vtail ∈ gs.orl + gs.qrl from ls.lst, 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 from ls.first ∨ 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.nxt = gs0.ps[ls.first].next ∧ ls.first ∈ gs0.orl ∧ gs0.vhead ∈ gs0.orl from ls.first ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from ls.lst ∧ (ls.lst ∈ gs0.orl from ls.first ∨ ls.lst ∈ gs0.qrl) ∧ 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-D18 (previous step) (back to tree)

orl + rl0 = gs0.orl, orl + qrl + rl = gs0.orl + gs0.qrl, ls.nxt = ps[ls.first].next, ls.rvref = gs0.pretRefs(ls.tid), ls.rvref = gs0.vretRefs(ls.tid), 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, ls.first ≠ ls.lst, ls.nxt ≠ null, 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, vtail ∈ orl + qrl from ls.lst, 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 from ls.first ∨ 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.nxt = gs0.ps[ls.first].next ∧ ls.first ∈ gs0.orl ∧ gs0.vhead ∈ gs0.orl from ls.first ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from ls.lst ∧ (ls.lst ∈ gs0.orl from ls.first ∨ ls.lst ∈ gs0.qrl) ∧ 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-D18 (previous step) (back to tree)

orl + rl0 = gs0.orl, qrl + rl = rl0 + gs0.qrl, ls.nxt = ps[ls.first].next, ls.rvref = gs0.pretRefs(ls.tid), ls.rvref = gs0.vretRefs(ls.tid), 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.first ≠ ls.lst, ls.nxt ≠ null, 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, vtail ∈ orl + qrl from ls.lst, 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 from ls.first ∨ 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.nxt = gs0.ps[ls.first].next ∧ (gs0.vhead ∈ orl from ls.first ∨ gs0.vhead ∈ rl0) ∧ gs0.vtail ∈ (orl + rl0) + gs0.qrl from ls.lst ∧ (ls.lst ∈ orl from ls.first ∨ ls.lst ∈ rl0 ∨ ls.lst ∈ gs0.qrl)

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

qrl + rl = rl0 + qrl0, orl + rl0 = orl0, ls.nxt = ps[ls.first].next, ls.rvref = vretRefs0(ls.tid), ls.rvref = pretRefs0(ls.tid), 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.first ≠ ls.lst, ls.nxt ≠ null, 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, vtail ∈ orl + qrl from ls.lst, 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 from ls.first ∨ 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.nxt = ps0[ls.first].next ∧ (vhead0 ∈ orl from ls.first ∨ vhead0 ∈ rl0) ∧ vtail0 ∈ (orl + rl0) + qrl0 from ls.lst ∧ (ls.lst ∈ orl from ls.first ∨ ls.lst ∈ rl0 ∨ ls.lst ∈ qrl0)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] 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-D18 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, ls.nxt = ps[ls.first].next, ls.rvref = pretRefs0(ls.tid), ls.rvref = vretRefs0(ls.tid), 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.first ≠ ls.lst, ls.nxt ≠ null, 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, vtail ∈ orl + qrl from ls.lst, 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 from ls.first ∨ 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.nxt = ps0[ls.first].next ∧ (vhead0 ∈ orl from ls.first ∨ vhead0 ∈ rl0) ∧ vtail0 ∈ (orl + rl0) + qrl0 from ls.lst ∧ (ls.lst ∈ orl from ls.first ∨ ls.lst ∈ rl0 ∨ ls.lst ∈ qrl0)

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

qrl + rl = rl0 + qrl0, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, ls = mkls(tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), nxt = ps[first].next, pretRefs(tid) = rvref, rvowns(rvref) = Pending(tid), rvref = vretRefs0(tid), rvref = pretRefs0(tid), ¬ success, vretRefs(tid) = rvref, orl + rl0 ≠ [], first ≠ lst, nxt ≠ null, 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, vtail ∈ orl + qrl from lst, 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 from first ∨ 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) ⊦ nxt = ps0[first].next ∧ (vhead0 ∈ orl from first ∨ vhead0 ∈ rl0) ∧ vtail0 ∈ (orl + rl0) + qrl0 from lst ∧ (lst ∈ orl from first ∨ lst ∈ rl0 ∨ lst ∈ qrl0)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] 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-D18 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, 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 ≠ [], ps[first].next ≠ null, first ≠ lst, 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, vtail ∈ orl + qrl from lst, 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 from first ∨ 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 ⊦ ps[first].next = ps0[first].next ∧ (vhead0 ∈ orl from first ∨ vhead0 ∈ rl0) ∧ vtail0 ∈ (orl + rl0) + qrl0 from lst ∧ (lst ∈ orl from first ∨ lst ∈ rl0 ∨ lst ∈ qrl0)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

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

qrl + rl = rl0 + qrl0, 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 ≠ [], ps[first].next ≠ ps0[first].next, ps[first].next ≠ null, first ≠ lst, 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, vtail ∈ orl + qrl from lst, 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 from first ∨ 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:equalrl-def, seq:⊦ equalrl(rl, vs, ps, vs0, ps0) ↔ (∀ r. r ∈ rl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next) ∧ ( vs[rl.last].next ≠ null → vs0[rl.last].next = vs[rl.last].next ∧ vs0[vs0[rl.last].next].val = vs[vs0[rl.last].next].val)), subst:[ps, rl, ps0, vs0, vs] → [ps, orl + qrl, ps0, vs0, vs], <all paths>

Additional information

Used terms: ps, orl + qrl, ps0, vs0, vs

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

⊦ equalrl(rl, vs, ps, vs0, ps0) ↔ (∀ r. r ∈ rl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next) ∧ (vs[rl.last].next ≠ null → vs0[rl.last].next = vs[rl.last].next ∧ vs0[vs0[rl.last].next].val = vs[vs0[rl.last].next].val))

A spec-lemma

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

qrl + rl = rl0 + qrl0, 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 ≠ [], ps[first].next ≠ ps0[first].next, ps[first].next ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), 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, vtail ∈ orl + qrl from lst, 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), ∀ r. r ∈ orl + qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next) ∧ ( vs[(orl + qrl).last].next ≠ null → vs0[(orl + qrl).last].next = vs[(orl + qrl).last].next ∧ vs0[vs0[(orl + qrl).last].next].val = vs[vs0[(orl + qrl).last].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 from first ∨ 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 ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s)

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

qrl + rl = rl0 + qrl0, 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 ≠ [], ps[first].next ≠ ps0[first].next, ps[first].next ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), 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, vtail ∈ orl + qrl from lst, 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), ∀ r. r ∈ orl ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next) ∧ ( vs[(orl + qrl).last].next ≠ null → vs0[(orl + qrl).last].next = vs[(orl + qrl).last].next ∧ vs0[vs0[(orl + qrl).last].next].val = vs[vs0[(orl + qrl).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 from first ∨ 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 quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 73 terms: first

Additional information

Used terms: first

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

qrl + rl = rl0 + qrl0, 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 ≠ [], ps[first].next ≠ null, first ≠ lst, 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, vtail ∈ orl + qrl from lst, 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 from first ∨ 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 81

Additional information

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

qrl + rl = rl0 + qrl0, (orl + rl0).last = vhead0, 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 ≠ [], ps[first].next ≠ null, first ≠ lst, 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, vtail ∈ orl + qrl from lst, 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 from first ∨ 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-D18 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, 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 ≠ [], ps[first].next ≠ null, first ≠ lst, 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, vtail ∈ orl + qrl from lst, 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 from first ∨ 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-D18 (previous step) (back to tree)

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

A spec-lemma

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

qrl + rl = rl0 + qrl0, (orl + rl0).butlast.last = vhead0, 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 ≠ [], ps[first].next ≠ null, first ≠ lst, 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, vtail ∈ orl + qrl from lst, 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 from first ∨ 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-D18 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, 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 ', ps[first].next ≠ null, first ≠ lst, 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, vtail ∈ orl + qrl from lst, 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 from first ∨ 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, vtail1, 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-D18 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, orl = vtail1 + orl0, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], orl + rl0 ≠ vtail1 ', ps[first].next ≠ null, first ≠ lst, 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, vtail ∈ orl + qrl from lst, 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 from first ∨ 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) ⊦ y ≠ [] → (x + y + z).last = (y + z).last; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (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-D18 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, 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 ≠ [], ps[first].next ≠ null, first ≠ lst, 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((vtail1 ' + orl0) + qrl, vs, ps, vs0, ps0), listp((vtail1 ' + orl0) + qrl, vs, ps, owns), listp((vtail1 ' + 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, (vtail1 ' + (orl0 + rl0).butlast).last, vs0), noid(tid, (vtail1 ' + orl0) + qrl, first, vs), noidRely(tid, (vtail1 ' + orl0) + qrl, vs, (vtail1 ' + orl0) + rl0 + qrl0, vs0), nonullRetRefs((vtail1 ' + orl0) + qrl, vs, vretRefs, pretRefs), nonullRetRefs((vtail1 ' + 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[vtail1].deqID), some?(vs0[vtail1].deqID), some?(ps[vtail1].deqID), some?(vs[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 ∈ vtail1 ' + orl0 from first, vtail ∈ (vtail1 ' + orl0) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (vtail1 ' + orl0) + rl0 + qrl0 from vtail, (vtail1 ' + (orl0 + rl0).butlast).last ∈ (vtail1 ' + 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), ¬ vtail1 ∈ orl0, ¬ vtail1 ∈ rl0, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ qrl, ¬ (vtail1 ' + (orl0 + rl0).butlast).last ∈ vtail1 ' + orl0 from first, ¬ (vtail1 ' + (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[(vtail1 ' + (orl0 + rl0).butlast).last].next ≠ null ∧ vs0[vs0[(vtail1 ' + (orl0 + rl0).butlast).last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[(vtail1 ' + (orl0 + rl0).butlast).last].next].deqID.tid)) = Claimed(vs0[vs0[(vtail1 ' + (orl0 + rl0).butlast).last].next].deqID.tid, vs0[vs0[(vtail1 ' + (orl0 + rl0).butlast).last].next].val), phead = vtail1 ∨ phead ∈ orl0, first = vtail1 ∨ first ∈ orl0, phead0 = vtail1 ∨ phead0 ∈ orl0 ∨ phead0 ∈ rl0, phead0 ∈ vtail1 ' + orl0 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, vtail = ((vtail1 ' + orl0) + qrl).last ∨ qrl ≠ [] ∧ vtail = ((vtail1 ' + 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 ∈ vtail1 ' + orl0 from first ∨ lst ∈ qrl, (vtail1 ' + orl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl0 ≠ [] ∧ (vtail1 ' + 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:lapp, seq: ⊦ y ≠ [] → (x + y).last = y.last, subst:[x, y] → [orl0, rl0], <all paths>

Additional information

Used terms: orl0, rl0

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

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

A spec-lemma

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

qrl + rl = rl0 + qrl0, 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 ≠ [], ps[first].next ≠ null, first ≠ lst, 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((vtail1 ' + orl0) + qrl, vs, ps, vs0, ps0), listp((vtail1 ' + orl0) + rl0 + qrl0, vs0, ps0, owns0), listp((vtail1 ' + 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, (vtail1 ' + (orl0 + rl0).butlast).last, vs0), noid(tid, (vtail1 ' + orl0) + qrl, first, vs), noidRely(tid, (vtail1 ' + orl0) + qrl, vs, (vtail1 ' + orl0) + rl0 + qrl0, vs0), nonullRetRefs((vtail1 ' + orl0) + rl0 + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((vtail1 ' + 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[vtail1].deqID), some?(ps[vtail1].deqID), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), unmarkedp(qrl0, vs0), (vtail1 ' + (orl0 + rl0).butlast).last ∈ (vtail1 ' + orl0) + rl0 + qrl0 from vhead, vtail0 ∈ (vtail1 ' + orl0) + rl0 + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (vtail1 ' + orl0) + qrl from lst, vhead ∈ vtail1 ' + 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), ¬ vtail1 ∈ orl0, ¬ vtail1 ∈ rl0, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ qrl, ¬ (vtail1 ' + (orl0 + rl0).butlast).last ∈ vtail1 ' + orl0 from first, ¬ (vtail1 ' + (orl0 + rl0).butlast).last ∈ rl0, vs0[(vtail1 ' + (orl0 + rl0).butlast).last].next ≠ null ∧ vs0[vs0[(vtail1 ' + (orl0 + rl0).butlast).last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[(vtail1 ' + (orl0 + rl0).butlast).last].next].deqID.tid)) = Claimed(vs0[vs0[(vtail1 ' + (orl0 + rl0).butlast).last].next].deqID.tid, vs0[vs0[(vtail1 ' + (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), (vtail1 ' + orl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl0 ≠ [] ∧ (vtail1 ' + orl0.butlast).last = vhead ∧ phead ≠ orl0.last ∧ unmarkedp(qrl, vs), lst ∈ vtail1 ' + orl0 from first ∨ 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 = ((vtail1 ' + orl0) + qrl).last ∨ qrl ≠ [] ∧ vtail = ((vtail1 ' + orl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ vtail1 ' + orl0 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 = vtail1 ∨ phead0 ∈ orl0 ∨ phead0 ∈ rl0, first = vtail1 ∨ first ∈ orl0, phead = vtail1 ∨ 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-D18 (previous step) (back to tree)

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), ps[first].next ≠ null, first ≠ lst, 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((vtail1 ' + orl0) + qrl, vs, ps, vs0, ps0), listp(vtail1 ' + orl0 + qrl + rl, vs0, ps0, owns0), listp((vtail1 ' + 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, (vtail1 ' + orl0.butlast).last, vs0), noid(tid, (vtail1 ' + orl0) + qrl, first, vs), noidRely(tid, (vtail1 ' + orl0) + qrl, vs, vtail1 ' + orl0 + qrl + rl, vs0), nonullRetRefs(vtail1 ' + orl0 + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((vtail1 ' + 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[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), (vtail1 ' + orl0.butlast).last ∈ vtail1 ' + orl0 + qrl + rl from orl0.last, vtail0 ∈ vtail1 ' + orl0 + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (vtail1 ' + orl0) + qrl from lst, orl0.last ∈ vtail1 ' + 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), ¬ vtail1 ∈ orl0, ¬ (vtail1 ' + orl0.butlast).last ∈ vtail1 ' + orl0 from first, ¬ vtail1 ∈ qrl, ¬ vtail1 ∈ rl, vs0[(vtail1 ' + orl0.butlast).last].next ≠ null ∧ vs0[vs0[(vtail1 ' + orl0.butlast).last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[(vtail1 ' + orl0.butlast).last].next].deqID.tid)) = Claimed(vs0[vs0[(vtail1 ' + orl0.butlast).last].next].deqID.tid, vs0[vs0[(vtail1 ' + 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 ∈ vtail1 ' + orl0 from first ∨ lst ∈ qrl, first = vtail1 ∨ first ∈ orl0, phead = vtail1 ∨ 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 = vtail1 ∨ phead0 ∈ orl0, phead0 ∈ vtail1 ' + 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, vtail2, rl0]

Additional information

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

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

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

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

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

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

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

A spec-lemma

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

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), ps[first].next ≠ null, first ≠ lst, phead0 ≠ vtail2, pretRefs0(tid) ≠ null, rl0 ≠ [], vtail1 ≠ vtail2, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((vtail1 ' + rl0 + vtail2 ') + qrl, vs, ps, vs0, ps0), listp((vtail1 ' + rl0 + vtail2 ') + qrl, vs, ps, owns), listp(vtail1 ' + (rl0 + vtail2 ') + qrl + rl, vs0, ps0, owns0), markedp(rl0, ps0), markedp(rl0, vs0), markedp(rl0, ps), markedp(rl0, vs), nextnottid(tid, vtail2, vs), nextnottidRely(tid, vtail2, vs, rl0.last, vs0), noid(tid, (vtail1 ' + rl0 + vtail2 ') + qrl, first, vs), noidRely(tid, (vtail1 ' + rl0 + vtail2 ') + qrl, vs, vtail1 ' + (rl0 + vtail2 ') + qrl + rl, vs0), nonullRetRefs((vtail1 ' + rl0 + vtail2 ') + qrl, vs, vretRefs, pretRefs), nonullRetRefs(vtail1 ' + (rl0 + vtail2 ') + 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[vtail2].deqID), some?(vs0[vtail2].deqID), some?(ps[vtail2].deqID), some?(vs[vtail2].deqID), some?(ps0[vtail1].deqID), some?(vs0[vtail1].deqID), some?(ps[vtail1].deqID), some?(vs[vtail1].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, vtail2 ∈ vtail1 ' + rl0 + vtail2 ' from first, vtail ∈ (vtail1 ' + rl0 + vtail2 ') + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ vtail1 ' + (rl0 + vtail2 ') + 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 ∈ vtail1 ' + rl0 + vtail2 ' from first, ¬ vtail1 ∈ qrl, ¬ vtail1 ∈ rl, ¬ vtail2 ∈ rl0, ¬ vtail2 ∈ qrl, ¬ vtail2 ∈ rl, ¬ vtail1 ∈ rl0, vs[vtail2].next ≠ null ∧ vs[vs[vtail2].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vtail2].next].deqID.tid)) = Claimed(vs[vs[vtail2].next].deqID.tid, vs[vs[vtail2].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), phead0 = vtail1 ∨ phead0 ∈ rl0, vtail = (vtail2 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail2 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = (vtail2 ' + qrl + rl).last ∨ qrl + rl ≠ [] ∧ vtail0 = (vtail2 ' + (qrl + rl).butlast).last ∧ vs0[(qrl + rl).last].deqID = None ∧ vs0[(qrl + rl).last].next = null, phead = vtail1 ∨ phead ∈ rl0 ∨ phead = vtail2, first = vtail1 ∨ first ∈ rl0 ∨ first = vtail2, rl0.last ∈ qrl ∨ rl0.last ∈ rl, phead0 ∈ vtail1 ' + rl0 + vtail2 ' from phead ∨ phead0 ∈ qrl ∨ phead0 ∈ rl, lst ∈ vtail1 ' + rl0 + vtail2 ' from first ∨ 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] 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 ⊦ y ≠ [] → (x + y + z).last = (y + z).last; (s) ⊦ x ≠ [] → (a ' + x).last = x.last; (s) ⊦ ¬ a ∈ []; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ 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-D18 (previous step) (back to tree)

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

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] → [qrl, lst0, qrl0]

Additional information

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

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

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

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

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

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, lst0, qrl]

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) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' ↔ a = b; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: rl0, lst0, y

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

qrl + rl = rl0 + qrl0, 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 ≠ [], ps[first].next ≠ null, first ≠ lst, phead0 ≠ 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((vtail1 ' + orl0) + qrl, vs, ps, vs0, ps0), listp((vtail1 ' + orl0) + rl0 + qrl0, vs0, ps0, owns0), listp((vtail1 ' + 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, (vtail1 ' + (orl0 + rl0).butlast).last, vs0), noid(tid, (vtail1 ' + orl0) + qrl, first, vs), noidRely(tid, (vtail1 ' + orl0) + qrl, vs, (vtail1 ' + orl0) + rl0 + qrl0, vs0), nonullRetRefs((vtail1 ' + orl0) + rl0 + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((vtail1 ' + 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[vtail1].deqID), some?(ps[vtail1].deqID), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), unmarkedp(qrl0, vs0), (vtail1 ' + (orl0 + rl0).butlast).last ∈ (vtail1 ' + orl0) + rl0 + qrl0 from vhead, vtail0 ∈ (vtail1 ' + orl0) + rl0 + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (vtail1 ' + orl0) + qrl from lst, vhead ∈ vtail1 ' + 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), ¬ vtail1 ∈ orl0, ¬ vtail1 ∈ rl0, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ qrl, ¬ (vtail1 ' + (orl0 + rl0).butlast).last ∈ vtail1 ' + orl0 from first, ¬ (vtail1 ' + (orl0 + rl0).butlast).last ∈ rl0, vs0[(vtail1 ' + (orl0 + rl0).butlast).last].next ≠ null ∧ vs0[vs0[(vtail1 ' + (orl0 + rl0).butlast).last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[(vtail1 ' + (orl0 + rl0).butlast).last].next].deqID.tid)) = Claimed(vs0[vs0[(vtail1 ' + (orl0 + rl0).butlast).last].next].deqID.tid, vs0[vs0[(vtail1 ' + (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), (vtail1 ' + orl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl0 ≠ [] ∧ (vtail1 ' + orl0.butlast).last = vhead ∧ phead ≠ orl0.last ∧ unmarkedp(qrl, vs), lst ∈ vtail1 ' + orl0 from first ∨ 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 = ((vtail1 ' + orl0) + qrl).last ∨ qrl ≠ [] ∧ vtail = ((vtail1 ' + orl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ vtail1 ' + orl0 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 = vtail1 ∨ phead0 ∈ orl0 ∨ phead0 ∈ rl0, first = vtail1 ∨ first ∈ orl0, phead = vtail1 ∨ 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).butlast = x + y.butlast; (s) ⊦ y ≠ [] → (x + y + z).last = (y + z).last; (s)

Proof step 33 from proof stable-D18 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, 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 ≠ [], ps[first].next ≠ null, first ≠ lst, 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((vtail1 ' + orl0) + qrl, vs, ps, vs0, ps0), listp((vtail1 ' + orl0) + qrl, vs, ps, owns), listp((vtail1 ' + 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, (vtail1 ' + orl0 + rl0.butlast).last, vs0), noid(tid, (vtail1 ' + orl0) + qrl, first, vs), noidRely(tid, (vtail1 ' + orl0) + qrl, vs, (vtail1 ' + orl0) + rl0 + qrl0, vs0), nonullRetRefs((vtail1 ' + orl0) + qrl, vs, vretRefs, pretRefs), nonullRetRefs((vtail1 ' + 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[vtail1].deqID), some?(vs0[vtail1].deqID), some?(ps[vtail1].deqID), some?(vs[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 ∈ vtail1 ' + orl0 from first, vtail ∈ (vtail1 ' + orl0) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (vtail1 ' + orl0) + rl0 + qrl0 from vtail, (vtail1 ' + orl0 + rl0.butlast).last ∈ (vtail1 ' + 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), ¬ vtail1 ∈ orl0, ¬ vtail1 ∈ rl0, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ qrl, ¬ (vtail1 ' + orl0 + rl0.butlast).last ∈ vtail1 ' + orl0 from first, ¬ (vtail1 ' + 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[(vtail1 ' + orl0 + rl0.butlast).last].next ≠ null ∧ vs0[vs0[(vtail1 ' + orl0 + rl0.butlast).last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[(vtail1 ' + orl0 + rl0.butlast).last].next].deqID.tid)) = Claimed(vs0[vs0[(vtail1 ' + orl0 + rl0.butlast).last].next].deqID.tid, vs0[vs0[(vtail1 ' + orl0 + rl0.butlast).last].next].val), phead = vtail1 ∨ phead ∈ orl0, first = vtail1 ∨ first ∈ orl0, phead0 = vtail1 ∨ phead0 ∈ orl0 ∨ phead0 ∈ rl0, phead0 ∈ vtail1 ' + orl0 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, vtail = ((vtail1 ' + orl0) + qrl).last ∨ qrl ≠ [] ∧ vtail = ((vtail1 ' + orl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ vtail1 ' + orl0 from first ∨ lst ∈ qrl, (vtail1 ' + orl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl0 ≠ [] ∧ (vtail1 ' + 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, vhead0, orl]

Additional information

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

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

qrl + rl = rl0 + qrl0, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rl0 = orl + vhead0 ', rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl0 + rl0 ≠ [], ps[first].next ≠ null, first ≠ lst, phead0 ≠ vhead0, 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((vtail1 ' + orl0) + qrl, vs, ps, vs0, ps0), listp((vtail1 ' + orl0) + rl0 + qrl0, vs0, ps0, owns0), listp((vtail1 ' + 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, (vtail1 ' + orl0 + orl).last, vs0), noid(tid, (vtail1 ' + orl0) + qrl, first, vs), noidRely(tid, (vtail1 ' + orl0) + qrl, vs, (vtail1 ' + orl0) + rl0 + qrl0, vs0), nonullRetRefs((vtail1 ' + orl0) + rl0 + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs((vtail1 ' + 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[vtail1].deqID), some?(ps[vtail1].deqID), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), unmarkedp(qrl0, vs0), (vtail1 ' + orl0 + orl).last ∈ (vtail1 ' + orl0) + rl0 + qrl0 from vhead, vtail0 ∈ (vtail1 ' + orl0) + rl0 + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (vtail1 ' + orl0) + qrl from lst, vhead ∈ vtail1 ' + 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), ¬ vtail1 ∈ orl0, ¬ vtail1 ∈ rl0, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ qrl, ¬ (vtail1 ' + orl0 + orl).last ∈ vtail1 ' + orl0 from first, ¬ (vtail1 ' + orl0 + orl).last ∈ rl0, vs0[(vtail1 ' + orl0 + orl).last].next ≠ null ∧ vs0[vs0[(vtail1 ' + orl0 + orl).last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[(vtail1 ' + orl0 + orl).last].next].deqID.tid)) = Claimed(vs0[vs0[(vtail1 ' + orl0 + orl).last].next].deqID.tid, vs0[vs0[(vtail1 ' + 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, (vtail1 ' + orl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl0 ≠ [] ∧ (vtail1 ' + orl0.butlast).last = vhead ∧ phead ≠ orl0.last ∧ unmarkedp(qrl, vs), lst ∈ vtail1 ' + orl0 from first ∨ lst ∈ qrl, vtail = ((vtail1 ' + orl0) + qrl).last ∨ qrl ≠ [] ∧ vtail = ((vtail1 ' + orl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ vtail1 ' + orl0 from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 = vtail1 ∨ phead0 ∈ orl0 ∨ phead0 ∈ rl0, first = vtail1 ∨ first ∈ orl0, phead = vtail1 ∨ 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 35 from proof stable-D18 (previous step) (back to tree)

qrl + rl = (orl + vhead0 ') + qrl0, 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), (vtail1 ' + orl0 + orl).last ≠ vhead0, ps[first].next ≠ null, first ≠ lst, phead0 ≠ vhead0, pretRefs0(tid) ≠ null, vtail1 ≠ vhead0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((vtail1 ' + orl0) + qrl, vs, ps, vs0, ps0), listp((vtail1 ' + orl0) + qrl, vs, ps, owns), listp((vtail1 ' + 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, (vtail1 ' + orl0 + orl).last, vs0), noid(tid, (vtail1 ' + orl0) + qrl, first, vs), noidRely(tid, (vtail1 ' + orl0) + qrl, vs, (vtail1 ' + orl0) + qrl + rl, vs0), nonullRetRefs((vtail1 ' + orl0) + qrl, vs, vretRefs, pretRefs), nonullRetRefs((vtail1 ' + 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[vtail1].deqID), some?(vs0[vtail1].deqID), some?(ps[vtail1].deqID), some?(vs[vtail1].deqID), some?(ps0[vhead0].deqID), some?(vs0[vhead0].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 ∈ vtail1 ' + orl0 from first, vtail ∈ (vtail1 ' + orl0) + qrl from lst, pretRefs0(tid) ∈ vrvHp, vtail0 ∈ (vtail1 ' + orl0) + qrl + rl from vtail, (vtail1 ' + orl0 + orl).last ∈ (vtail1 ' + 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), ¬ vhead0 ∈ orl0, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ qrl0, ¬ vtail1 ∈ orl0, ¬ vtail1 ∈ orl, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ qrl, ¬ (vtail1 ' + orl0 + orl).last ∈ vtail1 ' + orl0 from first, ¬ (vtail1 ' + 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[(vtail1 ' + orl0 + orl).last].next ≠ null ∧ vs0[vs0[(vtail1 ' + orl0 + orl).last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[(vtail1 ' + orl0 + orl).last].next].deqID.tid)) = Claimed(vs0[vs0[(vtail1 ' + orl0 + orl).last].next].deqID.tid, vs0[vs0[(vtail1 ' + orl0 + orl).last].next].val), phead = vtail1 ∨ phead ∈ orl0, first = vtail1 ∨ first ∈ orl0, vtail = ((vtail1 ' + orl0) + qrl).last ∨ qrl ≠ [] ∧ vtail = ((vtail1 ' + orl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ vtail1 ' + orl0 from first ∨ lst ∈ qrl, (vtail1 ' + orl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl0 ≠ [] ∧ (vtail1 ' + orl0.butlast).last = vhead ∧ phead ≠ orl0.last ∧ unmarkedp(qrl, vs), phead0 = vtail1 ∨ phead0 ∈ orl0 ∨ phead0 ∈ orl, phead0 ∈ vtail1 ' + orl0 from phead ∨ phead0 ∈ orl ∨ phead0 ∈ qrl0, vtail0 = (vhead0 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vhead0 ' + 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] → [vtail1 ', 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: vtail1 ', orl0 + orl

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

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

A spec-lemma

Proof step 37 from proof stable-D18 (previous step) (back to tree)

qrl + rl = (orl + vhead0 ') + qrl0, 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 ≠ vhead0, ps[first].next ≠ null, first ≠ lst, phead0 ≠ vhead0, pretRefs0(tid) ≠ null, vtail1 ≠ vhead0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl((vtail1 ' + orl0) + qrl, vs, ps, vs0, ps0), listp((vtail1 ' + orl0) + qrl + rl, vs0, ps0, owns0), listp((vtail1 ' + 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, (vtail1 ' + orl0) + qrl, first, vs), noidRely(tid, (vtail1 ' + orl0) + qrl, vs, (vtail1 ' + orl0) + qrl + rl, vs0), nonullRetRefs((vtail1 ' + orl0) + qrl + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs((vtail1 ' + 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[vhead0].deqID), some?(ps0[vhead0].deqID), some?(vs[vtail1].deqID), some?(ps[vtail1].deqID), some?(vs0[vtail1].deqID), some?(ps0[vtail1].deqID), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), unmarkedp(qrl0, vs0), (orl0 + orl).last ∈ (vtail1 ' + orl0) + qrl + rl from vhead, vtail0 ∈ (vtail1 ' + orl0) + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ (vtail1 ' + orl0) + qrl from lst, vhead ∈ vtail1 ' + 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), ¬ vhead0 ∈ orl0, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ qrl0, ¬ vtail1 ∈ orl0, ¬ vtail1 ∈ orl, ¬ vtail1 ∈ qrl0, ¬ vtail1 ∈ qrl, ¬ (orl0 + orl).last ∈ vtail1 ' + 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 = (vhead0 ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (vhead0 ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead0 ∈ vtail1 ' + orl0 from phead ∨ phead0 ∈ orl ∨ phead0 ∈ qrl0, phead0 = vtail1 ∨ phead0 ∈ orl0 ∨ phead0 ∈ orl, (vtail1 ' + orl0).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl0 ≠ [] ∧ (vtail1 ' + orl0.butlast).last = vhead ∧ phead ≠ orl0.last ∧ unmarkedp(qrl, vs), lst ∈ vtail1 ' + orl0 from first ∨ lst ∈ qrl, vtail = ((vtail1 ' + orl0) + qrl).last ∨ qrl ≠ [] ∧ vtail = ((vtail1 ' + orl0) + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, first = vtail1 ∨ first ∈ orl0, phead = vtail1 ∨ 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 38 from proof stable-D18 (previous step) (back to tree)

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

A spec-lemma

Proof step 39 from proof stable-D18 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, 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 ≠ [], ps[first].next ≠ null, first ≠ lst, 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, vtail ∈ orl + qrl from lst, 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), ¬ vtail0 ∈ (orl + rl0) + qrl0 from lst, 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 from first ∨ 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 77

Additional information

Proof step 40 from proof stable-D18 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, 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), vtail0 = ((orl + rl0) + qrl0).last, orl + rl0 ≠ [], ps[first].next ≠ null, first ≠ lst, 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, vtail ∈ orl + qrl from lst, 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), ¬ vtail0 ∈ (orl + rl0) + qrl0 from lst, 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 from first ∨ lst ∈ qrl, 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] 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 ⊦ ¬ a ∈ []; (s) ⊦ ¬ r ∈ rl → rl from r = []; (s) ⊦ r ∈ rl from r0 → r ∈ rl; (ss) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ rl.last ∈ rl from r ↔ r ∈ rl; (s)

Proof step 41 from proof stable-D18 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, 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 ≠ [], ps[first].next ≠ null, first ≠ lst, 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), vtail ∈ qrl from lst, 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, vhead0 ∈ (orl + rl0) + qrl0 from vhead, pretRefs0(tid) ∈ vrvHp, lst ∈ qrl, lst ∈ vs, lst ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(orl + rl0), ¬ dups(rl0 + qrl0), ¬ dups(orl), ¬ dups(rl), ¬ dups(qrl), ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ lst ∈ qrl0, ¬ lst ∈ rl0, ¬ lst ∈ orl, ¬ lst ∈ orl from first, 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), 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, vtail ∈ orl ∨ vtail ∈ rl0 ∨ vtail ∈ qrl0, (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, phead1, orl0]

Additional information

Used simplifier rules: ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ (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) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ ¬ r ∈ rl → rl from r = []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ ¬ a ∈ []; (s) ⊦ [] + x = x; (s) ⊦ [] from r = []; (s) x ≠ [] ⊦ a = x.head ∧ y = x.tail ↔ x = a + y; (elim) Used terms: qrl, phead1, y

Proof step 42 from proof stable-D18 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs0[qrl0.last].deqID = None, vs0[qrl0.last].next = null, 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), vtail0 = ((orl + rl0) + qrl0.butlast).last, orl + rl0 ≠ [], ps[first].next ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, qrl0 ≠ [], 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, vtail ∈ orl + qrl from lst, 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), ¬ vtail0 ∈ (orl + rl0) + qrl0 from lst, 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 from first ∨ lst ∈ qrl, 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 43 from proof stable-D18 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs0[qrl0.last].deqID = None, vs0[qrl0.last].next = null, 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 ≠ [], ps[first].next ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, qrl0 ≠ [], 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, vtail ∈ orl + qrl from lst, pretRefs0(tid) ∈ vrvHp, ((orl + rl0) + qrl0.butlast).last ∈ (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), ¬ ((orl + rl0) + qrl0.butlast).last ∈ (orl + rl0) + qrl0 from lst, 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, lst ∈ orl from first ∨ 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 ∧ unmarkedp(qrl0.tail, vs0) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0) ⊦

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] → [qrl0, vtail0, orl0]

Additional information

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

Proof step 44 from proof stable-D18 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs0[qrl0.last].deqID = None, vs0[qrl0.last].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), qrl0 = vtail0 + orl0, rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], ps[first].next ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, qrl0 ≠ [], 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, ((orl + rl0) + qrl0.butlast).last ∈ (orl + rl0) + qrl0 from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ orl + qrl from lst, 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) + qrl0.butlast).last ∈ (orl + rl0) + qrl0 from lst, 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 ∧ unmarkedp(orl0, 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 from first ∨ lst ∈ qrl, 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] ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ a + x = a ' + x; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ a ' + x ≠ []; (s)

Proof step 45 from proof stable-D18 (previous step) (back to tree)

qrl + rl = rl0 + vtail0 ' + orl0, vs0[(vtail0 ' + orl0).last].deqID = None, ps0[vtail0].deqID = None, vs0[(vtail0 ' + orl0).last].next = null, 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 ≠ [], ps[first].next ≠ null, first ≠ lst, 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 + qrl + rl, 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 + qrl + rl, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs(orl + 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), unmarkedp(qrl, ps), unmarkedp(orl0, 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, vtail ∈ orl + qrl from lst, pretRefs0(tid) ∈ vrvHp, (orl + rl0 + (vtail0 ' + orl0).butlast).last ∈ orl + qrl + rl from vtail, vhead0 ∈ orl + qrl + rl from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups((orl + rl0) + orl0), ¬ dups(orl + qrl), ¬ dups(qrl), ¬ dups(rl), ¬ dups(rl0), ¬ dups(orl0), ¬ dups(orl), ¬ dups(rl0 + orl0), ¬ dups(orl + rl0), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl0, ¬ (orl + rl0 + (vtail0 ' + orl0).butlast).last ∈ orl + qrl + rl from lst, 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, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl from first ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ orl0, (orl + rl0).last = vhead0 ∧ unmarkedp(orl0, vs0) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(orl0, vs0) ⊦

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

Additional information

Used terms: vtail0 ', orl0

Proof step 46 from proof stable-D18 (previous step) (back to tree)

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

A spec-lemma

Proof step 47 from proof stable-D18 (previous step) (back to tree)

qrl + rl = rl0 + vtail0 ' + orl0, ps0[vtail0].deqID = None, vs0[(vtail0 ' + orl0).last].deqID = None, vs0[(vtail0 ' + orl0).last].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, orl0 = [], pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], ps[first].next ≠ null, first ≠ lst, 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 + qrl + rl, 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 + qrl + rl, vs0), nonullRetRefs(orl + qrl + rl, 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(orl0, ps0), unmarkedp(qrl, ps), vhead0 ∈ orl + qrl + rl from vhead, (orl + rl0 + (vtail0 ' + orl0).butlast).last ∈ orl + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ orl + qrl from lst, 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) + orl0), ¬ dups(orl + qrl), ¬ dups(qrl), ¬ dups(rl), ¬ dups(rl0), ¬ dups(orl0), ¬ dups(orl), ¬ dups(rl0 + orl0), ¬ dups(orl + rl0), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl0, ¬ (orl + rl0 + (vtail0 ' + orl0).butlast).last ∈ orl + qrl + rl from lst, 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 ∧ unmarkedp(orl0, vs0) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(orl0, vs0), phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ orl0, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), lst ∈ orl from first ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, 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 ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ unmarkedp([], vs); (s) ⊦ ¬ a ∈ []; (s) ⊦ x + [] = x; (s) ⊦ a '.butlast = []; (s) ⊦ ¬ dups([]); (s) ⊦ a '.last = a; (s)

Proof step 48 from proof stable-D18 (previous step) (back to tree)

qrl + rl = rl0 + vtail0 ', ps0[vtail0].deqID = None, vs0[vtail0].deqID = None, vs0[vtail0].next = null, 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 ≠ [], ps[first].next ≠ null, first ≠ lst, 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 + qrl + rl, 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 + qrl + rl, vs0), nonullRetRefs(orl + qrl + rl, 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(qrl, ps), (orl + rl0).last ∈ orl + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ orl + qrl from lst, 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, vhead0 ∈ orl + qrl + rl from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(orl), ¬ dups(rl0), ¬ dups(rl), ¬ dups(qrl), ¬ dups(orl + qrl), ¬ dups(orl + rl0), ¬ (orl + rl0).last ∈ orl + qrl + rl from lst, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl, 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 ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), lst ∈ orl from first ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ orl ∨ phead0 ∈ rl0, vtail0 ∈ qrl ∨ vtail0 ∈ rl ⊦

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 terms: orl, rl0

Proof step 49 from proof stable-D18 (previous step) (back to tree)

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

A spec-lemma

Proof step 50 from proof stable-D18 (previous step) (back to tree)

qrl + rl = rl0 + vtail0 ', vs0[vtail0].deqID = None, ps0[vtail0].deqID = None, vs0[vtail0].next = null, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rl0 = [], rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], ps[first].next ≠ null, first ≠ lst, 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 + qrl + rl, 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 + qrl + rl, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs(orl + 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), unmarkedp(qrl, ps), vhead0 ∈ orl + qrl + rl from vhead, 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, vtail ∈ orl + qrl from lst, pretRefs0(tid) ∈ vrvHp, (orl + rl0).last ∈ orl + qrl + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(orl), ¬ dups(rl0), ¬ dups(rl), ¬ dups(qrl), ¬ dups(orl + qrl), ¬ dups(orl + rl0), ¬ (orl + rl0).last ∈ orl + qrl + rl from lst, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ 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[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), vtail0 ∈ qrl ∨ vtail0 ∈ rl, phead0 ∈ orl ∨ phead0 ∈ rl0, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl from first ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0, (orl + rl0).last = vhead0 ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ⊦

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

Proof step 51 from proof stable-D18 (previous step) (back to tree)

qrl + rl = vtail0 ', ps0[vtail0].deqID = None, vs0[vtail0].deqID = None, vs0[vtail0].next = null, 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), ps[first].next ≠ null, first ≠ lst, 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 + qrl + rl, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), markedp(orl, vs0), markedp(orl, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, first, vs), noidRely(tid, orl + qrl, vs, orl + qrl + rl, vs0), nonullRetRefs(orl + qrl + rl, 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(qrl, ps), pretRefs0(tid) ∈ vrvHp, vtail ∈ orl + qrl from lst, vhead ∈ orl from first, first ∈ orl, phead ∈ orl, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, first ∈ vs0, first ∈ ps0, first ∈ vs, first ∈ ps, vhead0 ∈ orl + qrl + rl from vhead, orl.last ∈ orl + qrl + rl from vtail, phead0 ∈ orl, phead0 ∈ orl from phead, phead0 ∈ vs0, phead0 ∈ ps0, phead0 ∈ vs, phead0 ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl), ¬ dups(qrl), ¬ dups(orl + qrl), ¬ dups(orl), ¬ vtail0 ∈ orl, ¬ orl.last ∈ orl + qrl + rl from lst, 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 from first ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 ∈ qrl ∨ vtail0 ∈ rl, orl.last = vhead0 ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead0 ∧ phead0 ≠ orl.last ⊦

User applied rule apply elim lemma

And obtained the following new goals

Rule argument

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

Additional information

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

Proof step 52 from proof stable-D18 (previous step) (back to tree)

qrl + rl = vtail0 ', vs0[vtail0].deqID = None, ps0[vtail0].deqID = None, vs0[vtail0].next = null, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, orl = orl0 + phead1 ', pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, 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 + qrl + rl, vs0, ps0, owns0), markedp(orl, ps0), 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 + qrl + rl, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs(orl + 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), unmarkedp(qrl, ps), phead0 ∈ ps, phead0 ∈ vs, phead0 ∈ ps0, phead0 ∈ vs0, phead0 ∈ orl from phead, phead0 ∈ orl, phead1 ∈ orl + qrl + rl from vtail, vhead0 ∈ orl + qrl + rl from vhead, first ∈ ps, first ∈ vs, first ∈ ps0, first ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, phead ∈ orl, first ∈ orl, vhead ∈ orl from first, vtail ∈ orl + qrl from lst, pretRefs0(tid) ∈ vrvHp, dom prvHp ⊆ dom prvHp0, ¬ dups(rl), ¬ dups(qrl), ¬ dups(orl + qrl), ¬ dups(orl), ¬ vtail0 ∈ orl, ¬ phead1 ∈ orl + qrl + rl from lst, 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), phead1 = vhead0 ∨ orl0 ≠ [] ∧ orl0.last = vhead0 ∧ phead0 ≠ phead1, vtail0 ∈ qrl ∨ vtail0 ∈ rl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl from first ∨ lst ∈ qrl, phead1 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ phead1 ∧ unmarkedp(qrl, vs) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 53 from proof stable-D18 (previous step) (back to tree)

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

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used simplifier rules: ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ ¬ r ∈ rl → rl from r = []; (s) ⊦ a ∈ x → (b ' + x).last = x.last; (s) one: ⊦ x + y = a ' ∧ b ∈ x → a = b ∧ x = a ' ∧ y = []; (forward) from specification list[reflist] list-elem-in-app22: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app21: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ vs; (forward) from specification DMSQ ⊦ a ' = b ' ↔ a = b; (s) ⊦ x + [] = x; (s) ⊦ ¬ a ∈ []; (s) ⊦ ¬ dups([]); (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ ¬ dups(a '); (s) ⊦ a '.last = a; (s) ⊦ a ' ≠ []; (s) ⊦ a '.tail = []; (s) ⊦ unmarkedp([], vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) Used terms: orl0 + phead1 ', qrl + rl, lst

Proof step 54 from proof stable-D18 (previous step) (back to tree)

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

A spec-lemma

Proof step 55 from proof stable-D18 (previous step) (back to tree)

qrl + rl = rl0 + vtail0 ', vs0[vtail0].deqID = None, ps0[vtail0].deqID = None, vs0[vtail0].next = null, 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 ≠ [], ps[first].next ≠ null, first ≠ lst, orl ≠ [], 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(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl, vs, ps, owns), listp(orl + qrl + rl, 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 + qrl + rl, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs(orl + 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), unmarkedp(qrl, ps), vhead0 ∈ orl + qrl + rl from vhead, 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, vtail ∈ orl + qrl from lst, pretRefs0(tid) ∈ vrvHp, rl0.last ∈ orl + qrl + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(orl), ¬ dups(rl0), ¬ dups(rl), ¬ dups(qrl), ¬ dups(orl + qrl), ¬ dups(orl + rl0), ¬ rl0.last ∈ orl + qrl + rl from lst, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ 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[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), vtail0 ∈ qrl ∨ vtail0 ∈ rl, phead0 ∈ orl ∨ phead0 ∈ rl0, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl from first ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0, rl0.last = vhead0 ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ rl0.last ⊦

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).butlast = x + y.butlast; (s)

Proof step 56 from proof stable-D18 (previous step) (back to tree)

qrl + rl = rl0 + vtail0 ', ps0[vtail0].deqID = None, vs0[vtail0].deqID = None, vs0[vtail0].next = null, 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 ≠ [], ps[first].next ≠ null, first ≠ lst, orl ≠ [], 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(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl + rl, 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 + qrl + rl, vs0), nonullRetRefs(orl + qrl + rl, 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(qrl, ps), rl0.last ∈ orl + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ orl + qrl from lst, 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, vhead0 ∈ orl + qrl + rl from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(orl), ¬ dups(rl0), ¬ dups(rl), ¬ dups(qrl), ¬ dups(orl + qrl), ¬ dups(orl + rl0), ¬ rl0.last ∈ orl + qrl + rl from lst, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl, 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), phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), lst ∈ orl from first ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ orl ∨ phead0 ∈ rl0, vtail0 ∈ qrl ∨ vtail0 ∈ rl, rl0.last = vhead0 ∨ orl + rl0.butlast ≠ [] ∧ (orl + rl0.butlast).last = vhead0 ∧ phead0 ≠ rl0.last ⊦

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, phead1, orl0]

Additional information

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

Proof step 57 from proof stable-D18 (previous step) (back to tree)

qrl + rl = rl0 + vtail0 ', vs0[vtail0].deqID = None, ps0[vtail0].deqID = None, vs0[vtail0].next = null, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rl0 = orl0 + phead1 ', rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], ps[first].next ≠ null, first ≠ lst, orl ≠ [], 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(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl, vs, ps, owns), listp(orl + qrl + rl, 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 + qrl + rl, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs(orl + 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), unmarkedp(qrl, ps), vhead0 ∈ orl + qrl + rl from vhead, 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, vtail ∈ orl + qrl from lst, pretRefs0(tid) ∈ vrvHp, phead1 ∈ orl + qrl + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(orl), ¬ dups(rl0), ¬ dups(rl), ¬ dups(qrl), ¬ dups(orl + qrl), ¬ dups(orl + rl0), ¬ phead1 ∈ orl + qrl + rl from lst, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ 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[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), phead1 = vhead0 ∨ orl + orl0 ≠ [] ∧ (orl + orl0).last = vhead0 ∧ phead0 ≠ phead1, vtail0 ∈ qrl ∨ vtail0 ∈ rl, phead0 ∈ orl ∨ phead0 ∈ rl0, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl from first ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ⊦

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) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (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 58 from proof stable-D18 (previous step) (back to tree)

qrl + rl = (orl0 + phead1 ') + vtail0 ', ps0[vtail0].deqID = None, vs0[vtail0].deqID = None, vs0[vtail0].next = null, 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), ps[first].next ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, vtail0 ≠ phead1, 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 + qrl + rl, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), markedp(orl, vs0), markedp(orl0, vs0), markedp(orl, ps0), markedp(orl0, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, first, vs), noidRely(tid, orl + qrl, vs, orl + qrl + rl, vs0), nonullRetRefs(orl + qrl + rl, 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), some?(vs0[phead1].deqID), some?(ps0[phead1].deqID), unmarkedp(qrl, ps), phead1 ∈ orl + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ orl + qrl from lst, 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, vhead0 ∈ orl + qrl + rl from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(rl), ¬ dups(qrl), ¬ dups(orl + qrl), ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ vtail0 ∈ orl, ¬ phead1 ∈ orl0, ¬ phead1 ∈ orl, ¬ phead1 ∈ orl + qrl + rl from lst, ¬ vtail0 ∈ orl0, 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 from first ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 ∈ qrl ∨ vtail0 ∈ rl, phead1 = vhead0 ∨ orl + orl0 ≠ [] ∧ (orl + orl0).last = vhead0 ∧ phead0 ≠ phead1, phead0 ∈ orl ∨ phead0 ∈ orl0 ∨ phead0 = phead1, phead0 ∈ orl from phead ∨ phead0 ∈ orl0 ∨ phead0 = phead1 ∨ phead0 = vtail0 ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used simplifier rules: ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) notin-forward: ⊦ rl + rl0 = rl1 + rl2 + rl3 ∧ ¬ r ∈ rl ∧ ¬ r ∈ rl0 → ¬ r ∈ rl1 ∧ ¬ r ∈ rl2 ∧ ¬ r ∈ rl3; (forward) from specification DMSQ list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s) Used terms: orl, qrl + rl, lst

Proof step 59 from proof stable-D18 (previous step) (back to tree)

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

A spec-lemma

Proof step 60 from proof stable-D18 (previous step) (back to tree)

qrl + rl = (orl0 + phead1 ') + vtail0 ', vs0[vtail0].deqID = None, ps0[vtail0].deqID = None, vs0[vtail0].next = null, 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), ps[first].next ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, vtail0 ≠ phead1, 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 + qrl + rl, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl, ps0), markedp(orl0, 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 + qrl + rl, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs(orl + 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[phead1].deqID), some?(vs0[phead1].deqID), unmarkedp(qrl, ps), vhead0 ∈ orl + qrl + rl from vhead, 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, vtail ∈ orl + qrl from lst, pretRefs0(tid) ∈ vrvHp, phead1 ∈ orl + qrl + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(rl), ¬ dups(qrl), ¬ dups(orl + qrl), ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ lst ∈ orl, ¬ vtail0 ∈ orl, ¬ phead1 ∈ orl0, ¬ phead1 ∈ orl, ¬ phead1 ∈ orl + qrl + rl from lst, ¬ vtail0 ∈ orl0, 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 from phead ∨ phead0 ∈ orl0 ∨ phead0 = phead1 ∨ phead0 = vtail0, phead0 ∈ orl ∨ phead0 ∈ orl0 ∨ phead0 = phead1, phead1 = vhead0 ∨ orl + orl0 ≠ [] ∧ (orl + orl0).last = vhead0 ∧ phead0 ≠ phead1, vtail0 ∈ qrl ∨ vtail0 ∈ rl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl from first ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] list-elem-in-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 ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ ¬ a ∈ []; (s) ⊦ ¬ r ∈ rl → rl from r = []; (s) ⊦ r ∈ rl from r0 → r ∈ rl; (ss) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s)

Proof step 61 from proof stable-D18 (previous step) (back to tree)

qrl + rl = (orl0 + phead1 ') + vtail0 ', vs0[vtail0].deqID = None, ps0[vtail0].deqID = None, vs0[vtail0].next = null, 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), ps[first].next ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, vtail0 ≠ phead1, 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 + qrl + rl, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl, ps0), markedp(orl0, 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 + qrl + rl, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs(orl + 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[phead1].deqID), some?(vs0[phead1].deqID), unmarkedp(qrl, ps), vtail ∈ qrl from lst, pretRefs0(tid) ∈ vrvHp, phead1 ∈ orl + qrl + rl from vtail, vhead0 ∈ orl + qrl + rl from vhead, 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, lst ∈ qrl, lst ∈ vs, lst ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ dups(orl + qrl), ¬ dups(qrl), ¬ dups(rl), ¬ phead1 ∈ orl, ¬ phead1 ∈ orl0, ¬ vtail0 ∈ orl, ¬ lst ∈ orl, ¬ vtail0 ∈ orl0, ¬ lst ∈ orl from first, ¬ phead1 ∈ qrl from lst, ¬ phead1 ∈ 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), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), phead0 ∈ orl from phead ∨ phead0 ∈ orl0 ∨ phead0 = phead1 ∨ phead0 = vtail0, phead0 ∈ orl ∨ phead0 ∈ orl0 ∨ phead0 = phead1, phead1 = vhead0 ∨ orl + orl0 ≠ [] ∧ (orl + orl0).last = vhead0 ∧ phead0 ≠ phead1, vtail0 ∈ qrl ∨ vtail0 ∈ rl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

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

Additional information

Used simplifier rules: ⊦ [] + x = x; (s) ⊦ ¬ a ∈ x → x ≠ y + a ' + z; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] x ≠ [] ⊦ a = x.head ∧ y = x.tail ↔ x = a + y; (elim) Used terms: qrl, vhead1, y

Proof step 62 from proof stable-D18 (previous step) (back to tree)

qrl + rl = (orl0 + phead1 ') + vtail0 ', ps0[vtail0].deqID = None, vs0[vtail0].deqID = None, vs0[vtail0].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), qrl = vhead1 + orl1, rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), ps[first].next ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, qrl ≠ [], vtail0 ≠ phead1, 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 + qrl + rl, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), markedp(orl, vs0), markedp(orl0, vs0), markedp(orl, ps0), markedp(orl0, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, first, vs), noidRely(tid, orl + qrl, vs, orl + qrl + rl, vs0), nonullRetRefs(orl + qrl + rl, 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), some?(vs0[phead1].deqID), some?(ps0[phead1].deqID), unmarkedp(qrl, ps), lst ∈ ps, lst ∈ vs, lst ∈ qrl, 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, vhead0 ∈ orl + qrl + rl from vhead, phead1 ∈ orl + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ qrl from lst, dom prvHp ⊆ dom prvHp0, ¬ dups(orl0), ¬ dups(orl), ¬ dups(orl + orl0), ¬ dups(orl + qrl), ¬ dups(qrl), ¬ dups(rl), ¬ phead1 ∈ orl, ¬ phead1 ∈ orl0, ¬ vtail0 ∈ orl, ¬ lst ∈ orl, ¬ vtail0 ∈ orl0, ¬ lst ∈ orl from first, ¬ phead1 ∈ qrl from lst, ¬ phead1 ∈ rl, 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), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 ∈ qrl ∨ vtail0 ∈ rl, phead1 = vhead0 ∨ orl + orl0 ≠ [] ∧ (orl + orl0).last = vhead0 ∧ phead0 ≠ phead1, phead0 ∈ orl ∨ phead0 ∈ orl0 ∨ phead0 = phead1, phead0 ∈ orl from phead ∨ phead0 ∈ orl0 ∨ phead0 = phead1 ∨ phead0 = vtail0, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(orl1, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] inapp-10: ⊦ a ' + x = y + b ' ∧ a ≠ b → a ∈ y ∧ b ∈ x; (forward) from specification list[reflist] lapp-04: ⊦ a ' + x = y + b ' ∧ a ≠ b → x.last = b; (forward) from specification list-last[reflist] ⊦ ¬ a ∈ y → (y + c ' + z = a ' + z0 ↔ y = [] ∧ c = a ∧ z = z0); (ws) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a + x = a ' + x; (s) ⊦ a ' + x ≠ []; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws)

Proof step 63 from proof stable-D18 (previous step) (back to tree)

(vhead1 ' + orl1) + rl = (orl0 + phead1 ') + (orl1 + rl).last ', ps[vhead1].deqID = None, ps0[(orl1 + rl).last].deqID = None, vs0[(orl1 + rl).last].deqID = None, vs0[(orl1 + rl).last].next = null, 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), orl1 + rl ≠ [], (orl1 + rl).last ≠ phead1, ps[first].next ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, vhead1 ≠ (orl1 + rl).last, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + vhead1 ' + orl1, vs, ps, vs0, ps0), listp(orl + (vhead1 ' + orl1) + rl, vs0, ps0, owns0), listp(orl + vhead1 ' + orl1, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), markedp(orl, vs0), markedp(orl0, vs0), markedp(orl, ps0), markedp(orl0, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + vhead1 ' + orl1, first, vs), noidRely(tid, orl + vhead1 ' + orl1, vs, orl + (vhead1 ' + orl1) + rl, vs0), nonullRetRefs(orl + (vhead1 ' + orl1) + rl, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + vhead1 ' + orl1, 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[phead1].deqID), some?(ps0[phead1].deqID), unmarkedp(orl1, ps), lst ∈ ps, lst ∈ vs, 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, vhead0 ∈ orl + (vhead1 ' + orl1) + rl from vhead, phead1 ∈ orl + (vhead1 ' + orl1) + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ vhead1 ' + orl1 from lst, dom prvHp ⊆ dom prvHp0, ¬ dups(orl1), ¬ dups(orl), ¬ dups(rl), ¬ dups(orl + orl1), ¬ dups(orl + orl0), ¬ dups(orl0), ¬ phead1 ∈ vhead1 ' + orl1 from lst, ¬ lst ∈ orl from first, ¬ (orl1 + rl).last ∈ orl0, ¬ lst ∈ orl, ¬ (orl1 + rl).last ∈ orl, ¬ phead1 ∈ orl0, ¬ phead1 ∈ orl, ¬ vhead1 ∈ orl1, ¬ vhead1 ∈ orl, ¬ phead1 ∈ rl, 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), vtail = (vhead1 ' + orl1).last ∨ vtail = (orl + (vhead1 ' + orl1).butlast).last ∧ vs[(vhead1 ' + orl1).last].deqID = None ∧ vs[(vhead1 ' + orl1).last].next = null, orl.last = vhead ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead1].deqID = None ∧ unmarkedp(orl1, vs), lst = vhead1 ∨ lst ∈ orl1, phead1 = vhead0 ∨ orl + orl0 ≠ [] ∧ (orl + orl0).last = vhead0 ∧ phead0 ≠ phead1, phead0 ∈ orl ∨ phead0 ∈ orl0 ∨ phead0 = phead1, phead0 ∈ orl from phead ∨ phead0 ∈ orl0 ∨ phead0 = phead1 ∨ phead0 = (orl1 + rl).last, vhead1 = phead1 ∨ vhead1 ∈ orl0, (orl1 + rl).last ∈ orl1 ∨ (orl1 + rl).last ∈ rl, vhead1 ∈ orl0 ∨ vhead1 = phead1 ⊦

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] → [orl1, rl], <all paths>

Additional information

Used terms: orl1, rl

Proof step 64 from proof stable-D18 (previous step) (back to tree)

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

A spec-lemma

Proof step 65 from proof stable-D18 (previous step) (back to tree)

(vhead1 ' + orl1) + rl = (orl0 + phead1 ') + (orl1 + rl).last ', vs0[(orl1 + rl).last].deqID = None, ps0[(orl1 + rl).last].deqID = None, ps[vhead1].deqID = None, vs0[(orl1 + rl).last].next = null, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rl = [], rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl1 + rl ≠ [], (orl1 + rl).last ≠ phead1, ps[first].next ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, vhead1 ≠ (orl1 + rl).last, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + vhead1 ' + orl1, vs, ps, vs0, ps0), listp(orl + vhead1 ' + orl1, vs, ps, owns), listp(orl + (vhead1 ' + orl1) + rl, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl, ps0), markedp(orl0, vs0), markedp(orl, vs0), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + vhead1 ' + orl1, first, vs), noidRely(tid, orl + vhead1 ' + orl1, vs, orl + (vhead1 ' + orl1) + rl, vs0), nonullRetRefs(orl + vhead1 ' + orl1, vs, vretRefs, pretRefs), nonullRetRefs(orl + (vhead1 ' + orl1) + 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[phead1].deqID), some?(vs0[phead1].deqID), unmarkedp(orl1, ps), vtail ∈ vhead1 ' + orl1 from lst, pretRefs0(tid) ∈ vrvHp, phead1 ∈ orl + (vhead1 ' + orl1) + rl from vtail, vhead0 ∈ orl + (vhead1 ' + orl1) + rl from vhead, 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, lst ∈ vs, lst ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(orl1), ¬ dups(orl), ¬ dups(rl), ¬ dups(orl + orl1), ¬ dups(orl + orl0), ¬ dups(orl0), ¬ phead1 ∈ vhead1 ' + orl1 from lst, ¬ lst ∈ orl from first, ¬ (orl1 + rl).last ∈ orl0, ¬ lst ∈ orl, ¬ (orl1 + rl).last ∈ orl, ¬ phead1 ∈ orl0, ¬ phead1 ∈ orl, ¬ vhead1 ∈ orl1, ¬ vhead1 ∈ orl, ¬ phead1 ∈ 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), vhead1 ∈ orl0 ∨ vhead1 = phead1, (orl1 + rl).last ∈ orl1 ∨ (orl1 + rl).last ∈ rl, vhead1 = phead1 ∨ vhead1 ∈ orl0, phead0 ∈ orl from phead ∨ phead0 ∈ orl0 ∨ phead0 = phead1 ∨ phead0 = (orl1 + rl).last, phead0 ∈ orl ∨ phead0 ∈ orl0 ∨ phead0 = phead1, phead1 = vhead0 ∨ orl + orl0 ≠ [] ∧ (orl + orl0).last = vhead0 ∧ phead0 ≠ phead1, lst = vhead1 ∨ lst ∈ orl1, orl.last = vhead ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead1].deqID = None ∧ unmarkedp(orl1, vs), vtail = (vhead1 ' + orl1).last ∨ vtail = (orl + (vhead1 ' + orl1).butlast).last ∧ vs[(vhead1 ' + orl1).last].deqID = None ∧ vs[(vhead1 ' + orl1).last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] 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 ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ ¬ a ∈ z ∧ a ≠ c → c ' + z ≠ y1 + a ' + x; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ b ' ↔ a = b; (s) rl ≠ [] ⊦ ¬ dups(rl) → rl from rl.last = rl.last '; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] inapp-10: ⊦ a ' + x = y + b ' ∧ a ≠ b → a ∈ y ∧ b ∈ x; (forward) from specification list[reflist] ⊦ x + [] = x; (s) ⊦ x ≠ [] → (a ' + x).last = x.last; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ x ≠ [] → (a ' + x).butlast = a ' + x.butlast; (s) ⊦ ¬ a ∈ []; (s) ⊦ ¬ dups([]); (s)

Proof step 66 from proof stable-D18 (previous step) (back to tree)

vhead1 ' + orl1 = orl0 + phead1 ' + orl1.last ', vs[orl1.last].deqID = None, ps[vhead1].deqID = None, ps0[orl1.last].deqID = None, vs0[orl1.last].deqID = None, vs[orl1.last].next = null, vs0[orl1.last].next = null, 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), (vhead1 ' + orl1.butlast).last ≠ orl1.last, orl1.last ≠ phead1, ps[first].next ≠ null, first ≠ lst, lst ≠ vhead1, orl ≠ [], orl1 ≠ [], pretRefs0(tid) ≠ null, vhead1 ≠ orl1.last, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + vhead1 ' + orl1, vs, ps, vs0, ps0), listp(orl + vhead1 ' + orl1, vs0, ps0, owns0), listp(orl + vhead1 ' + orl1, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), markedp(orl, vs0), markedp(orl0, vs0), markedp(orl, ps0), markedp(orl0, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + vhead1 ' + orl1, first, vs), noidRely(tid, orl + vhead1 ' + orl1, vs, orl + vhead1 ' + orl1, vs0), nonullRetRefs(orl + vhead1 ' + orl1, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + vhead1 ' + orl1, 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[phead1].deqID), some?(ps0[phead1].deqID), unmarkedp(orl1, ps), lst ∈ ps0, lst ∈ vs0, (vhead1 ' + orl1.butlast).last ∈ orl1 from lst, lst ∈ orl1, lst ∈ ps, lst ∈ vs, 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, vhead0 ∈ orl + vhead1 ' + orl1 from vhead, phead1 ∈ orl + vhead1 ' + orl1 from (vhead1 ' + orl1.butlast).last, pretRefs0(tid) ∈ vrvHp, dom prvHp ⊆ dom prvHp0, ¬ dups(orl1), ¬ dups(orl), ¬ dups(orl + orl1), ¬ dups(orl + orl0), ¬ dups(orl0), ¬ phead1 ∈ orl1 from lst, ¬ lst ∈ orl from first, ¬ orl1.last ∈ orl0, ¬ lst ∈ orl, ¬ orl1.last ∈ orl, ¬ phead1 ∈ orl0, ¬ phead1 ∈ orl, ¬ vhead1 ∈ orl1, ¬ vhead1 ∈ orl, 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), phead1 = vhead0 ∨ orl + orl0 ≠ [] ∧ (orl + orl0).last = vhead0 ∧ phead0 ≠ phead1, phead0 ∈ orl ∨ phead0 ∈ orl0 ∨ phead0 = phead1, vhead1 = phead1 ∨ vhead1 ∈ orl0, phead0 ∈ orl from phead ∨ phead0 ∈ orl0 ∨ phead0 = phead1 ∨ phead0 = orl1.last, vhead1 ∈ orl0 ∨ vhead1 = phead1, orl.last = vhead ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead1].deqID = None ∧ unmarkedp(orl1, vs) ⊦

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] → [orl1, lst0, orl2]

Additional information

Used simplifier rules: ⊦ # y = # y0 → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) ⊦ x + a ' ≠ []; (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ' + x = x0 + x1 → (a ∈ x0 ↔ x0 ≠ []); (ss) ni: ⊦ x + a ' = y + z ∧ ¬ a ∈ z → z = []; (forward) from specification list[reflist] in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ ¬ a ∈ x → (a ∈ b ' + x ↔ a = b); (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ (x + a ').last = a; (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: orl1, lst0, y

Proof step 67 from proof stable-D18 (previous step) (back to tree)

(vhead1 ' + orl1) + rl = (orl0 + phead1 ') + rl.last ', vs0[rl.last].deqID = None, ps0[rl.last].deqID = None, ps[vhead1].deqID = None, vs0[rl.last].next = null, 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), orl1 + rl ≠ [], rl.last ≠ phead1, ps[first].next ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, rl ≠ [], vhead1 ≠ rl.last, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + vhead1 ' + orl1, vs, ps, vs0, ps0), listp(orl + vhead1 ' + orl1, vs, ps, owns), listp(orl + (vhead1 ' + orl1) + rl, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl, ps0), markedp(orl0, vs0), markedp(orl, vs0), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + vhead1 ' + orl1, first, vs), noidRely(tid, orl + vhead1 ' + orl1, vs, orl + (vhead1 ' + orl1) + rl, vs0), nonullRetRefs(orl + vhead1 ' + orl1, vs, vretRefs, pretRefs), nonullRetRefs(orl + (vhead1 ' + orl1) + 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[phead1].deqID), some?(vs0[phead1].deqID), unmarkedp(orl1, ps), vtail ∈ vhead1 ' + orl1 from lst, pretRefs0(tid) ∈ vrvHp, phead1 ∈ orl + (vhead1 ' + orl1) + rl from vtail, vhead0 ∈ orl + (vhead1 ' + orl1) + rl from vhead, 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, lst ∈ vs, lst ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(orl1), ¬ dups(orl), ¬ dups(rl), ¬ dups(orl + orl1), ¬ dups(orl + orl0), ¬ dups(orl0), ¬ phead1 ∈ vhead1 ' + orl1 from lst, ¬ lst ∈ orl from first, ¬ rl.last ∈ orl0, ¬ lst ∈ orl, ¬ rl.last ∈ orl, ¬ phead1 ∈ orl0, ¬ phead1 ∈ orl, ¬ vhead1 ∈ orl1, ¬ vhead1 ∈ orl, ¬ phead1 ∈ 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), vhead1 ∈ orl0 ∨ vhead1 = phead1, rl.last ∈ orl1 ∨ rl.last ∈ rl, vhead1 = phead1 ∨ vhead1 ∈ orl0, phead0 ∈ orl from phead ∨ phead0 ∈ orl0 ∨ phead0 = phead1 ∨ phead0 = rl.last, phead0 ∈ orl ∨ phead0 ∈ orl0 ∨ phead0 = phead1, phead1 = vhead0 ∨ orl + orl0 ≠ [] ∧ (orl + orl0).last = vhead0 ∧ phead0 ≠ phead1, lst = vhead1 ∨ lst ∈ orl1, orl.last = vhead ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead1].deqID = None ∧ unmarkedp(orl1, vs), vtail = (vhead1 ' + orl1).last ∨ vtail = (orl + (vhead1 ' + orl1).butlast).last ∧ vs[(vhead1 ' + orl1).last].deqID = None ∧ vs[(vhead1 ' + orl1).last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] inapp-10: ⊦ a ' + x = y + b ' ∧ a ≠ b → a ∈ y ∧ b ∈ x; (forward) from specification list[reflist] lapp-04: ⊦ a ' + x = y + b ' ∧ a ≠ b → x.last = b; (forward) from specification list-last[reflist]

Proof step 68 from proof stable-D18 (previous step) (back to tree)

(vhead1 ' + orl1) + rl = (orl0 + phead1 ') + rl.last ', vs0[rl.last].deqID = None, ps0[rl.last].deqID = None, ps[vhead1].deqID = None, vs0[rl.last].next = null, 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), orl1 + rl ≠ [], rl.last ≠ phead1, ps[first].next ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, rl ≠ [], vhead1 ≠ rl.last, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + vhead1 ' + orl1, vs, ps, vs0, ps0), listp(orl + vhead1 ' + orl1, vs, ps, owns), listp(orl + (orl0 + phead1 ') + rl.last ', vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl, ps0), markedp(orl0, vs0), markedp(orl, vs0), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + vhead1 ' + orl1, first, vs), noidRely(tid, orl + vhead1 ' + orl1, vs, orl + (orl0 + phead1 ') + rl.last ', vs0), nonullRetRefs(orl + vhead1 ' + orl1, vs, vretRefs, pretRefs), nonullRetRefs(orl + (orl0 + phead1 ') + rl.last ', 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[phead1].deqID), some?(vs0[phead1].deqID), unmarkedp(orl1, ps), vtail ∈ vhead1 ' + orl1 from lst, pretRefs0(tid) ∈ vrvHp, phead1 ∈ orl + (orl0 + phead1 ') + rl.last ' from vtail, vhead0 ∈ orl + (orl0 + phead1 ') + rl.last ' from vhead, 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, lst ∈ vs, lst ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(orl0), ¬ dups(orl + orl0), ¬ dups(orl + orl1), ¬ dups(rl), ¬ dups(orl), ¬ dups(orl1), ¬ phead1 ∈ rl, ¬ vhead1 ∈ orl, ¬ vhead1 ∈ orl1, ¬ phead1 ∈ orl, ¬ phead1 ∈ orl0, ¬ rl.last ∈ orl, ¬ lst ∈ orl, ¬ rl.last ∈ orl0, ¬ lst ∈ orl from first, ¬ phead1 ∈ vhead1 ' + orl1 from lst, 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), vhead1 = phead1 ∨ vhead1 ∈ orl0, phead0 ∈ orl from phead ∨ phead0 ∈ orl0 ∨ phead0 = phead1 ∨ phead0 = rl.last, phead0 ∈ orl ∨ phead0 ∈ orl0 ∨ phead0 = phead1, phead1 = vhead0 ∨ orl + orl0 ≠ [] ∧ (orl + orl0).last = vhead0 ∧ phead0 ≠ phead1, lst = vhead1 ∨ lst ∈ orl1, orl.last = vhead ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead1].deqID = None ∧ unmarkedp(orl1, vs), vtail = (vhead1 ' + orl1).last ∨ vtail = (orl + (vhead1 ' + orl1).butlast).last ∧ vs[(vhead1 ' + orl1).last].deqID = None ∧ vs[(vhead1 ' + orl1).last].next = null, vhead1 ∈ orl0 ∨ vhead1 = phead1 ⊦

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] → [rl, vtail0, rl0]

Additional information

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

Proof step 69 from proof stable-D18 (previous step) (back to tree)

(vhead1 ' + orl1) + rl = (orl0 + phead1 ') + vtail0 ', ps[vhead1].deqID = None, ps0[vtail0].deqID = None, vs0[vtail0].deqID = None, vs0[vtail0].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, pretRefs(tid) = pretRefs0(tid), rl = rl0 + vtail0 ', rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl1 + rl ≠ [], ps[first].next ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, rl ≠ [], vhead1 ≠ vtail0, vtail0 ≠ phead1, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + vhead1 ' + orl1, vs, ps, vs0, ps0), listp(orl + (orl0 + phead1 ') + vtail0 ', vs0, ps0, owns0), listp(orl + vhead1 ' + orl1, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), markedp(orl, vs0), markedp(orl0, vs0), markedp(orl, ps0), markedp(orl0, ps0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + vhead1 ' + orl1, first, vs), noidRely(tid, orl + vhead1 ' + orl1, vs, orl + (orl0 + phead1 ') + vtail0 ', vs0), nonullRetRefs(orl + (orl0 + phead1 ') + vtail0 ', vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + vhead1 ' + orl1, 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[phead1].deqID), some?(ps0[phead1].deqID), unmarkedp(orl1, ps), lst ∈ ps, lst ∈ vs, 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, vhead0 ∈ orl + (orl0 + phead1 ') + vtail0 ' from vhead, phead1 ∈ orl + (orl0 + phead1 ') + vtail0 ' from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ vhead1 ' + orl1 from lst, dom prvHp ⊆ dom prvHp0, ¬ dups(orl0), ¬ dups(orl + orl0), ¬ dups(orl + orl1), ¬ dups(rl), ¬ dups(orl), ¬ dups(orl1), ¬ phead1 ∈ rl, ¬ vhead1 ∈ orl, ¬ vhead1 ∈ orl1, ¬ phead1 ∈ orl, ¬ phead1 ∈ orl0, ¬ vtail0 ∈ orl, ¬ lst ∈ orl, ¬ vtail0 ∈ orl0, ¬ lst ∈ orl from first, ¬ phead1 ∈ vhead1 ' + orl1 from lst, 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), vhead1 ∈ orl0 ∨ vhead1 = phead1, vtail = (vhead1 ' + orl1).last ∨ vtail = (orl + (vhead1 ' + orl1).butlast).last ∧ vs[(vhead1 ' + orl1).last].deqID = None ∧ vs[(vhead1 ' + orl1).last].next = null, orl.last = vhead ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead1].deqID = None ∧ unmarkedp(orl1, vs), lst = vhead1 ∨ lst ∈ orl1, phead1 = vhead0 ∨ orl + orl0 ≠ [] ∧ (orl + orl0).last = vhead0 ∧ phead0 ≠ phead1, phead0 ∈ orl ∨ phead0 ∈ orl0 ∨ phead0 = phead1, phead0 ∈ orl from phead ∨ phead0 ∈ orl0 ∨ phead0 = phead1 ∨ phead0 = vtail0, vhead1 = phead1 ∨ vhead1 ∈ 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] ⊦ (x + a ').butlast = x; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ a ∈ x → (b ' + x).last = x.last; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ ¬ a ∈ []; (s) ⊦ ¬ dups([]); (s) ⊦ x + [] = x; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] ni: ⊦ x + a ' = y + z ∧ ¬ a ∈ z → z = []; (forward) from specification list[reflist] ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ x + a ' ≠ []; (s) ⊦ # y = # y0 → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws)

Proof step 70 from proof stable-D18 (previous step) (back to tree)

vhead1 ' + orl1 = orl0 + phead1 ', vs0[vtail0].deqID = None, ps0[vtail0].deqID = None, ps[vhead1].deqID = None, vs0[vtail0].next = null, 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), ps[first].next ≠ null, first ≠ lst, lst ≠ vhead1, orl ≠ [], pretRefs0(tid) ≠ null, vhead1 ≠ vtail0, vtail0 ≠ phead1, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + orl0 + phead1 ', vs, ps, vs0, ps0), listp(orl + orl0 + phead1 ', vs, ps, owns), listp(orl + (orl0 + phead1 ') + vtail0 ', vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl, ps0), markedp(orl0, vs0), markedp(orl, vs0), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + orl0 + phead1 ', first, vs), noidRely(tid, orl + orl0 + phead1 ', vs, orl + (orl0 + phead1 ') + vtail0 ', vs0), nonullRetRefs(orl + orl0 + phead1 ', vs, vretRefs, pretRefs), nonullRetRefs(orl + (orl0 + phead1 ') + vtail0 ', 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[phead1].deqID), some?(vs0[phead1].deqID), unmarkedp(orl1, ps), vtail ∈ orl1 from lst, pretRefs0(tid) ∈ vrvHp, phead1 ∈ orl + (orl0 + phead1 ') + vtail0 ' from vtail, vhead0 ∈ orl + (orl0 + phead1 ') + vtail0 ' from vhead, 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, lst ∈ vs, lst ∈ ps, lst ∈ orl1, dom prvHp ⊆ dom prvHp0, ¬ dups(orl0), ¬ dups(orl + orl0), ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ phead1 ∈ orl1 from lst, ¬ vhead1 ∈ orl, ¬ vhead1 ∈ orl1, ¬ phead1 ∈ orl, ¬ phead1 ∈ orl0, ¬ vtail0 ∈ orl, ¬ lst ∈ orl, ¬ vtail0 ∈ orl0, ¬ lst ∈ orl from first, 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), orl.last = vhead ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead1].deqID = None ∧ unmarkedp(orl1, vs), phead1 = vhead1 ∨ phead1 ∈ orl1, vhead1 ∈ orl0 ∨ vhead1 = phead1, vhead1 = phead1 ∨ vhead1 ∈ orl0, phead0 ∈ orl from phead ∨ phead0 ∈ orl0 ∨ phead0 = phead1 ∨ phead0 = vtail0, phead0 ∈ orl ∨ phead0 ∈ orl0 ∨ phead0 = phead1, phead1 = vhead0 ∨ orl + orl0 ≠ [] ∧ (orl + orl0).last = vhead0 ∧ phead0 ≠ phead1, vtail = orl1.last ∨ vtail = (orl + orl0).last ∧ vs[orl1.last].deqID = None ∧ vs[orl1.last].next = null ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:splitlasteq, seq:y ≠ [] ⊦ x + a ' = y ↔ x = y.butlast ∧ a = y.last, subst:[y, x, a] → [vhead1 ' + orl1, orl0, phead1], <all paths>

Additional information

Used simplifier rules: ⊦ a ' + x ≠ []; (s) ⊦ a ∈ x → (b ' + x).last = x.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ rl.last ∈ rl from r ↔ r ∈ rl; (s) ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ a ' ≠ []; (s) Used terms: vhead1 ' + orl1, orl0, phead1

Proof step 71 from proof stable-D18 (previous step) (back to tree)

y ≠ [] ⊦ x + a ' = y ↔ x = y.butlast ∧ a = y.last

A spec-lemma

Proof step 72 from proof stable-D18 (previous step) (back to tree)

qrl + rl = rl0 + vtail0 ' + orl0, ps0[vtail0].deqID = None, vs0[(vtail0 ' + orl0).last].deqID = None, vs0[(vtail0 ' + orl0).last].next = null, 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 ≠ [], ps[first].next ≠ null, first ≠ lst, orl ≠ [], orl0 ≠ [], 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 + qrl + rl, 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 + qrl + rl, vs0), nonullRetRefs(orl + qrl + rl, 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(orl0, ps0), unmarkedp(qrl, ps), vhead0 ∈ orl + qrl + rl from vhead, (orl + rl0 + vtail0 ' + orl0.butlast).last ∈ orl + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ orl + qrl from lst, 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) + orl0), ¬ dups(orl + qrl), ¬ dups(qrl), ¬ dups(rl), ¬ dups(rl0), ¬ dups(orl0), ¬ dups(orl), ¬ dups(rl0 + orl0), ¬ dups(orl + rl0), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl0, ¬ (orl + rl0 + vtail0 ' + orl0.butlast).last ∈ orl + qrl + rl from lst, 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 ∧ unmarkedp(orl0, vs0) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(orl0, vs0), phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ orl0, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), lst ∈ orl from first ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, 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 + a ' + y).last = (a ' + y).last; (s) ⊦ x ≠ [] → (a ' + x).last = x.last; (s)

Proof step 73 from proof stable-D18 (previous step) (back to tree)

qrl + rl = rl0 + vtail0 ' + orl0, ps0[vtail0].deqID = None, vs0[orl0.last].deqID = None, vs0[orl0.last].next = null, 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 ≠ [], ps[first].next ≠ null, first ≠ lst, orl ≠ [], orl0 ≠ [], 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 + qrl + rl, 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 + qrl + rl, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs(orl + 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), unmarkedp(qrl, ps), unmarkedp(orl0, ps0), vhead0 ∈ orl + qrl + rl from vhead, 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, vtail ∈ orl + qrl from lst, pretRefs0(tid) ∈ vrvHp, (vtail0 ' + orl0.butlast).last ∈ orl + qrl + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups((orl + rl0) + orl0), ¬ dups(orl + qrl), ¬ dups(qrl), ¬ dups(rl), ¬ dups(rl0), ¬ dups(orl0), ¬ dups(orl), ¬ dups(rl0 + orl0), ¬ dups(orl + rl0), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl0, ¬ (vtail0 ' + orl0.butlast).last ∈ orl + qrl + rl from lst, 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, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl from first ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ orl0, (orl + rl0).last = vhead0 ∧ unmarkedp(orl0, vs0) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(orl0, vs0) ⊦

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, phead1, orl1]

Additional information

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

Proof step 74 from proof stable-D18 (previous step) (back to tree)

qrl + rl = rl0 + vtail0 ' + orl0, vs0[phead1].deqID = None, ps0[vtail0].deqID = None, vs0[phead1].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, orl0 = orl1 + phead1 ', pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], ps[first].next ≠ null, first ≠ lst, orl ≠ [], orl0 ≠ [], 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 + qrl + rl, 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 + qrl + rl, vs0), nonullRetRefs(orl + qrl + rl, 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(orl0, ps0), unmarkedp(qrl, ps), (vtail0 ' + orl1).last ∈ orl + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ orl + qrl from lst, 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, vhead0 ∈ orl + qrl + rl from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups((orl + rl0) + orl0), ¬ dups(orl + qrl), ¬ dups(qrl), ¬ dups(rl), ¬ dups(rl0), ¬ dups(orl0), ¬ dups(orl), ¬ dups(rl0 + orl0), ¬ dups(orl + rl0), ¬ vtail0 ∈ orl, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl0, ¬ (vtail0 ' + orl1).last ∈ orl + qrl + rl from lst, 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 ∧ unmarkedp(orl0, vs0) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(orl0, vs0), phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ orl0, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), lst ∈ orl from first ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, 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 ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ x + a ' ≠ []; (s)

Proof step 75 from proof stable-D18 (previous step) (back to tree)

qrl + rl = rl0 + vtail0 ' + orl1 + phead1 ', ps0[phead1].deqID = None, vs0[phead1].deqID = None, ps0[vtail0].deqID = None, vs0[phead1].next = null, 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 ≠ [], ps[first].next ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, vtail0 ≠ phead1, 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 + qrl + rl, 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 + qrl + rl, vs0), nonullRetRefs(orl + qrl + rl, 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(orl1, ps0), unmarkedp(qrl, ps), (vtail0 ' + orl1).last ∈ orl + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ orl + qrl from lst, 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, vhead0 ∈ orl + qrl + rl from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + rl0), ¬ dups(rl0 + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ dups(rl0), ¬ dups(rl), ¬ dups(qrl), ¬ dups(orl + qrl), ¬ dups(orl + rl0 + orl1), ¬ vtail0 ∈ orl1, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl, ¬ phead1 ∈ orl1, ¬ phead1 ∈ rl0, ¬ phead1 ∈ orl, ¬ (vtail0 ' + orl1).last ∈ orl + qrl + rl from lst, 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 ∧ unmarkedp(orl1, vs0) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(orl1, vs0), phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ orl1 ∨ phead0 = phead1, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), lst ∈ orl from first ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ orl ∨ phead0 ∈ rl0, phead1 ∈ qrl ∨ phead1 ∈ rl ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:splitlasteq, seq:y ≠ [] ⊦ x + a ' = y ↔ x = y.butlast ∧ a = y.last, subst:[y, x, a] → [qrl + rl, rl0 + vtail0 ' + orl1, phead1], <all paths>

Additional information

Used simplifier rules: ⊦ [] + x = x; (s) ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ a ' + x ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: qrl + rl, rl0 + vtail0 ' + orl1, phead1

Proof step 76 from proof stable-D18 (previous step) (back to tree)

y ≠ [] ⊦ x + a ' = y ↔ x = y.butlast ∧ a = y.last

A spec-lemma

Proof step 77 from proof stable-D18 (previous step) (back to tree)

rl0 + vtail0 ' + orl1 = (qrl + rl).butlast, ps0[vtail0].deqID = None, vs0[phead1].deqID = None, ps0[phead1].deqID = None, vs0[phead1].next = null, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, phead1 = (qrl + rl).last, pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), qrl + rl ≠ [], orl + rl0 ≠ [], ps[first].next ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, vtail0 ≠ phead1, 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 + qrl + rl, 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 + qrl + rl, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs(orl + 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), unmarkedp(qrl, ps), unmarkedp(orl1, ps0), vhead0 ∈ orl + qrl + rl from vhead, 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, vtail ∈ orl + qrl from lst, pretRefs0(tid) ∈ vrvHp, (vtail0 ' + orl1).last ∈ orl + qrl + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + rl0), ¬ dups(rl0 + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ dups(rl0), ¬ dups(rl), ¬ dups(qrl), ¬ dups(orl + qrl), ¬ dups(orl + rl0 + orl1), ¬ vtail0 ∈ orl1, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl, ¬ phead1 ∈ orl1, ¬ phead1 ∈ rl0, ¬ phead1 ∈ orl, ¬ (vtail0 ' + orl1).last ∈ orl + qrl + rl from lst, 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), phead1 ∈ qrl ∨ phead1 ∈ rl, phead0 ∈ orl ∨ phead0 ∈ rl0, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl from first ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ orl1 ∨ phead0 = phead1, (orl + rl0).last = vhead0 ∧ unmarkedp(orl1, vs0) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(orl1, vs0) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 78 from proof stable-D18 (previous step) (back to tree)

rl0 + vtail0 ' + orl1 = (qrl + rl).butlast, ps0[(qrl + rl).last].deqID = None, vs0[(qrl + rl).last].deqID = None, ps0[vtail0].deqID = None, vs0[(qrl + rl).last].next = null, 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), qrl + rl ≠ [], orl + rl0 ≠ [], ps[first].next ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, vtail0 ≠ (qrl + rl).last, 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 + qrl + rl, 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 + qrl + rl, vs0), nonullRetRefs(orl + qrl + rl, 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(orl1, ps0), unmarkedp(qrl, ps), (vtail0 ' + orl1).last ∈ orl + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ orl + qrl from lst, 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, vhead0 ∈ orl + qrl + rl from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + rl0), ¬ dups(rl0 + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ dups(rl0), ¬ dups(rl), ¬ dups(qrl), ¬ dups(orl + qrl), ¬ dups(orl + rl0 + orl1), ¬ vtail0 ∈ orl1, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl, ¬ (qrl + rl).last ∈ orl1, ¬ (qrl + rl).last ∈ rl0, ¬ (qrl + rl).last ∈ orl, ¬ (vtail0 ' + orl1).last ∈ orl + qrl + rl from lst, 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 ∧ unmarkedp(orl1, vs0) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(orl1, vs0), phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ orl1 ∨ phead0 = (qrl + rl).last, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), lst ∈ orl from first ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ orl ∨ phead0 ∈ rl0, (qrl + rl).last ∈ qrl ∨ (qrl + rl).last ∈ rl ⊦

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] → [qrl, rl], <all paths>

Additional information

Used terms: qrl, rl

Proof step 79 from proof stable-D18 (previous step) (back to tree)

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

A spec-lemma

Proof step 80 from proof stable-D18 (previous step) (back to tree)

rl0 + vtail0 ' + orl1 = (qrl + rl).butlast, ps0[vtail0].deqID = None, vs0[(qrl + rl).last].deqID = None, ps0[(qrl + rl).last].deqID = None, vs0[(qrl + rl).last].next = null, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rl = [], rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), qrl + rl ≠ [], orl + rl0 ≠ [], ps[first].next ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, vtail0 ≠ (qrl + rl).last, 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 + qrl + rl, 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 + qrl + rl, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs(orl + 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), unmarkedp(qrl, ps), unmarkedp(orl1, ps0), vhead0 ∈ orl + qrl + rl from vhead, 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, vtail ∈ orl + qrl from lst, pretRefs0(tid) ∈ vrvHp, (vtail0 ' + orl1).last ∈ orl + qrl + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + rl0), ¬ dups(rl0 + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ dups(rl0), ¬ dups(rl), ¬ dups(qrl), ¬ dups(orl + qrl), ¬ dups(orl + rl0 + orl1), ¬ vtail0 ∈ orl1, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl, ¬ (qrl + rl).last ∈ orl1, ¬ (qrl + rl).last ∈ rl0, ¬ (qrl + rl).last ∈ orl, ¬ (vtail0 ' + orl1).last ∈ orl + qrl + rl from lst, 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), (qrl + rl).last ∈ qrl ∨ (qrl + rl).last ∈ rl, phead0 ∈ orl ∨ phead0 ∈ rl0, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl from first ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ orl1 ∨ phead0 = (qrl + rl).last, (orl + rl0).last = vhead0 ∧ unmarkedp(orl1, vs0) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(orl1, vs0) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ x.last ∈ x ↔ x ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x + [] = x; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ ¬ dups([]); (s)

Proof step 81 from proof stable-D18 (previous step) (back to tree)

rl0 + vtail0 ' + orl1 = qrl.butlast, ps0[qrl.last].deqID = None, vs0[qrl.last].deqID = None, ps0[vtail0].deqID = None, vs0[qrl.last].next = null, 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 ≠ [], ps[first].next ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, qrl ≠ [], vtail0 ≠ qrl.last, 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 + qrl, vs, ps, owns), listp(orl + qrl, vs0, ps0, owns0), 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 + qrl, vs0), nonullRetRefs(orl + qrl, 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(orl1, ps0), unmarkedp(qrl, ps), (vtail0 ' + orl1).last ∈ orl + qrl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ orl + qrl from lst, 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, vhead0 ∈ orl + qrl from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + rl0), ¬ dups(rl0 + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ dups(rl0), ¬ dups(qrl), ¬ dups(orl + qrl), ¬ dups(orl + rl0 + orl1), ¬ vtail0 ∈ orl1, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl, ¬ qrl.last ∈ orl1, ¬ qrl.last ∈ rl0, ¬ qrl.last ∈ orl, ¬ (vtail0 ' + orl1).last ∈ orl + qrl from lst, 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 ∧ unmarkedp(orl1, vs0) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(orl1, vs0), lst ∈ orl from first ∨ lst ∈ qrl, phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ orl1 ∨ phead0 = qrl.last, orl.last = vhead ∧ unmarkedp(qrl.tail, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = qrl.last ∨ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

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

Additional information

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

Proof step 82 from proof stable-D18 (previous step) (back to tree)

rl0 + vtail0 ' + orl1 = qrl.butlast, ps0[vtail0].deqID = None, vs0[qrl.last].deqID = None, ps0[qrl.last].deqID = None, vs0[qrl.last].next = null, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), qrl = phead1 + qrl0, rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], ps[first].next ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, qrl ≠ [], vtail0 ≠ qrl.last, 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, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), 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 + qrl, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs(orl + qrl, 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(orl1, ps0), vhead0 ∈ orl + qrl from vhead, 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, vtail ∈ orl + qrl from lst, pretRefs0(tid) ∈ vrvHp, (vtail0 ' + orl1).last ∈ orl + qrl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + rl0), ¬ dups(rl0 + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ dups(rl0), ¬ dups(qrl), ¬ dups(orl + qrl), ¬ dups(orl + rl0 + orl1), ¬ vtail0 ∈ orl1, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl, ¬ qrl.last ∈ orl1, ¬ qrl.last ∈ rl0, ¬ qrl.last ∈ orl, ¬ (vtail0 ' + orl1).last ∈ orl + qrl from lst, 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), vtail = qrl.last ∨ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ orl1 ∨ phead0 = qrl.last, phead0 ∈ orl ∨ phead0 ∈ rl0, lst ∈ orl from first ∨ lst ∈ qrl, (orl + rl0).last = vhead0 ∧ unmarkedp(orl1, vs0) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(orl1, 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] ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a + x = a ' + x; (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ 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) ⊦ a ' + x ≠ []; (s)

Proof step 83 from proof stable-D18 (previous step) (back to tree)

rl0 + vtail0 ' + orl1 = (phead1 ' + qrl0).butlast, ps0[(phead1 ' + qrl0).last].deqID = None, vs0[(phead1 ' + qrl0).last].deqID = None, ps0[vtail0].deqID = None, ps[phead1].deqID = None, vs0[(phead1 ' + qrl0).last].next = null, 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 ≠ [], ps[first].next ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, vtail0 ≠ (phead1 ' + qrl0).last, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + phead1 ' + qrl0, vs, ps, vs0, ps0), listp(orl + phead1 ' + qrl0, vs, ps, owns), listp(orl + phead1 ' + qrl0, vs0, ps0, owns0), 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 + phead1 ' + qrl0, first, vs), noidRely(tid, orl + phead1 ' + qrl0, vs, orl + phead1 ' + qrl0, vs0), nonullRetRefs(orl + phead1 ' + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + phead1 ' + qrl0, 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(orl1, ps0), unmarkedp(qrl0, ps), pretRefs0(tid) ∈ vrvHp, (phead1 ' + qrl0).last ∈ orl + phead1 ' + qrl0 from lst, 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, vhead0 ∈ orl + phead1 ' + qrl0 from vhead, (vtail0 ' + orl1).last ∈ phead1 ' + qrl0 from (phead1 ' + qrl0).last, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + rl0), ¬ dups(rl0 + orl1), ¬ dups(orl1), ¬ dups(rl0), ¬ dups(orl + qrl0), ¬ dups(orl + rl0 + orl1), ¬ dups(orl), ¬ dups(qrl0), ¬ phead1 ∈ qrl0, ¬ phead1 ∈ orl, ¬ vtail0 ∈ orl1, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl, ¬ (phead1 ' + qrl0).last ∈ orl1, ¬ (phead1 ' + qrl0).last ∈ rl0, ¬ (phead1 ' + qrl0).last ∈ orl, ¬ (vtail0 ' + orl1).last ∈ orl + phead1 ' + qrl0 from lst, 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 ∧ unmarkedp(orl1, vs0) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(orl1, vs0), phead0 ∈ orl ∨ phead0 ∈ rl0, lst ∈ orl from first ∨ lst = phead1 ∨ lst ∈ qrl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ orl1 ∨ phead0 = (phead1 ' + qrl0).last, orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead1].deqID = None ∧ unmarkedp(qrl0, 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] → [phead1 ', qrl0], <all paths>

Additional information

Used simplifier rules: ⊦ a '.last = a; (s) ⊦ x + [] = x; (s) ⊦ a '.butlast = []; (s) ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ a ' + x ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: phead1 ', qrl0

Proof step 84 from proof stable-D18 (previous step) (back to tree)

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

A spec-lemma

Proof step 85 from proof stable-D18 (previous step) (back to tree)

rl0 + vtail0 ' + orl1 = phead1 ' + qrl0.butlast, ps[phead1].deqID = None, ps0[vtail0].deqID = None, vs0[(phead1 ' + qrl0).last].deqID = None, ps0[(phead1 ' + qrl0).last].deqID = None, vs0[(phead1 ' + qrl0).last].next = null, 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 ≠ [], ps[first].next ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, qrl0 ≠ [], vtail0 ≠ (phead1 ' + qrl0).last, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + phead1 ' + qrl0, vs, ps, vs0, ps0), listp(orl + phead1 ' + qrl0, vs0, ps0, owns0), listp(orl + phead1 ' + qrl0, vs, ps, owns), 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 + phead1 ' + qrl0, first, vs), noidRely(tid, orl + phead1 ' + qrl0, vs, orl + phead1 ' + qrl0, vs0), nonullRetRefs(orl + phead1 ' + qrl0, vs, vretRefs, pretRefs), nonullRetRefs(orl + phead1 ' + 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, ps), unmarkedp(orl1, ps0), (vtail0 ' + orl1).last ∈ phead1 ' + qrl0 from (phead1 ' + qrl0).last, vhead0 ∈ orl + phead1 ' + qrl0 from vhead, 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, (phead1 ' + qrl0).last ∈ orl + phead1 ' + qrl0 from lst, pretRefs0(tid) ∈ vrvHp, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + rl0), ¬ dups(rl0 + orl1), ¬ dups(orl1), ¬ dups(rl0), ¬ dups(orl + qrl0), ¬ dups(orl + rl0 + orl1), ¬ dups(orl), ¬ dups(qrl0), ¬ phead1 ∈ qrl0, ¬ phead1 ∈ orl, ¬ vtail0 ∈ orl1, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl, ¬ (phead1 ' + qrl0).last ∈ orl1, ¬ (phead1 ' + qrl0).last ∈ rl0, ¬ (phead1 ' + qrl0).last ∈ orl, ¬ (vtail0 ' + orl1).last ∈ orl + phead1 ' + qrl0 from lst, 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), orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead1].deqID = None ∧ unmarkedp(qrl0, vs), phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ orl1 ∨ phead0 = (phead1 ' + qrl0).last, lst ∈ orl from first ∨ lst = phead1 ∨ lst ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0, (orl + rl0).last = vhead0 ∧ unmarkedp(orl1, vs0) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(orl1, 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] ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] ⊦ x ≠ [] → (a ' + x).last = x.last; (s)

Proof step 86 from proof stable-D18 (previous step) (back to tree)

rl0 + vtail0 ' + orl1 = phead1 ' + qrl0.butlast, vs0[qrl0.last].deqID = None, ps0[qrl0.last].deqID = None, ps[phead1].deqID = None, ps0[vtail0].deqID = None, vs0[qrl0.last].next = null, 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 ≠ [], ps[first].next ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, qrl0 ≠ [], vtail0 ≠ qrl0.last, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + phead1 ' + qrl0, vs, ps, vs0, ps0), listp(orl + phead1 ' + qrl0, vs0, ps0, owns0), listp(orl + phead1 ' + qrl0, vs, ps, owns), 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 + phead1 ' + qrl0, first, vs), noidRely(tid, orl + phead1 ' + qrl0, vs, orl + phead1 ' + qrl0, vs0), nonullRetRefs(orl + phead1 ' + qrl0, vs, vretRefs, pretRefs), nonullRetRefs(orl + phead1 ' + 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, ps), unmarkedp(orl1, ps0), (vtail0 ' + orl1).last ∈ phead1 ' + qrl0 from qrl0.last, vhead0 ∈ orl + phead1 ' + qrl0 from vhead, 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, qrl0.last ∈ orl + phead1 ' + qrl0 from lst, pretRefs0(tid) ∈ vrvHp, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl0), ¬ dups(orl), ¬ dups(orl + rl0 + orl1), ¬ dups(orl + qrl0), ¬ dups(rl0), ¬ dups(orl1), ¬ dups(rl0 + orl1), ¬ dups(orl + rl0), ¬ qrl0.last ∈ orl, ¬ qrl0.last ∈ rl0, ¬ qrl0.last ∈ orl1, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl1, ¬ phead1 ∈ orl, ¬ phead1 ∈ qrl0, ¬ (vtail0 ' + orl1).last ∈ orl + phead1 ' + qrl0 from lst, 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 from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ orl1 ∨ phead0 = qrl0.last, orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead1].deqID = None ∧ unmarkedp(qrl0, vs), lst ∈ orl from first ∨ lst = phead1 ∨ lst ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0, (orl + rl0).last = vhead0 ∧ unmarkedp(orl1, vs0) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(orl1, vs0), phead1 ∈ rl0 ∨ phead1 = vtail0 ∨ phead1 ∈ orl1 ⊦

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] → [qrl0, vhead1, qrl]

Additional information

Used simplifier rules: ⊦ x + a ' ≠ []; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s) x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: qrl0, vhead1, y

Proof step 87 from proof stable-D18 (previous step) (back to tree)

rl0 + vtail0 ' + orl1 = qrl + rl.butlast, ps0[vtail0].deqID = None, vs0[(qrl + rl).last].deqID = None, ps0[(qrl + rl).last].deqID = None, vs0[(qrl + rl).last].next = null, 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), qrl + rl ≠ [], orl + rl0 ≠ [], ps[first].next ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, rl ≠ [], vtail0 ≠ (qrl + rl).last, 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 + qrl + rl, 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 + qrl + rl, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs(orl + 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), unmarkedp(qrl, ps), unmarkedp(orl1, ps0), vhead0 ∈ orl + qrl + rl from vhead, 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, vtail ∈ orl + qrl from lst, pretRefs0(tid) ∈ vrvHp, (vtail0 ' + orl1).last ∈ orl + qrl + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + rl0), ¬ dups(rl0 + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ dups(rl0), ¬ dups(rl), ¬ dups(qrl), ¬ dups(orl + qrl), ¬ dups(orl + rl0 + orl1), ¬ vtail0 ∈ orl1, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl, ¬ (qrl + rl).last ∈ orl1, ¬ (qrl + rl).last ∈ rl0, ¬ (qrl + rl).last ∈ orl, ¬ (vtail0 ' + orl1).last ∈ orl + qrl + rl from lst, 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), (qrl + rl).last ∈ qrl ∨ (qrl + rl).last ∈ rl, phead0 ∈ orl ∨ phead0 ∈ rl0, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl from first ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ orl1 ∨ phead0 = (qrl + rl).last, (orl + rl0).last = vhead0 ∧ unmarkedp(orl1, vs0) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(orl1, vs0) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 88 from proof stable-D18 (previous step) (back to tree)

rl0 + vtail0 ' + orl1 = qrl + rl.butlast, ps0[vtail0].deqID = None, ps0[rl.last].deqID = None, vs0[rl.last].deqID = None, vs0[rl.last].next = null, 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), qrl + rl ≠ [], orl + rl0 ≠ [], ps[first].next ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, rl ≠ [], vtail0 ≠ rl.last, 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 + qrl + rl, 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 + qrl + rl, vs0), nonullRetRefs(orl + qrl + rl, 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(orl1, ps0), unmarkedp(qrl, ps), (vtail0 ' + orl1).last ∈ orl + qrl + rl from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ orl + qrl from lst, 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, vhead0 ∈ orl + qrl + rl from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + rl0), ¬ dups(rl0 + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ dups(rl0), ¬ dups(rl), ¬ dups(qrl), ¬ dups(orl + qrl), ¬ dups(orl + rl0 + orl1), ¬ (vtail0 ' + orl1).last ∈ orl + qrl + rl from lst, ¬ vtail0 ∈ orl1, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl, ¬ rl.last ∈ orl1, ¬ rl.last ∈ rl0, ¬ rl.last ∈ orl, 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 ∧ unmarkedp(orl1, vs0) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(orl1, vs0), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), lst ∈ orl from first ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ orl1 ∨ phead0 = rl.last ⊦

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] → [rl, phead1, qrl0]

Additional information

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

Proof step 89 from proof stable-D18 (previous step) (back to tree)

rl0 + vtail0 ' + orl1 = qrl + qrl0, vs0[phead1].deqID = None, ps0[phead1].deqID = None, ps0[vtail0].deqID = None, vs0[phead1].next = null, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, pretRefs(tid) = pretRefs0(tid), rl = qrl0 + phead1 ', rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), qrl + rl ≠ [], orl + rl0 ≠ [], ps[first].next ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, rl ≠ [], vtail0 ≠ phead1, 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 + qrl + rl, 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 + qrl + rl, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs(orl + 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), unmarkedp(qrl, ps), unmarkedp(orl1, ps0), vhead0 ∈ orl + qrl + rl from vhead, 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, vtail ∈ orl + qrl from lst, pretRefs0(tid) ∈ vrvHp, (vtail0 ' + orl1).last ∈ orl + qrl + rl from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + rl0), ¬ dups(rl0 + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ dups(rl0), ¬ dups(rl), ¬ dups(qrl), ¬ dups(orl + qrl), ¬ dups(orl + rl0 + orl1), ¬ (vtail0 ' + orl1).last ∈ orl + qrl + rl from lst, ¬ vtail0 ∈ orl1, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl, ¬ phead1 ∈ orl1, ¬ phead1 ∈ rl0, ¬ phead1 ∈ 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[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 from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ orl1 ∨ phead0 = phead1, phead0 ∈ orl ∨ phead0 ∈ rl0, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl from first ∨ 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 ∧ unmarkedp(orl1, vs0) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(orl1, 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] ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ x + a ' ≠ []; (s)

Proof step 90 from proof stable-D18 (previous step) (back to tree)

rl0 + vtail0 ' + orl1 = qrl + qrl0, ps0[vtail0].deqID = None, ps0[phead1].deqID = None, vs0[phead1].deqID = None, vs0[phead1].next = null, 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 ≠ [], ps[first].next ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, vtail0 ≠ phead1, 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 + qrl + qrl0 + phead1 ', 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 + qrl + qrl0 + phead1 ', vs0), nonullRetRefs(orl + qrl + qrl0 + phead1 ', 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(orl1, ps0), unmarkedp(qrl, ps), (vtail0 ' + orl1).last ∈ orl + qrl + qrl0 + phead1 ' from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ orl + qrl from lst, 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, vhead0 ∈ orl + qrl + qrl0 + phead1 ' from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl), ¬ dups(orl + qrl), ¬ dups(orl + rl0 + orl1), ¬ dups(orl + rl0), ¬ dups(rl0 + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ dups(rl0), ¬ dups(qrl0), ¬ (vtail0 ' + orl1).last ∈ orl + qrl + qrl0 + phead1 ' from lst, ¬ vtail0 ∈ orl1, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl, ¬ phead1 ∈ orl1, ¬ phead1 ∈ rl0, ¬ phead1 ∈ orl, ¬ phead1 ∈ 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), (orl + rl0).last = vhead0 ∧ unmarkedp(orl1, vs0) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(orl1, vs0), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), lst ∈ orl from first ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ orl1 ∨ phead0 = phead1 ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:lapp, seq: ⊦ y ≠ [] → (x + y).last = y.last, subst:[x, y] → [vtail0 ', orl1], <all paths>

Additional information

Used terms: vtail0 ', orl1

Proof step 91 from proof stable-D18 (previous step) (back to tree)

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

A spec-lemma

Proof step 92 from proof stable-D18 (previous step) (back to tree)

rl0 + vtail0 ' + orl1 = qrl + qrl0, vs0[phead1].deqID = None, ps0[phead1].deqID = None, ps0[vtail0].deqID = None, vs0[phead1].next = null, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, orl1 = [], pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], ps[first].next ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, vtail0 ≠ phead1, 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 + qrl + qrl0 + phead1 ', 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 + qrl + qrl0 + phead1 ', vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs(orl + qrl + qrl0 + phead1 ', 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(orl1, ps0), vhead0 ∈ orl + qrl + qrl0 + phead1 ' from vhead, 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, vtail ∈ orl + qrl from lst, pretRefs0(tid) ∈ vrvHp, (vtail0 ' + orl1).last ∈ orl + qrl + qrl0 + phead1 ' from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl), ¬ dups(orl + qrl), ¬ dups(orl + rl0 + orl1), ¬ dups(orl + rl0), ¬ dups(rl0 + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ dups(rl0), ¬ dups(qrl0), ¬ (vtail0 ' + orl1).last ∈ orl + qrl + qrl0 + phead1 ' from lst, ¬ vtail0 ∈ orl1, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl, ¬ phead1 ∈ orl1, ¬ phead1 ∈ rl0, ¬ phead1 ∈ orl, ¬ phead1 ∈ 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 from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ orl1 ∨ phead0 = phead1, phead0 ∈ orl ∨ phead0 ∈ rl0, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl from first ∨ 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 ∧ unmarkedp(orl1, vs0) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(orl1, 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] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ ¬ a ∈ []; (s) ⊦ unmarkedp([], vs); (s) ⊦ a '.last = a; (s) ⊦ x + [] = x; (s) ⊦ ¬ dups([]); (s)

Proof step 93 from proof stable-D18 (previous step) (back to tree)

rl0 + vtail0 ' = qrl + qrl0, vs0[phead1].deqID = None, ps0[phead1].deqID = None, ps0[vtail0].deqID = None, vs0[phead1].next = null, 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 ≠ [], ps[first].next ≠ null, first ≠ lst, orl ≠ [], pretRefs0(tid) ≠ null, vtail0 ≠ phead1, 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 + qrl + qrl0 + phead1 ', 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 + qrl + qrl0 + phead1 ', vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs(orl + qrl + qrl0 + phead1 ', 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), vtail0 ∈ orl + qrl + qrl0 + phead1 ' from vtail, vhead0 ∈ orl + qrl + qrl0 + phead1 ' from vhead, 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, vtail ∈ orl + qrl from lst, pretRefs0(tid) ∈ vrvHp, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl0), ¬ dups(orl), ¬ dups(rl0), ¬ dups(orl + rl0), ¬ dups(orl + qrl), ¬ dups(qrl), ¬ vtail0 ∈ orl + qrl + qrl0 + phead1 ' from lst, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ orl, ¬ phead1 ∈ rl0, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ 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 from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 = phead1, (orl + rl0).last = vhead0 ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ vs0[vtail0].deqID = None, phead0 ∈ orl ∨ phead0 ∈ rl0, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl from first ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail0 ∈ qrl ∨ vtail0 ∈ qrl0 ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used simplifier rules: ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' ↔ a = b; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ r ∈ rl from r0 → r ∈ rl; (ss) ⊦ ¬ r ∈ rl → rl from r = []; (s) ni: ⊦ x + a ' = y + z ∧ ¬ a ∈ z → z = []; (forward) from specification list[reflist] list-elem-in-app22: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app21: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ vs; (forward) from specification DMSQ ⊦ x + [] = x; (s) ⊦ [] + x = x; (s) ⊦ ¬ a ∈ []; (s) ⊦ ¬ dups([]); (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) Used terms: orl, qrl + qrl0 + phead1 ', lst

Proof step 94 from proof stable-D18 (previous step) (back to tree)

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

A spec-lemma

Proof step 95 from proof stable-D18 (previous step) (back to tree)

rl0 + vtail0 ' + orl1 = qrl + qrl0, vs0[phead1].deqID = None, ps0[phead1].deqID = None, ps0[vtail0].deqID = None, vs0[phead1].next = null, 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 ≠ [], ps[first].next ≠ null, first ≠ lst, orl ≠ [], orl1 ≠ [], pretRefs0(tid) ≠ null, vtail0 ≠ phead1, 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 + qrl + qrl0 + phead1 ', 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 + qrl + qrl0 + phead1 ', vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs(orl + qrl + qrl0 + phead1 ', 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(orl1, ps0), vhead0 ∈ orl + qrl + qrl0 + phead1 ' from vhead, 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, vtail ∈ orl + qrl from lst, pretRefs0(tid) ∈ vrvHp, orl1.last ∈ orl + qrl + qrl0 + phead1 ' from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl), ¬ dups(orl + qrl), ¬ dups(orl + rl0 + orl1), ¬ dups(orl + rl0), ¬ dups(rl0 + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ dups(rl0), ¬ dups(qrl0), ¬ orl1.last ∈ orl + qrl + qrl0 + phead1 ' from lst, ¬ vtail0 ∈ orl1, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl, ¬ phead1 ∈ orl1, ¬ phead1 ∈ rl0, ¬ phead1 ∈ orl, ¬ phead1 ∈ 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 from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ orl1 ∨ phead0 = phead1, phead0 ∈ orl ∨ phead0 ∈ rl0, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl from first ∨ 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 ∧ unmarkedp(orl1, vs0) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(orl1, vs0) ⊦

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] → [orl1, vhead1, qrl1]

Additional information

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

Proof step 96 from proof stable-D18 (previous step) (back to tree)

rl0 + vtail0 ' + orl1 = qrl + qrl0, ps0[vtail0].deqID = None, ps0[phead1].deqID = None, vs0[phead1].deqID = None, vs0[phead1].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, orl1 = qrl1 + vhead1 ', pretRefs(tid) = pretRefs0(tid), rvowns(pretRefs0(tid)) = Pending(tid), vretRefs(tid) = pretRefs0(tid), vretRefs0(tid) = pretRefs0(tid), orl + rl0 ≠ [], ps[first].next ≠ null, first ≠ lst, orl ≠ [], orl1 ≠ [], pretRefs0(tid) ≠ null, vtail0 ≠ phead1, 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 + qrl + qrl0 + phead1 ', 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 + qrl + qrl0 + phead1 ', vs0), nonullRetRefs(orl + qrl + qrl0 + phead1 ', 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(orl1, ps0), unmarkedp(qrl, ps), vhead1 ∈ orl + qrl + qrl0 + phead1 ' from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ orl + qrl from lst, 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, vhead0 ∈ orl + qrl + qrl0 + phead1 ' from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl), ¬ dups(orl + qrl), ¬ dups(orl + rl0 + orl1), ¬ dups(orl + rl0), ¬ dups(rl0 + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ dups(rl0), ¬ dups(qrl0), ¬ vhead1 ∈ orl + qrl + qrl0 + phead1 ' from lst, ¬ vtail0 ∈ orl1, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ orl, ¬ phead1 ∈ orl1, ¬ phead1 ∈ rl0, ¬ phead1 ∈ orl, ¬ phead1 ∈ 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), (orl + rl0).last = vhead0 ∧ unmarkedp(orl1, vs0) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(orl1, vs0), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), lst ∈ orl from first ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ orl1 ∨ phead0 = phead1 ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ x + a ' ≠ []; (s)

Proof step 97 from proof stable-D18 (previous step) (back to tree)

rl0 + vtail0 ' + qrl1 + vhead1 ' = qrl + qrl0, ps0[vhead1].deqID = None, ps0[vtail0].deqID = None, ps0[phead1].deqID = None, vs0[phead1].deqID = None, vs0[phead1].next = null, 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 ≠ [], ps[first].next ≠ null, first ≠ lst, orl ≠ [], phead1 ≠ vhead1, pretRefs0(tid) ≠ null, vtail0 ≠ vhead1, vtail0 ≠ phead1, 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 + qrl + qrl0 + phead1 ', 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 + qrl + qrl0 + phead1 ', vs0), nonullRetRefs(orl + qrl + qrl0 + phead1 ', 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(qrl1, ps0), unmarkedp(qrl, ps), vhead1 ∈ orl + qrl + qrl0 + phead1 ' from vtail, pretRefs0(tid) ∈ vrvHp, vtail ∈ orl + qrl from lst, 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, vhead0 ∈ orl + qrl + qrl0 + phead1 ' from vhead, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + rl0), ¬ dups(rl0 + qrl1), ¬ dups(orl), ¬ dups(qrl1), ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(orl + rl0 + qrl1), ¬ dups(orl + qrl), ¬ dups(qrl), ¬ phead1 ∈ qrl1, ¬ vtail0 ∈ orl, ¬ vtail0 ∈ rl0, ¬ vtail0 ∈ qrl1, ¬ vhead1 ∈ orl + qrl + qrl0 + phead1 ' from lst, ¬ vhead1 ∈ qrl1, ¬ vhead1 ∈ rl0, ¬ vhead1 ∈ orl, ¬ phead1 ∈ qrl0, ¬ phead1 ∈ orl, ¬ phead1 ∈ 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), phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 = vtail0 ∨ phead0 ∈ qrl1 ∨ phead0 = vhead1 ∨ phead0 = phead1, (orl + rl0).last = vhead0 ∧ unmarkedp(qrl1, vs0) ∧ vs0[vhead1].deqID = None ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ vs0[vtail0].deqID = None ∧ unmarkedp(qrl1, vs0) ∧ vs0[vhead1].deqID = None, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), lst ∈ orl from first ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead0 ∈ orl ∨ phead0 ∈ rl0, vhead1 ∈ qrl ∨ vhead1 ∈ qrl0 ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used simplifier rules: ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' ↔ a = b; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ r ∈ rl from r0 → r ∈ rl; (ss) ⊦ ¬ r ∈ rl → rl from r = []; (s) ni: ⊦ x + a ' = y + z ∧ ¬ a ∈ z → z = []; (forward) from specification list[reflist] list-elem-in-app22: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app21: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ vs; (forward) from specification DMSQ ⊦ x + [] = x; (s) ⊦ [] + x = x; (s) ⊦ ¬ a ∈ []; (s) ⊦ ¬ dups([]); (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) Used terms: orl, qrl + qrl0 + phead1 ', lst

Proof step 98 from proof stable-D18 (previous step) (back to tree)

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

A spec-lemma

Proof step 99 from proof stable-D18 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, 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 ≠ [], ps[first].next ≠ null, first ≠ lst, 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, vtail ∈ orl + qrl from lst, 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 from first, ¬ 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 from first ∨ 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 100 from proof stable-D18 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, 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 ≠ [], ps[first].next ≠ null, first ≠ lst, 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, vtail ∈ orl + qrl from lst, 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 from first, ¬ 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, phead1, 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) ⊦ x + [] = x; (s) ⊦ ¬ a ∈ []; (s) x ≠ [] ⊦ a = x.head ∧ y = x.tail ↔ x = a + y; (elim) Used terms: qrl, phead1, y

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