Proof step 1 from proof sharing-com (conclusion) (back to tree)

System applied rule normalize

And obtained the following new goals

• Proof step 2:

  hP0 ⊗ hP1 ≠ hP1 ⊗ hP0 ⊦

Rule argument

Additional information

Proof step 2 from proof sharing-com (previous step) (back to tree)

User applied rule expand left

And obtained the following new goals

• Proof step 3:

  ¬(((hP0 ⊗ hP1))(h) ↔ ((hP1 ⊗ hP0))(h)) ⊦

Rule argument

Additional information

Proof step 3 from proof sharing-com (previous step) (back to tree)

User applied rule case distinction

And obtained the following new goals

• Proof step 4:

  ((hP0 ⊗ hP1))(h), ¬ ((hP1 ⊗ hP0))(h) ⊦

• Proof step 18:

  ((hP1 ⊗ hP0))(h), ¬ ((hP0 ⊗ hP1))(h) ⊦

Rule argument

Additional information

Proof step 4 from proof sharing-com (previous step) (back to tree)

User applied rule apply rewrite lemma

And obtained the following new goals

• Proof step 5:

  ⊦ ((hP0 ⊗ hP1))(h) ↔ (∃ h0, h1, h2. h0 ⊥ h2 ∧ h0 ⊥ h1 ∧ h1 ⊥ h2 ∧ h = h0 ∪ h1 ∪ h2 ∧ hP0(h0 ∪ h2) ∧ hP1(h1 ∪ h2))

• Proof step 6:

  ¬ ((hP1 ⊗ hP0))(h), ∃ h0, h1, h2. h0 ⊥ h2 ∧ h0 ⊥ h1 ∧ h1 ⊥ h2 ∧ h = h0 ∪ h1 ∪ h2 ∧ hP0(h0 ∪ h2) ∧ hP1(h1 ∪ h2) ⊦

Rule argument

Additional information

Used terms: h, hP1, hP0

Proof step 5 from proof sharing-com (previous step) (back to tree)

Lemma sharing

Proof step 6 from proof sharing-com (previous step) (back to tree)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 7:

  hP0(h0 ∪ h2), hP1(h1 ∪ h2), h0 ⊥ h2, h0 ⊥ h1, h1 ⊥ h2, ¬ ((hP1 ⊗ hP0))(h0 ∪ h1 ∪ h2) ⊦

Rule argument

Additional information

Proof step 7 from proof sharing-com (previous step) (back to tree)

User applied rule apply rewrite lemma

And obtained the following new goals

• Proof step 8:

  ⊦ ((hP0 ⊗ hP1))(h) ↔ (∃ h0, h1, h2. h0 ⊥ h2 ∧ h0 ⊥ h1 ∧ h1 ⊥ h2 ∧ h = h0 ∪ h1 ∪ h2 ∧ hP0(h0 ∪ h2) ∧ hP1(h1 ∪ h2))

• Proof step 9:

  hP0(h0 ∪ h2), hP1(h1 ∪ h2), h1 ⊥ h2, h0 ⊥ h1, h0 ⊥ h2, ∀ h3, h4, h5. ¬(h3 ⊥ h5 ∧ h3 ⊥ h4 ∧ h4 ⊥ h5 ∧ h0 ∪ h1 ∪ h2 = h3 ∪ h4 ∪ h5 ∧ hP1(h3 ∪ h5) ∧ hP0(h4 ∪ h5)) ⊦

Rule argument

Additional information

Used terms: h0 ∪ h1 ∪ h2, hP0, hP1

Proof step 8 from proof sharing-com (previous step) (back to tree)

Lemma sharing

Proof step 9 from proof sharing-com (previous step) (back to tree)

User applied rule all left

And obtained the following new goals

• Proof step 10:

  hP0(h0 ∪ h2), hP1(h1 ∪ h2), h0 ⊥ h2, h0 ⊥ h1, h1 ⊥ h2 ⊦ h1 ⊥ h2 ∧ h1 ⊥ h0 ∧ h0 ⊥ h2 ∧ h0 ∪ h1 ∪ h2 = h1 ∪ h0 ∪ h2 ∧ hP1(h1 ∪ h2) ∧ hP0(h0 ∪ h2)

Rule argument

Additional information

Used terms: h1, h0, h2

Proof step 10 from proof sharing-com (previous step) (back to tree)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 11:

  h0 ∪ h1 ∪ h2 ≠ h1 ∪ h0 ∪ h2, hP0(h0 ∪ h2), hP1(h1 ∪ h2), h1 ⊥ h2, h0 ⊥ h1, h0 ⊥ h2 ⊦

Rule argument

Additional information

Used simplifier rules: ⊦ h0 ⊥ h1 → h1 ⊥ h0; (s)

Proof step 11 from proof sharing-com (previous step) (back to tree)

User applied rule apply rewrite lemma

And obtained the following new goals

• Proof step 12:

  ⊦ h0 ⊥ h1 ∧ h1 ⊥ h ∧ h ⊥ h0 → (h0 ∪ h1) ∪ h = h0 ∪ h1 ∪ h

• Proof step 13:

  h0 ∪ h1 ∪ h2 ≠ (h1 ∪ h0) ∪ h2, hP0(h0 ∪ h2), hP1(h1 ∪ h2), h0 ⊥ h1, h1 ⊥ h2, h1 ⊥ h0, h0 ⊥ h2, h2 ⊥ h1 ⊦

Rule argument

Additional information

Used simplifier rules: ⊦ h0 ⊥ h1 → h1 ⊥ h0; (s) Used terms: h2, h0, h1

Proof step 12 from proof sharing-com (previous step) (back to tree)

A spec-lemma

Proof step 13 from proof sharing-com (previous step) (back to tree)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 14:

  h0 ∪ h1 ∪ h2 ≠ (h1 ∪ h0) ∪ h2, hP0(h0 ∪ h2), hP1(h1 ∪ h2), h0 ⊥ h2, h1 ⊥ h2, h0 ⊥ h1 ⊦

Rule argument

Additional information

Used simplifier rules: ⊦ h0 ⊥ h1 → h1 ⊥ h0; (s)

Proof step 14 from proof sharing-com (previous step) (back to tree)

User applied rule apply rewrite lemma

And obtained the following new goals

• Proof step 15:

  ⊦ h0 ⊥ h1 → h1 ∪ h0 = h0 ∪ h1

• Proof step 16:

  h0 ∪ h1 ∪ h2 ≠ (h0 ∪ h1) ∪ h2, hP0(h0 ∪ h2), hP1(h1 ∪ h2), h1 ⊥ h2, h0 ⊥ h2, h0 ⊥ h1 ⊦

Rule argument

Additional information

Used terms: h0, h1

Proof step 15 from proof sharing-com (previous step) (back to tree)

A spec-lemma

Proof step 16 from proof sharing-com (previous step) (back to tree)

User applied rule apply rewrite lemma

And obtained the following new goals

• Proof step 17:

  ⊦ h0 ⊥ h1 ∧ h1 ⊥ h ∧ h ⊥ h0 → (h0 ∪ h1) ∪ h = h0 ∪ h1 ∪ h

Rule argument

Additional information

Used simplifier rules: ⊦ h0 ⊥ h1 → h1 ⊥ h0; (s) Used terms: h2, h1, h0

Proof step 17 from proof sharing-com (previous step) (back to tree)

A spec-lemma

Proof step 18 from proof sharing-com (previous step) (back to tree)

User applied rule apply rewrite lemma

And obtained the following new goals

• Proof step 19:

  ⊦ ((hP0 ⊗ hP1))(h) ↔ (∃ h0, h1, h2. h0 ⊥ h2 ∧ h0 ⊥ h1 ∧ h1 ⊥ h2 ∧ h = h0 ∪ h1 ∪ h2 ∧ hP0(h0 ∪ h2) ∧ hP1(h1 ∪ h2))

• Proof step 20:

  ((hP1 ⊗ hP0))(h), ∀ h0, h1, h2. ¬(h0 ⊥ h2 ∧ h0 ⊥ h1 ∧ h1 ⊥ h2 ∧ h = h0 ∪ h1 ∪ h2 ∧ hP0(h0 ∪ h2) ∧ hP1(h1 ∪ h2)) ⊦

Rule argument

Additional information

Used terms: h, hP1, hP0

Proof step 19 from proof sharing-com (previous step) (back to tree)

Lemma sharing

Proof step 20 from proof sharing-com (previous step) (back to tree)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 21:

  ((hP1 ⊗ hP0))(h), ∀ h0, h1, h2. ¬ h0 ⊥ h2 ∨ ¬ h0 ⊥ h1 ∨ ¬ h1 ⊥ h2 ∨ h ≠ h0 ∪ h1 ∪ h2 ∨ ¬ hP0(h0 ∪ h2) ∨ ¬ hP1(h1 ∪ h2) ⊦

Rule argument

Additional information

Proof step 21 from proof sharing-com (previous step) (back to tree)

User applied rule apply rewrite lemma

And obtained the following new goals

• Proof step 22:

  ⊦ ((hP0 ⊗ hP1))(h) ↔ (∃ h0, h1, h2. h0 ⊥ h2 ∧ h0 ⊥ h1 ∧ h1 ⊥ h2 ∧ h = h0 ∪ h1 ∪ h2 ∧ hP0(h0 ∪ h2) ∧ hP1(h1 ∪ h2))

• Proof step 23:

  ∀ h0, h1, h2. ¬ h0 ⊥ h2 ∨ ¬ h0 ⊥ h1 ∨ ¬ h1 ⊥ h2 ∨ h ≠ h0 ∪ h1 ∪ h2 ∨ ¬ hP0(h0 ∪ h2) ∨ ¬ hP1(h1 ∪ h2), ∃ h0, h1, h2. h0 ⊥ h2 ∧ h0 ⊥ h1 ∧ h1 ⊥ h2 ∧ h = h0 ∪ h1 ∪ h2 ∧ hP1(h0 ∪ h2) ∧ hP0(h1 ∪ h2) ⊦

Rule argument

Additional information

Used terms: h, hP0, hP1

Proof step 22 from proof sharing-com (previous step) (back to tree)

Lemma sharing

Proof step 23 from proof sharing-com (previous step) (back to tree)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 24:

  hP0(h1 ∪ h2), hP1(h0 ∪ h2), h0 ⊥ h2, h0 ⊥ h1, h1 ⊥ h2, ∀ h3, h4, h5. ¬ h3 ⊥ h5 ∨ ¬ h3 ⊥ h4 ∨ ¬ h4 ⊥ h5 ∨ h0 ∪ h1 ∪ h2 ≠ h3 ∪ h4 ∪ h5 ∨ ¬ hP0(h3 ∪ h5) ∨ ¬ hP1(h4 ∪ h5) ⊦

Rule argument

Additional information

Proof step 24 from proof sharing-com (previous step) (back to tree)

User applied rule all left

And obtained the following new goals

• Proof step 25:

  hP0(h1 ∪ h2), hP1(h0 ∪ h2), h1 ⊥ h2, h0 ⊥ h1, h0 ⊥ h2, ¬ h1 ⊥ h2 ∨ ¬ h1 ⊥ h0 ∨ ¬ h0 ⊥ h2 ∨ h0 ∪ h1 ∪ h2 ≠ h1 ∪ h0 ∪ h2 ∨ ¬ hP0(h1 ∪ h2) ∨ ¬ hP1(h0 ∪ h2) ⊦

Rule argument

Additional information

Used terms: h1, h0, h2

Proof step 25 from proof sharing-com (previous step) (back to tree)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 26:

  h0 ∪ h1 ∪ h2 ≠ h1 ∪ h0 ∪ h2, hP0(h1 ∪ h2), hP1(h0 ∪ h2), h0 ⊥ h2, h0 ⊥ h1, h1 ⊥ h2 ⊦

Rule argument

Additional information

Used simplifier rules: ⊦ h0 ⊥ h1 → h1 ⊥ h0; (s)

Proof step 26 from proof sharing-com (previous step) (back to tree)

User applied rule apply rewrite lemma

And obtained the following new goals

• Proof step 27:

  ⊦ h0 ⊥ h1 ∧ h1 ⊥ h ∧ h ⊥ h0 → (h0 ∪ h1) ∪ h = h0 ∪ h1 ∪ h

• Proof step 28:

  h0 ∪ h1 ∪ h2 ≠ (h1 ∪ h0) ∪ h2, hP0(h1 ∪ h2), hP1(h0 ∪ h2), h1 ⊥ h2, h0 ⊥ h1, h1 ⊥ h0, h0 ⊥ h2, h2 ⊥ h1 ⊦

Rule argument

Additional information

Used simplifier rules: ⊦ h0 ⊥ h1 → h1 ⊥ h0; (s) Used terms: h2, h0, h1

Proof step 27 from proof sharing-com (previous step) (back to tree)

A spec-lemma

Proof step 28 from proof sharing-com (previous step) (back to tree)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 29:

  h0 ∪ h1 ∪ h2 ≠ (h1 ∪ h0) ∪ h2, hP0(h1 ∪ h2), hP1(h0 ∪ h2), h0 ⊥ h2, h0 ⊥ h1, h1 ⊥ h2 ⊦

Rule argument

Additional information

Used simplifier rules: ⊦ h0 ⊥ h1 → h1 ⊥ h0; (s)

Proof step 29 from proof sharing-com (previous step) (back to tree)

User applied rule apply rewrite lemma

And obtained the following new goals

• Proof step 30:

  ⊦ h0 ⊥ h1 → h1 ∪ h0 = h0 ∪ h1

• Proof step 31:

  h0 ∪ h1 ∪ h2 ≠ (h0 ∪ h1) ∪ h2, hP0(h1 ∪ h2), hP1(h0 ∪ h2), h1 ⊥ h2, h0 ⊥ h2, h0 ⊥ h1 ⊦

Rule argument

Additional information

Used terms: h0, h1

Proof step 30 from proof sharing-com (previous step) (back to tree)

A spec-lemma

Proof step 31 from proof sharing-com (previous step) (back to tree)

User applied rule apply rewrite lemma

And obtained the following new goals

• Proof step 32:

  ⊦ h0 ⊥ h1 ∧ h1 ⊥ h ∧ h ⊥ h0 → (h0 ∪ h1) ∪ h = h0 ∪ h1 ∪ h

Rule argument

Additional information

Used simplifier rules: ⊦ h0 ⊥ h1 → h1 ⊥ h0; (s) Used terms: h2, h1, h0

Proof step 32 from proof sharing-com (previous step) (back to tree)

A spec-lemma