MAYBE
MAYBE
TRS:
 {
                    zeros() -> cons(0(), n__zeros()),
                    zeros() -> n__zeros(),
                activate(X) -> X,
       activate(n__zeros()) -> zeros(),
  activate(n__take(X1, X2)) -> take(X1, X2),
               and(tt(), X) -> activate(X),
         length(cons(N, L)) -> s(length(activate(L))),
              length(nil()) -> 0(),
               take(X1, X2) -> n__take(X1, X2),
              take(0(), IL) -> nil(),
    take(s(M), cons(N, IL)) -> cons(N, n__take(M, activate(IL)))
 }
 DUP: We consider a non-duplicating system.
  Trs:
   {
                      zeros() -> cons(0(), n__zeros()),
                      zeros() -> n__zeros(),
                  activate(X) -> X,
         activate(n__zeros()) -> zeros(),
    activate(n__take(X1, X2)) -> take(X1, X2),
                 and(tt(), X) -> activate(X),
           length(cons(N, L)) -> s(length(activate(L))),
                length(nil()) -> 0(),
                 take(X1, X2) -> n__take(X1, X2),
                take(0(), IL) -> nil(),
      take(s(M), cons(N, IL)) -> cons(N, n__take(M, activate(IL)))
   }
  Fail