(VAR X Y Z)
(STRATEGY CONTEXTSENSITIVE 
  (2nd 1)
  (cons 1)
  (from 1)
  (s 1)
)
(RULES 
2nd(cons(X,cons(Y,Z))) -> Y
from(X) -> cons(X,from(s(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 Ex1_2_Luc02c:

-> Dependency pairs:
nF_2nd(cons(X,cons(Y,Z))) -> Y

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