MAYBE We are left with following problem, upon which TcT provides the certificate MAYBE. Strict Trs: { f(x) -> f(g(x)) } Obligation: innermost runtime complexity Answer: MAYBE We add following dependency tuples: Strict DPs: { f^#(x) -> c_1(f^#(g(x))) } and mark the set of starting terms. We are left with following problem, upon which TcT provides the certificate MAYBE. Strict DPs: { f^#(x) -> c_1(f^#(g(x))) } Weak Trs: { f(x) -> f(g(x)) } Obligation: innermost runtime complexity Answer: MAYBE No rule is usable, rules are removed from the input problem. We are left with following problem, upon which TcT provides the certificate MAYBE. Strict DPs: { f^#(x) -> c_1(f^#(g(x))) } Obligation: innermost runtime complexity Answer: MAYBE The input cannot be shown compatible Arrrr..