MAYBE

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

Strict Trs:
  { car(cons(x, l)) -> x
  , cddr(cons(x, cons(y, l))) -> l
  , cddr(cons(x, nil())) -> nil()
  , cddr(nil()) -> nil()
  , cadr(cons(x, cons(y, l))) -> y
  , isZero(0()) -> true()
  , isZero(s(x)) -> false()
  , plus(x, y) -> ifplus(isZero(x), x, y)
  , ifplus(true(), x, y) -> y
  , ifplus(false(), x, y) -> s(plus(p(x), y))
  , p(0()) -> 0()
  , p(s(x)) -> x
  , times(x, y) -> iftimes(isZero(x), x, y)
  , iftimes(true(), x, y) -> 0()
  , iftimes(false(), x, y) -> plus(y, times(p(x), y))
  , shorter(cons(x, l), 0()) -> false()
  , shorter(cons(x, l), s(y)) -> shorter(l, y)
  , shorter(nil(), y) -> true()
  , prod(l) -> if(shorter(l, 0()), shorter(l, s(0())), l)
  , if(true(), b, l) -> s(0())
  , if(false(), b, l) -> if2(b, l)
  , if2(true(), l) -> car(l)
  , if2(false(), l) -> prod(cons(times(car(l), cadr(l)), cddr(l))) }
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) '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
         
      
      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 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.
         
      
   


Arrrr..