MAYBE

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

Strict Trs:
  { f(n__a(), n__b(), X) -> f(X, X, X)
  , c() -> a()
  , c() -> b()
  , a() -> n__a()
  , b() -> n__b()
  , activate(X) -> X
  , activate(n__a()) -> a()
  , activate(n__b()) -> b() }
Obligation:
  innermost runtime complexity
Answer:
  MAYBE

The input cannot be shown compatible

Arrrr..