(VAR X XS)
(STRATEGY CONTEXTSENSITIVE 
  (zeros)
  (cons 1)
  (0)
  (tail 1)
)
(RULES 
zeros -> cons(0,zeros)
tail(cons(X,XS)) -> XS
)

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

-> Dependency pairs:
nF_tail(cons(X,XS)) -> XS

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