MAYBE

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

Strict Trs:
  { U11(tt(), M, N) -> U12(tt(), activate(M), activate(N))
  , U12(tt(), M, N) -> s(plus(activate(N), activate(M)))
  , activate(X) -> X
  , plus(N, s(M)) -> U11(tt(), M, N)
  , plus(N, 0()) -> N }
Obligation:
  innermost runtime complexity
Answer:
  MAYBE

The input cannot be shown compatible

Arrrr..