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