MAYBE

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

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


Arrrr..