Termination w.r.t. Q proof of /tmp/tmp5SlPuX/Ex3_2_Luc97

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

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 QDPOrderProof (⇔)

    ↳18 QDP

    ↳19 QDPOrderProof (⇔)

    ↳20 QDP

    ↳21 PisEmptyProof (⇔)

    ↳22 TRUE

  ↳23 QDP

    ↳24 QDPOrderProof (⇔)

    ↳25 QDP

    ↳26 QDPOrderProof (⇔)

    ↳27 QDP

    ↳28 QDPOrderProof (⇔)

    ↳29 QDP

    ↳30 QDPOrderProof (⇔)

    ↳31 QDP

    ↳32 PisEmptyProof (⇔)

    ↳33 TRUE

  ↳34 QDP

    ↳35 QDPOrderProof (⇔)

    ↳36 QDP

    ↳37 QDPOrderProof (⇔)

    ↳38 QDP

    ↳39 QDPOrderProof (⇔)

    ↳40 QDP

    ↳41 QDPOrderProof (⇔)

    ↳42 QDP

    ↳43 PisEmptyProof (⇔)

    ↳44 TRUE

  ↳45 QDP

    ↳46 QDPOrderProof (⇔)

    ↳47 QDP

    ↳48 QDPOrderProof (⇔)

    ↳49 QDP

    ↳50 PisEmptyProof (⇔)

    ↳51 TRUE

  ↳52 QDP

    ↳53 QDPOrderProof (⇔)

    ↳54 QDP

    ↳55 QDPOrderProof (⇔)

    ↳56 QDP

    ↳57 PisEmptyProof (⇔)

    ↳58 TRUE

  ↳59 QDP

    ↳60 QDPOrderProof (⇔)

    ↳61 QDP

    ↳62 QDPOrderProof (⇔)

    ↳63 QDP

    ↳64 PisEmptyProof (⇔)

    ↳65 TRUE

  ↳66 QDP

(0) Obligation:

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

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
mark(dbl(X)) → active(dbl(mark(X)))
mark(0) → active(0)
mark(s(X)) → active(s(X))
mark(dbls(X)) → active(dbls(mark(X)))
mark(nil) → active(nil)
mark(cons(X1, X2)) → active(cons(X1, X2))
mark(sel(X1, X2)) → active(sel(mark(X1), mark(X2)))
mark(indx(X1, X2)) → active(indx(mark(X1), X2))
mark(from(X)) → active(from(X))
dbl(mark(X)) → dbl(X)
dbl(active(X)) → dbl(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
dbls(mark(X)) → dbls(X)
dbls(active(X)) → dbls(X)
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
sel(mark(X1), X2) → sel(X1, X2)
sel(X1, mark(X2)) → sel(X1, X2)
sel(active(X1), X2) → sel(X1, X2)
sel(X1, active(X2)) → sel(X1, X2)
indx(mark(X1), X2) → indx(X1, X2)
indx(X1, mark(X2)) → indx(X1, X2)
indx(active(X1), X2) → indx(X1, X2)
indx(X1, active(X2)) → indx(X1, X2)
from(mark(X)) → from(X)
from(active(X)) → from(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(dbl(0)) → MARK(0)
ACTIVE(dbl(s(X))) → MARK(s(s(dbl(X))))
ACTIVE(dbl(s(X))) → S(s(dbl(X)))
ACTIVE(dbl(s(X))) → S(dbl(X))
ACTIVE(dbl(s(X))) → DBL(X)
ACTIVE(dbls(nil)) → MARK(nil)
ACTIVE(dbls(cons(X, Y))) → MARK(cons(dbl(X), dbls(Y)))
ACTIVE(dbls(cons(X, Y))) → CONS(dbl(X), dbls(Y))
ACTIVE(dbls(cons(X, Y))) → DBL(X)
ACTIVE(dbls(cons(X, Y))) → DBLS(Y)
ACTIVE(sel(0, cons(X, Y))) → MARK(X)
ACTIVE(sel(s(X), cons(Y, Z))) → MARK(sel(X, Z))
ACTIVE(sel(s(X), cons(Y, Z))) → SEL(X, Z)
ACTIVE(indx(nil, X)) → MARK(nil)
ACTIVE(indx(cons(X, Y), Z)) → MARK(cons(sel(X, Z), indx(Y, Z)))
ACTIVE(indx(cons(X, Y), Z)) → CONS(sel(X, Z), indx(Y, Z))
ACTIVE(indx(cons(X, Y), Z)) → SEL(X, Z)
ACTIVE(indx(cons(X, Y), Z)) → INDX(Y, Z)
ACTIVE(from(X)) → MARK(cons(X, from(s(X))))
ACTIVE(from(X)) → CONS(X, from(s(X)))
ACTIVE(from(X)) → FROM(s(X))
ACTIVE(from(X)) → S(X)
MARK(dbl(X)) → ACTIVE(dbl(mark(X)))
MARK(dbl(X)) → DBL(mark(X))
MARK(dbl(X)) → MARK(X)
MARK(0) → ACTIVE(0)
MARK(s(X)) → ACTIVE(s(X))
MARK(dbls(X)) → ACTIVE(dbls(mark(X)))
MARK(dbls(X)) → DBLS(mark(X))
MARK(dbls(X)) → MARK(X)
MARK(nil) → ACTIVE(nil)
MARK(cons(X1, X2)) → ACTIVE(cons(X1, X2))
MARK(sel(X1, X2)) → ACTIVE(sel(mark(X1), mark(X2)))
MARK(sel(X1, X2)) → SEL(mark(X1), mark(X2))
MARK(sel(X1, X2)) → MARK(X1)
MARK(sel(X1, X2)) → MARK(X2)
MARK(indx(X1, X2)) → ACTIVE(indx(mark(X1), X2))
MARK(indx(X1, X2)) → INDX(mark(X1), X2)
MARK(indx(X1, X2)) → MARK(X1)
MARK(from(X)) → ACTIVE(from(X))
DBL(mark(X)) → DBL(X)
DBL(active(X)) → DBL(X)
S(mark(X)) → S(X)
S(active(X)) → S(X)
DBLS(mark(X)) → DBLS(X)
DBLS(active(X)) → DBLS(X)
CONS(mark(X1), X2) → CONS(X1, X2)
CONS(X1, mark(X2)) → CONS(X1, X2)
CONS(active(X1), X2) → CONS(X1, X2)
CONS(X1, active(X2)) → CONS(X1, X2)
SEL(mark(X1), X2) → SEL(X1, X2)
SEL(X1, mark(X2)) → SEL(X1, X2)
SEL(active(X1), X2) → SEL(X1, X2)
SEL(X1, active(X2)) → SEL(X1, X2)
INDX(mark(X1), X2) → INDX(X1, X2)
INDX(X1, mark(X2)) → INDX(X1, X2)
INDX(active(X1), X2) → INDX(X1, X2)
INDX(X1, active(X2)) → INDX(X1, X2)
FROM(mark(X)) → FROM(X)
FROM(active(X)) → FROM(X)

The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
mark(dbl(X)) → active(dbl(mark(X)))
mark(0) → active(0)
mark(s(X)) → active(s(X))
mark(dbls(X)) → active(dbls(mark(X)))
mark(nil) → active(nil)
mark(cons(X1, X2)) → active(cons(X1, X2))
mark(sel(X1, X2)) → active(sel(mark(X1), mark(X2)))
mark(indx(X1, X2)) → active(indx(mark(X1), X2))
mark(from(X)) → active(from(X))
dbl(mark(X)) → dbl(X)
dbl(active(X)) → dbl(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
dbls(mark(X)) → dbls(X)
dbls(active(X)) → dbls(X)
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
sel(mark(X1), X2) → sel(X1, X2)
sel(X1, mark(X2)) → sel(X1, X2)
sel(active(X1), X2) → sel(X1, X2)
sel(X1, active(X2)) → sel(X1, X2)
indx(mark(X1), X2) → indx(X1, X2)
indx(X1, mark(X2)) → indx(X1, X2)
indx(active(X1), X2) → indx(X1, X2)
indx(X1, active(X2)) → indx(X1, X2)
from(mark(X)) → from(X)
from(active(X)) → from(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 8 SCCs with 22 less nodes.

(4) Complex Obligation (AND)

(5) Obligation:

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

FROM(active(X)) → FROM(X)
FROM(mark(X)) → FROM(X)

The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
mark(dbl(X)) → active(dbl(mark(X)))
mark(0) → active(0)
mark(s(X)) → active(s(X))
mark(dbls(X)) → active(dbls(mark(X)))
mark(nil) → active(nil)
mark(cons(X1, X2)) → active(cons(X1, X2))
mark(sel(X1, X2)) → active(sel(mark(X1), mark(X2)))
mark(indx(X1, X2)) → active(indx(mark(X1), X2))
mark(from(X)) → active(from(X))
dbl(mark(X)) → dbl(X)
dbl(active(X)) → dbl(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
dbls(mark(X)) → dbls(X)
dbls(active(X)) → dbls(X)
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
sel(mark(X1), X2) → sel(X1, X2)
sel(X1, mark(X2)) → sel(X1, X2)
sel(active(X1), X2) → sel(X1, X2)
sel(X1, active(X2)) → sel(X1, X2)
indx(mark(X1), X2) → indx(X1, X2)
indx(X1, mark(X2)) → indx(X1, X2)
indx(active(X1), X2) → indx(X1, X2)
indx(X1, active(X2)) → indx(X1, X2)
from(mark(X)) → from(X)
from(active(X)) → from(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.

FROM(active(X)) → FROM(X)

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

Recursive Path Order [RPO].
Precedence:

active₁ > FROM₁

The following usable rules [FROCOS05] were oriented: none

(7) Obligation:

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

FROM(mark(X)) → FROM(X)

The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
mark(dbl(X)) → active(dbl(mark(X)))
mark(0) → active(0)
mark(s(X)) → active(s(X))
mark(dbls(X)) → active(dbls(mark(X)))
mark(nil) → active(nil)
mark(cons(X1, X2)) → active(cons(X1, X2))
mark(sel(X1, X2)) → active(sel(mark(X1), mark(X2)))
mark(indx(X1, X2)) → active(indx(mark(X1), X2))
mark(from(X)) → active(from(X))
dbl(mark(X)) → dbl(X)
dbl(active(X)) → dbl(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
dbls(mark(X)) → dbls(X)
dbls(active(X)) → dbls(X)
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
sel(mark(X1), X2) → sel(X1, X2)
sel(X1, mark(X2)) → sel(X1, X2)
sel(active(X1), X2) → sel(X1, X2)
sel(X1, active(X2)) → sel(X1, X2)
indx(mark(X1), X2) → indx(X1, X2)
indx(X1, mark(X2)) → indx(X1, X2)
indx(active(X1), X2) → indx(X1, X2)
indx(X1, active(X2)) → indx(X1, X2)
from(mark(X)) → from(X)
from(active(X)) → from(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.

FROM(mark(X)) → FROM(X)

The remaining pairs can at least be oriented weakly.
Used ordering: Recursive Path Order [RPO].
Precedence:

mark₁ > FROM₁

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(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
mark(dbl(X)) → active(dbl(mark(X)))
mark(0) → active(0)
mark(s(X)) → active(s(X))
mark(dbls(X)) → active(dbls(mark(X)))
mark(nil) → active(nil)
mark(cons(X1, X2)) → active(cons(X1, X2))
mark(sel(X1, X2)) → active(sel(mark(X1), mark(X2)))
mark(indx(X1, X2)) → active(indx(mark(X1), X2))
mark(from(X)) → active(from(X))
dbl(mark(X)) → dbl(X)
dbl(active(X)) → dbl(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
dbls(mark(X)) → dbls(X)
dbls(active(X)) → dbls(X)
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
sel(mark(X1), X2) → sel(X1, X2)
sel(X1, mark(X2)) → sel(X1, X2)
sel(active(X1), X2) → sel(X1, X2)
sel(X1, active(X2)) → sel(X1, X2)
indx(mark(X1), X2) → indx(X1, X2)
indx(X1, mark(X2)) → indx(X1, X2)
indx(active(X1), X2) → indx(X1, X2)
indx(X1, active(X2)) → indx(X1, X2)
from(mark(X)) → from(X)
from(active(X)) → from(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:

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

The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
mark(dbl(X)) → active(dbl(mark(X)))
mark(0) → active(0)
mark(s(X)) → active(s(X))
mark(dbls(X)) → active(dbls(mark(X)))
mark(nil) → active(nil)
mark(cons(X1, X2)) → active(cons(X1, X2))
mark(sel(X1, X2)) → active(sel(mark(X1), mark(X2)))
mark(indx(X1, X2)) → active(indx(mark(X1), X2))
mark(from(X)) → active(from(X))
dbl(mark(X)) → dbl(X)
dbl(active(X)) → dbl(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
dbls(mark(X)) → dbls(X)
dbls(active(X)) → dbls(X)
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
sel(mark(X1), X2) → sel(X1, X2)
sel(X1, mark(X2)) → sel(X1, X2)
sel(active(X1), X2) → sel(X1, X2)
sel(X1, active(X2)) → sel(X1, X2)
indx(mark(X1), X2) → indx(X1, X2)
indx(X1, mark(X2)) → indx(X1, X2)
indx(active(X1), X2) → indx(X1, X2)
indx(X1, active(X2)) → indx(X1, X2)
from(mark(X)) → from(X)
from(active(X)) → from(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.

INDX(X1, mark(X2)) → INDX(X1, X2)

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

Recursive Path Order [RPO].
Precedence:

mark₁ > INDX₁

The following usable rules [FROCOS05] were oriented: none

(14) Obligation:

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

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

The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
mark(dbl(X)) → active(dbl(mark(X)))
mark(0) → active(0)
mark(s(X)) → active(s(X))
mark(dbls(X)) → active(dbls(mark(X)))
mark(nil) → active(nil)
mark(cons(X1, X2)) → active(cons(X1, X2))
mark(sel(X1, X2)) → active(sel(mark(X1), mark(X2)))
mark(indx(X1, X2)) → active(indx(mark(X1), X2))
mark(from(X)) → active(from(X))
dbl(mark(X)) → dbl(X)
dbl(active(X)) → dbl(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
dbls(mark(X)) → dbls(X)
dbls(active(X)) → dbls(X)
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
sel(mark(X1), X2) → sel(X1, X2)
sel(X1, mark(X2)) → sel(X1, X2)
sel(active(X1), X2) → sel(X1, X2)
sel(X1, active(X2)) → sel(X1, X2)
indx(mark(X1), X2) → indx(X1, X2)
indx(X1, mark(X2)) → indx(X1, X2)
indx(active(X1), X2) → indx(X1, X2)
indx(X1, active(X2)) → indx(X1, X2)
from(mark(X)) → from(X)
from(active(X)) → from(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.

INDX(mark(X1), X2) → INDX(X1, X2)

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

Recursive Path Order [RPO].
Precedence:

mark₁ > INDX₂

The following usable rules [FROCOS05] were oriented: none

(16) Obligation:

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

INDX(active(X1), X2) → INDX(X1, X2)
INDX(X1, active(X2)) → INDX(X1, X2)

The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
mark(dbl(X)) → active(dbl(mark(X)))
mark(0) → active(0)
mark(s(X)) → active(s(X))
mark(dbls(X)) → active(dbls(mark(X)))
mark(nil) → active(nil)
mark(cons(X1, X2)) → active(cons(X1, X2))
mark(sel(X1, X2)) → active(sel(mark(X1), mark(X2)))
mark(indx(X1, X2)) → active(indx(mark(X1), X2))
mark(from(X)) → active(from(X))
dbl(mark(X)) → dbl(X)
dbl(active(X)) → dbl(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
dbls(mark(X)) → dbls(X)
dbls(active(X)) → dbls(X)
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
sel(mark(X1), X2) → sel(X1, X2)
sel(X1, mark(X2)) → sel(X1, X2)
sel(active(X1), X2) → sel(X1, X2)
sel(X1, active(X2)) → sel(X1, X2)
indx(mark(X1), X2) → indx(X1, X2)
indx(X1, mark(X2)) → indx(X1, X2)
indx(active(X1), X2) → indx(X1, X2)
indx(X1, active(X2)) → indx(X1, X2)
from(mark(X)) → from(X)
from(active(X)) → from(X)

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

(17) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

INDX(active(X1), X2) → INDX(X1, X2)

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

Recursive Path Order [RPO].
Precedence:

active₁ > INDX₁

The following usable rules [FROCOS05] were oriented: none

(18) Obligation:

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

INDX(X1, active(X2)) → INDX(X1, X2)

The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
mark(dbl(X)) → active(dbl(mark(X)))
mark(0) → active(0)
mark(s(X)) → active(s(X))
mark(dbls(X)) → active(dbls(mark(X)))
mark(nil) → active(nil)
mark(cons(X1, X2)) → active(cons(X1, X2))
mark(sel(X1, X2)) → active(sel(mark(X1), mark(X2)))
mark(indx(X1, X2)) → active(indx(mark(X1), X2))
mark(from(X)) → active(from(X))
dbl(mark(X)) → dbl(X)
dbl(active(X)) → dbl(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
dbls(mark(X)) → dbls(X)
dbls(active(X)) → dbls(X)
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
sel(mark(X1), X2) → sel(X1, X2)
sel(X1, mark(X2)) → sel(X1, X2)
sel(active(X1), X2) → sel(X1, X2)
sel(X1, active(X2)) → sel(X1, X2)
indx(mark(X1), X2) → indx(X1, X2)
indx(X1, mark(X2)) → indx(X1, X2)
indx(active(X1), X2) → indx(X1, X2)
indx(X1, active(X2)) → indx(X1, X2)
from(mark(X)) → from(X)
from(active(X)) → from(X)

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

(19) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

INDX(X1, active(X2)) → INDX(X1, X2)

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

Recursive Path Order [RPO].
Precedence:

active₁ > INDX₁

The following usable rules [FROCOS05] were oriented: none

(20) Obligation:

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

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
mark(dbl(X)) → active(dbl(mark(X)))
mark(0) → active(0)
mark(s(X)) → active(s(X))
mark(dbls(X)) → active(dbls(mark(X)))
mark(nil) → active(nil)
mark(cons(X1, X2)) → active(cons(X1, X2))
mark(sel(X1, X2)) → active(sel(mark(X1), mark(X2)))
mark(indx(X1, X2)) → active(indx(mark(X1), X2))
mark(from(X)) → active(from(X))
dbl(mark(X)) → dbl(X)
dbl(active(X)) → dbl(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
dbls(mark(X)) → dbls(X)
dbls(active(X)) → dbls(X)
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
sel(mark(X1), X2) → sel(X1, X2)
sel(X1, mark(X2)) → sel(X1, X2)
sel(active(X1), X2) → sel(X1, X2)
sel(X1, active(X2)) → sel(X1, X2)
indx(mark(X1), X2) → indx(X1, X2)
indx(X1, mark(X2)) → indx(X1, X2)
indx(active(X1), X2) → indx(X1, X2)
indx(X1, active(X2)) → indx(X1, X2)
from(mark(X)) → from(X)
from(active(X)) → from(X)

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

(21) PisEmptyProof (EQUIVALENT transformation)

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

(22) TRUE

(23) Obligation:

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

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

The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
mark(dbl(X)) → active(dbl(mark(X)))
mark(0) → active(0)
mark(s(X)) → active(s(X))
mark(dbls(X)) → active(dbls(mark(X)))
mark(nil) → active(nil)
mark(cons(X1, X2)) → active(cons(X1, X2))
mark(sel(X1, X2)) → active(sel(mark(X1), mark(X2)))
mark(indx(X1, X2)) → active(indx(mark(X1), X2))
mark(from(X)) → active(from(X))
dbl(mark(X)) → dbl(X)
dbl(active(X)) → dbl(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
dbls(mark(X)) → dbls(X)
dbls(active(X)) → dbls(X)
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
sel(mark(X1), X2) → sel(X1, X2)
sel(X1, mark(X2)) → sel(X1, X2)
sel(active(X1), X2) → sel(X1, X2)
sel(X1, active(X2)) → sel(X1, X2)
indx(mark(X1), X2) → indx(X1, X2)
indx(X1, mark(X2)) → indx(X1, X2)
indx(active(X1), X2) → indx(X1, X2)
indx(X1, active(X2)) → indx(X1, X2)
from(mark(X)) → from(X)
from(active(X)) → from(X)

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

(24) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

SEL(X1, mark(X2)) → SEL(X1, X2)

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

Recursive Path Order [RPO].
Precedence:

mark₁ > SEL₁

The following usable rules [FROCOS05] were oriented: none

(25) Obligation:

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

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

The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
mark(dbl(X)) → active(dbl(mark(X)))
mark(0) → active(0)
mark(s(X)) → active(s(X))
mark(dbls(X)) → active(dbls(mark(X)))
mark(nil) → active(nil)
mark(cons(X1, X2)) → active(cons(X1, X2))
mark(sel(X1, X2)) → active(sel(mark(X1), mark(X2)))
mark(indx(X1, X2)) → active(indx(mark(X1), X2))
mark(from(X)) → active(from(X))
dbl(mark(X)) → dbl(X)
dbl(active(X)) → dbl(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
dbls(mark(X)) → dbls(X)
dbls(active(X)) → dbls(X)
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
sel(mark(X1), X2) → sel(X1, X2)
sel(X1, mark(X2)) → sel(X1, X2)
sel(active(X1), X2) → sel(X1, X2)
sel(X1, active(X2)) → sel(X1, X2)
indx(mark(X1), X2) → indx(X1, X2)
indx(X1, mark(X2)) → indx(X1, X2)
indx(active(X1), X2) → indx(X1, X2)
indx(X1, active(X2)) → indx(X1, X2)
from(mark(X)) → from(X)
from(active(X)) → from(X)

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

(26) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

SEL(mark(X1), X2) → SEL(X1, X2)

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

Recursive Path Order [RPO].
Precedence:

mark₁ > SEL₂

The following usable rules [FROCOS05] were oriented: none

(27) Obligation:

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

SEL(active(X1), X2) → SEL(X1, X2)
SEL(X1, active(X2)) → SEL(X1, X2)

The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
mark(dbl(X)) → active(dbl(mark(X)))
mark(0) → active(0)
mark(s(X)) → active(s(X))
mark(dbls(X)) → active(dbls(mark(X)))
mark(nil) → active(nil)
mark(cons(X1, X2)) → active(cons(X1, X2))
mark(sel(X1, X2)) → active(sel(mark(X1), mark(X2)))
mark(indx(X1, X2)) → active(indx(mark(X1), X2))
mark(from(X)) → active(from(X))
dbl(mark(X)) → dbl(X)
dbl(active(X)) → dbl(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
dbls(mark(X)) → dbls(X)
dbls(active(X)) → dbls(X)
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
sel(mark(X1), X2) → sel(X1, X2)
sel(X1, mark(X2)) → sel(X1, X2)
sel(active(X1), X2) → sel(X1, X2)
sel(X1, active(X2)) → sel(X1, X2)
indx(mark(X1), X2) → indx(X1, X2)
indx(X1, mark(X2)) → indx(X1, X2)
indx(active(X1), X2) → indx(X1, X2)
indx(X1, active(X2)) → indx(X1, X2)
from(mark(X)) → from(X)
from(active(X)) → from(X)

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

(28) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

SEL(active(X1), X2) → SEL(X1, X2)

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

Recursive Path Order [RPO].
Precedence:

active₁ > SEL₁

The following usable rules [FROCOS05] were oriented: none

(29) Obligation:

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

SEL(X1, active(X2)) → SEL(X1, X2)

The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
mark(dbl(X)) → active(dbl(mark(X)))
mark(0) → active(0)
mark(s(X)) → active(s(X))
mark(dbls(X)) → active(dbls(mark(X)))
mark(nil) → active(nil)
mark(cons(X1, X2)) → active(cons(X1, X2))
mark(sel(X1, X2)) → active(sel(mark(X1), mark(X2)))
mark(indx(X1, X2)) → active(indx(mark(X1), X2))
mark(from(X)) → active(from(X))
dbl(mark(X)) → dbl(X)
dbl(active(X)) → dbl(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
dbls(mark(X)) → dbls(X)
dbls(active(X)) → dbls(X)
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
sel(mark(X1), X2) → sel(X1, X2)
sel(X1, mark(X2)) → sel(X1, X2)
sel(active(X1), X2) → sel(X1, X2)
sel(X1, active(X2)) → sel(X1, X2)
indx(mark(X1), X2) → indx(X1, X2)
indx(X1, mark(X2)) → indx(X1, X2)
indx(active(X1), X2) → indx(X1, X2)
indx(X1, active(X2)) → indx(X1, X2)
from(mark(X)) → from(X)
from(active(X)) → from(X)

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

(30) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

SEL(X1, active(X2)) → SEL(X1, X2)

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

Recursive Path Order [RPO].
Precedence:

active₁ > SEL₁

The following usable rules [FROCOS05] were oriented: none

(31) Obligation:

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

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
mark(dbl(X)) → active(dbl(mark(X)))
mark(0) → active(0)
mark(s(X)) → active(s(X))
mark(dbls(X)) → active(dbls(mark(X)))
mark(nil) → active(nil)
mark(cons(X1, X2)) → active(cons(X1, X2))
mark(sel(X1, X2)) → active(sel(mark(X1), mark(X2)))
mark(indx(X1, X2)) → active(indx(mark(X1), X2))
mark(from(X)) → active(from(X))
dbl(mark(X)) → dbl(X)
dbl(active(X)) → dbl(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
dbls(mark(X)) → dbls(X)
dbls(active(X)) → dbls(X)
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
sel(mark(X1), X2) → sel(X1, X2)
sel(X1, mark(X2)) → sel(X1, X2)
sel(active(X1), X2) → sel(X1, X2)
sel(X1, active(X2)) → sel(X1, X2)
indx(mark(X1), X2) → indx(X1, X2)
indx(X1, mark(X2)) → indx(X1, X2)
indx(active(X1), X2) → indx(X1, X2)
indx(X1, active(X2)) → indx(X1, X2)
from(mark(X)) → from(X)
from(active(X)) → from(X)

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

(32) PisEmptyProof (EQUIVALENT transformation)

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

(33) TRUE

(34) Obligation:

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

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

The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
mark(dbl(X)) → active(dbl(mark(X)))
mark(0) → active(0)
mark(s(X)) → active(s(X))
mark(dbls(X)) → active(dbls(mark(X)))
mark(nil) → active(nil)
mark(cons(X1, X2)) → active(cons(X1, X2))
mark(sel(X1, X2)) → active(sel(mark(X1), mark(X2)))
mark(indx(X1, X2)) → active(indx(mark(X1), X2))
mark(from(X)) → active(from(X))
dbl(mark(X)) → dbl(X)
dbl(active(X)) → dbl(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
dbls(mark(X)) → dbls(X)
dbls(active(X)) → dbls(X)
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
sel(mark(X1), X2) → sel(X1, X2)
sel(X1, mark(X2)) → sel(X1, X2)
sel(active(X1), X2) → sel(X1, X2)
sel(X1, active(X2)) → sel(X1, X2)
indx(mark(X1), X2) → indx(X1, X2)
indx(X1, mark(X2)) → indx(X1, X2)
indx(active(X1), X2) → indx(X1, X2)
indx(X1, active(X2)) → indx(X1, X2)
from(mark(X)) → from(X)
from(active(X)) → from(X)

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

(35) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

CONS(X1, mark(X2)) → CONS(X1, X2)

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

Recursive Path Order [RPO].
Precedence:

mark₁ > CONS₁

The following usable rules [FROCOS05] were oriented: none

(36) Obligation:

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

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

The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
mark(dbl(X)) → active(dbl(mark(X)))
mark(0) → active(0)
mark(s(X)) → active(s(X))
mark(dbls(X)) → active(dbls(mark(X)))
mark(nil) → active(nil)
mark(cons(X1, X2)) → active(cons(X1, X2))
mark(sel(X1, X2)) → active(sel(mark(X1), mark(X2)))
mark(indx(X1, X2)) → active(indx(mark(X1), X2))
mark(from(X)) → active(from(X))
dbl(mark(X)) → dbl(X)
dbl(active(X)) → dbl(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
dbls(mark(X)) → dbls(X)
dbls(active(X)) → dbls(X)
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
sel(mark(X1), X2) → sel(X1, X2)
sel(X1, mark(X2)) → sel(X1, X2)
sel(active(X1), X2) → sel(X1, X2)
sel(X1, active(X2)) → sel(X1, X2)
indx(mark(X1), X2) → indx(X1, X2)
indx(X1, mark(X2)) → indx(X1, X2)
indx(active(X1), X2) → indx(X1, X2)
indx(X1, active(X2)) → indx(X1, X2)
from(mark(X)) → from(X)
from(active(X)) → from(X)

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

(37) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

CONS(mark(X1), X2) → CONS(X1, X2)

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

Recursive Path Order [RPO].
Precedence:

mark₁ > CONS₂

The following usable rules [FROCOS05] were oriented: none

(38) Obligation:

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

CONS(active(X1), X2) → CONS(X1, X2)
CONS(X1, active(X2)) → CONS(X1, X2)

The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
mark(dbl(X)) → active(dbl(mark(X)))
mark(0) → active(0)
mark(s(X)) → active(s(X))
mark(dbls(X)) → active(dbls(mark(X)))
mark(nil) → active(nil)
mark(cons(X1, X2)) → active(cons(X1, X2))
mark(sel(X1, X2)) → active(sel(mark(X1), mark(X2)))
mark(indx(X1, X2)) → active(indx(mark(X1), X2))
mark(from(X)) → active(from(X))
dbl(mark(X)) → dbl(X)
dbl(active(X)) → dbl(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
dbls(mark(X)) → dbls(X)
dbls(active(X)) → dbls(X)
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
sel(mark(X1), X2) → sel(X1, X2)
sel(X1, mark(X2)) → sel(X1, X2)
sel(active(X1), X2) → sel(X1, X2)
sel(X1, active(X2)) → sel(X1, X2)
indx(mark(X1), X2) → indx(X1, X2)
indx(X1, mark(X2)) → indx(X1, X2)
indx(active(X1), X2) → indx(X1, X2)
indx(X1, active(X2)) → indx(X1, X2)
from(mark(X)) → from(X)
from(active(X)) → from(X)

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

(39) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

CONS(active(X1), X2) → CONS(X1, X2)

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

Recursive Path Order [RPO].
Precedence:

active₁ > CONS₁

The following usable rules [FROCOS05] were oriented: none

(40) Obligation:

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

CONS(X1, active(X2)) → CONS(X1, X2)

The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
mark(dbl(X)) → active(dbl(mark(X)))
mark(0) → active(0)
mark(s(X)) → active(s(X))
mark(dbls(X)) → active(dbls(mark(X)))
mark(nil) → active(nil)
mark(cons(X1, X2)) → active(cons(X1, X2))
mark(sel(X1, X2)) → active(sel(mark(X1), mark(X2)))
mark(indx(X1, X2)) → active(indx(mark(X1), X2))
mark(from(X)) → active(from(X))
dbl(mark(X)) → dbl(X)
dbl(active(X)) → dbl(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
dbls(mark(X)) → dbls(X)
dbls(active(X)) → dbls(X)
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
sel(mark(X1), X2) → sel(X1, X2)
sel(X1, mark(X2)) → sel(X1, X2)
sel(active(X1), X2) → sel(X1, X2)
sel(X1, active(X2)) → sel(X1, X2)
indx(mark(X1), X2) → indx(X1, X2)
indx(X1, mark(X2)) → indx(X1, X2)
indx(active(X1), X2) → indx(X1, X2)
indx(X1, active(X2)) → indx(X1, X2)
from(mark(X)) → from(X)
from(active(X)) → from(X)

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

(41) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

CONS(X1, active(X2)) → CONS(X1, X2)

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

Recursive Path Order [RPO].
Precedence:

active₁ > CONS₁

The following usable rules [FROCOS05] were oriented: none

(42) Obligation:

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

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
mark(dbl(X)) → active(dbl(mark(X)))
mark(0) → active(0)
mark(s(X)) → active(s(X))
mark(dbls(X)) → active(dbls(mark(X)))
mark(nil) → active(nil)
mark(cons(X1, X2)) → active(cons(X1, X2))
mark(sel(X1, X2)) → active(sel(mark(X1), mark(X2)))
mark(indx(X1, X2)) → active(indx(mark(X1), X2))
mark(from(X)) → active(from(X))
dbl(mark(X)) → dbl(X)
dbl(active(X)) → dbl(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
dbls(mark(X)) → dbls(X)
dbls(active(X)) → dbls(X)
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
sel(mark(X1), X2) → sel(X1, X2)
sel(X1, mark(X2)) → sel(X1, X2)
sel(active(X1), X2) → sel(X1, X2)
sel(X1, active(X2)) → sel(X1, X2)
indx(mark(X1), X2) → indx(X1, X2)
indx(X1, mark(X2)) → indx(X1, X2)
indx(active(X1), X2) → indx(X1, X2)
indx(X1, active(X2)) → indx(X1, X2)
from(mark(X)) → from(X)
from(active(X)) → from(X)

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

(43) PisEmptyProof (EQUIVALENT transformation)

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

(44) TRUE

(45) Obligation:

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

DBLS(active(X)) → DBLS(X)
DBLS(mark(X)) → DBLS(X)

The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
mark(dbl(X)) → active(dbl(mark(X)))
mark(0) → active(0)
mark(s(X)) → active(s(X))
mark(dbls(X)) → active(dbls(mark(X)))
mark(nil) → active(nil)
mark(cons(X1, X2)) → active(cons(X1, X2))
mark(sel(X1, X2)) → active(sel(mark(X1), mark(X2)))
mark(indx(X1, X2)) → active(indx(mark(X1), X2))
mark(from(X)) → active(from(X))
dbl(mark(X)) → dbl(X)
dbl(active(X)) → dbl(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
dbls(mark(X)) → dbls(X)
dbls(active(X)) → dbls(X)
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
sel(mark(X1), X2) → sel(X1, X2)
sel(X1, mark(X2)) → sel(X1, X2)
sel(active(X1), X2) → sel(X1, X2)
sel(X1, active(X2)) → sel(X1, X2)
indx(mark(X1), X2) → indx(X1, X2)
indx(X1, mark(X2)) → indx(X1, X2)
indx(active(X1), X2) → indx(X1, X2)
indx(X1, active(X2)) → indx(X1, X2)
from(mark(X)) → from(X)
from(active(X)) → from(X)

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

(46) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

DBLS(active(X)) → DBLS(X)

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

Recursive Path Order [RPO].
Precedence:

active₁ > DBLS₁

The following usable rules [FROCOS05] were oriented: none

(47) Obligation:

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

DBLS(mark(X)) → DBLS(X)

The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
mark(dbl(X)) → active(dbl(mark(X)))
mark(0) → active(0)
mark(s(X)) → active(s(X))
mark(dbls(X)) → active(dbls(mark(X)))
mark(nil) → active(nil)
mark(cons(X1, X2)) → active(cons(X1, X2))
mark(sel(X1, X2)) → active(sel(mark(X1), mark(X2)))
mark(indx(X1, X2)) → active(indx(mark(X1), X2))
mark(from(X)) → active(from(X))
dbl(mark(X)) → dbl(X)
dbl(active(X)) → dbl(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
dbls(mark(X)) → dbls(X)
dbls(active(X)) → dbls(X)
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
sel(mark(X1), X2) → sel(X1, X2)
sel(X1, mark(X2)) → sel(X1, X2)
sel(active(X1), X2) → sel(X1, X2)
sel(X1, active(X2)) → sel(X1, X2)
indx(mark(X1), X2) → indx(X1, X2)
indx(X1, mark(X2)) → indx(X1, X2)
indx(active(X1), X2) → indx(X1, X2)
indx(X1, active(X2)) → indx(X1, X2)
from(mark(X)) → from(X)
from(active(X)) → from(X)

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

(48) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

DBLS(mark(X)) → DBLS(X)

The remaining pairs can at least be oriented weakly.
Used ordering: Recursive Path Order [RPO].
Precedence:

mark₁ > DBLS₁

The following usable rules [FROCOS05] were oriented: none

(49) Obligation:

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

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
mark(dbl(X)) → active(dbl(mark(X)))
mark(0) → active(0)
mark(s(X)) → active(s(X))
mark(dbls(X)) → active(dbls(mark(X)))
mark(nil) → active(nil)
mark(cons(X1, X2)) → active(cons(X1, X2))
mark(sel(X1, X2)) → active(sel(mark(X1), mark(X2)))
mark(indx(X1, X2)) → active(indx(mark(X1), X2))
mark(from(X)) → active(from(X))
dbl(mark(X)) → dbl(X)
dbl(active(X)) → dbl(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
dbls(mark(X)) → dbls(X)
dbls(active(X)) → dbls(X)
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
sel(mark(X1), X2) → sel(X1, X2)
sel(X1, mark(X2)) → sel(X1, X2)
sel(active(X1), X2) → sel(X1, X2)
sel(X1, active(X2)) → sel(X1, X2)
indx(mark(X1), X2) → indx(X1, X2)
indx(X1, mark(X2)) → indx(X1, X2)
indx(active(X1), X2) → indx(X1, X2)
indx(X1, active(X2)) → indx(X1, X2)
from(mark(X)) → from(X)
from(active(X)) → from(X)

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

(50) PisEmptyProof (EQUIVALENT transformation)

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

(51) TRUE

(52) Obligation:

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

S(active(X)) → S(X)
S(mark(X)) → S(X)

The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
mark(dbl(X)) → active(dbl(mark(X)))
mark(0) → active(0)
mark(s(X)) → active(s(X))
mark(dbls(X)) → active(dbls(mark(X)))
mark(nil) → active(nil)
mark(cons(X1, X2)) → active(cons(X1, X2))
mark(sel(X1, X2)) → active(sel(mark(X1), mark(X2)))
mark(indx(X1, X2)) → active(indx(mark(X1), X2))
mark(from(X)) → active(from(X))
dbl(mark(X)) → dbl(X)
dbl(active(X)) → dbl(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
dbls(mark(X)) → dbls(X)
dbls(active(X)) → dbls(X)
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
sel(mark(X1), X2) → sel(X1, X2)
sel(X1, mark(X2)) → sel(X1, X2)
sel(active(X1), X2) → sel(X1, X2)
sel(X1, active(X2)) → sel(X1, X2)
indx(mark(X1), X2) → indx(X1, X2)
indx(X1, mark(X2)) → indx(X1, X2)
indx(active(X1), X2) → indx(X1, X2)
indx(X1, active(X2)) → indx(X1, X2)
from(mark(X)) → from(X)
from(active(X)) → from(X)

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

(53) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

S(active(X)) → S(X)

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

Recursive Path Order [RPO].
Precedence:

active₁ > S₁

The following usable rules [FROCOS05] were oriented: none

(54) Obligation:

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

S(mark(X)) → S(X)

The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
mark(dbl(X)) → active(dbl(mark(X)))
mark(0) → active(0)
mark(s(X)) → active(s(X))
mark(dbls(X)) → active(dbls(mark(X)))
mark(nil) → active(nil)
mark(cons(X1, X2)) → active(cons(X1, X2))
mark(sel(X1, X2)) → active(sel(mark(X1), mark(X2)))
mark(indx(X1, X2)) → active(indx(mark(X1), X2))
mark(from(X)) → active(from(X))
dbl(mark(X)) → dbl(X)
dbl(active(X)) → dbl(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
dbls(mark(X)) → dbls(X)
dbls(active(X)) → dbls(X)
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
sel(mark(X1), X2) → sel(X1, X2)
sel(X1, mark(X2)) → sel(X1, X2)
sel(active(X1), X2) → sel(X1, X2)
sel(X1, active(X2)) → sel(X1, X2)
indx(mark(X1), X2) → indx(X1, X2)
indx(X1, mark(X2)) → indx(X1, X2)
indx(active(X1), X2) → indx(X1, X2)
indx(X1, active(X2)) → indx(X1, X2)
from(mark(X)) → from(X)
from(active(X)) → from(X)

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

(55) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

S(mark(X)) → S(X)

The remaining pairs can at least be oriented weakly.
Used ordering: Recursive Path Order [RPO].
Precedence:

mark₁ > S₁

The following usable rules [FROCOS05] were oriented: none

(56) Obligation:

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

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
mark(dbl(X)) → active(dbl(mark(X)))
mark(0) → active(0)
mark(s(X)) → active(s(X))
mark(dbls(X)) → active(dbls(mark(X)))
mark(nil) → active(nil)
mark(cons(X1, X2)) → active(cons(X1, X2))
mark(sel(X1, X2)) → active(sel(mark(X1), mark(X2)))
mark(indx(X1, X2)) → active(indx(mark(X1), X2))
mark(from(X)) → active(from(X))
dbl(mark(X)) → dbl(X)
dbl(active(X)) → dbl(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
dbls(mark(X)) → dbls(X)
dbls(active(X)) → dbls(X)
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
sel(mark(X1), X2) → sel(X1, X2)
sel(X1, mark(X2)) → sel(X1, X2)
sel(active(X1), X2) → sel(X1, X2)
sel(X1, active(X2)) → sel(X1, X2)
indx(mark(X1), X2) → indx(X1, X2)
indx(X1, mark(X2)) → indx(X1, X2)
indx(active(X1), X2) → indx(X1, X2)
indx(X1, active(X2)) → indx(X1, X2)
from(mark(X)) → from(X)
from(active(X)) → from(X)

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

(57) PisEmptyProof (EQUIVALENT transformation)

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

(58) TRUE

(59) Obligation:

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

DBL(active(X)) → DBL(X)
DBL(mark(X)) → DBL(X)

The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
mark(dbl(X)) → active(dbl(mark(X)))
mark(0) → active(0)
mark(s(X)) → active(s(X))
mark(dbls(X)) → active(dbls(mark(X)))
mark(nil) → active(nil)
mark(cons(X1, X2)) → active(cons(X1, X2))
mark(sel(X1, X2)) → active(sel(mark(X1), mark(X2)))
mark(indx(X1, X2)) → active(indx(mark(X1), X2))
mark(from(X)) → active(from(X))
dbl(mark(X)) → dbl(X)
dbl(active(X)) → dbl(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
dbls(mark(X)) → dbls(X)
dbls(active(X)) → dbls(X)
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
sel(mark(X1), X2) → sel(X1, X2)
sel(X1, mark(X2)) → sel(X1, X2)
sel(active(X1), X2) → sel(X1, X2)
sel(X1, active(X2)) → sel(X1, X2)
indx(mark(X1), X2) → indx(X1, X2)
indx(X1, mark(X2)) → indx(X1, X2)
indx(active(X1), X2) → indx(X1, X2)
indx(X1, active(X2)) → indx(X1, X2)
from(mark(X)) → from(X)
from(active(X)) → from(X)

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

(60) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

DBL(active(X)) → DBL(X)

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

Recursive Path Order [RPO].
Precedence:

active₁ > DBL₁

The following usable rules [FROCOS05] were oriented: none

(61) Obligation:

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

DBL(mark(X)) → DBL(X)

The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
mark(dbl(X)) → active(dbl(mark(X)))
mark(0) → active(0)
mark(s(X)) → active(s(X))
mark(dbls(X)) → active(dbls(mark(X)))
mark(nil) → active(nil)
mark(cons(X1, X2)) → active(cons(X1, X2))
mark(sel(X1, X2)) → active(sel(mark(X1), mark(X2)))
mark(indx(X1, X2)) → active(indx(mark(X1), X2))
mark(from(X)) → active(from(X))
dbl(mark(X)) → dbl(X)
dbl(active(X)) → dbl(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
dbls(mark(X)) → dbls(X)
dbls(active(X)) → dbls(X)
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
sel(mark(X1), X2) → sel(X1, X2)
sel(X1, mark(X2)) → sel(X1, X2)
sel(active(X1), X2) → sel(X1, X2)
sel(X1, active(X2)) → sel(X1, X2)
indx(mark(X1), X2) → indx(X1, X2)
indx(X1, mark(X2)) → indx(X1, X2)
indx(active(X1), X2) → indx(X1, X2)
indx(X1, active(X2)) → indx(X1, X2)
from(mark(X)) → from(X)
from(active(X)) → from(X)

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

(62) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

DBL(mark(X)) → DBL(X)

The remaining pairs can at least be oriented weakly.
Used ordering: Recursive Path Order [RPO].
Precedence:

mark₁ > DBL₁

The following usable rules [FROCOS05] were oriented: none

(63) Obligation:

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

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
mark(dbl(X)) → active(dbl(mark(X)))
mark(0) → active(0)
mark(s(X)) → active(s(X))
mark(dbls(X)) → active(dbls(mark(X)))
mark(nil) → active(nil)
mark(cons(X1, X2)) → active(cons(X1, X2))
mark(sel(X1, X2)) → active(sel(mark(X1), mark(X2)))
mark(indx(X1, X2)) → active(indx(mark(X1), X2))
mark(from(X)) → active(from(X))
dbl(mark(X)) → dbl(X)
dbl(active(X)) → dbl(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
dbls(mark(X)) → dbls(X)
dbls(active(X)) → dbls(X)
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
sel(mark(X1), X2) → sel(X1, X2)
sel(X1, mark(X2)) → sel(X1, X2)
sel(active(X1), X2) → sel(X1, X2)
sel(X1, active(X2)) → sel(X1, X2)
indx(mark(X1), X2) → indx(X1, X2)
indx(X1, mark(X2)) → indx(X1, X2)
indx(active(X1), X2) → indx(X1, X2)
indx(X1, active(X2)) → indx(X1, X2)
from(mark(X)) → from(X)
from(active(X)) → from(X)

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

(64) PisEmptyProof (EQUIVALENT transformation)

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

(65) TRUE

(66) Obligation:

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

ACTIVE(dbl(s(X))) → MARK(s(s(dbl(X))))
MARK(dbl(X)) → ACTIVE(dbl(mark(X)))
ACTIVE(dbls(cons(X, Y))) → MARK(cons(dbl(X), dbls(Y)))
MARK(dbl(X)) → MARK(X)
MARK(s(X)) → ACTIVE(s(X))
ACTIVE(sel(0, cons(X, Y))) → MARK(X)
MARK(dbls(X)) → ACTIVE(dbls(mark(X)))
ACTIVE(sel(s(X), cons(Y, Z))) → MARK(sel(X, Z))
MARK(dbls(X)) → MARK(X)
MARK(cons(X1, X2)) → ACTIVE(cons(X1, X2))
ACTIVE(indx(cons(X, Y), Z)) → MARK(cons(sel(X, Z), indx(Y, Z)))
MARK(sel(X1, X2)) → ACTIVE(sel(mark(X1), mark(X2)))
ACTIVE(from(X)) → MARK(cons(X, from(s(X))))
MARK(sel(X1, X2)) → MARK(X1)
MARK(sel(X1, X2)) → MARK(X2)
MARK(indx(X1, X2)) → ACTIVE(indx(mark(X1), X2))
MARK(indx(X1, X2)) → MARK(X1)
MARK(from(X)) → ACTIVE(from(X))

The TRS R consists of the following rules:

active(dbl(0)) → mark(0)
active(dbl(s(X))) → mark(s(s(dbl(X))))
active(dbls(nil)) → mark(nil)
active(dbls(cons(X, Y))) → mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) → mark(X)
active(sel(s(X), cons(Y, Z))) → mark(sel(X, Z))
active(indx(nil, X)) → mark(nil)
active(indx(cons(X, Y), Z)) → mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) → mark(cons(X, from(s(X))))
mark(dbl(X)) → active(dbl(mark(X)))
mark(0) → active(0)
mark(s(X)) → active(s(X))
mark(dbls(X)) → active(dbls(mark(X)))
mark(nil) → active(nil)
mark(cons(X1, X2)) → active(cons(X1, X2))
mark(sel(X1, X2)) → active(sel(mark(X1), mark(X2)))
mark(indx(X1, X2)) → active(indx(mark(X1), X2))
mark(from(X)) → active(from(X))
dbl(mark(X)) → dbl(X)
dbl(active(X)) → dbl(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
dbls(mark(X)) → dbls(X)
dbls(active(X)) → dbls(X)
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
sel(mark(X1), X2) → sel(X1, X2)
sel(X1, mark(X2)) → sel(X1, X2)
sel(active(X1), X2) → sel(X1, X2)
sel(X1, active(X2)) → sel(X1, X2)
indx(mark(X1), X2) → indx(X1, X2)
indx(X1, mark(X2)) → indx(X1, X2)
indx(active(X1), X2) → indx(X1, X2)
indx(X1, active(X2)) → indx(X1, X2)
from(mark(X)) → from(X)
from(active(X)) → from(X)

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