MAYBE

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

Strict Trs:
  { empty(nil()) -> true()
  , empty(cons(x, y)) -> false()
  , tail(nil()) -> nil()
  , tail(cons(x, y)) -> y
  , head(cons(x, y)) -> x
  , zero(0()) -> true()
  , zero(s(x)) -> false()
  , p(0()) -> 0()
  , p(s(0())) -> 0()
  , p(s(s(x))) -> s(p(s(x)))
  , intlist(x) -> if_intlist(empty(x), x)
  , if_intlist(true(), x) -> nil()
  , if_intlist(false(), x) -> cons(s(head(x)), intlist(tail(x)))
  , int(x, y) -> if_int(zero(x), zero(y), x, y)
  , if_int(true(), b, x, y) -> if1(b, x, y)
  , if_int(false(), b, x, y) -> if2(b, x, y)
  , if1(true(), x, y) -> cons(0(), nil())
  , if1(false(), x, y) -> cons(0(), int(s(0()), y))
  , if2(true(), x, y) -> nil()
  , if2(false(), x, y) -> intlist(int(p(x), p(y))) }
Obligation:
  innermost runtime complexity
Answer:
  MAYBE

None of the processors succeeded.

Details of failed attempt(s):
-----------------------------
1) 'empty' failed due to the following reason:
   
   Empty strict component of the problem is NOT empty.

2) 'Best' failed due to the following reason:
   
   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 input cannot be shown compatible
         
         2) 'Polynomial Path Order (PS) (timeout of 60 seconds)' failed due
            to the following reason:
            
            The input cannot be shown compatible
         
      
      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.
         
      
   


Arrrr..