MAYBE

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

Strict Trs:
  { and(true(), y) -> y
  , and(false(), y) -> false()
  , eq(nil(), nil()) -> true()
  , eq(nil(), cons(t, l)) -> false()
  , eq(cons(t, l), nil()) -> false()
  , eq(cons(t, l), cons(t', l')) -> and(eq(t, t'), eq(l, l'))
  , eq(var(l), var(l')) -> eq(l, l')
  , eq(var(l), apply(t, s)) -> false()
  , eq(var(l), lambda(x, t)) -> false()
  , eq(apply(t, s), var(l)) -> false()
  , eq(apply(t, s), apply(t', s')) -> and(eq(t, t'), eq(s, s'))
  , eq(apply(t, s), lambda(x, t)) -> false()
  , eq(lambda(x, t), var(l)) -> false()
  , eq(lambda(x, t), apply(t, s)) -> false()
  , eq(lambda(x, t), lambda(x', t')) -> and(eq(x, x'), eq(t, t'))
  , if(true(), var(k), var(l')) -> var(k)
  , if(false(), var(k), var(l')) -> var(l')
  , ren(x, y, apply(t, s)) -> apply(ren(x, y, t), ren(x, y, s))
  , ren(x, y, lambda(z, t)) ->
    lambda(var(cons(x, cons(y, cons(lambda(z, t), nil())))),
           ren(x,
               y,
               ren(z, var(cons(x, cons(y, cons(lambda(z, t), nil())))), t)))
  , ren(var(l), var(k), var(l')) -> if(eq(l, l'), var(k), var(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..