| ⊦ bwabs(mkstate(gs0, lsf0, pcf0), durqs0) ∧ DQstep(mkstate(gs, lsf, pcf), ca, mkstate(gs0, lsf0, pcf0)) ∧ DQInv(gs, lsf, pcf) ∧ fininvdeq(pcf) ∧ a = absa(ca, durqs0.pcf) → (∃ durqs. (a = τ ⊃ durqs = durqs0;DurQstep(durqs, a, durqs0)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)) |
a = absa(ca, durqs0.pcf), DQInv(gs, lsf, pcf), DQstep(mkstate(gs, lsf, pcf), ca, mkstate(gs0, lsf0, pcf0)), bwabs(mkstate(gs0, lsf0, pcf0), durqs0), fininvdeq(pcf) ⊦ ∃ durqs. (a = τ ⊃ durqs = durqs0;DurQstep(durqs, a, durqs0)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)
| a = absa(ca, durqs0.pcf), DQInv(gs, lsf, pcf), DQstep(mkstate(gs, lsf, pcf), ca, mkstate(gs0, lsf0, pcf0)), bwabs(mkstate(gs0, lsf0, pcf0), durqs0), fininvdeq(pcf) ⊦ ∃ durqs. (a = τ ⊃ durqs = durqs0;DurQstep(durqs, a, durqs0)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs) |
a = absa(ca, durqs0.pcf), a = τ, DQInv(gs, lsf, pcf), DQstep(mkstate(gs, lsf, pcf), ca, mkstate(gs0, lsf0, pcf0)), bwabs(mkstate(gs0, lsf0, pcf0), durqs0), fininvdeq(pcf) ⊦ ∃ durqs. (a = τ ⊃ durqs = durqs0;DurQstep(durqs, a, durqs0)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)
a = absa(ca, durqs0.pcf), a ≠ τ, DQInv(gs, lsf, pcf), DQstep(mkstate(gs, lsf, pcf), ca, mkstate(gs0, lsf0, pcf0)), bwabs(mkstate(gs0, lsf0, pcf0), durqs0), fininvdeq(pcf) ⊦ ∃ durqs. (a = τ ⊃ durqs = durqs0;DurQstep(durqs, a, durqs0)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)
Used formulas: a = τ
| a = absa(ca, durqs0.pcf), a = τ, DQInv(gs, lsf, pcf), DQstep(mkstate(gs, lsf, pcf), ca, mkstate(gs0, lsf0, pcf0)), bwabs(mkstate(gs0, lsf0, pcf0), durqs0), fininvdeq(pcf) ⊦ ∃ durqs. (a = τ ⊃ durqs = durqs0;DurQstep(durqs, a, durqs0)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs) |
bwabs(mkstate(gs0, lsf0, pcf0), durqs), DQInv(gs, lsf, pcf), fininvdeq(pcf), absa(ca, durqs.pcf) = τ, DQstep(mkstate(gs, lsf, pcf), ca, mkstate(gs0, lsf0, pcf0)) ⊦ bwabs(mkstate(gs, lsf, pcf), durqs)
a = τ, a = absa(ca, durqs0.pcf), DQInv(gs, lsf, pcf), DQstep(mkstate(gs, lsf, pcf), ca, mkstate(gs0, lsf0, pcf0)), bwabs(mkstate(gs0, lsf0, pcf0), durqs0), bwabs(mkstate(gs, lsf, pcf), durqs0), fininvdeq(pcf) ⊦ ∃ durqs. (a = τ ⊃ durqs = durqs0;DurQstep(durqs, a, durqs0)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)
Used terms: gs, lsf0, gs0, durqs0, lsf, pcf0, ca, pcf
| bwabs(mkstate(gs0, lsf0, pcf0), durqs), DQInv(gs, lsf, pcf), fininvdeq(pcf), absa(ca, durqs.pcf) = τ, DQstep(mkstate(gs, lsf, pcf), ca, mkstate(gs0, lsf0, pcf0)) ⊦ bwabs(mkstate(gs, lsf, pcf), durqs) |
| a = τ, a = absa(ca, durqs0.pcf), DQInv(gs, lsf, pcf), DQstep(mkstate(gs, lsf, pcf), ca, mkstate(gs0, lsf0, pcf0)), bwabs(mkstate(gs0, lsf0, pcf0), durqs0), bwabs(mkstate(gs, lsf, pcf), durqs0), fininvdeq(pcf) ⊦ ∃ durqs. (a = τ ⊃ durqs = durqs0;DurQstep(durqs, a, durqs0)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs) |
Used simplifier rules: absa-def: ⊦ absa(ca, apcf0) = (∃ tid. ca = CheckEmp(tid) ⊃ (apcf0(ca.tid) = resDeq ⊃ ADoDeq(ca.tid);τ) ;bwabsa(ca) ); ⊦ DQstep(mkstate(gs, lsf, pcf), a, dqs0) ↔ (a = globalCrash ⊃ dqs0 = mkstate(gs, lsf, λ tid. (pcf(tid) = idle ⊃ idle;crashed)) ;∃ tid. pre(gs, lsf(tid), pcf(tid), a) ∧ dqs0 = mkstate (gstepf(gs, lsf(tid), pcf(tid), a), lsf(tid; lstepf(gs, lsf(tid), pcf(tid), a)), pcf(tid; pcstepf(gs, lsf(tid), pcf(tid), a))) ); (s) Used terms: durqs0
| a = absa(ca, durqs0.pcf), a ≠ τ, DQInv(gs, lsf, pcf), DQstep(mkstate(gs, lsf, pcf), ca, mkstate(gs0, lsf0, pcf0)), bwabs(mkstate(gs0, lsf0, pcf0), durqs0), fininvdeq(pcf) ⊦ ∃ durqs. (a = τ ⊃ durqs = durqs0;DurQstep(durqs, a, durqs0)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs) |
bwabs(mkstate(gs0, lsf0, pcf0), durqs0), absa(ca, durqs0.pcf) ≠ τ, DQInv(gs, lsf, pcf), fininvdeq(pcf), DQstep(mkstate(gs, lsf, pcf), ca, mkstate(gs0, lsf0, pcf0)) ⊦ ∃ durqs. DurQstep(durqs, absa(ca, durqs0.pcf), durqs0) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)
a = absa(ca, durqs0.pcf), a ≠ τ, DQInv(gs, lsf, pcf), DQstep(mkstate(gs, lsf, pcf), ca, mkstate(gs0, lsf0, pcf0)), bwabs(mkstate(gs0, lsf0, pcf0), durqs0), fininvdeq(pcf), ∃ durqs. DurQstep(durqs, absa(ca, durqs0.pcf), durqs0) ∧ bwabs(mkstate(gs, lsf, pcf), durqs) ⊦ ∃ durqs. (a = τ ⊃ durqs = durqs0;DurQstep(durqs, a, durqs0)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)
Used terms: gs, lsf0, gs0, durqs0, lsf, pcf0, ca, pcf
| bwabs(mkstate(gs0, lsf0, pcf0), durqs0), absa(ca, durqs0.pcf) ≠ τ, DQInv(gs, lsf, pcf), fininvdeq(pcf), DQstep(mkstate(gs, lsf, pcf), ca, mkstate(gs0, lsf0, pcf0)) ⊦ ∃ durqs. DurQstep(durqs, absa(ca, durqs0.pcf), durqs0) ∧ bwabs(mkstate(gs, lsf, pcf), durqs) |
| a = absa(ca, durqs0.pcf), a ≠ τ, DQInv(gs, lsf, pcf), DQstep(mkstate(gs, lsf, pcf), ca, mkstate(gs0, lsf0, pcf0)), bwabs(mkstate(gs0, lsf0, pcf0), durqs0), fininvdeq(pcf), ∃ durqs. DurQstep(durqs, absa(ca, durqs0.pcf), durqs0) ∧ bwabs(mkstate(gs, lsf, pcf), durqs) ⊦ ∃ durqs. (a = τ ⊃ durqs = durqs0;DurQstep(durqs, a, durqs0)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs) |
a = absa(ca, durqs0.pcf), a ≠ τ, DQInv(gs, lsf, pcf), DQstep(mkstate(gs, lsf, pcf), ca, mkstate(gs0, lsf0, pcf0)), DurQstep(durqs, absa(ca, durqs0.pcf), durqs0), bwabs(mkstate(gs0, lsf0, pcf0), durqs0), bwabs(mkstate(gs, lsf, pcf), durqs), fininvdeq(pcf) ⊦ ∃ durqs. (a = τ ⊃ durqs = durqs0;DurQstep(durqs, a, durqs0)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs)
| a = absa(ca, durqs0.pcf), a ≠ τ, DQInv(gs, lsf, pcf), DQstep(mkstate(gs, lsf, pcf), ca, mkstate(gs0, lsf0, pcf0)), DurQstep(durqs, absa(ca, durqs0.pcf), durqs0), bwabs(mkstate(gs0, lsf0, pcf0), durqs0), bwabs(mkstate(gs, lsf, pcf), durqs), fininvdeq(pcf) ⊦ ∃ durqs. (a = τ ⊃ durqs = durqs0;DurQstep(durqs, a, durqs0)) ∧ bwabs(mkstate(gs, lsf, pcf), durqs) |
Used simplifier rules: absa-def: ⊦ absa(ca, apcf0) = (∃ tid. ca = CheckEmp(tid) ⊃ (apcf0(ca.tid) = resDeq ⊃ ADoDeq(ca.tid);τ) ;bwabsa(ca) ); ⊦ DQstep(mkstate(gs, lsf, pcf), a, dqs0) ↔ (a = globalCrash ⊃ dqs0 = mkstate(gs, lsf, λ tid. (pcf(tid) = idle ⊃ idle;crashed)) ;∃ tid. pre(gs, lsf(tid), pcf(tid), a) ∧ dqs0 = mkstate (gstepf(gs, lsf(tid), pcf(tid), a), lsf(tid; lstepf(gs, lsf(tid), pcf(tid), a)), pcf(tid; pcstepf(gs, lsf(tid), pcf(tid), a))) ); (s) ⊦ ADoDeq(tid) ≠ τ; (s) Used terms: durqs
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.