(0) Obligation:

Q restricted rewrite system:
The TRS R consists of the following rules:

__(__(X, Y), Z) → __(X, __(Y, Z))
__(X, nil) → X
__(nil, X) → X
U11(tt) → U12(tt)
U12(tt) → tt
isNePal(__(I, __(P, I))) → U11(tt)

Q is empty.

(1) QTRSRRRProof (EQUIVALENT transformation)

Used ordering:
Lexicographic path order with status [LPO].
Quasi-Precedence:
_2 > [U111, tt, U121]
nil > [U111, tt, U121]
isNePal1 > [U111, tt, U121]

Status:
_2: [1,2]
nil: []
U111: [1]
tt: []
U121: [1]
isNePal1: [1]

With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:

__(__(X, Y), Z) → __(X, __(Y, Z))
__(X, nil) → X
__(nil, X) → X
U12(tt) → tt
isNePal(__(I, __(P, I))) → U11(tt)


(2) Obligation:

Q restricted rewrite system:
The TRS R consists of the following rules:

U11(tt) → U12(tt)

Q is empty.

(3) QTRSRRRProof (EQUIVALENT transformation)

Used ordering:
Lexicographic path order with status [LPO].
Quasi-Precedence:
U111 > [tt, U121]

Status:
U111: [1]
tt: []
U121: [1]

With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:

U11(tt) → U12(tt)


(4) Obligation:

Q restricted rewrite system:
R is empty.
Q is empty.

(5) RisEmptyProof (EQUIVALENT transformation)

The TRS R is empty. Hence, termination is trivially proven.

(6) TRUE