YES
We show the termination of the TRS R:

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


-- SCC decomposition.

Consider the dependency pair problem (P, R), where P consists of

p1: f#(s(x),y,y) -> f#(y,x,s(x))

and R consists of:

r1: g(x,y) -> x
r2: g(x,y) -> y
r3: f(s(x),y,y) -> f(y,x,s(x))

The estimated dependency graph contains the following SCCs:

  {p1}


-- Reduction pair.

Consider the dependency pair problem (P, R), where P consists of

p1: f#(s(x),y,y) -> f#(y,x,s(x))

and R consists of:

r1: g(x,y) -> x
r2: g(x,y) -> y
r3: f(s(x),y,y) -> f(y,x,s(x))

The set of usable rules consists of

  r1, r2, r3

Take the reduction pair:

  generalized weighted path order (>=MG, >MG)
  
    base order 1:
  
      max/plus interpretation on natural numbers:
      
        f#_A(x1,x2,x3) = max{x1 - 4, x2 + 2}
        s_A(x1) = x1 + 7
        g_A(x1,x2) = max{x1 + 1, x2 + 1}
        f_A(x1,x2,x3) = max{1, x1 - 3, x2 - 1, x3 - 8}
  
    base order 2:
  
      precedence:
      
        f# = g = f > s
      
  
    partial status:
  
      pi(f#) = []
      pi(s) = [1]
      pi(g) = [1, 2]
      pi(f) = []

The following rules are removed:

  p1

Then no dependency pair remains.