MAYBE We are left with following problem, upon which TcT provides the certificate MAYBE. Strict Trs: { isEmpty(nil()) -> true() , isEmpty(cons(x, xs)) -> false() , last(cons(x, nil())) -> x , last(cons(x, cons(y, ys))) -> last(cons(y, ys)) , dropLast(nil()) -> nil() , dropLast(cons(x, nil())) -> nil() , dropLast(cons(x, cons(y, ys))) -> cons(x, dropLast(cons(y, ys))) , append(nil(), ys) -> ys , append(cons(x, xs), ys) -> cons(x, append(xs, ys)) , reverse(xs) -> rev(xs, nil()) , rev(xs, ys) -> if(isEmpty(xs), dropLast(xs), append(ys, last(xs)), ys) , if(true(), xs, ys, zs) -> zs , if(false(), xs, ys, zs) -> rev(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) '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..