MAYBE

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

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


Arrrr..