MAYBE

We are left with following problem, upon which TcT provides the
certificate MAYBE.

Strict Trs:
  { sum(cons(s(n), x), cons(m, y)) -> sum(cons(n, x), cons(s(m), y))
  , sum(cons(0(), x), y) -> sum(x, y)
  , sum(nil(), y) -> y
  , weight(cons(n, cons(m, x))) ->
    weight(sum(cons(n, cons(m, x)), cons(0(), x)))
  , weight(cons(n, nil())) -> n }
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:
     { sum^#(cons(s(n), x), cons(m, y)) ->
       c_1(sum^#(cons(n, x), cons(s(m), y)))
     , sum^#(cons(0(), x), y) -> c_2(sum^#(x, y))
     , sum^#(nil(), y) -> c_3(y)
     , weight^#(cons(n, cons(m, x))) ->
       c_4(weight^#(sum(cons(n, cons(m, x)), cons(0(), x))))
     , weight^#(cons(n, nil())) -> c_5(n) }
   
   and mark the set of starting terms.
   
   We are left with following problem, upon which TcT provides the
   certificate MAYBE.
   
   Strict DPs:
     { sum^#(cons(s(n), x), cons(m, y)) ->
       c_1(sum^#(cons(n, x), cons(s(m), y)))
     , sum^#(cons(0(), x), y) -> c_2(sum^#(x, y))
     , sum^#(nil(), y) -> c_3(y)
     , weight^#(cons(n, cons(m, x))) ->
       c_4(weight^#(sum(cons(n, cons(m, x)), cons(0(), x))))
     , weight^#(cons(n, nil())) -> c_5(n) }
   Strict Trs:
     { sum(cons(s(n), x), cons(m, y)) -> sum(cons(n, x), cons(s(m), y))
     , sum(cons(0(), x), y) -> sum(x, y)
     , sum(nil(), y) -> y
     , weight(cons(n, cons(m, x))) ->
       weight(sum(cons(n, cons(m, x)), cons(0(), x)))
     , weight(cons(n, nil())) -> n }
   Obligation:
     runtime complexity
   Answer:
     MAYBE
   
   Empty strict component of the problem is NOT empty.


Arrrr..