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

(0) Obligation:

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

dbl(0) → 0
dbl(s(X)) → s(s(dbl(X)))
dbls(nil) → nil
dbls(cons(X, Y)) → cons(dbl(X), dbls(Y))
sel(0, cons(X, Y)) → X
sel(s(X), cons(Y, Z)) → sel(X, Z)
indx(nil, X) → nil
indx(cons(X, Y), Z) → cons(sel(X, Z), indx(Y, Z))
from(X) → cons(X, from(s(X)))
dbl1(0) → 01
dbl1(s(X)) → s1(s1(dbl1(X)))
sel1(0, cons(X, Y)) → X
sel1(s(X), cons(Y, Z)) → sel1(X, Z)
quote(0) → 01
quote(s(X)) → s1(quote(X))
quote(dbl(X)) → dbl1(X)
quote(sel(X, Y)) → sel1(X, Y)

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:

DBL(s(X)) → DBL(X)
DBLS(cons(X, Y)) → DBL(X)
DBLS(cons(X, Y)) → DBLS(Y)
SEL(s(X), cons(Y, Z)) → SEL(X, Z)
INDX(cons(X, Y), Z) → SEL(X, Z)
INDX(cons(X, Y), Z) → INDX(Y, Z)
FROM(X) → FROM(s(X))
DBL1(s(X)) → DBL1(X)
SEL1(s(X), cons(Y, Z)) → SEL1(X, Z)
QUOTE(s(X)) → QUOTE(X)
QUOTE(dbl(X)) → DBL1(X)
QUOTE(sel(X, Y)) → SEL1(X, Y)

The TRS R consists of the following rules:

dbl(0) → 0
dbl(s(X)) → s(s(dbl(X)))
dbls(nil) → nil
dbls(cons(X, Y)) → cons(dbl(X), dbls(Y))
sel(0, cons(X, Y)) → X
sel(s(X), cons(Y, Z)) → sel(X, Z)
indx(nil, X) → nil
indx(cons(X, Y), Z) → cons(sel(X, Z), indx(Y, Z))
from(X) → cons(X, from(s(X)))
dbl1(0) → 01
dbl1(s(X)) → s1(s1(dbl1(X)))
sel1(0, cons(X, Y)) → X
sel1(s(X), cons(Y, Z)) → sel1(X, Z)
quote(0) → 01
quote(s(X)) → s1(quote(X))
quote(dbl(X)) → dbl1(X)
quote(sel(X, Y)) → sel1(X, Y)

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 4 less nodes.

(4) Complex Obligation (AND)

(5) Obligation:

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

SEL1(s(X), cons(Y, Z)) → SEL1(X, Z)

The TRS R consists of the following rules:

dbl(0) → 0
dbl(s(X)) → s(s(dbl(X)))
dbls(nil) → nil
dbls(cons(X, Y)) → cons(dbl(X), dbls(Y))
sel(0, cons(X, Y)) → X
sel(s(X), cons(Y, Z)) → sel(X, Z)
indx(nil, X) → nil
indx(cons(X, Y), Z) → cons(sel(X, Z), indx(Y, Z))
from(X) → cons(X, from(s(X)))
dbl1(0) → 01
dbl1(s(X)) → s1(s1(dbl1(X)))
sel1(0, cons(X, Y)) → X
sel1(s(X), cons(Y, Z)) → sel1(X, Z)
quote(0) → 01
quote(s(X)) → s1(quote(X))
quote(dbl(X)) → dbl1(X)
quote(sel(X, Y)) → sel1(X, Y)

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.


SEL1(s(X), cons(Y, Z)) → SEL1(X, Z)
The remaining pairs can at least be oriented weakly.
Used ordering: Lexicographic path order with status [LPO].
Precedence:
s1 > SEL12
cons2 > SEL12

Status:
SEL12: [2,1]
cons2: [1,2]
s1: [1]

The following usable rules [FROCOS05] were oriented: none

(7) Obligation:

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

dbl(0) → 0
dbl(s(X)) → s(s(dbl(X)))
dbls(nil) → nil
dbls(cons(X, Y)) → cons(dbl(X), dbls(Y))
sel(0, cons(X, Y)) → X
sel(s(X), cons(Y, Z)) → sel(X, Z)
indx(nil, X) → nil
indx(cons(X, Y), Z) → cons(sel(X, Z), indx(Y, Z))
from(X) → cons(X, from(s(X)))
dbl1(0) → 01
dbl1(s(X)) → s1(s1(dbl1(X)))
sel1(0, cons(X, Y)) → X
sel1(s(X), cons(Y, Z)) → sel1(X, Z)
quote(0) → 01
quote(s(X)) → s1(quote(X))
quote(dbl(X)) → dbl1(X)
quote(sel(X, Y)) → sel1(X, Y)

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

(8) PisEmptyProof (EQUIVALENT transformation)

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

(9) TRUE

(10) Obligation:

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

DBL1(s(X)) → DBL1(X)

The TRS R consists of the following rules:

dbl(0) → 0
dbl(s(X)) → s(s(dbl(X)))
dbls(nil) → nil
dbls(cons(X, Y)) → cons(dbl(X), dbls(Y))
sel(0, cons(X, Y)) → X
sel(s(X), cons(Y, Z)) → sel(X, Z)
indx(nil, X) → nil
indx(cons(X, Y), Z) → cons(sel(X, Z), indx(Y, Z))
from(X) → cons(X, from(s(X)))
dbl1(0) → 01
dbl1(s(X)) → s1(s1(dbl1(X)))
sel1(0, cons(X, Y)) → X
sel1(s(X), cons(Y, Z)) → sel1(X, Z)
quote(0) → 01
quote(s(X)) → s1(quote(X))
quote(dbl(X)) → dbl1(X)
quote(sel(X, Y)) → sel1(X, Y)

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

(11) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


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

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

Status:
s1: [1]

The following usable rules [FROCOS05] were oriented: none

(12) Obligation:

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

dbl(0) → 0
dbl(s(X)) → s(s(dbl(X)))
dbls(nil) → nil
dbls(cons(X, Y)) → cons(dbl(X), dbls(Y))
sel(0, cons(X, Y)) → X
sel(s(X), cons(Y, Z)) → sel(X, Z)
indx(nil, X) → nil
indx(cons(X, Y), Z) → cons(sel(X, Z), indx(Y, Z))
from(X) → cons(X, from(s(X)))
dbl1(0) → 01
dbl1(s(X)) → s1(s1(dbl1(X)))
sel1(0, cons(X, Y)) → X
sel1(s(X), cons(Y, Z)) → sel1(X, Z)
quote(0) → 01
quote(s(X)) → s1(quote(X))
quote(dbl(X)) → dbl1(X)
quote(sel(X, Y)) → sel1(X, Y)

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

(13) PisEmptyProof (EQUIVALENT transformation)

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

(14) TRUE

(15) Obligation:

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

QUOTE(s(X)) → QUOTE(X)

The TRS R consists of the following rules:

dbl(0) → 0
dbl(s(X)) → s(s(dbl(X)))
dbls(nil) → nil
dbls(cons(X, Y)) → cons(dbl(X), dbls(Y))
sel(0, cons(X, Y)) → X
sel(s(X), cons(Y, Z)) → sel(X, Z)
indx(nil, X) → nil
indx(cons(X, Y), Z) → cons(sel(X, Z), indx(Y, Z))
from(X) → cons(X, from(s(X)))
dbl1(0) → 01
dbl1(s(X)) → s1(s1(dbl1(X)))
sel1(0, cons(X, Y)) → X
sel1(s(X), cons(Y, Z)) → sel1(X, Z)
quote(0) → 01
quote(s(X)) → s1(quote(X))
quote(dbl(X)) → dbl1(X)
quote(sel(X, Y)) → sel1(X, Y)

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

(16) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


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

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

Status:
s1: [1]

The following usable rules [FROCOS05] were oriented: none

(17) Obligation:

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

dbl(0) → 0
dbl(s(X)) → s(s(dbl(X)))
dbls(nil) → nil
dbls(cons(X, Y)) → cons(dbl(X), dbls(Y))
sel(0, cons(X, Y)) → X
sel(s(X), cons(Y, Z)) → sel(X, Z)
indx(nil, X) → nil
indx(cons(X, Y), Z) → cons(sel(X, Z), indx(Y, Z))
from(X) → cons(X, from(s(X)))
dbl1(0) → 01
dbl1(s(X)) → s1(s1(dbl1(X)))
sel1(0, cons(X, Y)) → X
sel1(s(X), cons(Y, Z)) → sel1(X, Z)
quote(0) → 01
quote(s(X)) → s1(quote(X))
quote(dbl(X)) → dbl1(X)
quote(sel(X, Y)) → sel1(X, Y)

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

(18) PisEmptyProof (EQUIVALENT transformation)

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

(19) TRUE

(20) Obligation:

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

FROM(X) → FROM(s(X))

The TRS R consists of the following rules:

dbl(0) → 0
dbl(s(X)) → s(s(dbl(X)))
dbls(nil) → nil
dbls(cons(X, Y)) → cons(dbl(X), dbls(Y))
sel(0, cons(X, Y)) → X
sel(s(X), cons(Y, Z)) → sel(X, Z)
indx(nil, X) → nil
indx(cons(X, Y), Z) → cons(sel(X, Z), indx(Y, Z))
from(X) → cons(X, from(s(X)))
dbl1(0) → 01
dbl1(s(X)) → s1(s1(dbl1(X)))
sel1(0, cons(X, Y)) → X
sel1(s(X), cons(Y, Z)) → sel1(X, Z)
quote(0) → 01
quote(s(X)) → s1(quote(X))
quote(dbl(X)) → dbl1(X)
quote(sel(X, Y)) → sel1(X, Y)

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

(21) Obligation:

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

SEL(s(X), cons(Y, Z)) → SEL(X, Z)

The TRS R consists of the following rules:

dbl(0) → 0
dbl(s(X)) → s(s(dbl(X)))
dbls(nil) → nil
dbls(cons(X, Y)) → cons(dbl(X), dbls(Y))
sel(0, cons(X, Y)) → X
sel(s(X), cons(Y, Z)) → sel(X, Z)
indx(nil, X) → nil
indx(cons(X, Y), Z) → cons(sel(X, Z), indx(Y, Z))
from(X) → cons(X, from(s(X)))
dbl1(0) → 01
dbl1(s(X)) → s1(s1(dbl1(X)))
sel1(0, cons(X, Y)) → X
sel1(s(X), cons(Y, Z)) → sel1(X, Z)
quote(0) → 01
quote(s(X)) → s1(quote(X))
quote(dbl(X)) → dbl1(X)
quote(sel(X, Y)) → sel1(X, Y)

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

(22) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


SEL(s(X), cons(Y, Z)) → SEL(X, Z)
The remaining pairs can at least be oriented weakly.
Used ordering: Lexicographic path order with status [LPO].
Precedence:
s1 > SEL2
cons2 > SEL2

Status:
cons2: [1,2]
s1: [1]
SEL2: [2,1]

The following usable rules [FROCOS05] were oriented: none

(23) Obligation:

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

dbl(0) → 0
dbl(s(X)) → s(s(dbl(X)))
dbls(nil) → nil
dbls(cons(X, Y)) → cons(dbl(X), dbls(Y))
sel(0, cons(X, Y)) → X
sel(s(X), cons(Y, Z)) → sel(X, Z)
indx(nil, X) → nil
indx(cons(X, Y), Z) → cons(sel(X, Z), indx(Y, Z))
from(X) → cons(X, from(s(X)))
dbl1(0) → 01
dbl1(s(X)) → s1(s1(dbl1(X)))
sel1(0, cons(X, Y)) → X
sel1(s(X), cons(Y, Z)) → sel1(X, Z)
quote(0) → 01
quote(s(X)) → s1(quote(X))
quote(dbl(X)) → dbl1(X)
quote(sel(X, Y)) → sel1(X, Y)

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

(24) PisEmptyProof (EQUIVALENT transformation)

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

(25) TRUE

(26) Obligation:

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

INDX(cons(X, Y), Z) → INDX(Y, Z)

The TRS R consists of the following rules:

dbl(0) → 0
dbl(s(X)) → s(s(dbl(X)))
dbls(nil) → nil
dbls(cons(X, Y)) → cons(dbl(X), dbls(Y))
sel(0, cons(X, Y)) → X
sel(s(X), cons(Y, Z)) → sel(X, Z)
indx(nil, X) → nil
indx(cons(X, Y), Z) → cons(sel(X, Z), indx(Y, Z))
from(X) → cons(X, from(s(X)))
dbl1(0) → 01
dbl1(s(X)) → s1(s1(dbl1(X)))
sel1(0, cons(X, Y)) → X
sel1(s(X), cons(Y, Z)) → sel1(X, Z)
quote(0) → 01
quote(s(X)) → s1(quote(X))
quote(dbl(X)) → dbl1(X)
quote(sel(X, Y)) → sel1(X, Y)

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

(27) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


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

Lexicographic path order with status [LPO].
Precedence:
cons2 > INDX1

Status:
cons2: [1,2]
INDX1: [1]

The following usable rules [FROCOS05] were oriented: none

(28) Obligation:

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

dbl(0) → 0
dbl(s(X)) → s(s(dbl(X)))
dbls(nil) → nil
dbls(cons(X, Y)) → cons(dbl(X), dbls(Y))
sel(0, cons(X, Y)) → X
sel(s(X), cons(Y, Z)) → sel(X, Z)
indx(nil, X) → nil
indx(cons(X, Y), Z) → cons(sel(X, Z), indx(Y, Z))
from(X) → cons(X, from(s(X)))
dbl1(0) → 01
dbl1(s(X)) → s1(s1(dbl1(X)))
sel1(0, cons(X, Y)) → X
sel1(s(X), cons(Y, Z)) → sel1(X, Z)
quote(0) → 01
quote(s(X)) → s1(quote(X))
quote(dbl(X)) → dbl1(X)
quote(sel(X, Y)) → sel1(X, Y)

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

(29) PisEmptyProof (EQUIVALENT transformation)

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

(30) TRUE

(31) Obligation:

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

DBL(s(X)) → DBL(X)

The TRS R consists of the following rules:

dbl(0) → 0
dbl(s(X)) → s(s(dbl(X)))
dbls(nil) → nil
dbls(cons(X, Y)) → cons(dbl(X), dbls(Y))
sel(0, cons(X, Y)) → X
sel(s(X), cons(Y, Z)) → sel(X, Z)
indx(nil, X) → nil
indx(cons(X, Y), Z) → cons(sel(X, Z), indx(Y, Z))
from(X) → cons(X, from(s(X)))
dbl1(0) → 01
dbl1(s(X)) → s1(s1(dbl1(X)))
sel1(0, cons(X, Y)) → X
sel1(s(X), cons(Y, Z)) → sel1(X, Z)
quote(0) → 01
quote(s(X)) → s1(quote(X))
quote(dbl(X)) → dbl1(X)
quote(sel(X, Y)) → sel1(X, Y)

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

(32) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


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

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

Status:
s1: [1]

The following usable rules [FROCOS05] were oriented: none

(33) Obligation:

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

dbl(0) → 0
dbl(s(X)) → s(s(dbl(X)))
dbls(nil) → nil
dbls(cons(X, Y)) → cons(dbl(X), dbls(Y))
sel(0, cons(X, Y)) → X
sel(s(X), cons(Y, Z)) → sel(X, Z)
indx(nil, X) → nil
indx(cons(X, Y), Z) → cons(sel(X, Z), indx(Y, Z))
from(X) → cons(X, from(s(X)))
dbl1(0) → 01
dbl1(s(X)) → s1(s1(dbl1(X)))
sel1(0, cons(X, Y)) → X
sel1(s(X), cons(Y, Z)) → sel1(X, Z)
quote(0) → 01
quote(s(X)) → s1(quote(X))
quote(dbl(X)) → dbl1(X)
quote(sel(X, Y)) → sel1(X, Y)

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

(34) PisEmptyProof (EQUIVALENT transformation)

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

(35) TRUE

(36) Obligation:

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

DBLS(cons(X, Y)) → DBLS(Y)

The TRS R consists of the following rules:

dbl(0) → 0
dbl(s(X)) → s(s(dbl(X)))
dbls(nil) → nil
dbls(cons(X, Y)) → cons(dbl(X), dbls(Y))
sel(0, cons(X, Y)) → X
sel(s(X), cons(Y, Z)) → sel(X, Z)
indx(nil, X) → nil
indx(cons(X, Y), Z) → cons(sel(X, Z), indx(Y, Z))
from(X) → cons(X, from(s(X)))
dbl1(0) → 01
dbl1(s(X)) → s1(s1(dbl1(X)))
sel1(0, cons(X, Y)) → X
sel1(s(X), cons(Y, Z)) → sel1(X, Z)
quote(0) → 01
quote(s(X)) → s1(quote(X))
quote(dbl(X)) → dbl1(X)
quote(sel(X, Y)) → sel1(X, Y)

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.


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

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

Status:
cons2: [1,2]

The following usable rules [FROCOS05] were oriented: none

(38) Obligation:

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

dbl(0) → 0
dbl(s(X)) → s(s(dbl(X)))
dbls(nil) → nil
dbls(cons(X, Y)) → cons(dbl(X), dbls(Y))
sel(0, cons(X, Y)) → X
sel(s(X), cons(Y, Z)) → sel(X, Z)
indx(nil, X) → nil
indx(cons(X, Y), Z) → cons(sel(X, Z), indx(Y, Z))
from(X) → cons(X, from(s(X)))
dbl1(0) → 01
dbl1(s(X)) → s1(s1(dbl1(X)))
sel1(0, cons(X, Y)) → X
sel1(s(X), cons(Y, Z)) → sel1(X, Z)
quote(0) → 01
quote(s(X)) → s1(quote(X))
quote(dbl(X)) → dbl1(X)
quote(sel(X, Y)) → sel1(X, Y)

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

(39) PisEmptyProof (EQUIVALENT transformation)

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

(40) TRUE