MAYBE We are left with following problem, upon which TcT provides the certificate MAYBE. Strict Trs: { f() -> f() } Obligation: innermost runtime complexity Answer: MAYBE We add following dependency tuples: Strict DPs: { f^#() -> c_1(f^#()) } and mark the set of starting terms. We are left with following problem, upon which TcT provides the certificate MAYBE. Strict DPs: { f^#() -> c_1(f^#()) } Weak Trs: { f() -> f() } 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^#() -> c_1(f^#()) } Obligation: innermost runtime complexity Answer: MAYBE The input cannot be shown compatible Arrrr..