[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 pre-retENQ (conclusion) (back to tree)

⊦ pre(gs, ls, pc, retENQ(tid)) ↔ pc = E17 ∧ ls.tid = tid

System applied rule normalize

And obtained the following new goals

Rule argument

Additional information

Proof step 2 from proof pre-retENQ (previous step) (back to tree)

¬(pre(gs, ls, pc, retENQ(tid)) ↔ pc = E17 ∧ ls.tid = tid) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ pre(gs, ls, E17, a) ↔ a = retENQ(ls.tid); (s)

Proof step 3 from proof pre-retENQ (previous step) (back to tree)

pre(gs, ls, pc, retENQ(tid)) ⊦ pc = E17 ∧ ls.tid = tid

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] → [val, vhead1, optval0, vhead, nd, ls, addr, tid0, vhead0, vhead2, rvref, tid1, obsEmpty, 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, tid0, lst, first, rvref, othertid, success, optval

Proof step 4 from proof pre-retENQ (previous step) (back to tree)

ls = mkls(tid0, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid1, addr), pre(gs, ls, pc, retENQ(tid)) ⊦ pc = E17 ∧ tid0 = tid

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 5 from proof pre-retENQ (previous step) (back to tree)

pre(gs, mkls(tid0, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid1, addr), pc, retENQ(tid)) ⊦ pc = E17 ∧ tid0 = tid

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: pc

Additional information

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) ⊦ invENQ(tid, invENQvalue) ≠ retENQ(tid0); (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ invDEQ(tid) ≠ retENQ(tid0); (s) ⊦ pre(gs, ls, idle, a) ↔ a = callRUN(ls.tid); (s) ⊦ callRUN(tid) ≠ retENQ(tid0); (s) ⊦ pre(gs, ls, crashed, a) ↔ false; (s) ⊦ pre(gs, ls, E17, a) ↔ a = retENQ(ls.tid); (s) ⊦ retENQ(tid) = retENQ(tid0) ↔ tid = tid0; (s) ⊦ pre(gs, ls, E16, a) ↔ a = τ; (s) ⊦ retENQ(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) ≠ retENQ(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) ⊦ retDEQ(tid, optval) ≠ retENQ(tid0); (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) ≠ retENQ(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) ≠ retENQ(tid); (s) ⊦ pre(gs, ls, D1, a) ↔ a = τ; (s)

Proof step 6 from proof pre-retENQ (previous step) (back to tree)

pc = D9, pre(gs, mkls(tid0, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid1, addr), pc, retENQ(tid)) ⊦ pc = E17 ∧ tid0 = tid

User applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ D9 ≠ E17; (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)

Proof step 7 from proof pre-retENQ (previous step) (back to tree)

retENQ(tid) = (gs.qrl = [] ⊃ checkEmp(tid0);τ) ⊦

User 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, vhead0, 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 8 from proof pre-retENQ (previous step) (back to tree)

gs = mkgs(ps, vs, phead, vhead, vhead0, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), retENQ(tid) = (qrl = [] ⊃ checkEmp(tid0);τ) ⊦

User applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 9 from proof pre-retENQ (previous step) (back to tree)

retENQ(tid) = (qrl = [] ⊃ checkEmp(tid0);τ) ⊦

User applied rule case distinction

And closed the goal!

Rule argument

pos: left 1

Additional information

Used simplifier rules: ⊦ retENQ(tid) ≠ τ; (s) ⊦ checkEmp(tid) ≠ retENQ(tid0); (s)

Proof step 10 from proof pre-retENQ (previous step) (back to tree)

pc = D16, pre(gs, mkls(tid0, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid1, addr), pc, retENQ(tid)) ⊦ pc = E17 ∧ tid0 = tid

User applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ D16 ≠ E17; (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)

Proof step 11 from proof pre-retENQ (previous step) (back to tree)

retENQ(tid) = (vhead0 = (gs.orl + gs.qrl).last ⊃ doEnq(gs.owns(vhead1).tid);τ) ⊦

User 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, vhead2, 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 12 from proof pre-retENQ (previous step) (back to tree)

gs = mkgs(ps, vs, phead, vhead, vhead2, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), retENQ(tid) = (vhead0 = (orl + qrl).last ⊃ doEnq(owns(vhead1).tid);τ) ⊦

User applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 13 from proof pre-retENQ (previous step) (back to tree)

retENQ(tid) = (vhead0 = (orl + qrl).last ⊃ doEnq(owns(vhead1).tid);τ) ⊦

User applied rule case distinction

And closed the goal!

Rule argument

pos: left 1

Additional information

Used simplifier rules: ⊦ retENQ(tid) ≠ τ; (s) ⊦ doEnq(tid) ≠ retENQ(tid0); (s)

Proof step 14 from proof pre-retENQ (previous step) (back to tree)

pc = D21, pre(gs, mkls(tid0, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid1, addr), pc, retENQ(tid)) ⊦ pc = E17 ∧ tid0 = tid

User applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ D21 ≠ E17; (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)

Proof step 15 from proof pre-retENQ (previous step) (back to tree)

retENQ(tid) = (gs.ps[vhead1].deqID = None ⊃ doDeq(tid0);τ) ⊦

User 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, vhead0, 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 16 from proof pre-retENQ (previous step) (back to tree)

gs = mkgs(ps, vs, phead, vhead, vhead0, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), retENQ(tid) = (ps[vhead1].deqID = None ⊃ doDeq(tid0);τ) ⊦

User applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 17 from proof pre-retENQ (previous step) (back to tree)

retENQ(tid) = (ps[vhead1].deqID = None ⊃ doDeq(tid0);τ) ⊦

User applied rule case distinction

And closed the goal!

Rule argument

pos: left 1

Additional information

Used simplifier rules: ⊦ retENQ(tid) ≠ τ; (s) ⊦ doDeq(tid) ≠ retENQ(tid0); (s)

Proof step 18 from proof pre-retENQ (previous step) (back to tree)

pc = D28, pre(gs, mkls(tid0, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid1, addr), pc, retENQ(tid)) ⊦ pc = E17 ∧ tid0 = tid

User applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ D28 ≠ E17; (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)

Proof step 19 from proof pre-retENQ (previous step) (back to tree)

retENQ(tid) = (gs.ps[vhead1].deqID = None ⊃ doDeq(tid1);τ) ⊦

User 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, vhead0, 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 20 from proof pre-retENQ (previous step) (back to tree)

gs = mkgs(ps, vs, phead, vhead, vhead0, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), retENQ(tid) = (ps[vhead1].deqID = None ⊃ doDeq(tid1);τ) ⊦

User applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 21 from proof pre-retENQ (previous step) (back to tree)

retENQ(tid) = (ps[vhead1].deqID = None ⊃ doDeq(tid1);τ) ⊦

User applied rule case distinction

And closed the goal!

Rule argument

pos: left 1

Additional information

Used simplifier rules: ⊦ retENQ(tid) ≠ τ; (s) ⊦ doDeq(tid) ≠ retENQ(tid0); (s)

Proof step 22 from proof pre-retENQ (previous step) (back to tree)

pc = E11, pre(gs, mkls(tid0, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid1, addr), pc, retENQ(tid)) ⊦ pc = E17 ∧ tid0 = tid

User applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ E11 ≠ E17; (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)

Proof step 23 from proof pre-retENQ (previous step) (back to tree)

retENQ(tid) = (gs.ps[vhead0].next ≠ gs.vs[vhead0].next ⊃ doEnq(tid0);τ) ⊦

User 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, vhead1, 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 24 from proof pre-retENQ (previous step) (back to tree)

gs = mkgs(ps, vs, phead, vhead, vhead1, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), retENQ(tid) = (ps[vhead0].next ≠ vs[vhead0].next ⊃ doEnq(tid0);τ) ⊦

User applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 25 from proof pre-retENQ (previous step) (back to tree)

retENQ(tid) = (ps[vhead0].next ≠ vs[vhead0].next ⊃ doEnq(tid0);τ) ⊦

User applied rule case distinction

And closed the goal!

Rule argument

pos: left 1

Additional information

Used simplifier rules: ⊦ retENQ(tid) ≠ τ; (s) ⊦ doEnq(tid) ≠ retENQ(tid0); (s)

Proof step 26 from proof pre-retENQ (previous step) (back to tree)

pc = E14, pre(gs, mkls(tid0, val, optval, vhead, nd, obsEmpty, vhead0, vhead1, rvref, optval0, vhead2, tid1, addr), pc, retENQ(tid)) ⊦ pc = E17 ∧ tid0 = tid

User applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ E14 ≠ E17; (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)

Proof step 27 from proof pre-retENQ (previous step) (back to tree)

retENQ(tid) = (vhead0 = (gs.orl + gs.qrl).last ⊃ doEnq(gs.owns(vhead1).tid);τ) ⊦

User 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, vhead2, 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 28 from proof pre-retENQ (previous step) (back to tree)

gs = mkgs(ps, vs, phead, vhead, vhead2, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), retENQ(tid) = (vhead0 = (orl + qrl).last ⊃ doEnq(owns(vhead1).tid);τ) ⊦

User applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 29 from proof pre-retENQ (previous step) (back to tree)

retENQ(tid) = (vhead0 = (orl + qrl).last ⊃ doEnq(owns(vhead1).tid);τ) ⊦

User applied rule case distinction

And closed the goal!

Rule argument

pos: left 1

Additional information

Used simplifier rules: ⊦ retENQ(tid) ≠ τ; (s) ⊦ doEnq(tid) ≠ retENQ(tid0); (s)

Proof Tree for pre-retENQ (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