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