YES

Problem:
 g(x,y) -> x
 g(x,y) -> y
 f(s(x),y,y) -> f(y,x,s(x))

Proof:
 DP Processor:
  DPs:
   f#(s(x),y,y) -> f#(y,x,s(x))
  TRS:
   g(x,y) -> x
   g(x,y) -> y
   f(s(x),y,y) -> f(y,x,s(x))
  Matrix Interpretation Processor:
   dimension: 1
   interpretation:
    [f#](x0, x1, x2) = x0 + x1,
    
    [f](x0, x1, x2) = 0,
    
    [s](x0) = x0 + 1,
    
    [g](x0, x1) = x0 + x1
   orientation:
    f#(s(x),y,y) = x + y + 1 >= x + y = f#(y,x,s(x))
    
    g(x,y) = x + y >= x = x
    
    g(x,y) = x + y >= y = y
    
    f(s(x),y,y) = 0 >= 0 = f(y,x,s(x))
   problem:
    DPs:
     
    TRS:
     g(x,y) -> x
     g(x,y) -> y
     f(s(x),y,y) -> f(y,x,s(x))
   Qed