YES
We show the termination of the TRS R:

  f(a(),x) -> f(g(x),x)
  h(g(x)) -> h(a())
  g(h(x)) -> g(x)
  h(h(x)) -> x


-- SCC decomposition.

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

p1: f#(a(),x) -> f#(g(x),x)
p2: f#(a(),x) -> g#(x)
p3: h#(g(x)) -> h#(a())
p4: g#(h(x)) -> g#(x)

and R consists of:

r1: f(a(),x) -> f(g(x),x)
r2: h(g(x)) -> h(a())
r3: g(h(x)) -> g(x)
r4: h(h(x)) -> x

The estimated dependency graph contains the following SCCs:

  {p1}
  {p4}


-- Reduction pair.

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

p1: f#(a(),x) -> f#(g(x),x)

and R consists of:

r1: f(a(),x) -> f(g(x),x)
r2: h(g(x)) -> h(a())
r3: g(h(x)) -> g(x)
r4: h(h(x)) -> x

The set of usable rules consists of

  r3

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,x2) = max{0, x1 - 1, x2 - 2}
            a_A = 3
            g_A(x1) = 0
            h_A(x1) = 2
            f#!_A(x1,x2) = max{1, x1 - 1}
            a!_A = 5
            g!_A(x1) = 4
            h!_A(x1) = max{4, x1 + 1}
        
        2. marked-algebra reduction triple (>=A, >=A!, >A!):
        
          matrix interpretation with standard point-wise order:
          
            carrier: N^1
            order: standard order
            interpretations:
              f#_A(x1,x2) = 0
              a_A() = 1
              g_A(x1) = x1 + 2
              h_A(x1) = x1 + 1
              f#!_A(x1,x2) = 0
              a!_A() = 2
              g!_A(x1) = 1
              h!_A(x1) = 1
        
  
    partial status:
  
      pi(f#) = []
      pi(a) = []
      pi(g) = []
      pi(h) = []

The following rules are removed:

  p1

Then no dependency pair remains.

-- Reduction pair.

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

p1: g#(h(x)) -> g#(x)

and R consists of:

r1: f(a(),x) -> f(g(x),x)
r2: h(g(x)) -> h(a())
r3: g(h(x)) -> g(x)
r4: h(h(x)) -> x

The set of usable rules consists of

  (no rules)

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:
          
            g#_A(x1) = 0
            h_A(x1) = max{0, x1 - 2}
            g#!_A(x1) = 3
            h!_A(x1) = max{2, x1 - 7}
        
        2. marked-algebra reduction triple (>=A, >=A!, >A!):
        
          matrix interpretation with standard point-wise order:
          
            carrier: N^1
            order: standard order
            interpretations:
              g#_A(x1) = x1
              h_A(x1) = x1 + 1
              g#!_A(x1) = x1
              h!_A(x1) = 4
        
  
    partial status:
  
      pi(g#) = [1]
      pi(h) = [1]

The following rules are removed:

  p1

Then no dependency pair remains.