MAYBE 1045.85/297.03 MAYBE 1045.85/297.03 1045.85/297.03 We are left with following problem, upon which TcT provides the 1045.85/297.03 certificate MAYBE. 1045.85/297.03 1045.85/297.03 Strict Trs: 1045.85/297.03 { fib(N) -> sel(N, fib1(s(0()), s(0()))) 1045.85/297.03 , sel(s(N), cons(X, XS)) -> sel(N, activate(XS)) 1045.85/297.03 , sel(0(), cons(X, XS)) -> X 1045.85/297.03 , fib1(X, Y) -> cons(X, n__fib1(Y, n__add(X, Y))) 1045.85/297.03 , fib1(X1, X2) -> n__fib1(X1, X2) 1045.85/297.03 , add(X1, X2) -> n__add(X1, X2) 1045.85/297.03 , add(s(X), Y) -> s(add(X, Y)) 1045.85/297.03 , add(0(), X) -> X 1045.85/297.03 , activate(X) -> X 1045.85/297.03 , activate(n__fib1(X1, X2)) -> fib1(activate(X1), activate(X2)) 1045.85/297.03 , activate(n__add(X1, X2)) -> add(activate(X1), activate(X2)) } 1045.85/297.03 Obligation: 1045.85/297.03 runtime complexity 1045.85/297.03 Answer: 1045.85/297.03 MAYBE 1045.85/297.03 1045.85/297.03 None of the processors succeeded. 1045.85/297.03 1045.85/297.03 Details of failed attempt(s): 1045.85/297.03 ----------------------------- 1045.85/297.03 1) 'With Problem ... (timeout of 297 seconds)' failed due to the 1045.85/297.03 following reason: 1045.85/297.03 1045.85/297.03 Computation stopped due to timeout after 297.0 seconds. 1045.85/297.03 1045.85/297.03 2) 'Best' failed due to the following reason: 1045.85/297.03 1045.85/297.03 None of the processors succeeded. 1045.85/297.03 1045.85/297.03 Details of failed attempt(s): 1045.85/297.03 ----------------------------- 1045.85/297.03 1) 'With Problem ... (timeout of 148 seconds) (timeout of 297 1045.85/297.03 seconds)' failed due to the following reason: 1045.85/297.03 1045.85/297.03 Computation stopped due to timeout after 148.0 seconds. 1045.85/297.03 1045.85/297.03 2) 'Best' failed due to the following reason: 1045.85/297.03 1045.85/297.03 None of the processors succeeded. 1045.85/297.03 1045.85/297.03 Details of failed attempt(s): 1045.85/297.03 ----------------------------- 1045.85/297.03 1) 'bsearch-popstar (timeout of 297 seconds)' failed due to the 1045.85/297.03 following reason: 1045.85/297.03 1045.85/297.03 The processor is inapplicable, reason: 1045.85/297.03 Processor only applicable for innermost runtime complexity analysis 1045.85/297.03 1045.85/297.03 2) 'Polynomial Path Order (PS) (timeout of 297 seconds)' failed due 1045.85/297.03 to the following reason: 1045.85/297.03 1045.85/297.03 The processor is inapplicable, reason: 1045.85/297.03 Processor only applicable for innermost runtime complexity analysis 1045.85/297.03 1045.85/297.03 1045.85/297.03 3) 'Fastest (timeout of 24 seconds) (timeout of 297 seconds)' 1045.85/297.03 failed due to the following reason: 1045.85/297.03 1045.85/297.03 None of the processors succeeded. 1045.85/297.03 1045.85/297.03 Details of failed attempt(s): 1045.85/297.03 ----------------------------- 1045.85/297.03 1) 'Bounds with minimal-enrichment and initial automaton 'match'' 1045.85/297.03 failed due to the following reason: 1045.85/297.03 1045.85/297.03 match-boundness of the problem could not be verified. 1045.85/297.03 1045.85/297.03 2) 'Bounds with perSymbol-enrichment and initial automaton 'match'' 1045.85/297.03 failed due to the following reason: 1045.85/297.03 1045.85/297.03 match-boundness of the problem could not be verified. 1045.85/297.03 1045.85/297.03 1045.85/297.03 1045.85/297.03 3) 'Weak Dependency Pairs (timeout of 297 seconds)' failed due to 1045.85/297.03 the following reason: 1045.85/297.03 1045.85/297.03 We add the following weak dependency pairs: 1045.85/297.03 1045.85/297.03 Strict DPs: 1045.85/297.03 { fib^#(N) -> c_1(sel^#(N, fib1(s(0()), s(0())))) 1045.85/297.03 , sel^#(s(N), cons(X, XS)) -> c_2(sel^#(N, activate(XS))) 1045.85/297.03 , sel^#(0(), cons(X, XS)) -> c_3(X) 1045.85/297.03 , fib1^#(X, Y) -> c_4(X, Y, X, Y) 1045.85/297.03 , fib1^#(X1, X2) -> c_5(X1, X2) 1045.85/297.03 , add^#(X1, X2) -> c_6(X1, X2) 1045.85/297.03 , add^#(s(X), Y) -> c_7(add^#(X, Y)) 1045.85/297.03 , add^#(0(), X) -> c_8(X) 1045.85/297.03 , activate^#(X) -> c_9(X) 1045.85/297.03 , activate^#(n__fib1(X1, X2)) -> 1045.85/297.03 c_10(fib1^#(activate(X1), activate(X2))) 1045.85/297.03 , activate^#(n__add(X1, X2)) -> 1045.85/297.03 c_11(add^#(activate(X1), activate(X2))) } 1045.85/297.03 1045.85/297.03 and mark the set of starting terms. 1045.85/297.03 1045.85/297.03 We are left with following problem, upon which TcT provides the 1045.85/297.03 certificate MAYBE. 1045.85/297.03 1045.85/297.03 Strict DPs: 1045.85/297.03 { fib^#(N) -> c_1(sel^#(N, fib1(s(0()), s(0())))) 1045.85/297.03 , sel^#(s(N), cons(X, XS)) -> c_2(sel^#(N, activate(XS))) 1045.85/297.03 , sel^#(0(), cons(X, XS)) -> c_3(X) 1045.85/297.03 , fib1^#(X, Y) -> c_4(X, Y, X, Y) 1045.85/297.03 , fib1^#(X1, X2) -> c_5(X1, X2) 1045.85/297.03 , add^#(X1, X2) -> c_6(X1, X2) 1045.85/297.03 , add^#(s(X), Y) -> c_7(add^#(X, Y)) 1045.85/297.03 , add^#(0(), X) -> c_8(X) 1045.85/297.03 , activate^#(X) -> c_9(X) 1045.85/297.03 , activate^#(n__fib1(X1, X2)) -> 1045.85/297.03 c_10(fib1^#(activate(X1), activate(X2))) 1045.85/297.03 , activate^#(n__add(X1, X2)) -> 1045.85/297.03 c_11(add^#(activate(X1), activate(X2))) } 1045.85/297.03 Strict Trs: 1045.85/297.03 { fib(N) -> sel(N, fib1(s(0()), s(0()))) 1045.85/297.03 , sel(s(N), cons(X, XS)) -> sel(N, activate(XS)) 1045.85/297.03 , sel(0(), cons(X, XS)) -> X 1045.85/297.03 , fib1(X, Y) -> cons(X, n__fib1(Y, n__add(X, Y))) 1045.85/297.03 , fib1(X1, X2) -> n__fib1(X1, X2) 1045.85/297.03 , add(X1, X2) -> n__add(X1, X2) 1045.85/297.03 , add(s(X), Y) -> s(add(X, Y)) 1045.85/297.03 , add(0(), X) -> X 1045.85/297.03 , activate(X) -> X 1045.85/297.03 , activate(n__fib1(X1, X2)) -> fib1(activate(X1), activate(X2)) 1045.85/297.03 , activate(n__add(X1, X2)) -> add(activate(X1), activate(X2)) } 1045.85/297.03 Obligation: 1045.85/297.03 runtime complexity 1045.85/297.03 Answer: 1045.85/297.03 MAYBE 1045.85/297.03 1045.85/297.03 Empty strict component of the problem is NOT empty. 1045.85/297.03 1045.85/297.03 1045.85/297.03 Arrrr.. 1046.82/297.92 EOF