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 QDPOrderProof (⇔)
    ↳9 QDP
    ↳10 PisEmptyProof (⇔)
    ↳11 TRUE
  ↳12 QDP
    ↳13 QDPOrderProof (⇔)
    ↳14 QDP
    ↳15 QDPOrderProof (⇔)
    ↳16 QDP
    ↳17 PisEmptyProof (⇔)
    ↳18 TRUE
  ↳19 QDP
    ↳20 QDPOrderProof (⇔)
    ↳21 QDP
    ↳22 QDPOrderProof (⇔)
    ↳23 QDP
    ↳24 PisEmptyProof (⇔)
    ↳25 TRUE
  ↳26 QDP
    ↳27 QDPOrderProof (⇔)
    ↳28 QDP
    ↳29 QDPOrderProof (⇔)
    ↳30 QDP
    ↳31 QDPOrderProof (⇔)
    ↳32 QDP
    ↳33 PisEmptyProof (⇔)
    ↳34 TRUE
  ↳35 QDP
    ↳36 QDPOrderProof (⇔)
    ↳37 QDP
    ↳38 QDPOrderProof (⇔)
    ↳39 QDP
    ↳40 QDPOrderProof (⇔)
    ↳41 QDP
    ↳42 QDPOrderProof (⇔)
    ↳43 QDP
    ↳44 PisEmptyProof (⇔)
    ↳45 TRUE

(0) Obligation:

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

active(__(__(X, Y), Z)) → mark(__(X, __(Y, Z)))
active(__(X, nil)) → mark(X)
active(__(nil, X)) → mark(X)
active(U11(tt)) → mark(U12(tt))
active(U12(tt)) → mark(tt)
active(isNePal(__(I, __(P, I)))) → mark(U11(tt))
mark(__(X1, X2)) → active(__(mark(X1), mark(X2)))
mark(nil) → active(nil)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U12(X)) → active(U12(mark(X)))
mark(isNePal(X)) → active(isNePal(mark(X)))
__(mark(X1), X2) → __(X1, X2)
__(X1, mark(X2)) → __(X1, X2)
__(active(X1), X2) → __(X1, X2)
__(X1, active(X2)) → __(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U12(mark(X)) → U12(X)
U12(active(X)) → U12(X)
isNePal(mark(X)) → isNePal(X)
isNePal(active(X)) → isNePal(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:

ACTIVE(__(__(X, Y), Z)) → MARK(__(X, __(Y, Z)))
ACTIVE(__(__(X, Y), Z)) → __1(X, __(Y, Z))
ACTIVE(__(__(X, Y), Z)) → __1(Y, Z)
ACTIVE(__(X, nil)) → MARK(X)
ACTIVE(__(nil, X)) → MARK(X)
ACTIVE(U11(tt)) → MARK(U12(tt))
ACTIVE(U11(tt)) → U121(tt)
ACTIVE(U12(tt)) → MARK(tt)
ACTIVE(isNePal(__(I, __(P, I)))) → MARK(U11(tt))
ACTIVE(isNePal(__(I, __(P, I)))) → U111(tt)
MARK(__(X1, X2)) → ACTIVE(__(mark(X1), mark(X2)))
MARK(__(X1, X2)) → __1(mark(X1), mark(X2))
MARK(__(X1, X2)) → MARK(X1)
MARK(__(X1, X2)) → MARK(X2)
MARK(nil) → ACTIVE(nil)
MARK(U11(X)) → ACTIVE(U11(mark(X)))
MARK(U11(X)) → U111(mark(X))
MARK(U11(X)) → MARK(X)
MARK(tt) → ACTIVE(tt)
MARK(U12(X)) → ACTIVE(U12(mark(X)))
MARK(U12(X)) → U121(mark(X))
MARK(U12(X)) → MARK(X)
MARK(isNePal(X)) → ACTIVE(isNePal(mark(X)))
MARK(isNePal(X)) → ISNEPAL(mark(X))
MARK(isNePal(X)) → MARK(X)
__1(mark(X1), X2) → __1(X1, X2)
__1(X1, mark(X2)) → __1(X1, X2)
__1(active(X1), X2) → __1(X1, X2)
__1(X1, active(X2)) → __1(X1, X2)
U111(mark(X)) → U111(X)
U111(active(X)) → U111(X)
U121(mark(X)) → U121(X)
U121(active(X)) → U121(X)
ISNEPAL(mark(X)) → ISNEPAL(X)
ISNEPAL(active(X)) → ISNEPAL(X)

The TRS R consists of the following rules:

active(__(__(X, Y), Z)) → mark(__(X, __(Y, Z)))
active(__(X, nil)) → mark(X)
active(__(nil, X)) → mark(X)
active(U11(tt)) → mark(U12(tt))
active(U12(tt)) → mark(tt)
active(isNePal(__(I, __(P, I)))) → mark(U11(tt))
mark(__(X1, X2)) → active(__(mark(X1), mark(X2)))
mark(nil) → active(nil)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U12(X)) → active(U12(mark(X)))
mark(isNePal(X)) → active(isNePal(mark(X)))
__(mark(X1), X2) → __(X1, X2)
__(X1, mark(X2)) → __(X1, X2)
__(active(X1), X2) → __(X1, X2)
__(X1, active(X2)) → __(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U12(mark(X)) → U12(X)
U12(active(X)) → U12(X)
isNePal(mark(X)) → isNePal(X)
isNePal(active(X)) → isNePal(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 5 SCCs with 11 less nodes.

(4) Complex Obligation (AND)

(5) Obligation:

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

ISNEPAL(active(X)) → ISNEPAL(X)
ISNEPAL(mark(X)) → ISNEPAL(X)

The TRS R consists of the following rules:

active(__(__(X, Y), Z)) → mark(__(X, __(Y, Z)))
active(__(X, nil)) → mark(X)
active(__(nil, X)) → mark(X)
active(U11(tt)) → mark(U12(tt))
active(U12(tt)) → mark(tt)
active(isNePal(__(I, __(P, I)))) → mark(U11(tt))
mark(__(X1, X2)) → active(__(mark(X1), mark(X2)))
mark(nil) → active(nil)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U12(X)) → active(U12(mark(X)))
mark(isNePal(X)) → active(isNePal(mark(X)))
__(mark(X1), X2) → __(X1, X2)
__(X1, mark(X2)) → __(X1, X2)
__(active(X1), X2) → __(X1, X2)
__(X1, active(X2)) → __(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U12(mark(X)) → U12(X)
U12(active(X)) → U12(X)
isNePal(mark(X)) → isNePal(X)
isNePal(active(X)) → isNePal(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.


ISNEPAL(active(X)) → ISNEPAL(X)
The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
ISNEPAL(x1)  =  ISNEPAL(x1)
active(x1)  =  active(x1)
mark(x1)  =  x1

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

Status:
ISNEPAL1: [1]
active1: [1]


The following usable rules [FROCOS05] were oriented: none

(7) Obligation:

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

ISNEPAL(mark(X)) → ISNEPAL(X)

The TRS R consists of the following rules:

active(__(__(X, Y), Z)) → mark(__(X, __(Y, Z)))
active(__(X, nil)) → mark(X)
active(__(nil, X)) → mark(X)
active(U11(tt)) → mark(U12(tt))
active(U12(tt)) → mark(tt)
active(isNePal(__(I, __(P, I)))) → mark(U11(tt))
mark(__(X1, X2)) → active(__(mark(X1), mark(X2)))
mark(nil) → active(nil)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U12(X)) → active(U12(mark(X)))
mark(isNePal(X)) → active(isNePal(mark(X)))
__(mark(X1), X2) → __(X1, X2)
__(X1, mark(X2)) → __(X1, X2)
__(active(X1), X2) → __(X1, X2)
__(X1, active(X2)) → __(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U12(mark(X)) → U12(X)
U12(active(X)) → U12(X)
isNePal(mark(X)) → isNePal(X)
isNePal(active(X)) → isNePal(X)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(8) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


ISNEPAL(mark(X)) → ISNEPAL(X)
The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
ISNEPAL(x1)  =  x1
mark(x1)  =  mark(x1)

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

Status:
mark1: [1]


The following usable rules [FROCOS05] were oriented: none

(9) Obligation:

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

active(__(__(X, Y), Z)) → mark(__(X, __(Y, Z)))
active(__(X, nil)) → mark(X)
active(__(nil, X)) → mark(X)
active(U11(tt)) → mark(U12(tt))
active(U12(tt)) → mark(tt)
active(isNePal(__(I, __(P, I)))) → mark(U11(tt))
mark(__(X1, X2)) → active(__(mark(X1), mark(X2)))
mark(nil) → active(nil)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U12(X)) → active(U12(mark(X)))
mark(isNePal(X)) → active(isNePal(mark(X)))
__(mark(X1), X2) → __(X1, X2)
__(X1, mark(X2)) → __(X1, X2)
__(active(X1), X2) → __(X1, X2)
__(X1, active(X2)) → __(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U12(mark(X)) → U12(X)
U12(active(X)) → U12(X)
isNePal(mark(X)) → isNePal(X)
isNePal(active(X)) → isNePal(X)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(10) PisEmptyProof (EQUIVALENT transformation)

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

(11) TRUE

(12) Obligation:

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

U121(active(X)) → U121(X)
U121(mark(X)) → U121(X)

The TRS R consists of the following rules:

active(__(__(X, Y), Z)) → mark(__(X, __(Y, Z)))
active(__(X, nil)) → mark(X)
active(__(nil, X)) → mark(X)
active(U11(tt)) → mark(U12(tt))
active(U12(tt)) → mark(tt)
active(isNePal(__(I, __(P, I)))) → mark(U11(tt))
mark(__(X1, X2)) → active(__(mark(X1), mark(X2)))
mark(nil) → active(nil)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U12(X)) → active(U12(mark(X)))
mark(isNePal(X)) → active(isNePal(mark(X)))
__(mark(X1), X2) → __(X1, X2)
__(X1, mark(X2)) → __(X1, X2)
__(active(X1), X2) → __(X1, X2)
__(X1, active(X2)) → __(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U12(mark(X)) → U12(X)
U12(active(X)) → U12(X)
isNePal(mark(X)) → isNePal(X)
isNePal(active(X)) → isNePal(X)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(13) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


U121(active(X)) → U121(X)
The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
U121(x1)  =  U121(x1)
active(x1)  =  active(x1)
mark(x1)  =  x1

Lexicographic path order with status [LPO].
Quasi-Precedence:
[U12^11, active1]

Status:
U12^11: [1]
active1: [1]


The following usable rules [FROCOS05] were oriented: none

(14) Obligation:

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

U121(mark(X)) → U121(X)

The TRS R consists of the following rules:

active(__(__(X, Y), Z)) → mark(__(X, __(Y, Z)))
active(__(X, nil)) → mark(X)
active(__(nil, X)) → mark(X)
active(U11(tt)) → mark(U12(tt))
active(U12(tt)) → mark(tt)
active(isNePal(__(I, __(P, I)))) → mark(U11(tt))
mark(__(X1, X2)) → active(__(mark(X1), mark(X2)))
mark(nil) → active(nil)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U12(X)) → active(U12(mark(X)))
mark(isNePal(X)) → active(isNePal(mark(X)))
__(mark(X1), X2) → __(X1, X2)
__(X1, mark(X2)) → __(X1, X2)
__(active(X1), X2) → __(X1, X2)
__(X1, active(X2)) → __(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U12(mark(X)) → U12(X)
U12(active(X)) → U12(X)
isNePal(mark(X)) → isNePal(X)
isNePal(active(X)) → isNePal(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.


U121(mark(X)) → U121(X)
The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
U121(x1)  =  x1
mark(x1)  =  mark(x1)

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

Status:
mark1: [1]


The following usable rules [FROCOS05] were oriented: none

(16) Obligation:

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

active(__(__(X, Y), Z)) → mark(__(X, __(Y, Z)))
active(__(X, nil)) → mark(X)
active(__(nil, X)) → mark(X)
active(U11(tt)) → mark(U12(tt))
active(U12(tt)) → mark(tt)
active(isNePal(__(I, __(P, I)))) → mark(U11(tt))
mark(__(X1, X2)) → active(__(mark(X1), mark(X2)))
mark(nil) → active(nil)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U12(X)) → active(U12(mark(X)))
mark(isNePal(X)) → active(isNePal(mark(X)))
__(mark(X1), X2) → __(X1, X2)
__(X1, mark(X2)) → __(X1, X2)
__(active(X1), X2) → __(X1, X2)
__(X1, active(X2)) → __(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U12(mark(X)) → U12(X)
U12(active(X)) → U12(X)
isNePal(mark(X)) → isNePal(X)
isNePal(active(X)) → isNePal(X)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(17) PisEmptyProof (EQUIVALENT transformation)

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

(18) TRUE

(19) Obligation:

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

U111(active(X)) → U111(X)
U111(mark(X)) → U111(X)

The TRS R consists of the following rules:

active(__(__(X, Y), Z)) → mark(__(X, __(Y, Z)))
active(__(X, nil)) → mark(X)
active(__(nil, X)) → mark(X)
active(U11(tt)) → mark(U12(tt))
active(U12(tt)) → mark(tt)
active(isNePal(__(I, __(P, I)))) → mark(U11(tt))
mark(__(X1, X2)) → active(__(mark(X1), mark(X2)))
mark(nil) → active(nil)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U12(X)) → active(U12(mark(X)))
mark(isNePal(X)) → active(isNePal(mark(X)))
__(mark(X1), X2) → __(X1, X2)
__(X1, mark(X2)) → __(X1, X2)
__(active(X1), X2) → __(X1, X2)
__(X1, active(X2)) → __(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U12(mark(X)) → U12(X)
U12(active(X)) → U12(X)
isNePal(mark(X)) → isNePal(X)
isNePal(active(X)) → isNePal(X)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(20) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


U111(active(X)) → U111(X)
The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
U111(x1)  =  U111(x1)
active(x1)  =  active(x1)
mark(x1)  =  x1

Lexicographic path order with status [LPO].
Quasi-Precedence:
[U11^11, active1]

Status:
U11^11: [1]
active1: [1]


The following usable rules [FROCOS05] were oriented: none

(21) Obligation:

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

U111(mark(X)) → U111(X)

The TRS R consists of the following rules:

active(__(__(X, Y), Z)) → mark(__(X, __(Y, Z)))
active(__(X, nil)) → mark(X)
active(__(nil, X)) → mark(X)
active(U11(tt)) → mark(U12(tt))
active(U12(tt)) → mark(tt)
active(isNePal(__(I, __(P, I)))) → mark(U11(tt))
mark(__(X1, X2)) → active(__(mark(X1), mark(X2)))
mark(nil) → active(nil)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U12(X)) → active(U12(mark(X)))
mark(isNePal(X)) → active(isNePal(mark(X)))
__(mark(X1), X2) → __(X1, X2)
__(X1, mark(X2)) → __(X1, X2)
__(active(X1), X2) → __(X1, X2)
__(X1, active(X2)) → __(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U12(mark(X)) → U12(X)
U12(active(X)) → U12(X)
isNePal(mark(X)) → isNePal(X)
isNePal(active(X)) → isNePal(X)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(22) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


U111(mark(X)) → U111(X)
The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
U111(x1)  =  x1
mark(x1)  =  mark(x1)

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

Status:
mark1: [1]


The following usable rules [FROCOS05] were oriented: none

(23) Obligation:

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

active(__(__(X, Y), Z)) → mark(__(X, __(Y, Z)))
active(__(X, nil)) → mark(X)
active(__(nil, X)) → mark(X)
active(U11(tt)) → mark(U12(tt))
active(U12(tt)) → mark(tt)
active(isNePal(__(I, __(P, I)))) → mark(U11(tt))
mark(__(X1, X2)) → active(__(mark(X1), mark(X2)))
mark(nil) → active(nil)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U12(X)) → active(U12(mark(X)))
mark(isNePal(X)) → active(isNePal(mark(X)))
__(mark(X1), X2) → __(X1, X2)
__(X1, mark(X2)) → __(X1, X2)
__(active(X1), X2) → __(X1, X2)
__(X1, active(X2)) → __(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U12(mark(X)) → U12(X)
U12(active(X)) → U12(X)
isNePal(mark(X)) → isNePal(X)
isNePal(active(X)) → isNePal(X)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(24) PisEmptyProof (EQUIVALENT transformation)

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

(25) TRUE

(26) Obligation:

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

__1(X1, mark(X2)) → __1(X1, X2)
__1(mark(X1), X2) → __1(X1, X2)
__1(active(X1), X2) → __1(X1, X2)
__1(X1, active(X2)) → __1(X1, X2)

The TRS R consists of the following rules:

active(__(__(X, Y), Z)) → mark(__(X, __(Y, Z)))
active(__(X, nil)) → mark(X)
active(__(nil, X)) → mark(X)
active(U11(tt)) → mark(U12(tt))
active(U12(tt)) → mark(tt)
active(isNePal(__(I, __(P, I)))) → mark(U11(tt))
mark(__(X1, X2)) → active(__(mark(X1), mark(X2)))
mark(nil) → active(nil)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U12(X)) → active(U12(mark(X)))
mark(isNePal(X)) → active(isNePal(mark(X)))
__(mark(X1), X2) → __(X1, X2)
__(X1, mark(X2)) → __(X1, X2)
__(active(X1), X2) → __(X1, X2)
__(X1, active(X2)) → __(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U12(mark(X)) → U12(X)
U12(active(X)) → U12(X)
isNePal(mark(X)) → isNePal(X)
isNePal(active(X)) → isNePal(X)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(27) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


__1(X1, mark(X2)) → __1(X1, X2)
__1(mark(X1), X2) → __1(X1, X2)
The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
__1(x1, x2)  =  __1(x1, x2)
mark(x1)  =  mark(x1)
active(x1)  =  x1

Lexicographic path order with status [LPO].
Quasi-Precedence:
mark1 > _^12

Status:
_^12: [2,1]
mark1: [1]


The following usable rules [FROCOS05] were oriented: none

(28) Obligation:

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

__1(active(X1), X2) → __1(X1, X2)
__1(X1, active(X2)) → __1(X1, X2)

The TRS R consists of the following rules:

active(__(__(X, Y), Z)) → mark(__(X, __(Y, Z)))
active(__(X, nil)) → mark(X)
active(__(nil, X)) → mark(X)
active(U11(tt)) → mark(U12(tt))
active(U12(tt)) → mark(tt)
active(isNePal(__(I, __(P, I)))) → mark(U11(tt))
mark(__(X1, X2)) → active(__(mark(X1), mark(X2)))
mark(nil) → active(nil)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U12(X)) → active(U12(mark(X)))
mark(isNePal(X)) → active(isNePal(mark(X)))
__(mark(X1), X2) → __(X1, X2)
__(X1, mark(X2)) → __(X1, X2)
__(active(X1), X2) → __(X1, X2)
__(X1, active(X2)) → __(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U12(mark(X)) → U12(X)
U12(active(X)) → U12(X)
isNePal(mark(X)) → isNePal(X)
isNePal(active(X)) → isNePal(X)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(29) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


__1(X1, active(X2)) → __1(X1, X2)
The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
__1(x1, x2)  =  __1(x2)
active(x1)  =  active(x1)

Lexicographic path order with status [LPO].
Quasi-Precedence:
active1 > _^11

Status:
_^11: [1]
active1: [1]


The following usable rules [FROCOS05] were oriented: none

(30) Obligation:

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

__1(active(X1), X2) → __1(X1, X2)

The TRS R consists of the following rules:

active(__(__(X, Y), Z)) → mark(__(X, __(Y, Z)))
active(__(X, nil)) → mark(X)
active(__(nil, X)) → mark(X)
active(U11(tt)) → mark(U12(tt))
active(U12(tt)) → mark(tt)
active(isNePal(__(I, __(P, I)))) → mark(U11(tt))
mark(__(X1, X2)) → active(__(mark(X1), mark(X2)))
mark(nil) → active(nil)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U12(X)) → active(U12(mark(X)))
mark(isNePal(X)) → active(isNePal(mark(X)))
__(mark(X1), X2) → __(X1, X2)
__(X1, mark(X2)) → __(X1, X2)
__(active(X1), X2) → __(X1, X2)
__(X1, active(X2)) → __(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U12(mark(X)) → U12(X)
U12(active(X)) → U12(X)
isNePal(mark(X)) → isNePal(X)
isNePal(active(X)) → isNePal(X)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(31) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


__1(active(X1), X2) → __1(X1, X2)
The remaining pairs can at least be oriented weakly.
Used ordering: Lexicographic path order with status [LPO].
Quasi-Precedence:
[^12, active1]

Status:
_^12: [2,1]
active1: [1]


The following usable rules [FROCOS05] were oriented: none

(32) Obligation:

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

active(__(__(X, Y), Z)) → mark(__(X, __(Y, Z)))
active(__(X, nil)) → mark(X)
active(__(nil, X)) → mark(X)
active(U11(tt)) → mark(U12(tt))
active(U12(tt)) → mark(tt)
active(isNePal(__(I, __(P, I)))) → mark(U11(tt))
mark(__(X1, X2)) → active(__(mark(X1), mark(X2)))
mark(nil) → active(nil)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U12(X)) → active(U12(mark(X)))
mark(isNePal(X)) → active(isNePal(mark(X)))
__(mark(X1), X2) → __(X1, X2)
__(X1, mark(X2)) → __(X1, X2)
__(active(X1), X2) → __(X1, X2)
__(X1, active(X2)) → __(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U12(mark(X)) → U12(X)
U12(active(X)) → U12(X)
isNePal(mark(X)) → isNePal(X)
isNePal(active(X)) → isNePal(X)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(33) PisEmptyProof (EQUIVALENT transformation)

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

(34) TRUE

(35) Obligation:

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

MARK(__(X1, X2)) → ACTIVE(__(mark(X1), mark(X2)))
ACTIVE(__(__(X, Y), Z)) → MARK(__(X, __(Y, Z)))
MARK(__(X1, X2)) → MARK(X1)
MARK(__(X1, X2)) → MARK(X2)
MARK(U11(X)) → ACTIVE(U11(mark(X)))
ACTIVE(__(X, nil)) → MARK(X)
MARK(U11(X)) → MARK(X)
MARK(U12(X)) → ACTIVE(U12(mark(X)))
ACTIVE(__(nil, X)) → MARK(X)
MARK(U12(X)) → MARK(X)
MARK(isNePal(X)) → ACTIVE(isNePal(mark(X)))
ACTIVE(U11(tt)) → MARK(U12(tt))
ACTIVE(isNePal(__(I, __(P, I)))) → MARK(U11(tt))
MARK(isNePal(X)) → MARK(X)

The TRS R consists of the following rules:

active(__(__(X, Y), Z)) → mark(__(X, __(Y, Z)))
active(__(X, nil)) → mark(X)
active(__(nil, X)) → mark(X)
active(U11(tt)) → mark(U12(tt))
active(U12(tt)) → mark(tt)
active(isNePal(__(I, __(P, I)))) → mark(U11(tt))
mark(__(X1, X2)) → active(__(mark(X1), mark(X2)))
mark(nil) → active(nil)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U12(X)) → active(U12(mark(X)))
mark(isNePal(X)) → active(isNePal(mark(X)))
__(mark(X1), X2) → __(X1, X2)
__(X1, mark(X2)) → __(X1, X2)
__(active(X1), X2) → __(X1, X2)
__(X1, active(X2)) → __(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U12(mark(X)) → U12(X)
U12(active(X)) → U12(X)
isNePal(mark(X)) → isNePal(X)
isNePal(active(X)) → isNePal(X)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(36) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


ACTIVE(__(__(X, Y), Z)) → MARK(__(X, __(Y, Z)))
MARK(__(X1, X2)) → MARK(X1)
MARK(__(X1, X2)) → MARK(X2)
ACTIVE(__(X, nil)) → MARK(X)
ACTIVE(__(nil, X)) → MARK(X)
ACTIVE(isNePal(__(I, __(P, I)))) → MARK(U11(tt))
The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
MARK(x1)  =  MARK(x1)
__(x1, x2)  =  __(x1, x2)
ACTIVE(x1)  =  ACTIVE(x1)
mark(x1)  =  x1
U11(x1)  =  x1
nil  =  nil
U12(x1)  =  x1
isNePal(x1)  =  x1
tt  =  tt
active(x1)  =  x1

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

Status:
MARK1: [1]
_2: [1,2]
ACTIVE1: [1]
nil: []
tt: []


The following usable rules [FROCOS05] were oriented:

mark(__(X1, X2)) → active(__(mark(X1), mark(X2)))
active(__(__(X, Y), Z)) → mark(__(X, __(Y, Z)))
mark(U11(X)) → active(U11(mark(X)))
active(__(X, nil)) → mark(X)
mark(U12(X)) → active(U12(mark(X)))
active(__(nil, X)) → mark(X)
mark(isNePal(X)) → active(isNePal(mark(X)))
active(U11(tt)) → mark(U12(tt))
active(isNePal(__(I, __(P, I)))) → mark(U11(tt))
mark(nil) → active(nil)
mark(tt) → active(tt)
__(X1, mark(X2)) → __(X1, X2)
__(mark(X1), X2) → __(X1, X2)
__(active(X1), X2) → __(X1, X2)
__(X1, active(X2)) → __(X1, X2)
U11(active(X)) → U11(X)
U11(mark(X)) → U11(X)
U12(active(X)) → U12(X)
U12(mark(X)) → U12(X)
isNePal(active(X)) → isNePal(X)
isNePal(mark(X)) → isNePal(X)
active(U12(tt)) → mark(tt)

(37) Obligation:

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

MARK(__(X1, X2)) → ACTIVE(__(mark(X1), mark(X2)))
MARK(U11(X)) → ACTIVE(U11(mark(X)))
MARK(U11(X)) → MARK(X)
MARK(U12(X)) → ACTIVE(U12(mark(X)))
MARK(U12(X)) → MARK(X)
MARK(isNePal(X)) → ACTIVE(isNePal(mark(X)))
ACTIVE(U11(tt)) → MARK(U12(tt))
MARK(isNePal(X)) → MARK(X)

The TRS R consists of the following rules:

active(__(__(X, Y), Z)) → mark(__(X, __(Y, Z)))
active(__(X, nil)) → mark(X)
active(__(nil, X)) → mark(X)
active(U11(tt)) → mark(U12(tt))
active(U12(tt)) → mark(tt)
active(isNePal(__(I, __(P, I)))) → mark(U11(tt))
mark(__(X1, X2)) → active(__(mark(X1), mark(X2)))
mark(nil) → active(nil)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U12(X)) → active(U12(mark(X)))
mark(isNePal(X)) → active(isNePal(mark(X)))
__(mark(X1), X2) → __(X1, X2)
__(X1, mark(X2)) → __(X1, X2)
__(active(X1), X2) → __(X1, X2)
__(X1, active(X2)) → __(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U12(mark(X)) → U12(X)
U12(active(X)) → U12(X)
isNePal(mark(X)) → isNePal(X)
isNePal(active(X)) → isNePal(X)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(38) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


MARK(__(X1, X2)) → ACTIVE(__(mark(X1), mark(X2)))
MARK(isNePal(X)) → ACTIVE(isNePal(mark(X)))
MARK(isNePal(X)) → MARK(X)
The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
MARK(x1)  =  x1
__(x1, x2)  =  __(x1, x2)
ACTIVE(x1)  =  ACTIVE
mark(x1)  =  mark(x1)
U11(x1)  =  x1
U12(x1)  =  x1
isNePal(x1)  =  isNePal(x1)
tt  =  tt
active(x1)  =  x1
nil  =  nil

Lexicographic path order with status [LPO].
Quasi-Precedence:
[mark1, isNePal1, nil] > _2 > [ACTIVE, tt]

Status:
_2: [1,2]
ACTIVE: []
mark1: [1]
isNePal1: [1]
tt: []
nil: []


The following usable rules [FROCOS05] were oriented: none

(39) Obligation:

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

MARK(U11(X)) → ACTIVE(U11(mark(X)))
MARK(U11(X)) → MARK(X)
MARK(U12(X)) → ACTIVE(U12(mark(X)))
MARK(U12(X)) → MARK(X)
ACTIVE(U11(tt)) → MARK(U12(tt))

The TRS R consists of the following rules:

active(__(__(X, Y), Z)) → mark(__(X, __(Y, Z)))
active(__(X, nil)) → mark(X)
active(__(nil, X)) → mark(X)
active(U11(tt)) → mark(U12(tt))
active(U12(tt)) → mark(tt)
active(isNePal(__(I, __(P, I)))) → mark(U11(tt))
mark(__(X1, X2)) → active(__(mark(X1), mark(X2)))
mark(nil) → active(nil)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U12(X)) → active(U12(mark(X)))
mark(isNePal(X)) → active(isNePal(mark(X)))
__(mark(X1), X2) → __(X1, X2)
__(X1, mark(X2)) → __(X1, X2)
__(active(X1), X2) → __(X1, X2)
__(X1, active(X2)) → __(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U12(mark(X)) → U12(X)
U12(active(X)) → U12(X)
isNePal(mark(X)) → isNePal(X)
isNePal(active(X)) → isNePal(X)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(40) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


MARK(U12(X)) → ACTIVE(U12(mark(X)))
The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
MARK(x1)  =  MARK
U11(x1)  =  U11
ACTIVE(x1)  =  x1
mark(x1)  =  mark
U12(x1)  =  U12
tt  =  tt
__(x1, x2)  =  __(x1, x2)
active(x1)  =  active
nil  =  nil
isNePal(x1)  =  x1

Lexicographic path order with status [LPO].
Quasi-Precedence:
nil > [mark, 2] > tt > [MARK, U11] > U12 > active

Status:
MARK: []
U11: []
mark: []
U12: []
tt: []
_2: [2,1]
active: []
nil: []


The following usable rules [FROCOS05] were oriented:

U11(active(X)) → U11(X)
U11(mark(X)) → U11(X)
U12(active(X)) → U12(X)
U12(mark(X)) → U12(X)

(41) Obligation:

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

MARK(U11(X)) → ACTIVE(U11(mark(X)))
MARK(U11(X)) → MARK(X)
MARK(U12(X)) → MARK(X)
ACTIVE(U11(tt)) → MARK(U12(tt))

The TRS R consists of the following rules:

active(__(__(X, Y), Z)) → mark(__(X, __(Y, Z)))
active(__(X, nil)) → mark(X)
active(__(nil, X)) → mark(X)
active(U11(tt)) → mark(U12(tt))
active(U12(tt)) → mark(tt)
active(isNePal(__(I, __(P, I)))) → mark(U11(tt))
mark(__(X1, X2)) → active(__(mark(X1), mark(X2)))
mark(nil) → active(nil)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U12(X)) → active(U12(mark(X)))
mark(isNePal(X)) → active(isNePal(mark(X)))
__(mark(X1), X2) → __(X1, X2)
__(X1, mark(X2)) → __(X1, X2)
__(active(X1), X2) → __(X1, X2)
__(X1, active(X2)) → __(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U12(mark(X)) → U12(X)
U12(active(X)) → U12(X)
isNePal(mark(X)) → isNePal(X)
isNePal(active(X)) → isNePal(X)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(42) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


MARK(U11(X)) → ACTIVE(U11(mark(X)))
MARK(U11(X)) → MARK(X)
MARK(U12(X)) → MARK(X)
ACTIVE(U11(tt)) → MARK(U12(tt))
The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
MARK(x1)  =  x1
U11(x1)  =  U11(x1)
ACTIVE(x1)  =  ACTIVE
mark(x1)  =  mark
U12(x1)  =  U12(x1)
tt  =  tt
__(x1, x2)  =  __(x1, x2)
active(x1)  =  active
nil  =  nil
isNePal(x1)  =  x1

Lexicographic path order with status [LPO].
Quasi-Precedence:
U111 > ACTIVE > U121 > mark > _2 > [tt, active]
U111 > ACTIVE > U121 > mark > nil > [tt, active]

Status:
U111: [1]
ACTIVE: []
mark: []
U121: [1]
tt: []
_2: [2,1]
active: []
nil: []


The following usable rules [FROCOS05] were oriented: none

(43) Obligation:

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

active(__(__(X, Y), Z)) → mark(__(X, __(Y, Z)))
active(__(X, nil)) → mark(X)
active(__(nil, X)) → mark(X)
active(U11(tt)) → mark(U12(tt))
active(U12(tt)) → mark(tt)
active(isNePal(__(I, __(P, I)))) → mark(U11(tt))
mark(__(X1, X2)) → active(__(mark(X1), mark(X2)))
mark(nil) → active(nil)
mark(U11(X)) → active(U11(mark(X)))
mark(tt) → active(tt)
mark(U12(X)) → active(U12(mark(X)))
mark(isNePal(X)) → active(isNePal(mark(X)))
__(mark(X1), X2) → __(X1, X2)
__(X1, mark(X2)) → __(X1, X2)
__(active(X1), X2) → __(X1, X2)
__(X1, active(X2)) → __(X1, X2)
U11(mark(X)) → U11(X)
U11(active(X)) → U11(X)
U12(mark(X)) → U12(X)
U12(active(X)) → U12(X)
isNePal(mark(X)) → isNePal(X)
isNePal(active(X)) → isNePal(X)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(44) PisEmptyProof (EQUIVALENT transformation)

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

(45) TRUE