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, add(X, Y)))
  , fib1(X1, X2) -> n__fib1(X1, X2)
  , add(s(X), Y) -> s(add(X, Y))
  , add(0(), X) -> X
  , activate(X) -> X
  , activate(n__fib1(X1, X2)) -> fib1(X1, X2) }
Obligation:
  runtime complexity
Answer:
  MAYBE

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 processor is inapplicable, reason:
           Processor only applicable for innermost runtime complexity analysis
      
      2) 'Polynomial Path Order (PS) (timeout of 60 seconds)' failed due
         to the following reason:
         
         The processor is inapplicable, reason:
           Processor only applicable for innermost runtime complexity analysis
      
   
   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.
      
   

3) 'Innermost Weak Dependency Pairs (timeout of 60 seconds)' failed
   due to the following reason:
   
   We add the following weak dependency pairs:
   
   Strict DPs:
     { fib^#(N) -> c_1(sel^#(N, fib1(s(0()), s(0()))))
     , sel^#(s(N), cons(X, XS)) -> c_2(sel^#(N, activate(XS)))
     , sel^#(0(), cons(X, XS)) -> c_3(X)
     , fib1^#(X, Y) -> c_4(X, Y, add^#(X, Y))
     , fib1^#(X1, X2) -> c_5(X1, X2)
     , add^#(s(X), Y) -> c_6(add^#(X, Y))
     , add^#(0(), X) -> c_7(X)
     , activate^#(X) -> c_8(X)
     , activate^#(n__fib1(X1, X2)) -> c_9(fib1^#(X1, X2)) }
   
   and mark the set of starting terms.
   
   We are left with following problem, upon which TcT provides the
   certificate MAYBE.
   
   Strict DPs:
     { fib^#(N) -> c_1(sel^#(N, fib1(s(0()), s(0()))))
     , sel^#(s(N), cons(X, XS)) -> c_2(sel^#(N, activate(XS)))
     , sel^#(0(), cons(X, XS)) -> c_3(X)
     , fib1^#(X, Y) -> c_4(X, Y, add^#(X, Y))
     , fib1^#(X1, X2) -> c_5(X1, X2)
     , add^#(s(X), Y) -> c_6(add^#(X, Y))
     , add^#(0(), X) -> c_7(X)
     , activate^#(X) -> c_8(X)
     , activate^#(n__fib1(X1, X2)) -> c_9(fib1^#(X1, X2)) }
   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, add(X, Y)))
     , fib1(X1, X2) -> n__fib1(X1, X2)
     , add(s(X), Y) -> s(add(X, Y))
     , add(0(), X) -> X
     , activate(X) -> X
     , activate(n__fib1(X1, X2)) -> fib1(X1, X2) }
   Obligation:
     runtime complexity
   Answer:
     MAYBE
   
   Empty strict component of the problem is NOT empty.


Arrrr..