| findepth(g) ⊦ ¬(∃ nf. ∀ n. ls(g)(nf(n + 1), nf(n))) |
findepth(g), ∃ nf. ∀ n. ls(g)(nf(n + 1), nf(n)) ⊦
| findepth(g), ∃ nf. ∀ n. ls(g)(nf(n + 1), nf(n)) ⊦ |
findepth(g), ∀ n. ls(g)(nf(n + 1), nf(n)) ⊦
| findepth(g), ∀ n. ls(g)(nf(n + 1), nf(n)) ⊦ |
findepth(g), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ n. ∃ y. pathp(g)(⌜y⌝ ) ∧ y.head = nf(n) ∧ y ≠ [] ∧ y.last = nf(n + 1) ⊦
findepth(g), ∀ n. ls(g)(nf(n + 1), nf(n)) ⊦ ∀ n. ∃ y. pathp(g)(⌜y⌝ ) ∧ y.head = nf(n) ∧ y ≠ [] ∧ y.last = nf(n + 1)
Used formulas: ∀ n. ∃ y. pathp(g)(⌜y⌝ ) ∧ y.head = nf(n) ∧ y ≠ [] ∧ y.last = nf(n + 1)
| findepth(g), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ n. ∃ y. pathp(g)(⌜y⌝ ) ∧ y.head = nf(n) ∧ y ≠ [] ∧ y.last = nf(n + 1) ⊦ |
findepth(g), ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ n. ls(g)(nf(n + 1), nf(n)) ⊦
| findepth(g), ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ n. ls(g)(nf(n + 1), nf(n)) ⊦ |
⊦ findepth(g) ↔ (∀ σ. pathp(g)(σ) → # σ ≠ ∞)
∀ n. ls(g)(nf(n + 1), nf(n)), ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ σ. pathp(g)(σ) → # σ ≠ ∞ ⊦
Used terms: g
| ⊦ findepth(g) ↔ (∀ σ. pathp(g)(σ) → # σ ≠ ∞) |
| ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ σ. pathp(g)(σ) → # σ ≠ ∞ ⊦ |
∀ n. lf(n).last = lf(n + 1).head ∧ lf(n) ≠ [] ⊦ ∃ σ, ii. ii(0) = 0 ∧ (∀ n. ii(n + 1) = ii(n) + # lf(n) - 1 ∧ ⌜ii(n + 1)⌝ < # σ ∧ (σ from ii(n)) to # lf(n) = ⌜lf(n)⌝ ) ∧ (∀ m, n. m ≤ n → ii(m) ≤ ii(n)) ∧ (finp(σ) ⊃ ∃ n. # σ = ⌜ii(n) + 1⌝ ∧ (∀ m. n ≤ m → lf(m).tail = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1))
∀ σ. pathp(g)(σ) → # σ ≠ ∞, ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ n. ls(g)(nf(n + 1), nf(n)) ⊦ ∀ n. f_n->list(n).last = f_n->list(n + 1).head ∧ f_n->list(n) ≠ []
∀ σ. pathp(g)(σ) → # σ ≠ ∞, ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ n. ls(g)(nf(n + 1), nf(n)), ∃ σ, ii. ii(0) = 0 ∧ (∀ n. ii(n + 1) = ii(n) + # f_n->list(n) - 1 ∧ ⌜ii(n + 1)⌝ < # σ ∧ (σ from ii(n)) to # f_n->list(n) = ⌜f_n->list(n)⌝ ) ∧ (∀ m, n. m ≤ n → ii(m) ≤ ii(n)) ∧ (finp(σ) ⊃ ∃ n. # σ = ⌜ii(n) + 1⌝ ∧ (∀ m. n ≤ m → f_n->list(m).tail = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)) ⊦
Used terms: f_n->list
| ∀ n. lf(n).last = lf(n + 1).head ∧ lf(n) ≠ [] ⊦ ∃ σ, ii. ii(0) = 0 ∧ (∀ n. ii(n + 1) = ii(n) + # lf(n) - 1 ∧ ⌜ii(n + 1)⌝ < # σ ∧ (σ from ii(n)) to # lf(n) = ⌜lf(n)⌝ ) ∧ (∀ m, n. m ≤ n → ii(m) ≤ ii(n)) ∧ (finp(σ) ⊃ ∃ n. # σ = ⌜ii(n) + 1⌝ ∧ (∀ m. n ≤ m → lf(m).tail = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)) |
| ∀ σ. pathp(g)(σ) → # σ ≠ ∞, ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ n. ls(g)(nf(n + 1), nf(n)) ⊦ ∀ n. f_n->list(n).last = f_n->list(n + 1).head ∧ f_n->list(n) ≠ [] |
∀ n. ls(g)(nf(n + 1), nf(n)), ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ σ. pathp(g)(σ) → # σ ≠ ∞ ⊦ f_n->list(n).last = f_n->list(n + 1).head ∧ f_n->list(n) ≠ []
| ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ σ. pathp(g)(σ) → # σ ≠ ∞ ⊦ f_n->list(n).last = f_n->list(n + 1).head ∧ f_n->list(n) ≠ [] |
f_n->list(n).head = nf(n), f_n->list(n).last = nf(n + 1), f_n->list(n) ≠ [], pathp(g)(⌜f_n->list(n)⌝ ), ∀ σ. pathp(g)(σ) → # σ ≠ ∞, ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ n. ls(g)(nf(n + 1), nf(n)) ⊦ f_n->list(n).last = f_n->list(n + 1).head ∧ f_n->list(n) ≠ []
Used terms: n
| f_n->list(n).head = nf(n), f_n->list(n).last = nf(n + 1), f_n->list(n) ≠ [], pathp(g)(⌜f_n->list(n)⌝ ), ∀ σ. pathp(g)(σ) → # σ ≠ ∞, ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ n. ls(g)(nf(n + 1), nf(n)) ⊦ f_n->list(n).last = f_n->list(n + 1).head ∧ f_n->list(n) ≠ [] |
f_n->list(n).head = nf(n), f_n->list(n).last = nf(n + 1), f_n->list(n) ≠ [], nf(n + 1) ≠ f_n->list(n + 1).head, pathp(g)(⌜f_n->list(n)⌝ ), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ σ. pathp(g)(σ) → # σ ≠ ∞ ⊦
| f_n->list(n).head = nf(n), f_n->list(n).last = nf(n + 1), f_n->list(n) ≠ [], nf(n + 1) ≠ f_n->list(n + 1).head, pathp(g)(⌜f_n->list(n)⌝ ), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ σ. pathp(g)(σ) → # σ ≠ ∞ ⊦ |
f_n->list(n).last = nf(n + 1), a = nf(n), f_n->list(n) = a + y, f_n->list(n) ≠ [], nf(n + 1) ≠ f_n->list(n + 1).head, pathp(g)(⌜f_n->list(n)⌝ ), ∀ σ. pathp(g)(σ) → # σ ≠ ∞, ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ n. ls(g)(nf(n + 1), nf(n)) ⊦
Used simplifier rules: x ≠ [] ⊦ a = x.head ∧ y = x.tail ↔ x = a + y; (elim) Used terms: f_n->list(n), a, y
| f_n->list(n).last = nf(n + 1), a = nf(n), f_n->list(n) = a + y, f_n->list(n) ≠ [], nf(n + 1) ≠ f_n->list(n + 1).head, pathp(g)(⌜f_n->list(n)⌝ ), ∀ σ. pathp(g)(σ) → # σ ≠ ∞, ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ n. ls(g)(nf(n + 1), nf(n)) ⊦ |
f_n->list(n).last = nf(n + 1), f_n->list(n) = nf(n) ' + y, f_n->list(n) ≠ [], nf(n + 1) ≠ f_n->list(n + 1).head, pathp(g)(⌜f_n->list(n)⌝ ), nf(n) ∈ f_n->list(n), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ σ. pathp(g)(σ) → # σ ≠ ∞ ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list ⊦ a + x = a ' + x; (s)
| f_n->list(n).last = nf(n + 1), f_n->list(n) = nf(n) ' + y, f_n->list(n) ≠ [], nf(n + 1) ≠ f_n->list(n + 1).head, pathp(g)(⌜f_n->list(n)⌝ ), nf(n) ∈ f_n->list(n), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ σ. pathp(g)(σ) → # σ ≠ ∞ ⊦ |
Used terms: n + 1
| ∀ σ. pathp(g)(σ) → # σ ≠ ∞, ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ n. ls(g)(nf(n + 1), nf(n)), ∃ σ, ii. ii(0) = 0 ∧ (∀ n. ii(n + 1) = ii(n) + # f_n->list(n) - 1 ∧ ⌜ii(n + 1)⌝ < # σ ∧ (σ from ii(n)) to # f_n->list(n) = ⌜f_n->list(n)⌝ ) ∧ (∀ m, n. m ≤ n → ii(m) ≤ ii(n)) ∧ (finp(σ) ⊃ ∃ n. # σ = ⌜ii(n) + 1⌝ ∧ (∀ m. n ≤ m → f_n->list(m).tail = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)) ⊦ |
ii(0) = 0, (finp(σ) ⊃ # σ = ⌜ii(n)⌝ + ⌜1⌝ ∧ (∀ m. n ≤ m → f_n->list(m).tail = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii(n + 1) = ii(n) + # f_n->list(n) - 1 ∧ ⌜ii(n + 1)⌝ < # σ ∧ (σ from ii(n)) to # f_n->list(n) = ⌜f_n->list(n)⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ σ. pathp(g)(σ) → # σ ≠ ∞ ⊦
Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s)
| ii(0) = 0, (finp(σ) ⊃ # σ = ⌜ii(n)⌝ + ⌜1⌝ ∧ (∀ m. n ≤ m → f_n->list(m).tail = [] ∧ ii(m) = ii(n));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii(n + 1) = ii(n) + # f_n->list(n) - 1 ∧ ⌜ii(n + 1)⌝ < # σ ∧ (σ from ii(n)) to # f_n->list(n) = ⌜f_n->list(n)⌝ , ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ σ. pathp(g)(σ) → # σ ≠ ∞ ⊦ |
# σ = ⌜ii(n)⌝ + ⌜1⌝ , ii(0) = 0, finp(σ), ∀ σ. pathp(g)(σ) → # σ ≠ ∞, ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # f_n->list(n) - 1 ∧ ⌜ii(n + 1)⌝ < # σ ∧ (σ from ii(n)) to # f_n->list(n) = ⌜f_n->list(n)⌝ , ∀ m. n ≤ m → f_n->list(m).tail = [] ∧ ii(m) = ii(n) ⊦
ii(0) = 0, ¬ finp(σ), ∀ σ. pathp(g)(σ) → # σ ≠ ∞, ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # f_n->list(n) - 1 ∧ ⌜ii(n + 1)⌝ < # σ ∧ (σ from ii(n)) to # f_n->list(n) = ⌜f_n->list(n)⌝ , ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1) ⊦
| # σ = ⌜ii(n)⌝ + ⌜1⌝ , ii(0) = 0, finp(σ), ∀ σ. pathp(g)(σ) → # σ ≠ ∞, ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # f_n->list(n) - 1 ∧ ⌜ii(n + 1)⌝ < # σ ∧ (σ from ii(n)) to # f_n->list(n) = ⌜f_n->list(n)⌝ , ∀ m. n ≤ m → f_n->list(m).tail = [] ∧ ii(m) = ii(n) ⊦ |
ii(n) + 1 = # x, ii(0) = 0, ∀ m. n ≤ m → f_n->list(m).tail = [] ∧ ii(m) = ii(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ σ. pathp(g)(σ) → # σ ≠ ∞, ∀ n0. ii(n0 + 1) = ii(n0) + # f_n->list(n0) - 1 ∧ ¬ ii(n) < ii(n0 + 1) ∧ (x from ii(n0)) to # f_n->list(n0) = f_n->list(n0) ⊦
Used simplifier rules: ⊦ ⌜x⌝ = ⌜x0⌝ ↔ x = x0; (s) ⊦ ⌜x⌝ to n = ⌜x to n⌝ ; (s) ⊦ ⌜x⌝ from n = ⌜x from n⌝ ; (s) ⊦ finp(⌜x⌝ ); (s) add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf ⊦ ⌜n⌝ + ⌜m⌝ = ⌜n0⌝ ↔ n + m = n0; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) stream-fin-forward: ⊦ finp(σ) → (∃ x. ⌜x⌝ = σ); (forward) from specification stream-basic c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ n∞ = ⌜m⌝ + ⌜n0⌝ → (⌜n⌝ < n∞ ↔ n < m + n0); (s)
| ii(n) + 1 = # x, ii(0) = 0, ∀ m. n ≤ m → f_n->list(m).tail = [] ∧ ii(m) = ii(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ σ. pathp(g)(σ) → # σ ≠ ∞, ∀ n0. ii(n0 + 1) = ii(n0) + # f_n->list(n0) - 1 ∧ ¬ ii(n) < ii(n0 + 1) ∧ (x from ii(n0)) to # f_n->list(n0) = f_n->list(n0) ⊦ |
ii(n) + 1 = # x, ii(0) = 0, n ≤ n → f_n->list(n).tail = [] ∧ ii(n) = ii(n), ∀ n0. ii(n0 + 1) = ii(n0) + # f_n->list(n0) - 1 ∧ ¬ ii(n) < ii(n0 + 1) ∧ (x from ii(n0)) to # f_n->list(n0) = f_n->list(n0), ∀ σ. pathp(g)(σ) → # σ ≠ ∞, ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m. n ≤ m → f_n->list(m).tail = [] ∧ ii(m) = ii(n) ⊦
Used terms: n
| ii(n) + 1 = # x, ii(0) = 0, n ≤ n → f_n->list(n).tail = [] ∧ ii(n) = ii(n), ∀ n0. ii(n0 + 1) = ii(n0) + # f_n->list(n0) - 1 ∧ ¬ ii(n) < ii(n0 + 1) ∧ (x from ii(n0)) to # f_n->list(n0) = f_n->list(n0), ∀ σ. pathp(g)(σ) → # σ ≠ ∞, ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m. n ≤ m → f_n->list(m).tail = [] ∧ ii(m) = ii(n) ⊦ |
ii(n) + 1 = # x, f_n->list(n).tail = [], ii(0) = 0, ∀ m. n ≤ m → f_n->list(m).tail = [] ∧ ii(m) = ii(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ σ. pathp(g)(σ) → # σ ≠ ∞, ∀ n0. ii(n0 + 1) = ii(n0) + # f_n->list(n0) - 1 ∧ ¬ ii(n) < ii(n0 + 1) ∧ (x from ii(n0)) to # f_n->list(n0) = f_n->list(n0) ⊦
Used simplifier rules: ⊦ m ≤ m; (s)
| ii(n) + 1 = # x, f_n->list(n).tail = [], ii(0) = 0, ∀ m. n ≤ m → f_n->list(m).tail = [] ∧ ii(m) = ii(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ σ. pathp(g)(σ) → # σ ≠ ∞, ∀ n0. ii(n0 + 1) = ii(n0) + # f_n->list(n0) - 1 ∧ ¬ ii(n) < ii(n0 + 1) ∧ (x from ii(n0)) to # f_n->list(n0) = f_n->list(n0) ⊦ |
ii(n) + 1 = # x, f_n->list(n).head = nf(n), f_n->list(n).last = nf(n + 1), f_n->list(n).tail = [], ii(0) = 0, f_n->list(n) ≠ [], pathp(g)(⌜f_n->list(n)⌝ ), ∀ n0. ii(n0 + 1) = ii(n0) + # f_n->list(n0) - 1 ∧ ¬ ii(n) < ii(n0 + 1) ∧ (x from ii(n0)) to # f_n->list(n0) = f_n->list(n0), ∀ σ. pathp(g)(σ) → # σ ≠ ∞, ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m. n ≤ m → f_n->list(m).tail = [] ∧ ii(m) = ii(n) ⊦
Used terms: n
| ii(n) + 1 = # x, f_n->list(n).head = nf(n), f_n->list(n).last = nf(n + 1), f_n->list(n).tail = [], ii(0) = 0, f_n->list(n) ≠ [], pathp(g)(⌜f_n->list(n)⌝ ), ∀ n0. ii(n0 + 1) = ii(n0) + # f_n->list(n0) - 1 ∧ ¬ ii(n) < ii(n0 + 1) ∧ (x from ii(n0)) to # f_n->list(n0) = f_n->list(n0), ∀ σ. pathp(g)(σ) → # σ ≠ ∞, ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m. n ≤ m → f_n->list(m).tail = [] ∧ ii(m) = ii(n) ⊦ |
ii(n) + 1 = # x, f_n->list(n).head = nf(n), f_n->list(n).tail = [], ii(0) = 0, nf(n + 1) = nf(n), f_n->list(n) ≠ [], pathp(g)(⌜f_n->list(n)⌝ ), ∀ m. n ≤ m → f_n->list(m).tail = [] ∧ ii(m) = ii(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ σ. pathp(g)(σ) → # σ ≠ ∞, ∀ n0. ii(n0 + 1) = ii(n0) + # f_n->list(n0) - 1 ∧ ¬ ii(n) < ii(n0 + 1) ∧ (x from ii(n0)) to # f_n->list(n0) = f_n->list(n0) ⊦
Used simplifier rules: ⊦ x ≠ [] ∧ x.tail = [] → x.last = x.head; (s)
| ii(n) + 1 = # x, f_n->list(n).head = nf(n), f_n->list(n).tail = [], ii(0) = 0, nf(n + 1) = nf(n), f_n->list(n) ≠ [], pathp(g)(⌜f_n->list(n)⌝ ), ∀ m. n ≤ m → f_n->list(m).tail = [] ∧ ii(m) = ii(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ σ. pathp(g)(σ) → # σ ≠ ∞, ∀ n0. ii(n0 + 1) = ii(n0) + # f_n->list(n0) - 1 ∧ ¬ ii(n) < ii(n0 + 1) ∧ (x from ii(n0)) to # f_n->list(n0) = f_n->list(n0) ⊦ |
ii(n) + 1 = # x, a = nf(n), f_n->list(n) = a + y, ii(0) = 0, nf(n + 1) = nf(n), y = [], f_n->list(n) ≠ [], pathp(g)(⌜f_n->list(n)⌝ ), ∀ n0. ii(n0 + 1) = ii(n0) + # f_n->list(n0) - 1 ∧ ¬ ii(n) < ii(n0 + 1) ∧ (x from ii(n0)) to # f_n->list(n0) = f_n->list(n0), ∀ σ. pathp(g)(σ) → # σ ≠ ∞, ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m. n ≤ m → f_n->list(m).tail = [] ∧ ii(m) = ii(n) ⊦
Used simplifier rules: x ≠ [] ⊦ a = x.head ∧ y = x.tail ↔ x = a + y; (elim) Used terms: f_n->list(n), a, y
| ii(n) + 1 = # x, a = nf(n), f_n->list(n) = a + y, ii(0) = 0, nf(n + 1) = nf(n), y = [], f_n->list(n) ≠ [], pathp(g)(⌜f_n->list(n)⌝ ), ∀ n0. ii(n0 + 1) = ii(n0) + # f_n->list(n0) - 1 ∧ ¬ ii(n) < ii(n0 + 1) ∧ (x from ii(n0)) to # f_n->list(n0) = f_n->list(n0), ∀ σ. pathp(g)(σ) → # σ ≠ ∞, ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m. n ≤ m → f_n->list(m).tail = [] ∧ ii(m) = ii(n) ⊦ |
ii(n) + 1 = # x, f_n->list(n) = nf(n) ', ii(0) = 0, nf(n + 1) = nf(n), f_n->list(n) ≠ [], pathp(g)(⌜f_n->list(n)⌝ ), ∀ m. n ≤ m → f_n->list(m).tail = [] ∧ ii(m) = ii(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ σ. pathp(g)(σ) → # σ ≠ ∞, ∀ n0. ii(n0 + 1) = ii(n0) + # f_n->list(n0) - 1 ∧ ¬ ii(n) < ii(n0 + 1) ∧ (x from ii(n0)) to # f_n->list(n0) = f_n->list(n0) ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list ⊦ x + [] = x; (s) ⊦ a + x = a ' + x; (s)
| ii(n) + 1 = # x, f_n->list(n) = nf(n) ', ii(0) = 0, nf(n + 1) = nf(n), f_n->list(n) ≠ [], pathp(g)(⌜f_n->list(n)⌝ ), ∀ m. n ≤ m → f_n->list(m).tail = [] ∧ ii(m) = ii(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ σ. pathp(g)(σ) → # σ ≠ ∞, ∀ n0. ii(n0 + 1) = ii(n0) + # f_n->list(n0) - 1 ∧ ¬ ii(n) < ii(n0 + 1) ∧ (x from ii(n0)) to # f_n->list(n0) = f_n->list(n0) ⊦ |
ii(n) + 1 = # x, f_n->list(n) = nf(n) ', ii(0) = 0, ii(n + 1) = ii(n) + # f_n->list(n) - 1, nf(n + 1) = nf(n), (x from ii(n)) to # f_n->list(n) = f_n->list(n), f_n->list(n) ≠ [], pathp(g)(⌜f_n->list(n)⌝ ), ¬ ii(n) < ii(n + 1), ∀ n0. ii(n0 + 1) = ii(n0) + # f_n->list(n0) - 1 ∧ ¬ ii(n) < ii(n0 + 1) ∧ (x from ii(n0)) to # f_n->list(n0) = f_n->list(n0), ∀ σ. pathp(g)(σ) → # σ ≠ ∞, ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m. n ≤ m → f_n->list(m).tail = [] ∧ ii(m) = ii(n) ⊦
Used terms: n
| ii(n) + 1 = # x, f_n->list(n) = nf(n) ', ii(0) = 0, ii(n + 1) = ii(n) + # f_n->list(n) - 1, nf(n + 1) = nf(n), (x from ii(n)) to # f_n->list(n) = f_n->list(n), f_n->list(n) ≠ [], pathp(g)(⌜f_n->list(n)⌝ ), ¬ ii(n) < ii(n + 1), ∀ n0. ii(n0 + 1) = ii(n0) + # f_n->list(n0) - 1 ∧ ¬ ii(n) < ii(n0 + 1) ∧ (x from ii(n0)) to # f_n->list(n0) = f_n->list(n0), ∀ σ. pathp(g)(σ) → # σ ≠ ∞, ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m. n ≤ m → f_n->list(m).tail = [] ∧ ii(m) = ii(n) ⊦ |
ii(n) + 1 = # x, f_n->list(n) = nf(n) ', ii(n + 1) = ii(n) + # f_n->list(n) - 1, ii(0) = 0, nf(n + 1) = nf(n), (x from ii(n)) to # f_n->list(n) = f_n->list(n), f_n->list(n) ≠ [], pathp(g)(⌜f_n->list(n)⌝ ), ii(n + 1) ≤ ii(n), ∀ m. n ≤ m → f_n->list(m).tail = [] ∧ ii(m) = ii(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ σ. pathp(g)(σ) → # σ ≠ ∞, ∀ n0. ii(n0 + 1) = ii(n0) + # f_n->list(n0) - 1 ∧ ¬ ii(n) < ii(n0 + 1) ∧ (x from ii(n0)) to # f_n->list(n0) = f_n->list(n0) ⊦
Used simplifier rules: ⊦ m < n ↔ ¬ n ≤ m; (ss)
| ii(n) + 1 = # x, f_n->list(n) = nf(n) ', ii(n + 1) = ii(n) + # f_n->list(n) - 1, ii(0) = 0, nf(n + 1) = nf(n), (x from ii(n)) to # f_n->list(n) = f_n->list(n), f_n->list(n) ≠ [], pathp(g)(⌜f_n->list(n)⌝ ), ii(n + 1) ≤ ii(n), ∀ m. n ≤ m → f_n->list(m).tail = [] ∧ ii(m) = ii(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ σ. pathp(g)(σ) → # σ ≠ ∞, ∀ n0. ii(n0 + 1) = ii(n0) + # f_n->list(n0) - 1 ∧ ¬ ii(n) < ii(n0 + 1) ∧ (x from ii(n0)) to # f_n->list(n0) = f_n->list(n0) ⊦ |
ii(n) + 1 = # x, ii(n) + # f_n->list(n) = n1 + 1, f_n->list(n) = nf(n) ', ii(0) = 0, ii(n + 1) = n1, nf(n + 1) = nf(n), (x from ii(n)) to # f_n->list(n) = f_n->list(n), ii(n) + # f_n->list(n) ≠ 0, f_n->list(n) ≠ [], pathp(g)(⌜f_n->list(n)⌝ ), ii(n + 1) ≤ ii(n), ∀ n0. ii(n0 + 1) = ii(n0) + # f_n->list(n0) - 1 ∧ ¬ ii(n) < ii(n0 + 1) ∧ (x from ii(n0)) to # f_n->list(n0) = f_n->list(n0), ∀ σ. pathp(g)(σ) → # σ ≠ ∞, ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m. n ≤ m → f_n->list(m).tail = [] ∧ ii(m) = ii(n) ⊦
Used simplifier rules: ⊦ m + n = 0 ↔ m = 0 ∧ n = 0; (ws) ⊦ # x = 0 ↔ x = []; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic n ≠ 0 ⊦ m = n - 1 ↔ n = m + 1; (elim) Used terms: ii(n) + # f_n->list(n), m0
| ii(n) + 1 = # x, ii(n) + # f_n->list(n) = n1 + 1, f_n->list(n) = nf(n) ', ii(0) = 0, ii(n + 1) = n1, nf(n + 1) = nf(n), (x from ii(n)) to # f_n->list(n) = f_n->list(n), ii(n) + # f_n->list(n) ≠ 0, f_n->list(n) ≠ [], pathp(g)(⌜f_n->list(n)⌝ ), ii(n + 1) ≤ ii(n), ∀ n0. ii(n0 + 1) = ii(n0) + # f_n->list(n0) - 1 ∧ ¬ ii(n) < ii(n0 + 1) ∧ (x from ii(n0)) to # f_n->list(n0) = f_n->list(n0), ∀ σ. pathp(g)(σ) → # σ ≠ ∞, ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m. n ≤ m → f_n->list(m).tail = [] ∧ ii(m) = ii(n) ⊦ |
ii(n) + 1 = # x, ii(n) + # f_n->list(n) = ii(n + 1) + 1, f_n->list(n) = nf(n) ', ii(0) = 0, nf(n + 1) = nf(n), (x from ii(n)) to # f_n->list(n) = f_n->list(n), f_n->list(n) ≠ [], pathp(g)(⌜f_n->list(n)⌝ ), ii(n + 1) ≤ ii(n), ∀ n0. ii(n0 + 1) = ii(n0) + # f_n->list(n0) - 1 ∧ ¬ ii(n) < ii(n0 + 1) ∧ (x from ii(n0)) to # f_n->list(n0) = f_n->list(n0), ∀ σ. pathp(g)(σ) → # σ ≠ ∞, ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m. n ≤ m → f_n->list(m).tail = [] ∧ ii(m) = ii(n) ⊦
Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m + 1 ≠ 0; (s)
| ii(n) + 1 = # x, ii(n) + # f_n->list(n) = ii(n + 1) + 1, f_n->list(n) = nf(n) ', ii(0) = 0, nf(n + 1) = nf(n), (x from ii(n)) to # f_n->list(n) = f_n->list(n), f_n->list(n) ≠ [], pathp(g)(⌜f_n->list(n)⌝ ), ii(n + 1) ≤ ii(n), ∀ n0. ii(n0 + 1) = ii(n0) + # f_n->list(n0) - 1 ∧ ¬ ii(n) < ii(n0 + 1) ∧ (x from ii(n0)) to # f_n->list(n0) = f_n->list(n0), ∀ σ. pathp(g)(σ) → # σ ≠ ∞, ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m. n ≤ m → f_n->list(m).tail = [] ∧ ii(m) = ii(n) ⊦ |
ii(n) + # nf(n) ' = ii(n + 1) + 1, ii(n) + 1 = # x, f_n->list(n) = nf(n) ', ii(0) = 0, nf(n + 1) = nf(n), (x from ii(n)) to # nf(n) ' = nf(n) ', nf(n) ' ≠ [], pathp(g)(⌜nf(n) '⌝ ), ii(n + 1) ≤ ii(n), ∀ m. n ≤ m → f_n->list(m).tail = [] ∧ ii(m) = ii(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ σ. pathp(g)(σ) → # σ ≠ ∞, ∀ n0. ii(n0 + 1) = ii(n0) + # f_n->list(n0) - 1 ∧ ¬ ii(n) < ii(n0 + 1) ∧ (x from ii(n0)) to # f_n->list(n0) = f_n->list(n0) ⊦
| ii(n) + # nf(n) ' = ii(n + 1) + 1, ii(n) + 1 = # x, f_n->list(n) = nf(n) ', ii(0) = 0, nf(n + 1) = nf(n), (x from ii(n)) to # nf(n) ' = nf(n) ', nf(n) ' ≠ [], pathp(g)(⌜nf(n) '⌝ ), ii(n + 1) ≤ ii(n), ∀ m. n ≤ m → f_n->list(m).tail = [] ∧ ii(m) = ii(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ σ. pathp(g)(σ) → # σ ≠ ∞, ∀ n0. ii(n0 + 1) = ii(n0) + # f_n->list(n0) - 1 ∧ ¬ ii(n) < ii(n0 + 1) ∧ (x from ii(n0)) to # f_n->list(n0) = f_n->list(n0) ⊦ |
⊦ # a ' = 0 +1
ii(n) + 1 = # x, ii(n) + 0 +1 = ii(n + 1) + 1, f_n->list(n) = nf(n) ', ii(0) = 0, nf(n + 1) = nf(n), (x from ii(n)) to 0 +1 = nf(n) ', nf(n) ' ≠ [], pathp(g)(⌜nf(n) '⌝ ), ii(n + 1) ≤ ii(n), ∀ n0. ii(n0 + 1) = ii(n0) + # f_n->list(n0) - 1 ∧ ¬ ii(n) < ii(n0 + 1) ∧ (x from ii(n0)) to # f_n->list(n0) = f_n->list(n0), ∀ σ. pathp(g)(σ) → # σ ≠ ∞, ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m. n ≤ m → f_n->list(m).tail = [] ∧ ii(m) = ii(n) ⊦
Used terms: nf(n)
| ii(n) + 1 = # x, ii(n) + 0 +1 = ii(n + 1) + 1, f_n->list(n) = nf(n) ', ii(0) = 0, nf(n + 1) = nf(n), (x from ii(n)) to 0 +1 = nf(n) ', nf(n) ' ≠ [], pathp(g)(⌜nf(n) '⌝ ), ii(n + 1) ≤ ii(n), ∀ n0. ii(n0 + 1) = ii(n0) + # f_n->list(n0) - 1 ∧ ¬ ii(n) < ii(n0 + 1) ∧ (x from ii(n0)) to # f_n->list(n0) = f_n->list(n0), ∀ σ. pathp(g)(σ) → # σ ≠ ∞, ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m. n ≤ m → f_n->list(m).tail = [] ∧ ii(m) = ii(n) ⊦ |
ii(n) + 1 = # x, f_n->list(n) = nf(n) ', ii(n) = ii(n + 1), ii(0) = 0, nf(n + 1) = nf(n), (x from ii(n)) to 1 = f_n->list(n), pathp(g)(⌜f_n->list(n)⌝ ), ∀ n0. ii(n0 + 1) = ii(n0) + # f_n->list(n0) - 1 ∧ ¬ ii(n) < ii(n0 + 1) ∧ (x from ii(n0)) to # f_n->list(n0) = f_n->list(n0), ∀ σ. pathp(g)(σ) → # σ ≠ ∞, ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m. n ≤ m → f_n->list(m).tail = [] ∧ ii(m) = ii(n) ⊦
Used simplifier rules: ⊦ m ≤ m; (s) ⊦ a ' ≠ []; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m + n = m + n0 ↔ n = n0; (s)
| ii(n) + 1 = # x, f_n->list(n) = nf(n) ', ii(n) = ii(n + 1), ii(0) = 0, nf(n + 1) = nf(n), (x from ii(n)) to 1 = f_n->list(n), pathp(g)(⌜f_n->list(n)⌝ ), ∀ n0. ii(n0 + 1) = ii(n0) + # f_n->list(n0) - 1 ∧ ¬ ii(n) < ii(n0 + 1) ∧ (x from ii(n0)) to # f_n->list(n0) = f_n->list(n0), ∀ σ. pathp(g)(σ) → # σ ≠ ∞, ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m. n ≤ m → f_n->list(m).tail = [] ∧ ii(m) = ii(n) ⊦ |
ii(n) + 1 = # x, f_n->list(n) = nf(n) ', ii(0) = 0, ii(n) = ii(n + 1), nf(n + 1) = nf(n), (x from ii(n)) to 1 = f_n->list(n), ls(g)(nf(n + 1), nf(n)), pathp(g)(⌜f_n->list(n)⌝ ), ∀ m. n ≤ m → f_n->list(m).tail = [] ∧ ii(m) = ii(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ σ. pathp(g)(σ) → # σ ≠ ∞, ∀ n0. ii(n0 + 1) = ii(n0) + # f_n->list(n0) - 1 ∧ ¬ ii(n) < ii(n0 + 1) ∧ (x from ii(n0)) to # f_n->list(n0) = f_n->list(n0) ⊦
Used terms: n
| ii(n) + 1 = # x, f_n->list(n) = nf(n) ', ii(0) = 0, ii(n) = ii(n + 1), nf(n + 1) = nf(n), (x from ii(n)) to 1 = f_n->list(n), ls(g)(nf(n + 1), nf(n)), pathp(g)(⌜f_n->list(n)⌝ ), ∀ m. n ≤ m → f_n->list(m).tail = [] ∧ ii(m) = ii(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ σ. pathp(g)(σ) → # σ ≠ ∞, ∀ n0. ii(n0 + 1) = ii(n0) + # f_n->list(n0) - 1 ∧ ¬ ii(n) < ii(n0 + 1) ∧ (x from ii(n0)) to # f_n->list(n0) = f_n->list(n0) ⊦ |
ii(n) + 1 = # x, f_n->list(n) = nf(n) ', ii(n) = ii(n + 1), ii(0) = 0, nf(n + 1) = nf(n), (x from ii(n)) to 1 = f_n->list(n), ls(g)(nf(n), nf(n)), pathp(g)(⌜f_n->list(n)⌝ ), ∀ n0. ii(n0 + 1) = ii(n0) + # f_n->list(n0) - 1 ∧ ¬ ii(n) < ii(n0 + 1) ∧ (x from ii(n0)) to # f_n->list(n0) = f_n->list(n0), ∀ σ. pathp(g)(σ) → # σ ≠ ∞, ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m. n ≤ m → f_n->list(m).tail = [] ∧ ii(m) = ii(n) ⊦
| ii(n) + 1 = # x, f_n->list(n) = nf(n) ', ii(n) = ii(n + 1), ii(0) = 0, nf(n + 1) = nf(n), (x from ii(n)) to 1 = f_n->list(n), ls(g)(nf(n), nf(n)), pathp(g)(⌜f_n->list(n)⌝ ), ∀ n0. ii(n0 + 1) = ii(n0) + # f_n->list(n0) - 1 ∧ ¬ ii(n) < ii(n0 + 1) ∧ (x from ii(n0)) to # f_n->list(n0) = f_n->list(n0), ∀ σ. pathp(g)(σ) → # σ ≠ ∞, ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m. n ≤ m → f_n->list(m).tail = [] ∧ ii(m) = ii(n) ⊦ |
nocycle(g) ⊦ ¬ ls(g)(a, a)
ii(n) + 1 = # x, f_n->list(n) = nf(n) ', ii(0) = 0, ii(n) = ii(n + 1), nf(n + 1) = nf(n), (x from ii(n)) to 1 = f_n->list(n), ls(g)(nf(n), nf(n)), pathp(g)(⌜f_n->list(n)⌝ ), ¬ nocycle(g), ∀ m. n ≤ m → f_n->list(m).tail = [] ∧ ii(m) = ii(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ σ. pathp(g)(σ) → # σ ≠ ∞, ∀ n0. ii(n0 + 1) = ii(n0) + # f_n->list(n0) - 1 ∧ ¬ ii(n) < ii(n0 + 1) ∧ (x from ii(n0)) to # f_n->list(n0) = f_n->list(n0) ⊦
Used terms: nf(n), g
| nocycle(g) ⊦ ¬ ls(g)(a, a) |
| ii(n) + 1 = # x, f_n->list(n) = nf(n) ', ii(0) = 0, ii(n) = ii(n + 1), nf(n + 1) = nf(n), (x from ii(n)) to 1 = f_n->list(n), ls(g)(nf(n), nf(n)), pathp(g)(⌜f_n->list(n)⌝ ), ¬ nocycle(g), ∀ m. n ≤ m → f_n->list(m).tail = [] ∧ ii(m) = ii(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ σ. pathp(g)(σ) → # σ ≠ ∞, ∀ n0. ii(n0 + 1) = ii(n0) + # f_n->list(n0) - 1 ∧ ¬ ii(n) < ii(n0 + 1) ∧ (x from ii(n0)) to # f_n->list(n0) = f_n->list(n0) ⊦ |
findepth(g) ⊦ nocycle(g)
ii(n) + 1 = # x, f_n->list(n) = nf(n) ', ii(n) = ii(n + 1), ii(0) = 0, nf(n + 1) = nf(n), (x from ii(n)) to 1 = f_n->list(n), ls(g)(nf(n), nf(n)), pathp(g)(⌜f_n->list(n)⌝ ), ¬ findepth(g), ¬ nocycle(g), ∀ n0. ii(n0 + 1) = ii(n0) + # f_n->list(n0) - 1 ∧ ¬ ii(n) < ii(n0 + 1) ∧ (x from ii(n0)) to # f_n->list(n0) = f_n->list(n0), ∀ σ. pathp(g)(σ) → # σ ≠ ∞, ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m. n ≤ m → f_n->list(m).tail = [] ∧ ii(m) = ii(n) ⊦
Used terms: g
| findepth(g) ⊦ nocycle(g) |
| ii(n) + 1 = # x, f_n->list(n) = nf(n) ', ii(n) = ii(n + 1), ii(0) = 0, nf(n + 1) = nf(n), (x from ii(n)) to 1 = f_n->list(n), ls(g)(nf(n), nf(n)), pathp(g)(⌜f_n->list(n)⌝ ), ¬ findepth(g), ¬ nocycle(g), ∀ n0. ii(n0 + 1) = ii(n0) + # f_n->list(n0) - 1 ∧ ¬ ii(n) < ii(n0 + 1) ∧ (x from ii(n0)) to # f_n->list(n0) = f_n->list(n0), ∀ σ. pathp(g)(σ) → # σ ≠ ∞, ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m. n ≤ m → f_n->list(m).tail = [] ∧ ii(m) = ii(n) ⊦ |
⊦ findepth(g) ↔ (∀ σ. pathp(g)(σ) → # σ ≠ ∞)
ii(n) + 1 = # x, f_n->list(n) = nf(n) ', ii(0) = 0, ii(n) = ii(n + 1), nf(n + 1) = nf(n), (x from ii(n)) to 1 = f_n->list(n), ls(g)(nf(n), nf(n)), pathp(g)(⌜f_n->list(n)⌝ ), ¬ nocycle(g), ∀ m. n ≤ m → f_n->list(m).tail = [] ∧ ii(m) = ii(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ σ. pathp(g)(σ) → # σ ≠ ∞, ∀ n0. ii(n0 + 1) = ii(n0) + # f_n->list(n0) - 1 ∧ ¬ ii(n) < ii(n0 + 1) ∧ (x from ii(n0)) to # f_n->list(n0) = f_n->list(n0), ∃ σ. ¬(pathp(g)(σ) → # σ ≠ ∞) ⊦
Used terms: g
| ⊦ findepth(g) ↔ (∀ σ. pathp(g)(σ) → # σ ≠ ∞) |
| ii(n) + 1 = # x, f_n->list(n) = nf(n) ', ii(0) = 0, ii(n) = ii(n + 1), nf(n + 1) = nf(n), (x from ii(n)) to 1 = f_n->list(n), ls(g)(nf(n), nf(n)), pathp(g)(⌜f_n->list(n)⌝ ), ¬ nocycle(g), ∀ m. n ≤ m → f_n->list(m).tail = [] ∧ ii(m) = ii(n), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ σ. pathp(g)(σ) → # σ ≠ ∞, ∀ n0. ii(n0 + 1) = ii(n0) + # f_n->list(n0) - 1 ∧ ¬ ii(n) < ii(n0 + 1) ∧ (x from ii(n0)) to # f_n->list(n0) = f_n->list(n0), ∃ σ. ¬(pathp(g)(σ) → # σ ≠ ∞) ⊦ |
# σ = ∞, ii(n) + 1 = # x, f_n->list(n) = nf(n) ', ii(n) = ii(n + 1), ii(0) = 0, nf(n + 1) = nf(n), (x from ii(n)) to 1 = f_n->list(n), ls(g)(nf(n), nf(n)), pathp(g)(σ), pathp(g)(⌜f_n->list(n)⌝ ), ¬ nocycle(g), ∀ n0. ii(n0 + 1) = ii(n0) + # f_n->list(n0) - 1 ∧ ¬ ii(n) < ii(n0 + 1) ∧ (x from ii(n0)) to # f_n->list(n0) = f_n->list(n0), ∀ σ. pathp(g)(σ) → # σ ≠ ∞, ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m. n ≤ m → f_n->list(m).tail = [] ∧ ii(m) = ii(n) ⊦
| # σ = ∞, ii(n) + 1 = # x, f_n->list(n) = nf(n) ', ii(n) = ii(n + 1), ii(0) = 0, nf(n + 1) = nf(n), (x from ii(n)) to 1 = f_n->list(n), ls(g)(nf(n), nf(n)), pathp(g)(σ), pathp(g)(⌜f_n->list(n)⌝ ), ¬ nocycle(g), ∀ n0. ii(n0 + 1) = ii(n0) + # f_n->list(n0) - 1 ∧ ¬ ii(n) < ii(n0 + 1) ∧ (x from ii(n0)) to # f_n->list(n0) = f_n->list(n0), ∀ σ. pathp(g)(σ) → # σ ≠ ∞, ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ m. n ≤ m → f_n->list(m).tail = [] ∧ ii(m) = ii(n) ⊦ |
Used terms: σ
| ii(0) = 0, ¬ finp(σ), ∀ σ. pathp(g)(σ) → # σ ≠ ∞, ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ii(n + 1) = ii(n) + # f_n->list(n) - 1 ∧ ⌜ii(n + 1)⌝ < # σ ∧ (σ from ii(n)) to # f_n->list(n) = ⌜f_n->list(n)⌝ , ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1) ⊦ |
ii(0) = 0, ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ σ. pathp(g)(σ) → # σ ≠ ∞, ∀ n. ii(n + 1) = ii(n) + # f_n->list(n) - 1 ∧ (nf0 from ii(n)) to # f_n->list(n) = f_n->list(n) ⊦
Used simplifier rules: ⊦ ⌜x⌝ = ⌜x0⌝ ↔ x = x0; (s) ⊦ ⌜nf⌝ to n = ⌜nf to n⌝ ; (s) ⊦ ⌜nf⌝ from n = ⌜nf from n⌝ ; (s) ⊦ ¬ finp(⌜nf⌝ ); (s) stream-inf-forward: ⊦ ¬ finp(σ) → (∃ nf. ⌜nf⌝ = σ); (forward) from specification stream-basic ⊦ ⌜m⌝ < ∞; (s) ⊦ ¬ finp(σ) → # σ = ∞; (s)
| ii(0) = 0, ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ σ. pathp(g)(σ) → # σ ≠ ∞, ∀ n. ii(n + 1) = ii(n) + # f_n->list(n) - 1 ∧ (nf0 from ii(n)) to # f_n->list(n) = f_n->list(n) ⊦ |
ii(0) = 0, pathp(g)(⌜nf0⌝ ) → # ⌜nf0⌝ ≠ ∞, ∀ n. ii(n + 1) = ii(n) + # f_n->list(n) - 1 ∧ (nf0 from ii(n)) to # f_n->list(n) = f_n->list(n), ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1) ⊦
Used terms: ⌜nf0⌝
| ii(0) = 0, pathp(g)(⌜nf0⌝ ) → # ⌜nf0⌝ ≠ ∞, ∀ n. ii(n + 1) = ii(n) + # f_n->list(n) - 1 ∧ (nf0 from ii(n)) to # f_n->list(n) = f_n->list(n), ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1) ⊦ |
ii(0) = 0, ¬ pathp(g)(⌜nf0⌝ ), ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ n. ii(n + 1) = ii(n) + # f_n->list(n) - 1 ∧ (nf0 from ii(n)) to # f_n->list(n) = f_n->list(n) ⊦
Used simplifier rules: ⊦ # ⌜nf⌝ = ∞; (s)
| ii(0) = 0, ¬ pathp(g)(⌜nf0⌝ ), ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ n. ii(n + 1) = ii(n) + # f_n->list(n) - 1 ∧ (nf0 from ii(n)) to # f_n->list(n) = f_n->list(n) ⊦ |
⊦ pathp(g)(σ) ↔ (∀ n. ⌜n⌝ < # σ → dom(g)(σ[n])) ∧ (∀ n. ⌜n + 1⌝ < # σ → edge(g)(σ[n], σ[n + 1]))
ii(0) = 0, ∀ n. ii(n + 1) = ii(n) + # f_n->list(n) - 1 ∧ (nf0 from ii(n)) to # f_n->list(n) = f_n->list(n), ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), (∃ n. ¬(⌜n⌝ < # ⌜nf0⌝ → dom(g)(⌜nf0⌝ [n]))) ∨ (∃ n. ¬(⌜n + 1⌝ < # ⌜nf0⌝ → edge(g)(⌜nf0⌝ [n], ⌜nf0⌝ [n + 1]))) ⊦
Used terms: ⌜nf0⌝ , g
| ⊦ pathp(g)(σ) ↔ (∀ n. ⌜n⌝ < # σ → dom(g)(σ[n])) ∧ (∀ n. ⌜n + 1⌝ < # σ → edge(g)(σ[n], σ[n + 1])) |
| ii(0) = 0, ∀ n. ii(n + 1) = ii(n) + # f_n->list(n) - 1 ∧ (nf0 from ii(n)) to # f_n->list(n) = f_n->list(n), ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), (∃ n. ¬(⌜n⌝ < # ⌜nf0⌝ → dom(g)(⌜nf0⌝ [n]))) ∨ (∃ n. ¬(⌜n + 1⌝ < # ⌜nf0⌝ → edge(g)(⌜nf0⌝ [n], ⌜nf0⌝ [n + 1]))) ⊦ |
ii(0) = 0, ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ n. ii(n + 1) = ii(n) + # f_n->list(n) - 1 ∧ (nf0 from ii(n)) to # f_n->list(n) = f_n->list(n), ¬ dom(g)(nf0(n)) ∨ ¬ edge(g)(nf0(n0), nf0(n0 + 1)) ⊦
Used simplifier rules: ⊦ ⌜nf⌝ [n] = nf(n); (s) add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf ⊦ ⌜n⌝ ≠ ∞; (s) ⊦ ⌜m⌝ + n∞ = ∞ ↔ n∞ = ∞; (s) ⊦ n∞ < ∞ ↔ n∞ ≠ ∞; (s) ⊦ # ⌜nf⌝ = ∞; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s) ⊦ ⌜m⌝ < ∞; (s)
| ii(0) = 0, ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ n. ii(n + 1) = ii(n) + # f_n->list(n) - 1 ∧ (nf0 from ii(n)) to # f_n->list(n) = f_n->list(n), ¬ dom(g)(nf0(n)) ∨ ¬ edge(g)(nf0(n0), nf0(n0 + 1)) ⊦ |
ii(0) = 0, ¬ dom(g)(nf0(n)), ∀ n. ii(n + 1) = ii(n) + # f_n->list(n) - 1 ∧ (nf0 from ii(n)) to # f_n->list(n) = f_n->list(n), ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1) ⊦
ii(0) = 0, ¬ edge(g)(nf0(n0), nf0(n0 + 1)), ∀ n. ii(n + 1) = ii(n) + # f_n->list(n) - 1 ∧ (nf0 from ii(n)) to # f_n->list(n) = f_n->list(n), ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1) ⊦
| ii(0) = 0, ¬ dom(g)(nf0(n)), ∀ n. ii(n + 1) = ii(n) + # f_n->list(n) - 1 ∧ (nf0 from ii(n)) to # f_n->list(n) = f_n->list(n), ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1) ⊦ |
ii(0) = 0, ¬ dom(g)(nf0(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ n. ii(n + 1) = ii(n) + # f_n->list(n) - 1 ∧ (nf0 from ii(n)) to # f_n->list(n) = f_n->list(n), ∃ m. ii(m) ≤ n ∧ n < ii(m + 1) ⊦
Used terms: n
| ii(0) = 0, ¬ dom(g)(nf0(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ n. ii(n + 1) = ii(n) + # f_n->list(n) - 1 ∧ (nf0 from ii(n)) to # f_n->list(n) = f_n->list(n), ∃ m. ii(m) ≤ n ∧ n < ii(m + 1) ⊦ |
ii(0) = 0, ii(n0) < ii(n0 + 1), n < ii(n0 + 1), ii(n0) ≤ n, ¬ dom(g)(nf0(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ n. ii(n + 1) = ii(n) + # f_n->list(n) - 1 ∧ (nf0 from ii(n)) to # f_n->list(n) = f_n->list(n) ⊦
Used simplifier rules: ⊦ m < n → n ≠ 0; (s) fle-01: ⊦ m ≤ n ∧ n < n0 → m < n0; (forward) from specification nat f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic
| ii(0) = 0, ii(n0) < ii(n0 + 1), n < ii(n0 + 1), ii(n0) ≤ n, ¬ dom(g)(nf0(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ n. ii(n + 1) = ii(n) + # f_n->list(n) - 1 ∧ (nf0 from ii(n)) to # f_n->list(n) = f_n->list(n) ⊦ |
ii(0) = 0, ii(n0 + 1) = ii(n0) + # f_n->list(n0) - 1, (nf0 from ii(n0)) to # f_n->list(n0) = f_n->list(n0), n < ii(n0 + 1), ii(n0) < ii(n0 + 1), ii(n0) ≤ n, ¬ dom(g)(nf0(n)), ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n) ⊦
Used terms: n0
| ii(0) = 0, ii(n0 + 1) = ii(n0) + # f_n->list(n0) - 1, (nf0 from ii(n0)) to # f_n->list(n0) = f_n->list(n0), n < ii(n0 + 1), ii(n0) < ii(n0 + 1), ii(n0) ≤ n, ¬ dom(g)(nf0(n)), ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n) ⊦ |
ii(0) = 0, ii(n0 + 1) = ii(n0) + # f_n->list(n0) - 1, (nf0 from ii(n0)) to # f_n->list(n0) = f_n->list(n0), n < ii(n0 + 1), ii(n0) < ii(n0 + 1), ii(n0) ≤ n, ¬ dom(g)(nf0(n)), ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n) ⊦
Used simplifier rules: lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic
| ii(0) = 0, ii(n0 + 1) = ii(n0) + # f_n->list(n0) - 1, (nf0 from ii(n0)) to # f_n->list(n0) = f_n->list(n0), n < ii(n0 + 1), ii(n0) < ii(n0 + 1), ii(n0) ≤ n, ¬ dom(g)(nf0(n)), ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n) ⊦ |
f_n->list(n0).head = nf(n0), f_n->list(n0).last = nf(n0 + 1), ii(n0 + 1) = ii(n0) + # f_n->list(n0) - 1, ii(0) = 0, (nf0 from ii(n0)) to # f_n->list(n0) = f_n->list(n0), f_n->list(n0) ≠ [], ii(n0) < ii(n0 + 1), n < ii(n0 + 1), pathp(g)(⌜f_n->list(n0)⌝ ), ii(n0) ≤ n, ¬ dom(g)(nf0(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ls(g)(nf(n + 1), nf(n)) ⊦
Used terms: n0
| f_n->list(n0).head = nf(n0), f_n->list(n0).last = nf(n0 + 1), ii(n0 + 1) = ii(n0) + # f_n->list(n0) - 1, ii(0) = 0, (nf0 from ii(n0)) to # f_n->list(n0) = f_n->list(n0), f_n->list(n0) ≠ [], ii(n0) < ii(n0 + 1), n < ii(n0 + 1), pathp(g)(⌜f_n->list(n0)⌝ ), ii(n0) ≤ n, ¬ dom(g)(nf0(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ls(g)(nf(n + 1), nf(n)) ⊦ |
f_n->list(n0).head = nf(n0), f_n->list(n0).last = nf(n0 + 1), ii(0) = 0, ii(n0 + 1) = ii(n0) + # f_n->list(n0) - 1, (nf0 from ii(n0)) to # f_n->list(n0) = f_n->list(n0), f_n->list(n0) ≠ [], n < ii(n0 + 1), ii(n0) < ii(n0 + 1), pathp(g)(⌜f_n->list(n0)⌝ ), ii(n0) ≤ n, ¬ dom(g)(nf0(n)), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n) ⊦
| f_n->list(n0).head = nf(n0), f_n->list(n0).last = nf(n0 + 1), ii(0) = 0, ii(n0 + 1) = ii(n0) + # f_n->list(n0) - 1, (nf0 from ii(n0)) to # f_n->list(n0) = f_n->list(n0), f_n->list(n0) ≠ [], n < ii(n0 + 1), ii(n0) < ii(n0 + 1), pathp(g)(⌜f_n->list(n0)⌝ ), ii(n0) ≤ n, ¬ dom(g)(nf0(n)), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n) ⊦ |
ii(n0) + # f_n->list(n0) = n1 + 1, f_n->list(n0).head = nf(n0), f_n->list(n0).last = nf(n0 + 1), ii(n0 + 1) = n1, ii(0) = 0, (nf0 from ii(n0)) to # f_n->list(n0) = f_n->list(n0), ii(n0) + # f_n->list(n0) ≠ 0, f_n->list(n0) ≠ [], ii(n0) < ii(n0 + 1), n < ii(n0 + 1), pathp(g)(⌜f_n->list(n0)⌝ ), ii(n0) ≤ n, ¬ dom(g)(nf0(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ls(g)(nf(n + 1), nf(n)) ⊦
Used simplifier rules: ⊦ m + n = 0 ↔ m = 0 ∧ n = 0; (ws) ⊦ # x = 0 ↔ x = []; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic n ≠ 0 ⊦ m = n - 1 ↔ n = m + 1; (elim) Used terms: ii(n0) + # f_n->list(n0), m0
| ii(n0) + # f_n->list(n0) = n1 + 1, f_n->list(n0).head = nf(n0), f_n->list(n0).last = nf(n0 + 1), ii(n0 + 1) = n1, ii(0) = 0, (nf0 from ii(n0)) to # f_n->list(n0) = f_n->list(n0), ii(n0) + # f_n->list(n0) ≠ 0, f_n->list(n0) ≠ [], ii(n0) < ii(n0 + 1), n < ii(n0 + 1), pathp(g)(⌜f_n->list(n0)⌝ ), ii(n0) ≤ n, ¬ dom(g)(nf0(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ls(g)(nf(n + 1), nf(n)) ⊦ |
ii(n0) + # f_n->list(n0) = ii(n0 + 1) + 1, f_n->list(n0).head = nf(n0), f_n->list(n0).last = nf(n0 + 1), ii(0) = 0, (nf0 from ii(n0)) to # f_n->list(n0) = f_n->list(n0), f_n->list(n0) ≠ [], ii(n0) < ii(n0 + 1), n < ii(n0 + 1), pathp(g)(⌜f_n->list(n0)⌝ ), ii(n0) ≤ n, ¬ dom(g)(nf0(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ls(g)(nf(n + 1), nf(n)) ⊦
Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m + 1 ≠ 0; (s)
| ii(n0) + # f_n->list(n0) = ii(n0 + 1) + 1, f_n->list(n0).head = nf(n0), f_n->list(n0).last = nf(n0 + 1), ii(0) = 0, (nf0 from ii(n0)) to # f_n->list(n0) = f_n->list(n0), f_n->list(n0) ≠ [], ii(n0) < ii(n0 + 1), n < ii(n0 + 1), pathp(g)(⌜f_n->list(n0)⌝ ), ii(n0) ≤ n, ¬ dom(g)(nf0(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ls(g)(nf(n + 1), nf(n)) ⊦ |
ii(n0) + # f_n->list(n0) = ii(n0 + 1) + 1, f_n->list(n0).last = nf(n0 + 1), a = nf(n0), f_n->list(n0) = a + y, ii(0) = 0, (nf0 from ii(n0)) to # f_n->list(n0) = f_n->list(n0), f_n->list(n0) ≠ [], n < ii(n0 + 1), ii(n0) < ii(n0 + 1), pathp(g)(⌜f_n->list(n0)⌝ ), ii(n0) ≤ n, ¬ dom(g)(nf0(n)), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n) ⊦
Used simplifier rules: x ≠ [] ⊦ a = x.head ∧ y = x.tail ↔ x = a + y; (elim) Used terms: f_n->list(n0), a, y
| ii(n0) + # f_n->list(n0) = ii(n0 + 1) + 1, f_n->list(n0).last = nf(n0 + 1), a = nf(n0), f_n->list(n0) = a + y, ii(0) = 0, (nf0 from ii(n0)) to # f_n->list(n0) = f_n->list(n0), f_n->list(n0) ≠ [], n < ii(n0 + 1), ii(n0) < ii(n0 + 1), pathp(g)(⌜f_n->list(n0)⌝ ), ii(n0) ≤ n, ¬ dom(g)(nf0(n)), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n) ⊦ |
ii(n0) + # f_n->list(n0) = ii(n0 + 1) + 1, f_n->list(n0).last = nf(n0 + 1), f_n->list(n0) = nf(n0) ' + y, ii(0) = 0, (nf0 from ii(n0)) to # f_n->list(n0) = f_n->list(n0), f_n->list(n0) ≠ [], ii(n0) < ii(n0 + 1), n < ii(n0 + 1), pathp(g)(⌜f_n->list(n0)⌝ ), nf(n0) ∈ f_n->list(n0), ii(n0) ≤ n, ¬ dom(g)(nf0(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ls(g)(nf(n + 1), nf(n)) ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list ⊦ a + x = a ' + x; (s)
| ii(n0) + # f_n->list(n0) = ii(n0 + 1) + 1, f_n->list(n0).last = nf(n0 + 1), f_n->list(n0) = nf(n0) ' + y, ii(0) = 0, (nf0 from ii(n0)) to # f_n->list(n0) = f_n->list(n0), f_n->list(n0) ≠ [], ii(n0) < ii(n0 + 1), n < ii(n0 + 1), pathp(g)(⌜f_n->list(n0)⌝ ), nf(n0) ∈ f_n->list(n0), ii(n0) ≤ n, ¬ dom(g)(nf0(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ls(g)(nf(n + 1), nf(n)) ⊦ |
⊦ x = y ↔ # x = # y ∧ (∀ n. n < # x → x[n] = y[n])
#((nf0 from ii(n0)) to # f_n->list(n0)) = # f_n->list(n0), ii(n0) + # f_n->list(n0) = ii(n0 + 1) + 1, f_n->list(n0).last = nf(n0 + 1), f_n->list(n0) = nf(n0) ' + y, ii(0) = 0, f_n->list(n0) ≠ [], n < ii(n0 + 1), ii(n0) < ii(n0 + 1), pathp(g)(⌜f_n->list(n0)⌝ ), nf(n0) ∈ f_n->list(n0), ii(n0) ≤ n, ¬ dom(g)(nf0(n)), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. n < #((nf0 from ii(n0)) to # f_n->list(n0)) → ((nf0 from ii(n0)) to # f_n->list(n0))[n] = f_n->list(n0)[n] ⊦
Used terms: f_n->list(n0), (nf0 from ii(n0)) to # f_n->list(n0)
| ⊦ x = y ↔ # x = # y ∧ (∀ n. n < # x → x[n] = y[n]) |
| #((nf0 from ii(n0)) to # f_n->list(n0)) = # f_n->list(n0), ii(n0) + # f_n->list(n0) = ii(n0 + 1) + 1, f_n->list(n0).last = nf(n0 + 1), f_n->list(n0) = nf(n0) ' + y, ii(0) = 0, f_n->list(n0) ≠ [], n < ii(n0 + 1), ii(n0) < ii(n0 + 1), pathp(g)(⌜f_n->list(n0)⌝ ), nf(n0) ∈ f_n->list(n0), ii(n0) ≤ n, ¬ dom(g)(nf0(n)), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. n < #((nf0 from ii(n0)) to # f_n->list(n0)) → ((nf0 from ii(n0)) to # f_n->list(n0))[n] = f_n->list(n0)[n] ⊦ |
ii(n0) + # f_n->list(n0) = ii(n0 + 1) + 1, f_n->list(n0).last = nf(n0 + 1), f_n->list(n0) = nf(n0) ' + y, ii(0) = 0, f_n->list(n0) ≠ [], ii(n0) < ii(n0 + 1), n < ii(n0 + 1), pathp(g)(⌜f_n->list(n0)⌝ ), nf(n0) ∈ f_n->list(n0), ii(n0) ≤ n, ¬ dom(g)(nf0(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ n1. n1 < # f_n->list(n0) → nf0(n1 + ii(n0)) = f_n->list(n0)[n1] ⊦
Used simplifier rules: ⊦ ((nf from n))(m) = nf(m + n); (s) m < n ⊦ (nf to n)[m] = nf(m); (s) ⊦ m < n → (n ≤ m ↔ false); (s) ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ #(nf to n) = n; (s)
| ii(n0) + # f_n->list(n0) = ii(n0 + 1) + 1, f_n->list(n0).last = nf(n0 + 1), f_n->list(n0) = nf(n0) ' + y, ii(0) = 0, f_n->list(n0) ≠ [], ii(n0) < ii(n0 + 1), n < ii(n0 + 1), pathp(g)(⌜f_n->list(n0)⌝ ), nf(n0) ∈ f_n->list(n0), ii(n0) ≤ n, ¬ dom(g)(nf0(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ n1. n1 < # f_n->list(n0) → nf0(n1 + ii(n0)) = f_n->list(n0)[n1] ⊦ |
ii(n0) + # f_n->list(n0) = ii(n0 + 1) + 1, f_n->list(n0).last = nf(n0 + 1), f_n->list(n0) = nf(n0) ' + y, ii(0) = 0, f_n->list(n0) ≠ [], n < ii(n0 + 1), ii(n0) < ii(n0 + 1), pathp(g)(⌜f_n->list(n0)⌝ ), nf(n0) ∈ f_n->list(n0), ii(n0) ≤ n, ¬ dom(g)(nf0(n)), n - ii(n0) < # f_n->list(n0) → nf0((n - ii(n0)) + ii(n0)) = f_n->list(n0)[n - ii(n0)], ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n) ⊦
Used terms: n - ii(n0)
| ii(n0) + # f_n->list(n0) = ii(n0 + 1) + 1, f_n->list(n0).last = nf(n0 + 1), f_n->list(n0) = nf(n0) ' + y, ii(0) = 0, f_n->list(n0) ≠ [], n < ii(n0 + 1), ii(n0) < ii(n0 + 1), pathp(g)(⌜f_n->list(n0)⌝ ), nf(n0) ∈ f_n->list(n0), ii(n0) ≤ n, ¬ dom(g)(nf0(n)), n - ii(n0) < # f_n->list(n0) → nf0((n - ii(n0)) + ii(n0)) = f_n->list(n0)[n - ii(n0)], ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n) ⊦ |
ii(n0) + # f_n->list(n0) = ii(n0 + 1) + 1, f_n->list(n0).last = nf(n0 + 1), f_n->list(n0) = nf(n0) ' + y, ii(0) = 0, nf0((n - ii(n0)) + ii(n0)) = f_n->list(n0)[n - ii(n0)], f_n->list(n0) ≠ [], n < ii(n0 + 1), ii(n0) < ii(n0 + 1), pathp(g)(⌜f_n->list(n0)⌝ ), nf(n0) ∈ f_n->list(n0), ii(n0) ≤ n, ¬ dom(g)(nf0(n)), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n) ⊦
Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m < n → ¬ n < m; (s) ⊦ m < n + 1 ↔ ¬ n < m; (s) n0 ≤ n ⊦ n - n0 < m ↔ n < m + n0; (s) ⊦ m ≤ n → (n < m ↔ false); (s) ⊦ m ≤ n ↔ ¬ n < m; (ss)
| ii(n0) + # f_n->list(n0) = ii(n0 + 1) + 1, f_n->list(n0).last = nf(n0 + 1), f_n->list(n0) = nf(n0) ' + y, ii(0) = 0, nf0((n - ii(n0)) + ii(n0)) = f_n->list(n0)[n - ii(n0)], f_n->list(n0) ≠ [], n < ii(n0 + 1), ii(n0) < ii(n0 + 1), pathp(g)(⌜f_n->list(n0)⌝ ), nf(n0) ∈ f_n->list(n0), ii(n0) ≤ n, ¬ dom(g)(nf0(n)), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n) ⊦ |
ii(n0) + # f_n->list(n0) = ii(n0 + 1) + 1, f_n->list(n0).last = nf(n0 + 1), f_n->list(n0) = nf(n0) ' + y, ii(0) = 0, n = n1 + ii(n0), nf0(n1 + ii(n0)) = f_n->list(n0)[n1], f_n->list(n0) ≠ [], ii(n0) < ii(n0 + 1), n < ii(n0 + 1), pathp(g)(⌜f_n->list(n0)⌝ ), nf(n0) ∈ f_n->list(n0), ii(n0) ≤ n, ¬ dom(g)(nf0(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ls(g)(nf(n + 1), nf(n)) ⊦
Used simplifier rules: n ≤ m ⊦ n0 = m - n ↔ m = n0 + n; (elim) Used terms: n, ii(n0), n1
| ii(n0) + # f_n->list(n0) = ii(n0 + 1) + 1, f_n->list(n0).last = nf(n0 + 1), f_n->list(n0) = nf(n0) ' + y, ii(0) = 0, n = n1 + ii(n0), nf0(n1 + ii(n0)) = f_n->list(n0)[n1], f_n->list(n0) ≠ [], ii(n0) < ii(n0 + 1), n < ii(n0 + 1), pathp(g)(⌜f_n->list(n0)⌝ ), nf(n0) ∈ f_n->list(n0), ii(n0) ≤ n, ¬ dom(g)(nf0(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ls(g)(nf(n + 1), nf(n)) ⊦ |
ii(n0) + # f_n->list(n0) = ii(n0 + 1) + 1, f_n->list(n0).last = nf(n0 + 1), f_n->list(n0) = nf(n0) ' + y, ii(0) = 0, nf0(n1 + ii(n0)) = f_n->list(n0)[n1], f_n->list(n0) ≠ [], n1 + ii(n0) < ii(n0 + 1), ii(n0) < ii(n0 + 1), pathp(g)(⌜f_n->list(n0)⌝ ), nf(n0) ∈ f_n->list(n0), ¬ dom(g)(f_n->list(n0)[n1]), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n) ⊦
Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m ≤ m + n; (s)
| ii(n0) + # f_n->list(n0) = ii(n0 + 1) + 1, f_n->list(n0).last = nf(n0 + 1), f_n->list(n0) = nf(n0) ' + y, ii(0) = 0, nf0(n1 + ii(n0)) = f_n->list(n0)[n1], f_n->list(n0) ≠ [], n1 + ii(n0) < ii(n0 + 1), ii(n0) < ii(n0 + 1), pathp(g)(⌜f_n->list(n0)⌝ ), nf(n0) ∈ f_n->list(n0), ¬ dom(g)(f_n->list(n0)[n1]), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n) ⊦ |
⊦ pathp(g)(σ) ↔ (∀ n. ⌜n⌝ < # σ → dom(g)(σ[n])) ∧ (∀ n. ⌜n + 1⌝ < # σ → edge(g)(σ[n], σ[n + 1]))
ii(n0) + # f_n->list(n0) = ii(n0 + 1) + 1, f_n->list(n0).last = nf(n0 + 1), f_n->list(n0) = nf(n0) ' + y, ii(0) = 0, nf0(n1 + ii(n0)) = f_n->list(n0)[n1], f_n->list(n0) ≠ [], ii(n0) < ii(n0 + 1), n1 + ii(n0) < ii(n0 + 1), nf(n0) ∈ f_n->list(n0), ¬ dom(g)(f_n->list(n0)[n1]), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ n. ⌜n⌝ < # ⌜f_n->list(n0)⌝ → dom(g)(⌜f_n->list(n0)⌝ [n]), ∀ n. ⌜n + 1⌝ < # ⌜f_n->list(n0)⌝ → edge(g)(⌜f_n->list(n0)⌝ [n], ⌜f_n->list(n0)⌝ [n + 1]) ⊦
Used terms: ⌜f_n->list(n0)⌝ , g
| ⊦ pathp(g)(σ) ↔ (∀ n. ⌜n⌝ < # σ → dom(g)(σ[n])) ∧ (∀ n. ⌜n + 1⌝ < # σ → edge(g)(σ[n], σ[n + 1])) |
| ii(n0) + # f_n->list(n0) = ii(n0 + 1) + 1, f_n->list(n0).last = nf(n0 + 1), f_n->list(n0) = nf(n0) ' + y, ii(0) = 0, nf0(n1 + ii(n0)) = f_n->list(n0)[n1], f_n->list(n0) ≠ [], ii(n0) < ii(n0 + 1), n1 + ii(n0) < ii(n0 + 1), nf(n0) ∈ f_n->list(n0), ¬ dom(g)(f_n->list(n0)[n1]), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ n. ⌜n⌝ < # ⌜f_n->list(n0)⌝ → dom(g)(⌜f_n->list(n0)⌝ [n]), ∀ n. ⌜n + 1⌝ < # ⌜f_n->list(n0)⌝ → edge(g)(⌜f_n->list(n0)⌝ [n], ⌜f_n->list(n0)⌝ [n + 1]) ⊦ |
ii(n0) + # f_n->list(n0) = ii(n0 + 1) + 1, f_n->list(n0).last = nf(n0 + 1), f_n->list(n0) = nf(n0) ' + y, ii(0) = 0, nf0(n1 + ii(n0)) = f_n->list(n0)[n1], f_n->list(n0) ≠ [], n1 + ii(n0) < ii(n0 + 1), ii(n0) < ii(n0 + 1), nf(n0) ∈ f_n->list(n0), ¬ dom(g)(f_n->list(n0)[n1]), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. n + 1 < # f_n->list(n0) → edge(g)(f_n->list(n0)[n], y[n]), ∀ n. n < # f_n->list(n0) → dom(g)(f_n->list(n0)[n]) ⊦
Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ x = a ' + x0 → x[m + 1] = x0[m]; (s) a: ⊦ (x + y) + z = x + y + z; from specification list add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf ⊦ ⌜n⌝ + ⌜m⌝ < ⌜n0⌝ ↔ n + m < n0; (s) ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s)
| ii(n0) + # f_n->list(n0) = ii(n0 + 1) + 1, f_n->list(n0).last = nf(n0 + 1), f_n->list(n0) = nf(n0) ' + y, ii(0) = 0, nf0(n1 + ii(n0)) = f_n->list(n0)[n1], f_n->list(n0) ≠ [], n1 + ii(n0) < ii(n0 + 1), ii(n0) < ii(n0 + 1), nf(n0) ∈ f_n->list(n0), ¬ dom(g)(f_n->list(n0)[n1]), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. n + 1 < # f_n->list(n0) → edge(g)(f_n->list(n0)[n], y[n]), ∀ n. n < # f_n->list(n0) → dom(g)(f_n->list(n0)[n]) ⊦ |
ii(n0) + # f_n->list(n0) = ii(n0 + 1) + 1, f_n->list(n0).last = nf(n0 + 1), f_n->list(n0) = nf(n0) ' + y, ii(0) = 0, nf0(n1 + ii(n0)) = f_n->list(n0)[n1], f_n->list(n0) ≠ [], ii(n0) < ii(n0 + 1), n1 + ii(n0) < ii(n0 + 1), nf(n0) ∈ f_n->list(n0), ¬ dom(g)(f_n->list(n0)[n1]), n1 < # f_n->list(n0) → dom(g)(f_n->list(n0)[n1]), ∀ n. n + 1 < # f_n->list(n0) → edge(g)(f_n->list(n0)[n], y[n]), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ls(g)(nf(n + 1), nf(n)) ⊦
Used terms: n1
| ii(n0) + # f_n->list(n0) = ii(n0 + 1) + 1, f_n->list(n0).last = nf(n0 + 1), f_n->list(n0) = nf(n0) ' + y, ii(0) = 0, nf0(n1 + ii(n0)) = f_n->list(n0)[n1], f_n->list(n0) ≠ [], ii(n0) < ii(n0 + 1), n1 + ii(n0) < ii(n0 + 1), nf(n0) ∈ f_n->list(n0), ¬ dom(g)(f_n->list(n0)[n1]), n1 < # f_n->list(n0) → dom(g)(f_n->list(n0)[n1]), ∀ n. n + 1 < # f_n->list(n0) → edge(g)(f_n->list(n0)[n], y[n]), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ls(g)(nf(n + 1), nf(n)) ⊦ |
ii(n0) + # f_n->list(n0) = ii(n0 + 1) + 1, f_n->list(n0).last = nf(n0 + 1), f_n->list(n0) = nf(n0) ' + y, ii(0) = 0, nf0(n1 + ii(n0)) = f_n->list(n0)[n1], f_n->list(n0) ≠ [], n1 + ii(n0) < ii(n0 + 1), ii(n0) < ii(n0 + 1), nf(n0) ∈ f_n->list(n0), # f_n->list(n0) ≤ n1, ¬ dom(g)(f_n->list(n0)[n1]), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. n + 1 < # f_n->list(n0) → edge(g)(f_n->list(n0)[n], y[n]) ⊦
Used simplifier rules: ⊦ m < n ↔ ¬ n ≤ m; (ss)
| ii(n0) + # f_n->list(n0) = ii(n0 + 1) + 1, f_n->list(n0).last = nf(n0 + 1), f_n->list(n0) = nf(n0) ' + y, ii(0) = 0, nf0(n1 + ii(n0)) = f_n->list(n0)[n1], f_n->list(n0) ≠ [], n1 + ii(n0) < ii(n0 + 1), ii(n0) < ii(n0 + 1), nf(n0) ∈ f_n->list(n0), # f_n->list(n0) ≤ n1, ¬ dom(g)(f_n->list(n0)[n1]), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. n + 1 < # f_n->list(n0) → edge(g)(f_n->list(n0)[n], y[n]) ⊦ |
Used simplifier rules: ⊦ m + n = m + n0 ↔ n = n0; (s) ⊦ a ' + x ≠ []; (s) ⊦ m + 1 ≤ n ↔ m < n; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ #(a ' + x) = (# x)+1; (s) ⊦ m +1 = m + 1; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic ⊦ m < n → n ≠ 0; (s) ⊦ m < m + n ↔ n ≠ 0; (s) ⊦ # x = 0 ↔ x = []; (s) ⊦ x ≠ [] → (a ' + x).last = x.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list ⊦ m + n < m + n0 ↔ n < n0; (s) ⊦ m < n → ¬ n < m; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic
| ii(0) = 0, ¬ edge(g)(nf0(n0), nf0(n0 + 1)), ∀ n. ii(n + 1) = ii(n) + # f_n->list(n) - 1 ∧ (nf0 from ii(n)) to # f_n->list(n) = f_n->list(n), ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1) ⊦ |
ii(0) = 0, ¬ edge(g)(nf0(n0), nf0(n0 + 1)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ n. ii(n + 1) = ii(n) + # f_n->list(n) - 1 ∧ (nf0 from ii(n)) to # f_n->list(n) = f_n->list(n), ∃ m. ii(m) ≤ n0 ∧ n0 < ii(m + 1) ⊦
Used terms: n0
| ii(0) = 0, ¬ edge(g)(nf0(n0), nf0(n0 + 1)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ n. ii(n + 1) = ii(n) + # f_n->list(n) - 1 ∧ (nf0 from ii(n)) to # f_n->list(n) = f_n->list(n), ∃ m. ii(m) ≤ n0 ∧ n0 < ii(m + 1) ⊦ |
ii(0) = 0, ii(n) < ii(n + 1), n0 < ii(n + 1), ii(n) ≤ n0, ¬ edge(g)(nf0(n0), nf0(n0 + 1)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ n. ii(n + 1) = ii(n) + # f_n->list(n) - 1 ∧ (nf0 from ii(n)) to # f_n->list(n) = f_n->list(n) ⊦
Used simplifier rules: ⊦ m < n → n ≠ 0; (s) fle-01: ⊦ m ≤ n ∧ n < n0 → m < n0; (forward) from specification nat f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic
| ii(0) = 0, ii(n) < ii(n + 1), n0 < ii(n + 1), ii(n) ≤ n0, ¬ edge(g)(nf0(n0), nf0(n0 + 1)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ n. ii(n + 1) = ii(n) + # f_n->list(n) - 1 ∧ (nf0 from ii(n)) to # f_n->list(n) = f_n->list(n) ⊦ |
ii(0) = 0, ii(n + 1) = ii(n) + # f_n->list(n) - 1, (nf0 from ii(n)) to # f_n->list(n) = f_n->list(n), n0 < ii(n + 1), ii(n) < ii(n + 1), ii(n) ≤ n0, ¬ edge(g)(nf0(n0), nf0(n0 + 1)), ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n) ⊦
Used terms: n
| ii(0) = 0, ii(n + 1) = ii(n) + # f_n->list(n) - 1, (nf0 from ii(n)) to # f_n->list(n) = f_n->list(n), n0 < ii(n + 1), ii(n) < ii(n + 1), ii(n) ≤ n0, ¬ edge(g)(nf0(n0), nf0(n0 + 1)), ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n) ⊦ |
ii(0) = 0, ii(n + 1) = ii(n) + # f_n->list(n) - 1, (nf0 from ii(n)) to # f_n->list(n) = f_n->list(n), n0 < ii(n + 1), ii(n) < ii(n + 1), ii(n) ≤ n0, ¬ edge(g)(nf0(n0), nf0(n0 + 1)), ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n) ⊦
Used simplifier rules: lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic
| ii(0) = 0, ii(n + 1) = ii(n) + # f_n->list(n) - 1, (nf0 from ii(n)) to # f_n->list(n) = f_n->list(n), n0 < ii(n + 1), ii(n) < ii(n + 1), ii(n) ≤ n0, ¬ edge(g)(nf0(n0), nf0(n0 + 1)), ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n) ⊦ |
⊦ x = y ↔ # x = # y ∧ (∀ n. n < # x → x[n] = y[n])
#((nf0 from ii(n)) to # f_n->list(n)) = # f_n->list(n), ii(n + 1) = ii(n) + # f_n->list(n) - 1, ii(0) = 0, ii(n) < ii(n + 1), n0 < ii(n + 1), ii(n) ≤ n0, ¬ edge(g)(nf0(n0), nf0(n0 + 1)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ n0. n0 < #((nf0 from ii(n)) to # f_n->list(n)) → ((nf0 from ii(n)) to # f_n->list(n))[n0] = f_n->list(n)[n0] ⊦
Used terms: f_n->list(n), (nf0 from ii(n)) to # f_n->list(n)
| ⊦ x = y ↔ # x = # y ∧ (∀ n. n < # x → x[n] = y[n]) |
| #((nf0 from ii(n)) to # f_n->list(n)) = # f_n->list(n), ii(n + 1) = ii(n) + # f_n->list(n) - 1, ii(0) = 0, ii(n) < ii(n + 1), n0 < ii(n + 1), ii(n) ≤ n0, ¬ edge(g)(nf0(n0), nf0(n0 + 1)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ n0. n0 < #((nf0 from ii(n)) to # f_n->list(n)) → ((nf0 from ii(n)) to # f_n->list(n))[n0] = f_n->list(n)[n0] ⊦ |
ii(0) = 0, ii(n + 1) = ii(n) + # f_n->list(n) - 1, n0 < ii(n + 1), ii(n) < ii(n + 1), ii(n) ≤ n0, ¬ edge(g)(nf0(n0), nf0(n0 + 1)), ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n1. n1 < # f_n->list(n) → nf0(n1 + ii(n)) = f_n->list(n)[n1] ⊦
Used simplifier rules: ⊦ ((nf from n))(m) = nf(m + n); (s) m < n ⊦ (nf to n)[m] = nf(m); (s) ⊦ m < n → (n ≤ m ↔ false); (s) ⊦ m < n ↔ ¬ n ≤ m; (ss) ⊦ #(nf to n) = n; (s)
| ii(0) = 0, ii(n + 1) = ii(n) + # f_n->list(n) - 1, n0 < ii(n + 1), ii(n) < ii(n + 1), ii(n) ≤ n0, ¬ edge(g)(nf0(n0), nf0(n0 + 1)), ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n1. n1 < # f_n->list(n) → nf0(n1 + ii(n)) = f_n->list(n)[n1] ⊦ |
ii(n + 1) = ii(n) + # f_n->list(n) - 1, ii(0) = 0, ii(n) < ii(n + 1), n0 < ii(n + 1), ii(n) ≤ n0, ¬ edge(g)(nf0(n0), nf0(n0 + 1)), n0 - ii(n) < # f_n->list(n) → nf0((n0 - ii(n)) + ii(n)) = f_n->list(n)[n0 - ii(n)], ∀ n1. n1 < # f_n->list(n) → nf0(n1 + ii(n)) = f_n->list(n)[n1], ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1) ⊦
Used terms: n0 - ii(n)
| ii(n + 1) = ii(n) + # f_n->list(n) - 1, ii(0) = 0, ii(n) < ii(n + 1), n0 < ii(n + 1), ii(n) ≤ n0, ¬ edge(g)(nf0(n0), nf0(n0 + 1)), n0 - ii(n) < # f_n->list(n) → nf0((n0 - ii(n)) + ii(n)) = f_n->list(n)[n0 - ii(n)], ∀ n1. n1 < # f_n->list(n) → nf0(n1 + ii(n)) = f_n->list(n)[n1], ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1) ⊦ |
ii(0) = 0, ii(n + 1) = ii(n) + # f_n->list(n) - 1, n0 < ii(n + 1), ii(n) < ii(n + 1), ii(n) ≤ n0, ¬ edge(g)(nf0(n0), nf0(n0 + 1)), n0 < # f_n->list(n) + ii(n) → nf0((n0 - ii(n)) + ii(n)) = f_n->list(n)[n0 - ii(n)], ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n1. n1 < # f_n->list(n) → nf0(n1 + ii(n)) = f_n->list(n)[n1] ⊦
Used simplifier rules: n0 ≤ n ⊦ n - n0 < m ↔ n < m + n0; (s) ⊦ m ≤ n → (n < m ↔ false); (s) ⊦ m ≤ n ↔ ¬ n < m; (ss)
| ii(0) = 0, ii(n + 1) = ii(n) + # f_n->list(n) - 1, n0 < ii(n + 1), ii(n) < ii(n + 1), ii(n) ≤ n0, ¬ edge(g)(nf0(n0), nf0(n0 + 1)), n0 < # f_n->list(n) + ii(n) → nf0((n0 - ii(n)) + ii(n)) = f_n->list(n)[n0 - ii(n)], ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n1. n1 < # f_n->list(n) → nf0(n1 + ii(n)) = f_n->list(n)[n1] ⊦ |
ii(n + 1) = ii(n) + # f_n->list(n) - 1, ii(0) = 0, n0 = n2 + ii(n), ii(n) < ii(n + 1), n0 < ii(n + 1), ii(n) ≤ n0, ¬ edge(g)(nf0(n0), nf0(n0 + 1)), n0 < # f_n->list(n) + ii(n) → nf0(n2 + ii(n)) = f_n->list(n)[n2], ∀ n1. n1 < # f_n->list(n) → nf0(n1 + ii(n)) = f_n->list(n)[n1], ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1) ⊦
Used simplifier rules: n ≤ m ⊦ n0 = m - n ↔ m = n0 + n; (elim) Used terms: n0, ii(n), n2
| ii(n + 1) = ii(n) + # f_n->list(n) - 1, ii(0) = 0, n0 = n2 + ii(n), ii(n) < ii(n + 1), n0 < ii(n + 1), ii(n) ≤ n0, ¬ edge(g)(nf0(n0), nf0(n0 + 1)), n0 < # f_n->list(n) + ii(n) → nf0(n2 + ii(n)) = f_n->list(n)[n2], ∀ n1. n1 < # f_n->list(n) → nf0(n1 + ii(n)) = f_n->list(n)[n1], ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1) ⊦ |
ii(n + 1) = ii(n) + # f_n->list(n) - 1, ii(0) = 0, ii(n) < ii(n + 1), n2 + ii(n) < ii(n + 1), ¬ edge(g)(nf0(n2 + ii(n)), nf0((n2 + ii(n)) + 1)), n2 < # f_n->list(n) → nf0(n2 + ii(n)) = f_n->list(n)[n2], ∀ n1. n1 < # f_n->list(n) → nf0(n1 + ii(n)) = f_n->list(n)[n1], ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1) ⊦
Used simplifier rules: lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m + n < m + n0 ↔ n < n0; (s) ⊦ m ≤ m + n; (s)
| ii(n + 1) = ii(n) + # f_n->list(n) - 1, ii(0) = 0, ii(n) < ii(n + 1), n2 + ii(n) < ii(n + 1), ¬ edge(g)(nf0(n2 + ii(n)), nf0((n2 + ii(n)) + 1)), n2 < # f_n->list(n) → nf0(n2 + ii(n)) = f_n->list(n)[n2], ∀ n1. n1 < # f_n->list(n) → nf0(n1 + ii(n)) = f_n->list(n)[n1], ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1) ⊦ |
ii(0) = 0, ii(n + 1) = ii(n) + # f_n->list(n) - 1, n2 + ii(n) < ii(n + 1), ii(n) < ii(n + 1), ¬ edge(g)(nf0(n2 + ii(n)), nf0((n2 + ii(n)) + 1)), n2 < # f_n->list(n) → nf0(n2 + ii(n)) = f_n->list(n)[n2], n2 + 1 < # f_n->list(n) → nf0((n2 + 1) + ii(n)) = f_n->list(n)[n2 + 1], ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n) ⊦
Used terms: n2 + 1
| ii(0) = 0, ii(n + 1) = ii(n) + # f_n->list(n) - 1, n2 + ii(n) < ii(n + 1), ii(n) < ii(n + 1), ¬ edge(g)(nf0(n2 + ii(n)), nf0((n2 + ii(n)) + 1)), n2 < # f_n->list(n) → nf0(n2 + ii(n)) = f_n->list(n)[n2], n2 + 1 < # f_n->list(n) → nf0((n2 + 1) + ii(n)) = f_n->list(n)[n2 + 1], ∀ n0. pathp(g)(⌜f_n->list(n0)⌝ ) ∧ f_n->list(n0).head = nf(n0) ∧ f_n->list(n0) ≠ [] ∧ f_n->list(n0).last = nf(n0 + 1), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n) ⊦ |
f_n->list(n).head = nf(n), f_n->list(n).last = nf(n + 1), ii(n + 1) = ii(n) + # f_n->list(n) - 1, ii(0) = 0, f_n->list(n) ≠ [], ii(n) < ii(n + 1), n2 + ii(n) < ii(n + 1), pathp(g)(⌜f_n->list(n)⌝ ), ¬ edge(g)(nf0(n2 + ii(n)), nf0((n2 + ii(n)) + 1)), n2 + 1 < # f_n->list(n) → nf0((n2 + 1) + ii(n)) = f_n->list(n)[n2 + 1], n2 < # f_n->list(n) → nf0(n2 + ii(n)) = f_n->list(n)[n2], ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ls(g)(nf(n + 1), nf(n)) ⊦
Used terms: n
| f_n->list(n).head = nf(n), f_n->list(n).last = nf(n + 1), ii(n + 1) = ii(n) + # f_n->list(n) - 1, ii(0) = 0, f_n->list(n) ≠ [], ii(n) < ii(n + 1), n2 + ii(n) < ii(n + 1), pathp(g)(⌜f_n->list(n)⌝ ), ¬ edge(g)(nf0(n2 + ii(n)), nf0((n2 + ii(n)) + 1)), n2 + 1 < # f_n->list(n) → nf0((n2 + 1) + ii(n)) = f_n->list(n)[n2 + 1], n2 < # f_n->list(n) → nf0(n2 + ii(n)) = f_n->list(n)[n2], ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ls(g)(nf(n + 1), nf(n)) ⊦ |
f_n->list(n).head = nf(n), f_n->list(n).last = nf(n + 1), ii(0) = 0, ii(n + 1) = ii(n) + # f_n->list(n) - 1, f_n->list(n) ≠ [], n2 + ii(n) < ii(n + 1), ii(n) < ii(n + 1), pathp(g)(⌜f_n->list(n)⌝ ), ¬ edge(g)(nf0(n2 + ii(n)), nf0((n2 + ii(n)) + 1)), n2 < # f_n->list(n) → nf0(n2 + ii(n)) = f_n->list(n)[n2], n2 + 1 < # f_n->list(n) → nf0((n2 + 1) + ii(n)) = f_n->list(n)[n2 + 1], ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n) ⊦
| f_n->list(n).head = nf(n), f_n->list(n).last = nf(n + 1), ii(0) = 0, ii(n + 1) = ii(n) + # f_n->list(n) - 1, f_n->list(n) ≠ [], n2 + ii(n) < ii(n + 1), ii(n) < ii(n + 1), pathp(g)(⌜f_n->list(n)⌝ ), ¬ edge(g)(nf0(n2 + ii(n)), nf0((n2 + ii(n)) + 1)), n2 < # f_n->list(n) → nf0(n2 + ii(n)) = f_n->list(n)[n2], n2 + 1 < # f_n->list(n) → nf0((n2 + 1) + ii(n)) = f_n->list(n)[n2 + 1], ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n) ⊦ |
ii(n) + # f_n->list(n) = n0 + 1, f_n->list(n).head = nf(n), f_n->list(n).last = nf(n + 1), ii(n + 1) = n0, ii(0) = 0, ii(n) + # f_n->list(n) ≠ 0, f_n->list(n) ≠ [], ii(n) < ii(n + 1), n2 + ii(n) < ii(n + 1), pathp(g)(⌜f_n->list(n)⌝ ), ¬ edge(g)(nf0(n2 + ii(n)), nf0((n2 + ii(n)) + 1)), n2 + 1 < # f_n->list(n) → nf0((n2 + 1) + ii(n)) = f_n->list(n)[n2 + 1], n2 < # f_n->list(n) → nf0(n2 + ii(n)) = f_n->list(n)[n2], ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ls(g)(nf(n + 1), nf(n)) ⊦
Used simplifier rules: ⊦ m + n = 0 ↔ m = 0 ∧ n = 0; (ws) ⊦ # x = 0 ↔ x = []; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic n ≠ 0 ⊦ m = n - 1 ↔ n = m + 1; (elim) Used terms: ii(n) + # f_n->list(n), m0
| ii(n) + # f_n->list(n) = n0 + 1, f_n->list(n).head = nf(n), f_n->list(n).last = nf(n + 1), ii(n + 1) = n0, ii(0) = 0, ii(n) + # f_n->list(n) ≠ 0, f_n->list(n) ≠ [], ii(n) < ii(n + 1), n2 + ii(n) < ii(n + 1), pathp(g)(⌜f_n->list(n)⌝ ), ¬ edge(g)(nf0(n2 + ii(n)), nf0((n2 + ii(n)) + 1)), n2 + 1 < # f_n->list(n) → nf0((n2 + 1) + ii(n)) = f_n->list(n)[n2 + 1], n2 < # f_n->list(n) → nf0(n2 + ii(n)) = f_n->list(n)[n2], ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ls(g)(nf(n + 1), nf(n)) ⊦ |
ii(n) + # f_n->list(n) = ii(n + 1) + 1, f_n->list(n).head = nf(n), f_n->list(n).last = nf(n + 1), ii(0) = 0, f_n->list(n) ≠ [], ii(n) < ii(n + 1), n2 + ii(n) < ii(n + 1), pathp(g)(⌜f_n->list(n)⌝ ), ¬ edge(g)(nf0(n2 + ii(n)), nf0((n2 + ii(n)) + 1)), n2 + 1 < # f_n->list(n) → nf0((n2 + 1) + ii(n)) = f_n->list(n)[n2 + 1], n2 < # f_n->list(n) → nf0(n2 + ii(n)) = f_n->list(n)[n2], ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ls(g)(nf(n + 1), nf(n)) ⊦
Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ m + 1 ≠ 0; (s)
| ii(n) + # f_n->list(n) = ii(n + 1) + 1, f_n->list(n).head = nf(n), f_n->list(n).last = nf(n + 1), ii(0) = 0, f_n->list(n) ≠ [], ii(n) < ii(n + 1), n2 + ii(n) < ii(n + 1), pathp(g)(⌜f_n->list(n)⌝ ), ¬ edge(g)(nf0(n2 + ii(n)), nf0((n2 + ii(n)) + 1)), n2 + 1 < # f_n->list(n) → nf0((n2 + 1) + ii(n)) = f_n->list(n)[n2 + 1], n2 < # f_n->list(n) → nf0(n2 + ii(n)) = f_n->list(n)[n2], ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ls(g)(nf(n + 1), nf(n)) ⊦ |
ii(n) + # f_n->list(n) = ii(n + 1) + 1, f_n->list(n).last = nf(n + 1), a = nf(n), f_n->list(n) = a + y, ii(0) = 0, f_n->list(n) ≠ [], n2 + ii(n) < ii(n + 1), ii(n) < ii(n + 1), pathp(g)(⌜f_n->list(n)⌝ ), ¬ edge(g)(nf0(n2 + ii(n)), nf0((n2 + ii(n)) + 1)), n2 < # f_n->list(n) → nf0(n2 + ii(n)) = f_n->list(n)[n2], n2 + 1 < # f_n->list(n) → nf0((n2 + 1) + ii(n)) = f_n->list(n)[n2 + 1], ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n) ⊦
Used simplifier rules: x ≠ [] ⊦ a = x.head ∧ y = x.tail ↔ x = a + y; (elim) Used terms: f_n->list(n), a, y
| ii(n) + # f_n->list(n) = ii(n + 1) + 1, f_n->list(n).last = nf(n + 1), a = nf(n), f_n->list(n) = a + y, ii(0) = 0, f_n->list(n) ≠ [], n2 + ii(n) < ii(n + 1), ii(n) < ii(n + 1), pathp(g)(⌜f_n->list(n)⌝ ), ¬ edge(g)(nf0(n2 + ii(n)), nf0((n2 + ii(n)) + 1)), n2 < # f_n->list(n) → nf0(n2 + ii(n)) = f_n->list(n)[n2], n2 + 1 < # f_n->list(n) → nf0((n2 + 1) + ii(n)) = f_n->list(n)[n2 + 1], ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n) ⊦ |
ii(n) + # f_n->list(n) = ii(n + 1) + 1, f_n->list(n).last = nf(n + 1), f_n->list(n) = nf(n) ' + y, ii(0) = 0, f_n->list(n) ≠ [], ii(n) < ii(n + 1), n2 + ii(n) < ii(n + 1), pathp(g)(⌜f_n->list(n)⌝ ), nf(n) ∈ f_n->list(n), ¬ edge(g)(nf0(n2 + ii(n)), nf0((n2 + ii(n)) + 1)), n2 < # f_n->list(n) → nf0(n2 + ii(n)) = f_n->list(n)[n2], n2 + 1 < # f_n->list(n) → nf0((n2 + 1) + ii(n)) = y[n2], ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ls(g)(nf(n + 1), nf(n)) ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ x = a ' + x0 → x[m + 1] = x0[m]; (s) ⊦ a + x = a ' + x; (s)
| ii(n) + # f_n->list(n) = ii(n + 1) + 1, f_n->list(n).last = nf(n + 1), f_n->list(n) = nf(n) ' + y, ii(0) = 0, f_n->list(n) ≠ [], ii(n) < ii(n + 1), n2 + ii(n) < ii(n + 1), pathp(g)(⌜f_n->list(n)⌝ ), nf(n) ∈ f_n->list(n), ¬ edge(g)(nf0(n2 + ii(n)), nf0((n2 + ii(n)) + 1)), n2 < # f_n->list(n) → nf0(n2 + ii(n)) = f_n->list(n)[n2], n2 + 1 < # f_n->list(n) → nf0((n2 + 1) + ii(n)) = y[n2], ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ls(g)(nf(n + 1), nf(n)) ⊦ |
⊦ pathp(g)(σ) ↔ (∀ n. ⌜n⌝ < # σ → dom(g)(σ[n])) ∧ (∀ n. ⌜n + 1⌝ < # σ → edge(g)(σ[n], σ[n + 1]))
ii(n) + # f_n->list(n) = ii(n + 1) + 1, f_n->list(n).last = nf(n + 1), f_n->list(n) = nf(n) ' + y, ii(0) = 0, f_n->list(n) ≠ [], n2 + ii(n) < ii(n + 1), ii(n) < ii(n + 1), nf(n) ∈ f_n->list(n), ¬ edge(g)(nf0(n2 + ii(n)), nf0((n2 + ii(n)) + 1)), n2 + 1 < # f_n->list(n) → nf0((n2 + 1) + ii(n)) = y[n2], n2 < # f_n->list(n) → nf0(n2 + ii(n)) = f_n->list(n)[n2], ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. ⌜n0⌝ < # ⌜f_n->list(n)⌝ → dom(g)(⌜f_n->list(n)⌝ [n0]), ∀ n0. ⌜n0 + 1⌝ < # ⌜f_n->list(n)⌝ → edge(g)(⌜f_n->list(n)⌝ [n0], ⌜f_n->list(n)⌝ [n0 + 1]) ⊦
Used terms: ⌜f_n->list(n)⌝ , g
| ⊦ pathp(g)(σ) ↔ (∀ n. ⌜n⌝ < # σ → dom(g)(σ[n])) ∧ (∀ n. ⌜n + 1⌝ < # σ → edge(g)(σ[n], σ[n + 1])) |
| ii(n) + # f_n->list(n) = ii(n + 1) + 1, f_n->list(n).last = nf(n + 1), f_n->list(n) = nf(n) ' + y, ii(0) = 0, f_n->list(n) ≠ [], n2 + ii(n) < ii(n + 1), ii(n) < ii(n + 1), nf(n) ∈ f_n->list(n), ¬ edge(g)(nf0(n2 + ii(n)), nf0((n2 + ii(n)) + 1)), n2 + 1 < # f_n->list(n) → nf0((n2 + 1) + ii(n)) = y[n2], n2 < # f_n->list(n) → nf0(n2 + ii(n)) = f_n->list(n)[n2], ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n0. ⌜n0⌝ < # ⌜f_n->list(n)⌝ → dom(g)(⌜f_n->list(n)⌝ [n0]), ∀ n0. ⌜n0 + 1⌝ < # ⌜f_n->list(n)⌝ → edge(g)(⌜f_n->list(n)⌝ [n0], ⌜f_n->list(n)⌝ [n0 + 1]) ⊦ |
ii(n) + # f_n->list(n) = ii(n + 1) + 1, f_n->list(n).last = nf(n + 1), f_n->list(n) = nf(n) ' + y, ii(0) = 0, f_n->list(n) ≠ [], ii(n) < ii(n + 1), n2 + ii(n) < ii(n + 1), nf(n) ∈ f_n->list(n), ¬ edge(g)(nf0(n2 + ii(n)), nf0((n2 + ii(n)) + 1)), n2 < # f_n->list(n) → nf0(n2 + ii(n)) = f_n->list(n)[n2], n2 + 1 < # f_n->list(n) → nf0((n2 + 1) + ii(n)) = y[n2], ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ n0. n0 + 1 < # f_n->list(n) → edge(g)(f_n->list(n)[n0], y[n0]), ∀ n0. n0 < # f_n->list(n) → dom(g)(f_n->list(n)[n0]) ⊦
Used simplifier rules: ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ x = a ' + x0 → x[m + 1] = x0[m]; (s) a: ⊦ (x + y) + z = x + y + z; from specification list add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf ⊦ ⌜n⌝ + ⌜m⌝ < ⌜n0⌝ ↔ n + m < n0; (s) ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s)
| ii(n) + # f_n->list(n) = ii(n + 1) + 1, f_n->list(n).last = nf(n + 1), f_n->list(n) = nf(n) ' + y, ii(0) = 0, f_n->list(n) ≠ [], ii(n) < ii(n + 1), n2 + ii(n) < ii(n + 1), nf(n) ∈ f_n->list(n), ¬ edge(g)(nf0(n2 + ii(n)), nf0((n2 + ii(n)) + 1)), n2 < # f_n->list(n) → nf0(n2 + ii(n)) = f_n->list(n)[n2], n2 + 1 < # f_n->list(n) → nf0((n2 + 1) + ii(n)) = y[n2], ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ n0. n0 + 1 < # f_n->list(n) → edge(g)(f_n->list(n)[n0], y[n0]), ∀ n0. n0 < # f_n->list(n) → dom(g)(f_n->list(n)[n0]) ⊦ |
ii(n) + # f_n->list(n) = ii(n + 1) + 1, f_n->list(n).last = nf(n + 1), f_n->list(n) = nf(n) ' + y, ii(0) = 0, f_n->list(n) ≠ [], n2 + ii(n) < ii(n + 1), ii(n) < ii(n + 1), nf(n) ∈ f_n->list(n), ¬ edge(g)(nf0(n2 + ii(n)), nf0((n2 + ii(n)) + 1)), n2 + 1 < # f_n->list(n) → nf0((n2 + 1) + ii(n)) = y[n2], n2 < # f_n->list(n) → nf0(n2 + ii(n)) = f_n->list(n)[n2], n2 + 1 < # f_n->list(n) → edge(g)(f_n->list(n)[n2], y[n2]), ∀ n0. n0 < # f_n->list(n) → dom(g)(f_n->list(n)[n0]), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n) ⊦
Used terms: n2
| ii(n) + # f_n->list(n) = ii(n + 1) + 1, f_n->list(n).last = nf(n + 1), f_n->list(n) = nf(n) ' + y, ii(0) = 0, f_n->list(n) ≠ [], n2 + ii(n) < ii(n + 1), ii(n) < ii(n + 1), nf(n) ∈ f_n->list(n), ¬ edge(g)(nf0(n2 + ii(n)), nf0((n2 + ii(n)) + 1)), n2 + 1 < # f_n->list(n) → nf0((n2 + 1) + ii(n)) = y[n2], n2 < # f_n->list(n) → nf0(n2 + ii(n)) = f_n->list(n)[n2], n2 + 1 < # f_n->list(n) → edge(g)(f_n->list(n)[n2], y[n2]), ∀ n0. n0 < # f_n->list(n) → dom(g)(f_n->list(n)[n0]), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n) ⊦ |
ii(n) + # f_n->list(n) = ii(n + 1) + 1, f_n->list(n).last = nf(n + 1), f_n->list(n) = nf(n) ' + y, ii(0) = 0, f_n->list(n) ≠ [], ii(n) < ii(n + 1), n2 + ii(n) < ii(n + 1), nf(n) ∈ f_n->list(n), ¬ n2 + 1 < # f_n->list(n), ¬ edge(g)(nf0(n2 + ii(n)), nf0((n2 + ii(n)) + 1)), n2 + 1 < # f_n->list(n) → edge(g)(f_n->list(n)[n2], y[n2]), n2 < # f_n->list(n) → nf0(n2 + ii(n)) = f_n->list(n)[n2], n2 + 1 < # f_n->list(n) → nf0((n2 + 1) + ii(n)) = y[n2], ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ n0. n0 < # f_n->list(n) → dom(g)(f_n->list(n)[n0]) ⊦
Used simplifier rules: f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic ⊦ # x = 0 ↔ x = []; (s) ⊦ ¬ m < n → ¬ m + m0 < n; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic Used formulas: n2 + 1 < # f_n->list(n)
| ii(n) + # f_n->list(n) = ii(n + 1) + 1, f_n->list(n).last = nf(n + 1), f_n->list(n) = nf(n) ' + y, ii(0) = 0, f_n->list(n) ≠ [], ii(n) < ii(n + 1), n2 + ii(n) < ii(n + 1), nf(n) ∈ f_n->list(n), ¬ n2 + 1 < # f_n->list(n), ¬ edge(g)(nf0(n2 + ii(n)), nf0((n2 + ii(n)) + 1)), n2 + 1 < # f_n->list(n) → edge(g)(f_n->list(n)[n2], y[n2]), n2 < # f_n->list(n) → nf0(n2 + ii(n)) = f_n->list(n)[n2], n2 + 1 < # f_n->list(n) → nf0((n2 + 1) + ii(n)) = y[n2], ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ n0. n0 < # f_n->list(n) → dom(g)(f_n->list(n)[n0]) ⊦ |
ii(n) + # f_n->list(n) = ii(n + 1) + 1, f_n->list(n).last = nf(n + 1), f_n->list(n) = nf(n) ' + y, ii(0) = 0, f_n->list(n) ≠ [], n2 + ii(n) < ii(n + 1), ii(n) < ii(n + 1), nf(n) ∈ f_n->list(n), # f_n->list(n) ≤ n2 + 1, ¬ edge(g)(nf0(n2 + ii(n)), nf0((n2 + ii(n)) + 1)), n2 < # f_n->list(n) → nf0(n2 + ii(n)) = f_n->list(n)[n2], ∀ n0. n0 < # f_n->list(n) → dom(g)(f_n->list(n)[n0]), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n) ⊦
Used simplifier rules: ⊦ m ≤ n → (n < m ↔ false); (s) ⊦ m < n ↔ ¬ n ≤ m; (ss)
| ii(n) + # f_n->list(n) = ii(n + 1) + 1, f_n->list(n).last = nf(n + 1), f_n->list(n) = nf(n) ' + y, ii(0) = 0, f_n->list(n) ≠ [], n2 + ii(n) < ii(n + 1), ii(n) < ii(n + 1), nf(n) ∈ f_n->list(n), # f_n->list(n) ≤ n2 + 1, ¬ edge(g)(nf0(n2 + ii(n)), nf0((n2 + ii(n)) + 1)), n2 < # f_n->list(n) → nf0(n2 + ii(n)) = f_n->list(n)[n2], ∀ n0. n0 < # f_n->list(n) → dom(g)(f_n->list(n)[n0]), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n) ⊦ |
ii(n) + # f_n->list(n) = ii(n + 1) + 1, f_n->list(n).last = nf(n + 1), f_n->list(n) = nf(n) ' + y, ii(0) = 0, f_n->list(n) ≠ [], ii(n) < ii(n + 1), n2 + ii(n) < ii(n + 1), nf(n) ∈ f_n->list(n), # f_n->list(n) ≤ n2 + 1, ¬ n2 < # f_n->list(n), ¬ edge(g)(nf0(n2 + ii(n)), nf0((n2 + ii(n)) + 1)), n2 < # f_n->list(n) → nf0(n2 + ii(n)) = f_n->list(n)[n2], ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ n0. n0 < # f_n->list(n) → dom(g)(f_n->list(n)[n0]) ⊦
Used simplifier rules: eqle-one: ⊦ m = n + 1 ∧ n < n0 → m ≤ n0; (forward) from specification nat f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic ⊦ m + n = m + n0 ↔ n = n0; (s) ⊦ m + 1 ≠ 0; (s) ⊦ m < n → (n ≤ m + 1 ↔ n = m + 1); (s) ⊦ m + 1 ≤ n ↔ m < n; (s) ⊦ ¬ n < n; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic Used formulas: n2 < # f_n->list(n)
| ii(n) + # f_n->list(n) = ii(n + 1) + 1, f_n->list(n).last = nf(n + 1), f_n->list(n) = nf(n) ' + y, ii(0) = 0, f_n->list(n) ≠ [], ii(n) < ii(n + 1), n2 + ii(n) < ii(n + 1), nf(n) ∈ f_n->list(n), # f_n->list(n) ≤ n2 + 1, ¬ n2 < # f_n->list(n), ¬ edge(g)(nf0(n2 + ii(n)), nf0((n2 + ii(n)) + 1)), n2 < # f_n->list(n) → nf0(n2 + ii(n)) = f_n->list(n)[n2], ∀ m, n. m ≤ n → ii(m) ≤ ii(n), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ n0. n0 < # f_n->list(n) → dom(g)(f_n->list(n)[n0]) ⊦ |
ii(n) + # f_n->list(n) = ii(n + 1) + 1, f_n->list(n).last = nf(n + 1), f_n->list(n) = nf(n) ' + y, ii(0) = 0, f_n->list(n) ≠ [], n2 + ii(n) < ii(n + 1), ii(n) < ii(n + 1), nf(n) ∈ f_n->list(n), # f_n->list(n) ≤ n2 + 1, # f_n->list(n) ≤ n2, ¬ edge(g)(nf0(n2 + ii(n)), nf0((n2 + ii(n)) + 1)), ∀ n0. n0 < # f_n->list(n) → dom(g)(f_n->list(n)[n0]), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n) ⊦
Used simplifier rules: ⊦ m ≤ n → (n < m ↔ false); (s) ⊦ m < n ↔ ¬ n ≤ m; (ss)
| ii(n) + # f_n->list(n) = ii(n + 1) + 1, f_n->list(n).last = nf(n + 1), f_n->list(n) = nf(n) ' + y, ii(0) = 0, f_n->list(n) ≠ [], n2 + ii(n) < ii(n + 1), ii(n) < ii(n + 1), nf(n) ∈ f_n->list(n), # f_n->list(n) ≤ n2 + 1, # f_n->list(n) ≤ n2, ¬ edge(g)(nf0(n2 + ii(n)), nf0((n2 + ii(n)) + 1)), ∀ n0. n0 < # f_n->list(n) → dom(g)(f_n->list(n)[n0]), ∀ n. ls(g)(nf(n + 1), nf(n)), ∀ m, n. m ≤ n → ii(m) ≤ ii(n) ⊦ |
Used simplifier rules: ⊦ m + n = m + n0 ↔ n = n0; (s) ⊦ a ' + x ≠ []; (s) ⊦ m + n ≤ m + n0 ↔ n ≤ n0; (s) ⊦ m + 1 ≤ n ↔ m < n; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ m < n → m ≤ n; (s) ⊦ #(a ' + x) = (# x)+1; (s) ⊦ m +1 = m + 1; (s) ⊦ m < n + 1 ↔ ¬ n < m; (s) f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic ⊦ m < n → n ≠ 0; (s) ⊦ m < m + n ↔ n ≠ 0; (s) ⊦ # x = 0 ↔ x = []; (s) ⊦ x ≠ [] → (a ' + x).last = x.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list ⊦ m + n < m + n0 ↔ n < n0; (s) ⊦ m < n → ¬ n < m; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic
| findepth(g), ∀ n. ls(g)(nf(n + 1), nf(n)) ⊦ ∀ n. ∃ y. pathp(g)(⌜y⌝ ) ∧ y.head = nf(n) ∧ y ≠ [] ∧ y.last = nf(n + 1) |
findepth(g), ∀ n. ls(g)(nf(n + 1), nf(n)) ⊦ ∃ y. pathp(g)(⌜y⌝ ) ∧ y.head = nf(n) ∧ y ≠ [] ∧ y.last = nf(n + 1)
| findepth(g), ∀ n. ls(g)(nf(n + 1), nf(n)) ⊦ ∃ y. pathp(g)(⌜y⌝ ) ∧ y.head = nf(n) ∧ y ≠ [] ∧ y.last = nf(n + 1) |
findepth(g), ls(g)(nf(n + 1), nf(n)) ⊦ ∃ y. pathp(g)(⌜y⌝ ) ∧ y.head = nf(n) ∧ y ≠ [] ∧ y.last = nf(n + 1)
Used terms: n
| findepth(g), ls(g)(nf(n + 1), nf(n)) ⊦ ∃ y. pathp(g)(⌜y⌝ ) ∧ y.head = nf(n) ∧ y ≠ [] ∧ y.last = nf(n + 1) |
⊦ ls(g)(a, b) ↔ (∃ y. pathp(g)(⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ ))
findepth(g), ∃ y. pathp(g)(⌜nf(n) '⌝ + ⌜y⌝ + ⌜nf(n + 1) '⌝ ) ⊦ ∃ y. pathp(g)(⌜y⌝ ) ∧ y.head = nf(n) ∧ y ≠ [] ∧ y.last = nf(n + 1)
Used terms: nf(n), nf(n + 1), g
| ⊦ ls(g)(a, b) ↔ (∃ y. pathp(g)(⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )) |
| findepth(g), ∃ y. pathp(g)(⌜nf(n) '⌝ + ⌜y⌝ + ⌜nf(n + 1) '⌝ ) ⊦ ∃ y. pathp(g)(⌜y⌝ ) ∧ y.head = nf(n) ∧ y ≠ [] ∧ y.last = nf(n + 1) |
findepth(g), pathp(g)(⌜nf(n) '⌝ + ⌜y⌝ + ⌜nf(n + 1) '⌝ ) ⊦ ∃ y. pathp(g)(⌜y⌝ ) ∧ y.head = nf(n) ∧ y ≠ [] ∧ y.last = nf(n + 1)
| findepth(g), pathp(g)(⌜nf(n) '⌝ + ⌜y⌝ + ⌜nf(n + 1) '⌝ ) ⊦ ∃ y. pathp(g)(⌜y⌝ ) ∧ y.head = nf(n) ∧ y ≠ [] ∧ y.last = nf(n + 1) |
Used simplifier rules: ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream ⊦ (a ' + x).head = a; (s) ⊦ a ' + x ≠ []; (s) ⊦ (a ' + x + b ').last = b; (s) a: ⊦ (x + y) + z = x + y + z; from specification list Used terms: nf(n) ' + y + nf(n + 1) '
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.