(VAR X Y)
(STRATEGY CONTEXTSENSITIVE 
  (f)
  (g 1)
  (b)
  (c)
)
(RULES 
f(X,g(X),Y) -> f(Y,Y,Y)
g(b) -> c
b -> c
)

Proving termination of context-sensitive rewriting for Ex24_GM04:

-> Dependency pairs:
nF_f(X,g(X),Y) -> nF_f(Y,Y,Y)

-> Proof of termination for Ex24_GM04_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.