MAYBE 1034.11/297.02 MAYBE 1034.11/297.02 1034.11/297.02 We are left with following problem, upon which TcT provides the 1034.11/297.02 certificate MAYBE. 1034.11/297.02 1034.11/297.02 Strict Trs: 1034.11/297.02 { a__fib(N) -> a__sel(mark(N), a__fib1(s(0()), s(0()))) 1034.11/297.02 , a__fib(X) -> fib(X) 1034.11/297.02 , a__sel(X1, X2) -> sel(X1, X2) 1034.11/297.02 , a__sel(s(N), cons(X, XS)) -> a__sel(mark(N), mark(XS)) 1034.11/297.02 , a__sel(0(), cons(X, XS)) -> mark(X) 1034.11/297.02 , mark(s(X)) -> s(mark(X)) 1034.11/297.02 , mark(0()) -> 0() 1034.11/297.02 , mark(cons(X1, X2)) -> cons(mark(X1), X2) 1034.11/297.02 , mark(fib1(X1, X2)) -> a__fib1(mark(X1), mark(X2)) 1034.11/297.02 , mark(add(X1, X2)) -> a__add(mark(X1), mark(X2)) 1034.11/297.02 , mark(fib(X)) -> a__fib(mark(X)) 1034.11/297.02 , mark(sel(X1, X2)) -> a__sel(mark(X1), mark(X2)) 1034.11/297.02 , a__fib1(X, Y) -> cons(mark(X), fib1(Y, add(X, Y))) 1034.11/297.02 , a__fib1(X1, X2) -> fib1(X1, X2) 1034.11/297.02 , a__add(X1, X2) -> add(X1, X2) 1034.11/297.02 , a__add(s(X), Y) -> s(a__add(mark(X), mark(Y))) 1034.11/297.02 , a__add(0(), X) -> mark(X) } 1034.11/297.02 Obligation: 1034.11/297.02 innermost runtime complexity 1034.11/297.02 Answer: 1034.11/297.02 MAYBE 1034.11/297.02 1034.11/297.02 None of the processors succeeded. 1034.11/297.02 1034.11/297.02 Details of failed attempt(s): 1034.11/297.02 ----------------------------- 1034.11/297.02 1) 'empty' failed due to the following reason: 1034.11/297.02 1034.11/297.02 Empty strict component of the problem is NOT empty. 1034.11/297.02 1034.11/297.02 2) 'Best' failed due to the following reason: 1034.11/297.02 1034.11/297.02 None of the processors succeeded. 1034.11/297.02 1034.11/297.02 Details of failed attempt(s): 1034.11/297.02 ----------------------------- 1034.11/297.02 1) 'With Problem ... (timeout of 297 seconds)' failed due to the 1034.11/297.02 following reason: 1034.11/297.02 1034.11/297.02 Computation stopped due to timeout after 297.0 seconds. 1034.11/297.02 1034.11/297.02 2) 'Best' failed due to the following reason: 1034.11/297.02 1034.11/297.02 None of the processors succeeded. 1034.11/297.02 1034.11/297.02 Details of failed attempt(s): 1034.11/297.02 ----------------------------- 1034.11/297.02 1) 'With Problem ... (timeout of 148 seconds) (timeout of 297 1034.11/297.02 seconds)' failed due to the following reason: 1034.11/297.02 1034.11/297.02 Computation stopped due to timeout after 148.0 seconds. 1034.11/297.02 1034.11/297.02 2) 'Best' failed due to the following reason: 1034.11/297.02 1034.11/297.02 None of the processors succeeded. 1034.11/297.02 1034.11/297.02 Details of failed attempt(s): 1034.11/297.02 ----------------------------- 1034.11/297.02 1) 'Polynomial Path Order (PS) (timeout of 297 seconds)' failed due 1034.11/297.02 to the following reason: 1034.11/297.02 1034.11/297.02 The input cannot be shown compatible 1034.11/297.02 1034.11/297.02 2) 'bsearch-popstar (timeout of 297 seconds)' failed due to the 1034.11/297.02 following reason: 1034.11/297.02 1034.11/297.02 The input cannot be shown compatible 1034.11/297.02 1034.11/297.02 1034.11/297.02 3) 'Fastest (timeout of 24 seconds) (timeout of 297 seconds)' 1034.11/297.02 failed due to the following reason: 1034.11/297.02 1034.11/297.02 None of the processors succeeded. 1034.11/297.02 1034.11/297.02 Details of failed attempt(s): 1034.11/297.02 ----------------------------- 1034.11/297.02 1) 'Bounds with minimal-enrichment and initial automaton 'match'' 1034.11/297.02 failed due to the following reason: 1034.11/297.02 1034.11/297.02 match-boundness of the problem could not be verified. 1034.11/297.02 1034.11/297.02 2) 'Bounds with perSymbol-enrichment and initial automaton 'match'' 1034.11/297.02 failed due to the following reason: 1034.11/297.02 1034.11/297.02 match-boundness of the problem could not be verified. 1034.11/297.02 1034.11/297.02 1034.11/297.02 1034.11/297.02 1034.11/297.02 1034.11/297.02 Arrrr.. 1034.56/297.42 EOF