(VAR )
(STRATEGY CONTEXTSENSITIVE 
  (f 1)
  (a)
  (c)
  (g 1)
)
(RULES 
f(f(a)) -> c(f(g(f(a))))
)

The TRS is orthogonal, thus termination of innermost context-sensitive rewriting is equivalent to termination of context-sensitive rewriting.

Proving termination of context-sensitive rewriting for Ex23_Luc06:

-> Dependency pairs:
No dependency pairs found.

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