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