MAYBE

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

Strict Trs:
  { rev(nil()) -> nil()
  , rev(cons(x, l)) -> cons(rev1(x, l), rev2(x, l))
  , rev1(x, cons(y, l)) -> rev1(y, l)
  , rev1(0(), nil()) -> 0()
  , rev1(s(x), nil()) -> s(x)
  , rev2(x, nil()) -> nil()
  , rev2(x, cons(y, l)) -> rev(cons(x, rev2(y, l))) }
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:
     { rev^#(nil()) -> c_1()
     , rev^#(cons(x, l)) -> c_2(rev1^#(x, l), rev2^#(x, l))
     , rev1^#(x, cons(y, l)) -> c_3(rev1^#(y, l))
     , rev1^#(0(), nil()) -> c_4()
     , rev1^#(s(x), nil()) -> c_5(x)
     , rev2^#(x, nil()) -> c_6()
     , rev2^#(x, cons(y, l)) -> c_7(rev^#(cons(x, rev2(y, l)))) }
   
   and mark the set of starting terms.
   
   We are left with following problem, upon which TcT provides the
   certificate MAYBE.
   
   Strict DPs:
     { rev^#(nil()) -> c_1()
     , rev^#(cons(x, l)) -> c_2(rev1^#(x, l), rev2^#(x, l))
     , rev1^#(x, cons(y, l)) -> c_3(rev1^#(y, l))
     , rev1^#(0(), nil()) -> c_4()
     , rev1^#(s(x), nil()) -> c_5(x)
     , rev2^#(x, nil()) -> c_6()
     , rev2^#(x, cons(y, l)) -> c_7(rev^#(cons(x, rev2(y, l)))) }
   Strict Trs:
     { rev(nil()) -> nil()
     , rev(cons(x, l)) -> cons(rev1(x, l), rev2(x, l))
     , rev1(x, cons(y, l)) -> rev1(y, l)
     , rev1(0(), nil()) -> 0()
     , rev1(s(x), nil()) -> s(x)
     , rev2(x, nil()) -> nil()
     , rev2(x, cons(y, l)) -> rev(cons(x, rev2(y, l))) }
   Obligation:
     runtime complexity
   Answer:
     MAYBE
   
   We estimate the number of application of {1,4,6} by applications of
   Pre({1,4,6}) = {2,3,5}. Here rules are labeled as follows:
   
     DPs:
       { 1: rev^#(nil()) -> c_1()
       , 2: rev^#(cons(x, l)) -> c_2(rev1^#(x, l), rev2^#(x, l))
       , 3: rev1^#(x, cons(y, l)) -> c_3(rev1^#(y, l))
       , 4: rev1^#(0(), nil()) -> c_4()
       , 5: rev1^#(s(x), nil()) -> c_5(x)
       , 6: rev2^#(x, nil()) -> c_6()
       , 7: rev2^#(x, cons(y, l)) -> c_7(rev^#(cons(x, rev2(y, l)))) }
   
   We are left with following problem, upon which TcT provides the
   certificate MAYBE.
   
   Strict DPs:
     { rev^#(cons(x, l)) -> c_2(rev1^#(x, l), rev2^#(x, l))
     , rev1^#(x, cons(y, l)) -> c_3(rev1^#(y, l))
     , rev1^#(s(x), nil()) -> c_5(x)
     , rev2^#(x, cons(y, l)) -> c_7(rev^#(cons(x, rev2(y, l)))) }
   Strict Trs:
     { rev(nil()) -> nil()
     , rev(cons(x, l)) -> cons(rev1(x, l), rev2(x, l))
     , rev1(x, cons(y, l)) -> rev1(y, l)
     , rev1(0(), nil()) -> 0()
     , rev1(s(x), nil()) -> s(x)
     , rev2(x, nil()) -> nil()
     , rev2(x, cons(y, l)) -> rev(cons(x, rev2(y, l))) }
   Weak DPs:
     { rev^#(nil()) -> c_1()
     , rev1^#(0(), nil()) -> c_4()
     , rev2^#(x, nil()) -> c_6() }
   Obligation:
     runtime complexity
   Answer:
     MAYBE
   
   Empty strict component of the problem is NOT empty.


Arrrr..