(0) Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:
from(X) → cons(X, n__from(s(X)))
sel(0, cons(X, Y)) → X
sel(s(X), cons(Y, Z)) → sel(X, activate(Z))
from(X) → n__from(X)
activate(n__from(X)) → from(X)
activate(X) → X
Q is empty.
(1) DependencyPairsProof (EQUIVALENT transformation)
Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem.
(2) Obligation:
Q DP problem:
The TRS P consists of the following rules:
SEL(s(X), cons(Y, Z)) → SEL(X, activate(Z))
SEL(s(X), cons(Y, Z)) → ACTIVATE(Z)
ACTIVATE(n__from(X)) → FROM(X)
The TRS R consists of the following rules:
from(X) → cons(X, n__from(s(X)))
sel(0, cons(X, Y)) → X
sel(s(X), cons(Y, Z)) → sel(X, activate(Z))
from(X) → n__from(X)
activate(n__from(X)) → from(X)
activate(X) → X
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
(3) DependencyGraphProof (EQUIVALENT transformation)
The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 1 SCC with 2 less nodes.
(4) Obligation:
Q DP problem:
The TRS P consists of the following rules:
SEL(s(X), cons(Y, Z)) → SEL(X, activate(Z))
The TRS R consists of the following rules:
from(X) → cons(X, n__from(s(X)))
sel(0, cons(X, Y)) → X
sel(s(X), cons(Y, Z)) → sel(X, activate(Z))
from(X) → n__from(X)
activate(n__from(X)) → from(X)
activate(X) → X
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
(5) 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, activate(Z))
The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
SEL(
x0,
x1,
x2) =
SEL(
x1)
Tags:
SEL has argument tags [1,3,1] and root tag 0
Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Combined order from the following AFS and order.
SEL(
x1,
x2) =
SEL(
x1,
x2)
s(
x1) =
s(
x1)
cons(
x1,
x2) =
x1
activate(
x1) =
x1
n__from(
x1) =
x1
from(
x1) =
x1
Homeomorphic Embedding Order
The following usable rules [FROCOS05] were oriented:
activate(n__from(X)) → from(X)
activate(X) → X
from(X) → cons(X, n__from(s(X)))
from(X) → n__from(X)
(6) Obligation:
Q DP problem:
P is empty.
The TRS R consists of the following rules:
from(X) → cons(X, n__from(s(X)))
sel(0, cons(X, Y)) → X
sel(s(X), cons(Y, Z)) → sel(X, activate(Z))
from(X) → n__from(X)
activate(n__from(X)) → from(X)
activate(X) → X
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
(7) PisEmptyProof (EQUIVALENT transformation)
The TRS P is empty. Hence, there is no (P,Q,R) chain.
(8) TRUE