YES
O(n^3)
TRS:
 {
            a__zeros() -> cons(0(), zeros()),
            a__zeros() -> zeros(),
    mark(cons(X1, X2)) -> cons(mark(X1), X2),
             mark(0()) -> 0(),
         mark(zeros()) -> a__zeros(),
         mark(tail(X)) -> a__tail(mark(X)),
            a__tail(X) -> tail(X),
  a__tail(cons(X, XS)) -> mark(XS)
 }
 DUP: We consider a non-duplicating system.
  Trs:
   {
              a__zeros() -> cons(0(), zeros()),
              a__zeros() -> zeros(),
      mark(cons(X1, X2)) -> cons(mark(X1), X2),
               mark(0()) -> 0(),
           mark(zeros()) -> a__zeros(),
           mark(tail(X)) -> a__tail(mark(X)),
              a__tail(X) -> tail(X),
    a__tail(cons(X, XS)) -> mark(XS)
   }
  Matrix Interpretation:
   Interpretation class: triangular
          [X2]    [1 1 1][X2]   [0]
   [tail]([X1]) = [0 1 1][X1] + [1]
          [X0]    [0 0 1][X0]   [1]
   
             [X2]    [1 1 1][X2]   [1]
   [a__tail]([X1]) = [0 1 1][X1] + [1]
             [X0]    [0 0 1][X0]   [1]
   
          [X2]    [1 1 1][X2]   [1]
   [mark]([X1]) = [0 1 1][X1] + [0]
          [X0]    [0 0 1][X0]   [0]
   
                [1]
   [a__zeros] = [1]
                [1]
   
             [0]
   [zeros] = [0]
             [1]
   
         [0]
   [0] = [0]
         [0]
   
          [X5]  [X2]    [1 0 0][X5]   [1 1 0][X2]   [0]
   [cons]([X4], [X1]) = [0 1 0][X4] + [0 1 0][X1] + [1]
          [X3]  [X0]    [0 0 1][X3]   [0 0 1][X0]   [0]
   
   
   Qed