Proof step 1 from proof rely-W4-W5 (conclusion) (back to tree)

System applied rule normalize

And obtained the following new goals

• Proof step 2:

  gs.rfo(ls.t) = [], pcstepf(gs, ls, W4, a) = W5, ls.t ≠ t0, SFTrailing(gs.bq), ctrok(gs.fctr, gs.fwriters), notMember(ls.t, gs.freaders), oneMember(ls.t, ls.loc, gs.fwriters), pendingOk(gs.bq, gs.pq), pre(gs, ls, W4, a), readFOsOk(gs.rfo, gs.fwriters), writersOk(gs.bq, gs.pq, gs.fwriters), ¬ SF ∈ gs.bq(ls.t), gs.bq(ls.t) ≠ [] ∧ gs.bq(ls.t).head.W? → gs.bq(ls.t).head = W(ls.loc, ls.val), gs.bq(ls.t) = [] ∨ gs.bq(ls.t) = W(ls.loc, ls.val) ' ⊦ relyws(t0, gs.freaders, gstepf(gs, ls, W4, a).freaders) ∧ relyws(t0, gs.fwriters, gstepf(gs, ls, W4, a).fwriters) ∧ rely(t0, gs.pq, gs.bq, gstepf(gs, ls, W4, a).pq, gstepf(gs, ls, W4, a).bq) ∧ gs.bq(t0) ⊒w gstepf(gs, ls, W4, a).bq(t0) ∧ (gs.rfo(t0) = [] → gstepf(gs, ls, W4, a).rfo(t0) = []) ∧ (gs.rfo(t0) = gs.bq(t0) → gstepf(gs, ls, W4, a).rfo(t0) = gstepf(gs, ls, W4, a).bq(t0)) ∧ ( gs.rfo(t0) + SF ' = gs.bq(t0) → gstepf(gs, ls, W4, a).rfo(t0) + SF ' = gstepf(gs, ls, W4, a).bq(t0) ∨ gstepf(gs, ls, W4, a).rfo(t0) = gstepf(gs, ls, W4, a).bq(t0))

Rule argument

Additional information

Proof step 2 from proof rely-W4-W5 (previous step) (back to tree)

Heuristic simplifier applied rule simplifier

And closed the goal!

Rule argument

Additional information

Used simplifier rules: ⊦ (gs.bq:= bq).bq = bq; (s) ⊦ x + a = x + a '; (s) ⊦ gstepf(gs, ls, W4, τ) = gs.bq:= gs.bq(ls.t := gs.bq(ls.t) + FO(ls.loc)); (s) ⊦ (gs.bq:= bq).rfo = gs.rfo; (s) ⊦ bel ⊒w bel; (s) ⊦ t ≠ t0 → rely(t, pq, bq, pq, bq(t0 := bel)); (ss) ⊦ (gs.bq:= bq).pq = gs.pq; (s) ⊦ relyws(t, tsf, tsf); (s) ⊦ (gs.bq:= bq).fwriters = gs.fwriters; (s) ⊦ (gs.bq:= bq).freaders = gs.freaders; (s) ⊦ pre(gs, ls, W4, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, W4, a) = W5; (s)