MAYBE

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

Strict Trs:
  { __(X, nil()) -> X
  , __(__(X, Y), Z) -> __(X, __(Y, Z))
  , __(nil(), X) -> X
  , U11(tt()) -> U12(isPalListKind())
  , U12(tt()) -> U13(isNeList())
  , isPalListKind() -> tt()
  , isPalListKind() -> U91(isPalListKind())
  , U13(tt()) -> tt()
  , isNeList() -> U31(isPalListKind())
  , isNeList() -> U41(isPalListKind())
  , isNeList() -> U51(isPalListKind())
  , U21(tt()) -> U22(isPalListKind())
  , U22(tt()) -> U23(isPalListKind())
  , U23(tt()) -> U24(isPalListKind())
  , U24(tt()) -> U25(isList())
  , U25(tt()) -> U26(isList())
  , isList() -> U11(isPalListKind())
  , isList() -> tt()
  , isList() -> U21(isPalListKind())
  , U26(tt()) -> tt()
  , U31(tt()) -> U32(isPalListKind())
  , U32(tt()) -> U33(isQid())
  , U33(tt()) -> tt()
  , isQid() -> tt()
  , U41(tt()) -> U42(isPalListKind())
  , U42(tt()) -> U43(isPalListKind())
  , U43(tt()) -> U44(isPalListKind())
  , U44(tt()) -> U45(isList())
  , U45(tt()) -> U46(isNeList())
  , U46(tt()) -> tt()
  , U51(tt()) -> U52(isPalListKind())
  , U52(tt()) -> U53(isPalListKind())
  , U53(tt()) -> U54(isPalListKind())
  , U54(tt()) -> U55(isNeList())
  , U55(tt()) -> U56(isList())
  , U56(tt()) -> tt()
  , U61(tt()) -> U62(isPalListKind())
  , U62(tt()) -> U63(isQid())
  , U63(tt()) -> tt()
  , U71(tt()) -> U72(isPalListKind())
  , U72(tt()) -> U73(isPal())
  , U73(tt()) -> U74(isPalListKind())
  , isPal() -> tt()
  , isPal() -> U81(isPalListKind())
  , U74(tt()) -> tt()
  , U81(tt()) -> U82(isPalListKind())
  , U82(tt()) -> U83(isNePal())
  , U83(tt()) -> tt()
  , isNePal() -> U61(isPalListKind())
  , isNePal() -> U71(isQid())
  , U91(tt()) -> U92(isPalListKind())
  , U92(tt()) -> tt() }
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) '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
         
      
   


Arrrr..