MAYBE

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

Strict Trs:
  { +(X, 0()) -> X
  , +(X, s(Y)) -> s(+(X, Y))
  , double(X) -> +(X, X)
  , f(0(), s(0()), X) -> f(X, double(X), X)
  , g(X, Y) -> X
  , g(X, Y) -> Y }
Obligation:
  innermost runtime complexity
Answer:
  MAYBE

The input cannot be shown compatible

Arrrr..