Term Rewriting System R:
[X, Y, Z, X1, X2]
active(2nd(cons(X, cons(Y, Z)))) -> mark(Y)
active(from(X)) -> mark(cons(X, from(s(X))))
active(2nd(X)) -> 2nd(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(from(X)) -> from(active(X))
active(s(X)) -> s(active(X))
2nd(mark(X)) -> mark(2nd(X))
2nd(ok(X)) -> ok(2nd(X))
cons(mark(X1), X2) -> mark(cons(X1, X2))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
from(mark(X)) -> mark(from(X))
from(ok(X)) -> ok(from(X))
s(mark(X)) -> mark(s(X))
s(ok(X)) -> ok(s(X))
proper(2nd(X)) -> 2nd(proper(X))
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(s(X)) -> s(proper(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))

Innermost Termination of R to be shown.



   R
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(2nd(X)) -> 2ND(active(X))
ACTIVE(2nd(X)) -> ACTIVE(X)
ACTIVE(cons(X1, X2)) -> CONS(active(X1), X2)
ACTIVE(cons(X1, X2)) -> ACTIVE(X1)
ACTIVE(from(X)) -> FROM(active(X))
ACTIVE(from(X)) -> ACTIVE(X)
ACTIVE(s(X)) -> S(active(X))
ACTIVE(s(X)) -> ACTIVE(X)
2ND(mark(X)) -> 2ND(X)
2ND(ok(X)) -> 2ND(X)
CONS(mark(X1), X2) -> CONS(X1, X2)
CONS(ok(X1), ok(X2)) -> CONS(X1, X2)
FROM(mark(X)) -> FROM(X)
FROM(ok(X)) -> FROM(X)
S(mark(X)) -> S(X)
S(ok(X)) -> S(X)
PROPER(2nd(X)) -> 2ND(proper(X))
PROPER(2nd(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(from(X)) -> FROM(proper(X))
PROPER(from(X)) -> PROPER(X)
PROPER(s(X)) -> S(proper(X))
PROPER(s(X)) -> PROPER(X)
TOP(mark(X)) -> TOP(proper(X))
TOP(mark(X)) -> PROPER(X)
TOP(ok(X)) -> TOP(active(X))
TOP(ok(X)) -> ACTIVE(X)

Furthermore, R contains seven SCCs.


   R
DPs
       →DP Problem 1
Argument Filtering and Ordering
       →DP Problem 2
AFS
       →DP Problem 3
AFS
       →DP Problem 4
AFS
       →DP Problem 5
AFS
       →DP Problem 6
AFS
       →DP Problem 7
AFS


Dependency Pairs:

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


Rules:


active(2nd(cons(X, cons(Y, Z)))) -> mark(Y)
active(from(X)) -> mark(cons(X, from(s(X))))
active(2nd(X)) -> 2nd(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(from(X)) -> from(active(X))
active(s(X)) -> s(active(X))
2nd(mark(X)) -> mark(2nd(X))
2nd(ok(X)) -> ok(2nd(X))
cons(mark(X1), X2) -> mark(cons(X1, X2))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
from(mark(X)) -> mark(from(X))
from(ok(X)) -> ok(from(X))
s(mark(X)) -> mark(s(X))
s(ok(X)) -> ok(s(X))
proper(2nd(X)) -> 2nd(proper(X))
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(s(X)) -> s(proper(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))


Strategy:

innermost




The following dependency pairs can be strictly oriented:

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


There are no usable rules for innermost that need to be oriented.
Used ordering: Lexicographic Path Order with Non-Strict Precedence with Quasi Precedence:
trivial

resulting in one new DP problem.
Used Argument Filtering System:
FROM(x1) -> FROM(x1)
mark(x1) -> mark(x1)
ok(x1) -> ok(x1)


   R
DPs
       →DP Problem 1
AFS
           →DP Problem 8
Dependency Graph
       →DP Problem 2
AFS
       →DP Problem 3
AFS
       →DP Problem 4
AFS
       →DP Problem 5
AFS
       →DP Problem 6
AFS
       →DP Problem 7
AFS


Dependency Pair:


Rules:


active(2nd(cons(X, cons(Y, Z)))) -> mark(Y)
active(from(X)) -> mark(cons(X, from(s(X))))
active(2nd(X)) -> 2nd(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(from(X)) -> from(active(X))
active(s(X)) -> s(active(X))
2nd(mark(X)) -> mark(2nd(X))
2nd(ok(X)) -> ok(2nd(X))
cons(mark(X1), X2) -> mark(cons(X1, X2))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
from(mark(X)) -> mark(from(X))
from(ok(X)) -> ok(from(X))
s(mark(X)) -> mark(s(X))
s(ok(X)) -> ok(s(X))
proper(2nd(X)) -> 2nd(proper(X))
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(s(X)) -> s(proper(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))


Strategy:

innermost




Using the Dependency Graph resulted in no new DP problems.


   R
DPs
       →DP Problem 1
AFS
       →DP Problem 2
Argument Filtering and Ordering
       →DP Problem 3
AFS
       →DP Problem 4
AFS
       →DP Problem 5
AFS
       →DP Problem 6
AFS
       →DP Problem 7
AFS


Dependency Pairs:

2ND(ok(X)) -> 2ND(X)
2ND(mark(X)) -> 2ND(X)


Rules:


active(2nd(cons(X, cons(Y, Z)))) -> mark(Y)
active(from(X)) -> mark(cons(X, from(s(X))))
active(2nd(X)) -> 2nd(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(from(X)) -> from(active(X))
active(s(X)) -> s(active(X))
2nd(mark(X)) -> mark(2nd(X))
2nd(ok(X)) -> ok(2nd(X))
cons(mark(X1), X2) -> mark(cons(X1, X2))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
from(mark(X)) -> mark(from(X))
from(ok(X)) -> ok(from(X))
s(mark(X)) -> mark(s(X))
s(ok(X)) -> ok(s(X))
proper(2nd(X)) -> 2nd(proper(X))
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(s(X)) -> s(proper(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))


Strategy:

innermost




The following dependency pairs can be strictly oriented:

2ND(ok(X)) -> 2ND(X)
2ND(mark(X)) -> 2ND(X)


There are no usable rules for innermost that need to be oriented.
Used ordering: Lexicographic Path Order with Non-Strict Precedence with Quasi Precedence:
trivial

resulting in one new DP problem.
Used Argument Filtering System:
2ND(x1) -> 2ND(x1)
ok(x1) -> ok(x1)
mark(x1) -> mark(x1)


   R
DPs
       →DP Problem 1
AFS
       →DP Problem 2
AFS
           →DP Problem 9
Dependency Graph
       →DP Problem 3
AFS
       →DP Problem 4
AFS
       →DP Problem 5
AFS
       →DP Problem 6
AFS
       →DP Problem 7
AFS


Dependency Pair:


Rules:


active(2nd(cons(X, cons(Y, Z)))) -> mark(Y)
active(from(X)) -> mark(cons(X, from(s(X))))
active(2nd(X)) -> 2nd(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(from(X)) -> from(active(X))
active(s(X)) -> s(active(X))
2nd(mark(X)) -> mark(2nd(X))
2nd(ok(X)) -> ok(2nd(X))
cons(mark(X1), X2) -> mark(cons(X1, X2))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
from(mark(X)) -> mark(from(X))
from(ok(X)) -> ok(from(X))
s(mark(X)) -> mark(s(X))
s(ok(X)) -> ok(s(X))
proper(2nd(X)) -> 2nd(proper(X))
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(s(X)) -> s(proper(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))


Strategy:

innermost




Using the Dependency Graph resulted in no new DP problems.


   R
DPs
       →DP Problem 1
AFS
       →DP Problem 2
AFS
       →DP Problem 3
Argument Filtering and Ordering
       →DP Problem 4
AFS
       →DP Problem 5
AFS
       →DP Problem 6
AFS
       →DP Problem 7
AFS


Dependency Pairs:

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


Rules:


active(2nd(cons(X, cons(Y, Z)))) -> mark(Y)
active(from(X)) -> mark(cons(X, from(s(X))))
active(2nd(X)) -> 2nd(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(from(X)) -> from(active(X))
active(s(X)) -> s(active(X))
2nd(mark(X)) -> mark(2nd(X))
2nd(ok(X)) -> ok(2nd(X))
cons(mark(X1), X2) -> mark(cons(X1, X2))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
from(mark(X)) -> mark(from(X))
from(ok(X)) -> ok(from(X))
s(mark(X)) -> mark(s(X))
s(ok(X)) -> ok(s(X))
proper(2nd(X)) -> 2nd(proper(X))
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(s(X)) -> s(proper(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))


Strategy:

innermost




The following dependency pairs can be strictly oriented:

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


There are no usable rules for innermost that need to be oriented.
Used ordering: Lexicographic Path Order with Non-Strict Precedence with Quasi Precedence:
trivial

resulting in one new DP problem.
Used Argument Filtering System:
CONS(x1, x2) -> CONS(x1, x2)
mark(x1) -> mark(x1)
ok(x1) -> ok(x1)


   R
DPs
       →DP Problem 1
AFS
       →DP Problem 2
AFS
       →DP Problem 3
AFS
           →DP Problem 10
Dependency Graph
       →DP Problem 4
AFS
       →DP Problem 5
AFS
       →DP Problem 6
AFS
       →DP Problem 7
AFS


Dependency Pair:


Rules:


active(2nd(cons(X, cons(Y, Z)))) -> mark(Y)
active(from(X)) -> mark(cons(X, from(s(X))))
active(2nd(X)) -> 2nd(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(from(X)) -> from(active(X))
active(s(X)) -> s(active(X))
2nd(mark(X)) -> mark(2nd(X))
2nd(ok(X)) -> ok(2nd(X))
cons(mark(X1), X2) -> mark(cons(X1, X2))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
from(mark(X)) -> mark(from(X))
from(ok(X)) -> ok(from(X))
s(mark(X)) -> mark(s(X))
s(ok(X)) -> ok(s(X))
proper(2nd(X)) -> 2nd(proper(X))
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(s(X)) -> s(proper(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))


Strategy:

innermost




Using the Dependency Graph resulted in no new DP problems.


   R
DPs
       →DP Problem 1
AFS
       →DP Problem 2
AFS
       →DP Problem 3
AFS
       →DP Problem 4
Argument Filtering and Ordering
       →DP Problem 5
AFS
       →DP Problem 6
AFS
       →DP Problem 7
AFS


Dependency Pairs:

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


Rules:


active(2nd(cons(X, cons(Y, Z)))) -> mark(Y)
active(from(X)) -> mark(cons(X, from(s(X))))
active(2nd(X)) -> 2nd(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(from(X)) -> from(active(X))
active(s(X)) -> s(active(X))
2nd(mark(X)) -> mark(2nd(X))
2nd(ok(X)) -> ok(2nd(X))
cons(mark(X1), X2) -> mark(cons(X1, X2))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
from(mark(X)) -> mark(from(X))
from(ok(X)) -> ok(from(X))
s(mark(X)) -> mark(s(X))
s(ok(X)) -> ok(s(X))
proper(2nd(X)) -> 2nd(proper(X))
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(s(X)) -> s(proper(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))


Strategy:

innermost




The following dependency pairs can be strictly oriented:

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


There are no usable rules for innermost that need to be oriented.
Used ordering: Lexicographic Path Order with Non-Strict Precedence with Quasi Precedence:
trivial

resulting in one new DP problem.
Used Argument Filtering System:
S(x1) -> S(x1)
ok(x1) -> ok(x1)
mark(x1) -> mark(x1)


   R
DPs
       →DP Problem 1
AFS
       →DP Problem 2
AFS
       →DP Problem 3
AFS
       →DP Problem 4
AFS
           →DP Problem 11
Dependency Graph
       →DP Problem 5
AFS
       →DP Problem 6
AFS
       →DP Problem 7
AFS


Dependency Pair:


Rules:


active(2nd(cons(X, cons(Y, Z)))) -> mark(Y)
active(from(X)) -> mark(cons(X, from(s(X))))
active(2nd(X)) -> 2nd(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(from(X)) -> from(active(X))
active(s(X)) -> s(active(X))
2nd(mark(X)) -> mark(2nd(X))
2nd(ok(X)) -> ok(2nd(X))
cons(mark(X1), X2) -> mark(cons(X1, X2))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
from(mark(X)) -> mark(from(X))
from(ok(X)) -> ok(from(X))
s(mark(X)) -> mark(s(X))
s(ok(X)) -> ok(s(X))
proper(2nd(X)) -> 2nd(proper(X))
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(s(X)) -> s(proper(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))


Strategy:

innermost




Using the Dependency Graph resulted in no new DP problems.


   R
DPs
       →DP Problem 1
AFS
       →DP Problem 2
AFS
       →DP Problem 3
AFS
       →DP Problem 4
AFS
       →DP Problem 5
Argument Filtering and Ordering
       →DP Problem 6
AFS
       →DP Problem 7
AFS


Dependency Pairs:

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


Rules:


active(2nd(cons(X, cons(Y, Z)))) -> mark(Y)
active(from(X)) -> mark(cons(X, from(s(X))))
active(2nd(X)) -> 2nd(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(from(X)) -> from(active(X))
active(s(X)) -> s(active(X))
2nd(mark(X)) -> mark(2nd(X))
2nd(ok(X)) -> ok(2nd(X))
cons(mark(X1), X2) -> mark(cons(X1, X2))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
from(mark(X)) -> mark(from(X))
from(ok(X)) -> ok(from(X))
s(mark(X)) -> mark(s(X))
s(ok(X)) -> ok(s(X))
proper(2nd(X)) -> 2nd(proper(X))
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(s(X)) -> s(proper(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))


Strategy:

innermost




The following dependency pairs can be strictly oriented:

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


There are no usable rules for innermost that need to be oriented.
Used ordering: Lexicographic Path Order with Non-Strict Precedence with Quasi Precedence:
trivial

resulting in one new DP problem.
Used Argument Filtering System:
ACTIVE(x1) -> ACTIVE(x1)
s(x1) -> s(x1)
from(x1) -> from(x1)
cons(x1, x2) -> cons(x1, x2)
2nd(x1) -> 2nd(x1)


   R
DPs
       →DP Problem 1
AFS
       →DP Problem 2
AFS
       →DP Problem 3
AFS
       →DP Problem 4
AFS
       →DP Problem 5
AFS
           →DP Problem 12
Dependency Graph
       →DP Problem 6
AFS
       →DP Problem 7
AFS


Dependency Pair:


Rules:


active(2nd(cons(X, cons(Y, Z)))) -> mark(Y)
active(from(X)) -> mark(cons(X, from(s(X))))
active(2nd(X)) -> 2nd(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(from(X)) -> from(active(X))
active(s(X)) -> s(active(X))
2nd(mark(X)) -> mark(2nd(X))
2nd(ok(X)) -> ok(2nd(X))
cons(mark(X1), X2) -> mark(cons(X1, X2))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
from(mark(X)) -> mark(from(X))
from(ok(X)) -> ok(from(X))
s(mark(X)) -> mark(s(X))
s(ok(X)) -> ok(s(X))
proper(2nd(X)) -> 2nd(proper(X))
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(s(X)) -> s(proper(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))


Strategy:

innermost




Using the Dependency Graph resulted in no new DP problems.


   R
DPs
       →DP Problem 1
AFS
       →DP Problem 2
AFS
       →DP Problem 3
AFS
       →DP Problem 4
AFS
       →DP Problem 5
AFS
       →DP Problem 6
Argument Filtering and Ordering
       →DP Problem 7
AFS


Dependency Pairs:

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


Rules:


active(2nd(cons(X, cons(Y, Z)))) -> mark(Y)
active(from(X)) -> mark(cons(X, from(s(X))))
active(2nd(X)) -> 2nd(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(from(X)) -> from(active(X))
active(s(X)) -> s(active(X))
2nd(mark(X)) -> mark(2nd(X))
2nd(ok(X)) -> ok(2nd(X))
cons(mark(X1), X2) -> mark(cons(X1, X2))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
from(mark(X)) -> mark(from(X))
from(ok(X)) -> ok(from(X))
s(mark(X)) -> mark(s(X))
s(ok(X)) -> ok(s(X))
proper(2nd(X)) -> 2nd(proper(X))
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(s(X)) -> s(proper(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))


Strategy:

innermost




The following dependency pairs can be strictly oriented:

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


There are no usable rules for innermost that need to be oriented.
Used ordering: Lexicographic Path Order with Non-Strict Precedence with Quasi Precedence:
trivial

resulting in one new DP problem.
Used Argument Filtering System:
PROPER(x1) -> PROPER(x1)
cons(x1, x2) -> cons(x1, x2)
2nd(x1) -> 2nd(x1)
from(x1) -> from(x1)
s(x1) -> s(x1)


   R
DPs
       →DP Problem 1
AFS
       →DP Problem 2
AFS
       →DP Problem 3
AFS
       →DP Problem 4
AFS
       →DP Problem 5
AFS
       →DP Problem 6
AFS
           →DP Problem 13
Dependency Graph
       →DP Problem 7
AFS


Dependency Pair:


Rules:


active(2nd(cons(X, cons(Y, Z)))) -> mark(Y)
active(from(X)) -> mark(cons(X, from(s(X))))
active(2nd(X)) -> 2nd(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(from(X)) -> from(active(X))
active(s(X)) -> s(active(X))
2nd(mark(X)) -> mark(2nd(X))
2nd(ok(X)) -> ok(2nd(X))
cons(mark(X1), X2) -> mark(cons(X1, X2))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
from(mark(X)) -> mark(from(X))
from(ok(X)) -> ok(from(X))
s(mark(X)) -> mark(s(X))
s(ok(X)) -> ok(s(X))
proper(2nd(X)) -> 2nd(proper(X))
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(s(X)) -> s(proper(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))


Strategy:

innermost




Using the Dependency Graph resulted in no new DP problems.


   R
DPs
       →DP Problem 1
AFS
       →DP Problem 2
AFS
       →DP Problem 3
AFS
       →DP Problem 4
AFS
       →DP Problem 5
AFS
       →DP Problem 6
AFS
       →DP Problem 7
Argument Filtering and Ordering


Dependency Pairs:

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


Rules:


active(2nd(cons(X, cons(Y, Z)))) -> mark(Y)
active(from(X)) -> mark(cons(X, from(s(X))))
active(2nd(X)) -> 2nd(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(from(X)) -> from(active(X))
active(s(X)) -> s(active(X))
2nd(mark(X)) -> mark(2nd(X))
2nd(ok(X)) -> ok(2nd(X))
cons(mark(X1), X2) -> mark(cons(X1, X2))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
from(mark(X)) -> mark(from(X))
from(ok(X)) -> ok(from(X))
s(mark(X)) -> mark(s(X))
s(ok(X)) -> ok(s(X))
proper(2nd(X)) -> 2nd(proper(X))
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(s(X)) -> s(proper(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))


Strategy:

innermost




The following dependency pairs can be strictly oriented:

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


The following usable rules for innermost can be oriented:

proper(2nd(X)) -> 2nd(proper(X))
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(s(X)) -> s(proper(X))
active(2nd(cons(X, cons(Y, Z)))) -> mark(Y)
active(from(X)) -> mark(cons(X, from(s(X))))
active(2nd(X)) -> 2nd(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(from(X)) -> from(active(X))
active(s(X)) -> s(active(X))
2nd(mark(X)) -> mark(2nd(X))
2nd(ok(X)) -> ok(2nd(X))
cons(mark(X1), X2) -> mark(cons(X1, X2))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
from(mark(X)) -> mark(from(X))
from(ok(X)) -> ok(from(X))
s(mark(X)) -> mark(s(X))
s(ok(X)) -> ok(s(X))


Used ordering: Lexicographic Path Order with Non-Strict Precedence with Quasi Precedence:
ok > {active, mark} > proper

resulting in one new DP problem.
Used Argument Filtering System:
TOP(x1) -> TOP(x1)
mark(x1) -> mark
proper(x1) -> proper
ok(x1) -> ok(x1)
active(x1) -> active(x1)
2nd(x1) -> x1
cons(x1, x2) -> x1
from(x1) -> x1
s(x1) -> x1


   R
DPs
       →DP Problem 1
AFS
       →DP Problem 2
AFS
       →DP Problem 3
AFS
       →DP Problem 4
AFS
       →DP Problem 5
AFS
       →DP Problem 6
AFS
       →DP Problem 7
AFS
           →DP Problem 14
Dependency Graph


Dependency Pair:


Rules:


active(2nd(cons(X, cons(Y, Z)))) -> mark(Y)
active(from(X)) -> mark(cons(X, from(s(X))))
active(2nd(X)) -> 2nd(active(X))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(from(X)) -> from(active(X))
active(s(X)) -> s(active(X))
2nd(mark(X)) -> mark(2nd(X))
2nd(ok(X)) -> ok(2nd(X))
cons(mark(X1), X2) -> mark(cons(X1, X2))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
from(mark(X)) -> mark(from(X))
from(ok(X)) -> ok(from(X))
s(mark(X)) -> mark(s(X))
s(ok(X)) -> ok(s(X))
proper(2nd(X)) -> 2nd(proper(X))
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(s(X)) -> s(proper(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))


Strategy:

innermost




Using the Dependency Graph resulted in no new DP problems.

Innermost Termination of R successfully shown.
Duration:
0:12 minutes