Termination w.r.t. Q proof of /tmp/tmpedCx1h/PALINDROME_complete-noand

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

0 QTRS

↳1 QTRSRRRProof (⇔)

↳2 QTRS

↳3 QTRSRRRProof (⇔)

↳4 QTRS

↳5 RisEmptyProof (⇔)

↳6 TRUE

(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(isPalListKind(activate(V)), activate(V))
U12(tt, V) → U13(isNeList(activate(V)))
U13(tt) → tt
U21(tt, V1, V2) → U22(isPalListKind(activate(V1)), activate(V1), activate(V2))
U22(tt, V1, V2) → U23(isPalListKind(activate(V2)), activate(V1), activate(V2))
U23(tt, V1, V2) → U24(isPalListKind(activate(V2)), activate(V1), activate(V2))
U24(tt, V1, V2) → U25(isList(activate(V1)), activate(V2))
U25(tt, V2) → U26(isList(activate(V2)))
U26(tt) → tt
U31(tt, V) → U32(isPalListKind(activate(V)), activate(V))
U32(tt, V) → U33(isQid(activate(V)))
U33(tt) → tt
U41(tt, V1, V2) → U42(isPalListKind(activate(V1)), activate(V1), activate(V2))
U42(tt, V1, V2) → U43(isPalListKind(activate(V2)), activate(V1), activate(V2))
U43(tt, V1, V2) → U44(isPalListKind(activate(V2)), activate(V1), activate(V2))
U44(tt, V1, V2) → U45(isList(activate(V1)), activate(V2))
U45(tt, V2) → U46(isNeList(activate(V2)))
U46(tt) → tt
U51(tt, V1, V2) → U52(isPalListKind(activate(V1)), activate(V1), activate(V2))
U52(tt, V1, V2) → U53(isPalListKind(activate(V2)), activate(V1), activate(V2))
U53(tt, V1, V2) → U54(isPalListKind(activate(V2)), activate(V1), activate(V2))
U54(tt, V1, V2) → U55(isNeList(activate(V1)), activate(V2))
U55(tt, V2) → U56(isList(activate(V2)))
U56(tt) → tt
U61(tt, V) → U62(isPalListKind(activate(V)), activate(V))
U62(tt, V) → U63(isQid(activate(V)))
U63(tt) → tt
U71(tt, I, P) → U72(isPalListKind(activate(I)), activate(P))
U72(tt, P) → U73(isPal(activate(P)), activate(P))
U73(tt, P) → U74(isPalListKind(activate(P)))
U74(tt) → tt
U81(tt, V) → U82(isPalListKind(activate(V)), activate(V))
U82(tt, V) → U83(isNePal(activate(V)))
U83(tt) → tt
U91(tt, V2) → U92(isPalListKind(activate(V2)))
U92(tt) → tt
isList(V) → U11(isPalListKind(activate(V)), activate(V))
isList(n__nil) → tt
isList(n____(V1, V2)) → U21(isPalListKind(activate(V1)), activate(V1), activate(V2))
isNeList(V) → U31(isPalListKind(activate(V)), activate(V))
isNeList(n____(V1, V2)) → U41(isPalListKind(activate(V1)), activate(V1), activate(V2))
isNeList(n____(V1, V2)) → U51(isPalListKind(activate(V1)), activate(V1), activate(V2))
isNePal(V) → U61(isPalListKind(activate(V)), activate(V))
isNePal(n____(I, __(P, I))) → U71(isQid(activate(I)), activate(I), activate(P))
isPal(V) → U81(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)) → U91(isPalListKind(activate(V1)), 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)
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__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:
Recursive path order with status [RPO].
Quasi-Precedence:

[_{_₂}, n_{_{_{_₂}}}] > U21₃ > U22₃ > U23₃ > U24₃ > U25₂ > isList₁ > U11₂ > U12₂ > isNeList₁ > U31₂ > [isPalListKind₁, activate₁, U32₂] > [tt, U13₁, U33₁, isQid₁, U63₁]
[_{_₂}, n_{_{_{_₂}}}] > U21₃ > U22₃ > U23₃ > U24₃ > U25₂ > U26₁ > [tt, U13₁, U33₁, isQid₁, U63₁]
[_{_₂}, n_{_{_{_₂}}}] > U41₃ > U42₃ > U43₃ > U44₃ > isList₁ > U11₂ > U12₂ > isNeList₁ > U31₂ > [isPalListKind₁, activate₁, U32₂] > [tt, U13₁, U33₁, isQid₁, U63₁]
[_{_₂}, n_{_{_{_₂}}}] > U41₃ > U42₃ > U43₃ > U44₃ > U45₂ > isNeList₁ > U31₂ > [isPalListKind₁, activate₁, U32₂] > [tt, U13₁, U33₁, isQid₁, U63₁]
[_{_₂}, n_{_{_{_₂}}}] > U41₃ > U42₃ > U43₃ > U44₃ > U45₂ > U46₁ > [tt, U13₁, U33₁, isQid₁, U63₁]
[_{_₂}, n_{_{_{_₂}}}] > U51₃ > U52₃ > U53₃ > U54₃ > U55₂ > isList₁ > U11₂ > U12₂ > isNeList₁ > U31₂ > [isPalListKind₁, activate₁, U32₂] > [tt, U13₁, U33₁, isQid₁, U63₁]
[_{_₂}, n_{_{_{_₂}}}] > U51₃ > U52₃ > U53₃ > U54₃ > U55₂ > U56₁ > [tt, U13₁, U33₁, isQid₁, U63₁]
[_{_₂}, n_{_{_{_₂}}}] > U71₃ > U72₂ > U73₂ > [isPalListKind₁, activate₁, U32₂] > [tt, U13₁, U33₁, isQid₁, U63₁]
[_{_₂}, n_{_{_{_₂}}}] > U71₃ > U72₂ > U73₂ > U74₁ > [tt, U13₁, U33₁, isQid₁, U63₁]
[_{_₂}, n_{_{_{_₂}}}] > U71₃ > U72₂ > isPal₁ > U81₂ > U82₂ > U83₁ > [tt, U13₁, U33₁, isQid₁, U63₁]
[_{_₂}, n_{_{_{_₂}}}] > U71₃ > U72₂ > isPal₁ > U81₂ > U82₂ > isNePal₁ > U61₂ > U62₂ > [isPalListKind₁, activate₁, U32₂] > [tt, U13₁, U33₁, isQid₁, U63₁]
[_{_₂}, n_{_{_{_₂}}}] > U91₂ > [isPalListKind₁, activate₁, U32₂] > [tt, U13₁, U33₁, isQid₁, U63₁]
[_{_₂}, n_{_{_{_₂}}}] > U91₂ > U92₁ > [tt, U13₁, U33₁, isQid₁, U63₁]
[nil, n_{_nil}] > [tt, U13₁, U33₁, isQid₁, U63₁]
[n_{_a}, a] > [tt, U13₁, U33₁, isQid₁, U63₁]
[n_{_e}, e] > [tt, U13₁, U33₁, isQid₁, U63₁]
[n_{_i}, i] > [tt, U13₁, U33₁, isQid₁, U63₁]
[n_{_o}, o] > [tt, U13₁, U33₁, isQid₁, U63₁]
[n_{_u}, u] > [tt, U13₁, U33₁, isQid₁, U63₁]

Status:

i: multiset
U62₂: multiset
U41₃: multiset
U32₂: multiset
U25₂: multiset
U24₃: multiset
n_{_i}: multiset
U12₂: multiset
n_{_nil}: multiset
U56₁: multiset
tt: multiset
U22₃: [3,1,2]
isPalListKind₁: multiset
U21₃: [1,2,3]
U54₃: multiset
nil: multiset
U55₂: multiset
U31₂: multiset
e: multiset
isNePal₁: multiset
n_{_{_{_₂}}}: [1,2]
o: multiset
U53₃: [2,3,1]
U23₃: [3,2,1]
n_{_o}: multiset
U81₂: multiset
U44₃: [1,2,3]
U33₁: [1]
U74₁: multiset
U71₃: [2,3,1]
U91₂: multiset
__₂: [1,2]
n_{_u}: multiset
activate₁: multiset
U43₃: [1,3,2]
n_{_a}: multiset
U26₁: [1]
U42₃: [2,3,1]
U92₁: multiset
U45₂: multiset
U51₃: [1,2,3]
U83₁: multiset
U73₂: multiset
a: multiset
isList₁: [1]
n_{_e}: multiset
U72₂: multiset
U11₂: multiset
U63₁: multiset
isQid₁: multiset
U52₃: multiset
isPal₁: [1]
U82₂: multiset
U61₂: [1,2]
u: multiset
U46₁: [1]
isNeList₁: multiset
U13₁: [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
U11(tt, V) → U12(isPalListKind(activate(V)), activate(V))
U12(tt, V) → U13(isNeList(activate(V)))
U13(tt) → tt
U21(tt, V1, V2) → U22(isPalListKind(activate(V1)), activate(V1), activate(V2))
U22(tt, V1, V2) → U23(isPalListKind(activate(V2)), activate(V1), activate(V2))
U23(tt, V1, V2) → U24(isPalListKind(activate(V2)), activate(V1), activate(V2))
U24(tt, V1, V2) → U25(isList(activate(V1)), activate(V2))
U25(tt, V2) → U26(isList(activate(V2)))
U26(tt) → tt
U31(tt, V) → U32(isPalListKind(activate(V)), activate(V))
U32(tt, V) → U33(isQid(activate(V)))
U33(tt) → tt
U41(tt, V1, V2) → U42(isPalListKind(activate(V1)), activate(V1), activate(V2))
U42(tt, V1, V2) → U43(isPalListKind(activate(V2)), activate(V1), activate(V2))
U43(tt, V1, V2) → U44(isPalListKind(activate(V2)), activate(V1), activate(V2))
U44(tt, V1, V2) → U45(isList(activate(V1)), activate(V2))
U45(tt, V2) → U46(isNeList(activate(V2)))
U46(tt) → tt
U51(tt, V1, V2) → U52(isPalListKind(activate(V1)), activate(V1), activate(V2))
U52(tt, V1, V2) → U53(isPalListKind(activate(V2)), activate(V1), activate(V2))
U53(tt, V1, V2) → U54(isPalListKind(activate(V2)), activate(V1), activate(V2))
U54(tt, V1, V2) → U55(isNeList(activate(V1)), activate(V2))
U55(tt, V2) → U56(isList(activate(V2)))
U56(tt) → tt
U61(tt, V) → U62(isPalListKind(activate(V)), activate(V))
U62(tt, V) → U63(isQid(activate(V)))
U63(tt) → tt
U71(tt, I, P) → U72(isPalListKind(activate(I)), activate(P))
U72(tt, P) → U73(isPal(activate(P)), activate(P))
U73(tt, P) → U74(isPalListKind(activate(P)))
U74(tt) → tt
U81(tt, V) → U82(isPalListKind(activate(V)), activate(V))
U82(tt, V) → U83(isNePal(activate(V)))
U83(tt) → tt
U91(tt, V2) → U92(isPalListKind(activate(V2)))
U92(tt) → tt
isList(V) → U11(isPalListKind(activate(V)), activate(V))
isList(n__nil) → tt
isList(n____(V1, V2)) → U21(isPalListKind(activate(V1)), activate(V1), activate(V2))
isNeList(V) → U31(isPalListKind(activate(V)), activate(V))
isNeList(n____(V1, V2)) → U41(isPalListKind(activate(V1)), activate(V1), activate(V2))
isNeList(n____(V1, V2)) → U51(isPalListKind(activate(V1)), activate(V1), activate(V2))
isNePal(V) → U61(isPalListKind(activate(V)), activate(V))
isNePal(n____(I, __(P, I))) → U71(isQid(activate(I)), activate(I), activate(P))
isPal(V) → U81(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)) → U91(isPalListKind(activate(V1)), activate(V2))
isQid(n__a) → tt
isQid(n__e) → tt
isQid(n__i) → tt
isQid(n__o) → tt
isQid(n__u) → tt
activate(n__nil) → nil
activate(n____(X1, X2)) → __(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)
a → n__a
e → n__e
i → n__i
o → n__o
u → n__u

Q is empty.

(3) QTRSRRRProof (EQUIVALENT transformation)

Used ordering:
Recursive path order with status [RPO].
Quasi-Precedence:

nil > n_{_nil}
__₂ > n_{_{_{_₂}}}
a > n_{_a}
e > n_{_e}
i > n_{_i}
o > n_{_o}
u > n_{_u}

Status:

i: multiset
a: multiset
__₂: multiset
n_{_u}: multiset
e: multiset
n_{_i}: multiset
n_{_e}: multiset
n_{_nil}: multiset
o: multiset
n_{_{_{_₂}}}: multiset
n_{_a}: multiset
n_{_o}: multiset
u: multiset
nil: multiset

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
u → n__u

(0) Obligation:

(1) QTRSRRRProof (EQUIVALENT transformation)

(2) Obligation:

(3) QTRSRRRProof (EQUIVALENT transformation)

(4) Obligation:

(5) RisEmptyProof (EQUIVALENT transformation)

(6) TRUE