MAYBE
* Step 1: Failure MAYBE
  + Considered Problem:
      - Strict TRS:
          U11(mark(X)) -> mark(U11(X))
          U11(ok(X)) -> ok(U11(X))
          U21(mark(X1),X2) -> mark(U21(X1,X2))
          U21(ok(X1),ok(X2)) -> ok(U21(X1,X2))
          U22(mark(X)) -> mark(U22(X))
          U22(ok(X)) -> ok(U22(X))
          U31(mark(X)) -> mark(U31(X))
          U31(ok(X)) -> ok(U31(X))
          U41(mark(X1),X2) -> mark(U41(X1,X2))
          U41(ok(X1),ok(X2)) -> ok(U41(X1,X2))
          U42(mark(X)) -> mark(U42(X))
          U42(ok(X)) -> ok(U42(X))
          U51(mark(X1),X2) -> mark(U51(X1,X2))
          U51(ok(X1),ok(X2)) -> ok(U51(X1,X2))
          U52(mark(X)) -> mark(U52(X))
          U52(ok(X)) -> ok(U52(X))
          U61(mark(X)) -> mark(U61(X))
          U61(ok(X)) -> ok(U61(X))
          U71(mark(X1),X2) -> mark(U71(X1,X2))
          U71(ok(X1),ok(X2)) -> ok(U71(X1,X2))
          U72(mark(X)) -> mark(U72(X))
          U72(ok(X)) -> ok(U72(X))
          U81(mark(X)) -> mark(U81(X))
          U81(ok(X)) -> ok(U81(X))
          __(X1,mark(X2)) -> mark(__(X1,X2))
          __(mark(X1),X2) -> mark(__(X1,X2))
          __(ok(X1),ok(X2)) -> ok(__(X1,X2))
          active(U11(X)) -> U11(active(X))
          active(U11(tt())) -> mark(tt())
          active(U21(X1,X2)) -> U21(active(X1),X2)
          active(U21(tt(),V2)) -> mark(U22(isList(V2)))
          active(U22(X)) -> U22(active(X))
          active(U22(tt())) -> mark(tt())
          active(U31(X)) -> U31(active(X))
          active(U31(tt())) -> mark(tt())
          active(U41(X1,X2)) -> U41(active(X1),X2)
          active(U41(tt(),V2)) -> mark(U42(isNeList(V2)))
          active(U42(X)) -> U42(active(X))
          active(U42(tt())) -> mark(tt())
          active(U51(X1,X2)) -> U51(active(X1),X2)
          active(U51(tt(),V2)) -> mark(U52(isList(V2)))
          active(U52(X)) -> U52(active(X))
          active(U52(tt())) -> mark(tt())
          active(U61(X)) -> U61(active(X))
          active(U61(tt())) -> mark(tt())
          active(U71(X1,X2)) -> U71(active(X1),X2)
          active(U71(tt(),P)) -> mark(U72(isPal(P)))
          active(U72(X)) -> U72(active(X))
          active(U72(tt())) -> mark(tt())
          active(U81(X)) -> U81(active(X))
          active(U81(tt())) -> mark(tt())
          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(isList(V)) -> mark(U11(isNeList(V)))
          active(isList(__(V1,V2))) -> mark(U21(isList(V1),V2))
          active(isList(nil())) -> mark(tt())
          active(isNeList(V)) -> mark(U31(isQid(V)))
          active(isNeList(__(V1,V2))) -> mark(U41(isList(V1),V2))
          active(isNeList(__(V1,V2))) -> mark(U51(isNeList(V1),V2))
          active(isNePal(V)) -> mark(U61(isQid(V)))
          active(isNePal(__(I,__(P,I)))) -> mark(U71(isQid(I),P))
          active(isPal(V)) -> mark(U81(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())
          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(U11(X)) -> U11(proper(X))
          proper(U21(X1,X2)) -> U21(proper(X1),proper(X2))
          proper(U22(X)) -> U22(proper(X))
          proper(U31(X)) -> U31(proper(X))
          proper(U41(X1,X2)) -> U41(proper(X1),proper(X2))
          proper(U42(X)) -> U42(proper(X))
          proper(U51(X1,X2)) -> U51(proper(X1),proper(X2))
          proper(U52(X)) -> U52(proper(X))
          proper(U61(X)) -> U61(proper(X))
          proper(U71(X1,X2)) -> U71(proper(X1),proper(X2))
          proper(U72(X)) -> U72(proper(X))
          proper(U81(X)) -> U81(proper(X))
          proper(__(X1,X2)) -> __(proper(X1),proper(X2))
          proper(a()) -> ok(a())
          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:
          {U11/1,U21/2,U22/1,U31/1,U41/2,U42/1,U51/2,U52/1,U61/1,U71/2,U72/1,U81/1,__/2,active/1,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 {U11,U21,U22,U31,U41,U42,U51,U52,U61,U71,U72,U81,__,active
          ,isList,isNeList,isNePal,isPal,isQid,proper,top} and constructors {a,e,i,mark,nil,o,ok,tt,u}
  + Applied Processor:
      MI {miKind = Automaton Nothing, miDimension = 3, miUArgs = NoUArgs, miURules = NoURules, miSelector = Nothing}
  + Details:
      Incompatible
MAYBE