Termination Proof using AProVE

Term Rewriting System R:
[X, Y, L, X1, X2]
eq(n_₀, n_₀) -> true
eq(n_{_s}(X), n_{_s}(Y)) -> eq(activate(X), activate(Y))
eq(X, Y) -> false
inf(X) -> cons(X, n_{_inf}(n_{_s}(X)))
inf(X) -> n_{_inf}(X)
take(0, X) -> nil
take(s(X), cons(Y, L)) -> cons(activate(Y), n_{_take}(activate(X), activate(L)))
take(X1, X2) -> n_{_take}(X1, X2)
length(nil) -> 0
length(cons(X, L)) -> s(n_{_length}(activate(L)))
length(X) -> n_{_length}(X)
0 -> n_₀
s(X) -> n_{_s}(X)
activate(n_₀) -> 0
activate(n_{_s}(X)) -> s(X)
activate(n_{_inf}(X)) -> inf(activate(X))
activate(n_{_take}(X1, X2)) -> take(activate(X1), activate(X2))
activate(n_{_length}(X)) -> length(activate(X))
activate(X) -> X

Innermost Termination of R to be shown.

     ↳Dependency Pair Analysis

R contains the following Dependency Pairs:

EQ(n_{_s}(X), n_{_s}(Y)) -> EQ(activate(X), activate(Y))
EQ(n_{_s}(X), n_{_s}(Y)) -> ACTIVATE(X)
EQ(n_{_s}(X), n_{_s}(Y)) -> ACTIVATE(Y)
TAKE(s(X), cons(Y, L)) -> ACTIVATE(Y)
TAKE(s(X), cons(Y, L)) -> ACTIVATE(X)
TAKE(s(X), cons(Y, L)) -> ACTIVATE(L)
LENGTH(nil) -> 0'
LENGTH(cons(X, L)) -> S(n_{_length}(activate(L)))
LENGTH(cons(X, L)) -> ACTIVATE(L)
ACTIVATE(n_₀) -> 0'
ACTIVATE(n_{_s}(X)) -> S(X)
ACTIVATE(n_{_inf}(X)) -> INF(activate(X))
ACTIVATE(n_{_inf}(X)) -> ACTIVATE(X)
ACTIVATE(n_{_take}(X1, X2)) -> TAKE(activate(X1), activate(X2))
ACTIVATE(n_{_take}(X1, X2)) -> ACTIVATE(X1)
ACTIVATE(n_{_take}(X1, X2)) -> ACTIVATE(X2)
ACTIVATE(n_{_length}(X)) -> LENGTH(activate(X))
ACTIVATE(n_{_length}(X)) -> ACTIVATE(X)

Furthermore, R contains two SCCs.

     ↳DPs

       →DP Problem 1

         ↳Polynomial Ordering

       →DP Problem 2

         ↳Nar

Dependency Pairs:

ACTIVATE(n_{_length}(X)) -> ACTIVATE(X)
LENGTH(cons(X, L)) -> ACTIVATE(L)
ACTIVATE(n_{_length}(X)) -> LENGTH(activate(X))
ACTIVATE(n_{_take}(X1, X2)) -> ACTIVATE(X2)
ACTIVATE(n_{_take}(X1, X2)) -> ACTIVATE(X1)
ACTIVATE(n_{_inf}(X)) -> ACTIVATE(X)

Rules:

eq(n_₀, n_₀) -> true
eq(n_{_s}(X), n_{_s}(Y)) -> eq(activate(X), activate(Y))
eq(X, Y) -> false
inf(X) -> cons(X, n_{_inf}(n_{_s}(X)))
inf(X) -> n_{_inf}(X)
take(0, X) -> nil
take(s(X), cons(Y, L)) -> cons(activate(Y), n_{_take}(activate(X), activate(L)))
take(X1, X2) -> n_{_take}(X1, X2)
length(nil) -> 0
length(cons(X, L)) -> s(n_{_length}(activate(L)))
length(X) -> n_{_length}(X)
0 -> n_₀
s(X) -> n_{_s}(X)
activate(n_₀) -> 0
activate(n_{_s}(X)) -> s(X)
activate(n_{_inf}(X)) -> inf(activate(X))
activate(n_{_take}(X1, X2)) -> take(activate(X1), activate(X2))
activate(n_{_length}(X)) -> length(activate(X))
activate(X) -> X

Strategy:

innermost

The following dependency pairs can be strictly oriented:

ACTIVATE(n_{_length}(X)) -> ACTIVATE(X)
ACTIVATE(n_{_length}(X)) -> LENGTH(activate(X))

Additionally, the following usable rules for innermost w.r.t. to the implicit AFS can be oriented:

activate(n_₀) -> 0
activate(n_{_s}(X)) -> s(X)
activate(n_{_inf}(X)) -> inf(activate(X))
activate(n_{_take}(X1, X2)) -> take(activate(X1), activate(X2))
activate(n_{_length}(X)) -> length(activate(X))
activate(X) -> X
take(0, X) -> nil
take(s(X), cons(Y, L)) -> cons(activate(Y), n_{_take}(activate(X), activate(L)))
take(X1, X2) -> n_{_take}(X1, X2)
length(nil) -> 0
length(cons(X, L)) -> s(n_{_length}(activate(L)))
length(X) -> n_{_length}(X)
0 -> n_₀
s(X) -> n_{_s}(X)
inf(X) -> cons(X, n_{_inf}(n_{_s}(X)))
inf(X) -> n_{_inf}(X)

Used ordering: Polynomial ordering with Polynomial interpretation:

POL(activate(x₁)) = x₁

POL(n__length(x₁)) = 1 + x₁

POL(n__take(x₁, x₂)) = x₁ + x₂

POL(take(x₁, x₂)) = x₁ + x₂

POL(n__s(x₁)) = x₁

POL(ACTIVATE(x₁)) = x₁

POL(n__inf(x₁)) = x₁

POL(0) = 0

POL(cons(x₁, x₂)) = x₂

POL(inf(x₁)) = x₁

POL(nil) = 0

POL(n__0) = 0

POL(s(x₁)) = x₁

POL(LENGTH(x₁)) = x₁

POL(length(x₁)) = 1 + x₁

resulting in one new DP problem.

     ↳DPs

       →DP Problem 1

         ↳Polo

           →DP Problem 3

             ↳Dependency Graph

       →DP Problem 2

         ↳Nar

Dependency Pairs:

LENGTH(cons(X, L)) -> ACTIVATE(L)
ACTIVATE(n_{_take}(X1, X2)) -> ACTIVATE(X2)
ACTIVATE(n_{_take}(X1, X2)) -> ACTIVATE(X1)
ACTIVATE(n_{_inf}(X)) -> ACTIVATE(X)

Rules:

eq(n_₀, n_₀) -> true
eq(n_{_s}(X), n_{_s}(Y)) -> eq(activate(X), activate(Y))
eq(X, Y) -> false
inf(X) -> cons(X, n_{_inf}(n_{_s}(X)))
inf(X) -> n_{_inf}(X)
take(0, X) -> nil
take(s(X), cons(Y, L)) -> cons(activate(Y), n_{_take}(activate(X), activate(L)))
take(X1, X2) -> n_{_take}(X1, X2)
length(nil) -> 0
length(cons(X, L)) -> s(n_{_length}(activate(L)))
length(X) -> n_{_length}(X)
0 -> n_₀
s(X) -> n_{_s}(X)
activate(n_₀) -> 0
activate(n_{_s}(X)) -> s(X)
activate(n_{_inf}(X)) -> inf(activate(X))
activate(n_{_take}(X1, X2)) -> take(activate(X1), activate(X2))
activate(n_{_length}(X)) -> length(activate(X))
activate(X) -> X

Strategy:

innermost

Using the Dependency Graph the DP problem was split into 1 DP problems.

     ↳DPs

       →DP Problem 1

         ↳Polo

           →DP Problem 3

             ↳DGraph

...

               →DP Problem 4

                 ↳Polynomial Ordering

       →DP Problem 2

         ↳Nar

Dependency Pairs:

ACTIVATE(n_{_take}(X1, X2)) -> ACTIVATE(X2)
ACTIVATE(n_{_take}(X1, X2)) -> ACTIVATE(X1)
ACTIVATE(n_{_inf}(X)) -> ACTIVATE(X)

Rules:

eq(n_₀, n_₀) -> true
eq(n_{_s}(X), n_{_s}(Y)) -> eq(activate(X), activate(Y))
eq(X, Y) -> false
inf(X) -> cons(X, n_{_inf}(n_{_s}(X)))
inf(X) -> n_{_inf}(X)
take(0, X) -> nil
take(s(X), cons(Y, L)) -> cons(activate(Y), n_{_take}(activate(X), activate(L)))
take(X1, X2) -> n_{_take}(X1, X2)
length(nil) -> 0
length(cons(X, L)) -> s(n_{_length}(activate(L)))
length(X) -> n_{_length}(X)
0 -> n_₀
s(X) -> n_{_s}(X)
activate(n_₀) -> 0
activate(n_{_s}(X)) -> s(X)
activate(n_{_inf}(X)) -> inf(activate(X))
activate(n_{_take}(X1, X2)) -> take(activate(X1), activate(X2))
activate(n_{_length}(X)) -> length(activate(X))
activate(X) -> X

Strategy:

innermost

The following dependency pairs can be strictly oriented:

ACTIVATE(n_{_take}(X1, X2)) -> ACTIVATE(X2)
ACTIVATE(n_{_take}(X1, X2)) -> ACTIVATE(X1)

There are no usable rules for innermost w.r.t. to the implicit AFS that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:

POL(n__inf(x₁)) = x₁

POL(n__take(x₁, x₂)) = 1 + x₁ + x₂

POL(ACTIVATE(x₁)) = x₁

resulting in one new DP problem.

     ↳DPs

       →DP Problem 1

         ↳Polo

           →DP Problem 3

             ↳DGraph

...

               →DP Problem 5

                 ↳Polynomial Ordering

       →DP Problem 2

         ↳Nar

Dependency Pair:

ACTIVATE(n_{_inf}(X)) -> ACTIVATE(X)

Rules:

eq(n_₀, n_₀) -> true
eq(n_{_s}(X), n_{_s}(Y)) -> eq(activate(X), activate(Y))
eq(X, Y) -> false
inf(X) -> cons(X, n_{_inf}(n_{_s}(X)))
inf(X) -> n_{_inf}(X)
take(0, X) -> nil
take(s(X), cons(Y, L)) -> cons(activate(Y), n_{_take}(activate(X), activate(L)))
take(X1, X2) -> n_{_take}(X1, X2)
length(nil) -> 0
length(cons(X, L)) -> s(n_{_length}(activate(L)))
length(X) -> n_{_length}(X)
0 -> n_₀
s(X) -> n_{_s}(X)
activate(n_₀) -> 0
activate(n_{_s}(X)) -> s(X)
activate(n_{_inf}(X)) -> inf(activate(X))
activate(n_{_take}(X1, X2)) -> take(activate(X1), activate(X2))
activate(n_{_length}(X)) -> length(activate(X))
activate(X) -> X

Strategy:

innermost

The following dependency pair can be strictly oriented:

ACTIVATE(n_{_inf}(X)) -> ACTIVATE(X)

There are no usable rules for innermost w.r.t. to the implicit AFS that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:

POL(n__inf(x₁)) = 1 + x₁

POL(ACTIVATE(x₁)) = x₁

resulting in one new DP problem.

     ↳DPs

       →DP Problem 1

         ↳Polo

           →DP Problem 3

             ↳DGraph

...

               →DP Problem 6

                 ↳Dependency Graph

       →DP Problem 2

         ↳Nar

Dependency Pair:

Rules:

eq(n_₀, n_₀) -> true
eq(n_{_s}(X), n_{_s}(Y)) -> eq(activate(X), activate(Y))
eq(X, Y) -> false
inf(X) -> cons(X, n_{_inf}(n_{_s}(X)))
inf(X) -> n_{_inf}(X)
take(0, X) -> nil
take(s(X), cons(Y, L)) -> cons(activate(Y), n_{_take}(activate(X), activate(L)))
take(X1, X2) -> n_{_take}(X1, X2)
length(nil) -> 0
length(cons(X, L)) -> s(n_{_length}(activate(L)))
length(X) -> n_{_length}(X)
0 -> n_₀
s(X) -> n_{_s}(X)
activate(n_₀) -> 0
activate(n_{_s}(X)) -> s(X)
activate(n_{_inf}(X)) -> inf(activate(X))
activate(n_{_take}(X1, X2)) -> take(activate(X1), activate(X2))
activate(n_{_length}(X)) -> length(activate(X))
activate(X) -> X

Strategy:

innermost

Using the Dependency Graph resulted in no new DP problems.

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Narrowing Transformation

Dependency Pair:

EQ(n_{_s}(X), n_{_s}(Y)) -> EQ(activate(X), activate(Y))

Rules:

eq(n_₀, n_₀) -> true
eq(n_{_s}(X), n_{_s}(Y)) -> eq(activate(X), activate(Y))
eq(X, Y) -> false
inf(X) -> cons(X, n_{_inf}(n_{_s}(X)))
inf(X) -> n_{_inf}(X)
take(0, X) -> nil
take(s(X), cons(Y, L)) -> cons(activate(Y), n_{_take}(activate(X), activate(L)))
take(X1, X2) -> n_{_take}(X1, X2)
length(nil) -> 0
length(cons(X, L)) -> s(n_{_length}(activate(L)))
length(X) -> n_{_length}(X)
0 -> n_₀
s(X) -> n_{_s}(X)
activate(n_₀) -> 0
activate(n_{_s}(X)) -> s(X)
activate(n_{_inf}(X)) -> inf(activate(X))
activate(n_{_take}(X1, X2)) -> take(activate(X1), activate(X2))
activate(n_{_length}(X)) -> length(activate(X))
activate(X) -> X

Strategy:

innermost

On this DP problem, a Narrowing SCC transformation can be performed.
As a result of transforming the rule

EQ(n_{_s}(X), n_{_s}(Y)) -> EQ(activate(X), activate(Y))

12 new Dependency Pairs are created:

EQ(n_{_s}(n_₀), n_{_s}(Y)) -> EQ(0, activate(Y))
EQ(n_{_s}(n_{_s}(X'')), n_{_s}(Y)) -> EQ(s(X''), activate(Y))
EQ(n_{_s}(n_{_inf}(X'')), n_{_s}(Y)) -> EQ(inf(activate(X'')), activate(Y))
EQ(n_{_s}(n_{_take}(X1', X2')), n_{_s}(Y)) -> EQ(take(activate(X1'), activate(X2')), activate(Y))
EQ(n_{_s}(n_{_length}(X'')), n_{_s}(Y)) -> EQ(length(activate(X'')), activate(Y))
EQ(n_{_s}(X''), n_{_s}(Y)) -> EQ(X'', activate(Y))
EQ(n_{_s}(X), n_{_s}(n_₀)) -> EQ(activate(X), 0)
EQ(n_{_s}(X), n_{_s}(n_{_s}(X''))) -> EQ(activate(X), s(X''))
EQ(n_{_s}(X), n_{_s}(n_{_inf}(X''))) -> EQ(activate(X), inf(activate(X'')))
EQ(n_{_s}(X), n_{_s}(n_{_take}(X1', X2'))) -> EQ(activate(X), take(activate(X1'), activate(X2')))
EQ(n_{_s}(X), n_{_s}(n_{_length}(X''))) -> EQ(activate(X), length(activate(X'')))
EQ(n_{_s}(X), n_{_s}(Y')) -> EQ(activate(X), Y')

The transformation is resulting in one new DP problem:

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Nar

           →DP Problem 7

             ↳Rewriting Transformation

Dependency Pairs:

EQ(n_{_s}(X), n_{_s}(Y')) -> EQ(activate(X), Y')
EQ(n_{_s}(X), n_{_s}(n_{_length}(X''))) -> EQ(activate(X), length(activate(X'')))
EQ(n_{_s}(X), n_{_s}(n_{_take}(X1', X2'))) -> EQ(activate(X), take(activate(X1'), activate(X2')))
EQ(n_{_s}(X), n_{_s}(n_{_inf}(X''))) -> EQ(activate(X), inf(activate(X'')))
EQ(n_{_s}(X), n_{_s}(n_{_s}(X''))) -> EQ(activate(X), s(X''))
EQ(n_{_s}(X), n_{_s}(n_₀)) -> EQ(activate(X), 0)
EQ(n_{_s}(X''), n_{_s}(Y)) -> EQ(X'', activate(Y))
EQ(n_{_s}(n_{_length}(X'')), n_{_s}(Y)) -> EQ(length(activate(X'')), activate(Y))
EQ(n_{_s}(n_{_take}(X1', X2')), n_{_s}(Y)) -> EQ(take(activate(X1'), activate(X2')), activate(Y))
EQ(n_{_s}(n_{_inf}(X'')), n_{_s}(Y)) -> EQ(inf(activate(X'')), activate(Y))
EQ(n_{_s}(n_{_s}(X'')), n_{_s}(Y)) -> EQ(s(X''), activate(Y))
EQ(n_{_s}(n_₀), n_{_s}(Y)) -> EQ(0, activate(Y))

Rules:

eq(n_₀, n_₀) -> true
eq(n_{_s}(X), n_{_s}(Y)) -> eq(activate(X), activate(Y))
eq(X, Y) -> false
inf(X) -> cons(X, n_{_inf}(n_{_s}(X)))
inf(X) -> n_{_inf}(X)
take(0, X) -> nil
take(s(X), cons(Y, L)) -> cons(activate(Y), n_{_take}(activate(X), activate(L)))
take(X1, X2) -> n_{_take}(X1, X2)
length(nil) -> 0
length(cons(X, L)) -> s(n_{_length}(activate(L)))
length(X) -> n_{_length}(X)
0 -> n_₀
s(X) -> n_{_s}(X)
activate(n_₀) -> 0
activate(n_{_s}(X)) -> s(X)
activate(n_{_inf}(X)) -> inf(activate(X))
activate(n_{_take}(X1, X2)) -> take(activate(X1), activate(X2))
activate(n_{_length}(X)) -> length(activate(X))
activate(X) -> X

Strategy:

innermost

On this DP problem, a Rewriting SCC transformation can be performed.
As a result of transforming the rule

EQ(n_{_s}(n_₀), n_{_s}(Y)) -> EQ(0, activate(Y))

one new Dependency Pair is created:

EQ(n_{_s}(n_₀), n_{_s}(Y)) -> EQ(n_₀, activate(Y))

The transformation is resulting in one new DP problem:

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Nar

           →DP Problem 7

             ↳Rw

...

               →DP Problem 8

                 ↳Rewriting Transformation

Dependency Pairs:

EQ(n_{_s}(X), n_{_s}(n_{_length}(X''))) -> EQ(activate(X), length(activate(X'')))
EQ(n_{_s}(X), n_{_s}(n_{_take}(X1', X2'))) -> EQ(activate(X), take(activate(X1'), activate(X2')))
EQ(n_{_s}(X), n_{_s}(n_{_inf}(X''))) -> EQ(activate(X), inf(activate(X'')))
EQ(n_{_s}(X), n_{_s}(n_{_s}(X''))) -> EQ(activate(X), s(X''))
EQ(n_{_s}(X), n_{_s}(n_₀)) -> EQ(activate(X), 0)
EQ(n_{_s}(X''), n_{_s}(Y)) -> EQ(X'', activate(Y))
EQ(n_{_s}(n_{_length}(X'')), n_{_s}(Y)) -> EQ(length(activate(X'')), activate(Y))
EQ(n_{_s}(n_{_take}(X1', X2')), n_{_s}(Y)) -> EQ(take(activate(X1'), activate(X2')), activate(Y))
EQ(n_{_s}(n_{_inf}(X'')), n_{_s}(Y)) -> EQ(inf(activate(X'')), activate(Y))
EQ(n_{_s}(n_{_s}(X'')), n_{_s}(Y)) -> EQ(s(X''), activate(Y))
EQ(n_{_s}(X), n_{_s}(Y')) -> EQ(activate(X), Y')

Rules:

eq(n_₀, n_₀) -> true
eq(n_{_s}(X), n_{_s}(Y)) -> eq(activate(X), activate(Y))
eq(X, Y) -> false
inf(X) -> cons(X, n_{_inf}(n_{_s}(X)))
inf(X) -> n_{_inf}(X)
take(0, X) -> nil
take(s(X), cons(Y, L)) -> cons(activate(Y), n_{_take}(activate(X), activate(L)))
take(X1, X2) -> n_{_take}(X1, X2)
length(nil) -> 0
length(cons(X, L)) -> s(n_{_length}(activate(L)))
length(X) -> n_{_length}(X)
0 -> n_₀
s(X) -> n_{_s}(X)
activate(n_₀) -> 0
activate(n_{_s}(X)) -> s(X)
activate(n_{_inf}(X)) -> inf(activate(X))
activate(n_{_take}(X1, X2)) -> take(activate(X1), activate(X2))
activate(n_{_length}(X)) -> length(activate(X))
activate(X) -> X

Strategy:

innermost

On this DP problem, a Rewriting SCC transformation can be performed.
As a result of transforming the rule

EQ(n_{_s}(n_{_s}(X'')), n_{_s}(Y)) -> EQ(s(X''), activate(Y))

one new Dependency Pair is created:

EQ(n_{_s}(n_{_s}(X'')), n_{_s}(Y)) -> EQ(n_{_s}(X''), activate(Y))

The transformation is resulting in one new DP problem:

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Nar

           →DP Problem 7

             ↳Rw

...

               →DP Problem 9

                 ↳Rewriting Transformation

Dependency Pairs:

EQ(n_{_s}(n_{_s}(X'')), n_{_s}(Y)) -> EQ(n_{_s}(X''), activate(Y))
EQ(n_{_s}(X), n_{_s}(Y')) -> EQ(activate(X), Y')
EQ(n_{_s}(X), n_{_s}(n_{_take}(X1', X2'))) -> EQ(activate(X), take(activate(X1'), activate(X2')))
EQ(n_{_s}(X), n_{_s}(n_{_inf}(X''))) -> EQ(activate(X), inf(activate(X'')))
EQ(n_{_s}(X), n_{_s}(n_{_s}(X''))) -> EQ(activate(X), s(X''))
EQ(n_{_s}(X), n_{_s}(n_₀)) -> EQ(activate(X), 0)
EQ(n_{_s}(X''), n_{_s}(Y)) -> EQ(X'', activate(Y))
EQ(n_{_s}(n_{_length}(X'')), n_{_s}(Y)) -> EQ(length(activate(X'')), activate(Y))
EQ(n_{_s}(n_{_take}(X1', X2')), n_{_s}(Y)) -> EQ(take(activate(X1'), activate(X2')), activate(Y))
EQ(n_{_s}(n_{_inf}(X'')), n_{_s}(Y)) -> EQ(inf(activate(X'')), activate(Y))
EQ(n_{_s}(X), n_{_s}(n_{_length}(X''))) -> EQ(activate(X), length(activate(X'')))

Rules:

eq(n_₀, n_₀) -> true
eq(n_{_s}(X), n_{_s}(Y)) -> eq(activate(X), activate(Y))
eq(X, Y) -> false
inf(X) -> cons(X, n_{_inf}(n_{_s}(X)))
inf(X) -> n_{_inf}(X)
take(0, X) -> nil
take(s(X), cons(Y, L)) -> cons(activate(Y), n_{_take}(activate(X), activate(L)))
take(X1, X2) -> n_{_take}(X1, X2)
length(nil) -> 0
length(cons(X, L)) -> s(n_{_length}(activate(L)))
length(X) -> n_{_length}(X)
0 -> n_₀
s(X) -> n_{_s}(X)
activate(n_₀) -> 0
activate(n_{_s}(X)) -> s(X)
activate(n_{_inf}(X)) -> inf(activate(X))
activate(n_{_take}(X1, X2)) -> take(activate(X1), activate(X2))
activate(n_{_length}(X)) -> length(activate(X))
activate(X) -> X

Strategy:

innermost

On this DP problem, a Rewriting SCC transformation can be performed.
As a result of transforming the rule

EQ(n_{_s}(X), n_{_s}(n_₀)) -> EQ(activate(X), 0)

one new Dependency Pair is created:

EQ(n_{_s}(X), n_{_s}(n_₀)) -> EQ(activate(X), n_₀)

The transformation is resulting in one new DP problem:

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Nar

           →DP Problem 7

             ↳Rw

...

               →DP Problem 10

                 ↳Rewriting Transformation

Dependency Pairs:

EQ(n_{_s}(X), n_{_s}(Y')) -> EQ(activate(X), Y')
EQ(n_{_s}(X), n_{_s}(n_{_length}(X''))) -> EQ(activate(X), length(activate(X'')))
EQ(n_{_s}(X), n_{_s}(n_{_take}(X1', X2'))) -> EQ(activate(X), take(activate(X1'), activate(X2')))
EQ(n_{_s}(X), n_{_s}(n_{_inf}(X''))) -> EQ(activate(X), inf(activate(X'')))
EQ(n_{_s}(X), n_{_s}(n_{_s}(X''))) -> EQ(activate(X), s(X''))
EQ(n_{_s}(X''), n_{_s}(Y)) -> EQ(X'', activate(Y))
EQ(n_{_s}(n_{_length}(X'')), n_{_s}(Y)) -> EQ(length(activate(X'')), activate(Y))
EQ(n_{_s}(n_{_take}(X1', X2')), n_{_s}(Y)) -> EQ(take(activate(X1'), activate(X2')), activate(Y))
EQ(n_{_s}(n_{_inf}(X'')), n_{_s}(Y)) -> EQ(inf(activate(X'')), activate(Y))
EQ(n_{_s}(n_{_s}(X'')), n_{_s}(Y)) -> EQ(n_{_s}(X''), activate(Y))

Rules:

eq(n_₀, n_₀) -> true
eq(n_{_s}(X), n_{_s}(Y)) -> eq(activate(X), activate(Y))
eq(X, Y) -> false
inf(X) -> cons(X, n_{_inf}(n_{_s}(X)))
inf(X) -> n_{_inf}(X)
take(0, X) -> nil
take(s(X), cons(Y, L)) -> cons(activate(Y), n_{_take}(activate(X), activate(L)))
take(X1, X2) -> n_{_take}(X1, X2)
length(nil) -> 0
length(cons(X, L)) -> s(n_{_length}(activate(L)))
length(X) -> n_{_length}(X)
0 -> n_₀
s(X) -> n_{_s}(X)
activate(n_₀) -> 0
activate(n_{_s}(X)) -> s(X)
activate(n_{_inf}(X)) -> inf(activate(X))
activate(n_{_take}(X1, X2)) -> take(activate(X1), activate(X2))
activate(n_{_length}(X)) -> length(activate(X))
activate(X) -> X

Strategy:

innermost

On this DP problem, a Rewriting SCC transformation can be performed.
As a result of transforming the rule

EQ(n_{_s}(X), n_{_s}(n_{_s}(X''))) -> EQ(activate(X), s(X''))

one new Dependency Pair is created:

EQ(n_{_s}(X), n_{_s}(n_{_s}(X''))) -> EQ(activate(X), n_{_s}(X''))

The transformation is resulting in one new DP problem:

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Nar

           →DP Problem 7

             ↳Rw

...

               →DP Problem 11

                 ↳Polynomial Ordering

Dependency Pairs:

EQ(n_{_s}(X), n_{_s}(n_{_s}(X''))) -> EQ(activate(X), n_{_s}(X''))
EQ(n_{_s}(n_{_s}(X'')), n_{_s}(Y)) -> EQ(n_{_s}(X''), activate(Y))
EQ(n_{_s}(X), n_{_s}(n_{_length}(X''))) -> EQ(activate(X), length(activate(X'')))
EQ(n_{_s}(X), n_{_s}(n_{_take}(X1', X2'))) -> EQ(activate(X), take(activate(X1'), activate(X2')))
EQ(n_{_s}(X), n_{_s}(n_{_inf}(X''))) -> EQ(activate(X), inf(activate(X'')))
EQ(n_{_s}(X''), n_{_s}(Y)) -> EQ(X'', activate(Y))
EQ(n_{_s}(n_{_length}(X'')), n_{_s}(Y)) -> EQ(length(activate(X'')), activate(Y))
EQ(n_{_s}(n_{_take}(X1', X2')), n_{_s}(Y)) -> EQ(take(activate(X1'), activate(X2')), activate(Y))
EQ(n_{_s}(n_{_inf}(X'')), n_{_s}(Y)) -> EQ(inf(activate(X'')), activate(Y))
EQ(n_{_s}(X), n_{_s}(Y')) -> EQ(activate(X), Y')

Rules:

eq(n_₀, n_₀) -> true
eq(n_{_s}(X), n_{_s}(Y)) -> eq(activate(X), activate(Y))
eq(X, Y) -> false
inf(X) -> cons(X, n_{_inf}(n_{_s}(X)))
inf(X) -> n_{_inf}(X)
take(0, X) -> nil
take(s(X), cons(Y, L)) -> cons(activate(Y), n_{_take}(activate(X), activate(L)))
take(X1, X2) -> n_{_take}(X1, X2)
length(nil) -> 0
length(cons(X, L)) -> s(n_{_length}(activate(L)))
length(X) -> n_{_length}(X)
0 -> n_₀
s(X) -> n_{_s}(X)
activate(n_₀) -> 0
activate(n_{_s}(X)) -> s(X)
activate(n_{_inf}(X)) -> inf(activate(X))
activate(n_{_take}(X1, X2)) -> take(activate(X1), activate(X2))
activate(n_{_length}(X)) -> length(activate(X))
activate(X) -> X

Strategy:

innermost

The following dependency pairs can be strictly oriented:

EQ(n_{_s}(X), n_{_s}(n_{_s}(X''))) -> EQ(activate(X), n_{_s}(X''))
EQ(n_{_s}(X), n_{_s}(n_{_take}(X1', X2'))) -> EQ(activate(X), take(activate(X1'), activate(X2')))
EQ(n_{_s}(X), n_{_s}(n_{_inf}(X''))) -> EQ(activate(X), inf(activate(X'')))
EQ(n_{_s}(X), n_{_s}(Y')) -> EQ(activate(X), Y')

Additionally, the following usable rules for innermost w.r.t. to the implicit AFS can be oriented:

activate(n_₀) -> 0
activate(n_{_s}(X)) -> s(X)
activate(n_{_inf}(X)) -> inf(activate(X))
activate(n_{_take}(X1, X2)) -> take(activate(X1), activate(X2))
activate(n_{_length}(X)) -> length(activate(X))
activate(X) -> X
take(0, X) -> nil
take(s(X), cons(Y, L)) -> cons(activate(Y), n_{_take}(activate(X), activate(L)))
take(X1, X2) -> n_{_take}(X1, X2)
length(nil) -> 0
length(cons(X, L)) -> s(n_{_length}(activate(L)))
length(X) -> n_{_length}(X)
inf(X) -> cons(X, n_{_inf}(n_{_s}(X)))
inf(X) -> n_{_inf}(X)
0 -> n_₀
s(X) -> n_{_s}(X)

Used ordering: Polynomial ordering with Polynomial interpretation:

POL(activate(x₁)) = 1 + x₁

POL(n__length(x₁)) = 0

POL(EQ(x₁, x₂)) = x₂

POL(n__take(x₁, x₂)) = 0

POL(take(x₁, x₂)) = 0

POL(n__s(x₁)) = 1 + x₁

POL(n__inf(x₁)) = 0

POL(0) = 0

POL(cons(x₁, x₂)) = 0

POL(inf(x₁)) = 0

POL(nil) = 0

POL(n__0) = 0

POL(s(x₁)) = 1 + x₁

POL(length(x₁)) = 1

resulting in one new DP problem.

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Nar

           →DP Problem 7

             ↳Rw

...

               →DP Problem 12

                 ↳Polynomial Ordering

Dependency Pairs:

EQ(n_{_s}(n_{_s}(X'')), n_{_s}(Y)) -> EQ(n_{_s}(X''), activate(Y))
EQ(n_{_s}(X), n_{_s}(n_{_length}(X''))) -> EQ(activate(X), length(activate(X'')))
EQ(n_{_s}(X''), n_{_s}(Y)) -> EQ(X'', activate(Y))
EQ(n_{_s}(n_{_length}(X'')), n_{_s}(Y)) -> EQ(length(activate(X'')), activate(Y))
EQ(n_{_s}(n_{_take}(X1', X2')), n_{_s}(Y)) -> EQ(take(activate(X1'), activate(X2')), activate(Y))
EQ(n_{_s}(n_{_inf}(X'')), n_{_s}(Y)) -> EQ(inf(activate(X'')), activate(Y))

Rules:

eq(n_₀, n_₀) -> true
eq(n_{_s}(X), n_{_s}(Y)) -> eq(activate(X), activate(Y))
eq(X, Y) -> false
inf(X) -> cons(X, n_{_inf}(n_{_s}(X)))
inf(X) -> n_{_inf}(X)
take(0, X) -> nil
take(s(X), cons(Y, L)) -> cons(activate(Y), n_{_take}(activate(X), activate(L)))
take(X1, X2) -> n_{_take}(X1, X2)
length(nil) -> 0
length(cons(X, L)) -> s(n_{_length}(activate(L)))
length(X) -> n_{_length}(X)
0 -> n_₀
s(X) -> n_{_s}(X)
activate(n_₀) -> 0
activate(n_{_s}(X)) -> s(X)
activate(n_{_inf}(X)) -> inf(activate(X))
activate(n_{_take}(X1, X2)) -> take(activate(X1), activate(X2))
activate(n_{_length}(X)) -> length(activate(X))
activate(X) -> X

Strategy:

innermost

The following dependency pairs can be strictly oriented:

EQ(n_{_s}(n_{_s}(X'')), n_{_s}(Y)) -> EQ(n_{_s}(X''), activate(Y))
EQ(n_{_s}(X''), n_{_s}(Y)) -> EQ(X'', activate(Y))
EQ(n_{_s}(n_{_take}(X1', X2')), n_{_s}(Y)) -> EQ(take(activate(X1'), activate(X2')), activate(Y))
EQ(n_{_s}(n_{_inf}(X'')), n_{_s}(Y)) -> EQ(inf(activate(X'')), activate(Y))

Additionally, the following usable rules for innermost w.r.t. to the implicit AFS can be oriented:

activate(n_₀) -> 0
activate(n_{_s}(X)) -> s(X)
activate(n_{_inf}(X)) -> inf(activate(X))
activate(n_{_take}(X1, X2)) -> take(activate(X1), activate(X2))
activate(n_{_length}(X)) -> length(activate(X))
activate(X) -> X
take(0, X) -> nil
take(s(X), cons(Y, L)) -> cons(activate(Y), n_{_take}(activate(X), activate(L)))
take(X1, X2) -> n_{_take}(X1, X2)
length(nil) -> 0
length(cons(X, L)) -> s(n_{_length}(activate(L)))
length(X) -> n_{_length}(X)
inf(X) -> cons(X, n_{_inf}(n_{_s}(X)))
inf(X) -> n_{_inf}(X)
0 -> n_₀
s(X) -> n_{_s}(X)

Used ordering: Polynomial ordering with Polynomial interpretation:

POL(activate(x₁)) = 1 + x₁

POL(n__length(x₁)) = 0

POL(EQ(x₁, x₂)) = 1 + x₁

POL(n__take(x₁, x₂)) = 0

POL(take(x₁, x₂)) = 0

POL(n__s(x₁)) = 1 + x₁

POL(n__inf(x₁)) = 0

POL(0) = 0

POL(cons(x₁, x₂)) = 0

POL(inf(x₁)) = 0

POL(nil) = 0

POL(n__0) = 0

POL(s(x₁)) = 1 + x₁

POL(length(x₁)) = 1

resulting in one new DP problem.

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Nar

           →DP Problem 7

             ↳Rw

...

               →DP Problem 13

                 ↳Remaining Obligation(s)

The following remains to be proven:
Dependency Pairs:

EQ(n_{_s}(X), n_{_s}(n_{_length}(X''))) -> EQ(activate(X), length(activate(X'')))
EQ(n_{_s}(n_{_length}(X'')), n_{_s}(Y)) -> EQ(length(activate(X'')), activate(Y))

Rules:

eq(n_₀, n_₀) -> true
eq(n_{_s}(X), n_{_s}(Y)) -> eq(activate(X), activate(Y))
eq(X, Y) -> false
inf(X) -> cons(X, n_{_inf}(n_{_s}(X)))
inf(X) -> n_{_inf}(X)
take(0, X) -> nil
take(s(X), cons(Y, L)) -> cons(activate(Y), n_{_take}(activate(X), activate(L)))
take(X1, X2) -> n_{_take}(X1, X2)
length(nil) -> 0
length(cons(X, L)) -> s(n_{_length}(activate(L)))
length(X) -> n_{_length}(X)
0 -> n_₀
s(X) -> n_{_s}(X)
activate(n_₀) -> 0
activate(n_{_s}(X)) -> s(X)
activate(n_{_inf}(X)) -> inf(activate(X))
activate(n_{_take}(X1, X2)) -> take(activate(X1), activate(X2))
activate(n_{_length}(X)) -> length(activate(X))
activate(X) -> X

Strategy:

innermost

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

POL(activate(x₁))	= x₁
POL(n__length(x₁))	= 1 + x₁
POL(n__take(x₁, x₂))	= x₁ + x₂
POL(take(x₁, x₂))	= x₁ + x₂
POL(n__s(x₁))	= x₁
POL(ACTIVATE(x₁))	= x₁
POL(n__inf(x₁))	= x₁
POL(0)	= 0
POL(cons(x₁, x₂))	= x₂
POL(inf(x₁))	= x₁
POL(nil)	= 0
POL(n__0)	= 0
POL(s(x₁))	= x₁
POL(LENGTH(x₁))	= x₁
POL(length(x₁))	= 1 + x₁