| ⊦ pre(gs, ls, pc, doDeqEmpty(tid)) ↔ pc = D14 ∧ ls.tid = tid |
¬(pre(gs, ls, pc, doDeqEmpty(tid)) ↔ pc = D14 ∧ ls.tid = tid) ⊦
| ¬(pre(gs, ls, pc, doDeqEmpty(tid)) ↔ pc = D14 ∧ ls.tid = tid) ⊦ |
pre(gs, ls, pc, doDeqEmpty(tid)) ⊦ pc = D14 ∧ ls.tid = tid
Used simplifier rules: ⊦ pre(gs, ls, D14, a) ↔ a = doDeqEmpty(ls.tid); (s)
| pre(gs, ls, pc, doDeqEmpty(tid)) ⊦ pc = D14 ∧ ls.tid = tid |
ls = mkls(tid0, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid1, addr), pre(gs, ls, pc, doDeqEmpty(tid)) ⊦ pc = D14 ∧ tid0 = tid
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, tid0, lst, first, rvref, othertid, success, optval
| ls = mkls(tid0, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid1, addr), pre(gs, ls, pc, doDeqEmpty(tid)) ⊦ pc = D14 ∧ tid0 = tid |
pre(gs, mkls(tid0, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid1, addr), pc, doDeqEmpty(tid)) ⊦ pc = D14 ∧ tid0 = tid
| pre(gs, mkls(tid0, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid1, addr), pc, doDeqEmpty(tid)) ⊦ pc = D14 ∧ tid0 = tid |
pc = D9, pre(gs, mkls(tid0, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid1, addr), pc, doDeqEmpty(tid)) ⊦ pc = D14 ∧ tid0 = tid
pc = D16, pre(gs, mkls(tid0, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid1, addr), pc, doDeqEmpty(tid)) ⊦ pc = D14 ∧ tid0 = tid
pc = D21, pre(gs, mkls(tid0, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid1, addr), pc, doDeqEmpty(tid)) ⊦ pc = D14 ∧ tid0 = tid
pc = D28, pre(gs, mkls(tid0, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid1, addr), pc, doDeqEmpty(tid)) ⊦ pc = D14 ∧ tid0 = tid
pc = E11, pre(gs, mkls(tid0, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid1, addr), pc, doDeqEmpty(tid)) ⊦ pc = D14 ∧ tid0 = tid
pc = E14, pre(gs, mkls(tid0, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid1, addr), pc, doDeqEmpty(tid)) ⊦ pc = D14 ∧ tid0 = tid
Used simplifier rules: DMSQPC freely generated by D1, D2, D3, D4, D5, D6, D7, D8, D9, D10, D11, D12, D13, D14, D15, D16, D17, D18, D19, D20, D21, D22, D23, D24, D25, D26, D27, D28, D29, D30, D31, D32, D33, D34, E1, E2, E3, E4, E5, E6, E7, E8, E9, E10, E11, E12, E13, E14, E15, E16, E17, crashed, idle, ready ;; ⊦ pre(gs, ls, ready, a) ↔ (∃ value0. a = invENQ(ls.tid, value0)) ∨ a = invDEQ(ls.tid); (s) ⊦ doDeqEmpty(tid) ≠ invENQ(tid0, invENQvalue); (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ doDeqEmpty(tid) ≠ invDEQ(tid0); (s) ⊦ pre(gs, ls, idle, a) ↔ a = callRUN(ls.tid); (s) ⊦ callRUN(tid) ≠ doDeqEmpty(tid0); (s) ⊦ pre(gs, ls, crashed, a) ↔ false; (s) ⊦ pre(gs, ls, E17, a) ↔ a = retENQ(ls.tid); (s) ⊦ doDeqEmpty(tid) ≠ retENQ(tid0); (s) ⊦ pre(gs, ls, E16, a) ↔ a = τ; (s) ⊦ doDeqEmpty(tid) ≠ τ; (s) ⊦ pre(gs, ls, E15, a) ↔ a = τ; (s) ⊦ pre(gs, ls, E13, a) ↔ a = τ; (s) ⊦ pre(gs, ls, E12, a) ↔ a = τ; (s) ⊦ pre(gs, ls, E10, a) ↔ a = τ; (s) ⊦ pre(gs, ls, E9, a) ↔ a = τ; (s) ⊦ pre(gs, ls, E8, a) ↔ a = τ; (s) ⊦ pre(gs, ls, E7, a) ↔ a = τ; (s) ⊦ pre(gs, ls, E6, a) ↔ a = τ; (s) ⊦ pre(gs, ls, E5, a) ↔ a = τ; (s) ⊦ pre(gs, ls, E4, a) ↔ a = τ; (s) ⊦ pre(gs, ls, E3, a) ↔ a = τ; (s) ⊦ pre(gs, ls, E2, a) ↔ a = τ; (s) ⊦ pre(gs, ls, E1, a) ↔ (∃ node0, nd0, success0. ( ¬ node0 ∈ gs.vs ∧ ¬ node0 ∈ gs.ps ∧ node0 ≠ null ∧ (success0 ↔ false)) ∧ a = chooseE1(node0, nd0, success0)) ∨ a = τ ∧ ¬ (∃ node0, nd0, success0. ¬ node0 ∈ gs.vs ∧ ¬ node0 ∈ gs.ps ∧ node0 ≠ null ∧ (success0 ↔ false)); (s) ⊦ chooseE1(node, nd, success) ≠ doDeqEmpty(tid); (s) ⊦ pre(gs, ls, D34, a) ↔ a = retDEQ(ls.tid, ls.optval); (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .optval = optval; (s) ⊦ doDeqEmpty(tid) ≠ retDEQ(tid0, optval); (s) ⊦ pre(gs, ls, D33, a) ↔ a = τ; (s) ⊦ pre(gs, ls, D32, a) ↔ a = τ; (s) ⊦ pre(gs, ls, D31, a) ↔ a = τ; (s) ⊦ pre(gs, ls, D30, a) ↔ a = τ; (s) ⊦ pre(gs, ls, D29, a) ↔ a = τ; (s) ⊦ pre(gs, ls, D27, a) ↔ a = τ; (s) ⊦ pre(gs, ls, D26, a) ↔ a = τ; (s) ⊦ pre(gs, ls, D25, a) ↔ a = τ; (s) ⊦ pre(gs, ls, D24, a) ↔ a = τ; (s) ⊦ pre(gs, ls, D23, a) ↔ a = τ; (s) ⊦ pre(gs, ls, D22, a) ↔ a = τ; (s) ⊦ pre(gs, ls, D20, a) ↔ a = τ; (s) ⊦ pre(gs, ls, D19, a) ↔ a = τ; (s) ⊦ pre(gs, ls, D18, a) ↔ a = τ; (s) ⊦ pre(gs, ls, D17, a) ↔ a = τ; (s) ⊦ pre(gs, ls, D15, a) ↔ a = τ; (s) ⊦ pre(gs, ls, D14, a) ↔ a = doDeqEmpty(ls.tid); (s) ⊦ doDeqEmpty(tid) = doDeqEmpty(tid0) ↔ tid = tid0; (s) ⊦ pre(gs, ls, D13, a) ↔ a = τ; (s) ⊦ pre(gs, ls, D12, a) ↔ a = τ; (s) ⊦ pre(gs, ls, D11, a) ↔ a = τ; (s) ⊦ pre(gs, ls, D10, a) ↔ a = τ; (s) ⊦ pre(gs, ls, D8, a) ↔ a = τ; (s) ⊦ pre(gs, ls, D7, a) ↔ a = τ; (s) ⊦ pre(gs, ls, D6, a) ↔ a = τ; (s) ⊦ pre(gs, ls, D5, a) ↔ a = τ; (s) ⊦ pre(gs, ls, D4, a) ↔ a = τ; (s) ⊦ pre(gs, ls, D3, a) ↔ a = τ; (s) ⊦ pre(gs, ls, D2, a) ↔ (∃ rvref0, optval00. (¬ rvref0 ∈ gs.vrvHp ∧ ¬ rvref0 ∈ gs.prvHp ∧ rvref0 ≠ null) ∧ a = chooseD2(rvref0, optval00)) ∨ a = τ ∧ ¬ (∃ rvref0, optval00. ¬ rvref0 ∈ gs.vrvHp ∧ ¬ rvref0 ∈ gs.prvHp ∧ rvref0 ≠ null); (s) ⊦ chooseD2(rvref, optval) ≠ doDeqEmpty(tid); (s) ⊦ pre(gs, ls, D1, a) ↔ a = τ; (s)
| pc = D9, pre(gs, mkls(tid0, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid1, addr), pc, doDeqEmpty(tid)) ⊦ pc = D14 ∧ tid0 = tid |
doDeqEmpty(tid) = (gs.qrl = [] ⊃ checkEmp(tid0);τ) ⊦
Used simplifier rules: ⊦ D9 ≠ D14; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ pre(gs, ls, D9, a) ↔ a = (gs.qrl = [] ⊃ checkEmp(ls.tid);τ); (s)
| doDeqEmpty(tid) = (gs.qrl = [] ⊃ checkEmp(tid0);τ) ⊦ |
doDeqEmpty(tid) = (qrl = [] ⊃ checkEmp(tid0);τ), gs = mkgs(ps, vs, phead, vhead, vhead0, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ⊦
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
| doDeqEmpty(tid) = (qrl = [] ⊃ checkEmp(tid0);τ), gs = mkgs(ps, vs, phead, vhead, vhead0, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ⊦ |
doDeqEmpty(tid) = (qrl = [] ⊃ checkEmp(tid0);τ) ⊦
| doDeqEmpty(tid) = (qrl = [] ⊃ checkEmp(tid0);τ) ⊦ |
Used simplifier rules: ⊦ doDeqEmpty(tid) ≠ τ; (s) ⊦ checkEmp(tid) ≠ doDeqEmpty(tid0); (s)
| pc = D16, pre(gs, mkls(tid0, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid1, addr), pc, doDeqEmpty(tid)) ⊦ pc = D14 ∧ tid0 = tid |
doDeqEmpty(tid) = (vhead0 = (gs.orl + gs.qrl).last ⊃ doEnq(gs.owns(vhead1).tid);τ) ⊦
Used simplifier rules: ⊦ D14 ≠ D16; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .nxt = node1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ pre(gs, ls, D16, a) ↔ a = (ls.lst = (gs.orl + gs.qrl).last ⊃ doEnq(gs.owns(ls.nxt).tid);τ); (s)
| doDeqEmpty(tid) = (vhead0 = (gs.orl + gs.qrl).last ⊃ doEnq(gs.owns(vhead1).tid);τ) ⊦ |
doDeqEmpty(tid) = (vhead0 = (orl + qrl).last ⊃ doEnq(owns(vhead1).tid);τ), gs = mkgs(ps, vs, phead, vhead, vhead2, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ⊦
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
| doDeqEmpty(tid) = (vhead0 = (orl + qrl).last ⊃ doEnq(owns(vhead1).tid);τ), gs = mkgs(ps, vs, phead, vhead, vhead2, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ⊦ |
doDeqEmpty(tid) = (vhead0 = (orl + qrl).last ⊃ doEnq(owns(vhead1).tid);τ) ⊦
| doDeqEmpty(tid) = (vhead0 = (orl + qrl).last ⊃ doEnq(owns(vhead1).tid);τ) ⊦ |
Used simplifier rules: ⊦ doDeqEmpty(tid) ≠ τ; (s) ⊦ doDeqEmpty(tid) ≠ doEnq(tid0); (s)
| pc = D21, pre(gs, mkls(tid0, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid1, addr), pc, doDeqEmpty(tid)) ⊦ pc = D14 ∧ tid0 = tid |
doDeqEmpty(tid) = (gs.ps[vhead1].deqID = None ⊃ doDeq(tid0);τ) ⊦
Used simplifier rules: ⊦ D14 ≠ D21; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .nxt = node1; (s) ⊦ pre(gs, ls, D21, a) ↔ a = (gs.ps[ls.nxt].deqID = None ⊃ doDeq(ls.tid);τ); (s)
| doDeqEmpty(tid) = (gs.ps[vhead1].deqID = None ⊃ doDeq(tid0);τ) ⊦ |
doDeqEmpty(tid) = (ps[vhead1].deqID = None ⊃ doDeq(tid0);τ), gs = mkgs(ps, vs, phead, vhead, vhead0, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ⊦
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
| doDeqEmpty(tid) = (ps[vhead1].deqID = None ⊃ doDeq(tid0);τ), gs = mkgs(ps, vs, phead, vhead, vhead0, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ⊦ |
doDeqEmpty(tid) = (ps[vhead1].deqID = None ⊃ doDeq(tid0);τ) ⊦
| doDeqEmpty(tid) = (ps[vhead1].deqID = None ⊃ doDeq(tid0);τ) ⊦ |
Used simplifier rules: ⊦ doDeqEmpty(tid) ≠ τ; (s) ⊦ doDeq(tid) ≠ doDeqEmpty(tid0); (s)
| pc = D28, pre(gs, mkls(tid0, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid1, addr), pc, doDeqEmpty(tid)) ⊦ pc = D14 ∧ tid0 = tid |
doDeqEmpty(tid) = (gs.ps[vhead1].deqID = None ⊃ doDeq(tid1);τ) ⊦
Used simplifier rules: ⊦ D14 ≠ D28; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .othertid = tid0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .nxt = node1; (s) ⊦ pre(gs, ls, D28, a) ↔ a = (gs.ps[ls.nxt].deqID = None ⊃ doDeq(ls.othertid);τ); (s)
| doDeqEmpty(tid) = (gs.ps[vhead1].deqID = None ⊃ doDeq(tid1);τ) ⊦ |
doDeqEmpty(tid) = (ps[vhead1].deqID = None ⊃ doDeq(tid1);τ), gs = mkgs(ps, vs, phead, vhead, vhead0, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ⊦
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
| doDeqEmpty(tid) = (ps[vhead1].deqID = None ⊃ doDeq(tid1);τ), gs = mkgs(ps, vs, phead, vhead, vhead0, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ⊦ |
doDeqEmpty(tid) = (ps[vhead1].deqID = None ⊃ doDeq(tid1);τ) ⊦
| doDeqEmpty(tid) = (ps[vhead1].deqID = None ⊃ doDeq(tid1);τ) ⊦ |
Used simplifier rules: ⊦ doDeqEmpty(tid) ≠ τ; (s) ⊦ doDeq(tid) ≠ doDeqEmpty(tid0); (s)
| pc = E11, pre(gs, mkls(tid0, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid1, addr), pc, doDeqEmpty(tid)) ⊦ pc = D14 ∧ tid0 = tid |
doDeqEmpty(tid) = (gs.ps[vhead0].next ≠ gs.vs[vhead0].next ⊃ doEnq(tid0);τ) ⊦
Used simplifier rules: ⊦ D14 ≠ E11; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ pre(gs, ls, E11, a) ↔ a = (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ doEnq(ls.tid);τ); (s)
| doDeqEmpty(tid) = (gs.ps[vhead0].next ≠ gs.vs[vhead0].next ⊃ doEnq(tid0);τ) ⊦ |
doDeqEmpty(tid) = (ps[vhead0].next ≠ vs[vhead0].next ⊃ doEnq(tid0);τ), gs = mkgs(ps, vs, phead, vhead, vhead1, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ⊦
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
| doDeqEmpty(tid) = (ps[vhead0].next ≠ vs[vhead0].next ⊃ doEnq(tid0);τ), gs = mkgs(ps, vs, phead, vhead, vhead1, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ⊦ |
doDeqEmpty(tid) = (ps[vhead0].next ≠ vs[vhead0].next ⊃ doEnq(tid0);τ) ⊦
| doDeqEmpty(tid) = (ps[vhead0].next ≠ vs[vhead0].next ⊃ doEnq(tid0);τ) ⊦ |
Used simplifier rules: ⊦ doDeqEmpty(tid) ≠ τ; (s) ⊦ doDeqEmpty(tid) ≠ doEnq(tid0); (s)
| pc = E14, pre(gs, mkls(tid0, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid1, addr), pc, doDeqEmpty(tid)) ⊦ pc = D14 ∧ tid0 = tid |
doDeqEmpty(tid) = (vhead0 = (gs.orl + gs.qrl).last ⊃ doEnq(gs.owns(vhead1).tid);τ) ⊦
Used simplifier rules: ⊦ D14 ≠ E14; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .nxt = node1; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ pre(gs, ls, E14, a) ↔ a = (ls.lst = (gs.orl + gs.qrl).last ⊃ doEnq(gs.owns(ls.nxt).tid);τ); (s)
| doDeqEmpty(tid) = (vhead0 = (gs.orl + gs.qrl).last ⊃ doEnq(gs.owns(vhead1).tid);τ) ⊦ |
doDeqEmpty(tid) = (vhead0 = (orl + qrl).last ⊃ doEnq(owns(vhead1).tid);τ), gs = mkgs(ps, vs, phead, vhead, vhead2, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ⊦
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
| doDeqEmpty(tid) = (vhead0 = (orl + qrl).last ⊃ doEnq(owns(vhead1).tid);τ), gs = mkgs(ps, vs, phead, vhead, vhead2, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ⊦ |
doDeqEmpty(tid) = (vhead0 = (orl + qrl).last ⊃ doEnq(owns(vhead1).tid);τ) ⊦
| doDeqEmpty(tid) = (vhead0 = (orl + qrl).last ⊃ doEnq(owns(vhead1).tid);τ) ⊦ |
Used simplifier rules: ⊦ doDeqEmpty(tid) ≠ τ; (s) ⊦ doDeqEmpty(tid) ≠ doEnq(tid0); (s)
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.