Termination w.r.t. Q of the given QTRS could be proven:

(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, V) → U12(isNeList(activate(V)))
U12(tt) → tt
U21(tt, V1, V2) → U22(isList(activate(V1)), activate(V2))
U22(tt, V2) → U23(isList(activate(V2)))
U23(tt) → tt
U31(tt, V) → U32(isQid(activate(V)))
U32(tt) → tt
U41(tt, V1, V2) → U42(isList(activate(V1)), activate(V2))
U42(tt, V2) → U43(isNeList(activate(V2)))
U43(tt) → tt
U51(tt, V1, V2) → U52(isNeList(activate(V1)), activate(V2))
U52(tt, V2) → U53(isList(activate(V2)))
U53(tt) → tt
U61(tt, V) → U62(isQid(activate(V)))
U62(tt) → tt
U71(tt, V) → U72(isNePal(activate(V)))
U72(tt) → tt
and(tt, X) → activate(X)
isList(V) → U11(isPalListKind(activate(V)), activate(V))
isList(n__nil) → tt
isList(n____(V1, V2)) → U21(and(isPalListKind(activate(V1)), n__isPalListKind(activate(V2))), activate(V1), activate(V2))
isNeList(V) → U31(isPalListKind(activate(V)), activate(V))
isNeList(n____(V1, V2)) → U41(and(isPalListKind(activate(V1)), n__isPalListKind(activate(V2))), activate(V1), activate(V2))
isNeList(n____(V1, V2)) → U51(and(isPalListKind(activate(V1)), n__isPalListKind(activate(V2))), activate(V1), activate(V2))
isNePal(V) → U61(isPalListKind(activate(V)), activate(V))
isNePal(n____(I, __(P, I))) → and(and(isQid(activate(I)), n__isPalListKind(activate(I))), n__and(isPal(activate(P)), n__isPalListKind(activate(P))))
isPal(V) → U71(isPalListKind(activate(V)), activate(V))
isPal(n__nil) → tt
isPalListKind(n__a) → tt
isPalListKind(n__e) → tt
isPalListKind(n__i) → tt
isPalListKind(n__nil) → tt
isPalListKind(n__o) → tt
isPalListKind(n__u) → tt
isPalListKind(n____(V1, V2)) → and(isPalListKind(activate(V1)), n__isPalListKind(activate(V2)))
isQid(n__a) → tt
isQid(n__e) → tt
isQid(n__i) → tt
isQid(n__o) → tt
isQid(n__u) → tt
nil → n__nil
__(X1, X2) → n____(X1, X2)
isPalListKind(X) → n__isPalListKind(X)
and(X1, X2) → n__and(X1, X2)
a → n__a
e → n__e
i → n__i
o → n__o
u → n__u
activate(n__nil) → nil
activate(n____(X1, X2)) → __(X1, X2)
activate(n__isPalListKind(X)) → isPalListKind(X)
activate(n__and(X1, X2)) → and(X1, X2)
activate(n__a) → a
activate(n__e) → e
activate(n__i) → i
activate(n__o) → o
activate(n__u) → u
activate(X) → X

Q is empty.

(1) QTRSRRRProof (EQUIVALENT transformation)

Used ordering:
Lexicographic Path Order [LPO].
Precedence:

[₂, n₂] > U21₃ > U22₂ > isList₁ > U11₂ > U12₁ > [tt, U62₁, U72₁, n_{isPalListKind1}]
[₂, n₂] > U21₃ > U22₂ > isList₁ > U11₂ > isNeList₁ > U31₂ > [activate₁, isPalListKind₁] > [n_a, a] > [tt, U62₁, U72₁, n_{isPalListKind1}]
[₂, n₂] > U21₃ > U22₂ > isList₁ > U11₂ > isNeList₁ > U31₂ > [activate₁, isPalListKind₁] > [n_i, i] > [tt, U62₁, U72₁, n_{isPalListKind1}]
[₂, n₂] > U21₃ > U22₂ > isList₁ > U11₂ > isNeList₁ > U31₂ > U32₁ > [tt, U62₁, U72₁, n_{isPalListKind1}]
[₂, n₂] > U21₃ > U22₂ > isList₁ > U11₂ > isNeList₁ > U31₂ > isQid₁ > [tt, U62₁, U72₁, n_{isPalListKind1}]
[₂, n₂] > U21₃ > U22₂ > isList₁ > [and₂, n_and2] > [activate₁, isPalListKind₁] > [n_a, a] > [tt, U62₁, U72₁, n_{isPalListKind1}]
[₂, n₂] > U21₃ > U22₂ > isList₁ > [and₂, n_and2] > [activate₁, isPalListKind₁] > [n_i, i] > [tt, U62₁, U72₁, n_{isPalListKind1}]
[₂, n₂] > U21₃ > U22₂ > U23₁ > [tt, U62₁, U72₁, n_{isPalListKind1}]
[₂, n₂] > U41₃ > isList₁ > U11₂ > U12₁ > [tt, U62₁, U72₁, n_{isPalListKind1}]
[₂, n₂] > U41₃ > isList₁ > U11₂ > isNeList₁ > U31₂ > [activate₁, isPalListKind₁] > [n_a, a] > [tt, U62₁, U72₁, n_{isPalListKind1}]
[₂, n₂] > U41₃ > isList₁ > U11₂ > isNeList₁ > U31₂ > [activate₁, isPalListKind₁] > [n_i, i] > [tt, U62₁, U72₁, n_{isPalListKind1}]
[₂, n₂] > U41₃ > isList₁ > U11₂ > isNeList₁ > U31₂ > U32₁ > [tt, U62₁, U72₁, n_{isPalListKind1}]
[₂, n₂] > U41₃ > isList₁ > U11₂ > isNeList₁ > U31₂ > isQid₁ > [tt, U62₁, U72₁, n_{isPalListKind1}]
[₂, n₂] > U41₃ > isList₁ > [and₂, n_and2] > [activate₁, isPalListKind₁] > [n_a, a] > [tt, U62₁, U72₁, n_{isPalListKind1}]
[₂, n₂] > U41₃ > isList₁ > [and₂, n_and2] > [activate₁, isPalListKind₁] > [n_i, i] > [tt, U62₁, U72₁, n_{isPalListKind1}]
[₂, n₂] > U41₃ > U42₂ > isNeList₁ > U31₂ > [activate₁, isPalListKind₁] > [n_a, a] > [tt, U62₁, U72₁, n_{isPalListKind1}]
[₂, n₂] > U41₃ > U42₂ > isNeList₁ > U31₂ > [activate₁, isPalListKind₁] > [n_i, i] > [tt, U62₁, U72₁, n_{isPalListKind1}]
[₂, n₂] > U41₃ > U42₂ > isNeList₁ > U31₂ > U32₁ > [tt, U62₁, U72₁, n_{isPalListKind1}]
[₂, n₂] > U41₃ > U42₂ > isNeList₁ > U31₂ > isQid₁ > [tt, U62₁, U72₁, n_{isPalListKind1}]
[₂, n₂] > U41₃ > U42₂ > U43₁ > [tt, U62₁, U72₁, n_{isPalListKind1}]
[₂, n₂] > U51₃ > U52₂ > isList₁ > U11₂ > U12₁ > [tt, U62₁, U72₁, n_{isPalListKind1}]
[₂, n₂] > U51₃ > U52₂ > isList₁ > U11₂ > isNeList₁ > U31₂ > [activate₁, isPalListKind₁] > [n_a, a] > [tt, U62₁, U72₁, n_{isPalListKind1}]
[₂, n₂] > U51₃ > U52₂ > isList₁ > U11₂ > isNeList₁ > U31₂ > [activate₁, isPalListKind₁] > [n_i, i] > [tt, U62₁, U72₁, n_{isPalListKind1}]
[₂, n₂] > U51₃ > U52₂ > isList₁ > U11₂ > isNeList₁ > U31₂ > U32₁ > [tt, U62₁, U72₁, n_{isPalListKind1}]
[₂, n₂] > U51₃ > U52₂ > isList₁ > U11₂ > isNeList₁ > U31₂ > isQid₁ > [tt, U62₁, U72₁, n_{isPalListKind1}]
[₂, n₂] > U51₃ > U52₂ > isList₁ > [and₂, n_and2] > [activate₁, isPalListKind₁] > [n_a, a] > [tt, U62₁, U72₁, n_{isPalListKind1}]
[₂, n₂] > U51₃ > U52₂ > isList₁ > [and₂, n_and2] > [activate₁, isPalListKind₁] > [n_i, i] > [tt, U62₁, U72₁, n_{isPalListKind1}]
[₂, n₂] > U51₃ > U52₂ > U53₁ > [tt, U62₁, U72₁, n_{isPalListKind1}]
[₂, n₂] > isPal₁ > U71₂ > isNePal₁ > U61₂ > [activate₁, isPalListKind₁] > [n_a, a] > [tt, U62₁, U72₁, n_{isPalListKind1}]
[₂, n₂] > isPal₁ > U71₂ > isNePal₁ > U61₂ > [activate₁, isPalListKind₁] > [n_i, i] > [tt, U62₁, U72₁, n_{isPalListKind1}]
[₂, n₂] > isPal₁ > U71₂ > isNePal₁ > U61₂ > isQid₁ > [tt, U62₁, U72₁, n_{isPalListKind1}]
[nil, n_nil] > [tt, U62₁, U72₁, n_{isPalListKind1}]
[n_e, e] > [tt, U62₁, U72₁, n_{isPalListKind1}]
[n_o, o] > [tt, U62₁, U72₁, n_{isPalListKind1}]
[n_u, u] > [tt, U62₁, U72₁, n_{isPalListKind1}]

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
U11(tt, V) → U12(isNeList(activate(V)))
U12(tt) → tt
U21(tt, V1, V2) → U22(isList(activate(V1)), activate(V2))
U22(tt, V2) → U23(isList(activate(V2)))
U23(tt) → tt
U31(tt, V) → U32(isQid(activate(V)))
U32(tt) → tt
U41(tt, V1, V2) → U42(isList(activate(V1)), activate(V2))
U42(tt, V2) → U43(isNeList(activate(V2)))
U43(tt) → tt
U51(tt, V1, V2) → U52(isNeList(activate(V1)), activate(V2))
U52(tt, V2) → U53(isList(activate(V2)))
U53(tt) → tt
U61(tt, V) → U62(isQid(activate(V)))
U62(tt) → tt
U71(tt, V) → U72(isNePal(activate(V)))
U72(tt) → tt
and(tt, X) → activate(X)
isList(V) → U11(isPalListKind(activate(V)), activate(V))
isList(n__nil) → tt
isList(n____(V1, V2)) → U21(and(isPalListKind(activate(V1)), n__isPalListKind(activate(V2))), activate(V1), activate(V2))
isNeList(V) → U31(isPalListKind(activate(V)), activate(V))
isNeList(n____(V1, V2)) → U41(and(isPalListKind(activate(V1)), n__isPalListKind(activate(V2))), activate(V1), activate(V2))
isNeList(n____(V1, V2)) → U51(and(isPalListKind(activate(V1)), n__isPalListKind(activate(V2))), activate(V1), activate(V2))
isNePal(V) → U61(isPalListKind(activate(V)), activate(V))
isNePal(n____(I, __(P, I))) → and(and(isQid(activate(I)), n__isPalListKind(activate(I))), n__and(isPal(activate(P)), n__isPalListKind(activate(P))))
isPal(V) → U71(isPalListKind(activate(V)), activate(V))
isPal(n__nil) → tt
isPalListKind(n__a) → tt
isPalListKind(n__e) → tt
isPalListKind(n__i) → tt
isPalListKind(n__nil) → tt
isPalListKind(n__o) → tt
isPalListKind(n__u) → tt
isPalListKind(n____(V1, V2)) → and(isPalListKind(activate(V1)), n__isPalListKind(activate(V2)))
isQid(n__a) → tt
isQid(n__e) → tt
isQid(n__i) → tt
isQid(n__o) → tt
isQid(n__u) → tt
isPalListKind(X) → n__isPalListKind(X)
activate(n__nil) → nil
activate(n____(X1, X2)) → __(X1, X2)
activate(n__isPalListKind(X)) → isPalListKind(X)
activate(n__and(X1, X2)) → and(X1, X2)
activate(n__a) → a
activate(n__e) → e
activate(n__i) → i
activate(n__o) → o
activate(n__u) → u
activate(X) → X

(2) Obligation:

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

nil → n__nil
__(X1, X2) → n____(X1, X2)
and(X1, X2) → n__and(X1, X2)
a → n__a
e → n__e
i → n__i
o → n__o
u → n__u

Q is empty.

(3) QTRSRRRProof (EQUIVALENT transformation)

Used ordering:
Lexicographic Path Order [LPO].
Precedence:

nil > n_nil
_₂ > n₂
[and₂, n_and2]
a > n_a
e > n_e
i > n_i
o > n_o
[u, n_u]

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

nil → n__nil
__(X1, X2) → n____(X1, X2)
a → n__a
e → n__e
i → n__i
o → n__o

(4) Obligation:

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

and(X1, X2) → n__and(X1, X2)
u → n__u

Q is empty.

(5) QTRSRRRProof (EQUIVALENT transformation)

Used ordering:
Lexicographic Path Order [LPO].
Precedence:

and₂ > n_and2
u > n_u > n_and2

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

and(X1, X2) → n__and(X1, X2)
u → n__u

(6) Obligation:

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

(7) RisEmptyProof (EQUIVALENT transformation)

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

(8) TRUE