YES

DP problem for innermost termination.
P =
  f#(x) -> f#(x) [x > x]
R = 
  f(x) -> f(x) [x > x]

The dependency graph for this problem is:
  0 -> 
Where:
  0) f#(x) -> f#(x) [x > x]

We have the following SCCs.