YES
O(n^5)
TRS:
 {
     g(empty(), d) -> d,
  g(cons(x, k), d) -> g(k, cons(x, d)),
     f(a, empty()) -> g(a, empty()),
  f(a, cons(x, k)) -> f(cons(x, a), k)
 }
 DUP: We consider a non-duplicating system.
  Trs:
   {
       g(empty(), d) -> d,
    g(cons(x, k), d) -> g(k, cons(x, d)),
       f(a, empty()) -> g(a, empty()),
    f(a, cons(x, k)) -> f(cons(x, a), k)
   }
  Matrix Interpretation:
   Interpretation class: triangular
          [X9]  [X4]    [1 0 0 0 0][X9]   [1 0 0 0 0][X4]   [0]
          [X8]  [X3]    [0 0 0 0 0][X8]   [0 1 0 0 0][X3]   [0]
   [cons]([X7], [X2]) = [0 0 0 0 0][X7] + [0 0 1 0 0][X2] + [0]
          [X6]  [X1]    [0 0 0 0 0][X6]   [0 0 0 1 0][X1]   [1]
          [X5]  [X0]    [0 0 0 0 0][X5]   [0 0 0 0 1][X0]   [1]
   
       [X9]  [X4]    [1 0 0 0 1][X9]   [1 0 0 1 1][X4]   [1]
       [X8]  [X3]    [0 0 0 0 0][X8]   [0 0 0 0 0][X3]   [0]
   [f]([X7], [X2]) = [0 0 0 0 0][X7] + [0 0 0 0 0][X2] + [0]
       [X6]  [X1]    [0 0 0 1 1][X6]   [0 0 0 1 1][X1]   [0]
       [X5]  [X0]    [0 0 0 0 1][X5]   [0 0 0 0 1][X0]   [0]
   
             [0]
             [0]
   [empty] = [0]
             [1]
             [0]
   
       [X9]  [X4]    [1 0 0 0 1][X9]   [1 0 0 0 0][X4]   [1]
       [X8]  [X3]    [0 0 0 0 0][X8]   [0 1 0 0 0][X3]   [0]
   [g]([X7], [X2]) = [0 0 0 0 0][X7] + [0 0 1 0 0][X2] + [0]
       [X6]  [X1]    [0 0 0 1 0][X6]   [0 0 0 1 0][X1]   [0]
       [X5]  [X0]    [0 0 0 0 1][X5]   [0 0 0 0 1][X0]   [0]
   
   
   Qed