MAYBE

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

Strict Trs:
  { +(x, +(y, z)) -> +(+(x, y), z)
  , +(x, 0()) -> x
  , +(x, s(y)) -> s(+(x, y))
  , +(0(), y) -> y
  , +(s(x), y) -> s(+(x, y))
  , f(g(f(x))) -> f(h(s(0()), x))
  , f(g(h(x, y))) -> f(h(s(x), y))
  , f(h(x, h(y, z))) -> f(h(+(x, y), z)) }
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:
      
      Computation stopped due to timeout after 5.0 seconds.
   
   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:
     { +^#(x, +(y, z)) -> c_1(+^#(+(x, y), z))
     , +^#(x, 0()) -> c_2(x)
     , +^#(x, s(y)) -> c_3(+^#(x, y))
     , +^#(0(), y) -> c_4(y)
     , +^#(s(x), y) -> c_5(+^#(x, y))
     , f^#(g(f(x))) -> c_6(f^#(h(s(0()), x)))
     , f^#(g(h(x, y))) -> c_7(f^#(h(s(x), y)))
     , f^#(h(x, h(y, z))) -> c_8(f^#(h(+(x, y), z))) }
   
   and mark the set of starting terms.
   
   We are left with following problem, upon which TcT provides the
   certificate MAYBE.
   
   Strict DPs:
     { +^#(x, +(y, z)) -> c_1(+^#(+(x, y), z))
     , +^#(x, 0()) -> c_2(x)
     , +^#(x, s(y)) -> c_3(+^#(x, y))
     , +^#(0(), y) -> c_4(y)
     , +^#(s(x), y) -> c_5(+^#(x, y))
     , f^#(g(f(x))) -> c_6(f^#(h(s(0()), x)))
     , f^#(g(h(x, y))) -> c_7(f^#(h(s(x), y)))
     , f^#(h(x, h(y, z))) -> c_8(f^#(h(+(x, y), z))) }
   Strict Trs:
     { +(x, +(y, z)) -> +(+(x, y), z)
     , +(x, 0()) -> x
     , +(x, s(y)) -> s(+(x, y))
     , +(0(), y) -> y
     , +(s(x), y) -> s(+(x, y))
     , f(g(f(x))) -> f(h(s(0()), x))
     , f(g(h(x, y))) -> f(h(s(x), y))
     , f(h(x, h(y, z))) -> f(h(+(x, y), z)) }
   Obligation:
     runtime complexity
   Answer:
     MAYBE
   
   Empty strict component of the problem is NOT empty.


Arrrr..