YES
O(n^3)
TRS:
 {
         norm(nil()) -> 0(),
       norm(g(x, y)) -> s(norm(x)),
         f(x, nil()) -> g(nil(), x),
       f(x, g(y, z)) -> g(f(x, y), z),
       rem(nil(), y) -> nil(),
   rem(g(x, y), 0()) -> g(x, y),
  rem(g(x, y), s(z)) -> rem(x, z)
 }
 DUP: We consider a non-duplicating system.
  Trs:
   {
           norm(nil()) -> 0(),
         norm(g(x, y)) -> s(norm(x)),
           f(x, nil()) -> g(nil(), x),
         f(x, g(y, z)) -> g(f(x, y), z),
         rem(nil(), y) -> nil(),
     rem(g(x, y), 0()) -> g(x, y),
    rem(g(x, y), s(z)) -> rem(x, z)
   }
  Matrix Interpretation:
   Interpretation class: triangular
         [X5]  [X2]    [1 0 1][X5]   [1 0 0][X2]   [0]
   [rem]([X4], [X1]) = [0 1 0][X4] + [0 0 1][X1] + [0]
         [X3]  [X0]    [0 0 1][X3]   [0 0 0][X0]   [1]
   
       [X5]  [X2]    [1 0 0][X5]   [1 1 0][X2]   [1]
   [f]([X4], [X1]) = [0 0 0][X4] + [0 0 1][X1] + [0]
       [X3]  [X0]    [0 0 0][X3]   [0 0 1][X0]   [1]
   
       [X5]  [X2]    [1 0 0][X5]   [1 0 0][X2]   [0]
   [g]([X4], [X1]) = [0 1 0][X4] + [0 0 0][X1] + [1]
       [X3]  [X0]    [0 0 1][X3]   [0 0 0][X0]   [1]
   
       [X2]    [1 0 0][X2]   [0]
   [s]([X1]) = [0 0 0][X1] + [0]
       [X0]    [0 0 1][X0]   [1]
   
           [1]
   [nil] = [0]
           [1]
   
          [X2]    [1 1 1][X2]   [0]
   [norm]([X1]) = [0 0 0][X1] + [0]
          [X0]    [0 0 1][X0]   [0]
   
         [1]
   [0] = [0]
         [0]
   
   
   Qed