MAYBE We are left with following problem, upon which TcT provides the certificate MAYBE. Strict Trs: { le(s(x), s(y)) -> le(x, y) , le(s(x), 0()) -> false() , le(0(), y) -> true() , double(s(x)) -> s(s(double(x))) , double(0()) -> 0() , log(s(x)) -> loop(s(x), s(0()), 0()) , log(0()) -> logError() , loop(x, s(y), z) -> if(le(x, s(y)), x, s(y), z) , if(false(), x, y, z) -> loop(x, double(y), s(z)) , if(true(), x, y, z) -> z , maplog(xs) -> mapIter(xs, nil()) , mapIter(xs, ys) -> ifmap(isempty(xs), xs, ys) , ifmap(false(), xs, ys) -> mapIter(droplast(xs), cons(log(last(xs)), ys)) , ifmap(true(), xs, ys) -> ys , isempty(nil()) -> true() , isempty(cons(x, xs)) -> false() , droplast(nil()) -> nil() , droplast(cons(x, nil())) -> nil() , droplast(cons(x, cons(y, xs))) -> cons(x, droplast(cons(y, xs))) , last(nil()) -> error() , last(cons(x, nil())) -> x , last(cons(x, cons(y, xs))) -> last(cons(y, xs)) , a() -> b() , a() -> c() } 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 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..