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