[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 53 from proof reach-n-path-n (previous step)

1 + # x1 = 3 + n, ∀ H0, r1, r2. (∃ r3. reachable-1(H0, r1, r3) ∧ reachable-n(H0, n, r3, r2)) ↔ (∃ x. path(x, H0) ∧ hd x = r1 ∧ x.last = r2 ∧ # x = 2 + n), 1 = # x1 ∧ r ∈ H ∧ hd x1 ∈ H ∧ r ≠ null ∧ hd x1 ≠ null ∧ H[r].nxt = hd x1 ∨ 1 ≤ # x1 ∧ r ∈ H ∧ r ≠ null ∧ H[r].nxt = hd x1 ∧ path(x1, H) ⊦ x1 = [], ∃ r0. reachable-1(H, r, r0) ∧ (∃ r1. reachable-1(H, r0, r1) ∧ reachable-n(H, n, r1, x1.last))

Heuristic elimination applied rule insert elim lemma

And obtained the following new goals

Proof step 54:
x1 = r4 + x2, 1 + # x1 = 3 + n, ∀ H0, r1, r2. (∃ r3. reachable-1(H0, r1, r3) ∧ reachable-n(H0, n, r3, r2)) ↔ (∃ x. path(x, H0) ∧ hd x = r1 ∧ x.last = r2 ∧ # x = 2 + n), 1 = # x1 ∧ r ∈ H ∧ r4 ∈ H ∧ r ≠ null ∧ r4 ≠ null ∧ H[r].nxt = r4 ∨ 1 ≤ # x1 ∧ r ∈ H ∧ r ≠ null ∧ H[r].nxt = r4 ∧ path(x1, H) ⊦ x1 = [], ∃ r0. reachable-1(H, r, r0) ∧ (∃ r1. reachable-1(H, r0, r1) ∧ reachable-n(H, n, r1, x1.last))

Rule argument

spec: list-data inst: reflist name: elim-list-c seq: x0 ≠ [] ⊦ r = hd x0 ∧ x1 = tl x0 ↔ x0 = r + x1 subst: [x0, r, x1] → [x1, r4, x0] flags:

Additional information

Used simplifier rules: x0 ≠ [] ⊦ r = hd x0 ∧ x1 = tl x0 ↔ x0 = r + x1; (elim) Used terms: x1, r4, x0