MAYBE

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

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


Arrrr..