MAYBE

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

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


Arrrr..