MAYBE We are left with following problem, upon which TcT provides the certificate MAYBE. Strict Trs: { a(b(x1)) -> b(b(a(x1))) , c(b(x1)) -> b(c(c(x1))) } Obligation: innermost runtime complexity Answer: MAYBE We add following dependency tuples: Strict DPs: { a^#(b(x1)) -> c_1(a^#(x1)) , c^#(b(x1)) -> c_2(c^#(c(x1)), c^#(x1)) } and mark the set of starting terms. We are left with following problem, upon which TcT provides the certificate MAYBE. Strict DPs: { a^#(b(x1)) -> c_1(a^#(x1)) , c^#(b(x1)) -> c_2(c^#(c(x1)), c^#(x1)) } Weak Trs: { a(b(x1)) -> b(b(a(x1))) , c(b(x1)) -> b(c(c(x1))) } Obligation: innermost runtime complexity Answer: MAYBE We replace rewrite rules by usable rules: Weak Usable Rules: { c(b(x1)) -> b(c(c(x1))) } We are left with following problem, upon which TcT provides the certificate MAYBE. Strict DPs: { a^#(b(x1)) -> c_1(a^#(x1)) , c^#(b(x1)) -> c_2(c^#(c(x1)), c^#(x1)) } Weak Trs: { c(b(x1)) -> b(c(c(x1))) } Obligation: innermost runtime complexity Answer: MAYBE None of the processors succeeded. Details of failed attempt(s): ----------------------------- 1) 'matrices' failed due to the following reason: None of the processors succeeded. Details of failed attempt(s): ----------------------------- 1) 'matrix interpretation of dimension 4' failed due to the following reason: The input cannot be shown compatible 2) 'matrix interpretation of dimension 3' failed due to the following reason: The input cannot be shown compatible 3) 'matrix interpretation of dimension 3' failed due to the following reason: The input cannot be shown compatible 4) 'matrix interpretation of dimension 2' failed due to the following reason: The input cannot be shown compatible 5) 'matrix interpretation of dimension 2' failed due to the following reason: The input cannot be shown compatible 6) 'matrix interpretation of dimension 1' failed due to the following reason: The input cannot be shown compatible 2) 'empty' failed due to the following reason: Empty strict component of the problem is NOT empty. Arrrr..