| ⊦ ¬ pre(gs, ls, pc, globalFLUSHHEAD) |
pre(gs, ls, pc, globalFLUSHHEAD) ⊦
| pre(gs, ls, pc, globalFLUSHHEAD) ⊦ |
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) ⊦ globalFLUSHHEAD ≠ invENQ(tid, invENQvalue); (s) ⊦ globalFLUSHHEAD ≠ invDEQ(tid); (s) ⊦ pre(gs, ls, idle, a) ↔ a = callRUN(ls.tid); (s) ⊦ callRUN(tid) ≠ globalFLUSHHEAD; (s) ⊦ pre(gs, ls, crashed, a) ↔ false; (s) ⊦ pre(gs, ls, E17, a) ↔ a = retENQ(ls.tid); (s) ⊦ globalFLUSHHEAD ≠ retENQ(tid); (s) ⊦ pre(gs, ls, E16, a) ↔ a = τ; (s) ⊦ globalFLUSHHEAD ≠ τ; (s) ⊦ pre(gs, ls, E15, a) ↔ a = τ; (s) ⊦ pre(gs, ls, E14, a) ↔ a = (ls.lst = (gs.orl + gs.qrl).last ⊃ doEnq(gs.owns(ls.nxt).tid);τ); (s) ⊦ doEnq(tid) ≠ globalFLUSHHEAD; (s) ⊦ pre(gs, ls, E13, a) ↔ a = τ; (s) ⊦ pre(gs, ls, E12, a) ↔ a = τ; (s) ⊦ pre(gs, ls, E11, a) ↔ a = (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ doEnq(ls.tid);τ); (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) ≠ globalFLUSHHEAD; (s) ⊦ pre(gs, ls, D34, a) ↔ a = retDEQ(ls.tid, ls.optval); (s) ⊦ globalFLUSHHEAD ≠ retDEQ(tid, 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, D28, a) ↔ a = (gs.ps[ls.nxt].deqID = None ⊃ doDeq(ls.othertid);τ); (s) ⊦ doDeq(tid) ≠ globalFLUSHHEAD; (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, D21, a) ↔ a = (gs.ps[ls.nxt].deqID = None ⊃ doDeq(ls.tid);τ); (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, D16, a) ↔ a = (ls.lst = (gs.orl + gs.qrl).last ⊃ doEnq(gs.owns(ls.nxt).tid);τ); (s) ⊦ pre(gs, ls, D15, a) ↔ a = τ; (s) ⊦ pre(gs, ls, D14, a) ↔ a = doDeqEmpty(ls.tid); (s) ⊦ doDeqEmpty(tid) ≠ globalFLUSHHEAD; (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, D9, a) ↔ a = (gs.qrl = [] ⊃ checkEmp(ls.tid);τ); (s) ⊦ checkEmp(tid) ≠ globalFLUSHHEAD; (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) ≠ globalFLUSHHEAD; (s) ⊦ pre(gs, ls, D1, a) ↔ a = τ; (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.