MAYBE Problem: a__zeros() -> cons(0(),zeros()) a__U11(tt(),L) -> a__U12(tt(),L) a__U12(tt(),L) -> s(a__length(mark(L))) a__length(nil()) -> 0() a__length(cons(N,L)) -> a__U11(tt(),L) mark(zeros()) -> a__zeros() mark(U11(X1,X2)) -> a__U11(mark(X1),X2) mark(U12(X1,X2)) -> a__U12(mark(X1),X2) mark(length(X)) -> a__length(mark(X)) mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(0()) -> 0() mark(tt()) -> tt() mark(s(X)) -> s(mark(X)) mark(nil()) -> nil() a__zeros() -> zeros() a__U11(X1,X2) -> U11(X1,X2) a__U12(X1,X2) -> U12(X1,X2) a__length(X) -> length(X) Proof: DP Processor: DPs: a__U11#(tt(),L) -> a__U12#(tt(),L) a__U12#(tt(),L) -> mark#(L) a__U12#(tt(),L) -> a__length#(mark(L)) a__length#(cons(N,L)) -> a__U11#(tt(),L) mark#(zeros()) -> a__zeros#() mark#(U11(X1,X2)) -> mark#(X1) mark#(U11(X1,X2)) -> a__U11#(mark(X1),X2) mark#(U12(X1,X2)) -> mark#(X1) mark#(U12(X1,X2)) -> a__U12#(mark(X1),X2) mark#(length(X)) -> mark#(X) mark#(length(X)) -> a__length#(mark(X)) mark#(cons(X1,X2)) -> mark#(X1) mark#(s(X)) -> mark#(X) TRS: a__zeros() -> cons(0(),zeros()) a__U11(tt(),L) -> a__U12(tt(),L) a__U12(tt(),L) -> s(a__length(mark(L))) a__length(nil()) -> 0() a__length(cons(N,L)) -> a__U11(tt(),L) mark(zeros()) -> a__zeros() mark(U11(X1,X2)) -> a__U11(mark(X1),X2) mark(U12(X1,X2)) -> a__U12(mark(X1),X2) mark(length(X)) -> a__length(mark(X)) mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(0()) -> 0() mark(tt()) -> tt() mark(s(X)) -> s(mark(X)) mark(nil()) -> nil() a__zeros() -> zeros() a__U11(X1,X2) -> U11(X1,X2) a__U12(X1,X2) -> U12(X1,X2) a__length(X) -> length(X) TDG Processor: DPs: a__U11#(tt(),L) -> a__U12#(tt(),L) a__U12#(tt(),L) -> mark#(L) a__U12#(tt(),L) -> a__length#(mark(L)) a__length#(cons(N,L)) -> a__U11#(tt(),L) mark#(zeros()) -> a__zeros#() mark#(U11(X1,X2)) -> mark#(X1) mark#(U11(X1,X2)) -> a__U11#(mark(X1),X2) mark#(U12(X1,X2)) -> mark#(X1) mark#(U12(X1,X2)) -> a__U12#(mark(X1),X2) mark#(length(X)) -> mark#(X) mark#(length(X)) -> a__length#(mark(X)) mark#(cons(X1,X2)) -> mark#(X1) mark#(s(X)) -> mark#(X) TRS: a__zeros() -> cons(0(),zeros()) a__U11(tt(),L) -> a__U12(tt(),L) a__U12(tt(),L) -> s(a__length(mark(L))) a__length(nil()) -> 0() a__length(cons(N,L)) -> a__U11(tt(),L) mark(zeros()) -> a__zeros() mark(U11(X1,X2)) -> a__U11(mark(X1),X2) mark(U12(X1,X2)) -> a__U12(mark(X1),X2) mark(length(X)) -> a__length(mark(X)) mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(0()) -> 0() mark(tt()) -> tt() mark(s(X)) -> s(mark(X)) mark(nil()) -> nil() a__zeros() -> zeros() a__U11(X1,X2) -> U11(X1,X2) a__U12(X1,X2) -> U12(X1,X2) a__length(X) -> length(X) graph: a__length#(cons(N,L)) -> a__U11#(tt(),L) -> a__U11#(tt(),L) -> a__U12#(tt(),L) mark#(length(X)) -> a__length#(mark(X)) -> a__length#(cons(N,L)) -> a__U11#(tt(),L) mark#(length(X)) -> mark#(X) -> mark#(s(X)) -> mark#(X) mark#(length(X)) -> mark#(X) -> mark#(cons(X1,X2)) -> mark#(X1) mark#(length(X)) -> mark#(X) -> mark#(length(X)) -> a__length#(mark(X)) mark#(length(X)) -> mark#(X) -> mark#(length(X)) -> mark#(X) mark#(length(X)) -> mark#(X) -> mark#(U12(X1,X2)) -> a__U12#(mark(X1),X2) mark#(length(X)) -> mark#(X) -> mark#(U12(X1,X2)) -> mark#(X1) mark#(length(X)) -> mark#(X) -> mark#(U11(X1,X2)) -> a__U11#(mark(X1),X2) mark#(length(X)) -> mark#(X) -> mark#(U11(X1,X2)) -> mark#(X1) mark#(length(X)) -> mark#(X) -> mark#(zeros()) -> a__zeros#() mark#(U12(X1,X2)) -> mark#(X1) -> mark#(s(X)) -> mark#(X) mark#(U12(X1,X2)) -> mark#(X1) -> mark#(cons(X1,X2)) -> mark#(X1) mark#(U12(X1,X2)) -> mark#(X1) -> mark#(length(X)) -> a__length#(mark(X)) mark#(U12(X1,X2)) -> mark#(X1) -> mark#(length(X)) -> mark#(X) mark#(U12(X1,X2)) -> mark#(X1) -> mark#(U12(X1,X2)) -> a__U12#(mark(X1),X2) mark#(U12(X1,X2)) -> mark#(X1) -> mark#(U12(X1,X2)) -> mark#(X1) mark#(U12(X1,X2)) -> mark#(X1) -> mark#(U11(X1,X2)) -> a__U11#(mark(X1),X2) mark#(U12(X1,X2)) -> mark#(X1) -> mark#(U11(X1,X2)) -> mark#(X1) mark#(U12(X1,X2)) -> mark#(X1) -> mark#(zeros()) -> a__zeros#() mark#(U12(X1,X2)) -> a__U12#(mark(X1),X2) -> a__U12#(tt(),L) -> a__length#(mark(L)) mark#(U12(X1,X2)) -> a__U12#(mark(X1),X2) -> a__U12#(tt(),L) -> mark#(L) mark#(U11(X1,X2)) -> mark#(X1) -> mark#(s(X)) -> mark#(X) mark#(U11(X1,X2)) -> mark#(X1) -> mark#(cons(X1,X2)) -> mark#(X1) mark#(U11(X1,X2)) -> mark#(X1) -> mark#(length(X)) -> a__length#(mark(X)) mark#(U11(X1,X2)) -> mark#(X1) -> mark#(length(X)) -> mark#(X) mark#(U11(X1,X2)) -> mark#(X1) -> mark#(U12(X1,X2)) -> a__U12#(mark(X1),X2) mark#(U11(X1,X2)) -> mark#(X1) -> mark#(U12(X1,X2)) -> mark#(X1) mark#(U11(X1,X2)) -> mark#(X1) -> mark#(U11(X1,X2)) -> a__U11#(mark(X1),X2) mark#(U11(X1,X2)) -> mark#(X1) -> mark#(U11(X1,X2)) -> mark#(X1) mark#(U11(X1,X2)) -> mark#(X1) -> mark#(zeros()) -> a__zeros#() mark#(U11(X1,X2)) -> a__U11#(mark(X1),X2) -> a__U11#(tt(),L) -> a__U12#(tt(),L) mark#(s(X)) -> mark#(X) -> mark#(s(X)) -> mark#(X) mark#(s(X)) -> mark#(X) -> mark#(cons(X1,X2)) -> mark#(X1) mark#(s(X)) -> mark#(X) -> mark#(length(X)) -> a__length#(mark(X)) mark#(s(X)) -> mark#(X) -> mark#(length(X)) -> mark#(X) mark#(s(X)) -> mark#(X) -> mark#(U12(X1,X2)) -> a__U12#(mark(X1),X2) mark#(s(X)) -> mark#(X) -> mark#(U12(X1,X2)) -> mark#(X1) mark#(s(X)) -> mark#(X) -> mark#(U11(X1,X2)) -> a__U11#(mark(X1),X2) mark#(s(X)) -> mark#(X) -> mark#(U11(X1,X2)) -> mark#(X1) mark#(s(X)) -> mark#(X) -> mark#(zeros()) -> a__zeros#() mark#(cons(X1,X2)) -> mark#(X1) -> mark#(s(X)) -> mark#(X) mark#(cons(X1,X2)) -> mark#(X1) -> mark#(cons(X1,X2)) -> mark#(X1) mark#(cons(X1,X2)) -> mark#(X1) -> mark#(length(X)) -> a__length#(mark(X)) mark#(cons(X1,X2)) -> mark#(X1) -> mark#(length(X)) -> mark#(X) mark#(cons(X1,X2)) -> mark#(X1) -> mark#(U12(X1,X2)) -> a__U12#(mark(X1),X2) mark#(cons(X1,X2)) -> mark#(X1) -> mark#(U12(X1,X2)) -> mark#(X1) mark#(cons(X1,X2)) -> mark#(X1) -> mark#(U11(X1,X2)) -> a__U11#(mark(X1),X2) mark#(cons(X1,X2)) -> mark#(X1) -> mark#(U11(X1,X2)) -> mark#(X1) mark#(cons(X1,X2)) -> mark#(X1) -> mark#(zeros()) -> a__zeros#() a__U12#(tt(),L) -> a__length#(mark(L)) -> a__length#(cons(N,L)) -> a__U11#(tt(),L) a__U12#(tt(),L) -> mark#(L) -> mark#(s(X)) -> mark#(X) a__U12#(tt(),L) -> mark#(L) -> mark#(cons(X1,X2)) -> mark#(X1) a__U12#(tt(),L) -> mark#(L) -> mark#(length(X)) -> a__length#(mark(X)) a__U12#(tt(),L) -> mark#(L) -> mark#(length(X)) -> mark#(X) a__U12#(tt(),L) -> mark#(L) -> mark#(U12(X1,X2)) -> a__U12#(mark(X1),X2) a__U12#(tt(),L) -> mark#(L) -> mark#(U12(X1,X2)) -> mark#(X1) a__U12#(tt(),L) -> mark#(L) -> mark#(U11(X1,X2)) -> a__U11#(mark(X1),X2) a__U12#(tt(),L) -> mark#(L) -> mark#(U11(X1,X2)) -> mark#(X1) a__U12#(tt(),L) -> mark#(L) -> mark#(zeros()) -> a__zeros#() a__U11#(tt(),L) -> a__U12#(tt(),L) -> a__U12#(tt(),L) -> a__length#(mark(L)) a__U11#(tt(),L) -> a__U12#(tt(),L) -> a__U12#(tt(),L) -> mark#(L) SCC Processor: #sccs: 1 #rules: 12 #arcs: 62/169 DPs: a__length#(cons(N,L)) -> a__U11#(tt(),L) a__U11#(tt(),L) -> a__U12#(tt(),L) a__U12#(tt(),L) -> mark#(L) mark#(U11(X1,X2)) -> mark#(X1) mark#(U11(X1,X2)) -> a__U11#(mark(X1),X2) mark#(U12(X1,X2)) -> mark#(X1) mark#(U12(X1,X2)) -> a__U12#(mark(X1),X2) a__U12#(tt(),L) -> a__length#(mark(L)) mark#(length(X)) -> mark#(X) mark#(length(X)) -> a__length#(mark(X)) mark#(cons(X1,X2)) -> mark#(X1) mark#(s(X)) -> mark#(X) TRS: a__zeros() -> cons(0(),zeros()) a__U11(tt(),L) -> a__U12(tt(),L) a__U12(tt(),L) -> s(a__length(mark(L))) a__length(nil()) -> 0() a__length(cons(N,L)) -> a__U11(tt(),L) mark(zeros()) -> a__zeros() mark(U11(X1,X2)) -> a__U11(mark(X1),X2) mark(U12(X1,X2)) -> a__U12(mark(X1),X2) mark(length(X)) -> a__length(mark(X)) mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(0()) -> 0() mark(tt()) -> tt() mark(s(X)) -> s(mark(X)) mark(nil()) -> nil() a__zeros() -> zeros() a__U11(X1,X2) -> U11(X1,X2) a__U12(X1,X2) -> U12(X1,X2) a__length(X) -> length(X) Matrix Interpretation Processor: dimension: 1 interpretation: [a__length#](x0) = x0, [mark#](x0) = x0, [a__U12#](x0, x1) = x1, [a__U11#](x0, x1) = x1, [length](x0) = x0 + 1, [U12](x0, x1) = x0 + x1, [U11](x0, x1) = x0 + x1, [nil] = 0, [s](x0) = x0, [a__length](x0) = x0 + 1, [mark](x0) = x0, [a__U12](x0, x1) = x0 + x1, [a__U11](x0, x1) = x0 + x1, [tt] = 1, [cons](x0, x1) = x0 + x1, [zeros] = 0, [0] = 0, [a__zeros] = 0 orientation: a__length#(cons(N,L)) = L + N >= L = a__U11#(tt(),L) a__U11#(tt(),L) = L >= L = a__U12#(tt(),L) a__U12#(tt(),L) = L >= L = mark#(L) mark#(U11(X1,X2)) = X1 + X2 >= X1 = mark#(X1) mark#(U11(X1,X2)) = X1 + X2 >= X2 = a__U11#(mark(X1),X2) mark#(U12(X1,X2)) = X1 + X2 >= X1 = mark#(X1) mark#(U12(X1,X2)) = X1 + X2 >= X2 = a__U12#(mark(X1),X2) a__U12#(tt(),L) = L >= L = a__length#(mark(L)) mark#(length(X)) = X + 1 >= X = mark#(X) mark#(length(X)) = X + 1 >= X = a__length#(mark(X)) mark#(cons(X1,X2)) = X1 + X2 >= X1 = mark#(X1) mark#(s(X)) = X >= X = mark#(X) a__zeros() = 0 >= 0 = cons(0(),zeros()) a__U11(tt(),L) = L + 1 >= L + 1 = a__U12(tt(),L) a__U12(tt(),L) = L + 1 >= L + 1 = s(a__length(mark(L))) a__length(nil()) = 1 >= 0 = 0() a__length(cons(N,L)) = L + N + 1 >= L + 1 = a__U11(tt(),L) mark(zeros()) = 0 >= 0 = a__zeros() mark(U11(X1,X2)) = X1 + X2 >= X1 + X2 = a__U11(mark(X1),X2) mark(U12(X1,X2)) = X1 + X2 >= X1 + X2 = a__U12(mark(X1),X2) mark(length(X)) = X + 1 >= X + 1 = a__length(mark(X)) mark(cons(X1,X2)) = X1 + X2 >= X1 + X2 = cons(mark(X1),X2) mark(0()) = 0 >= 0 = 0() mark(tt()) = 1 >= 1 = tt() mark(s(X)) = X >= X = s(mark(X)) mark(nil()) = 0 >= 0 = nil() a__zeros() = 0 >= 0 = zeros() a__U11(X1,X2) = X1 + X2 >= X1 + X2 = U11(X1,X2) a__U12(X1,X2) = X1 + X2 >= X1 + X2 = U12(X1,X2) a__length(X) = X + 1 >= X + 1 = length(X) problem: DPs: a__length#(cons(N,L)) -> a__U11#(tt(),L) a__U11#(tt(),L) -> a__U12#(tt(),L) a__U12#(tt(),L) -> mark#(L) mark#(U11(X1,X2)) -> mark#(X1) mark#(U11(X1,X2)) -> a__U11#(mark(X1),X2) mark#(U12(X1,X2)) -> mark#(X1) mark#(U12(X1,X2)) -> a__U12#(mark(X1),X2) a__U12#(tt(),L) -> a__length#(mark(L)) mark#(cons(X1,X2)) -> mark#(X1) mark#(s(X)) -> mark#(X) TRS: a__zeros() -> cons(0(),zeros()) a__U11(tt(),L) -> a__U12(tt(),L) a__U12(tt(),L) -> s(a__length(mark(L))) a__length(nil()) -> 0() a__length(cons(N,L)) -> a__U11(tt(),L) mark(zeros()) -> a__zeros() mark(U11(X1,X2)) -> a__U11(mark(X1),X2) mark(U12(X1,X2)) -> a__U12(mark(X1),X2) mark(length(X)) -> a__length(mark(X)) mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(0()) -> 0() mark(tt()) -> tt() mark(s(X)) -> s(mark(X)) mark(nil()) -> nil() a__zeros() -> zeros() a__U11(X1,X2) -> U11(X1,X2) a__U12(X1,X2) -> U12(X1,X2) a__length(X) -> length(X) Matrix Interpretation Processor: dimension: 1 interpretation: [a__length#](x0) = x0, [mark#](x0) = x0, [a__U12#](x0, x1) = x1, [a__U11#](x0, x1) = x1, [length](x0) = x0 + 1, [U12](x0, x1) = x0 + x1 + 1, [U11](x0, x1) = x0 + x1 + 1, [nil] = 0, [s](x0) = x0, [a__length](x0) = x0 + 1, [mark](x0) = x0, [a__U12](x0, x1) = x0 + x1 + 1, [a__U11](x0, x1) = x0 + x1 + 1, [tt] = 0, [cons](x0, x1) = x0 + x1, [zeros] = 0, [0] = 0, [a__zeros] = 0 orientation: a__length#(cons(N,L)) = L + N >= L = a__U11#(tt(),L) a__U11#(tt(),L) = L >= L = a__U12#(tt(),L) a__U12#(tt(),L) = L >= L = mark#(L) mark#(U11(X1,X2)) = X1 + X2 + 1 >= X1 = mark#(X1) mark#(U11(X1,X2)) = X1 + X2 + 1 >= X2 = a__U11#(mark(X1),X2) mark#(U12(X1,X2)) = X1 + X2 + 1 >= X1 = mark#(X1) mark#(U12(X1,X2)) = X1 + X2 + 1 >= X2 = a__U12#(mark(X1),X2) a__U12#(tt(),L) = L >= L = a__length#(mark(L)) mark#(cons(X1,X2)) = X1 + X2 >= X1 = mark#(X1) mark#(s(X)) = X >= X = mark#(X) a__zeros() = 0 >= 0 = cons(0(),zeros()) a__U11(tt(),L) = L + 1 >= L + 1 = a__U12(tt(),L) a__U12(tt(),L) = L + 1 >= L + 1 = s(a__length(mark(L))) a__length(nil()) = 1 >= 0 = 0() a__length(cons(N,L)) = L + N + 1 >= L + 1 = a__U11(tt(),L) mark(zeros()) = 0 >= 0 = a__zeros() mark(U11(X1,X2)) = X1 + X2 + 1 >= X1 + X2 + 1 = a__U11(mark(X1),X2) mark(U12(X1,X2)) = X1 + X2 + 1 >= X1 + X2 + 1 = a__U12(mark(X1),X2) mark(length(X)) = X + 1 >= X + 1 = a__length(mark(X)) mark(cons(X1,X2)) = X1 + X2 >= X1 + X2 = cons(mark(X1),X2) mark(0()) = 0 >= 0 = 0() mark(tt()) = 0 >= 0 = tt() mark(s(X)) = X >= X = s(mark(X)) mark(nil()) = 0 >= 0 = nil() a__zeros() = 0 >= 0 = zeros() a__U11(X1,X2) = X1 + X2 + 1 >= X1 + X2 + 1 = U11(X1,X2) a__U12(X1,X2) = X1 + X2 + 1 >= X1 + X2 + 1 = U12(X1,X2) a__length(X) = X + 1 >= X + 1 = length(X) problem: DPs: a__length#(cons(N,L)) -> a__U11#(tt(),L) a__U11#(tt(),L) -> a__U12#(tt(),L) a__U12#(tt(),L) -> mark#(L) a__U12#(tt(),L) -> a__length#(mark(L)) mark#(cons(X1,X2)) -> mark#(X1) mark#(s(X)) -> mark#(X) TRS: a__zeros() -> cons(0(),zeros()) a__U11(tt(),L) -> a__U12(tt(),L) a__U12(tt(),L) -> s(a__length(mark(L))) a__length(nil()) -> 0() a__length(cons(N,L)) -> a__U11(tt(),L) mark(zeros()) -> a__zeros() mark(U11(X1,X2)) -> a__U11(mark(X1),X2) mark(U12(X1,X2)) -> a__U12(mark(X1),X2) mark(length(X)) -> a__length(mark(X)) mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(0()) -> 0() mark(tt()) -> tt() mark(s(X)) -> s(mark(X)) mark(nil()) -> nil() a__zeros() -> zeros() a__U11(X1,X2) -> U11(X1,X2) a__U12(X1,X2) -> U12(X1,X2) a__length(X) -> length(X) Matrix Interpretation Processor: dimension: 1 interpretation: [a__length#](x0) = x0 + 1, [mark#](x0) = 0, [a__U12#](x0, x1) = x0 + 1, [a__U11#](x0, x1) = x0 + 1, [length](x0) = 1, [U12](x0, x1) = 1, [U11](x0, x1) = x0, [nil] = 1, [s](x0) = 1, [a__length](x0) = 1, [mark](x0) = 1, [a__U12](x0, x1) = 1, [a__U11](x0, x1) = x0, [tt] = 1, [cons](x0, x1) = 1, [zeros] = 1, [0] = 1, [a__zeros] = 1 orientation: a__length#(cons(N,L)) = 2 >= 2 = a__U11#(tt(),L) a__U11#(tt(),L) = 2 >= 2 = a__U12#(tt(),L) a__U12#(tt(),L) = 2 >= 0 = mark#(L) a__U12#(tt(),L) = 2 >= 2 = a__length#(mark(L)) mark#(cons(X1,X2)) = 0 >= 0 = mark#(X1) mark#(s(X)) = 0 >= 0 = mark#(X) a__zeros() = 1 >= 1 = cons(0(),zeros()) a__U11(tt(),L) = 1 >= 1 = a__U12(tt(),L) a__U12(tt(),L) = 1 >= 1 = s(a__length(mark(L))) a__length(nil()) = 1 >= 1 = 0() a__length(cons(N,L)) = 1 >= 1 = a__U11(tt(),L) mark(zeros()) = 1 >= 1 = a__zeros() mark(U11(X1,X2)) = 1 >= 1 = a__U11(mark(X1),X2) mark(U12(X1,X2)) = 1 >= 1 = a__U12(mark(X1),X2) mark(length(X)) = 1 >= 1 = a__length(mark(X)) mark(cons(X1,X2)) = 1 >= 1 = cons(mark(X1),X2) mark(0()) = 1 >= 1 = 0() mark(tt()) = 1 >= 1 = tt() mark(s(X)) = 1 >= 1 = s(mark(X)) mark(nil()) = 1 >= 1 = nil() a__zeros() = 1 >= 1 = zeros() a__U11(X1,X2) = X1 >= X1 = U11(X1,X2) a__U12(X1,X2) = 1 >= 1 = U12(X1,X2) a__length(X) = 1 >= 1 = length(X) problem: DPs: a__length#(cons(N,L)) -> a__U11#(tt(),L) a__U11#(tt(),L) -> a__U12#(tt(),L) a__U12#(tt(),L) -> a__length#(mark(L)) mark#(cons(X1,X2)) -> mark#(X1) mark#(s(X)) -> mark#(X) TRS: a__zeros() -> cons(0(),zeros()) a__U11(tt(),L) -> a__U12(tt(),L) a__U12(tt(),L) -> s(a__length(mark(L))) a__length(nil()) -> 0() a__length(cons(N,L)) -> a__U11(tt(),L) mark(zeros()) -> a__zeros() mark(U11(X1,X2)) -> a__U11(mark(X1),X2) mark(U12(X1,X2)) -> a__U12(mark(X1),X2) mark(length(X)) -> a__length(mark(X)) mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(0()) -> 0() mark(tt()) -> tt() mark(s(X)) -> s(mark(X)) mark(nil()) -> nil() a__zeros() -> zeros() a__U11(X1,X2) -> U11(X1,X2) a__U12(X1,X2) -> U12(X1,X2) a__length(X) -> length(X) Matrix Interpretation Processor: dimension: 1 interpretation: [a__length#](x0) = 0, [mark#](x0) = x0 + 1, [a__U12#](x0, x1) = 0, [a__U11#](x0, x1) = 0, [length](x0) = 0, [U12](x0, x1) = 0, [U11](x0, x1) = 0, [nil] = 0, [s](x0) = x0, [a__length](x0) = 0, [mark](x0) = x0, [a__U12](x0, x1) = 0, [a__U11](x0, x1) = 0, [tt] = 0, [cons](x0, x1) = x0 + 1, [zeros] = 1, [0] = 0, [a__zeros] = 1 orientation: a__length#(cons(N,L)) = 0 >= 0 = a__U11#(tt(),L) a__U11#(tt(),L) = 0 >= 0 = a__U12#(tt(),L) a__U12#(tt(),L) = 0 >= 0 = a__length#(mark(L)) mark#(cons(X1,X2)) = X1 + 2 >= X1 + 1 = mark#(X1) mark#(s(X)) = X + 1 >= X + 1 = mark#(X) a__zeros() = 1 >= 1 = cons(0(),zeros()) a__U11(tt(),L) = 0 >= 0 = a__U12(tt(),L) a__U12(tt(),L) = 0 >= 0 = s(a__length(mark(L))) a__length(nil()) = 0 >= 0 = 0() a__length(cons(N,L)) = 0 >= 0 = a__U11(tt(),L) mark(zeros()) = 1 >= 1 = a__zeros() mark(U11(X1,X2)) = 0 >= 0 = a__U11(mark(X1),X2) mark(U12(X1,X2)) = 0 >= 0 = a__U12(mark(X1),X2) mark(length(X)) = 0 >= 0 = a__length(mark(X)) mark(cons(X1,X2)) = X1 + 1 >= X1 + 1 = cons(mark(X1),X2) mark(0()) = 0 >= 0 = 0() mark(tt()) = 0 >= 0 = tt() mark(s(X)) = X >= X = s(mark(X)) mark(nil()) = 0 >= 0 = nil() a__zeros() = 1 >= 1 = zeros() a__U11(X1,X2) = 0 >= 0 = U11(X1,X2) a__U12(X1,X2) = 0 >= 0 = U12(X1,X2) a__length(X) = 0 >= 0 = length(X) problem: DPs: a__length#(cons(N,L)) -> a__U11#(tt(),L) a__U11#(tt(),L) -> a__U12#(tt(),L) a__U12#(tt(),L) -> a__length#(mark(L)) mark#(s(X)) -> mark#(X) TRS: a__zeros() -> cons(0(),zeros()) a__U11(tt(),L) -> a__U12(tt(),L) a__U12(tt(),L) -> s(a__length(mark(L))) a__length(nil()) -> 0() a__length(cons(N,L)) -> a__U11(tt(),L) mark(zeros()) -> a__zeros() mark(U11(X1,X2)) -> a__U11(mark(X1),X2) mark(U12(X1,X2)) -> a__U12(mark(X1),X2) mark(length(X)) -> a__length(mark(X)) mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(0()) -> 0() mark(tt()) -> tt() mark(s(X)) -> s(mark(X)) mark(nil()) -> nil() a__zeros() -> zeros() a__U11(X1,X2) -> U11(X1,X2) a__U12(X1,X2) -> U12(X1,X2) a__length(X) -> length(X) Open