(VAR X)
(STRATEGY CONTEXTSENSITIVE 
  (f 1)
  (c)
  (g)
  (d)
  (h 1)
)
(RULES 
f(f(X)) -> c(f(g(f(X))))
c(X) -> d(X)
h(X) -> c(d(X))
)

Proving termination of context-sensitive rewriting for Ex25_Luc06:

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

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

SETTINGS:
Base ordering: Polynomial ordering
Proof mode: SCCs in CSDG + 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.