Proof step 1 from proof step-absstep-W6-W7-tau-same (conclusion) (back to tree)

System applied rule normalize

And obtained the following new goals

• Proof step 2:

  ls.l = als.il, ags.pm = gs.mem, ags.pm = ∅ ⊕ (ags.h | true), ls.t = als.t, lsf(t).t = t, alsf(t).t = t, ls.v = als.iv, ags.vm = gs.mem ⊕ gs.p, ags.vm = ∅ ⊕ ags.h, W7 = pcstepf(gs, ls, W6, ctrDecPSC(t, l)), alsf(t) = als, apc = resWrite, apcf(t) = apc, gs0 = gstepf(gs, ls, W6, ctrDecPSC(t, l)), ls0 = lstepf(gs, ls, W6, ctrDecPSC(t, l)), lsf(t) = ls, lsf0(t) = ls0, pcf(t) = W6, pcf0(t) = W7, PLIBLInv(ags, als, apc), abs(ags.h, gs.readers, gs.p), allReadsOK(ags.h), allWritesOK(ags.h), ctrok(gs0.ctr, gs0.writers), ctrok(gs.ctr, gs.writers), noPending(t, gs0.p), noPending(t, gs.p), notMember(t, gs0.readers), notMember(t, gs0.writers), notMember(t, gs.readers), oneMember(t, ls.l, gs.writers), pendingOk(gs0.p), pendingOk(gs.p), pre(gs, ls, W6, ctrDecPSC(t, l)), writersOk(gs0.p, gs0.writers), writersOk(gs.p, gs.writers), ∀ l. ((ags.h | l) | ls.t) | false = [], ∀ t0. t0 ≠ t → FLITPSCLInv(gs, lsf(t0), pcf(t0)) ∧ PLIBLInv(ags, alsf(t0), apcf(t0)) ∧ labs(gs, lsf(t0), pcf(t0), ags, alsf(t0), apcf(t0)), ∀ t0. t0 ≠ t → alsf(t0).t = t0, ∀ t0. t0 ≠ t → lsf(t0).t = t0 ⊦ (ags.pm = gs0.mem ∧ ags.vm = gs0.mem ⊕ gs0.p ∧ abs(ags.h, gs0.readers, gs0.p)) ∧ ls0.t = als.t ∧ apc = resWrite ∧ (ls0.l = als.il ∧ ls0.v = als.iv) ∧ (∀ l. ((ags.h | l) | ls0.t) | false = [])

Rule argument

Additional information

Proof step 2 from proof step-absstep-W6-W7-tau-same (previous step) (back to tree)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 3:

  lsf(t).l = alsf(t).il, gs.mem = ∅ ⊕ (ags.h | true), ags.pm = gs.mem, lsf(t).t = t, alsf(t).t = t, lsf(t).v = alsf(t).iv, ags.vm = gs.mem ⊕ gs.p, ags.vm = ∅ ⊕ ags.h, apcf(t) = resWrite, lsf0(t) = lsf(t), pcf(t) = W6, pcf0(t) = W7, ((ags.h | l0) | t) | false ≠ [], PLIBLInv(ags, alsf(t), resWrite), abs(ags.h, gs.readers, gs.p), allReadsOK(ags.h), allWritesOK(ags.h), ctrok(gs.ctr(alsf(t).il := gs.ctr(alsf(t).il) - 1), gs.writers(alsf(t).il := gs.writers(alsf(t).il) -- t)), ctrok(gs.ctr, gs.writers), noPending(t, gs.p), notMember(t, gs.writers(alsf(t).il := gs.writers(alsf(t).il) -- t)), notMember(t, gs.readers), oneMember(t, alsf(t).il, gs.writers), pendingOk(gs.p), writersOk(gs.p, gs.writers(alsf(t).il := gs.writers(alsf(t).il) -- t)), writersOk(gs.p, gs.writers), ∀ t0. alsf(t0).t = t0, ∀ t0. lsf(t0).t = t0, ∀ l. ((ags.h | l) | t) | false = [], ∀ t0. t0 ≠ t → FLITPSCLInv(gs, lsf(t0), pcf(t0)) ∧ PLIBLInv(ags, alsf(t0), apcf(t0)) ∧ labs(gs, lsf(t0), pcf(t0), ags, alsf(t0), apcf(t0)) ⊦

Rule argument

Additional information

Used simplifier rules: ⊦ (gs.ctr:= ctr).p = gs.p; (s) ⊦ (gs.writers:= writers).p = gs.p; (s) ⊦ gstepf(gs, ls, W6, a) = (gs.ctr:= gs.ctr(ls.l := gs.ctr(ls.l) - 1)) .writers:= gs.writers(ls.l := gs.writers(ls.l) -- ls.t); (s) ⊦ (gs.ctr:= ctr).readers = gs.readers; (s) ⊦ (gs.writers:= writers).readers = gs.readers; (s) ⊦ (gs.ctr:= ctr).mem = gs.mem; (s) ⊦ (gs.writers:= writers).mem = gs.mem; (s) ⊦ (gs.writers:= writers).writers = writers; (s) ⊦ (gs.ctr:= ctr).ctr = ctr; (s) ⊦ (gs.writers:= writers).ctr = gs.ctr; (s) ⊦ ctrDecPSC(t, l) = ctrDecPSC(t0, l0) ↔ t = t0 ∧ l = l0; (ws) ⊦ pre(gs, ls, W6, a) ↔ a = ctrDecPSC(ls.t, ls.l); (s) ⊦ pcstepf(gs, ls, W6, a) = W7; (s) ⊦ lstepf(gs, ls, W6, a) = ls; (s)

Proof step 3 from proof step-absstep-W6-W7-tau-same (previous step) (back to tree)

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

• Proof step 4:

  lsf(t).l = alsf(t).il, gs.mem = ∅ ⊕ (h | true), alsf(t).t = t, lsf(t).t = t, lsf(t).v = alsf(t).iv, ags = mkPLIBgs(mem, mem0, h), apcf(t) = resWrite, lsf0(t) = lsf(t), mem = ∅ ⊕ h, mem = gs.mem ⊕ gs.p, mem0 = gs.mem, pcf(t) = W6, pcf0(t) = W7, ((h | l0) | t) | false ≠ [], PLIBLInv(ags, alsf(t), resWrite), abs(h, gs.readers, gs.p), allReadsOK(h), allWritesOK(h), ctrok(gs.ctr, gs.writers), ctrok(gs.ctr(alsf(t).il := gs.ctr(alsf(t).il) - 1), gs.writers(alsf(t).il := gs.writers(alsf(t).il) -- t)), noPending(t, gs.p), notMember(t, gs.readers), notMember(t, gs.writers(alsf(t).il := gs.writers(alsf(t).il) -- t)), oneMember(t, alsf(t).il, gs.writers), pendingOk(gs.p), writersOk(gs.p, gs.writers), writersOk(gs.p, gs.writers(alsf(t).il := gs.writers(alsf(t).il) -- t)), ∀ t0. t0 ≠ t → FLITPSCLInv(gs, lsf(t0), pcf(t0)) ∧ PLIBLInv(ags, alsf(t0), apcf(t0)) ∧ labs(gs, lsf(t0), pcf(t0), ags, alsf(t0), apcf(t0)), ∀ l. ((h | l) | t) | false = [], ∀ t0. lsf(t0).t = t0, ∀ t0. alsf(t0).t = t0 ⊦

Rule argument

Additional information

Used simplifier rules: ⊦ (vm = gs.vm ∧ pm = gs.pm) ∧ h = gs.h ↔ gs = mkPLIBgs(vm, pm, h); (elim) Used terms: ags, mem, mem0, h

Proof step 4 from proof step-absstep-W6-W7-tau-same (previous step) (back to tree)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 5:

  lsf(t).l = alsf(t).il, gs.mem = ∅ ⊕ (h | true), lsf(t).t = t, alsf(t).t = t, lsf(t).v = alsf(t).iv, apcf(t) = resWrite, lsf0(t) = lsf(t), pcf(t) = W6, pcf0(t) = W7, gs.mem ⊕ gs.p = ∅ ⊕ h, ((h | l0) | t) | false ≠ [], PLIBLInv(mkPLIBgs(∅ ⊕ h, gs.mem, h), alsf(t), resWrite), abs(h, gs.readers, gs.p), allReadsOK(h), allWritesOK(h), ctrok(gs.ctr(alsf(t).il := gs.ctr(alsf(t).il) - 1), gs.writers(alsf(t).il := gs.writers(alsf(t).il) -- t)), ctrok(gs.ctr, gs.writers), noPending(t, gs.p), notMember(t, gs.writers(alsf(t).il := gs.writers(alsf(t).il) -- t)), notMember(t, gs.readers), oneMember(t, alsf(t).il, gs.writers), pendingOk(gs.p), writersOk(gs.p, gs.writers(alsf(t).il := gs.writers(alsf(t).il) -- t)), writersOk(gs.p, gs.writers), ∀ t0. alsf(t0).t = t0, ∀ t0. lsf(t0).t = t0, ∀ l. ((h | l) | t) | false = [], ∀ t0. t0 ≠ t → FLITPSCLInv(gs, lsf(t0), pcf(t0)) ∧ PLIBLInv(mkPLIBgs(∅ ⊕ h, gs.mem, h), alsf(t0), apcf(t0)) ∧ labs(gs, lsf(t0), pcf(t0), mkPLIBgs(∅ ⊕ h, gs.mem, h), alsf(t0), apcf(t0)) ⊦

Rule argument

Additional information

Proof step 5 from proof step-absstep-W6-W7-tau-same (previous step) (back to tree)

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

• Proof step 6:

  lsf(t).l = alsf(t).il, alsf(t).t = t, lsf(t).t = t, lsf(t).v = alsf(t).iv, apcf(t) = resWrite, gs = mkFLITPSCgs(mem, p, ctr, writers, writers0), lsf0(t) = lsf(t), mem = ∅ ⊕ (h | true), pcf(t) = W6, pcf0(t) = W7, mem ⊕ p = ∅ ⊕ h, ((h | l0) | t) | false ≠ [], PLIBLInv(mkPLIBgs(∅ ⊕ h, mem, h), alsf(t), resWrite), abs(h, writers0, p), allReadsOK(h), allWritesOK(h), ctrok(ctr, writers), ctrok(ctr(alsf(t).il := ctr(alsf(t).il) - 1), writers(alsf(t).il := writers(alsf(t).il) -- t)), noPending(t, p), notMember(t, writers0), notMember(t, writers(alsf(t).il := writers(alsf(t).il) -- t)), oneMember(t, alsf(t).il, writers), pendingOk(p), writersOk(p, writers), writersOk(p, writers(alsf(t).il := writers(alsf(t).il) -- t)), ∀ t0. t0 ≠ t → FLITPSCLInv(gs, lsf(t0), pcf(t0)) ∧ PLIBLInv(mkPLIBgs(∅ ⊕ h, mem, h), alsf(t0), apcf(t0)) ∧ labs(gs, lsf(t0), pcf(t0), mkPLIBgs(∅ ⊕ h, mem, h), alsf(t0), apcf(t0)), ∀ l. ((h | l) | t) | false = [], ∀ t0. lsf(t0).t = t0, ∀ t0. alsf(t0).t = t0 ⊦

Rule argument

Additional information

Used simplifier rules: ⊦ (((mem = gs.mem ∧ p = gs.p) ∧ ctr = gs.ctr) ∧ writers = gs.writers) ∧ readers = gs.readers ↔ gs = mkFLITPSCgs(mem, p, ctr, writers, readers); (elim) Used terms: gs, mem, ctr, writers, writers0, p

Proof step 6 from proof step-absstep-W6-W7-tau-same (previous step) (back to tree)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 7:

  lsf(t).l = alsf(t).il, lsf(t).t = t, alsf(t).t = t, lsf(t).v = alsf(t).iv, apcf(t) = resWrite, lsf0(t) = lsf(t), pcf(t) = W6, pcf0(t) = W7, (∅ ⊕ (h | true)) ⊕ p = ∅ ⊕ h, ((h | l0) | t) | false ≠ [], PLIBLInv(mkPLIBgs(∅ ⊕ h, ∅ ⊕ (h | true), h), alsf(t), resWrite), abs(h, writers0, p), allReadsOK(h), allWritesOK(h), ctrok(ctr(alsf(t).il := ctr(alsf(t).il) - 1), writers(alsf(t).il := writers(alsf(t).il) -- t)), ctrok(ctr, writers), noPending(t, p), notMember(t, writers(alsf(t).il := writers(alsf(t).il) -- t)), notMember(t, writers0), oneMember(t, alsf(t).il, writers), pendingOk(p), writersOk(p, writers(alsf(t).il := writers(alsf(t).il) -- t)), writersOk(p, writers), ∀ t0. alsf(t0).t = t0, ∀ t0. lsf(t0).t = t0, ∀ l. ((h | l) | t) | false = [], ∀ t0. t0 ≠ t → FLITPSCLInv(mkFLITPSCgs(∅ ⊕ (h | true), p, ctr, writers, writers0), lsf(t0), pcf(t0)) ∧ PLIBLInv(mkPLIBgs(∅ ⊕ h, ∅ ⊕ (h | true), h), alsf(t0), apcf(t0)) ∧ labs(mkFLITPSCgs(∅ ⊕ (h | true), p, ctr, writers, writers0), lsf(t0), pcf(t0), mkPLIBgs(∅ ⊕ h, ∅ ⊕ (h | true), h), alsf(t0), apcf(t0)) ⊦

Rule argument

Additional information

Proof step 7 from proof step-absstep-W6-W7-tau-same (previous step) (back to tree)

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

• Proof step 8:

  lsf(t).l = alsf(t).il, alsf(t).t = t, lsf(t).t = t, lsf(t).v = alsf(t).iv, apcf(t) = resWrite, ctr(alsf(t).il) = n0 + 1, lsf0(t) = lsf(t), pcf(t) = W6, pcf0(t) = W7, (∅ ⊕ (h | true)) ⊕ p = ∅ ⊕ h, ctr(alsf(t).il) ≠ 0, ((h | l0) | t) | false ≠ [], PLIBLInv(mkPLIBgs(∅ ⊕ h, ∅ ⊕ (h | true), h), alsf(t), resWrite), abs(h, writers0, p), allReadsOK(h), allWritesOK(h), ctrok(ctr, writers), ctrok(ctr(alsf(t).il := n0), writers(alsf(t).il := writers(alsf(t).il) -- t)), noPending(t, p), notMember(t, writers0), notMember(t, writers(alsf(t).il := writers(alsf(t).il) -- t)), oneMember(t, alsf(t).il, writers), pendingOk(p), writersOk(p, writers), writersOk(p, writers(alsf(t).il := writers(alsf(t).il) -- t)), ∀ t0. t0 ≠ t → FLITPSCLInv(mkFLITPSCgs(∅ ⊕ (h | true), p, ctr, writers, writers0), lsf(t0), pcf(t0)) ∧ PLIBLInv(mkPLIBgs(∅ ⊕ h, ∅ ⊕ (h | true), h), alsf(t0), apcf(t0)) ∧ labs(mkFLITPSCgs(∅ ⊕ (h | true), p, ctr, writers, writers0), lsf(t0), pcf(t0), mkPLIBgs(∅ ⊕ h, ∅ ⊕ (h | true), h), alsf(t0), apcf(t0)), ∀ l. ((h | l) | t) | false = [], ∀ t0. lsf(t0).t = t0, ∀ t0. alsf(t0).t = t0 ⊦

Rule argument

Additional information

Used simplifier rules: ⊦ oneMember(t, l, writers) ∧ ctrok(ctr, writers) → ctr(l) ≠ 0; (as) n ≠ 0 ⊦ m = n - 1 ↔ n = m + 1; (elim) Used terms: ctr(alsf(t).il), n0

Proof step 8 from proof step-absstep-W6-W7-tau-same (previous step) (back to tree)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 9:

  lsf(t).l = alsf(t).il, alsf(t).t = t, lsf(t).t = t, lsf(t).v = alsf(t).iv, apcf(t) = resWrite, ctr(alsf(t).il) = n0 + 1, lsf0(t) = lsf(t), pcf(t) = W6, pcf0(t) = W7, (∅ ⊕ (h | true)) ⊕ p = ∅ ⊕ h, ((h | l0) | t) | false ≠ [], PLIBLInv(mkPLIBgs(∅ ⊕ h, ∅ ⊕ (h | true), h), alsf(t), resWrite), abs(h, writers0, p), allReadsOK(h), allWritesOK(h), ctrok(ctr, writers), ctrok(ctr(alsf(t).il := n0), writers(alsf(t).il := writers(alsf(t).il) -- t)), noPending(t, p), notMember(t, writers0), notMember(t, writers(alsf(t).il := writers(alsf(t).il) -- t)), oneMember(t, alsf(t).il, writers), pendingOk(p), writersOk(p, writers), writersOk(p, writers(alsf(t).il := writers(alsf(t).il) -- t)), ∀ t0. t0 ≠ t → FLITPSCLInv(mkFLITPSCgs(∅ ⊕ (h | true), p, ctr, writers, writers0), lsf(t0), pcf(t0)) ∧ PLIBLInv(mkPLIBgs(∅ ⊕ h, ∅ ⊕ (h | true), h), alsf(t0), apcf(t0)) ∧ labs(mkFLITPSCgs(∅ ⊕ (h | true), p, ctr, writers, writers0), lsf(t0), pcf(t0), mkPLIBgs(∅ ⊕ h, ∅ ⊕ (h | true), h), alsf(t0), apcf(t0)), ∀ l. ((h | l) | t) | false = [], ∀ t0. lsf(t0).t = t0, ∀ t0. alsf(t0).t = t0 ⊦

Rule argument

Additional information

Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m + 1 ≠ 0; (s)

Proof step 9 from proof step-absstep-W6-W7-tau-same (previous step) (back to tree)

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

• Proof step 10:

  lsf(t).l = il, lsf(t).t = t, lsf(t).v = iv, alsf(t) = mkPLIBls(t1, il, iv, ov), apcf(t) = resWrite, ctr(il) = n0 + 1, lsf0(t) = lsf(t), pcf(t) = W6, pcf0(t) = W7, t1 = t, (∅ ⊕ (h | true)) ⊕ p = ∅ ⊕ h, ((h | l0) | t) | false ≠ [], PLIBLInv(mkPLIBgs(∅ ⊕ h, ∅ ⊕ (h | true), h), alsf(t), resWrite), abs(h, writers0, p), allReadsOK(h), allWritesOK(h), ctrok(ctr(il := n0), writers(il := writers(il) -- t)), ctrok(ctr, writers), noPending(t, p), notMember(t, writers(il := writers(il) -- t)), notMember(t, writers0), oneMember(t, il, writers), pendingOk(p), writersOk(p, writers(il := writers(il) -- t)), writersOk(p, writers), ∀ t0. alsf(t0).t = t0, ∀ t0. lsf(t0).t = t0, ∀ l. ((h | l) | t) | false = [], ∀ t0. t0 ≠ t → FLITPSCLInv(mkFLITPSCgs(∅ ⊕ (h | true), p, ctr, writers, writers0), lsf(t0), pcf(t0)) ∧ PLIBLInv(mkPLIBgs(∅ ⊕ h, ∅ ⊕ (h | true), h), alsf(t0), apcf(t0)) ∧ labs(mkFLITPSCgs(∅ ⊕ (h | true), p, ctr, writers, writers0), lsf(t0), pcf(t0), mkPLIBgs(∅ ⊕ h, ∅ ⊕ (h | true), h), alsf(t0), apcf(t0)) ⊦

Rule argument

Additional information

Used simplifier rules: ⊦ ((t = ls.t ∧ il = ls.il) ∧ iv = ls.iv) ∧ ov = ls.ov ↔ ls = mkPLIBls(t, il, iv, ov); (elim) Used terms: alsf(t), iv, t1, il, ov

Proof step 10 from proof step-absstep-W6-W7-tau-same (previous step) (back to tree)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 11:

  lsf(t).t = t, alsf(t) = mkPLIBls(t, lsf(t).l, lsf(t).v, ov), apcf(t) = resWrite, ctr(lsf(t).l) = n0 + 1, lsf0(t) = lsf(t), pcf(t) = W6, pcf0(t) = W7, (∅ ⊕ (h | true)) ⊕ p = ∅ ⊕ h, ((h | l0) | t) | false ≠ [], PLIBLInv(mkPLIBgs(∅ ⊕ h, ∅ ⊕ (h | true), h), mkPLIBls(t, lsf(t).l, lsf(t).v, ov), resWrite), abs(h, writers0, p), allReadsOK(h), allWritesOK(h), ctrok(ctr, writers), ctrok(ctr(lsf(t).l := n0), writers(lsf(t).l := writers(lsf(t).l) -- t)), noPending(t, p), notMember(t, writers0), notMember(t, writers(lsf(t).l := writers(lsf(t).l) -- t)), oneMember(t, lsf(t).l, writers), pendingOk(p), writersOk(p, writers), writersOk(p, writers(lsf(t).l := writers(lsf(t).l) -- t)), ∀ t0. t0 ≠ t → FLITPSCLInv(mkFLITPSCgs(∅ ⊕ (h | true), p, ctr, writers, writers0), lsf(t0), pcf(t0)) ∧ PLIBLInv(mkPLIBgs(∅ ⊕ h, ∅ ⊕ (h | true), h), alsf(t0), apcf(t0)) ∧ labs(mkFLITPSCgs(∅ ⊕ (h | true), p, ctr, writers, writers0), lsf(t0), pcf(t0), mkPLIBgs(∅ ⊕ h, ∅ ⊕ (h | true), h), alsf(t0), apcf(t0)), ∀ l. ((h | l) | t) | false = [], ∀ t0. lsf(t0).t = t0, ∀ t0. alsf(t0).t = t0 ⊦

Rule argument

Additional information

Proof step 11 from proof step-absstep-W6-W7-tau-same (previous step) (back to tree)

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

• Proof step 12:

  alsf(t) = mkPLIBls(t, l1, v, ov), apcf(t) = resWrite, ctr(l1) = n0 + 1, lsf(t) = mkFLITPSCls(t1, l1, v), lsf0(t) = lsf(t), pcf(t) = W6, pcf0(t) = W7, t1 = t, (∅ ⊕ (h | true)) ⊕ p = ∅ ⊕ h, ((h | l0) | t) | false ≠ [], PLIBLInv(mkPLIBgs(∅ ⊕ h, ∅ ⊕ (h | true), h), mkPLIBls(t, l1, v, ov), resWrite), abs(h, writers0, p), allReadsOK(h), allWritesOK(h), ctrok(ctr(l1 := n0), writers(l1 := writers(l1) -- t)), ctrok(ctr, writers), noPending(t, p), notMember(t, writers(l1 := writers(l1) -- t)), notMember(t, writers0), oneMember(t, l1, writers), pendingOk(p), writersOk(p, writers(l1 := writers(l1) -- t)), writersOk(p, writers), ∀ t0. alsf(t0).t = t0, ∀ t0. lsf(t0).t = t0, ∀ l. ((h | l) | t) | false = [], ∀ t0. t0 ≠ t → FLITPSCLInv(mkFLITPSCgs(∅ ⊕ (h | true), p, ctr, writers, writers0), lsf(t0), pcf(t0)) ∧ PLIBLInv(mkPLIBgs(∅ ⊕ h, ∅ ⊕ (h | true), h), alsf(t0), apcf(t0)) ∧ labs(mkFLITPSCgs(∅ ⊕ (h | true), p, ctr, writers, writers0), lsf(t0), pcf(t0), mkPLIBgs(∅ ⊕ h, ∅ ⊕ (h | true), h), alsf(t0), apcf(t0)) ⊦

Rule argument

Additional information

Used simplifier rules: ⊦ (t = ls.t ∧ l = ls.l) ∧ v = ls.v ↔ ls = mkFLITPSCls(t, l, v); (elim) Used terms: lsf(t), t1, l1, v

Proof step 12 from proof step-absstep-W6-W7-tau-same (previous step) (back to tree)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 13:

  alsf(t) = mkPLIBls(t, l1, v, ov), apcf(t) = resWrite, ctr(l1) = n0 + 1, lsf(t) = mkFLITPSCls(t, l1, v), lsf0(t) = mkFLITPSCls(t, l1, v), pcf(t) = W6, pcf0(t) = W7, (∅ ⊕ (h | true)) ⊕ p = ∅ ⊕ h, ((h | l0) | t) | false ≠ [], PLIBLInv(mkPLIBgs(∅ ⊕ h, ∅ ⊕ (h | true), h), mkPLIBls(t, l1, v, ov), resWrite), abs(h, writers0, p), allReadsOK(h), allWritesOK(h), ctrok(ctr, writers), ctrok(ctr(l1 := n0), writers(l1 := writers(l1) -- t)), noPending(t, p), notMember(t, writers0), notMember(t, writers(l1 := writers(l1) -- t)), oneMember(t, l1, writers), pendingOk(p), writersOk(p, writers), writersOk(p, writers(l1 := writers(l1) -- t)), ∀ t0. t0 ≠ t → FLITPSCLInv(mkFLITPSCgs(∅ ⊕ (h | true), p, ctr, writers, writers0), lsf(t0), pcf(t0)) ∧ PLIBLInv(mkPLIBgs(∅ ⊕ h, ∅ ⊕ (h | true), h), alsf(t0), apcf(t0)) ∧ labs(mkFLITPSCgs(∅ ⊕ (h | true), p, ctr, writers, writers0), lsf(t0), pcf(t0), mkPLIBgs(∅ ⊕ h, ∅ ⊕ (h | true), h), alsf(t0), apcf(t0)), ∀ l. ((h | l) | t) | false = [], ∀ t0. lsf(t0).t = t0, ∀ t0. alsf(t0).t = t0 ⊦

Rule argument

Additional information

Proof step 13 from proof step-absstep-W6-W7-tau-same (previous step) (back to tree)

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

Additional information

Used terms: l0