MAYBE

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

Strict Trs:
  { f(x, c(x), c(y)) -> f(y, y, f(y, x, y))
  , f(c(x), x, y) -> c(y)
  , f(s(x), y, z) -> f(x, s(c(y)), c(z))
  , g(x, y) -> x
  , g(x, y) -> y }
Obligation:
  innermost runtime complexity
Answer:
  MAYBE

The input cannot be shown compatible

Arrrr..