(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, __(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
niln__nil
__(X1, X2) → n____(X1, X2)
isList(X) → n__isList(X)
isNeList(X) → n__isNeList(X)
isPal(X) → n__isPal(X)
an__a
en__e
in__i
on__o
un__u
activate(n__nil) → nil
activate(n____(X1, X2)) → __(X1, 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:

__1(__(X, Y), Z) → __1(X, __(Y, Z))
__1(__(X, Y), Z) → __1(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, __(P, I))) → AND(isQid(activate(I)), n__isPal(activate(P)))
ISNEPAL(n____(I, __(P, I))) → ISQID(activate(I))
ISNEPAL(n____(I, __(P, I))) → ACTIVATE(I)
ISNEPAL(n____(I, __(P, I))) → ACTIVATE(P)
ISPAL(V) → ISNEPAL(activate(V))
ISPAL(V) → ACTIVATE(V)
ACTIVATE(n__nil) → NIL
ACTIVATE(n____(X1, X2)) → __1(X1, 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, __(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
niln__nil
__(X1, X2) → n____(X1, X2)
isList(X) → n__isList(X)
isNeList(X) → n__isNeList(X)
isPal(X) → n__isPal(X)
an__a
en__e
in__i
on__o
un__u
activate(n__nil) → nil
activate(n____(X1, X2)) → __(X1, 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:

__1(__(X, Y), Z) → __1(Y, Z)
__1(__(X, Y), Z) → __1(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, __(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
niln__nil
__(X1, X2) → n____(X1, X2)
isList(X) → n__isList(X)
isNeList(X) → n__isNeList(X)
isPal(X) → n__isPal(X)
an__a
en__e
in__i
on__o
un__u
activate(n__nil) → nil
activate(n____(X1, X2)) → __(X1, 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.


__1(__(X, Y), Z) → __1(Y, Z)
__1(__(X, Y), Z) → __1(X, __(Y, Z))
The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
__1(x1, x2)  =  x1
__(x1, x2)  =  __(x1, x2)
nil  =  nil
n____(x1, x2)  =  n____(x1, x2)

Lexicographic path order with status [LPO].
Quasi-Precedence:
nil > [2, n2]

Status:
_2: [1,2]
nil: []
n2: [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, __(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
niln__nil
__(X1, X2) → n____(X1, X2)
isList(X) → n__isList(X)
isNeList(X) → n__isNeList(X)
isPal(X) → n__isPal(X)
an__a
en__e
in__i
on__o
un__u
activate(n__nil) → nil
activate(n____(X1, X2)) → __(X1, 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__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, __(P, I))) → AND(isQid(activate(I)), n__isPal(activate(P)))
ISNEPAL(n____(I, __(P, I))) → ACTIVATE(I)
ISNEPAL(n____(I, __(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, __(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
niln__nil
__(X1, X2) → n____(X1, X2)
isList(X) → n__isList(X)
isNeList(X) → n__isNeList(X)
isPal(X) → n__isPal(X)
an__a
en__e
in__i
on__o
un__u
activate(n__nil) → nil
activate(n____(X1, X2)) → __(X1, 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__isList(X)) → ISLIST(X)
ACTIVATE(n__isNeList(X)) → ISNELIST(X)
ISNELIST(n____(V1, V2)) → AND(isList(activate(V1)), n__isNeList(activate(V2)))
AND(tt, X) → ACTIVATE(X)
ISNEPAL(n____(I, __(P, I))) → AND(isQid(activate(I)), n__isPal(activate(P)))
ISNEPAL(n____(I, __(P, I))) → ACTIVATE(I)
ISNEPAL(n____(I, __(P, I))) → ACTIVATE(P)
ISNELIST(n____(V1, V2)) → ISLIST(activate(V1))
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: Combined order from the following AFS and order.
ACTIVATE(x1)  =  x1
n__isList(x1)  =  n__isList(x1)
ISLIST(x1)  =  x1
ISNELIST(x1)  =  x1
activate(x1)  =  x1
n__isNeList(x1)  =  n__isNeList(x1)
n____(x1, x2)  =  n____(x1, x2)
AND(x1, x2)  =  AND(x1, x2)
isList(x1)  =  isList(x1)
tt  =  tt
n__isPal(x1)  =  x1
ISPAL(x1)  =  x1
ISNEPAL(x1)  =  x1
__(x1, x2)  =  __(x1, x2)
isQid(x1)  =  x1
isNeList(x1)  =  isNeList(x1)
n__nil  =  n__nil
nil  =  nil
and(x1, x2)  =  and(x1, x2)
isPal(x1)  =  x1
isNePal(x1)  =  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:
[n2, 2] > [nisList1, nisNeList1, AND2, isList1, isNeList1, and2]
[na, a] > [tt, nnil, nil] > [nisList1, nisNeList1, AND2, isList1, isNeList1, and2]
[ne, e] > [tt, nnil, nil] > [nisList1, nisNeList1, AND2, isList1, isNeList1, and2]
[ni, i] > [tt, nnil, nil] > [nisList1, nisNeList1, AND2, isList1, isNeList1, and2]
[no, o] > [tt, nnil, nil] > [nisList1, nisNeList1, AND2, isList1, isNeList1, and2]
[nu, u] > [tt, nnil, nil] > [nisList1, nisNeList1, AND2, isList1, isNeList1, and2]

Status:
nisList1: [1]
nisNeList1: [1]
n2: [1,2]
AND2: [2,1]
isList1: [1]
tt: []
_2: [1,2]
isNeList1: [1]
nnil: []
nil: []
and2: [2,1]
na: []
a: []
ne: []
e: []
ni: []
i: []
no: []
o: []
nu: []
u: []


The following usable rules [FROCOS05] were oriented:

activate(n__nil) → nil
activate(n____(X1, X2)) → __(X1, 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, __(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)
isPal(n__nil) → tt
isPal(X) → n__isPal(X)
isNePal(V) → isQid(activate(V))
__(__(X, Y), Z) → __(X, __(Y, Z))
__(X, nil) → X
__(nil, X) → X
__(X1, X2) → n____(X1, X2)
niln__nil
an__a
en__e
in__i
on__o
un__u

(12) Obligation:

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

ISLIST(V) → ISNELIST(activate(V))
ISNELIST(V) → ACTIVATE(V)
ACTIVATE(n__isPal(X)) → ISPAL(X)
ISPAL(V) → ISNEPAL(activate(V))
ISNEPAL(V) → ACTIVATE(V)
ISPAL(V) → ACTIVATE(V)
ISLIST(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, __(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
niln__nil
__(X1, X2) → n____(X1, X2)
isList(X) → n__isList(X)
isNeList(X) → n__isNeList(X)
isPal(X) → n__isPal(X)
an__a
en__e
in__i
on__o
un__u
activate(n__nil) → nil
activate(n____(X1, X2)) → __(X1, 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 3 less nodes.

(14) Obligation:

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

ISPAL(V) → ISNEPAL(activate(V))
ISNEPAL(V) → ACTIVATE(V)
ACTIVATE(n__isPal(X)) → ISPAL(X)
ISPAL(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, __(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
niln__nil
__(X1, X2) → n____(X1, X2)
isList(X) → n__isList(X)
isNeList(X) → n__isNeList(X)
isPal(X) → n__isPal(X)
an__a
en__e
in__i
on__o
un__u
activate(n__nil) → nil
activate(n____(X1, X2)) → __(X1, 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__isPal(X)) → ISPAL(X)
The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
ISPAL(x1)  =  x1
ISNEPAL(x1)  =  x1
activate(x1)  =  x1
ACTIVATE(x1)  =  x1
n__isPal(x1)  =  n__isPal(x1)
n__nil  =  n__nil
nil  =  nil
n____(x1, x2)  =  n____(x1, x2)
__(x1, x2)  =  __(x1, x2)
n__isList(x1)  =  n__isList(x1)
isList(x1)  =  isList(x1)
isNeList(x1)  =  x1
and(x1, x2)  =  x2
n__isNeList(x1)  =  x1
tt  =  tt
isPal(x1)  =  isPal(x1)
isNePal(x1)  =  x1
isQid(x1)  =  isQid
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:
[n2, 2] > [nisPal1, nnil, nil, nisList1, isList1, tt, isPal1, isQid]
[na, a] > [nisPal1, nnil, nil, nisList1, isList1, tt, isPal1, isQid]
[ne, e] > [nisPal1, nnil, nil, nisList1, isList1, tt, isPal1, isQid]
[ni, i] > [nisPal1, nnil, nil, nisList1, isList1, tt, isPal1, isQid]
[no, o] > [nisPal1, nnil, nil, nisList1, isList1, tt, isPal1, isQid]
[nu, u] > [nisPal1, nnil, nil, nisList1, isList1, tt, isPal1, isQid]

Status:
nisPal1: [1]
nnil: []
nil: []
n2: [1,2]
_2: [1,2]
nisList1: [1]
isList1: [1]
tt: []
isPal1: [1]
isQid: []
na: []
a: []
ne: []
e: []
ni: []
i: []
no: []
o: []
nu: []
u: []


The following usable rules [FROCOS05] were oriented:

activate(n__nil) → nil
activate(n____(X1, X2)) → __(X1, 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, __(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)
isNeList(X) → n__isNeList(X)
isPal(n__nil) → tt
isPal(X) → n__isPal(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))
isNePal(V) → isQid(activate(V))
__(__(X, Y), Z) → __(X, __(Y, Z))
__(X, nil) → X
__(nil, X) → X
__(X1, X2) → n____(X1, X2)
niln__nil
an__a
en__e
in__i
on__o
un__u

(16) Obligation:

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

ISPAL(V) → ISNEPAL(activate(V))
ISNEPAL(V) → ACTIVATE(V)
ISPAL(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, __(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
niln__nil
__(X1, X2) → n____(X1, X2)
isList(X) → n__isList(X)
isNeList(X) → n__isNeList(X)
isPal(X) → n__isPal(X)
an__a
en__e
in__i
on__o
un__u
activate(n__nil) → nil
activate(n____(X1, X2)) → __(X1, 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 3 less nodes.

(18) TRUE