(VAR X Y Z I P)
(STRATEGY CONTEXTSENSITIVE 
  (__ 1 2)
  (nil)
  (and 1)
  (tt)
  (isNePal 1)
)
(RULES 
__(__(X,Y),Z) -> __(X,__(Y,Z))
__(X,nil) -> X
__(nil,X) -> X
and(tt,X) -> X
isNePal(__(I,__(P,I))) -> tt
)

Proving termination of context-sensitive rewriting for PALINDROME_nosorts:

-> Dependency pairs:
nF___(__(X,Y),Z) -> nF___(X,__(Y,Z))
nF___(__(X,Y),Z) -> nF___(Y,Z)
nF_and(tt,X) -> X

-> Proof of termination for PALINDROME_nosorts_1:
-> -> Dependency pairs in cycle:
nF___(__(X,Y),Z) -> nF___(X,__(Y,Z))
nF___(__(X,Y),Z) -> nF___(Y,Z)

Termination proved: Cycles verify subterm criterion.

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.