Termination w.r.t. Q proof of /tmp/tmpotK5qa/PALINDROME_nokinds

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

0 QTRS

↳1 DependencyPairsProof (⇔)

↳2 QDP

↳3 DependencyGraphProof (⇔)

↳4 AND

    ↳5 QDP

        ↳6 QDPOrderProof (⇔)

        ↳7 QDP

        ↳8 PisEmptyProof (⇔)

        ↳9 TRUE

    ↳10 QDP

        ↳11 QDPOrderProof (⇔)

        ↳12 QDP

        ↳13 DependencyGraphProof (⇔)

        ↳14 QDP

        ↳15 QDPOrderProof (⇔)

        ↳16 QDP

        ↳17 DependencyGraphProof (⇔)

        ↳18 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
and(tt, X) → activate(X)
isList(V) → isNeList(activate(V))
isList(n__nil) → tt
isList(n____(V1, V2)) → and(isList(activate(V1)), n__isList(activate(V2)))
isNeList(V) → isQid(activate(V))
isNeList(n____(V1, V2)) → and(isList(activate(V1)), n__isNeList(activate(V2)))
isNeList(n____(V1, V2)) → and(isNeList(activate(V1)), n__isList(activate(V2)))
isNePal(V) → isQid(activate(V))
isNePal(n____(I, n____(P, I))) → and(isQid(activate(I)), n__isPal(activate(P)))
isPal(V) → isNePal(activate(V))
isPal(n__nil) → tt
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)
isList(X) → n__isList(X)
isNeList(X) → n__isNeList(X)
isPal(X) → n__isPal(X)
a → n__a
e → n__e
i → n__i
o → n__o
u → n__u
activate(n__nil) → nil
activate(n____(X1, X2)) → __(activate(X1), activate(X2))
activate(n__isList(X)) → isList(X)
activate(n__isNeList(X)) → isNeList(X)
activate(n__isPal(X)) → isPal(X)
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) DependencyPairsProof (EQUIVALENT transformation)

Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem.

(2) Obligation:

Q DP problem:
The TRS P consists of the following rules:

__¹(__(X, Y), Z) → __¹(X, __(Y, Z))
__¹(__(X, Y), Z) → __¹(Y, Z)
AND(tt, X) → ACTIVATE(X)
ISLIST(V) → ISNELIST(activate(V))
ISLIST(V) → ACTIVATE(V)
ISLIST(n____(V1, V2)) → AND(isList(activate(V1)), n__isList(activate(V2)))
ISLIST(n____(V1, V2)) → ISLIST(activate(V1))
ISLIST(n____(V1, V2)) → ACTIVATE(V1)
ISLIST(n____(V1, V2)) → ACTIVATE(V2)
ISNELIST(V) → ISQID(activate(V))
ISNELIST(V) → ACTIVATE(V)
ISNELIST(n____(V1, V2)) → AND(isList(activate(V1)), n__isNeList(activate(V2)))
ISNELIST(n____(V1, V2)) → ISLIST(activate(V1))
ISNELIST(n____(V1, V2)) → ACTIVATE(V1)
ISNELIST(n____(V1, V2)) → ACTIVATE(V2)
ISNELIST(n____(V1, V2)) → AND(isNeList(activate(V1)), n__isList(activate(V2)))
ISNELIST(n____(V1, V2)) → ISNELIST(activate(V1))
ISNEPAL(V) → ISQID(activate(V))
ISNEPAL(V) → ACTIVATE(V)
ISNEPAL(n____(I, n____(P, I))) → AND(isQid(activate(I)), n__isPal(activate(P)))
ISNEPAL(n____(I, n____(P, I))) → ISQID(activate(I))
ISNEPAL(n____(I, n____(P, I))) → ACTIVATE(I)
ISNEPAL(n____(I, n____(P, I))) → ACTIVATE(P)
ISPAL(V) → ISNEPAL(activate(V))
ISPAL(V) → ACTIVATE(V)
ACTIVATE(n__nil) → NIL
ACTIVATE(n____(X1, X2)) → __¹(activate(X1), activate(X2))
ACTIVATE(n____(X1, X2)) → ACTIVATE(X1)
ACTIVATE(n____(X1, X2)) → ACTIVATE(X2)
ACTIVATE(n__isList(X)) → ISLIST(X)
ACTIVATE(n__isNeList(X)) → ISNELIST(X)
ACTIVATE(n__isPal(X)) → ISPAL(X)
ACTIVATE(n__a) → A
ACTIVATE(n__e) → E
ACTIVATE(n__i) → I
ACTIVATE(n__o) → O
ACTIVATE(n__u) → U

The TRS R consists of the following rules:

__(__(X, Y), Z) → __(X, __(Y, Z))
__(X, nil) → X
__(nil, X) → X
and(tt, X) → activate(X)
isList(V) → isNeList(activate(V))
isList(n__nil) → tt
isList(n____(V1, V2)) → and(isList(activate(V1)), n__isList(activate(V2)))
isNeList(V) → isQid(activate(V))
isNeList(n____(V1, V2)) → and(isList(activate(V1)), n__isNeList(activate(V2)))
isNeList(n____(V1, V2)) → and(isNeList(activate(V1)), n__isList(activate(V2)))
isNePal(V) → isQid(activate(V))
isNePal(n____(I, n____(P, I))) → and(isQid(activate(I)), n__isPal(activate(P)))
isPal(V) → isNePal(activate(V))
isPal(n__nil) → tt
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)
isList(X) → n__isList(X)
isNeList(X) → n__isNeList(X)
isPal(X) → n__isPal(X)
a → n__a
e → n__e
i → n__i
o → n__o
u → n__u
activate(n__nil) → nil
activate(n____(X1, X2)) → __(activate(X1), activate(X2))
activate(n__isList(X)) → isList(X)
activate(n__isNeList(X)) → isNeList(X)
activate(n__isPal(X)) → isPal(X)
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.
We have to consider all minimal (P,Q,R)-chains.

(3) DependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 2 SCCs with 10 less nodes.

(4) Complex Obligation (AND)

(5) Obligation:

Q DP problem:
The TRS P consists of the following rules:

__¹(__(X, Y), Z) → __¹(Y, Z)
__¹(__(X, Y), Z) → __¹(X, __(Y, Z))

The TRS R consists of the following rules:

__(__(X, Y), Z) → __(X, __(Y, Z))
__(X, nil) → X
__(nil, X) → X
and(tt, X) → activate(X)
isList(V) → isNeList(activate(V))
isList(n__nil) → tt
isList(n____(V1, V2)) → and(isList(activate(V1)), n__isList(activate(V2)))
isNeList(V) → isQid(activate(V))
isNeList(n____(V1, V2)) → and(isList(activate(V1)), n__isNeList(activate(V2)))
isNeList(n____(V1, V2)) → and(isNeList(activate(V1)), n__isList(activate(V2)))
isNePal(V) → isQid(activate(V))
isNePal(n____(I, n____(P, I))) → and(isQid(activate(I)), n__isPal(activate(P)))
isPal(V) → isNePal(activate(V))
isPal(n__nil) → tt
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)
isList(X) → n__isList(X)
isNeList(X) → n__isNeList(X)
isPal(X) → n__isPal(X)
a → n__a
e → n__e
i → n__i
o → n__o
u → n__u
activate(n__nil) → nil
activate(n____(X1, X2)) → __(activate(X1), activate(X2))
activate(n__isList(X)) → isList(X)
activate(n__isNeList(X)) → isNeList(X)
activate(n__isPal(X)) → isPal(X)
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.
We have to consider all minimal (P,Q,R)-chains.

(6) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

__¹(__(X, Y), Z) → __¹(Y, Z)
__¹(__(X, Y), Z) → __¹(X, __(Y, Z))

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
__¹(x1, x2) = __¹(x1)

Tags:
__¹ has tags [0,0]

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Lexicographic path order with status [LPO].
Quasi-Precedence:

[_{_₂}, n_{_{_{_₂}}}]

Status:

__₂: [1,2]
nil: []
n_{_{_{_₂}}}: [2,1]

The following usable rules [FROCOS05] were oriented: none

(7) Obligation:

Q DP problem:
P is empty.
The TRS R consists of the following rules:

__(__(X, Y), Z) → __(X, __(Y, Z))
__(X, nil) → X
__(nil, X) → X
and(tt, X) → activate(X)
isList(V) → isNeList(activate(V))
isList(n__nil) → tt
isList(n____(V1, V2)) → and(isList(activate(V1)), n__isList(activate(V2)))
isNeList(V) → isQid(activate(V))
isNeList(n____(V1, V2)) → and(isList(activate(V1)), n__isNeList(activate(V2)))
isNeList(n____(V1, V2)) → and(isNeList(activate(V1)), n__isList(activate(V2)))
isNePal(V) → isQid(activate(V))
isNePal(n____(I, n____(P, I))) → and(isQid(activate(I)), n__isPal(activate(P)))
isPal(V) → isNePal(activate(V))
isPal(n__nil) → tt
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)
isList(X) → n__isList(X)
isNeList(X) → n__isNeList(X)
isPal(X) → n__isPal(X)
a → n__a
e → n__e
i → n__i
o → n__o
u → n__u
activate(n__nil) → nil
activate(n____(X1, X2)) → __(activate(X1), activate(X2))
activate(n__isList(X)) → isList(X)
activate(n__isNeList(X)) → isNeList(X)
activate(n__isPal(X)) → isPal(X)
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.
We have to consider all minimal (P,Q,R)-chains.

(8) PisEmptyProof (EQUIVALENT transformation)

The TRS P is empty. Hence, there is no (P,Q,R) chain.

(9) TRUE

(10) Obligation:

Q DP problem:
The TRS P consists of the following rules:

ACTIVATE(n____(X1, X2)) → ACTIVATE(X1)
ACTIVATE(n____(X1, X2)) → ACTIVATE(X2)
ACTIVATE(n__isList(X)) → ISLIST(X)
ISLIST(V) → ISNELIST(activate(V))
ISNELIST(V) → ACTIVATE(V)
ACTIVATE(n__isNeList(X)) → ISNELIST(X)
ISNELIST(n____(V1, V2)) → AND(isList(activate(V1)), n__isNeList(activate(V2)))
AND(tt, X) → ACTIVATE(X)
ACTIVATE(n__isPal(X)) → ISPAL(X)
ISPAL(V) → ISNEPAL(activate(V))
ISNEPAL(V) → ACTIVATE(V)
ISNEPAL(n____(I, n____(P, I))) → AND(isQid(activate(I)), n__isPal(activate(P)))
ISNEPAL(n____(I, n____(P, I))) → ACTIVATE(I)
ISNEPAL(n____(I, n____(P, I))) → ACTIVATE(P)
ISPAL(V) → ACTIVATE(V)
ISNELIST(n____(V1, V2)) → ISLIST(activate(V1))
ISLIST(V) → ACTIVATE(V)
ISLIST(n____(V1, V2)) → AND(isList(activate(V1)), n__isList(activate(V2)))
ISLIST(n____(V1, V2)) → ISLIST(activate(V1))
ISLIST(n____(V1, V2)) → ACTIVATE(V1)
ISLIST(n____(V1, V2)) → ACTIVATE(V2)
ISNELIST(n____(V1, V2)) → ACTIVATE(V1)
ISNELIST(n____(V1, V2)) → ACTIVATE(V2)
ISNELIST(n____(V1, V2)) → AND(isNeList(activate(V1)), n__isList(activate(V2)))
ISNELIST(n____(V1, V2)) → ISNELIST(activate(V1))

The TRS R consists of the following rules:

__(__(X, Y), Z) → __(X, __(Y, Z))
__(X, nil) → X
__(nil, X) → X
and(tt, X) → activate(X)
isList(V) → isNeList(activate(V))
isList(n__nil) → tt
isList(n____(V1, V2)) → and(isList(activate(V1)), n__isList(activate(V2)))
isNeList(V) → isQid(activate(V))
isNeList(n____(V1, V2)) → and(isList(activate(V1)), n__isNeList(activate(V2)))
isNeList(n____(V1, V2)) → and(isNeList(activate(V1)), n__isList(activate(V2)))
isNePal(V) → isQid(activate(V))
isNePal(n____(I, n____(P, I))) → and(isQid(activate(I)), n__isPal(activate(P)))
isPal(V) → isNePal(activate(V))
isPal(n__nil) → tt
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)
isList(X) → n__isList(X)
isNeList(X) → n__isNeList(X)
isPal(X) → n__isPal(X)
a → n__a
e → n__e
i → n__i
o → n__o
u → n__u
activate(n__nil) → nil
activate(n____(X1, X2)) → __(activate(X1), activate(X2))
activate(n__isList(X)) → isList(X)
activate(n__isNeList(X)) → isNeList(X)
activate(n__isPal(X)) → isPal(X)
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.
We have to consider all minimal (P,Q,R)-chains.

(11) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

ACTIVATE(n____(X1, X2)) → ACTIVATE(X1)
ACTIVATE(n____(X1, X2)) → ACTIVATE(X2)
ACTIVATE(n__isList(X)) → ISLIST(X)
ISLIST(V) → ISNELIST(activate(V))
ISNELIST(n____(V1, V2)) → AND(isList(activate(V1)), n__isNeList(activate(V2)))
ACTIVATE(n__isPal(X)) → ISPAL(X)
ISPAL(V) → ISNEPAL(activate(V))
ISNEPAL(n____(I, n____(P, I))) → AND(isQid(activate(I)), n__isPal(activate(P)))
ISNEPAL(n____(I, n____(P, I))) → ACTIVATE(I)
ISNEPAL(n____(I, n____(P, I))) → ACTIVATE(P)
ISPAL(V) → ACTIVATE(V)
ISNELIST(n____(V1, V2)) → ISLIST(activate(V1))
ISLIST(V) → ACTIVATE(V)
ISLIST(n____(V1, V2)) → AND(isList(activate(V1)), n__isList(activate(V2)))
ISLIST(n____(V1, V2)) → ISLIST(activate(V1))
ISLIST(n____(V1, V2)) → ACTIVATE(V1)
ISLIST(n____(V1, V2)) → ACTIVATE(V2)
ISNELIST(n____(V1, V2)) → ACTIVATE(V1)
ISNELIST(n____(V1, V2)) → ACTIVATE(V2)
ISNELIST(n____(V1, V2)) → AND(isNeList(activate(V1)), n__isList(activate(V2)))
ISNELIST(n____(V1, V2)) → ISNELIST(activate(V1))

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
ACTIVATE(x1) = ACTIVATE(x1)
ISLIST(x1) = ISLIST(x1)
ISNELIST(x1) = ISNELIST(x1)
AND(x1, x2) = AND(x1, x2)
ISPAL(x1) = ISPAL(x1)
ISNEPAL(x1) = ISNEPAL(x1)

Tags:
ACTIVATE has tags [0]
ISLIST has tags [2]
ISNELIST has tags [0]
AND has tags [6,0]
ISPAL has tags [2]
ISNEPAL has tags [0]

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Combined order from the following AFS and order.
n____(x1, x2) = n____(x1, x2)
n__isList(x1) = n__isList(x1)
activate(x1) = x1
n__isNeList(x1) = x1
isList(x1) = isList(x1)
tt = tt
n__isPal(x1) = n__isPal(x1)
isQid(x1) = x1
isNeList(x1) = x1
n__nil = n__nil
nil = nil
__(x1, x2) = __(x1, x2)
and(x1, x2) = and(x1, x2)
isPal(x1) = isPal(x1)
isNePal(x1) = isNePal(x1)
n__a = n__a
a = a
n__e = n__e
e = e
n__i = n__i
i = i
n__o = n__o
o = o
n__u = n__u
u = u

Lexicographic path order with status [LPO].
Quasi-Precedence:

[n_{_{_{_₂}}}, n_{_isPal₁}, _{_₂}, isPal₁, isNePal₁] > [n_{_isList₁}, isList₁] > tt
[n_{_{_{_₂}}}, n_{_isPal₁}, _{_₂}, isPal₁, isNePal₁] > and₂
[n_{_nil}, nil] > tt
[n_{_a}, a] > tt
[n_{_e}, e] > tt
[n_{_i}, i] > tt
[n_{_o}, o] > tt
[n_{_u}, u] > tt

Status:

n_{_{_{_₂}}}: [1,2]
n_{_isList₁}: [1]
isList₁: [1]
tt: []
n_{_isPal₁}: [1]
n_{_nil}: []
nil: []
__₂: [1,2]
and₂: [1,2]
isPal₁: [1]
isNePal₁: [1]
n_{_a}: []
a: []
n_{_e}: []
e: []
n_{_i}: []
i: []
n_{_o}: []
o: []
n_{_u}: []
u: []

The following usable rules [FROCOS05] were oriented:

activate(n__nil) → nil
activate(n____(X1, X2)) → __(activate(X1), activate(X2))
activate(n__isList(X)) → isList(X)
isList(V) → isNeList(activate(V))
isNeList(n____(V1, V2)) → and(isList(activate(V1)), n__isNeList(activate(V2)))
and(tt, X) → activate(X)
activate(n__isNeList(X)) → isNeList(X)
isNeList(n____(V1, V2)) → and(isNeList(activate(V1)), n__isList(activate(V2)))
activate(n__isPal(X)) → isPal(X)
isPal(V) → isNePal(activate(V))
isNePal(n____(I, n____(P, I))) → and(isQid(activate(I)), n__isPal(activate(P)))
isList(n____(V1, V2)) → and(isList(activate(V1)), n__isList(activate(V2)))
activate(n__a) → a
activate(n__e) → e
activate(n__i) → i
activate(n__o) → o
activate(n__u) → u
activate(X) → X
isList(n__nil) → tt
isList(X) → n__isList(X)
isQid(n__a) → tt
isQid(n__e) → tt
isQid(n__i) → tt
isQid(n__o) → tt
isQid(n__u) → tt
isNeList(V) → isQid(activate(V))
isNeList(X) → n__isNeList(X)
isNePal(V) → isQid(activate(V))
isPal(n__nil) → tt
isPal(X) → n__isPal(X)
__(__(X, Y), Z) → __(X, __(Y, Z))
__(X, nil) → X
__(nil, X) → X
__(X1, X2) → n____(X1, X2)
nil → n__nil
a → n__a
e → n__e
i → n__i
o → n__o
u → n__u

(12) Obligation:

Q DP problem:
The TRS P consists of the following rules:

ISNELIST(V) → ACTIVATE(V)
ACTIVATE(n__isNeList(X)) → ISNELIST(X)
AND(tt, X) → ACTIVATE(X)
ISNEPAL(V) → ACTIVATE(V)

The TRS R consists of the following rules:

__(__(X, Y), Z) → __(X, __(Y, Z))
__(X, nil) → X
__(nil, X) → X
and(tt, X) → activate(X)
isList(V) → isNeList(activate(V))
isList(n__nil) → tt
isList(n____(V1, V2)) → and(isList(activate(V1)), n__isList(activate(V2)))
isNeList(V) → isQid(activate(V))
isNeList(n____(V1, V2)) → and(isList(activate(V1)), n__isNeList(activate(V2)))
isNeList(n____(V1, V2)) → and(isNeList(activate(V1)), n__isList(activate(V2)))
isNePal(V) → isQid(activate(V))
isNePal(n____(I, n____(P, I))) → and(isQid(activate(I)), n__isPal(activate(P)))
isPal(V) → isNePal(activate(V))
isPal(n__nil) → tt
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)
isList(X) → n__isList(X)
isNeList(X) → n__isNeList(X)
isPal(X) → n__isPal(X)
a → n__a
e → n__e
i → n__i
o → n__o
u → n__u
activate(n__nil) → nil
activate(n____(X1, X2)) → __(activate(X1), activate(X2))
activate(n__isList(X)) → isList(X)
activate(n__isNeList(X)) → isNeList(X)
activate(n__isPal(X)) → isPal(X)
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.
We have to consider all minimal (P,Q,R)-chains.

(13) DependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 1 SCC with 2 less nodes.

(14) Obligation:

Q DP problem:
The TRS P consists of the following rules:

ACTIVATE(n__isNeList(X)) → ISNELIST(X)
ISNELIST(V) → ACTIVATE(V)

The TRS R consists of the following rules:

__(__(X, Y), Z) → __(X, __(Y, Z))
__(X, nil) → X
__(nil, X) → X
and(tt, X) → activate(X)
isList(V) → isNeList(activate(V))
isList(n__nil) → tt
isList(n____(V1, V2)) → and(isList(activate(V1)), n__isList(activate(V2)))
isNeList(V) → isQid(activate(V))
isNeList(n____(V1, V2)) → and(isList(activate(V1)), n__isNeList(activate(V2)))
isNeList(n____(V1, V2)) → and(isNeList(activate(V1)), n__isList(activate(V2)))
isNePal(V) → isQid(activate(V))
isNePal(n____(I, n____(P, I))) → and(isQid(activate(I)), n__isPal(activate(P)))
isPal(V) → isNePal(activate(V))
isPal(n__nil) → tt
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)
isList(X) → n__isList(X)
isNeList(X) → n__isNeList(X)
isPal(X) → n__isPal(X)
a → n__a
e → n__e
i → n__i
o → n__o
u → n__u
activate(n__nil) → nil
activate(n____(X1, X2)) → __(activate(X1), activate(X2))
activate(n__isList(X)) → isList(X)
activate(n__isNeList(X)) → isNeList(X)
activate(n__isPal(X)) → isPal(X)
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.
We have to consider all minimal (P,Q,R)-chains.

(15) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

ACTIVATE(n__isNeList(X)) → ISNELIST(X)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
ACTIVATE(x1) = ACTIVATE(x1)
ISNELIST(x1) = ISNELIST(x1)

Tags:
ACTIVATE has tags [1]
ISNELIST has tags [1]

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Lexicographic path order with status [LPO].
Quasi-Precedence:

trivial

Status:

n_{_isNeList₁}: [1]

The following usable rules [FROCOS05] were oriented: none

(16) Obligation:

Q DP problem:
The TRS P consists of the following rules:

ISNELIST(V) → ACTIVATE(V)

The TRS R consists of the following rules:

__(__(X, Y), Z) → __(X, __(Y, Z))
__(X, nil) → X
__(nil, X) → X
and(tt, X) → activate(X)
isList(V) → isNeList(activate(V))
isList(n__nil) → tt
isList(n____(V1, V2)) → and(isList(activate(V1)), n__isList(activate(V2)))
isNeList(V) → isQid(activate(V))
isNeList(n____(V1, V2)) → and(isList(activate(V1)), n__isNeList(activate(V2)))
isNeList(n____(V1, V2)) → and(isNeList(activate(V1)), n__isList(activate(V2)))
isNePal(V) → isQid(activate(V))
isNePal(n____(I, n____(P, I))) → and(isQid(activate(I)), n__isPal(activate(P)))
isPal(V) → isNePal(activate(V))
isPal(n__nil) → tt
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)
isList(X) → n__isList(X)
isNeList(X) → n__isNeList(X)
isPal(X) → n__isPal(X)
a → n__a
e → n__e
i → n__i
o → n__o
u → n__u
activate(n__nil) → nil
activate(n____(X1, X2)) → __(activate(X1), activate(X2))
activate(n__isList(X)) → isList(X)
activate(n__isNeList(X)) → isNeList(X)
activate(n__isPal(X)) → isPal(X)
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.
We have to consider all minimal (P,Q,R)-chains.

(17) DependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 0 SCCs with 1 less node.

(0) Obligation:

(1) DependencyPairsProof (EQUIVALENT transformation)

(2) Obligation:

(3) DependencyGraphProof (EQUIVALENT transformation)

(4) Complex Obligation (AND)

(5) Obligation:

(6) QDPOrderProof (EQUIVALENT transformation)

(7) Obligation:

(8) PisEmptyProof (EQUIVALENT transformation)

(9) TRUE

(10) Obligation:

(11) QDPOrderProof (EQUIVALENT transformation)

(12) Obligation:

(13) DependencyGraphProof (EQUIVALENT transformation)

(14) Obligation:

(15) QDPOrderProof (EQUIVALENT transformation)

(16) Obligation:

(17) DependencyGraphProof (EQUIVALENT transformation)

(18) TRUE