Proof step 1 from proof step-L1-L8 (conclusion) (back to tree)

System applied rule normalize

And obtained the following new goals

• Proof step 2:

  # gs.y = gs.r, gs.y + (U(alltids, gs.ghostlspmxf) ∪ gs.gspmx).toMatrix(gs.r, # gs.x) * gs.x = gs.spmx.toMatrix(gs.r, # gs.x) * gs.x, gs.ghostlspmxf(ls.tid) = ∅, pcstepf(gs, ls, L1, a) = L8, alldisjointp(alltids, gs.ghostlspmxf), disjointp(U(alltids, gs.ghostlspmxf), gs.gspmx), okspmx(gs.spmx, gs.r, # gs.x), pre(gs, ls, L1, a), U(alltids, gs.ghostlspmxf) ∪ gs.gspmx ⊆ gs.spmx ⊦ ( alldisjointp(alltids, gstepf(gs, ls, L1, a).ghostlspmxf) ∧ disjointp(U(alltids, gstepf(gs, ls, L1, a).ghostlspmxf), gstepf(gs, ls, L1, a).gspmx) ∧ gstepf(gs, ls, L1, a).y + (U(alltids, gstepf(gs, ls, L1, a).ghostlspmxf) ∪ gstepf(gs, ls, L1, a).gspmx ).toMatrix (gstepf(gs, ls, L1, a).r, # gstepf(gs, ls, L1, a).x ) * gstepf(gs, ls, L1, a).x = gstepf(gs, ls, L1, a).spmx.toMatrix(gstepf(gs, ls, L1, a).r, # gstepf(gs, ls, L1, a).x) * gstepf(gs, ls, L1, a).x ∧ U(alltids, gstepf(gs, ls, L1, a).ghostlspmxf) ∪ gstepf(gs, ls, L1, a).gspmx ⊆ gstepf(gs, ls, L1, a).spmx ∧ # gstepf(gs, ls, L1, a).y = gstepf(gs, ls, L1, a).r ∧ okspmx(gstepf(gs, ls, L1, a).spmx, gstepf(gs, ls, L1, a).r, # gstepf(gs, ls, L1, a).x)) ∧ gstepf(gs, ls, L1, a).gspmx = ∅ ∧ gstepf(gs, ls, L1, a).ghostlspmxf(lstepf(gs, ls, L1, a).tid) = ∅

Rule argument

Additional information

Proof step 2 from proof step-L1-L8 (previous step) (back to tree)

Heuristic simplifier applied rule simplifier

And closed the goal!

Rule argument

Additional information

Used simplifier rules: pcstepf-L1: ⊦ pcstepf(gs, ls, L1, a) = (gs.gspmx ≠ ∅ ⊃ L2;L8); disj-57: ⊦ L8 ≠ L2; pre-L1: ⊦ pre(gs, ls, L1, a) ↔ a = τ; lstepf-L1: ⊦ lstepf(gs, ls, L1, τ) = ls; gstepf-L1: ⊦ gstepf(gs, ls, L1, τ) = gs; ⊦ ∅ ⊆ st; (s) ⊦ spmx ∪ ∅ = spmx; (s) ⊦ disjointp(spmx1, ∅); (s) ⊦ disjointp(spmx1, spmx2) → (spmx1 ∪ spmx2 ⊆ spmx ↔ spmx1 ⊆ spmx ∧ spmx2 ⊆ spmx); (ws)