MAYBE

We are left with following problem, upon which TcT provides the
certificate MAYBE.

Strict Trs:
  { zeros() -> cons(0(), zeros())
  , U11(tt(), L) -> U12(tt(), L)
  , U12(tt(), L) -> s(length(L))
  , length(cons(N, L)) -> U11(tt(), L)
  , length(nil()) -> 0()
  , U21(tt(), IL, M, N) -> U22(tt(), IL, M, N)
  , U22(tt(), IL, M, N) -> U23(tt(), IL, M, N)
  , U23(tt(), IL, M, N) -> cons(N, take(M, IL))
  , take(0(), IL) -> nil()
  , take(s(M), cons(N, IL)) -> U21(tt(), IL, M, N) }
Obligation:
  innermost runtime complexity
Answer:
  MAYBE

The input cannot be shown compatible

Arrrr..