Proof step 1 from proof step-idle-ready (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, idle, a) = ready, SFTrailing(gs.bq), ctrok(gs.fctr, gs.fwriters), noPending(ls.t, gs.bq, gs.pq), noPendingW(ls.t, gs.bq, gs.pq), notMember(ls.t, gs.fwriters), notMember(ls.t, gs.freaders), pendingOk(gs.bq, gs.pq), pre(gs, ls, idle, a), readFOsOk(gs.rfo, gs.fwriters), writersOk(gs.bq, gs.pq, gs.fwriters), ¬ SF ∈ gs.bq(ls.t) ⊦ ( ctrok(gstepf(gs, ls, idle, a).fctr, gstepf(gs, ls, idle, a).fwriters) ∧ writersOk(gstepf(gs, ls, idle, a).bq, gstepf(gs, ls, idle, a).pq, gstepf(gs, ls, idle, a).fwriters) ∧ pendingOk(gstepf(gs, ls, idle, a).bq, gstepf(gs, ls, idle, a).pq) ∧ SFTrailing(gstepf(gs, ls, idle, a).bq) ∧ readFOsOk(gstepf(gs, ls, idle, a).rfo, gstepf(gs, ls, idle, a).fwriters)) ∧ notMember(lstepf(gs, ls, idle, a).t, gstepf(gs, ls, idle, a).fwriters) ∧ notMember(lstepf(gs, ls, idle, a).t, gstepf(gs, ls, idle, a).freaders) ∧ noPendingW(lstepf(gs, ls, idle, a).t, gstepf(gs, ls, idle, a).bq, gstepf(gs, ls, idle, a).pq) ∧ ¬ SF ∈ gstepf(gs, ls, idle, a).bq(lstepf(gs, ls, idle, a).t) ∧ gstepf(gs, ls, idle, a).rfo(lstepf(gs, ls, idle, a).t) = gstepf(gs, ls, idle, a).bq(lstepf(gs, ls, idle, a).t)

Rule argument

Additional information

Proof step 2 from proof step-idle-ready (previous step) (back to tree)

Heuristic simplifier applied rule simplifier

And closed the goal!

Rule argument

Additional information

Used simplifier rules: ⊦ ls.t = t → gstepf(gs, ls, idle, callRUN(t)) = gs; (s) ⊦ ls.t = t → lstepf(gs, ls, idle, callRUN(t)) = ls; (s) ⊦ noPending(t, bq, pq) → noPendingW(t, bq, pq); (ss) ⊦ ls.t = t → pcstepf(gs, ls, idle, callRUN(t)) = ready; (s) ⊦ pre(gs, ls, idle, a) ↔ a = callRUN(ls.t); (s)