Proof step 1 from proof rem-reachable-rev-weak (conclusion) (back to tree)

System applied rule normalize

And obtained the following new goals

• Proof step 2:

  ce.nxt = H[H[r1].nxt].nxt, H[r1].nxt ≠ null, ¬(reachable(r, r0, H) ↔ true), r0 ≠ H[r1].nxt, r1 ≠ null, reachable(r, r0, H[r1, ce]), H[r1].nxt ∈ H, r1 ∈ H ⊦

Rule argument

Additional information

Proof step 2 from proof rem-reachable-rev-weak (previous step) (back to tree)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 3:

  ce.nxt = H[H[r1].nxt].nxt, H[r1].nxt ≠ null, r0 ≠ H[r1].nxt, r1 ≠ null, reachable(r, r0, H[r1, ce]), r1 ∈ H, H[r1].nxt ∈ H, ¬ reachable(r, r0, H) ⊦

Rule argument

Additional information

Proof step 3 from proof rem-reachable-rev-weak (previous step) (back to tree)

User applied rule apply rewrite lemma

And obtained the following new goals

• Proof step 4:

  ⊦ reachable(r, r0, h) ↔ (∃ x. path(r ' + x, h) ∧ (r ' + x).last = r0)

• Proof step 5:

  ce.nxt = H[H[r1].nxt].nxt, H[r1].nxt ≠ null, r0 ≠ H[r1].nxt, r1 ≠ null, H[r1].nxt ∈ H, r1 ∈ H, ¬ reachable(r, r0, H), ∃ x. path(r ' + x, H[r1, ce]) ∧ (r ' + x).last = r0 ⊦

Rule argument

Additional information

Used terms: H[r1, ce], r0, r

Proof step 4 from proof rem-reachable-rev-weak (previous step) (back to tree)

Lemma reachable-def

Proof step 5 from proof rem-reachable-rev-weak (previous step) (back to tree)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 6:

  ce.nxt = H[H[r1].nxt].nxt, (r ' + x).last ≠ H[r1].nxt, H[r1].nxt ≠ null, r1 ≠ null, path(r ' + x, H[r1, ce]), r1 ∈ H, H[r1].nxt ∈ H, ¬ reachable(r, (r ' + x).last, H) ⊦

Rule argument

Additional information

Proof step 6 from proof rem-reachable-rev-weak (previous step) (back to tree)

User applied rule structural induction

And obtained the following new goals

• Proof step 7:

  ce.nxt = H[H[r1].nxt].nxt, (r ' + (r0 + x0)).last ≠ H[r1].nxt, H[r1].nxt ≠ null, r1 ≠ null, path(r ' + (r0 + x0), H[r1, ce]), H[r1].nxt ∈ H, r1 ∈ H, ¬ reachable(r, (r ' + (r0 + x0)).last, H), ∀ ce, H, r1, r. ¬ ( ce.nxt = H[H[r1].nxt].nxt ∧ (r ' + x0).last ≠ H[r1].nxt ∧ H[r1].nxt ≠ null ∧ r1 ≠ null ∧ path(r ' + x0, H[r1, ce]) ∧ r1 ∈ H ∧ H[r1].nxt ∈ H ∧ ¬ reachable(r, (r ' + x0).last, H)) ⊦

Rule argument

Additional information

Used simplifier rules: path-one: ⊦ path(r ', h) ↔ r ∈ h ∧ r ≠ null; self-reachable: ⊦ reachable(r, r, h) ↔ r ≠ null ∧ r ∈ h; reflist freely generated by [], +;; ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a '.last = a; (s) ⊦ a ∈ st[b, d] ↔ a = b ∨ a ∈ st; (ws)

Proof step 7 from proof rem-reachable-rev-weak (previous step) (back to tree)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 8:

  ce.nxt = H[H[r1].nxt].nxt, (H[r1, ce][r].nxt ' + x0).last ≠ H[r1].nxt, H[r1].nxt ≠ null, r ≠ null, r1 ≠ null, path(H[r1, ce][r].nxt ' + x0, H[r1, ce]), r ∈ H[r1, ce], H[r1].nxt ∈ H, r1 ∈ H, ¬ reachable(r, (H[r1, ce][r].nxt ' + x0).last, H), ∀ ce0, H0, r2, r3. ce0.nxt ≠ H0[H0[r2].nxt].nxt ∨ (r3 ' + x0).last = H0[r2].nxt ∨ H0[r2].nxt = null ∨ r2 = null ∨ ¬ path(r3 ' + x0, H0[r2, ce0]) ∨ ¬ r2 ∈ H0 ∨ ¬ H0[r2].nxt ∈ H0 ∨ reachable(r3, (r3 ' + x0).last, H0) ⊦

Rule argument

Additional information

Used simplifier rules: path-cons: ⊦ path(r ' + r0 ' + x, h) ↔ r ∈ h ∧ r ≠ null ∧ h[r].nxt = r0 ∧ path(r0 ' + x, h); a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) ⊦ a + x = a ' + x; (s)

Proof step 8 from proof rem-reachable-rev-weak (previous step) (back to tree)

User applied rule all left

And obtained the following new goals

• Proof step 9:

  ce.nxt = H[H[r1].nxt].nxt, (H[r1, ce][r].nxt ' + x0).last ≠ H[r1].nxt, H[r1].nxt ≠ null, r ≠ null, r1 ≠ null, path(H[r1, ce][r].nxt ' + x0, H[r1, ce]), r1 ∈ H, H[r1].nxt ∈ H, r ∈ H[r1, ce], ¬ reachable(r, (H[r1, ce][r].nxt ' + x0).last, H), ce.nxt ≠ H[H[r1].nxt].nxt ∨ (H[r1, ce][r].nxt ' + x0).last = H[r1].nxt ∨ H[r1].nxt = null ∨ r1 = null ∨ ¬ path(H[r1, ce][r].nxt ' + x0, H[r1, ce]) ∨ ¬ r1 ∈ H ∨ ¬ H[r1].nxt ∈ H ∨ reachable(H[r1, ce][r].nxt, (H[r1, ce][r].nxt ' + x0).last, H) ⊦

Rule argument

Additional information

Used terms: ce, H, r1, H[r1, ce][r].nxt

Proof step 9 from proof rem-reachable-rev-weak (previous step) (back to tree)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 10:

  ce.nxt = H[H[r1].nxt].nxt, (H[r1, ce][r].nxt ' + x0).last ≠ H[r1].nxt, H[r1].nxt ≠ null, r ≠ null, r1 ≠ null, path(H[r1, ce][r].nxt ' + x0, H[r1, ce]), reachable(H[r1, ce][r].nxt, (H[r1, ce][r].nxt ' + x0).last, H), r ∈ H[r1, ce], H[r1].nxt ∈ H, r1 ∈ H, ¬ reachable(r, (H[r1, ce][r].nxt ' + x0).last, H) ⊦

Rule argument

Additional information

Proof step 10 from proof rem-reachable-rev-weak (previous step) (back to tree)

User applied rule apply rewrite lemma

And obtained the following new goals

• Proof step 11:

  ⊦ a ≠ b → st[b, d][a] = st[a]

• Proof step 12:

  ce.nxt = H[H[r1].nxt].nxt, r = r1, (H[r1, ce][r].nxt ' + x0).last ≠ H[r1].nxt, H[r1].nxt ≠ null, r ≠ null, r1 ≠ null, path(H[r1, ce][r].nxt ' + x0, H[r1, ce]), reachable(H[r1, ce][r].nxt, (H[r1, ce][r].nxt ' + x0).last, H), r1 ∈ H, H[r1].nxt ∈ H, r ∈ H[r1, ce], ¬ reachable(r, (H[r1, ce][r].nxt ' + x0).last, H) ⊦

• Proof step 20:

  ce.nxt = H[H[r1].nxt].nxt, (H[r].nxt ' + x0).last ≠ H[r1].nxt, H[r1].nxt ≠ null, r ≠ r1, r ≠ null, r1 ≠ null, path(H[r].nxt ' + x0, H[r1, ce]), reachable(H[r].nxt, (H[r].nxt ' + x0).last, H), r1 ∈ H, H[r1].nxt ∈ H, r ∈ H[r1, ce], ¬ reachable(r, (H[r].nxt ' + x0).last, H) ⊦

Rule argument

Additional information

Used terms: r, ce, r1, H

Proof step 11 from proof rem-reachable-rev-weak (previous step) (back to tree)

A spec-lemma

Proof step 12 from proof rem-reachable-rev-weak (previous step) (back to tree)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 13:

  ce.nxt = H[H[r1].nxt].nxt, (ce.nxt ' + x0).last ≠ H[r1].nxt, H[r1].nxt ≠ null, r1 ≠ null, path(ce.nxt ' + x0, H[r1, ce]), reachable(ce.nxt, (ce.nxt ' + x0).last, H), H[r1].nxt ∈ H, r1 ∈ H, ¬ reachable(r1, (ce.nxt ' + x0).last, H) ⊦

Rule argument

Additional information

Used simplifier rules: ⊦ st[a, d][a] = d; (s) ⊦ a ∈ st[a, d]; (s)

Proof step 13 from proof rem-reachable-rev-weak (previous step) (back to tree)

User applied rule apply rewrite lemma

And obtained the following new goals

• Proof step 14:

  ⊦ reachable(r, r0, h) ↔ (∃ x. path(r ' + x, h) ∧ (r ' + x).last = r0)

• Proof step 15:

  ce.nxt = H[H[r1].nxt].nxt, (ce.nxt ' + x0).last ≠ H[r1].nxt, H[r1].nxt ≠ null, r1 ≠ null, path(ce.nxt ' + x0, H[r1, ce]), r1 ∈ H, H[r1].nxt ∈ H, ¬ reachable(r1, (ce.nxt ' + x0).last, H), ∃ x. path(ce.nxt ' + x, H) ∧ (ce.nxt ' + x).last = (ce.nxt ' + x0).last ⊦

Rule argument

Additional information

Used terms: H, (ce.nxt ' + x0).last, ce.nxt

Proof step 14 from proof rem-reachable-rev-weak (previous step) (back to tree)

Lemma reachable-def

Proof step 15 from proof rem-reachable-rev-weak (previous step) (back to tree)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 16:

  (ce.nxt ' + x).last = (ce.nxt ' + x0).last, ce.nxt = H[H[r1].nxt].nxt, (ce.nxt ' + x0).last ≠ H[r1].nxt, H[r1].nxt ≠ null, r1 ≠ null, path(ce.nxt ' + x, H), path(ce.nxt ' + x0, H[r1, ce]), H[r1].nxt ∈ H, r1 ∈ H, ¬ reachable(r1, (ce.nxt ' + x0).last, H) ⊦

Rule argument

Additional information

Proof step 16 from proof rem-reachable-rev-weak (previous step) (back to tree)

User applied rule apply rewrite lemma

And obtained the following new goals

• Proof step 17:

  ⊦ reachable(r, r0, h) ↔ (∃ x. path(r ' + x, h) ∧ (r ' + x).last = r0)

• Proof step 18:

  (ce.nxt ' + x).last = (ce.nxt ' + x0).last, ce.nxt = H[H[r1].nxt].nxt, (ce.nxt ' + x0).last ≠ H[r1].nxt, H[r1].nxt ≠ null, r1 ≠ null, path(ce.nxt ' + x0, H[r1, ce]), path(ce.nxt ' + x, H), r1 ∈ H, H[r1].nxt ∈ H, ∀ x. ¬(path(r1 ' + x, H) ∧ (r1 ' + x).last = (ce.nxt ' + x0).last) ⊦

Rule argument

Additional information

Used terms: H, (ce.nxt ' + x0).last, r1

Proof step 17 from proof rem-reachable-rev-weak (previous step) (back to tree)

Lemma reachable-def

Proof step 18 from proof rem-reachable-rev-weak (previous step) (back to tree)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 19:

  (ce.nxt ' + x).last = (ce.nxt ' + x0).last, ce.nxt = H[H[r1].nxt].nxt, (ce.nxt ' + x0).last ≠ H[r1].nxt, H[r1].nxt ≠ null, r1 ≠ null, path(ce.nxt ' + x, H), path(ce.nxt ' + x0, H[r1, ce]), H[r1].nxt ∈ H, r1 ∈ H, ∀ x1. ¬ path(r1 ' + x1, H) ∨ (r1 ' + x1).last ≠ (ce.nxt ' + x0).last ⊦

Rule argument

Additional information

Proof step 19 from proof rem-reachable-rev-weak (previous step) (back to tree)

User applied rule all left

And closed the goal!

Rule argument

Additional information

Used simplifier rules: path-cons: ⊦ path(r ' + r0 ' + x, h) ↔ r ∈ h ∧ r ≠ null ∧ h[r].nxt = r0 ∧ path(r0 ' + x, h); ⊦ (a ' + x + b ' + y).last = (b ' + y).last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: H[r1].nxt ' + H[H[r1].nxt].nxt ' + x

Proof step 20 from proof rem-reachable-rev-weak (previous step) (back to tree)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 21:

  ce.nxt = H[H[r1].nxt].nxt, (H[r].nxt ' + x0).last ≠ H[r1].nxt, H[r1].nxt ≠ null, r ≠ r1, r ≠ null, r1 ≠ null, path(H[r].nxt ' + x0, H[r1, ce]), reachable(H[r].nxt, (H[r].nxt ' + x0).last, H), H[r1].nxt ∈ H, r1 ∈ H, r ∈ H, ¬ reachable(r, (H[r].nxt ' + x0).last, H) ⊦

Rule argument

Additional information

Used simplifier rules: ⊦ a ∈ st[b, d] ↔ a = b ∨ a ∈ st; (ws)

Proof step 21 from proof rem-reachable-rev-weak (previous step) (back to tree)

User applied rule apply rewrite lemma

And obtained the following new goals

• Proof step 22:

  ⊦ reachable(r, r0, h) ↔ (∃ x. path(r ' + x, h) ∧ (r ' + x).last = r0)

• Proof step 23:

  ce.nxt = H[H[r1].nxt].nxt, (H[r].nxt ' + x0).last ≠ H[r1].nxt, H[r1].nxt ≠ null, r ≠ r1, r ≠ null, r1 ≠ null, path(H[r].nxt ' + x0, H[r1, ce]), r ∈ H, r1 ∈ H, H[r1].nxt ∈ H, ¬ reachable(r, (H[r].nxt ' + x0).last, H), ∃ x. path(H[r].nxt ' + x, H) ∧ (H[r].nxt ' + x).last = (H[r].nxt ' + x0).last ⊦

Rule argument

Additional information

Used terms: H, (H[r].nxt ' + x0).last, H[r].nxt

Proof step 22 from proof rem-reachable-rev-weak (previous step) (back to tree)

Lemma reachable-def

Proof step 23 from proof rem-reachable-rev-weak (previous step) (back to tree)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 24:

  (H[r].nxt ' + x).last = (H[r].nxt ' + x0).last, ce.nxt = H[H[r1].nxt].nxt, (H[r].nxt ' + x0).last ≠ H[r1].nxt, H[r1].nxt ≠ null, r ≠ r1, r ≠ null, r1 ≠ null, path(H[r].nxt ' + x, H), path(H[r].nxt ' + x0, H[r1, ce]), H[r1].nxt ∈ H, r1 ∈ H, r ∈ H, ¬ reachable(r, (H[r].nxt ' + x0).last, H) ⊦

Rule argument

Additional information

Proof step 24 from proof rem-reachable-rev-weak (previous step) (back to tree)

User applied rule apply rewrite lemma

And obtained the following new goals

• Proof step 25:

  ⊦ reachable(r, r0, h) ↔ (∃ x. path(r ' + x, h) ∧ (r ' + x).last = r0)

• Proof step 26:

  (H[r].nxt ' + x).last = (H[r].nxt ' + x0).last, ce.nxt = H[H[r1].nxt].nxt, (H[r].nxt ' + x0).last ≠ H[r1].nxt, H[r1].nxt ≠ null, r ≠ r1, r ≠ null, r1 ≠ null, path(H[r].nxt ' + x0, H[r1, ce]), path(H[r].nxt ' + x, H), r ∈ H, r1 ∈ H, H[r1].nxt ∈ H, ∀ x. ¬(path(r ' + x, H) ∧ (r ' + x).last = (H[r].nxt ' + x0).last) ⊦

Rule argument

Additional information

Used terms: H, (H[r].nxt ' + x0).last, r

Proof step 25 from proof rem-reachable-rev-weak (previous step) (back to tree)

Lemma reachable-def

Proof step 26 from proof rem-reachable-rev-weak (previous step) (back to tree)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 27:

  (H[r].nxt ' + x).last = (H[r].nxt ' + x0).last, ce.nxt = H[H[r1].nxt].nxt, (H[r].nxt ' + x0).last ≠ H[r1].nxt, H[r1].nxt ≠ null, r ≠ r1, r ≠ null, r1 ≠ null, path(H[r].nxt ' + x, H), path(H[r].nxt ' + x0, H[r1, ce]), H[r1].nxt ∈ H, r1 ∈ H, r ∈ H, ∀ x1. ¬ path(r ' + x1, H) ∨ (r ' + x1).last ≠ (H[r].nxt ' + x0).last ⊦

Rule argument

Additional information

Proof step 27 from proof rem-reachable-rev-weak (previous step) (back to tree)

User applied rule all left

And closed the goal!

Rule argument

Additional information

Used simplifier rules: path-cons: ⊦ path(r ' + r0 ' + x, h) ↔ r ∈ h ∧ r ≠ null ∧ h[r].nxt = r0 ∧ path(r0 ' + x, h); ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: H[r].nxt ' + x