(VAR X)
(STRATEGY CONTEXTSENSITIVE 
  (f 1)
  (a)
  (b)
)
(RULES 
f(X,X) -> f(a,b)
b -> a
)

Proving termination of context-sensitive rewriting for Ex16_Luc06:

-> Dependency pairs:
nF_f(X,X) -> nF_f(a,b)

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