MAYBE We are left with following problem, upon which TcT provides the certificate MAYBE. Strict Trs: { app(x, y) -> helpa(0(), plus(length(x), length(y)), x, y) , helpa(c, l, ys, zs) -> if(ge(c, l), c, l, ys, zs) , plus(x, 0()) -> x , plus(x, s(y)) -> s(plus(x, y)) , length(nil()) -> 0() , length(cons(x, y)) -> s(length(y)) , if(true(), c, l, ys, zs) -> nil() , if(false(), c, l, ys, zs) -> helpb(c, l, ys, zs) , ge(x, 0()) -> true() , ge(0(), s(x)) -> false() , ge(s(x), s(y)) -> ge(x, y) , helpb(c, l, ys, zs) -> cons(take(c, ys, zs), helpa(s(c), l, ys, zs)) , take(0(), nil(), cons(y, ys)) -> y , take(0(), cons(x, xs()), ys) -> x , take(s(c), nil(), cons(y, ys)) -> take(c, nil(), ys) , take(s(c), cons(x, xs()), ys) -> take(c, xs(), ys) } 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 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..