[Imprint][Data Privacy Statement][E-Mail]



View long theorem info. View the proof. Back to main index. View the specification. View theorem base summary, View theorem base listing, the used properties by spec, the dependency list, the symbol table,

Proof step 1 from proof DQINV-Step (conclusion) (back to tree)

⊦ DQINV(dqs) ∧ DQstep(dqs, ca, dqs0) → DQINV(dqs0)

System applied rule normalize

And obtained the following new goals

Rule argument

Additional information

Proof step 2 from proof DQINV-Step (previous step) (back to tree)

DQINV(dqs), DQstep(dqs, ca, dqs0), ¬ DQINV(dqs0) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:DQINV-def, seq: ⊦ DQINV(dqs) ↔ DQInv(dqs.gstate, dqs.lsf, dqs.pcf) ∧ fininvdeq(dqs.pcf), subst:[dqs] → [dqs0], <all paths>

Additional information

Used terms: dqs0

Proof step 3 from proof DQINV-Step (previous step) (back to tree)

⊦ DQINV(dqs) ↔ DQInv(dqs.gstate, dqs.lsf, dqs.pcf) ∧ fininvdeq(dqs.pcf)

Lemma DQINV-def

Proof step 4 from proof DQINV-Step (previous step) (back to tree)

DQINV(dqs), DQstep(dqs, ca, dqs0), ¬ DQInv(dqs0.gstate, dqs0.lsf, dqs0.pcf) ∨ ¬ fininvdeq(dqs0.pcf) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:DQINV-def, seq: ⊦ DQINV(dqs) ↔ DQInv(dqs.gstate, dqs.lsf, dqs.pcf) ∧ fininvdeq(dqs.pcf), subst:[dqs] → [dqs], <all paths>

Additional information

Used terms: dqs

Proof step 5 from proof DQINV-Step (previous step) (back to tree)

⊦ DQINV(dqs) ↔ DQInv(dqs.gstate, dqs.lsf, dqs.pcf) ∧ fininvdeq(dqs.pcf)

Lemma DQINV-def

Proof step 6 from proof DQINV-Step (previous step) (back to tree)

DQInv(dqs.gstate, dqs.lsf, dqs.pcf), DQstep(dqs, ca, dqs0), fininvdeq(dqs.pcf), ¬ DQInv(dqs0.gstate, dqs0.lsf, dqs0.pcf) ∨ ¬ fininvdeq(dqs0.pcf) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 4

Additional information

Proof step 7 from proof DQINV-Step (previous step) (back to tree)

DQInv(dqs.gstate, dqs.lsf, dqs.pcf), DQstep(dqs, ca, dqs0), fininvdeq(dqs.pcf), ¬ DQInv(dqs0.gstate, dqs0.lsf, dqs0.pcf) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DQ-proofs, name:DQInv-thm, seq:⊦ DQInv(gs, lsf, pcf) ∧ DQstep(mkstate(gs, lsf, pcf), a, mkstate(gs0, lsf0, pcf0)) → DQInv(gs0, lsf0, pcf0), subst:[gs, lsf0, gs0, lsf, pcf0, a, pcf] → [dqs.gstate, dqs0.lsf, dqs0.gstate, dqs.lsf, dqs0.pcf, ca, dqs.pcf], <all paths>

Additional information

Used terms: dqs.gstate, dqs0.lsf, dqs0.gstate, dqs.lsf, dqs0.pcf, ca, dqs.pcf

Proof step 8 from proof DQINV-Step (previous step) (back to tree)

⊦ DQInv(gs, lsf, pcf) ∧ DQstep(mkstate(gs, lsf, pcf), a, mkstate(gs0, lsf0, pcf0)) → DQInv(gs0, lsf0, pcf0)

A spec-lemma

Proof step 9 from proof DQINV-Step (previous step) (back to tree)

DQInv(dqs.gstate, dqs.lsf, dqs.pcf), DQstep(dqs, ca, dqs0), fininvdeq(dqs.pcf), ¬ DQInv(dqs0.gstate, dqs0.lsf, dqs0.pcf) ⊦ DQInv(dqs.gstate, dqs.lsf, dqs.pcf) ∧ DQstep(mkstate(dqs.gstate, dqs.lsf, dqs.pcf), ca, mkstate(dqs0.gstate, dqs0.lsf, dqs0.pcf))

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 10 from proof DQINV-Step (previous step) (back to tree)

DQInv(dqs.gstate, dqs.lsf, dqs.pcf), DQstep(dqs, ca, dqs0), fininvdeq(dqs.pcf), ¬ DQInv(dqs0.gstate, dqs0.lsf, dqs0.pcf), ¬ DQstep(mkstate(dqs.gstate, dqs.lsf, dqs.pcf), ca, mkstate(dqs0.gstate, dqs0.lsf, dqs0.pcf)) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DQ, name:case-DQState, seq: ⊦ mkstate(s.gstate, s.lsf, s.pcf) = s, subst:[s] → [dqs], <all paths>

Additional information

Used terms: dqs

Proof step 11 from proof DQINV-Step (previous step) (back to tree)

⊦ mkstate(s.gstate, s.lsf, s.pcf) = s

A spec-lemma

Proof step 12 from proof DQINV-Step (previous step) (back to tree)

DQInv(dqs.gstate, dqs.lsf, dqs.pcf), DQstep(dqs, ca, dqs0), fininvdeq(dqs.pcf), ¬ DQInv(dqs0.gstate, dqs0.lsf, dqs0.pcf), ¬ DQstep(dqs, ca, mkstate(dqs0.gstate, dqs0.lsf, dqs0.pcf)) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DQ, name:case-DQState, seq: ⊦ mkstate(s.gstate, s.lsf, s.pcf) = s, subst:[s] → [dqs0], <all paths>

Additional information

Used terms: dqs0

Proof step 13 from proof DQINV-Step (previous step) (back to tree)

⊦ mkstate(s.gstate, s.lsf, s.pcf) = s

A spec-lemma

Proof step 14 from proof DQINV-Step (previous step) (back to tree)

DQInv(dqs.gstate, dqs.lsf, dqs.pcf), DQstep(dqs, ca, dqs0), fininvdeq(dqs.pcf), ¬ fininvdeq(dqs0.pcf) ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DQ, name:elim-mkstate, seq:⊦ (gstate = s.gstate ∧ lsf = s.lsf) ∧ pcf = s.pcf ↔ s = mkstate(gstate, lsf, pcf), subst:[s, gstate, lsf, pcf] → [dqs, gs, lsf, pcf]

Additional information

Used simplifier rules: ⊦ (gstate = s.gstate ∧ lsf = s.lsf) ∧ pcf = s.pcf ↔ s = mkstate(gstate, lsf, pcf); (elim) Used terms: dqs, gstate, lsf, pcf

Proof step 15 from proof DQINV-Step (previous step) (back to tree)

dqs = mkstate(gs, lsf, pcf), DQInv(gs, lsf, pcf), DQstep(dqs, ca, dqs0), fininvdeq(pcf), ¬ fininvdeq(dqs0.pcf) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ DQstep(mkstate(gs, lsf, pcf), a, dqs0) ↔ (a = globalCrash ⊃ dqs0 = mkstate(gs, lsf, λ tid. (pcf(tid) = idle ⊃ idle;crashed)) ;∃ tid. pre(gs, lsf(tid), pcf(tid), a) ∧ dqs0 = mkstate (gstepf(gs, lsf(tid), pcf(tid), a), lsf(tid; lstepf(gs, lsf(tid), pcf(tid), a)), pcf(tid; pcstepf(gs, lsf(tid), pcf(tid), a))) ); (s)

Proof step 16 from proof DQINV-Step (previous step) (back to tree)

DQInv(gs, lsf, pcf), fininvdeq(pcf), ¬ fininvdeq(dqs0.pcf), (ca = globalCrash ⊃ dqs0 = mkstate(gs, lsf, λ tid. (pcf(tid) = idle ⊃ idle;crashed)) ; pre(gs, lsf(tid), pcf(tid), ca) ∧ dqs0 = mkstate(gstepf(gs, lsf(tid), pcf(tid), ca), lsf(tid; lstepf(gs, lsf(tid), pcf(tid), ca)), pcf(tid; pcstepf(gs, lsf(tid), pcf(tid), ca))) ) ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DQ, name:elim-mkstate, seq:⊦ (gstate = s.gstate ∧ lsf = s.lsf) ∧ pcf = s.pcf ↔ s = mkstate(gstate, lsf, pcf), subst:[s, gstate, lsf, pcf] → [dqs0, gs0, lsf0, pcf0]

Additional information

Used simplifier rules: ⊦ (gstate = s.gstate ∧ lsf = s.lsf) ∧ pcf = s.pcf ↔ s = mkstate(gstate, lsf, pcf); (elim) Used terms: dqs0, gstate, lsf0, pcf0

Proof step 17 from proof DQINV-Step (previous step) (back to tree)

dqs0 = mkstate(gs0, lsf0, pcf0), DQInv(gs, lsf, pcf), fininvdeq(pcf), ¬ fininvdeq(pcf0), (ca = globalCrash ⊃ dqs0 = mkstate(gs, lsf, λ tid. (pcf(tid) = idle ⊃ idle;crashed)) ; pre(gs, lsf(tid), pcf(tid), ca) ∧ dqs0 = mkstate(gstepf(gs, lsf(tid), pcf(tid), ca), lsf(tid; lstepf(gs, lsf(tid), pcf(tid), ca)), pcf(tid; pcstepf(gs, lsf(tid), pcf(tid), ca))) ) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 18 from proof DQINV-Step (previous step) (back to tree)

DQInv(gs, lsf, pcf), fininvdeq(pcf), ¬ fininvdeq(pcf0), (ca = globalCrash ⊃ mkstate(gs0, lsf0, pcf0) = mkstate(gs, lsf, λ tid. (pcf(tid) = idle ⊃ idle;crashed)) ; pre(gs, lsf(tid), pcf(tid), ca) ∧ mkstate(gs0, lsf0, pcf0) = mkstate(gstepf(gs, lsf(tid), pcf(tid), ca), lsf(tid; lstepf(gs, lsf(tid), pcf(tid), ca)), pcf(tid; pcstepf(gs, lsf(tid), pcf(tid), ca))) ) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:fininvdeq, seq: ⊦ fininvdeq(pcf) ↔ (∃ tids. ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids), subst:[pcf] → [pcf], <all paths>

Additional information

Used terms: pcf

Proof step 19 from proof DQINV-Step (previous step) (back to tree)

⊦ fininvdeq(pcf) ↔ (∃ tids. ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids)

Lemma fininvdeq

Proof step 20 from proof DQINV-Step (previous step) (back to tree)

DQInv(gs, lsf, pcf), ¬ fininvdeq(pcf0), (ca = globalCrash ⊃ mkstate(gs0, lsf0, pcf0) = mkstate(gs, lsf, λ tid. (pcf(tid) = idle ⊃ idle;crashed)) ; pre(gs, lsf(tid), pcf(tid), ca) ∧ mkstate(gs0, lsf0, pcf0) = mkstate(gstepf(gs, lsf(tid), pcf(tid), ca), lsf(tid; lstepf(gs, lsf(tid), pcf(tid), ca)), pcf(tid; pcstepf(gs, lsf(tid), pcf(tid), ca))) ), ∃ tids. ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 21 from proof DQINV-Step (previous step) (back to tree)

DQInv(gs, lsf, pcf), ¬ fininvdeq(pcf0), (ca = globalCrash ⊃ mkstate(gs0, lsf0, pcf0) = mkstate(gs, lsf, λ tid. (pcf(tid) = idle ⊃ idle;crashed)) ; pre(gs, lsf(tid), pcf(tid), ca) ∧ mkstate(gs0, lsf0, pcf0) = mkstate(gstepf(gs, lsf(tid), pcf(tid), ca), lsf(tid; lstepf(gs, lsf(tid), pcf(tid), ca)), pcf(tid; pcstepf(gs, lsf(tid), pcf(tid), ca))) ), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:fininvdeq, seq: ⊦ fininvdeq(pcf) ↔ (∃ tids. ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids), subst:[pcf] → [pcf0], <all paths>

Additional information

Used terms: pcf0

Proof step 22 from proof DQINV-Step (previous step) (back to tree)

⊦ fininvdeq(pcf) ↔ (∃ tids. ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids)

Lemma fininvdeq

Proof step 23 from proof DQINV-Step (previous step) (back to tree)

DQInv(gs, lsf, pcf), (ca = globalCrash ⊃ mkstate(gs0, lsf0, pcf0) = mkstate(gs, lsf, λ tid. (pcf(tid) = idle ⊃ idle;crashed)) ; pre(gs, lsf(tid), pcf(tid), ca) ∧ mkstate(gs0, lsf0, pcf0) = mkstate(gstepf(gs, lsf(tid), pcf(tid), ca), lsf(tid; lstepf(gs, lsf(tid), pcf(tid), ca)), pcf(tid; pcstepf(gs, lsf(tid), pcf(tid), ca))) ), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tids. ¬(∀ tid. pcf0(tid) = invDeq ↔ tid ∈ tids) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 2

Additional information

Proof step 24 from proof DQINV-Step (previous step) (back to tree)

ca = globalCrash, mkstate(gs0, lsf0, pcf0) = mkstate(gs, lsf, λ tid. (pcf(tid) = idle ⊃ idle;crashed)), DQInv(gs, lsf, pcf), ∀ tids. ¬(∀ tid. pcf0(tid) = invDeq ↔ tid ∈ tids), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ crashed ≠ invDeq; (s) ⊦ idle ≠ invDeq; (s) ⊦ mkstate(gstate, lsf, pcf) = mkstate(gstate0, lsf0, pcf0) ↔ gstate = gstate0 ∧ lsf = lsf0 ∧ pcf = pcf0; (ws)

Proof step 25 from proof DQINV-Step (previous step) (back to tree)

DQInv(gs, lsf, pcf), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tids0. ¬(∀ tid. ¬ tid ∈ tids0) ⊦

User applied rule all left

And closed the goal!

Rule argument

pos: left 3 terms: ∅ abort: F discard: T computed: F

Additional information

Used simplifier rules: ⊦ ¬ a ∈ ∅; (s) Used terms: ∅

Proof step 26 from proof DQINV-Step (previous step) (back to tree)

mkstate(gs0, lsf0, pcf0) = mkstate(gstepf(gs, lsf(tid), pcf(tid), ca), lsf(tid; lstepf(gs, lsf(tid), pcf(tid), ca)), pcf(tid; pcstepf(gs, lsf(tid), pcf(tid), ca))), ca ≠ globalCrash, DQInv(gs, lsf, pcf), pre(gs, lsf(tid), pcf(tid), ca), ∀ tids. ¬(∀ tid. pcf0(tid) = invDeq ↔ tid ∈ tids), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ mkstate(gstate, lsf, pcf) = mkstate(gstate0, lsf0, pcf0) ↔ gstate = gstate0 ∧ lsf = lsf0 ∧ pcf = pcf0; (ws)

Proof step 27 from proof DQINV-Step (previous step) (back to tree)

ca ≠ globalCrash, DQInv(gs, lsf, pcf), pre(gs, lsf(tid), pcf(tid), ca), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tids0. ¬(∀ tid0. (tid = tid0 ⊃ pcstepf(gs, lsf(tid0), pcf(tid0), ca);pcf(tid0)) = invDeq ↔ tid0 ∈ tids0) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 5 terms: tids abort: F discard: F computed: T

Additional information

Used terms: tids

Proof step 28 from proof DQINV-Step (previous step) (back to tree)

ca ≠ globalCrash, DQInv(gs, lsf, pcf), pre(gs, lsf(tid), pcf(tid), ca), ∀ tids0. ¬(∀ tid0. (tid = tid0 ⊃ pcstepf(gs, lsf(tid0), pcf(tid0), ca);pcf(tid0)) = invDeq ↔ tid0 ∈ tids0), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦ ∀ tid0. (tid = tid0 ⊃ pcstepf(gs, lsf(tid0), pcf(tid0), ca);pcf(tid0)) = invDeq ↔ tid0 ∈ tids

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 29 from proof DQINV-Step (previous step) (back to tree)

¬((tid = tid0 ⊃ pcstepf(gs, lsf(tid0), pcf(tid0), ca);pcf(tid0)) = invDeq ↔ tid0 ∈ tids), ca ≠ globalCrash, DQInv(gs, lsf, pcf), pre(gs, lsf(tid), pcf(tid), ca), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tids0. ¬(∀ tid0. (tid = tid0 ⊃ pcstepf(gs, lsf(tid0), pcf(tid0), ca);pcf(tid0)) = invDeq ↔ tid0 ∈ tids0) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 6 terms: tids -- tid0 abort: F discard: F computed: F

Additional information

Used terms: tids -- tid0

Proof step 30 from proof DQINV-Step (previous step) (back to tree)

¬((tid = tid0 ⊃ pcstepf(gs, lsf(tid0), pcf(tid0), ca);pcf(tid0)) = invDeq ↔ tid0 ∈ tids), ca ≠ globalCrash, DQInv(gs, lsf, pcf), pre(gs, lsf(tid), pcf(tid), ca), ∀ tids0. ¬(∀ tid0. (tid = tid0 ⊃ pcstepf(gs, lsf(tid0), pcf(tid0), ca);pcf(tid0)) = invDeq ↔ tid0 ∈ tids0), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦ ∀ tid1. (tid = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), ca);pcf(tid1)) = invDeq ↔ tid1 ∈ tids -- tid0

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ a ∈ s -- b ↔ a ≠ b ∧ a ∈ s; (s)

Proof step 31 from proof DQINV-Step (previous step) (back to tree)

¬((tid = tid0 ⊃ pcstepf(gs, lsf(tid0), pcf(tid0), ca);pcf(tid0)) = invDeq ↔ tid0 ∈ tids), ¬((tid = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), ca);pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), ca ≠ globalCrash, DQInv(gs, lsf, pcf), pre(gs, lsf(tid), pcf(tid), ca), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tids0. ¬(∀ tid0. (tid = tid0 ⊃ pcstepf(gs, lsf(tid0), pcf(tid0), ca);pcf(tid0)) = invDeq ↔ tid0 ∈ tids0) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 7 terms: tids ++ tid0 abort: F discard: T computed: F

Additional information

Used terms: tids ++ tid0

Proof step 32 from proof DQINV-Step (previous step) (back to tree)

¬((tid = tid0 ⊃ pcstepf(gs, lsf(tid0), pcf(tid0), ca);pcf(tid0)) = invDeq ↔ tid0 ∈ tids), ¬((tid = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), ca);pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), ca ≠ globalCrash, DQInv(gs, lsf, pcf), pre(gs, lsf(tid), pcf(tid), ca), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦ ∀ tid1. (tid = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), ca);pcf(tid1)) = invDeq ↔ tid1 ∈ tids ++ tid0

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ a ∈ s ++ b ↔ a = b ∨ a ∈ s; (s)

Proof step 33 from proof DQINV-Step (previous step) (back to tree)

¬((tid = tid0 ⊃ pcstepf(gs, lsf(tid0), pcf(tid0), ca);pcf(tid0)) = invDeq ↔ tid0 ∈ tids), ¬((tid = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), ca);pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), ¬((tid = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), ca);pcf(tid2)) = invDeq ↔ tid2 = tid0 ∨ tid2 ∈ tids), ca ≠ globalCrash, DQInv(gs, lsf, pcf), pre(gs, lsf(tid), pcf(tid), ca), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DQ, name:DQInv, seq:⊦ DQInv(gs, lsf, pcf) ↔ DQGInv(gs) ∧ (∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid))), subst:[gs, lsf, pcf] → [gs, lsf, pcf], <all paths>

Additional information

Used terms: gs, lsf, pcf

Proof step 34 from proof DQINV-Step (previous step) (back to tree)

⊦ DQInv(gs, lsf, pcf) ↔ DQGInv(gs) ∧ (∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)))

A spec-lemma

Proof step 35 from proof DQINV-Step (previous step) (back to tree)

¬((tid = tid0 ⊃ pcstepf(gs, lsf(tid0), pcf(tid0), ca);pcf(tid0)) = invDeq ↔ tid0 ∈ tids), ¬((tid = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), ca);pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), ¬((tid = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), ca);pcf(tid2)) = invDeq ↔ tid2 = tid0 ∨ tid2 ∈ tids), ca ≠ globalCrash, DQGInv(gs), pre(gs, lsf(tid), pcf(tid), ca), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 8 terms: tid abort: F discard: F computed: F

Additional information

Used terms: tid

Proof step 36 from proof DQINV-Step (previous step) (back to tree)

lsf(tid).tid = tid, ¬((tid = tid0 ⊃ pcstepf(gs, lsf(tid0), pcf(tid0), ca);pcf(tid0)) = invDeq ↔ tid0 ∈ tids), ¬((tid = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), ca);pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), ¬((tid = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), ca);pcf(tid2)) = invDeq ↔ tid2 = tid0 ∨ tid2 ∈ tids), ca ≠ globalCrash, DQGInv(gs), DQLInv(gs, lsf(tid), pcf(tid)), pre(gs, lsf(tid), pcf(tid), ca), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DQ, name:elim-mkls, seq:⊦ ( ( ((tid = ls.tid ∧ (obsEmpty ↔ ls.obsEmpty)) ∧ ival = ls.ival) ∧ oval = ls.oval) ∧ value = ls.value) ∧ optval = ls.optval ↔ ls = mkls(tid, obsEmpty, ival, oval, value, optval), subst:[value, ival, obsEmpty, ls, oval, tid, optval] → [val0, val, obsEmpty, lsf(tid), optval, tid3, optval0]

Additional information

Used simplifier rules: ⊦ ( ( ((tid = ls.tid ∧ (obsEmpty ↔ ls.obsEmpty)) ∧ ival = ls.ival) ∧ oval = ls.oval) ∧ value = ls.value) ∧ optval = ls.optval ↔ ls = mkls(tid, obsEmpty, ival, oval, value, optval); (elim) Used terms: value, ival, obsEmpty, lsf(tid), oval, tid3, optval

Proof step 37 from proof DQINV-Step (previous step) (back to tree)

lsf(tid) = mkls(tid3, obsEmpty, val, optval, val0, optval0), tid3 = tid, ¬((tid = tid0 ⊃ pcstepf(gs, lsf(tid0), pcf(tid0), ca);pcf(tid0)) = invDeq ↔ tid0 ∈ tids), ¬((tid = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), ca);pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), ¬((tid = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), ca);pcf(tid2)) = invDeq ↔ tid2 = tid0 ∨ tid2 ∈ tids), ca ≠ globalCrash, DQGInv(gs), DQLInv(gs, lsf(tid), pcf(tid)), pre(gs, lsf(tid), pcf(tid), ca), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 38 from proof DQINV-Step (previous step) (back to tree)

lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), ¬((tid = tid0 ⊃ pcstepf(gs, lsf(tid0), pcf(tid0), ca);pcf(tid0)) = invDeq ↔ tid0 ∈ tids), ¬((tid = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), ca);pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), ¬((tid = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), ca);pcf(tid2)) = invDeq ↔ tid2 = tid0 ∨ tid2 ∈ tids), ca ≠ globalCrash, DQGInv(gs), DQLInv(gs, mkls(tid, obsEmpty, val, optval, val0, optval0), pcf(tid)), pre(gs, mkls(tid, obsEmpty, val, optval, val0, optval0), pcf(tid), ca), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦

User applied rule structural induction

And obtained the following new goals

Rule argument

term: pcf(tid)

Additional information

Used simplifier rules: DQPC freely generated by crashed, idle, invDeq, invEnq, ready, resDeq, resEnq;; ⊦ pre(gs, ls, crashed, a) ↔ false; (s)

Proof step 39 from proof DQINV-Step (previous step) (back to tree)

idle = pcf(tid), lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), ¬((tid = tid0 ⊃ pcstepf(gs, lsf(tid0), pcf(tid0), ca);pcf(tid0)) = invDeq ↔ tid0 ∈ tids), ¬((tid = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), ca);pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), ¬((tid = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), ca);pcf(tid2)) = invDeq ↔ tid2 = tid0 ∨ tid2 ∈ tids), ca ≠ globalCrash, DQGInv(gs), DQLInv(gs, mkls(tid, obsEmpty, val, optval, val0, optval0), pcf(tid)), pre(gs, mkls(tid, obsEmpty, val, optval, val0, optval0), pcf(tid), ca), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ callRun(tid) ≠ globalCrash; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).tid = tid; (s) ⊦ pre(gs, ls, idle, a) ↔ a = callRun(ls.tid); (s)

Proof step 40 from proof DQINV-Step (previous step) (back to tree)

idle = pcf(tid), lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), ¬((tid = tid0 ⊃ pcstepf(gs, lsf(tid0), pcf(tid0), callRun(tid0));pcf(tid0)) = invDeq ↔ tid0 ∈ tids), ¬((tid = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), callRun(tid1));pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), ¬((tid = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), callRun(tid2));pcf(tid2)) = invDeq ↔ tid2 = tid0 ∨ tid2 ∈ tids), DQGInv(gs), DQLInv(gs, mkls(tid, obsEmpty, val, optval, val0, optval0), idle), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 3

Additional information

Proof step 41 from proof DQINV-Step (previous step) (back to tree)

(tid = tid0 ⊃ pcstepf(gs, lsf(tid0), pcf(tid0), callRun(tid0));pcf(tid0)) = invDeq, idle = pcf(tid), lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), ¬((tid = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), callRun(tid1));pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), ¬((tid = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), callRun(tid2));pcf(tid2)) = invDeq ↔ tid2 = tid0 ∨ tid2 ∈ tids), DQGInv(gs), DQLInv(gs, mkls(tid, obsEmpty, val, optval, val0, optval0), idle), ¬ tid0 ∈ tids, ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 42 from proof DQINV-Step (previous step) (back to tree)

(tid = tid0 ⊃ pcstepf(gs, lsf(tid0), pcf(tid0), callRun(tid0));pcf(tid0)) = invDeq, idle = pcf(tid), lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), ¬((tid = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), callRun(tid2));pcf(tid2)) = invDeq ↔ tid2 = tid0 ∨ tid2 ∈ tids), ¬((tid = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), callRun(tid1));pcf(tid1)) = invDeq ↔ tid1 ∈ tids), DQGInv(gs), DQLInv(gs, mkls(tid, obsEmpty, val, optval, val0, optval0), idle), ¬ tid0 ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 1

Additional information

Used simplifier rules: ⊦ pcstepf (gs, mkls(tid, obsEmpty, ival, oval, value, optval), idle, callRun(tid)) = ready; (s) ⊦ invDeq ≠ ready; (s)

Proof step 43 from proof DQINV-Step (previous step) (back to tree)

idle = pcf(tid), lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), pcf(tid0) = invDeq, ¬((tid = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), callRun(tid2));pcf(tid2)) = invDeq ↔ tid2 = tid0 ∨ tid2 ∈ tids), ¬((tid = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), callRun(tid1));pcf(tid1)) = invDeq ↔ tid1 ∈ tids), tid ≠ tid0, DQGInv(gs), DQLInv(gs, mkls(tid, obsEmpty, val, optval, val0, optval0), idle), ¬ tid0 ∈ tids, ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 10 terms: tid0

Additional information

Used terms: tid0

Proof step 44 from proof DQINV-Step (previous step) (back to tree)

idle = pcf(tid), lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), (tid = tid0 ⊃ pcstepf(gs, lsf(tid0), pcf(tid0), callRun(tid0));pcf(tid0)) ≠ invDeq, ¬((tid = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), callRun(tid1));pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), ¬((tid = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), callRun(tid2));pcf(tid2)) = invDeq ↔ tid2 = tid0 ∨ tid2 ∈ tids), DQGInv(gs), DQLInv(gs, mkls(tid, obsEmpty, val, optval, val0, optval0), idle), tid0 ∈ tids, ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: size-zero-01: ⊦ s ≠ ∅ → # s ≠ 0; (forward) from specification set-basic[tidset] ne-01: ⊦ a ∈ s → s ≠ ∅; (forward) from specification set-basic[tidset]

Proof step 45 from proof DQINV-Step (previous step) (back to tree)

idle = pcf(tid), lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), # tids ≠ 0, (tid = tid0 ⊃ pcstepf(gs, lsf(tid0), pcf(tid0), callRun(tid0));pcf(tid0)) ≠ invDeq, ¬((tid = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), callRun(tid2));pcf(tid2)) = invDeq ↔ tid2 ∈ tids), ¬((tid = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), callRun(tid1));pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), tids ≠ ∅, DQGInv(gs), DQLInv(gs, mkls(tid, obsEmpty, val, optval, val0, optval0), idle), tid0 ∈ tids, ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 4

Additional information

Proof step 46 from proof DQINV-Step (previous step) (back to tree)

idle = pcf(tid), lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), tid = tid0, # tids ≠ 0, ¬((tid = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), callRun(tid2));pcf(tid2)) = invDeq ↔ tid2 ∈ tids), ¬((tid = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), callRun(tid1));pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), pcstepf(gs, lsf(tid0), pcf(tid0), callRun(tid0)) ≠ invDeq, tids ≠ ∅, DQGInv(gs), DQLInv(gs, mkls(tid, obsEmpty, val, optval, val0, optval0), idle), tid0 ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ invDeq ≠ ready; (s) ⊦ pcstepf (gs, mkls(tid, obsEmpty, ival, oval, value, optval), idle, callRun(tid)) = ready; (s)

Proof step 47 from proof DQINV-Step (previous step) (back to tree)

idle = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), # tids ≠ 0, ¬((tid0 = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), callRun(tid1));pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), ¬((tid0 = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), callRun(tid2));pcf(tid2)) = invDeq ↔ tid2 ∈ tids), tids ≠ ∅, DQGInv(gs), DQLInv(gs, mkls(tid0, obsEmpty, val, optval, val0, optval0), idle), tid0 ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦

User applied rule all left

And closed the goal!

Rule argument

pos: left 11 terms: tid0 abort: F discard: F computed: T

Additional information

Used simplifier rules: ⊦ idle ≠ invDeq; (s) Used terms: tid0

Proof step 48 from proof DQINV-Step (previous step) (back to tree)

idle = pcf(tid), lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), # tids ≠ 0, ¬((tid = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), callRun(tid2));pcf(tid2)) = invDeq ↔ tid2 ∈ tids), ¬((tid = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), callRun(tid1));pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), pcf(tid0) ≠ invDeq, tid ≠ tid0, tids ≠ ∅, DQGInv(gs), DQLInv(gs, mkls(tid, obsEmpty, val, optval, val0, optval0), idle), tid0 ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 13 terms: tid0

Additional information

Used terms: tid0

Proof step 49 from proof DQINV-Step (previous step) (back to tree)

invDeq = pcf(tid), lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), ¬((tid = tid0 ⊃ pcstepf(gs, lsf(tid0), pcf(tid0), ca);pcf(tid0)) = invDeq ↔ tid0 ∈ tids), ¬((tid = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), ca);pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), ¬((tid = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), ca);pcf(tid2)) = invDeq ↔ tid2 = tid0 ∨ tid2 ∈ tids), ca ≠ globalCrash, DQGInv(gs), DQLInv(gs, mkls(tid, obsEmpty, val, optval, val0, optval0), pcf(tid)), pre(gs, mkls(tid, obsEmpty, val, optval, val0, optval0), pcf(tid), ca), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).tid = tid; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).obsEmpty ↔ obsEmpty; (s) ⊦ pre(gs, ls, invDeq, a) ↔ a = CheckEmp(ls.tid) ∧ gs.queue = [] ∨ a = DoDeqEmpty(ls.tid) ∧ ls.obsEmpty ∨ a = DoDeq(ls.tid) ∧ gs.queue ≠ []; (s)

Proof step 50 from proof DQINV-Step (previous step) (back to tree)

invDeq = pcf(tid), lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), ¬((tid = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), ca);pcf(tid2)) = invDeq ↔ tid2 = tid0 ∨ tid2 ∈ tids), ¬((tid = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), ca);pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), ¬((tid = tid0 ⊃ pcstepf(gs, lsf(tid0), pcf(tid0), ca);pcf(tid0)) = invDeq ↔ tid0 ∈ tids), ca ≠ globalCrash, DQGInv(gs), DQLInv(gs, mkls(tid, obsEmpty, val, optval, val0, optval0), invDeq), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)), ca = CheckEmp(tid) ∧ gs.queue = [] ∨ ca = DoDeqEmpty(tid) ∧ obsEmpty ∨ ca = DoDeq(tid) ∧ gs.queue ≠ [] ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DQ, name:elim-mkgs, seq: ⊦ queue = gs.queue ↔ gs = mkgs(queue), subst:[gs, queue] → [gs, queue]

Additional information

Used simplifier rules: ⊦ queue = gs.queue ↔ gs = mkgs(queue); (elim) Used terms: gs, queue

Proof step 51 from proof DQINV-Step (previous step) (back to tree)

gs = mkgs(queue), invDeq = pcf(tid), lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), ¬((tid = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), ca);pcf(tid2)) = invDeq ↔ tid2 = tid0 ∨ tid2 ∈ tids), ¬((tid = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), ca);pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), ¬((tid = tid0 ⊃ pcstepf(gs, lsf(tid0), pcf(tid0), ca);pcf(tid0)) = invDeq ↔ tid0 ∈ tids), ca ≠ globalCrash, DQGInv(gs), DQLInv(gs, mkls(tid, obsEmpty, val, optval, val0, optval0), invDeq), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ca = CheckEmp(tid) ∧ queue = [] ∨ ca = DoDeqEmpty(tid) ∧ obsEmpty ∨ ca = DoDeq(tid) ∧ queue ≠ [] ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 52 from proof DQINV-Step (previous step) (back to tree)

invDeq = pcf(tid), lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), ¬((tid = tid2 ⊃ pcstepf(mkgs(queue), lsf(tid2), pcf(tid2), ca);pcf(tid2)) = invDeq ↔ tid2 = tid0 ∨ tid2 ∈ tids), ¬((tid = tid1 ⊃ pcstepf(mkgs(queue), lsf(tid1), pcf(tid1), ca);pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), ¬((tid = tid0 ⊃ pcstepf(mkgs(queue), lsf(tid0), pcf(tid0), ca);pcf(tid0)) = invDeq ↔ tid0 ∈ tids), ca ≠ globalCrash, DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid, obsEmpty, val, optval, val0, optval0), invDeq), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ca = CheckEmp(tid) ∧ queue = [] ∨ ca = DoDeqEmpty(tid) ∧ obsEmpty ∨ ca = DoDeq(tid) ∧ queue ≠ [] ⊦

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: ca

Additional information

Used simplifier rules: DQAction freely generated by globalCrash, τ, CheckEmp, DoDeq, DoDeqEmpty, DoEnq, InvDeq, InvEnq, RetDeq, RetEnq, callRun ;; ⊦ callRun(tid) ≠ globalCrash; (s) ⊦ CheckEmp(tid) ≠ callRun(tid0); (s) ⊦ DoDeqEmpty(tid) ≠ callRun(tid0); (s) ⊦ DoDeq(tid) ≠ callRun(tid0); (s) ⊦ RetEnq(tid) ≠ globalCrash; (s) ⊦ CheckEmp(tid) ≠ RetEnq(tid0); (s) ⊦ DoDeqEmpty(tid) ≠ RetEnq(tid0); (s) ⊦ DoDeq(tid) ≠ RetEnq(tid0); (s) ⊦ RetDeq(tid, optval) ≠ globalCrash; (s) ⊦ CheckEmp(tid) ≠ RetDeq(tid0, optval); (s) ⊦ DoDeqEmpty(tid) ≠ RetDeq(tid0, optval); (s) ⊦ DoDeq(tid) ≠ RetDeq(tid0, optval); (s) ⊦ InvEnq(tid, val) ≠ globalCrash; (s) ⊦ CheckEmp(tid) ≠ InvEnq(tid0, val); (s) ⊦ DoDeqEmpty(tid) ≠ InvEnq(tid0, val); (s) ⊦ DoDeq(tid) ≠ InvEnq(tid0, val); (s) ⊦ InvDeq(tid) ≠ globalCrash; (s) ⊦ CheckEmp(tid) ≠ InvDeq(tid0); (s) ⊦ DoDeqEmpty(tid) ≠ InvDeq(tid0); (s) ⊦ DoDeq(tid) ≠ InvDeq(tid0); (s) ⊦ DoEnq(tid) ≠ globalCrash; (s) ⊦ CheckEmp(tid) ≠ DoEnq(tid0); (s) ⊦ DoDeqEmpty(tid) ≠ DoEnq(tid0); (s) ⊦ DoDeq(tid) ≠ DoEnq(tid0); (s) ⊦ globalCrash ≠ τ; (s) ⊦ CheckEmp(tid) ≠ τ; (s) ⊦ DoDeqEmpty(tid) ≠ τ; (s) ⊦ DoDeq(tid) ≠ τ; (s)

Proof step 53 from proof DQINV-Step (previous step) (back to tree)

ca = CheckEmp(tid3), invDeq = pcf(tid), lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), ¬((tid = tid2 ⊃ pcstepf(mkgs(queue), lsf(tid2), pcf(tid2), ca);pcf(tid2)) = invDeq ↔ tid2 = tid0 ∨ tid2 ∈ tids), ¬((tid = tid1 ⊃ pcstepf(mkgs(queue), lsf(tid1), pcf(tid1), ca);pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), ¬((tid = tid0 ⊃ pcstepf(mkgs(queue), lsf(tid0), pcf(tid0), ca);pcf(tid0)) = invDeq ↔ tid0 ∈ tids), ca ≠ globalCrash, DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid, obsEmpty, val, optval, val0, optval0), invDeq), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ca = CheckEmp(tid) ∧ queue = [] ∨ ca = DoDeqEmpty(tid) ∧ obsEmpty ∨ ca = DoDeq(tid) ∧ queue ≠ [] ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ CheckEmp(tid) ≠ DoDeq(tid0); (s) ⊦ CheckEmp(tid) ≠ DoDeqEmpty(tid0); (s) ⊦ CheckEmp(tid) = CheckEmp(tid0) ↔ tid = tid0; (s) ⊦ CheckEmp(tid) ≠ globalCrash; (s)

Proof step 54 from proof DQINV-Step (previous step) (back to tree)

invDeq = pcf(tid), lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), ¬((tid = tid0 ⊃ pcstepf(mkgs([]), lsf(tid0), pcf(tid0), CheckEmp(tid0));pcf(tid0)) = invDeq ↔ tid0 ∈ tids), ¬((tid = tid1 ⊃ pcstepf(mkgs([]), lsf(tid1), pcf(tid1), CheckEmp(tid1));pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), ¬((tid = tid2 ⊃ pcstepf(mkgs([]), lsf(tid2), pcf(tid2), CheckEmp(tid2));pcf(tid2)) = invDeq ↔ tid2 = tid0 ∨ tid2 ∈ tids), DQGInv(mkgs([])), DQLInv(mkgs([]), mkls(tid, obsEmpty, val, optval, val0, optval0), invDeq), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs([]), lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 3

Additional information

Proof step 55 from proof DQINV-Step (previous step) (back to tree)

(tid = tid0 ⊃ pcstepf(mkgs([]), lsf(tid0), pcf(tid0), CheckEmp(tid0));pcf(tid0)) = invDeq, invDeq = pcf(tid), lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), ¬((tid = tid1 ⊃ pcstepf(mkgs([]), lsf(tid1), pcf(tid1), CheckEmp(tid1));pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), ¬((tid = tid2 ⊃ pcstepf(mkgs([]), lsf(tid2), pcf(tid2), CheckEmp(tid2));pcf(tid2)) = invDeq ↔ tid2 = tid0 ∨ tid2 ∈ tids), DQGInv(mkgs([])), DQLInv(mkgs([]), mkls(tid, obsEmpty, val, optval, val0, optval0), invDeq), ¬ tid0 ∈ tids, ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs([]), lsf(tid), pcf(tid)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 56 from proof DQINV-Step (previous step) (back to tree)

(tid = tid0 ⊃ pcstepf(mkgs([]), lsf(tid0), pcf(tid0), CheckEmp(tid0));pcf(tid0)) = invDeq, invDeq = pcf(tid), lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), ¬((tid = tid2 ⊃ pcstepf(mkgs([]), lsf(tid2), pcf(tid2), CheckEmp(tid2));pcf(tid2)) = invDeq ↔ tid2 = tid0 ∨ tid2 ∈ tids), ¬((tid = tid1 ⊃ pcstepf(mkgs([]), lsf(tid1), pcf(tid1), CheckEmp(tid1));pcf(tid1)) = invDeq ↔ tid1 ∈ tids), DQGInv(mkgs([])), DQLInv(mkgs([]), mkls(tid, obsEmpty, val, optval, val0, optval0), invDeq), ¬ tid0 ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs([]), lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 1

Additional information

Proof step 57 from proof DQINV-Step (previous step) (back to tree)

invDeq = pcf(tid), lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), pcstepf(mkgs([]), lsf(tid0), pcf(tid0), CheckEmp(tid0)) = invDeq, tid = tid0, ¬((tid = tid2 ⊃ pcstepf(mkgs([]), lsf(tid2), pcf(tid2), CheckEmp(tid2));pcf(tid2)) = invDeq ↔ tid2 = tid0 ∨ tid2 ∈ tids), ¬((tid = tid1 ⊃ pcstepf(mkgs([]), lsf(tid1), pcf(tid1), CheckEmp(tid1));pcf(tid1)) = invDeq ↔ tid1 ∈ tids), DQGInv(mkgs([])), DQLInv(mkgs([]), mkls(tid, obsEmpty, val, optval, val0, optval0), invDeq), ¬ tid0 ∈ tids, ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs([]), lsf(tid), pcf(tid)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ pcstepf (gs, mkls(tid, obsEmpty, ival, oval, value, optval), invDeq, CheckEmp(tid)) = invDeq; (s)

Proof step 58 from proof DQINV-Step (previous step) (back to tree)

invDeq = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), ¬((tid0 = tid1 ⊃ pcstepf(mkgs([]), lsf(tid1), pcf(tid1), CheckEmp(tid1));pcf(tid1)) = invDeq ↔ tid1 ∈ tids), ¬((tid0 = tid2 ⊃ pcstepf(mkgs([]), lsf(tid2), pcf(tid2), CheckEmp(tid2));pcf(tid2)) = invDeq ↔ tid2 = tid0 ∨ tid2 ∈ tids), DQGInv(mkgs([])), DQLInv(mkgs([]), mkls(tid0, obsEmpty, val, optval, val0, optval0), invDeq), ¬ tid0 ∈ tids, ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs([]), lsf(tid), pcf(tid)) ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 8 terms: tid0

Additional information

Used terms: tid0

Proof step 59 from proof DQINV-Step (previous step) (back to tree)

invDeq = pcf(tid), lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), pcf(tid0) = invDeq, ¬((tid = tid2 ⊃ pcstepf(mkgs([]), lsf(tid2), pcf(tid2), CheckEmp(tid2));pcf(tid2)) = invDeq ↔ tid2 = tid0 ∨ tid2 ∈ tids), ¬((tid = tid1 ⊃ pcstepf(mkgs([]), lsf(tid1), pcf(tid1), CheckEmp(tid1));pcf(tid1)) = invDeq ↔ tid1 ∈ tids), tid ≠ tid0, DQGInv(mkgs([])), DQLInv(mkgs([]), mkls(tid, obsEmpty, val, optval, val0, optval0), invDeq), ¬ tid0 ∈ tids, ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs([]), lsf(tid), pcf(tid)) ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 10 terms: tid0

Additional information

Used terms: tid0

Proof step 60 from proof DQINV-Step (previous step) (back to tree)

invDeq = pcf(tid), lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), (tid = tid0 ⊃ pcstepf(mkgs([]), lsf(tid0), pcf(tid0), CheckEmp(tid0));pcf(tid0)) ≠ invDeq, ¬((tid = tid1 ⊃ pcstepf(mkgs([]), lsf(tid1), pcf(tid1), CheckEmp(tid1));pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), ¬((tid = tid2 ⊃ pcstepf(mkgs([]), lsf(tid2), pcf(tid2), CheckEmp(tid2));pcf(tid2)) = invDeq ↔ tid2 = tid0 ∨ tid2 ∈ tids), DQGInv(mkgs([])), DQLInv(mkgs([]), mkls(tid, obsEmpty, val, optval, val0, optval0), invDeq), tid0 ∈ tids, ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs([]), lsf(tid), pcf(tid)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: size-zero-01: ⊦ s ≠ ∅ → # s ≠ 0; (forward) from specification set-basic[tidset] ne-01: ⊦ a ∈ s → s ≠ ∅; (forward) from specification set-basic[tidset]

Proof step 61 from proof DQINV-Step (previous step) (back to tree)

invDeq = pcf(tid), lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), # tids ≠ 0, (tid = tid0 ⊃ pcstepf(mkgs([]), lsf(tid0), pcf(tid0), CheckEmp(tid0));pcf(tid0)) ≠ invDeq, ¬((tid = tid2 ⊃ pcstepf(mkgs([]), lsf(tid2), pcf(tid2), CheckEmp(tid2));pcf(tid2)) = invDeq ↔ tid2 ∈ tids), ¬((tid = tid1 ⊃ pcstepf(mkgs([]), lsf(tid1), pcf(tid1), CheckEmp(tid1));pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), tids ≠ ∅, DQGInv(mkgs([])), DQLInv(mkgs([]), mkls(tid, obsEmpty, val, optval, val0, optval0), invDeq), tid0 ∈ tids, ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs([]), lsf(tid), pcf(tid)) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 4

Additional information

Used simplifier rules: ⊦ pcstepf (gs, mkls(tid, obsEmpty, ival, oval, value, optval), invDeq, CheckEmp(tid)) = invDeq; (s)

Proof step 62 from proof DQINV-Step (previous step) (back to tree)

invDeq = pcf(tid), lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), # tids ≠ 0, ¬((tid = tid2 ⊃ pcstepf(mkgs([]), lsf(tid2), pcf(tid2), CheckEmp(tid2));pcf(tid2)) = invDeq ↔ tid2 ∈ tids), ¬((tid = tid1 ⊃ pcstepf(mkgs([]), lsf(tid1), pcf(tid1), CheckEmp(tid1));pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), pcf(tid0) ≠ invDeq, tid ≠ tid0, tids ≠ ∅, DQGInv(mkgs([])), DQLInv(mkgs([]), mkls(tid, obsEmpty, val, optval, val0, optval0), invDeq), tid0 ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs([]), lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 13 terms: tid0

Additional information

Used terms: tid0

Proof step 63 from proof DQINV-Step (previous step) (back to tree)

ca = DoDeq(tid3), invDeq = pcf(tid), lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), ¬((tid = tid2 ⊃ pcstepf(mkgs(queue), lsf(tid2), pcf(tid2), ca);pcf(tid2)) = invDeq ↔ tid2 = tid0 ∨ tid2 ∈ tids), ¬((tid = tid1 ⊃ pcstepf(mkgs(queue), lsf(tid1), pcf(tid1), ca);pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), ¬((tid = tid0 ⊃ pcstepf(mkgs(queue), lsf(tid0), pcf(tid0), ca);pcf(tid0)) = invDeq ↔ tid0 ∈ tids), ca ≠ globalCrash, DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid, obsEmpty, val, optval, val0, optval0), invDeq), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ca = CheckEmp(tid) ∧ queue = [] ∨ ca = DoDeqEmpty(tid) ∧ obsEmpty ∨ ca = DoDeq(tid) ∧ queue ≠ [] ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ DoDeq(tid) = DoDeq(tid0) ↔ tid = tid0; (s) ⊦ DoDeq(tid) ≠ DoDeqEmpty(tid0); (s) ⊦ CheckEmp(tid) ≠ DoDeq(tid0); (s) ⊦ DoDeq(tid) ≠ globalCrash; (s)

Proof step 64 from proof DQINV-Step (previous step) (back to tree)

invDeq = pcf(tid), lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), ¬((tid = tid0 ⊃ pcstepf(mkgs(queue), lsf(tid0), pcf(tid0), DoDeq(tid0));pcf(tid0)) = invDeq ↔ tid0 ∈ tids), ¬((tid = tid1 ⊃ pcstepf(mkgs(queue), lsf(tid1), pcf(tid1), DoDeq(tid1));pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), ¬((tid = tid2 ⊃ pcstepf(mkgs(queue), lsf(tid2), pcf(tid2), DoDeq(tid2));pcf(tid2)) = invDeq ↔ tid2 = tid0 ∨ tid2 ∈ tids), queue ≠ [], DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid, obsEmpty, val, optval, val0, optval0), invDeq), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 3

Additional information

Proof step 65 from proof DQINV-Step (previous step) (back to tree)

(tid = tid0 ⊃ pcstepf(mkgs(queue), lsf(tid0), pcf(tid0), DoDeq(tid0));pcf(tid0)) = invDeq, invDeq = pcf(tid), lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), ¬((tid = tid1 ⊃ pcstepf(mkgs(queue), lsf(tid1), pcf(tid1), DoDeq(tid1));pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), ¬((tid = tid2 ⊃ pcstepf(mkgs(queue), lsf(tid2), pcf(tid2), DoDeq(tid2));pcf(tid2)) = invDeq ↔ tid2 = tid0 ∨ tid2 ∈ tids), queue ≠ [], DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid, obsEmpty, val, optval, val0, optval0), invDeq), ¬ tid0 ∈ tids, ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 66 from proof DQINV-Step (previous step) (back to tree)

(tid = tid0 ⊃ pcstepf(mkgs(queue), lsf(tid0), pcf(tid0), DoDeq(tid0));pcf(tid0)) = invDeq, invDeq = pcf(tid), lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), ¬((tid = tid2 ⊃ pcstepf(mkgs(queue), lsf(tid2), pcf(tid2), DoDeq(tid2));pcf(tid2)) = invDeq ↔ tid2 = tid0 ∨ tid2 ∈ tids), ¬((tid = tid1 ⊃ pcstepf(mkgs(queue), lsf(tid1), pcf(tid1), DoDeq(tid1));pcf(tid1)) = invDeq ↔ tid1 ∈ tids), queue ≠ [], DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid, obsEmpty, val, optval, val0, optval0), invDeq), ¬ tid0 ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 1

Additional information

Used simplifier rules: ⊦ pcstepf (gs, mkls(tid, obsEmpty, ival, oval, value, optval), invDeq, DoDeq(tid)) = resDeq; (s) ⊦ invDeq ≠ resDeq; (s)

Proof step 67 from proof DQINV-Step (previous step) (back to tree)

invDeq = pcf(tid), lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), pcf(tid0) = invDeq, ¬((tid = tid2 ⊃ pcstepf(mkgs(queue), lsf(tid2), pcf(tid2), DoDeq(tid2));pcf(tid2)) = invDeq ↔ tid2 = tid0 ∨ tid2 ∈ tids), ¬((tid = tid1 ⊃ pcstepf(mkgs(queue), lsf(tid1), pcf(tid1), DoDeq(tid1));pcf(tid1)) = invDeq ↔ tid1 ∈ tids), queue ≠ [], tid ≠ tid0, DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid, obsEmpty, val, optval, val0, optval0), invDeq), ¬ tid0 ∈ tids, ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 11 terms: tid0

Additional information

Used terms: tid0

Proof step 68 from proof DQINV-Step (previous step) (back to tree)

invDeq = pcf(tid), lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), (tid = tid0 ⊃ pcstepf(mkgs(queue), lsf(tid0), pcf(tid0), DoDeq(tid0));pcf(tid0)) ≠ invDeq, ¬((tid = tid1 ⊃ pcstepf(mkgs(queue), lsf(tid1), pcf(tid1), DoDeq(tid1));pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), ¬((tid = tid2 ⊃ pcstepf(mkgs(queue), lsf(tid2), pcf(tid2), DoDeq(tid2));pcf(tid2)) = invDeq ↔ tid2 = tid0 ∨ tid2 ∈ tids), queue ≠ [], DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid, obsEmpty, val, optval, val0, optval0), invDeq), tid0 ∈ tids, ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: size-zero-01: ⊦ s ≠ ∅ → # s ≠ 0; (forward) from specification set-basic[tidset] ne-01: ⊦ a ∈ s → s ≠ ∅; (forward) from specification set-basic[tidset]

Proof step 69 from proof DQINV-Step (previous step) (back to tree)

invDeq = pcf(tid), lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), # tids ≠ 0, (tid = tid0 ⊃ pcstepf(mkgs(queue), lsf(tid0), pcf(tid0), DoDeq(tid0));pcf(tid0)) ≠ invDeq, ¬((tid = tid2 ⊃ pcstepf(mkgs(queue), lsf(tid2), pcf(tid2), DoDeq(tid2));pcf(tid2)) = invDeq ↔ tid2 ∈ tids), ¬((tid = tid1 ⊃ pcstepf(mkgs(queue), lsf(tid1), pcf(tid1), DoDeq(tid1));pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), queue ≠ [], tids ≠ ∅, DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid, obsEmpty, val, optval, val0, optval0), invDeq), tid0 ∈ tids, ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 4

Additional information

Proof step 70 from proof DQINV-Step (previous step) (back to tree)

invDeq = pcf(tid), lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), tid = tid0, # tids ≠ 0, ¬((tid = tid2 ⊃ pcstepf(mkgs(queue), lsf(tid2), pcf(tid2), DoDeq(tid2));pcf(tid2)) = invDeq ↔ tid2 ∈ tids), ¬((tid = tid1 ⊃ pcstepf(mkgs(queue), lsf(tid1), pcf(tid1), DoDeq(tid1));pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), pcstepf(mkgs(queue), lsf(tid0), pcf(tid0), DoDeq(tid0)) ≠ invDeq, queue ≠ [], tids ≠ ∅, DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid, obsEmpty, val, optval, val0, optval0), invDeq), tid0 ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ invDeq ≠ resDeq; (s) ⊦ pcstepf (gs, mkls(tid, obsEmpty, ival, oval, value, optval), invDeq, DoDeq(tid)) = resDeq; (s)

Proof step 71 from proof DQINV-Step (previous step) (back to tree)

invDeq = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), # tids ≠ 0, ¬((tid0 = tid1 ⊃ pcstepf(mkgs(queue), lsf(tid1), pcf(tid1), DoDeq(tid1));pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), ¬((tid0 = tid2 ⊃ pcstepf(mkgs(queue), lsf(tid2), pcf(tid2), DoDeq(tid2));pcf(tid2)) = invDeq ↔ tid2 ∈ tids), queue ≠ [], tids ≠ ∅, DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), invDeq), tid0 ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 5

Additional information

Proof step 72 from proof DQINV-Step (previous step) (back to tree)

(tid0 = tid2 ⊃ pcstepf(mkgs(queue), lsf(tid2), pcf(tid2), DoDeq(tid2));pcf(tid2)) = invDeq, invDeq = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), # tids ≠ 0, ¬((tid0 = tid1 ⊃ pcstepf(mkgs(queue), lsf(tid1), pcf(tid1), DoDeq(tid1));pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), queue ≠ [], tids ≠ ∅, DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), invDeq), tid0 ∈ tids, ¬ tid2 ∈ tids, ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 73 from proof DQINV-Step (previous step) (back to tree)

invDeq = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), pcf(tid2) = invDeq, # tids ≠ 0, ¬((tid0 = tid1 ⊃ pcstepf(mkgs(queue), lsf(tid1), pcf(tid1), DoDeq(tid1));pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), queue ≠ [], tids ≠ ∅, DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), invDeq), tid0 ∈ tids, ¬ tid2 ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 13 terms: tid2

Additional information

Used terms: tid2

Proof step 74 from proof DQINV-Step (previous step) (back to tree)

invDeq = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), # tids ≠ 0, (tid0 = tid2 ⊃ pcstepf(mkgs(queue), lsf(tid2), pcf(tid2), DoDeq(tid2));pcf(tid2)) ≠ invDeq, ¬((tid0 = tid1 ⊃ pcstepf(mkgs(queue), lsf(tid1), pcf(tid1), DoDeq(tid1));pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), queue ≠ [], tids ≠ ∅, DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), invDeq), tid0 ∈ tids, tid2 ∈ tids, ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 4

Additional information

Proof step 75 from proof DQINV-Step (previous step) (back to tree)

invDeq = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), tid0 = tid2, # tids ≠ 0, ¬((tid0 = tid1 ⊃ pcstepf(mkgs(queue), lsf(tid1), pcf(tid1), DoDeq(tid1));pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), pcstepf(mkgs(queue), lsf(tid2), pcf(tid2), DoDeq(tid2)) ≠ invDeq, queue ≠ [], tids ≠ ∅, DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), invDeq), tid2 ∈ tids, tid0 ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ invDeq ≠ resDeq; (s) ⊦ pcstepf (gs, mkls(tid, obsEmpty, ival, oval, value, optval), invDeq, DoDeq(tid)) = resDeq; (s)

Proof step 76 from proof DQINV-Step (previous step) (back to tree)

invDeq = pcf(tid2), lsf(tid2) = mkls(tid2, obsEmpty, val, optval, val0, optval0), # tids ≠ 0, ¬((tid2 = tid1 ⊃ pcstepf(mkgs(queue), lsf(tid1), pcf(tid1), DoDeq(tid1));pcf(tid1)) = invDeq ↔ tid1 ≠ tid2 ∧ tid1 ∈ tids), queue ≠ [], tids ≠ ∅, DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid2, obsEmpty, val, optval, val0, optval0), invDeq), tid2 ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 4

Additional information

Proof step 77 from proof DQINV-Step (previous step) (back to tree)

(tid2 = tid1 ⊃ pcstepf(mkgs(queue), lsf(tid1), pcf(tid1), DoDeq(tid1));pcf(tid1)) = invDeq, invDeq = pcf(tid2), lsf(tid2) = mkls(tid2, obsEmpty, val, optval, val0, optval0), # tids ≠ 0, queue ≠ [], tids ≠ ∅, DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid2, obsEmpty, val, optval, val0, optval0), invDeq), tid2 ∈ tids, ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦ tid1 ≠ tid2 ∧ tid1 ∈ tids

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 1

Additional information

Used simplifier rules: ⊦ pcstepf (gs, mkls(tid, obsEmpty, ival, oval, value, optval), invDeq, DoDeq(tid)) = resDeq; (s) ⊦ invDeq ≠ resDeq; (s)

Proof step 78 from proof DQINV-Step (previous step) (back to tree)

invDeq = pcf(tid2), lsf(tid2) = mkls(tid2, obsEmpty, val, optval, val0, optval0), pcf(tid1) = invDeq, # tids ≠ 0, queue ≠ [], tid2 ≠ tid1, tids ≠ ∅, DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid2, obsEmpty, val, optval, val0, optval0), invDeq), tid2 ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦ tid1 ≠ tid2 ∧ tid1 ∈ tids

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 79 from proof DQINV-Step (previous step) (back to tree)

invDeq = pcf(tid2), lsf(tid2) = mkls(tid2, obsEmpty, val, optval, val0, optval0), pcf(tid1) = invDeq, # tids ≠ 0, queue ≠ [], tid2 ≠ tid1, tids ≠ ∅, DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid2, obsEmpty, val, optval, val0, optval0), invDeq), tid2 ∈ tids, ¬ tid1 ∈ tids, ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 12 terms: tid1

Additional information

Used terms: tid1

Proof step 80 from proof DQINV-Step (previous step) (back to tree)

invDeq = pcf(tid2), lsf(tid2) = mkls(tid2, obsEmpty, val, optval, val0, optval0), # tids ≠ 0, (tid2 = tid1 ⊃ pcstepf(mkgs(queue), lsf(tid1), pcf(tid1), DoDeq(tid1));pcf(tid1)) ≠ invDeq, queue ≠ [], tid1 ≠ tid2, tids ≠ ∅, DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid2, obsEmpty, val, optval, val0, optval0), invDeq), tid2 ∈ tids, tid1 ∈ tids, ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 81 from proof DQINV-Step (previous step) (back to tree)

invDeq = pcf(tid2), lsf(tid2) = mkls(tid2, obsEmpty, val, optval, val0, optval0), # tids ≠ 0, pcf(tid1) ≠ invDeq, queue ≠ [], tid1 ≠ tid2, tids ≠ ∅, DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid2, obsEmpty, val, optval, val0, optval0), invDeq), tid1 ∈ tids, tid2 ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 13 terms: tid1

Additional information

Used terms: tid1

Proof step 82 from proof DQINV-Step (previous step) (back to tree)

invDeq = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), # tids ≠ 0, ¬((tid0 = tid1 ⊃ pcstepf(mkgs(queue), lsf(tid1), pcf(tid1), DoDeq(tid1));pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), pcf(tid2) ≠ invDeq, queue ≠ [], tid0 ≠ tid2, tids ≠ ∅, DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, obsEmpty, val, optval, val0, optval0), invDeq), tid2 ∈ tids, tid0 ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 14 terms: tid2

Additional information

Used terms: tid2

Proof step 83 from proof DQINV-Step (previous step) (back to tree)

invDeq = pcf(tid), lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), # tids ≠ 0, ¬((tid = tid2 ⊃ pcstepf(mkgs(queue), lsf(tid2), pcf(tid2), DoDeq(tid2));pcf(tid2)) = invDeq ↔ tid2 ∈ tids), ¬((tid = tid1 ⊃ pcstepf(mkgs(queue), lsf(tid1), pcf(tid1), DoDeq(tid1));pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), pcf(tid0) ≠ invDeq, queue ≠ [], tid ≠ tid0, tids ≠ ∅, DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid, obsEmpty, val, optval, val0, optval0), invDeq), tid0 ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 14 terms: tid0

Additional information

Used terms: tid0

Proof step 84 from proof DQINV-Step (previous step) (back to tree)

ca = DoDeqEmpty(tid3), invDeq = pcf(tid), lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), ¬((tid = tid2 ⊃ pcstepf(mkgs(queue), lsf(tid2), pcf(tid2), ca);pcf(tid2)) = invDeq ↔ tid2 = tid0 ∨ tid2 ∈ tids), ¬((tid = tid1 ⊃ pcstepf(mkgs(queue), lsf(tid1), pcf(tid1), ca);pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), ¬((tid = tid0 ⊃ pcstepf(mkgs(queue), lsf(tid0), pcf(tid0), ca);pcf(tid0)) = invDeq ↔ tid0 ∈ tids), ca ≠ globalCrash, DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid, obsEmpty, val, optval, val0, optval0), invDeq), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ca = CheckEmp(tid) ∧ queue = [] ∨ ca = DoDeqEmpty(tid) ∧ obsEmpty ∨ ca = DoDeq(tid) ∧ queue ≠ [] ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ DoDeq(tid) ≠ DoDeqEmpty(tid0); (s) ⊦ DoDeqEmpty(tid) = DoDeqEmpty(tid0) ↔ tid = tid0; (s) ⊦ CheckEmp(tid) ≠ DoDeqEmpty(tid0); (s) ⊦ DoDeqEmpty(tid) ≠ globalCrash; (s)

Proof step 85 from proof DQINV-Step (previous step) (back to tree)

invDeq = pcf(tid), lsf(tid) = mkls(tid, true, val, optval, val0, optval0), ¬((tid = tid0 ⊃ pcstepf(mkgs(queue), lsf(tid0), pcf(tid0), DoDeqEmpty(tid0));pcf(tid0)) = invDeq ↔ tid0 ∈ tids), ¬((tid = tid1 ⊃ pcstepf(mkgs(queue), lsf(tid1), pcf(tid1), DoDeqEmpty(tid1));pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), ¬((tid = tid2 ⊃ pcstepf(mkgs(queue), lsf(tid2), pcf(tid2), DoDeqEmpty(tid2));pcf(tid2)) = invDeq ↔ tid2 = tid0 ∨ tid2 ∈ tids), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid, true, val, optval, val0, optval0), invDeq), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 3

Additional information

Proof step 86 from proof DQINV-Step (previous step) (back to tree)

(tid = tid0 ⊃ pcstepf(mkgs(queue), lsf(tid0), pcf(tid0), DoDeqEmpty(tid0));pcf(tid0)) = invDeq, invDeq = pcf(tid), lsf(tid) = mkls(tid, true, val, optval, val0, optval0), ¬((tid = tid1 ⊃ pcstepf(mkgs(queue), lsf(tid1), pcf(tid1), DoDeqEmpty(tid1));pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), ¬((tid = tid2 ⊃ pcstepf(mkgs(queue), lsf(tid2), pcf(tid2), DoDeqEmpty(tid2));pcf(tid2)) = invDeq ↔ tid2 = tid0 ∨ tid2 ∈ tids), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid, true, val, optval, val0, optval0), invDeq), ¬ tid0 ∈ tids, ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 87 from proof DQINV-Step (previous step) (back to tree)

(tid = tid0 ⊃ pcstepf(mkgs(queue), lsf(tid0), pcf(tid0), DoDeqEmpty(tid0));pcf(tid0)) = invDeq, invDeq = pcf(tid), lsf(tid) = mkls(tid, true, val, optval, val0, optval0), ¬((tid = tid2 ⊃ pcstepf(mkgs(queue), lsf(tid2), pcf(tid2), DoDeqEmpty(tid2));pcf(tid2)) = invDeq ↔ tid2 = tid0 ∨ tid2 ∈ tids), ¬((tid = tid1 ⊃ pcstepf(mkgs(queue), lsf(tid1), pcf(tid1), DoDeqEmpty(tid1));pcf(tid1)) = invDeq ↔ tid1 ∈ tids), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid, true, val, optval, val0, optval0), invDeq), ¬ tid0 ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 1

Additional information

Used simplifier rules: ⊦ pcstepf (gs, mkls(tid, obsEmpty, ival, oval, value, optval), invDeq, DoDeqEmpty(tid)) = resDeq; (s) ⊦ invDeq ≠ resDeq; (s)

Proof step 88 from proof DQINV-Step (previous step) (back to tree)

invDeq = pcf(tid), lsf(tid) = mkls(tid, true, val, optval, val0, optval0), pcf(tid0) = invDeq, ¬((tid = tid2 ⊃ pcstepf(mkgs(queue), lsf(tid2), pcf(tid2), DoDeqEmpty(tid2));pcf(tid2)) = invDeq ↔ tid2 = tid0 ∨ tid2 ∈ tids), ¬((tid = tid1 ⊃ pcstepf(mkgs(queue), lsf(tid1), pcf(tid1), DoDeqEmpty(tid1));pcf(tid1)) = invDeq ↔ tid1 ∈ tids), tid ≠ tid0, DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid, true, val, optval, val0, optval0), invDeq), ¬ tid0 ∈ tids, ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 10 terms: tid0

Additional information

Used terms: tid0

Proof step 89 from proof DQINV-Step (previous step) (back to tree)

invDeq = pcf(tid), lsf(tid) = mkls(tid, true, val, optval, val0, optval0), (tid = tid0 ⊃ pcstepf(mkgs(queue), lsf(tid0), pcf(tid0), DoDeqEmpty(tid0));pcf(tid0)) ≠ invDeq, ¬((tid = tid1 ⊃ pcstepf(mkgs(queue), lsf(tid1), pcf(tid1), DoDeqEmpty(tid1));pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), ¬((tid = tid2 ⊃ pcstepf(mkgs(queue), lsf(tid2), pcf(tid2), DoDeqEmpty(tid2));pcf(tid2)) = invDeq ↔ tid2 = tid0 ∨ tid2 ∈ tids), DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid, true, val, optval, val0, optval0), invDeq), tid0 ∈ tids, ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: size-zero-01: ⊦ s ≠ ∅ → # s ≠ 0; (forward) from specification set-basic[tidset] ne-01: ⊦ a ∈ s → s ≠ ∅; (forward) from specification set-basic[tidset]

Proof step 90 from proof DQINV-Step (previous step) (back to tree)

invDeq = pcf(tid), lsf(tid) = mkls(tid, true, val, optval, val0, optval0), # tids ≠ 0, (tid = tid0 ⊃ pcstepf(mkgs(queue), lsf(tid0), pcf(tid0), DoDeqEmpty(tid0));pcf(tid0)) ≠ invDeq, ¬((tid = tid2 ⊃ pcstepf(mkgs(queue), lsf(tid2), pcf(tid2), DoDeqEmpty(tid2));pcf(tid2)) = invDeq ↔ tid2 ∈ tids), ¬((tid = tid1 ⊃ pcstepf(mkgs(queue), lsf(tid1), pcf(tid1), DoDeqEmpty(tid1));pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), tids ≠ ∅, DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid, true, val, optval, val0, optval0), invDeq), tid0 ∈ tids, ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 4

Additional information

Proof step 91 from proof DQINV-Step (previous step) (back to tree)

invDeq = pcf(tid), lsf(tid) = mkls(tid, true, val, optval, val0, optval0), tid = tid0, # tids ≠ 0, ¬((tid = tid2 ⊃ pcstepf(mkgs(queue), lsf(tid2), pcf(tid2), DoDeqEmpty(tid2));pcf(tid2)) = invDeq ↔ tid2 ∈ tids), ¬((tid = tid1 ⊃ pcstepf(mkgs(queue), lsf(tid1), pcf(tid1), DoDeqEmpty(tid1));pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), pcstepf(mkgs(queue), lsf(tid0), pcf(tid0), DoDeqEmpty(tid0)) ≠ invDeq, tids ≠ ∅, DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid, true, val, optval, val0, optval0), invDeq), tid0 ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ invDeq ≠ resDeq; (s) ⊦ pcstepf (gs, mkls(tid, obsEmpty, ival, oval, value, optval), invDeq, DoDeqEmpty(tid)) = resDeq; (s)

Proof step 92 from proof DQINV-Step (previous step) (back to tree)

invDeq = pcf(tid0), lsf(tid0) = mkls(tid0, true, val, optval, val0, optval0), # tids ≠ 0, ¬((tid0 = tid1 ⊃ pcstepf(mkgs(queue), lsf(tid1), pcf(tid1), DoDeqEmpty(tid1));pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), ¬((tid0 = tid2 ⊃ pcstepf(mkgs(queue), lsf(tid2), pcf(tid2), DoDeqEmpty(tid2));pcf(tid2)) = invDeq ↔ tid2 ∈ tids), tids ≠ ∅, DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, true, val, optval, val0, optval0), invDeq), tid0 ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 5

Additional information

Proof step 93 from proof DQINV-Step (previous step) (back to tree)

(tid0 = tid2 ⊃ pcstepf(mkgs(queue), lsf(tid2), pcf(tid2), DoDeqEmpty(tid2));pcf(tid2)) = invDeq, invDeq = pcf(tid0), lsf(tid0) = mkls(tid0, true, val, optval, val0, optval0), # tids ≠ 0, ¬((tid0 = tid1 ⊃ pcstepf(mkgs(queue), lsf(tid1), pcf(tid1), DoDeqEmpty(tid1));pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), tids ≠ ∅, DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, true, val, optval, val0, optval0), invDeq), tid0 ∈ tids, ¬ tid2 ∈ tids, ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 94 from proof DQINV-Step (previous step) (back to tree)

invDeq = pcf(tid0), lsf(tid0) = mkls(tid0, true, val, optval, val0, optval0), pcf(tid2) = invDeq, # tids ≠ 0, ¬((tid0 = tid1 ⊃ pcstepf(mkgs(queue), lsf(tid1), pcf(tid1), DoDeqEmpty(tid1));pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), tids ≠ ∅, DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, true, val, optval, val0, optval0), invDeq), tid0 ∈ tids, ¬ tid2 ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 12 terms: tid2

Additional information

Used terms: tid2

Proof step 95 from proof DQINV-Step (previous step) (back to tree)

invDeq = pcf(tid0), lsf(tid0) = mkls(tid0, true, val, optval, val0, optval0), # tids ≠ 0, (tid0 = tid2 ⊃ pcstepf(mkgs(queue), lsf(tid2), pcf(tid2), DoDeqEmpty(tid2));pcf(tid2)) ≠ invDeq, ¬((tid0 = tid1 ⊃ pcstepf(mkgs(queue), lsf(tid1), pcf(tid1), DoDeqEmpty(tid1));pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), tids ≠ ∅, DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, true, val, optval, val0, optval0), invDeq), tid0 ∈ tids, tid2 ∈ tids, ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 4

Additional information

Proof step 96 from proof DQINV-Step (previous step) (back to tree)

invDeq = pcf(tid0), lsf(tid0) = mkls(tid0, true, val, optval, val0, optval0), tid0 = tid2, # tids ≠ 0, ¬((tid0 = tid1 ⊃ pcstepf(mkgs(queue), lsf(tid1), pcf(tid1), DoDeqEmpty(tid1));pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), pcstepf(mkgs(queue), lsf(tid2), pcf(tid2), DoDeqEmpty(tid2)) ≠ invDeq, tids ≠ ∅, DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, true, val, optval, val0, optval0), invDeq), tid2 ∈ tids, tid0 ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ invDeq ≠ resDeq; (s) ⊦ pcstepf (gs, mkls(tid, obsEmpty, ival, oval, value, optval), invDeq, DoDeqEmpty(tid)) = resDeq; (s)

Proof step 97 from proof DQINV-Step (previous step) (back to tree)

invDeq = pcf(tid2), lsf(tid2) = mkls(tid2, true, val, optval, val0, optval0), # tids ≠ 0, ¬((tid2 = tid1 ⊃ pcstepf(mkgs(queue), lsf(tid1), pcf(tid1), DoDeqEmpty(tid1));pcf(tid1)) = invDeq ↔ tid1 ≠ tid2 ∧ tid1 ∈ tids), tids ≠ ∅, DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid2, true, val, optval, val0, optval0), invDeq), tid2 ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 4

Additional information

Proof step 98 from proof DQINV-Step (previous step) (back to tree)

(tid2 = tid1 ⊃ pcstepf(mkgs(queue), lsf(tid1), pcf(tid1), DoDeqEmpty(tid1));pcf(tid1)) = invDeq, invDeq = pcf(tid2), lsf(tid2) = mkls(tid2, true, val, optval, val0, optval0), # tids ≠ 0, tids ≠ ∅, DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid2, true, val, optval, val0, optval0), invDeq), tid2 ∈ tids, ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦ tid1 ≠ tid2 ∧ tid1 ∈ tids

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 1

Additional information

Used simplifier rules: ⊦ pcstepf (gs, mkls(tid, obsEmpty, ival, oval, value, optval), invDeq, DoDeqEmpty(tid)) = resDeq; (s) ⊦ invDeq ≠ resDeq; (s)

Proof step 99 from proof DQINV-Step (previous step) (back to tree)

invDeq = pcf(tid2), lsf(tid2) = mkls(tid2, true, val, optval, val0, optval0), pcf(tid1) = invDeq, # tids ≠ 0, tid2 ≠ tid1, tids ≠ ∅, DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid2, true, val, optval, val0, optval0), invDeq), tid2 ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦ tid1 ≠ tid2 ∧ tid1 ∈ tids

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 100 from proof DQINV-Step (previous step) (back to tree)

invDeq = pcf(tid2), lsf(tid2) = mkls(tid2, true, val, optval, val0, optval0), pcf(tid1) = invDeq, # tids ≠ 0, tid2 ≠ tid1, tids ≠ ∅, DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid2, true, val, optval, val0, optval0), invDeq), tid2 ∈ tids, ¬ tid1 ∈ tids, ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 11 terms: tid1

Additional information

Used terms: tid1

Proof step 101 from proof DQINV-Step (previous step) (back to tree)

invDeq = pcf(tid2), lsf(tid2) = mkls(tid2, true, val, optval, val0, optval0), # tids ≠ 0, (tid2 = tid1 ⊃ pcstepf(mkgs(queue), lsf(tid1), pcf(tid1), DoDeqEmpty(tid1));pcf(tid1)) ≠ invDeq, tid1 ≠ tid2, tids ≠ ∅, DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid2, true, val, optval, val0, optval0), invDeq), tid2 ∈ tids, tid1 ∈ tids, ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 102 from proof DQINV-Step (previous step) (back to tree)

invDeq = pcf(tid2), lsf(tid2) = mkls(tid2, true, val, optval, val0, optval0), # tids ≠ 0, pcf(tid1) ≠ invDeq, tid1 ≠ tid2, tids ≠ ∅, DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid2, true, val, optval, val0, optval0), invDeq), tid1 ∈ tids, tid2 ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 12 terms: tid1

Additional information

Used terms: tid1

Proof step 103 from proof DQINV-Step (previous step) (back to tree)

invDeq = pcf(tid0), lsf(tid0) = mkls(tid0, true, val, optval, val0, optval0), # tids ≠ 0, ¬((tid0 = tid1 ⊃ pcstepf(mkgs(queue), lsf(tid1), pcf(tid1), DoDeqEmpty(tid1));pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), pcf(tid2) ≠ invDeq, tid0 ≠ tid2, tids ≠ ∅, DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid0, true, val, optval, val0, optval0), invDeq), tid2 ∈ tids, tid0 ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 13 terms: tid2

Additional information

Used terms: tid2

Proof step 104 from proof DQINV-Step (previous step) (back to tree)

invDeq = pcf(tid), lsf(tid) = mkls(tid, true, val, optval, val0, optval0), # tids ≠ 0, ¬((tid = tid2 ⊃ pcstepf(mkgs(queue), lsf(tid2), pcf(tid2), DoDeqEmpty(tid2));pcf(tid2)) = invDeq ↔ tid2 ∈ tids), ¬((tid = tid1 ⊃ pcstepf(mkgs(queue), lsf(tid1), pcf(tid1), DoDeqEmpty(tid1));pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), pcf(tid0) ≠ invDeq, tid ≠ tid0, tids ≠ ∅, DQGInv(mkgs(queue)), DQLInv(mkgs(queue), mkls(tid, true, val, optval, val0, optval0), invDeq), tid0 ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(mkgs(queue), lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 13 terms: tid0

Additional information

Used terms: tid0

Proof step 105 from proof DQINV-Step (previous step) (back to tree)

invEnq = pcf(tid), lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), ¬((tid = tid0 ⊃ pcstepf(gs, lsf(tid0), pcf(tid0), ca);pcf(tid0)) = invDeq ↔ tid0 ∈ tids), ¬((tid = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), ca);pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), ¬((tid = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), ca);pcf(tid2)) = invDeq ↔ tid2 = tid0 ∨ tid2 ∈ tids), ca ≠ globalCrash, DQGInv(gs), DQLInv(gs, mkls(tid, obsEmpty, val, optval, val0, optval0), pcf(tid)), pre(gs, mkls(tid, obsEmpty, val, optval, val0, optval0), pcf(tid), ca), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ DoEnq(tid) ≠ globalCrash; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).tid = tid; (s) ⊦ pre(gs, ls, invEnq, a) ↔ a = DoEnq(ls.tid); (s)

Proof step 106 from proof DQINV-Step (previous step) (back to tree)

invEnq = pcf(tid), lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), ¬((tid = tid0 ⊃ pcstepf(gs, lsf(tid0), pcf(tid0), DoEnq(tid0));pcf(tid0)) = invDeq ↔ tid0 ∈ tids), ¬((tid = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), DoEnq(tid1));pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), ¬((tid = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), DoEnq(tid2));pcf(tid2)) = invDeq ↔ tid2 = tid0 ∨ tid2 ∈ tids), DQGInv(gs), DQLInv(gs, mkls(tid, obsEmpty, val, optval, val0, optval0), invEnq), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 3

Additional information

Proof step 107 from proof DQINV-Step (previous step) (back to tree)

(tid = tid0 ⊃ pcstepf(gs, lsf(tid0), pcf(tid0), DoEnq(tid0));pcf(tid0)) = invDeq, invEnq = pcf(tid), lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), ¬((tid = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), DoEnq(tid1));pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), ¬((tid = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), DoEnq(tid2));pcf(tid2)) = invDeq ↔ tid2 = tid0 ∨ tid2 ∈ tids), DQGInv(gs), DQLInv(gs, mkls(tid, obsEmpty, val, optval, val0, optval0), invEnq), ¬ tid0 ∈ tids, ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 108 from proof DQINV-Step (previous step) (back to tree)

(tid = tid0 ⊃ pcstepf(gs, lsf(tid0), pcf(tid0), DoEnq(tid0));pcf(tid0)) = invDeq, invEnq = pcf(tid), lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), ¬((tid = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), DoEnq(tid2));pcf(tid2)) = invDeq ↔ tid2 = tid0 ∨ tid2 ∈ tids), ¬((tid = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), DoEnq(tid1));pcf(tid1)) = invDeq ↔ tid1 ∈ tids), DQGInv(gs), DQLInv(gs, mkls(tid, obsEmpty, val, optval, val0, optval0), invEnq), ¬ tid0 ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 1

Additional information

Used simplifier rules: ⊦ pcstepf (gs, mkls(tid, obsEmpty, ival, oval, value, optval), invEnq, DoEnq(tid)) = resEnq; (s) ⊦ invDeq ≠ resEnq; (s)

Proof step 109 from proof DQINV-Step (previous step) (back to tree)

invEnq = pcf(tid), lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), pcf(tid0) = invDeq, ¬((tid = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), DoEnq(tid2));pcf(tid2)) = invDeq ↔ tid2 = tid0 ∨ tid2 ∈ tids), ¬((tid = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), DoEnq(tid1));pcf(tid1)) = invDeq ↔ tid1 ∈ tids), tid ≠ tid0, DQGInv(gs), DQLInv(gs, mkls(tid, obsEmpty, val, optval, val0, optval0), invEnq), ¬ tid0 ∈ tids, ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 10 terms: tid0

Additional information

Used terms: tid0

Proof step 110 from proof DQINV-Step (previous step) (back to tree)

invEnq = pcf(tid), lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), (tid = tid0 ⊃ pcstepf(gs, lsf(tid0), pcf(tid0), DoEnq(tid0));pcf(tid0)) ≠ invDeq, ¬((tid = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), DoEnq(tid1));pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), ¬((tid = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), DoEnq(tid2));pcf(tid2)) = invDeq ↔ tid2 = tid0 ∨ tid2 ∈ tids), DQGInv(gs), DQLInv(gs, mkls(tid, obsEmpty, val, optval, val0, optval0), invEnq), tid0 ∈ tids, ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: size-zero-01: ⊦ s ≠ ∅ → # s ≠ 0; (forward) from specification set-basic[tidset] ne-01: ⊦ a ∈ s → s ≠ ∅; (forward) from specification set-basic[tidset]

Proof step 111 from proof DQINV-Step (previous step) (back to tree)

invEnq = pcf(tid), lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), # tids ≠ 0, (tid = tid0 ⊃ pcstepf(gs, lsf(tid0), pcf(tid0), DoEnq(tid0));pcf(tid0)) ≠ invDeq, ¬((tid = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), DoEnq(tid2));pcf(tid2)) = invDeq ↔ tid2 ∈ tids), ¬((tid = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), DoEnq(tid1));pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), tids ≠ ∅, DQGInv(gs), DQLInv(gs, mkls(tid, obsEmpty, val, optval, val0, optval0), invEnq), tid0 ∈ tids, ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 4

Additional information

Proof step 112 from proof DQINV-Step (previous step) (back to tree)

invEnq = pcf(tid), lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), tid = tid0, # tids ≠ 0, ¬((tid = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), DoEnq(tid2));pcf(tid2)) = invDeq ↔ tid2 ∈ tids), ¬((tid = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), DoEnq(tid1));pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), pcstepf(gs, lsf(tid0), pcf(tid0), DoEnq(tid0)) ≠ invDeq, tids ≠ ∅, DQGInv(gs), DQLInv(gs, mkls(tid, obsEmpty, val, optval, val0, optval0), invEnq), tid0 ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ invDeq ≠ resEnq; (s) ⊦ pcstepf (gs, mkls(tid, obsEmpty, ival, oval, value, optval), invEnq, DoEnq(tid)) = resEnq; (s)

Proof step 113 from proof DQINV-Step (previous step) (back to tree)

invEnq = pcf(tid0), lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), # tids ≠ 0, ¬((tid0 = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), DoEnq(tid1));pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), ¬((tid0 = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), DoEnq(tid2));pcf(tid2)) = invDeq ↔ tid2 ∈ tids), tids ≠ ∅, DQGInv(gs), DQLInv(gs, mkls(tid0, obsEmpty, val, optval, val0, optval0), invEnq), tid0 ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦

User applied rule all left

And closed the goal!

Rule argument

pos: left 11 terms: tid0 abort: F discard: F computed: T

Additional information

Used simplifier rules: ⊦ invDeq ≠ invEnq; (s) Used terms: tid0

Proof step 114 from proof DQINV-Step (previous step) (back to tree)

invEnq = pcf(tid), lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), # tids ≠ 0, ¬((tid = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), DoEnq(tid2));pcf(tid2)) = invDeq ↔ tid2 ∈ tids), ¬((tid = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), DoEnq(tid1));pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), pcf(tid0) ≠ invDeq, tid ≠ tid0, tids ≠ ∅, DQGInv(gs), DQLInv(gs, mkls(tid, obsEmpty, val, optval, val0, optval0), invEnq), tid0 ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 13 terms: tid0

Additional information

Used terms: tid0

Proof step 115 from proof DQINV-Step (previous step) (back to tree)

lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), ready = pcf(tid), ¬((tid = tid0 ⊃ pcstepf(gs, lsf(tid0), pcf(tid0), ca);pcf(tid0)) = invDeq ↔ tid0 ∈ tids), ¬((tid = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), ca);pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), ¬((tid = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), ca);pcf(tid2)) = invDeq ↔ tid2 = tid0 ∨ tid2 ∈ tids), ca ≠ globalCrash, DQGInv(gs), DQLInv(gs, mkls(tid, obsEmpty, val, optval, val0, optval0), pcf(tid)), pre(gs, mkls(tid, obsEmpty, val, optval, val0, optval0), pcf(tid), ca), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).tid = tid; (s) ⊦ pre(gs, ls, ready, a) ↔ (∃ value. a = InvEnq(ls.tid, value)) ∨ a = InvDeq(ls.tid); (s)

Proof step 116 from proof DQINV-Step (previous step) (back to tree)

lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), ready = pcf(tid), ¬((tid = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), ca);pcf(tid2)) = invDeq ↔ tid2 = tid0 ∨ tid2 ∈ tids), ¬((tid = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), ca);pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), ¬((tid = tid0 ⊃ pcstepf(gs, lsf(tid0), pcf(tid0), ca);pcf(tid0)) = invDeq ↔ tid0 ∈ tids), ca ≠ globalCrash, DQGInv(gs), DQLInv(gs, mkls(tid, obsEmpty, val, optval, val0, optval0), ready), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)), ca = InvEnq(tid, val1) ∨ ca = InvDeq(tid) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 11

Additional information

Proof step 117 from proof DQINV-Step (previous step) (back to tree)

ca = InvEnq(tid, val1), lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), ready = pcf(tid), ¬((tid = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), ca);pcf(tid2)) = invDeq ↔ tid2 = tid0 ∨ tid2 ∈ tids), ¬((tid = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), ca);pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), ¬((tid = tid0 ⊃ pcstepf(gs, lsf(tid0), pcf(tid0), ca);pcf(tid0)) = invDeq ↔ tid0 ∈ tids), ca ≠ globalCrash, DQGInv(gs), DQLInv(gs, mkls(tid, obsEmpty, val, optval, val0, optval0), ready), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ InvEnq(tid, val) ≠ globalCrash; (s)

Proof step 118 from proof DQINV-Step (previous step) (back to tree)

lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), ready = pcf(tid), ¬((tid = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), InvEnq(tid2, val1));pcf(tid2)) = invDeq ↔ tid2 = tid0 ∨ tid2 ∈ tids), ¬((tid = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), InvEnq(tid1, val1));pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), ¬((tid = tid0 ⊃ pcstepf(gs, lsf(tid0), pcf(tid0), InvEnq(tid0, val1));pcf(tid0)) = invDeq ↔ tid0 ∈ tids), DQGInv(gs), DQLInv(gs, mkls(tid, obsEmpty, val, optval, val0, optval0), ready), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 5

Additional information

Proof step 119 from proof DQINV-Step (previous step) (back to tree)

(tid = tid0 ⊃ pcstepf(gs, lsf(tid0), pcf(tid0), InvEnq(tid0, val1));pcf(tid0)) = invDeq, lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), ready = pcf(tid), ¬((tid = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), InvEnq(tid2, val1));pcf(tid2)) = invDeq ↔ tid2 = tid0 ∨ tid2 ∈ tids), ¬((tid = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), InvEnq(tid1, val1));pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), DQGInv(gs), DQLInv(gs, mkls(tid, obsEmpty, val, optval, val0, optval0), ready), ¬ tid0 ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 120 from proof DQINV-Step (previous step) (back to tree)

(tid = tid0 ⊃ pcstepf(gs, lsf(tid0), pcf(tid0), InvEnq(tid0, val1));pcf(tid0)) = invDeq, lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), ready = pcf(tid), ¬((tid = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), InvEnq(tid2, val1));pcf(tid2)) = invDeq ↔ tid2 = tid0 ∨ tid2 ∈ tids), ¬((tid = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), InvEnq(tid1, val1));pcf(tid1)) = invDeq ↔ tid1 ∈ tids), DQGInv(gs), DQLInv(gs, mkls(tid, obsEmpty, val, optval, val0, optval0), ready), ¬ tid0 ∈ tids, ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 1

Additional information

Used simplifier rules: ⊦ pcstepf (gs, mkls(tid, obsEmpty, ival, oval, value, optval), ready, InvEnq(tid, value0)) = invEnq; (s) ⊦ invDeq ≠ invEnq; (s)

Proof step 121 from proof DQINV-Step (previous step) (back to tree)

lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), pcf(tid0) = invDeq, ready = pcf(tid), ¬((tid = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), InvEnq(tid2, val1));pcf(tid2)) = invDeq ↔ tid2 = tid0 ∨ tid2 ∈ tids), ¬((tid = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), InvEnq(tid1, val1));pcf(tid1)) = invDeq ↔ tid1 ∈ tids), tid ≠ tid0, DQGInv(gs), DQLInv(gs, mkls(tid, obsEmpty, val, optval, val0, optval0), ready), ¬ tid0 ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 11 terms: tid0

Additional information

Used terms: tid0

Proof step 122 from proof DQINV-Step (previous step) (back to tree)

lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), ready = pcf(tid), (tid = tid0 ⊃ pcstepf(gs, lsf(tid0), pcf(tid0), InvEnq(tid0, val1));pcf(tid0)) ≠ invDeq, ¬((tid = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), InvEnq(tid2, val1));pcf(tid2)) = invDeq ↔ tid2 = tid0 ∨ tid2 ∈ tids), ¬((tid = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), InvEnq(tid1, val1));pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), DQGInv(gs), DQLInv(gs, mkls(tid, obsEmpty, val, optval, val0, optval0), ready), tid0 ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: size-zero-01: ⊦ s ≠ ∅ → # s ≠ 0; (forward) from specification set-basic[tidset] ne-01: ⊦ a ∈ s → s ≠ ∅; (forward) from specification set-basic[tidset]

Proof step 123 from proof DQINV-Step (previous step) (back to tree)

lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), ready = pcf(tid), # tids ≠ 0, (tid = tid0 ⊃ pcstepf(gs, lsf(tid0), pcf(tid0), InvEnq(tid0, val1));pcf(tid0)) ≠ invDeq, ¬((tid = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), InvEnq(tid2, val1));pcf(tid2)) = invDeq ↔ tid2 ∈ tids), ¬((tid = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), InvEnq(tid1, val1));pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), tids ≠ ∅, DQGInv(gs), DQLInv(gs, mkls(tid, obsEmpty, val, optval, val0, optval0), ready), tid0 ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 4

Additional information

Proof step 124 from proof DQINV-Step (previous step) (back to tree)

lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), ready = pcf(tid), tid = tid0, # tids ≠ 0, ¬((tid = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), InvEnq(tid2, val1));pcf(tid2)) = invDeq ↔ tid2 ∈ tids), ¬((tid = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), InvEnq(tid1, val1));pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), pcstepf(gs, lsf(tid0), pcf(tid0), InvEnq(tid0, val1)) ≠ invDeq, tids ≠ ∅, DQGInv(gs), DQLInv(gs, mkls(tid, obsEmpty, val, optval, val0, optval0), ready), tid0 ∈ tids, ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ invDeq ≠ invEnq; (s) ⊦ pcstepf (gs, mkls(tid, obsEmpty, ival, oval, value, optval), ready, InvEnq(tid, value0)) = invEnq; (s)

Proof step 125 from proof DQINV-Step (previous step) (back to tree)

lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), ready = pcf(tid0), # tids ≠ 0, ¬((tid0 = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), InvEnq(tid1, val1));pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), ¬((tid0 = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), InvEnq(tid2, val1));pcf(tid2)) = invDeq ↔ tid2 ∈ tids), tids ≠ ∅, DQGInv(gs), DQLInv(gs, mkls(tid0, obsEmpty, val, optval, val0, optval0), ready), tid0 ∈ tids, ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 5

Additional information

Proof step 126 from proof DQINV-Step (previous step) (back to tree)

(tid0 = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), InvEnq(tid2, val1));pcf(tid2)) = invDeq, lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), ready = pcf(tid0), # tids ≠ 0, ¬((tid0 = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), InvEnq(tid1, val1));pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), tids ≠ ∅, DQGInv(gs), DQLInv(gs, mkls(tid0, obsEmpty, val, optval, val0, optval0), ready), tid0 ∈ tids, ¬ tid2 ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 127 from proof DQINV-Step (previous step) (back to tree)

lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), pcf(tid2) = invDeq, ready = pcf(tid0), # tids ≠ 0, ¬((tid0 = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), InvEnq(tid1, val1));pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), tids ≠ ∅, DQGInv(gs), DQLInv(gs, mkls(tid0, obsEmpty, val, optval, val0, optval0), ready), tid0 ∈ tids, ¬ tid2 ∈ tids, ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 11 terms: tid2

Additional information

Used terms: tid2

Proof step 128 from proof DQINV-Step (previous step) (back to tree)

lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), ready = pcf(tid0), # tids ≠ 0, (tid0 = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), InvEnq(tid2, val1));pcf(tid2)) ≠ invDeq, ¬((tid0 = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), InvEnq(tid1, val1));pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), tids ≠ ∅, DQGInv(gs), DQLInv(gs, mkls(tid0, obsEmpty, val, optval, val0, optval0), ready), tid0 ∈ tids, tid2 ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 4

Additional information

Proof step 129 from proof DQINV-Step (previous step) (back to tree)

lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), ready = pcf(tid0), tid0 = tid2, # tids ≠ 0, ¬((tid0 = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), InvEnq(tid1, val1));pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), pcstepf(gs, lsf(tid2), pcf(tid2), InvEnq(tid2, val1)) ≠ invDeq, tids ≠ ∅, DQGInv(gs), DQLInv(gs, mkls(tid0, obsEmpty, val, optval, val0, optval0), ready), tid2 ∈ tids, tid0 ∈ tids, ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ invDeq ≠ invEnq; (s) ⊦ pcstepf (gs, mkls(tid, obsEmpty, ival, oval, value, optval), ready, InvEnq(tid, value0)) = invEnq; (s)

Proof step 130 from proof DQINV-Step (previous step) (back to tree)

lsf(tid2) = mkls(tid2, obsEmpty, val, optval, val0, optval0), ready = pcf(tid2), # tids ≠ 0, ¬((tid2 = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), InvEnq(tid1, val1));pcf(tid1)) = invDeq ↔ tid1 ≠ tid2 ∧ tid1 ∈ tids), tids ≠ ∅, DQGInv(gs), DQLInv(gs, mkls(tid2, obsEmpty, val, optval, val0, optval0), ready), tid2 ∈ tids, ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 4

Additional information

Proof step 131 from proof DQINV-Step (previous step) (back to tree)

(tid2 = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), InvEnq(tid1, val1));pcf(tid1)) = invDeq, lsf(tid2) = mkls(tid2, obsEmpty, val, optval, val0, optval0), ready = pcf(tid2), # tids ≠ 0, tids ≠ ∅, DQGInv(gs), DQLInv(gs, mkls(tid2, obsEmpty, val, optval, val0, optval0), ready), tid2 ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦ tid1 ≠ tid2 ∧ tid1 ∈ tids

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 1

Additional information

Used simplifier rules: ⊦ pcstepf (gs, mkls(tid, obsEmpty, ival, oval, value, optval), ready, InvEnq(tid, value0)) = invEnq; (s) ⊦ invDeq ≠ invEnq; (s)

Proof step 132 from proof DQINV-Step (previous step) (back to tree)

lsf(tid2) = mkls(tid2, obsEmpty, val, optval, val0, optval0), pcf(tid1) = invDeq, ready = pcf(tid2), # tids ≠ 0, tid2 ≠ tid1, tids ≠ ∅, DQGInv(gs), DQLInv(gs, mkls(tid2, obsEmpty, val, optval, val0, optval0), ready), tid2 ∈ tids, ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ tid1 ≠ tid2 ∧ tid1 ∈ tids

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 133 from proof DQINV-Step (previous step) (back to tree)

lsf(tid2) = mkls(tid2, obsEmpty, val, optval, val0, optval0), pcf(tid1) = invDeq, ready = pcf(tid2), # tids ≠ 0, tid2 ≠ tid1, tids ≠ ∅, DQGInv(gs), DQLInv(gs, mkls(tid2, obsEmpty, val, optval, val0, optval0), ready), tid2 ∈ tids, ¬ tid1 ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 12 terms: tid1

Additional information

Used terms: tid1

Proof step 134 from proof DQINV-Step (previous step) (back to tree)

lsf(tid2) = mkls(tid2, obsEmpty, val, optval, val0, optval0), ready = pcf(tid2), # tids ≠ 0, (tid2 = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), InvEnq(tid1, val1));pcf(tid1)) ≠ invDeq, tid1 ≠ tid2, tids ≠ ∅, DQGInv(gs), DQLInv(gs, mkls(tid2, obsEmpty, val, optval, val0, optval0), ready), tid2 ∈ tids, tid1 ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 135 from proof DQINV-Step (previous step) (back to tree)

lsf(tid2) = mkls(tid2, obsEmpty, val, optval, val0, optval0), ready = pcf(tid2), # tids ≠ 0, pcf(tid1) ≠ invDeq, tid1 ≠ tid2, tids ≠ ∅, DQGInv(gs), DQLInv(gs, mkls(tid2, obsEmpty, val, optval, val0, optval0), ready), tid1 ∈ tids, tid2 ∈ tids, ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 11 terms: tid1

Additional information

Used terms: tid1

Proof step 136 from proof DQINV-Step (previous step) (back to tree)

lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), ready = pcf(tid0), # tids ≠ 0, ¬((tid0 = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), InvEnq(tid1, val1));pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), pcf(tid2) ≠ invDeq, tid0 ≠ tid2, tids ≠ ∅, DQGInv(gs), DQLInv(gs, mkls(tid0, obsEmpty, val, optval, val0, optval0), ready), tid2 ∈ tids, tid0 ∈ tids, ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 12 terms: tid2

Additional information

Used terms: tid2

Proof step 137 from proof DQINV-Step (previous step) (back to tree)

lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), ready = pcf(tid), # tids ≠ 0, ¬((tid = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), InvEnq(tid2, val1));pcf(tid2)) = invDeq ↔ tid2 ∈ tids), ¬((tid = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), InvEnq(tid1, val1));pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), pcf(tid0) ≠ invDeq, tid ≠ tid0, tids ≠ ∅, DQGInv(gs), DQLInv(gs, mkls(tid, obsEmpty, val, optval, val0, optval0), ready), tid0 ∈ tids, ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 12 terms: tid0

Additional information

Used terms: tid0

Proof step 138 from proof DQINV-Step (previous step) (back to tree)

ca = InvDeq(tid), lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), ready = pcf(tid), ¬((tid = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), ca);pcf(tid2)) = invDeq ↔ tid2 = tid0 ∨ tid2 ∈ tids), ¬((tid = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), ca);pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), ¬((tid = tid0 ⊃ pcstepf(gs, lsf(tid0), pcf(tid0), ca);pcf(tid0)) = invDeq ↔ tid0 ∈ tids), ca ≠ globalCrash, DQGInv(gs), DQLInv(gs, mkls(tid, obsEmpty, val, optval, val0, optval0), ready), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ InvDeq(tid) ≠ globalCrash; (s)

Proof step 139 from proof DQINV-Step (previous step) (back to tree)

lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), ready = pcf(tid), ¬((tid = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), InvDeq(tid2));pcf(tid2)) = invDeq ↔ tid2 = tid0 ∨ tid2 ∈ tids), ¬((tid = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), InvDeq(tid1));pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), ¬((tid = tid0 ⊃ pcstepf(gs, lsf(tid0), pcf(tid0), InvDeq(tid0));pcf(tid0)) = invDeq ↔ tid0 ∈ tids), DQGInv(gs), DQLInv(gs, mkls(tid, obsEmpty, val, optval, val0, optval0), ready), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 4

Additional information

Proof step 140 from proof DQINV-Step (previous step) (back to tree)

(tid = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), InvDeq(tid1));pcf(tid1)) = invDeq, lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), ready = pcf(tid), ¬((tid = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), InvDeq(tid2));pcf(tid2)) = invDeq ↔ tid2 = tid0 ∨ tid2 ∈ tids), ¬((tid = tid0 ⊃ pcstepf(gs, lsf(tid0), pcf(tid0), InvDeq(tid0));pcf(tid0)) = invDeq ↔ tid0 ∈ tids), DQGInv(gs), DQLInv(gs, mkls(tid, obsEmpty, val, optval, val0, optval0), ready), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦ tid1 ≠ tid0 ∧ tid1 ∈ tids

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 1

Additional information

Proof step 141 from proof DQINV-Step (previous step) (back to tree)

lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), pcstepf(gs, lsf(tid1), pcf(tid1), InvDeq(tid1)) = invDeq, ready = pcf(tid), tid = tid1, ¬((tid = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), InvDeq(tid2));pcf(tid2)) = invDeq ↔ tid2 = tid0 ∨ tid2 ∈ tids), ¬((tid = tid0 ⊃ pcstepf(gs, lsf(tid0), pcf(tid0), InvDeq(tid0));pcf(tid0)) = invDeq ↔ tid0 ∈ tids), DQGInv(gs), DQLInv(gs, mkls(tid, obsEmpty, val, optval, val0, optval0), ready), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ tid1 ≠ tid0 ∧ tid1 ∈ tids

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ pcstepf (gs, mkls(tid, obsEmpty, ival, oval, value, optval), ready, InvDeq(tid)) = invDeq; (s)

Proof step 142 from proof DQINV-Step (previous step) (back to tree)

lsf(tid1) = mkls(tid1, obsEmpty, val, optval, val0, optval0), ready = pcf(tid1), ¬((tid1 = tid0 ⊃ pcstepf(gs, lsf(tid0), pcf(tid0), InvDeq(tid0));pcf(tid0)) = invDeq ↔ tid0 ∈ tids), ¬((tid1 = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), InvDeq(tid2));pcf(tid2)) = invDeq ↔ tid2 = tid0 ∨ tid2 ∈ tids), DQGInv(gs), DQLInv(gs, mkls(tid1, obsEmpty, val, optval, val0, optval0), ready), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ tid1 ≠ tid0 ∧ tid1 ∈ tids

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 4

Additional information

Proof step 143 from proof DQINV-Step (previous step) (back to tree)

(tid1 = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), InvDeq(tid2));pcf(tid2)) = invDeq, lsf(tid1) = mkls(tid1, obsEmpty, val, optval, val0, optval0), ready = pcf(tid1), ¬((tid1 = tid0 ⊃ pcstepf(gs, lsf(tid0), pcf(tid0), InvDeq(tid0));pcf(tid0)) = invDeq ↔ tid0 ∈ tids), tid2 ≠ tid0, DQGInv(gs), DQLInv(gs, mkls(tid1, obsEmpty, val, optval, val0, optval0), ready), ¬ tid2 ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦ tid1 ≠ tid0 ∧ tid1 ∈ tids

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 1

Additional information

Proof step 144 from proof DQINV-Step (previous step) (back to tree)

lsf(tid1) = mkls(tid1, obsEmpty, val, optval, val0, optval0), pcstepf(gs, lsf(tid2), pcf(tid2), InvDeq(tid2)) = invDeq, ready = pcf(tid1), tid1 = tid2, ¬((tid1 = tid0 ⊃ pcstepf(gs, lsf(tid0), pcf(tid0), InvDeq(tid0));pcf(tid0)) = invDeq ↔ tid0 ∈ tids), tid2 ≠ tid0, DQGInv(gs), DQLInv(gs, mkls(tid1, obsEmpty, val, optval, val0, optval0), ready), ¬ tid2 ∈ tids, ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ tid1 ≠ tid0 ∧ tid1 ∈ tids

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ pcstepf (gs, mkls(tid, obsEmpty, ival, oval, value, optval), ready, InvDeq(tid)) = invDeq; (s)

Proof step 145 from proof DQINV-Step (previous step) (back to tree)

lsf(tid2) = mkls(tid2, obsEmpty, val, optval, val0, optval0), ready = pcf(tid2), ¬(pcf(tid0) = invDeq ↔ tid0 ∈ tids), tid2 ≠ tid0, DQGInv(gs), DQLInv(gs, mkls(tid2, obsEmpty, val, optval, val0, optval0), ready), ¬ tid2 ∈ tids, ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 3

Additional information

Proof step 146 from proof DQINV-Step (previous step) (back to tree)

lsf(tid2) = mkls(tid2, obsEmpty, val, optval, val0, optval0), pcf(tid0) = invDeq, ready = pcf(tid2), tid2 ≠ tid0, DQGInv(gs), DQLInv(gs, mkls(tid2, obsEmpty, val, optval, val0, optval0), ready), ¬ tid0 ∈ tids, ¬ tid2 ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 10 terms: tid0

Additional information

Used terms: tid0

Proof step 147 from proof DQINV-Step (previous step) (back to tree)

lsf(tid2) = mkls(tid2, obsEmpty, val, optval, val0, optval0), ready = pcf(tid2), pcf(tid0) ≠ invDeq, tid2 ≠ tid0, DQGInv(gs), DQLInv(gs, mkls(tid2, obsEmpty, val, optval, val0, optval0), ready), tid0 ∈ tids, ¬ tid2 ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: size-zero-01: ⊦ s ≠ ∅ → # s ≠ 0; (forward) from specification set-basic[tidset] ne-01: ⊦ a ∈ s → s ≠ ∅; (forward) from specification set-basic[tidset]

Proof step 148 from proof DQINV-Step (previous step) (back to tree)

lsf(tid2) = mkls(tid2, obsEmpty, val, optval, val0, optval0), ready = pcf(tid2), # tids ≠ 0, pcf(tid0) ≠ invDeq, tid2 ≠ tid0, tids ≠ ∅, DQGInv(gs), DQLInv(gs, mkls(tid2, obsEmpty, val, optval, val0, optval0), ready), tid0 ∈ tids, ¬ tid2 ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 12 terms: tid0

Additional information

Used terms: tid0

Proof step 149 from proof DQINV-Step (previous step) (back to tree)

lsf(tid1) = mkls(tid1, obsEmpty, val, optval, val0, optval0), pcf(tid2) = invDeq, ready = pcf(tid1), ¬((tid1 = tid0 ⊃ pcstepf(gs, lsf(tid0), pcf(tid0), InvDeq(tid0));pcf(tid0)) = invDeq ↔ tid0 ∈ tids), tid1 ≠ tid2, tid2 ≠ tid0, DQGInv(gs), DQLInv(gs, mkls(tid1, obsEmpty, val, optval, val0, optval0), ready), ¬ tid2 ∈ tids, ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ tid1 ≠ tid0 ∧ tid1 ∈ tids

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 10 terms: tid2

Additional information

Used terms: tid2

Proof step 150 from proof DQINV-Step (previous step) (back to tree)

lsf(tid1) = mkls(tid1, obsEmpty, val, optval, val0, optval0), ready = pcf(tid1), (tid1 = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), InvDeq(tid2));pcf(tid2)) ≠ invDeq, ¬((tid1 = tid0 ⊃ pcstepf(gs, lsf(tid0), pcf(tid0), InvDeq(tid0));pcf(tid0)) = invDeq ↔ tid0 ∈ tids), DQGInv(gs), DQLInv(gs, mkls(tid1, obsEmpty, val, optval, val0, optval0), ready), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, tid2 = tid0 ∨ tid2 ∈ tids ⊦ tid1 ≠ tid0 ∧ tid1 ∈ tids

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 3

Additional information

Used simplifier rules: ⊦ pcstepf (gs, mkls(tid, obsEmpty, ival, oval, value, optval), ready, InvDeq(tid)) = invDeq; (s)

Proof step 151 from proof DQINV-Step (previous step) (back to tree)

lsf(tid1) = mkls(tid1, obsEmpty, val, optval, val0, optval0), ready = pcf(tid1), ¬((tid1 = tid0 ⊃ pcstepf(gs, lsf(tid0), pcf(tid0), InvDeq(tid0));pcf(tid0)) = invDeq ↔ tid0 ∈ tids), pcf(tid2) ≠ invDeq, tid1 ≠ tid2, DQGInv(gs), DQLInv(gs, mkls(tid1, obsEmpty, val, optval, val0, optval0), ready), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)), tid2 = tid0 ∨ tid2 ∈ tids ⊦ tid1 ≠ tid0 ∧ tid1 ∈ tids

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 10

Additional information

Proof step 152 from proof DQINV-Step (previous step) (back to tree)

lsf(tid1) = mkls(tid1, obsEmpty, val, optval, val0, optval0), ready = pcf(tid1), tid2 = tid0, ¬((tid1 = tid0 ⊃ pcstepf(gs, lsf(tid0), pcf(tid0), InvDeq(tid0));pcf(tid0)) = invDeq ↔ tid0 ∈ tids), pcf(tid2) ≠ invDeq, tid1 ≠ tid2, DQGInv(gs), DQLInv(gs, mkls(tid1, obsEmpty, val, optval, val0, optval0), ready), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦ tid1 ≠ tid0 ∧ tid1 ∈ tids

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: size-zero-01: ⊦ s ≠ ∅ → # s ≠ 0; (forward) from specification set-basic[tidset] ne-01: ⊦ a ∈ s → s ≠ ∅; (forward) from specification set-basic[tidset]

Proof step 153 from proof DQINV-Step (previous step) (back to tree)

lsf(tid1) = mkls(tid1, obsEmpty, val, optval, val0, optval0), ready = pcf(tid1), # tids ≠ 0, pcf(tid0) ≠ invDeq, tid1 ≠ tid0, tids ≠ ∅, DQGInv(gs), DQLInv(gs, mkls(tid1, obsEmpty, val, optval, val0, optval0), ready), tid0 ∈ tids, ¬ tid1 ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 12 terms: tid0

Additional information

Used terms: tid0

Proof step 154 from proof DQINV-Step (previous step) (back to tree)

lsf(tid1) = mkls(tid1, obsEmpty, val, optval, val0, optval0), ready = pcf(tid1), ¬((tid1 = tid0 ⊃ pcstepf(gs, lsf(tid0), pcf(tid0), InvDeq(tid0));pcf(tid0)) = invDeq ↔ tid0 ∈ tids), pcf(tid2) ≠ invDeq, tid1 ≠ tid2, DQGInv(gs), DQLInv(gs, mkls(tid1, obsEmpty, val, optval, val0, optval0), ready), tid2 ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦ tid1 ≠ tid0 ∧ tid1 ∈ tids

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: size-zero-01: ⊦ s ≠ ∅ → # s ≠ 0; (forward) from specification set-basic[tidset] ne-01: ⊦ a ∈ s → s ≠ ∅; (forward) from specification set-basic[tidset]

Proof step 155 from proof DQINV-Step (previous step) (back to tree)

lsf(tid1) = mkls(tid1, obsEmpty, val, optval, val0, optval0), ready = pcf(tid1), # tids ≠ 0, ¬((tid1 = tid0 ⊃ pcstepf(gs, lsf(tid0), pcf(tid0), InvDeq(tid0));pcf(tid0)) = invDeq ↔ tid0 ∈ tids), pcf(tid2) ≠ invDeq, tid1 ≠ tid2, tids ≠ ∅, DQGInv(gs), DQLInv(gs, mkls(tid1, obsEmpty, val, optval, val0, optval0), ready), tid2 ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦ tid1 ≠ tid0 ∧ tid1 ∈ tids

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 12 terms: tid2

Additional information

Used terms: tid2

Proof step 156 from proof DQINV-Step (previous step) (back to tree)

lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), pcf(tid1) = invDeq, ready = pcf(tid), ¬((tid = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), InvDeq(tid2));pcf(tid2)) = invDeq ↔ tid2 = tid0 ∨ tid2 ∈ tids), ¬((tid = tid0 ⊃ pcstepf(gs, lsf(tid0), pcf(tid0), InvDeq(tid0));pcf(tid0)) = invDeq ↔ tid0 ∈ tids), tid ≠ tid1, DQGInv(gs), DQLInv(gs, mkls(tid, obsEmpty, val, optval, val0, optval0), ready), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦ tid1 ≠ tid0 ∧ tid1 ∈ tids

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 157 from proof DQINV-Step (previous step) (back to tree)

lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), pcf(tid1) = invDeq, ready = pcf(tid), tid1 = tid0, ¬((tid = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), InvDeq(tid2));pcf(tid2)) = invDeq ↔ tid2 = tid0 ∨ tid2 ∈ tids), ¬((tid = tid0 ⊃ pcstepf(gs, lsf(tid0), pcf(tid0), InvDeq(tid0));pcf(tid0)) = invDeq ↔ tid0 ∈ tids), tid ≠ tid1, DQGInv(gs), DQLInv(gs, mkls(tid, obsEmpty, val, optval, val0, optval0), ready), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 158 from proof DQINV-Step (previous step) (back to tree)

lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), pcf(tid0) = invDeq, ready = pcf(tid), ¬((tid = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), InvDeq(tid2));pcf(tid2)) = invDeq ↔ tid2 = tid0 ∨ tid2 ∈ tids), tid ≠ tid0, DQGInv(gs), DQLInv(gs, mkls(tid, obsEmpty, val, optval, val0, optval0), ready), ¬ tid0 ∈ tids, ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 9 terms: tid0

Additional information

Used terms: tid0

Proof step 159 from proof DQINV-Step (previous step) (back to tree)

lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), pcf(tid1) = invDeq, ready = pcf(tid), ¬((tid = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), InvDeq(tid2));pcf(tid2)) = invDeq ↔ tid2 = tid0 ∨ tid2 ∈ tids), ¬((tid = tid0 ⊃ pcstepf(gs, lsf(tid0), pcf(tid0), InvDeq(tid0));pcf(tid0)) = invDeq ↔ tid0 ∈ tids), tid ≠ tid1, DQGInv(gs), DQLInv(gs, mkls(tid, obsEmpty, val, optval, val0, optval0), ready), ¬ tid1 ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 11 terms: tid1

Additional information

Used terms: tid1

Proof step 160 from proof DQINV-Step (previous step) (back to tree)

lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), ready = pcf(tid), (tid = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), InvDeq(tid1));pcf(tid1)) ≠ invDeq, ¬((tid = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), InvDeq(tid2));pcf(tid2)) = invDeq ↔ tid2 = tid0 ∨ tid2 ∈ tids), ¬((tid = tid0 ⊃ pcstepf(gs, lsf(tid0), pcf(tid0), InvDeq(tid0));pcf(tid0)) = invDeq ↔ tid0 ∈ tids), tid1 ≠ tid0, DQGInv(gs), DQLInv(gs, mkls(tid, obsEmpty, val, optval, val0, optval0), ready), tid1 ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: size-zero-01: ⊦ s ≠ ∅ → # s ≠ 0; (forward) from specification set-basic[tidset] ne-01: ⊦ a ∈ s → s ≠ ∅; (forward) from specification set-basic[tidset]

Proof step 161 from proof DQINV-Step (previous step) (back to tree)

lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), ready = pcf(tid), # tids ≠ 0, (tid = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), InvDeq(tid1));pcf(tid1)) ≠ invDeq, ¬((tid = tid0 ⊃ pcstepf(gs, lsf(tid0), pcf(tid0), InvDeq(tid0));pcf(tid0)) = invDeq ↔ tid0 ∈ tids), ¬((tid = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), InvDeq(tid2));pcf(tid2)) = invDeq ↔ tid2 = tid0 ∨ tid2 ∈ tids), tid1 ≠ tid0, tids ≠ ∅, DQGInv(gs), DQLInv(gs, mkls(tid, obsEmpty, val, optval, val0, optval0), ready), tid1 ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 4

Additional information

Used simplifier rules: ⊦ pcstepf (gs, mkls(tid, obsEmpty, ival, oval, value, optval), ready, InvDeq(tid)) = invDeq; (s)

Proof step 162 from proof DQINV-Step (previous step) (back to tree)

lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), ready = pcf(tid), # tids ≠ 0, ¬((tid = tid0 ⊃ pcstepf(gs, lsf(tid0), pcf(tid0), InvDeq(tid0));pcf(tid0)) = invDeq ↔ tid0 ∈ tids), ¬((tid = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), InvDeq(tid2));pcf(tid2)) = invDeq ↔ tid2 = tid0 ∨ tid2 ∈ tids), pcf(tid1) ≠ invDeq, tid ≠ tid1, tid1 ≠ tid0, tids ≠ ∅, DQGInv(gs), DQLInv(gs, mkls(tid, obsEmpty, val, optval, val0, optval0), ready), tid1 ∈ tids, ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 13 terms: tid1

Additional information

Used terms: tid1

Proof step 163 from proof DQINV-Step (previous step) (back to tree)

lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), resDeq = pcf(tid), ¬((tid = tid0 ⊃ pcstepf(gs, lsf(tid0), pcf(tid0), ca);pcf(tid0)) = invDeq ↔ tid0 ∈ tids), ¬((tid = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), ca);pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), ¬((tid = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), ca);pcf(tid2)) = invDeq ↔ tid2 = tid0 ∨ tid2 ∈ tids), ca ≠ globalCrash, DQGInv(gs), DQLInv(gs, mkls(tid, obsEmpty, val, optval, val0, optval0), pcf(tid)), pre(gs, mkls(tid, obsEmpty, val, optval, val0, optval0), pcf(tid), ca), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ RetDeq(tid, optval) ≠ globalCrash; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).oval = oval; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).tid = tid; (s) ⊦ pre(gs, ls, resDeq, a) ↔ a = RetDeq(ls.tid, ls.oval); (s)

Proof step 164 from proof DQINV-Step (previous step) (back to tree)

lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), resDeq = pcf(tid), ¬((tid = tid0 ⊃ pcstepf(gs, lsf(tid0), pcf(tid0), RetDeq(tid0, optval));pcf(tid0)) = invDeq ↔ tid0 ∈ tids), ¬((tid = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), RetDeq(tid1, optval));pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), ¬((tid = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), RetDeq(tid2, optval));pcf(tid2)) = invDeq ↔ tid2 = tid0 ∨ tid2 ∈ tids), DQGInv(gs), DQLInv(gs, mkls(tid, obsEmpty, val, optval, val0, optval0), resDeq), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 3

Additional information

Proof step 165 from proof DQINV-Step (previous step) (back to tree)

(tid = tid0 ⊃ pcstepf(gs, lsf(tid0), pcf(tid0), RetDeq(tid0, optval));pcf(tid0)) = invDeq, lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), resDeq = pcf(tid), ¬((tid = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), RetDeq(tid1, optval));pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), ¬((tid = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), RetDeq(tid2, optval));pcf(tid2)) = invDeq ↔ tid2 = tid0 ∨ tid2 ∈ tids), DQGInv(gs), DQLInv(gs, mkls(tid, obsEmpty, val, optval, val0, optval0), resDeq), ¬ tid0 ∈ tids, ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 166 from proof DQINV-Step (previous step) (back to tree)

(tid = tid0 ⊃ pcstepf(gs, lsf(tid0), pcf(tid0), RetDeq(tid0, optval));pcf(tid0)) = invDeq, lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), resDeq = pcf(tid), ¬((tid = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), RetDeq(tid2, optval));pcf(tid2)) = invDeq ↔ tid2 = tid0 ∨ tid2 ∈ tids), ¬((tid = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), RetDeq(tid1, optval));pcf(tid1)) = invDeq ↔ tid1 ∈ tids), DQGInv(gs), DQLInv(gs, mkls(tid, obsEmpty, val, optval, val0, optval0), resDeq), ¬ tid0 ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 1

Additional information

Used simplifier rules: ⊦ pcstepf (gs, mkls(tid, obsEmpty, ival, oval, value, optval), resDeq, RetDeq(tid, oval)) = ready; (s) ⊦ invDeq ≠ ready; (s)

Proof step 167 from proof DQINV-Step (previous step) (back to tree)

lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), pcf(tid0) = invDeq, resDeq = pcf(tid), ¬((tid = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), RetDeq(tid2, optval));pcf(tid2)) = invDeq ↔ tid2 = tid0 ∨ tid2 ∈ tids), ¬((tid = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), RetDeq(tid1, optval));pcf(tid1)) = invDeq ↔ tid1 ∈ tids), tid ≠ tid0, DQGInv(gs), DQLInv(gs, mkls(tid, obsEmpty, val, optval, val0, optval0), resDeq), ¬ tid0 ∈ tids, ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 10 terms: tid0

Additional information

Used terms: tid0

Proof step 168 from proof DQINV-Step (previous step) (back to tree)

lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), resDeq = pcf(tid), (tid = tid0 ⊃ pcstepf(gs, lsf(tid0), pcf(tid0), RetDeq(tid0, optval));pcf(tid0)) ≠ invDeq, ¬((tid = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), RetDeq(tid1, optval));pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), ¬((tid = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), RetDeq(tid2, optval));pcf(tid2)) = invDeq ↔ tid2 = tid0 ∨ tid2 ∈ tids), DQGInv(gs), DQLInv(gs, mkls(tid, obsEmpty, val, optval, val0, optval0), resDeq), tid0 ∈ tids, ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: size-zero-01: ⊦ s ≠ ∅ → # s ≠ 0; (forward) from specification set-basic[tidset] ne-01: ⊦ a ∈ s → s ≠ ∅; (forward) from specification set-basic[tidset]

Proof step 169 from proof DQINV-Step (previous step) (back to tree)

lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), resDeq = pcf(tid), # tids ≠ 0, (tid = tid0 ⊃ pcstepf(gs, lsf(tid0), pcf(tid0), RetDeq(tid0, optval));pcf(tid0)) ≠ invDeq, ¬((tid = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), RetDeq(tid2, optval));pcf(tid2)) = invDeq ↔ tid2 ∈ tids), ¬((tid = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), RetDeq(tid1, optval));pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), tids ≠ ∅, DQGInv(gs), DQLInv(gs, mkls(tid, obsEmpty, val, optval, val0, optval0), resDeq), tid0 ∈ tids, ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 4

Additional information

Proof step 170 from proof DQINV-Step (previous step) (back to tree)

lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), resDeq = pcf(tid), tid = tid0, # tids ≠ 0, ¬((tid = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), RetDeq(tid2, optval));pcf(tid2)) = invDeq ↔ tid2 ∈ tids), ¬((tid = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), RetDeq(tid1, optval));pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), pcstepf(gs, lsf(tid0), pcf(tid0), RetDeq(tid0, optval)) ≠ invDeq, tids ≠ ∅, DQGInv(gs), DQLInv(gs, mkls(tid, obsEmpty, val, optval, val0, optval0), resDeq), tid0 ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ invDeq ≠ ready; (s) ⊦ pcstepf (gs, mkls(tid, obsEmpty, ival, oval, value, optval), resDeq, RetDeq(tid, oval)) = ready; (s)

Proof step 171 from proof DQINV-Step (previous step) (back to tree)

lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), resDeq = pcf(tid0), # tids ≠ 0, ¬((tid0 = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), RetDeq(tid1, optval));pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), ¬((tid0 = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), RetDeq(tid2, optval));pcf(tid2)) = invDeq ↔ tid2 ∈ tids), tids ≠ ∅, DQGInv(gs), DQLInv(gs, mkls(tid0, obsEmpty, val, optval, val0, optval0), resDeq), tid0 ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦

User applied rule all left

And closed the goal!

Rule argument

pos: left 11 terms: tid0 abort: F discard: F computed: T

Additional information

Used simplifier rules: ⊦ invDeq ≠ resDeq; (s) Used terms: tid0

Proof step 172 from proof DQINV-Step (previous step) (back to tree)

lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), resDeq = pcf(tid), # tids ≠ 0, ¬((tid = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), RetDeq(tid2, optval));pcf(tid2)) = invDeq ↔ tid2 ∈ tids), ¬((tid = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), RetDeq(tid1, optval));pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), pcf(tid0) ≠ invDeq, tid ≠ tid0, tids ≠ ∅, DQGInv(gs), DQLInv(gs, mkls(tid, obsEmpty, val, optval, val0, optval0), resDeq), tid0 ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 13 terms: tid0

Additional information

Used terms: tid0

Proof step 173 from proof DQINV-Step (previous step) (back to tree)

lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), resEnq = pcf(tid), ¬((tid = tid0 ⊃ pcstepf(gs, lsf(tid0), pcf(tid0), ca);pcf(tid0)) = invDeq ↔ tid0 ∈ tids), ¬((tid = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), ca);pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), ¬((tid = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), ca);pcf(tid2)) = invDeq ↔ tid2 = tid0 ∨ tid2 ∈ tids), ca ≠ globalCrash, DQGInv(gs), DQLInv(gs, mkls(tid, obsEmpty, val, optval, val0, optval0), pcf(tid)), pre(gs, mkls(tid, obsEmpty, val, optval, val0, optval0), pcf(tid), ca), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ RetEnq(tid) ≠ globalCrash; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).tid = tid; (s) ⊦ pre(gs, ls, resEnq, a) ↔ a = RetEnq(ls.tid); (s)

Proof step 174 from proof DQINV-Step (previous step) (back to tree)

lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), resEnq = pcf(tid), ¬((tid = tid0 ⊃ pcstepf(gs, lsf(tid0), pcf(tid0), RetEnq(tid0));pcf(tid0)) = invDeq ↔ tid0 ∈ tids), ¬((tid = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), RetEnq(tid1));pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), ¬((tid = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), RetEnq(tid2));pcf(tid2)) = invDeq ↔ tid2 = tid0 ∨ tid2 ∈ tids), DQGInv(gs), DQLInv(gs, mkls(tid, obsEmpty, val, optval, val0, optval0), resEnq), ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 3

Additional information

Proof step 175 from proof DQINV-Step (previous step) (back to tree)

(tid = tid0 ⊃ pcstepf(gs, lsf(tid0), pcf(tid0), RetEnq(tid0));pcf(tid0)) = invDeq, lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), resEnq = pcf(tid), ¬((tid = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), RetEnq(tid1));pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), ¬((tid = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), RetEnq(tid2));pcf(tid2)) = invDeq ↔ tid2 = tid0 ∨ tid2 ∈ tids), DQGInv(gs), DQLInv(gs, mkls(tid, obsEmpty, val, optval, val0, optval0), resEnq), ¬ tid0 ∈ tids, ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 176 from proof DQINV-Step (previous step) (back to tree)

(tid = tid0 ⊃ pcstepf(gs, lsf(tid0), pcf(tid0), RetEnq(tid0));pcf(tid0)) = invDeq, lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), resEnq = pcf(tid), ¬((tid = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), RetEnq(tid2));pcf(tid2)) = invDeq ↔ tid2 = tid0 ∨ tid2 ∈ tids), ¬((tid = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), RetEnq(tid1));pcf(tid1)) = invDeq ↔ tid1 ∈ tids), DQGInv(gs), DQLInv(gs, mkls(tid, obsEmpty, val, optval, val0, optval0), resEnq), ¬ tid0 ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 1

Additional information

Used simplifier rules: ⊦ pcstepf (gs, mkls(tid, obsEmpty, ival, oval, value, optval), resEnq, RetEnq(tid)) = ready; (s) ⊦ invDeq ≠ ready; (s)

Proof step 177 from proof DQINV-Step (previous step) (back to tree)

lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), pcf(tid0) = invDeq, resEnq = pcf(tid), ¬((tid = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), RetEnq(tid2));pcf(tid2)) = invDeq ↔ tid2 = tid0 ∨ tid2 ∈ tids), ¬((tid = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), RetEnq(tid1));pcf(tid1)) = invDeq ↔ tid1 ∈ tids), tid ≠ tid0, DQGInv(gs), DQLInv(gs, mkls(tid, obsEmpty, val, optval, val0, optval0), resEnq), ¬ tid0 ∈ tids, ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 10 terms: tid0

Additional information

Used terms: tid0

Proof step 178 from proof DQINV-Step (previous step) (back to tree)

lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), resEnq = pcf(tid), (tid = tid0 ⊃ pcstepf(gs, lsf(tid0), pcf(tid0), RetEnq(tid0));pcf(tid0)) ≠ invDeq, ¬((tid = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), RetEnq(tid1));pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), ¬((tid = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), RetEnq(tid2));pcf(tid2)) = invDeq ↔ tid2 = tid0 ∨ tid2 ∈ tids), DQGInv(gs), DQLInv(gs, mkls(tid, obsEmpty, val, optval, val0, optval0), resEnq), tid0 ∈ tids, ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: size-zero-01: ⊦ s ≠ ∅ → # s ≠ 0; (forward) from specification set-basic[tidset] ne-01: ⊦ a ∈ s → s ≠ ∅; (forward) from specification set-basic[tidset]

Proof step 179 from proof DQINV-Step (previous step) (back to tree)

lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), resEnq = pcf(tid), # tids ≠ 0, (tid = tid0 ⊃ pcstepf(gs, lsf(tid0), pcf(tid0), RetEnq(tid0));pcf(tid0)) ≠ invDeq, ¬((tid = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), RetEnq(tid2));pcf(tid2)) = invDeq ↔ tid2 ∈ tids), ¬((tid = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), RetEnq(tid1));pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), tids ≠ ∅, DQGInv(gs), DQLInv(gs, mkls(tid, obsEmpty, val, optval, val0, optval0), resEnq), tid0 ∈ tids, ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 4

Additional information

Proof step 180 from proof DQINV-Step (previous step) (back to tree)

lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), resEnq = pcf(tid), tid = tid0, # tids ≠ 0, ¬((tid = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), RetEnq(tid2));pcf(tid2)) = invDeq ↔ tid2 ∈ tids), ¬((tid = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), RetEnq(tid1));pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), pcstepf(gs, lsf(tid0), pcf(tid0), RetEnq(tid0)) ≠ invDeq, tids ≠ ∅, DQGInv(gs), DQLInv(gs, mkls(tid, obsEmpty, val, optval, val0, optval0), resEnq), tid0 ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ invDeq ≠ ready; (s) ⊦ pcstepf (gs, mkls(tid, obsEmpty, ival, oval, value, optval), resEnq, RetEnq(tid)) = ready; (s)

Proof step 181 from proof DQINV-Step (previous step) (back to tree)

lsf(tid0) = mkls(tid0, obsEmpty, val, optval, val0, optval0), resEnq = pcf(tid0), # tids ≠ 0, ¬((tid0 = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), RetEnq(tid1));pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), ¬((tid0 = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), RetEnq(tid2));pcf(tid2)) = invDeq ↔ tid2 ∈ tids), tids ≠ ∅, DQGInv(gs), DQLInv(gs, mkls(tid0, obsEmpty, val, optval, val0, optval0), resEnq), tid0 ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦

User applied rule all left

And closed the goal!

Rule argument

pos: left 11 terms: tid0 abort: F discard: F computed: T

Additional information

Used simplifier rules: ⊦ invDeq ≠ resEnq; (s) Used terms: tid0

Proof step 182 from proof DQINV-Step (previous step) (back to tree)

lsf(tid) = mkls(tid, obsEmpty, val, optval, val0, optval0), resEnq = pcf(tid), # tids ≠ 0, ¬((tid = tid2 ⊃ pcstepf(gs, lsf(tid2), pcf(tid2), RetEnq(tid2));pcf(tid2)) = invDeq ↔ tid2 ∈ tids), ¬((tid = tid1 ⊃ pcstepf(gs, lsf(tid1), pcf(tid1), RetEnq(tid1));pcf(tid1)) = invDeq ↔ tid1 ≠ tid0 ∧ tid1 ∈ tids), pcf(tid0) ≠ invDeq, tid ≠ tid0, tids ≠ ∅, DQGInv(gs), DQLInv(gs, mkls(tid, obsEmpty, val, optval, val0, optval0), resEnq), tid0 ∈ tids, ∀ tid. lsf(tid).tid = tid ∧ DQLInv(gs, lsf(tid), pcf(tid)), ∀ tid. pcf(tid) = invDeq ↔ tid ∈ tids ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 13 terms: tid0

Additional information

Used terms: tid0

Proof Tree for DQINV-Step (View conclusion)

The following image shows the proof tree of sequent calculus. The proved goal is at the bottom. You can click on the nodes to view additional rules. See here for details on colors in a proof tree.

the proof tree