MAYBE

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

Strict Trs:
  { inc(Cons(x, xs)) -> Cons(Cons(Nil(), Nil()), inc(xs))
  , inc(Nil()) -> Cons(Nil(), Nil())
  , nestinc(Cons(x, xs)) -> nestinc(inc(Cons(x, xs)))
  , nestinc(Nil()) -> number17(Nil())
  , number17(x) ->
    Cons(Nil(),
         Cons(Nil(),
              Cons(Nil(),
                   Cons(Nil(),
                        Cons(Nil(),
                             Cons(Nil(),
                                  Cons(Nil(),
                                       Cons(Nil(),
                                            Cons(Nil(),
                                                 Cons(Nil(),
                                                      Cons(Nil(),
                                                           Cons(Nil(),
                                                                Cons(Nil(),
                                                                     Cons(Nil(),
                                                                          Cons(Nil(),
                                                                               Cons(Nil(),
                                                                                    Cons(Nil(),
                                                                                         Nil())))))))))))))))))
  , goal(x) -> nestinc(x) }
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) '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) 'Polynomial Path Order (PS) (timeout of 60 seconds)' failed due
            to the following reason:
            
            The input cannot be shown compatible
         
         2) 'bsearch-popstar (timeout of 60 seconds)' failed due to the
            following reason:
            
            The input cannot be shown compatible
         
      
   


Arrrr..