a__from(X) → cons(mark(X), from(s(X)))
a__length(nil) → 0
a__length(cons(X, Y)) → s(a__length1(Y))
a__length1(X) → a__length(X)
mark(from(X)) → a__from(mark(X))
mark(length(X)) → a__length(X)
mark(length1(X)) → a__length1(X)
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(s(X)) → s(mark(X))
mark(nil) → nil
mark(0) → 0
a__from(X) → from(X)
a__length(X) → length(X)
a__length1(X) → length1(X)
↳ QTRS
↳ DependencyPairsProof
a__from(X) → cons(mark(X), from(s(X)))
a__length(nil) → 0
a__length(cons(X, Y)) → s(a__length1(Y))
a__length1(X) → a__length(X)
mark(from(X)) → a__from(mark(X))
mark(length(X)) → a__length(X)
mark(length1(X)) → a__length1(X)
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(s(X)) → s(mark(X))
mark(nil) → nil
mark(0) → 0
a__from(X) → from(X)
a__length(X) → length(X)
a__length1(X) → length1(X)
MARK(from(X)) → MARK(X)
MARK(from(X)) → A__FROM(mark(X))
MARK(s(X)) → MARK(X)
MARK(length1(X)) → A__LENGTH1(X)
A__LENGTH(cons(X, Y)) → A__LENGTH1(Y)
MARK(cons(X1, X2)) → MARK(X1)
A__FROM(X) → MARK(X)
MARK(length(X)) → A__LENGTH(X)
A__LENGTH1(X) → A__LENGTH(X)
a__from(X) → cons(mark(X), from(s(X)))
a__length(nil) → 0
a__length(cons(X, Y)) → s(a__length1(Y))
a__length1(X) → a__length(X)
mark(from(X)) → a__from(mark(X))
mark(length(X)) → a__length(X)
mark(length1(X)) → a__length1(X)
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(s(X)) → s(mark(X))
mark(nil) → nil
mark(0) → 0
a__from(X) → from(X)
a__length(X) → length(X)
a__length1(X) → length1(X)
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
MARK(from(X)) → MARK(X)
MARK(from(X)) → A__FROM(mark(X))
MARK(s(X)) → MARK(X)
MARK(length1(X)) → A__LENGTH1(X)
A__LENGTH(cons(X, Y)) → A__LENGTH1(Y)
MARK(cons(X1, X2)) → MARK(X1)
A__FROM(X) → MARK(X)
MARK(length(X)) → A__LENGTH(X)
A__LENGTH1(X) → A__LENGTH(X)
a__from(X) → cons(mark(X), from(s(X)))
a__length(nil) → 0
a__length(cons(X, Y)) → s(a__length1(Y))
a__length1(X) → a__length(X)
mark(from(X)) → a__from(mark(X))
mark(length(X)) → a__length(X)
mark(length1(X)) → a__length1(X)
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(s(X)) → s(mark(X))
mark(nil) → nil
mark(0) → 0
a__from(X) → from(X)
a__length(X) → length(X)
a__length1(X) → length1(X)
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDPOrderProof
↳ QDP
A__LENGTH(cons(X, Y)) → A__LENGTH1(Y)
A__LENGTH1(X) → A__LENGTH(X)
a__from(X) → cons(mark(X), from(s(X)))
a__length(nil) → 0
a__length(cons(X, Y)) → s(a__length1(Y))
a__length1(X) → a__length(X)
mark(from(X)) → a__from(mark(X))
mark(length(X)) → a__length(X)
mark(length1(X)) → a__length1(X)
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(s(X)) → s(mark(X))
mark(nil) → nil
mark(0) → 0
a__from(X) → from(X)
a__length(X) → length(X)
a__length1(X) → length1(X)
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
A__LENGTH(cons(X, Y)) → A__LENGTH1(Y)
A__LENGTH1(X) → A__LENGTH(X)
The value of delta used in the strict ordering is 2.
POL(A__LENGTH(x1)) = (2)x_1
POL(cons(x1, x2)) = 4 + x_2
POL(A__LENGTH1(x1)) = 2 + (2)x_1
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ PisEmptyProof
↳ QDP
a__from(X) → cons(mark(X), from(s(X)))
a__length(nil) → 0
a__length(cons(X, Y)) → s(a__length1(Y))
a__length1(X) → a__length(X)
mark(from(X)) → a__from(mark(X))
mark(length(X)) → a__length(X)
mark(length1(X)) → a__length1(X)
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(s(X)) → s(mark(X))
mark(nil) → nil
mark(0) → 0
a__from(X) → from(X)
a__length(X) → length(X)
a__length1(X) → length1(X)
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDPOrderProof
MARK(from(X)) → MARK(X)
MARK(from(X)) → A__FROM(mark(X))
MARK(s(X)) → MARK(X)
MARK(cons(X1, X2)) → MARK(X1)
A__FROM(X) → MARK(X)
a__from(X) → cons(mark(X), from(s(X)))
a__length(nil) → 0
a__length(cons(X, Y)) → s(a__length1(Y))
a__length1(X) → a__length(X)
mark(from(X)) → a__from(mark(X))
mark(length(X)) → a__length(X)
mark(length1(X)) → a__length1(X)
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(s(X)) → s(mark(X))
mark(nil) → nil
mark(0) → 0
a__from(X) → from(X)
a__length(X) → length(X)
a__length1(X) → length1(X)
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
MARK(from(X)) → MARK(X)
MARK(from(X)) → A__FROM(mark(X))
A__FROM(X) → MARK(X)
Used ordering: Polynomial interpretation [25,35]:
MARK(s(X)) → MARK(X)
MARK(cons(X1, X2)) → MARK(X1)
The value of delta used in the strict ordering is 3.
POL(a__length1(x1)) = 0
POL(from(x1)) = 4 + (2)x_1
POL(length1(x1)) = 0
POL(mark(x1)) = x_1
POL(a__from(x1)) = 4 + (2)x_1
POL(0) = 0
POL(cons(x1, x2)) = x_1
POL(MARK(x1)) = 1 + (4)x_1
POL(a__length(x1)) = 0
POL(A__FROM(x1)) = 4 + (4)x_1
POL(s(x1)) = x_1
POL(length(x1)) = 0
POL(nil) = 0
a__from(X) → cons(mark(X), from(s(X)))
a__length(nil) → 0
a__length(cons(X, Y)) → s(a__length1(Y))
a__length1(X) → a__length(X)
mark(from(X)) → a__from(mark(X))
mark(length(X)) → a__length(X)
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(length1(X)) → a__length1(X)
mark(nil) → nil
mark(s(X)) → s(mark(X))
a__from(X) → from(X)
mark(0) → 0
a__length1(X) → length1(X)
a__length(X) → length(X)
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ QDPOrderProof
MARK(s(X)) → MARK(X)
MARK(cons(X1, X2)) → MARK(X1)
a__from(X) → cons(mark(X), from(s(X)))
a__length(nil) → 0
a__length(cons(X, Y)) → s(a__length1(Y))
a__length1(X) → a__length(X)
mark(from(X)) → a__from(mark(X))
mark(length(X)) → a__length(X)
mark(length1(X)) → a__length1(X)
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(s(X)) → s(mark(X))
mark(nil) → nil
mark(0) → 0
a__from(X) → from(X)
a__length(X) → length(X)
a__length1(X) → length1(X)
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
MARK(s(X)) → MARK(X)
MARK(cons(X1, X2)) → MARK(X1)
The value of delta used in the strict ordering is 16.
POL(cons(x1, x2)) = 4 + x_1
POL(MARK(x1)) = (4)x_1
POL(s(x1)) = 4 + (4)x_1
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ PisEmptyProof
a__from(X) → cons(mark(X), from(s(X)))
a__length(nil) → 0
a__length(cons(X, Y)) → s(a__length1(Y))
a__length1(X) → a__length(X)
mark(from(X)) → a__from(mark(X))
mark(length(X)) → a__length(X)
mark(length1(X)) → a__length1(X)
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(s(X)) → s(mark(X))
mark(nil) → nil
mark(0) → 0
a__from(X) → from(X)
a__length(X) → length(X)
a__length1(X) → length1(X)