MAYBE We are left with following problem, upon which TcT provides the certificate MAYBE. Strict Trs: { fib(N) -> sel(N, fib1(s(0()), s(0()))) , sel(s(N), cons(X, XS)) -> sel(N, activate(XS)) , sel(0(), cons(X, XS)) -> X , fib1(X, Y) -> cons(X, n__fib1(Y, n__add(X, Y))) , fib1(X1, X2) -> n__fib1(X1, X2) , add(X1, X2) -> n__add(X1, X2) , add(s(X), Y) -> s(add(X, Y)) , add(0(), X) -> X , activate(X) -> X , activate(n__fib1(X1, X2)) -> fib1(activate(X1), activate(X2)) , activate(n__add(X1, X2)) -> add(activate(X1), activate(X2)) } 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..