MAYBE
* Step 1: Failure MAYBE
  + Considered Problem:
      - Strict TRS:
          __(X1,mark(X2)) -> mark(__(X1,X2))
          __(mark(X1),X2) -> mark(__(X1,X2))
          __(ok(X1),ok(X2)) -> ok(__(X1,X2))
          active(__(X,nil())) -> mark(X)
          active(__(X1,X2)) -> __(X1,active(X2))
          active(__(X1,X2)) -> __(active(X1),X2)
          active(__(__(X,Y),Z)) -> mark(__(X,__(Y,Z)))
          active(__(nil(),X)) -> mark(X)
          active(and(X1,X2)) -> and(active(X1),X2)
          active(and(tt(),X)) -> mark(X)
          active(isList(V)) -> mark(isNeList(V))
          active(isList(__(V1,V2))) -> mark(and(isList(V1),isList(V2)))
          active(isList(nil())) -> mark(tt())
          active(isNeList(V)) -> mark(isQid(V))
          active(isNeList(__(V1,V2))) -> mark(and(isList(V1),isNeList(V2)))
          active(isNeList(__(V1,V2))) -> mark(and(isNeList(V1),isList(V2)))
          active(isNePal(V)) -> mark(isQid(V))
          active(isNePal(__(I,__(P,I)))) -> mark(and(isQid(I),isPal(P)))
          active(isPal(V)) -> mark(isNePal(V))
          active(isPal(nil())) -> mark(tt())
          active(isQid(a())) -> mark(tt())
          active(isQid(e())) -> mark(tt())
          active(isQid(i())) -> mark(tt())
          active(isQid(o())) -> mark(tt())
          active(isQid(u())) -> mark(tt())
          and(mark(X1),X2) -> mark(and(X1,X2))
          and(ok(X1),ok(X2)) -> ok(and(X1,X2))
          isList(ok(X)) -> ok(isList(X))
          isNeList(ok(X)) -> ok(isNeList(X))
          isNePal(ok(X)) -> ok(isNePal(X))
          isPal(ok(X)) -> ok(isPal(X))
          isQid(ok(X)) -> ok(isQid(X))
          proper(__(X1,X2)) -> __(proper(X1),proper(X2))
          proper(a()) -> ok(a())
          proper(and(X1,X2)) -> and(proper(X1),proper(X2))
          proper(e()) -> ok(e())
          proper(i()) -> ok(i())
          proper(isList(X)) -> isList(proper(X))
          proper(isNeList(X)) -> isNeList(proper(X))
          proper(isNePal(X)) -> isNePal(proper(X))
          proper(isPal(X)) -> isPal(proper(X))
          proper(isQid(X)) -> isQid(proper(X))
          proper(nil()) -> ok(nil())
          proper(o()) -> ok(o())
          proper(tt()) -> ok(tt())
          proper(u()) -> ok(u())
          top(mark(X)) -> top(proper(X))
          top(ok(X)) -> top(active(X))
      - Signature:
          {__/2,active/1,and/2,isList/1,isNeList/1,isNePal/1,isPal/1,isQid/1,proper/1,top/1} / {a/0,e/0,i/0,mark/1
          ,nil/0,o/0,ok/1,tt/0,u/0}
      - Obligation:
          innermost runtime complexity wrt. defined symbols {__,active,and,isList,isNeList,isNePal,isPal,isQid,proper
          ,top} and constructors {a,e,i,mark,nil,o,ok,tt,u}
  + Applied Processor:
      Ara {heuristics_ = NoHeuristics, minDegree = 1, maxDegree = 3, araTimeout = 60, araFindStrictRules = Nothing, araSmtSolver = MiniSMT}
  + Details:
      The input can not be schown compatible.
MAYBE