MAYBE

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

Strict Trs:
  { incr(nil()) -> nil()
  , incr(cons(X, L)) -> cons(s(X), incr(L))
  , adx(nil()) -> nil()
  , adx(cons(X, L)) -> incr(cons(X, adx(L)))
  , nats() -> adx(zeros())
  , zeros() -> cons(0(), zeros())
  , head(cons(X, L)) -> X
  , tail(cons(X, L)) -> L }
Obligation:
  innermost runtime complexity
Answer:
  MAYBE

The input cannot be shown compatible

Arrrr..