Termination Proof using AProVE

Term Rewriting System R:
[X, XS, X1, X2]
active(zeros) -> mark(cons(0, zeros))
active(tail(cons(X, XS))) -> mark(XS)
active(cons(X1, X2)) -> cons(active(X1), X2)
active(tail(X)) -> tail(active(X))
cons(mark(X1), X2) -> mark(cons(X1, X2))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
tail(mark(X)) -> mark(tail(X))
tail(ok(X)) -> ok(tail(X))
proper(zeros) -> ok(zeros)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(0) -> ok(0)
proper(tail(X)) -> tail(proper(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))

Innermost Termination of R to be shown.

     ↳Dependency Pair Analysis

R contains the following Dependency Pairs:

ACTIVE(zeros) -> CONS(0, zeros)
ACTIVE(cons(X1, X2)) -> CONS(active(X1), X2)
ACTIVE(cons(X1, X2)) -> ACTIVE(X1)
ACTIVE(tail(X)) -> TAIL(active(X))
ACTIVE(tail(X)) -> ACTIVE(X)
CONS(mark(X1), X2) -> CONS(X1, X2)
CONS(ok(X1), ok(X2)) -> CONS(X1, X2)
TAIL(mark(X)) -> TAIL(X)
TAIL(ok(X)) -> TAIL(X)
PROPER(cons(X1, X2)) -> CONS(proper(X1), proper(X2))
PROPER(cons(X1, X2)) -> PROPER(X1)
PROPER(cons(X1, X2)) -> PROPER(X2)
PROPER(tail(X)) -> TAIL(proper(X))
PROPER(tail(X)) -> PROPER(X)
TOP(mark(X)) -> TOP(proper(X))
TOP(mark(X)) -> PROPER(X)
TOP(ok(X)) -> TOP(active(X))
TOP(ok(X)) -> ACTIVE(X)

Furthermore, R contains five SCCs.

     ↳DPs

       →DP Problem 1

         ↳Polynomial Ordering

       →DP Problem 2

         ↳Polo

       →DP Problem 3

         ↳Polo

       →DP Problem 4

         ↳Polo

       →DP Problem 5

         ↳Nar

Dependency Pairs:

CONS(ok(X1), ok(X2)) -> CONS(X1, X2)
CONS(mark(X1), X2) -> CONS(X1, X2)

Rules:

active(zeros) -> mark(cons(0, zeros))
active(tail(cons(X, XS))) -> mark(XS)
active(cons(X1, X2)) -> cons(active(X1), X2)
active(tail(X)) -> tail(active(X))
cons(mark(X1), X2) -> mark(cons(X1, X2))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
tail(mark(X)) -> mark(tail(X))
tail(ok(X)) -> ok(tail(X))
proper(zeros) -> ok(zeros)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(0) -> ok(0)
proper(tail(X)) -> tail(proper(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))

Strategy:

innermost

The following dependency pair can be strictly oriented:

CONS(ok(X1), ok(X2)) -> CONS(X1, X2)

There are no usable rules for innermost that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:

POL(mark(x₁)) = 0

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

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

resulting in one new DP problem.

     ↳DPs

       →DP Problem 1

         ↳Polo

           →DP Problem 6

             ↳Polynomial Ordering

       →DP Problem 2

         ↳Polo

       →DP Problem 3

         ↳Polo

       →DP Problem 4

         ↳Polo

       →DP Problem 5

         ↳Nar

Dependency Pair:

CONS(mark(X1), X2) -> CONS(X1, X2)

Rules:

active(zeros) -> mark(cons(0, zeros))
active(tail(cons(X, XS))) -> mark(XS)
active(cons(X1, X2)) -> cons(active(X1), X2)
active(tail(X)) -> tail(active(X))
cons(mark(X1), X2) -> mark(cons(X1, X2))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
tail(mark(X)) -> mark(tail(X))
tail(ok(X)) -> ok(tail(X))
proper(zeros) -> ok(zeros)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(0) -> ok(0)
proper(tail(X)) -> tail(proper(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))

Strategy:

innermost

The following dependency pair can be strictly oriented:

CONS(mark(X1), X2) -> CONS(X1, X2)

There are no usable rules for innermost that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:

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

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

resulting in one new DP problem.

     ↳DPs

       →DP Problem 1

         ↳Polo

           →DP Problem 6

             ↳Polo

...

               →DP Problem 7

                 ↳Dependency Graph

       →DP Problem 2

         ↳Polo

       →DP Problem 3

         ↳Polo

       →DP Problem 4

         ↳Polo

       →DP Problem 5

         ↳Nar

Dependency Pair:

Rules:

active(zeros) -> mark(cons(0, zeros))
active(tail(cons(X, XS))) -> mark(XS)
active(cons(X1, X2)) -> cons(active(X1), X2)
active(tail(X)) -> tail(active(X))
cons(mark(X1), X2) -> mark(cons(X1, X2))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
tail(mark(X)) -> mark(tail(X))
tail(ok(X)) -> ok(tail(X))
proper(zeros) -> ok(zeros)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(0) -> ok(0)
proper(tail(X)) -> tail(proper(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))

Strategy:

innermost

Using the Dependency Graph resulted in no new DP problems.

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Polynomial Ordering

       →DP Problem 3

         ↳Polo

       →DP Problem 4

         ↳Polo

       →DP Problem 5

         ↳Nar

Dependency Pairs:

TAIL(ok(X)) -> TAIL(X)
TAIL(mark(X)) -> TAIL(X)

Rules:

active(zeros) -> mark(cons(0, zeros))
active(tail(cons(X, XS))) -> mark(XS)
active(cons(X1, X2)) -> cons(active(X1), X2)
active(tail(X)) -> tail(active(X))
cons(mark(X1), X2) -> mark(cons(X1, X2))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
tail(mark(X)) -> mark(tail(X))
tail(ok(X)) -> ok(tail(X))
proper(zeros) -> ok(zeros)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(0) -> ok(0)
proper(tail(X)) -> tail(proper(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))

Strategy:

innermost

The following dependency pair can be strictly oriented:

TAIL(ok(X)) -> TAIL(X)

There are no usable rules for innermost that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:

POL(TAIL(x₁)) = x₁

POL(mark(x₁)) = x₁

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

resulting in one new DP problem.

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Polo

           →DP Problem 8

             ↳Polynomial Ordering

       →DP Problem 3

         ↳Polo

       →DP Problem 4

         ↳Polo

       →DP Problem 5

         ↳Nar

Dependency Pair:

TAIL(mark(X)) -> TAIL(X)

Rules:

active(zeros) -> mark(cons(0, zeros))
active(tail(cons(X, XS))) -> mark(XS)
active(cons(X1, X2)) -> cons(active(X1), X2)
active(tail(X)) -> tail(active(X))
cons(mark(X1), X2) -> mark(cons(X1, X2))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
tail(mark(X)) -> mark(tail(X))
tail(ok(X)) -> ok(tail(X))
proper(zeros) -> ok(zeros)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(0) -> ok(0)
proper(tail(X)) -> tail(proper(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))

Strategy:

innermost

The following dependency pair can be strictly oriented:

TAIL(mark(X)) -> TAIL(X)

There are no usable rules for innermost that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:

POL(TAIL(x₁)) = x₁

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

resulting in one new DP problem.

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Polo

           →DP Problem 8

             ↳Polo

...

               →DP Problem 9

                 ↳Dependency Graph

       →DP Problem 3

         ↳Polo

       →DP Problem 4

         ↳Polo

       →DP Problem 5

         ↳Nar

Dependency Pair:

Rules:

active(zeros) -> mark(cons(0, zeros))
active(tail(cons(X, XS))) -> mark(XS)
active(cons(X1, X2)) -> cons(active(X1), X2)
active(tail(X)) -> tail(active(X))
cons(mark(X1), X2) -> mark(cons(X1, X2))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
tail(mark(X)) -> mark(tail(X))
tail(ok(X)) -> ok(tail(X))
proper(zeros) -> ok(zeros)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(0) -> ok(0)
proper(tail(X)) -> tail(proper(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))

Strategy:

innermost

Using the Dependency Graph resulted in no new DP problems.

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Polo

       →DP Problem 3

         ↳Polynomial Ordering

       →DP Problem 4

         ↳Polo

       →DP Problem 5

         ↳Nar

Dependency Pairs:

ACTIVE(tail(X)) -> ACTIVE(X)
ACTIVE(cons(X1, X2)) -> ACTIVE(X1)

Rules:

active(zeros) -> mark(cons(0, zeros))
active(tail(cons(X, XS))) -> mark(XS)
active(cons(X1, X2)) -> cons(active(X1), X2)
active(tail(X)) -> tail(active(X))
cons(mark(X1), X2) -> mark(cons(X1, X2))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
tail(mark(X)) -> mark(tail(X))
tail(ok(X)) -> ok(tail(X))
proper(zeros) -> ok(zeros)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(0) -> ok(0)
proper(tail(X)) -> tail(proper(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))

Strategy:

innermost

The following dependency pair can be strictly oriented:

ACTIVE(tail(X)) -> ACTIVE(X)

There are no usable rules for innermost that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:

POL(ACTIVE(x₁)) = x₁

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

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

resulting in one new DP problem.

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Polo

       →DP Problem 3

         ↳Polo

           →DP Problem 10

             ↳Polynomial Ordering

       →DP Problem 4

         ↳Polo

       →DP Problem 5

         ↳Nar

Dependency Pair:

ACTIVE(cons(X1, X2)) -> ACTIVE(X1)

Rules:

active(zeros) -> mark(cons(0, zeros))
active(tail(cons(X, XS))) -> mark(XS)
active(cons(X1, X2)) -> cons(active(X1), X2)
active(tail(X)) -> tail(active(X))
cons(mark(X1), X2) -> mark(cons(X1, X2))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
tail(mark(X)) -> mark(tail(X))
tail(ok(X)) -> ok(tail(X))
proper(zeros) -> ok(zeros)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(0) -> ok(0)
proper(tail(X)) -> tail(proper(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))

Strategy:

innermost

The following dependency pair can be strictly oriented:

ACTIVE(cons(X1, X2)) -> ACTIVE(X1)

There are no usable rules for innermost that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:

POL(ACTIVE(x₁)) = x₁

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

resulting in one new DP problem.

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Polo

       →DP Problem 3

         ↳Polo

           →DP Problem 10

             ↳Polo

...

               →DP Problem 11

                 ↳Dependency Graph

       →DP Problem 4

         ↳Polo

       →DP Problem 5

         ↳Nar

Dependency Pair:

Rules:

active(zeros) -> mark(cons(0, zeros))
active(tail(cons(X, XS))) -> mark(XS)
active(cons(X1, X2)) -> cons(active(X1), X2)
active(tail(X)) -> tail(active(X))
cons(mark(X1), X2) -> mark(cons(X1, X2))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
tail(mark(X)) -> mark(tail(X))
tail(ok(X)) -> ok(tail(X))
proper(zeros) -> ok(zeros)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(0) -> ok(0)
proper(tail(X)) -> tail(proper(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))

Strategy:

innermost

Using the Dependency Graph resulted in no new DP problems.

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Polo

       →DP Problem 3

         ↳Polo

       →DP Problem 4

         ↳Polynomial Ordering

       →DP Problem 5

         ↳Nar

Dependency Pairs:

PROPER(tail(X)) -> PROPER(X)
PROPER(cons(X1, X2)) -> PROPER(X2)
PROPER(cons(X1, X2)) -> PROPER(X1)

Rules:

active(zeros) -> mark(cons(0, zeros))
active(tail(cons(X, XS))) -> mark(XS)
active(cons(X1, X2)) -> cons(active(X1), X2)
active(tail(X)) -> tail(active(X))
cons(mark(X1), X2) -> mark(cons(X1, X2))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
tail(mark(X)) -> mark(tail(X))
tail(ok(X)) -> ok(tail(X))
proper(zeros) -> ok(zeros)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(0) -> ok(0)
proper(tail(X)) -> tail(proper(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))

Strategy:

innermost

The following dependency pair can be strictly oriented:

PROPER(tail(X)) -> PROPER(X)

There are no usable rules for innermost that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:

POL(PROPER(x₁)) = x₁

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

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

resulting in one new DP problem.

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Polo

       →DP Problem 3

         ↳Polo

       →DP Problem 4

         ↳Polo

           →DP Problem 12

             ↳Polynomial Ordering

       →DP Problem 5

         ↳Nar

Dependency Pairs:

PROPER(cons(X1, X2)) -> PROPER(X2)
PROPER(cons(X1, X2)) -> PROPER(X1)

Rules:

active(zeros) -> mark(cons(0, zeros))
active(tail(cons(X, XS))) -> mark(XS)
active(cons(X1, X2)) -> cons(active(X1), X2)
active(tail(X)) -> tail(active(X))
cons(mark(X1), X2) -> mark(cons(X1, X2))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
tail(mark(X)) -> mark(tail(X))
tail(ok(X)) -> ok(tail(X))
proper(zeros) -> ok(zeros)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(0) -> ok(0)
proper(tail(X)) -> tail(proper(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))

Strategy:

innermost

The following dependency pairs can be strictly oriented:

PROPER(cons(X1, X2)) -> PROPER(X2)
PROPER(cons(X1, X2)) -> PROPER(X1)

There are no usable rules for innermost that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:

POL(PROPER(x₁)) = x₁

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

resulting in one new DP problem.

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Polo

       →DP Problem 3

         ↳Polo

       →DP Problem 4

         ↳Polo

           →DP Problem 12

             ↳Polo

...

               →DP Problem 13

                 ↳Dependency Graph

       →DP Problem 5

         ↳Nar

Dependency Pair:

Rules:

active(zeros) -> mark(cons(0, zeros))
active(tail(cons(X, XS))) -> mark(XS)
active(cons(X1, X2)) -> cons(active(X1), X2)
active(tail(X)) -> tail(active(X))
cons(mark(X1), X2) -> mark(cons(X1, X2))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
tail(mark(X)) -> mark(tail(X))
tail(ok(X)) -> ok(tail(X))
proper(zeros) -> ok(zeros)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(0) -> ok(0)
proper(tail(X)) -> tail(proper(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))

Strategy:

innermost

Using the Dependency Graph resulted in no new DP problems.

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Polo

       →DP Problem 3

         ↳Polo

       →DP Problem 4

         ↳Polo

       →DP Problem 5

         ↳Narrowing Transformation

Dependency Pairs:

TOP(ok(X)) -> TOP(active(X))
TOP(mark(X)) -> TOP(proper(X))

Rules:

active(zeros) -> mark(cons(0, zeros))
active(tail(cons(X, XS))) -> mark(XS)
active(cons(X1, X2)) -> cons(active(X1), X2)
active(tail(X)) -> tail(active(X))
cons(mark(X1), X2) -> mark(cons(X1, X2))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
tail(mark(X)) -> mark(tail(X))
tail(ok(X)) -> ok(tail(X))
proper(zeros) -> ok(zeros)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(0) -> ok(0)
proper(tail(X)) -> tail(proper(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))

Strategy:

innermost

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

TOP(mark(X)) -> TOP(proper(X))

four new Dependency Pairs are created:

TOP(mark(zeros)) -> TOP(ok(zeros))
TOP(mark(cons(X1', X2'))) -> TOP(cons(proper(X1'), proper(X2')))
TOP(mark(0)) -> TOP(ok(0))
TOP(mark(tail(X''))) -> TOP(tail(proper(X'')))

The transformation is resulting in one new DP problem:

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Polo

       →DP Problem 3

         ↳Polo

       →DP Problem 4

         ↳Polo

       →DP Problem 5

         ↳Nar

           →DP Problem 14

             ↳Narrowing Transformation

Dependency Pairs:

TOP(mark(tail(X''))) -> TOP(tail(proper(X'')))
TOP(mark(0)) -> TOP(ok(0))
TOP(mark(cons(X1', X2'))) -> TOP(cons(proper(X1'), proper(X2')))
TOP(mark(zeros)) -> TOP(ok(zeros))
TOP(ok(X)) -> TOP(active(X))

Rules:

active(zeros) -> mark(cons(0, zeros))
active(tail(cons(X, XS))) -> mark(XS)
active(cons(X1, X2)) -> cons(active(X1), X2)
active(tail(X)) -> tail(active(X))
cons(mark(X1), X2) -> mark(cons(X1, X2))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
tail(mark(X)) -> mark(tail(X))
tail(ok(X)) -> ok(tail(X))
proper(zeros) -> ok(zeros)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(0) -> ok(0)
proper(tail(X)) -> tail(proper(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))

Strategy:

innermost

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

TOP(ok(X)) -> TOP(active(X))

four new Dependency Pairs are created:

TOP(ok(zeros)) -> TOP(mark(cons(0, zeros)))
TOP(ok(tail(cons(X'', XS')))) -> TOP(mark(XS'))
TOP(ok(cons(X1', X2'))) -> TOP(cons(active(X1'), X2'))
TOP(ok(tail(X''))) -> TOP(tail(active(X'')))

The transformation is resulting in one new DP problem:

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Polo

       →DP Problem 3

         ↳Polo

       →DP Problem 4

         ↳Polo

       →DP Problem 5

         ↳Nar

           →DP Problem 14

             ↳Nar

...

               →DP Problem 15

                 ↳Forward Instantiation Transformation

Dependency Pairs:

TOP(ok(tail(X''))) -> TOP(tail(active(X'')))
TOP(ok(cons(X1', X2'))) -> TOP(cons(active(X1'), X2'))
TOP(ok(tail(cons(X'', XS')))) -> TOP(mark(XS'))
TOP(mark(cons(X1', X2'))) -> TOP(cons(proper(X1'), proper(X2')))
TOP(ok(zeros)) -> TOP(mark(cons(0, zeros)))
TOP(mark(zeros)) -> TOP(ok(zeros))
TOP(mark(tail(X''))) -> TOP(tail(proper(X'')))

Rules:

active(zeros) -> mark(cons(0, zeros))
active(tail(cons(X, XS))) -> mark(XS)
active(cons(X1, X2)) -> cons(active(X1), X2)
active(tail(X)) -> tail(active(X))
cons(mark(X1), X2) -> mark(cons(X1, X2))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
tail(mark(X)) -> mark(tail(X))
tail(ok(X)) -> ok(tail(X))
proper(zeros) -> ok(zeros)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(0) -> ok(0)
proper(tail(X)) -> tail(proper(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))

Strategy:

innermost

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

TOP(ok(tail(cons(X'', XS')))) -> TOP(mark(XS'))

three new Dependency Pairs are created:

TOP(ok(tail(cons(X'', zeros)))) -> TOP(mark(zeros))
TOP(ok(tail(cons(X'', cons(X1''', X2'''))))) -> TOP(mark(cons(X1''', X2''')))
TOP(ok(tail(cons(X'', tail(X''''))))) -> TOP(mark(tail(X'''')))

The transformation is resulting in one new DP problem:

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Polo

       →DP Problem 3

         ↳Polo

       →DP Problem 4

         ↳Polo

       →DP Problem 5

         ↳Nar

           →DP Problem 14

             ↳Nar

...

               →DP Problem 16

                 ↳Polynomial Ordering

Dependency Pairs:

TOP(ok(tail(cons(X'', tail(X''''))))) -> TOP(mark(tail(X'''')))
TOP(ok(tail(cons(X'', cons(X1''', X2'''))))) -> TOP(mark(cons(X1''', X2''')))
TOP(ok(tail(cons(X'', zeros)))) -> TOP(mark(zeros))
TOP(ok(cons(X1', X2'))) -> TOP(cons(active(X1'), X2'))
TOP(mark(tail(X''))) -> TOP(tail(proper(X'')))
TOP(mark(cons(X1', X2'))) -> TOP(cons(proper(X1'), proper(X2')))
TOP(ok(zeros)) -> TOP(mark(cons(0, zeros)))
TOP(mark(zeros)) -> TOP(ok(zeros))
TOP(ok(tail(X''))) -> TOP(tail(active(X'')))

Rules:

active(zeros) -> mark(cons(0, zeros))
active(tail(cons(X, XS))) -> mark(XS)
active(cons(X1, X2)) -> cons(active(X1), X2)
active(tail(X)) -> tail(active(X))
cons(mark(X1), X2) -> mark(cons(X1, X2))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
tail(mark(X)) -> mark(tail(X))
tail(ok(X)) -> ok(tail(X))
proper(zeros) -> ok(zeros)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(0) -> ok(0)
proper(tail(X)) -> tail(proper(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))

Strategy:

innermost

The following dependency pairs can be strictly oriented:

TOP(ok(tail(cons(X'', tail(X''''))))) -> TOP(mark(tail(X'''')))
TOP(ok(tail(cons(X'', cons(X1''', X2'''))))) -> TOP(mark(cons(X1''', X2''')))
TOP(ok(tail(cons(X'', zeros)))) -> TOP(mark(zeros))

Additionally, the following usable rules for innermost can be oriented:

tail(mark(X)) -> mark(tail(X))
tail(ok(X)) -> ok(tail(X))
cons(mark(X1), X2) -> mark(cons(X1, X2))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
active(zeros) -> mark(cons(0, zeros))
active(tail(cons(X, XS))) -> mark(XS)
active(cons(X1, X2)) -> cons(active(X1), X2)
active(tail(X)) -> tail(active(X))
proper(zeros) -> ok(zeros)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(0) -> ok(0)
proper(tail(X)) -> tail(proper(X))

Used ordering: Polynomial ordering with Polynomial interpretation:

POL(active(x₁)) = x₁

POL(proper(x₁)) = x₁

POL(0) = 0

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

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

POL(mark(x₁)) = x₁

POL(zeros) = 0

POL(ok(x₁)) = x₁

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

resulting in one new DP problem.

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Polo

       →DP Problem 3

         ↳Polo

       →DP Problem 4

         ↳Polo

       →DP Problem 5

         ↳Nar

           →DP Problem 14

             ↳Nar

...

               →DP Problem 17

                 ↳Remaining Obligation(s)

The following remains to be proven:
Dependency Pairs:

TOP(ok(cons(X1', X2'))) -> TOP(cons(active(X1'), X2'))
TOP(mark(tail(X''))) -> TOP(tail(proper(X'')))
TOP(mark(cons(X1', X2'))) -> TOP(cons(proper(X1'), proper(X2')))
TOP(ok(zeros)) -> TOP(mark(cons(0, zeros)))
TOP(mark(zeros)) -> TOP(ok(zeros))
TOP(ok(tail(X''))) -> TOP(tail(active(X'')))

Rules:

active(zeros) -> mark(cons(0, zeros))
active(tail(cons(X, XS))) -> mark(XS)
active(cons(X1, X2)) -> cons(active(X1), X2)
active(tail(X)) -> tail(active(X))
cons(mark(X1), X2) -> mark(cons(X1, X2))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
tail(mark(X)) -> mark(tail(X))
tail(ok(X)) -> ok(tail(X))
proper(zeros) -> ok(zeros)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(0) -> ok(0)
proper(tail(X)) -> tail(proper(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))

Strategy:

innermost

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

POL(mark(x₁))	= 0
POL(ok(x₁))	= 1 + x₁
POL(CONS(x₁, x₂))	= x₂

POL(TAIL(x₁))	= x₁
POL(mark(x₁))	= x₁
POL(ok(x₁))	= 1 + x₁

POL(ACTIVE(x₁))	= x₁
POL(cons(x₁, x₂))	= x₁
POL(tail(x₁))	= 1 + x₁

POL(PROPER(x₁))	= x₁
POL(cons(x₁, x₂))	= x₁ + x₂
POL(tail(x₁))	= 1 + x₁