Proof step 1 from proof step-R2-R3 (conclusion) (back to tree)

System applied rule normalize

And obtained the following new goals

• Proof step 2:

  gs.rfo(ls.t) = gs.bq(ls.t), pcstepf(gs, ls, R2, a) = R3, SFTrailing(gs.bq), ctrok(gs.fctr, gs.fwriters), noPendingW(ls.t, gs.bq, gs.pq), notMember(ls.t, gs.fwriters), oneMember(ls.t, ls.loc, gs.freaders), pendingOk(gs.bq, gs.pq), pre(gs, ls, R2, a), readFOsOk(gs.rfo, gs.fwriters), writersOk(gs.bq, gs.pq, gs.fwriters), ¬ SF ∈ gs.bq(ls.t) ⊦ ( ctrok(gstepf(gs, ls, R2, a).fctr, gstepf(gs, ls, R2, a).fwriters) ∧ writersOk(gstepf(gs, ls, R2, a).bq, gstepf(gs, ls, R2, a).pq, gstepf(gs, ls, R2, a).fwriters) ∧ pendingOk(gstepf(gs, ls, R2, a).bq, gstepf(gs, ls, R2, a).pq) ∧ SFTrailing(gstepf(gs, ls, R2, a).bq) ∧ readFOsOk(gstepf(gs, ls, R2, a).rfo, gstepf(gs, ls, R2, a).fwriters)) ∧ noPendingW(lstepf(gs, ls, R2, a).t, gstepf(gs, ls, R2, a).bq, gstepf(gs, ls, R2, a).pq) ∧ notMember(lstepf(gs, ls, R2, a).t, gstepf(gs, ls, R2, a).fwriters) ∧ oneMember(lstepf(gs, ls, R2, a).t, lstepf(gs, ls, R2, a).loc, gstepf(gs, ls, R2, a).freaders) ∧ ¬ SF ∈ gstepf(gs, ls, R2, a).bq(lstepf(gs, ls, R2, a).t) ∧ gstepf(gs, ls, R2, a).rfo(lstepf(gs, ls, R2, a).t) = gstepf(gs, ls, R2, a).bq(lstepf(gs, ls, R2, a).t)

Rule argument

Additional information

Proof step 2 from proof step-R2-R3 (previous step) (back to tree)

Heuristic simplifier applied rule simplifier

And closed the goal!

Rule argument

Additional information

Used simplifier rules: ⊦ gstepf(gs, ls, R2, a) = (gs.fctr(ls.loc) ≠ 0 ⊃ gs ;gs.freaders:= gs.freaders(ls.loc := gs.freaders(ls.loc) -- ls.t) ); (s) ⊦ lstepf(gs, ls, R2, a) = ls; (s) ⊦ pre(gs, ls, R2, a) ↔ a = ctrRead(ls.t, ls.loc, gs.fctr(ls.loc)); (s) ⊦ R3 ≠ R4; (s) ⊦ pcstepf(gs, ls, R2, a) = (gs.fctr(ls.loc) ≠ 0 ⊃ R3;R4); (s)