NO

Problem:
 a__zeros() -> cons(0(),zeros())
 a__and(tt(),X) -> mark(X)
 a__length(nil()) -> 0()
 a__length(cons(N,L)) -> s(a__length(mark(L)))
 mark(zeros()) -> a__zeros()
 mark(and(X1,X2)) -> a__and(mark(X1),X2)
 mark(length(X)) -> a__length(mark(X))
 mark(cons(X1,X2)) -> cons(mark(X1),X2)
 mark(0()) -> 0()
 mark(tt()) -> tt()
 mark(nil()) -> nil()
 mark(s(X)) -> s(mark(X))
 a__zeros() -> zeros()
 a__and(X1,X2) -> and(X1,X2)
 a__length(X) -> length(X)

Proof:
 Matrix Interpretation Processor: dim=1
  
  interpretation:
   [length](x0) = 4x0 + 3,
   
   [and](x0, x1) = x0 + 3x1 + 4,
   
   [s](x0) = x0,
   
   [a__length](x0) = 4x0 + 3,
   
   [nil] = 1,
   
   [mark](x0) = 4x0 + 2,
   
   [a__and](x0, x1) = x0 + 4x1 + 4,
   
   [tt] = 0,
   
   [cons](x0, x1) = 4x0 + 4x1 + 2,
   
   [zeros] = 0,
   
   [0] = 0,
   
   [a__zeros] = 2
  orientation:
   a__zeros() = 2 >= 2 = cons(0(),zeros())
   
   a__and(tt(),X) = 4X + 4 >= 4X + 2 = mark(X)
   
   a__length(nil()) = 7 >= 0 = 0()
   
   a__length(cons(N,L)) = 16L + 16N + 11 >= 16L + 11 = s(a__length(mark(L)))
   
   mark(zeros()) = 2 >= 2 = a__zeros()
   
   mark(and(X1,X2)) = 4X1 + 12X2 + 18 >= 4X1 + 4X2 + 6 = a__and(mark(X1),X2)
   
   mark(length(X)) = 16X + 14 >= 16X + 11 = a__length(mark(X))
   
   mark(cons(X1,X2)) = 16X1 + 16X2 + 10 >= 16X1 + 4X2 + 10 = cons(mark(X1),X2)
   
   mark(0()) = 2 >= 0 = 0()
   
   mark(tt()) = 2 >= 0 = tt()
   
   mark(nil()) = 6 >= 1 = nil()
   
   mark(s(X)) = 4X + 2 >= 4X + 2 = s(mark(X))
   
   a__zeros() = 2 >= 0 = zeros()
   
   a__and(X1,X2) = X1 + 4X2 + 4 >= X1 + 3X2 + 4 = and(X1,X2)
   
   a__length(X) = 4X + 3 >= 4X + 3 = length(X)
  problem:
   a__zeros() -> cons(0(),zeros())
   a__length(cons(N,L)) -> s(a__length(mark(L)))
   mark(zeros()) -> a__zeros()
   mark(cons(X1,X2)) -> cons(mark(X1),X2)
   mark(s(X)) -> s(mark(X))
   a__and(X1,X2) -> and(X1,X2)
   a__length(X) -> length(X)
  Matrix Interpretation Processor: dim=1
   
   interpretation:
    [length](x0) = x0,
    
    [and](x0, x1) = 4x0 + x1,
    
    [s](x0) = x0,
    
    [a__length](x0) = x0 + 1,
    
    [mark](x0) = 2x0,
    
    [a__and](x0, x1) = 4x0 + 4x1 + 1,
    
    [cons](x0, x1) = x0 + 4x1,
    
    [zeros] = 0,
    
    [0] = 0,
    
    [a__zeros] = 0
   orientation:
    a__zeros() = 0 >= 0 = cons(0(),zeros())
    
    a__length(cons(N,L)) = 4L + N + 1 >= 2L + 1 = s(a__length(mark(L)))
    
    mark(zeros()) = 0 >= 0 = a__zeros()
    
    mark(cons(X1,X2)) = 2X1 + 8X2 >= 2X1 + 4X2 = cons(mark(X1),X2)
    
    mark(s(X)) = 2X >= 2X = s(mark(X))
    
    a__and(X1,X2) = 4X1 + 4X2 + 1 >= 4X1 + X2 = and(X1,X2)
    
    a__length(X) = X + 1 >= X = length(X)
   problem:
    a__zeros() -> cons(0(),zeros())
    a__length(cons(N,L)) -> s(a__length(mark(L)))
    mark(zeros()) -> a__zeros()
    mark(cons(X1,X2)) -> cons(mark(X1),X2)
    mark(s(X)) -> s(mark(X))
   Matrix Interpretation Processor: dim=3
    
    interpretation:
               [1 0 0]  
     [s](x0) = [0 1 0]x0
               [0 0 0]  ,
     
                       [1 0 0]     [1]
     [a__length](x0) = [0 0 0]x0 + [0]
                       [0 0 0]     [0],
     
                  [1 1 0]     [0]
     [mark](x0) = [1 1 0]x0 + [0]
                  [1 0 0]     [1],
     
                      [1 0 0]     [1 1 0]     [0]
     [cons](x0, x1) = [0 1 0]x0 + [0 0 0]x1 + [1]
                      [0 0 0]     [0 0 0]     [0],
     
               [0]
     [zeros] = [1]
               [0],
     
           [0]
     [0] = [0]
           [0],
     
                  [1]
     [a__zeros] = [1]
                  [0]
    orientation:
                  [1]    [1]                    
     a__zeros() = [1] >= [1] = cons(0(),zeros())
                  [0]    [0]                    
     
                            [1 1 0]    [1 0 0]    [1]    [1 1 0]    [1]                        
     a__length(cons(N,L)) = [0 0 0]L + [0 0 0]N + [0] >= [0 0 0]L + [0] = s(a__length(mark(L)))
                            [0 0 0]    [0 0 0]    [0]    [0 0 0]    [0]                        
     
                     [1]    [1]             
     mark(zeros()) = [1] >= [1] = a__zeros()
                     [1]    [0]             
     
                         [1 1 0]     [1 1 0]     [1]    [1 1 0]     [1 1 0]     [0]                    
     mark(cons(X1,X2)) = [1 1 0]X1 + [1 1 0]X2 + [1] >= [1 1 0]X1 + [0 0 0]X2 + [1] = cons(mark(X1),X2)
                         [1 0 0]     [1 1 0]     [1]    [0 0 0]     [0 0 0]     [0]                    
     
                  [1 1 0]    [0]    [1 1 0]              
     mark(s(X)) = [1 1 0]X + [0] >= [1 1 0]X = s(mark(X))
                  [1 0 0]    [1]    [0 0 0]              
    problem:
     a__zeros() -> cons(0(),zeros())
     a__length(cons(N,L)) -> s(a__length(mark(L)))
     mark(zeros()) -> a__zeros()
     mark(s(X)) -> s(mark(X))
    Unfolding Processor:
     loop length: 3
     terms:
      a__length(cons(N,zeros()))
      s(a__length(mark(zeros())))
      s(a__length(a__zeros()))
     context: s([])
     substitution:
      N -> 0()
     Qed