(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))))
active(dbl1(0)) → mark(01)
active(dbl1(s(X))) → mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) → mark(X)
active(sel1(s(X), cons(Y, Z))) → mark(sel1(X, Z))
active(quote(0)) → mark(01)
active(quote(s(X))) → mark(s1(quote(X)))
active(quote(dbl(X))) → mark(dbl1(X))
active(quote(sel(X, Y))) → mark(sel1(X, Y))
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))
mark(dbl1(X)) → active(dbl1(mark(X)))
mark(01) → active(01)
mark(s1(X)) → active(s1(mark(X)))
mark(sel1(X1, X2)) → active(sel1(mark(X1), mark(X2)))
mark(quote(X)) → active(quote(mark(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)
dbl1(mark(X)) → dbl1(X)
dbl1(active(X)) → dbl1(X)
s1(mark(X)) → s1(X)
s1(active(X)) → s1(X)
sel1(mark(X1), X2) → sel1(X1, X2)
sel1(X1, mark(X2)) → sel1(X1, X2)
sel1(active(X1), X2) → sel1(X1, X2)
sel1(X1, active(X2)) → sel1(X1, X2)
quote(mark(X)) → quote(X)
quote(active(X)) → quote(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)
ACTIVE(dbl1(0)) → MARK(01)
ACTIVE(dbl1(s(X))) → MARK(s1(s1(dbl1(X))))
ACTIVE(dbl1(s(X))) → S1(s1(dbl1(X)))
ACTIVE(dbl1(s(X))) → S1(dbl1(X))
ACTIVE(dbl1(s(X))) → DBL1(X)
ACTIVE(sel1(0, cons(X, Y))) → MARK(X)
ACTIVE(sel1(s(X), cons(Y, Z))) → MARK(sel1(X, Z))
ACTIVE(sel1(s(X), cons(Y, Z))) → SEL1(X, Z)
ACTIVE(quote(0)) → MARK(01)
ACTIVE(quote(s(X))) → MARK(s1(quote(X)))
ACTIVE(quote(s(X))) → S1(quote(X))
ACTIVE(quote(s(X))) → QUOTE(X)
ACTIVE(quote(dbl(X))) → MARK(dbl1(X))
ACTIVE(quote(dbl(X))) → DBL1(X)
ACTIVE(quote(sel(X, Y))) → MARK(sel1(X, Y))
ACTIVE(quote(sel(X, Y))) → SEL1(X, Y)
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))
MARK(dbl1(X)) → ACTIVE(dbl1(mark(X)))
MARK(dbl1(X)) → DBL1(mark(X))
MARK(dbl1(X)) → MARK(X)
MARK(01) → ACTIVE(01)
MARK(s1(X)) → ACTIVE(s1(mark(X)))
MARK(s1(X)) → S1(mark(X))
MARK(s1(X)) → MARK(X)
MARK(sel1(X1, X2)) → ACTIVE(sel1(mark(X1), mark(X2)))
MARK(sel1(X1, X2)) → SEL1(mark(X1), mark(X2))
MARK(sel1(X1, X2)) → MARK(X1)
MARK(sel1(X1, X2)) → MARK(X2)
MARK(quote(X)) → ACTIVE(quote(mark(X)))
MARK(quote(X)) → QUOTE(mark(X))
MARK(quote(X)) → MARK(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)
DBL1(mark(X)) → DBL1(X)
DBL1(active(X)) → DBL1(X)
S1(mark(X)) → S1(X)
S1(active(X)) → S1(X)
SEL1(mark(X1), X2) → SEL1(X1, X2)
SEL1(X1, mark(X2)) → SEL1(X1, X2)
SEL1(active(X1), X2) → SEL1(X1, X2)
SEL1(X1, active(X2)) → SEL1(X1, X2)
QUOTE(mark(X)) → QUOTE(X)
QUOTE(active(X)) → QUOTE(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))))
active(dbl1(0)) → mark(01)
active(dbl1(s(X))) → mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) → mark(X)
active(sel1(s(X), cons(Y, Z))) → mark(sel1(X, Z))
active(quote(0)) → mark(01)
active(quote(s(X))) → mark(s1(quote(X)))
active(quote(dbl(X))) → mark(dbl1(X))
active(quote(sel(X, Y))) → mark(sel1(X, Y))
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))
mark(dbl1(X)) → active(dbl1(mark(X)))
mark(01) → active(01)
mark(s1(X)) → active(s1(mark(X)))
mark(sel1(X1, X2)) → active(sel1(mark(X1), mark(X2)))
mark(quote(X)) → active(quote(mark(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)
dbl1(mark(X)) → dbl1(X)
dbl1(active(X)) → dbl1(X)
s1(mark(X)) → s1(X)
s1(active(X)) → s1(X)
sel1(mark(X1), X2) → sel1(X1, X2)
sel1(X1, mark(X2)) → sel1(X1, X2)
sel1(active(X1), X2) → sel1(X1, X2)
sel1(X1, active(X2)) → sel1(X1, X2)
quote(mark(X)) → quote(X)
quote(active(X)) → quote(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 12 SCCs with 37 less nodes.

(4) Complex Obligation (AND)

(5) Obligation:

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

QUOTE(active(X)) → QUOTE(X)
QUOTE(mark(X)) → QUOTE(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))))
active(dbl1(0)) → mark(01)
active(dbl1(s(X))) → mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) → mark(X)
active(sel1(s(X), cons(Y, Z))) → mark(sel1(X, Z))
active(quote(0)) → mark(01)
active(quote(s(X))) → mark(s1(quote(X)))
active(quote(dbl(X))) → mark(dbl1(X))
active(quote(sel(X, Y))) → mark(sel1(X, Y))
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))
mark(dbl1(X)) → active(dbl1(mark(X)))
mark(01) → active(01)
mark(s1(X)) → active(s1(mark(X)))
mark(sel1(X1, X2)) → active(sel1(mark(X1), mark(X2)))
mark(quote(X)) → active(quote(mark(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)
dbl1(mark(X)) → dbl1(X)
dbl1(active(X)) → dbl1(X)
s1(mark(X)) → s1(X)
s1(active(X)) → s1(X)
sel1(mark(X1), X2) → sel1(X1, X2)
sel1(X1, mark(X2)) → sel1(X1, X2)
sel1(active(X1), X2) → sel1(X1, X2)
sel1(X1, active(X2)) → sel1(X1, X2)
quote(mark(X)) → quote(X)
quote(active(X)) → quote(X)

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

(6) Obligation:

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

SEL1(X1, mark(X2)) → SEL1(X1, X2)
SEL1(mark(X1), X2) → SEL1(X1, X2)
SEL1(active(X1), X2) → SEL1(X1, X2)
SEL1(X1, active(X2)) → SEL1(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))))
active(dbl1(0)) → mark(01)
active(dbl1(s(X))) → mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) → mark(X)
active(sel1(s(X), cons(Y, Z))) → mark(sel1(X, Z))
active(quote(0)) → mark(01)
active(quote(s(X))) → mark(s1(quote(X)))
active(quote(dbl(X))) → mark(dbl1(X))
active(quote(sel(X, Y))) → mark(sel1(X, Y))
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))
mark(dbl1(X)) → active(dbl1(mark(X)))
mark(01) → active(01)
mark(s1(X)) → active(s1(mark(X)))
mark(sel1(X1, X2)) → active(sel1(mark(X1), mark(X2)))
mark(quote(X)) → active(quote(mark(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)
dbl1(mark(X)) → dbl1(X)
dbl1(active(X)) → dbl1(X)
s1(mark(X)) → s1(X)
s1(active(X)) → s1(X)
sel1(mark(X1), X2) → sel1(X1, X2)
sel1(X1, mark(X2)) → sel1(X1, X2)
sel1(active(X1), X2) → sel1(X1, X2)
sel1(X1, active(X2)) → sel1(X1, X2)
quote(mark(X)) → quote(X)
quote(active(X)) → quote(X)

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

(7) Obligation:

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

S1(active(X)) → S1(X)
S1(mark(X)) → S1(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))))
active(dbl1(0)) → mark(01)
active(dbl1(s(X))) → mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) → mark(X)
active(sel1(s(X), cons(Y, Z))) → mark(sel1(X, Z))
active(quote(0)) → mark(01)
active(quote(s(X))) → mark(s1(quote(X)))
active(quote(dbl(X))) → mark(dbl1(X))
active(quote(sel(X, Y))) → mark(sel1(X, Y))
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))
mark(dbl1(X)) → active(dbl1(mark(X)))
mark(01) → active(01)
mark(s1(X)) → active(s1(mark(X)))
mark(sel1(X1, X2)) → active(sel1(mark(X1), mark(X2)))
mark(quote(X)) → active(quote(mark(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)
dbl1(mark(X)) → dbl1(X)
dbl1(active(X)) → dbl1(X)
s1(mark(X)) → s1(X)
s1(active(X)) → s1(X)
sel1(mark(X1), X2) → sel1(X1, X2)
sel1(X1, mark(X2)) → sel1(X1, X2)
sel1(active(X1), X2) → sel1(X1, X2)
sel1(X1, active(X2)) → sel1(X1, X2)
quote(mark(X)) → quote(X)
quote(active(X)) → quote(X)

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

(8) Obligation:

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

DBL1(active(X)) → DBL1(X)
DBL1(mark(X)) → DBL1(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))))
active(dbl1(0)) → mark(01)
active(dbl1(s(X))) → mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) → mark(X)
active(sel1(s(X), cons(Y, Z))) → mark(sel1(X, Z))
active(quote(0)) → mark(01)
active(quote(s(X))) → mark(s1(quote(X)))
active(quote(dbl(X))) → mark(dbl1(X))
active(quote(sel(X, Y))) → mark(sel1(X, Y))
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))
mark(dbl1(X)) → active(dbl1(mark(X)))
mark(01) → active(01)
mark(s1(X)) → active(s1(mark(X)))
mark(sel1(X1, X2)) → active(sel1(mark(X1), mark(X2)))
mark(quote(X)) → active(quote(mark(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)
dbl1(mark(X)) → dbl1(X)
dbl1(active(X)) → dbl1(X)
s1(mark(X)) → s1(X)
s1(active(X)) → s1(X)
sel1(mark(X1), X2) → sel1(X1, X2)
sel1(X1, mark(X2)) → sel1(X1, X2)
sel1(active(X1), X2) → sel1(X1, X2)
sel1(X1, active(X2)) → sel1(X1, X2)
quote(mark(X)) → quote(X)
quote(active(X)) → quote(X)

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

(9) 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))))
active(dbl1(0)) → mark(01)
active(dbl1(s(X))) → mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) → mark(X)
active(sel1(s(X), cons(Y, Z))) → mark(sel1(X, Z))
active(quote(0)) → mark(01)
active(quote(s(X))) → mark(s1(quote(X)))
active(quote(dbl(X))) → mark(dbl1(X))
active(quote(sel(X, Y))) → mark(sel1(X, Y))
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))
mark(dbl1(X)) → active(dbl1(mark(X)))
mark(01) → active(01)
mark(s1(X)) → active(s1(mark(X)))
mark(sel1(X1, X2)) → active(sel1(mark(X1), mark(X2)))
mark(quote(X)) → active(quote(mark(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)
dbl1(mark(X)) → dbl1(X)
dbl1(active(X)) → dbl1(X)
s1(mark(X)) → s1(X)
s1(active(X)) → s1(X)
sel1(mark(X1), X2) → sel1(X1, X2)
sel1(X1, mark(X2)) → sel1(X1, X2)
sel1(active(X1), X2) → sel1(X1, X2)
sel1(X1, active(X2)) → sel1(X1, X2)
quote(mark(X)) → quote(X)
quote(active(X)) → quote(X)

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

(10) 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))))
active(dbl1(0)) → mark(01)
active(dbl1(s(X))) → mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) → mark(X)
active(sel1(s(X), cons(Y, Z))) → mark(sel1(X, Z))
active(quote(0)) → mark(01)
active(quote(s(X))) → mark(s1(quote(X)))
active(quote(dbl(X))) → mark(dbl1(X))
active(quote(sel(X, Y))) → mark(sel1(X, Y))
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))
mark(dbl1(X)) → active(dbl1(mark(X)))
mark(01) → active(01)
mark(s1(X)) → active(s1(mark(X)))
mark(sel1(X1, X2)) → active(sel1(mark(X1), mark(X2)))
mark(quote(X)) → active(quote(mark(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)
dbl1(mark(X)) → dbl1(X)
dbl1(active(X)) → dbl1(X)
s1(mark(X)) → s1(X)
s1(active(X)) → s1(X)
sel1(mark(X1), X2) → sel1(X1, X2)
sel1(X1, mark(X2)) → sel1(X1, X2)
sel1(active(X1), X2) → sel1(X1, X2)
sel1(X1, active(X2)) → sel1(X1, X2)
quote(mark(X)) → quote(X)
quote(active(X)) → quote(X)

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

(11) 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))))
active(dbl1(0)) → mark(01)
active(dbl1(s(X))) → mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) → mark(X)
active(sel1(s(X), cons(Y, Z))) → mark(sel1(X, Z))
active(quote(0)) → mark(01)
active(quote(s(X))) → mark(s1(quote(X)))
active(quote(dbl(X))) → mark(dbl1(X))
active(quote(sel(X, Y))) → mark(sel1(X, Y))
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))
mark(dbl1(X)) → active(dbl1(mark(X)))
mark(01) → active(01)
mark(s1(X)) → active(s1(mark(X)))
mark(sel1(X1, X2)) → active(sel1(mark(X1), mark(X2)))
mark(quote(X)) → active(quote(mark(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)
dbl1(mark(X)) → dbl1(X)
dbl1(active(X)) → dbl1(X)
s1(mark(X)) → s1(X)
s1(active(X)) → s1(X)
sel1(mark(X1), X2) → sel1(X1, X2)
sel1(X1, mark(X2)) → sel1(X1, X2)
sel1(active(X1), X2) → sel1(X1, X2)
sel1(X1, active(X2)) → sel1(X1, X2)
quote(mark(X)) → quote(X)
quote(active(X)) → quote(X)

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

(12) 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))))
active(dbl1(0)) → mark(01)
active(dbl1(s(X))) → mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) → mark(X)
active(sel1(s(X), cons(Y, Z))) → mark(sel1(X, Z))
active(quote(0)) → mark(01)
active(quote(s(X))) → mark(s1(quote(X)))
active(quote(dbl(X))) → mark(dbl1(X))
active(quote(sel(X, Y))) → mark(sel1(X, Y))
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))
mark(dbl1(X)) → active(dbl1(mark(X)))
mark(01) → active(01)
mark(s1(X)) → active(s1(mark(X)))
mark(sel1(X1, X2)) → active(sel1(mark(X1), mark(X2)))
mark(quote(X)) → active(quote(mark(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)
dbl1(mark(X)) → dbl1(X)
dbl1(active(X)) → dbl1(X)
s1(mark(X)) → s1(X)
s1(active(X)) → s1(X)
sel1(mark(X1), X2) → sel1(X1, X2)
sel1(X1, mark(X2)) → sel1(X1, X2)
sel1(active(X1), X2) → sel1(X1, X2)
sel1(X1, active(X2)) → sel1(X1, X2)
quote(mark(X)) → quote(X)
quote(active(X)) → quote(X)

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

(13) 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))))
active(dbl1(0)) → mark(01)
active(dbl1(s(X))) → mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) → mark(X)
active(sel1(s(X), cons(Y, Z))) → mark(sel1(X, Z))
active(quote(0)) → mark(01)
active(quote(s(X))) → mark(s1(quote(X)))
active(quote(dbl(X))) → mark(dbl1(X))
active(quote(sel(X, Y))) → mark(sel1(X, Y))
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))
mark(dbl1(X)) → active(dbl1(mark(X)))
mark(01) → active(01)
mark(s1(X)) → active(s1(mark(X)))
mark(sel1(X1, X2)) → active(sel1(mark(X1), mark(X2)))
mark(quote(X)) → active(quote(mark(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)
dbl1(mark(X)) → dbl1(X)
dbl1(active(X)) → dbl1(X)
s1(mark(X)) → s1(X)
s1(active(X)) → s1(X)
sel1(mark(X1), X2) → sel1(X1, X2)
sel1(X1, mark(X2)) → sel1(X1, X2)
sel1(active(X1), X2) → sel1(X1, X2)
sel1(X1, active(X2)) → sel1(X1, X2)
quote(mark(X)) → quote(X)
quote(active(X)) → quote(X)

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

(14) 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))))
active(dbl1(0)) → mark(01)
active(dbl1(s(X))) → mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) → mark(X)
active(sel1(s(X), cons(Y, Z))) → mark(sel1(X, Z))
active(quote(0)) → mark(01)
active(quote(s(X))) → mark(s1(quote(X)))
active(quote(dbl(X))) → mark(dbl1(X))
active(quote(sel(X, Y))) → mark(sel1(X, Y))
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))
mark(dbl1(X)) → active(dbl1(mark(X)))
mark(01) → active(01)
mark(s1(X)) → active(s1(mark(X)))
mark(sel1(X1, X2)) → active(sel1(mark(X1), mark(X2)))
mark(quote(X)) → active(quote(mark(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)
dbl1(mark(X)) → dbl1(X)
dbl1(active(X)) → dbl1(X)
s1(mark(X)) → s1(X)
s1(active(X)) → s1(X)
sel1(mark(X1), X2) → sel1(X1, X2)
sel1(X1, mark(X2)) → sel1(X1, X2)
sel1(active(X1), X2) → sel1(X1, X2)
sel1(X1, active(X2)) → sel1(X1, X2)
quote(mark(X)) → quote(X)
quote(active(X)) → quote(X)

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

(15) 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))))
active(dbl1(0)) → mark(01)
active(dbl1(s(X))) → mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) → mark(X)
active(sel1(s(X), cons(Y, Z))) → mark(sel1(X, Z))
active(quote(0)) → mark(01)
active(quote(s(X))) → mark(s1(quote(X)))
active(quote(dbl(X))) → mark(dbl1(X))
active(quote(sel(X, Y))) → mark(sel1(X, Y))
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))
mark(dbl1(X)) → active(dbl1(mark(X)))
mark(01) → active(01)
mark(s1(X)) → active(s1(mark(X)))
mark(sel1(X1, X2)) → active(sel1(mark(X1), mark(X2)))
mark(quote(X)) → active(quote(mark(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)
dbl1(mark(X)) → dbl1(X)
dbl1(active(X)) → dbl1(X)
s1(mark(X)) → s1(X)
s1(active(X)) → s1(X)
sel1(mark(X1), X2) → sel1(X1, X2)
sel1(X1, mark(X2)) → sel1(X1, X2)
sel1(active(X1), X2) → sel1(X1, X2)
sel1(X1, active(X2)) → sel1(X1, X2)
quote(mark(X)) → quote(X)
quote(active(X)) → quote(X)

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

(16) 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))
ACTIVE(dbl1(s(X))) → MARK(s1(s1(dbl1(X))))
MARK(indx(X1, X2)) → MARK(X1)
MARK(from(X)) → ACTIVE(from(X))
ACTIVE(sel1(0, cons(X, Y))) → MARK(X)
MARK(dbl1(X)) → ACTIVE(dbl1(mark(X)))
ACTIVE(sel1(s(X), cons(Y, Z))) → MARK(sel1(X, Z))
MARK(dbl1(X)) → MARK(X)
MARK(s1(X)) → ACTIVE(s1(mark(X)))
ACTIVE(quote(s(X))) → MARK(s1(quote(X)))
MARK(s1(X)) → MARK(X)
MARK(sel1(X1, X2)) → ACTIVE(sel1(mark(X1), mark(X2)))
ACTIVE(quote(dbl(X))) → MARK(dbl1(X))
MARK(sel1(X1, X2)) → MARK(X1)
MARK(sel1(X1, X2)) → MARK(X2)
MARK(quote(X)) → ACTIVE(quote(mark(X)))
ACTIVE(quote(sel(X, Y))) → MARK(sel1(X, Y))
MARK(quote(X)) → MARK(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))))
active(dbl1(0)) → mark(01)
active(dbl1(s(X))) → mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) → mark(X)
active(sel1(s(X), cons(Y, Z))) → mark(sel1(X, Z))
active(quote(0)) → mark(01)
active(quote(s(X))) → mark(s1(quote(X)))
active(quote(dbl(X))) → mark(dbl1(X))
active(quote(sel(X, Y))) → mark(sel1(X, Y))
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))
mark(dbl1(X)) → active(dbl1(mark(X)))
mark(01) → active(01)
mark(s1(X)) → active(s1(mark(X)))
mark(sel1(X1, X2)) → active(sel1(mark(X1), mark(X2)))
mark(quote(X)) → active(quote(mark(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)
dbl1(mark(X)) → dbl1(X)
dbl1(active(X)) → dbl1(X)
s1(mark(X)) → s1(X)
s1(active(X)) → s1(X)
sel1(mark(X1), X2) → sel1(X1, X2)
sel1(X1, mark(X2)) → sel1(X1, X2)
sel1(active(X1), X2) → sel1(X1, X2)
sel1(X1, active(X2)) → sel1(X1, X2)
quote(mark(X)) → quote(X)
quote(active(X)) → quote(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.


MARK(cons(X1, X2)) → ACTIVE(cons(X1, X2))
The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
ACTIVE(x1)  =  x1
dbl(x1)  =  dbl
s(x1)  =  s
MARK(x1)  =  MARK
mark(x1)  =  mark
dbls(x1)  =  dbls
cons(x1, x2)  =  cons
sel(x1, x2)  =  sel
0  =  0
indx(x1, x2)  =  indx
from(x1)  =  from
dbl1(x1)  =  dbl1
s1(x1)  =  s1
sel1(x1, x2)  =  sel1
quote(x1)  =  quote
active(x1)  =  x1
nil  =  nil
01  =  01

Recursive path order with status [RPO].
Quasi-Precedence:
[dbl, s, MARK, mark, dbls, sel, indx, from, dbl1, s1, sel1, quote] > cons
[dbl, s, MARK, mark, dbls, sel, indx, from, dbl1, s1, sel1, quote] > 0
[dbl, s, MARK, mark, dbls, sel, indx, from, dbl1, s1, sel1, quote] > nil
[dbl, s, MARK, mark, dbls, sel, indx, from, dbl1, s1, sel1, quote] > 01

Status:
dbl: multiset
s: multiset
MARK: multiset
mark: multiset
dbls: multiset
cons: multiset
sel: multiset
0: multiset
indx: multiset
from: multiset
dbl1: multiset
s1: multiset
sel1: multiset
quote: multiset
nil: multiset
01: multiset


The following usable rules [FROCOS05] were oriented:

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))))
active(dbl1(0)) → mark(01)
active(dbl1(s(X))) → mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) → mark(X)
active(sel1(s(X), cons(Y, Z))) → mark(sel1(X, Z))
active(quote(0)) → mark(01)
active(quote(s(X))) → mark(s1(quote(X)))
active(quote(dbl(X))) → mark(dbl1(X))
active(quote(sel(X, Y))) → mark(sel1(X, Y))
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))
mark(dbl1(X)) → active(dbl1(mark(X)))
mark(01) → active(01)
mark(s1(X)) → active(s1(mark(X)))
mark(sel1(X1, X2)) → active(sel1(mark(X1), mark(X2)))
mark(quote(X)) → active(quote(mark(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)
dbl1(mark(X)) → dbl1(X)
dbl1(active(X)) → dbl1(X)
s1(mark(X)) → s1(X)
s1(active(X)) → s1(X)
sel1(mark(X1), X2) → sel1(X1, X2)
sel1(X1, mark(X2)) → sel1(X1, X2)
sel1(active(X1), X2) → sel1(X1, X2)
sel1(X1, active(X2)) → sel1(X1, X2)
quote(mark(X)) → quote(X)
quote(active(X)) → quote(X)

(18) 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)
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))
ACTIVE(dbl1(s(X))) → MARK(s1(s1(dbl1(X))))
MARK(indx(X1, X2)) → MARK(X1)
MARK(from(X)) → ACTIVE(from(X))
ACTIVE(sel1(0, cons(X, Y))) → MARK(X)
MARK(dbl1(X)) → ACTIVE(dbl1(mark(X)))
ACTIVE(sel1(s(X), cons(Y, Z))) → MARK(sel1(X, Z))
MARK(dbl1(X)) → MARK(X)
MARK(s1(X)) → ACTIVE(s1(mark(X)))
ACTIVE(quote(s(X))) → MARK(s1(quote(X)))
MARK(s1(X)) → MARK(X)
MARK(sel1(X1, X2)) → ACTIVE(sel1(mark(X1), mark(X2)))
ACTIVE(quote(dbl(X))) → MARK(dbl1(X))
MARK(sel1(X1, X2)) → MARK(X1)
MARK(sel1(X1, X2)) → MARK(X2)
MARK(quote(X)) → ACTIVE(quote(mark(X)))
ACTIVE(quote(sel(X, Y))) → MARK(sel1(X, Y))
MARK(quote(X)) → MARK(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))))
active(dbl1(0)) → mark(01)
active(dbl1(s(X))) → mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) → mark(X)
active(sel1(s(X), cons(Y, Z))) → mark(sel1(X, Z))
active(quote(0)) → mark(01)
active(quote(s(X))) → mark(s1(quote(X)))
active(quote(dbl(X))) → mark(dbl1(X))
active(quote(sel(X, Y))) → mark(sel1(X, Y))
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))
mark(dbl1(X)) → active(dbl1(mark(X)))
mark(01) → active(01)
mark(s1(X)) → active(s1(mark(X)))
mark(sel1(X1, X2)) → active(sel1(mark(X1), mark(X2)))
mark(quote(X)) → active(quote(mark(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)
dbl1(mark(X)) → dbl1(X)
dbl1(active(X)) → dbl1(X)
s1(mark(X)) → s1(X)
s1(active(X)) → s1(X)
sel1(mark(X1), X2) → sel1(X1, X2)
sel1(X1, mark(X2)) → sel1(X1, X2)
sel1(active(X1), X2) → sel1(X1, X2)
sel1(X1, active(X2)) → sel1(X1, X2)
quote(mark(X)) → quote(X)
quote(active(X)) → quote(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.


MARK(s(X)) → ACTIVE(s(X))
MARK(s1(X)) → ACTIVE(s1(mark(X)))
The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
ACTIVE(x1)  =  x1
dbl(x1)  =  dbl
s(x1)  =  s
MARK(x1)  =  MARK
mark(x1)  =  mark
dbls(x1)  =  dbls
cons(x1, x2)  =  cons
sel(x1, x2)  =  sel
0  =  0
indx(x1, x2)  =  indx
from(x1)  =  from
dbl1(x1)  =  dbl1
s1(x1)  =  s1
sel1(x1, x2)  =  sel1
quote(x1)  =  quote
active(x1)  =  x1
nil  =  nil
01  =  01

Recursive path order with status [RPO].
Quasi-Precedence:
[dbl, MARK, mark, dbls, sel, 0, indx, from, dbl1, sel1, quote, 01] > cons > [s, nil]
[dbl, MARK, mark, dbls, sel, 0, indx, from, dbl1, sel1, quote, 01] > s1 > [s, nil]

Status:
dbl: multiset
s: []
MARK: multiset
mark: multiset
dbls: multiset
cons: []
sel: multiset
0: multiset
indx: multiset
from: multiset
dbl1: multiset
s1: multiset
sel1: multiset
quote: multiset
nil: multiset
01: multiset


The following usable rules [FROCOS05] were oriented:

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))))
active(dbl1(0)) → mark(01)
active(dbl1(s(X))) → mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) → mark(X)
active(sel1(s(X), cons(Y, Z))) → mark(sel1(X, Z))
active(quote(0)) → mark(01)
active(quote(s(X))) → mark(s1(quote(X)))
active(quote(dbl(X))) → mark(dbl1(X))
active(quote(sel(X, Y))) → mark(sel1(X, Y))
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))
mark(dbl1(X)) → active(dbl1(mark(X)))
mark(01) → active(01)
mark(s1(X)) → active(s1(mark(X)))
mark(sel1(X1, X2)) → active(sel1(mark(X1), mark(X2)))
mark(quote(X)) → active(quote(mark(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)
dbl1(mark(X)) → dbl1(X)
dbl1(active(X)) → dbl1(X)
s1(mark(X)) → s1(X)
s1(active(X)) → s1(X)
sel1(mark(X1), X2) → sel1(X1, X2)
sel1(X1, mark(X2)) → sel1(X1, X2)
sel1(active(X1), X2) → sel1(X1, X2)
sel1(X1, active(X2)) → sel1(X1, X2)
quote(mark(X)) → quote(X)
quote(active(X)) → quote(X)

(20) 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)
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)
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))
ACTIVE(dbl1(s(X))) → MARK(s1(s1(dbl1(X))))
MARK(indx(X1, X2)) → MARK(X1)
MARK(from(X)) → ACTIVE(from(X))
ACTIVE(sel1(0, cons(X, Y))) → MARK(X)
MARK(dbl1(X)) → ACTIVE(dbl1(mark(X)))
ACTIVE(sel1(s(X), cons(Y, Z))) → MARK(sel1(X, Z))
MARK(dbl1(X)) → MARK(X)
ACTIVE(quote(s(X))) → MARK(s1(quote(X)))
MARK(s1(X)) → MARK(X)
MARK(sel1(X1, X2)) → ACTIVE(sel1(mark(X1), mark(X2)))
ACTIVE(quote(dbl(X))) → MARK(dbl1(X))
MARK(sel1(X1, X2)) → MARK(X1)
MARK(sel1(X1, X2)) → MARK(X2)
MARK(quote(X)) → ACTIVE(quote(mark(X)))
ACTIVE(quote(sel(X, Y))) → MARK(sel1(X, Y))
MARK(quote(X)) → MARK(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))))
active(dbl1(0)) → mark(01)
active(dbl1(s(X))) → mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) → mark(X)
active(sel1(s(X), cons(Y, Z))) → mark(sel1(X, Z))
active(quote(0)) → mark(01)
active(quote(s(X))) → mark(s1(quote(X)))
active(quote(dbl(X))) → mark(dbl1(X))
active(quote(sel(X, Y))) → mark(sel1(X, Y))
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))
mark(dbl1(X)) → active(dbl1(mark(X)))
mark(01) → active(01)
mark(s1(X)) → active(s1(mark(X)))
mark(sel1(X1, X2)) → active(sel1(mark(X1), mark(X2)))
mark(quote(X)) → active(quote(mark(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)
dbl1(mark(X)) → dbl1(X)
dbl1(active(X)) → dbl1(X)
s1(mark(X)) → s1(X)
s1(active(X)) → s1(X)
sel1(mark(X1), X2) → sel1(X1, X2)
sel1(X1, mark(X2)) → sel1(X1, X2)
sel1(active(X1), X2) → sel1(X1, X2)
sel1(X1, active(X2)) → sel1(X1, X2)
quote(mark(X)) → quote(X)
quote(active(X)) → quote(X)

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