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