YES

Problem:
 f(g(h(x))) -> g(f(h(g(x))))
 f(x) -> x
 g(x) -> x
 h(x) -> x

Proof:
 Church Rosser Transformation Processor (critical pair closing system, Thm 2.11):
  g(x33) -> x33
  f(x35) -> x35
  h(x59) -> x59
  critical peaks: joinable
  Matrix Interpretation Processor: dim=1
   
   interpretation:
    [g](x0) = x0 + 1,
    
    [h](x0) = x0 + 1,
    
    [f](x0) = x0 + 1
   orientation:
    g(x33) = x33 + 1 >= x33 = x33
    
    f(x35) = x35 + 1 >= x35 = x35
    
    h(x59) = x59 + 1 >= x59 = x59
   problem:
    
   Qed