(VAR X)
(STRATEGY CONTEXTSENSITIVE 
  (f 2)
  (b)
  (c)
)
(RULES 
f(b,X,c) -> f(X,c,X)
c -> b
)

Proving termination of context-sensitive rewriting for Ex24_Luc06:

-> Dependency pairs:
nF_f(b,X,c) -> nF_f(X,c,X)
nF_f(b,X,c) -> nF_c

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