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

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 Ex6_GM04:

-> Dependency pairs:
nF_c -> nF_f(g(c))

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