MAYBE

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

Strict Trs:
  { a____(X1, X2) -> __(X1, X2)
  , a____(X, nil()) -> mark(X)
  , a____(__(X, Y), Z) -> a____(mark(X), a____(mark(Y), mark(Z)))
  , a____(nil(), X) -> mark(X)
  , mark(__(X1, X2)) -> a____(mark(X1), mark(X2))
  , mark(nil()) -> nil()
  , mark(tt()) -> tt()
  , mark(and(X1, X2)) -> a__and(mark(X1), X2)
  , mark(isNePal(X)) -> a__isNePal(mark(X))
  , a__and(X1, X2) -> and(X1, X2)
  , a__and(tt(), X) -> mark(X)
  , a__isNePal(X) -> isNePal(X)
  , a__isNePal(__(I, __(P, I))) -> tt() }
Obligation:
  innermost runtime complexity
Answer:
  MAYBE

The input cannot be shown compatible

Arrrr..