YES
(VAR X)
(RULES 
f(f(X)) -> c
c -> d
h(X) -> c
)

Proving termination of rewriting for Ex25_Luc06_L:

-> Dependency pairs:
nF_f(f(X)) -> nF_c
nF_h(X) -> nF_c

-> Proof of termination for Ex25_Luc06_L_1:
Termination proved: No cycles in dependency graph.

SETTINGS:
Base ordering: Polynomial ordering
Proof mode: SCCs in DG + base ordering
Upper bound for coeffs: 1
Rationals below 1 for all non-replacing args: No
Polynomial interpretation: Linear
Coeffs in polynomials: No rationals
Delta: automatic



Termination was proved succesfully.