MAYBE

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

Strict Trs:
  { h(x, c(y, z), t(w)) -> h(c(s(y), x), z, t(c(t(w), w)))
  , h(c(x, y), c(s(z), z), t(w)) ->
    h(z, c(y, x), t(t(c(x, c(y, t(w))))))
  , h(c(s(x), c(s(0()), y)), z, t(x)) ->
    h(y, c(s(0()), c(x, z)), t(t(c(x, s(x)))))
  , t(x) -> x
  , t(x) -> c(0(), c(0(), c(0(), c(0(), c(0(), x)))))
  , t(t(x)) -> t(c(t(x), 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) '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 minimal-enrichment and initial automaton 'match''
         failed due to the following reason:
         
         match-boundness of the problem could not be verified.
      
      2) 'Bounds with perSymbol-enrichment and initial automaton 'match''
         failed due to the following reason:
         
         match-boundness of the problem could not be verified.
      
   
   3) 'Best' failed due to the following reason:
      
      None of the processors succeeded.
      
      Details of failed attempt(s):
      -----------------------------
      1) '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
      
      2) '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
      
   

3) 'Innermost Weak Dependency Pairs (timeout of 60 seconds)' failed
   due to the following reason:
   
   We add the following weak dependency pairs:
   
   Strict DPs:
     { h^#(x, c(y, z), t(w)) -> c_1(h^#(c(s(y), x), z, t(c(t(w), w))))
     , h^#(c(x, y), c(s(z), z), t(w)) ->
       c_2(h^#(z, c(y, x), t(t(c(x, c(y, t(w)))))))
     , h^#(c(s(x), c(s(0()), y)), z, t(x)) ->
       c_3(h^#(y, c(s(0()), c(x, z)), t(t(c(x, s(x))))))
     , t^#(x) -> c_4(x)
     , t^#(x) -> c_5(x)
     , t^#(t(x)) -> c_6(t^#(c(t(x), x))) }
   
   and mark the set of starting terms.
   
   We are left with following problem, upon which TcT provides the
   certificate MAYBE.
   
   Strict DPs:
     { h^#(x, c(y, z), t(w)) -> c_1(h^#(c(s(y), x), z, t(c(t(w), w))))
     , h^#(c(x, y), c(s(z), z), t(w)) ->
       c_2(h^#(z, c(y, x), t(t(c(x, c(y, t(w)))))))
     , h^#(c(s(x), c(s(0()), y)), z, t(x)) ->
       c_3(h^#(y, c(s(0()), c(x, z)), t(t(c(x, s(x))))))
     , t^#(x) -> c_4(x)
     , t^#(x) -> c_5(x)
     , t^#(t(x)) -> c_6(t^#(c(t(x), x))) }
   Strict Trs:
     { h(x, c(y, z), t(w)) -> h(c(s(y), x), z, t(c(t(w), w)))
     , h(c(x, y), c(s(z), z), t(w)) ->
       h(z, c(y, x), t(t(c(x, c(y, t(w))))))
     , h(c(s(x), c(s(0()), y)), z, t(x)) ->
       h(y, c(s(0()), c(x, z)), t(t(c(x, s(x)))))
     , t(x) -> x
     , t(x) -> c(0(), c(0(), c(0(), c(0(), c(0(), x)))))
     , t(t(x)) -> t(c(t(x), x)) }
   Obligation:
     runtime complexity
   Answer:
     MAYBE
   
   Empty strict component of the problem is NOT empty.


Arrrr..