[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-E15-E4 (conclusion) (back to tree)

⊦ ( (gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node] ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ pre(gs, ls, E15, a) ∧ pcstepf(gs, ls, E15, a) = E4 → ( listp (gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl, gstepf(gs, ls, E15, a).vs, gstepf(gs, ls, E15, a).ps, gstepf(gs, ls, E15, a).owns) ∧ ¬ dups(gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl) ∧ markedp(gstepf(gs, ls, E15, a).orl, gstepf(gs, ls, E15, a).ps) ∧ markedp(gstepf(gs, ls, E15, a).orl, gstepf(gs, ls, E15, a).vs) ∧ unmarkedp(gstepf(gs, ls, E15, a).qrl, gstepf(gs, ls, E15, a).ps) ∧ gstepf(gs, ls, E15, a).orl ≠ [] ∧ gstepf(gs, ls, E15, a).phead ∈ gstepf(gs, ls, E15, a).orl ∧ rvownerok(gstepf(gs, ls, E15, a).vretRefs, gstepf(gs, ls, E15, a).vrvHp, gstepf(gs, ls, E15, a).rvowns) ∧ allocrv(gstepf(gs, ls, E15, a).vretRefs, gstepf(gs, ls, E15, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl, gstepf(gs, ls, E15, a).vs, gstepf(gs, ls, E15, a).vretRefs, gstepf(gs, ls, E15, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, E15, a).pretRefs, gstepf(gs, ls, E15, a).prvHp, gstepf(gs, ls, E15, a).rvowns) ∧ allocrv(gstepf(gs, ls, E15, a).pretRefs, gstepf(gs, ls, E15, a).prvHp) ∧ dom gstepf(gs, ls, E15, a).vrvHp = dom gstepf(gs, ls, E15, a).prvHp ∧ ( gstepf(gs, ls, E15, a).vs[gstepf(gs, ls, E15, a).vhead].next ≠ null ∧ gstepf(gs, ls, E15, a).vs[gstepf(gs, ls, E15, a).vs[gstepf(gs, ls, E15, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E15, a).rvowns (gstepf(gs, ls, E15, a).vretRefs(gstepf(gs, ls, E15, a).vs[gstepf(gs, ls, E15, a).vs[gstepf(gs, ls, E15, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E15, a).vs[gstepf(gs, ls, E15, a).vs[gstepf(gs, ls, E15, a).vhead].next].deqID.tid, gstepf(gs, ls, E15, a).vs[gstepf(gs, ls, E15, a).vs[gstepf(gs, ls, E15, a).vhead].next].val)) ∧ ( gstepf(gs, ls, E15, a).orl.last = gstepf(gs, ls, E15, a).vhead ∧ (gstepf(gs, ls, E15, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E15, a).qrl.tail, gstepf(gs, ls, E15, a).vs)) ∨ gstepf(gs, ls, E15, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E15, a).orl.butlast.last = gstepf(gs, ls, E15, a).vhead ∧ gstepf(gs, ls, E15, a).phead ≠ gstepf(gs, ls, E15, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E15, a).qrl, gstepf(gs, ls, E15, a).vs)) ∧ ( gstepf(gs, ls, E15, a).vtail = (gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl).last ∨ gstepf(gs, ls, E15, a).qrl ≠ [] ∧ gstepf(gs, ls, E15, a).vtail = (gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl.butlast).last ∧ gstepf(gs, ls, E15, a).vs[gstepf(gs, ls, E15, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E15, a).vs[(gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, E15, a).success → ¬ lstepf(gs, ls, E15, a).node ∈ gstepf(gs, ls, E15, a).orl ∧ ¬ lstepf(gs, ls, E15, a).node ∈ gstepf(gs, ls, E15, a).qrl ∧ lstepf(gs, ls, E15, a).node ≠ null ∧ lstepf(gs, ls, E15, a).node ∈ gstepf(gs, ls, E15, a).ps ∧ lstepf(gs, ls, E15, a).node ∈ gstepf(gs, ls, E15, a).vs ∧ gstepf(gs, ls, E15, a).owns(lstepf(gs, ls, E15, a).node) = Some(lstepf(gs, ls, E15, a).tid) ∧ gstepf(gs, ls, E15, a).vs[lstepf(gs, ls, E15, a).node] = mk(lstepf(gs, ls, E15, a).value, None, null) ∧ gstepf(gs, ls, E15, a).ps[lstepf(gs, ls, E15, a).node] = gstepf(gs, ls, E15, a).vs[lstepf(gs, ls, E15, a).node]) ∧ nextnottid(lstepf(gs, ls, E15, a).tid, gstepf(gs, ls, E15, a).vhead, gstepf(gs, ls, E15, a).vs) ∧ noid (lstepf(gs, ls, E15, a).tid, gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl, gstepf(gs, ls, E15, a).vhead, gstepf(gs, ls, E15, a).vs) ∧ (lstepf(gs, ls, E15, a).success ⊃ noowns(lstepf(gs, ls, E15, a).tid, gstepf(gs, ls, E15, a).owns) ;oneowns (lstepf(gs, ls, E15, a).tid, lstepf(gs, ls, E15, a).node, gstepf(gs, ls, E15, a).owns, gstepf(gs, ls, E15, a).vs, gstepf(gs, ls, E15, a).ps) )

System applied rule normalize

And obtained the following new goals

Rule argument

Additional information

Proof step 2 from proof step-E15-E4 (previous step) (back to tree)

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

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] fw-some-oneowns: ⊦ oneowns(tid, r0, owns, vs, ps) ∧ owns(r) = Some(tid) ∧ r ∈ ps ∧ r ∈ vs → r = r0; (forward) from specification DMSQ 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 ⊦ gstepf(gs, ls, E15, a) = (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs); (s) ⊦ lstepf(gs, ls, E15, a) = ls; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ pre(gs, ls, E15, a) ↔ a = τ; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ pcstepf(gs, ls, E15, a) = E4; (s)

Proof step 3 from proof step-E15-E4 (previous step) (back to tree)

ls.nxt = gs.vs[ls.lst].next, ls.nxt = gs.ps[ls.lst].next, gs.owns(ls.node) = Some(ls.tid), gs.vs[ls.node] = mk(ls.value, None, null), gs.ps[ls.node] = mk(ls.value, None, null), dom gs.vrvHp = dom gs.prvHp, ls.node ≠ null, ls.nxt ≠ null, gs.orl ≠ [], allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nextnottid(ls.tid, gs.vhead, gs.vs), noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.ps, gs.phead ∈ gs.vs, gs.phead ∈ gs.orl, ls.node ∈ gs.ps, ls.node ∈ gs.vs, ¬ ls.success, ¬ dups(gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.orl + gs.qrl), ¬ ls.node ∈ gs.orl, ¬ ls.node ∈ gs.qrl, gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[gs.qrl.last].next = null, ls.lst ∈ gs.orl ∨ ls.lst ∈ gs.qrl, gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs) ⊦ listp ((gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).orl + (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).qrl, (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vs, (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).ps, (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).owns) ∧ ¬ dups((gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).orl + (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).qrl) ∧ markedp((gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).orl, (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).ps) ∧ markedp((gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).orl, (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vs) ∧ unmarkedp((gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).qrl, (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).ps) ∧ (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).orl ≠ [] ∧ (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).phead ∈ (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).orl ∧ rvownerok ((gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vretRefs, (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vrvHp, (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).rvowns) ∧ allocrv((gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vretRefs, (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vrvHp) ∧ nonullRetRefs ((gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).orl + (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).qrl, (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vs, (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vretRefs, (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).pretRefs) ∧ rvownerok ((gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).pretRefs, (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).prvHp, (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).rvowns) ∧ allocrv((gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).pretRefs, (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).prvHp) ∧ dom (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vrvHp = dom (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).prvHp ∧ ( (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vs[(gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vhead].next ≠ null ∧ (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vs [(gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vs[(gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vhead].next ] .deqID ≠ None → (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).rvowns ((gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vretRefs ((gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vs [(gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vs[(gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vhead].next ] .deqID .tid)) = Claimed ((gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vs [(gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vs[(gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vhead].next ] .deqID .tid, (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vs [(gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vs[(gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vhead].next ] .val)) ∧ ( (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).orl.last = (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vhead ∧ ( (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).qrl ≠ [] → unmarkedp((gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).qrl.tail, (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vs)) ∨ (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).orl.butlast ≠ [] ∧ (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).orl.butlast.last = (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vhead ∧ (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).phead ≠ (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).orl.last ∧ unmarkedp((gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).qrl, (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vs)) ∧ ( (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vtail = ((gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).orl + (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).qrl).last ∨ (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).qrl ≠ [] ∧ (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vtail = ((gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).orl + (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).qrl.butlast).last ∧ (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vs[(gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).qrl.last].deqID = None ∧ (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vs[(gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).qrl.last].next = null) ∧ ¬ ls.node ∈ (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).orl ∧ ¬ ls.node ∈ (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).qrl ∧ ls.node ∈ (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).ps ∧ ls.node ∈ (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vs ∧ (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).owns(ls.node) = Some(ls.tid) ∧ (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vs[ls.node] = mk(ls.value, None, null) ∧ (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).ps[ls.node] = (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vs[ls.node] ∧ nextnottid(ls.tid, (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vhead, (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vs) ∧ noid (ls.tid, (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).orl + (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).qrl, (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vhead, (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vs) ∧ oneowns (ls.tid, ls.node, (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).owns, (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vs, (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).ps)

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

ls.nxt = ps[ls.lst].next, ls.nxt = vs[ls.lst].next, ps[ls.node] = mk(ls.value, None, null), vs[ls.node] = mk(ls.value, None, null), dom vrvHp = dom prvHp, gs = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), owns(ls.node) = Some(ls.tid), ls.node ≠ null, ls.nxt ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(ls.tid, vhead, vs), noid(ls.tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(ls.tid, ls.node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), ls.node ∈ vs, ls.node ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ ls.success, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ ls.node ∈ orl, ¬ ls.node ∈ qrl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), ls.lst ∈ orl ∨ ls.lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ listp ((vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).orl + (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).qrl, (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vs, (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).ps, (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).owns) ∧ ¬ dups((vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).orl + (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).qrl) ∧ markedp((vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).orl, (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).ps) ∧ markedp((vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).orl, (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vs) ∧ unmarkedp((vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).qrl, (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).ps) ∧ (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).orl ≠ [] ∧ (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).phead ∈ (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).orl ∧ rvownerok ((vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vretRefs, (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vrvHp, (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).rvowns) ∧ allocrv((vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vretRefs, (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vrvHp) ∧ nonullRetRefs ((vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).orl + (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).qrl, (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vs, (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vretRefs, (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).pretRefs) ∧ rvownerok ((vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).pretRefs, (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).prvHp, (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).rvowns) ∧ allocrv((vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).pretRefs, (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).prvHp) ∧ dom (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vrvHp = dom (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).prvHp ∧ ( (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vs[(vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vhead].next ≠ null ∧ (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vs[(vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vs[(vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vhead].next] .deqID ≠ None → (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).rvowns ((vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vretRefs ((vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vs[(vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vs[(vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vhead].next] .deqID .tid)) = Claimed ((vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vs[(vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vs[(vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vhead].next] .deqID .tid, (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vs[(vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vs[(vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vhead].next] .val)) ∧ ( (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).orl.last = (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vhead ∧ ( (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).qrl ≠ [] → unmarkedp((vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).qrl.tail, (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vs)) ∨ (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).orl.butlast ≠ [] ∧ (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).orl.butlast.last = (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vhead ∧ (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).phead ≠ (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).orl.last ∧ unmarkedp((vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).qrl, (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vs)) ∧ ( (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vtail = ((vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).orl + (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).qrl).last ∨ (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).qrl ≠ [] ∧ (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vtail = ((vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).orl + (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).qrl.butlast).last ∧ (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vs[(vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).qrl.last].deqID = None ∧ (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vs[(vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).qrl.last].next = null) ∧ ¬ ls.node ∈ (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).orl ∧ ¬ ls.node ∈ (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).qrl ∧ ls.node ∈ (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).ps ∧ ls.node ∈ (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vs ∧ (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).owns(ls.node) = Some(ls.tid) ∧ (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vs[ls.node] = mk(ls.value, None, null) ∧ (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).ps[ls.node] = (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vs[ls.node] ∧ nextnottid(ls.tid, (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vhead, (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vs) ∧ noid (ls.tid, (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).orl + (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).qrl, (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vhead, (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vs) ∧ oneowns (ls.tid, ls.node, (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).owns, (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vs, (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).ps)

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 ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail:= phead4 = mkgs (ps, ps0, phead, phead0, phead4, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns); (s)

Proof step 5 from proof step-E15-E4 (previous step) (back to tree)

ls.nxt = vs[ls.lst].next, ls.nxt = ps[ls.lst].next, vs[ls.node] = mk(ls.value, None, null), ps[ls.node] = mk(ls.value, None, null), dom vrvHp = dom prvHp, owns(ls.node) = Some(ls.tid), ls.node ≠ null, ls.nxt ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(ls.tid, vhead, vs), noid(ls.tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(ls.tid, ls.node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, ls.node ∈ ps, ls.node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ ls.success, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ ls.node ∈ orl, ¬ ls.node ∈ qrl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, ls.lst ∈ orl ∨ ls.lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ listp ( (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps, (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns) ∧ ¬ dups ( (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl) ∧ markedp ((vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl, (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps) ∧ markedp ((vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl, (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ unmarkedp ((vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps) ∧ (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl ≠ [] ∧ (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .phead ∈ (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl ∧ rvownerok ((vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs, (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp, (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns) ∧ allocrv ((vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs, (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp) ∧ nonullRetRefs ( (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs, (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs) ∧ rvownerok ((vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs, (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp, (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns) ∧ allocrv ((vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs, (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp) ∧ dom (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp = dom (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp ∧ ( (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ≠ null ∧ (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ] .deqID ≠ None → (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns ((vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs ((vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ] .deqID .tid)) = Claimed ((vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ] .deqID .tid, (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ] .val)) ∧ ( (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl .last = (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ∧ ( (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl ≠ [] → unmarkedp ((vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl .tail, (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs)) ∨ (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl .butlast ≠ [] ∧ (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl .butlast .last = (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ∧ (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .phead ≠ (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl .last ∧ unmarkedp ((vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs)) ∧ ( (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail = ( (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl ).last ∨ (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl ≠ [] ∧ (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail = ( (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl .butlast ).last ∧ (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl .last ] .deqID = None ∧ (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [(vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl .last ] .next = null) ∧ ¬ ls.node ∈ (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl ∧ ¬ ls.node ∈ (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl ∧ ls.node ∈ (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps ∧ ls.node ∈ (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs ∧ (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns (ls.node) = Some(ls.tid) ∧ (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [ls.node ] = mk(ls.value, None, null) ∧ (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [ls.node ] = (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [ls.node ] ∧ nextnottid (ls.tid, (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead, (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ noid (ls.tid, (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead, (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ oneowns (ls.tid, ls.node, (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns, (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps)

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

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 7 from proof step-E15-E4 (previous step) (back to tree)

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

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, (vtail = lst ⊃ mkgs (ps, vs, phead, vhead, ps[lst].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs (ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), 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, (vtail = lst ⊃ mkgs (ps, vs, phead, vhead, ps[lst].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs (ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), owns0, rvowns0, orl0, prvHp0, pretRefs0, vs0

Proof step 8 from proof step-E15-E4 (previous step) (back to tree)

vs[lst].next = ps[lst].next, (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, ps[lst].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) = mkgs(ps0, vs0, phead0, vhead0, vtail0, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), ps[lst].next ≠ null, node ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ orl, ¬ node ∈ qrl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), lst ∈ orl ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ listp(orl0 + qrl0, vs0, ps0, owns0) ∧ ¬ dups(orl0 + qrl0) ∧ markedp(orl0, ps0) ∧ markedp(orl0, vs0) ∧ unmarkedp(qrl0, ps0) ∧ orl0 ≠ [] ∧ phead0 ∈ orl0 ∧ rvownerok(vretRefs0, vrvHp0, rvowns0) ∧ allocrv(vretRefs0, vrvHp0) ∧ nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0) ∧ rvownerok(pretRefs0, prvHp0, rvowns0) ∧ allocrv(pretRefs0, prvHp0) ∧ dom vrvHp0 = dom prvHp0 ∧ ( 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)) ∧ ( orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0)) ∧ (vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null) ∧ ¬ node ∈ orl0 ∧ ¬ node ∈ qrl0 ∧ node ∈ ps0 ∧ node ∈ vs0 ∧ owns0(node) = Some(tid) ∧ vs0[node] = mk(value, None, null) ∧ ps0[node] = vs0[node] ∧ nextnottid(tid, vhead0, vs0) ∧ noid(tid, orl0 + qrl0, vhead0, vs0) ∧ oneowns(tid, node, owns0, vs0, ps0)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 2

Additional information

Used simplifier rules: ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) = mkgs (ps1, ps2, phead2, phead3, phead4, vretRefs1, vretRefs2, vrvHp1, vrvHp2, qrl1, qrl2, owns0, rvowns0) ↔ ps = ps1 ∧ ps0 = ps2 ∧ phead = phead2 ∧ phead0 = phead3 ∧ phead1 = phead4 ∧ vretRefs = vretRefs1 ∧ vretRefs0 = vretRefs2 ∧ vrvHp = vrvHp1 ∧ vrvHp0 = vrvHp2 ∧ qrl = qrl1 ∧ qrl0 = qrl2 ∧ owns = owns0 ∧ rvowns = rvowns0; (ws) 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: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] a: ⊦ (x + y) + z = x + y + z; from specification list[reflist]

Proof step 9 from proof step-E15-E4 (previous step) (back to tree)

vs[lst].next = ps[lst].next, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, mkgs(ps, vs, phead, vhead, ps[lst].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) = mkgs(ps0, vs0, phead0, vhead0, vtail0, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), owns(node) = Some(tid), vtail = lst, ps[lst].next ≠ null, node ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ orl, ¬ node ∈ qrl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ listp(orl0 + qrl0, vs0, ps0, owns0) ∧ ¬ dups(orl0 + qrl0) ∧ markedp(orl0, ps0) ∧ markedp(orl0, vs0) ∧ unmarkedp(qrl0, ps0) ∧ orl0 ≠ [] ∧ phead0 ∈ orl0 ∧ rvownerok(vretRefs0, vrvHp0, rvowns0) ∧ allocrv(vretRefs0, vrvHp0) ∧ nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0) ∧ rvownerok(pretRefs0, prvHp0, rvowns0) ∧ allocrv(pretRefs0, prvHp0) ∧ dom vrvHp0 = dom prvHp0 ∧ ( 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)) ∧ ( orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0)) ∧ (vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null) ∧ ¬ node ∈ orl0 ∧ ¬ node ∈ qrl0 ∧ node ∈ ps0 ∧ node ∈ vs0 ∧ owns0(node) = Some(tid) ∧ vs0[node] = mk(value, None, null) ∧ ps0[node] = vs0[node] ∧ nextnottid(tid, vhead0, vs0) ∧ noid(tid, orl0 + qrl0, vhead0, vs0) ∧ oneowns(tid, node, owns0, vs0, ps0)

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 ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) = mkgs (ps1, ps2, phead2, phead3, phead4, vretRefs1, vretRefs2, vrvHp1, vrvHp2, qrl1, qrl2, owns0, rvowns0) ↔ ps = ps1 ∧ ps0 = ps2 ∧ phead = phead2 ∧ phead0 = phead3 ∧ phead1 = phead4 ∧ vretRefs = vretRefs1 ∧ vretRefs0 = vretRefs2 ∧ vrvHp = vrvHp1 ∧ vrvHp0 = vrvHp2 ∧ qrl = qrl1 ∧ qrl0 = qrl2 ∧ owns = owns0 ∧ rvowns = rvowns0; (ws)

Proof step 10 from proof step-E15-E4 (previous step) (back to tree)

vs0[lst].next = ps0[lst].next, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), ps0[lst].next ≠ null, ps0[lst].next ≠ (orl0 + qrl0).last, node ≠ null, orl0 ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ node ∈ orl0, ¬ node ∈ 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), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), lst ∈ orl0 ∨ lst ∈ qrl0, lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ qrl0 ≠ [] ∧ ps0[lst].next = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null

Heuristic use patterns 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, qrl0], <all paths>

Additional information

Used simplifier rules: ⊦ ¬ dups([]); (s) ⊦ unmarkedp([], vs); (s) ⊦ ¬ a ∈ []; (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x.last = a ∧ x ≠ [] → a ∈ x; (s) ⊦ listp(rl, vs, ps, owns) ∧ rl ≠ [] → ps[rl.last].next = null; (s) Used terms: orl0, qrl0

Proof step 11 from proof step-E15-E4 (previous step) (back to tree)

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

A spec-lemma

Proof step 12 from proof step-E15-E4 (previous step) (back to tree)

vs0[lst].next = ps0[lst].next, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), ps0[lst].next ≠ null, ps0[lst].next ≠ qrl0.last, node ≠ null, orl0 ≠ [], qrl0 ≠ [], allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ node ∈ orl0, ¬ node ∈ 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), lst = qrl0.last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ orl0 ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦ qrl0 ≠ [] ∧ ps0[lst].next = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 13 from proof step-E15-E4 (previous step) (back to tree)

vs0[lst].next = ps0[lst].next, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), ps0[lst].next ≠ null, ps0[lst].next ≠ qrl0.last, node ≠ null, orl0 ≠ [], qrl0 ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ node ∈ orl0, ¬ node ∈ 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), lst ∈ orl0 ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ unmarkedp(qrl0.tail, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), lst = qrl0.last ∨ lst = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ ps0[lst].next = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.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] → [qrl0, phead, orl]

Additional information

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

Proof step 14 from proof step-E15-E4 (previous step) (back to tree)

vs0[lst].next = ps0[lst].next, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), qrl0 = phead + orl, ps0[lst].next ≠ null, ps0[lst].next ≠ qrl0.last, node ≠ null, orl0 ≠ [], qrl0 ≠ [], allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ node ∈ orl0, ¬ node ∈ 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), lst = qrl0.last ∨ lst = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl0.last = vhead0 ∧ unmarkedp(orl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), lst ∈ orl0 ∨ lst ∈ qrl0 ⊦ ps0[lst].next = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a + 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) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ 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 15 from proof step-E15-E4 (previous step) (back to tree)

ps0[phead].deqID = None, vs0[lst].next = ps0[lst].next, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), ps0[lst].next ≠ null, ps0[lst].next ≠ (phead ' + orl).last, node ≠ null, node ≠ phead, orl0 ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + phead ' + orl, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + orl, vhead0, vs0), nonullRetRefs(orl0 + phead ' + orl, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(orl, ps0), phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, ¬ dups(orl0 + orl), ¬ dups(orl0), ¬ dups(orl), ¬ phead ∈ orl, ¬ phead ∈ orl0, ¬ node ∈ orl0, ¬ node ∈ 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), lst ∈ orl0 ∨ lst = phead ∨ lst ∈ orl, orl0.last = vhead0 ∧ unmarkedp(orl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl, vs0), lst = (phead ' + orl).last ∨ lst = (orl0 + (phead ' + orl).butlast).last ∧ vs0[(phead ' + orl).last].deqID = None ∧ vs0[(phead ' + orl).last].next = null ⊦ ps0[lst].next = (orl0 + (phead ' + orl).butlast).last ∧ vs0[(phead ' + orl).last].deqID = None ∧ vs0[(phead ' + orl).last].next = null

Heuristic use patterns 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] → [phead ', orl], <all paths>

Additional information

Used terms: phead ', orl

Proof step 16 from proof step-E15-E4 (previous step) (back to tree)

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

A spec-lemma

Proof step 17 from proof step-E15-E4 (previous step) (back to tree)

ps0[phead].deqID = None, vs0[lst].next = ps0[lst].next, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, orl = [], owns0(node) = Some(tid), ps0[lst].next ≠ null, ps0[lst].next ≠ (phead ' + orl).last, node ≠ null, node ≠ phead, orl0 ≠ [], allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + phead ' + orl, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + orl, vhead0, vs0), nonullRetRefs(orl0 + phead ' + orl, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(orl, ps0), phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(orl0 + orl), ¬ dups(orl0), ¬ dups(orl), ¬ phead ∈ orl, ¬ phead ∈ orl0, ¬ node ∈ orl0, ¬ node ∈ 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), lst = (phead ' + orl).last ∨ lst = (orl0 + (phead ' + orl).butlast).last ∧ vs0[(phead ' + orl).last].deqID = None ∧ vs0[(phead ' + orl).last].next = null, orl0.last = vhead0 ∧ unmarkedp(orl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl, vs0), lst ∈ orl0 ∨ lst = phead ∨ lst ∈ orl ⊦ ps0[lst].next = (orl0 + (phead ' + orl).butlast).last ∧ vs0[(phead ' + orl).last].deqID = None ∧ vs0[(phead ' + orl).last].next = null

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ a '.last = a; (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)

Proof step 18 from proof step-E15-E4 (previous step) (back to tree)

ps0[phead].deqID = None, vs0[lst].next = ps0[lst].next, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), ps0[lst].next ≠ null, ps0[lst].next ≠ phead, node ≠ null, node ≠ phead, orl0 ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + phead ', vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ', vhead0, vs0), nonullRetRefs(orl0 + phead ', vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, ¬ dups(orl0), ¬ phead ∈ orl0, ¬ node ∈ 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), lst ∈ orl0 ∨ lst = phead, orl0.last = vhead0 ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None, lst = phead ∨ lst = orl0.last ∧ vs0[phead].deqID = None ∧ vs0[phead].next = null ⊦ ps0[lst].next = orl0.last ∧ vs0[phead].deqID = None ∧ vs0[phead].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] → [orl0, vhead, orl]

Additional information

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

Proof step 19 from proof step-E15-E4 (previous step) (back to tree)

ps0[phead].deqID = None, vs0[lst].next = ps0[lst].next, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, orl0 = orl + vhead ', owns0(node) = Some(tid), ps0[lst].next ≠ null, ps0[lst].next ≠ phead, node ≠ null, node ≠ phead, orl0 ≠ [], allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + phead ', vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ', vhead0, vs0), nonullRetRefs(orl0 + phead ', vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(orl0), ¬ phead ∈ orl0, ¬ node ∈ 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), lst = phead ∨ lst = vhead ∧ vs0[phead].deqID = None ∧ vs0[phead].next = null, vhead = vhead0 ∨ orl ≠ [] ∧ orl.last = vhead0 ∧ phead0 ≠ vhead ∧ vs0[phead].deqID = None, lst ∈ orl0 ∨ lst = phead ⊦ ps0[lst].next = vhead ∧ vs0[phead].deqID = None ∧ vs0[phead].next = null

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

ps0[phead].deqID = None, vs0[lst].next = ps0[lst].next, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), ps0[lst].next ≠ null, ps0[lst].next ≠ phead, node ≠ null, node ≠ phead, node ≠ vhead, phead ≠ vhead, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp((orl + vhead ') + phead ', vs0, ps0, owns0), markedp(orl, vs0), markedp(orl, ps0), nextnottid(tid, vhead0, vs0), noid(tid, (orl + vhead ') + phead ', vhead0, vs0), nonullRetRefs((orl + vhead ') + phead ', vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(vs0[vhead].deqID), some?(ps0[vhead].deqID), phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, ¬ dups(orl), ¬ vhead ∈ orl, ¬ phead ∈ orl, ¬ node ∈ 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), vhead = vhead0 ∨ orl ≠ [] ∧ orl.last = vhead0 ∧ phead0 ≠ vhead ∧ vs0[phead].deqID = None, lst = phead ∨ lst = vhead ∧ vs0[phead].deqID = None ∧ vs0[phead].next = null, phead0 ∈ orl ∨ phead0 = vhead, lst ∈ orl ∨ lst = vhead ∨ lst = phead ⊦ ps0[lst].next = vhead ∧ vs0[phead].deqID = None ∧ vs0[phead].next = null

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:listp-postfix, seq: ⊦ listp(rl + rl0, vs, ps, owns) → (listp(rl0, vs, ps, owns) ↔ rl0 ≠ []), subst:[ps, rl, owns, rl0, vs] → [ps0, orl, owns0, vhead ' + phead ', vs0]

Additional information

Used simplifier rules: ⊦ a ' + x ≠ []; (s) ⊦ listp(r ' + r0 ', 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 ∧ r0 ≠ null ∧ owns(r0) = None ∧ r0 ∈ vs ∧ r0 ∈ ps ∧ ¬ weak?(vs[r0].deqID) ∧ (ps[r0].deqID = vs[r0].deqID ∨ ps[r0].deqID = None) ∧ ps[r0].val = vs[r0].val ∧ ps[r0].next = null ∧ ( vs[r0].next ≠ null → vs[r0].next ∈ vs ∧ vs[r0].next ∈ ps ∧ ps[vs[r0].next] = vs[vs[r0].next] ∧ ps[vs[r0].next].deqID = None ∧ ps[vs[r0].next].next = null ∧ weak?(owns(vs[r0].next))); (s) ⊦ some?(opttid) → opttid ≠ None; (as) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: ps0, orl, owns0, vhead ' + phead ', vs0

Proof step 21 from proof step-E15-E4 (previous step) (back to tree)

⊦ listp(rl + rl0, vs, ps, owns) → (listp(rl0, vs, ps, owns) ↔ rl0 ≠ [])

A spec-lemma

Proof step 22 from proof step-E15-E4 (previous step) (back to tree)

ps0[phead].deqID = None, vs0[lst].next = ps0[lst].next, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), ps0[lst].next ≠ null, ps0[lst].next ≠ orl.last, node ≠ null, node ≠ phead, orl ≠ [], orl0 ≠ [], allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + phead ' + orl, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + orl, vhead0, vs0), nonullRetRefs(orl0 + phead ' + orl, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(orl, ps0), phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(orl0 + orl), ¬ dups(orl0), ¬ dups(orl), ¬ phead ∈ orl, ¬ phead ∈ orl0, ¬ node ∈ orl0, ¬ node ∈ 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), lst = orl.last ∨ lst = (orl0 + (phead ' + orl).butlast).last ∧ vs0[orl.last].deqID = None ∧ vs0[orl.last].next = null, orl0.last = vhead0 ∧ unmarkedp(orl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl, vs0), lst ∈ orl0 ∨ lst = phead ∨ lst ∈ orl ⊦ ps0[lst].next = (orl0 + (phead ' + orl).butlast).last ∧ vs0[orl.last].deqID = None ∧ vs0[orl.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 + a ' + y).last = (a ' + y).last; (s) ⊦ x ≠ [] → (a ' + x).butlast = a ' + x.butlast; (s)

Proof step 23 from proof step-E15-E4 (previous step) (back to tree)

ps0[phead].deqID = None, vs0[lst].next = ps0[lst].next, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), ps0[lst].next ≠ null, ps0[lst].next ≠ orl.last, node ≠ null, node ≠ phead, orl ≠ [], orl0 ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + phead ' + orl, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + orl, vhead0, vs0), nonullRetRefs(orl0 + phead ' + orl, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(orl, ps0), phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, ¬ dups(orl0 + orl), ¬ dups(orl0), ¬ dups(orl), ¬ phead ∈ orl, ¬ phead ∈ orl0, ¬ node ∈ orl0, ¬ node ∈ 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), lst ∈ orl0 ∨ lst = phead ∨ lst ∈ orl, orl0.last = vhead0 ∧ unmarkedp(orl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl, vs0), lst = orl.last ∨ lst = (phead ' + orl.butlast).last ∧ vs0[orl.last].deqID = None ∧ vs0[orl.last].next = null ⊦ ps0[lst].next = (phead ' + orl.butlast).last ∧ vs0[orl.last].deqID = None ∧ vs0[orl.last].next = null

Heuristic use patterns 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, vhead, orl1]

Additional information

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

Proof step 24 from proof step-E15-E4 (previous step) (back to tree)

ps0[phead].deqID = None, vs0[lst].next = ps0[lst].next, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, orl = orl1 + vhead ', owns0(node) = Some(tid), ps0[lst].next ≠ null, ps0[lst].next ≠ vhead, node ≠ null, node ≠ phead, orl ≠ [], orl0 ≠ [], allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + phead ' + orl, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + orl, vhead0, vs0), nonullRetRefs(orl0 + phead ' + orl, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(orl, ps0), phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(orl0 + orl), ¬ dups(orl0), ¬ dups(orl), ¬ phead ∈ orl, ¬ phead ∈ orl0, ¬ node ∈ orl0, ¬ node ∈ 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), lst = vhead ∨ lst = (phead ' + orl1).last ∧ vs0[vhead].deqID = None ∧ vs0[vhead].next = null, orl0.last = vhead0 ∧ unmarkedp(orl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl, vs0), lst ∈ orl0 ∨ lst = phead ∨ lst ∈ orl ⊦ ps0[lst].next = (phead ' + orl1).last ∧ vs0[vhead].deqID = None ∧ vs0[vhead].next = null

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 25 from proof step-E15-E4 (previous step) (back to tree)

ps0[phead].deqID = None, ps0[vhead].deqID = None, vs0[lst].next = ps0[lst].next, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), ps0[lst].next ≠ null, ps0[lst].next ≠ vhead, node ≠ null, node ≠ phead, node ≠ vhead, orl0 ≠ [], phead ≠ vhead, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + phead ' + orl1 + vhead ', vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + orl1 + vhead ', vhead0, vs0), nonullRetRefs(orl0 + phead ' + orl1 + vhead ', vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(orl1, ps0), phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, ¬ dups(orl0 + orl1), ¬ dups(orl0), ¬ dups(orl1), ¬ vhead ∈ orl0, ¬ vhead ∈ orl1, ¬ phead ∈ orl1, ¬ phead ∈ orl0, ¬ node ∈ orl0, ¬ node ∈ orl1, 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), lst = vhead ∨ lst = (phead ' + orl1).last ∧ vs0[vhead].deqID = None ∧ vs0[vhead].next = null, lst ∈ orl0 ∨ lst = phead ∨ lst ∈ orl1 ∨ lst = vhead, orl0.last = vhead0 ∧ unmarkedp(orl1, vs0) ∧ vs0[vhead].deqID = None ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl1, vs0) ∧ vs0[vhead].deqID = None ⊦ ps0[lst].next = (phead ' + orl1).last ∧ vs0[vhead].deqID = None ∧ vs0[vhead].next = null

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 42

Additional information

Proof step 26 from proof step-E15-E4 (previous step) (back to tree)

ps0[vhead].deqID = None, ps0[phead].deqID = None, vs0[lst].next = ps0[lst].next, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, lst = vhead, owns0(node) = Some(tid), ps0[lst].next ≠ null, ps0[lst].next ≠ vhead, node ≠ null, node ≠ phead, node ≠ vhead, orl0 ≠ [], phead ≠ vhead, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + phead ' + orl1 + vhead ', vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + orl1 + vhead ', vhead0, vs0), nonullRetRefs(orl0 + phead ' + orl1 + vhead ', vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(orl1, ps0), phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(orl0 + orl1), ¬ dups(orl0), ¬ dups(orl1), ¬ vhead ∈ orl0, ¬ vhead ∈ orl1, ¬ phead ∈ orl1, ¬ phead ∈ orl0, ¬ node ∈ orl0, ¬ node ∈ orl1, 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), orl0.last = vhead0 ∧ unmarkedp(orl1, vs0) ∧ vs0[vhead].deqID = None ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl1, vs0) ∧ vs0[vhead].deqID = None, lst ∈ orl0 ∨ lst = phead ∨ lst ∈ orl1 ∨ lst = vhead ⊦ ps0[lst].next = (phead ' + orl1).last ∧ vs0[vhead].deqID = None ∧ vs0[vhead].next = null

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 27 from proof step-E15-E4 (previous step) (back to tree)

ps0[vhead].deqID = None, ps0[phead].deqID = None, vs0[vhead].next = ps0[vhead].next, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), ps0[vhead].next ≠ vhead, ps0[vhead].next ≠ null, node ≠ vhead, node ≠ phead, node ≠ null, orl0 ≠ [], phead ≠ vhead, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + phead ' + orl1 + vhead ', vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + orl1 + vhead ', vhead0, vs0), nonullRetRefs(orl0 + phead ' + orl1 + vhead ', vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(orl1, ps0), phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(orl1), ¬ dups(orl0), ¬ dups(orl0 + orl1), ¬ node ∈ orl1, ¬ node ∈ orl0, ¬ phead ∈ orl0, ¬ phead ∈ orl1, ¬ vhead ∈ orl1, ¬ vhead ∈ 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), orl0.last = vhead0 ∧ unmarkedp(orl1, vs0) ∧ vs0[vhead].deqID = None ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl1, vs0) ∧ vs0[vhead].deqID = None ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:listp-postfix, seq: ⊦ listp(rl + rl0, vs, ps, owns) → (listp(rl0, vs, ps, owns) ↔ rl0 ≠ []), subst:[ps, rl, owns, rl0, vs] → [ps0, orl0 + phead ' + orl1, owns0, vhead ', vs0]

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ' ≠ []; (s) ⊦ listp(r ', vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = null ∧ ( vs[r].next ≠ null → vs[r].next ∈ vs ∧ vs[r].next ∈ ps ∧ ps[vs[r].next] = vs[vs[r].next] ∧ ps[vs[r].next].deqID = None ∧ ps[vs[r].next].next = null ∧ weak?(owns(vs[r].next))); (s) Used terms: ps0, orl0 + phead ' + orl1, owns0, vhead ', vs0

Proof step 28 from proof step-E15-E4 (previous step) (back to tree)

⊦ listp(rl + rl0, vs, ps, owns) → (listp(rl0, vs, ps, owns) ↔ rl0 ≠ [])

A spec-lemma

Proof step 29 from proof step-E15-E4 (previous step) (back to tree)

ps0[vhead].deqID = None, ps0[phead].deqID = None, vs0[vhead].deqID = None, vs0[lst].next = ps0[lst].next, vs0[vhead].next = null, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, lst = (phead ' + orl1).last, owns0(node) = Some(tid), ps0[lst].next ≠ null, ps0[lst].next ≠ vhead, node ≠ null, node ≠ phead, node ≠ vhead, orl0 ≠ [], phead ≠ vhead, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + phead ' + orl1 + vhead ', vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + orl1 + vhead ', vhead0, vs0), nonullRetRefs(orl0 + phead ' + orl1 + vhead ', vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(orl1, ps0), phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(orl0 + orl1), ¬ dups(orl0), ¬ dups(orl1), ¬ vhead ∈ orl0, ¬ vhead ∈ orl1, ¬ phead ∈ orl1, ¬ phead ∈ orl0, ¬ node ∈ orl0, ¬ node ∈ orl1, 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), orl0.last = vhead0 ∧ unmarkedp(orl1, vs0) ∧ vs0[vhead].deqID = None ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl1, vs0) ∧ vs0[vhead].deqID = None, lst ∈ orl0 ∨ lst = phead ∨ lst ∈ orl1 ∨ lst = vhead ⊦ ps0[lst].next = (phead ' + orl1).last ∧ vs0[vhead].deqID = None ∧ vs0[vhead].next = null

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 30 from proof step-E15-E4 (previous step) (back to tree)

vs0[vhead].deqID = None, ps0[phead].deqID = None, ps0[vhead].deqID = None, vs0[vhead].next = null, vs0[(phead ' + orl1).last].next = ps0[(phead ' + orl1).last].next, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), ps0[(phead ' + orl1).last].next ≠ null, ps0[(phead ' + orl1).last].next ≠ vhead, ps0[(phead ' + orl1).last].next ≠ (phead ' + orl1).last, node ≠ null, node ≠ phead, node ≠ vhead, orl0 ≠ [], phead ≠ vhead, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + phead ' + orl1 + vhead ', vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + orl1 + vhead ', vhead0, vs0), nonullRetRefs(orl0 + phead ' + orl1 + vhead ', vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(orl1, ps0), phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, ¬ dups(orl0 + orl1), ¬ dups(orl0), ¬ dups(orl1), ¬ vhead ∈ orl0, ¬ vhead ∈ orl1, ¬ phead ∈ orl1, ¬ phead ∈ orl0, ¬ node ∈ orl0, ¬ node ∈ orl1, 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), (phead ' + orl1).last ∈ orl0 ∨ (phead ' + orl1).last = phead ∨ (phead ' + orl1).last ∈ orl1 ∨ (phead ' + orl1).last = vhead, orl0.last = vhead0 ∧ unmarkedp(orl1, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl1, vs0) ⊦

Heuristic use patterns 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] → [phead ', orl1], <all paths>

Additional information

Used terms: phead ', orl1

Proof step 31 from proof step-E15-E4 (previous step) (back to tree)

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

A spec-lemma

Proof step 32 from proof step-E15-E4 (previous step) (back to tree)

ps0[vhead].deqID = None, ps0[phead].deqID = None, vs0[vhead].deqID = None, vs0[(phead ' + orl1).last].next = ps0[(phead ' + orl1).last].next, vs0[vhead].next = null, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, orl1 = [], owns0(node) = Some(tid), ps0[(phead ' + orl1).last].next ≠ null, ps0[(phead ' + orl1).last].next ≠ vhead, ps0[(phead ' + orl1).last].next ≠ (phead ' + orl1).last, node ≠ null, node ≠ phead, node ≠ vhead, orl0 ≠ [], phead ≠ vhead, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + phead ' + orl1 + vhead ', vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + orl1 + vhead ', vhead0, vs0), nonullRetRefs(orl0 + phead ' + orl1 + vhead ', vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(orl1, ps0), phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(orl0 + orl1), ¬ dups(orl0), ¬ dups(orl1), ¬ vhead ∈ orl0, ¬ vhead ∈ orl1, ¬ phead ∈ orl1, ¬ phead ∈ orl0, ¬ node ∈ orl0, ¬ node ∈ orl1, 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), orl0.last = vhead0 ∧ unmarkedp(orl1, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl1, vs0), (phead ' + orl1).last ∈ orl0 ∨ (phead ' + orl1).last = phead ∨ (phead ' + orl1).last ∈ orl1 ∨ (phead ' + orl1).last = vhead ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 33 from proof step-E15-E4 (previous step) (back to tree)

vs0[vhead].deqID = None, ps0[phead].deqID = None, ps0[vhead].deqID = None, vs0[vhead].next = null, vs0[phead].next = ps0[phead].next, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), ps0[phead].next ≠ null, ps0[phead].next ≠ vhead, ps0[phead].next ≠ phead, node ≠ null, node ≠ phead, node ≠ vhead, orl0 ≠ [], phead ≠ vhead, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + phead ' + vhead ', vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + vhead ', vhead0, vs0), nonullRetRefs(orl0 + phead ' + vhead ', vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, ¬ dups(orl0), ¬ vhead ∈ orl0, ¬ phead ∈ orl0, ¬ node ∈ 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), orl0.last = vhead0 ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ⊦

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, node0, orl]

Additional information

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

Proof step 34 from proof step-E15-E4 (previous step) (back to tree)

ps0[vhead].deqID = None, ps0[phead].deqID = None, vs0[vhead].deqID = None, vs0[phead].next = ps0[phead].next, vs0[vhead].next = null, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, orl0 = orl + node0 ', owns0(node) = Some(tid), ps0[phead].next ≠ null, ps0[phead].next ≠ vhead, ps0[phead].next ≠ phead, node ≠ null, node ≠ phead, node ≠ vhead, orl0 ≠ [], phead ≠ vhead, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + phead ' + vhead ', vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + vhead ', vhead0, vs0), nonullRetRefs(orl0 + phead ' + vhead ', vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(orl0), ¬ vhead ∈ orl0, ¬ phead ∈ orl0, ¬ node ∈ 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), node0 = vhead0 ∨ orl ≠ [] ∧ orl.last = vhead0 ∧ phead0 ≠ node0 ∧ vs0[phead].deqID = None ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ ⊦ a ∈ 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 35 from proof step-E15-E4 (previous step) (back to tree)

ps0[vhead].deqID = None, ps0[ps0[node0].next].deqID = None, vs0[vhead].deqID = None, vs0[ps0[node0].next].next = ps0[ps0[node0].next].next, vs0[vhead].next = null, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), ps0[node0].next ≠ node0, ps0[node0].next ≠ vhead, ps0[ps0[node0].next].next ≠ ps0[node0].next, ps0[ps0[node0].next].next ≠ vhead, ps0[ps0[node0].next].next ≠ null, node ≠ node0, node ≠ vhead, node ≠ ps0[node0].next, node ≠ null, vhead ≠ node0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp((orl + node0 ') + ps0[node0].next ' + vhead ', vs0, ps0, owns0), markedp(orl, ps0), markedp(orl, vs0), nextnottid(tid, vhead0, vs0), noid(tid, (orl + node0 ') + ps0[node0].next ' + vhead ', vhead0, vs0), nonullRetRefs((orl + node0 ') + ps0[node0].next ' + vhead ', vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(ps0[node0].deqID), some?(vs0[node0].deqID), node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(orl), ¬ node ∈ orl, ¬ ps0[node0].next ∈ orl, ¬ vhead ∈ orl, ¬ node0 ∈ 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), phead0 ∈ orl ∨ phead0 = node0, node0 = vhead0 ∨ orl ≠ [] ∧ orl.last = vhead0 ∧ phead0 ≠ node0 ∧ vs0[ps0[node0].next].deqID = None ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:listp-postfix, seq: ⊦ listp(rl + rl0, vs, ps, owns) → (listp(rl0, vs, ps, owns) ↔ rl0 ≠ []), subst:[ps, rl, owns, rl0, vs] → [ps0, orl, owns0, node0 ' + ps0[node0].next ' + vhead ', vs0]

Additional information

Used simplifier rules: ⊦ a ' + x ≠ []; (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) ⊦ listp(r ' + r0 ', 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 ∧ r0 ≠ null ∧ owns(r0) = None ∧ r0 ∈ vs ∧ r0 ∈ ps ∧ ¬ weak?(vs[r0].deqID) ∧ (ps[r0].deqID = vs[r0].deqID ∨ ps[r0].deqID = None) ∧ ps[r0].val = vs[r0].val ∧ ps[r0].next = null ∧ ( vs[r0].next ≠ null → vs[r0].next ∈ vs ∧ vs[r0].next ∈ ps ∧ ps[vs[r0].next] = vs[vs[r0].next] ∧ ps[vs[r0].next].deqID = None ∧ ps[vs[r0].next].next = null ∧ weak?(owns(vs[r0].next))); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: ps0, orl, owns0, node0 ' + ps0[node0].next ' + vhead ', vs0

Proof step 36 from proof step-E15-E4 (previous step) (back to tree)

⊦ listp(rl + rl0, vs, ps, owns) → (listp(rl0, vs, ps, owns) ↔ rl0 ≠ [])

A spec-lemma

Proof step 37 from proof step-E15-E4 (previous step) (back to tree)

ps0[vhead].deqID = None, ps0[phead].deqID = None, vs0[vhead].deqID = None, vs0[orl1.last].next = ps0[orl1.last].next, vs0[vhead].next = null, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), ps0[orl1.last].next ≠ null, ps0[orl1.last].next ≠ vhead, ps0[orl1.last].next ≠ orl1.last, node ≠ null, node ≠ phead, node ≠ vhead, orl0 ≠ [], orl1 ≠ [], phead ≠ vhead, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + phead ' + orl1 + vhead ', vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + orl1 + vhead ', vhead0, vs0), nonullRetRefs(orl0 + phead ' + orl1 + vhead ', vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(orl1, ps0), phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(orl0 + orl1), ¬ dups(orl0), ¬ dups(orl1), ¬ vhead ∈ orl0, ¬ vhead ∈ orl1, ¬ phead ∈ orl1, ¬ phead ∈ orl0, ¬ node ∈ orl0, ¬ node ∈ orl1, 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), orl0.last = vhead0 ∧ unmarkedp(orl1, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl1, vs0), orl1.last ∈ orl0 ∨ orl1.last = phead ∨ orl1.last ∈ orl1 ∨ orl1.last = vhead ⊦

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 38 from proof step-E15-E4 (previous step) (back to tree)

vs0[vhead].deqID = None, ps0[phead].deqID = None, ps0[vhead].deqID = None, vs0[vhead].next = null, vs0[orl1.last].next = ps0[orl1.last].next, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), ps0[orl1.last].next ≠ null, ps0[orl1.last].next ≠ vhead, ps0[orl1.last].next ≠ orl1.last, node ≠ null, node ≠ phead, node ≠ vhead, orl0 ≠ [], orl1 ≠ [], phead ≠ vhead, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + phead ' + orl1 + vhead ', vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + orl1 + vhead ', vhead0, vs0), nonullRetRefs(orl0 + phead ' + orl1 + vhead ', vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(orl1, ps0), phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, ¬ dups(orl0 + orl1), ¬ dups(orl0), ¬ dups(orl1), ¬ vhead ∈ orl0, ¬ vhead ∈ orl1, ¬ phead ∈ orl1, ¬ phead ∈ orl0, ¬ node ∈ orl0, ¬ node ∈ orl1, 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), orl0.last = vhead0 ∧ unmarkedp(orl1, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl1, vs0) ⊦

Heuristic use patterns 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, node0, orl]

Additional information

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

Proof step 39 from proof step-E15-E4 (previous step) (back to tree)

ps0[vhead].deqID = None, ps0[phead].deqID = None, vs0[vhead].deqID = None, vs0[node0].next = ps0[node0].next, vs0[vhead].next = null, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, orl1 = orl + node0 ', owns0(node) = Some(tid), ps0[node0].next ≠ null, ps0[node0].next ≠ vhead, ps0[node0].next ≠ node0, node ≠ null, node ≠ phead, node ≠ vhead, orl0 ≠ [], orl1 ≠ [], phead ≠ vhead, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + phead ' + orl1 + vhead ', vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + orl1 + vhead ', vhead0, vs0), nonullRetRefs(orl0 + phead ' + orl1 + vhead ', vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(orl1, ps0), phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(orl0 + orl1), ¬ dups(orl0), ¬ dups(orl1), ¬ vhead ∈ orl0, ¬ vhead ∈ orl1, ¬ phead ∈ orl1, ¬ phead ∈ orl0, ¬ node ∈ orl0, ¬ node ∈ orl1, 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), orl0.last = vhead0 ∧ unmarkedp(orl1, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].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: ⊦ ¬ 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 ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ x + a ' ≠ []; (s)

Proof step 40 from proof step-E15-E4 (previous step) (back to tree)

vs0[vhead].deqID = None, ps0[phead].deqID = None, ps0[vhead].deqID = None, ps0[node0].deqID = None, vs0[vhead].next = null, vs0[node0].next = ps0[node0].next, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), ps0[node0].next ≠ null, ps0[node0].next ≠ vhead, ps0[node0].next ≠ node0, node ≠ null, node ≠ phead, node ≠ vhead, node ≠ node0, orl0 ≠ [], phead ≠ vhead, phead ≠ node0, vhead ≠ node0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + phead ' + (orl + node0 ') + vhead ', vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + (orl + node0 ') + vhead ', vhead0, vs0), nonullRetRefs(orl0 + phead ' + (orl + node0 ') + vhead ', vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(orl, ps0), phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, ¬ dups(orl0 + orl), ¬ dups(orl0), ¬ dups(orl), ¬ node0 ∈ orl0, ¬ node0 ∈ orl, ¬ vhead ∈ orl0, ¬ vhead ∈ orl, ¬ phead ∈ orl, ¬ phead ∈ orl0, ¬ node ∈ orl0, ¬ node ∈ 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), orl0.last = vhead0 ∧ unmarkedp(orl, vs0) ∧ vs0[node0].deqID = None ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl, vs0) ∧ vs0[node0].deqID = None ⊦

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

Additional information

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

Proof step 41 from proof step-E15-E4 (previous step) (back to tree)

ps0[node0].deqID = None, ps0[vhead].deqID = None, ps0[phead].deqID = None, vs0[vhead].deqID = None, vs0[node0].next = ps0[node0].next, vs0[vhead].next = null, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, orl0 = orl1 + node1 ', owns0(node) = Some(tid), ps0[node0].next ≠ null, ps0[node0].next ≠ vhead, ps0[node0].next ≠ node0, node ≠ null, node ≠ phead, node ≠ vhead, node ≠ node0, orl0 ≠ [], phead ≠ vhead, phead ≠ node0, vhead ≠ node0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + phead ' + (orl + node0 ') + vhead ', vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + (orl + node0 ') + vhead ', vhead0, vs0), nonullRetRefs(orl0 + phead ' + (orl + node0 ') + vhead ', vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(orl, ps0), phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(orl0 + orl), ¬ dups(orl0), ¬ dups(orl), ¬ node0 ∈ orl0, ¬ node0 ∈ orl, ¬ vhead ∈ orl0, ¬ vhead ∈ orl, ¬ phead ∈ orl, ¬ phead ∈ orl0, ¬ node ∈ orl0, ¬ node ∈ 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), node1 = vhead0 ∧ unmarkedp(orl, vs0) ∧ vs0[node0].deqID = None ∨ orl1 ≠ [] ∧ orl1.last = vhead0 ∧ phead0 ≠ node1 ∧ vs0[phead].deqID = None ∧ unmarkedp(orl, vs0) ∧ vs0[node0].deqID = None ⊦

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] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ ⊦ 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 42 from proof step-E15-E4 (previous step) (back to tree)

ps0[node0].deqID = None, ps0[vhead].deqID = None, ps0[ps0[node1].next].deqID = None, vs0[vhead].deqID = None, vs0[node0].next = ps0[node0].next, vs0[vhead].next = null, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), ps0[node1].next ≠ node1, ps0[node1].next ≠ node0, ps0[node1].next ≠ vhead, ps0[node0].next ≠ node0, ps0[node0].next ≠ vhead, ps0[node0].next ≠ null, node ≠ node1, node ≠ node0, node ≠ vhead, node ≠ ps0[node1].next, node ≠ null, node0 ≠ node1, vhead ≠ node1, vhead ≠ node0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp((orl1 + node1 ') + ps0[node1].next ' + (orl + node0 ') + vhead ', vs0, ps0, owns0), markedp(orl1, ps0), markedp(orl1, vs0), nextnottid(tid, vhead0, vs0), noid(tid, (orl1 + node1 ') + ps0[node1].next ' + (orl + node0 ') + vhead ', vhead0, vs0), nonullRetRefs((orl1 + node1 ') + ps0[node1].next ' + (orl + node0 ') + vhead ', vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(ps0[node1].deqID), some?(vs0[node1].deqID), unmarkedp(orl, ps0), node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(orl), ¬ dups(orl1), ¬ dups(orl1 + orl), ¬ node ∈ orl1, ¬ ps0[node1].next ∈ orl1, ¬ ps0[node1].next ∈ orl, ¬ vhead ∈ orl, ¬ vhead ∈ orl1, ¬ node0 ∈ orl, ¬ node0 ∈ orl1, ¬ node1 ∈ orl, ¬ node1 ∈ orl1, ¬ node ∈ 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), phead0 ∈ orl1 ∨ phead0 = node1, node1 = vhead0 ∧ unmarkedp(orl, vs0) ∧ vs0[node0].deqID = None ∨ orl1 ≠ [] ∧ orl1.last = vhead0 ∧ phead0 ≠ node1 ∧ vs0[ps0[node1].next].deqID = None ∧ unmarkedp(orl, vs0) ∧ vs0[node0].deqID = None ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:listp-postfix, seq: ⊦ listp(rl + rl0, vs, ps, owns) → (listp(rl0, vs, ps, owns) ↔ rl0 ≠ []), subst:[ps, rl, owns, rl0, vs] → [ps0, orl1 + node1 ' + ps0[node1].next ' + orl, owns0, node0 ' + vhead ', vs0]

Additional information

Used simplifier rules: ⊦ a ' + x ≠ []; (s) ⊦ listp(r ' + r0 ', 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 ∧ r0 ≠ null ∧ owns(r0) = None ∧ r0 ∈ vs ∧ r0 ∈ ps ∧ ¬ weak?(vs[r0].deqID) ∧ (ps[r0].deqID = vs[r0].deqID ∨ ps[r0].deqID = None) ∧ ps[r0].val = vs[r0].val ∧ ps[r0].next = null ∧ ( vs[r0].next ≠ null → vs[r0].next ∈ vs ∧ vs[r0].next ∈ ps ∧ ps[vs[r0].next] = vs[vs[r0].next] ∧ ps[vs[r0].next].deqID = None ∧ ps[vs[r0].next].next = null ∧ weak?(owns(vs[r0].next))); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: ps0, orl1 + node1 ' + ps0[node1].next ' + orl, owns0, node0 ' + vhead ', vs0

Proof step 43 from proof step-E15-E4 (previous step) (back to tree)

⊦ listp(rl + rl0, vs, ps, owns) → (listp(rl0, vs, ps, owns) ↔ rl0 ≠ [])

A spec-lemma

Proof Tree for step-E15-E4 (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