[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-D22-D23 (conclusion) (back to tree)

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

System applied rule normalize

And obtained the following new goals

Rule argument

Additional information

Proof step 2 from proof step-D22-D23 (previous step) (back to tree)

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

Heuristic simplifier applied rule simplifier

And closed the goal!

Rule argument

Additional information

Used simplifier rules: ⊦ Val(val).val = val; (s) ⊦ a ∈ st[a, d]; (s) ⊦ a ∈ st[b, d] ↔ a = b ∨ a ∈ st; (ws) ⊦ allocrv(vretRefs, vrvHp) → ( allocrv(vretRefs0, vrvHp0) ↔ (∀ tid. vretRefs(tid) = null ∨ vretRefs(tid) ∈ vrvHp ∧ vretRefs(tid) ≠ null → vretRefs0(tid) = null ∨ vretRefs0(tid) ∈ vrvHp0 ∧ vretRefs0(tid) ≠ null)); (ss) ⊦ rvownerok(vretRefs, vrvHp, rvowns) → ( rvownerok(vretRefs0, vrvHp0, rvowns0) ↔ (∀ tid. ( vretRefs(tid) ≠ null → vretRefs(tid) ∈ vrvHp ∧ rvowns(vretRefs(tid)).tid = tid) → vretRefs0(tid) ≠ null → vretRefs0(tid) ∈ vrvHp0 ∧ rvowns0(vretRefs0(tid)).tid = tid)); (ss) ⊦ (gs.vrvHp:= vrvHp).owns = gs.owns; (s) ⊦ gstepf(gs, ls, D22, τ) = gs.vrvHp:= gs.vrvHp[ls.rvref, ls.optval]; (s) ⊦ lstepf(gs, ls, D22, τ) = ls; (s) ⊦ (gs.vrvHp:= vrvHp).vs = gs.vs; (s) ⊦ (gs.vrvHp:= vrvHp).qrl = gs.qrl; (s) ⊦ (gs.vrvHp:= vrvHp).orl = gs.orl; (s) ⊦ (gs.vrvHp:= vrvHp).vhead = gs.vhead; (s) ⊦ (gs.vrvHp:= vrvHp).rvowns = gs.rvowns; (s) ⊦ (gs.vrvHp:= vrvHp).vretRefs = gs.vretRefs; (s) ⊦ (gs.vrvHp:= vrvHp).vrvHp = vrvHp; (s) ⊦ (gs.vrvHp:= vrvHp).pretRefs = gs.pretRefs; (s) ⊦ (gs.vrvHp:= vrvHp).vtail = gs.vtail; (s) ⊦ (gs.vrvHp:= vrvHp).phead = gs.phead; (s) ⊦ (gs.vrvHp:= vrvHp).prvHp = gs.prvHp; (s) ⊦ a ∈ st → dom st ++ a = dom st; (s) ⊦ dom st[a, d] = dom st ++ a; (s) ⊦ (gs.vrvHp:= vrvHp).ps = gs.ps; (s) ⊦ a = b → st[b, d][a] = d; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ pre(gs, ls, D22, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, D22, a) = D23; (s)

Proof Tree for step-D22-D23 (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