| rooted(g), findepth(g), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a) ⊦ eP(a) |
findepth(g), rooted(g), ¬ eP(a), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a) ⊦
| findepth(g), rooted(g), ¬ eP(a), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a) ⊦ |
findepth(g), rooted(g), ¬ eP(a), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n, a. ¬ eP(a) → (∃ y. pathp(g)(⌜a '⌝ + ⌜y⌝ ) ∧ y ≠ [] ∧ ¬ eP(y.last)) ⊦
findepth(g), rooted(g), ¬ eP(a), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a) ⊦ ∀ n, a. ¬ eP(a) → (∃ y. pathp(g)(⌜a '⌝ + ⌜y⌝ ) ∧ y ≠ [] ∧ ¬ eP(y.last))
Used formulas: ∀ n, a. ¬ eP(a) → (∃ y. pathp(g)(⌜a '⌝ + ⌜y⌝ ) ∧ y ≠ [] ∧ ¬ eP(y.last))
| findepth(g), rooted(g), ¬ eP(a), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n, a. ¬ eP(a) → (∃ y. pathp(g)(⌜a '⌝ + ⌜y⌝ ) ∧ y ≠ [] ∧ ¬ eP(y.last)) ⊦ |
findepth(g), rooted(g), ¬ eP(a), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a) ⊦
| findepth(g), rooted(g), ¬ eP(a), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a) ⊦ |
∀ n, a. nextl(n, a) ≠ [] ∧ nextl(n, a).head = a ⊦ ∃ σ, ii. ii(0) = 0 ∧ σ[0] = a ∧ σ ≠ [] ∧ (∀ n. ii(n + 1) = ii(n) + # nextl(n, σ[ii(n)]) - 1 ∧ ⌜ii(n + 1)⌝ < # σ ∧ (σ from ii(n)) to # nextl(n, σ[ii(n)]) = ⌜nextl(n, σ[ii(n)])⌝ ) ∧ (finp(σ) ⊃ ∃ n. # σ = ⌜ii(n) + 1⌝ ∧ (∀ m. n ≤ m → nextl(m, σ[ii(m)]) = σ[ii(m)] ' ∧ ii(n) = ii(m));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1))
findepth(g), rooted(g), ¬ eP(a), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∃ σ, ii. ii(0) = 0 ∧ σ[0] = a ∧ σ ≠ [] ∧ (∀ n. ii(n + 1) = ii(n) + #(σ[ii(n)] ' + f2_n_elem->list(n, σ[ii(n)])) - 1 ∧ ⌜ii(n + 1)⌝ < # σ ∧ (σ from ii(n)) to #(σ[ii(n)] ' + f2_n_elem->list(n, σ[ii(n)])) = ⌜σ[ii(n)] ' + f2_n_elem->list(n, σ[ii(n)])⌝ ) ∧ (finp(σ) ⊃ ∃ n. # σ = ⌜ii(n) + 1⌝ ∧ (∀ m. n ≤ m → σ[ii(m)] ' + f2_n_elem->list(m, σ[ii(m)]) = σ[ii(m)] ' ∧ ii(n) = ii(m)) ;∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1) ) ⊦
Used simplifier rules: ⊦ a ' + x ≠ []; (s) ⊦ (a ' + x).head = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list Used terms: λ n, a. a ' + f2_n_elem->list(n, a), a
| ∀ n, a. nextl(n, a) ≠ [] ∧ nextl(n, a).head = a ⊦ ∃ σ, ii. ii(0) = 0 ∧ σ[0] = a ∧ σ ≠ [] ∧ (∀ n. ii(n + 1) = ii(n) + # nextl(n, σ[ii(n)]) - 1 ∧ ⌜ii(n + 1)⌝ < # σ ∧ (σ from ii(n)) to # nextl(n, σ[ii(n)]) = ⌜nextl(n, σ[ii(n)])⌝ ) ∧ (finp(σ) ⊃ ∃ n. # σ = ⌜ii(n) + 1⌝ ∧ (∀ m. n ≤ m → nextl(m, σ[ii(m)]) = σ[ii(m)] ' ∧ ii(n) = ii(m));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)) |
| findepth(g), rooted(g), ¬ eP(a), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∃ σ, ii. ii(0) = 0 ∧ σ[0] = a ∧ σ ≠ [] ∧ (∀ n. ii(n + 1) = ii(n) + #(σ[ii(n)] ' + f2_n_elem->list(n, σ[ii(n)])) - 1 ∧ ⌜ii(n + 1)⌝ < # σ ∧ (σ from ii(n)) to #(σ[ii(n)] ' + f2_n_elem->list(n, σ[ii(n)])) = ⌜σ[ii(n)] ' + f2_n_elem->list(n, σ[ii(n)])⌝ ) ∧ (finp(σ) ⊃ ∃ n. # σ = ⌜ii(n) + 1⌝ ∧ (∀ m. n ≤ m → σ[ii(m)] ' + f2_n_elem->list(m, σ[ii(m)]) = σ[ii(m)] ' ∧ ii(n) = ii(m)) ;∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1) ) ⊦ |
ii(0) = 0, σ ≠ [], findepth(g), rooted(g), ¬ eP(σ[0]), (finp(σ) ⊃ # σ = ⌜ii(n)⌝ + ⌜1⌝ ∧ (∀ m. n ≤ m → f2_n_elem->list(m, σ[ii(m)]) = [] ∧ ii(n) = ii(m));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n. ii(n + 1) = ii(n) + # f2_n_elem->list(n, σ[ii(n)]) ∧ ⌜ii(n + 1)⌝ < # σ ∧ (σ from ii(n)) to # f2_n_elem->list(n, σ[ii(n)]) + 1 = ⌜σ[ii(n)] '⌝ + ⌜f2_n_elem->list(n, σ[ii(n)])⌝ ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list ⊦ x = x + y ↔ y = []; (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) ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) ⊦ m +1 = m + 1; (s) ⊦ #(a ' + x) = (# x)+1; (s) ⊦ n + 0 = n; (s) ⊦ n ≤ m → m + n0 - n = (m - n) + n0; (s)
| ii(0) = 0, σ ≠ [], findepth(g), rooted(g), ¬ eP(σ[0]), (finp(σ) ⊃ # σ = ⌜ii(n)⌝ + ⌜1⌝ ∧ (∀ m. n ≤ m → f2_n_elem->list(m, σ[ii(m)]) = [] ∧ ii(n) = ii(m));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n. ii(n + 1) = ii(n) + # f2_n_elem->list(n, σ[ii(n)]) ∧ ⌜ii(n + 1)⌝ < # σ ∧ (σ from ii(n)) to # f2_n_elem->list(n, σ[ii(n)]) + 1 = ⌜σ[ii(n)] '⌝ + ⌜f2_n_elem->list(n, σ[ii(n)])⌝ ⊦ |
ii(0) = 0, σ ≠ [], findepth(g), rooted(g), ¬ eP(σ[0]), (finp(σ) ⊃ # σ = ⌜ii(n)⌝ + ⌜1⌝ ∧ (∀ m. n ≤ m → f2_n_elem->list(m, σ[ii(m)]) = [] ∧ ii(n) = ii(m));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii(n + 1) = ii(n) + # f2_n_elem->list(n, σ[ii(n)]) ∧ ⌜ii(n + 1)⌝ < # σ ∧ (σ from ii(n)) to # f2_n_elem->list(n, σ[ii(n)]) + 1 = ⌜σ[ii(n)] '⌝ + ⌜f2_n_elem->list(n, σ[ii(n)])⌝ , ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ n. ¬ eP(σ[ii(n)]) ⊦
ii(0) = 0, σ ≠ [], findepth(g), rooted(g), ¬ eP(σ[0]), (finp(σ) ⊃ # σ = ⌜ii(n)⌝ + ⌜1⌝ ∧ (∀ m. n ≤ m → f2_n_elem->list(m, σ[ii(m)]) = [] ∧ ii(n) = ii(m));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii(n + 1) = ii(n) + # f2_n_elem->list(n, σ[ii(n)]) ∧ ⌜ii(n + 1)⌝ < # σ ∧ (σ from ii(n)) to # f2_n_elem->list(n, σ[ii(n)]) + 1 = ⌜σ[ii(n)] '⌝ + ⌜f2_n_elem->list(n, σ[ii(n)])⌝ , ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last) ⊦ ∀ n. ¬ eP(σ[ii(n)])
Used formulas: ∀ n. ¬ eP(σ[ii(n)])
| ii(0) = 0, σ ≠ [], findepth(g), rooted(g), ¬ eP(σ[0]), (finp(σ) ⊃ # σ = ⌜ii(n)⌝ + ⌜1⌝ ∧ (∀ m. n ≤ m → f2_n_elem->list(m, σ[ii(m)]) = [] ∧ ii(n) = ii(m));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii(n + 1) = ii(n) + # f2_n_elem->list(n, σ[ii(n)]) ∧ ⌜ii(n + 1)⌝ < # σ ∧ (σ from ii(n)) to # f2_n_elem->list(n, σ[ii(n)]) + 1 = ⌜σ[ii(n)] '⌝ + ⌜f2_n_elem->list(n, σ[ii(n)])⌝ , ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ n. ¬ eP(σ[ii(n)]) ⊦ |
ii(0) = 0, ⌜x⌝ ≠ [], findepth(g), rooted(g), ¬ eP(⌜x⌝ [0]), (finp(⌜x⌝ ) ⊃ # ⌜x⌝ = ⌜ii(n)⌝ + ⌜1⌝ ∧ (∀ m. n ≤ m → f2_n_elem->list(m, ⌜x⌝ [ii(m)]) = [] ∧ ii(n) = ii(m)) ;∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1) ), ∀ n. ¬ eP(⌜x⌝ [ii(n)]), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n. ii(n + 1) = ii(n) + # f2_n_elem->list(n, ⌜x⌝ [ii(n)]) ∧ ⌜ii(n + 1)⌝ < # ⌜x⌝ ∧ (⌜x⌝ from ii(n)) to # f2_n_elem->list(n, ⌜x⌝ [ii(n)]) + 1 = ⌜⌜x⌝ [ii(n)] '⌝ + ⌜f2_n_elem->list(n, ⌜x⌝ [ii(n)])⌝ ⊦
ii(0) = 0, ⌜f_n->elem⌝ ≠ [], findepth(g), rooted(g), ¬ eP(⌜f_n->elem⌝ [0]), (finp(⌜f_n->elem⌝ ) ⊃ # ⌜f_n->elem⌝ = ⌜ii(n)⌝ + ⌜1⌝ ∧ (∀ m. n ≤ m → f2_n_elem->list(m, ⌜f_n->elem⌝ [ii(m)]) = [] ∧ ii(n) = ii(m)) ;∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1) ), ∀ n. ¬ eP(⌜f_n->elem⌝ [ii(n)]), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n. ii(n + 1) = ii(n) + # f2_n_elem->list(n, ⌜f_n->elem⌝ [ii(n)]) ∧ ⌜ii(n + 1)⌝ < # ⌜f_n->elem⌝ ∧ (⌜f_n->elem⌝ from ii(n)) to # f2_n_elem->list(n, ⌜f_n->elem⌝ [ii(n)]) + 1 = ⌜⌜f_n->elem⌝ [ii(n)] '⌝ + ⌜f2_n_elem->list(n, ⌜f_n->elem⌝ [ii(n)])⌝ ⊦
Used simplifier rules: stream freely generated by ⌜ ⌝, ⌜ ⌝;;
| ii(0) = 0, ⌜x⌝ ≠ [], findepth(g), rooted(g), ¬ eP(⌜x⌝ [0]), (finp(⌜x⌝ ) ⊃ # ⌜x⌝ = ⌜ii(n)⌝ + ⌜1⌝ ∧ (∀ m. n ≤ m → f2_n_elem->list(m, ⌜x⌝ [ii(m)]) = [] ∧ ii(n) = ii(m)) ;∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1) ), ∀ n. ¬ eP(⌜x⌝ [ii(n)]), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n. ii(n + 1) = ii(n) + # f2_n_elem->list(n, ⌜x⌝ [ii(n)]) ∧ ⌜ii(n + 1)⌝ < # ⌜x⌝ ∧ (⌜x⌝ from ii(n)) to # f2_n_elem->list(n, ⌜x⌝ [ii(n)]) + 1 = ⌜⌜x⌝ [ii(n)] '⌝ + ⌜f2_n_elem->list(n, ⌜x⌝ [ii(n)])⌝ ⊦ |
ii(n) + 1 = # x, ii(0) = 0, x ≠ [], findepth(g), rooted(g), ¬ eP(x.head), ∀ n0. ii(n0 + 1) = ii(n0) + # f2_n_elem->list(n0, x[ii(n0)]) ∧ ii(n0 + 1) < # x ∧ x[ii(n0)] ' + f2_n_elem->list(n0, x[ii(n0)]) = (x from ii(n0)) to # f2_n_elem->list(n0, x[ii(n0)]) + 1, ∀ n0. ¬ eP(x[ii(n0)]), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ m. n ≤ m → f2_n_elem->list(m, x[ii(m)]) = [] ∧ ii(n) = ii(m) ⊦
Used simplifier rules: ⊦ ⌜x⌝ [n] = x[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⌝ + ⌜m⌝ = ⌜n0⌝ ↔ n + m = n0; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ finp(⌜x⌝ ); (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream ⊦ ⌜x⌝ + ⌜y⌝ = ⌜z⌝ ↔ x + y = z; (s) ⊦ ⌜x⌝ to n = ⌜x to n⌝ ; (s) ⊦ ⌜x⌝ from n = ⌜x from n⌝ ; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ x ≠ [] → x[0] = x.head; (s) ⊦ ⌜x⌝ = [] ↔ x = []; (s)
| ii(n) + 1 = # x, ii(0) = 0, x ≠ [], findepth(g), rooted(g), ¬ eP(x.head), ∀ n0. ii(n0 + 1) = ii(n0) + # f2_n_elem->list(n0, x[ii(n0)]) ∧ ii(n0 + 1) < # x ∧ x[ii(n0)] ' + f2_n_elem->list(n0, x[ii(n0)]) = (x from ii(n0)) to # f2_n_elem->list(n0, x[ii(n0)]) + 1, ∀ n0. ¬ eP(x[ii(n0)]), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ m. n ≤ m → f2_n_elem->list(m, x[ii(m)]) = [] ∧ ii(n) = ii(m) ⊦ |
ii(n) + 1 = # x, ii(0) = 0, x = a1 + y, x ≠ [], findepth(g), rooted(g), ¬ eP(a1), ∀ m. n ≤ m → f2_n_elem->list(m, x[ii(m)]) = [] ∧ ii(n) = ii(m), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n0. ¬ eP(x[ii(n0)]), ∀ n0. ii(n0 + 1) = ii(n0) + # f2_n_elem->list(n0, x[ii(n0)]) ∧ ii(n0 + 1) < # x ∧ x[ii(n0)] ' + f2_n_elem->list(n0, x[ii(n0)]) = (x from ii(n0)) to # f2_n_elem->list(n0, x[ii(n0)]) + 1 ⊦
Used simplifier rules: x ≠ [] ⊦ a = x.head ∧ y = x.tail ↔ x = a + y; (elim) Used terms: x, a1, y
| ii(n) + 1 = # x, ii(0) = 0, x = a1 + y, x ≠ [], findepth(g), rooted(g), ¬ eP(a1), ∀ m. n ≤ m → f2_n_elem->list(m, x[ii(m)]) = [] ∧ ii(n) = ii(m), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n0. ¬ eP(x[ii(n0)]), ∀ n0. ii(n0 + 1) = ii(n0) + # f2_n_elem->list(n0, x[ii(n0)]) ∧ ii(n0 + 1) < # x ∧ x[ii(n0)] ' + f2_n_elem->list(n0, x[ii(n0)]) = (x from ii(n0)) to # f2_n_elem->list(n0, x[ii(n0)]) + 1 ⊦ |
ii(0) = 0, ii(n) = # y, findepth(g), rooted(g), ¬ eP(a1), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ n0. ii(n0 + 1) = ii(n0) + # f2_n_elem->list(n0, (a1 ' + y)[ii(n0)]) ∧ ¬ # y < ii(n0 + 1) ∧ (a1 ' + y)[ii(n0)] ' + f2_n_elem->list(n0, (a1 ' + y)[ii(n0)]) = (a1 ' + y from ii(n0)) to # f2_n_elem->list(n0, (a1 ' + y)[ii(n0)]) + 1, ∀ n0. ¬ eP((a1 ' + y)[ii(n0)]), ∀ m. n ≤ m → f2_n_elem->list(m, (a1 ' + y)[ii(m)]) = [] ∧ # y = ii(m) ⊦
Used simplifier rules: ⊦ a + x = a ' + x; (s) 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) a: ⊦ (x + y) + z = x + y + z; from specification list ⊦ m +1 = m + 1; (s) ⊦ #(a ' + x) = (# x)+1; (s) ⊦ a ' + x ≠ []; (s) ⊦ m + n = m + n0 ↔ n = n0; (s)
| ii(0) = 0, ii(n) = # y, findepth(g), rooted(g), ¬ eP(a1), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ n0. ii(n0 + 1) = ii(n0) + # f2_n_elem->list(n0, (a1 ' + y)[ii(n0)]) ∧ ¬ # y < ii(n0 + 1) ∧ (a1 ' + y)[ii(n0)] ' + f2_n_elem->list(n0, (a1 ' + y)[ii(n0)]) = (a1 ' + y from ii(n0)) to # f2_n_elem->list(n0, (a1 ' + y)[ii(n0)]) + 1, ∀ n0. ¬ eP((a1 ' + y)[ii(n0)]), ∀ m. n ≤ m → f2_n_elem->list(m, (a1 ' + y)[ii(m)]) = [] ∧ # y = ii(m) ⊦ |
ii(n) = # y, ii(0) = 0, findepth(g), rooted(g), ¬ eP(a1), n ≤ n → f2_n_elem->list(n, (a1 ' + y)[ii(n)]) = [] ∧ # y = ii(n), ∀ m. n ≤ m → f2_n_elem->list(m, (a1 ' + y)[ii(m)]) = [] ∧ # y = ii(m), ∀ n0. ¬ eP((a1 ' + y)[ii(n0)]), ∀ n0. ii(n0 + 1) = ii(n0) + # f2_n_elem->list(n0, (a1 ' + y)[ii(n0)]) ∧ ¬ # y < ii(n0 + 1) ∧ (a1 ' + y)[ii(n0)] ' + f2_n_elem->list(n0, (a1 ' + y)[ii(n0)]) = (a1 ' + y from ii(n0)) to # f2_n_elem->list(n0, (a1 ' + y)[ii(n0)]) + 1, ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a) ⊦
Used terms: n
| ii(n) = # y, ii(0) = 0, findepth(g), rooted(g), ¬ eP(a1), n ≤ n → f2_n_elem->list(n, (a1 ' + y)[ii(n)]) = [] ∧ # y = ii(n), ∀ m. n ≤ m → f2_n_elem->list(m, (a1 ' + y)[ii(m)]) = [] ∧ # y = ii(m), ∀ n0. ¬ eP((a1 ' + y)[ii(n0)]), ∀ n0. ii(n0 + 1) = ii(n0) + # f2_n_elem->list(n0, (a1 ' + y)[ii(n0)]) ∧ ¬ # y < ii(n0 + 1) ∧ (a1 ' + y)[ii(n0)] ' + f2_n_elem->list(n0, (a1 ' + y)[ii(n0)]) = (a1 ' + y from ii(n0)) to # f2_n_elem->list(n0, (a1 ' + y)[ii(n0)]) + 1, ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a) ⊦ |
f2_n_elem->list(n, (a1 ' + y)[# y]) = [], ii(0) = 0, ii(n) = # y, findepth(g), rooted(g), ¬ eP(a1), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ n0. ii(n0 + 1) = ii(n0) + # f2_n_elem->list(n0, (a1 ' + y)[ii(n0)]) ∧ ¬ # y < ii(n0 + 1) ∧ (a1 ' + y)[ii(n0)] ' + f2_n_elem->list(n0, (a1 ' + y)[ii(n0)]) = (a1 ' + y from ii(n0)) to # f2_n_elem->list(n0, (a1 ' + y)[ii(n0)]) + 1, ∀ n0. ¬ eP((a1 ' + y)[ii(n0)]), ∀ m. n ≤ m → f2_n_elem->list(m, (a1 ' + y)[ii(m)]) = [] ∧ # y = ii(m) ⊦
Used simplifier rules: ⊦ m ≤ m; (s)
| f2_n_elem->list(n, (a1 ' + y)[# y]) = [], ii(0) = 0, ii(n) = # y, findepth(g), rooted(g), ¬ eP(a1), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ n0. ii(n0 + 1) = ii(n0) + # f2_n_elem->list(n0, (a1 ' + y)[ii(n0)]) ∧ ¬ # y < ii(n0 + 1) ∧ (a1 ' + y)[ii(n0)] ' + f2_n_elem->list(n0, (a1 ' + y)[ii(n0)]) = (a1 ' + y from ii(n0)) to # f2_n_elem->list(n0, (a1 ' + y)[ii(n0)]) + 1, ∀ n0. ¬ eP((a1 ' + y)[ii(n0)]), ∀ m. n ≤ m → f2_n_elem->list(m, (a1 ' + y)[ii(m)]) = [] ∧ # y = ii(m) ⊦ |
f2_n_elem->list(n, (a1 ' + y)[# y]) = [], ii(n) = # y, ii(0) = 0, findepth(g), rooted(g), ¬ eP(a1), ¬ eP((a1 ' + y)[# y]) → pathp(g)(⌜(a1 ' + y)[# y] '⌝ + ⌜f2_n_elem->list(n, (a1 ' + y)[# y])⌝ ) ∧ f2_n_elem->list(n, (a1 ' + y)[# y]) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, (a1 ' + y)[# y]).last), ∀ m. n ≤ m → f2_n_elem->list(m, (a1 ' + y)[ii(m)]) = [] ∧ # y = ii(m), ∀ n0. ¬ eP((a1 ' + y)[ii(n0)]), ∀ n0. ii(n0 + 1) = ii(n0) + # f2_n_elem->list(n0, (a1 ' + y)[ii(n0)]) ∧ ¬ # y < ii(n0 + 1) ∧ (a1 ' + y)[ii(n0)] ' + f2_n_elem->list(n0, (a1 ' + y)[ii(n0)]) = (a1 ' + y from ii(n0)) to # f2_n_elem->list(n0, (a1 ' + y)[ii(n0)]) + 1, ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a) ⊦
Used terms: n, (a1 ' + y)[# y]
| f2_n_elem->list(n, (a1 ' + y)[# y]) = [], ii(n) = # y, ii(0) = 0, findepth(g), rooted(g), ¬ eP(a1), ¬ eP((a1 ' + y)[# y]) → pathp(g)(⌜(a1 ' + y)[# y] '⌝ + ⌜f2_n_elem->list(n, (a1 ' + y)[# y])⌝ ) ∧ f2_n_elem->list(n, (a1 ' + y)[# y]) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, (a1 ' + y)[# y]).last), ∀ m. n ≤ m → f2_n_elem->list(m, (a1 ' + y)[ii(m)]) = [] ∧ # y = ii(m), ∀ n0. ¬ eP((a1 ' + y)[ii(n0)]), ∀ n0. ii(n0 + 1) = ii(n0) + # f2_n_elem->list(n0, (a1 ' + y)[ii(n0)]) ∧ ¬ # y < ii(n0 + 1) ∧ (a1 ' + y)[ii(n0)] ' + f2_n_elem->list(n0, (a1 ' + y)[ii(n0)]) = (a1 ' + y from ii(n0)) to # f2_n_elem->list(n0, (a1 ' + y)[ii(n0)]) + 1, ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a) ⊦ |
f2_n_elem->list(n, (a1 ' + y)[# y]) = [], ii(0) = 0, ii(n) = # y, eP((a1 ' + y)[# y]), findepth(g), rooted(g), ¬ eP(a1), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ n0. ii(n0 + 1) = ii(n0) + # f2_n_elem->list(n0, (a1 ' + y)[ii(n0)]) ∧ ¬ # y < ii(n0 + 1) ∧ (a1 ' + y)[ii(n0)] ' + f2_n_elem->list(n0, (a1 ' + y)[ii(n0)]) = (a1 ' + y from ii(n0)) to # f2_n_elem->list(n0, (a1 ' + y)[ii(n0)]) + 1, ∀ n0. ¬ eP((a1 ' + y)[ii(n0)]), ∀ m. n ≤ m → f2_n_elem->list(m, (a1 ' + y)[ii(m)]) = [] ∧ # y = ii(m) ⊦
| f2_n_elem->list(n, (a1 ' + y)[# y]) = [], ii(0) = 0, ii(n) = # y, eP((a1 ' + y)[# y]), findepth(g), rooted(g), ¬ eP(a1), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ n0. ii(n0 + 1) = ii(n0) + # f2_n_elem->list(n0, (a1 ' + y)[ii(n0)]) ∧ ¬ # y < ii(n0 + 1) ∧ (a1 ' + y)[ii(n0)] ' + f2_n_elem->list(n0, (a1 ' + y)[ii(n0)]) = (a1 ' + y from ii(n0)) to # f2_n_elem->list(n0, (a1 ' + y)[ii(n0)]) + 1, ∀ n0. ¬ eP((a1 ' + y)[ii(n0)]), ∀ m. n ≤ m → f2_n_elem->list(m, (a1 ' + y)[ii(m)]) = [] ∧ # y = ii(m) ⊦ |
Used terms: n
| ii(0) = 0, ⌜f_n->elem⌝ ≠ [], findepth(g), rooted(g), ¬ eP(⌜f_n->elem⌝ [0]), (finp(⌜f_n->elem⌝ ) ⊃ # ⌜f_n->elem⌝ = ⌜ii(n)⌝ + ⌜1⌝ ∧ (∀ m. n ≤ m → f2_n_elem->list(m, ⌜f_n->elem⌝ [ii(m)]) = [] ∧ ii(n) = ii(m)) ;∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1) ), ∀ n. ¬ eP(⌜f_n->elem⌝ [ii(n)]), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n. ii(n + 1) = ii(n) + # f2_n_elem->list(n, ⌜f_n->elem⌝ [ii(n)]) ∧ ⌜ii(n + 1)⌝ < # ⌜f_n->elem⌝ ∧ (⌜f_n->elem⌝ from ii(n)) to # f2_n_elem->list(n, ⌜f_n->elem⌝ [ii(n)]) + 1 = ⌜⌜f_n->elem⌝ [ii(n)] '⌝ + ⌜f2_n_elem->list(n, ⌜f_n->elem⌝ [ii(n)])⌝ ⊦ |
ii(0) = 0, findepth(g), rooted(g), ¬ eP(f_n->elem(0)), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ n0. ii(n0 + 1) = ii(n0) + # f2_n_elem->list(n0, f_n->elem(ii(n0))) ∧ f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))) = (f_n->elem from ii(n0)) to # f2_n_elem->list(n0, f_n->elem(ii(n0))) + 1, ∀ n0. ¬ eP(f_n->elem(ii(n0))), ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1) ⊦
Used simplifier rules: ⊦ ¬ finp(⌜nf⌝ ); (s) ⊦ ⌜nf⌝ [n] = nf(n); (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream ⊦ ⌜x⌝ + ⌜y⌝ = ⌜z⌝ ↔ x + y = z; (s) ⊦ ⌜nf⌝ to n = ⌜nf to n⌝ ; (s) ⊦ ⌜nf⌝ from n = ⌜nf from n⌝ ; (s) ⊦ ⌜m⌝ < ∞; (s) ⊦ # ⌜nf⌝ = ∞; (s) ⊦ [] ≠ ⌜nf⌝ ; (s)
| ii(0) = 0, findepth(g), rooted(g), ¬ eP(f_n->elem(0)), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ n0. ii(n0 + 1) = ii(n0) + # f2_n_elem->list(n0, f_n->elem(ii(n0))) ∧ f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))) = (f_n->elem from ii(n0)) to # f2_n_elem->list(n0, f_n->elem(ii(n0))) + 1, ∀ n0. ¬ eP(f_n->elem(ii(n0))), ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1) ⊦ |
⊦ findepth(g) ↔ (∀ σ. pathp(g)(σ) → # σ ≠ ∞)
ii(0) = 0, rooted(g), ¬ eP(f_n->elem(0)), ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n0. ¬ eP(f_n->elem(ii(n0))), ∀ n0. ii(n0 + 1) = ii(n0) + # f2_n_elem->list(n0, f_n->elem(ii(n0))) ∧ f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))) = (f_n->elem from ii(n0)) to # f2_n_elem->list(n0, f_n->elem(ii(n0))) + 1, ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ σ. pathp(g)(σ) → # σ ≠ ∞ ⊦
Used terms: g
| ⊦ findepth(g) ↔ (∀ σ. pathp(g)(σ) → # σ ≠ ∞) |
| ii(0) = 0, rooted(g), ¬ eP(f_n->elem(0)), ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n0. ¬ eP(f_n->elem(ii(n0))), ∀ n0. ii(n0 + 1) = ii(n0) + # f2_n_elem->list(n0, f_n->elem(ii(n0))) ∧ f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))) = (f_n->elem from ii(n0)) to # f2_n_elem->list(n0, f_n->elem(ii(n0))) + 1, ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ σ. pathp(g)(σ) → # σ ≠ ∞ ⊦ |
ii(0) = 0, rooted(g), ¬ eP(f_n->elem(0)), pathp(g)(⌜f_n->elem⌝ ) → # ⌜f_n->elem⌝ ≠ ∞, ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ n0. ii(n0 + 1) = ii(n0) + # f2_n_elem->list(n0, f_n->elem(ii(n0))) ∧ f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))) = (f_n->elem from ii(n0)) to # f2_n_elem->list(n0, f_n->elem(ii(n0))) + 1, ∀ n0. ¬ eP(f_n->elem(ii(n0))), ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1) ⊦
Used terms: ⌜f_n->elem⌝
| ii(0) = 0, rooted(g), ¬ eP(f_n->elem(0)), pathp(g)(⌜f_n->elem⌝ ) → # ⌜f_n->elem⌝ ≠ ∞, ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ n0. ii(n0 + 1) = ii(n0) + # f2_n_elem->list(n0, f_n->elem(ii(n0))) ∧ f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))) = (f_n->elem from ii(n0)) to # f2_n_elem->list(n0, f_n->elem(ii(n0))) + 1, ∀ n0. ¬ eP(f_n->elem(ii(n0))), ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1) ⊦ |
ii(0) = 0, rooted(g), ¬ eP(f_n->elem(0)), ¬ pathp(g)(⌜f_n->elem⌝ ), ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n0. ¬ eP(f_n->elem(ii(n0))), ∀ n0. ii(n0 + 1) = ii(n0) + # f2_n_elem->list(n0, f_n->elem(ii(n0))) ∧ f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))) = (f_n->elem from ii(n0)) to # f2_n_elem->list(n0, f_n->elem(ii(n0))) + 1, ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a) ⊦
Used simplifier rules: ⊦ # ⌜nf⌝ = ∞; (s)
| ii(0) = 0, rooted(g), ¬ eP(f_n->elem(0)), ¬ pathp(g)(⌜f_n->elem⌝ ), ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n0. ¬ eP(f_n->elem(ii(n0))), ∀ n0. ii(n0 + 1) = ii(n0) + # f2_n_elem->list(n0, f_n->elem(ii(n0))) ∧ f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))) = (f_n->elem from ii(n0)) to # f2_n_elem->list(n0, f_n->elem(ii(n0))) + 1, ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a) ⊦ |
⊦ pathp(g)(σ) ↔ (∀ n. ⌜n⌝ < # σ → dom(g)(σ[n])) ∧ (∀ n. ⌜n + 1⌝ < # σ → edge(g)(σ[n], σ[n + 1]))
ii(0) = 0, rooted(g), ¬ eP(f_n->elem(0)), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ n0. ii(n0 + 1) = ii(n0) + # f2_n_elem->list(n0, f_n->elem(ii(n0))) ∧ f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))) = (f_n->elem from ii(n0)) to # f2_n_elem->list(n0, f_n->elem(ii(n0))) + 1, ∀ n0. ¬ eP(f_n->elem(ii(n0))), ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), (∃ n. ¬(⌜n⌝ < # ⌜f_n->elem⌝ → dom(g)(⌜f_n->elem⌝ [n]))) ∨ (∃ n. ¬(⌜n + 1⌝ < # ⌜f_n->elem⌝ → edge(g)(⌜f_n->elem⌝ [n], ⌜f_n->elem⌝ [n + 1]))) ⊦
Used terms: ⌜f_n->elem⌝ , g
| ⊦ pathp(g)(σ) ↔ (∀ n. ⌜n⌝ < # σ → dom(g)(σ[n])) ∧ (∀ n. ⌜n + 1⌝ < # σ → edge(g)(σ[n], σ[n + 1])) |
| ii(0) = 0, rooted(g), ¬ eP(f_n->elem(0)), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ n0. ii(n0 + 1) = ii(n0) + # f2_n_elem->list(n0, f_n->elem(ii(n0))) ∧ f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))) = (f_n->elem from ii(n0)) to # f2_n_elem->list(n0, f_n->elem(ii(n0))) + 1, ∀ n0. ¬ eP(f_n->elem(ii(n0))), ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), (∃ n. ¬(⌜n⌝ < # ⌜f_n->elem⌝ → dom(g)(⌜f_n->elem⌝ [n]))) ∨ (∃ n. ¬(⌜n + 1⌝ < # ⌜f_n->elem⌝ → edge(g)(⌜f_n->elem⌝ [n], ⌜f_n->elem⌝ [n + 1]))) ⊦ |
ii(0) = 0, rooted(g), ¬ eP(f_n->elem(0)), ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n0. ¬ eP(f_n->elem(ii(n0))), ∀ n0. ii(n0 + 1) = ii(n0) + # f2_n_elem->list(n0, f_n->elem(ii(n0))) ∧ f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))) = (f_n->elem from ii(n0)) to # f2_n_elem->list(n0, f_n->elem(ii(n0))) + 1, ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ¬ dom(g)(f_n->elem(n)) ∨ ¬ edge(g)(f_n->elem(n0), f_n->elem(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, rooted(g), ¬ eP(f_n->elem(0)), ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1), ∀ n0. ¬ eP(f_n->elem(ii(n0))), ∀ n0. ii(n0 + 1) = ii(n0) + # f2_n_elem->list(n0, f_n->elem(ii(n0))) ∧ f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))) = (f_n->elem from ii(n0)) to # f2_n_elem->list(n0, f_n->elem(ii(n0))) + 1, ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ¬ dom(g)(f_n->elem(n)) ∨ ¬ edge(g)(f_n->elem(n0), f_n->elem(n0 + 1)) ⊦ |
ii(0) = 0, rooted(g), ¬ dom(g)(f_n->elem(n)), ¬ eP(f_n->elem(0)), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ n0. ii(n0 + 1) = ii(n0) + # f2_n_elem->list(n0, f_n->elem(ii(n0))) ∧ f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))) = (f_n->elem from ii(n0)) to # f2_n_elem->list(n0, f_n->elem(ii(n0))) + 1, ∀ n0. ¬ eP(f_n->elem(ii(n0))), ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1) ⊦
ii(0) = 0, rooted(g), ¬ eP(f_n->elem(0)), ¬ edge(g)(f_n->elem(n0), f_n->elem(n0 + 1)), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ n0. ii(n0 + 1) = ii(n0) + # f2_n_elem->list(n0, f_n->elem(ii(n0))) ∧ f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))) = (f_n->elem from ii(n0)) to # f2_n_elem->list(n0, f_n->elem(ii(n0))) + 1, ∀ n0. ¬ eP(f_n->elem(ii(n0))), ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1) ⊦
| ii(0) = 0, rooted(g), ¬ dom(g)(f_n->elem(n)), ¬ eP(f_n->elem(0)), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ n0. ii(n0 + 1) = ii(n0) + # f2_n_elem->list(n0, f_n->elem(ii(n0))) ∧ f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))) = (f_n->elem from ii(n0)) to # f2_n_elem->list(n0, f_n->elem(ii(n0))) + 1, ∀ n0. ¬ eP(f_n->elem(ii(n0))), ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1) ⊦ |
ii(0) = 0, rooted(g), ¬ dom(g)(f_n->elem(n)), ¬ eP(f_n->elem(0)), ∀ n0. ¬ eP(f_n->elem(ii(n0))), ∀ n0. ii(n0 + 1) = ii(n0) + # f2_n_elem->list(n0, f_n->elem(ii(n0))) ∧ f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))) = (f_n->elem from ii(n0)) to # f2_n_elem->list(n0, f_n->elem(ii(n0))) + 1, ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∃ m. ii(m) ≤ n ∧ n < ii(m + 1) ⊦
Used terms: n
| ii(0) = 0, rooted(g), ¬ dom(g)(f_n->elem(n)), ¬ eP(f_n->elem(0)), ∀ n0. ¬ eP(f_n->elem(ii(n0))), ∀ n0. ii(n0 + 1) = ii(n0) + # f2_n_elem->list(n0, f_n->elem(ii(n0))) ∧ f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))) = (f_n->elem from ii(n0)) to # f2_n_elem->list(n0, f_n->elem(ii(n0))) + 1, ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∃ m. ii(m) ≤ n ∧ n < ii(m + 1) ⊦ |
ii(0) = 0, ii(n0) < ii(n0 + 1), n < ii(n0 + 1), rooted(g), ii(n0) ≤ n, ¬ dom(g)(f_n->elem(n)), ¬ eP(f_n->elem(0)), ∀ n0. ¬ eP(f_n->elem(ii(n0))), ∀ n0. ii(n0 + 1) = ii(n0) + # f2_n_elem->list(n0, f_n->elem(ii(n0))) ∧ f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))) = (f_n->elem from ii(n0)) to # f2_n_elem->list(n0, f_n->elem(ii(n0))) + 1, ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a) ⊦
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), rooted(g), ii(n0) ≤ n, ¬ dom(g)(f_n->elem(n)), ¬ eP(f_n->elem(0)), ∀ n0. ¬ eP(f_n->elem(ii(n0))), ∀ n0. ii(n0 + 1) = ii(n0) + # f2_n_elem->list(n0, f_n->elem(ii(n0))) ∧ f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))) = (f_n->elem from ii(n0)) to # f2_n_elem->list(n0, f_n->elem(ii(n0))) + 1, ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a) ⊦ |
f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))) = (f_n->elem from ii(n0)) to # f2_n_elem->list(n0, f_n->elem(ii(n0))) + 1, ii(0) = 0, ii(n0 + 1) = ii(n0) + # f2_n_elem->list(n0, f_n->elem(ii(n0))), n < ii(n0 + 1), ii(n0) < ii(n0 + 1), rooted(g), ii(n0) ≤ n, ¬ dom(g)(f_n->elem(n)), ¬ eP(f_n->elem(0)), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ n0. ¬ eP(f_n->elem(ii(n0))) ⊦
Used terms: n0
| f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))) = (f_n->elem from ii(n0)) to # f2_n_elem->list(n0, f_n->elem(ii(n0))) + 1, ii(0) = 0, ii(n0 + 1) = ii(n0) + # f2_n_elem->list(n0, f_n->elem(ii(n0))), n < ii(n0 + 1), ii(n0) < ii(n0 + 1), rooted(g), ii(n0) ≤ n, ¬ dom(g)(f_n->elem(n)), ¬ eP(f_n->elem(0)), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ n0. ¬ eP(f_n->elem(ii(n0))) ⊦ |
f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))) = (f_n->elem from ii(n0)) to # f2_n_elem->list(n0, f_n->elem(ii(n0))) + 1, ii(n0 + 1) = ii(n0) + # f2_n_elem->list(n0, f_n->elem(ii(n0))), ii(0) = 0, f2_n_elem->list(n0, f_n->elem(ii(n0))) ≠ [], ii(n0) < ii(n0 + 1), n < ii(n0 + 1), rooted(g), ii(n0) ≤ n, ¬ dom(g)(f_n->elem(n)), ¬ eP(f_n->elem(0)), ∀ n0. ¬ eP(f_n->elem(ii(n0))), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a) ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ # x = 0 ↔ x = []; (s) ⊦ m < m + n ↔ n ≠ 0; (s) lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list
| f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))) = (f_n->elem from ii(n0)) to # f2_n_elem->list(n0, f_n->elem(ii(n0))) + 1, ii(n0 + 1) = ii(n0) + # f2_n_elem->list(n0, f_n->elem(ii(n0))), ii(0) = 0, f2_n_elem->list(n0, f_n->elem(ii(n0))) ≠ [], ii(n0) < ii(n0 + 1), n < ii(n0 + 1), rooted(g), ii(n0) ≤ n, ¬ dom(g)(f_n->elem(n)), ¬ eP(f_n->elem(0)), ∀ n0. ¬ eP(f_n->elem(ii(n0))), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a) ⊦ |
f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))) = (f_n->elem from ii(n0)) to # f2_n_elem->list(n0, f_n->elem(ii(n0))) + 1, ii(0) = 0, ii(n0 + 1) = ii(n0) + # f2_n_elem->list(n0, f_n->elem(ii(n0))), f2_n_elem->list(n0, f_n->elem(ii(n0))) ≠ [], n < ii(n0 + 1), ii(n0) < ii(n0 + 1), rooted(g), ii(n0) ≤ n, ¬ dom(g)(f_n->elem(n)), ¬ eP(f_n->elem(0)), ¬ eP(f_n->elem(ii(n0))) → pathp(g)(⌜f_n->elem(ii(n0)) '⌝ + ⌜f2_n_elem->list(n0, f_n->elem(ii(n0)))⌝ ) ∧ f2_n_elem->list(n0, f_n->elem(ii(n0))) ≠ [] ∧ ¬ eP(f2_n_elem->list(n0, f_n->elem(ii(n0))).last), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ n0. ¬ eP(f_n->elem(ii(n0))) ⊦
Used terms: n0, f_n->elem(ii(n0))
| f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))) = (f_n->elem from ii(n0)) to # f2_n_elem->list(n0, f_n->elem(ii(n0))) + 1, ii(0) = 0, ii(n0 + 1) = ii(n0) + # f2_n_elem->list(n0, f_n->elem(ii(n0))), f2_n_elem->list(n0, f_n->elem(ii(n0))) ≠ [], n < ii(n0 + 1), ii(n0) < ii(n0 + 1), rooted(g), ii(n0) ≤ n, ¬ dom(g)(f_n->elem(n)), ¬ eP(f_n->elem(0)), ¬ eP(f_n->elem(ii(n0))) → pathp(g)(⌜f_n->elem(ii(n0)) '⌝ + ⌜f2_n_elem->list(n0, f_n->elem(ii(n0)))⌝ ) ∧ f2_n_elem->list(n0, f_n->elem(ii(n0))) ≠ [] ∧ ¬ eP(f2_n_elem->list(n0, f_n->elem(ii(n0))).last), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ n0. ¬ eP(f_n->elem(ii(n0))) ⊦ |
f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))) = (f_n->elem from ii(n0)) to # f2_n_elem->list(n0, f_n->elem(ii(n0))) + 1, ii(n0 + 1) = ii(n0) + # f2_n_elem->list(n0, f_n->elem(ii(n0))), ii(0) = 0, f2_n_elem->list(n0, f_n->elem(ii(n0))) ≠ [], ii(n0) < ii(n0 + 1), n < ii(n0 + 1), rooted(g), ii(n0) ≤ n, ¬ dom(g)(f_n->elem(n)), ¬ eP(f_n->elem(0)), ¬ eP(f_n->elem(ii(n0))) → pathp(g)(⌜f_n->elem(ii(n0)) '⌝ + ⌜f2_n_elem->list(n0, f_n->elem(ii(n0)))⌝ ) ∧ ¬ eP(f2_n_elem->list(n0, f_n->elem(ii(n0))).last), ∀ n0. ¬ eP(f_n->elem(ii(n0))), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a) ⊦
| f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))) = (f_n->elem from ii(n0)) to # f2_n_elem->list(n0, f_n->elem(ii(n0))) + 1, ii(n0 + 1) = ii(n0) + # f2_n_elem->list(n0, f_n->elem(ii(n0))), ii(0) = 0, f2_n_elem->list(n0, f_n->elem(ii(n0))) ≠ [], ii(n0) < ii(n0 + 1), n < ii(n0 + 1), rooted(g), ii(n0) ≤ n, ¬ dom(g)(f_n->elem(n)), ¬ eP(f_n->elem(0)), ¬ eP(f_n->elem(ii(n0))) → pathp(g)(⌜f_n->elem(ii(n0)) '⌝ + ⌜f2_n_elem->list(n0, f_n->elem(ii(n0)))⌝ ) ∧ ¬ eP(f2_n_elem->list(n0, f_n->elem(ii(n0))).last), ∀ n0. ¬ eP(f_n->elem(ii(n0))), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a) ⊦ |
⊦ x = y ↔ # x = # y ∧ (∀ n. n < # x → x[n] = y[n])
#(f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0)))) = #((f_n->elem from ii(n0)) to 1 + # f2_n_elem->list(n0, f_n->elem(ii(n0)))), ii(0) = 0, ii(n0 + 1) = ii(n0) + # f2_n_elem->list(n0, f_n->elem(ii(n0))), f2_n_elem->list(n0, f_n->elem(ii(n0))) ≠ [], n < ii(n0 + 1), ii(n0) < ii(n0 + 1), rooted(g), ii(n0) ≤ n, ¬ dom(g)(f_n->elem(n)), ¬ eP(f_n->elem(0)), ¬ eP(f_n->elem(ii(n0))) → pathp(g)(⌜f_n->elem(ii(n0)) '⌝ + ⌜f2_n_elem->list(n0, f_n->elem(ii(n0)))⌝ ) ∧ ¬ eP(f2_n_elem->list(n0, f_n->elem(ii(n0))).last), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ n0. ¬ eP(f_n->elem(ii(n0))), ∀ n. n < #(f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0)))) → (f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))))[n] = ((f_n->elem from ii(n0)) to 1 + # f2_n_elem->list(n0, f_n->elem(ii(n0))))[n] ⊦
Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic Used terms: (f_n->elem from ii(n0)) to 1 + # f2_n_elem->list(n0, f_n->elem(ii(n0))), f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0)))
| ⊦ x = y ↔ # x = # y ∧ (∀ n. n < # x → x[n] = y[n]) |
| #(f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0)))) = #((f_n->elem from ii(n0)) to 1 + # f2_n_elem->list(n0, f_n->elem(ii(n0)))), ii(0) = 0, ii(n0 + 1) = ii(n0) + # f2_n_elem->list(n0, f_n->elem(ii(n0))), f2_n_elem->list(n0, f_n->elem(ii(n0))) ≠ [], n < ii(n0 + 1), ii(n0) < ii(n0 + 1), rooted(g), ii(n0) ≤ n, ¬ dom(g)(f_n->elem(n)), ¬ eP(f_n->elem(0)), ¬ eP(f_n->elem(ii(n0))) → pathp(g)(⌜f_n->elem(ii(n0)) '⌝ + ⌜f2_n_elem->list(n0, f_n->elem(ii(n0)))⌝ ) ∧ ¬ eP(f2_n_elem->list(n0, f_n->elem(ii(n0))).last), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ n0. ¬ eP(f_n->elem(ii(n0))), ∀ n. n < #(f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0)))) → (f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))))[n] = ((f_n->elem from ii(n0)) to 1 + # f2_n_elem->list(n0, f_n->elem(ii(n0))))[n] ⊦ |
ii(n0 + 1) = ii(n0) + # f2_n_elem->list(n0, f_n->elem(ii(n0))), ii(0) = 0, f2_n_elem->list(n0, f_n->elem(ii(n0))) ≠ [], ii(n0) < ii(n0 + 1), n < ii(n0 + 1), rooted(g), ii(n0) ≤ n, ¬ dom(g)(f_n->elem(n)), ¬ eP(f_n->elem(0)), ¬ eP(f_n->elem(ii(n0))) → pathp(g)(⌜f_n->elem(ii(n0)) '⌝ + ⌜f2_n_elem->list(n0, f_n->elem(ii(n0)))⌝ ) ∧ ¬ eP(f2_n_elem->list(n0, f_n->elem(ii(n0))).last), ∀ n0. ¬ eP(f_n->elem(ii(n0))), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n1. ¬ # f2_n_elem->list(n0, f_n->elem(ii(n0))) < n1 → (f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))))[n1] = f_n->elem(n1 + ii(n0)) ⊦
Used simplifier rules: ⊦ ((nf from n))(m) = nf(m + n); (s) m < n ⊦ (nf to n)[m] = nf(m); (s) 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) a: ⊦ (x + y) + z = x + y + z; from specification list ⊦ m +1 = m + 1; (s) ⊦ #(a ' + x) = (# x)+1; (s) ⊦ m + n = m + n0 ↔ n = n0; (s) ⊦ #(nf to n) = n; (s)
| ii(n0 + 1) = ii(n0) + # f2_n_elem->list(n0, f_n->elem(ii(n0))), ii(0) = 0, f2_n_elem->list(n0, f_n->elem(ii(n0))) ≠ [], ii(n0) < ii(n0 + 1), n < ii(n0 + 1), rooted(g), ii(n0) ≤ n, ¬ dom(g)(f_n->elem(n)), ¬ eP(f_n->elem(0)), ¬ eP(f_n->elem(ii(n0))) → pathp(g)(⌜f_n->elem(ii(n0)) '⌝ + ⌜f2_n_elem->list(n0, f_n->elem(ii(n0)))⌝ ) ∧ ¬ eP(f2_n_elem->list(n0, f_n->elem(ii(n0))).last), ∀ n0. ¬ eP(f_n->elem(ii(n0))), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n1. ¬ # f2_n_elem->list(n0, f_n->elem(ii(n0))) < n1 → (f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))))[n1] = f_n->elem(n1 + ii(n0)) ⊦ |
ii(0) = 0, ii(n0 + 1) = ii(n0) + # f2_n_elem->list(n0, f_n->elem(ii(n0))), f2_n_elem->list(n0, f_n->elem(ii(n0))) ≠ [], n < ii(n0 + 1), ii(n0) < ii(n0 + 1), rooted(g), ii(n0) ≤ n, ¬ dom(g)(f_n->elem(n)), ¬ eP(f_n->elem(ii(n0))), ¬ eP(f_n->elem(0)), ¬ eP(f_n->elem(ii(n0))) → pathp(g)(⌜f_n->elem(ii(n0)) '⌝ + ⌜f2_n_elem->list(n0, f_n->elem(ii(n0)))⌝ ) ∧ ¬ eP(f2_n_elem->list(n0, f_n->elem(ii(n0))).last), ∀ n1. ¬ # f2_n_elem->list(n0, f_n->elem(ii(n0))) < n1 → (f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))))[n1] = f_n->elem(n1 + ii(n0)), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ n0. ¬ eP(f_n->elem(ii(n0))) ⊦
Used terms: n0
| ii(0) = 0, ii(n0 + 1) = ii(n0) + # f2_n_elem->list(n0, f_n->elem(ii(n0))), f2_n_elem->list(n0, f_n->elem(ii(n0))) ≠ [], n < ii(n0 + 1), ii(n0) < ii(n0 + 1), rooted(g), ii(n0) ≤ n, ¬ dom(g)(f_n->elem(n)), ¬ eP(f_n->elem(ii(n0))), ¬ eP(f_n->elem(0)), ¬ eP(f_n->elem(ii(n0))) → pathp(g)(⌜f_n->elem(ii(n0)) '⌝ + ⌜f2_n_elem->list(n0, f_n->elem(ii(n0)))⌝ ) ∧ ¬ eP(f2_n_elem->list(n0, f_n->elem(ii(n0))).last), ∀ n1. ¬ # f2_n_elem->list(n0, f_n->elem(ii(n0))) < n1 → (f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))))[n1] = f_n->elem(n1 + ii(n0)), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ n0. ¬ eP(f_n->elem(ii(n0))) ⊦ |
ii(n0 + 1) = ii(n0) + # f2_n_elem->list(n0, f_n->elem(ii(n0))), ii(0) = 0, f2_n_elem->list(n0, f_n->elem(ii(n0))) ≠ [], ii(n0) < ii(n0 + 1), n < ii(n0 + 1), pathp(g)(⌜f_n->elem(ii(n0)) '⌝ + ⌜f2_n_elem->list(n0, f_n->elem(ii(n0)))⌝ ), rooted(g), ii(n0) ≤ n, ¬ dom(g)(f_n->elem(n)), ¬ eP(f_n->elem(ii(n0))), ¬ eP(f_n->elem(0)), ¬ eP(f2_n_elem->list(n0, f_n->elem(ii(n0))).last), ∀ n0. ¬ eP(f_n->elem(ii(n0))), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n1. ¬ # f2_n_elem->list(n0, f_n->elem(ii(n0))) < n1 → (f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))))[n1] = f_n->elem(n1 + ii(n0)) ⊦
| ii(n0 + 1) = ii(n0) + # f2_n_elem->list(n0, f_n->elem(ii(n0))), ii(0) = 0, f2_n_elem->list(n0, f_n->elem(ii(n0))) ≠ [], ii(n0) < ii(n0 + 1), n < ii(n0 + 1), pathp(g)(⌜f_n->elem(ii(n0)) '⌝ + ⌜f2_n_elem->list(n0, f_n->elem(ii(n0)))⌝ ), rooted(g), ii(n0) ≤ n, ¬ dom(g)(f_n->elem(n)), ¬ eP(f_n->elem(ii(n0))), ¬ eP(f_n->elem(0)), ¬ eP(f2_n_elem->list(n0, f_n->elem(ii(n0))).last), ∀ n0. ¬ eP(f_n->elem(ii(n0))), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n1. ¬ # f2_n_elem->list(n0, f_n->elem(ii(n0))) < n1 → (f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))))[n1] = f_n->elem(n1 + ii(n0)) ⊦ |
⊦ pathp(g)(σ) ↔ (∀ n. ⌜n⌝ < # σ → dom(g)(σ[n])) ∧ (∀ n. ⌜n + 1⌝ < # σ → edge(g)(σ[n], σ[n + 1]))
ii(0) = 0, ii(n0 + 1) = ii(n0) + # f2_n_elem->list(n0, f_n->elem(ii(n0))), f2_n_elem->list(n0, f_n->elem(ii(n0))) ≠ [], n < ii(n0 + 1), ii(n0) < ii(n0 + 1), rooted(g), ii(n0) ≤ n, ¬ dom(g)(f_n->elem(n)), ¬ eP(f_n->elem(ii(n0))), ¬ eP(f_n->elem(0)), ¬ eP(f2_n_elem->list(n0, f_n->elem(ii(n0))).last), ∀ n1. ¬ # f2_n_elem->list(n0, f_n->elem(ii(n0))) < n1 → (f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))))[n1] = f_n->elem(n1 + ii(n0)), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ n0. ¬ eP(f_n->elem(ii(n0))), ∀ n. ⌜n⌝ < #(⌜f_n->elem(ii(n0)) '⌝ + ⌜f2_n_elem->list(n0, f_n->elem(ii(n0)))⌝ ) → dom(g)((⌜f_n->elem(ii(n0)) '⌝ + ⌜f2_n_elem->list(n0, f_n->elem(ii(n0)))⌝ )[n]), ∀ n. ⌜n + 1⌝ < #(⌜f_n->elem(ii(n0)) '⌝ + ⌜f2_n_elem->list(n0, f_n->elem(ii(n0)))⌝ ) → edge(g) ((⌜f_n->elem(ii(n0)) '⌝ + ⌜f2_n_elem->list(n0, f_n->elem(ii(n0)))⌝ )[n], (⌜f_n->elem(ii(n0)) '⌝ + ⌜f2_n_elem->list(n0, f_n->elem(ii(n0)))⌝ )[n + 1]) ⊦
Used terms: ⌜f_n->elem(ii(n0)) '⌝ + ⌜f2_n_elem->list(n0, f_n->elem(ii(n0)))⌝ , g
| ⊦ pathp(g)(σ) ↔ (∀ n. ⌜n⌝ < # σ → dom(g)(σ[n])) ∧ (∀ n. ⌜n + 1⌝ < # σ → edge(g)(σ[n], σ[n + 1])) |
| ii(0) = 0, ii(n0 + 1) = ii(n0) + # f2_n_elem->list(n0, f_n->elem(ii(n0))), f2_n_elem->list(n0, f_n->elem(ii(n0))) ≠ [], n < ii(n0 + 1), ii(n0) < ii(n0 + 1), rooted(g), ii(n0) ≤ n, ¬ dom(g)(f_n->elem(n)), ¬ eP(f_n->elem(ii(n0))), ¬ eP(f_n->elem(0)), ¬ eP(f2_n_elem->list(n0, f_n->elem(ii(n0))).last), ∀ n1. ¬ # f2_n_elem->list(n0, f_n->elem(ii(n0))) < n1 → (f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))))[n1] = f_n->elem(n1 + ii(n0)), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ n0. ¬ eP(f_n->elem(ii(n0))), ∀ n. ⌜n⌝ < #(⌜f_n->elem(ii(n0)) '⌝ + ⌜f2_n_elem->list(n0, f_n->elem(ii(n0)))⌝ ) → dom(g)((⌜f_n->elem(ii(n0)) '⌝ + ⌜f2_n_elem->list(n0, f_n->elem(ii(n0)))⌝ )[n]), ∀ n. ⌜n + 1⌝ < #(⌜f_n->elem(ii(n0)) '⌝ + ⌜f2_n_elem->list(n0, f_n->elem(ii(n0)))⌝ ) → edge(g) ((⌜f_n->elem(ii(n0)) '⌝ + ⌜f2_n_elem->list(n0, f_n->elem(ii(n0)))⌝ )[n], (⌜f_n->elem(ii(n0)) '⌝ + ⌜f2_n_elem->list(n0, f_n->elem(ii(n0)))⌝ )[n + 1]) ⊦ |
ii(n0 + 1) = ii(n0) + # f2_n_elem->list(n0, f_n->elem(ii(n0))), ii(0) = 0, f2_n_elem->list(n0, f_n->elem(ii(n0))) ≠ [], ii(n0) < ii(n0 + 1), n < ii(n0 + 1), rooted(g), ii(n0) ≤ n, ¬ dom(g)(f_n->elem(n)), ¬ eP(f_n->elem(ii(n0))), ¬ eP(f_n->elem(0)), ¬ eP(f2_n_elem->list(n0, f_n->elem(ii(n0))).last), ∀ n0. ¬ eP(f_n->elem(ii(n0))), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n1. ¬ # f2_n_elem->list(n0, f_n->elem(ii(n0))) < n1 → (f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))))[n1] = f_n->elem(n1 + ii(n0)), ∀ n1. n1 < # f2_n_elem->list(n0, f_n->elem(ii(n0))) → edge(g)((f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))))[n1], f2_n_elem->list(n0, f_n->elem(ii(n0)))[n1]), ∀ n1. ¬ # f2_n_elem->list(n0, f_n->elem(ii(n0))) < n1 → dom(g)((f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))))[n1]) ⊦
Used simplifier rules: append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream ⊦ (⌜x⌝ + ⌜x0⌝ )[m] = (x + x0)[m]; (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 ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ ⌜n⌝ < ⌜1⌝ + n∞ ↔ ¬ n∞ < ⌜n⌝ ; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ # a ' = 0 +1; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ (⌜a '⌝ + σ)[n + 1] = σ[n]; (s) ⊦ n∞ + ⌜0⌝ = n∞; (s) ⊦ m ≤ n → (⌜(* m)⌝ + n∞2 < ⌜(* n)⌝ + n∞1 ↔ n∞2 < ⌜n - m⌝ + n∞1); (s) ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s)
| ii(n0 + 1) = ii(n0) + # f2_n_elem->list(n0, f_n->elem(ii(n0))), ii(0) = 0, f2_n_elem->list(n0, f_n->elem(ii(n0))) ≠ [], ii(n0) < ii(n0 + 1), n < ii(n0 + 1), rooted(g), ii(n0) ≤ n, ¬ dom(g)(f_n->elem(n)), ¬ eP(f_n->elem(ii(n0))), ¬ eP(f_n->elem(0)), ¬ eP(f2_n_elem->list(n0, f_n->elem(ii(n0))).last), ∀ n0. ¬ eP(f_n->elem(ii(n0))), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n1. ¬ # f2_n_elem->list(n0, f_n->elem(ii(n0))) < n1 → (f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))))[n1] = f_n->elem(n1 + ii(n0)), ∀ n1. n1 < # f2_n_elem->list(n0, f_n->elem(ii(n0))) → edge(g)((f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))))[n1], f2_n_elem->list(n0, f_n->elem(ii(n0)))[n1]), ∀ n1. ¬ # f2_n_elem->list(n0, f_n->elem(ii(n0))) < n1 → dom(g)((f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))))[n1]) ⊦ |
ii(0) = 0, ii(n0 + 1) = ii(n0) + # f2_n_elem->list(n0, f_n->elem(ii(n0))), f2_n_elem->list(n0, f_n->elem(ii(n0))) ≠ [], n < ii(n0 + 1), ii(n0) < ii(n0 + 1), rooted(g), ii(n0) ≤ n, ¬ dom(g)(f_n->elem(n)), ¬ eP(f_n->elem(ii(n0))), ¬ eP(f_n->elem(0)), ¬ eP(f2_n_elem->list(n0, f_n->elem(ii(n0))).last), ¬ # f2_n_elem->list(n0, f_n->elem(ii(n0))) < n - ii(n0) → (f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))))[n - ii(n0)] = f_n->elem((n - ii(n0)) + ii(n0)), ∀ n1. ¬ # f2_n_elem->list(n0, f_n->elem(ii(n0))) < n1 → dom(g)((f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))))[n1]), ∀ n1. n1 < # f2_n_elem->list(n0, f_n->elem(ii(n0))) → edge(g)((f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))))[n1], f2_n_elem->list(n0, f_n->elem(ii(n0)))[n1]), ∀ n1. ¬ # f2_n_elem->list(n0, f_n->elem(ii(n0))) < n1 → (f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))))[n1] = f_n->elem(n1 + ii(n0)), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ n0. ¬ eP(f_n->elem(ii(n0))) ⊦
Used terms: n - ii(n0)
| ii(0) = 0, ii(n0 + 1) = ii(n0) + # f2_n_elem->list(n0, f_n->elem(ii(n0))), f2_n_elem->list(n0, f_n->elem(ii(n0))) ≠ [], n < ii(n0 + 1), ii(n0) < ii(n0 + 1), rooted(g), ii(n0) ≤ n, ¬ dom(g)(f_n->elem(n)), ¬ eP(f_n->elem(ii(n0))), ¬ eP(f_n->elem(0)), ¬ eP(f2_n_elem->list(n0, f_n->elem(ii(n0))).last), ¬ # f2_n_elem->list(n0, f_n->elem(ii(n0))) < n - ii(n0) → (f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))))[n - ii(n0)] = f_n->elem((n - ii(n0)) + ii(n0)), ∀ n1. ¬ # f2_n_elem->list(n0, f_n->elem(ii(n0))) < n1 → dom(g)((f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))))[n1]), ∀ n1. n1 < # f2_n_elem->list(n0, f_n->elem(ii(n0))) → edge(g)((f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))))[n1], f2_n_elem->list(n0, f_n->elem(ii(n0)))[n1]), ∀ n1. ¬ # f2_n_elem->list(n0, f_n->elem(ii(n0))) < n1 → (f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))))[n1] = f_n->elem(n1 + ii(n0)), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ n0. ¬ eP(f_n->elem(ii(n0))) ⊦ |
(f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))))[n - ii(n0)] = f_n->elem((n - ii(n0)) + ii(n0)), ii(0) = 0, ii(n0 + 1) = ii(n0) + # f2_n_elem->list(n0, f_n->elem(ii(n0))), f2_n_elem->list(n0, f_n->elem(ii(n0))) ≠ [], n < ii(n0 + 1), ii(n0) < ii(n0 + 1), rooted(g), ii(n0) ≤ n, ¬ dom(g)(f_n->elem(n)), ¬ eP(f2_n_elem->list(n0, f_n->elem(ii(n0))).last), ¬ eP(f_n->elem(0)), ¬ eP(f_n->elem(ii(n0))), ∀ n1. ¬ # f2_n_elem->list(n0, f_n->elem(ii(n0))) < n1 → dom(g)((f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))))[n1]), ∀ n1. n1 < # f2_n_elem->list(n0, f_n->elem(ii(n0))) → edge(g)((f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))))[n1], f2_n_elem->list(n0, f_n->elem(ii(n0)))[n1]), ∀ n1. ¬ # f2_n_elem->list(n0, f_n->elem(ii(n0))) < n1 → (f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))))[n1] = f_n->elem(n1 + ii(n0)), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ n0. ¬ eP(f_n->elem(ii(n0))) ⊦
Used simplifier rules: ⊦ m < n → ¬ n < m; (s) c: ⊦ m + n = n + m; from specification nat-basic n0 ≤ n ⊦ m < n - n0 ↔ m + n0 < n; (s) ⊦ m ≤ n → (n < m ↔ false); (s) ⊦ m ≤ n ↔ ¬ n < m; (ss)
| (f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))))[n - ii(n0)] = f_n->elem((n - ii(n0)) + ii(n0)), ii(0) = 0, ii(n0 + 1) = ii(n0) + # f2_n_elem->list(n0, f_n->elem(ii(n0))), f2_n_elem->list(n0, f_n->elem(ii(n0))) ≠ [], n < ii(n0 + 1), ii(n0) < ii(n0 + 1), rooted(g), ii(n0) ≤ n, ¬ dom(g)(f_n->elem(n)), ¬ eP(f2_n_elem->list(n0, f_n->elem(ii(n0))).last), ¬ eP(f_n->elem(0)), ¬ eP(f_n->elem(ii(n0))), ∀ n1. ¬ # f2_n_elem->list(n0, f_n->elem(ii(n0))) < n1 → dom(g)((f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))))[n1]), ∀ n1. n1 < # f2_n_elem->list(n0, f_n->elem(ii(n0))) → edge(g)((f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))))[n1], f2_n_elem->list(n0, f_n->elem(ii(n0)))[n1]), ∀ n1. ¬ # f2_n_elem->list(n0, f_n->elem(ii(n0))) < n1 → (f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))))[n1] = f_n->elem(n1 + ii(n0)), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ n0. ¬ eP(f_n->elem(ii(n0))) ⊦ |
(f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))))[n2] = f_n->elem(n2 + ii(n0)), ii(n0 + 1) = ii(n0) + # f2_n_elem->list(n0, f_n->elem(ii(n0))), ii(0) = 0, n = n2 + ii(n0), f2_n_elem->list(n0, f_n->elem(ii(n0))) ≠ [], ii(n0) < ii(n0 + 1), n < ii(n0 + 1), rooted(g), ii(n0) ≤ n, ¬ dom(g)(f_n->elem(n)), ¬ eP(f2_n_elem->list(n0, f_n->elem(ii(n0))).last), ¬ eP(f_n->elem(0)), ¬ eP(f_n->elem(ii(n0))), ∀ n0. ¬ eP(f_n->elem(ii(n0))), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n1. ¬ # f2_n_elem->list(n0, f_n->elem(ii(n0))) < n1 → (f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))))[n1] = f_n->elem(n1 + ii(n0)), ∀ n1. n1 < # f2_n_elem->list(n0, f_n->elem(ii(n0))) → edge(g)((f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))))[n1], f2_n_elem->list(n0, f_n->elem(ii(n0)))[n1]), ∀ n1. ¬ # f2_n_elem->list(n0, f_n->elem(ii(n0))) < n1 → dom(g)((f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))))[n1]) ⊦
Used simplifier rules: n ≤ m ⊦ n0 = m - n ↔ m = n0 + n; (elim) Used terms: n, ii(n0), n2
| (f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))))[n2] = f_n->elem(n2 + ii(n0)), ii(n0 + 1) = ii(n0) + # f2_n_elem->list(n0, f_n->elem(ii(n0))), ii(0) = 0, n = n2 + ii(n0), f2_n_elem->list(n0, f_n->elem(ii(n0))) ≠ [], ii(n0) < ii(n0 + 1), n < ii(n0 + 1), rooted(g), ii(n0) ≤ n, ¬ dom(g)(f_n->elem(n)), ¬ eP(f2_n_elem->list(n0, f_n->elem(ii(n0))).last), ¬ eP(f_n->elem(0)), ¬ eP(f_n->elem(ii(n0))), ∀ n0. ¬ eP(f_n->elem(ii(n0))), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n1. ¬ # f2_n_elem->list(n0, f_n->elem(ii(n0))) < n1 → (f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))))[n1] = f_n->elem(n1 + ii(n0)), ∀ n1. n1 < # f2_n_elem->list(n0, f_n->elem(ii(n0))) → edge(g)((f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))))[n1], f2_n_elem->list(n0, f_n->elem(ii(n0)))[n1]), ∀ n1. ¬ # f2_n_elem->list(n0, f_n->elem(ii(n0))) < n1 → dom(g)((f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))))[n1]) ⊦ |
(f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))))[n2] = f_n->elem(n2 + ii(n0)), ii(0) = 0, ii(n0 + 1) = ii(n0) + # f2_n_elem->list(n0, f_n->elem(ii(n0))), f2_n_elem->list(n0, f_n->elem(ii(n0))) ≠ [], n2 < # f2_n_elem->list(n0, f_n->elem(ii(n0))), ii(n0) < ii(n0 + 1), rooted(g), ¬ dom(g)(f_n->elem(n2 + ii(n0))), ¬ eP(f2_n_elem->list(n0, f_n->elem(ii(n0))).last), ¬ eP(f_n->elem(0)), ¬ eP(f_n->elem(ii(n0))), ∀ n1. ¬ # f2_n_elem->list(n0, f_n->elem(ii(n0))) < n1 → dom(g)((f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))))[n1]), ∀ n1. n1 < # f2_n_elem->list(n0, f_n->elem(ii(n0))) → edge(g)((f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))))[n1], f2_n_elem->list(n0, f_n->elem(ii(n0)))[n1]), ∀ n1. ¬ # f2_n_elem->list(n0, f_n->elem(ii(n0))) < n1 → (f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))))[n1] = f_n->elem(n1 + ii(n0)), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ n0. ¬ eP(f_n->elem(ii(n0))) ⊦
Used simplifier rules: ⊦ # x = 0 ↔ x = []; (s) f: ⊦ m < n → n ≠ 0; (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 = m0 + n0 ∧ n < n0 → m0 + n < m; (s) ⊦ m + n < m + n0 ↔ n < n0; (s) lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic ⊦ m ≤ m + n; (s)
| (f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))))[n2] = f_n->elem(n2 + ii(n0)), ii(0) = 0, ii(n0 + 1) = ii(n0) + # f2_n_elem->list(n0, f_n->elem(ii(n0))), f2_n_elem->list(n0, f_n->elem(ii(n0))) ≠ [], n2 < # f2_n_elem->list(n0, f_n->elem(ii(n0))), ii(n0) < ii(n0 + 1), rooted(g), ¬ dom(g)(f_n->elem(n2 + ii(n0))), ¬ eP(f2_n_elem->list(n0, f_n->elem(ii(n0))).last), ¬ eP(f_n->elem(0)), ¬ eP(f_n->elem(ii(n0))), ∀ n1. ¬ # f2_n_elem->list(n0, f_n->elem(ii(n0))) < n1 → dom(g)((f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))))[n1]), ∀ n1. n1 < # f2_n_elem->list(n0, f_n->elem(ii(n0))) → edge(g)((f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))))[n1], f2_n_elem->list(n0, f_n->elem(ii(n0)))[n1]), ∀ n1. ¬ # f2_n_elem->list(n0, f_n->elem(ii(n0))) < n1 → (f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))))[n1] = f_n->elem(n1 + ii(n0)), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ n0. ¬ eP(f_n->elem(ii(n0))) ⊦ |
Used simplifier rules: ⊦ m < n → ¬ n < m; (s) Used terms: n2
| ii(0) = 0, rooted(g), ¬ eP(f_n->elem(0)), ¬ edge(g)(f_n->elem(n0), f_n->elem(n0 + 1)), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ n0. ii(n0 + 1) = ii(n0) + # f2_n_elem->list(n0, f_n->elem(ii(n0))) ∧ f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))) = (f_n->elem from ii(n0)) to # f2_n_elem->list(n0, f_n->elem(ii(n0))) + 1, ∀ n0. ¬ eP(f_n->elem(ii(n0))), ∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1) ⊦ |
ii(0) = 0, rooted(g), ¬ eP(f_n->elem(0)), ¬ edge(g)(f_n->elem(n0), f_n->elem(n0 + 1)), ∀ n0. ¬ eP(f_n->elem(ii(n0))), ∀ n0. ii(n0 + 1) = ii(n0) + # f2_n_elem->list(n0, f_n->elem(ii(n0))) ∧ f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))) = (f_n->elem from ii(n0)) to # f2_n_elem->list(n0, f_n->elem(ii(n0))) + 1, ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∃ m. ii(m) ≤ n0 ∧ n0 < ii(m + 1) ⊦
Used terms: n0
| ii(0) = 0, rooted(g), ¬ eP(f_n->elem(0)), ¬ edge(g)(f_n->elem(n0), f_n->elem(n0 + 1)), ∀ n0. ¬ eP(f_n->elem(ii(n0))), ∀ n0. ii(n0 + 1) = ii(n0) + # f2_n_elem->list(n0, f_n->elem(ii(n0))) ∧ f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))) = (f_n->elem from ii(n0)) to # f2_n_elem->list(n0, f_n->elem(ii(n0))) + 1, ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∃ m. ii(m) ≤ n0 ∧ n0 < ii(m + 1) ⊦ |
ii(0) = 0, ii(n) < ii(n + 1), n0 < ii(n + 1), rooted(g), ii(n) ≤ n0, ¬ eP(f_n->elem(0)), ¬ edge(g)(f_n->elem(n0), f_n->elem(n0 + 1)), ∀ n0. ¬ eP(f_n->elem(ii(n0))), ∀ n0. ii(n0 + 1) = ii(n0) + # f2_n_elem->list(n0, f_n->elem(ii(n0))) ∧ f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))) = (f_n->elem from ii(n0)) to # f2_n_elem->list(n0, f_n->elem(ii(n0))) + 1, ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a) ⊦
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), rooted(g), ii(n) ≤ n0, ¬ eP(f_n->elem(0)), ¬ edge(g)(f_n->elem(n0), f_n->elem(n0 + 1)), ∀ n0. ¬ eP(f_n->elem(ii(n0))), ∀ n0. ii(n0 + 1) = ii(n0) + # f2_n_elem->list(n0, f_n->elem(ii(n0))) ∧ f_n->elem(ii(n0)) ' + f2_n_elem->list(n0, f_n->elem(ii(n0))) = (f_n->elem from ii(n0)) to # f2_n_elem->list(n0, f_n->elem(ii(n0))) + 1, ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a) ⊦ |
f_n->elem(ii(n)) ' + f2_n_elem->list(n, f_n->elem(ii(n))) = (f_n->elem from ii(n)) to # f2_n_elem->list(n, f_n->elem(ii(n))) + 1, ii(0) = 0, ii(n + 1) = ii(n) + # f2_n_elem->list(n, f_n->elem(ii(n))), n0 < ii(n + 1), ii(n) < ii(n + 1), rooted(g), ii(n) ≤ n0, ¬ eP(f_n->elem(0)), ¬ edge(g)(f_n->elem(n0), f_n->elem(n0 + 1)), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ n0. ¬ eP(f_n->elem(ii(n0))) ⊦
Used terms: n
| f_n->elem(ii(n)) ' + f2_n_elem->list(n, f_n->elem(ii(n))) = (f_n->elem from ii(n)) to # f2_n_elem->list(n, f_n->elem(ii(n))) + 1, ii(0) = 0, ii(n + 1) = ii(n) + # f2_n_elem->list(n, f_n->elem(ii(n))), n0 < ii(n + 1), ii(n) < ii(n + 1), rooted(g), ii(n) ≤ n0, ¬ eP(f_n->elem(0)), ¬ edge(g)(f_n->elem(n0), f_n->elem(n0 + 1)), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ n0. ¬ eP(f_n->elem(ii(n0))) ⊦ |
f_n->elem(ii(n)) ' + f2_n_elem->list(n, f_n->elem(ii(n))) = (f_n->elem from ii(n)) to # f2_n_elem->list(n, f_n->elem(ii(n))) + 1, ii(n + 1) = ii(n) + # f2_n_elem->list(n, f_n->elem(ii(n))), ii(0) = 0, f2_n_elem->list(n, f_n->elem(ii(n))) ≠ [], ii(n) < ii(n + 1), n0 < ii(n + 1), rooted(g), ii(n) ≤ n0, ¬ eP(f_n->elem(0)), ¬ edge(g)(f_n->elem(n0), f_n->elem(n0 + 1)), ∀ n0. ¬ eP(f_n->elem(ii(n0))), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a) ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ # x = 0 ↔ x = []; (s) ⊦ m < m + n ↔ n ≠ 0; (s) lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list
| f_n->elem(ii(n)) ' + f2_n_elem->list(n, f_n->elem(ii(n))) = (f_n->elem from ii(n)) to # f2_n_elem->list(n, f_n->elem(ii(n))) + 1, ii(n + 1) = ii(n) + # f2_n_elem->list(n, f_n->elem(ii(n))), ii(0) = 0, f2_n_elem->list(n, f_n->elem(ii(n))) ≠ [], ii(n) < ii(n + 1), n0 < ii(n + 1), rooted(g), ii(n) ≤ n0, ¬ eP(f_n->elem(0)), ¬ edge(g)(f_n->elem(n0), f_n->elem(n0 + 1)), ∀ n0. ¬ eP(f_n->elem(ii(n0))), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a) ⊦ |
f_n->elem(ii(n)) ' + f2_n_elem->list(n, f_n->elem(ii(n))) = (f_n->elem from ii(n)) to # f2_n_elem->list(n, f_n->elem(ii(n))) + 1, ii(0) = 0, ii(n + 1) = ii(n) + # f2_n_elem->list(n, f_n->elem(ii(n))), f2_n_elem->list(n, f_n->elem(ii(n))) ≠ [], n0 < ii(n + 1), ii(n) < ii(n + 1), rooted(g), ii(n) ≤ n0, ¬ eP(f_n->elem(0)), ¬ edge(g)(f_n->elem(n0), f_n->elem(n0 + 1)), ¬ eP(f_n->elem(ii(n))) → pathp(g)(⌜f_n->elem(ii(n)) '⌝ + ⌜f2_n_elem->list(n, f_n->elem(ii(n)))⌝ ) ∧ f2_n_elem->list(n, f_n->elem(ii(n))) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, f_n->elem(ii(n))).last), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n0. ¬ eP(f_n->elem(ii(n0))) ⊦
Used terms: n, f_n->elem(ii(n))
| f_n->elem(ii(n)) ' + f2_n_elem->list(n, f_n->elem(ii(n))) = (f_n->elem from ii(n)) to # f2_n_elem->list(n, f_n->elem(ii(n))) + 1, ii(0) = 0, ii(n + 1) = ii(n) + # f2_n_elem->list(n, f_n->elem(ii(n))), f2_n_elem->list(n, f_n->elem(ii(n))) ≠ [], n0 < ii(n + 1), ii(n) < ii(n + 1), rooted(g), ii(n) ≤ n0, ¬ eP(f_n->elem(0)), ¬ edge(g)(f_n->elem(n0), f_n->elem(n0 + 1)), ¬ eP(f_n->elem(ii(n))) → pathp(g)(⌜f_n->elem(ii(n)) '⌝ + ⌜f2_n_elem->list(n, f_n->elem(ii(n)))⌝ ) ∧ f2_n_elem->list(n, f_n->elem(ii(n))) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, f_n->elem(ii(n))).last), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n0. ¬ eP(f_n->elem(ii(n0))) ⊦ |
f_n->elem(ii(n)) ' + f2_n_elem->list(n, f_n->elem(ii(n))) = (f_n->elem from ii(n)) to # f2_n_elem->list(n, f_n->elem(ii(n))) + 1, ii(n + 1) = ii(n) + # f2_n_elem->list(n, f_n->elem(ii(n))), ii(0) = 0, f2_n_elem->list(n, f_n->elem(ii(n))) ≠ [], ii(n) < ii(n + 1), n0 < ii(n + 1), rooted(g), ii(n) ≤ n0, ¬ eP(f_n->elem(0)), ¬ edge(g)(f_n->elem(n0), f_n->elem(n0 + 1)), ¬ eP(f_n->elem(ii(n))) → pathp(g)(⌜f_n->elem(ii(n)) '⌝ + ⌜f2_n_elem->list(n, f_n->elem(ii(n)))⌝ ) ∧ ¬ eP(f2_n_elem->list(n, f_n->elem(ii(n))).last), ∀ n0. ¬ eP(f_n->elem(ii(n0))), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a) ⊦
| f_n->elem(ii(n)) ' + f2_n_elem->list(n, f_n->elem(ii(n))) = (f_n->elem from ii(n)) to # f2_n_elem->list(n, f_n->elem(ii(n))) + 1, ii(n + 1) = ii(n) + # f2_n_elem->list(n, f_n->elem(ii(n))), ii(0) = 0, f2_n_elem->list(n, f_n->elem(ii(n))) ≠ [], ii(n) < ii(n + 1), n0 < ii(n + 1), rooted(g), ii(n) ≤ n0, ¬ eP(f_n->elem(0)), ¬ edge(g)(f_n->elem(n0), f_n->elem(n0 + 1)), ¬ eP(f_n->elem(ii(n))) → pathp(g)(⌜f_n->elem(ii(n)) '⌝ + ⌜f2_n_elem->list(n, f_n->elem(ii(n)))⌝ ) ∧ ¬ eP(f2_n_elem->list(n, f_n->elem(ii(n))).last), ∀ n0. ¬ eP(f_n->elem(ii(n0))), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a) ⊦ |
f_n->elem(ii(n)) ' + f2_n_elem->list(n, f_n->elem(ii(n))) = (f_n->elem from ii(n)) to # f2_n_elem->list(n, f_n->elem(ii(n))) + 1, ii(0) = 0, ii(n + 1) = ii(n) + # f2_n_elem->list(n, f_n->elem(ii(n))), f2_n_elem->list(n, f_n->elem(ii(n))) ≠ [], n0 < ii(n + 1), ii(n) < ii(n + 1), rooted(g), ii(n) ≤ n0, ¬ eP(f_n->elem(ii(n))), ¬ eP(f_n->elem(0)), ¬ edge(g)(f_n->elem(n0), f_n->elem(n0 + 1)), ¬ eP(f_n->elem(ii(n))) → pathp(g)(⌜f_n->elem(ii(n)) '⌝ + ⌜f2_n_elem->list(n, f_n->elem(ii(n)))⌝ ) ∧ ¬ eP(f2_n_elem->list(n, f_n->elem(ii(n))).last), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a) ⊦
Used terms: n
| f_n->elem(ii(n)) ' + f2_n_elem->list(n, f_n->elem(ii(n))) = (f_n->elem from ii(n)) to # f2_n_elem->list(n, f_n->elem(ii(n))) + 1, ii(0) = 0, ii(n + 1) = ii(n) + # f2_n_elem->list(n, f_n->elem(ii(n))), f2_n_elem->list(n, f_n->elem(ii(n))) ≠ [], n0 < ii(n + 1), ii(n) < ii(n + 1), rooted(g), ii(n) ≤ n0, ¬ eP(f_n->elem(ii(n))), ¬ eP(f_n->elem(0)), ¬ edge(g)(f_n->elem(n0), f_n->elem(n0 + 1)), ¬ eP(f_n->elem(ii(n))) → pathp(g)(⌜f_n->elem(ii(n)) '⌝ + ⌜f2_n_elem->list(n, f_n->elem(ii(n)))⌝ ) ∧ ¬ eP(f2_n_elem->list(n, f_n->elem(ii(n))).last), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a) ⊦ |
f_n->elem(ii(n)) ' + f2_n_elem->list(n, f_n->elem(ii(n))) = (f_n->elem from ii(n)) to # f2_n_elem->list(n, f_n->elem(ii(n))) + 1, ii(n + 1) = ii(n) + # f2_n_elem->list(n, f_n->elem(ii(n))), ii(0) = 0, f2_n_elem->list(n, f_n->elem(ii(n))) ≠ [], ii(n) < ii(n + 1), n0 < ii(n + 1), pathp(g)(⌜f_n->elem(ii(n)) '⌝ + ⌜f2_n_elem->list(n, f_n->elem(ii(n)))⌝ ), rooted(g), ii(n) ≤ n0, ¬ eP(f_n->elem(ii(n))), ¬ eP(f_n->elem(0)), ¬ eP(f2_n_elem->list(n, f_n->elem(ii(n))).last), ¬ edge(g)(f_n->elem(n0), f_n->elem(n0 + 1)), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a) ⊦
| f_n->elem(ii(n)) ' + f2_n_elem->list(n, f_n->elem(ii(n))) = (f_n->elem from ii(n)) to # f2_n_elem->list(n, f_n->elem(ii(n))) + 1, ii(n + 1) = ii(n) + # f2_n_elem->list(n, f_n->elem(ii(n))), ii(0) = 0, f2_n_elem->list(n, f_n->elem(ii(n))) ≠ [], ii(n) < ii(n + 1), n0 < ii(n + 1), pathp(g)(⌜f_n->elem(ii(n)) '⌝ + ⌜f2_n_elem->list(n, f_n->elem(ii(n)))⌝ ), rooted(g), ii(n) ≤ n0, ¬ eP(f_n->elem(ii(n))), ¬ eP(f_n->elem(0)), ¬ eP(f2_n_elem->list(n, f_n->elem(ii(n))).last), ¬ edge(g)(f_n->elem(n0), f_n->elem(n0 + 1)), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a) ⊦ |
⊦ x = y ↔ # x = # y ∧ (∀ n. n < # x → x[n] = y[n])
#(f_n->elem(ii(n)) ' + f2_n_elem->list(n, f_n->elem(ii(n)))) = #((f_n->elem from ii(n)) to 1 + # f2_n_elem->list(n, f_n->elem(ii(n)))), ii(0) = 0, ii(n + 1) = ii(n) + # f2_n_elem->list(n, f_n->elem(ii(n))), f2_n_elem->list(n, f_n->elem(ii(n))) ≠ [], n0 < ii(n + 1), ii(n) < ii(n + 1), pathp(g)(⌜f_n->elem(ii(n)) '⌝ + ⌜f2_n_elem->list(n, f_n->elem(ii(n)))⌝ ), rooted(g), ii(n) ≤ n0, ¬ eP(f_n->elem(ii(n))), ¬ eP(f_n->elem(0)), ¬ eP(f2_n_elem->list(n, f_n->elem(ii(n))).last), ¬ edge(g)(f_n->elem(n0), f_n->elem(n0 + 1)), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n0. n0 < #(f_n->elem(ii(n)) ' + f2_n_elem->list(n, f_n->elem(ii(n)))) → (f_n->elem(ii(n)) ' + f2_n_elem->list(n, f_n->elem(ii(n))))[n0] = ((f_n->elem from ii(n)) to 1 + # f2_n_elem->list(n, f_n->elem(ii(n))))[n0] ⊦
Used simplifier rules: c: ⊦ m + n = n + m; from specification nat-basic Used terms: (f_n->elem from ii(n)) to 1 + # f2_n_elem->list(n, f_n->elem(ii(n))), f_n->elem(ii(n)) ' + f2_n_elem->list(n, f_n->elem(ii(n)))
| ⊦ x = y ↔ # x = # y ∧ (∀ n. n < # x → x[n] = y[n]) |
| #(f_n->elem(ii(n)) ' + f2_n_elem->list(n, f_n->elem(ii(n)))) = #((f_n->elem from ii(n)) to 1 + # f2_n_elem->list(n, f_n->elem(ii(n)))), ii(0) = 0, ii(n + 1) = ii(n) + # f2_n_elem->list(n, f_n->elem(ii(n))), f2_n_elem->list(n, f_n->elem(ii(n))) ≠ [], n0 < ii(n + 1), ii(n) < ii(n + 1), pathp(g)(⌜f_n->elem(ii(n)) '⌝ + ⌜f2_n_elem->list(n, f_n->elem(ii(n)))⌝ ), rooted(g), ii(n) ≤ n0, ¬ eP(f_n->elem(ii(n))), ¬ eP(f_n->elem(0)), ¬ eP(f2_n_elem->list(n, f_n->elem(ii(n))).last), ¬ edge(g)(f_n->elem(n0), f_n->elem(n0 + 1)), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n0. n0 < #(f_n->elem(ii(n)) ' + f2_n_elem->list(n, f_n->elem(ii(n)))) → (f_n->elem(ii(n)) ' + f2_n_elem->list(n, f_n->elem(ii(n))))[n0] = ((f_n->elem from ii(n)) to 1 + # f2_n_elem->list(n, f_n->elem(ii(n))))[n0] ⊦ |
ii(n + 1) = ii(n) + # f2_n_elem->list(n, f_n->elem(ii(n))), ii(0) = 0, f2_n_elem->list(n, f_n->elem(ii(n))) ≠ [], ii(n) < ii(n + 1), n0 < ii(n + 1), pathp(g)(⌜f_n->elem(ii(n)) '⌝ + ⌜f2_n_elem->list(n, f_n->elem(ii(n)))⌝ ), rooted(g), ii(n) ≤ n0, ¬ eP(f_n->elem(ii(n))), ¬ eP(f_n->elem(0)), ¬ eP(f2_n_elem->list(n, f_n->elem(ii(n))).last), ¬ edge(g)(f_n->elem(n0), f_n->elem(n0 + 1)), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n1. ¬ # f2_n_elem->list(n, f_n->elem(ii(n))) < n1 → (f_n->elem(ii(n)) ' + f2_n_elem->list(n, f_n->elem(ii(n))))[n1] = f_n->elem(n1 + ii(n)) ⊦
Used simplifier rules: ⊦ ((nf from n))(m) = nf(m + n); (s) m < n ⊦ (nf to n)[m] = nf(m); (s) 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) a: ⊦ (x + y) + z = x + y + z; from specification list ⊦ m +1 = m + 1; (s) ⊦ #(a ' + x) = (# x)+1; (s) ⊦ m + n = m + n0 ↔ n = n0; (s) ⊦ #(nf to n) = n; (s)
| ii(n + 1) = ii(n) + # f2_n_elem->list(n, f_n->elem(ii(n))), ii(0) = 0, f2_n_elem->list(n, f_n->elem(ii(n))) ≠ [], ii(n) < ii(n + 1), n0 < ii(n + 1), pathp(g)(⌜f_n->elem(ii(n)) '⌝ + ⌜f2_n_elem->list(n, f_n->elem(ii(n)))⌝ ), rooted(g), ii(n) ≤ n0, ¬ eP(f_n->elem(ii(n))), ¬ eP(f_n->elem(0)), ¬ eP(f2_n_elem->list(n, f_n->elem(ii(n))).last), ¬ edge(g)(f_n->elem(n0), f_n->elem(n0 + 1)), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n1. ¬ # f2_n_elem->list(n, f_n->elem(ii(n))) < n1 → (f_n->elem(ii(n)) ' + f2_n_elem->list(n, f_n->elem(ii(n))))[n1] = f_n->elem(n1 + ii(n)) ⊦ |
ii(0) = 0, ii(n + 1) = ii(n) + # f2_n_elem->list(n, f_n->elem(ii(n))), f2_n_elem->list(n, f_n->elem(ii(n))) ≠ [], n0 < ii(n + 1), ii(n) < ii(n + 1), pathp(g)(⌜f_n->elem(ii(n)) '⌝ + ⌜f2_n_elem->list(n, f_n->elem(ii(n)))⌝ ), rooted(g), ii(n) ≤ n0, ¬ eP(f_n->elem(ii(n))), ¬ eP(f_n->elem(0)), ¬ eP(f2_n_elem->list(n, f_n->elem(ii(n))).last), ¬ edge(g)(f_n->elem(n0), f_n->elem(n0 + 1)), ¬ # f2_n_elem->list(n, f_n->elem(ii(n))) < n0 - ii(n) → (f_n->elem(ii(n)) ' + f2_n_elem->list(n, f_n->elem(ii(n))))[n0 - ii(n)] = f_n->elem((n0 - ii(n)) + ii(n)), ∀ n1. ¬ # f2_n_elem->list(n, f_n->elem(ii(n))) < n1 → (f_n->elem(ii(n)) ' + f2_n_elem->list(n, f_n->elem(ii(n))))[n1] = f_n->elem(n1 + ii(n)), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a) ⊦
Used terms: n0 - ii(n)
| ii(0) = 0, ii(n + 1) = ii(n) + # f2_n_elem->list(n, f_n->elem(ii(n))), f2_n_elem->list(n, f_n->elem(ii(n))) ≠ [], n0 < ii(n + 1), ii(n) < ii(n + 1), pathp(g)(⌜f_n->elem(ii(n)) '⌝ + ⌜f2_n_elem->list(n, f_n->elem(ii(n)))⌝ ), rooted(g), ii(n) ≤ n0, ¬ eP(f_n->elem(ii(n))), ¬ eP(f_n->elem(0)), ¬ eP(f2_n_elem->list(n, f_n->elem(ii(n))).last), ¬ edge(g)(f_n->elem(n0), f_n->elem(n0 + 1)), ¬ # f2_n_elem->list(n, f_n->elem(ii(n))) < n0 - ii(n) → (f_n->elem(ii(n)) ' + f2_n_elem->list(n, f_n->elem(ii(n))))[n0 - ii(n)] = f_n->elem((n0 - ii(n)) + ii(n)), ∀ n1. ¬ # f2_n_elem->list(n, f_n->elem(ii(n))) < n1 → (f_n->elem(ii(n)) ' + f2_n_elem->list(n, f_n->elem(ii(n))))[n1] = f_n->elem(n1 + ii(n)), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a) ⊦ |
(f_n->elem(ii(n)) ' + f2_n_elem->list(n, f_n->elem(ii(n))))[n0 - ii(n)] = f_n->elem((n0 - ii(n)) + ii(n)), ii(0) = 0, ii(n + 1) = ii(n) + # f2_n_elem->list(n, f_n->elem(ii(n))), f2_n_elem->list(n, f_n->elem(ii(n))) ≠ [], n0 < ii(n + 1), ii(n) < ii(n + 1), pathp(g)(⌜f_n->elem(ii(n)) '⌝ + ⌜f2_n_elem->list(n, f_n->elem(ii(n)))⌝ ), rooted(g), ii(n) ≤ n0, ¬ eP(f2_n_elem->list(n, f_n->elem(ii(n))).last), ¬ eP(f_n->elem(0)), ¬ eP(f_n->elem(ii(n))), ¬ edge(g)(f_n->elem(n0), f_n->elem(n0 + 1)), ∀ n1. ¬ # f2_n_elem->list(n, f_n->elem(ii(n))) < n1 → (f_n->elem(ii(n)) ' + f2_n_elem->list(n, f_n->elem(ii(n))))[n1] = f_n->elem(n1 + ii(n)), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a) ⊦
Used simplifier rules: ⊦ m < n → ¬ n < m; (s) c: ⊦ m + n = n + m; from specification nat-basic n0 ≤ n ⊦ m < n - n0 ↔ m + n0 < n; (s) ⊦ m ≤ n → (n < m ↔ false); (s) ⊦ m ≤ n ↔ ¬ n < m; (ss)
| (f_n->elem(ii(n)) ' + f2_n_elem->list(n, f_n->elem(ii(n))))[n0 - ii(n)] = f_n->elem((n0 - ii(n)) + ii(n)), ii(0) = 0, ii(n + 1) = ii(n) + # f2_n_elem->list(n, f_n->elem(ii(n))), f2_n_elem->list(n, f_n->elem(ii(n))) ≠ [], n0 < ii(n + 1), ii(n) < ii(n + 1), pathp(g)(⌜f_n->elem(ii(n)) '⌝ + ⌜f2_n_elem->list(n, f_n->elem(ii(n)))⌝ ), rooted(g), ii(n) ≤ n0, ¬ eP(f2_n_elem->list(n, f_n->elem(ii(n))).last), ¬ eP(f_n->elem(0)), ¬ eP(f_n->elem(ii(n))), ¬ edge(g)(f_n->elem(n0), f_n->elem(n0 + 1)), ∀ n1. ¬ # f2_n_elem->list(n, f_n->elem(ii(n))) < n1 → (f_n->elem(ii(n)) ' + f2_n_elem->list(n, f_n->elem(ii(n))))[n1] = f_n->elem(n1 + ii(n)), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a) ⊦ |
(f_n->elem(ii(n)) ' + f2_n_elem->list(n, f_n->elem(ii(n))))[n2] = f_n->elem(n2 + ii(n)), ii(n + 1) = ii(n) + # f2_n_elem->list(n, f_n->elem(ii(n))), ii(0) = 0, n0 = n2 + ii(n), f2_n_elem->list(n, f_n->elem(ii(n))) ≠ [], ii(n) < ii(n + 1), n0 < ii(n + 1), pathp(g)(⌜f_n->elem(ii(n)) '⌝ + ⌜f2_n_elem->list(n, f_n->elem(ii(n)))⌝ ), rooted(g), ii(n) ≤ n0, ¬ eP(f2_n_elem->list(n, f_n->elem(ii(n))).last), ¬ eP(f_n->elem(0)), ¬ eP(f_n->elem(ii(n))), ¬ edge(g)(f_n->elem(n0), f_n->elem(n0 + 1)), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n1. ¬ # f2_n_elem->list(n, f_n->elem(ii(n))) < n1 → (f_n->elem(ii(n)) ' + f2_n_elem->list(n, f_n->elem(ii(n))))[n1] = f_n->elem(n1 + ii(n)) ⊦
Used simplifier rules: n ≤ m ⊦ n0 = m - n ↔ m = n0 + n; (elim) Used terms: n0, ii(n), n2
| (f_n->elem(ii(n)) ' + f2_n_elem->list(n, f_n->elem(ii(n))))[n2] = f_n->elem(n2 + ii(n)), ii(n + 1) = ii(n) + # f2_n_elem->list(n, f_n->elem(ii(n))), ii(0) = 0, n0 = n2 + ii(n), f2_n_elem->list(n, f_n->elem(ii(n))) ≠ [], ii(n) < ii(n + 1), n0 < ii(n + 1), pathp(g)(⌜f_n->elem(ii(n)) '⌝ + ⌜f2_n_elem->list(n, f_n->elem(ii(n)))⌝ ), rooted(g), ii(n) ≤ n0, ¬ eP(f2_n_elem->list(n, f_n->elem(ii(n))).last), ¬ eP(f_n->elem(0)), ¬ eP(f_n->elem(ii(n))), ¬ edge(g)(f_n->elem(n0), f_n->elem(n0 + 1)), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n1. ¬ # f2_n_elem->list(n, f_n->elem(ii(n))) < n1 → (f_n->elem(ii(n)) ' + f2_n_elem->list(n, f_n->elem(ii(n))))[n1] = f_n->elem(n1 + ii(n)) ⊦ |
(f_n->elem(ii(n)) ' + f2_n_elem->list(n, f_n->elem(ii(n))))[n2] = f_n->elem(n2 + ii(n)), ii(0) = 0, ii(n + 1) = ii(n) + # f2_n_elem->list(n, f_n->elem(ii(n))), f2_n_elem->list(n, f_n->elem(ii(n))) ≠ [], n2 < # f2_n_elem->list(n, f_n->elem(ii(n))), ii(n) < ii(n + 1), pathp(g)(⌜f_n->elem(ii(n)) '⌝ + ⌜f2_n_elem->list(n, f_n->elem(ii(n)))⌝ ), rooted(g), ¬ eP(f2_n_elem->list(n, f_n->elem(ii(n))).last), ¬ eP(f_n->elem(0)), ¬ eP(f_n->elem(ii(n))), ¬ edge(g)(f_n->elem(n2 + ii(n)), f_n->elem((n2 + ii(n)) + 1)), ∀ n1. ¬ # f2_n_elem->list(n, f_n->elem(ii(n))) < n1 → (f_n->elem(ii(n)) ' + f2_n_elem->list(n, f_n->elem(ii(n))))[n1] = f_n->elem(n1 + ii(n)), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a) ⊦
Used simplifier rules: ⊦ # x = 0 ↔ x = []; (s) f: ⊦ m < n → n ≠ 0; (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 = m0 + n0 ∧ n < n0 → m0 + n < m; (s) ⊦ m + n < m + n0 ↔ n < n0; (s) lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic ⊦ m ≤ m + n; (s)
| (f_n->elem(ii(n)) ' + f2_n_elem->list(n, f_n->elem(ii(n))))[n2] = f_n->elem(n2 + ii(n)), ii(0) = 0, ii(n + 1) = ii(n) + # f2_n_elem->list(n, f_n->elem(ii(n))), f2_n_elem->list(n, f_n->elem(ii(n))) ≠ [], n2 < # f2_n_elem->list(n, f_n->elem(ii(n))), ii(n) < ii(n + 1), pathp(g)(⌜f_n->elem(ii(n)) '⌝ + ⌜f2_n_elem->list(n, f_n->elem(ii(n)))⌝ ), rooted(g), ¬ eP(f2_n_elem->list(n, f_n->elem(ii(n))).last), ¬ eP(f_n->elem(0)), ¬ eP(f_n->elem(ii(n))), ¬ edge(g)(f_n->elem(n2 + ii(n)), f_n->elem((n2 + ii(n)) + 1)), ∀ n1. ¬ # f2_n_elem->list(n, f_n->elem(ii(n))) < n1 → (f_n->elem(ii(n)) ' + f2_n_elem->list(n, f_n->elem(ii(n))))[n1] = f_n->elem(n1 + ii(n)), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a) ⊦ |
(f_n->elem(ii(n)) ' + f2_n_elem->list(n, f_n->elem(ii(n))))[n2] = f_n->elem(n2 + ii(n)), ii(n + 1) = ii(n) + # f2_n_elem->list(n, f_n->elem(ii(n))), ii(0) = 0, f2_n_elem->list(n, f_n->elem(ii(n))) ≠ [], ii(n) < ii(n + 1), n2 < # f2_n_elem->list(n, f_n->elem(ii(n))), pathp(g)(⌜f_n->elem(ii(n)) '⌝ + ⌜f2_n_elem->list(n, f_n->elem(ii(n)))⌝ ), rooted(g), ¬ eP(f2_n_elem->list(n, f_n->elem(ii(n))).last), ¬ eP(f_n->elem(0)), ¬ eP(f_n->elem(ii(n))), ¬ edge(g)(f_n->elem(n2 + ii(n)), f_n->elem((n2 + ii(n)) + 1)), ¬ # f2_n_elem->list(n, f_n->elem(ii(n))) < n2 + 1 → (f_n->elem(ii(n)) ' + f2_n_elem->list(n, f_n->elem(ii(n))))[n2 + 1] = f_n->elem((n2 + 1) + ii(n)), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a) ⊦
Used terms: n2 + 1
| (f_n->elem(ii(n)) ' + f2_n_elem->list(n, f_n->elem(ii(n))))[n2] = f_n->elem(n2 + ii(n)), ii(n + 1) = ii(n) + # f2_n_elem->list(n, f_n->elem(ii(n))), ii(0) = 0, f2_n_elem->list(n, f_n->elem(ii(n))) ≠ [], ii(n) < ii(n + 1), n2 < # f2_n_elem->list(n, f_n->elem(ii(n))), pathp(g)(⌜f_n->elem(ii(n)) '⌝ + ⌜f2_n_elem->list(n, f_n->elem(ii(n)))⌝ ), rooted(g), ¬ eP(f2_n_elem->list(n, f_n->elem(ii(n))).last), ¬ eP(f_n->elem(0)), ¬ eP(f_n->elem(ii(n))), ¬ edge(g)(f_n->elem(n2 + ii(n)), f_n->elem((n2 + ii(n)) + 1)), ¬ # f2_n_elem->list(n, f_n->elem(ii(n))) < n2 + 1 → (f_n->elem(ii(n)) ' + f2_n_elem->list(n, f_n->elem(ii(n))))[n2 + 1] = f_n->elem((n2 + 1) + ii(n)), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a) ⊦ |
(f_n->elem(ii(n)) ' + f2_n_elem->list(n, f_n->elem(ii(n))))[n2] = f_n->elem(n2 + ii(n)), f2_n_elem->list(n, f_n->elem(ii(n)))[n2] = f_n->elem((n2 + 1) + ii(n)), ii(0) = 0, ii(n + 1) = ii(n) + # f2_n_elem->list(n, f_n->elem(ii(n))), f2_n_elem->list(n, f_n->elem(ii(n))) ≠ [], n2 < # f2_n_elem->list(n, f_n->elem(ii(n))), ii(n) < ii(n + 1), pathp(g)(⌜f_n->elem(ii(n)) '⌝ + ⌜f2_n_elem->list(n, f_n->elem(ii(n)))⌝ ), rooted(g), ¬ eP(f2_n_elem->list(n, f_n->elem(ii(n))).last), ¬ eP(f_n->elem(0)), ¬ eP(f_n->elem(ii(n))), ¬ edge(g)(f_n->elem(n2 + ii(n)), f_n->elem((n2 + ii(n)) + 1)), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a) ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ (a ' + x)[n + 1] = x[n]; (s) ⊦ m < n + 1 ↔ ¬ n < m; (s)
| (f_n->elem(ii(n)) ' + f2_n_elem->list(n, f_n->elem(ii(n))))[n2] = f_n->elem(n2 + ii(n)), f2_n_elem->list(n, f_n->elem(ii(n)))[n2] = f_n->elem((n2 + 1) + ii(n)), ii(0) = 0, ii(n + 1) = ii(n) + # f2_n_elem->list(n, f_n->elem(ii(n))), f2_n_elem->list(n, f_n->elem(ii(n))) ≠ [], n2 < # f2_n_elem->list(n, f_n->elem(ii(n))), ii(n) < ii(n + 1), pathp(g)(⌜f_n->elem(ii(n)) '⌝ + ⌜f2_n_elem->list(n, f_n->elem(ii(n)))⌝ ), rooted(g), ¬ eP(f2_n_elem->list(n, f_n->elem(ii(n))).last), ¬ eP(f_n->elem(0)), ¬ eP(f_n->elem(ii(n))), ¬ edge(g)(f_n->elem(n2 + ii(n)), f_n->elem((n2 + ii(n)) + 1)), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a) ⊦ |
⊦ pathp(g)(σ) ↔ (∀ n. ⌜n⌝ < # σ → dom(g)(σ[n])) ∧ (∀ n. ⌜n + 1⌝ < # σ → edge(g)(σ[n], σ[n + 1]))
f2_n_elem->list(n, f_n->elem(ii(n)))[n2] = f_n->elem((n2 + 1) + ii(n)), (f_n->elem(ii(n)) ' + f2_n_elem->list(n, f_n->elem(ii(n))))[n2] = f_n->elem(n2 + ii(n)), ii(n + 1) = ii(n) + # f2_n_elem->list(n, f_n->elem(ii(n))), ii(0) = 0, f2_n_elem->list(n, f_n->elem(ii(n))) ≠ [], ii(n) < ii(n + 1), n2 < # f2_n_elem->list(n, f_n->elem(ii(n))), rooted(g), ¬ eP(f2_n_elem->list(n, f_n->elem(ii(n))).last), ¬ eP(f_n->elem(0)), ¬ eP(f_n->elem(ii(n))), ¬ edge(g)(f_n->elem(n2 + ii(n)), f_n->elem((n2 + ii(n)) + 1)), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n0. ⌜n0⌝ < #(⌜f_n->elem(ii(n)) '⌝ + ⌜f2_n_elem->list(n, f_n->elem(ii(n)))⌝ ) → dom(g)((⌜f_n->elem(ii(n)) '⌝ + ⌜f2_n_elem->list(n, f_n->elem(ii(n)))⌝ )[n0]), ∀ n0. ⌜n0 + 1⌝ < #(⌜f_n->elem(ii(n)) '⌝ + ⌜f2_n_elem->list(n, f_n->elem(ii(n)))⌝ ) → edge(g) ((⌜f_n->elem(ii(n)) '⌝ + ⌜f2_n_elem->list(n, f_n->elem(ii(n)))⌝ )[n0], (⌜f_n->elem(ii(n)) '⌝ + ⌜f2_n_elem->list(n, f_n->elem(ii(n)))⌝ )[n0 + 1]) ⊦
Used terms: ⌜f_n->elem(ii(n)) '⌝ + ⌜f2_n_elem->list(n, f_n->elem(ii(n)))⌝ , g
| ⊦ pathp(g)(σ) ↔ (∀ n. ⌜n⌝ < # σ → dom(g)(σ[n])) ∧ (∀ n. ⌜n + 1⌝ < # σ → edge(g)(σ[n], σ[n + 1])) |
| f2_n_elem->list(n, f_n->elem(ii(n)))[n2] = f_n->elem((n2 + 1) + ii(n)), (f_n->elem(ii(n)) ' + f2_n_elem->list(n, f_n->elem(ii(n))))[n2] = f_n->elem(n2 + ii(n)), ii(n + 1) = ii(n) + # f2_n_elem->list(n, f_n->elem(ii(n))), ii(0) = 0, f2_n_elem->list(n, f_n->elem(ii(n))) ≠ [], ii(n) < ii(n + 1), n2 < # f2_n_elem->list(n, f_n->elem(ii(n))), rooted(g), ¬ eP(f2_n_elem->list(n, f_n->elem(ii(n))).last), ¬ eP(f_n->elem(0)), ¬ eP(f_n->elem(ii(n))), ¬ edge(g)(f_n->elem(n2 + ii(n)), f_n->elem((n2 + ii(n)) + 1)), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n0. ⌜n0⌝ < #(⌜f_n->elem(ii(n)) '⌝ + ⌜f2_n_elem->list(n, f_n->elem(ii(n)))⌝ ) → dom(g)((⌜f_n->elem(ii(n)) '⌝ + ⌜f2_n_elem->list(n, f_n->elem(ii(n)))⌝ )[n0]), ∀ n0. ⌜n0 + 1⌝ < #(⌜f_n->elem(ii(n)) '⌝ + ⌜f2_n_elem->list(n, f_n->elem(ii(n)))⌝ ) → edge(g) ((⌜f_n->elem(ii(n)) '⌝ + ⌜f2_n_elem->list(n, f_n->elem(ii(n)))⌝ )[n0], (⌜f_n->elem(ii(n)) '⌝ + ⌜f2_n_elem->list(n, f_n->elem(ii(n)))⌝ )[n0 + 1]) ⊦ |
(f_n->elem(ii(n)) ' + f2_n_elem->list(n, f_n->elem(ii(n))))[n2] = f_n->elem(n2 + ii(n)), f2_n_elem->list(n, f_n->elem(ii(n)))[n2] = f_n->elem((n2 + 1) + ii(n)), ii(0) = 0, ii(n + 1) = ii(n) + # f2_n_elem->list(n, f_n->elem(ii(n))), f2_n_elem->list(n, f_n->elem(ii(n))) ≠ [], n2 < # f2_n_elem->list(n, f_n->elem(ii(n))), ii(n) < ii(n + 1), rooted(g), ¬ eP(f2_n_elem->list(n, f_n->elem(ii(n))).last), ¬ eP(f_n->elem(0)), ¬ eP(f_n->elem(ii(n))), ¬ edge(g)(f_n->elem(n2 + ii(n)), f_n->elem((n2 + ii(n)) + 1)), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n0. n0 < # f2_n_elem->list(n, f_n->elem(ii(n))) → edge(g)((f_n->elem(ii(n)) ' + f2_n_elem->list(n, f_n->elem(ii(n))))[n0], f2_n_elem->list(n, f_n->elem(ii(n)))[n0]), ∀ n0. ¬ # f2_n_elem->list(n, f_n->elem(ii(n))) < n0 → dom(g)((f_n->elem(ii(n)) ' + f2_n_elem->list(n, f_n->elem(ii(n))))[n0]) ⊦
Used simplifier rules: append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream ⊦ (⌜x⌝ + ⌜x0⌝ )[m] = (x + x0)[m]; (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 ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ ⌜n⌝ < ⌜1⌝ + n∞ ↔ ¬ n∞ < ⌜n⌝ ; (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ # a ' = 0 +1; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s) c: ⊦ m + n = n + m; from specification nat-basic a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ (⌜a '⌝ + σ)[n + 1] = σ[n]; (s) ⊦ n∞ + ⌜0⌝ = n∞; (s) ⊦ m ≤ n → (⌜(* m)⌝ + n∞2 < ⌜(* n)⌝ + n∞1 ↔ n∞2 < ⌜n - m⌝ + n∞1); (s) ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s)
| (f_n->elem(ii(n)) ' + f2_n_elem->list(n, f_n->elem(ii(n))))[n2] = f_n->elem(n2 + ii(n)), f2_n_elem->list(n, f_n->elem(ii(n)))[n2] = f_n->elem((n2 + 1) + ii(n)), ii(0) = 0, ii(n + 1) = ii(n) + # f2_n_elem->list(n, f_n->elem(ii(n))), f2_n_elem->list(n, f_n->elem(ii(n))) ≠ [], n2 < # f2_n_elem->list(n, f_n->elem(ii(n))), ii(n) < ii(n + 1), rooted(g), ¬ eP(f2_n_elem->list(n, f_n->elem(ii(n))).last), ¬ eP(f_n->elem(0)), ¬ eP(f_n->elem(ii(n))), ¬ edge(g)(f_n->elem(n2 + ii(n)), f_n->elem((n2 + ii(n)) + 1)), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n0. n0 < # f2_n_elem->list(n, f_n->elem(ii(n))) → edge(g)((f_n->elem(ii(n)) ' + f2_n_elem->list(n, f_n->elem(ii(n))))[n0], f2_n_elem->list(n, f_n->elem(ii(n)))[n0]), ∀ n0. ¬ # f2_n_elem->list(n, f_n->elem(ii(n))) < n0 → dom(g)((f_n->elem(ii(n)) ' + f2_n_elem->list(n, f_n->elem(ii(n))))[n0]) ⊦ |
Used simplifier rules: a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic Used terms: n2
| ii(0) = 0, σ ≠ [], findepth(g), rooted(g), ¬ eP(σ[0]), (finp(σ) ⊃ # σ = ⌜ii(n)⌝ + ⌜1⌝ ∧ (∀ m. n ≤ m → f2_n_elem->list(m, σ[ii(m)]) = [] ∧ ii(n) = ii(m));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii(n + 1) = ii(n) + # f2_n_elem->list(n, σ[ii(n)]) ∧ ⌜ii(n + 1)⌝ < # σ ∧ (σ from ii(n)) to # f2_n_elem->list(n, σ[ii(n)]) + 1 = ⌜σ[ii(n)] '⌝ + ⌜f2_n_elem->list(n, σ[ii(n)])⌝ , ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last) ⊦ ∀ n. ¬ eP(σ[ii(n)]) |
ii(0) = 0, σ ≠ [], eP(σ[ii(n0)]), findepth(g), rooted(g), ¬ eP(σ[0]), (finp(σ) ⊃ # σ = ⌜ii(n)⌝ + ⌜1⌝ ∧ (∀ m. n ≤ m → f2_n_elem->list(m, σ[ii(m)]) = [] ∧ ii(n) = ii(m));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n. ii(n + 1) = ii(n) + # f2_n_elem->list(n, σ[ii(n)]) ∧ ⌜ii(n + 1)⌝ < # σ ∧ (σ from ii(n)) to # f2_n_elem->list(n, σ[ii(n)]) + 1 = ⌜σ[ii(n)] '⌝ + ⌜f2_n_elem->list(n, σ[ii(n)])⌝ ⊦
| ii(0) = 0, σ ≠ [], eP(σ[ii(n0)]), findepth(g), rooted(g), ¬ eP(σ[0]), (finp(σ) ⊃ # σ = ⌜ii(n)⌝ + ⌜1⌝ ∧ (∀ m. n ≤ m → f2_n_elem->list(m, σ[ii(m)]) = [] ∧ ii(n) = ii(m));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∀ n. ii(n + 1) = ii(n) + # f2_n_elem->list(n, σ[ii(n)]) ∧ ⌜ii(n + 1)⌝ < # σ ∧ (σ from ii(n)) to # f2_n_elem->list(n, σ[ii(n)]) + 1 = ⌜σ[ii(n)] '⌝ + ⌜f2_n_elem->list(n, σ[ii(n)])⌝ ⊦ |
ii(0) = 0, σ ≠ [], eP(σ[ii(n0)]), ¬ eP(σ[0]), (finp(σ) ⊃ # σ = ⌜ii(n)⌝ + ⌜1⌝ ∧ (∀ m. n ≤ m → f2_n_elem->list(m, σ[ii(m)]) = [] ∧ ii(n) = ii(m));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii(n + 1) = ii(n) + # f2_n_elem->list(n, σ[ii(n)]) ∧ ⌜ii(n + 1)⌝ < # σ ∧ (σ from ii(n)) to # f2_n_elem->list(n, σ[ii(n)]) + 1 = ⌜σ[ii(n)] '⌝ + ⌜f2_n_elem->list(n, σ[ii(n)])⌝ , ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last) ⊦
| ii(0) = 0, σ ≠ [], eP(σ[ii(n0)]), ¬ eP(σ[0]), (finp(σ) ⊃ # σ = ⌜ii(n)⌝ + ⌜1⌝ ∧ (∀ m. n ≤ m → f2_n_elem->list(m, σ[ii(m)]) = [] ∧ ii(n) = ii(m));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii(n + 1) = ii(n) + # f2_n_elem->list(n, σ[ii(n)]) ∧ ⌜ii(n + 1)⌝ < # σ ∧ (σ from ii(n)) to # f2_n_elem->list(n, σ[ii(n)]) + 1 = ⌜σ[ii(n)] '⌝ + ⌜f2_n_elem->list(n, σ[ii(n)])⌝ , ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last) ⊦ |
ii(0) = 0, σ ≠ [], eP(σ[ii(n1 +1)]), ¬ eP(σ[0]), (finp(σ) ⊃ # σ = ⌜ii(n)⌝ + ⌜1⌝ ∧ (∀ m. n ≤ m → f2_n_elem->list(m, σ[ii(m)]) = [] ∧ ii(n) = ii(m));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ n. ii(n + 1) = ii(n) + # f2_n_elem->list(n, σ[ii(n)]) ∧ ⌜ii(n + 1)⌝ < # σ ∧ (σ from ii(n)) to # f2_n_elem->list(n, σ[ii(n)]) + 1 = ⌜σ[ii(n)] '⌝ + ⌜f2_n_elem->list(n, σ[ii(n)])⌝ , ∀ ii, σ, eP, n, f2_n_elem->list, g. ¬ ( ii(0) = 0 ∧ σ ≠ [] ∧ eP(σ[ii(n1)]) ∧ ¬ eP(σ[0]) ∧ (finp(σ) ⊃ # σ = ⌜ii(n)⌝ + ⌜1⌝ ∧ (∀ m. n ≤ m → f2_n_elem->list(m, σ[ii(m)]) = [] ∧ ii(n) = ii(m)) ;∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1) ) ∧ (∀ n. ii(n + 1) = ii(n) + # f2_n_elem->list(n, σ[ii(n)]) ∧ ⌜ii(n + 1)⌝ < # σ ∧ (σ from ii(n)) to # f2_n_elem->list(n, σ[ii(n)]) + 1 = ⌜σ[ii(n)] '⌝ + ⌜f2_n_elem->list(n, σ[ii(n)])⌝ ) ∧ (∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last))) ⊦
Used simplifier rules: nat freely generated by 0, +1;;
| ii(0) = 0, σ ≠ [], eP(σ[ii(n1 +1)]), ¬ eP(σ[0]), (finp(σ) ⊃ # σ = ⌜ii(n)⌝ + ⌜1⌝ ∧ (∀ m. n ≤ m → f2_n_elem->list(m, σ[ii(m)]) = [] ∧ ii(n) = ii(m));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ n. ii(n + 1) = ii(n) + # f2_n_elem->list(n, σ[ii(n)]) ∧ ⌜ii(n + 1)⌝ < # σ ∧ (σ from ii(n)) to # f2_n_elem->list(n, σ[ii(n)]) + 1 = ⌜σ[ii(n)] '⌝ + ⌜f2_n_elem->list(n, σ[ii(n)])⌝ , ∀ ii, σ, eP, n, f2_n_elem->list, g. ¬ ( ii(0) = 0 ∧ σ ≠ [] ∧ eP(σ[ii(n1)]) ∧ ¬ eP(σ[0]) ∧ (finp(σ) ⊃ # σ = ⌜ii(n)⌝ + ⌜1⌝ ∧ (∀ m. n ≤ m → f2_n_elem->list(m, σ[ii(m)]) = [] ∧ ii(n) = ii(m)) ;∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1) ) ∧ (∀ n. ii(n + 1) = ii(n) + # f2_n_elem->list(n, σ[ii(n)]) ∧ ⌜ii(n + 1)⌝ < # σ ∧ (σ from ii(n)) to # f2_n_elem->list(n, σ[ii(n)]) + 1 = ⌜σ[ii(n)] '⌝ + ⌜f2_n_elem->list(n, σ[ii(n)])⌝ ) ∧ (∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last))) ⊦ |
ii(0) = 0, σ ≠ [], eP(σ[ii(n1 + 1)]), ¬ eP(σ[0]), (finp(σ) ⊃ # σ = ⌜ii(n)⌝ + ⌜1⌝ ∧ (∀ m. n ≤ m → f2_n_elem->list(m, σ[ii(m)]) = [] ∧ ii(n) = ii(m));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii(n + 1) = ii(n) + # f2_n_elem->list(n, σ[ii(n)]) ∧ ⌜ii(n + 1)⌝ < # σ ∧ (σ from ii(n)) to # f2_n_elem->list(n, σ[ii(n)]) + 1 = ⌜σ[ii(n)] '⌝ + ⌜f2_n_elem->list(n, σ[ii(n)])⌝ , ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ ii0, σ0, eP0, n0, f2_n_elem->list0, g0. ii0(0) ≠ 0 ∨ σ0 = [] ∨ ¬ eP0(σ0[ii0(n1)]) ∨ eP0(σ0[0]) ∨ ¬ (finp(σ0) ⊃ # σ0 = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → f2_n_elem->list0(m, σ0[ii0(m)]) = [] ∧ ii0(n0) = ii0(m)) ;∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1) ) ∨ ¬ (∀ n. ii0(n + 1) = ii0(n) + # f2_n_elem->list0(n, σ0[ii0(n)]) ∧ ⌜ii0(n + 1)⌝ < # σ0 ∧ (σ0 from ii0(n)) to # f2_n_elem->list0(n, σ0[ii0(n)]) + 1 = ⌜σ0[ii0(n)] '⌝ + ⌜f2_n_elem->list0(n, σ0[ii0(n)])⌝ ) ∨ ¬ (∀ n, a0. ¬ eP0(a0) → pathp(g0)(⌜a0 '⌝ + ⌜f2_n_elem->list0(n, a0)⌝ ) ∧ f2_n_elem->list0(n, a0) ≠ [] ∧ ¬ eP0(f2_n_elem->list0(n, a0).last)) ⊦
Used simplifier rules: ⊦ m +1 = m + 1; (s)
| ii(0) = 0, σ ≠ [], eP(σ[ii(n1 + 1)]), ¬ eP(σ[0]), (finp(σ) ⊃ # σ = ⌜ii(n)⌝ + ⌜1⌝ ∧ (∀ m. n ≤ m → f2_n_elem->list(m, σ[ii(m)]) = [] ∧ ii(n) = ii(m));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii(n + 1) = ii(n) + # f2_n_elem->list(n, σ[ii(n)]) ∧ ⌜ii(n + 1)⌝ < # σ ∧ (σ from ii(n)) to # f2_n_elem->list(n, σ[ii(n)]) + 1 = ⌜σ[ii(n)] '⌝ + ⌜f2_n_elem->list(n, σ[ii(n)])⌝ , ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ ii0, σ0, eP0, n0, f2_n_elem->list0, g0. ii0(0) ≠ 0 ∨ σ0 = [] ∨ ¬ eP0(σ0[ii0(n1)]) ∨ eP0(σ0[0]) ∨ ¬ (finp(σ0) ⊃ # σ0 = ⌜ii0(n0)⌝ + ⌜1⌝ ∧ (∀ m. n0 ≤ m → f2_n_elem->list0(m, σ0[ii0(m)]) = [] ∧ ii0(n0) = ii0(m)) ;∀ n. ∃ m. ii0(m) ≤ n ∧ n < ii0(m + 1) ) ∨ ¬ (∀ n. ii0(n + 1) = ii0(n) + # f2_n_elem->list0(n, σ0[ii0(n)]) ∧ ⌜ii0(n + 1)⌝ < # σ0 ∧ (σ0 from ii0(n)) to # f2_n_elem->list0(n, σ0[ii0(n)]) + 1 = ⌜σ0[ii0(n)] '⌝ + ⌜f2_n_elem->list0(n, σ0[ii0(n)])⌝ ) ∨ ¬ (∀ n, a0. ¬ eP0(a0) → pathp(g0)(⌜a0 '⌝ + ⌜f2_n_elem->list0(n, a0)⌝ ) ∧ f2_n_elem->list0(n, a0) ≠ [] ∧ ¬ eP0(f2_n_elem->list0(n, a0).last)) ⊦ |
ii(0) = 0, σ ≠ [], eP(σ[ii(n1 + 1)]), ¬ eP(σ[0]), (finp(σ) ⊃ # σ = ⌜ii(n)⌝ + ⌜1⌝ ∧ (∀ m. n ≤ m → f2_n_elem->list(m, σ[ii(m)]) = [] ∧ ii(n) = ii(m));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ n. ii(n + 1) = ii(n) + # f2_n_elem->list(n, σ[ii(n)]) ∧ ⌜ii(n + 1)⌝ < # σ ∧ (σ from ii(n)) to # f2_n_elem->list(n, σ[ii(n)]) + 1 = ⌜σ[ii(n)] '⌝ + ⌜f2_n_elem->list(n, σ[ii(n)])⌝ , ii(0) ≠ 0 ∨ σ = [] ∨ ¬ eP(σ[ii(n1)]) ∨ eP(σ[0]) ∨ ¬ (finp(σ) ⊃ # σ = ⌜ii(n)⌝ + ⌜1⌝ ∧ (∀ m. n ≤ m → f2_n_elem->list(m, σ[ii(m)]) = [] ∧ ii(n) = ii(m));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)) ∨ ¬ (∀ n. ii(n + 1) = ii(n) + # f2_n_elem->list(n, σ[ii(n)]) ∧ ⌜ii(n + 1)⌝ < # σ ∧ (σ from ii(n)) to # f2_n_elem->list(n, σ[ii(n)]) + 1 = ⌜σ[ii(n)] '⌝ + ⌜f2_n_elem->list(n, σ[ii(n)])⌝ ) ∨ ¬(∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last)) ⊦
Used terms: ii, σ, eP, n, f2_n_elem->list, g
| ii(0) = 0, σ ≠ [], eP(σ[ii(n1 + 1)]), ¬ eP(σ[0]), (finp(σ) ⊃ # σ = ⌜ii(n)⌝ + ⌜1⌝ ∧ (∀ m. n ≤ m → f2_n_elem->list(m, σ[ii(m)]) = [] ∧ ii(n) = ii(m));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ n. ii(n + 1) = ii(n) + # f2_n_elem->list(n, σ[ii(n)]) ∧ ⌜ii(n + 1)⌝ < # σ ∧ (σ from ii(n)) to # f2_n_elem->list(n, σ[ii(n)]) + 1 = ⌜σ[ii(n)] '⌝ + ⌜f2_n_elem->list(n, σ[ii(n)])⌝ , ii(0) ≠ 0 ∨ σ = [] ∨ ¬ eP(σ[ii(n1)]) ∨ eP(σ[0]) ∨ ¬ (finp(σ) ⊃ # σ = ⌜ii(n)⌝ + ⌜1⌝ ∧ (∀ m. n ≤ m → f2_n_elem->list(m, σ[ii(m)]) = [] ∧ ii(n) = ii(m));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)) ∨ ¬ (∀ n. ii(n + 1) = ii(n) + # f2_n_elem->list(n, σ[ii(n)]) ∧ ⌜ii(n + 1)⌝ < # σ ∧ (σ from ii(n)) to # f2_n_elem->list(n, σ[ii(n)]) + 1 = ⌜σ[ii(n)] '⌝ + ⌜f2_n_elem->list(n, σ[ii(n)])⌝ ) ∨ ¬(∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last)) ⊦ |
ii(0) = 0, σ ≠ [], eP(σ[ii(n1 + 1)]), ¬ eP(σ[0]), ¬ eP(σ[ii(n1)]), (finp(σ) ⊃ # σ = ⌜ii(n)⌝ + ⌜1⌝ ∧ (∀ m. n ≤ m → f2_n_elem->list(m, σ[ii(m)]) = [] ∧ ii(n) = ii(m));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii(n + 1) = ii(n) + # f2_n_elem->list(n, σ[ii(n)]) ∧ ⌜ii(n + 1)⌝ < # σ ∧ (σ from ii(n)) to # f2_n_elem->list(n, σ[ii(n)]) + 1 = ⌜σ[ii(n)] '⌝ + ⌜f2_n_elem->list(n, σ[ii(n)])⌝ , ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last) ⊦
| ii(0) = 0, σ ≠ [], eP(σ[ii(n1 + 1)]), ¬ eP(σ[0]), ¬ eP(σ[ii(n1)]), (finp(σ) ⊃ # σ = ⌜ii(n)⌝ + ⌜1⌝ ∧ (∀ m. n ≤ m → f2_n_elem->list(m, σ[ii(m)]) = [] ∧ ii(n) = ii(m));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii(n + 1) = ii(n) + # f2_n_elem->list(n, σ[ii(n)]) ∧ ⌜ii(n + 1)⌝ < # σ ∧ (σ from ii(n)) to # f2_n_elem->list(n, σ[ii(n)]) + 1 = ⌜σ[ii(n)] '⌝ + ⌜f2_n_elem->list(n, σ[ii(n)])⌝ , ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last) ⊦ |
ii(0) = 0, ii(n1 + 1) = ii(n1) + # f2_n_elem->list(n1, σ[ii(n1)]), (σ from ii(n1)) to # f2_n_elem->list(n1, σ[ii(n1)]) + 1 = ⌜σ[ii(n1)] '⌝ + ⌜f2_n_elem->list(n1, σ[ii(n1)])⌝ , σ ≠ [], ⌜ii(n1 + 1)⌝ < # σ, eP(σ[ii(n1 + 1)]), ¬ eP(σ[0]), ¬ eP(σ[ii(n1)]), (finp(σ) ⊃ # σ = ⌜ii(n)⌝ + ⌜1⌝ ∧ (∀ m. n ≤ m → f2_n_elem->list(m, σ[ii(m)]) = [] ∧ ii(n) = ii(m));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ n. ii(n + 1) = ii(n) + # f2_n_elem->list(n, σ[ii(n)]) ∧ ⌜ii(n + 1)⌝ < # σ ∧ (σ from ii(n)) to # f2_n_elem->list(n, σ[ii(n)]) + 1 = ⌜σ[ii(n)] '⌝ + ⌜f2_n_elem->list(n, σ[ii(n)])⌝ ⊦
Used terms: n1
| ii(0) = 0, ii(n1 + 1) = ii(n1) + # f2_n_elem->list(n1, σ[ii(n1)]), (σ from ii(n1)) to # f2_n_elem->list(n1, σ[ii(n1)]) + 1 = ⌜σ[ii(n1)] '⌝ + ⌜f2_n_elem->list(n1, σ[ii(n1)])⌝ , σ ≠ [], ⌜ii(n1 + 1)⌝ < # σ, eP(σ[ii(n1 + 1)]), ¬ eP(σ[0]), ¬ eP(σ[ii(n1)]), (finp(σ) ⊃ # σ = ⌜ii(n)⌝ + ⌜1⌝ ∧ (∀ m. n ≤ m → f2_n_elem->list(m, σ[ii(m)]) = [] ∧ ii(n) = ii(m));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ n. ii(n + 1) = ii(n) + # f2_n_elem->list(n, σ[ii(n)]) ∧ ⌜ii(n + 1)⌝ < # σ ∧ (σ from ii(n)) to # f2_n_elem->list(n, σ[ii(n)]) + 1 = ⌜σ[ii(n)] '⌝ + ⌜f2_n_elem->list(n, σ[ii(n)])⌝ ⊦ |
ii(n1 + 1) = ii(n1) + # f2_n_elem->list(n1, σ[ii(n1)]), ii(0) = 0, (σ from ii(n1)) to # f2_n_elem->list(n1, σ[ii(n1)]) + 1 = ⌜σ[ii(n1)] '⌝ + ⌜f2_n_elem->list(n1, σ[ii(n1)])⌝ , σ ≠ [], ⌜ii(n1 + 1)⌝ < # σ, eP(σ[ii(n1 + 1)]), ¬ eP(σ[0]), ¬ eP(σ[ii(n1)]), ¬ eP(σ[ii(n1)]) → pathp(g)(⌜σ[ii(n1)] '⌝ + ⌜f2_n_elem->list(n1, σ[ii(n1)])⌝ ) ∧ f2_n_elem->list(n1, σ[ii(n1)]) ≠ [] ∧ ¬ eP(f2_n_elem->list(n1, σ[ii(n1)]).last), (finp(σ) ⊃ # σ = ⌜ii(n)⌝ + ⌜1⌝ ∧ (∀ m. n ≤ m → f2_n_elem->list(m, σ[ii(m)]) = [] ∧ ii(n) = ii(m));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii(n + 1) = ii(n) + # f2_n_elem->list(n, σ[ii(n)]) ∧ ⌜ii(n + 1)⌝ < # σ ∧ (σ from ii(n)) to # f2_n_elem->list(n, σ[ii(n)]) + 1 = ⌜σ[ii(n)] '⌝ + ⌜f2_n_elem->list(n, σ[ii(n)])⌝ , ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last) ⊦
Used terms: n1, σ[ii(n1)]
| ii(n1 + 1) = ii(n1) + # f2_n_elem->list(n1, σ[ii(n1)]), ii(0) = 0, (σ from ii(n1)) to # f2_n_elem->list(n1, σ[ii(n1)]) + 1 = ⌜σ[ii(n1)] '⌝ + ⌜f2_n_elem->list(n1, σ[ii(n1)])⌝ , σ ≠ [], ⌜ii(n1 + 1)⌝ < # σ, eP(σ[ii(n1 + 1)]), ¬ eP(σ[0]), ¬ eP(σ[ii(n1)]), ¬ eP(σ[ii(n1)]) → pathp(g)(⌜σ[ii(n1)] '⌝ + ⌜f2_n_elem->list(n1, σ[ii(n1)])⌝ ) ∧ f2_n_elem->list(n1, σ[ii(n1)]) ≠ [] ∧ ¬ eP(f2_n_elem->list(n1, σ[ii(n1)]).last), (finp(σ) ⊃ # σ = ⌜ii(n)⌝ + ⌜1⌝ ∧ (∀ m. n ≤ m → f2_n_elem->list(m, σ[ii(m)]) = [] ∧ ii(n) = ii(m));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii(n + 1) = ii(n) + # f2_n_elem->list(n, σ[ii(n)]) ∧ ⌜ii(n + 1)⌝ < # σ ∧ (σ from ii(n)) to # f2_n_elem->list(n, σ[ii(n)]) + 1 = ⌜σ[ii(n)] '⌝ + ⌜f2_n_elem->list(n, σ[ii(n)])⌝ , ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last) ⊦ |
ii(0) = 0, ii(n1 + 1) = ii(n1) + # f2_n_elem->list(n1, σ[ii(n1)]), (σ from ii(n1)) to # f2_n_elem->list(n1, σ[ii(n1)]) + 1 = ⌜σ[ii(n1)] '⌝ + ⌜f2_n_elem->list(n1, σ[ii(n1)])⌝ , f2_n_elem->list(n1, σ[ii(n1)]) ≠ [], σ ≠ [], ⌜ii(n1 + 1)⌝ < # σ, eP(σ[ii(n1 + 1)]), pathp(g)(⌜σ[ii(n1)] '⌝ + ⌜f2_n_elem->list(n1, σ[ii(n1)])⌝ ), ¬ eP(σ[0]), ¬ eP(σ[ii(n1)]), ¬ eP(f2_n_elem->list(n1, σ[ii(n1)]).last), (finp(σ) ⊃ # σ = ⌜ii(n)⌝ + ⌜1⌝ ∧ (∀ m. n ≤ m → f2_n_elem->list(m, σ[ii(m)]) = [] ∧ ii(n) = ii(m));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ n. ii(n + 1) = ii(n) + # f2_n_elem->list(n, σ[ii(n)]) ∧ ⌜ii(n + 1)⌝ < # σ ∧ (σ from ii(n)) to # f2_n_elem->list(n, σ[ii(n)]) + 1 = ⌜σ[ii(n)] '⌝ + ⌜f2_n_elem->list(n, σ[ii(n)])⌝ ⊦
| ii(0) = 0, ii(n1 + 1) = ii(n1) + # f2_n_elem->list(n1, σ[ii(n1)]), (σ from ii(n1)) to # f2_n_elem->list(n1, σ[ii(n1)]) + 1 = ⌜σ[ii(n1)] '⌝ + ⌜f2_n_elem->list(n1, σ[ii(n1)])⌝ , f2_n_elem->list(n1, σ[ii(n1)]) ≠ [], σ ≠ [], ⌜ii(n1 + 1)⌝ < # σ, eP(σ[ii(n1 + 1)]), pathp(g)(⌜σ[ii(n1)] '⌝ + ⌜f2_n_elem->list(n1, σ[ii(n1)])⌝ ), ¬ eP(σ[0]), ¬ eP(σ[ii(n1)]), ¬ eP(f2_n_elem->list(n1, σ[ii(n1)]).last), (finp(σ) ⊃ # σ = ⌜ii(n)⌝ + ⌜1⌝ ∧ (∀ m. n ≤ m → f2_n_elem->list(m, σ[ii(m)]) = [] ∧ ii(n) = ii(m));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ n. ii(n + 1) = ii(n) + # f2_n_elem->list(n, σ[ii(n)]) ∧ ⌜ii(n + 1)⌝ < # σ ∧ (σ from ii(n)) to # f2_n_elem->list(n, σ[ii(n)]) + 1 = ⌜σ[ii(n)] '⌝ + ⌜f2_n_elem->list(n, σ[ii(n)])⌝ ⊦ |
⊦ σ0 = σ1 ↔ # σ0 = # σ1 ∧ (∀ n. ⌜n⌝ < # σ0 → σ0[n] = σ1[n])
#((σ from ii(n1)) to # f2_n_elem->list(n1, σ[ii(n1)]) + 1) = #(⌜σ[ii(n1)] '⌝ + ⌜f2_n_elem->list(n1, σ[ii(n1)])⌝ ), ii(n1 + 1) = ii(n1) + # f2_n_elem->list(n1, σ[ii(n1)]), ii(0) = 0, f2_n_elem->list(n1, σ[ii(n1)]) ≠ [], σ ≠ [], ⌜ii(n1 + 1)⌝ < # σ, eP(σ[ii(n1 + 1)]), pathp(g)(⌜σ[ii(n1)] '⌝ + ⌜f2_n_elem->list(n1, σ[ii(n1)])⌝ ), ¬ eP(σ[0]), ¬ eP(σ[ii(n1)]), ¬ eP(f2_n_elem->list(n1, σ[ii(n1)]).last), (finp(σ) ⊃ # σ = ⌜ii(n)⌝ + ⌜1⌝ ∧ (∀ m. n ≤ m → f2_n_elem->list(m, σ[ii(m)]) = [] ∧ ii(n) = ii(m));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii(n + 1) = ii(n) + # f2_n_elem->list(n, σ[ii(n)]) ∧ ⌜ii(n + 1)⌝ < # σ ∧ (σ from ii(n)) to # f2_n_elem->list(n, σ[ii(n)]) + 1 = ⌜σ[ii(n)] '⌝ + ⌜f2_n_elem->list(n, σ[ii(n)])⌝ , ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ n. ⌜n⌝ < #((σ from ii(n1)) to # f2_n_elem->list(n1, σ[ii(n1)]) + 1) → ((σ from ii(n1)) to # f2_n_elem->list(n1, σ[ii(n1)]) + 1)[n] = (⌜σ[ii(n1)] '⌝ + ⌜f2_n_elem->list(n1, σ[ii(n1)])⌝ )[n] ⊦
Used terms: ⌜σ[ii(n1)] '⌝ + ⌜f2_n_elem->list(n1, σ[ii(n1)])⌝ , (σ from ii(n1)) to # f2_n_elem->list(n1, σ[ii(n1)]) + 1
| ⊦ σ0 = σ1 ↔ # σ0 = # σ1 ∧ (∀ n. ⌜n⌝ < # σ0 → σ0[n] = σ1[n]) |
| #((σ from ii(n1)) to # f2_n_elem->list(n1, σ[ii(n1)]) + 1) = #(⌜σ[ii(n1)] '⌝ + ⌜f2_n_elem->list(n1, σ[ii(n1)])⌝ ), ii(n1 + 1) = ii(n1) + # f2_n_elem->list(n1, σ[ii(n1)]), ii(0) = 0, f2_n_elem->list(n1, σ[ii(n1)]) ≠ [], σ ≠ [], ⌜ii(n1 + 1)⌝ < # σ, eP(σ[ii(n1 + 1)]), pathp(g)(⌜σ[ii(n1)] '⌝ + ⌜f2_n_elem->list(n1, σ[ii(n1)])⌝ ), ¬ eP(σ[0]), ¬ eP(σ[ii(n1)]), ¬ eP(f2_n_elem->list(n1, σ[ii(n1)]).last), (finp(σ) ⊃ # σ = ⌜ii(n)⌝ + ⌜1⌝ ∧ (∀ m. n ≤ m → f2_n_elem->list(m, σ[ii(m)]) = [] ∧ ii(n) = ii(m));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii(n + 1) = ii(n) + # f2_n_elem->list(n, σ[ii(n)]) ∧ ⌜ii(n + 1)⌝ < # σ ∧ (σ from ii(n)) to # f2_n_elem->list(n, σ[ii(n)]) + 1 = ⌜σ[ii(n)] '⌝ + ⌜f2_n_elem->list(n, σ[ii(n)])⌝ , ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ n. ⌜n⌝ < #((σ from ii(n1)) to # f2_n_elem->list(n1, σ[ii(n1)]) + 1) → ((σ from ii(n1)) to # f2_n_elem->list(n1, σ[ii(n1)]) + 1)[n] = (⌜σ[ii(n1)] '⌝ + ⌜f2_n_elem->list(n1, σ[ii(n1)])⌝ )[n] ⊦ |
#((σ from ii(n1)) to # f2_n_elem->list(n1, σ[ii(n1)]) + 1) = ⌜1⌝ + ⌜# f2_n_elem->list(n1, σ[ii(n1)])⌝ , ii(0) = 0, ii(n1 + 1) = ii(n1) + # f2_n_elem->list(n1, σ[ii(n1)]), f2_n_elem->list(n1, σ[ii(n1)]) ≠ [], σ ≠ [], ⌜ii(n1 + 1)⌝ < # σ, eP(σ[ii(n1 + 1)]), pathp(g)(⌜σ[ii(n1)] '⌝ + ⌜f2_n_elem->list(n1, σ[ii(n1)])⌝ ), ¬ eP(σ[0]), ¬ eP(σ[ii(n1)]), ¬ eP(f2_n_elem->list(n1, σ[ii(n1)]).last), (finp(σ) ⊃ # σ = ⌜ii(n)⌝ + ⌜1⌝ ∧ (∀ m. n ≤ m → f2_n_elem->list(m, σ[ii(m)]) = [] ∧ ii(n) = ii(m));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ n. ii(n + 1) = ii(n) + # f2_n_elem->list(n, σ[ii(n)]) ∧ ⌜ii(n + 1)⌝ < # σ ∧ (σ from ii(n)) to # f2_n_elem->list(n, σ[ii(n)]) + 1 = ⌜σ[ii(n)] '⌝ + ⌜f2_n_elem->list(n, σ[ii(n)])⌝ , ∀ n0. ¬ # f2_n_elem->list(n1, σ[ii(n1)]) < n0 → ((σ from ii(n1)) to # f2_n_elem->list(n1, σ[ii(n1)]) + 1)[n0] = (σ[ii(n1)] ' + f2_n_elem->list(n1, σ[ii(n1)]))[n0] ⊦
Used simplifier rules: append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream ⊦ (⌜x⌝ + ⌜x0⌝ )[m] = (x + x0)[m]; (s) 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) 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 ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ # a ' = 0 +1; (s) ⊦ #(σ + σ1) = # σ + # σ1; (s)
| #((σ from ii(n1)) to # f2_n_elem->list(n1, σ[ii(n1)]) + 1) = ⌜1⌝ + ⌜# f2_n_elem->list(n1, σ[ii(n1)])⌝ , ii(0) = 0, ii(n1 + 1) = ii(n1) + # f2_n_elem->list(n1, σ[ii(n1)]), f2_n_elem->list(n1, σ[ii(n1)]) ≠ [], σ ≠ [], ⌜ii(n1 + 1)⌝ < # σ, eP(σ[ii(n1 + 1)]), pathp(g)(⌜σ[ii(n1)] '⌝ + ⌜f2_n_elem->list(n1, σ[ii(n1)])⌝ ), ¬ eP(σ[0]), ¬ eP(σ[ii(n1)]), ¬ eP(f2_n_elem->list(n1, σ[ii(n1)]).last), (finp(σ) ⊃ # σ = ⌜ii(n)⌝ + ⌜1⌝ ∧ (∀ m. n ≤ m → f2_n_elem->list(m, σ[ii(m)]) = [] ∧ ii(n) = ii(m));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ n. ii(n + 1) = ii(n) + # f2_n_elem->list(n, σ[ii(n)]) ∧ ⌜ii(n + 1)⌝ < # σ ∧ (σ from ii(n)) to # f2_n_elem->list(n, σ[ii(n)]) + 1 = ⌜σ[ii(n)] '⌝ + ⌜f2_n_elem->list(n, σ[ii(n)])⌝ , ∀ n0. ¬ # f2_n_elem->list(n1, σ[ii(n1)]) < n0 → ((σ from ii(n1)) to # f2_n_elem->list(n1, σ[ii(n1)]) + 1)[n0] = (σ[ii(n1)] ' + f2_n_elem->list(n1, σ[ii(n1)]))[n0] ⊦ |
#((σ from ii(n1)) to # f2_n_elem->list(n1, σ[ii(n1)]) + 1) = ⌜1⌝ + ⌜# f2_n_elem->list(n1, σ[ii(n1)])⌝ , ii(n1 + 1) = ii(n1) + # f2_n_elem->list(n1, σ[ii(n1)]), ii(0) = 0, f2_n_elem->list(n1, σ[ii(n1)]) ≠ [], σ ≠ [], ⌜ii(n1 + 1)⌝ < # σ, eP(σ[ii(n1 + 1)]), pathp(g)(⌜σ[ii(n1)] '⌝ + ⌜f2_n_elem->list(n1, σ[ii(n1)])⌝ ), ¬ eP(σ[0]), ¬ eP(σ[ii(n1)]), ¬ eP(f2_n_elem->list(n1, σ[ii(n1)]).last), ¬ # f2_n_elem->list(n1, σ[ii(n1)]) < # f2_n_elem->list(n1, σ[ii(n1)]) → ((σ from ii(n1)) to # f2_n_elem->list(n1, σ[ii(n1)]) + 1)[# f2_n_elem->list(n1, σ[ii(n1)])] = (σ[ii(n1)] ' + f2_n_elem->list(n1, σ[ii(n1)]))[# f2_n_elem->list(n1, σ[ii(n1)])], (finp(σ) ⊃ # σ = ⌜ii(n)⌝ + ⌜1⌝ ∧ (∀ m. n ≤ m → f2_n_elem->list(m, σ[ii(m)]) = [] ∧ ii(n) = ii(m));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii(n + 1) = ii(n) + # f2_n_elem->list(n, σ[ii(n)]) ∧ ⌜ii(n + 1)⌝ < # σ ∧ (σ from ii(n)) to # f2_n_elem->list(n, σ[ii(n)]) + 1 = ⌜σ[ii(n)] '⌝ + ⌜f2_n_elem->list(n, σ[ii(n)])⌝ , ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last) ⊦
Used terms: # f2_n_elem->list(n1, σ[ii(n1)])
| #((σ from ii(n1)) to # f2_n_elem->list(n1, σ[ii(n1)]) + 1) = ⌜1⌝ + ⌜# f2_n_elem->list(n1, σ[ii(n1)])⌝ , ii(n1 + 1) = ii(n1) + # f2_n_elem->list(n1, σ[ii(n1)]), ii(0) = 0, f2_n_elem->list(n1, σ[ii(n1)]) ≠ [], σ ≠ [], ⌜ii(n1 + 1)⌝ < # σ, eP(σ[ii(n1 + 1)]), pathp(g)(⌜σ[ii(n1)] '⌝ + ⌜f2_n_elem->list(n1, σ[ii(n1)])⌝ ), ¬ eP(σ[0]), ¬ eP(σ[ii(n1)]), ¬ eP(f2_n_elem->list(n1, σ[ii(n1)]).last), ¬ # f2_n_elem->list(n1, σ[ii(n1)]) < # f2_n_elem->list(n1, σ[ii(n1)]) → ((σ from ii(n1)) to # f2_n_elem->list(n1, σ[ii(n1)]) + 1)[# f2_n_elem->list(n1, σ[ii(n1)])] = (σ[ii(n1)] ' + f2_n_elem->list(n1, σ[ii(n1)]))[# f2_n_elem->list(n1, σ[ii(n1)])], (finp(σ) ⊃ # σ = ⌜ii(n)⌝ + ⌜1⌝ ∧ (∀ m. n ≤ m → f2_n_elem->list(m, σ[ii(m)]) = [] ∧ ii(n) = ii(m));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii(n + 1) = ii(n) + # f2_n_elem->list(n, σ[ii(n)]) ∧ ⌜ii(n + 1)⌝ < # σ ∧ (σ from ii(n)) to # f2_n_elem->list(n, σ[ii(n)]) + 1 = ⌜σ[ii(n)] '⌝ + ⌜f2_n_elem->list(n, σ[ii(n)])⌝ , ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last) ⊦ |
#((σ from ii(n1)) to # f2_n_elem->list(n1, σ[ii(n1)]) + 1) = ⌜1⌝ + ⌜# f2_n_elem->list(n1, σ[ii(n1)])⌝ , ((σ from ii(n1)) to # f2_n_elem->list(n1, σ[ii(n1)]) + 1)[# f2_n_elem->list(n1, σ[ii(n1)])] = (σ[ii(n1)] ' + f2_n_elem->list(n1, σ[ii(n1)]))[# f2_n_elem->list(n1, σ[ii(n1)])], ii(0) = 0, ii(n1 + 1) = ii(n1) + # f2_n_elem->list(n1, σ[ii(n1)]), f2_n_elem->list(n1, σ[ii(n1)]) ≠ [], σ ≠ [], ⌜ii(n1 + 1)⌝ < # σ, eP(σ[ii(n1 + 1)]), pathp(g)(⌜σ[ii(n1)] '⌝ + ⌜f2_n_elem->list(n1, σ[ii(n1)])⌝ ), ¬ eP(σ[0]), ¬ eP(σ[ii(n1)]), ¬ eP(f2_n_elem->list(n1, σ[ii(n1)]).last), (finp(σ) ⊃ # σ = ⌜ii(n)⌝ + ⌜1⌝ ∧ (∀ m. n ≤ m → f2_n_elem->list(m, σ[ii(m)]) = [] ∧ ii(n) = ii(m));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ n. ii(n + 1) = ii(n) + # f2_n_elem->list(n, σ[ii(n)]) ∧ ⌜ii(n + 1)⌝ < # σ ∧ (σ from ii(n)) to # f2_n_elem->list(n, σ[ii(n)]) + 1 = ⌜σ[ii(n)] '⌝ + ⌜f2_n_elem->list(n, σ[ii(n)])⌝ ⊦
Used simplifier rules: ⊦ ¬ n < n; (s)
| #((σ from ii(n1)) to # f2_n_elem->list(n1, σ[ii(n1)]) + 1) = ⌜1⌝ + ⌜# f2_n_elem->list(n1, σ[ii(n1)])⌝ , ((σ from ii(n1)) to # f2_n_elem->list(n1, σ[ii(n1)]) + 1)[# f2_n_elem->list(n1, σ[ii(n1)])] = (σ[ii(n1)] ' + f2_n_elem->list(n1, σ[ii(n1)]))[# f2_n_elem->list(n1, σ[ii(n1)])], ii(0) = 0, ii(n1 + 1) = ii(n1) + # f2_n_elem->list(n1, σ[ii(n1)]), f2_n_elem->list(n1, σ[ii(n1)]) ≠ [], σ ≠ [], ⌜ii(n1 + 1)⌝ < # σ, eP(σ[ii(n1 + 1)]), pathp(g)(⌜σ[ii(n1)] '⌝ + ⌜f2_n_elem->list(n1, σ[ii(n1)])⌝ ), ¬ eP(σ[0]), ¬ eP(σ[ii(n1)]), ¬ eP(f2_n_elem->list(n1, σ[ii(n1)]).last), (finp(σ) ⊃ # σ = ⌜ii(n)⌝ + ⌜1⌝ ∧ (∀ m. n ≤ m → f2_n_elem->list(m, σ[ii(m)]) = [] ∧ ii(n) = ii(m));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ n. ii(n + 1) = ii(n) + # f2_n_elem->list(n, σ[ii(n)]) ∧ ⌜ii(n + 1)⌝ < # σ ∧ (σ from ii(n)) to # f2_n_elem->list(n, σ[ii(n)]) + 1 = ⌜σ[ii(n)] '⌝ + ⌜f2_n_elem->list(n, σ[ii(n)])⌝ ⊦ |
m < n, ¬ # σ < ⌜n⌝ ⊦ (σ to n)[m] = σ[m]
#((σ from ii(n1)) to # f2_n_elem->list(n1, σ[ii(n1)]) + 1) = ⌜1⌝ + ⌜# f2_n_elem->list(n1, σ[ii(n1)])⌝ , ((σ from ii(n1)) to # f2_n_elem->list(n1, σ[ii(n1)]) + 1)[# f2_n_elem->list(n1, σ[ii(n1)])] = (σ[ii(n1)] ' + f2_n_elem->list(n1, σ[ii(n1)]))[# f2_n_elem->list(n1, σ[ii(n1)])], ii(n1 + 1) = ii(n1) + # f2_n_elem->list(n1, σ[ii(n1)]), ii(0) = 0, f2_n_elem->list(n1, σ[ii(n1)]) ≠ [], σ ≠ [], ⌜ii(n1 + 1)⌝ < # σ, eP(σ[ii(n1 + 1)]), pathp(g)(⌜σ[ii(n1)] '⌝ + ⌜f2_n_elem->list(n1, σ[ii(n1)])⌝ ), ¬ eP(σ[0]), ¬ eP(σ[ii(n1)]), ¬ eP(f2_n_elem->list(n1, σ[ii(n1)]).last), (finp(σ) ⊃ # σ = ⌜ii(n)⌝ + ⌜1⌝ ∧ (∀ m. n ≤ m → f2_n_elem->list(m, σ[ii(m)]) = [] ∧ ii(n) = ii(m));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii(n + 1) = ii(n) + # f2_n_elem->list(n, σ[ii(n)]) ∧ ⌜ii(n + 1)⌝ < # σ ∧ (σ from ii(n)) to # f2_n_elem->list(n, σ[ii(n)]) + 1 = ⌜σ[ii(n)] '⌝ + ⌜f2_n_elem->list(n, σ[ii(n)])⌝ , ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last) ⊦ # f2_n_elem->list(n1, σ[ii(n1)]) < # f2_n_elem->list(n1, σ[ii(n1)]) + 1 ∧ ¬ #(σ from ii(n1)) < ⌜# f2_n_elem->list(n1, σ[ii(n1)]) + 1⌝
#((σ from ii(n1)) to # f2_n_elem->list(n1, σ[ii(n1)]) + 1) = ⌜1⌝ + ⌜# f2_n_elem->list(n1, σ[ii(n1)])⌝ , (σ from ii(n1))[# f2_n_elem->list(n1, σ[ii(n1)])] = (σ[ii(n1)] ' + f2_n_elem->list(n1, σ[ii(n1)]))[# f2_n_elem->list(n1, σ[ii(n1)])], ii(n1 + 1) = ii(n1) + # f2_n_elem->list(n1, σ[ii(n1)]), ii(0) = 0, f2_n_elem->list(n1, σ[ii(n1)]) ≠ [], σ ≠ [], ⌜ii(n1 + 1)⌝ < # σ, # f2_n_elem->list(n1, σ[ii(n1)]) < # f2_n_elem->list(n1, σ[ii(n1)]) + 1, eP(σ[ii(n1 + 1)]), pathp(g)(⌜σ[ii(n1)] '⌝ + ⌜f2_n_elem->list(n1, σ[ii(n1)])⌝ ), ¬ #(σ from ii(n1)) < ⌜# f2_n_elem->list(n1, σ[ii(n1)]) + 1⌝ , ¬ eP(σ[0]), ¬ eP(σ[ii(n1)]), ¬ eP(f2_n_elem->list(n1, σ[ii(n1)]).last), (finp(σ) ⊃ # σ = ⌜ii(n)⌝ + ⌜1⌝ ∧ (∀ m. n ≤ m → f2_n_elem->list(m, σ[ii(m)]) = [] ∧ ii(n) = ii(m));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii(n + 1) = ii(n) + # f2_n_elem->list(n, σ[ii(n)]) ∧ ⌜ii(n + 1)⌝ < # σ ∧ (σ from ii(n)) to # f2_n_elem->list(n, σ[ii(n)]) + 1 = ⌜σ[ii(n)] '⌝ + ⌜f2_n_elem->list(n, σ[ii(n)])⌝ , ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last) ⊦
Used terms: # f2_n_elem->list(n1, σ[ii(n1)]), # f2_n_elem->list(n1, σ[ii(n1)]) + 1, σ from ii(n1)
| m < n, ¬ # σ < ⌜n⌝ ⊦ (σ to n)[m] = σ[m] |
| #((σ from ii(n1)) to # f2_n_elem->list(n1, σ[ii(n1)]) + 1) = ⌜1⌝ + ⌜# f2_n_elem->list(n1, σ[ii(n1)])⌝ , ((σ from ii(n1)) to # f2_n_elem->list(n1, σ[ii(n1)]) + 1)[# f2_n_elem->list(n1, σ[ii(n1)])] = (σ[ii(n1)] ' + f2_n_elem->list(n1, σ[ii(n1)]))[# f2_n_elem->list(n1, σ[ii(n1)])], ii(n1 + 1) = ii(n1) + # f2_n_elem->list(n1, σ[ii(n1)]), ii(0) = 0, f2_n_elem->list(n1, σ[ii(n1)]) ≠ [], σ ≠ [], ⌜ii(n1 + 1)⌝ < # σ, eP(σ[ii(n1 + 1)]), pathp(g)(⌜σ[ii(n1)] '⌝ + ⌜f2_n_elem->list(n1, σ[ii(n1)])⌝ ), ¬ eP(σ[0]), ¬ eP(σ[ii(n1)]), ¬ eP(f2_n_elem->list(n1, σ[ii(n1)]).last), (finp(σ) ⊃ # σ = ⌜ii(n)⌝ + ⌜1⌝ ∧ (∀ m. n ≤ m → f2_n_elem->list(m, σ[ii(m)]) = [] ∧ ii(n) = ii(m));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii(n + 1) = ii(n) + # f2_n_elem->list(n, σ[ii(n)]) ∧ ⌜ii(n + 1)⌝ < # σ ∧ (σ from ii(n)) to # f2_n_elem->list(n, σ[ii(n)]) + 1 = ⌜σ[ii(n)] '⌝ + ⌜f2_n_elem->list(n, σ[ii(n)])⌝ , ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last) ⊦ # f2_n_elem->list(n1, σ[ii(n1)]) < # f2_n_elem->list(n1, σ[ii(n1)]) + 1 ∧ ¬ #(σ from ii(n1)) < ⌜# f2_n_elem->list(n1, σ[ii(n1)]) + 1⌝ |
#((σ from ii(n1)) to # f2_n_elem->list(n1, σ[ii(n1)]) + 1) = ⌜1⌝ + ⌜# f2_n_elem->list(n1, σ[ii(n1)])⌝ , ((σ from ii(n1)) to # f2_n_elem->list(n1, σ[ii(n1)]) + 1)[# f2_n_elem->list(n1, σ[ii(n1)])] = (σ[ii(n1)] ' + f2_n_elem->list(n1, σ[ii(n1)]))[# f2_n_elem->list(n1, σ[ii(n1)])], ii(0) = 0, ii(n1 + 1) = ii(n1) + # f2_n_elem->list(n1, σ[ii(n1)]), f2_n_elem->list(n1, σ[ii(n1)]) ≠ [], σ ≠ [], ⌜ii(n1 + 1)⌝ < # σ, eP(σ[ii(n1 + 1)]), pathp(g)(⌜σ[ii(n1)] '⌝ + ⌜f2_n_elem->list(n1, σ[ii(n1)])⌝ ), ¬ ⌜# f2_n_elem->list(n1, σ[ii(n1)])⌝ < #(σ from ii(n1)), ¬ eP(σ[0]), ¬ eP(σ[ii(n1)]), ¬ eP(f2_n_elem->list(n1, σ[ii(n1)]).last), (finp(σ) ⊃ # σ = ⌜ii(n)⌝ + ⌜1⌝ ∧ (∀ m. n ≤ m → f2_n_elem->list(m, σ[ii(m)]) = [] ∧ ii(n) = ii(m));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ n. ii(n + 1) = ii(n) + # f2_n_elem->list(n, σ[ii(n)]) ∧ ⌜ii(n + 1)⌝ < # σ ∧ (σ from ii(n)) to # f2_n_elem->list(n, σ[ii(n)]) + 1 = ⌜σ[ii(n)] '⌝ + ⌜f2_n_elem->list(n, σ[ii(n)])⌝ ⊦
Used simplifier rules: 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⌝ + ⌜1⌝ ↔ ¬ ⌜n⌝ < # σ; (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) ⊦ ¬ n < n; (s) ⊦ m < n + 1 ↔ ¬ n < m; (s)
| #((σ from ii(n1)) to # f2_n_elem->list(n1, σ[ii(n1)]) + 1) = ⌜1⌝ + ⌜# f2_n_elem->list(n1, σ[ii(n1)])⌝ , ((σ from ii(n1)) to # f2_n_elem->list(n1, σ[ii(n1)]) + 1)[# f2_n_elem->list(n1, σ[ii(n1)])] = (σ[ii(n1)] ' + f2_n_elem->list(n1, σ[ii(n1)]))[# f2_n_elem->list(n1, σ[ii(n1)])], ii(0) = 0, ii(n1 + 1) = ii(n1) + # f2_n_elem->list(n1, σ[ii(n1)]), f2_n_elem->list(n1, σ[ii(n1)]) ≠ [], σ ≠ [], ⌜ii(n1 + 1)⌝ < # σ, eP(σ[ii(n1 + 1)]), pathp(g)(⌜σ[ii(n1)] '⌝ + ⌜f2_n_elem->list(n1, σ[ii(n1)])⌝ ), ¬ ⌜# f2_n_elem->list(n1, σ[ii(n1)])⌝ < #(σ from ii(n1)), ¬ eP(σ[0]), ¬ eP(σ[ii(n1)]), ¬ eP(f2_n_elem->list(n1, σ[ii(n1)]).last), (finp(σ) ⊃ # σ = ⌜ii(n)⌝ + ⌜1⌝ ∧ (∀ m. n ≤ m → f2_n_elem->list(m, σ[ii(m)]) = [] ∧ ii(n) = ii(m));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ n. ii(n + 1) = ii(n) + # f2_n_elem->list(n, σ[ii(n)]) ∧ ⌜ii(n + 1)⌝ < # σ ∧ (σ from ii(n)) to # f2_n_elem->list(n, σ[ii(n)]) + 1 = ⌜σ[ii(n)] '⌝ + ⌜f2_n_elem->list(n, σ[ii(n)])⌝ ⊦ |
Used simplifier rules: stream freely generated by ⌜ ⌝, ⌜ ⌝;; ⊦ ⌜x⌝ [n] = x[n]; (s) ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ ¬ n < n; (s) m < n ⊦ (nf to n)[m] = nf(m); (s) ⊦ ((nf from n))(m) = nf(m + n); (s) ⊦ ⌜nf⌝ to n = ⌜nf to n⌝ ; (s) ⊦ # ⌜nf to n⌝ = ⌜n⌝ ; (s) ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic ⊦ m ≤ n → (⌜(* n)⌝ + n∞1 = ⌜(* m)⌝ + n∞2 ↔ ⌜n - m⌝ + n∞1 = n∞2); (s) ⊦ n∞ + ⌜0⌝ = n∞; (s) ⊦ ⌜n⌝ = ⌜n0⌝ ↔ n = n0; (s) add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf ⊦ [] ≠ ⌜nf⌝ ; (s) ⊦ ⌜nf⌝ [n] = nf(n); (s) ⊦ ⌜nf⌝ from n = ⌜nf from n⌝ ; (s) ⊦ # ⌜nf⌝ = ∞; (s) ⊦ ⌜m⌝ < ∞; (s) ⊦ ⌜x⌝ = [] ↔ x = []; (s) ⊦ x ≠ [] → x[0] = x.head; (s) ⊦ ⌜m⌝ < ⌜n⌝ ↔ m < n; (s) ⊦ ⌜x⌝ from n = ⌜x from n⌝ ; (s) ⊦ ⌜x⌝ to n = ⌜x to n⌝ ; (s) ⊦ ⌜x⌝ + ⌜y⌝ = ⌜z⌝ ↔ x + y = z; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream ⊦ finp(⌜x⌝ ); (s) ⊦ # ⌜x⌝ = ⌜# x⌝ ; (s) ⊦ ⌜n⌝ + ⌜m⌝ = ⌜n0⌝ ↔ n + m = n0; (s) ⊦ # x = 0 ↔ x = []; (s) ¬ # x < n ⊦ #(x from n) = # x - n; (s) ⊦ m ≤ n ↔ ¬ n < m; (ss) ⊦ m < n ↔ ¬ n ≤ m; (ss) lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic lf: ⊦ m < n ∧ n < n0 → m +1 < n0; (forward) from specification nat-basic trans: ⊦ n < n0 ∧ n0 < n1 → n < n1; (forward) from specification nat-basic f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic lf-02: ⊦ m < n ∧ m = n0 → n0 < n; (forward) from specification nat-basic ⊦ m < n → n ≠ 0; (s) ⊦ m +1 = m + 1; (s) ⊦ m + m0 < n → ¬ n + n0 < m; (s) n0 ≤ n ⊦ n - n0 ≤ m ↔ n ≤ m + n0; (s) ⊦ m < n → (n ≤ m ↔ false); (s)
| #((σ from ii(n1)) to # f2_n_elem->list(n1, σ[ii(n1)]) + 1) = ⌜1⌝ + ⌜# f2_n_elem->list(n1, σ[ii(n1)])⌝ , (σ from ii(n1))[# f2_n_elem->list(n1, σ[ii(n1)])] = (σ[ii(n1)] ' + f2_n_elem->list(n1, σ[ii(n1)]))[# f2_n_elem->list(n1, σ[ii(n1)])], ii(n1 + 1) = ii(n1) + # f2_n_elem->list(n1, σ[ii(n1)]), ii(0) = 0, f2_n_elem->list(n1, σ[ii(n1)]) ≠ [], σ ≠ [], ⌜ii(n1 + 1)⌝ < # σ, # f2_n_elem->list(n1, σ[ii(n1)]) < # f2_n_elem->list(n1, σ[ii(n1)]) + 1, eP(σ[ii(n1 + 1)]), pathp(g)(⌜σ[ii(n1)] '⌝ + ⌜f2_n_elem->list(n1, σ[ii(n1)])⌝ ), ¬ #(σ from ii(n1)) < ⌜# f2_n_elem->list(n1, σ[ii(n1)]) + 1⌝ , ¬ eP(σ[0]), ¬ eP(σ[ii(n1)]), ¬ eP(f2_n_elem->list(n1, σ[ii(n1)]).last), (finp(σ) ⊃ # σ = ⌜ii(n)⌝ + ⌜1⌝ ∧ (∀ m. n ≤ m → f2_n_elem->list(m, σ[ii(m)]) = [] ∧ ii(n) = ii(m));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii(n + 1) = ii(n) + # f2_n_elem->list(n, σ[ii(n)]) ∧ ⌜ii(n + 1)⌝ < # σ ∧ (σ from ii(n)) to # f2_n_elem->list(n, σ[ii(n)]) + 1 = ⌜σ[ii(n)] '⌝ + ⌜f2_n_elem->list(n, σ[ii(n)])⌝ , ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last) ⊦ |
(σ from ii(n1))[# f2_n_elem->list(n1, σ[ii(n1)])] = (σ[ii(n1)] ' + f2_n_elem->list(n1, σ[ii(n1)]))[# f2_n_elem->list(n1, σ[ii(n1)])], ii(0) = 0, ii(n1 + 1) = ii(n1) + # f2_n_elem->list(n1, σ[ii(n1)]), f2_n_elem->list(n1, σ[ii(n1)]) ≠ [], σ ≠ [], ⌜ii(n1 + 1)⌝ < # σ, ⌜# f2_n_elem->list(n1, σ[ii(n1)])⌝ < #(σ from ii(n1)), eP(σ[ii(n1 + 1)]), pathp(g)(⌜σ[ii(n1)] '⌝ + ⌜f2_n_elem->list(n1, σ[ii(n1)])⌝ ), ¬ eP(σ[0]), ¬ eP(σ[ii(n1)]), ¬ eP(f2_n_elem->list(n1, σ[ii(n1)]).last), (finp(σ) ⊃ # σ = ⌜ii(n)⌝ + ⌜1⌝ ∧ (∀ m. n ≤ m → f2_n_elem->list(m, σ[ii(m)]) = [] ∧ ii(n) = ii(m));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ n. ii(n + 1) = ii(n) + # f2_n_elem->list(n, σ[ii(n)]) ∧ ⌜ii(n + 1)⌝ < # σ ∧ (σ from ii(n)) to # f2_n_elem->list(n, σ[ii(n)]) + 1 = ⌜σ[ii(n)] '⌝ + ⌜f2_n_elem->list(n, σ[ii(n)])⌝ ⊦
Used simplifier rules: 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⌝ + ⌜1⌝ ↔ ¬ ⌜n⌝ < # σ; (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) ⊦ ¬ n < n; (s) ⊦ m < n + 1 ↔ ¬ n < m; (s) ⊦ ⌜n⌝ = ⌜n0⌝ ↔ n = n0; (s) ⊦ n∞ + ⌜0⌝ = n∞; (s) ⊦ m ≤ n → (⌜(* n)⌝ + n∞1 = ⌜(* m)⌝ + n∞2 ↔ ⌜n - m⌝ + n∞1 = n∞2); (s) ¬ # σ < ⌜n⌝ ⊦ #(σ to n) = ⌜n⌝ ; (s)
| (σ from ii(n1))[# f2_n_elem->list(n1, σ[ii(n1)])] = (σ[ii(n1)] ' + f2_n_elem->list(n1, σ[ii(n1)]))[# f2_n_elem->list(n1, σ[ii(n1)])], ii(0) = 0, ii(n1 + 1) = ii(n1) + # f2_n_elem->list(n1, σ[ii(n1)]), f2_n_elem->list(n1, σ[ii(n1)]) ≠ [], σ ≠ [], ⌜ii(n1 + 1)⌝ < # σ, ⌜# f2_n_elem->list(n1, σ[ii(n1)])⌝ < #(σ from ii(n1)), eP(σ[ii(n1 + 1)]), pathp(g)(⌜σ[ii(n1)] '⌝ + ⌜f2_n_elem->list(n1, σ[ii(n1)])⌝ ), ¬ eP(σ[0]), ¬ eP(σ[ii(n1)]), ¬ eP(f2_n_elem->list(n1, σ[ii(n1)]).last), (finp(σ) ⊃ # σ = ⌜ii(n)⌝ + ⌜1⌝ ∧ (∀ m. n ≤ m → f2_n_elem->list(m, σ[ii(m)]) = [] ∧ ii(n) = ii(m));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ n. ii(n + 1) = ii(n) + # f2_n_elem->list(n, σ[ii(n)]) ∧ ⌜ii(n + 1)⌝ < # σ ∧ (σ from ii(n)) to # f2_n_elem->list(n, σ[ii(n)]) + 1 = ⌜σ[ii(n)] '⌝ + ⌜f2_n_elem->list(n, σ[ii(n)])⌝ ⊦ |
⊦ ⌜n⌝ + ⌜m⌝ < # σ → (σ from n)[m] = σ[n + m]
σ[ii(n1) + # f2_n_elem->list(n1, σ[ii(n1)])] = (σ[ii(n1)] ' + f2_n_elem->list(n1, σ[ii(n1)]))[# f2_n_elem->list(n1, σ[ii(n1)])], ii(n1 + 1) = ii(n1) + # f2_n_elem->list(n1, σ[ii(n1)]), ii(0) = 0, f2_n_elem->list(n1, σ[ii(n1)]) ≠ [], σ ≠ [], ⌜# f2_n_elem->list(n1, σ[ii(n1)])⌝ < #(σ from ii(n1)), ⌜ii(n1 + 1)⌝ < # σ, ⌜ii(n1)⌝ + ⌜# f2_n_elem->list(n1, σ[ii(n1)])⌝ < # σ, eP(σ[ii(n1 + 1)]), pathp(g)(⌜σ[ii(n1)] '⌝ + ⌜f2_n_elem->list(n1, σ[ii(n1)])⌝ ), ¬ eP(σ[0]), ¬ eP(σ[ii(n1)]), ¬ eP(f2_n_elem->list(n1, σ[ii(n1)]).last), (finp(σ) ⊃ # σ = ⌜ii(n)⌝ + ⌜1⌝ ∧ (∀ m. n ≤ m → f2_n_elem->list(m, σ[ii(m)]) = [] ∧ ii(n) = ii(m));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii(n + 1) = ii(n) + # f2_n_elem->list(n, σ[ii(n)]) ∧ ⌜ii(n + 1)⌝ < # σ ∧ (σ from ii(n)) to # f2_n_elem->list(n, σ[ii(n)]) + 1 = ⌜σ[ii(n)] '⌝ + ⌜f2_n_elem->list(n, σ[ii(n)])⌝ , ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last) ⊦
Used simplifier rules: ⊦ ⌜n⌝ < ⌜m⌝ + ⌜n0⌝ ↔ n < m + n0; (s) add-assoc: ⊦ (n∞ + n∞1) + n∞2 = n∞ + n∞1 + n∞2; from specification nat-inf add-comm: ⊦ n∞1 + n∞2 = n∞2 + n∞1; from specification nat-inf f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic lf-02: ⊦ m < n ∧ m = n0 → n0 < n; (forward) from specification nat-basic lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic lsle-trans: ⊦ n∞ < n∞1 ∧ ¬ n∞2 < n∞1 → n∞ < n∞2; (forward) from specification nat-inf ⊦ m < n → n ≠ 0; (s) ⊦ m + n < m + n0 ↔ n < n0; (s) ⊦ ¬ n < n; (s) ⌜n⌝ < # σ ⊦ ⌜n0⌝ < #(σ from n) ↔ ⌜n0 + n⌝ < # σ; (s) ⊦ ⌜m + n⌝ = ⌜m⌝ + ⌜n⌝ ; (s) a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic c: ⊦ m + n = n + m; from specification nat-basic ⊦ ⌜n⌝ + ⌜m⌝ < # σ → (σ from n)[m] = σ[n + m]; (s) Used terms: # f2_n_elem->list(n1, σ[ii(n1)]), ii(n1), σ
| ⊦ ⌜n⌝ + ⌜m⌝ < # σ → (σ from n)[m] = σ[n + m] |
| σ[ii(n1) + # f2_n_elem->list(n1, σ[ii(n1)])] = (σ[ii(n1)] ' + f2_n_elem->list(n1, σ[ii(n1)]))[# f2_n_elem->list(n1, σ[ii(n1)])], ii(n1 + 1) = ii(n1) + # f2_n_elem->list(n1, σ[ii(n1)]), ii(0) = 0, f2_n_elem->list(n1, σ[ii(n1)]) ≠ [], σ ≠ [], ⌜# f2_n_elem->list(n1, σ[ii(n1)])⌝ < #(σ from ii(n1)), ⌜ii(n1 + 1)⌝ < # σ, ⌜ii(n1)⌝ + ⌜# f2_n_elem->list(n1, σ[ii(n1)])⌝ < # σ, eP(σ[ii(n1 + 1)]), pathp(g)(⌜σ[ii(n1)] '⌝ + ⌜f2_n_elem->list(n1, σ[ii(n1)])⌝ ), ¬ eP(σ[0]), ¬ eP(σ[ii(n1)]), ¬ eP(f2_n_elem->list(n1, σ[ii(n1)]).last), (finp(σ) ⊃ # σ = ⌜ii(n)⌝ + ⌜1⌝ ∧ (∀ m. n ≤ m → f2_n_elem->list(m, σ[ii(m)]) = [] ∧ ii(n) = ii(m));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n. ii(n + 1) = ii(n) + # f2_n_elem->list(n, σ[ii(n)]) ∧ ⌜ii(n + 1)⌝ < # σ ∧ (σ from ii(n)) to # f2_n_elem->list(n, σ[ii(n)]) + 1 = ⌜σ[ii(n)] '⌝ + ⌜f2_n_elem->list(n, σ[ii(n)])⌝ , ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last) ⊦ |
σ[ii(n1 + 1)] = (σ[ii(n1)] ' + f2_n_elem->list(n1, σ[ii(n1)]))[# f2_n_elem->list(n1, σ[ii(n1)])], ii(0) = 0, ii(n1 + 1) = ii(n1) + # f2_n_elem->list(n1, σ[ii(n1)]), f2_n_elem->list(n1, σ[ii(n1)]) ≠ [], σ ≠ [], ⌜ii(n1)⌝ + ⌜# f2_n_elem->list(n1, σ[ii(n1)])⌝ < # σ, ⌜ii(n1 + 1)⌝ < # σ, ⌜# f2_n_elem->list(n1, σ[ii(n1)])⌝ + ⌜ii(n1)⌝ < # σ, eP(σ[ii(n1 + 1)]), pathp(g)(⌜σ[ii(n1)] '⌝ + ⌜f2_n_elem->list(n1, σ[ii(n1)])⌝ ), ¬ eP(σ[0]), ¬ eP(σ[ii(n1)]), ¬ eP(f2_n_elem->list(n1, σ[ii(n1)]).last), (finp(σ) ⊃ # σ = ⌜ii(n)⌝ + ⌜1⌝ ∧ (∀ m. n ≤ m → f2_n_elem->list(m, σ[ii(m)]) = [] ∧ ii(n) = ii(m));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ n. ii(n + 1) = ii(n) + # f2_n_elem->list(n, σ[ii(n)]) ∧ ⌜ii(n + 1)⌝ < # σ ∧ (σ from ii(n)) to # f2_n_elem->list(n, σ[ii(n)]) + 1 = ⌜σ[ii(n)] '⌝ + ⌜f2_n_elem->list(n, σ[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⌝ = ⌜m⌝ + ⌜n⌝ ; (s) ⌜n⌝ < # σ ⊦ ⌜n0⌝ < #(σ from n) ↔ ⌜n0 + 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 ⊦ ¬ m + n < m; (s) ⊦ ⌜n⌝ + ⌜m⌝ < ⌜n0⌝ ↔ n + m < n0; (s) lsle-trans: ⊦ n∞ < n∞1 ∧ ¬ n∞2 < n∞1 → n∞ < n∞2; (forward) from specification nat-inf
| σ[ii(n1 + 1)] = (σ[ii(n1)] ' + f2_n_elem->list(n1, σ[ii(n1)]))[# f2_n_elem->list(n1, σ[ii(n1)])], ii(0) = 0, ii(n1 + 1) = ii(n1) + # f2_n_elem->list(n1, σ[ii(n1)]), f2_n_elem->list(n1, σ[ii(n1)]) ≠ [], σ ≠ [], ⌜ii(n1)⌝ + ⌜# f2_n_elem->list(n1, σ[ii(n1)])⌝ < # σ, ⌜ii(n1 + 1)⌝ < # σ, ⌜# f2_n_elem->list(n1, σ[ii(n1)])⌝ + ⌜ii(n1)⌝ < # σ, eP(σ[ii(n1 + 1)]), pathp(g)(⌜σ[ii(n1)] '⌝ + ⌜f2_n_elem->list(n1, σ[ii(n1)])⌝ ), ¬ eP(σ[0]), ¬ eP(σ[ii(n1)]), ¬ eP(f2_n_elem->list(n1, σ[ii(n1)]).last), (finp(σ) ⊃ # σ = ⌜ii(n)⌝ + ⌜1⌝ ∧ (∀ m. n ≤ m → f2_n_elem->list(m, σ[ii(m)]) = [] ∧ ii(n) = ii(m));∀ n. ∃ m. ii(m) ≤ n ∧ n < ii(m + 1)), ∀ n, a0. ¬ eP(a0) → pathp(g)(⌜a0 '⌝ + ⌜f2_n_elem->list(n, a0)⌝ ) ∧ f2_n_elem->list(n, a0) ≠ [] ∧ ¬ eP(f2_n_elem->list(n, a0).last), ∀ n. ii(n + 1) = ii(n) + # f2_n_elem->list(n, σ[ii(n)]) ∧ ⌜ii(n + 1)⌝ < # σ ∧ (σ from ii(n)) to # f2_n_elem->list(n, σ[ii(n)]) + 1 = ⌜σ[ii(n)] '⌝ + ⌜f2_n_elem->list(n, σ[ii(n)])⌝ ⊦ |
⊦ (a ' + x)[# x] = (a ' + x).last
Used simplifier rules: ⊦ x ≠ [] → (a ' + x).last = x.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list Used terms: f2_n_elem->list(n1, σ[ii(n1)]), σ[ii(n1)]
| ⊦ (a ' + x)[# x] = (a ' + x).last |
| findepth(g), rooted(g), ¬ eP(a), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a) ⊦ ∀ n, a. ¬ eP(a) → (∃ y. pathp(g)(⌜a '⌝ + ⌜y⌝ ) ∧ y ≠ [] ∧ ¬ eP(y.last)) |
findepth(g), rooted(g), ¬ eP(a0), ¬ eP(a), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a) ⊦ ∃ y. pathp(g)(⌜a0 '⌝ + ⌜y⌝ ) ∧ y ≠ [] ∧ ¬ eP(y.last)
| findepth(g), rooted(g), ¬ eP(a0), ¬ eP(a), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a) ⊦ ∃ y. pathp(g)(⌜a0 '⌝ + ⌜y⌝ ) ∧ y ≠ [] ∧ ¬ eP(y.last) |
findepth(g), rooted(g), ¬ eP(a0), ¬ eP(a), (∀ b. ls(g)(b, a0) → eP(b)) → eP(a0), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a) ⊦ ∃ y. pathp(g)(⌜a0 '⌝ + ⌜y⌝ ) ∧ y ≠ [] ∧ ¬ eP(y.last)
Used terms: a0
| findepth(g), rooted(g), ¬ eP(a0), ¬ eP(a), (∀ b. ls(g)(b, a0) → eP(b)) → eP(a0), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a) ⊦ ∃ y. pathp(g)(⌜a0 '⌝ + ⌜y⌝ ) ∧ y ≠ [] ∧ ¬ eP(y.last) |
findepth(g), ls(g)(a1, a0), rooted(g), ¬ eP(a0), ¬ eP(a), ¬ eP(a1), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a) ⊦ ∃ y. pathp(g)(⌜a0 '⌝ + ⌜y⌝ ) ∧ y ≠ [] ∧ ¬ eP(y.last)
| findepth(g), ls(g)(a1, a0), rooted(g), ¬ eP(a0), ¬ eP(a), ¬ eP(a1), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a) ⊦ ∃ y. pathp(g)(⌜a0 '⌝ + ⌜y⌝ ) ∧ y ≠ [] ∧ ¬ eP(y.last) |
⊦ ls(g)(a, b) ↔ (∃ y. pathp(g)(⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ ))
findepth(g), rooted(g), ¬ eP(a0), ¬ eP(a), ¬ eP(a1), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∃ y. pathp(g)(⌜a0 '⌝ + ⌜y⌝ + ⌜a1 '⌝ ) ⊦ ∃ y. pathp(g)(⌜a0 '⌝ + ⌜y⌝ ) ∧ y ≠ [] ∧ ¬ eP(y.last)
Used terms: a0, a1, g
| ⊦ ls(g)(a, b) ↔ (∃ y. pathp(g)(⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ )) |
| findepth(g), rooted(g), ¬ eP(a0), ¬ eP(a), ¬ eP(a1), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a), ∃ y. pathp(g)(⌜a0 '⌝ + ⌜y⌝ + ⌜a1 '⌝ ) ⊦ ∃ y. pathp(g)(⌜a0 '⌝ + ⌜y⌝ ) ∧ y ≠ [] ∧ ¬ eP(y.last) |
findepth(g), pathp(g)(⌜a0 '⌝ + ⌜y⌝ + ⌜a1 '⌝ ), rooted(g), ¬ eP(a0), ¬ eP(a), ¬ eP(a1), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a) ⊦ ∃ y. pathp(g)(⌜a0 '⌝ + ⌜y⌝ ) ∧ y ≠ [] ∧ ¬ eP(y.last)
| findepth(g), pathp(g)(⌜a0 '⌝ + ⌜y⌝ + ⌜a1 '⌝ ), rooted(g), ¬ eP(a0), ¬ eP(a), ¬ eP(a1), ∀ a. (∀ b. ls(g)(b, a) → eP(b)) → eP(a) ⊦ ∃ y. pathp(g)(⌜a0 '⌝ + ⌜y⌝ ) ∧ y ≠ [] ∧ ¬ eP(y.last) |
Used simplifier rules: ⊦ ⌜x + y⌝ = ⌜x⌝ + ⌜y⌝ ; (s) append-assoc: ⊦ (σ + σ1) + σ2 = σ + σ1 + σ2; from specification stream ⊦ x + a ' ≠ []; (s) ⊦ (x + a ').last = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list Used terms: y + a1 '
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.