Termination Proof using AProVE

Term Rewriting System R:
[X, L, X1, X2]
active(incr(nil)) -> mark(nil)
active(incr(cons(X, L))) -> mark(cons(s(X), incr(L)))
active(adx(nil)) -> mark(nil)
active(adx(cons(X, L))) -> mark(incr(cons(X, adx(L))))
active(nats) -> mark(adx(zeros))
active(zeros) -> mark(cons(0, zeros))
active(head(cons(X, L))) -> mark(X)
active(tail(cons(X, L))) -> mark(L)
active(incr(X)) -> incr(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(s(X)) -> s(active(X))
active(adx(X)) -> adx(active(X))
active(head(X)) -> head(active(X))
active(tail(X)) -> tail(active(X))
incr(mark(X)) -> mark(incr(X))
incr(ok(X)) -> ok(incr(X))
cons(mark(X1), X2) -> mark(cons(X1, X2))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
s(mark(X)) -> mark(s(X))
s(ok(X)) -> ok(s(X))
adx(mark(X)) -> mark(adx(X))
adx(ok(X)) -> ok(adx(X))
head(mark(X)) -> mark(head(X))
head(ok(X)) -> ok(head(X))
tail(mark(X)) -> mark(tail(X))
tail(ok(X)) -> ok(tail(X))
proper(incr(X)) -> incr(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(s(X)) -> s(proper(X))
proper(adx(X)) -> adx(proper(X))
proper(nats) -> ok(nats)
proper(zeros) -> ok(zeros)
proper(0) -> ok(0)
proper(head(X)) -> head(proper(X))
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(incr(cons(X, L))) -> CONS(s(X), incr(L))
ACTIVE(incr(cons(X, L))) -> S(X)
ACTIVE(incr(cons(X, L))) -> INCR(L)
ACTIVE(adx(cons(X, L))) -> INCR(cons(X, adx(L)))
ACTIVE(adx(cons(X, L))) -> CONS(X, adx(L))
ACTIVE(adx(cons(X, L))) -> ADX(L)
ACTIVE(nats) -> ADX(zeros)
ACTIVE(zeros) -> CONS(0, zeros)
ACTIVE(incr(X)) -> INCR(active(X))
ACTIVE(incr(X)) -> ACTIVE(X)
ACTIVE(cons(X1, X2)) -> CONS(active(X1), X2)
ACTIVE(cons(X1, X2)) -> ACTIVE(X1)
ACTIVE(s(X)) -> S(active(X))
ACTIVE(s(X)) -> ACTIVE(X)
ACTIVE(adx(X)) -> ADX(active(X))
ACTIVE(adx(X)) -> ACTIVE(X)
ACTIVE(head(X)) -> HEAD(active(X))
ACTIVE(head(X)) -> ACTIVE(X)
ACTIVE(tail(X)) -> TAIL(active(X))
ACTIVE(tail(X)) -> ACTIVE(X)
INCR(mark(X)) -> INCR(X)
INCR(ok(X)) -> INCR(X)
CONS(mark(X1), X2) -> CONS(X1, X2)
CONS(ok(X1), ok(X2)) -> CONS(X1, X2)
S(mark(X)) -> S(X)
S(ok(X)) -> S(X)
ADX(mark(X)) -> ADX(X)
ADX(ok(X)) -> ADX(X)
HEAD(mark(X)) -> HEAD(X)
HEAD(ok(X)) -> HEAD(X)
TAIL(mark(X)) -> TAIL(X)
TAIL(ok(X)) -> TAIL(X)
PROPER(incr(X)) -> INCR(proper(X))
PROPER(incr(X)) -> PROPER(X)
PROPER(cons(X1, X2)) -> CONS(proper(X1), proper(X2))
PROPER(cons(X1, X2)) -> PROPER(X1)
PROPER(cons(X1, X2)) -> PROPER(X2)
PROPER(s(X)) -> S(proper(X))
PROPER(s(X)) -> PROPER(X)
PROPER(adx(X)) -> ADX(proper(X))
PROPER(adx(X)) -> PROPER(X)
PROPER(head(X)) -> HEAD(proper(X))
PROPER(head(X)) -> PROPER(X)
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 nine SCCs.

     ↳DPs

       →DP Problem 1

         ↳Argument Filtering and Ordering

       →DP Problem 2

         ↳AFS

       →DP Problem 3

         ↳AFS

       →DP Problem 4

         ↳AFS

       →DP Problem 5

         ↳AFS

       →DP Problem 6

         ↳AFS

       →DP Problem 7

         ↳AFS

       →DP Problem 8

         ↳AFS

       →DP Problem 9

         ↳Remaining

Dependency Pairs:

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

Rules:

active(incr(nil)) -> mark(nil)
active(incr(cons(X, L))) -> mark(cons(s(X), incr(L)))
active(adx(nil)) -> mark(nil)
active(adx(cons(X, L))) -> mark(incr(cons(X, adx(L))))
active(nats) -> mark(adx(zeros))
active(zeros) -> mark(cons(0, zeros))
active(head(cons(X, L))) -> mark(X)
active(tail(cons(X, L))) -> mark(L)
active(incr(X)) -> incr(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(s(X)) -> s(active(X))
active(adx(X)) -> adx(active(X))
active(head(X)) -> head(active(X))
active(tail(X)) -> tail(active(X))
incr(mark(X)) -> mark(incr(X))
incr(ok(X)) -> ok(incr(X))
cons(mark(X1), X2) -> mark(cons(X1, X2))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
s(mark(X)) -> mark(s(X))
s(ok(X)) -> ok(s(X))
adx(mark(X)) -> mark(adx(X))
adx(ok(X)) -> ok(adx(X))
head(mark(X)) -> mark(head(X))
head(ok(X)) -> ok(head(X))
tail(mark(X)) -> mark(tail(X))
tail(ok(X)) -> ok(tail(X))
proper(incr(X)) -> incr(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(s(X)) -> s(proper(X))
proper(adx(X)) -> adx(proper(X))
proper(nats) -> ok(nats)
proper(zeros) -> ok(zeros)
proper(0) -> ok(0)
proper(head(X)) -> head(proper(X))
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:

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

There are no usable rules for innermost that need to be oriented.
Used ordering: Homeomorphic Embedding Order with EMB
resulting in one new DP problem.
Used Argument Filtering System:

CONS(x₁, x₂) -> CONS(x₁, x₂)
mark(x₁) -> mark(x₁)
ok(x₁) -> ok(x₁)

     ↳DPs

       →DP Problem 1

         ↳AFS

           →DP Problem 10

             ↳Dependency Graph

       →DP Problem 2

         ↳AFS

       →DP Problem 3

         ↳AFS

       →DP Problem 4

         ↳AFS

       →DP Problem 5

         ↳AFS

       →DP Problem 6

         ↳AFS

       →DP Problem 7

         ↳AFS

       →DP Problem 8

         ↳AFS

       →DP Problem 9

         ↳Remaining

Dependency Pair:

Rules:

active(incr(nil)) -> mark(nil)
active(incr(cons(X, L))) -> mark(cons(s(X), incr(L)))
active(adx(nil)) -> mark(nil)
active(adx(cons(X, L))) -> mark(incr(cons(X, adx(L))))
active(nats) -> mark(adx(zeros))
active(zeros) -> mark(cons(0, zeros))
active(head(cons(X, L))) -> mark(X)
active(tail(cons(X, L))) -> mark(L)
active(incr(X)) -> incr(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(s(X)) -> s(active(X))
active(adx(X)) -> adx(active(X))
active(head(X)) -> head(active(X))
active(tail(X)) -> tail(active(X))
incr(mark(X)) -> mark(incr(X))
incr(ok(X)) -> ok(incr(X))
cons(mark(X1), X2) -> mark(cons(X1, X2))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
s(mark(X)) -> mark(s(X))
s(ok(X)) -> ok(s(X))
adx(mark(X)) -> mark(adx(X))
adx(ok(X)) -> ok(adx(X))
head(mark(X)) -> mark(head(X))
head(ok(X)) -> ok(head(X))
tail(mark(X)) -> mark(tail(X))
tail(ok(X)) -> ok(tail(X))
proper(incr(X)) -> incr(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(s(X)) -> s(proper(X))
proper(adx(X)) -> adx(proper(X))
proper(nats) -> ok(nats)
proper(zeros) -> ok(zeros)
proper(0) -> ok(0)
proper(head(X)) -> head(proper(X))
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

         ↳AFS

       →DP Problem 2

         ↳Argument Filtering and Ordering

       →DP Problem 3

         ↳AFS

       →DP Problem 4

         ↳AFS

       →DP Problem 5

         ↳AFS

       →DP Problem 6

         ↳AFS

       →DP Problem 7

         ↳AFS

       →DP Problem 8

         ↳AFS

       →DP Problem 9

         ↳Remaining

Dependency Pairs:

S(mark(X)) -> S(X)
S(ok(X)) -> S(X)

Rules:

active(incr(nil)) -> mark(nil)
active(incr(cons(X, L))) -> mark(cons(s(X), incr(L)))
active(adx(nil)) -> mark(nil)
active(adx(cons(X, L))) -> mark(incr(cons(X, adx(L))))
active(nats) -> mark(adx(zeros))
active(zeros) -> mark(cons(0, zeros))
active(head(cons(X, L))) -> mark(X)
active(tail(cons(X, L))) -> mark(L)
active(incr(X)) -> incr(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(s(X)) -> s(active(X))
active(adx(X)) -> adx(active(X))
active(head(X)) -> head(active(X))
active(tail(X)) -> tail(active(X))
incr(mark(X)) -> mark(incr(X))
incr(ok(X)) -> ok(incr(X))
cons(mark(X1), X2) -> mark(cons(X1, X2))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
s(mark(X)) -> mark(s(X))
s(ok(X)) -> ok(s(X))
adx(mark(X)) -> mark(adx(X))
adx(ok(X)) -> ok(adx(X))
head(mark(X)) -> mark(head(X))
head(ok(X)) -> ok(head(X))
tail(mark(X)) -> mark(tail(X))
tail(ok(X)) -> ok(tail(X))
proper(incr(X)) -> incr(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(s(X)) -> s(proper(X))
proper(adx(X)) -> adx(proper(X))
proper(nats) -> ok(nats)
proper(zeros) -> ok(zeros)
proper(0) -> ok(0)
proper(head(X)) -> head(proper(X))
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:

S(mark(X)) -> S(X)
S(ok(X)) -> S(X)

There are no usable rules for innermost that need to be oriented.
Used ordering: Homeomorphic Embedding Order with EMB
resulting in one new DP problem.
Used Argument Filtering System:

S(x₁) -> S(x₁)
ok(x₁) -> ok(x₁)
mark(x₁) -> mark(x₁)

     ↳DPs

       →DP Problem 1

         ↳AFS

       →DP Problem 2

         ↳AFS

           →DP Problem 11

             ↳Dependency Graph

       →DP Problem 3

         ↳AFS

       →DP Problem 4

         ↳AFS

       →DP Problem 5

         ↳AFS

       →DP Problem 6

         ↳AFS

       →DP Problem 7

         ↳AFS

       →DP Problem 8

         ↳AFS

       →DP Problem 9

         ↳Remaining

Dependency Pair:

Rules:

active(incr(nil)) -> mark(nil)
active(incr(cons(X, L))) -> mark(cons(s(X), incr(L)))
active(adx(nil)) -> mark(nil)
active(adx(cons(X, L))) -> mark(incr(cons(X, adx(L))))
active(nats) -> mark(adx(zeros))
active(zeros) -> mark(cons(0, zeros))
active(head(cons(X, L))) -> mark(X)
active(tail(cons(X, L))) -> mark(L)
active(incr(X)) -> incr(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(s(X)) -> s(active(X))
active(adx(X)) -> adx(active(X))
active(head(X)) -> head(active(X))
active(tail(X)) -> tail(active(X))
incr(mark(X)) -> mark(incr(X))
incr(ok(X)) -> ok(incr(X))
cons(mark(X1), X2) -> mark(cons(X1, X2))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
s(mark(X)) -> mark(s(X))
s(ok(X)) -> ok(s(X))
adx(mark(X)) -> mark(adx(X))
adx(ok(X)) -> ok(adx(X))
head(mark(X)) -> mark(head(X))
head(ok(X)) -> ok(head(X))
tail(mark(X)) -> mark(tail(X))
tail(ok(X)) -> ok(tail(X))
proper(incr(X)) -> incr(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(s(X)) -> s(proper(X))
proper(adx(X)) -> adx(proper(X))
proper(nats) -> ok(nats)
proper(zeros) -> ok(zeros)
proper(0) -> ok(0)
proper(head(X)) -> head(proper(X))
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

         ↳AFS

       →DP Problem 2

         ↳AFS

       →DP Problem 3

         ↳Argument Filtering and Ordering

       →DP Problem 4

         ↳AFS

       →DP Problem 5

         ↳AFS

       →DP Problem 6

         ↳AFS

       →DP Problem 7

         ↳AFS

       →DP Problem 8

         ↳AFS

       →DP Problem 9

         ↳Remaining

Dependency Pairs:

INCR(ok(X)) -> INCR(X)
INCR(mark(X)) -> INCR(X)

Rules:

active(incr(nil)) -> mark(nil)
active(incr(cons(X, L))) -> mark(cons(s(X), incr(L)))
active(adx(nil)) -> mark(nil)
active(adx(cons(X, L))) -> mark(incr(cons(X, adx(L))))
active(nats) -> mark(adx(zeros))
active(zeros) -> mark(cons(0, zeros))
active(head(cons(X, L))) -> mark(X)
active(tail(cons(X, L))) -> mark(L)
active(incr(X)) -> incr(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(s(X)) -> s(active(X))
active(adx(X)) -> adx(active(X))
active(head(X)) -> head(active(X))
active(tail(X)) -> tail(active(X))
incr(mark(X)) -> mark(incr(X))
incr(ok(X)) -> ok(incr(X))
cons(mark(X1), X2) -> mark(cons(X1, X2))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
s(mark(X)) -> mark(s(X))
s(ok(X)) -> ok(s(X))
adx(mark(X)) -> mark(adx(X))
adx(ok(X)) -> ok(adx(X))
head(mark(X)) -> mark(head(X))
head(ok(X)) -> ok(head(X))
tail(mark(X)) -> mark(tail(X))
tail(ok(X)) -> ok(tail(X))
proper(incr(X)) -> incr(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(s(X)) -> s(proper(X))
proper(adx(X)) -> adx(proper(X))
proper(nats) -> ok(nats)
proper(zeros) -> ok(zeros)
proper(0) -> ok(0)
proper(head(X)) -> head(proper(X))
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:

INCR(ok(X)) -> INCR(X)
INCR(mark(X)) -> INCR(X)

There are no usable rules for innermost that need to be oriented.
Used ordering: Homeomorphic Embedding Order with EMB
resulting in one new DP problem.
Used Argument Filtering System:

INCR(x₁) -> INCR(x₁)
mark(x₁) -> mark(x₁)
ok(x₁) -> ok(x₁)

     ↳DPs

       →DP Problem 1

         ↳AFS

       →DP Problem 2

         ↳AFS

       →DP Problem 3

         ↳AFS

           →DP Problem 12

             ↳Dependency Graph

       →DP Problem 4

         ↳AFS

       →DP Problem 5

         ↳AFS

       →DP Problem 6

         ↳AFS

       →DP Problem 7

         ↳AFS

       →DP Problem 8

         ↳AFS

       →DP Problem 9

         ↳Remaining

Dependency Pair:

Rules:

active(incr(nil)) -> mark(nil)
active(incr(cons(X, L))) -> mark(cons(s(X), incr(L)))
active(adx(nil)) -> mark(nil)
active(adx(cons(X, L))) -> mark(incr(cons(X, adx(L))))
active(nats) -> mark(adx(zeros))
active(zeros) -> mark(cons(0, zeros))
active(head(cons(X, L))) -> mark(X)
active(tail(cons(X, L))) -> mark(L)
active(incr(X)) -> incr(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(s(X)) -> s(active(X))
active(adx(X)) -> adx(active(X))
active(head(X)) -> head(active(X))
active(tail(X)) -> tail(active(X))
incr(mark(X)) -> mark(incr(X))
incr(ok(X)) -> ok(incr(X))
cons(mark(X1), X2) -> mark(cons(X1, X2))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
s(mark(X)) -> mark(s(X))
s(ok(X)) -> ok(s(X))
adx(mark(X)) -> mark(adx(X))
adx(ok(X)) -> ok(adx(X))
head(mark(X)) -> mark(head(X))
head(ok(X)) -> ok(head(X))
tail(mark(X)) -> mark(tail(X))
tail(ok(X)) -> ok(tail(X))
proper(incr(X)) -> incr(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(s(X)) -> s(proper(X))
proper(adx(X)) -> adx(proper(X))
proper(nats) -> ok(nats)
proper(zeros) -> ok(zeros)
proper(0) -> ok(0)
proper(head(X)) -> head(proper(X))
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

         ↳AFS

       →DP Problem 2

         ↳AFS

       →DP Problem 3

         ↳AFS

       →DP Problem 4

         ↳Argument Filtering and Ordering

       →DP Problem 5

         ↳AFS

       →DP Problem 6

         ↳AFS

       →DP Problem 7

         ↳AFS

       →DP Problem 8

         ↳AFS

       →DP Problem 9

         ↳Remaining

Dependency Pairs:

ADX(ok(X)) -> ADX(X)
ADX(mark(X)) -> ADX(X)

Rules:

active(incr(nil)) -> mark(nil)
active(incr(cons(X, L))) -> mark(cons(s(X), incr(L)))
active(adx(nil)) -> mark(nil)
active(adx(cons(X, L))) -> mark(incr(cons(X, adx(L))))
active(nats) -> mark(adx(zeros))
active(zeros) -> mark(cons(0, zeros))
active(head(cons(X, L))) -> mark(X)
active(tail(cons(X, L))) -> mark(L)
active(incr(X)) -> incr(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(s(X)) -> s(active(X))
active(adx(X)) -> adx(active(X))
active(head(X)) -> head(active(X))
active(tail(X)) -> tail(active(X))
incr(mark(X)) -> mark(incr(X))
incr(ok(X)) -> ok(incr(X))
cons(mark(X1), X2) -> mark(cons(X1, X2))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
s(mark(X)) -> mark(s(X))
s(ok(X)) -> ok(s(X))
adx(mark(X)) -> mark(adx(X))
adx(ok(X)) -> ok(adx(X))
head(mark(X)) -> mark(head(X))
head(ok(X)) -> ok(head(X))
tail(mark(X)) -> mark(tail(X))
tail(ok(X)) -> ok(tail(X))
proper(incr(X)) -> incr(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(s(X)) -> s(proper(X))
proper(adx(X)) -> adx(proper(X))
proper(nats) -> ok(nats)
proper(zeros) -> ok(zeros)
proper(0) -> ok(0)
proper(head(X)) -> head(proper(X))
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:

ADX(ok(X)) -> ADX(X)
ADX(mark(X)) -> ADX(X)

There are no usable rules for innermost that need to be oriented.
Used ordering: Homeomorphic Embedding Order with EMB
resulting in one new DP problem.
Used Argument Filtering System:

ADX(x₁) -> ADX(x₁)
mark(x₁) -> mark(x₁)
ok(x₁) -> ok(x₁)

     ↳DPs

       →DP Problem 1

         ↳AFS

       →DP Problem 2

         ↳AFS

       →DP Problem 3

         ↳AFS

       →DP Problem 4

         ↳AFS

           →DP Problem 13

             ↳Dependency Graph

       →DP Problem 5

         ↳AFS

       →DP Problem 6

         ↳AFS

       →DP Problem 7

         ↳AFS

       →DP Problem 8

         ↳AFS

       →DP Problem 9

         ↳Remaining

Dependency Pair:

Rules:

active(incr(nil)) -> mark(nil)
active(incr(cons(X, L))) -> mark(cons(s(X), incr(L)))
active(adx(nil)) -> mark(nil)
active(adx(cons(X, L))) -> mark(incr(cons(X, adx(L))))
active(nats) -> mark(adx(zeros))
active(zeros) -> mark(cons(0, zeros))
active(head(cons(X, L))) -> mark(X)
active(tail(cons(X, L))) -> mark(L)
active(incr(X)) -> incr(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(s(X)) -> s(active(X))
active(adx(X)) -> adx(active(X))
active(head(X)) -> head(active(X))
active(tail(X)) -> tail(active(X))
incr(mark(X)) -> mark(incr(X))
incr(ok(X)) -> ok(incr(X))
cons(mark(X1), X2) -> mark(cons(X1, X2))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
s(mark(X)) -> mark(s(X))
s(ok(X)) -> ok(s(X))
adx(mark(X)) -> mark(adx(X))
adx(ok(X)) -> ok(adx(X))
head(mark(X)) -> mark(head(X))
head(ok(X)) -> ok(head(X))
tail(mark(X)) -> mark(tail(X))
tail(ok(X)) -> ok(tail(X))
proper(incr(X)) -> incr(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(s(X)) -> s(proper(X))
proper(adx(X)) -> adx(proper(X))
proper(nats) -> ok(nats)
proper(zeros) -> ok(zeros)
proper(0) -> ok(0)
proper(head(X)) -> head(proper(X))
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

         ↳AFS

       →DP Problem 2

         ↳AFS

       →DP Problem 3

         ↳AFS

       →DP Problem 4

         ↳AFS

       →DP Problem 5

         ↳Argument Filtering and Ordering

       →DP Problem 6

         ↳AFS

       →DP Problem 7

         ↳AFS

       →DP Problem 8

         ↳AFS

       →DP Problem 9

         ↳Remaining

Dependency Pairs:

HEAD(ok(X)) -> HEAD(X)
HEAD(mark(X)) -> HEAD(X)

Rules:

active(incr(nil)) -> mark(nil)
active(incr(cons(X, L))) -> mark(cons(s(X), incr(L)))
active(adx(nil)) -> mark(nil)
active(adx(cons(X, L))) -> mark(incr(cons(X, adx(L))))
active(nats) -> mark(adx(zeros))
active(zeros) -> mark(cons(0, zeros))
active(head(cons(X, L))) -> mark(X)
active(tail(cons(X, L))) -> mark(L)
active(incr(X)) -> incr(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(s(X)) -> s(active(X))
active(adx(X)) -> adx(active(X))
active(head(X)) -> head(active(X))
active(tail(X)) -> tail(active(X))
incr(mark(X)) -> mark(incr(X))
incr(ok(X)) -> ok(incr(X))
cons(mark(X1), X2) -> mark(cons(X1, X2))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
s(mark(X)) -> mark(s(X))
s(ok(X)) -> ok(s(X))
adx(mark(X)) -> mark(adx(X))
adx(ok(X)) -> ok(adx(X))
head(mark(X)) -> mark(head(X))
head(ok(X)) -> ok(head(X))
tail(mark(X)) -> mark(tail(X))
tail(ok(X)) -> ok(tail(X))
proper(incr(X)) -> incr(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(s(X)) -> s(proper(X))
proper(adx(X)) -> adx(proper(X))
proper(nats) -> ok(nats)
proper(zeros) -> ok(zeros)
proper(0) -> ok(0)
proper(head(X)) -> head(proper(X))
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:

HEAD(ok(X)) -> HEAD(X)
HEAD(mark(X)) -> HEAD(X)

There are no usable rules for innermost that need to be oriented.
Used ordering: Homeomorphic Embedding Order with EMB
resulting in one new DP problem.
Used Argument Filtering System:

HEAD(x₁) -> HEAD(x₁)
mark(x₁) -> mark(x₁)
ok(x₁) -> ok(x₁)

     ↳DPs

       →DP Problem 1

         ↳AFS

       →DP Problem 2

         ↳AFS

       →DP Problem 3

         ↳AFS

       →DP Problem 4

         ↳AFS

       →DP Problem 5

         ↳AFS

           →DP Problem 14

             ↳Dependency Graph

       →DP Problem 6

         ↳AFS

       →DP Problem 7

         ↳AFS

       →DP Problem 8

         ↳AFS

       →DP Problem 9

         ↳Remaining

Dependency Pair:

Rules:

active(incr(nil)) -> mark(nil)
active(incr(cons(X, L))) -> mark(cons(s(X), incr(L)))
active(adx(nil)) -> mark(nil)
active(adx(cons(X, L))) -> mark(incr(cons(X, adx(L))))
active(nats) -> mark(adx(zeros))
active(zeros) -> mark(cons(0, zeros))
active(head(cons(X, L))) -> mark(X)
active(tail(cons(X, L))) -> mark(L)
active(incr(X)) -> incr(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(s(X)) -> s(active(X))
active(adx(X)) -> adx(active(X))
active(head(X)) -> head(active(X))
active(tail(X)) -> tail(active(X))
incr(mark(X)) -> mark(incr(X))
incr(ok(X)) -> ok(incr(X))
cons(mark(X1), X2) -> mark(cons(X1, X2))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
s(mark(X)) -> mark(s(X))
s(ok(X)) -> ok(s(X))
adx(mark(X)) -> mark(adx(X))
adx(ok(X)) -> ok(adx(X))
head(mark(X)) -> mark(head(X))
head(ok(X)) -> ok(head(X))
tail(mark(X)) -> mark(tail(X))
tail(ok(X)) -> ok(tail(X))
proper(incr(X)) -> incr(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(s(X)) -> s(proper(X))
proper(adx(X)) -> adx(proper(X))
proper(nats) -> ok(nats)
proper(zeros) -> ok(zeros)
proper(0) -> ok(0)
proper(head(X)) -> head(proper(X))
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

         ↳AFS

       →DP Problem 2

         ↳AFS

       →DP Problem 3

         ↳AFS

       →DP Problem 4

         ↳AFS

       →DP Problem 5

         ↳AFS

       →DP Problem 6

         ↳Argument Filtering and Ordering

       →DP Problem 7

         ↳AFS

       →DP Problem 8

         ↳AFS

       →DP Problem 9

         ↳Remaining

Dependency Pairs:

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

Rules:

active(incr(nil)) -> mark(nil)
active(incr(cons(X, L))) -> mark(cons(s(X), incr(L)))
active(adx(nil)) -> mark(nil)
active(adx(cons(X, L))) -> mark(incr(cons(X, adx(L))))
active(nats) -> mark(adx(zeros))
active(zeros) -> mark(cons(0, zeros))
active(head(cons(X, L))) -> mark(X)
active(tail(cons(X, L))) -> mark(L)
active(incr(X)) -> incr(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(s(X)) -> s(active(X))
active(adx(X)) -> adx(active(X))
active(head(X)) -> head(active(X))
active(tail(X)) -> tail(active(X))
incr(mark(X)) -> mark(incr(X))
incr(ok(X)) -> ok(incr(X))
cons(mark(X1), X2) -> mark(cons(X1, X2))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
s(mark(X)) -> mark(s(X))
s(ok(X)) -> ok(s(X))
adx(mark(X)) -> mark(adx(X))
adx(ok(X)) -> ok(adx(X))
head(mark(X)) -> mark(head(X))
head(ok(X)) -> ok(head(X))
tail(mark(X)) -> mark(tail(X))
tail(ok(X)) -> ok(tail(X))
proper(incr(X)) -> incr(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(s(X)) -> s(proper(X))
proper(adx(X)) -> adx(proper(X))
proper(nats) -> ok(nats)
proper(zeros) -> ok(zeros)
proper(0) -> ok(0)
proper(head(X)) -> head(proper(X))
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:

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

There are no usable rules for innermost that need to be oriented.
Used ordering: Homeomorphic Embedding Order with EMB
resulting in one new DP problem.
Used Argument Filtering System:

TAIL(x₁) -> TAIL(x₁)
mark(x₁) -> mark(x₁)
ok(x₁) -> ok(x₁)

     ↳DPs

       →DP Problem 1

         ↳AFS

       →DP Problem 2

         ↳AFS

       →DP Problem 3

         ↳AFS

       →DP Problem 4

         ↳AFS

       →DP Problem 5

         ↳AFS

       →DP Problem 6

         ↳AFS

           →DP Problem 15

             ↳Dependency Graph

       →DP Problem 7

         ↳AFS

       →DP Problem 8

         ↳AFS

       →DP Problem 9

         ↳Remaining

Dependency Pair:

Rules:

active(incr(nil)) -> mark(nil)
active(incr(cons(X, L))) -> mark(cons(s(X), incr(L)))
active(adx(nil)) -> mark(nil)
active(adx(cons(X, L))) -> mark(incr(cons(X, adx(L))))
active(nats) -> mark(adx(zeros))
active(zeros) -> mark(cons(0, zeros))
active(head(cons(X, L))) -> mark(X)
active(tail(cons(X, L))) -> mark(L)
active(incr(X)) -> incr(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(s(X)) -> s(active(X))
active(adx(X)) -> adx(active(X))
active(head(X)) -> head(active(X))
active(tail(X)) -> tail(active(X))
incr(mark(X)) -> mark(incr(X))
incr(ok(X)) -> ok(incr(X))
cons(mark(X1), X2) -> mark(cons(X1, X2))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
s(mark(X)) -> mark(s(X))
s(ok(X)) -> ok(s(X))
adx(mark(X)) -> mark(adx(X))
adx(ok(X)) -> ok(adx(X))
head(mark(X)) -> mark(head(X))
head(ok(X)) -> ok(head(X))
tail(mark(X)) -> mark(tail(X))
tail(ok(X)) -> ok(tail(X))
proper(incr(X)) -> incr(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(s(X)) -> s(proper(X))
proper(adx(X)) -> adx(proper(X))
proper(nats) -> ok(nats)
proper(zeros) -> ok(zeros)
proper(0) -> ok(0)
proper(head(X)) -> head(proper(X))
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

         ↳AFS

       →DP Problem 2

         ↳AFS

       →DP Problem 3

         ↳AFS

       →DP Problem 4

         ↳AFS

       →DP Problem 5

         ↳AFS

       →DP Problem 6

         ↳AFS

       →DP Problem 7

         ↳Argument Filtering and Ordering

       →DP Problem 8

         ↳AFS

       →DP Problem 9

         ↳Remaining

Dependency Pairs:

ACTIVE(tail(X)) -> ACTIVE(X)
ACTIVE(head(X)) -> ACTIVE(X)
ACTIVE(adx(X)) -> ACTIVE(X)
ACTIVE(s(X)) -> ACTIVE(X)
ACTIVE(cons(X1, X2)) -> ACTIVE(X1)
ACTIVE(incr(X)) -> ACTIVE(X)

Rules:

active(incr(nil)) -> mark(nil)
active(incr(cons(X, L))) -> mark(cons(s(X), incr(L)))
active(adx(nil)) -> mark(nil)
active(adx(cons(X, L))) -> mark(incr(cons(X, adx(L))))
active(nats) -> mark(adx(zeros))
active(zeros) -> mark(cons(0, zeros))
active(head(cons(X, L))) -> mark(X)
active(tail(cons(X, L))) -> mark(L)
active(incr(X)) -> incr(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(s(X)) -> s(active(X))
active(adx(X)) -> adx(active(X))
active(head(X)) -> head(active(X))
active(tail(X)) -> tail(active(X))
incr(mark(X)) -> mark(incr(X))
incr(ok(X)) -> ok(incr(X))
cons(mark(X1), X2) -> mark(cons(X1, X2))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
s(mark(X)) -> mark(s(X))
s(ok(X)) -> ok(s(X))
adx(mark(X)) -> mark(adx(X))
adx(ok(X)) -> ok(adx(X))
head(mark(X)) -> mark(head(X))
head(ok(X)) -> ok(head(X))
tail(mark(X)) -> mark(tail(X))
tail(ok(X)) -> ok(tail(X))
proper(incr(X)) -> incr(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(s(X)) -> s(proper(X))
proper(adx(X)) -> adx(proper(X))
proper(nats) -> ok(nats)
proper(zeros) -> ok(zeros)
proper(0) -> ok(0)
proper(head(X)) -> head(proper(X))
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:

ACTIVE(tail(X)) -> ACTIVE(X)
ACTIVE(head(X)) -> ACTIVE(X)
ACTIVE(adx(X)) -> ACTIVE(X)
ACTIVE(s(X)) -> ACTIVE(X)
ACTIVE(cons(X1, X2)) -> ACTIVE(X1)
ACTIVE(incr(X)) -> ACTIVE(X)

There are no usable rules for innermost that need to be oriented.
Used ordering: Homeomorphic Embedding Order with EMB
resulting in one new DP problem.
Used Argument Filtering System:

ACTIVE(x₁) -> ACTIVE(x₁)
s(x₁) -> s(x₁)
incr(x₁) -> incr(x₁)
adx(x₁) -> adx(x₁)
tail(x₁) -> tail(x₁)
cons(x₁, x₂) -> cons(x₁, x₂)
head(x₁) -> head(x₁)

     ↳DPs

       →DP Problem 1

         ↳AFS

       →DP Problem 2

         ↳AFS

       →DP Problem 3

         ↳AFS

       →DP Problem 4

         ↳AFS

       →DP Problem 5

         ↳AFS

       →DP Problem 6

         ↳AFS

       →DP Problem 7

         ↳AFS

           →DP Problem 16

             ↳Dependency Graph

       →DP Problem 8

         ↳AFS

       →DP Problem 9

         ↳Remaining

Dependency Pair:

Rules:

active(incr(nil)) -> mark(nil)
active(incr(cons(X, L))) -> mark(cons(s(X), incr(L)))
active(adx(nil)) -> mark(nil)
active(adx(cons(X, L))) -> mark(incr(cons(X, adx(L))))
active(nats) -> mark(adx(zeros))
active(zeros) -> mark(cons(0, zeros))
active(head(cons(X, L))) -> mark(X)
active(tail(cons(X, L))) -> mark(L)
active(incr(X)) -> incr(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(s(X)) -> s(active(X))
active(adx(X)) -> adx(active(X))
active(head(X)) -> head(active(X))
active(tail(X)) -> tail(active(X))
incr(mark(X)) -> mark(incr(X))
incr(ok(X)) -> ok(incr(X))
cons(mark(X1), X2) -> mark(cons(X1, X2))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
s(mark(X)) -> mark(s(X))
s(ok(X)) -> ok(s(X))
adx(mark(X)) -> mark(adx(X))
adx(ok(X)) -> ok(adx(X))
head(mark(X)) -> mark(head(X))
head(ok(X)) -> ok(head(X))
tail(mark(X)) -> mark(tail(X))
tail(ok(X)) -> ok(tail(X))
proper(incr(X)) -> incr(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(s(X)) -> s(proper(X))
proper(adx(X)) -> adx(proper(X))
proper(nats) -> ok(nats)
proper(zeros) -> ok(zeros)
proper(0) -> ok(0)
proper(head(X)) -> head(proper(X))
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

         ↳AFS

       →DP Problem 2

         ↳AFS

       →DP Problem 3

         ↳AFS

       →DP Problem 4

         ↳AFS

       →DP Problem 5

         ↳AFS

       →DP Problem 6

         ↳AFS

       →DP Problem 7

         ↳AFS

       →DP Problem 8

         ↳Argument Filtering and Ordering

       →DP Problem 9

         ↳Remaining

Dependency Pairs:

PROPER(tail(X)) -> PROPER(X)
PROPER(head(X)) -> PROPER(X)
PROPER(adx(X)) -> PROPER(X)
PROPER(s(X)) -> PROPER(X)
PROPER(cons(X1, X2)) -> PROPER(X2)
PROPER(cons(X1, X2)) -> PROPER(X1)
PROPER(incr(X)) -> PROPER(X)

Rules:

active(incr(nil)) -> mark(nil)
active(incr(cons(X, L))) -> mark(cons(s(X), incr(L)))
active(adx(nil)) -> mark(nil)
active(adx(cons(X, L))) -> mark(incr(cons(X, adx(L))))
active(nats) -> mark(adx(zeros))
active(zeros) -> mark(cons(0, zeros))
active(head(cons(X, L))) -> mark(X)
active(tail(cons(X, L))) -> mark(L)
active(incr(X)) -> incr(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(s(X)) -> s(active(X))
active(adx(X)) -> adx(active(X))
active(head(X)) -> head(active(X))
active(tail(X)) -> tail(active(X))
incr(mark(X)) -> mark(incr(X))
incr(ok(X)) -> ok(incr(X))
cons(mark(X1), X2) -> mark(cons(X1, X2))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
s(mark(X)) -> mark(s(X))
s(ok(X)) -> ok(s(X))
adx(mark(X)) -> mark(adx(X))
adx(ok(X)) -> ok(adx(X))
head(mark(X)) -> mark(head(X))
head(ok(X)) -> ok(head(X))
tail(mark(X)) -> mark(tail(X))
tail(ok(X)) -> ok(tail(X))
proper(incr(X)) -> incr(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(s(X)) -> s(proper(X))
proper(adx(X)) -> adx(proper(X))
proper(nats) -> ok(nats)
proper(zeros) -> ok(zeros)
proper(0) -> ok(0)
proper(head(X)) -> head(proper(X))
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(tail(X)) -> PROPER(X)
PROPER(head(X)) -> PROPER(X)
PROPER(adx(X)) -> PROPER(X)
PROPER(s(X)) -> PROPER(X)
PROPER(cons(X1, X2)) -> PROPER(X2)
PROPER(cons(X1, X2)) -> PROPER(X1)
PROPER(incr(X)) -> PROPER(X)

There are no usable rules for innermost that need to be oriented.
Used ordering: Homeomorphic Embedding Order with EMB
resulting in one new DP problem.
Used Argument Filtering System:

PROPER(x₁) -> PROPER(x₁)
head(x₁) -> head(x₁)
cons(x₁, x₂) -> cons(x₁, x₂)
incr(x₁) -> incr(x₁)
tail(x₁) -> tail(x₁)
s(x₁) -> s(x₁)
adx(x₁) -> adx(x₁)

     ↳DPs

       →DP Problem 1

         ↳AFS

       →DP Problem 2

         ↳AFS

       →DP Problem 3

         ↳AFS

       →DP Problem 4

         ↳AFS

       →DP Problem 5

         ↳AFS

       →DP Problem 6

         ↳AFS

       →DP Problem 7

         ↳AFS

       →DP Problem 8

         ↳AFS

           →DP Problem 17

             ↳Dependency Graph

       →DP Problem 9

         ↳Remaining

Dependency Pair:

Rules:

active(incr(nil)) -> mark(nil)
active(incr(cons(X, L))) -> mark(cons(s(X), incr(L)))
active(adx(nil)) -> mark(nil)
active(adx(cons(X, L))) -> mark(incr(cons(X, adx(L))))
active(nats) -> mark(adx(zeros))
active(zeros) -> mark(cons(0, zeros))
active(head(cons(X, L))) -> mark(X)
active(tail(cons(X, L))) -> mark(L)
active(incr(X)) -> incr(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(s(X)) -> s(active(X))
active(adx(X)) -> adx(active(X))
active(head(X)) -> head(active(X))
active(tail(X)) -> tail(active(X))
incr(mark(X)) -> mark(incr(X))
incr(ok(X)) -> ok(incr(X))
cons(mark(X1), X2) -> mark(cons(X1, X2))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
s(mark(X)) -> mark(s(X))
s(ok(X)) -> ok(s(X))
adx(mark(X)) -> mark(adx(X))
adx(ok(X)) -> ok(adx(X))
head(mark(X)) -> mark(head(X))
head(ok(X)) -> ok(head(X))
tail(mark(X)) -> mark(tail(X))
tail(ok(X)) -> ok(tail(X))
proper(incr(X)) -> incr(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(s(X)) -> s(proper(X))
proper(adx(X)) -> adx(proper(X))
proper(nats) -> ok(nats)
proper(zeros) -> ok(zeros)
proper(0) -> ok(0)
proper(head(X)) -> head(proper(X))
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

         ↳AFS

       →DP Problem 2

         ↳AFS

       →DP Problem 3

         ↳AFS

       →DP Problem 4

         ↳AFS

       →DP Problem 5

         ↳AFS

       →DP Problem 6

         ↳AFS

       →DP Problem 7

         ↳AFS

       →DP Problem 8

         ↳AFS

       →DP Problem 9

         ↳Remaining Obligation(s)

The following remains to be proven:
Dependency Pairs:

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

Rules:

active(incr(nil)) -> mark(nil)
active(incr(cons(X, L))) -> mark(cons(s(X), incr(L)))
active(adx(nil)) -> mark(nil)
active(adx(cons(X, L))) -> mark(incr(cons(X, adx(L))))
active(nats) -> mark(adx(zeros))
active(zeros) -> mark(cons(0, zeros))
active(head(cons(X, L))) -> mark(X)
active(tail(cons(X, L))) -> mark(L)
active(incr(X)) -> incr(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(s(X)) -> s(active(X))
active(adx(X)) -> adx(active(X))
active(head(X)) -> head(active(X))
active(tail(X)) -> tail(active(X))
incr(mark(X)) -> mark(incr(X))
incr(ok(X)) -> ok(incr(X))
cons(mark(X1), X2) -> mark(cons(X1, X2))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
s(mark(X)) -> mark(s(X))
s(ok(X)) -> ok(s(X))
adx(mark(X)) -> mark(adx(X))
adx(ok(X)) -> ok(adx(X))
head(mark(X)) -> mark(head(X))
head(ok(X)) -> ok(head(X))
tail(mark(X)) -> mark(tail(X))
tail(ok(X)) -> ok(tail(X))
proper(incr(X)) -> incr(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(s(X)) -> s(proper(X))
proper(adx(X)) -> adx(proper(X))
proper(nats) -> ok(nats)
proper(zeros) -> ok(zeros)
proper(0) -> ok(0)
proper(head(X)) -> head(proper(X))
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:05 minutes