MAYBE

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

Strict Trs:
  { 0(#()) -> #()
  , +(x, #()) -> x
  , +(0(x), 0(y)) -> 0(+(x, y))
  , +(0(x), 1(y)) -> 1(+(x, y))
  , +(#(), x) -> x
  , +(+(x, y), z) -> +(x, +(y, z))
  , +(1(x), 0(y)) -> 1(+(x, y))
  , +(1(x), 1(y)) -> 0(+(+(x, y), 1(#())))
  , *(0(x), y) -> 0(*(x, y))
  , *(#(), x) -> #()
  , *(1(x), y) -> +(0(*(x, y)), y)
  , *(*(x, y), z) -> *(x, *(y, z))
  , sum(nil()) -> 0(#())
  , sum(cons(x, l)) -> +(x, sum(l))
  , prod(nil()) -> 1(#())
  , prod(cons(x, l)) -> *(x, prod(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) '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) '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) 'Innermost Weak Dependency Pairs (timeout of 60 seconds)' failed
   due to the following reason:
   
   We add the following weak dependency pairs:
   
   Strict DPs:
     { 0^#(#()) -> c_1()
     , +^#(x, #()) -> c_2(x)
     , +^#(0(x), 0(y)) -> c_3(0^#(+(x, y)))
     , +^#(0(x), 1(y)) -> c_4(+^#(x, y))
     , +^#(#(), x) -> c_5(x)
     , +^#(+(x, y), z) -> c_6(+^#(x, +(y, z)))
     , +^#(1(x), 0(y)) -> c_7(+^#(x, y))
     , +^#(1(x), 1(y)) -> c_8(0^#(+(+(x, y), 1(#()))))
     , *^#(0(x), y) -> c_9(0^#(*(x, y)))
     , *^#(#(), x) -> c_10()
     , *^#(1(x), y) -> c_11(+^#(0(*(x, y)), y))
     , *^#(*(x, y), z) -> c_12(*^#(x, *(y, z)))
     , sum^#(nil()) -> c_13(0^#(#()))
     , sum^#(cons(x, l)) -> c_14(+^#(x, sum(l)))
     , prod^#(nil()) -> c_15()
     , prod^#(cons(x, l)) -> c_16(*^#(x, prod(l))) }
   
   and mark the set of starting terms.
   
   We are left with following problem, upon which TcT provides the
   certificate MAYBE.
   
   Strict DPs:
     { 0^#(#()) -> c_1()
     , +^#(x, #()) -> c_2(x)
     , +^#(0(x), 0(y)) -> c_3(0^#(+(x, y)))
     , +^#(0(x), 1(y)) -> c_4(+^#(x, y))
     , +^#(#(), x) -> c_5(x)
     , +^#(+(x, y), z) -> c_6(+^#(x, +(y, z)))
     , +^#(1(x), 0(y)) -> c_7(+^#(x, y))
     , +^#(1(x), 1(y)) -> c_8(0^#(+(+(x, y), 1(#()))))
     , *^#(0(x), y) -> c_9(0^#(*(x, y)))
     , *^#(#(), x) -> c_10()
     , *^#(1(x), y) -> c_11(+^#(0(*(x, y)), y))
     , *^#(*(x, y), z) -> c_12(*^#(x, *(y, z)))
     , sum^#(nil()) -> c_13(0^#(#()))
     , sum^#(cons(x, l)) -> c_14(+^#(x, sum(l)))
     , prod^#(nil()) -> c_15()
     , prod^#(cons(x, l)) -> c_16(*^#(x, prod(l))) }
   Strict Trs:
     { 0(#()) -> #()
     , +(x, #()) -> x
     , +(0(x), 0(y)) -> 0(+(x, y))
     , +(0(x), 1(y)) -> 1(+(x, y))
     , +(#(), x) -> x
     , +(+(x, y), z) -> +(x, +(y, z))
     , +(1(x), 0(y)) -> 1(+(x, y))
     , +(1(x), 1(y)) -> 0(+(+(x, y), 1(#())))
     , *(0(x), y) -> 0(*(x, y))
     , *(#(), x) -> #()
     , *(1(x), y) -> +(0(*(x, y)), y)
     , *(*(x, y), z) -> *(x, *(y, z))
     , sum(nil()) -> 0(#())
     , sum(cons(x, l)) -> +(x, sum(l))
     , prod(nil()) -> 1(#())
     , prod(cons(x, l)) -> *(x, prod(l)) }
   Obligation:
     runtime complexity
   Answer:
     MAYBE
   
   We estimate the number of application of {1,10,15} by applications
   of Pre({1,10,15}) = {2,3,5,8,9,12,13,16}. Here rules are labeled as
   follows:
   
     DPs:
       { 1: 0^#(#()) -> c_1()
       , 2: +^#(x, #()) -> c_2(x)
       , 3: +^#(0(x), 0(y)) -> c_3(0^#(+(x, y)))
       , 4: +^#(0(x), 1(y)) -> c_4(+^#(x, y))
       , 5: +^#(#(), x) -> c_5(x)
       , 6: +^#(+(x, y), z) -> c_6(+^#(x, +(y, z)))
       , 7: +^#(1(x), 0(y)) -> c_7(+^#(x, y))
       , 8: +^#(1(x), 1(y)) -> c_8(0^#(+(+(x, y), 1(#()))))
       , 9: *^#(0(x), y) -> c_9(0^#(*(x, y)))
       , 10: *^#(#(), x) -> c_10()
       , 11: *^#(1(x), y) -> c_11(+^#(0(*(x, y)), y))
       , 12: *^#(*(x, y), z) -> c_12(*^#(x, *(y, z)))
       , 13: sum^#(nil()) -> c_13(0^#(#()))
       , 14: sum^#(cons(x, l)) -> c_14(+^#(x, sum(l)))
       , 15: prod^#(nil()) -> c_15()
       , 16: prod^#(cons(x, l)) -> c_16(*^#(x, prod(l))) }
   
   We are left with following problem, upon which TcT provides the
   certificate MAYBE.
   
   Strict DPs:
     { +^#(x, #()) -> c_2(x)
     , +^#(0(x), 0(y)) -> c_3(0^#(+(x, y)))
     , +^#(0(x), 1(y)) -> c_4(+^#(x, y))
     , +^#(#(), x) -> c_5(x)
     , +^#(+(x, y), z) -> c_6(+^#(x, +(y, z)))
     , +^#(1(x), 0(y)) -> c_7(+^#(x, y))
     , +^#(1(x), 1(y)) -> c_8(0^#(+(+(x, y), 1(#()))))
     , *^#(0(x), y) -> c_9(0^#(*(x, y)))
     , *^#(1(x), y) -> c_11(+^#(0(*(x, y)), y))
     , *^#(*(x, y), z) -> c_12(*^#(x, *(y, z)))
     , sum^#(nil()) -> c_13(0^#(#()))
     , sum^#(cons(x, l)) -> c_14(+^#(x, sum(l)))
     , prod^#(cons(x, l)) -> c_16(*^#(x, prod(l))) }
   Strict Trs:
     { 0(#()) -> #()
     , +(x, #()) -> x
     , +(0(x), 0(y)) -> 0(+(x, y))
     , +(0(x), 1(y)) -> 1(+(x, y))
     , +(#(), x) -> x
     , +(+(x, y), z) -> +(x, +(y, z))
     , +(1(x), 0(y)) -> 1(+(x, y))
     , +(1(x), 1(y)) -> 0(+(+(x, y), 1(#())))
     , *(0(x), y) -> 0(*(x, y))
     , *(#(), x) -> #()
     , *(1(x), y) -> +(0(*(x, y)), y)
     , *(*(x, y), z) -> *(x, *(y, z))
     , sum(nil()) -> 0(#())
     , sum(cons(x, l)) -> +(x, sum(l))
     , prod(nil()) -> 1(#())
     , prod(cons(x, l)) -> *(x, prod(l)) }
   Weak DPs:
     { 0^#(#()) -> c_1()
     , *^#(#(), x) -> c_10()
     , prod^#(nil()) -> c_15() }
   Obligation:
     runtime complexity
   Answer:
     MAYBE
   
   We estimate the number of application of {2,7,8,11} by applications
   of Pre({2,7,8,11}) = {1,3,4,5,6,9,10,12,13}. Here rules are labeled
   as follows:
   
     DPs:
       { 1: +^#(x, #()) -> c_2(x)
       , 2: +^#(0(x), 0(y)) -> c_3(0^#(+(x, y)))
       , 3: +^#(0(x), 1(y)) -> c_4(+^#(x, y))
       , 4: +^#(#(), x) -> c_5(x)
       , 5: +^#(+(x, y), z) -> c_6(+^#(x, +(y, z)))
       , 6: +^#(1(x), 0(y)) -> c_7(+^#(x, y))
       , 7: +^#(1(x), 1(y)) -> c_8(0^#(+(+(x, y), 1(#()))))
       , 8: *^#(0(x), y) -> c_9(0^#(*(x, y)))
       , 9: *^#(1(x), y) -> c_11(+^#(0(*(x, y)), y))
       , 10: *^#(*(x, y), z) -> c_12(*^#(x, *(y, z)))
       , 11: sum^#(nil()) -> c_13(0^#(#()))
       , 12: sum^#(cons(x, l)) -> c_14(+^#(x, sum(l)))
       , 13: prod^#(cons(x, l)) -> c_16(*^#(x, prod(l)))
       , 14: 0^#(#()) -> c_1()
       , 15: *^#(#(), x) -> c_10()
       , 16: prod^#(nil()) -> c_15() }
   
   We are left with following problem, upon which TcT provides the
   certificate MAYBE.
   
   Strict DPs:
     { +^#(x, #()) -> c_2(x)
     , +^#(0(x), 1(y)) -> c_4(+^#(x, y))
     , +^#(#(), x) -> c_5(x)
     , +^#(+(x, y), z) -> c_6(+^#(x, +(y, z)))
     , +^#(1(x), 0(y)) -> c_7(+^#(x, y))
     , *^#(1(x), y) -> c_11(+^#(0(*(x, y)), y))
     , *^#(*(x, y), z) -> c_12(*^#(x, *(y, z)))
     , sum^#(cons(x, l)) -> c_14(+^#(x, sum(l)))
     , prod^#(cons(x, l)) -> c_16(*^#(x, prod(l))) }
   Strict Trs:
     { 0(#()) -> #()
     , +(x, #()) -> x
     , +(0(x), 0(y)) -> 0(+(x, y))
     , +(0(x), 1(y)) -> 1(+(x, y))
     , +(#(), x) -> x
     , +(+(x, y), z) -> +(x, +(y, z))
     , +(1(x), 0(y)) -> 1(+(x, y))
     , +(1(x), 1(y)) -> 0(+(+(x, y), 1(#())))
     , *(0(x), y) -> 0(*(x, y))
     , *(#(), x) -> #()
     , *(1(x), y) -> +(0(*(x, y)), y)
     , *(*(x, y), z) -> *(x, *(y, z))
     , sum(nil()) -> 0(#())
     , sum(cons(x, l)) -> +(x, sum(l))
     , prod(nil()) -> 1(#())
     , prod(cons(x, l)) -> *(x, prod(l)) }
   Weak DPs:
     { 0^#(#()) -> c_1()
     , +^#(0(x), 0(y)) -> c_3(0^#(+(x, y)))
     , +^#(1(x), 1(y)) -> c_8(0^#(+(+(x, y), 1(#()))))
     , *^#(0(x), y) -> c_9(0^#(*(x, y)))
     , *^#(#(), x) -> c_10()
     , sum^#(nil()) -> c_13(0^#(#()))
     , prod^#(nil()) -> c_15() }
   Obligation:
     runtime complexity
   Answer:
     MAYBE
   
   Empty strict component of the problem is NOT empty.


Arrrr..