YES

We show the termination of the TRS R:

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

-- SCC decomposition.

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

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

and R consists of:

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

The estimated dependency graph contains the following SCCs:

  {p1}


-- Reduction pair.

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

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

and R consists of:

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

The set of usable rules consists of

  (no rules)

Take the reduction pair:

  lexicographic combination of reduction pairs:
  
    1. weighted path order
    
      base order:
    
        max/plus interpretations on natural numbers:
        
          f#_A(x1,x2) = max{x1 - 1, x2 + 3}
          h_A(x1) = max{2, x1}
    
      precedence:
      
        f# = h
      
      partial status:
    
        pi(f#) = [2]
        pi(h) = [1]
    
    2. weighted path order
    
      base order:
    
        max/plus interpretations on natural numbers:
        
          f#_A(x1,x2) = max{0, x2 - 4}
          h_A(x1) = x1 + 3
    
      precedence:
      
        f# = h
      
      partial status:
    
        pi(f#) = []
        pi(h) = [1]
    

The next rules are strictly ordered:

  p1

We remove them from the problem.  Then no dependency pair remains.