Proof step 1 from proof step-absstep-ready-ready-callPSCCOMPLETE-same (conclusion) (back to tree)

System applied rule normalize

And obtained the following new goals

• Proof step 2:

  ags.pm = gs.mem, ags0.pm = ∅ ⊕ (ags0.h | true), ags.pm = ∅ ⊕ (ags.h | true), ls.t = als.t, lsf(t).t = t, alsf(t).t = t, ags.vm = gs.mem ⊕ gs.p, ags0.vm = ∅ ⊕ ags0.h, ags.vm = ∅ ⊕ ags.h, alsf(t) = als, apc = ready, apcf(t) = apc, gs0 = gstepf(gs, ls, ready, callPSCCOMPLETE(ls.t)), ls0 = lstepf(gs, ls, ready, callPSCCOMPLETE(ls.t)), lsf(t) = ls, lsf0(t) = ls0, pcf(t) = ready, pcf0(t) = ready, ready = pcstepf(gs, ls, ready, callPSCCOMPLETE(ls.t)), PLIBLInv(ags, als, apc), abs(ags.h, gs.readers, gs.p), allReadsOK(ags0.h), allReadsOK(ags.h), allWritesOK(ags0.h), allWritesOK(ags.h), ctrok(gs0.ctr, gs0.writers), ctrok(gs.ctr, gs.writers), noPendingW(t, gs0.p), noPendingW(t, gs.p), notMember(t, gs0.writers), notMember(t, gs0.readers), notMember(t, gs.writers), notMember(t, gs.readers), pendingOk(gs0.p), pendingOk(gs.p), pre(gs, ls, ready, callPSCCOMPLETE(ls.t)), writersOk(gs0.p, gs0.writers), writersOk(gs.p, gs.writers), pre(ags, als, apc, callTSync(ls.t)) → ags0 = gstepf(ags, als, apc, callTSync(ls.t)) ∧ als0 = lstepf(ags, als, apc, callTSync(ls.t)) ∧ apc0 = pcstepf(ags, als, apc, callTSync(ls.t)), ∀ l. ¬ FO(ls.t) ∈ gs.p(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 ⊦ pre(ags, als, apc, callTSync(ls.t)) ∧ (ags0.pm = gs0.mem ∧ ags0.vm = gs0.mem ⊕ gs0.p ∧ abs(ags0.h, gs0.readers, gs0.p)) ∧ ls0.t = als0.t ∧ apc0 = ready ∧ (∀ l. ¬ FO(ls0.t) ∈ gs0.p(l) → ((ags0.h | l) | ls0.t) | false = [])

Rule argument

Additional information

Proof step 2 from proof step-absstep-ready-ready-callPSCCOMPLETE-same (previous step) (back to tree)

User applied rule cut formula

And obtained the following new goals

• Proof step 3:

  ags.pm = ∅ ⊕ (ags.h | true), ags0.pm = ∅ ⊕ (ags0.h | true), ags.pm = gs.mem, alsf(t).t = t, lsf(t).t = t, ls.t = als.t, ags.vm = ∅ ⊕ ags.h, ags0.vm = ∅ ⊕ ags0.h, ags.vm = gs.mem ⊕ gs.p, alsf(t) = als, apc = ready, apcf(t) = apc, gs0 = gstepf(gs, ls, ready, callPSCCOMPLETE(ls.t)), ls0 = lstepf(gs, ls, ready, callPSCCOMPLETE(ls.t)), lsf(t) = ls, lsf0(t) = ls0, pcf(t) = ready, pcf0(t) = ready, ready = pcstepf(gs, ls, ready, callPSCCOMPLETE(ls.t)), PLIBLInv(ags, als, apc), abs(ags.h, gs.readers, gs.p), allReadsOK(ags.h), allReadsOK(ags0.h), allWritesOK(ags.h), allWritesOK(ags0.h), ctrok(gs.ctr, gs.writers), ctrok(gs0.ctr, gs0.writers), noPendingW(t, gs.p), noPendingW(t, gs0.p), notMember(t, gs.readers), notMember(t, gs.writers), notMember(t, gs0.readers), notMember(t, gs0.writers), pendingOk(gs.p), pendingOk(gs0.p), pre(gs, ls, ready, callPSCCOMPLETE(ls.t)), pre(ags, als, apc, callTSync(ls.t)), writersOk(gs.p, gs.writers), writersOk(gs0.p, gs0.writers), pre(ags, als, apc, callTSync(ls.t)) → ags0 = gstepf(ags, als, apc, callTSync(ls.t)) ∧ als0 = lstepf(ags, als, apc, callTSync(ls.t)) ∧ apc0 = pcstepf(ags, als, apc, callTSync(ls.t)), ∀ t0. t0 ≠ t → lsf(t0).t = t0, ∀ t0. t0 ≠ t → alsf(t0).t = t0, ∀ 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. ¬ FO(ls.t) ∈ gs.p(l) → ((ags.h | l) | ls.t) | false = [] ⊦ pre(ags, als, apc, callTSync(ls.t)) ∧ (ags0.pm = gs0.mem ∧ ags0.vm = gs0.mem ⊕ gs0.p ∧ abs(ags0.h, gs0.readers, gs0.p)) ∧ ls0.t = als0.t ∧ apc0 = ready ∧ (∀ l. ¬ FO(ls0.t) ∈ gs0.p(l) → ((ags0.h | l) | ls0.t) | false = [])

• Proof step 13:

  ags.pm = ∅ ⊕ (ags.h | true), ags0.pm = ∅ ⊕ (ags0.h | true), ags.pm = gs.mem, alsf(t).t = t, lsf(t).t = t, ls.t = als.t, ags.vm = ∅ ⊕ ags.h, ags0.vm = ∅ ⊕ ags0.h, ags.vm = gs.mem ⊕ gs.p, alsf(t) = als, apc = ready, apcf(t) = apc, gs0 = gstepf(gs, ls, ready, callPSCCOMPLETE(ls.t)), ls0 = lstepf(gs, ls, ready, callPSCCOMPLETE(ls.t)), lsf(t) = ls, lsf0(t) = ls0, pcf(t) = ready, pcf0(t) = ready, ready = pcstepf(gs, ls, ready, callPSCCOMPLETE(ls.t)), PLIBLInv(ags, als, apc), abs(ags.h, gs.readers, gs.p), allReadsOK(ags.h), allReadsOK(ags0.h), allWritesOK(ags.h), allWritesOK(ags0.h), ctrok(gs.ctr, gs.writers), ctrok(gs0.ctr, gs0.writers), noPendingW(t, gs.p), noPendingW(t, gs0.p), notMember(t, gs.readers), notMember(t, gs.writers), notMember(t, gs0.readers), notMember(t, gs0.writers), pendingOk(gs.p), pendingOk(gs0.p), pre(gs, ls, ready, callPSCCOMPLETE(ls.t)), writersOk(gs.p, gs.writers), writersOk(gs0.p, gs0.writers), ¬ pre(ags, als, apc, callTSync(ls.t)), pre(ags, als, apc, callTSync(ls.t)) → ags0 = gstepf(ags, als, apc, callTSync(ls.t)) ∧ als0 = lstepf(ags, als, apc, callTSync(ls.t)) ∧ apc0 = pcstepf(ags, als, apc, callTSync(ls.t)), ∀ t0. t0 ≠ t → lsf(t0).t = t0, ∀ t0. t0 ≠ t → alsf(t0).t = t0, ∀ 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. ¬ FO(ls.t) ∈ gs.p(l) → ((ags.h | l) | ls.t) | false = [] ⊦ pre(ags, als, apc, callTSync(ls.t)) ∧ (ags0.pm = gs0.mem ∧ ags0.vm = gs0.mem ⊕ gs0.p ∧ abs(ags0.h, gs0.readers, gs0.p)) ∧ ls0.t = als0.t ∧ apc0 = ready ∧ (∀ l. ¬ FO(ls0.t) ∈ gs0.p(l) → ((ags0.h | l) | ls0.t) | false = [])

Rule argument

Additional information

Used formulas: pre(ags, als, apc, callTSync(ls.t))

Proof step 3 from proof step-absstep-ready-ready-callPSCCOMPLETE-same (previous step) (back to tree)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 4:

  gs.mem = ∅ ⊕ (ags.h | true), ags.pm = gs.mem, lsf(t).t = t, alsf(t).t = t, ags.vm = ∅ ⊕ ags.h, ags.vm = gs.mem ⊕ gs.p, apcf(t) = ready, lsf0(t) = lsf(t), pcf(t) = ready, pcf0(t) = ready, (ags.h | t) | false = [], ((ags.h | l) | t) | false ≠ [], PLIBLInv(ags, alsf(t), ready), abs(ags.h, gs.readers, gs.p), allReadsOK(ags.h), allWritesOK(ags.h), ctrok(gs.ctr, gs.writers), noPendingW(t, gs.p), notMember(t, gs.writers), notMember(t, gs.readers), pendingOk(gs.p), writersOk(gs.p, gs.writers), ¬ FO(t) ∈ gs.p(l), ∀ l. ¬ FO(t) ∈ gs.p(l), ∀ t0. alsf(t0).t = t0, ∀ t0. lsf(t0).t = t0, ∀ l. ¬ FO(t) ∈ gs.p(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: ⊦ gstepf(gs, ls, ready, a) = gs; (s) ⊦ ls.t = t → pcstepf(gs, ls, ready, callTSync(t)) = ready; (s) ⊦ ls.t = t → lstepf(gs, ls, ready, callTSync(t)) = ls; (s) ⊦ AInvRead(t, l) ≠ callTSync(t0); (s) ⊦ AInvWrite(t, l, val) ≠ callTSync(t0); (s) ⊦ callTSync(t) = callTSync(t0) ↔ t = t0; (s) ⊦ pre(gs, ls, ready, a) ↔ a = callTSync(ls.t) ∧ (gs.h | ls.t) | false = [] ∨ (∃ l, v. a = AInvWrite(ls.t, l, v)) ∨ (∃ l. a = AInvRead(ls.t, l)); (s) ⊦ gstepf(gs, ls, ready, a) = gs; (s) ⊦ callPSCCOMPLETE(t) ≠ invFLITPSCREAD(t0, l); (s) ⊦ callPSCCOMPLETE(t) ≠ invFLITPSCWRITE(t0, l, v); (s) ⊦ pre(gs, ls, ready, a) ↔ (∃ l0, v0. a = invFLITPSCWRITE(ls.t, l0, v0)) ∨ (∃ l0. a = invFLITPSCREAD(ls.t, l0)) ∨ a = callPSCCOMPLETE(ls.t) ∧ (∀ l. ¬ FO(ls.t) ∈ gs.p(l)); (s) ⊦ ls.t = t → lstepf(gs, ls, ready, callPSCCOMPLETE(t)) = ls; (s) ⊦ ls.t = t → pcstepf(gs, ls, ready, callPSCCOMPLETE(t)) = ready; (s)

Proof step 4 from proof step-absstep-ready-ready-callPSCCOMPLETE-same (previous step) (back to tree)

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

• Proof step 5:

  gs.mem = ∅ ⊕ (h | true), alsf(t).t = t, lsf(t).t = t, ags = mkPLIBgs(mem, mem0, h), apcf(t) = ready, lsf0(t) = lsf(t), mem = gs.mem ⊕ gs.p, mem = ∅ ⊕ h, mem0 = gs.mem, pcf(t) = ready, pcf0(t) = ready, (h | t) | false = [], ((h | l) | t) | false ≠ [], PLIBLInv(ags, alsf(t), ready), abs(h, gs.readers, gs.p), allReadsOK(h), allWritesOK(h), ctrok(gs.ctr, gs.writers), noPendingW(t, gs.p), notMember(t, gs.readers), notMember(t, gs.writers), pendingOk(gs.p), writersOk(gs.p, gs.writers), ¬ FO(t) ∈ gs.p(l), ∀ 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. ¬ FO(t) ∈ gs.p(l) → ((h | l) | t) | false = [], ∀ t0. lsf(t0).t = t0, ∀ t0. alsf(t0).t = t0, ∀ l. ¬ FO(t) ∈ gs.p(l) ⊦

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 5 from proof step-absstep-ready-ready-callPSCCOMPLETE-same (previous step) (back to tree)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 6:

  gs.mem = ∅ ⊕ (h | true), lsf(t).t = t, alsf(t).t = t, apcf(t) = ready, lsf0(t) = lsf(t), pcf(t) = ready, pcf0(t) = ready, (h | t) | false = [], ∅ ⊕ h = gs.mem ⊕ gs.p, ((h | l) | t) | false ≠ [], PLIBLInv(mkPLIBgs(∅ ⊕ h, gs.mem, h), alsf(t), ready), abs(h, gs.readers, gs.p), allReadsOK(h), allWritesOK(h), ctrok(gs.ctr, gs.writers), noPendingW(t, gs.p), notMember(t, gs.writers), notMember(t, gs.readers), pendingOk(gs.p), writersOk(gs.p, gs.writers), ¬ FO(t) ∈ gs.p(l), ∀ l. ¬ FO(t) ∈ gs.p(l), ∀ t0. alsf(t0).t = t0, ∀ t0. lsf(t0).t = t0, ∀ l. ¬ FO(t) ∈ gs.p(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 6 from proof step-absstep-ready-ready-callPSCCOMPLETE-same (previous step) (back to tree)

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

• Proof step 7:

  alsf(t).t = t, lsf(t).t = t, apcf(t) = ready, gs = mkFLITPSCgs(mem, p, ctr, writers, writers0), lsf0(t) = lsf(t), mem = ∅ ⊕ (h | true), pcf(t) = ready, pcf0(t) = ready, (h | t) | false = [], ∅ ⊕ h = mem ⊕ p, ((h | l) | t) | false ≠ [], PLIBLInv(mkPLIBgs(∅ ⊕ h, mem, h), alsf(t), ready), abs(h, writers0, p), allReadsOK(h), allWritesOK(h), ctrok(ctr, writers), noPendingW(t, p), notMember(t, writers0), notMember(t, writers), pendingOk(p), writersOk(p, writers), ¬ FO(t) ∈ p(l), ∀ 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. ¬ FO(t) ∈ p(l) → ((h | l) | t) | false = [], ∀ t0. lsf(t0).t = t0, ∀ t0. alsf(t0).t = t0, ∀ l. ¬ FO(t) ∈ p(l) ⊦

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 7 from proof step-absstep-ready-ready-callPSCCOMPLETE-same (previous step) (back to tree)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 8:

  lsf(t).t = t, alsf(t).t = t, apcf(t) = ready, lsf0(t) = lsf(t), pcf(t) = ready, pcf0(t) = ready, (h | t) | false = [], ∅ ⊕ h = (∅ ⊕ (h | true)) ⊕ p, ((h | l) | t) | false ≠ [], PLIBLInv(mkPLIBgs(∅ ⊕ h, ∅ ⊕ (h | true), h), alsf(t), ready), abs(h, writers0, p), allReadsOK(h), allWritesOK(h), ctrok(ctr, writers), noPendingW(t, p), notMember(t, writers), notMember(t, writers0), pendingOk(p), writersOk(p, writers), ¬ FO(t) ∈ p(l), ∀ l. ¬ FO(t) ∈ p(l), ∀ t0. alsf(t0).t = t0, ∀ t0. lsf(t0).t = t0, ∀ l. ¬ FO(t) ∈ p(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 8 from proof step-absstep-ready-ready-callPSCCOMPLETE-same (previous step) (back to tree)

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

• Proof step 9:

  lsf(t).t = t, alsf(t) = mkPLIBls(t1, il, iv, ov), apcf(t) = ready, lsf0(t) = lsf(t), pcf(t) = ready, pcf0(t) = ready, t1 = t, (h | t) | false = [], ∅ ⊕ h = (∅ ⊕ (h | true)) ⊕ p, ((h | l) | t) | false ≠ [], PLIBLInv(mkPLIBgs(∅ ⊕ h, ∅ ⊕ (h | true), h), alsf(t), ready), abs(h, writers0, p), allReadsOK(h), allWritesOK(h), ctrok(ctr, writers), noPendingW(t, p), notMember(t, writers0), notMember(t, writers), pendingOk(p), writersOk(p, writers), ¬ FO(t) ∈ p(l), ∀ 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. ¬ FO(t) ∈ p(l) → ((h | l) | t) | false = [], ∀ t0. lsf(t0).t = t0, ∀ t0. alsf(t0).t = t0, ∀ l. ¬ FO(t) ∈ p(l) ⊦

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 9 from proof step-absstep-ready-ready-callPSCCOMPLETE-same (previous step) (back to tree)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 10:

  lsf(t).t = t, alsf(t) = mkPLIBls(t, il, iv, ov), apcf(t) = ready, lsf0(t) = lsf(t), pcf(t) = ready, pcf0(t) = ready, (h | t) | false = [], ∅ ⊕ h = (∅ ⊕ (h | true)) ⊕ p, ((h | l) | t) | false ≠ [], PLIBLInv(mkPLIBgs(∅ ⊕ h, ∅ ⊕ (h | true), h), mkPLIBls(t, il, iv, ov), ready), abs(h, writers0, p), allReadsOK(h), allWritesOK(h), ctrok(ctr, writers), noPendingW(t, p), notMember(t, writers), notMember(t, writers0), pendingOk(p), writersOk(p, writers), ¬ FO(t) ∈ p(l), ∀ l. ¬ FO(t) ∈ p(l), ∀ t0. alsf(t0).t = t0, ∀ t0. lsf(t0).t = t0, ∀ l. ¬ FO(t) ∈ p(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 10 from proof step-absstep-ready-ready-callPSCCOMPLETE-same (previous step) (back to tree)

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

• Proof step 11:

  alsf(t) = mkPLIBls(t, il, iv, ov), apcf(t) = ready, lsf(t) = mkFLITPSCls(t1, l0, v), lsf0(t) = lsf(t), pcf(t) = ready, pcf0(t) = ready, t1 = t, (h | t) | false = [], ∅ ⊕ h = (∅ ⊕ (h | true)) ⊕ p, ((h | l) | t) | false ≠ [], PLIBLInv(mkPLIBgs(∅ ⊕ h, ∅ ⊕ (h | true), h), mkPLIBls(t, il, iv, ov), ready), abs(h, writers0, p), allReadsOK(h), allWritesOK(h), ctrok(ctr, writers), noPendingW(t, p), notMember(t, writers0), notMember(t, writers), pendingOk(p), writersOk(p, writers), ¬ FO(t) ∈ p(l), ∀ 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. ¬ FO(t) ∈ p(l) → ((h | l) | t) | false = [], ∀ t0. lsf(t0).t = t0, ∀ t0. alsf(t0).t = t0, ∀ l. ¬ FO(t) ∈ p(l) ⊦

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, l0, v

Proof step 11 from proof step-absstep-ready-ready-callPSCCOMPLETE-same (previous step) (back to tree)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 12:

  alsf(t) = mkPLIBls(t, il, iv, ov), apcf(t) = ready, lsf(t) = mkFLITPSCls(t, l0, v), lsf0(t) = mkFLITPSCls(t, l0, v), pcf(t) = ready, pcf0(t) = ready, (h | t) | false = [], ∅ ⊕ h = (∅ ⊕ (h | true)) ⊕ p, ((h | l) | t) | false ≠ [], PLIBLInv(mkPLIBgs(∅ ⊕ h, ∅ ⊕ (h | true), h), mkPLIBls(t, il, iv, ov), ready), abs(h, writers0, p), allReadsOK(h), allWritesOK(h), ctrok(ctr, writers), noPendingW(t, p), notMember(t, writers), notMember(t, writers0), pendingOk(p), writersOk(p, writers), ¬ FO(t) ∈ p(l), ∀ l. ¬ FO(t) ∈ p(l), ∀ t0. alsf(t0).t = t0, ∀ t0. lsf(t0).t = t0, ∀ l. ¬ FO(t) ∈ p(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 12 from proof step-absstep-ready-ready-callPSCCOMPLETE-same (previous step) (back to tree)

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

Additional information

Used terms: l

Proof step 13 from proof step-absstep-ready-ready-callPSCCOMPLETE-same (previous step) (back to tree)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 14:

  gs.mem = ∅ ⊕ (ags.h | true), ags0.pm = ∅ ⊕ (ags0.h | true), ags.pm = gs.mem, alsf(t).t = t, lsf(t).t = t, ags.vm = ∅ ⊕ ags.h, ags0.vm = ∅ ⊕ ags0.h, ags.vm = gs.mem ⊕ gs.p, apcf(t) = ready, lsf0(t) = lsf(t), pcf(t) = ready, pcf0(t) = ready, (ags.h | t) | false ≠ [], PLIBLInv(ags, alsf(t), ready), abs(ags.h, gs.readers, gs.p), allReadsOK(ags.h), allReadsOK(ags0.h), allWritesOK(ags.h), allWritesOK(ags0.h), ctrok(gs.ctr, gs.writers), noPendingW(t, gs.p), notMember(t, gs.readers), notMember(t, gs.writers), pendingOk(gs.p), writersOk(gs.p, gs.writers), ∀ t0. lsf(t0).t = t0, ∀ t0. alsf(t0).t = t0, ∀ l. ¬ FO(t) ∈ gs.p(l), ∀ 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. ¬ FO(t) ∈ gs.p(l) → ((ags.h | l) | t) | false = [] ⊦

Rule argument

Additional information

Used simplifier rules: ⊦ AInvRead(t, l) ≠ callTSync(t0); (s) ⊦ AInvWrite(t, l, val) ≠ callTSync(t0); (s) ⊦ callTSync(t) = callTSync(t0) ↔ t = t0; (s) ⊦ pre(gs, ls, ready, a) ↔ a = callTSync(ls.t) ∧ (gs.h | ls.t) | false = [] ∨ (∃ l, v. a = AInvWrite(ls.t, l, v)) ∨ (∃ l. a = AInvRead(ls.t, l)); (s) ⊦ gstepf(gs, ls, ready, a) = gs; (s) ⊦ callPSCCOMPLETE(t) ≠ invFLITPSCREAD(t0, l); (s) ⊦ callPSCCOMPLETE(t) ≠ invFLITPSCWRITE(t0, l, v); (s) ⊦ pre(gs, ls, ready, a) ↔ (∃ l0, v0. a = invFLITPSCWRITE(ls.t, l0, v0)) ∨ (∃ l0. a = invFLITPSCREAD(ls.t, l0)) ∨ a = callPSCCOMPLETE(ls.t) ∧ (∀ l. ¬ FO(ls.t) ∈ gs.p(l)); (s) ⊦ ls.t = t → lstepf(gs, ls, ready, callPSCCOMPLETE(t)) = ls; (s) ⊦ ls.t = t → pcstepf(gs, ls, ready, callPSCCOMPLETE(t)) = ready; (s)

Proof step 14 from proof step-absstep-ready-ready-callPSCCOMPLETE-same (previous step) (back to tree)

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

• Proof step 15:

  gs.mem = ∅ ⊕ (h | true), ags0.pm = ∅ ⊕ (ags0.h | true), lsf(t).t = t, alsf(t).t = t, ags0.vm = ∅ ⊕ ags0.h, ags = mkPLIBgs(mem, mem0, h), apcf(t) = ready, lsf0(t) = lsf(t), mem = gs.mem ⊕ gs.p, mem = ∅ ⊕ h, mem0 = gs.mem, pcf(t) = ready, pcf0(t) = ready, (h | t) | false ≠ [], PLIBLInv(ags, alsf(t), ready), abs(h, gs.readers, gs.p), allReadsOK(ags0.h), allReadsOK(h), allWritesOK(ags0.h), allWritesOK(h), ctrok(gs.ctr, gs.writers), noPendingW(t, gs.p), notMember(t, gs.writers), notMember(t, gs.readers), pendingOk(gs.p), writersOk(gs.p, gs.writers), ∀ l. ¬ FO(t) ∈ gs.p(l) → ((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)), ∀ l. ¬ FO(t) ∈ gs.p(l), ∀ t0. alsf(t0).t = t0, ∀ t0. lsf(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 15 from proof step-absstep-ready-ready-callPSCCOMPLETE-same (previous step) (back to tree)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 16:

  gs.mem = ∅ ⊕ (h | true), ags0.pm = ∅ ⊕ (ags0.h | true), alsf(t).t = t, lsf(t).t = t, ags0.vm = ∅ ⊕ ags0.h, apcf(t) = ready, lsf0(t) = lsf(t), pcf(t) = ready, pcf0(t) = ready, ∅ ⊕ h = gs.mem ⊕ gs.p, (h | t) | false ≠ [], PLIBLInv(mkPLIBgs(∅ ⊕ h, gs.mem, h), alsf(t), ready), abs(h, gs.readers, gs.p), allReadsOK(h), allReadsOK(ags0.h), allWritesOK(h), allWritesOK(ags0.h), ctrok(gs.ctr, gs.writers), noPendingW(t, gs.p), notMember(t, gs.readers), notMember(t, gs.writers), pendingOk(gs.p), writersOk(gs.p, gs.writers), ∀ t0. lsf(t0).t = t0, ∀ t0. alsf(t0).t = t0, ∀ l. ¬ FO(t) ∈ gs.p(l), ∀ 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)), ∀ l. ¬ FO(t) ∈ gs.p(l) → ((h | l) | t) | false = [] ⊦

Rule argument

Additional information

Proof step 16 from proof step-absstep-ready-ready-callPSCCOMPLETE-same (previous step) (back to tree)

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

• Proof step 17:

  gs.mem = ∅ ⊕ (h | true), lsf(t).t = t, alsf(t).t = t, ags0 = mkPLIBgs(mem, mem0, h0), apcf(t) = ready, lsf0(t) = lsf(t), mem = ∅ ⊕ h0, mem0 = ∅ ⊕ (h0 | true), pcf(t) = ready, pcf0(t) = ready, ∅ ⊕ h = gs.mem ⊕ gs.p, (h | t) | false ≠ [], PLIBLInv(mkPLIBgs(∅ ⊕ h, gs.mem, h), alsf(t), ready), abs(h, gs.readers, gs.p), allReadsOK(h0), allReadsOK(h), allWritesOK(h0), allWritesOK(h), ctrok(gs.ctr, gs.writers), noPendingW(t, gs.p), notMember(t, gs.writers), notMember(t, gs.readers), pendingOk(gs.p), writersOk(gs.p, gs.writers), ∀ l. ¬ FO(t) ∈ gs.p(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)), ∀ l. ¬ FO(t) ∈ gs.p(l), ∀ t0. alsf(t0).t = t0, ∀ t0. lsf(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: ags0, mem, mem0, h0

Proof step 17 from proof step-absstep-ready-ready-callPSCCOMPLETE-same (previous step) (back to tree)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 18:

  gs.mem = ∅ ⊕ (h | true), alsf(t).t = t, lsf(t).t = t, apcf(t) = ready, lsf0(t) = lsf(t), pcf(t) = ready, pcf0(t) = ready, ∅ ⊕ h = gs.mem ⊕ gs.p, (h | t) | false ≠ [], PLIBLInv(mkPLIBgs(∅ ⊕ h, gs.mem, h), alsf(t), ready), abs(h, gs.readers, gs.p), allReadsOK(h), allReadsOK(h0), allWritesOK(h), allWritesOK(h0), ctrok(gs.ctr, gs.writers), noPendingW(t, gs.p), notMember(t, gs.readers), notMember(t, gs.writers), pendingOk(gs.p), writersOk(gs.p, gs.writers), ∀ t0. lsf(t0).t = t0, ∀ t0. alsf(t0).t = t0, ∀ l. ¬ FO(t) ∈ gs.p(l), ∀ 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)), ∀ l. ¬ FO(t) ∈ gs.p(l) → ((h | l) | t) | false = [] ⊦

Rule argument

Additional information

Proof step 18 from proof step-absstep-ready-ready-callPSCCOMPLETE-same (previous step) (back to tree)

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

• Proof step 19:

  lsf(t).t = t, alsf(t).t = t, apcf(t) = ready, gs = mkFLITPSCgs(mem, p, ctr, writers, writers0), lsf0(t) = lsf(t), mem = ∅ ⊕ (h | true), pcf(t) = ready, pcf0(t) = ready, ∅ ⊕ h = mem ⊕ p, (h | t) | false ≠ [], PLIBLInv(mkPLIBgs(∅ ⊕ h, mem, h), alsf(t), ready), abs(h, writers0, p), allReadsOK(h0), allReadsOK(h), allWritesOK(h0), allWritesOK(h), ctrok(ctr, writers), noPendingW(t, p), notMember(t, writers), notMember(t, writers0), pendingOk(p), writersOk(p, writers), ∀ l. ¬ FO(t) ∈ p(l) → ((h | l) | t) | false = [], ∀ 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. ¬ FO(t) ∈ p(l), ∀ t0. alsf(t0).t = t0, ∀ t0. lsf(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 19 from proof step-absstep-ready-ready-callPSCCOMPLETE-same (previous step) (back to tree)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 20:

  alsf(t).t = t, lsf(t).t = t, apcf(t) = ready, lsf0(t) = lsf(t), pcf(t) = ready, pcf0(t) = ready, ∅ ⊕ h = (∅ ⊕ (h | true)) ⊕ p, (h | t) | false ≠ [], PLIBLInv(mkPLIBgs(∅ ⊕ h, ∅ ⊕ (h | true), h), alsf(t), ready), abs(h, writers0, p), allReadsOK(h), allReadsOK(h0), allWritesOK(h), allWritesOK(h0), ctrok(ctr, writers), noPendingW(t, p), notMember(t, writers0), notMember(t, writers), pendingOk(p), writersOk(p, writers), ∀ t0. lsf(t0).t = t0, ∀ t0. alsf(t0).t = t0, ∀ l. ¬ FO(t) ∈ p(l), ∀ 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. ¬ FO(t) ∈ p(l) → ((h | l) | t) | false = [] ⊦

Rule argument

Additional information

Proof step 20 from proof step-absstep-ready-ready-callPSCCOMPLETE-same (previous step) (back to tree)

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

• Proof step 21:

  lsf(t).t = t, alsf(t) = mkPLIBls(t1, il, iv, ov), apcf(t) = ready, lsf0(t) = lsf(t), pcf(t) = ready, pcf0(t) = ready, t1 = t, ∅ ⊕ h = (∅ ⊕ (h | true)) ⊕ p, (h | t) | false ≠ [], PLIBLInv(mkPLIBgs(∅ ⊕ h, ∅ ⊕ (h | true), h), alsf(t), ready), abs(h, writers0, p), allReadsOK(h0), allReadsOK(h), allWritesOK(h0), allWritesOK(h), ctrok(ctr, writers), noPendingW(t, p), notMember(t, writers), notMember(t, writers0), pendingOk(p), writersOk(p, writers), ∀ l. ¬ FO(t) ∈ p(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)), ∀ l. ¬ FO(t) ∈ p(l), ∀ t0. alsf(t0).t = t0, ∀ t0. lsf(t0).t = 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 21 from proof step-absstep-ready-ready-callPSCCOMPLETE-same (previous step) (back to tree)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 22:

  lsf(t).t = t, alsf(t) = mkPLIBls(t, il, iv, ov), apcf(t) = ready, lsf0(t) = lsf(t), pcf(t) = ready, pcf0(t) = ready, ∅ ⊕ h = (∅ ⊕ (h | true)) ⊕ p, (h | t) | false ≠ [], PLIBLInv(mkPLIBgs(∅ ⊕ h, ∅ ⊕ (h | true), h), mkPLIBls(t, il, iv, ov), ready), abs(h, writers0, p), allReadsOK(h), allReadsOK(h0), allWritesOK(h), allWritesOK(h0), ctrok(ctr, writers), noPendingW(t, p), notMember(t, writers0), notMember(t, writers), pendingOk(p), writersOk(p, writers), ∀ t0. lsf(t0).t = t0, ∀ t0. alsf(t0).t = t0, ∀ l. ¬ FO(t) ∈ p(l), ∀ 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. ¬ FO(t) ∈ p(l) → ((h | l) | t) | false = [] ⊦

Rule argument

Additional information

Proof step 22 from proof step-absstep-ready-ready-callPSCCOMPLETE-same (previous step) (back to tree)

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

• Proof step 23:

  alsf(t) = mkPLIBls(t, il, iv, ov), apcf(t) = ready, lsf(t) = mkFLITPSCls(t1, l0, v), lsf0(t) = lsf(t), pcf(t) = ready, pcf0(t) = ready, t1 = t, ∅ ⊕ h = (∅ ⊕ (h | true)) ⊕ p, (h | t) | false ≠ [], PLIBLInv(mkPLIBgs(∅ ⊕ h, ∅ ⊕ (h | true), h), mkPLIBls(t, il, iv, ov), ready), abs(h, writers0, p), allReadsOK(h0), allReadsOK(h), allWritesOK(h0), allWritesOK(h), ctrok(ctr, writers), noPendingW(t, p), notMember(t, writers), notMember(t, writers0), pendingOk(p), writersOk(p, writers), ∀ l. ¬ FO(t) ∈ p(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)), ∀ l. ¬ FO(t) ∈ p(l), ∀ t0. alsf(t0).t = t0, ∀ t0. lsf(t0).t = 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, l0, v

Proof step 23 from proof step-absstep-ready-ready-callPSCCOMPLETE-same (previous step) (back to tree)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 24:

  alsf(t) = mkPLIBls(t, il, iv, ov), apcf(t) = ready, lsf(t) = mkFLITPSCls(t, l0, v), lsf0(t) = mkFLITPSCls(t, l0, v), pcf(t) = ready, pcf0(t) = ready, ∅ ⊕ h = (∅ ⊕ (h | true)) ⊕ p, (h | t) | false ≠ [], PLIBLInv(mkPLIBgs(∅ ⊕ h, ∅ ⊕ (h | true), h), mkPLIBls(t, il, iv, ov), ready), abs(h, writers0, p), allReadsOK(h), allReadsOK(h0), allWritesOK(h), allWritesOK(h0), ctrok(ctr, writers), noPendingW(t, p), notMember(t, writers0), notMember(t, writers), pendingOk(p), writersOk(p, writers), ∀ t0. lsf(t0).t = t0, ∀ t0. alsf(t0).t = t0, ∀ l. ¬ FO(t) ∈ p(l), ∀ 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. ¬ FO(t) ∈ p(l) → ((h | l) | t) | false = [] ⊦

Rule argument

Additional information

Proof step 24 from proof step-absstep-ready-ready-callPSCCOMPLETE-same (previous step) (back to tree)

User applied rule apply rewrite lemma

And obtained the following new goals

• Proof step 25:

  ⊦ (h | t) | false = [] ↔ (∀ l. ((h | l) | t) | false = [])

• Proof step 26:

  alsf(t) = mkPLIBls(t, il, iv, ov), apcf(t) = ready, lsf(t) = mkFLITPSCls(t, l0, v), lsf0(t) = mkFLITPSCls(t, l0, v), pcf(t) = ready, pcf0(t) = ready, ∅ ⊕ h = (∅ ⊕ (h | true)) ⊕ p, PLIBLInv(mkPLIBgs(∅ ⊕ h, ∅ ⊕ (h | true), h), mkPLIBls(t, il, iv, ov), ready), abs(h, writers0, p), allReadsOK(h0), allReadsOK(h), allWritesOK(h0), allWritesOK(h), ctrok(ctr, writers), noPendingW(t, p), notMember(t, writers), notMember(t, writers0), pendingOk(p), writersOk(p, writers), ∀ l. ¬ FO(t) ∈ p(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)), ∀ l. ¬ FO(t) ∈ p(l), ∀ t0. alsf(t0).t = t0, ∀ t0. lsf(t0).t = t0, ∃ l. ((h | l) | t) | false ≠ [] ⊦

Rule argument

Additional information

Used terms: h, t

Proof step 25 from proof step-absstep-ready-ready-callPSCCOMPLETE-same (previous step) (back to tree)

A spec-lemma

Proof step 26 from proof step-absstep-ready-ready-callPSCCOMPLETE-same (previous step) (back to tree)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 27:

  alsf(t) = mkPLIBls(t, il, iv, ov), apcf(t) = ready, lsf(t) = mkFLITPSCls(t, l0, v), lsf0(t) = mkFLITPSCls(t, l0, v), pcf(t) = ready, pcf0(t) = ready, ∅ ⊕ h = (∅ ⊕ (h | true)) ⊕ p, ((h | l) | t) | false ≠ [], PLIBLInv(mkPLIBgs(∅ ⊕ h, ∅ ⊕ (h | true), h), mkPLIBls(t, il, iv, ov), ready), abs(h, writers0, p), allReadsOK(h), allReadsOK(h0), allWritesOK(h), allWritesOK(h0), ctrok(ctr, writers), noPendingW(t, p), notMember(t, writers0), notMember(t, writers), pendingOk(p), writersOk(p, writers), ∀ t0. lsf(t0).t = t0, ∀ t0. alsf(t0).t = t0, ∀ l. ¬ FO(t) ∈ p(l), ∀ 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. ¬ FO(t) ∈ p(l) → ((h | l) | t) | false = [] ⊦

Rule argument

Additional information

Proof step 27 from proof step-absstep-ready-ready-callPSCCOMPLETE-same (previous step) (back to tree)

User applied rule all left

And obtained the following new goals

• Proof step 28:

  alsf(t) = mkPLIBls(t, il, iv, ov), apcf(t) = ready, lsf(t) = mkFLITPSCls(t, l0, v), lsf0(t) = mkFLITPSCls(t, l0, v), pcf(t) = ready, pcf0(t) = ready, ∅ ⊕ h = (∅ ⊕ (h | true)) ⊕ p, ((h | l) | t) | false ≠ [], PLIBLInv(mkPLIBgs(∅ ⊕ h, ∅ ⊕ (h | true), h), mkPLIBls(t, il, iv, ov), ready), abs(h, writers0, p), allReadsOK(h0), allReadsOK(h), allWritesOK(h0), allWritesOK(h), ctrok(ctr, writers), noPendingW(t, p), notMember(t, writers), notMember(t, writers0), pendingOk(p), writersOk(p, writers), ¬ FO(t) ∈ p(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)), ∀ l. ¬ FO(t) ∈ p(l), ∀ t0. alsf(t0).t = t0, ∀ t0. lsf(t0).t = t0 ⊦

Rule argument

Additional information

Used terms: l

Proof step 28 from proof step-absstep-ready-ready-callPSCCOMPLETE-same (previous step) (back to tree)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 29:

  alsf(t) = mkPLIBls(t, il, iv, ov), apcf(t) = ready, lsf(t) = mkFLITPSCls(t, l0, v), lsf0(t) = mkFLITPSCls(t, l0, v), pcf(t) = ready, pcf0(t) = ready, ∅ ⊕ h = (∅ ⊕ (h | true)) ⊕ p, ((h | l) | t) | false ≠ [], PLIBLInv(mkPLIBgs(∅ ⊕ h, ∅ ⊕ (h | true), h), mkPLIBls(t, il, iv, ov), ready), abs(h, writers0, p), allReadsOK(h), allReadsOK(h0), allWritesOK(h), allWritesOK(h0), ctrok(ctr, writers), noPendingW(t, p), notMember(t, writers0), notMember(t, writers), pendingOk(p), writersOk(p, writers), FO(t) ∈ p(l), ∀ t0. lsf(t0).t = t0, ∀ t0. alsf(t0).t = t0, ∀ l. ¬ FO(t) ∈ p(l), ∀ 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 29 from proof step-absstep-ready-ready-callPSCCOMPLETE-same (previous step) (back to tree)

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

Additional information

Used terms: l