Termination Proof using AProVE

Term Rewriting System R:
[X, XS, N, Y, YS, X1, X2]
active(from(X)) -> mark(cons(X, from(s(X))))
active(sel(0, cons(X, XS))) -> mark(X)
active(sel(s(N), cons(X, XS))) -> mark(sel(N, XS))
active(minus(X, 0)) -> mark(0)
active(minus(s(X), s(Y))) -> mark(minus(X, Y))
active(quot(0, s(Y))) -> mark(0)
active(quot(s(X), s(Y))) -> mark(s(quot(minus(X, Y), s(Y))))
active(zWquot(XS, nil)) -> mark(nil)
active(zWquot(nil, XS)) -> mark(nil)
active(zWquot(cons(X, XS), cons(Y, YS))) -> mark(cons(quot(X, Y), zWquot(XS, YS)))
active(from(X)) -> from(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(s(X)) -> s(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(minus(X1, X2)) -> minus(active(X1), X2)
active(minus(X1, X2)) -> minus(X1, active(X2))
active(quot(X1, X2)) -> quot(active(X1), X2)
active(quot(X1, X2)) -> quot(X1, active(X2))
active(zWquot(X1, X2)) -> zWquot(active(X1), X2)
active(zWquot(X1, X2)) -> zWquot(X1, active(X2))
from(mark(X)) -> mark(from(X))
from(ok(X)) -> ok(from(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))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
minus(mark(X1), X2) -> mark(minus(X1, X2))
minus(X1, mark(X2)) -> mark(minus(X1, X2))
minus(ok(X1), ok(X2)) -> ok(minus(X1, X2))
quot(mark(X1), X2) -> mark(quot(X1, X2))
quot(X1, mark(X2)) -> mark(quot(X1, X2))
quot(ok(X1), ok(X2)) -> ok(quot(X1, X2))
zWquot(mark(X1), X2) -> mark(zWquot(X1, X2))
zWquot(X1, mark(X2)) -> mark(zWquot(X1, X2))
zWquot(ok(X1), ok(X2)) -> ok(zWquot(X1, X2))
proper(from(X)) -> from(proper(X))
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(s(X)) -> s(proper(X))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(0) -> ok(0)
proper(minus(X1, X2)) -> minus(proper(X1), proper(X2))
proper(quot(X1, X2)) -> quot(proper(X1), proper(X2))
proper(zWquot(X1, X2)) -> zWquot(proper(X1), proper(X2))
proper(nil) -> ok(nil)
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(from(X)) -> CONS(X, from(s(X)))
ACTIVE(from(X)) -> FROM(s(X))
ACTIVE(from(X)) -> S(X)
ACTIVE(sel(s(N), cons(X, XS))) -> SEL(N, XS)
ACTIVE(minus(s(X), s(Y))) -> MINUS(X, Y)
ACTIVE(quot(s(X), s(Y))) -> S(quot(minus(X, Y), s(Y)))
ACTIVE(quot(s(X), s(Y))) -> QUOT(minus(X, Y), s(Y))
ACTIVE(quot(s(X), s(Y))) -> MINUS(X, Y)
ACTIVE(zWquot(cons(X, XS), cons(Y, YS))) -> CONS(quot(X, Y), zWquot(XS, YS))
ACTIVE(zWquot(cons(X, XS), cons(Y, YS))) -> QUOT(X, Y)
ACTIVE(zWquot(cons(X, XS), cons(Y, YS))) -> ZWQUOT(XS, YS)
ACTIVE(from(X)) -> FROM(active(X))
ACTIVE(from(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(sel(X1, X2)) -> SEL(active(X1), X2)
ACTIVE(sel(X1, X2)) -> ACTIVE(X1)
ACTIVE(sel(X1, X2)) -> SEL(X1, active(X2))
ACTIVE(sel(X1, X2)) -> ACTIVE(X2)
ACTIVE(minus(X1, X2)) -> MINUS(active(X1), X2)
ACTIVE(minus(X1, X2)) -> ACTIVE(X1)
ACTIVE(minus(X1, X2)) -> MINUS(X1, active(X2))
ACTIVE(minus(X1, X2)) -> ACTIVE(X2)
ACTIVE(quot(X1, X2)) -> QUOT(active(X1), X2)
ACTIVE(quot(X1, X2)) -> ACTIVE(X1)
ACTIVE(quot(X1, X2)) -> QUOT(X1, active(X2))
ACTIVE(quot(X1, X2)) -> ACTIVE(X2)
ACTIVE(zWquot(X1, X2)) -> ZWQUOT(active(X1), X2)
ACTIVE(zWquot(X1, X2)) -> ACTIVE(X1)
ACTIVE(zWquot(X1, X2)) -> ZWQUOT(X1, active(X2))
ACTIVE(zWquot(X1, X2)) -> ACTIVE(X2)
FROM(mark(X)) -> FROM(X)
FROM(ok(X)) -> FROM(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)
SEL(mark(X1), X2) -> SEL(X1, X2)
SEL(X1, mark(X2)) -> SEL(X1, X2)
SEL(ok(X1), ok(X2)) -> SEL(X1, X2)
MINUS(mark(X1), X2) -> MINUS(X1, X2)
MINUS(X1, mark(X2)) -> MINUS(X1, X2)
MINUS(ok(X1), ok(X2)) -> MINUS(X1, X2)
QUOT(mark(X1), X2) -> QUOT(X1, X2)
QUOT(X1, mark(X2)) -> QUOT(X1, X2)
QUOT(ok(X1), ok(X2)) -> QUOT(X1, X2)
ZWQUOT(mark(X1), X2) -> ZWQUOT(X1, X2)
ZWQUOT(X1, mark(X2)) -> ZWQUOT(X1, X2)
ZWQUOT(ok(X1), ok(X2)) -> ZWQUOT(X1, X2)
PROPER(from(X)) -> FROM(proper(X))
PROPER(from(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(sel(X1, X2)) -> SEL(proper(X1), proper(X2))
PROPER(sel(X1, X2)) -> PROPER(X1)
PROPER(sel(X1, X2)) -> PROPER(X2)
PROPER(minus(X1, X2)) -> MINUS(proper(X1), proper(X2))
PROPER(minus(X1, X2)) -> PROPER(X1)
PROPER(minus(X1, X2)) -> PROPER(X2)
PROPER(quot(X1, X2)) -> QUOT(proper(X1), proper(X2))
PROPER(quot(X1, X2)) -> PROPER(X1)
PROPER(quot(X1, X2)) -> PROPER(X2)
PROPER(zWquot(X1, X2)) -> ZWQUOT(proper(X1), proper(X2))
PROPER(zWquot(X1, X2)) -> PROPER(X1)
PROPER(zWquot(X1, X2)) -> PROPER(X2)
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 10 SCCs.

     ↳DPs

       →DP Problem 1

         ↳Polynomial Ordering

       →DP Problem 2

         ↳Polo

       →DP Problem 3

         ↳Polo

       →DP Problem 4

         ↳Polo

       →DP Problem 5

         ↳Polo

       →DP Problem 6

         ↳Polo

       →DP Problem 7

         ↳Polo

       →DP Problem 8

         ↳Polo

       →DP Problem 9

         ↳Polo

       →DP Problem 10

         ↳Remaining

Dependency Pairs:

FROM(ok(X)) -> FROM(X)
FROM(mark(X)) -> FROM(X)

Rules:

active(from(X)) -> mark(cons(X, from(s(X))))
active(sel(0, cons(X, XS))) -> mark(X)
active(sel(s(N), cons(X, XS))) -> mark(sel(N, XS))
active(minus(X, 0)) -> mark(0)
active(minus(s(X), s(Y))) -> mark(minus(X, Y))
active(quot(0, s(Y))) -> mark(0)
active(quot(s(X), s(Y))) -> mark(s(quot(minus(X, Y), s(Y))))
active(zWquot(XS, nil)) -> mark(nil)
active(zWquot(nil, XS)) -> mark(nil)
active(zWquot(cons(X, XS), cons(Y, YS))) -> mark(cons(quot(X, Y), zWquot(XS, YS)))
active(from(X)) -> from(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(s(X)) -> s(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(minus(X1, X2)) -> minus(active(X1), X2)
active(minus(X1, X2)) -> minus(X1, active(X2))
active(quot(X1, X2)) -> quot(active(X1), X2)
active(quot(X1, X2)) -> quot(X1, active(X2))
active(zWquot(X1, X2)) -> zWquot(active(X1), X2)
active(zWquot(X1, X2)) -> zWquot(X1, active(X2))
from(mark(X)) -> mark(from(X))
from(ok(X)) -> ok(from(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))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
minus(mark(X1), X2) -> mark(minus(X1, X2))
minus(X1, mark(X2)) -> mark(minus(X1, X2))
minus(ok(X1), ok(X2)) -> ok(minus(X1, X2))
quot(mark(X1), X2) -> mark(quot(X1, X2))
quot(X1, mark(X2)) -> mark(quot(X1, X2))
quot(ok(X1), ok(X2)) -> ok(quot(X1, X2))
zWquot(mark(X1), X2) -> mark(zWquot(X1, X2))
zWquot(X1, mark(X2)) -> mark(zWquot(X1, X2))
zWquot(ok(X1), ok(X2)) -> ok(zWquot(X1, X2))
proper(from(X)) -> from(proper(X))
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(s(X)) -> s(proper(X))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(0) -> ok(0)
proper(minus(X1, X2)) -> minus(proper(X1), proper(X2))
proper(quot(X1, X2)) -> quot(proper(X1), proper(X2))
proper(zWquot(X1, X2)) -> zWquot(proper(X1), proper(X2))
proper(nil) -> ok(nil)
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))

Strategy:

innermost

The following dependency pair can be strictly oriented:

FROM(ok(X)) -> FROM(X)

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

Used ordering: Polynomial ordering with Polynomial interpretation:

POL(FROM(x₁)) = x₁

POL(mark(x₁)) = x₁

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

resulting in one new DP problem.

     ↳DPs

       →DP Problem 1

         ↳Polo

           →DP Problem 11

             ↳Polynomial Ordering

       →DP Problem 2

         ↳Polo

       →DP Problem 3

         ↳Polo

       →DP Problem 4

         ↳Polo

       →DP Problem 5

         ↳Polo

       →DP Problem 6

         ↳Polo

       →DP Problem 7

         ↳Polo

       →DP Problem 8

         ↳Polo

       →DP Problem 9

         ↳Polo

       →DP Problem 10

         ↳Remaining

Dependency Pair:

FROM(mark(X)) -> FROM(X)

Rules:

active(from(X)) -> mark(cons(X, from(s(X))))
active(sel(0, cons(X, XS))) -> mark(X)
active(sel(s(N), cons(X, XS))) -> mark(sel(N, XS))
active(minus(X, 0)) -> mark(0)
active(minus(s(X), s(Y))) -> mark(minus(X, Y))
active(quot(0, s(Y))) -> mark(0)
active(quot(s(X), s(Y))) -> mark(s(quot(minus(X, Y), s(Y))))
active(zWquot(XS, nil)) -> mark(nil)
active(zWquot(nil, XS)) -> mark(nil)
active(zWquot(cons(X, XS), cons(Y, YS))) -> mark(cons(quot(X, Y), zWquot(XS, YS)))
active(from(X)) -> from(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(s(X)) -> s(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(minus(X1, X2)) -> minus(active(X1), X2)
active(minus(X1, X2)) -> minus(X1, active(X2))
active(quot(X1, X2)) -> quot(active(X1), X2)
active(quot(X1, X2)) -> quot(X1, active(X2))
active(zWquot(X1, X2)) -> zWquot(active(X1), X2)
active(zWquot(X1, X2)) -> zWquot(X1, active(X2))
from(mark(X)) -> mark(from(X))
from(ok(X)) -> ok(from(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))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
minus(mark(X1), X2) -> mark(minus(X1, X2))
minus(X1, mark(X2)) -> mark(minus(X1, X2))
minus(ok(X1), ok(X2)) -> ok(minus(X1, X2))
quot(mark(X1), X2) -> mark(quot(X1, X2))
quot(X1, mark(X2)) -> mark(quot(X1, X2))
quot(ok(X1), ok(X2)) -> ok(quot(X1, X2))
zWquot(mark(X1), X2) -> mark(zWquot(X1, X2))
zWquot(X1, mark(X2)) -> mark(zWquot(X1, X2))
zWquot(ok(X1), ok(X2)) -> ok(zWquot(X1, X2))
proper(from(X)) -> from(proper(X))
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(s(X)) -> s(proper(X))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(0) -> ok(0)
proper(minus(X1, X2)) -> minus(proper(X1), proper(X2))
proper(quot(X1, X2)) -> quot(proper(X1), proper(X2))
proper(zWquot(X1, X2)) -> zWquot(proper(X1), proper(X2))
proper(nil) -> ok(nil)
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))

Strategy:

innermost

The following dependency pair can be strictly oriented:

FROM(mark(X)) -> FROM(X)

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

Used ordering: Polynomial ordering with Polynomial interpretation:

POL(FROM(x₁)) = x₁

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

resulting in one new DP problem.

     ↳DPs

       →DP Problem 1

         ↳Polo

           →DP Problem 11

             ↳Polo

...

               →DP Problem 12

                 ↳Dependency Graph

       →DP Problem 2

         ↳Polo

       →DP Problem 3

         ↳Polo

       →DP Problem 4

         ↳Polo

       →DP Problem 5

         ↳Polo

       →DP Problem 6

         ↳Polo

       →DP Problem 7

         ↳Polo

       →DP Problem 8

         ↳Polo

       →DP Problem 9

         ↳Polo

       →DP Problem 10

         ↳Remaining

Dependency Pair:

Rules:

active(from(X)) -> mark(cons(X, from(s(X))))
active(sel(0, cons(X, XS))) -> mark(X)
active(sel(s(N), cons(X, XS))) -> mark(sel(N, XS))
active(minus(X, 0)) -> mark(0)
active(minus(s(X), s(Y))) -> mark(minus(X, Y))
active(quot(0, s(Y))) -> mark(0)
active(quot(s(X), s(Y))) -> mark(s(quot(minus(X, Y), s(Y))))
active(zWquot(XS, nil)) -> mark(nil)
active(zWquot(nil, XS)) -> mark(nil)
active(zWquot(cons(X, XS), cons(Y, YS))) -> mark(cons(quot(X, Y), zWquot(XS, YS)))
active(from(X)) -> from(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(s(X)) -> s(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(minus(X1, X2)) -> minus(active(X1), X2)
active(minus(X1, X2)) -> minus(X1, active(X2))
active(quot(X1, X2)) -> quot(active(X1), X2)
active(quot(X1, X2)) -> quot(X1, active(X2))
active(zWquot(X1, X2)) -> zWquot(active(X1), X2)
active(zWquot(X1, X2)) -> zWquot(X1, active(X2))
from(mark(X)) -> mark(from(X))
from(ok(X)) -> ok(from(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))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
minus(mark(X1), X2) -> mark(minus(X1, X2))
minus(X1, mark(X2)) -> mark(minus(X1, X2))
minus(ok(X1), ok(X2)) -> ok(minus(X1, X2))
quot(mark(X1), X2) -> mark(quot(X1, X2))
quot(X1, mark(X2)) -> mark(quot(X1, X2))
quot(ok(X1), ok(X2)) -> ok(quot(X1, X2))
zWquot(mark(X1), X2) -> mark(zWquot(X1, X2))
zWquot(X1, mark(X2)) -> mark(zWquot(X1, X2))
zWquot(ok(X1), ok(X2)) -> ok(zWquot(X1, X2))
proper(from(X)) -> from(proper(X))
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(s(X)) -> s(proper(X))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(0) -> ok(0)
proper(minus(X1, X2)) -> minus(proper(X1), proper(X2))
proper(quot(X1, X2)) -> quot(proper(X1), proper(X2))
proper(zWquot(X1, X2)) -> zWquot(proper(X1), proper(X2))
proper(nil) -> ok(nil)
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

         ↳Polo

       →DP Problem 6

         ↳Polo

       →DP Problem 7

         ↳Polo

       →DP Problem 8

         ↳Polo

       →DP Problem 9

         ↳Polo

       →DP Problem 10

         ↳Remaining

Dependency Pairs:

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

Rules:

active(from(X)) -> mark(cons(X, from(s(X))))
active(sel(0, cons(X, XS))) -> mark(X)
active(sel(s(N), cons(X, XS))) -> mark(sel(N, XS))
active(minus(X, 0)) -> mark(0)
active(minus(s(X), s(Y))) -> mark(minus(X, Y))
active(quot(0, s(Y))) -> mark(0)
active(quot(s(X), s(Y))) -> mark(s(quot(minus(X, Y), s(Y))))
active(zWquot(XS, nil)) -> mark(nil)
active(zWquot(nil, XS)) -> mark(nil)
active(zWquot(cons(X, XS), cons(Y, YS))) -> mark(cons(quot(X, Y), zWquot(XS, YS)))
active(from(X)) -> from(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(s(X)) -> s(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(minus(X1, X2)) -> minus(active(X1), X2)
active(minus(X1, X2)) -> minus(X1, active(X2))
active(quot(X1, X2)) -> quot(active(X1), X2)
active(quot(X1, X2)) -> quot(X1, active(X2))
active(zWquot(X1, X2)) -> zWquot(active(X1), X2)
active(zWquot(X1, X2)) -> zWquot(X1, active(X2))
from(mark(X)) -> mark(from(X))
from(ok(X)) -> ok(from(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))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
minus(mark(X1), X2) -> mark(minus(X1, X2))
minus(X1, mark(X2)) -> mark(minus(X1, X2))
minus(ok(X1), ok(X2)) -> ok(minus(X1, X2))
quot(mark(X1), X2) -> mark(quot(X1, X2))
quot(X1, mark(X2)) -> mark(quot(X1, X2))
quot(ok(X1), ok(X2)) -> ok(quot(X1, X2))
zWquot(mark(X1), X2) -> mark(zWquot(X1, X2))
zWquot(X1, mark(X2)) -> mark(zWquot(X1, X2))
zWquot(ok(X1), ok(X2)) -> ok(zWquot(X1, X2))
proper(from(X)) -> from(proper(X))
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(s(X)) -> s(proper(X))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(0) -> ok(0)
proper(minus(X1, X2)) -> minus(proper(X1), proper(X2))
proper(quot(X1, X2)) -> quot(proper(X1), proper(X2))
proper(zWquot(X1, X2)) -> zWquot(proper(X1), proper(X2))
proper(nil) -> ok(nil)
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))

Strategy:

innermost

The following dependency pair can be strictly oriented:

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

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

Used ordering: Polynomial ordering with Polynomial interpretation:

POL(SEL(x₁, 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 13

             ↳Polynomial Ordering

       →DP Problem 3

         ↳Polo

       →DP Problem 4

         ↳Polo

       →DP Problem 5

         ↳Polo

       →DP Problem 6

         ↳Polo

       →DP Problem 7

         ↳Polo

       →DP Problem 8

         ↳Polo

       →DP Problem 9

         ↳Polo

       →DP Problem 10

         ↳Remaining

Dependency Pairs:

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

Rules:

active(from(X)) -> mark(cons(X, from(s(X))))
active(sel(0, cons(X, XS))) -> mark(X)
active(sel(s(N), cons(X, XS))) -> mark(sel(N, XS))
active(minus(X, 0)) -> mark(0)
active(minus(s(X), s(Y))) -> mark(minus(X, Y))
active(quot(0, s(Y))) -> mark(0)
active(quot(s(X), s(Y))) -> mark(s(quot(minus(X, Y), s(Y))))
active(zWquot(XS, nil)) -> mark(nil)
active(zWquot(nil, XS)) -> mark(nil)
active(zWquot(cons(X, XS), cons(Y, YS))) -> mark(cons(quot(X, Y), zWquot(XS, YS)))
active(from(X)) -> from(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(s(X)) -> s(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(minus(X1, X2)) -> minus(active(X1), X2)
active(minus(X1, X2)) -> minus(X1, active(X2))
active(quot(X1, X2)) -> quot(active(X1), X2)
active(quot(X1, X2)) -> quot(X1, active(X2))
active(zWquot(X1, X2)) -> zWquot(active(X1), X2)
active(zWquot(X1, X2)) -> zWquot(X1, active(X2))
from(mark(X)) -> mark(from(X))
from(ok(X)) -> ok(from(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))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
minus(mark(X1), X2) -> mark(minus(X1, X2))
minus(X1, mark(X2)) -> mark(minus(X1, X2))
minus(ok(X1), ok(X2)) -> ok(minus(X1, X2))
quot(mark(X1), X2) -> mark(quot(X1, X2))
quot(X1, mark(X2)) -> mark(quot(X1, X2))
quot(ok(X1), ok(X2)) -> ok(quot(X1, X2))
zWquot(mark(X1), X2) -> mark(zWquot(X1, X2))
zWquot(X1, mark(X2)) -> mark(zWquot(X1, X2))
zWquot(ok(X1), ok(X2)) -> ok(zWquot(X1, X2))
proper(from(X)) -> from(proper(X))
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(s(X)) -> s(proper(X))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(0) -> ok(0)
proper(minus(X1, X2)) -> minus(proper(X1), proper(X2))
proper(quot(X1, X2)) -> quot(proper(X1), proper(X2))
proper(zWquot(X1, X2)) -> zWquot(proper(X1), proper(X2))
proper(nil) -> ok(nil)
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))

Strategy:

innermost

The following dependency pair can be strictly oriented:

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

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

Used ordering: Polynomial ordering with Polynomial interpretation:

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

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

resulting in one new DP problem.

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Polo

           →DP Problem 13

             ↳Polo

...

               →DP Problem 14

                 ↳Polynomial Ordering

       →DP Problem 3

         ↳Polo

       →DP Problem 4

         ↳Polo

       →DP Problem 5

         ↳Polo

       →DP Problem 6

         ↳Polo

       →DP Problem 7

         ↳Polo

       →DP Problem 8

         ↳Polo

       →DP Problem 9

         ↳Polo

       →DP Problem 10

         ↳Remaining

Dependency Pair:

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

Rules:

active(from(X)) -> mark(cons(X, from(s(X))))
active(sel(0, cons(X, XS))) -> mark(X)
active(sel(s(N), cons(X, XS))) -> mark(sel(N, XS))
active(minus(X, 0)) -> mark(0)
active(minus(s(X), s(Y))) -> mark(minus(X, Y))
active(quot(0, s(Y))) -> mark(0)
active(quot(s(X), s(Y))) -> mark(s(quot(minus(X, Y), s(Y))))
active(zWquot(XS, nil)) -> mark(nil)
active(zWquot(nil, XS)) -> mark(nil)
active(zWquot(cons(X, XS), cons(Y, YS))) -> mark(cons(quot(X, Y), zWquot(XS, YS)))
active(from(X)) -> from(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(s(X)) -> s(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(minus(X1, X2)) -> minus(active(X1), X2)
active(minus(X1, X2)) -> minus(X1, active(X2))
active(quot(X1, X2)) -> quot(active(X1), X2)
active(quot(X1, X2)) -> quot(X1, active(X2))
active(zWquot(X1, X2)) -> zWquot(active(X1), X2)
active(zWquot(X1, X2)) -> zWquot(X1, active(X2))
from(mark(X)) -> mark(from(X))
from(ok(X)) -> ok(from(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))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
minus(mark(X1), X2) -> mark(minus(X1, X2))
minus(X1, mark(X2)) -> mark(minus(X1, X2))
minus(ok(X1), ok(X2)) -> ok(minus(X1, X2))
quot(mark(X1), X2) -> mark(quot(X1, X2))
quot(X1, mark(X2)) -> mark(quot(X1, X2))
quot(ok(X1), ok(X2)) -> ok(quot(X1, X2))
zWquot(mark(X1), X2) -> mark(zWquot(X1, X2))
zWquot(X1, mark(X2)) -> mark(zWquot(X1, X2))
zWquot(ok(X1), ok(X2)) -> ok(zWquot(X1, X2))
proper(from(X)) -> from(proper(X))
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(s(X)) -> s(proper(X))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(0) -> ok(0)
proper(minus(X1, X2)) -> minus(proper(X1), proper(X2))
proper(quot(X1, X2)) -> quot(proper(X1), proper(X2))
proper(zWquot(X1, X2)) -> zWquot(proper(X1), proper(X2))
proper(nil) -> ok(nil)
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))

Strategy:

innermost

The following dependency pair can be strictly oriented:

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

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

Used ordering: Polynomial ordering with Polynomial interpretation:

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

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

resulting in one new DP problem.

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Polo

           →DP Problem 13

             ↳Polo

...

               →DP Problem 15

                 ↳Dependency Graph

       →DP Problem 3

         ↳Polo

       →DP Problem 4

         ↳Polo

       →DP Problem 5

         ↳Polo

       →DP Problem 6

         ↳Polo

       →DP Problem 7

         ↳Polo

       →DP Problem 8

         ↳Polo

       →DP Problem 9

         ↳Polo

       →DP Problem 10

         ↳Remaining

Dependency Pair:

Rules:

active(from(X)) -> mark(cons(X, from(s(X))))
active(sel(0, cons(X, XS))) -> mark(X)
active(sel(s(N), cons(X, XS))) -> mark(sel(N, XS))
active(minus(X, 0)) -> mark(0)
active(minus(s(X), s(Y))) -> mark(minus(X, Y))
active(quot(0, s(Y))) -> mark(0)
active(quot(s(X), s(Y))) -> mark(s(quot(minus(X, Y), s(Y))))
active(zWquot(XS, nil)) -> mark(nil)
active(zWquot(nil, XS)) -> mark(nil)
active(zWquot(cons(X, XS), cons(Y, YS))) -> mark(cons(quot(X, Y), zWquot(XS, YS)))
active(from(X)) -> from(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(s(X)) -> s(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(minus(X1, X2)) -> minus(active(X1), X2)
active(minus(X1, X2)) -> minus(X1, active(X2))
active(quot(X1, X2)) -> quot(active(X1), X2)
active(quot(X1, X2)) -> quot(X1, active(X2))
active(zWquot(X1, X2)) -> zWquot(active(X1), X2)
active(zWquot(X1, X2)) -> zWquot(X1, active(X2))
from(mark(X)) -> mark(from(X))
from(ok(X)) -> ok(from(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))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
minus(mark(X1), X2) -> mark(minus(X1, X2))
minus(X1, mark(X2)) -> mark(minus(X1, X2))
minus(ok(X1), ok(X2)) -> ok(minus(X1, X2))
quot(mark(X1), X2) -> mark(quot(X1, X2))
quot(X1, mark(X2)) -> mark(quot(X1, X2))
quot(ok(X1), ok(X2)) -> ok(quot(X1, X2))
zWquot(mark(X1), X2) -> mark(zWquot(X1, X2))
zWquot(X1, mark(X2)) -> mark(zWquot(X1, X2))
zWquot(ok(X1), ok(X2)) -> ok(zWquot(X1, X2))
proper(from(X)) -> from(proper(X))
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(s(X)) -> s(proper(X))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(0) -> ok(0)
proper(minus(X1, X2)) -> minus(proper(X1), proper(X2))
proper(quot(X1, X2)) -> quot(proper(X1), proper(X2))
proper(zWquot(X1, X2)) -> zWquot(proper(X1), proper(X2))
proper(nil) -> ok(nil)
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

         ↳Polo

       →DP Problem 6

         ↳Polo

       →DP Problem 7

         ↳Polo

       →DP Problem 8

         ↳Polo

       →DP Problem 9

         ↳Polo

       →DP Problem 10

         ↳Remaining

Dependency Pairs:

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

Rules:

active(from(X)) -> mark(cons(X, from(s(X))))
active(sel(0, cons(X, XS))) -> mark(X)
active(sel(s(N), cons(X, XS))) -> mark(sel(N, XS))
active(minus(X, 0)) -> mark(0)
active(minus(s(X), s(Y))) -> mark(minus(X, Y))
active(quot(0, s(Y))) -> mark(0)
active(quot(s(X), s(Y))) -> mark(s(quot(minus(X, Y), s(Y))))
active(zWquot(XS, nil)) -> mark(nil)
active(zWquot(nil, XS)) -> mark(nil)
active(zWquot(cons(X, XS), cons(Y, YS))) -> mark(cons(quot(X, Y), zWquot(XS, YS)))
active(from(X)) -> from(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(s(X)) -> s(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(minus(X1, X2)) -> minus(active(X1), X2)
active(minus(X1, X2)) -> minus(X1, active(X2))
active(quot(X1, X2)) -> quot(active(X1), X2)
active(quot(X1, X2)) -> quot(X1, active(X2))
active(zWquot(X1, X2)) -> zWquot(active(X1), X2)
active(zWquot(X1, X2)) -> zWquot(X1, active(X2))
from(mark(X)) -> mark(from(X))
from(ok(X)) -> ok(from(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))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
minus(mark(X1), X2) -> mark(minus(X1, X2))
minus(X1, mark(X2)) -> mark(minus(X1, X2))
minus(ok(X1), ok(X2)) -> ok(minus(X1, X2))
quot(mark(X1), X2) -> mark(quot(X1, X2))
quot(X1, mark(X2)) -> mark(quot(X1, X2))
quot(ok(X1), ok(X2)) -> ok(quot(X1, X2))
zWquot(mark(X1), X2) -> mark(zWquot(X1, X2))
zWquot(X1, mark(X2)) -> mark(zWquot(X1, X2))
zWquot(ok(X1), ok(X2)) -> ok(zWquot(X1, X2))
proper(from(X)) -> from(proper(X))
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(s(X)) -> s(proper(X))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(0) -> ok(0)
proper(minus(X1, X2)) -> minus(proper(X1), proper(X2))
proper(quot(X1, X2)) -> quot(proper(X1), proper(X2))
proper(zWquot(X1, X2)) -> zWquot(proper(X1), proper(X2))
proper(nil) -> ok(nil)
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))

Strategy:

innermost

The following dependency pair can be strictly oriented:

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

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

Used ordering: Polynomial ordering with Polynomial interpretation:

POL(S(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 3

         ↳Polo

           →DP Problem 16

             ↳Polynomial Ordering

       →DP Problem 4

         ↳Polo

       →DP Problem 5

         ↳Polo

       →DP Problem 6

         ↳Polo

       →DP Problem 7

         ↳Polo

       →DP Problem 8

         ↳Polo

       →DP Problem 9

         ↳Polo

       →DP Problem 10

         ↳Remaining

Dependency Pair:

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

Rules:

active(from(X)) -> mark(cons(X, from(s(X))))
active(sel(0, cons(X, XS))) -> mark(X)
active(sel(s(N), cons(X, XS))) -> mark(sel(N, XS))
active(minus(X, 0)) -> mark(0)
active(minus(s(X), s(Y))) -> mark(minus(X, Y))
active(quot(0, s(Y))) -> mark(0)
active(quot(s(X), s(Y))) -> mark(s(quot(minus(X, Y), s(Y))))
active(zWquot(XS, nil)) -> mark(nil)
active(zWquot(nil, XS)) -> mark(nil)
active(zWquot(cons(X, XS), cons(Y, YS))) -> mark(cons(quot(X, Y), zWquot(XS, YS)))
active(from(X)) -> from(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(s(X)) -> s(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(minus(X1, X2)) -> minus(active(X1), X2)
active(minus(X1, X2)) -> minus(X1, active(X2))
active(quot(X1, X2)) -> quot(active(X1), X2)
active(quot(X1, X2)) -> quot(X1, active(X2))
active(zWquot(X1, X2)) -> zWquot(active(X1), X2)
active(zWquot(X1, X2)) -> zWquot(X1, active(X2))
from(mark(X)) -> mark(from(X))
from(ok(X)) -> ok(from(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))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
minus(mark(X1), X2) -> mark(minus(X1, X2))
minus(X1, mark(X2)) -> mark(minus(X1, X2))
minus(ok(X1), ok(X2)) -> ok(minus(X1, X2))
quot(mark(X1), X2) -> mark(quot(X1, X2))
quot(X1, mark(X2)) -> mark(quot(X1, X2))
quot(ok(X1), ok(X2)) -> ok(quot(X1, X2))
zWquot(mark(X1), X2) -> mark(zWquot(X1, X2))
zWquot(X1, mark(X2)) -> mark(zWquot(X1, X2))
zWquot(ok(X1), ok(X2)) -> ok(zWquot(X1, X2))
proper(from(X)) -> from(proper(X))
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(s(X)) -> s(proper(X))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(0) -> ok(0)
proper(minus(X1, X2)) -> minus(proper(X1), proper(X2))
proper(quot(X1, X2)) -> quot(proper(X1), proper(X2))
proper(zWquot(X1, X2)) -> zWquot(proper(X1), proper(X2))
proper(nil) -> ok(nil)
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))

Strategy:

innermost

The following dependency pair can be strictly oriented:

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

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

Used ordering: Polynomial ordering with Polynomial interpretation:

POL(S(x₁)) = x₁

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

resulting in one new DP problem.

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Polo

       →DP Problem 3

         ↳Polo

           →DP Problem 16

             ↳Polo

...

               →DP Problem 17

                 ↳Dependency Graph

       →DP Problem 4

         ↳Polo

       →DP Problem 5

         ↳Polo

       →DP Problem 6

         ↳Polo

       →DP Problem 7

         ↳Polo

       →DP Problem 8

         ↳Polo

       →DP Problem 9

         ↳Polo

       →DP Problem 10

         ↳Remaining

Dependency Pair:

Rules:

active(from(X)) -> mark(cons(X, from(s(X))))
active(sel(0, cons(X, XS))) -> mark(X)
active(sel(s(N), cons(X, XS))) -> mark(sel(N, XS))
active(minus(X, 0)) -> mark(0)
active(minus(s(X), s(Y))) -> mark(minus(X, Y))
active(quot(0, s(Y))) -> mark(0)
active(quot(s(X), s(Y))) -> mark(s(quot(minus(X, Y), s(Y))))
active(zWquot(XS, nil)) -> mark(nil)
active(zWquot(nil, XS)) -> mark(nil)
active(zWquot(cons(X, XS), cons(Y, YS))) -> mark(cons(quot(X, Y), zWquot(XS, YS)))
active(from(X)) -> from(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(s(X)) -> s(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(minus(X1, X2)) -> minus(active(X1), X2)
active(minus(X1, X2)) -> minus(X1, active(X2))
active(quot(X1, X2)) -> quot(active(X1), X2)
active(quot(X1, X2)) -> quot(X1, active(X2))
active(zWquot(X1, X2)) -> zWquot(active(X1), X2)
active(zWquot(X1, X2)) -> zWquot(X1, active(X2))
from(mark(X)) -> mark(from(X))
from(ok(X)) -> ok(from(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))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
minus(mark(X1), X2) -> mark(minus(X1, X2))
minus(X1, mark(X2)) -> mark(minus(X1, X2))
minus(ok(X1), ok(X2)) -> ok(minus(X1, X2))
quot(mark(X1), X2) -> mark(quot(X1, X2))
quot(X1, mark(X2)) -> mark(quot(X1, X2))
quot(ok(X1), ok(X2)) -> ok(quot(X1, X2))
zWquot(mark(X1), X2) -> mark(zWquot(X1, X2))
zWquot(X1, mark(X2)) -> mark(zWquot(X1, X2))
zWquot(ok(X1), ok(X2)) -> ok(zWquot(X1, X2))
proper(from(X)) -> from(proper(X))
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(s(X)) -> s(proper(X))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(0) -> ok(0)
proper(minus(X1, X2)) -> minus(proper(X1), proper(X2))
proper(quot(X1, X2)) -> quot(proper(X1), proper(X2))
proper(zWquot(X1, X2)) -> zWquot(proper(X1), proper(X2))
proper(nil) -> ok(nil)
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

         ↳Polo

       →DP Problem 6

         ↳Polo

       →DP Problem 7

         ↳Polo

       →DP Problem 8

         ↳Polo

       →DP Problem 9

         ↳Polo

       →DP Problem 10

         ↳Remaining

Dependency Pairs:

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

Rules:

active(from(X)) -> mark(cons(X, from(s(X))))
active(sel(0, cons(X, XS))) -> mark(X)
active(sel(s(N), cons(X, XS))) -> mark(sel(N, XS))
active(minus(X, 0)) -> mark(0)
active(minus(s(X), s(Y))) -> mark(minus(X, Y))
active(quot(0, s(Y))) -> mark(0)
active(quot(s(X), s(Y))) -> mark(s(quot(minus(X, Y), s(Y))))
active(zWquot(XS, nil)) -> mark(nil)
active(zWquot(nil, XS)) -> mark(nil)
active(zWquot(cons(X, XS), cons(Y, YS))) -> mark(cons(quot(X, Y), zWquot(XS, YS)))
active(from(X)) -> from(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(s(X)) -> s(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(minus(X1, X2)) -> minus(active(X1), X2)
active(minus(X1, X2)) -> minus(X1, active(X2))
active(quot(X1, X2)) -> quot(active(X1), X2)
active(quot(X1, X2)) -> quot(X1, active(X2))
active(zWquot(X1, X2)) -> zWquot(active(X1), X2)
active(zWquot(X1, X2)) -> zWquot(X1, active(X2))
from(mark(X)) -> mark(from(X))
from(ok(X)) -> ok(from(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))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
minus(mark(X1), X2) -> mark(minus(X1, X2))
minus(X1, mark(X2)) -> mark(minus(X1, X2))
minus(ok(X1), ok(X2)) -> ok(minus(X1, X2))
quot(mark(X1), X2) -> mark(quot(X1, X2))
quot(X1, mark(X2)) -> mark(quot(X1, X2))
quot(ok(X1), ok(X2)) -> ok(quot(X1, X2))
zWquot(mark(X1), X2) -> mark(zWquot(X1, X2))
zWquot(X1, mark(X2)) -> mark(zWquot(X1, X2))
zWquot(ok(X1), ok(X2)) -> ok(zWquot(X1, X2))
proper(from(X)) -> from(proper(X))
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(s(X)) -> s(proper(X))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(0) -> ok(0)
proper(minus(X1, X2)) -> minus(proper(X1), proper(X2))
proper(quot(X1, X2)) -> quot(proper(X1), proper(X2))
proper(zWquot(X1, X2)) -> zWquot(proper(X1), proper(X2))
proper(nil) -> ok(nil)
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))

Strategy:

innermost

The following dependency pair can be strictly oriented:

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

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

Used ordering: Polynomial ordering with Polynomial interpretation:

POL(QUOT(x₁, 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 3

         ↳Polo

       →DP Problem 4

         ↳Polo

           →DP Problem 18

             ↳Polynomial Ordering

       →DP Problem 5

         ↳Polo

       →DP Problem 6

         ↳Polo

       →DP Problem 7

         ↳Polo

       →DP Problem 8

         ↳Polo

       →DP Problem 9

         ↳Polo

       →DP Problem 10

         ↳Remaining

Dependency Pairs:

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

Rules:

active(from(X)) -> mark(cons(X, from(s(X))))
active(sel(0, cons(X, XS))) -> mark(X)
active(sel(s(N), cons(X, XS))) -> mark(sel(N, XS))
active(minus(X, 0)) -> mark(0)
active(minus(s(X), s(Y))) -> mark(minus(X, Y))
active(quot(0, s(Y))) -> mark(0)
active(quot(s(X), s(Y))) -> mark(s(quot(minus(X, Y), s(Y))))
active(zWquot(XS, nil)) -> mark(nil)
active(zWquot(nil, XS)) -> mark(nil)
active(zWquot(cons(X, XS), cons(Y, YS))) -> mark(cons(quot(X, Y), zWquot(XS, YS)))
active(from(X)) -> from(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(s(X)) -> s(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(minus(X1, X2)) -> minus(active(X1), X2)
active(minus(X1, X2)) -> minus(X1, active(X2))
active(quot(X1, X2)) -> quot(active(X1), X2)
active(quot(X1, X2)) -> quot(X1, active(X2))
active(zWquot(X1, X2)) -> zWquot(active(X1), X2)
active(zWquot(X1, X2)) -> zWquot(X1, active(X2))
from(mark(X)) -> mark(from(X))
from(ok(X)) -> ok(from(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))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
minus(mark(X1), X2) -> mark(minus(X1, X2))
minus(X1, mark(X2)) -> mark(minus(X1, X2))
minus(ok(X1), ok(X2)) -> ok(minus(X1, X2))
quot(mark(X1), X2) -> mark(quot(X1, X2))
quot(X1, mark(X2)) -> mark(quot(X1, X2))
quot(ok(X1), ok(X2)) -> ok(quot(X1, X2))
zWquot(mark(X1), X2) -> mark(zWquot(X1, X2))
zWquot(X1, mark(X2)) -> mark(zWquot(X1, X2))
zWquot(ok(X1), ok(X2)) -> ok(zWquot(X1, X2))
proper(from(X)) -> from(proper(X))
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(s(X)) -> s(proper(X))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(0) -> ok(0)
proper(minus(X1, X2)) -> minus(proper(X1), proper(X2))
proper(quot(X1, X2)) -> quot(proper(X1), proper(X2))
proper(zWquot(X1, X2)) -> zWquot(proper(X1), proper(X2))
proper(nil) -> ok(nil)
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))

Strategy:

innermost

The following dependency pair can be strictly oriented:

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

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

Used ordering: Polynomial ordering with Polynomial interpretation:

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

POL(mark(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 18

             ↳Polo

...

               →DP Problem 19

                 ↳Polynomial Ordering

       →DP Problem 5

         ↳Polo

       →DP Problem 6

         ↳Polo

       →DP Problem 7

         ↳Polo

       →DP Problem 8

         ↳Polo

       →DP Problem 9

         ↳Polo

       →DP Problem 10

         ↳Remaining

Dependency Pair:

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

Rules:

active(from(X)) -> mark(cons(X, from(s(X))))
active(sel(0, cons(X, XS))) -> mark(X)
active(sel(s(N), cons(X, XS))) -> mark(sel(N, XS))
active(minus(X, 0)) -> mark(0)
active(minus(s(X), s(Y))) -> mark(minus(X, Y))
active(quot(0, s(Y))) -> mark(0)
active(quot(s(X), s(Y))) -> mark(s(quot(minus(X, Y), s(Y))))
active(zWquot(XS, nil)) -> mark(nil)
active(zWquot(nil, XS)) -> mark(nil)
active(zWquot(cons(X, XS), cons(Y, YS))) -> mark(cons(quot(X, Y), zWquot(XS, YS)))
active(from(X)) -> from(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(s(X)) -> s(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(minus(X1, X2)) -> minus(active(X1), X2)
active(minus(X1, X2)) -> minus(X1, active(X2))
active(quot(X1, X2)) -> quot(active(X1), X2)
active(quot(X1, X2)) -> quot(X1, active(X2))
active(zWquot(X1, X2)) -> zWquot(active(X1), X2)
active(zWquot(X1, X2)) -> zWquot(X1, active(X2))
from(mark(X)) -> mark(from(X))
from(ok(X)) -> ok(from(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))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
minus(mark(X1), X2) -> mark(minus(X1, X2))
minus(X1, mark(X2)) -> mark(minus(X1, X2))
minus(ok(X1), ok(X2)) -> ok(minus(X1, X2))
quot(mark(X1), X2) -> mark(quot(X1, X2))
quot(X1, mark(X2)) -> mark(quot(X1, X2))
quot(ok(X1), ok(X2)) -> ok(quot(X1, X2))
zWquot(mark(X1), X2) -> mark(zWquot(X1, X2))
zWquot(X1, mark(X2)) -> mark(zWquot(X1, X2))
zWquot(ok(X1), ok(X2)) -> ok(zWquot(X1, X2))
proper(from(X)) -> from(proper(X))
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(s(X)) -> s(proper(X))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(0) -> ok(0)
proper(minus(X1, X2)) -> minus(proper(X1), proper(X2))
proper(quot(X1, X2)) -> quot(proper(X1), proper(X2))
proper(zWquot(X1, X2)) -> zWquot(proper(X1), proper(X2))
proper(nil) -> ok(nil)
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))

Strategy:

innermost

The following dependency pair can be strictly oriented:

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

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

Used ordering: Polynomial ordering with Polynomial interpretation:

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

POL(mark(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 18

             ↳Polo

...

               →DP Problem 20

                 ↳Dependency Graph

       →DP Problem 5

         ↳Polo

       →DP Problem 6

         ↳Polo

       →DP Problem 7

         ↳Polo

       →DP Problem 8

         ↳Polo

       →DP Problem 9

         ↳Polo

       →DP Problem 10

         ↳Remaining

Dependency Pair:

Rules:

active(from(X)) -> mark(cons(X, from(s(X))))
active(sel(0, cons(X, XS))) -> mark(X)
active(sel(s(N), cons(X, XS))) -> mark(sel(N, XS))
active(minus(X, 0)) -> mark(0)
active(minus(s(X), s(Y))) -> mark(minus(X, Y))
active(quot(0, s(Y))) -> mark(0)
active(quot(s(X), s(Y))) -> mark(s(quot(minus(X, Y), s(Y))))
active(zWquot(XS, nil)) -> mark(nil)
active(zWquot(nil, XS)) -> mark(nil)
active(zWquot(cons(X, XS), cons(Y, YS))) -> mark(cons(quot(X, Y), zWquot(XS, YS)))
active(from(X)) -> from(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(s(X)) -> s(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(minus(X1, X2)) -> minus(active(X1), X2)
active(minus(X1, X2)) -> minus(X1, active(X2))
active(quot(X1, X2)) -> quot(active(X1), X2)
active(quot(X1, X2)) -> quot(X1, active(X2))
active(zWquot(X1, X2)) -> zWquot(active(X1), X2)
active(zWquot(X1, X2)) -> zWquot(X1, active(X2))
from(mark(X)) -> mark(from(X))
from(ok(X)) -> ok(from(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))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
minus(mark(X1), X2) -> mark(minus(X1, X2))
minus(X1, mark(X2)) -> mark(minus(X1, X2))
minus(ok(X1), ok(X2)) -> ok(minus(X1, X2))
quot(mark(X1), X2) -> mark(quot(X1, X2))
quot(X1, mark(X2)) -> mark(quot(X1, X2))
quot(ok(X1), ok(X2)) -> ok(quot(X1, X2))
zWquot(mark(X1), X2) -> mark(zWquot(X1, X2))
zWquot(X1, mark(X2)) -> mark(zWquot(X1, X2))
zWquot(ok(X1), ok(X2)) -> ok(zWquot(X1, X2))
proper(from(X)) -> from(proper(X))
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(s(X)) -> s(proper(X))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(0) -> ok(0)
proper(minus(X1, X2)) -> minus(proper(X1), proper(X2))
proper(quot(X1, X2)) -> quot(proper(X1), proper(X2))
proper(zWquot(X1, X2)) -> zWquot(proper(X1), proper(X2))
proper(nil) -> ok(nil)
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

         ↳Polynomial Ordering

       →DP Problem 6

         ↳Polo

       →DP Problem 7

         ↳Polo

       →DP Problem 8

         ↳Polo

       →DP Problem 9

         ↳Polo

       →DP Problem 10

         ↳Remaining

Dependency Pairs:

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

Rules:

active(from(X)) -> mark(cons(X, from(s(X))))
active(sel(0, cons(X, XS))) -> mark(X)
active(sel(s(N), cons(X, XS))) -> mark(sel(N, XS))
active(minus(X, 0)) -> mark(0)
active(minus(s(X), s(Y))) -> mark(minus(X, Y))
active(quot(0, s(Y))) -> mark(0)
active(quot(s(X), s(Y))) -> mark(s(quot(minus(X, Y), s(Y))))
active(zWquot(XS, nil)) -> mark(nil)
active(zWquot(nil, XS)) -> mark(nil)
active(zWquot(cons(X, XS), cons(Y, YS))) -> mark(cons(quot(X, Y), zWquot(XS, YS)))
active(from(X)) -> from(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(s(X)) -> s(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(minus(X1, X2)) -> minus(active(X1), X2)
active(minus(X1, X2)) -> minus(X1, active(X2))
active(quot(X1, X2)) -> quot(active(X1), X2)
active(quot(X1, X2)) -> quot(X1, active(X2))
active(zWquot(X1, X2)) -> zWquot(active(X1), X2)
active(zWquot(X1, X2)) -> zWquot(X1, active(X2))
from(mark(X)) -> mark(from(X))
from(ok(X)) -> ok(from(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))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
minus(mark(X1), X2) -> mark(minus(X1, X2))
minus(X1, mark(X2)) -> mark(minus(X1, X2))
minus(ok(X1), ok(X2)) -> ok(minus(X1, X2))
quot(mark(X1), X2) -> mark(quot(X1, X2))
quot(X1, mark(X2)) -> mark(quot(X1, X2))
quot(ok(X1), ok(X2)) -> ok(quot(X1, X2))
zWquot(mark(X1), X2) -> mark(zWquot(X1, X2))
zWquot(X1, mark(X2)) -> mark(zWquot(X1, X2))
zWquot(ok(X1), ok(X2)) -> ok(zWquot(X1, X2))
proper(from(X)) -> from(proper(X))
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(s(X)) -> s(proper(X))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(0) -> ok(0)
proper(minus(X1, X2)) -> minus(proper(X1), proper(X2))
proper(quot(X1, X2)) -> quot(proper(X1), proper(X2))
proper(zWquot(X1, X2)) -> zWquot(proper(X1), proper(X2))
proper(nil) -> ok(nil)
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 2

         ↳Polo

       →DP Problem 3

         ↳Polo

       →DP Problem 4

         ↳Polo

       →DP Problem 5

         ↳Polo

           →DP Problem 21

             ↳Polynomial Ordering

       →DP Problem 6

         ↳Polo

       →DP Problem 7

         ↳Polo

       →DP Problem 8

         ↳Polo

       →DP Problem 9

         ↳Polo

       →DP Problem 10

         ↳Remaining

Dependency Pair:

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

Rules:

active(from(X)) -> mark(cons(X, from(s(X))))
active(sel(0, cons(X, XS))) -> mark(X)
active(sel(s(N), cons(X, XS))) -> mark(sel(N, XS))
active(minus(X, 0)) -> mark(0)
active(minus(s(X), s(Y))) -> mark(minus(X, Y))
active(quot(0, s(Y))) -> mark(0)
active(quot(s(X), s(Y))) -> mark(s(quot(minus(X, Y), s(Y))))
active(zWquot(XS, nil)) -> mark(nil)
active(zWquot(nil, XS)) -> mark(nil)
active(zWquot(cons(X, XS), cons(Y, YS))) -> mark(cons(quot(X, Y), zWquot(XS, YS)))
active(from(X)) -> from(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(s(X)) -> s(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(minus(X1, X2)) -> minus(active(X1), X2)
active(minus(X1, X2)) -> minus(X1, active(X2))
active(quot(X1, X2)) -> quot(active(X1), X2)
active(quot(X1, X2)) -> quot(X1, active(X2))
active(zWquot(X1, X2)) -> zWquot(active(X1), X2)
active(zWquot(X1, X2)) -> zWquot(X1, active(X2))
from(mark(X)) -> mark(from(X))
from(ok(X)) -> ok(from(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))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
minus(mark(X1), X2) -> mark(minus(X1, X2))
minus(X1, mark(X2)) -> mark(minus(X1, X2))
minus(ok(X1), ok(X2)) -> ok(minus(X1, X2))
quot(mark(X1), X2) -> mark(quot(X1, X2))
quot(X1, mark(X2)) -> mark(quot(X1, X2))
quot(ok(X1), ok(X2)) -> ok(quot(X1, X2))
zWquot(mark(X1), X2) -> mark(zWquot(X1, X2))
zWquot(X1, mark(X2)) -> mark(zWquot(X1, X2))
zWquot(ok(X1), ok(X2)) -> ok(zWquot(X1, X2))
proper(from(X)) -> from(proper(X))
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(s(X)) -> s(proper(X))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(0) -> ok(0)
proper(minus(X1, X2)) -> minus(proper(X1), proper(X2))
proper(quot(X1, X2)) -> quot(proper(X1), proper(X2))
proper(zWquot(X1, X2)) -> zWquot(proper(X1), proper(X2))
proper(nil) -> ok(nil)
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 2

         ↳Polo

       →DP Problem 3

         ↳Polo

       →DP Problem 4

         ↳Polo

       →DP Problem 5

         ↳Polo

           →DP Problem 21

             ↳Polo

...

               →DP Problem 22

                 ↳Dependency Graph

       →DP Problem 6

         ↳Polo

       →DP Problem 7

         ↳Polo

       →DP Problem 8

         ↳Polo

       →DP Problem 9

         ↳Polo

       →DP Problem 10

         ↳Remaining

Dependency Pair:

Rules:

active(from(X)) -> mark(cons(X, from(s(X))))
active(sel(0, cons(X, XS))) -> mark(X)
active(sel(s(N), cons(X, XS))) -> mark(sel(N, XS))
active(minus(X, 0)) -> mark(0)
active(minus(s(X), s(Y))) -> mark(minus(X, Y))
active(quot(0, s(Y))) -> mark(0)
active(quot(s(X), s(Y))) -> mark(s(quot(minus(X, Y), s(Y))))
active(zWquot(XS, nil)) -> mark(nil)
active(zWquot(nil, XS)) -> mark(nil)
active(zWquot(cons(X, XS), cons(Y, YS))) -> mark(cons(quot(X, Y), zWquot(XS, YS)))
active(from(X)) -> from(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(s(X)) -> s(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(minus(X1, X2)) -> minus(active(X1), X2)
active(minus(X1, X2)) -> minus(X1, active(X2))
active(quot(X1, X2)) -> quot(active(X1), X2)
active(quot(X1, X2)) -> quot(X1, active(X2))
active(zWquot(X1, X2)) -> zWquot(active(X1), X2)
active(zWquot(X1, X2)) -> zWquot(X1, active(X2))
from(mark(X)) -> mark(from(X))
from(ok(X)) -> ok(from(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))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
minus(mark(X1), X2) -> mark(minus(X1, X2))
minus(X1, mark(X2)) -> mark(minus(X1, X2))
minus(ok(X1), ok(X2)) -> ok(minus(X1, X2))
quot(mark(X1), X2) -> mark(quot(X1, X2))
quot(X1, mark(X2)) -> mark(quot(X1, X2))
quot(ok(X1), ok(X2)) -> ok(quot(X1, X2))
zWquot(mark(X1), X2) -> mark(zWquot(X1, X2))
zWquot(X1, mark(X2)) -> mark(zWquot(X1, X2))
zWquot(ok(X1), ok(X2)) -> ok(zWquot(X1, X2))
proper(from(X)) -> from(proper(X))
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(s(X)) -> s(proper(X))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(0) -> ok(0)
proper(minus(X1, X2)) -> minus(proper(X1), proper(X2))
proper(quot(X1, X2)) -> quot(proper(X1), proper(X2))
proper(zWquot(X1, X2)) -> zWquot(proper(X1), proper(X2))
proper(nil) -> ok(nil)
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

         ↳Polo

       →DP Problem 6

         ↳Polynomial Ordering

       →DP Problem 7

         ↳Polo

       →DP Problem 8

         ↳Polo

       →DP Problem 9

         ↳Polo

       →DP Problem 10

         ↳Remaining

Dependency Pairs:

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

Rules:

active(from(X)) -> mark(cons(X, from(s(X))))
active(sel(0, cons(X, XS))) -> mark(X)
active(sel(s(N), cons(X, XS))) -> mark(sel(N, XS))
active(minus(X, 0)) -> mark(0)
active(minus(s(X), s(Y))) -> mark(minus(X, Y))
active(quot(0, s(Y))) -> mark(0)
active(quot(s(X), s(Y))) -> mark(s(quot(minus(X, Y), s(Y))))
active(zWquot(XS, nil)) -> mark(nil)
active(zWquot(nil, XS)) -> mark(nil)
active(zWquot(cons(X, XS), cons(Y, YS))) -> mark(cons(quot(X, Y), zWquot(XS, YS)))
active(from(X)) -> from(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(s(X)) -> s(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(minus(X1, X2)) -> minus(active(X1), X2)
active(minus(X1, X2)) -> minus(X1, active(X2))
active(quot(X1, X2)) -> quot(active(X1), X2)
active(quot(X1, X2)) -> quot(X1, active(X2))
active(zWquot(X1, X2)) -> zWquot(active(X1), X2)
active(zWquot(X1, X2)) -> zWquot(X1, active(X2))
from(mark(X)) -> mark(from(X))
from(ok(X)) -> ok(from(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))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
minus(mark(X1), X2) -> mark(minus(X1, X2))
minus(X1, mark(X2)) -> mark(minus(X1, X2))
minus(ok(X1), ok(X2)) -> ok(minus(X1, X2))
quot(mark(X1), X2) -> mark(quot(X1, X2))
quot(X1, mark(X2)) -> mark(quot(X1, X2))
quot(ok(X1), ok(X2)) -> ok(quot(X1, X2))
zWquot(mark(X1), X2) -> mark(zWquot(X1, X2))
zWquot(X1, mark(X2)) -> mark(zWquot(X1, X2))
zWquot(ok(X1), ok(X2)) -> ok(zWquot(X1, X2))
proper(from(X)) -> from(proper(X))
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(s(X)) -> s(proper(X))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(0) -> ok(0)
proper(minus(X1, X2)) -> minus(proper(X1), proper(X2))
proper(quot(X1, X2)) -> quot(proper(X1), proper(X2))
proper(zWquot(X1, X2)) -> zWquot(proper(X1), proper(X2))
proper(nil) -> ok(nil)
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))

Strategy:

innermost

The following dependency pair can be strictly oriented:

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

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

Used ordering: Polynomial ordering with Polynomial interpretation:

POL(ZWQUOT(x₁, 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 3

         ↳Polo

       →DP Problem 4

         ↳Polo

       →DP Problem 5

         ↳Polo

       →DP Problem 6

         ↳Polo

           →DP Problem 23

             ↳Polynomial Ordering

       →DP Problem 7

         ↳Polo

       →DP Problem 8

         ↳Polo

       →DP Problem 9

         ↳Polo

       →DP Problem 10

         ↳Remaining

Dependency Pairs:

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

Rules:

active(from(X)) -> mark(cons(X, from(s(X))))
active(sel(0, cons(X, XS))) -> mark(X)
active(sel(s(N), cons(X, XS))) -> mark(sel(N, XS))
active(minus(X, 0)) -> mark(0)
active(minus(s(X), s(Y))) -> mark(minus(X, Y))
active(quot(0, s(Y))) -> mark(0)
active(quot(s(X), s(Y))) -> mark(s(quot(minus(X, Y), s(Y))))
active(zWquot(XS, nil)) -> mark(nil)
active(zWquot(nil, XS)) -> mark(nil)
active(zWquot(cons(X, XS), cons(Y, YS))) -> mark(cons(quot(X, Y), zWquot(XS, YS)))
active(from(X)) -> from(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(s(X)) -> s(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(minus(X1, X2)) -> minus(active(X1), X2)
active(minus(X1, X2)) -> minus(X1, active(X2))
active(quot(X1, X2)) -> quot(active(X1), X2)
active(quot(X1, X2)) -> quot(X1, active(X2))
active(zWquot(X1, X2)) -> zWquot(active(X1), X2)
active(zWquot(X1, X2)) -> zWquot(X1, active(X2))
from(mark(X)) -> mark(from(X))
from(ok(X)) -> ok(from(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))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
minus(mark(X1), X2) -> mark(minus(X1, X2))
minus(X1, mark(X2)) -> mark(minus(X1, X2))
minus(ok(X1), ok(X2)) -> ok(minus(X1, X2))
quot(mark(X1), X2) -> mark(quot(X1, X2))
quot(X1, mark(X2)) -> mark(quot(X1, X2))
quot(ok(X1), ok(X2)) -> ok(quot(X1, X2))
zWquot(mark(X1), X2) -> mark(zWquot(X1, X2))
zWquot(X1, mark(X2)) -> mark(zWquot(X1, X2))
zWquot(ok(X1), ok(X2)) -> ok(zWquot(X1, X2))
proper(from(X)) -> from(proper(X))
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(s(X)) -> s(proper(X))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(0) -> ok(0)
proper(minus(X1, X2)) -> minus(proper(X1), proper(X2))
proper(quot(X1, X2)) -> quot(proper(X1), proper(X2))
proper(zWquot(X1, X2)) -> zWquot(proper(X1), proper(X2))
proper(nil) -> ok(nil)
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))

Strategy:

innermost

The following dependency pair can be strictly oriented:

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

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

Used ordering: Polynomial ordering with Polynomial interpretation:

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

POL(mark(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

         ↳Polo

       →DP Problem 6

         ↳Polo

           →DP Problem 23

             ↳Polo

...

               →DP Problem 24

                 ↳Polynomial Ordering

       →DP Problem 7

         ↳Polo

       →DP Problem 8

         ↳Polo

       →DP Problem 9

         ↳Polo

       →DP Problem 10

         ↳Remaining

Dependency Pair:

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

Rules:

active(from(X)) -> mark(cons(X, from(s(X))))
active(sel(0, cons(X, XS))) -> mark(X)
active(sel(s(N), cons(X, XS))) -> mark(sel(N, XS))
active(minus(X, 0)) -> mark(0)
active(minus(s(X), s(Y))) -> mark(minus(X, Y))
active(quot(0, s(Y))) -> mark(0)
active(quot(s(X), s(Y))) -> mark(s(quot(minus(X, Y), s(Y))))
active(zWquot(XS, nil)) -> mark(nil)
active(zWquot(nil, XS)) -> mark(nil)
active(zWquot(cons(X, XS), cons(Y, YS))) -> mark(cons(quot(X, Y), zWquot(XS, YS)))
active(from(X)) -> from(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(s(X)) -> s(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(minus(X1, X2)) -> minus(active(X1), X2)
active(minus(X1, X2)) -> minus(X1, active(X2))
active(quot(X1, X2)) -> quot(active(X1), X2)
active(quot(X1, X2)) -> quot(X1, active(X2))
active(zWquot(X1, X2)) -> zWquot(active(X1), X2)
active(zWquot(X1, X2)) -> zWquot(X1, active(X2))
from(mark(X)) -> mark(from(X))
from(ok(X)) -> ok(from(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))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
minus(mark(X1), X2) -> mark(minus(X1, X2))
minus(X1, mark(X2)) -> mark(minus(X1, X2))
minus(ok(X1), ok(X2)) -> ok(minus(X1, X2))
quot(mark(X1), X2) -> mark(quot(X1, X2))
quot(X1, mark(X2)) -> mark(quot(X1, X2))
quot(ok(X1), ok(X2)) -> ok(quot(X1, X2))
zWquot(mark(X1), X2) -> mark(zWquot(X1, X2))
zWquot(X1, mark(X2)) -> mark(zWquot(X1, X2))
zWquot(ok(X1), ok(X2)) -> ok(zWquot(X1, X2))
proper(from(X)) -> from(proper(X))
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(s(X)) -> s(proper(X))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(0) -> ok(0)
proper(minus(X1, X2)) -> minus(proper(X1), proper(X2))
proper(quot(X1, X2)) -> quot(proper(X1), proper(X2))
proper(zWquot(X1, X2)) -> zWquot(proper(X1), proper(X2))
proper(nil) -> ok(nil)
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))

Strategy:

innermost

The following dependency pair can be strictly oriented:

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

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

Used ordering: Polynomial ordering with Polynomial interpretation:

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

POL(mark(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

         ↳Polo

       →DP Problem 6

         ↳Polo

           →DP Problem 23

             ↳Polo

...

               →DP Problem 25

                 ↳Dependency Graph

       →DP Problem 7

         ↳Polo

       →DP Problem 8

         ↳Polo

       →DP Problem 9

         ↳Polo

       →DP Problem 10

         ↳Remaining

Dependency Pair:

Rules:

active(from(X)) -> mark(cons(X, from(s(X))))
active(sel(0, cons(X, XS))) -> mark(X)
active(sel(s(N), cons(X, XS))) -> mark(sel(N, XS))
active(minus(X, 0)) -> mark(0)
active(minus(s(X), s(Y))) -> mark(minus(X, Y))
active(quot(0, s(Y))) -> mark(0)
active(quot(s(X), s(Y))) -> mark(s(quot(minus(X, Y), s(Y))))
active(zWquot(XS, nil)) -> mark(nil)
active(zWquot(nil, XS)) -> mark(nil)
active(zWquot(cons(X, XS), cons(Y, YS))) -> mark(cons(quot(X, Y), zWquot(XS, YS)))
active(from(X)) -> from(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(s(X)) -> s(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(minus(X1, X2)) -> minus(active(X1), X2)
active(minus(X1, X2)) -> minus(X1, active(X2))
active(quot(X1, X2)) -> quot(active(X1), X2)
active(quot(X1, X2)) -> quot(X1, active(X2))
active(zWquot(X1, X2)) -> zWquot(active(X1), X2)
active(zWquot(X1, X2)) -> zWquot(X1, active(X2))
from(mark(X)) -> mark(from(X))
from(ok(X)) -> ok(from(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))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
minus(mark(X1), X2) -> mark(minus(X1, X2))
minus(X1, mark(X2)) -> mark(minus(X1, X2))
minus(ok(X1), ok(X2)) -> ok(minus(X1, X2))
quot(mark(X1), X2) -> mark(quot(X1, X2))
quot(X1, mark(X2)) -> mark(quot(X1, X2))
quot(ok(X1), ok(X2)) -> ok(quot(X1, X2))
zWquot(mark(X1), X2) -> mark(zWquot(X1, X2))
zWquot(X1, mark(X2)) -> mark(zWquot(X1, X2))
zWquot(ok(X1), ok(X2)) -> ok(zWquot(X1, X2))
proper(from(X)) -> from(proper(X))
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(s(X)) -> s(proper(X))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(0) -> ok(0)
proper(minus(X1, X2)) -> minus(proper(X1), proper(X2))
proper(quot(X1, X2)) -> quot(proper(X1), proper(X2))
proper(zWquot(X1, X2)) -> zWquot(proper(X1), proper(X2))
proper(nil) -> ok(nil)
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

         ↳Polo

       →DP Problem 6

         ↳Polo

       →DP Problem 7

         ↳Polynomial Ordering

       →DP Problem 8

         ↳Polo

       →DP Problem 9

         ↳Polo

       →DP Problem 10

         ↳Remaining

Dependency Pairs:

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

Rules:

active(from(X)) -> mark(cons(X, from(s(X))))
active(sel(0, cons(X, XS))) -> mark(X)
active(sel(s(N), cons(X, XS))) -> mark(sel(N, XS))
active(minus(X, 0)) -> mark(0)
active(minus(s(X), s(Y))) -> mark(minus(X, Y))
active(quot(0, s(Y))) -> mark(0)
active(quot(s(X), s(Y))) -> mark(s(quot(minus(X, Y), s(Y))))
active(zWquot(XS, nil)) -> mark(nil)
active(zWquot(nil, XS)) -> mark(nil)
active(zWquot(cons(X, XS), cons(Y, YS))) -> mark(cons(quot(X, Y), zWquot(XS, YS)))
active(from(X)) -> from(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(s(X)) -> s(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(minus(X1, X2)) -> minus(active(X1), X2)
active(minus(X1, X2)) -> minus(X1, active(X2))
active(quot(X1, X2)) -> quot(active(X1), X2)
active(quot(X1, X2)) -> quot(X1, active(X2))
active(zWquot(X1, X2)) -> zWquot(active(X1), X2)
active(zWquot(X1, X2)) -> zWquot(X1, active(X2))
from(mark(X)) -> mark(from(X))
from(ok(X)) -> ok(from(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))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
minus(mark(X1), X2) -> mark(minus(X1, X2))
minus(X1, mark(X2)) -> mark(minus(X1, X2))
minus(ok(X1), ok(X2)) -> ok(minus(X1, X2))
quot(mark(X1), X2) -> mark(quot(X1, X2))
quot(X1, mark(X2)) -> mark(quot(X1, X2))
quot(ok(X1), ok(X2)) -> ok(quot(X1, X2))
zWquot(mark(X1), X2) -> mark(zWquot(X1, X2))
zWquot(X1, mark(X2)) -> mark(zWquot(X1, X2))
zWquot(ok(X1), ok(X2)) -> ok(zWquot(X1, X2))
proper(from(X)) -> from(proper(X))
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(s(X)) -> s(proper(X))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(0) -> ok(0)
proper(minus(X1, X2)) -> minus(proper(X1), proper(X2))
proper(quot(X1, X2)) -> quot(proper(X1), proper(X2))
proper(zWquot(X1, X2)) -> zWquot(proper(X1), proper(X2))
proper(nil) -> ok(nil)
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))

Strategy:

innermost

The following dependency pair can be strictly oriented:

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

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

Used ordering: Polynomial ordering with Polynomial interpretation:

POL(MINUS(x₁, 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 3

         ↳Polo

       →DP Problem 4

         ↳Polo

       →DP Problem 5

         ↳Polo

       →DP Problem 6

         ↳Polo

       →DP Problem 7

         ↳Polo

           →DP Problem 26

             ↳Polynomial Ordering

       →DP Problem 8

         ↳Polo

       →DP Problem 9

         ↳Polo

       →DP Problem 10

         ↳Remaining

Dependency Pairs:

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

Rules:

active(from(X)) -> mark(cons(X, from(s(X))))
active(sel(0, cons(X, XS))) -> mark(X)
active(sel(s(N), cons(X, XS))) -> mark(sel(N, XS))
active(minus(X, 0)) -> mark(0)
active(minus(s(X), s(Y))) -> mark(minus(X, Y))
active(quot(0, s(Y))) -> mark(0)
active(quot(s(X), s(Y))) -> mark(s(quot(minus(X, Y), s(Y))))
active(zWquot(XS, nil)) -> mark(nil)
active(zWquot(nil, XS)) -> mark(nil)
active(zWquot(cons(X, XS), cons(Y, YS))) -> mark(cons(quot(X, Y), zWquot(XS, YS)))
active(from(X)) -> from(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(s(X)) -> s(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(minus(X1, X2)) -> minus(active(X1), X2)
active(minus(X1, X2)) -> minus(X1, active(X2))
active(quot(X1, X2)) -> quot(active(X1), X2)
active(quot(X1, X2)) -> quot(X1, active(X2))
active(zWquot(X1, X2)) -> zWquot(active(X1), X2)
active(zWquot(X1, X2)) -> zWquot(X1, active(X2))
from(mark(X)) -> mark(from(X))
from(ok(X)) -> ok(from(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))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
minus(mark(X1), X2) -> mark(minus(X1, X2))
minus(X1, mark(X2)) -> mark(minus(X1, X2))
minus(ok(X1), ok(X2)) -> ok(minus(X1, X2))
quot(mark(X1), X2) -> mark(quot(X1, X2))
quot(X1, mark(X2)) -> mark(quot(X1, X2))
quot(ok(X1), ok(X2)) -> ok(quot(X1, X2))
zWquot(mark(X1), X2) -> mark(zWquot(X1, X2))
zWquot(X1, mark(X2)) -> mark(zWquot(X1, X2))
zWquot(ok(X1), ok(X2)) -> ok(zWquot(X1, X2))
proper(from(X)) -> from(proper(X))
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(s(X)) -> s(proper(X))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(0) -> ok(0)
proper(minus(X1, X2)) -> minus(proper(X1), proper(X2))
proper(quot(X1, X2)) -> quot(proper(X1), proper(X2))
proper(zWquot(X1, X2)) -> zWquot(proper(X1), proper(X2))
proper(nil) -> ok(nil)
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))

Strategy:

innermost

The following dependency pair can be strictly oriented:

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

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

Used ordering: Polynomial ordering with Polynomial interpretation:

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

POL(mark(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

         ↳Polo

       →DP Problem 6

         ↳Polo

       →DP Problem 7

         ↳Polo

           →DP Problem 26

             ↳Polo

...

               →DP Problem 27

                 ↳Polynomial Ordering

       →DP Problem 8

         ↳Polo

       →DP Problem 9

         ↳Polo

       →DP Problem 10

         ↳Remaining

Dependency Pair:

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

Rules:

active(from(X)) -> mark(cons(X, from(s(X))))
active(sel(0, cons(X, XS))) -> mark(X)
active(sel(s(N), cons(X, XS))) -> mark(sel(N, XS))
active(minus(X, 0)) -> mark(0)
active(minus(s(X), s(Y))) -> mark(minus(X, Y))
active(quot(0, s(Y))) -> mark(0)
active(quot(s(X), s(Y))) -> mark(s(quot(minus(X, Y), s(Y))))
active(zWquot(XS, nil)) -> mark(nil)
active(zWquot(nil, XS)) -> mark(nil)
active(zWquot(cons(X, XS), cons(Y, YS))) -> mark(cons(quot(X, Y), zWquot(XS, YS)))
active(from(X)) -> from(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(s(X)) -> s(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(minus(X1, X2)) -> minus(active(X1), X2)
active(minus(X1, X2)) -> minus(X1, active(X2))
active(quot(X1, X2)) -> quot(active(X1), X2)
active(quot(X1, X2)) -> quot(X1, active(X2))
active(zWquot(X1, X2)) -> zWquot(active(X1), X2)
active(zWquot(X1, X2)) -> zWquot(X1, active(X2))
from(mark(X)) -> mark(from(X))
from(ok(X)) -> ok(from(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))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
minus(mark(X1), X2) -> mark(minus(X1, X2))
minus(X1, mark(X2)) -> mark(minus(X1, X2))
minus(ok(X1), ok(X2)) -> ok(minus(X1, X2))
quot(mark(X1), X2) -> mark(quot(X1, X2))
quot(X1, mark(X2)) -> mark(quot(X1, X2))
quot(ok(X1), ok(X2)) -> ok(quot(X1, X2))
zWquot(mark(X1), X2) -> mark(zWquot(X1, X2))
zWquot(X1, mark(X2)) -> mark(zWquot(X1, X2))
zWquot(ok(X1), ok(X2)) -> ok(zWquot(X1, X2))
proper(from(X)) -> from(proper(X))
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(s(X)) -> s(proper(X))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(0) -> ok(0)
proper(minus(X1, X2)) -> minus(proper(X1), proper(X2))
proper(quot(X1, X2)) -> quot(proper(X1), proper(X2))
proper(zWquot(X1, X2)) -> zWquot(proper(X1), proper(X2))
proper(nil) -> ok(nil)
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))

Strategy:

innermost

The following dependency pair can be strictly oriented:

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

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

Used ordering: Polynomial ordering with Polynomial interpretation:

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

POL(mark(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

         ↳Polo

       →DP Problem 6

         ↳Polo

       →DP Problem 7

         ↳Polo

           →DP Problem 26

             ↳Polo

...

               →DP Problem 28

                 ↳Dependency Graph

       →DP Problem 8

         ↳Polo

       →DP Problem 9

         ↳Polo

       →DP Problem 10

         ↳Remaining

Dependency Pair:

Rules:

active(from(X)) -> mark(cons(X, from(s(X))))
active(sel(0, cons(X, XS))) -> mark(X)
active(sel(s(N), cons(X, XS))) -> mark(sel(N, XS))
active(minus(X, 0)) -> mark(0)
active(minus(s(X), s(Y))) -> mark(minus(X, Y))
active(quot(0, s(Y))) -> mark(0)
active(quot(s(X), s(Y))) -> mark(s(quot(minus(X, Y), s(Y))))
active(zWquot(XS, nil)) -> mark(nil)
active(zWquot(nil, XS)) -> mark(nil)
active(zWquot(cons(X, XS), cons(Y, YS))) -> mark(cons(quot(X, Y), zWquot(XS, YS)))
active(from(X)) -> from(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(s(X)) -> s(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(minus(X1, X2)) -> minus(active(X1), X2)
active(minus(X1, X2)) -> minus(X1, active(X2))
active(quot(X1, X2)) -> quot(active(X1), X2)
active(quot(X1, X2)) -> quot(X1, active(X2))
active(zWquot(X1, X2)) -> zWquot(active(X1), X2)
active(zWquot(X1, X2)) -> zWquot(X1, active(X2))
from(mark(X)) -> mark(from(X))
from(ok(X)) -> ok(from(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))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
minus(mark(X1), X2) -> mark(minus(X1, X2))
minus(X1, mark(X2)) -> mark(minus(X1, X2))
minus(ok(X1), ok(X2)) -> ok(minus(X1, X2))
quot(mark(X1), X2) -> mark(quot(X1, X2))
quot(X1, mark(X2)) -> mark(quot(X1, X2))
quot(ok(X1), ok(X2)) -> ok(quot(X1, X2))
zWquot(mark(X1), X2) -> mark(zWquot(X1, X2))
zWquot(X1, mark(X2)) -> mark(zWquot(X1, X2))
zWquot(ok(X1), ok(X2)) -> ok(zWquot(X1, X2))
proper(from(X)) -> from(proper(X))
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(s(X)) -> s(proper(X))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(0) -> ok(0)
proper(minus(X1, X2)) -> minus(proper(X1), proper(X2))
proper(quot(X1, X2)) -> quot(proper(X1), proper(X2))
proper(zWquot(X1, X2)) -> zWquot(proper(X1), proper(X2))
proper(nil) -> ok(nil)
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

         ↳Polo

       →DP Problem 6

         ↳Polo

       →DP Problem 7

         ↳Polo

       →DP Problem 8

         ↳Polynomial Ordering

       →DP Problem 9

         ↳Polo

       →DP Problem 10

         ↳Remaining

Dependency Pairs:

ACTIVE(zWquot(X1, X2)) -> ACTIVE(X2)
ACTIVE(zWquot(X1, X2)) -> ACTIVE(X1)
ACTIVE(quot(X1, X2)) -> ACTIVE(X2)
ACTIVE(quot(X1, X2)) -> ACTIVE(X1)
ACTIVE(minus(X1, X2)) -> ACTIVE(X2)
ACTIVE(minus(X1, X2)) -> ACTIVE(X1)
ACTIVE(sel(X1, X2)) -> ACTIVE(X2)
ACTIVE(sel(X1, X2)) -> ACTIVE(X1)
ACTIVE(s(X)) -> ACTIVE(X)
ACTIVE(cons(X1, X2)) -> ACTIVE(X1)
ACTIVE(from(X)) -> ACTIVE(X)

Rules:

active(from(X)) -> mark(cons(X, from(s(X))))
active(sel(0, cons(X, XS))) -> mark(X)
active(sel(s(N), cons(X, XS))) -> mark(sel(N, XS))
active(minus(X, 0)) -> mark(0)
active(minus(s(X), s(Y))) -> mark(minus(X, Y))
active(quot(0, s(Y))) -> mark(0)
active(quot(s(X), s(Y))) -> mark(s(quot(minus(X, Y), s(Y))))
active(zWquot(XS, nil)) -> mark(nil)
active(zWquot(nil, XS)) -> mark(nil)
active(zWquot(cons(X, XS), cons(Y, YS))) -> mark(cons(quot(X, Y), zWquot(XS, YS)))
active(from(X)) -> from(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(s(X)) -> s(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(minus(X1, X2)) -> minus(active(X1), X2)
active(minus(X1, X2)) -> minus(X1, active(X2))
active(quot(X1, X2)) -> quot(active(X1), X2)
active(quot(X1, X2)) -> quot(X1, active(X2))
active(zWquot(X1, X2)) -> zWquot(active(X1), X2)
active(zWquot(X1, X2)) -> zWquot(X1, active(X2))
from(mark(X)) -> mark(from(X))
from(ok(X)) -> ok(from(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))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
minus(mark(X1), X2) -> mark(minus(X1, X2))
minus(X1, mark(X2)) -> mark(minus(X1, X2))
minus(ok(X1), ok(X2)) -> ok(minus(X1, X2))
quot(mark(X1), X2) -> mark(quot(X1, X2))
quot(X1, mark(X2)) -> mark(quot(X1, X2))
quot(ok(X1), ok(X2)) -> ok(quot(X1, X2))
zWquot(mark(X1), X2) -> mark(zWquot(X1, X2))
zWquot(X1, mark(X2)) -> mark(zWquot(X1, X2))
zWquot(ok(X1), ok(X2)) -> ok(zWquot(X1, X2))
proper(from(X)) -> from(proper(X))
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(s(X)) -> s(proper(X))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(0) -> ok(0)
proper(minus(X1, X2)) -> minus(proper(X1), proper(X2))
proper(quot(X1, X2)) -> quot(proper(X1), proper(X2))
proper(zWquot(X1, X2)) -> zWquot(proper(X1), proper(X2))
proper(nil) -> ok(nil)
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))

Strategy:

innermost

The following dependency pairs can be strictly oriented:

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

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

Used ordering: Polynomial ordering with Polynomial interpretation:

POL(from(x₁)) = x₁

POL(ACTIVE(x₁)) = x₁

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

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

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

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

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

POL(s(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 5

         ↳Polo

       →DP Problem 6

         ↳Polo

       →DP Problem 7

         ↳Polo

       →DP Problem 8

         ↳Polo

           →DP Problem 29

             ↳Polynomial Ordering

       →DP Problem 9

         ↳Polo

       →DP Problem 10

         ↳Remaining

Dependency Pairs:

ACTIVE(quot(X1, X2)) -> ACTIVE(X2)
ACTIVE(quot(X1, X2)) -> ACTIVE(X1)
ACTIVE(minus(X1, X2)) -> ACTIVE(X2)
ACTIVE(minus(X1, X2)) -> ACTIVE(X1)
ACTIVE(sel(X1, X2)) -> ACTIVE(X2)
ACTIVE(sel(X1, X2)) -> ACTIVE(X1)
ACTIVE(s(X)) -> ACTIVE(X)
ACTIVE(cons(X1, X2)) -> ACTIVE(X1)
ACTIVE(from(X)) -> ACTIVE(X)

Rules:

active(from(X)) -> mark(cons(X, from(s(X))))
active(sel(0, cons(X, XS))) -> mark(X)
active(sel(s(N), cons(X, XS))) -> mark(sel(N, XS))
active(minus(X, 0)) -> mark(0)
active(minus(s(X), s(Y))) -> mark(minus(X, Y))
active(quot(0, s(Y))) -> mark(0)
active(quot(s(X), s(Y))) -> mark(s(quot(minus(X, Y), s(Y))))
active(zWquot(XS, nil)) -> mark(nil)
active(zWquot(nil, XS)) -> mark(nil)
active(zWquot(cons(X, XS), cons(Y, YS))) -> mark(cons(quot(X, Y), zWquot(XS, YS)))
active(from(X)) -> from(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(s(X)) -> s(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(minus(X1, X2)) -> minus(active(X1), X2)
active(minus(X1, X2)) -> minus(X1, active(X2))
active(quot(X1, X2)) -> quot(active(X1), X2)
active(quot(X1, X2)) -> quot(X1, active(X2))
active(zWquot(X1, X2)) -> zWquot(active(X1), X2)
active(zWquot(X1, X2)) -> zWquot(X1, active(X2))
from(mark(X)) -> mark(from(X))
from(ok(X)) -> ok(from(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))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
minus(mark(X1), X2) -> mark(minus(X1, X2))
minus(X1, mark(X2)) -> mark(minus(X1, X2))
minus(ok(X1), ok(X2)) -> ok(minus(X1, X2))
quot(mark(X1), X2) -> mark(quot(X1, X2))
quot(X1, mark(X2)) -> mark(quot(X1, X2))
quot(ok(X1), ok(X2)) -> ok(quot(X1, X2))
zWquot(mark(X1), X2) -> mark(zWquot(X1, X2))
zWquot(X1, mark(X2)) -> mark(zWquot(X1, X2))
zWquot(ok(X1), ok(X2)) -> ok(zWquot(X1, X2))
proper(from(X)) -> from(proper(X))
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(s(X)) -> s(proper(X))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(0) -> ok(0)
proper(minus(X1, X2)) -> minus(proper(X1), proper(X2))
proper(quot(X1, X2)) -> quot(proper(X1), proper(X2))
proper(zWquot(X1, X2)) -> zWquot(proper(X1), proper(X2))
proper(nil) -> ok(nil)
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))

Strategy:

innermost

The following dependency pairs can be strictly oriented:

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

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

Used ordering: Polynomial ordering with Polynomial interpretation:

POL(from(x₁)) = x₁

POL(ACTIVE(x₁)) = x₁

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

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

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

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

POL(s(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 5

         ↳Polo

       →DP Problem 6

         ↳Polo

       →DP Problem 7

         ↳Polo

       →DP Problem 8

         ↳Polo

           →DP Problem 29

             ↳Polo

...

               →DP Problem 30

                 ↳Polynomial Ordering

       →DP Problem 9

         ↳Polo

       →DP Problem 10

         ↳Remaining

Dependency Pairs:

ACTIVE(minus(X1, X2)) -> ACTIVE(X2)
ACTIVE(minus(X1, X2)) -> ACTIVE(X1)
ACTIVE(sel(X1, X2)) -> ACTIVE(X2)
ACTIVE(sel(X1, X2)) -> ACTIVE(X1)
ACTIVE(s(X)) -> ACTIVE(X)
ACTIVE(cons(X1, X2)) -> ACTIVE(X1)
ACTIVE(from(X)) -> ACTIVE(X)

Rules:

active(from(X)) -> mark(cons(X, from(s(X))))
active(sel(0, cons(X, XS))) -> mark(X)
active(sel(s(N), cons(X, XS))) -> mark(sel(N, XS))
active(minus(X, 0)) -> mark(0)
active(minus(s(X), s(Y))) -> mark(minus(X, Y))
active(quot(0, s(Y))) -> mark(0)
active(quot(s(X), s(Y))) -> mark(s(quot(minus(X, Y), s(Y))))
active(zWquot(XS, nil)) -> mark(nil)
active(zWquot(nil, XS)) -> mark(nil)
active(zWquot(cons(X, XS), cons(Y, YS))) -> mark(cons(quot(X, Y), zWquot(XS, YS)))
active(from(X)) -> from(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(s(X)) -> s(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(minus(X1, X2)) -> minus(active(X1), X2)
active(minus(X1, X2)) -> minus(X1, active(X2))
active(quot(X1, X2)) -> quot(active(X1), X2)
active(quot(X1, X2)) -> quot(X1, active(X2))
active(zWquot(X1, X2)) -> zWquot(active(X1), X2)
active(zWquot(X1, X2)) -> zWquot(X1, active(X2))
from(mark(X)) -> mark(from(X))
from(ok(X)) -> ok(from(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))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
minus(mark(X1), X2) -> mark(minus(X1, X2))
minus(X1, mark(X2)) -> mark(minus(X1, X2))
minus(ok(X1), ok(X2)) -> ok(minus(X1, X2))
quot(mark(X1), X2) -> mark(quot(X1, X2))
quot(X1, mark(X2)) -> mark(quot(X1, X2))
quot(ok(X1), ok(X2)) -> ok(quot(X1, X2))
zWquot(mark(X1), X2) -> mark(zWquot(X1, X2))
zWquot(X1, mark(X2)) -> mark(zWquot(X1, X2))
zWquot(ok(X1), ok(X2)) -> ok(zWquot(X1, X2))
proper(from(X)) -> from(proper(X))
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(s(X)) -> s(proper(X))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(0) -> ok(0)
proper(minus(X1, X2)) -> minus(proper(X1), proper(X2))
proper(quot(X1, X2)) -> quot(proper(X1), proper(X2))
proper(zWquot(X1, X2)) -> zWquot(proper(X1), proper(X2))
proper(nil) -> ok(nil)
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))

Strategy:

innermost

The following dependency pairs can be strictly oriented:

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

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

Used ordering: Polynomial ordering with Polynomial interpretation:

POL(from(x₁)) = x₁

POL(ACTIVE(x₁)) = x₁

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

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

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

POL(s(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 5

         ↳Polo

       →DP Problem 6

         ↳Polo

       →DP Problem 7

         ↳Polo

       →DP Problem 8

         ↳Polo

           →DP Problem 29

             ↳Polo

...

               →DP Problem 31

                 ↳Polynomial Ordering

       →DP Problem 9

         ↳Polo

       →DP Problem 10

         ↳Remaining

Dependency Pairs:

ACTIVE(sel(X1, X2)) -> ACTIVE(X2)
ACTIVE(sel(X1, X2)) -> ACTIVE(X1)
ACTIVE(s(X)) -> ACTIVE(X)
ACTIVE(cons(X1, X2)) -> ACTIVE(X1)
ACTIVE(from(X)) -> ACTIVE(X)

Rules:

active(from(X)) -> mark(cons(X, from(s(X))))
active(sel(0, cons(X, XS))) -> mark(X)
active(sel(s(N), cons(X, XS))) -> mark(sel(N, XS))
active(minus(X, 0)) -> mark(0)
active(minus(s(X), s(Y))) -> mark(minus(X, Y))
active(quot(0, s(Y))) -> mark(0)
active(quot(s(X), s(Y))) -> mark(s(quot(minus(X, Y), s(Y))))
active(zWquot(XS, nil)) -> mark(nil)
active(zWquot(nil, XS)) -> mark(nil)
active(zWquot(cons(X, XS), cons(Y, YS))) -> mark(cons(quot(X, Y), zWquot(XS, YS)))
active(from(X)) -> from(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(s(X)) -> s(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(minus(X1, X2)) -> minus(active(X1), X2)
active(minus(X1, X2)) -> minus(X1, active(X2))
active(quot(X1, X2)) -> quot(active(X1), X2)
active(quot(X1, X2)) -> quot(X1, active(X2))
active(zWquot(X1, X2)) -> zWquot(active(X1), X2)
active(zWquot(X1, X2)) -> zWquot(X1, active(X2))
from(mark(X)) -> mark(from(X))
from(ok(X)) -> ok(from(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))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
minus(mark(X1), X2) -> mark(minus(X1, X2))
minus(X1, mark(X2)) -> mark(minus(X1, X2))
minus(ok(X1), ok(X2)) -> ok(minus(X1, X2))
quot(mark(X1), X2) -> mark(quot(X1, X2))
quot(X1, mark(X2)) -> mark(quot(X1, X2))
quot(ok(X1), ok(X2)) -> ok(quot(X1, X2))
zWquot(mark(X1), X2) -> mark(zWquot(X1, X2))
zWquot(X1, mark(X2)) -> mark(zWquot(X1, X2))
zWquot(ok(X1), ok(X2)) -> ok(zWquot(X1, X2))
proper(from(X)) -> from(proper(X))
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(s(X)) -> s(proper(X))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(0) -> ok(0)
proper(minus(X1, X2)) -> minus(proper(X1), proper(X2))
proper(quot(X1, X2)) -> quot(proper(X1), proper(X2))
proper(zWquot(X1, X2)) -> zWquot(proper(X1), proper(X2))
proper(nil) -> ok(nil)
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))

Strategy:

innermost

The following dependency pairs can be strictly oriented:

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

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

Used ordering: Polynomial ordering with Polynomial interpretation:

POL(from(x₁)) = x₁

POL(ACTIVE(x₁)) = x₁

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

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

POL(s(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 5

         ↳Polo

       →DP Problem 6

         ↳Polo

       →DP Problem 7

         ↳Polo

       →DP Problem 8

         ↳Polo

           →DP Problem 29

             ↳Polo

...

               →DP Problem 32

                 ↳Polynomial Ordering

       →DP Problem 9

         ↳Polo

       →DP Problem 10

         ↳Remaining

Dependency Pairs:

ACTIVE(s(X)) -> ACTIVE(X)
ACTIVE(cons(X1, X2)) -> ACTIVE(X1)
ACTIVE(from(X)) -> ACTIVE(X)

Rules:

active(from(X)) -> mark(cons(X, from(s(X))))
active(sel(0, cons(X, XS))) -> mark(X)
active(sel(s(N), cons(X, XS))) -> mark(sel(N, XS))
active(minus(X, 0)) -> mark(0)
active(minus(s(X), s(Y))) -> mark(minus(X, Y))
active(quot(0, s(Y))) -> mark(0)
active(quot(s(X), s(Y))) -> mark(s(quot(minus(X, Y), s(Y))))
active(zWquot(XS, nil)) -> mark(nil)
active(zWquot(nil, XS)) -> mark(nil)
active(zWquot(cons(X, XS), cons(Y, YS))) -> mark(cons(quot(X, Y), zWquot(XS, YS)))
active(from(X)) -> from(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(s(X)) -> s(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(minus(X1, X2)) -> minus(active(X1), X2)
active(minus(X1, X2)) -> minus(X1, active(X2))
active(quot(X1, X2)) -> quot(active(X1), X2)
active(quot(X1, X2)) -> quot(X1, active(X2))
active(zWquot(X1, X2)) -> zWquot(active(X1), X2)
active(zWquot(X1, X2)) -> zWquot(X1, active(X2))
from(mark(X)) -> mark(from(X))
from(ok(X)) -> ok(from(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))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
minus(mark(X1), X2) -> mark(minus(X1, X2))
minus(X1, mark(X2)) -> mark(minus(X1, X2))
minus(ok(X1), ok(X2)) -> ok(minus(X1, X2))
quot(mark(X1), X2) -> mark(quot(X1, X2))
quot(X1, mark(X2)) -> mark(quot(X1, X2))
quot(ok(X1), ok(X2)) -> ok(quot(X1, X2))
zWquot(mark(X1), X2) -> mark(zWquot(X1, X2))
zWquot(X1, mark(X2)) -> mark(zWquot(X1, X2))
zWquot(ok(X1), ok(X2)) -> ok(zWquot(X1, X2))
proper(from(X)) -> from(proper(X))
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(s(X)) -> s(proper(X))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(0) -> ok(0)
proper(minus(X1, X2)) -> minus(proper(X1), proper(X2))
proper(quot(X1, X2)) -> quot(proper(X1), proper(X2))
proper(zWquot(X1, X2)) -> zWquot(proper(X1), proper(X2))
proper(nil) -> ok(nil)
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))

Strategy:

innermost

The following dependency pair can be strictly oriented:

ACTIVE(s(X)) -> ACTIVE(X)

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

Used ordering: Polynomial ordering with Polynomial interpretation:

POL(from(x₁)) = x₁

POL(ACTIVE(x₁)) = x₁

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

POL(s(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

         ↳Polo

       →DP Problem 6

         ↳Polo

       →DP Problem 7

         ↳Polo

       →DP Problem 8

         ↳Polo

           →DP Problem 29

             ↳Polo

...

               →DP Problem 33

                 ↳Polynomial Ordering

       →DP Problem 9

         ↳Polo

       →DP Problem 10

         ↳Remaining

Dependency Pairs:

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

Rules:

active(from(X)) -> mark(cons(X, from(s(X))))
active(sel(0, cons(X, XS))) -> mark(X)
active(sel(s(N), cons(X, XS))) -> mark(sel(N, XS))
active(minus(X, 0)) -> mark(0)
active(minus(s(X), s(Y))) -> mark(minus(X, Y))
active(quot(0, s(Y))) -> mark(0)
active(quot(s(X), s(Y))) -> mark(s(quot(minus(X, Y), s(Y))))
active(zWquot(XS, nil)) -> mark(nil)
active(zWquot(nil, XS)) -> mark(nil)
active(zWquot(cons(X, XS), cons(Y, YS))) -> mark(cons(quot(X, Y), zWquot(XS, YS)))
active(from(X)) -> from(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(s(X)) -> s(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(minus(X1, X2)) -> minus(active(X1), X2)
active(minus(X1, X2)) -> minus(X1, active(X2))
active(quot(X1, X2)) -> quot(active(X1), X2)
active(quot(X1, X2)) -> quot(X1, active(X2))
active(zWquot(X1, X2)) -> zWquot(active(X1), X2)
active(zWquot(X1, X2)) -> zWquot(X1, active(X2))
from(mark(X)) -> mark(from(X))
from(ok(X)) -> ok(from(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))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
minus(mark(X1), X2) -> mark(minus(X1, X2))
minus(X1, mark(X2)) -> mark(minus(X1, X2))
minus(ok(X1), ok(X2)) -> ok(minus(X1, X2))
quot(mark(X1), X2) -> mark(quot(X1, X2))
quot(X1, mark(X2)) -> mark(quot(X1, X2))
quot(ok(X1), ok(X2)) -> ok(quot(X1, X2))
zWquot(mark(X1), X2) -> mark(zWquot(X1, X2))
zWquot(X1, mark(X2)) -> mark(zWquot(X1, X2))
zWquot(ok(X1), ok(X2)) -> ok(zWquot(X1, X2))
proper(from(X)) -> from(proper(X))
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(s(X)) -> s(proper(X))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(0) -> ok(0)
proper(minus(X1, X2)) -> minus(proper(X1), proper(X2))
proper(quot(X1, X2)) -> quot(proper(X1), proper(X2))
proper(zWquot(X1, X2)) -> zWquot(proper(X1), proper(X2))
proper(nil) -> ok(nil)
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(from(x₁)) = x₁

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 4

         ↳Polo

       →DP Problem 5

         ↳Polo

       →DP Problem 6

         ↳Polo

       →DP Problem 7

         ↳Polo

       →DP Problem 8

         ↳Polo

           →DP Problem 29

             ↳Polo

...

               →DP Problem 34

                 ↳Polynomial Ordering

       →DP Problem 9

         ↳Polo

       →DP Problem 10

         ↳Remaining

Dependency Pair:

ACTIVE(from(X)) -> ACTIVE(X)

Rules:

active(from(X)) -> mark(cons(X, from(s(X))))
active(sel(0, cons(X, XS))) -> mark(X)
active(sel(s(N), cons(X, XS))) -> mark(sel(N, XS))
active(minus(X, 0)) -> mark(0)
active(minus(s(X), s(Y))) -> mark(minus(X, Y))
active(quot(0, s(Y))) -> mark(0)
active(quot(s(X), s(Y))) -> mark(s(quot(minus(X, Y), s(Y))))
active(zWquot(XS, nil)) -> mark(nil)
active(zWquot(nil, XS)) -> mark(nil)
active(zWquot(cons(X, XS), cons(Y, YS))) -> mark(cons(quot(X, Y), zWquot(XS, YS)))
active(from(X)) -> from(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(s(X)) -> s(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(minus(X1, X2)) -> minus(active(X1), X2)
active(minus(X1, X2)) -> minus(X1, active(X2))
active(quot(X1, X2)) -> quot(active(X1), X2)
active(quot(X1, X2)) -> quot(X1, active(X2))
active(zWquot(X1, X2)) -> zWquot(active(X1), X2)
active(zWquot(X1, X2)) -> zWquot(X1, active(X2))
from(mark(X)) -> mark(from(X))
from(ok(X)) -> ok(from(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))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
minus(mark(X1), X2) -> mark(minus(X1, X2))
minus(X1, mark(X2)) -> mark(minus(X1, X2))
minus(ok(X1), ok(X2)) -> ok(minus(X1, X2))
quot(mark(X1), X2) -> mark(quot(X1, X2))
quot(X1, mark(X2)) -> mark(quot(X1, X2))
quot(ok(X1), ok(X2)) -> ok(quot(X1, X2))
zWquot(mark(X1), X2) -> mark(zWquot(X1, X2))
zWquot(X1, mark(X2)) -> mark(zWquot(X1, X2))
zWquot(ok(X1), ok(X2)) -> ok(zWquot(X1, X2))
proper(from(X)) -> from(proper(X))
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(s(X)) -> s(proper(X))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(0) -> ok(0)
proper(minus(X1, X2)) -> minus(proper(X1), proper(X2))
proper(quot(X1, X2)) -> quot(proper(X1), proper(X2))
proper(zWquot(X1, X2)) -> zWquot(proper(X1), proper(X2))
proper(nil) -> ok(nil)
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))

Strategy:

innermost

The following dependency pair can be strictly oriented:

ACTIVE(from(X)) -> ACTIVE(X)

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

Used ordering: Polynomial ordering with Polynomial interpretation:

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

POL(ACTIVE(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 5

         ↳Polo

       →DP Problem 6

         ↳Polo

       →DP Problem 7

         ↳Polo

       →DP Problem 8

         ↳Polo

           →DP Problem 29

             ↳Polo

...

               →DP Problem 35

                 ↳Dependency Graph

       →DP Problem 9

         ↳Polo

       →DP Problem 10

         ↳Remaining

Dependency Pair:

Rules:

active(from(X)) -> mark(cons(X, from(s(X))))
active(sel(0, cons(X, XS))) -> mark(X)
active(sel(s(N), cons(X, XS))) -> mark(sel(N, XS))
active(minus(X, 0)) -> mark(0)
active(minus(s(X), s(Y))) -> mark(minus(X, Y))
active(quot(0, s(Y))) -> mark(0)
active(quot(s(X), s(Y))) -> mark(s(quot(minus(X, Y), s(Y))))
active(zWquot(XS, nil)) -> mark(nil)
active(zWquot(nil, XS)) -> mark(nil)
active(zWquot(cons(X, XS), cons(Y, YS))) -> mark(cons(quot(X, Y), zWquot(XS, YS)))
active(from(X)) -> from(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(s(X)) -> s(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(minus(X1, X2)) -> minus(active(X1), X2)
active(minus(X1, X2)) -> minus(X1, active(X2))
active(quot(X1, X2)) -> quot(active(X1), X2)
active(quot(X1, X2)) -> quot(X1, active(X2))
active(zWquot(X1, X2)) -> zWquot(active(X1), X2)
active(zWquot(X1, X2)) -> zWquot(X1, active(X2))
from(mark(X)) -> mark(from(X))
from(ok(X)) -> ok(from(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))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
minus(mark(X1), X2) -> mark(minus(X1, X2))
minus(X1, mark(X2)) -> mark(minus(X1, X2))
minus(ok(X1), ok(X2)) -> ok(minus(X1, X2))
quot(mark(X1), X2) -> mark(quot(X1, X2))
quot(X1, mark(X2)) -> mark(quot(X1, X2))
quot(ok(X1), ok(X2)) -> ok(quot(X1, X2))
zWquot(mark(X1), X2) -> mark(zWquot(X1, X2))
zWquot(X1, mark(X2)) -> mark(zWquot(X1, X2))
zWquot(ok(X1), ok(X2)) -> ok(zWquot(X1, X2))
proper(from(X)) -> from(proper(X))
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(s(X)) -> s(proper(X))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(0) -> ok(0)
proper(minus(X1, X2)) -> minus(proper(X1), proper(X2))
proper(quot(X1, X2)) -> quot(proper(X1), proper(X2))
proper(zWquot(X1, X2)) -> zWquot(proper(X1), proper(X2))
proper(nil) -> ok(nil)
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

         ↳Polo

       →DP Problem 6

         ↳Polo

       →DP Problem 7

         ↳Polo

       →DP Problem 8

         ↳Polo

       →DP Problem 9

         ↳Polynomial Ordering

       →DP Problem 10

         ↳Remaining

Dependency Pairs:

PROPER(zWquot(X1, X2)) -> PROPER(X2)
PROPER(zWquot(X1, X2)) -> PROPER(X1)
PROPER(quot(X1, X2)) -> PROPER(X2)
PROPER(quot(X1, X2)) -> PROPER(X1)
PROPER(minus(X1, X2)) -> PROPER(X2)
PROPER(minus(X1, X2)) -> PROPER(X1)
PROPER(sel(X1, X2)) -> PROPER(X2)
PROPER(sel(X1, X2)) -> PROPER(X1)
PROPER(s(X)) -> PROPER(X)
PROPER(cons(X1, X2)) -> PROPER(X2)
PROPER(cons(X1, X2)) -> PROPER(X1)
PROPER(from(X)) -> PROPER(X)

Rules:

active(from(X)) -> mark(cons(X, from(s(X))))
active(sel(0, cons(X, XS))) -> mark(X)
active(sel(s(N), cons(X, XS))) -> mark(sel(N, XS))
active(minus(X, 0)) -> mark(0)
active(minus(s(X), s(Y))) -> mark(minus(X, Y))
active(quot(0, s(Y))) -> mark(0)
active(quot(s(X), s(Y))) -> mark(s(quot(minus(X, Y), s(Y))))
active(zWquot(XS, nil)) -> mark(nil)
active(zWquot(nil, XS)) -> mark(nil)
active(zWquot(cons(X, XS), cons(Y, YS))) -> mark(cons(quot(X, Y), zWquot(XS, YS)))
active(from(X)) -> from(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(s(X)) -> s(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(minus(X1, X2)) -> minus(active(X1), X2)
active(minus(X1, X2)) -> minus(X1, active(X2))
active(quot(X1, X2)) -> quot(active(X1), X2)
active(quot(X1, X2)) -> quot(X1, active(X2))
active(zWquot(X1, X2)) -> zWquot(active(X1), X2)
active(zWquot(X1, X2)) -> zWquot(X1, active(X2))
from(mark(X)) -> mark(from(X))
from(ok(X)) -> ok(from(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))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
minus(mark(X1), X2) -> mark(minus(X1, X2))
minus(X1, mark(X2)) -> mark(minus(X1, X2))
minus(ok(X1), ok(X2)) -> ok(minus(X1, X2))
quot(mark(X1), X2) -> mark(quot(X1, X2))
quot(X1, mark(X2)) -> mark(quot(X1, X2))
quot(ok(X1), ok(X2)) -> ok(quot(X1, X2))
zWquot(mark(X1), X2) -> mark(zWquot(X1, X2))
zWquot(X1, mark(X2)) -> mark(zWquot(X1, X2))
zWquot(ok(X1), ok(X2)) -> ok(zWquot(X1, X2))
proper(from(X)) -> from(proper(X))
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(s(X)) -> s(proper(X))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(0) -> ok(0)
proper(minus(X1, X2)) -> minus(proper(X1), proper(X2))
proper(quot(X1, X2)) -> quot(proper(X1), proper(X2))
proper(zWquot(X1, X2)) -> zWquot(proper(X1), proper(X2))
proper(nil) -> ok(nil)
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))

Strategy:

innermost

The following dependency pairs can be strictly oriented:

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

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

Used ordering: Polynomial ordering with Polynomial interpretation:

POL(from(x₁)) = x₁

POL(PROPER(x₁)) = x₁

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

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

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

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

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

POL(s(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 5

         ↳Polo

       →DP Problem 6

         ↳Polo

       →DP Problem 7

         ↳Polo

       →DP Problem 8

         ↳Polo

       →DP Problem 9

         ↳Polo

           →DP Problem 36

             ↳Polynomial Ordering

       →DP Problem 10

         ↳Remaining

Dependency Pairs:

PROPER(quot(X1, X2)) -> PROPER(X2)
PROPER(quot(X1, X2)) -> PROPER(X1)
PROPER(minus(X1, X2)) -> PROPER(X2)
PROPER(minus(X1, X2)) -> PROPER(X1)
PROPER(sel(X1, X2)) -> PROPER(X2)
PROPER(sel(X1, X2)) -> PROPER(X1)
PROPER(s(X)) -> PROPER(X)
PROPER(cons(X1, X2)) -> PROPER(X2)
PROPER(cons(X1, X2)) -> PROPER(X1)
PROPER(from(X)) -> PROPER(X)

Rules:

active(from(X)) -> mark(cons(X, from(s(X))))
active(sel(0, cons(X, XS))) -> mark(X)
active(sel(s(N), cons(X, XS))) -> mark(sel(N, XS))
active(minus(X, 0)) -> mark(0)
active(minus(s(X), s(Y))) -> mark(minus(X, Y))
active(quot(0, s(Y))) -> mark(0)
active(quot(s(X), s(Y))) -> mark(s(quot(minus(X, Y), s(Y))))
active(zWquot(XS, nil)) -> mark(nil)
active(zWquot(nil, XS)) -> mark(nil)
active(zWquot(cons(X, XS), cons(Y, YS))) -> mark(cons(quot(X, Y), zWquot(XS, YS)))
active(from(X)) -> from(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(s(X)) -> s(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(minus(X1, X2)) -> minus(active(X1), X2)
active(minus(X1, X2)) -> minus(X1, active(X2))
active(quot(X1, X2)) -> quot(active(X1), X2)
active(quot(X1, X2)) -> quot(X1, active(X2))
active(zWquot(X1, X2)) -> zWquot(active(X1), X2)
active(zWquot(X1, X2)) -> zWquot(X1, active(X2))
from(mark(X)) -> mark(from(X))
from(ok(X)) -> ok(from(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))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
minus(mark(X1), X2) -> mark(minus(X1, X2))
minus(X1, mark(X2)) -> mark(minus(X1, X2))
minus(ok(X1), ok(X2)) -> ok(minus(X1, X2))
quot(mark(X1), X2) -> mark(quot(X1, X2))
quot(X1, mark(X2)) -> mark(quot(X1, X2))
quot(ok(X1), ok(X2)) -> ok(quot(X1, X2))
zWquot(mark(X1), X2) -> mark(zWquot(X1, X2))
zWquot(X1, mark(X2)) -> mark(zWquot(X1, X2))
zWquot(ok(X1), ok(X2)) -> ok(zWquot(X1, X2))
proper(from(X)) -> from(proper(X))
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(s(X)) -> s(proper(X))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(0) -> ok(0)
proper(minus(X1, X2)) -> minus(proper(X1), proper(X2))
proper(quot(X1, X2)) -> quot(proper(X1), proper(X2))
proper(zWquot(X1, X2)) -> zWquot(proper(X1), proper(X2))
proper(nil) -> ok(nil)
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))

Strategy:

innermost

The following dependency pairs can be strictly oriented:

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

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

Used ordering: Polynomial ordering with Polynomial interpretation:

POL(from(x₁)) = x₁

POL(PROPER(x₁)) = x₁

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

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

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

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

POL(s(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 5

         ↳Polo

       →DP Problem 6

         ↳Polo

       →DP Problem 7

         ↳Polo

       →DP Problem 8

         ↳Polo

       →DP Problem 9

         ↳Polo

           →DP Problem 36

             ↳Polo

...

               →DP Problem 37

                 ↳Polynomial Ordering

       →DP Problem 10

         ↳Remaining

Dependency Pairs:

PROPER(minus(X1, X2)) -> PROPER(X2)
PROPER(minus(X1, X2)) -> PROPER(X1)
PROPER(sel(X1, X2)) -> PROPER(X2)
PROPER(sel(X1, X2)) -> PROPER(X1)
PROPER(s(X)) -> PROPER(X)
PROPER(cons(X1, X2)) -> PROPER(X2)
PROPER(cons(X1, X2)) -> PROPER(X1)
PROPER(from(X)) -> PROPER(X)

Rules:

active(from(X)) -> mark(cons(X, from(s(X))))
active(sel(0, cons(X, XS))) -> mark(X)
active(sel(s(N), cons(X, XS))) -> mark(sel(N, XS))
active(minus(X, 0)) -> mark(0)
active(minus(s(X), s(Y))) -> mark(minus(X, Y))
active(quot(0, s(Y))) -> mark(0)
active(quot(s(X), s(Y))) -> mark(s(quot(minus(X, Y), s(Y))))
active(zWquot(XS, nil)) -> mark(nil)
active(zWquot(nil, XS)) -> mark(nil)
active(zWquot(cons(X, XS), cons(Y, YS))) -> mark(cons(quot(X, Y), zWquot(XS, YS)))
active(from(X)) -> from(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(s(X)) -> s(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(minus(X1, X2)) -> minus(active(X1), X2)
active(minus(X1, X2)) -> minus(X1, active(X2))
active(quot(X1, X2)) -> quot(active(X1), X2)
active(quot(X1, X2)) -> quot(X1, active(X2))
active(zWquot(X1, X2)) -> zWquot(active(X1), X2)
active(zWquot(X1, X2)) -> zWquot(X1, active(X2))
from(mark(X)) -> mark(from(X))
from(ok(X)) -> ok(from(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))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
minus(mark(X1), X2) -> mark(minus(X1, X2))
minus(X1, mark(X2)) -> mark(minus(X1, X2))
minus(ok(X1), ok(X2)) -> ok(minus(X1, X2))
quot(mark(X1), X2) -> mark(quot(X1, X2))
quot(X1, mark(X2)) -> mark(quot(X1, X2))
quot(ok(X1), ok(X2)) -> ok(quot(X1, X2))
zWquot(mark(X1), X2) -> mark(zWquot(X1, X2))
zWquot(X1, mark(X2)) -> mark(zWquot(X1, X2))
zWquot(ok(X1), ok(X2)) -> ok(zWquot(X1, X2))
proper(from(X)) -> from(proper(X))
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(s(X)) -> s(proper(X))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(0) -> ok(0)
proper(minus(X1, X2)) -> minus(proper(X1), proper(X2))
proper(quot(X1, X2)) -> quot(proper(X1), proper(X2))
proper(zWquot(X1, X2)) -> zWquot(proper(X1), proper(X2))
proper(nil) -> ok(nil)
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))

Strategy:

innermost

The following dependency pairs can be strictly oriented:

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

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

Used ordering: Polynomial ordering with Polynomial interpretation:

POL(from(x₁)) = x₁

POL(PROPER(x₁)) = x₁

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

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

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

POL(s(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 5

         ↳Polo

       →DP Problem 6

         ↳Polo

       →DP Problem 7

         ↳Polo

       →DP Problem 8

         ↳Polo

       →DP Problem 9

         ↳Polo

           →DP Problem 36

             ↳Polo

...

               →DP Problem 38

                 ↳Polynomial Ordering

       →DP Problem 10

         ↳Remaining

Dependency Pairs:

PROPER(sel(X1, X2)) -> PROPER(X2)
PROPER(sel(X1, X2)) -> PROPER(X1)
PROPER(s(X)) -> PROPER(X)
PROPER(cons(X1, X2)) -> PROPER(X2)
PROPER(cons(X1, X2)) -> PROPER(X1)
PROPER(from(X)) -> PROPER(X)

Rules:

active(from(X)) -> mark(cons(X, from(s(X))))
active(sel(0, cons(X, XS))) -> mark(X)
active(sel(s(N), cons(X, XS))) -> mark(sel(N, XS))
active(minus(X, 0)) -> mark(0)
active(minus(s(X), s(Y))) -> mark(minus(X, Y))
active(quot(0, s(Y))) -> mark(0)
active(quot(s(X), s(Y))) -> mark(s(quot(minus(X, Y), s(Y))))
active(zWquot(XS, nil)) -> mark(nil)
active(zWquot(nil, XS)) -> mark(nil)
active(zWquot(cons(X, XS), cons(Y, YS))) -> mark(cons(quot(X, Y), zWquot(XS, YS)))
active(from(X)) -> from(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(s(X)) -> s(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(minus(X1, X2)) -> minus(active(X1), X2)
active(minus(X1, X2)) -> minus(X1, active(X2))
active(quot(X1, X2)) -> quot(active(X1), X2)
active(quot(X1, X2)) -> quot(X1, active(X2))
active(zWquot(X1, X2)) -> zWquot(active(X1), X2)
active(zWquot(X1, X2)) -> zWquot(X1, active(X2))
from(mark(X)) -> mark(from(X))
from(ok(X)) -> ok(from(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))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
minus(mark(X1), X2) -> mark(minus(X1, X2))
minus(X1, mark(X2)) -> mark(minus(X1, X2))
minus(ok(X1), ok(X2)) -> ok(minus(X1, X2))
quot(mark(X1), X2) -> mark(quot(X1, X2))
quot(X1, mark(X2)) -> mark(quot(X1, X2))
quot(ok(X1), ok(X2)) -> ok(quot(X1, X2))
zWquot(mark(X1), X2) -> mark(zWquot(X1, X2))
zWquot(X1, mark(X2)) -> mark(zWquot(X1, X2))
zWquot(ok(X1), ok(X2)) -> ok(zWquot(X1, X2))
proper(from(X)) -> from(proper(X))
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(s(X)) -> s(proper(X))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(0) -> ok(0)
proper(minus(X1, X2)) -> minus(proper(X1), proper(X2))
proper(quot(X1, X2)) -> quot(proper(X1), proper(X2))
proper(zWquot(X1, X2)) -> zWquot(proper(X1), proper(X2))
proper(nil) -> ok(nil)
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))

Strategy:

innermost

The following dependency pairs can be strictly oriented:

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

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

Used ordering: Polynomial ordering with Polynomial interpretation:

POL(from(x₁)) = x₁

POL(PROPER(x₁)) = x₁

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

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

POL(s(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 5

         ↳Polo

       →DP Problem 6

         ↳Polo

       →DP Problem 7

         ↳Polo

       →DP Problem 8

         ↳Polo

       →DP Problem 9

         ↳Polo

           →DP Problem 36

             ↳Polo

...

               →DP Problem 39

                 ↳Polynomial Ordering

       →DP Problem 10

         ↳Remaining

Dependency Pairs:

PROPER(s(X)) -> PROPER(X)
PROPER(cons(X1, X2)) -> PROPER(X2)
PROPER(cons(X1, X2)) -> PROPER(X1)
PROPER(from(X)) -> PROPER(X)

Rules:

active(from(X)) -> mark(cons(X, from(s(X))))
active(sel(0, cons(X, XS))) -> mark(X)
active(sel(s(N), cons(X, XS))) -> mark(sel(N, XS))
active(minus(X, 0)) -> mark(0)
active(minus(s(X), s(Y))) -> mark(minus(X, Y))
active(quot(0, s(Y))) -> mark(0)
active(quot(s(X), s(Y))) -> mark(s(quot(minus(X, Y), s(Y))))
active(zWquot(XS, nil)) -> mark(nil)
active(zWquot(nil, XS)) -> mark(nil)
active(zWquot(cons(X, XS), cons(Y, YS))) -> mark(cons(quot(X, Y), zWquot(XS, YS)))
active(from(X)) -> from(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(s(X)) -> s(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(minus(X1, X2)) -> minus(active(X1), X2)
active(minus(X1, X2)) -> minus(X1, active(X2))
active(quot(X1, X2)) -> quot(active(X1), X2)
active(quot(X1, X2)) -> quot(X1, active(X2))
active(zWquot(X1, X2)) -> zWquot(active(X1), X2)
active(zWquot(X1, X2)) -> zWquot(X1, active(X2))
from(mark(X)) -> mark(from(X))
from(ok(X)) -> ok(from(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))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
minus(mark(X1), X2) -> mark(minus(X1, X2))
minus(X1, mark(X2)) -> mark(minus(X1, X2))
minus(ok(X1), ok(X2)) -> ok(minus(X1, X2))
quot(mark(X1), X2) -> mark(quot(X1, X2))
quot(X1, mark(X2)) -> mark(quot(X1, X2))
quot(ok(X1), ok(X2)) -> ok(quot(X1, X2))
zWquot(mark(X1), X2) -> mark(zWquot(X1, X2))
zWquot(X1, mark(X2)) -> mark(zWquot(X1, X2))
zWquot(ok(X1), ok(X2)) -> ok(zWquot(X1, X2))
proper(from(X)) -> from(proper(X))
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(s(X)) -> s(proper(X))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(0) -> ok(0)
proper(minus(X1, X2)) -> minus(proper(X1), proper(X2))
proper(quot(X1, X2)) -> quot(proper(X1), proper(X2))
proper(zWquot(X1, X2)) -> zWquot(proper(X1), proper(X2))
proper(nil) -> ok(nil)
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))

Strategy:

innermost

The following dependency pair can be strictly oriented:

PROPER(s(X)) -> PROPER(X)

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

Used ordering: Polynomial ordering with Polynomial interpretation:

POL(from(x₁)) = x₁

POL(PROPER(x₁)) = x₁

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

POL(s(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

         ↳Polo

       →DP Problem 6

         ↳Polo

       →DP Problem 7

         ↳Polo

       →DP Problem 8

         ↳Polo

       →DP Problem 9

         ↳Polo

           →DP Problem 36

             ↳Polo

...

               →DP Problem 40

                 ↳Polynomial Ordering

       →DP Problem 10

         ↳Remaining

Dependency Pairs:

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

Rules:

active(from(X)) -> mark(cons(X, from(s(X))))
active(sel(0, cons(X, XS))) -> mark(X)
active(sel(s(N), cons(X, XS))) -> mark(sel(N, XS))
active(minus(X, 0)) -> mark(0)
active(minus(s(X), s(Y))) -> mark(minus(X, Y))
active(quot(0, s(Y))) -> mark(0)
active(quot(s(X), s(Y))) -> mark(s(quot(minus(X, Y), s(Y))))
active(zWquot(XS, nil)) -> mark(nil)
active(zWquot(nil, XS)) -> mark(nil)
active(zWquot(cons(X, XS), cons(Y, YS))) -> mark(cons(quot(X, Y), zWquot(XS, YS)))
active(from(X)) -> from(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(s(X)) -> s(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(minus(X1, X2)) -> minus(active(X1), X2)
active(minus(X1, X2)) -> minus(X1, active(X2))
active(quot(X1, X2)) -> quot(active(X1), X2)
active(quot(X1, X2)) -> quot(X1, active(X2))
active(zWquot(X1, X2)) -> zWquot(active(X1), X2)
active(zWquot(X1, X2)) -> zWquot(X1, active(X2))
from(mark(X)) -> mark(from(X))
from(ok(X)) -> ok(from(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))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
minus(mark(X1), X2) -> mark(minus(X1, X2))
minus(X1, mark(X2)) -> mark(minus(X1, X2))
minus(ok(X1), ok(X2)) -> ok(minus(X1, X2))
quot(mark(X1), X2) -> mark(quot(X1, X2))
quot(X1, mark(X2)) -> mark(quot(X1, X2))
quot(ok(X1), ok(X2)) -> ok(quot(X1, X2))
zWquot(mark(X1), X2) -> mark(zWquot(X1, X2))
zWquot(X1, mark(X2)) -> mark(zWquot(X1, X2))
zWquot(ok(X1), ok(X2)) -> ok(zWquot(X1, X2))
proper(from(X)) -> from(proper(X))
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(s(X)) -> s(proper(X))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(0) -> ok(0)
proper(minus(X1, X2)) -> minus(proper(X1), proper(X2))
proper(quot(X1, X2)) -> quot(proper(X1), proper(X2))
proper(zWquot(X1, X2)) -> zWquot(proper(X1), proper(X2))
proper(nil) -> ok(nil)
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(from(x₁)) = x₁

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 5

         ↳Polo

       →DP Problem 6

         ↳Polo

       →DP Problem 7

         ↳Polo

       →DP Problem 8

         ↳Polo

       →DP Problem 9

         ↳Polo

           →DP Problem 36

             ↳Polo

...

               →DP Problem 41

                 ↳Polynomial Ordering

       →DP Problem 10

         ↳Remaining

Dependency Pair:

PROPER(from(X)) -> PROPER(X)

Rules:

active(from(X)) -> mark(cons(X, from(s(X))))
active(sel(0, cons(X, XS))) -> mark(X)
active(sel(s(N), cons(X, XS))) -> mark(sel(N, XS))
active(minus(X, 0)) -> mark(0)
active(minus(s(X), s(Y))) -> mark(minus(X, Y))
active(quot(0, s(Y))) -> mark(0)
active(quot(s(X), s(Y))) -> mark(s(quot(minus(X, Y), s(Y))))
active(zWquot(XS, nil)) -> mark(nil)
active(zWquot(nil, XS)) -> mark(nil)
active(zWquot(cons(X, XS), cons(Y, YS))) -> mark(cons(quot(X, Y), zWquot(XS, YS)))
active(from(X)) -> from(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(s(X)) -> s(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(minus(X1, X2)) -> minus(active(X1), X2)
active(minus(X1, X2)) -> minus(X1, active(X2))
active(quot(X1, X2)) -> quot(active(X1), X2)
active(quot(X1, X2)) -> quot(X1, active(X2))
active(zWquot(X1, X2)) -> zWquot(active(X1), X2)
active(zWquot(X1, X2)) -> zWquot(X1, active(X2))
from(mark(X)) -> mark(from(X))
from(ok(X)) -> ok(from(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))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
minus(mark(X1), X2) -> mark(minus(X1, X2))
minus(X1, mark(X2)) -> mark(minus(X1, X2))
minus(ok(X1), ok(X2)) -> ok(minus(X1, X2))
quot(mark(X1), X2) -> mark(quot(X1, X2))
quot(X1, mark(X2)) -> mark(quot(X1, X2))
quot(ok(X1), ok(X2)) -> ok(quot(X1, X2))
zWquot(mark(X1), X2) -> mark(zWquot(X1, X2))
zWquot(X1, mark(X2)) -> mark(zWquot(X1, X2))
zWquot(ok(X1), ok(X2)) -> ok(zWquot(X1, X2))
proper(from(X)) -> from(proper(X))
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(s(X)) -> s(proper(X))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(0) -> ok(0)
proper(minus(X1, X2)) -> minus(proper(X1), proper(X2))
proper(quot(X1, X2)) -> quot(proper(X1), proper(X2))
proper(zWquot(X1, X2)) -> zWquot(proper(X1), proper(X2))
proper(nil) -> ok(nil)
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))

Strategy:

innermost

The following dependency pair can be strictly oriented:

PROPER(from(X)) -> PROPER(X)

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

Used ordering: Polynomial ordering with Polynomial interpretation:

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

POL(PROPER(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 5

         ↳Polo

       →DP Problem 6

         ↳Polo

       →DP Problem 7

         ↳Polo

       →DP Problem 8

         ↳Polo

       →DP Problem 9

         ↳Polo

           →DP Problem 36

             ↳Polo

...

               →DP Problem 42

                 ↳Dependency Graph

       →DP Problem 10

         ↳Remaining

Dependency Pair:

Rules:

active(from(X)) -> mark(cons(X, from(s(X))))
active(sel(0, cons(X, XS))) -> mark(X)
active(sel(s(N), cons(X, XS))) -> mark(sel(N, XS))
active(minus(X, 0)) -> mark(0)
active(minus(s(X), s(Y))) -> mark(minus(X, Y))
active(quot(0, s(Y))) -> mark(0)
active(quot(s(X), s(Y))) -> mark(s(quot(minus(X, Y), s(Y))))
active(zWquot(XS, nil)) -> mark(nil)
active(zWquot(nil, XS)) -> mark(nil)
active(zWquot(cons(X, XS), cons(Y, YS))) -> mark(cons(quot(X, Y), zWquot(XS, YS)))
active(from(X)) -> from(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(s(X)) -> s(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(minus(X1, X2)) -> minus(active(X1), X2)
active(minus(X1, X2)) -> minus(X1, active(X2))
active(quot(X1, X2)) -> quot(active(X1), X2)
active(quot(X1, X2)) -> quot(X1, active(X2))
active(zWquot(X1, X2)) -> zWquot(active(X1), X2)
active(zWquot(X1, X2)) -> zWquot(X1, active(X2))
from(mark(X)) -> mark(from(X))
from(ok(X)) -> ok(from(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))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
minus(mark(X1), X2) -> mark(minus(X1, X2))
minus(X1, mark(X2)) -> mark(minus(X1, X2))
minus(ok(X1), ok(X2)) -> ok(minus(X1, X2))
quot(mark(X1), X2) -> mark(quot(X1, X2))
quot(X1, mark(X2)) -> mark(quot(X1, X2))
quot(ok(X1), ok(X2)) -> ok(quot(X1, X2))
zWquot(mark(X1), X2) -> mark(zWquot(X1, X2))
zWquot(X1, mark(X2)) -> mark(zWquot(X1, X2))
zWquot(ok(X1), ok(X2)) -> ok(zWquot(X1, X2))
proper(from(X)) -> from(proper(X))
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(s(X)) -> s(proper(X))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(0) -> ok(0)
proper(minus(X1, X2)) -> minus(proper(X1), proper(X2))
proper(quot(X1, X2)) -> quot(proper(X1), proper(X2))
proper(zWquot(X1, X2)) -> zWquot(proper(X1), proper(X2))
proper(nil) -> ok(nil)
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

         ↳Polo

       →DP Problem 6

         ↳Polo

       →DP Problem 7

         ↳Polo

       →DP Problem 8

         ↳Polo

       →DP Problem 9

         ↳Polo

       →DP Problem 10

         ↳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(from(X)) -> mark(cons(X, from(s(X))))
active(sel(0, cons(X, XS))) -> mark(X)
active(sel(s(N), cons(X, XS))) -> mark(sel(N, XS))
active(minus(X, 0)) -> mark(0)
active(minus(s(X), s(Y))) -> mark(minus(X, Y))
active(quot(0, s(Y))) -> mark(0)
active(quot(s(X), s(Y))) -> mark(s(quot(minus(X, Y), s(Y))))
active(zWquot(XS, nil)) -> mark(nil)
active(zWquot(nil, XS)) -> mark(nil)
active(zWquot(cons(X, XS), cons(Y, YS))) -> mark(cons(quot(X, Y), zWquot(XS, YS)))
active(from(X)) -> from(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(s(X)) -> s(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(minus(X1, X2)) -> minus(active(X1), X2)
active(minus(X1, X2)) -> minus(X1, active(X2))
active(quot(X1, X2)) -> quot(active(X1), X2)
active(quot(X1, X2)) -> quot(X1, active(X2))
active(zWquot(X1, X2)) -> zWquot(active(X1), X2)
active(zWquot(X1, X2)) -> zWquot(X1, active(X2))
from(mark(X)) -> mark(from(X))
from(ok(X)) -> ok(from(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))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
minus(mark(X1), X2) -> mark(minus(X1, X2))
minus(X1, mark(X2)) -> mark(minus(X1, X2))
minus(ok(X1), ok(X2)) -> ok(minus(X1, X2))
quot(mark(X1), X2) -> mark(quot(X1, X2))
quot(X1, mark(X2)) -> mark(quot(X1, X2))
quot(ok(X1), ok(X2)) -> ok(quot(X1, X2))
zWquot(mark(X1), X2) -> mark(zWquot(X1, X2))
zWquot(X1, mark(X2)) -> mark(zWquot(X1, X2))
zWquot(ok(X1), ok(X2)) -> ok(zWquot(X1, X2))
proper(from(X)) -> from(proper(X))
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(s(X)) -> s(proper(X))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(0) -> ok(0)
proper(minus(X1, X2)) -> minus(proper(X1), proper(X2))
proper(quot(X1, X2)) -> quot(proper(X1), proper(X2))
proper(zWquot(X1, X2)) -> zWquot(proper(X1), proper(X2))
proper(nil) -> ok(nil)
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))

Strategy:

innermost

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

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

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

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

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

POL(QUOT(x₁, x₂))	= x₂
POL(mark(x₁))	= 1 + x₁

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

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

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

POL(from(x₁))	= x₁
POL(ACTIVE(x₁))	= x₁
POL(zWquot(x₁, x₂))	= 1 + x₁ + x₂
POL(cons(x₁, x₂))	= x₁
POL(minus(x₁, x₂))	= x₁ + x₂
POL(quot(x₁, x₂))	= x₁ + x₂
POL(sel(x₁, x₂))	= x₁ + x₂
POL(s(x₁))	= x₁

POL(from(x₁))	= x₁
POL(PROPER(x₁))	= x₁
POL(zWquot(x₁, x₂))	= 1 + x₁ + x₂
POL(cons(x₁, x₂))	= x₁ + x₂
POL(minus(x₁, x₂))	= x₁ + x₂
POL(quot(x₁, x₂))	= x₁ + x₂
POL(sel(x₁, x₂))	= x₁ + x₂
POL(s(x₁))	= x₁