MAYBE We are left with following problem, upon which TcT provides the certificate MAYBE. Strict Trs: { cond1(true(), x, y) -> cond2(gr(x, y), x, y) , cond2(true(), x, y) -> cond1(gr(add(x, y), 0()), p(x), y) , cond2(false(), x, y) -> cond3(eq(x, y), x, y) , gr(0(), x) -> false() , gr(s(x), 0()) -> true() , gr(s(x), s(y)) -> gr(x, y) , add(0(), x) -> x , add(s(x), y) -> s(add(x, y)) , p(0()) -> 0() , p(s(x)) -> x , cond3(true(), x, y) -> cond1(gr(add(x, y), 0()), p(x), y) , cond3(false(), x, y) -> cond1(gr(add(x, y), 0()), x, p(y)) , eq(0(), 0()) -> true() , eq(0(), s(x)) -> false() , eq(s(x), 0()) -> false() , eq(s(x), s(y)) -> eq(x, y) } 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) 'bsearch-popstar (timeout of 60 seconds)' failed due to the following reason: The input cannot be shown compatible 2) 'Polynomial Path Order (PS) (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 perSymbol-enrichment and initial automaton 'match'' failed due to the following reason: match-boundness of the problem could not be verified. 2) 'Bounds with minimal-enrichment and initial automaton 'match'' failed due to the following reason: match-boundness of the problem could not be verified. Arrrr..