MAYBE We are left with following problem, upon which TcT provides the certificate MAYBE. Strict Trs: { f(x, y, z) -> g(<=(x, y), x, y, z) , g(true(), x, y, z) -> z , g(false(), x, y, z) -> f(f(p(x), y, z), f(p(y), z, x), f(p(z), x, y)) , p(0()) -> 0() , p(s(x)) -> x } Obligation: innermost runtime complexity Answer: MAYBE The input cannot be shown compatible Arrrr..