Termination Proof using AProVE

Term Rewriting System R:
[X, Y, Z]
sel(s(X), cons(Y, Z)) -> sel(X, Z)
sel(0, cons(X, Z)) -> X
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
from(X) -> cons(X, from(s(X)))
sel1(s(X), cons(Y, Z)) -> sel1(X, Z)
sel1(0, cons(X, Z)) -> quote(X)
first1(0, Z) -> nil1
first1(s(X), cons(Y, Z)) -> cons1(quote(Y), first1(X, Z))
quote(0) -> 01
quote(s(X)) -> s1(quote(X))
quote(sel(X, Z)) -> sel1(X, Z)
quote1(cons(X, Z)) -> cons1(quote(X), quote1(Z))
quote1(nil) -> nil1
quote1(first(X, Z)) -> first1(X, Z)
unquote(01) -> 0
unquote(s1(X)) -> s(unquote(X))
unquote1(nil1) -> nil
unquote1(cons1(X, Z)) -> fcons(unquote(X), unquote1(Z))
fcons(X, Z) -> cons(X, Z)

Termination of R to be shown.

     ↳Dependency Pair Analysis

R contains the following Dependency Pairs:

SEL(s(X), cons(Y, Z)) -> SEL(X, Z)
FIRST(s(X), cons(Y, Z)) -> FIRST(X, Z)
FROM(X) -> FROM(s(X))
SEL1(s(X), cons(Y, Z)) -> SEL1(X, Z)
SEL1(0, cons(X, Z)) -> QUOTE(X)
FIRST1(s(X), cons(Y, Z)) -> QUOTE(Y)
FIRST1(s(X), cons(Y, Z)) -> FIRST1(X, Z)
QUOTE(s(X)) -> QUOTE(X)
QUOTE(sel(X, Z)) -> SEL1(X, Z)
QUOTE1(cons(X, Z)) -> QUOTE(X)
QUOTE1(cons(X, Z)) -> QUOTE1(Z)
QUOTE1(first(X, Z)) -> FIRST1(X, Z)
UNQUOTE(s1(X)) -> UNQUOTE(X)
UNQUOTE1(cons1(X, Z)) -> FCONS(unquote(X), unquote1(Z))
UNQUOTE1(cons1(X, Z)) -> UNQUOTE(X)
UNQUOTE1(cons1(X, Z)) -> UNQUOTE1(Z)

Furthermore, R contains eight SCCs.

     ↳DPs

       →DP Problem 1

         ↳Remaining Obligation(s)

       →DP Problem 2

         ↳Remaining Obligation(s)

       →DP Problem 3

         ↳Remaining Obligation(s)

       →DP Problem 4

         ↳Remaining Obligation(s)

       →DP Problem 5

         ↳Remaining Obligation(s)

       →DP Problem 6

         ↳Remaining Obligation(s)

       →DP Problem 7

         ↳Remaining Obligation(s)

       →DP Problem 8

         ↳Remaining Obligation(s)

The following remains to be proven:

Dependency Pair:
SEL(s(X), cons(Y, Z)) -> SEL(X, Z)

Rules:

sel(s(X), cons(Y, Z)) -> sel(X, Z)
sel(0, cons(X, Z)) -> X
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
from(X) -> cons(X, from(s(X)))
sel1(s(X), cons(Y, Z)) -> sel1(X, Z)
sel1(0, cons(X, Z)) -> quote(X)
first1(0, Z) -> nil1
first1(s(X), cons(Y, Z)) -> cons1(quote(Y), first1(X, Z))
quote(0) -> 01
quote(s(X)) -> s1(quote(X))
quote(sel(X, Z)) -> sel1(X, Z)
quote1(cons(X, Z)) -> cons1(quote(X), quote1(Z))
quote1(nil) -> nil1
quote1(first(X, Z)) -> first1(X, Z)
unquote(01) -> 0
unquote(s1(X)) -> s(unquote(X))
unquote1(nil1) -> nil
unquote1(cons1(X, Z)) -> fcons(unquote(X), unquote1(Z))
fcons(X, Z) -> cons(X, Z)
Dependency Pair:
FIRST(s(X), cons(Y, Z)) -> FIRST(X, Z)

Rules:

sel(s(X), cons(Y, Z)) -> sel(X, Z)
sel(0, cons(X, Z)) -> X
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
from(X) -> cons(X, from(s(X)))
sel1(s(X), cons(Y, Z)) -> sel1(X, Z)
sel1(0, cons(X, Z)) -> quote(X)
first1(0, Z) -> nil1
first1(s(X), cons(Y, Z)) -> cons1(quote(Y), first1(X, Z))
quote(0) -> 01
quote(s(X)) -> s1(quote(X))
quote(sel(X, Z)) -> sel1(X, Z)
quote1(cons(X, Z)) -> cons1(quote(X), quote1(Z))
quote1(nil) -> nil1
quote1(first(X, Z)) -> first1(X, Z)
unquote(01) -> 0
unquote(s1(X)) -> s(unquote(X))
unquote1(nil1) -> nil
unquote1(cons1(X, Z)) -> fcons(unquote(X), unquote1(Z))
fcons(X, Z) -> cons(X, Z)
Dependency Pair:
FROM(X) -> FROM(s(X))

Rules:

sel(s(X), cons(Y, Z)) -> sel(X, Z)
sel(0, cons(X, Z)) -> X
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
from(X) -> cons(X, from(s(X)))
sel1(s(X), cons(Y, Z)) -> sel1(X, Z)
sel1(0, cons(X, Z)) -> quote(X)
first1(0, Z) -> nil1
first1(s(X), cons(Y, Z)) -> cons1(quote(Y), first1(X, Z))
quote(0) -> 01
quote(s(X)) -> s1(quote(X))
quote(sel(X, Z)) -> sel1(X, Z)
quote1(cons(X, Z)) -> cons1(quote(X), quote1(Z))
quote1(nil) -> nil1
quote1(first(X, Z)) -> first1(X, Z)
unquote(01) -> 0
unquote(s1(X)) -> s(unquote(X))
unquote1(nil1) -> nil
unquote1(cons1(X, Z)) -> fcons(unquote(X), unquote1(Z))
fcons(X, Z) -> cons(X, Z)
Dependency Pairs:
QUOTE(sel(X, Z)) -> SEL1(X, Z)
QUOTE(s(X)) -> QUOTE(X)
SEL1(0, cons(X, Z)) -> QUOTE(X)
SEL1(s(X), cons(Y, Z)) -> SEL1(X, Z)

Rules:

sel(s(X), cons(Y, Z)) -> sel(X, Z)
sel(0, cons(X, Z)) -> X
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
from(X) -> cons(X, from(s(X)))
sel1(s(X), cons(Y, Z)) -> sel1(X, Z)
sel1(0, cons(X, Z)) -> quote(X)
first1(0, Z) -> nil1
first1(s(X), cons(Y, Z)) -> cons1(quote(Y), first1(X, Z))
quote(0) -> 01
quote(s(X)) -> s1(quote(X))
quote(sel(X, Z)) -> sel1(X, Z)
quote1(cons(X, Z)) -> cons1(quote(X), quote1(Z))
quote1(nil) -> nil1
quote1(first(X, Z)) -> first1(X, Z)
unquote(01) -> 0
unquote(s1(X)) -> s(unquote(X))
unquote1(nil1) -> nil
unquote1(cons1(X, Z)) -> fcons(unquote(X), unquote1(Z))
fcons(X, Z) -> cons(X, Z)
Dependency Pair:
UNQUOTE(s1(X)) -> UNQUOTE(X)

Rules:

sel(s(X), cons(Y, Z)) -> sel(X, Z)
sel(0, cons(X, Z)) -> X
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
from(X) -> cons(X, from(s(X)))
sel1(s(X), cons(Y, Z)) -> sel1(X, Z)
sel1(0, cons(X, Z)) -> quote(X)
first1(0, Z) -> nil1
first1(s(X), cons(Y, Z)) -> cons1(quote(Y), first1(X, Z))
quote(0) -> 01
quote(s(X)) -> s1(quote(X))
quote(sel(X, Z)) -> sel1(X, Z)
quote1(cons(X, Z)) -> cons1(quote(X), quote1(Z))
quote1(nil) -> nil1
quote1(first(X, Z)) -> first1(X, Z)
unquote(01) -> 0
unquote(s1(X)) -> s(unquote(X))
unquote1(nil1) -> nil
unquote1(cons1(X, Z)) -> fcons(unquote(X), unquote1(Z))
fcons(X, Z) -> cons(X, Z)
Dependency Pair:
FIRST1(s(X), cons(Y, Z)) -> FIRST1(X, Z)

Rules:

sel(s(X), cons(Y, Z)) -> sel(X, Z)
sel(0, cons(X, Z)) -> X
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
from(X) -> cons(X, from(s(X)))
sel1(s(X), cons(Y, Z)) -> sel1(X, Z)
sel1(0, cons(X, Z)) -> quote(X)
first1(0, Z) -> nil1
first1(s(X), cons(Y, Z)) -> cons1(quote(Y), first1(X, Z))
quote(0) -> 01
quote(s(X)) -> s1(quote(X))
quote(sel(X, Z)) -> sel1(X, Z)
quote1(cons(X, Z)) -> cons1(quote(X), quote1(Z))
quote1(nil) -> nil1
quote1(first(X, Z)) -> first1(X, Z)
unquote(01) -> 0
unquote(s1(X)) -> s(unquote(X))
unquote1(nil1) -> nil
unquote1(cons1(X, Z)) -> fcons(unquote(X), unquote1(Z))
fcons(X, Z) -> cons(X, Z)
Dependency Pair:
UNQUOTE1(cons1(X, Z)) -> UNQUOTE1(Z)

Rules:

sel(s(X), cons(Y, Z)) -> sel(X, Z)
sel(0, cons(X, Z)) -> X
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
from(X) -> cons(X, from(s(X)))
sel1(s(X), cons(Y, Z)) -> sel1(X, Z)
sel1(0, cons(X, Z)) -> quote(X)
first1(0, Z) -> nil1
first1(s(X), cons(Y, Z)) -> cons1(quote(Y), first1(X, Z))
quote(0) -> 01
quote(s(X)) -> s1(quote(X))
quote(sel(X, Z)) -> sel1(X, Z)
quote1(cons(X, Z)) -> cons1(quote(X), quote1(Z))
quote1(nil) -> nil1
quote1(first(X, Z)) -> first1(X, Z)
unquote(01) -> 0
unquote(s1(X)) -> s(unquote(X))
unquote1(nil1) -> nil
unquote1(cons1(X, Z)) -> fcons(unquote(X), unquote1(Z))
fcons(X, Z) -> cons(X, Z)
Dependency Pair:
QUOTE1(cons(X, Z)) -> QUOTE1(Z)

Rules:

sel(s(X), cons(Y, Z)) -> sel(X, Z)
sel(0, cons(X, Z)) -> X
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
from(X) -> cons(X, from(s(X)))
sel1(s(X), cons(Y, Z)) -> sel1(X, Z)
sel1(0, cons(X, Z)) -> quote(X)
first1(0, Z) -> nil1
first1(s(X), cons(Y, Z)) -> cons1(quote(Y), first1(X, Z))
quote(0) -> 01
quote(s(X)) -> s1(quote(X))
quote(sel(X, Z)) -> sel1(X, Z)
quote1(cons(X, Z)) -> cons1(quote(X), quote1(Z))
quote1(nil) -> nil1
quote1(first(X, Z)) -> first1(X, Z)
unquote(01) -> 0
unquote(s1(X)) -> s(unquote(X))
unquote1(nil1) -> nil
unquote1(cons1(X, Z)) -> fcons(unquote(X), unquote1(Z))
fcons(X, Z) -> cons(X, Z)

     ↳DPs

       →DP Problem 1

         ↳Remaining Obligation(s)

       →DP Problem 2

         ↳Remaining Obligation(s)

       →DP Problem 3

         ↳Remaining Obligation(s)

       →DP Problem 4

         ↳Remaining Obligation(s)

       →DP Problem 5

         ↳Remaining Obligation(s)

       →DP Problem 6

         ↳Remaining Obligation(s)

       →DP Problem 7

         ↳Remaining Obligation(s)

       →DP Problem 8

         ↳Remaining Obligation(s)

The following remains to be proven:

Dependency Pair:
SEL(s(X), cons(Y, Z)) -> SEL(X, Z)

Rules:

sel(s(X), cons(Y, Z)) -> sel(X, Z)
sel(0, cons(X, Z)) -> X
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
from(X) -> cons(X, from(s(X)))
sel1(s(X), cons(Y, Z)) -> sel1(X, Z)
sel1(0, cons(X, Z)) -> quote(X)
first1(0, Z) -> nil1
first1(s(X), cons(Y, Z)) -> cons1(quote(Y), first1(X, Z))
quote(0) -> 01
quote(s(X)) -> s1(quote(X))
quote(sel(X, Z)) -> sel1(X, Z)
quote1(cons(X, Z)) -> cons1(quote(X), quote1(Z))
quote1(nil) -> nil1
quote1(first(X, Z)) -> first1(X, Z)
unquote(01) -> 0
unquote(s1(X)) -> s(unquote(X))
unquote1(nil1) -> nil
unquote1(cons1(X, Z)) -> fcons(unquote(X), unquote1(Z))
fcons(X, Z) -> cons(X, Z)
Dependency Pair:
FIRST(s(X), cons(Y, Z)) -> FIRST(X, Z)

Rules:

sel(s(X), cons(Y, Z)) -> sel(X, Z)
sel(0, cons(X, Z)) -> X
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
from(X) -> cons(X, from(s(X)))
sel1(s(X), cons(Y, Z)) -> sel1(X, Z)
sel1(0, cons(X, Z)) -> quote(X)
first1(0, Z) -> nil1
first1(s(X), cons(Y, Z)) -> cons1(quote(Y), first1(X, Z))
quote(0) -> 01
quote(s(X)) -> s1(quote(X))
quote(sel(X, Z)) -> sel1(X, Z)
quote1(cons(X, Z)) -> cons1(quote(X), quote1(Z))
quote1(nil) -> nil1
quote1(first(X, Z)) -> first1(X, Z)
unquote(01) -> 0
unquote(s1(X)) -> s(unquote(X))
unquote1(nil1) -> nil
unquote1(cons1(X, Z)) -> fcons(unquote(X), unquote1(Z))
fcons(X, Z) -> cons(X, Z)
Dependency Pair:
FROM(X) -> FROM(s(X))

Rules:

sel(s(X), cons(Y, Z)) -> sel(X, Z)
sel(0, cons(X, Z)) -> X
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
from(X) -> cons(X, from(s(X)))
sel1(s(X), cons(Y, Z)) -> sel1(X, Z)
sel1(0, cons(X, Z)) -> quote(X)
first1(0, Z) -> nil1
first1(s(X), cons(Y, Z)) -> cons1(quote(Y), first1(X, Z))
quote(0) -> 01
quote(s(X)) -> s1(quote(X))
quote(sel(X, Z)) -> sel1(X, Z)
quote1(cons(X, Z)) -> cons1(quote(X), quote1(Z))
quote1(nil) -> nil1
quote1(first(X, Z)) -> first1(X, Z)
unquote(01) -> 0
unquote(s1(X)) -> s(unquote(X))
unquote1(nil1) -> nil
unquote1(cons1(X, Z)) -> fcons(unquote(X), unquote1(Z))
fcons(X, Z) -> cons(X, Z)
Dependency Pairs:
QUOTE(sel(X, Z)) -> SEL1(X, Z)
QUOTE(s(X)) -> QUOTE(X)
SEL1(0, cons(X, Z)) -> QUOTE(X)
SEL1(s(X), cons(Y, Z)) -> SEL1(X, Z)

Rules:

sel(s(X), cons(Y, Z)) -> sel(X, Z)
sel(0, cons(X, Z)) -> X
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
from(X) -> cons(X, from(s(X)))
sel1(s(X), cons(Y, Z)) -> sel1(X, Z)
sel1(0, cons(X, Z)) -> quote(X)
first1(0, Z) -> nil1
first1(s(X), cons(Y, Z)) -> cons1(quote(Y), first1(X, Z))
quote(0) -> 01
quote(s(X)) -> s1(quote(X))
quote(sel(X, Z)) -> sel1(X, Z)
quote1(cons(X, Z)) -> cons1(quote(X), quote1(Z))
quote1(nil) -> nil1
quote1(first(X, Z)) -> first1(X, Z)
unquote(01) -> 0
unquote(s1(X)) -> s(unquote(X))
unquote1(nil1) -> nil
unquote1(cons1(X, Z)) -> fcons(unquote(X), unquote1(Z))
fcons(X, Z) -> cons(X, Z)
Dependency Pair:
UNQUOTE(s1(X)) -> UNQUOTE(X)

Rules:

sel(s(X), cons(Y, Z)) -> sel(X, Z)
sel(0, cons(X, Z)) -> X
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
from(X) -> cons(X, from(s(X)))
sel1(s(X), cons(Y, Z)) -> sel1(X, Z)
sel1(0, cons(X, Z)) -> quote(X)
first1(0, Z) -> nil1
first1(s(X), cons(Y, Z)) -> cons1(quote(Y), first1(X, Z))
quote(0) -> 01
quote(s(X)) -> s1(quote(X))
quote(sel(X, Z)) -> sel1(X, Z)
quote1(cons(X, Z)) -> cons1(quote(X), quote1(Z))
quote1(nil) -> nil1
quote1(first(X, Z)) -> first1(X, Z)
unquote(01) -> 0
unquote(s1(X)) -> s(unquote(X))
unquote1(nil1) -> nil
unquote1(cons1(X, Z)) -> fcons(unquote(X), unquote1(Z))
fcons(X, Z) -> cons(X, Z)
Dependency Pair:
FIRST1(s(X), cons(Y, Z)) -> FIRST1(X, Z)

Rules:

sel(s(X), cons(Y, Z)) -> sel(X, Z)
sel(0, cons(X, Z)) -> X
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
from(X) -> cons(X, from(s(X)))
sel1(s(X), cons(Y, Z)) -> sel1(X, Z)
sel1(0, cons(X, Z)) -> quote(X)
first1(0, Z) -> nil1
first1(s(X), cons(Y, Z)) -> cons1(quote(Y), first1(X, Z))
quote(0) -> 01
quote(s(X)) -> s1(quote(X))
quote(sel(X, Z)) -> sel1(X, Z)
quote1(cons(X, Z)) -> cons1(quote(X), quote1(Z))
quote1(nil) -> nil1
quote1(first(X, Z)) -> first1(X, Z)
unquote(01) -> 0
unquote(s1(X)) -> s(unquote(X))
unquote1(nil1) -> nil
unquote1(cons1(X, Z)) -> fcons(unquote(X), unquote1(Z))
fcons(X, Z) -> cons(X, Z)
Dependency Pair:
UNQUOTE1(cons1(X, Z)) -> UNQUOTE1(Z)

Rules:

sel(s(X), cons(Y, Z)) -> sel(X, Z)
sel(0, cons(X, Z)) -> X
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
from(X) -> cons(X, from(s(X)))
sel1(s(X), cons(Y, Z)) -> sel1(X, Z)
sel1(0, cons(X, Z)) -> quote(X)
first1(0, Z) -> nil1
first1(s(X), cons(Y, Z)) -> cons1(quote(Y), first1(X, Z))
quote(0) -> 01
quote(s(X)) -> s1(quote(X))
quote(sel(X, Z)) -> sel1(X, Z)
quote1(cons(X, Z)) -> cons1(quote(X), quote1(Z))
quote1(nil) -> nil1
quote1(first(X, Z)) -> first1(X, Z)
unquote(01) -> 0
unquote(s1(X)) -> s(unquote(X))
unquote1(nil1) -> nil
unquote1(cons1(X, Z)) -> fcons(unquote(X), unquote1(Z))
fcons(X, Z) -> cons(X, Z)
Dependency Pair:
QUOTE1(cons(X, Z)) -> QUOTE1(Z)

Rules:

sel(s(X), cons(Y, Z)) -> sel(X, Z)
sel(0, cons(X, Z)) -> X
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
from(X) -> cons(X, from(s(X)))
sel1(s(X), cons(Y, Z)) -> sel1(X, Z)
sel1(0, cons(X, Z)) -> quote(X)
first1(0, Z) -> nil1
first1(s(X), cons(Y, Z)) -> cons1(quote(Y), first1(X, Z))
quote(0) -> 01
quote(s(X)) -> s1(quote(X))
quote(sel(X, Z)) -> sel1(X, Z)
quote1(cons(X, Z)) -> cons1(quote(X), quote1(Z))
quote1(nil) -> nil1
quote1(first(X, Z)) -> first1(X, Z)
unquote(01) -> 0
unquote(s1(X)) -> s(unquote(X))
unquote1(nil1) -> nil
unquote1(cons1(X, Z)) -> fcons(unquote(X), unquote1(Z))
fcons(X, Z) -> cons(X, Z)

     ↳DPs

       →DP Problem 1

         ↳Remaining Obligation(s)

       →DP Problem 2

         ↳Remaining Obligation(s)

       →DP Problem 3

         ↳Remaining Obligation(s)

       →DP Problem 4

         ↳Remaining Obligation(s)

       →DP Problem 5

         ↳Remaining Obligation(s)

       →DP Problem 6

         ↳Remaining Obligation(s)

       →DP Problem 7

         ↳Remaining Obligation(s)

       →DP Problem 8

         ↳Remaining Obligation(s)

The following remains to be proven:

Dependency Pair:
SEL(s(X), cons(Y, Z)) -> SEL(X, Z)

Rules:

sel(s(X), cons(Y, Z)) -> sel(X, Z)
sel(0, cons(X, Z)) -> X
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
from(X) -> cons(X, from(s(X)))
sel1(s(X), cons(Y, Z)) -> sel1(X, Z)
sel1(0, cons(X, Z)) -> quote(X)
first1(0, Z) -> nil1
first1(s(X), cons(Y, Z)) -> cons1(quote(Y), first1(X, Z))
quote(0) -> 01
quote(s(X)) -> s1(quote(X))
quote(sel(X, Z)) -> sel1(X, Z)
quote1(cons(X, Z)) -> cons1(quote(X), quote1(Z))
quote1(nil) -> nil1
quote1(first(X, Z)) -> first1(X, Z)
unquote(01) -> 0
unquote(s1(X)) -> s(unquote(X))
unquote1(nil1) -> nil
unquote1(cons1(X, Z)) -> fcons(unquote(X), unquote1(Z))
fcons(X, Z) -> cons(X, Z)
Dependency Pair:
FIRST(s(X), cons(Y, Z)) -> FIRST(X, Z)

Rules:

sel(s(X), cons(Y, Z)) -> sel(X, Z)
sel(0, cons(X, Z)) -> X
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
from(X) -> cons(X, from(s(X)))
sel1(s(X), cons(Y, Z)) -> sel1(X, Z)
sel1(0, cons(X, Z)) -> quote(X)
first1(0, Z) -> nil1
first1(s(X), cons(Y, Z)) -> cons1(quote(Y), first1(X, Z))
quote(0) -> 01
quote(s(X)) -> s1(quote(X))
quote(sel(X, Z)) -> sel1(X, Z)
quote1(cons(X, Z)) -> cons1(quote(X), quote1(Z))
quote1(nil) -> nil1
quote1(first(X, Z)) -> first1(X, Z)
unquote(01) -> 0
unquote(s1(X)) -> s(unquote(X))
unquote1(nil1) -> nil
unquote1(cons1(X, Z)) -> fcons(unquote(X), unquote1(Z))
fcons(X, Z) -> cons(X, Z)
Dependency Pair:
FROM(X) -> FROM(s(X))

Rules:

sel(s(X), cons(Y, Z)) -> sel(X, Z)
sel(0, cons(X, Z)) -> X
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
from(X) -> cons(X, from(s(X)))
sel1(s(X), cons(Y, Z)) -> sel1(X, Z)
sel1(0, cons(X, Z)) -> quote(X)
first1(0, Z) -> nil1
first1(s(X), cons(Y, Z)) -> cons1(quote(Y), first1(X, Z))
quote(0) -> 01
quote(s(X)) -> s1(quote(X))
quote(sel(X, Z)) -> sel1(X, Z)
quote1(cons(X, Z)) -> cons1(quote(X), quote1(Z))
quote1(nil) -> nil1
quote1(first(X, Z)) -> first1(X, Z)
unquote(01) -> 0
unquote(s1(X)) -> s(unquote(X))
unquote1(nil1) -> nil
unquote1(cons1(X, Z)) -> fcons(unquote(X), unquote1(Z))
fcons(X, Z) -> cons(X, Z)
Dependency Pairs:
QUOTE(sel(X, Z)) -> SEL1(X, Z)
QUOTE(s(X)) -> QUOTE(X)
SEL1(0, cons(X, Z)) -> QUOTE(X)
SEL1(s(X), cons(Y, Z)) -> SEL1(X, Z)

Rules:

sel(s(X), cons(Y, Z)) -> sel(X, Z)
sel(0, cons(X, Z)) -> X
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
from(X) -> cons(X, from(s(X)))
sel1(s(X), cons(Y, Z)) -> sel1(X, Z)
sel1(0, cons(X, Z)) -> quote(X)
first1(0, Z) -> nil1
first1(s(X), cons(Y, Z)) -> cons1(quote(Y), first1(X, Z))
quote(0) -> 01
quote(s(X)) -> s1(quote(X))
quote(sel(X, Z)) -> sel1(X, Z)
quote1(cons(X, Z)) -> cons1(quote(X), quote1(Z))
quote1(nil) -> nil1
quote1(first(X, Z)) -> first1(X, Z)
unquote(01) -> 0
unquote(s1(X)) -> s(unquote(X))
unquote1(nil1) -> nil
unquote1(cons1(X, Z)) -> fcons(unquote(X), unquote1(Z))
fcons(X, Z) -> cons(X, Z)
Dependency Pair:
UNQUOTE(s1(X)) -> UNQUOTE(X)

Rules:

sel(s(X), cons(Y, Z)) -> sel(X, Z)
sel(0, cons(X, Z)) -> X
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
from(X) -> cons(X, from(s(X)))
sel1(s(X), cons(Y, Z)) -> sel1(X, Z)
sel1(0, cons(X, Z)) -> quote(X)
first1(0, Z) -> nil1
first1(s(X), cons(Y, Z)) -> cons1(quote(Y), first1(X, Z))
quote(0) -> 01
quote(s(X)) -> s1(quote(X))
quote(sel(X, Z)) -> sel1(X, Z)
quote1(cons(X, Z)) -> cons1(quote(X), quote1(Z))
quote1(nil) -> nil1
quote1(first(X, Z)) -> first1(X, Z)
unquote(01) -> 0
unquote(s1(X)) -> s(unquote(X))
unquote1(nil1) -> nil
unquote1(cons1(X, Z)) -> fcons(unquote(X), unquote1(Z))
fcons(X, Z) -> cons(X, Z)
Dependency Pair:
FIRST1(s(X), cons(Y, Z)) -> FIRST1(X, Z)

Rules:

sel(s(X), cons(Y, Z)) -> sel(X, Z)
sel(0, cons(X, Z)) -> X
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
from(X) -> cons(X, from(s(X)))
sel1(s(X), cons(Y, Z)) -> sel1(X, Z)
sel1(0, cons(X, Z)) -> quote(X)
first1(0, Z) -> nil1
first1(s(X), cons(Y, Z)) -> cons1(quote(Y), first1(X, Z))
quote(0) -> 01
quote(s(X)) -> s1(quote(X))
quote(sel(X, Z)) -> sel1(X, Z)
quote1(cons(X, Z)) -> cons1(quote(X), quote1(Z))
quote1(nil) -> nil1
quote1(first(X, Z)) -> first1(X, Z)
unquote(01) -> 0
unquote(s1(X)) -> s(unquote(X))
unquote1(nil1) -> nil
unquote1(cons1(X, Z)) -> fcons(unquote(X), unquote1(Z))
fcons(X, Z) -> cons(X, Z)
Dependency Pair:
UNQUOTE1(cons1(X, Z)) -> UNQUOTE1(Z)

Rules:

sel(s(X), cons(Y, Z)) -> sel(X, Z)
sel(0, cons(X, Z)) -> X
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
from(X) -> cons(X, from(s(X)))
sel1(s(X), cons(Y, Z)) -> sel1(X, Z)
sel1(0, cons(X, Z)) -> quote(X)
first1(0, Z) -> nil1
first1(s(X), cons(Y, Z)) -> cons1(quote(Y), first1(X, Z))
quote(0) -> 01
quote(s(X)) -> s1(quote(X))
quote(sel(X, Z)) -> sel1(X, Z)
quote1(cons(X, Z)) -> cons1(quote(X), quote1(Z))
quote1(nil) -> nil1
quote1(first(X, Z)) -> first1(X, Z)
unquote(01) -> 0
unquote(s1(X)) -> s(unquote(X))
unquote1(nil1) -> nil
unquote1(cons1(X, Z)) -> fcons(unquote(X), unquote1(Z))
fcons(X, Z) -> cons(X, Z)
Dependency Pair:
QUOTE1(cons(X, Z)) -> QUOTE1(Z)

Rules:

sel(s(X), cons(Y, Z)) -> sel(X, Z)
sel(0, cons(X, Z)) -> X
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
from(X) -> cons(X, from(s(X)))
sel1(s(X), cons(Y, Z)) -> sel1(X, Z)
sel1(0, cons(X, Z)) -> quote(X)
first1(0, Z) -> nil1
first1(s(X), cons(Y, Z)) -> cons1(quote(Y), first1(X, Z))
quote(0) -> 01
quote(s(X)) -> s1(quote(X))
quote(sel(X, Z)) -> sel1(X, Z)
quote1(cons(X, Z)) -> cons1(quote(X), quote1(Z))
quote1(nil) -> nil1
quote1(first(X, Z)) -> first1(X, Z)
unquote(01) -> 0
unquote(s1(X)) -> s(unquote(X))
unquote1(nil1) -> nil
unquote1(cons1(X, Z)) -> fcons(unquote(X), unquote1(Z))
fcons(X, Z) -> cons(X, Z)

     ↳DPs

       →DP Problem 1

         ↳Remaining Obligation(s)

       →DP Problem 2

         ↳Remaining Obligation(s)

       →DP Problem 3

         ↳Remaining Obligation(s)

       →DP Problem 4

         ↳Remaining Obligation(s)

       →DP Problem 5

         ↳Remaining Obligation(s)

       →DP Problem 6

         ↳Remaining Obligation(s)

       →DP Problem 7

         ↳Remaining Obligation(s)

       →DP Problem 8

         ↳Remaining Obligation(s)

The following remains to be proven:

Dependency Pair:
SEL(s(X), cons(Y, Z)) -> SEL(X, Z)

Rules:

sel(s(X), cons(Y, Z)) -> sel(X, Z)
sel(0, cons(X, Z)) -> X
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
from(X) -> cons(X, from(s(X)))
sel1(s(X), cons(Y, Z)) -> sel1(X, Z)
sel1(0, cons(X, Z)) -> quote(X)
first1(0, Z) -> nil1
first1(s(X), cons(Y, Z)) -> cons1(quote(Y), first1(X, Z))
quote(0) -> 01
quote(s(X)) -> s1(quote(X))
quote(sel(X, Z)) -> sel1(X, Z)
quote1(cons(X, Z)) -> cons1(quote(X), quote1(Z))
quote1(nil) -> nil1
quote1(first(X, Z)) -> first1(X, Z)
unquote(01) -> 0
unquote(s1(X)) -> s(unquote(X))
unquote1(nil1) -> nil
unquote1(cons1(X, Z)) -> fcons(unquote(X), unquote1(Z))
fcons(X, Z) -> cons(X, Z)
Dependency Pair:
FIRST(s(X), cons(Y, Z)) -> FIRST(X, Z)

Rules:

sel(s(X), cons(Y, Z)) -> sel(X, Z)
sel(0, cons(X, Z)) -> X
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
from(X) -> cons(X, from(s(X)))
sel1(s(X), cons(Y, Z)) -> sel1(X, Z)
sel1(0, cons(X, Z)) -> quote(X)
first1(0, Z) -> nil1
first1(s(X), cons(Y, Z)) -> cons1(quote(Y), first1(X, Z))
quote(0) -> 01
quote(s(X)) -> s1(quote(X))
quote(sel(X, Z)) -> sel1(X, Z)
quote1(cons(X, Z)) -> cons1(quote(X), quote1(Z))
quote1(nil) -> nil1
quote1(first(X, Z)) -> first1(X, Z)
unquote(01) -> 0
unquote(s1(X)) -> s(unquote(X))
unquote1(nil1) -> nil
unquote1(cons1(X, Z)) -> fcons(unquote(X), unquote1(Z))
fcons(X, Z) -> cons(X, Z)
Dependency Pair:
FROM(X) -> FROM(s(X))

Rules:

sel(s(X), cons(Y, Z)) -> sel(X, Z)
sel(0, cons(X, Z)) -> X
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
from(X) -> cons(X, from(s(X)))
sel1(s(X), cons(Y, Z)) -> sel1(X, Z)
sel1(0, cons(X, Z)) -> quote(X)
first1(0, Z) -> nil1
first1(s(X), cons(Y, Z)) -> cons1(quote(Y), first1(X, Z))
quote(0) -> 01
quote(s(X)) -> s1(quote(X))
quote(sel(X, Z)) -> sel1(X, Z)
quote1(cons(X, Z)) -> cons1(quote(X), quote1(Z))
quote1(nil) -> nil1
quote1(first(X, Z)) -> first1(X, Z)
unquote(01) -> 0
unquote(s1(X)) -> s(unquote(X))
unquote1(nil1) -> nil
unquote1(cons1(X, Z)) -> fcons(unquote(X), unquote1(Z))
fcons(X, Z) -> cons(X, Z)
Dependency Pairs:
QUOTE(sel(X, Z)) -> SEL1(X, Z)
QUOTE(s(X)) -> QUOTE(X)
SEL1(0, cons(X, Z)) -> QUOTE(X)
SEL1(s(X), cons(Y, Z)) -> SEL1(X, Z)

Rules:

sel(s(X), cons(Y, Z)) -> sel(X, Z)
sel(0, cons(X, Z)) -> X
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
from(X) -> cons(X, from(s(X)))
sel1(s(X), cons(Y, Z)) -> sel1(X, Z)
sel1(0, cons(X, Z)) -> quote(X)
first1(0, Z) -> nil1
first1(s(X), cons(Y, Z)) -> cons1(quote(Y), first1(X, Z))
quote(0) -> 01
quote(s(X)) -> s1(quote(X))
quote(sel(X, Z)) -> sel1(X, Z)
quote1(cons(X, Z)) -> cons1(quote(X), quote1(Z))
quote1(nil) -> nil1
quote1(first(X, Z)) -> first1(X, Z)
unquote(01) -> 0
unquote(s1(X)) -> s(unquote(X))
unquote1(nil1) -> nil
unquote1(cons1(X, Z)) -> fcons(unquote(X), unquote1(Z))
fcons(X, Z) -> cons(X, Z)
Dependency Pair:
UNQUOTE(s1(X)) -> UNQUOTE(X)

Rules:

sel(s(X), cons(Y, Z)) -> sel(X, Z)
sel(0, cons(X, Z)) -> X
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
from(X) -> cons(X, from(s(X)))
sel1(s(X), cons(Y, Z)) -> sel1(X, Z)
sel1(0, cons(X, Z)) -> quote(X)
first1(0, Z) -> nil1
first1(s(X), cons(Y, Z)) -> cons1(quote(Y), first1(X, Z))
quote(0) -> 01
quote(s(X)) -> s1(quote(X))
quote(sel(X, Z)) -> sel1(X, Z)
quote1(cons(X, Z)) -> cons1(quote(X), quote1(Z))
quote1(nil) -> nil1
quote1(first(X, Z)) -> first1(X, Z)
unquote(01) -> 0
unquote(s1(X)) -> s(unquote(X))
unquote1(nil1) -> nil
unquote1(cons1(X, Z)) -> fcons(unquote(X), unquote1(Z))
fcons(X, Z) -> cons(X, Z)
Dependency Pair:
FIRST1(s(X), cons(Y, Z)) -> FIRST1(X, Z)

Rules:

sel(s(X), cons(Y, Z)) -> sel(X, Z)
sel(0, cons(X, Z)) -> X
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
from(X) -> cons(X, from(s(X)))
sel1(s(X), cons(Y, Z)) -> sel1(X, Z)
sel1(0, cons(X, Z)) -> quote(X)
first1(0, Z) -> nil1
first1(s(X), cons(Y, Z)) -> cons1(quote(Y), first1(X, Z))
quote(0) -> 01
quote(s(X)) -> s1(quote(X))
quote(sel(X, Z)) -> sel1(X, Z)
quote1(cons(X, Z)) -> cons1(quote(X), quote1(Z))
quote1(nil) -> nil1
quote1(first(X, Z)) -> first1(X, Z)
unquote(01) -> 0
unquote(s1(X)) -> s(unquote(X))
unquote1(nil1) -> nil
unquote1(cons1(X, Z)) -> fcons(unquote(X), unquote1(Z))
fcons(X, Z) -> cons(X, Z)
Dependency Pair:
UNQUOTE1(cons1(X, Z)) -> UNQUOTE1(Z)

Rules:

sel(s(X), cons(Y, Z)) -> sel(X, Z)
sel(0, cons(X, Z)) -> X
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
from(X) -> cons(X, from(s(X)))
sel1(s(X), cons(Y, Z)) -> sel1(X, Z)
sel1(0, cons(X, Z)) -> quote(X)
first1(0, Z) -> nil1
first1(s(X), cons(Y, Z)) -> cons1(quote(Y), first1(X, Z))
quote(0) -> 01
quote(s(X)) -> s1(quote(X))
quote(sel(X, Z)) -> sel1(X, Z)
quote1(cons(X, Z)) -> cons1(quote(X), quote1(Z))
quote1(nil) -> nil1
quote1(first(X, Z)) -> first1(X, Z)
unquote(01) -> 0
unquote(s1(X)) -> s(unquote(X))
unquote1(nil1) -> nil
unquote1(cons1(X, Z)) -> fcons(unquote(X), unquote1(Z))
fcons(X, Z) -> cons(X, Z)
Dependency Pair:
QUOTE1(cons(X, Z)) -> QUOTE1(Z)

Rules:

sel(s(X), cons(Y, Z)) -> sel(X, Z)
sel(0, cons(X, Z)) -> X
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
from(X) -> cons(X, from(s(X)))
sel1(s(X), cons(Y, Z)) -> sel1(X, Z)
sel1(0, cons(X, Z)) -> quote(X)
first1(0, Z) -> nil1
first1(s(X), cons(Y, Z)) -> cons1(quote(Y), first1(X, Z))
quote(0) -> 01
quote(s(X)) -> s1(quote(X))
quote(sel(X, Z)) -> sel1(X, Z)
quote1(cons(X, Z)) -> cons1(quote(X), quote1(Z))
quote1(nil) -> nil1
quote1(first(X, Z)) -> first1(X, Z)
unquote(01) -> 0
unquote(s1(X)) -> s(unquote(X))
unquote1(nil1) -> nil
unquote1(cons1(X, Z)) -> fcons(unquote(X), unquote1(Z))
fcons(X, Z) -> cons(X, Z)

     ↳DPs

       →DP Problem 1

         ↳Remaining Obligation(s)

       →DP Problem 2

         ↳Remaining Obligation(s)

       →DP Problem 3

         ↳Remaining Obligation(s)

       →DP Problem 4

         ↳Remaining Obligation(s)

       →DP Problem 5

         ↳Remaining Obligation(s)

       →DP Problem 6

         ↳Remaining Obligation(s)

       →DP Problem 7

         ↳Remaining Obligation(s)

       →DP Problem 8

         ↳Remaining Obligation(s)

The following remains to be proven:

Dependency Pair:
SEL(s(X), cons(Y, Z)) -> SEL(X, Z)

Rules:

sel(s(X), cons(Y, Z)) -> sel(X, Z)
sel(0, cons(X, Z)) -> X
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
from(X) -> cons(X, from(s(X)))
sel1(s(X), cons(Y, Z)) -> sel1(X, Z)
sel1(0, cons(X, Z)) -> quote(X)
first1(0, Z) -> nil1
first1(s(X), cons(Y, Z)) -> cons1(quote(Y), first1(X, Z))
quote(0) -> 01
quote(s(X)) -> s1(quote(X))
quote(sel(X, Z)) -> sel1(X, Z)
quote1(cons(X, Z)) -> cons1(quote(X), quote1(Z))
quote1(nil) -> nil1
quote1(first(X, Z)) -> first1(X, Z)
unquote(01) -> 0
unquote(s1(X)) -> s(unquote(X))
unquote1(nil1) -> nil
unquote1(cons1(X, Z)) -> fcons(unquote(X), unquote1(Z))
fcons(X, Z) -> cons(X, Z)
Dependency Pair:
FIRST(s(X), cons(Y, Z)) -> FIRST(X, Z)

Rules:

sel(s(X), cons(Y, Z)) -> sel(X, Z)
sel(0, cons(X, Z)) -> X
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
from(X) -> cons(X, from(s(X)))
sel1(s(X), cons(Y, Z)) -> sel1(X, Z)
sel1(0, cons(X, Z)) -> quote(X)
first1(0, Z) -> nil1
first1(s(X), cons(Y, Z)) -> cons1(quote(Y), first1(X, Z))
quote(0) -> 01
quote(s(X)) -> s1(quote(X))
quote(sel(X, Z)) -> sel1(X, Z)
quote1(cons(X, Z)) -> cons1(quote(X), quote1(Z))
quote1(nil) -> nil1
quote1(first(X, Z)) -> first1(X, Z)
unquote(01) -> 0
unquote(s1(X)) -> s(unquote(X))
unquote1(nil1) -> nil
unquote1(cons1(X, Z)) -> fcons(unquote(X), unquote1(Z))
fcons(X, Z) -> cons(X, Z)
Dependency Pair:
FROM(X) -> FROM(s(X))

Rules:

sel(s(X), cons(Y, Z)) -> sel(X, Z)
sel(0, cons(X, Z)) -> X
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
from(X) -> cons(X, from(s(X)))
sel1(s(X), cons(Y, Z)) -> sel1(X, Z)
sel1(0, cons(X, Z)) -> quote(X)
first1(0, Z) -> nil1
first1(s(X), cons(Y, Z)) -> cons1(quote(Y), first1(X, Z))
quote(0) -> 01
quote(s(X)) -> s1(quote(X))
quote(sel(X, Z)) -> sel1(X, Z)
quote1(cons(X, Z)) -> cons1(quote(X), quote1(Z))
quote1(nil) -> nil1
quote1(first(X, Z)) -> first1(X, Z)
unquote(01) -> 0
unquote(s1(X)) -> s(unquote(X))
unquote1(nil1) -> nil
unquote1(cons1(X, Z)) -> fcons(unquote(X), unquote1(Z))
fcons(X, Z) -> cons(X, Z)
Dependency Pairs:
QUOTE(sel(X, Z)) -> SEL1(X, Z)
QUOTE(s(X)) -> QUOTE(X)
SEL1(0, cons(X, Z)) -> QUOTE(X)
SEL1(s(X), cons(Y, Z)) -> SEL1(X, Z)

Rules:

sel(s(X), cons(Y, Z)) -> sel(X, Z)
sel(0, cons(X, Z)) -> X
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
from(X) -> cons(X, from(s(X)))
sel1(s(X), cons(Y, Z)) -> sel1(X, Z)
sel1(0, cons(X, Z)) -> quote(X)
first1(0, Z) -> nil1
first1(s(X), cons(Y, Z)) -> cons1(quote(Y), first1(X, Z))
quote(0) -> 01
quote(s(X)) -> s1(quote(X))
quote(sel(X, Z)) -> sel1(X, Z)
quote1(cons(X, Z)) -> cons1(quote(X), quote1(Z))
quote1(nil) -> nil1
quote1(first(X, Z)) -> first1(X, Z)
unquote(01) -> 0
unquote(s1(X)) -> s(unquote(X))
unquote1(nil1) -> nil
unquote1(cons1(X, Z)) -> fcons(unquote(X), unquote1(Z))
fcons(X, Z) -> cons(X, Z)
Dependency Pair:
UNQUOTE(s1(X)) -> UNQUOTE(X)

Rules:

sel(s(X), cons(Y, Z)) -> sel(X, Z)
sel(0, cons(X, Z)) -> X
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
from(X) -> cons(X, from(s(X)))
sel1(s(X), cons(Y, Z)) -> sel1(X, Z)
sel1(0, cons(X, Z)) -> quote(X)
first1(0, Z) -> nil1
first1(s(X), cons(Y, Z)) -> cons1(quote(Y), first1(X, Z))
quote(0) -> 01
quote(s(X)) -> s1(quote(X))
quote(sel(X, Z)) -> sel1(X, Z)
quote1(cons(X, Z)) -> cons1(quote(X), quote1(Z))
quote1(nil) -> nil1
quote1(first(X, Z)) -> first1(X, Z)
unquote(01) -> 0
unquote(s1(X)) -> s(unquote(X))
unquote1(nil1) -> nil
unquote1(cons1(X, Z)) -> fcons(unquote(X), unquote1(Z))
fcons(X, Z) -> cons(X, Z)
Dependency Pair:
FIRST1(s(X), cons(Y, Z)) -> FIRST1(X, Z)

Rules:

sel(s(X), cons(Y, Z)) -> sel(X, Z)
sel(0, cons(X, Z)) -> X
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
from(X) -> cons(X, from(s(X)))
sel1(s(X), cons(Y, Z)) -> sel1(X, Z)
sel1(0, cons(X, Z)) -> quote(X)
first1(0, Z) -> nil1
first1(s(X), cons(Y, Z)) -> cons1(quote(Y), first1(X, Z))
quote(0) -> 01
quote(s(X)) -> s1(quote(X))
quote(sel(X, Z)) -> sel1(X, Z)
quote1(cons(X, Z)) -> cons1(quote(X), quote1(Z))
quote1(nil) -> nil1
quote1(first(X, Z)) -> first1(X, Z)
unquote(01) -> 0
unquote(s1(X)) -> s(unquote(X))
unquote1(nil1) -> nil
unquote1(cons1(X, Z)) -> fcons(unquote(X), unquote1(Z))
fcons(X, Z) -> cons(X, Z)
Dependency Pair:
UNQUOTE1(cons1(X, Z)) -> UNQUOTE1(Z)

Rules:

sel(s(X), cons(Y, Z)) -> sel(X, Z)
sel(0, cons(X, Z)) -> X
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
from(X) -> cons(X, from(s(X)))
sel1(s(X), cons(Y, Z)) -> sel1(X, Z)
sel1(0, cons(X, Z)) -> quote(X)
first1(0, Z) -> nil1
first1(s(X), cons(Y, Z)) -> cons1(quote(Y), first1(X, Z))
quote(0) -> 01
quote(s(X)) -> s1(quote(X))
quote(sel(X, Z)) -> sel1(X, Z)
quote1(cons(X, Z)) -> cons1(quote(X), quote1(Z))
quote1(nil) -> nil1
quote1(first(X, Z)) -> first1(X, Z)
unquote(01) -> 0
unquote(s1(X)) -> s(unquote(X))
unquote1(nil1) -> nil
unquote1(cons1(X, Z)) -> fcons(unquote(X), unquote1(Z))
fcons(X, Z) -> cons(X, Z)
Dependency Pair:
QUOTE1(cons(X, Z)) -> QUOTE1(Z)

Rules:

sel(s(X), cons(Y, Z)) -> sel(X, Z)
sel(0, cons(X, Z)) -> X
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
from(X) -> cons(X, from(s(X)))
sel1(s(X), cons(Y, Z)) -> sel1(X, Z)
sel1(0, cons(X, Z)) -> quote(X)
first1(0, Z) -> nil1
first1(s(X), cons(Y, Z)) -> cons1(quote(Y), first1(X, Z))
quote(0) -> 01
quote(s(X)) -> s1(quote(X))
quote(sel(X, Z)) -> sel1(X, Z)
quote1(cons(X, Z)) -> cons1(quote(X), quote1(Z))
quote1(nil) -> nil1
quote1(first(X, Z)) -> first1(X, Z)
unquote(01) -> 0
unquote(s1(X)) -> s(unquote(X))
unquote1(nil1) -> nil
unquote1(cons1(X, Z)) -> fcons(unquote(X), unquote1(Z))
fcons(X, Z) -> cons(X, Z)

     ↳DPs

       →DP Problem 1

         ↳Remaining Obligation(s)

       →DP Problem 2

         ↳Remaining Obligation(s)

       →DP Problem 3

         ↳Remaining Obligation(s)

       →DP Problem 4

         ↳Remaining Obligation(s)

       →DP Problem 5

         ↳Remaining Obligation(s)

       →DP Problem 6

         ↳Remaining Obligation(s)

       →DP Problem 7

         ↳Remaining Obligation(s)

       →DP Problem 8

         ↳Remaining Obligation(s)

The following remains to be proven:

Dependency Pair:
SEL(s(X), cons(Y, Z)) -> SEL(X, Z)

Rules:

sel(s(X), cons(Y, Z)) -> sel(X, Z)
sel(0, cons(X, Z)) -> X
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
from(X) -> cons(X, from(s(X)))
sel1(s(X), cons(Y, Z)) -> sel1(X, Z)
sel1(0, cons(X, Z)) -> quote(X)
first1(0, Z) -> nil1
first1(s(X), cons(Y, Z)) -> cons1(quote(Y), first1(X, Z))
quote(0) -> 01
quote(s(X)) -> s1(quote(X))
quote(sel(X, Z)) -> sel1(X, Z)
quote1(cons(X, Z)) -> cons1(quote(X), quote1(Z))
quote1(nil) -> nil1
quote1(first(X, Z)) -> first1(X, Z)
unquote(01) -> 0
unquote(s1(X)) -> s(unquote(X))
unquote1(nil1) -> nil
unquote1(cons1(X, Z)) -> fcons(unquote(X), unquote1(Z))
fcons(X, Z) -> cons(X, Z)
Dependency Pair:
FIRST(s(X), cons(Y, Z)) -> FIRST(X, Z)

Rules:

sel(s(X), cons(Y, Z)) -> sel(X, Z)
sel(0, cons(X, Z)) -> X
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
from(X) -> cons(X, from(s(X)))
sel1(s(X), cons(Y, Z)) -> sel1(X, Z)
sel1(0, cons(X, Z)) -> quote(X)
first1(0, Z) -> nil1
first1(s(X), cons(Y, Z)) -> cons1(quote(Y), first1(X, Z))
quote(0) -> 01
quote(s(X)) -> s1(quote(X))
quote(sel(X, Z)) -> sel1(X, Z)
quote1(cons(X, Z)) -> cons1(quote(X), quote1(Z))
quote1(nil) -> nil1
quote1(first(X, Z)) -> first1(X, Z)
unquote(01) -> 0
unquote(s1(X)) -> s(unquote(X))
unquote1(nil1) -> nil
unquote1(cons1(X, Z)) -> fcons(unquote(X), unquote1(Z))
fcons(X, Z) -> cons(X, Z)
Dependency Pair:
FROM(X) -> FROM(s(X))

Rules:

sel(s(X), cons(Y, Z)) -> sel(X, Z)
sel(0, cons(X, Z)) -> X
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
from(X) -> cons(X, from(s(X)))
sel1(s(X), cons(Y, Z)) -> sel1(X, Z)
sel1(0, cons(X, Z)) -> quote(X)
first1(0, Z) -> nil1
first1(s(X), cons(Y, Z)) -> cons1(quote(Y), first1(X, Z))
quote(0) -> 01
quote(s(X)) -> s1(quote(X))
quote(sel(X, Z)) -> sel1(X, Z)
quote1(cons(X, Z)) -> cons1(quote(X), quote1(Z))
quote1(nil) -> nil1
quote1(first(X, Z)) -> first1(X, Z)
unquote(01) -> 0
unquote(s1(X)) -> s(unquote(X))
unquote1(nil1) -> nil
unquote1(cons1(X, Z)) -> fcons(unquote(X), unquote1(Z))
fcons(X, Z) -> cons(X, Z)
Dependency Pairs:
QUOTE(sel(X, Z)) -> SEL1(X, Z)
QUOTE(s(X)) -> QUOTE(X)
SEL1(0, cons(X, Z)) -> QUOTE(X)
SEL1(s(X), cons(Y, Z)) -> SEL1(X, Z)

Rules:

sel(s(X), cons(Y, Z)) -> sel(X, Z)
sel(0, cons(X, Z)) -> X
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
from(X) -> cons(X, from(s(X)))
sel1(s(X), cons(Y, Z)) -> sel1(X, Z)
sel1(0, cons(X, Z)) -> quote(X)
first1(0, Z) -> nil1
first1(s(X), cons(Y, Z)) -> cons1(quote(Y), first1(X, Z))
quote(0) -> 01
quote(s(X)) -> s1(quote(X))
quote(sel(X, Z)) -> sel1(X, Z)
quote1(cons(X, Z)) -> cons1(quote(X), quote1(Z))
quote1(nil) -> nil1
quote1(first(X, Z)) -> first1(X, Z)
unquote(01) -> 0
unquote(s1(X)) -> s(unquote(X))
unquote1(nil1) -> nil
unquote1(cons1(X, Z)) -> fcons(unquote(X), unquote1(Z))
fcons(X, Z) -> cons(X, Z)
Dependency Pair:
UNQUOTE(s1(X)) -> UNQUOTE(X)

Rules:

sel(s(X), cons(Y, Z)) -> sel(X, Z)
sel(0, cons(X, Z)) -> X
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
from(X) -> cons(X, from(s(X)))
sel1(s(X), cons(Y, Z)) -> sel1(X, Z)
sel1(0, cons(X, Z)) -> quote(X)
first1(0, Z) -> nil1
first1(s(X), cons(Y, Z)) -> cons1(quote(Y), first1(X, Z))
quote(0) -> 01
quote(s(X)) -> s1(quote(X))
quote(sel(X, Z)) -> sel1(X, Z)
quote1(cons(X, Z)) -> cons1(quote(X), quote1(Z))
quote1(nil) -> nil1
quote1(first(X, Z)) -> first1(X, Z)
unquote(01) -> 0
unquote(s1(X)) -> s(unquote(X))
unquote1(nil1) -> nil
unquote1(cons1(X, Z)) -> fcons(unquote(X), unquote1(Z))
fcons(X, Z) -> cons(X, Z)
Dependency Pair:
FIRST1(s(X), cons(Y, Z)) -> FIRST1(X, Z)

Rules:

sel(s(X), cons(Y, Z)) -> sel(X, Z)
sel(0, cons(X, Z)) -> X
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
from(X) -> cons(X, from(s(X)))
sel1(s(X), cons(Y, Z)) -> sel1(X, Z)
sel1(0, cons(X, Z)) -> quote(X)
first1(0, Z) -> nil1
first1(s(X), cons(Y, Z)) -> cons1(quote(Y), first1(X, Z))
quote(0) -> 01
quote(s(X)) -> s1(quote(X))
quote(sel(X, Z)) -> sel1(X, Z)
quote1(cons(X, Z)) -> cons1(quote(X), quote1(Z))
quote1(nil) -> nil1
quote1(first(X, Z)) -> first1(X, Z)
unquote(01) -> 0
unquote(s1(X)) -> s(unquote(X))
unquote1(nil1) -> nil
unquote1(cons1(X, Z)) -> fcons(unquote(X), unquote1(Z))
fcons(X, Z) -> cons(X, Z)
Dependency Pair:
UNQUOTE1(cons1(X, Z)) -> UNQUOTE1(Z)

Rules:

sel(s(X), cons(Y, Z)) -> sel(X, Z)
sel(0, cons(X, Z)) -> X
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
from(X) -> cons(X, from(s(X)))
sel1(s(X), cons(Y, Z)) -> sel1(X, Z)
sel1(0, cons(X, Z)) -> quote(X)
first1(0, Z) -> nil1
first1(s(X), cons(Y, Z)) -> cons1(quote(Y), first1(X, Z))
quote(0) -> 01
quote(s(X)) -> s1(quote(X))
quote(sel(X, Z)) -> sel1(X, Z)
quote1(cons(X, Z)) -> cons1(quote(X), quote1(Z))
quote1(nil) -> nil1
quote1(first(X, Z)) -> first1(X, Z)
unquote(01) -> 0
unquote(s1(X)) -> s(unquote(X))
unquote1(nil1) -> nil
unquote1(cons1(X, Z)) -> fcons(unquote(X), unquote1(Z))
fcons(X, Z) -> cons(X, Z)
Dependency Pair:
QUOTE1(cons(X, Z)) -> QUOTE1(Z)

Rules:

sel(s(X), cons(Y, Z)) -> sel(X, Z)
sel(0, cons(X, Z)) -> X
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
from(X) -> cons(X, from(s(X)))
sel1(s(X), cons(Y, Z)) -> sel1(X, Z)
sel1(0, cons(X, Z)) -> quote(X)
first1(0, Z) -> nil1
first1(s(X), cons(Y, Z)) -> cons1(quote(Y), first1(X, Z))
quote(0) -> 01
quote(s(X)) -> s1(quote(X))
quote(sel(X, Z)) -> sel1(X, Z)
quote1(cons(X, Z)) -> cons1(quote(X), quote1(Z))
quote1(nil) -> nil1
quote1(first(X, Z)) -> first1(X, Z)
unquote(01) -> 0
unquote(s1(X)) -> s(unquote(X))
unquote1(nil1) -> nil
unquote1(cons1(X, Z)) -> fcons(unquote(X), unquote1(Z))
fcons(X, Z) -> cons(X, Z)

     ↳DPs

       →DP Problem 1

         ↳Remaining Obligation(s)

       →DP Problem 2

         ↳Remaining Obligation(s)

       →DP Problem 3

         ↳Remaining Obligation(s)

       →DP Problem 4

         ↳Remaining Obligation(s)

       →DP Problem 5

         ↳Remaining Obligation(s)

       →DP Problem 6

         ↳Remaining Obligation(s)

       →DP Problem 7

         ↳Remaining Obligation(s)

       →DP Problem 8

         ↳Remaining Obligation(s)

The following remains to be proven:

Dependency Pair:
SEL(s(X), cons(Y, Z)) -> SEL(X, Z)

Rules:

sel(s(X), cons(Y, Z)) -> sel(X, Z)
sel(0, cons(X, Z)) -> X
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
from(X) -> cons(X, from(s(X)))
sel1(s(X), cons(Y, Z)) -> sel1(X, Z)
sel1(0, cons(X, Z)) -> quote(X)
first1(0, Z) -> nil1
first1(s(X), cons(Y, Z)) -> cons1(quote(Y), first1(X, Z))
quote(0) -> 01
quote(s(X)) -> s1(quote(X))
quote(sel(X, Z)) -> sel1(X, Z)
quote1(cons(X, Z)) -> cons1(quote(X), quote1(Z))
quote1(nil) -> nil1
quote1(first(X, Z)) -> first1(X, Z)
unquote(01) -> 0
unquote(s1(X)) -> s(unquote(X))
unquote1(nil1) -> nil
unquote1(cons1(X, Z)) -> fcons(unquote(X), unquote1(Z))
fcons(X, Z) -> cons(X, Z)
Dependency Pair:
FIRST(s(X), cons(Y, Z)) -> FIRST(X, Z)

Rules:

sel(s(X), cons(Y, Z)) -> sel(X, Z)
sel(0, cons(X, Z)) -> X
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
from(X) -> cons(X, from(s(X)))
sel1(s(X), cons(Y, Z)) -> sel1(X, Z)
sel1(0, cons(X, Z)) -> quote(X)
first1(0, Z) -> nil1
first1(s(X), cons(Y, Z)) -> cons1(quote(Y), first1(X, Z))
quote(0) -> 01
quote(s(X)) -> s1(quote(X))
quote(sel(X, Z)) -> sel1(X, Z)
quote1(cons(X, Z)) -> cons1(quote(X), quote1(Z))
quote1(nil) -> nil1
quote1(first(X, Z)) -> first1(X, Z)
unquote(01) -> 0
unquote(s1(X)) -> s(unquote(X))
unquote1(nil1) -> nil
unquote1(cons1(X, Z)) -> fcons(unquote(X), unquote1(Z))
fcons(X, Z) -> cons(X, Z)
Dependency Pair:
FROM(X) -> FROM(s(X))

Rules:

sel(s(X), cons(Y, Z)) -> sel(X, Z)
sel(0, cons(X, Z)) -> X
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
from(X) -> cons(X, from(s(X)))
sel1(s(X), cons(Y, Z)) -> sel1(X, Z)
sel1(0, cons(X, Z)) -> quote(X)
first1(0, Z) -> nil1
first1(s(X), cons(Y, Z)) -> cons1(quote(Y), first1(X, Z))
quote(0) -> 01
quote(s(X)) -> s1(quote(X))
quote(sel(X, Z)) -> sel1(X, Z)
quote1(cons(X, Z)) -> cons1(quote(X), quote1(Z))
quote1(nil) -> nil1
quote1(first(X, Z)) -> first1(X, Z)
unquote(01) -> 0
unquote(s1(X)) -> s(unquote(X))
unquote1(nil1) -> nil
unquote1(cons1(X, Z)) -> fcons(unquote(X), unquote1(Z))
fcons(X, Z) -> cons(X, Z)
Dependency Pairs:
QUOTE(sel(X, Z)) -> SEL1(X, Z)
QUOTE(s(X)) -> QUOTE(X)
SEL1(0, cons(X, Z)) -> QUOTE(X)
SEL1(s(X), cons(Y, Z)) -> SEL1(X, Z)

Rules:

sel(s(X), cons(Y, Z)) -> sel(X, Z)
sel(0, cons(X, Z)) -> X
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
from(X) -> cons(X, from(s(X)))
sel1(s(X), cons(Y, Z)) -> sel1(X, Z)
sel1(0, cons(X, Z)) -> quote(X)
first1(0, Z) -> nil1
first1(s(X), cons(Y, Z)) -> cons1(quote(Y), first1(X, Z))
quote(0) -> 01
quote(s(X)) -> s1(quote(X))
quote(sel(X, Z)) -> sel1(X, Z)
quote1(cons(X, Z)) -> cons1(quote(X), quote1(Z))
quote1(nil) -> nil1
quote1(first(X, Z)) -> first1(X, Z)
unquote(01) -> 0
unquote(s1(X)) -> s(unquote(X))
unquote1(nil1) -> nil
unquote1(cons1(X, Z)) -> fcons(unquote(X), unquote1(Z))
fcons(X, Z) -> cons(X, Z)
Dependency Pair:
UNQUOTE(s1(X)) -> UNQUOTE(X)

Rules:

sel(s(X), cons(Y, Z)) -> sel(X, Z)
sel(0, cons(X, Z)) -> X
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
from(X) -> cons(X, from(s(X)))
sel1(s(X), cons(Y, Z)) -> sel1(X, Z)
sel1(0, cons(X, Z)) -> quote(X)
first1(0, Z) -> nil1
first1(s(X), cons(Y, Z)) -> cons1(quote(Y), first1(X, Z))
quote(0) -> 01
quote(s(X)) -> s1(quote(X))
quote(sel(X, Z)) -> sel1(X, Z)
quote1(cons(X, Z)) -> cons1(quote(X), quote1(Z))
quote1(nil) -> nil1
quote1(first(X, Z)) -> first1(X, Z)
unquote(01) -> 0
unquote(s1(X)) -> s(unquote(X))
unquote1(nil1) -> nil
unquote1(cons1(X, Z)) -> fcons(unquote(X), unquote1(Z))
fcons(X, Z) -> cons(X, Z)
Dependency Pair:
FIRST1(s(X), cons(Y, Z)) -> FIRST1(X, Z)

Rules:

sel(s(X), cons(Y, Z)) -> sel(X, Z)
sel(0, cons(X, Z)) -> X
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
from(X) -> cons(X, from(s(X)))
sel1(s(X), cons(Y, Z)) -> sel1(X, Z)
sel1(0, cons(X, Z)) -> quote(X)
first1(0, Z) -> nil1
first1(s(X), cons(Y, Z)) -> cons1(quote(Y), first1(X, Z))
quote(0) -> 01
quote(s(X)) -> s1(quote(X))
quote(sel(X, Z)) -> sel1(X, Z)
quote1(cons(X, Z)) -> cons1(quote(X), quote1(Z))
quote1(nil) -> nil1
quote1(first(X, Z)) -> first1(X, Z)
unquote(01) -> 0
unquote(s1(X)) -> s(unquote(X))
unquote1(nil1) -> nil
unquote1(cons1(X, Z)) -> fcons(unquote(X), unquote1(Z))
fcons(X, Z) -> cons(X, Z)
Dependency Pair:
UNQUOTE1(cons1(X, Z)) -> UNQUOTE1(Z)

Rules:

sel(s(X), cons(Y, Z)) -> sel(X, Z)
sel(0, cons(X, Z)) -> X
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
from(X) -> cons(X, from(s(X)))
sel1(s(X), cons(Y, Z)) -> sel1(X, Z)
sel1(0, cons(X, Z)) -> quote(X)
first1(0, Z) -> nil1
first1(s(X), cons(Y, Z)) -> cons1(quote(Y), first1(X, Z))
quote(0) -> 01
quote(s(X)) -> s1(quote(X))
quote(sel(X, Z)) -> sel1(X, Z)
quote1(cons(X, Z)) -> cons1(quote(X), quote1(Z))
quote1(nil) -> nil1
quote1(first(X, Z)) -> first1(X, Z)
unquote(01) -> 0
unquote(s1(X)) -> s(unquote(X))
unquote1(nil1) -> nil
unquote1(cons1(X, Z)) -> fcons(unquote(X), unquote1(Z))
fcons(X, Z) -> cons(X, Z)
Dependency Pair:
QUOTE1(cons(X, Z)) -> QUOTE1(Z)

Rules:

sel(s(X), cons(Y, Z)) -> sel(X, Z)
sel(0, cons(X, Z)) -> X
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
from(X) -> cons(X, from(s(X)))
sel1(s(X), cons(Y, Z)) -> sel1(X, Z)
sel1(0, cons(X, Z)) -> quote(X)
first1(0, Z) -> nil1
first1(s(X), cons(Y, Z)) -> cons1(quote(Y), first1(X, Z))
quote(0) -> 01
quote(s(X)) -> s1(quote(X))
quote(sel(X, Z)) -> sel1(X, Z)
quote1(cons(X, Z)) -> cons1(quote(X), quote1(Z))
quote1(nil) -> nil1
quote1(first(X, Z)) -> first1(X, Z)
unquote(01) -> 0
unquote(s1(X)) -> s(unquote(X))
unquote1(nil1) -> nil
unquote1(cons1(X, Z)) -> fcons(unquote(X), unquote1(Z))
fcons(X, Z) -> cons(X, Z)

     ↳DPs

       →DP Problem 1

         ↳Remaining Obligation(s)

       →DP Problem 2

         ↳Remaining Obligation(s)

       →DP Problem 3

         ↳Remaining Obligation(s)

       →DP Problem 4

         ↳Remaining Obligation(s)

       →DP Problem 5

         ↳Remaining Obligation(s)

       →DP Problem 6

         ↳Remaining Obligation(s)

       →DP Problem 7

         ↳Remaining Obligation(s)

       →DP Problem 8

         ↳Remaining Obligation(s)

The following remains to be proven:

Dependency Pair:
SEL(s(X), cons(Y, Z)) -> SEL(X, Z)

Rules:

sel(s(X), cons(Y, Z)) -> sel(X, Z)
sel(0, cons(X, Z)) -> X
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
from(X) -> cons(X, from(s(X)))
sel1(s(X), cons(Y, Z)) -> sel1(X, Z)
sel1(0, cons(X, Z)) -> quote(X)
first1(0, Z) -> nil1
first1(s(X), cons(Y, Z)) -> cons1(quote(Y), first1(X, Z))
quote(0) -> 01
quote(s(X)) -> s1(quote(X))
quote(sel(X, Z)) -> sel1(X, Z)
quote1(cons(X, Z)) -> cons1(quote(X), quote1(Z))
quote1(nil) -> nil1
quote1(first(X, Z)) -> first1(X, Z)
unquote(01) -> 0
unquote(s1(X)) -> s(unquote(X))
unquote1(nil1) -> nil
unquote1(cons1(X, Z)) -> fcons(unquote(X), unquote1(Z))
fcons(X, Z) -> cons(X, Z)
Dependency Pair:
FIRST(s(X), cons(Y, Z)) -> FIRST(X, Z)

Rules:

sel(s(X), cons(Y, Z)) -> sel(X, Z)
sel(0, cons(X, Z)) -> X
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
from(X) -> cons(X, from(s(X)))
sel1(s(X), cons(Y, Z)) -> sel1(X, Z)
sel1(0, cons(X, Z)) -> quote(X)
first1(0, Z) -> nil1
first1(s(X), cons(Y, Z)) -> cons1(quote(Y), first1(X, Z))
quote(0) -> 01
quote(s(X)) -> s1(quote(X))
quote(sel(X, Z)) -> sel1(X, Z)
quote1(cons(X, Z)) -> cons1(quote(X), quote1(Z))
quote1(nil) -> nil1
quote1(first(X, Z)) -> first1(X, Z)
unquote(01) -> 0
unquote(s1(X)) -> s(unquote(X))
unquote1(nil1) -> nil
unquote1(cons1(X, Z)) -> fcons(unquote(X), unquote1(Z))
fcons(X, Z) -> cons(X, Z)
Dependency Pair:
FROM(X) -> FROM(s(X))

Rules:

sel(s(X), cons(Y, Z)) -> sel(X, Z)
sel(0, cons(X, Z)) -> X
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
from(X) -> cons(X, from(s(X)))
sel1(s(X), cons(Y, Z)) -> sel1(X, Z)
sel1(0, cons(X, Z)) -> quote(X)
first1(0, Z) -> nil1
first1(s(X), cons(Y, Z)) -> cons1(quote(Y), first1(X, Z))
quote(0) -> 01
quote(s(X)) -> s1(quote(X))
quote(sel(X, Z)) -> sel1(X, Z)
quote1(cons(X, Z)) -> cons1(quote(X), quote1(Z))
quote1(nil) -> nil1
quote1(first(X, Z)) -> first1(X, Z)
unquote(01) -> 0
unquote(s1(X)) -> s(unquote(X))
unquote1(nil1) -> nil
unquote1(cons1(X, Z)) -> fcons(unquote(X), unquote1(Z))
fcons(X, Z) -> cons(X, Z)
Dependency Pairs:
QUOTE(sel(X, Z)) -> SEL1(X, Z)
QUOTE(s(X)) -> QUOTE(X)
SEL1(0, cons(X, Z)) -> QUOTE(X)
SEL1(s(X), cons(Y, Z)) -> SEL1(X, Z)

Rules:

sel(s(X), cons(Y, Z)) -> sel(X, Z)
sel(0, cons(X, Z)) -> X
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
from(X) -> cons(X, from(s(X)))
sel1(s(X), cons(Y, Z)) -> sel1(X, Z)
sel1(0, cons(X, Z)) -> quote(X)
first1(0, Z) -> nil1
first1(s(X), cons(Y, Z)) -> cons1(quote(Y), first1(X, Z))
quote(0) -> 01
quote(s(X)) -> s1(quote(X))
quote(sel(X, Z)) -> sel1(X, Z)
quote1(cons(X, Z)) -> cons1(quote(X), quote1(Z))
quote1(nil) -> nil1
quote1(first(X, Z)) -> first1(X, Z)
unquote(01) -> 0
unquote(s1(X)) -> s(unquote(X))
unquote1(nil1) -> nil
unquote1(cons1(X, Z)) -> fcons(unquote(X), unquote1(Z))
fcons(X, Z) -> cons(X, Z)
Dependency Pair:
UNQUOTE(s1(X)) -> UNQUOTE(X)

Rules:

sel(s(X), cons(Y, Z)) -> sel(X, Z)
sel(0, cons(X, Z)) -> X
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
from(X) -> cons(X, from(s(X)))
sel1(s(X), cons(Y, Z)) -> sel1(X, Z)
sel1(0, cons(X, Z)) -> quote(X)
first1(0, Z) -> nil1
first1(s(X), cons(Y, Z)) -> cons1(quote(Y), first1(X, Z))
quote(0) -> 01
quote(s(X)) -> s1(quote(X))
quote(sel(X, Z)) -> sel1(X, Z)
quote1(cons(X, Z)) -> cons1(quote(X), quote1(Z))
quote1(nil) -> nil1
quote1(first(X, Z)) -> first1(X, Z)
unquote(01) -> 0
unquote(s1(X)) -> s(unquote(X))
unquote1(nil1) -> nil
unquote1(cons1(X, Z)) -> fcons(unquote(X), unquote1(Z))
fcons(X, Z) -> cons(X, Z)
Dependency Pair:
FIRST1(s(X), cons(Y, Z)) -> FIRST1(X, Z)

Rules:

sel(s(X), cons(Y, Z)) -> sel(X, Z)
sel(0, cons(X, Z)) -> X
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
from(X) -> cons(X, from(s(X)))
sel1(s(X), cons(Y, Z)) -> sel1(X, Z)
sel1(0, cons(X, Z)) -> quote(X)
first1(0, Z) -> nil1
first1(s(X), cons(Y, Z)) -> cons1(quote(Y), first1(X, Z))
quote(0) -> 01
quote(s(X)) -> s1(quote(X))
quote(sel(X, Z)) -> sel1(X, Z)
quote1(cons(X, Z)) -> cons1(quote(X), quote1(Z))
quote1(nil) -> nil1
quote1(first(X, Z)) -> first1(X, Z)
unquote(01) -> 0
unquote(s1(X)) -> s(unquote(X))
unquote1(nil1) -> nil
unquote1(cons1(X, Z)) -> fcons(unquote(X), unquote1(Z))
fcons(X, Z) -> cons(X, Z)
Dependency Pair:
UNQUOTE1(cons1(X, Z)) -> UNQUOTE1(Z)

Rules:

sel(s(X), cons(Y, Z)) -> sel(X, Z)
sel(0, cons(X, Z)) -> X
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
from(X) -> cons(X, from(s(X)))
sel1(s(X), cons(Y, Z)) -> sel1(X, Z)
sel1(0, cons(X, Z)) -> quote(X)
first1(0, Z) -> nil1
first1(s(X), cons(Y, Z)) -> cons1(quote(Y), first1(X, Z))
quote(0) -> 01
quote(s(X)) -> s1(quote(X))
quote(sel(X, Z)) -> sel1(X, Z)
quote1(cons(X, Z)) -> cons1(quote(X), quote1(Z))
quote1(nil) -> nil1
quote1(first(X, Z)) -> first1(X, Z)
unquote(01) -> 0
unquote(s1(X)) -> s(unquote(X))
unquote1(nil1) -> nil
unquote1(cons1(X, Z)) -> fcons(unquote(X), unquote1(Z))
fcons(X, Z) -> cons(X, Z)
Dependency Pair:
QUOTE1(cons(X, Z)) -> QUOTE1(Z)

Rules:

sel(s(X), cons(Y, Z)) -> sel(X, Z)
sel(0, cons(X, Z)) -> X
first(0, Z) -> nil
first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z))
from(X) -> cons(X, from(s(X)))
sel1(s(X), cons(Y, Z)) -> sel1(X, Z)
sel1(0, cons(X, Z)) -> quote(X)
first1(0, Z) -> nil1
first1(s(X), cons(Y, Z)) -> cons1(quote(Y), first1(X, Z))
quote(0) -> 01
quote(s(X)) -> s1(quote(X))
quote(sel(X, Z)) -> sel1(X, Z)
quote1(cons(X, Z)) -> cons1(quote(X), quote1(Z))
quote1(nil) -> nil1
quote1(first(X, Z)) -> first1(X, Z)
unquote(01) -> 0
unquote(s1(X)) -> s(unquote(X))
unquote1(nil1) -> nil
unquote1(cons1(X, Z)) -> fcons(unquote(X), unquote1(Z))
fcons(X, Z) -> cons(X, Z)

Termination of R could not be shown.
Duration:
0:00 minutes