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


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


MAYBE
* Step 1: Failure MAYBE
  + Considered Problem:
      - Strict TRS:
          U11(X1,active(X2)) -> U11(X1,X2)
          U11(X1,mark(X2)) -> U11(X1,X2)
          U11(active(X1),X2) -> U11(X1,X2)
          U11(mark(X1),X2) -> U11(X1,X2)
          U21(active(X)) -> U21(X)
          U21(mark(X)) -> U21(X)
          U31(X1,X2,X3,active(X4)) -> U31(X1,X2,X3,X4)
          U31(X1,X2,X3,mark(X4)) -> U31(X1,X2,X3,X4)
          U31(X1,X2,active(X3),X4) -> U31(X1,X2,X3,X4)
          U31(X1,X2,mark(X3),X4) -> U31(X1,X2,X3,X4)
          U31(X1,active(X2),X3,X4) -> U31(X1,X2,X3,X4)
          U31(X1,mark(X2),X3,X4) -> U31(X1,X2,X3,X4)
          U31(active(X1),X2,X3,X4) -> U31(X1,X2,X3,X4)
          U31(mark(X1),X2,X3,X4) -> U31(X1,X2,X3,X4)
          active(U11(tt(),L)) -> mark(s(length(L)))
          active(U21(tt())) -> mark(nil())
          active(U31(tt(),IL,M,N)) -> mark(cons(N,take(M,IL)))
          active(and(tt(),X)) -> mark(X)
          active(isNat(0())) -> mark(tt())
          active(isNat(length(V1))) -> mark(isNatList(V1))
          active(isNat(s(V1))) -> mark(isNat(V1))
          active(isNatIList(V)) -> mark(isNatList(V))
          active(isNatIList(cons(V1,V2))) -> mark(and(isNat(V1),isNatIList(V2)))
          active(isNatIList(zeros())) -> mark(tt())
          active(isNatList(cons(V1,V2))) -> mark(and(isNat(V1),isNatList(V2)))
          active(isNatList(nil())) -> mark(tt())
          active(isNatList(take(V1,V2))) -> mark(and(isNat(V1),isNatIList(V2)))
          active(length(cons(N,L))) -> mark(U11(and(isNatList(L),isNat(N)),L))
          active(length(nil())) -> mark(0())
          active(take(0(),IL)) -> mark(U21(isNatIList(IL)))
          active(take(s(M),cons(N,IL))) -> mark(U31(and(isNatIList(IL),and(isNat(M),isNat(N))),IL,M,N))
          active(zeros()) -> mark(cons(0(),zeros()))
          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)
          cons(X1,active(X2)) -> cons(X1,X2)
          cons(X1,mark(X2)) -> cons(X1,X2)
          cons(active(X1),X2) -> cons(X1,X2)
          cons(mark(X1),X2) -> cons(X1,X2)
          isNat(active(X)) -> isNat(X)
          isNat(mark(X)) -> isNat(X)
          isNatIList(active(X)) -> isNatIList(X)
          isNatIList(mark(X)) -> isNatIList(X)
          isNatList(active(X)) -> isNatList(X)
          isNatList(mark(X)) -> isNatList(X)
          length(active(X)) -> length(X)
          length(mark(X)) -> length(X)
          mark(0()) -> active(0())
          mark(U11(X1,X2)) -> active(U11(mark(X1),X2))
          mark(U21(X)) -> active(U21(mark(X)))
          mark(U31(X1,X2,X3,X4)) -> active(U31(mark(X1),X2,X3,X4))
          mark(and(X1,X2)) -> active(and(mark(X1),X2))
          mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
          mark(isNat(X)) -> active(isNat(X))
          mark(isNatIList(X)) -> active(isNatIList(X))
          mark(isNatList(X)) -> active(isNatList(X))
          mark(length(X)) -> active(length(mark(X)))
          mark(nil()) -> active(nil())
          mark(s(X)) -> active(s(mark(X)))
          mark(take(X1,X2)) -> active(take(mark(X1),mark(X2)))
          mark(tt()) -> active(tt())
          mark(zeros()) -> active(zeros())
          s(active(X)) -> s(X)
          s(mark(X)) -> s(X)
          take(X1,active(X2)) -> take(X1,X2)
          take(X1,mark(X2)) -> take(X1,X2)
          take(active(X1),X2) -> take(X1,X2)
          take(mark(X1),X2) -> take(X1,X2)
      - Signature:
          {U11/2,U21/1,U31/4,active/1,and/2,cons/2,isNat/1,isNatIList/1,isNatList/1,length/1,mark/1,s/1,take/2} / {0/0
          ,nil/0,tt/0,zeros/0}
      - Obligation:
          innermost derivational complexity wrt. signature {0,U11,U21,U31,active,and,cons,isNat,isNatIList,isNatList
          ,length,mark,nil,s,take,tt,zeros}
  + Applied Processor:
      DecomposeCP {onSelectionCP_ = any strict-rules, withBoundCP_ = RelativeComp, withCP_ = NaturalMI {miDimension = 3, miDegree = 3, miKind = Algebraic, uargs = NoUArgs, urules = NoURules, selector = Nothing}}
  + Details:
      The processor is not applicable. The reason is some rule is duplicating.
MAYBE