/export/starexec/sandbox2/solver/bin/starexec_run_tct_dc /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


MAYBE
* Step 1: Failure MAYBE
  + Considered Problem:
      - Strict TRS:
          __(X1,active(X2)) -> __(X1,X2)
          __(X1,mark(X2)) -> __(X1,X2)
          __(active(X1),X2) -> __(X1,X2)
          __(mark(X1),X2) -> __(X1,X2)
          active(__(X,nil())) -> mark(X)
          active(__(__(X,Y),Z)) -> mark(__(X,__(Y,Z)))
          active(__(nil(),X)) -> mark(X)
          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(X1,active(X2)) -> and(X1,X2)
          and(X1,mark(X2)) -> and(X1,X2)
          and(active(X1),X2) -> and(X1,X2)
          and(mark(X1),X2) -> and(X1,X2)
          isList(active(X)) -> isList(X)
          isList(mark(X)) -> isList(X)
          isNeList(active(X)) -> isNeList(X)
          isNeList(mark(X)) -> isNeList(X)
          isNePal(active(X)) -> isNePal(X)
          isNePal(mark(X)) -> isNePal(X)
          isPal(active(X)) -> isPal(X)
          isPal(mark(X)) -> isPal(X)
          isQid(active(X)) -> isQid(X)
          isQid(mark(X)) -> isQid(X)
          mark(__(X1,X2)) -> active(__(mark(X1),mark(X2)))
          mark(a()) -> active(a())
          mark(and(X1,X2)) -> active(and(mark(X1),X2))
          mark(e()) -> active(e())
          mark(i()) -> active(i())
          mark(isList(X)) -> active(isList(X))
          mark(isNeList(X)) -> active(isNeList(X))
          mark(isNePal(X)) -> active(isNePal(X))
          mark(isPal(X)) -> active(isPal(X))
          mark(isQid(X)) -> active(isQid(X))
          mark(nil()) -> active(nil())
          mark(o()) -> active(o())
          mark(tt()) -> active(tt())
          mark(u()) -> active(u())
      - Signature:
          {__/2,active/1,and/2,isList/1,isNeList/1,isNePal/1,isPal/1,isQid/1,mark/1} / {a/0,e/0,i/0,nil/0,o/0,tt/0
          ,u/0}
      - Obligation:
           derivational complexity wrt. signature {__,a,active,and,e,i,isList,isNeList,isNePal,isPal,isQid,mark,nil,o
          ,tt,u}
  + Applied Processor:
      DecomposeCP {onSelectionCP_ = any strict-rules, withBoundCP_ = RelativeComp, withCP_ = NaturalMI {miDimension = 4, miDegree = 4, miKind = Algebraic, uargs = NoUArgs, urules = NoURules, selector = Nothing}}
  + Details:
      application of cp failed
MAYBE