MAYBE We are left with following problem, upon which TcT provides the certificate MAYBE. Strict Trs: { b(y, z) -> f(c(c(y, z, z), a(), a())) , b(b(z, y), a()) -> z , c(f(z), f(c(a(), x, a())), y) -> c(f(b(x, z)), c(z, y, a()), a()) } Obligation: innermost runtime complexity Answer: MAYBE Arguments of following rules are not normal-forms: { b(b(z, y), a()) -> z } All above mentioned rules can be savely removed. We are left with following problem, upon which TcT provides the certificate MAYBE. Strict Trs: { b(y, z) -> f(c(c(y, z, z), a(), a())) , c(f(z), f(c(a(), x, a())), y) -> c(f(b(x, z)), c(z, y, a()), a()) } Obligation: innermost runtime complexity Answer: MAYBE None of the processors succeeded. Details of failed attempt(s): ----------------------------- 1) 'empty' failed due to the following reason: Empty strict component of the problem is NOT empty. 2) 'Best' failed due to the following reason: None of the processors succeeded. Details of failed attempt(s): ----------------------------- 1) 'WithProblem (timeout of 60 seconds)' failed due to the following reason: Computation stopped due to timeout after 60.0 seconds. 2) 'Best' failed due to the following reason: None of the processors succeeded. Details of failed attempt(s): ----------------------------- 1) 'WithProblem (timeout of 30 seconds) (timeout of 60 seconds)' failed due to the following reason: Computation stopped due to timeout after 30.0 seconds. 2) 'Best' failed due to the following reason: None of the processors succeeded. Details of failed attempt(s): ----------------------------- 1) 'Polynomial Path Order (PS) (timeout of 60 seconds)' failed due to the following reason: The input cannot be shown compatible 2) 'bsearch-popstar (timeout of 60 seconds)' failed due to the following reason: The input cannot be shown compatible 3) 'Fastest (timeout of 5 seconds) (timeout of 60 seconds)' failed due to the following reason: None of the processors succeeded. Details of failed attempt(s): ----------------------------- 1) 'Bounds with minimal-enrichment and initial automaton 'match'' failed due to the following reason: match-boundness of the problem could not be verified. 2) 'Bounds with perSymbol-enrichment and initial automaton 'match'' failed due to the following reason: match-boundness of the problem could not be verified. Arrrr..