YES
Time: 0.002983
TRS:
 {     g(x, y) -> x,
       g(x, y) -> y,
  f(s x, y, y) -> f(y, x, s x)}
 DP:
  DP:
   {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)}
  UR:
   {a(z, w) -> z,
    a(z, w) -> w}
   EDG:
    {(f#(s x, y, y) -> f#(y, x, s x), f#(s x, y, y) -> f#(y, x, s x))}
    STATUS:
     arrows: 0.000000
     SCCS (1):
      Scc:
       {f#(s x, y, y) -> f#(y, x, s x)}
      
      SCC (1):
       Strict:
        {f#(s x, y, y) -> f#(y, x, s x)}
       Weak:
       {     g(x, y) -> x,
             g(x, y) -> y,
        f(s x, y, y) -> f(y, x, s x)}
       POLY:
        Mode: weak, max_in=1, output_bits=-1, dnum=1, ur=true
        Interpretation:
         [f](x0, x1, x2) = x0 + x1 + 1,
         
         [g](x0, x1) = 0,
         
         [s](x0) = x0 + 1,
         
         [f#](x0, x1, x2) = x0 + x1
        Strict:
         f#(s x, y, y) -> f#(y, x, s x)
         1 + 1x + 1y >= 0 + 1x + 1y
        Weak:
         f(s x, y, y) -> f(y, x, s x)
         2 + 1x + 1y >= 2 + 1x + 1y
         g(x, y) -> y
         0 + 0x + 0y >= 1y
         g(x, y) -> x
         0 + 0x + 0y >= 1x
       Qed