MAYBE

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

Strict Trs:
  { p(f(f(x))) -> q(f(g(x)))
  , p(g(g(x))) -> q(g(f(x)))
  , q(f(f(x))) -> p(f(g(x)))
  , q(g(g(x))) -> p(g(f(x))) }
Obligation:
  innermost runtime complexity
Answer:
  MAYBE

The input cannot be shown compatible

Arrrr..