[Imprint][Data Privacy Statement][E-Mail]



View long theorem info. View the proof. Back to main index. View the specification. View theorem base summary, View theorem base listing, the used properties by spec, the dependency list, the symbol table,

Proof step 1 from proof step-D8-D9 (conclusion) (back to tree)

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

System applied rule normalize

And obtained the following new goals

Rule argument

Additional information

Proof step 2 from proof step-D8-D9 (previous step) (back to tree)

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ gstepf(gs, ls, D8, τ) = gs; (s) ⊦ (ls.lst:= node0).tid = ls.tid; (s) ⊦ lstepf(gs, ls, D8, τ) = ls.lst:= gs.vtail; (s) ⊦ (ls.lst:= node0).first = ls.first; (s) ⊦ (ls.lst:= node0).rvref = ls.rvref; (s) ⊦ (ls.lst:= node0).lst = node0; (s) ⊦ (ls.lst:= node0).success ↔ ls.success; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ ⊦ 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) ⊦ pre(gs, ls, D8, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, D8, a) = D9; (s)

Proof step 3 from proof step-D8-D9 (previous step) (back to tree)

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

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

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

Additional information

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

Proof step 4 from proof step-D8-D9 (previous step) (back to tree)

dom vrvHp = dom prvHp, gs = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), pretRefs(ls.tid) = ls.rvref, rvowns(ls.rvref) = Pending(ls.tid), vretRefs(ls.tid) = ls.rvref, ls.rvref ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(ls.tid, vhead, vs), noid(ls.tid, orl + qrl, ls.first, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(ls.tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, ls.first ∈ ps, phead ∈ vs, ls.first ∈ vs, phead ∈ orl, ls.first ∈ orl, vhead ∈ orl from ls.first, ls.rvref ∈ vrvHp, ¬ ls.success, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vtail ∈ orl + qrl from vtail, 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, vtail ∈ orl from ls.first ∨ vtail ∈ 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] ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ rl.last ∈ rl from r ↔ r ∈ rl; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ

Proof step 5 from proof step-D8-D9 (previous step) (back to tree)

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

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

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

Additional information

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

Proof step 6 from proof step-D8-D9 (previous step) (back to tree)

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ

Proof step 7 from proof step-D8-D9 (previous step) (back to tree)

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

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

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

Additional information

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

Proof step 8 from proof step-D8-D9 (previous step) (back to tree)

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a + x = a ' + x; (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) ⊦ a ' + x ≠ []; (s)

Proof step 9 from proof step-D8-D9 (previous step) (back to tree)

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

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

Additional information

Used terms: phead0 ', orl0

Proof step 10 from proof step-D8-D9 (previous step) (back to tree)

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

A spec-lemma

Proof step 11 from proof step-D8-D9 (previous step) (back to tree)

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ rl.last ∈ rl from r ↔ r ∈ rl; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x + [] = x; (s) ⊦ a '.butlast = []; (s) ⊦ unmarkedp([], vs); (s) ⊦ ¬ a ∈ []; (s) ⊦ ¬ dups([]); (s) ⊦ a '.last = a; (s)

Proof step 12 from proof step-D8-D9 (previous step) (back to tree)

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

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

Additional information

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

Proof step 13 from proof step-D8-D9 (previous step) (back to tree)

ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].deqID = None, vs[(phead0 ' + orl0).last].next = null, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), (orl + phead0 ' + orl0.butlast).last ≠ (phead0 ' + orl0).last, orl ≠ [], orl0 ≠ [], vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl0, first, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, phead ∈ orl, first ∈ orl, vhead ∈ orl from first, vretRefs(tid) ∈ vrvHp, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ (orl + phead0 ' + orl0.butlast).last ∈ orl + phead0 ' + orl0 from (orl + phead0 ' + orl0.butlast).last, 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 + phead0 ' + orl0.butlast).last ∈ orl from first ∨ (orl + phead0 ' + orl0.butlast).last = phead0 ∨ (orl + phead0 ' + orl0.butlast).last ∈ orl0, orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, 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 + a ' + y).last = (a ' + y).last; (s) ⊦ x ≠ [] → (a ' + x).last = x.last; (s)

Proof step 14 from proof step-D8-D9 (previous step) (back to tree)

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

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

Additional information

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

Proof step 15 from proof step-D8-D9 (previous step) (back to tree)

vs[first0].deqID = None, ps[phead0].deqID = None, vs[first0].next = null, dom vrvHp = dom prvHp, orl0 = orl1 + first0 ', pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), (phead0 ' + orl1).last ≠ first0, orl ≠ [], orl0 ≠ [], vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl0, first, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, phead ∈ orl, first ∈ orl, vhead ∈ orl from first, vretRefs(tid) ∈ vrvHp, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ (phead0 ' + orl1).last ∈ orl + phead0 ' + orl0 from (phead0 ' + orl1).last, 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 ' + orl1).last ∈ orl from first ∨ (phead0 ' + orl1).last = phead0 ∨ (phead0 ' + orl1).last ∈ orl0, orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, 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] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ x + a ' ≠ []; (s)

Proof step 16 from proof step-D8-D9 (previous step) (back to tree)

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

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

Additional information

Used simplifier rules: ⊦ unmarkedp([], vs); (s) ⊦ ¬ dups([]); (s) ⊦ [] + x = x; (s) ⊦ x + [] = x; (s) ⊦ a '.last = a; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: phead0 ', orl1

Proof step 17 from proof step-D8-D9 (previous step) (back to tree)

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

A spec-lemma

Proof step 18 from proof step-D8-D9 (previous step) (back to tree)

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 19 from proof step-D8-D9 (previous step) (back to tree)

ps[phead0].deqID = None, vs[first0].deqID = None, ps[first0].deqID = None, vs[first0].next = null, dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), orl1.last ≠ first0, orl ≠ [], orl1 ≠ [], phead0 ≠ first0, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl1 + first0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl1 + first0 ', first, vs), nonullRetRefs(orl + phead0 ' + orl1 + first0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl1, ps), vretRefs(tid) ∈ vrvHp, vhead ∈ orl from first, first ∈ orl, phead ∈ orl, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ orl1.last ∈ orl + phead0 ' + orl1 + first0 ' from orl1.last, ¬ first0 ∈ orl, ¬ first0 ∈ orl1, ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, 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 ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].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, vhead0, orl0]

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) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r ∈ rl1 + r ' + rl2 from r; (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, vhead0, y

Proof Tree for step-D8-D9 (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