| ¬ x ≠ [], (r2 ' + x0).last = (r ' + x).last, x1 + r2 ' = x + H[r2].nxt ' + r0 ' + y, (r ' + x1).last = (r ' + x).last, path(r2 ' + x0, H), r2 ∈ H, H[r2].nxt ∈ H, path(r ' + x1 + r2 ', H), path(r ' + x + H[r2].nxt ', H), path(r ' + x1, H), (r ' + x).last ∈ H, r2 = H[r2].nxt ∨ r2 = r0 ∨ r2 ∈ y ⊦ H[r2].nxt = null, r = r2, r2 ∈ x1, r ∈ x1, dups(x0), r2 ∈ x0, r2 ∈ x, dups(x1) |
H[(r2 ' + x0).last].nxt = H[r2].nxt, ((r2 ' + x0).last ' + x1).last = (r2 ' + x0).last, x1 + r2 ' = H[r2].nxt ' + r0 ' + y, path((r2 ' + x0).last ' + x1, H), (r2 ' + x0).last ∈ H, path((r2 ' + x0).last ' + x1 + r2 ', H), H[r2].nxt ∈ H, r2 ∈ H, path(r2 ' + x0, H), r2 = H[r2].nxt ∨ r2 = r0 ∨ r2 ∈ y, H[r2].nxt ∈ x1 ∨ H[r2].nxt = r2 ⊦ (r2 ' + x0).last = null, (r2 ' + x0).last = r2, H[r2].nxt = null, dups(x1), r2 ∈ x0, dups(x0), (r2 ' + x0).last ∈ x1, r2 ∈ x1
Used simplifier rules: path-two: ⊦ path(r ' + r0 ', H) ↔ ¬ ¬(r ∈ H ∧ r0 ∈ H ∧ r ≠ null ∧ r0 ≠ null ∧ H[r].nxt = r0);%in-17: ⊦ r ∈ r0 ' ↔ r = r0; from specification list[reflist]%in-append: ⊦ r ∈ x0 + x1 ↔ ¬ ¬(r ∈ x0 ∨ r ∈ x1); from specification list[reflist]%in-rec: ⊦ r ∈ r0 ' + x0 ↔ ¬ ¬(r = r0 ∨ r ∈ x0); from specification list[reflist]%in-14: ⊦ r ' + x0 = x1 → r ∈ x1; (forward) from specification list[reflist]%in-15: ⊦ x0 + r ' = x1 → r ∈ x1; (forward) from specification list[reflist]%in-empty: ⊦ ¬ r ∈ []; from specification list[reflist]%Nil: ⊦ [] + x0 = x0; from specification list[reflist]%l: ⊦ r '.last = r; from specification list-last[reflist]%a: ⊦ (x0 + x1) + x2 = x0 + x1 + x2; from specification list[reflist]%app: ⊦ x0 + [] = x0; from specification list[reflist]