MAYBE

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

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

The input cannot be shown compatible

Arrrr..