YES
We show the termination of the TRS R:

  f(f(x)) -> g(f(x))
  g(g(x)) -> f(x)


-- SCC decomposition.

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

p1: f#(f(x)) -> g#(f(x))
p2: g#(g(x)) -> f#(x)

and R consists of:

r1: f(f(x)) -> g(f(x))
r2: g(g(x)) -> f(x)

The estimated dependency graph contains the following SCCs:

  {p1, p2}


-- Reduction pair.

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

p1: f#(f(x)) -> g#(f(x))
p2: g#(g(x)) -> f#(x)

and R consists of:

r1: f(f(x)) -> g(f(x))
r2: g(g(x)) -> f(x)

The set of usable rules consists of

  r1, r2

Take the reduction pair:

  generalized weighted path order (>=MG, >G)
  
    base order 1:
  
      trivial reduction triple (T x T, T x T, Φ)
  
    base order 2:
  
      lexicographic combination of reduction triples:
      
        1. marked-algebra reduction triple (>=A, >=A!, >A!):
        
          max/plus interpretation on natural numbers:
          
            f#_A(x1) = max{0, x1 - 17}
            f_A(x1) = max{18, x1 + 6}
            g#_A(x1) = max{1, x1 - 17}
            g_A(x1) = max{13, x1 + 5}
            f#!_A(x1) = max{1, x1 - 2}
            f!_A(x1) = max{12, x1 + 3}
            g#!_A(x1) = 13
            g!_A(x1) = max{2, x1 - 1}
        
        2. marked-algebra reduction triple (>=A, >=A!, >A!):
        
          max/plus interpretation on natural numbers:
          
            f#_A(x1) = max{0, x1 - 5}
            f_A(x1) = max{4, x1 + 1}
            g#_A(x1) = max{0, x1 - 5}
            g_A(x1) = max{3, x1 + 1}
            f#!_A(x1) = max{2, x1 - 6}
            f!_A(x1) = max{3, x1 - 5}
            g#!_A(x1) = max{1, x1 - 10}
            g!_A(x1) = max{3, x1 - 5}
        
  
    partial status:
  
      pi(f#) = [1]
      pi(f) = [1]
      pi(g#) = [1]
      pi(g) = [1]

The following rules are removed:

  p1, p2

Then no dependency pair remains.