Term Rewriting System R:
[Z, X, Y, X1, X2]
active(fst(0, Z)) -> mark(nil)
active(fst(s(X), cons(Y, Z))) -> mark(cons(Y, fst(X, Z)))
active(from(X)) -> mark(cons(X, from(s(X))))
active(add(0, X)) -> mark(X)
active(add(s(X), Y)) -> mark(s(add(X, Y)))
active(len(nil)) -> mark(0)
active(len(cons(X, Z))) -> mark(s(len(Z)))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(fst(X1, X2)) -> fst(active(X1), X2)
active(fst(X1, X2)) -> fst(X1, active(X2))
active(from(X)) -> from(active(X))
active(add(X1, X2)) -> add(active(X1), X2)
active(add(X1, X2)) -> add(X1, active(X2))
active(len(X)) -> len(active(X))
cons(mark(X1), X2) -> mark(cons(X1, X2))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
fst(mark(X1), X2) -> mark(fst(X1, X2))
fst(X1, mark(X2)) -> mark(fst(X1, X2))
fst(ok(X1), ok(X2)) -> ok(fst(X1, X2))
from(mark(X)) -> mark(from(X))
from(ok(X)) -> ok(from(X))
add(mark(X1), X2) -> mark(add(X1, X2))
add(X1, mark(X2)) -> mark(add(X1, X2))
add(ok(X1), ok(X2)) -> ok(add(X1, X2))
len(mark(X)) -> mark(len(X))
len(ok(X)) -> ok(len(X))
proper(0) -> ok(0)
proper(s(X)) -> s(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(fst(X1, X2)) -> fst(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(add(X1, X2)) -> add(proper(X1), proper(X2))
proper(len(X)) -> len(proper(X))
s(ok(X)) -> ok(s(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))

Termination of R to be shown. 



   R
     ↳Dependency Pair Analysis



R contains the following Dependency Pairs:

ACTIVE(fst(s(X), cons(Y, Z))) -> CONS(Y, fst(X, Z))
ACTIVE(fst(s(X), cons(Y, Z))) -> FST(X, Z)
ACTIVE(from(X)) -> CONS(X, from(s(X)))
ACTIVE(from(X)) -> FROM(s(X))
ACTIVE(from(X)) -> S(X)
ACTIVE(add(s(X), Y)) -> S(add(X, Y))
ACTIVE(add(s(X), Y)) -> ADD(X, Y)
ACTIVE(len(cons(X, Z))) -> S(len(Z))
ACTIVE(len(cons(X, Z))) -> LEN(Z)
ACTIVE(cons(X1, X2)) -> CONS(active(X1), X2)
ACTIVE(cons(X1, X2)) -> ACTIVE(X1)
ACTIVE(fst(X1, X2)) -> FST(active(X1), X2)
ACTIVE(fst(X1, X2)) -> ACTIVE(X1)
ACTIVE(fst(X1, X2)) -> FST(X1, active(X2))
ACTIVE(fst(X1, X2)) -> ACTIVE(X2)
ACTIVE(from(X)) -> FROM(active(X))
ACTIVE(from(X)) -> ACTIVE(X)
ACTIVE(add(X1, X2)) -> ADD(active(X1), X2)
ACTIVE(add(X1, X2)) -> ACTIVE(X1)
ACTIVE(add(X1, X2)) -> ADD(X1, active(X2))
ACTIVE(add(X1, X2)) -> ACTIVE(X2)
ACTIVE(len(X)) -> LEN(active(X))
ACTIVE(len(X)) -> ACTIVE(X)
CONS(mark(X1), X2) -> CONS(X1, X2)
CONS(ok(X1), ok(X2)) -> CONS(X1, X2)
FST(mark(X1), X2) -> FST(X1, X2)
FST(X1, mark(X2)) -> FST(X1, X2)
FST(ok(X1), ok(X2)) -> FST(X1, X2)
FROM(mark(X)) -> FROM(X)
FROM(ok(X)) -> FROM(X)
ADD(mark(X1), X2) -> ADD(X1, X2)
ADD(X1, mark(X2)) -> ADD(X1, X2)
ADD(ok(X1), ok(X2)) -> ADD(X1, X2)
LEN(mark(X)) -> LEN(X)
LEN(ok(X)) -> LEN(X)
PROPER(s(X)) -> S(proper(X))
PROPER(s(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(fst(X1, X2)) -> FST(proper(X1), proper(X2))
PROPER(fst(X1, X2)) -> PROPER(X1)
PROPER(fst(X1, X2)) -> PROPER(X2)
PROPER(from(X)) -> FROM(proper(X))
PROPER(from(X)) -> PROPER(X)
PROPER(add(X1, X2)) -> ADD(proper(X1), proper(X2))
PROPER(add(X1, X2)) -> PROPER(X1)
PROPER(add(X1, X2)) -> PROPER(X2)
PROPER(len(X)) -> LEN(proper(X))
PROPER(len(X)) -> PROPER(X)
S(ok(X)) -> S(X)
TOP(mark(X)) -> TOP(proper(X))
TOP(mark(X)) -> PROPER(X)
TOP(ok(X)) -> TOP(active(X))
TOP(ok(X)) -> ACTIVE(X)

Furthermore, R contains nine SCCs. 


   R
     ↳DPs
       →DP Problem 1
         ↳Size-Change Principle
       →DP Problem 2
         ↳SCP
       →DP Problem 3
         ↳SCP
       →DP Problem 4
         ↳SCP
       →DP Problem 5
         ↳SCP
       →DP Problem 6
         ↳SCP
       →DP Problem 7
         ↳SCP
       →DP Problem 8
         ↳SCP
       →DP Problem 9
         ↳Neg POLO


Dependency Pairs:

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


Rules:


active(fst(0, Z)) -> mark(nil)
active(fst(s(X), cons(Y, Z))) -> mark(cons(Y, fst(X, Z)))
active(from(X)) -> mark(cons(X, from(s(X))))
active(add(0, X)) -> mark(X)
active(add(s(X), Y)) -> mark(s(add(X, Y)))
active(len(nil)) -> mark(0)
active(len(cons(X, Z))) -> mark(s(len(Z)))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(fst(X1, X2)) -> fst(active(X1), X2)
active(fst(X1, X2)) -> fst(X1, active(X2))
active(from(X)) -> from(active(X))
active(add(X1, X2)) -> add(active(X1), X2)
active(add(X1, X2)) -> add(X1, active(X2))
active(len(X)) -> len(active(X))
cons(mark(X1), X2) -> mark(cons(X1, X2))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
fst(mark(X1), X2) -> mark(fst(X1, X2))
fst(X1, mark(X2)) -> mark(fst(X1, X2))
fst(ok(X1), ok(X2)) -> ok(fst(X1, X2))
from(mark(X)) -> mark(from(X))
from(ok(X)) -> ok(from(X))
add(mark(X1), X2) -> mark(add(X1, X2))
add(X1, mark(X2)) -> mark(add(X1, X2))
add(ok(X1), ok(X2)) -> ok(add(X1, X2))
len(mark(X)) -> mark(len(X))
len(ok(X)) -> ok(len(X))
proper(0) -> ok(0)
proper(s(X)) -> s(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(fst(X1, X2)) -> fst(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(add(X1, X2)) -> add(proper(X1), proper(X2))
proper(len(X)) -> len(proper(X))
s(ok(X)) -> ok(s(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))





We number the DPs as follows:
  1. CONS(ok(X1), ok(X2)) -> CONS(X1, X2)
  2. CONS(mark(X1), X2) -> CONS(X1, X2)
and get the following Size-Change Graph(s):
{2, 1} , {2, 1}
1>1
2>2
{2, 1} , {2, 1}
1>1
2=2

which lead(s) to this/these maximal multigraph(s):
{2, 1} , {2, 1}
1>1
2>2
{2, 1} , {2, 1}
1>1
2=2

DP: empty set
Oriented Rules: none

We used the order Homeomorphic Embedding Order with Non-Strict Precedence.
trivial

with Argument Filtering System:
mark(x1) -> mark(x1)
ok(x1) -> ok(x1)

We obtain no new DP problems. 


   R
     ↳DPs
       →DP Problem 1
         ↳SCP
       →DP Problem 2
         ↳Size-Change Principle
       →DP Problem 3
         ↳SCP
       →DP Problem 4
         ↳SCP
       →DP Problem 5
         ↳SCP
       →DP Problem 6
         ↳SCP
       →DP Problem 7
         ↳SCP
       →DP Problem 8
         ↳SCP
       →DP Problem 9
         ↳Neg POLO


Dependency Pairs:

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


Rules:


active(fst(0, Z)) -> mark(nil)
active(fst(s(X), cons(Y, Z))) -> mark(cons(Y, fst(X, Z)))
active(from(X)) -> mark(cons(X, from(s(X))))
active(add(0, X)) -> mark(X)
active(add(s(X), Y)) -> mark(s(add(X, Y)))
active(len(nil)) -> mark(0)
active(len(cons(X, Z))) -> mark(s(len(Z)))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(fst(X1, X2)) -> fst(active(X1), X2)
active(fst(X1, X2)) -> fst(X1, active(X2))
active(from(X)) -> from(active(X))
active(add(X1, X2)) -> add(active(X1), X2)
active(add(X1, X2)) -> add(X1, active(X2))
active(len(X)) -> len(active(X))
cons(mark(X1), X2) -> mark(cons(X1, X2))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
fst(mark(X1), X2) -> mark(fst(X1, X2))
fst(X1, mark(X2)) -> mark(fst(X1, X2))
fst(ok(X1), ok(X2)) -> ok(fst(X1, X2))
from(mark(X)) -> mark(from(X))
from(ok(X)) -> ok(from(X))
add(mark(X1), X2) -> mark(add(X1, X2))
add(X1, mark(X2)) -> mark(add(X1, X2))
add(ok(X1), ok(X2)) -> ok(add(X1, X2))
len(mark(X)) -> mark(len(X))
len(ok(X)) -> ok(len(X))
proper(0) -> ok(0)
proper(s(X)) -> s(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(fst(X1, X2)) -> fst(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(add(X1, X2)) -> add(proper(X1), proper(X2))
proper(len(X)) -> len(proper(X))
s(ok(X)) -> ok(s(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))





We number the DPs as follows:
  1. FST(ok(X1), ok(X2)) -> FST(X1, X2)
  2. FST(X1, mark(X2)) -> FST(X1, X2)
  3. FST(mark(X1), X2) -> FST(X1, X2)
and get the following Size-Change Graph(s):
{3, 2, 1} , {3, 2, 1}
1>1
2>2
{3, 2, 1} , {3, 2, 1}
1=1
2>2
{3, 2, 1} , {3, 2, 1}
1>1
2=2

which lead(s) to this/these maximal multigraph(s):
{3, 2, 1} , {3, 2, 1}
1>1
2>2
{3, 2, 1} , {3, 2, 1}
1>1
2=2
{3, 2, 1} , {3, 2, 1}
1=1
2>2

DP: empty set
Oriented Rules: none

We used the order Homeomorphic Embedding Order with Non-Strict Precedence.
trivial

with Argument Filtering System:
mark(x1) -> mark(x1)
ok(x1) -> ok(x1)

We obtain no new DP problems. 


   R
     ↳DPs
       →DP Problem 1
         ↳SCP
       →DP Problem 2
         ↳SCP
       →DP Problem 3
         ↳Size-Change Principle
       →DP Problem 4
         ↳SCP
       →DP Problem 5
         ↳SCP
       →DP Problem 6
         ↳SCP
       →DP Problem 7
         ↳SCP
       →DP Problem 8
         ↳SCP
       →DP Problem 9
         ↳Neg POLO


Dependency Pairs:

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


Rules:


active(fst(0, Z)) -> mark(nil)
active(fst(s(X), cons(Y, Z))) -> mark(cons(Y, fst(X, Z)))
active(from(X)) -> mark(cons(X, from(s(X))))
active(add(0, X)) -> mark(X)
active(add(s(X), Y)) -> mark(s(add(X, Y)))
active(len(nil)) -> mark(0)
active(len(cons(X, Z))) -> mark(s(len(Z)))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(fst(X1, X2)) -> fst(active(X1), X2)
active(fst(X1, X2)) -> fst(X1, active(X2))
active(from(X)) -> from(active(X))
active(add(X1, X2)) -> add(active(X1), X2)
active(add(X1, X2)) -> add(X1, active(X2))
active(len(X)) -> len(active(X))
cons(mark(X1), X2) -> mark(cons(X1, X2))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
fst(mark(X1), X2) -> mark(fst(X1, X2))
fst(X1, mark(X2)) -> mark(fst(X1, X2))
fst(ok(X1), ok(X2)) -> ok(fst(X1, X2))
from(mark(X)) -> mark(from(X))
from(ok(X)) -> ok(from(X))
add(mark(X1), X2) -> mark(add(X1, X2))
add(X1, mark(X2)) -> mark(add(X1, X2))
add(ok(X1), ok(X2)) -> ok(add(X1, X2))
len(mark(X)) -> mark(len(X))
len(ok(X)) -> ok(len(X))
proper(0) -> ok(0)
proper(s(X)) -> s(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(fst(X1, X2)) -> fst(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(add(X1, X2)) -> add(proper(X1), proper(X2))
proper(len(X)) -> len(proper(X))
s(ok(X)) -> ok(s(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))





We number the DPs as follows:
  1. FROM(ok(X)) -> FROM(X)
  2. FROM(mark(X)) -> FROM(X)
and get the following Size-Change Graph(s):
{2, 1} , {2, 1}
1>1

which lead(s) to this/these maximal multigraph(s):
{2, 1} , {2, 1}
1>1

DP: empty set
Oriented Rules: none

We used the order Homeomorphic Embedding Order with Non-Strict Precedence.
trivial

with Argument Filtering System:
mark(x1) -> mark(x1)
ok(x1) -> ok(x1)

We obtain no new DP problems. 


   R
     ↳DPs
       →DP Problem 1
         ↳SCP
       →DP Problem 2
         ↳SCP
       →DP Problem 3
         ↳SCP
       →DP Problem 4
         ↳Size-Change Principle
       →DP Problem 5
         ↳SCP
       →DP Problem 6
         ↳SCP
       →DP Problem 7
         ↳SCP
       →DP Problem 8
         ↳SCP
       →DP Problem 9
         ↳Neg POLO


Dependency Pair:

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


Rules:


active(fst(0, Z)) -> mark(nil)
active(fst(s(X), cons(Y, Z))) -> mark(cons(Y, fst(X, Z)))
active(from(X)) -> mark(cons(X, from(s(X))))
active(add(0, X)) -> mark(X)
active(add(s(X), Y)) -> mark(s(add(X, Y)))
active(len(nil)) -> mark(0)
active(len(cons(X, Z))) -> mark(s(len(Z)))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(fst(X1, X2)) -> fst(active(X1), X2)
active(fst(X1, X2)) -> fst(X1, active(X2))
active(from(X)) -> from(active(X))
active(add(X1, X2)) -> add(active(X1), X2)
active(add(X1, X2)) -> add(X1, active(X2))
active(len(X)) -> len(active(X))
cons(mark(X1), X2) -> mark(cons(X1, X2))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
fst(mark(X1), X2) -> mark(fst(X1, X2))
fst(X1, mark(X2)) -> mark(fst(X1, X2))
fst(ok(X1), ok(X2)) -> ok(fst(X1, X2))
from(mark(X)) -> mark(from(X))
from(ok(X)) -> ok(from(X))
add(mark(X1), X2) -> mark(add(X1, X2))
add(X1, mark(X2)) -> mark(add(X1, X2))
add(ok(X1), ok(X2)) -> ok(add(X1, X2))
len(mark(X)) -> mark(len(X))
len(ok(X)) -> ok(len(X))
proper(0) -> ok(0)
proper(s(X)) -> s(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(fst(X1, X2)) -> fst(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(add(X1, X2)) -> add(proper(X1), proper(X2))
proper(len(X)) -> len(proper(X))
s(ok(X)) -> ok(s(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))





We number the DPs as follows:
  1. S(ok(X)) -> S(X)
and get the following Size-Change Graph(s):
{1} , {1}
1>1

which lead(s) to this/these maximal multigraph(s):
{1} , {1}
1>1

DP: empty set
Oriented Rules: none

We used the order Homeomorphic Embedding Order with Non-Strict Precedence.
trivial

with Argument Filtering System:
ok(x1) -> ok(x1)

We obtain no new DP problems. 


   R
     ↳DPs
       →DP Problem 1
         ↳SCP
       →DP Problem 2
         ↳SCP
       →DP Problem 3
         ↳SCP
       →DP Problem 4
         ↳SCP
       →DP Problem 5
         ↳Size-Change Principle
       →DP Problem 6
         ↳SCP
       →DP Problem 7
         ↳SCP
       →DP Problem 8
         ↳SCP
       →DP Problem 9
         ↳Neg POLO


Dependency Pairs:

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


Rules:


active(fst(0, Z)) -> mark(nil)
active(fst(s(X), cons(Y, Z))) -> mark(cons(Y, fst(X, Z)))
active(from(X)) -> mark(cons(X, from(s(X))))
active(add(0, X)) -> mark(X)
active(add(s(X), Y)) -> mark(s(add(X, Y)))
active(len(nil)) -> mark(0)
active(len(cons(X, Z))) -> mark(s(len(Z)))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(fst(X1, X2)) -> fst(active(X1), X2)
active(fst(X1, X2)) -> fst(X1, active(X2))
active(from(X)) -> from(active(X))
active(add(X1, X2)) -> add(active(X1), X2)
active(add(X1, X2)) -> add(X1, active(X2))
active(len(X)) -> len(active(X))
cons(mark(X1), X2) -> mark(cons(X1, X2))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
fst(mark(X1), X2) -> mark(fst(X1, X2))
fst(X1, mark(X2)) -> mark(fst(X1, X2))
fst(ok(X1), ok(X2)) -> ok(fst(X1, X2))
from(mark(X)) -> mark(from(X))
from(ok(X)) -> ok(from(X))
add(mark(X1), X2) -> mark(add(X1, X2))
add(X1, mark(X2)) -> mark(add(X1, X2))
add(ok(X1), ok(X2)) -> ok(add(X1, X2))
len(mark(X)) -> mark(len(X))
len(ok(X)) -> ok(len(X))
proper(0) -> ok(0)
proper(s(X)) -> s(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(fst(X1, X2)) -> fst(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(add(X1, X2)) -> add(proper(X1), proper(X2))
proper(len(X)) -> len(proper(X))
s(ok(X)) -> ok(s(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))





We number the DPs as follows:
  1. ADD(ok(X1), ok(X2)) -> ADD(X1, X2)
  2. ADD(X1, mark(X2)) -> ADD(X1, X2)
  3. ADD(mark(X1), X2) -> ADD(X1, X2)
and get the following Size-Change Graph(s):
{3, 2, 1} , {3, 2, 1}
1>1
2>2
{3, 2, 1} , {3, 2, 1}
1=1
2>2
{3, 2, 1} , {3, 2, 1}
1>1
2=2

which lead(s) to this/these maximal multigraph(s):
{3, 2, 1} , {3, 2, 1}
1>1
2>2
{3, 2, 1} , {3, 2, 1}
1>1
2=2
{3, 2, 1} , {3, 2, 1}
1=1
2>2

DP: empty set
Oriented Rules: none

We used the order Homeomorphic Embedding Order with Non-Strict Precedence.
trivial

with Argument Filtering System:
mark(x1) -> mark(x1)
ok(x1) -> ok(x1)

We obtain no new DP problems. 


   R
     ↳DPs
       →DP Problem 1
         ↳SCP
       →DP Problem 2
         ↳SCP
       →DP Problem 3
         ↳SCP
       →DP Problem 4
         ↳SCP
       →DP Problem 5
         ↳SCP
       →DP Problem 6
         ↳Size-Change Principle
       →DP Problem 7
         ↳SCP
       →DP Problem 8
         ↳SCP
       →DP Problem 9
         ↳Neg POLO


Dependency Pairs:

LEN(ok(X)) -> LEN(X)
LEN(mark(X)) -> LEN(X)


Rules:


active(fst(0, Z)) -> mark(nil)
active(fst(s(X), cons(Y, Z))) -> mark(cons(Y, fst(X, Z)))
active(from(X)) -> mark(cons(X, from(s(X))))
active(add(0, X)) -> mark(X)
active(add(s(X), Y)) -> mark(s(add(X, Y)))
active(len(nil)) -> mark(0)
active(len(cons(X, Z))) -> mark(s(len(Z)))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(fst(X1, X2)) -> fst(active(X1), X2)
active(fst(X1, X2)) -> fst(X1, active(X2))
active(from(X)) -> from(active(X))
active(add(X1, X2)) -> add(active(X1), X2)
active(add(X1, X2)) -> add(X1, active(X2))
active(len(X)) -> len(active(X))
cons(mark(X1), X2) -> mark(cons(X1, X2))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
fst(mark(X1), X2) -> mark(fst(X1, X2))
fst(X1, mark(X2)) -> mark(fst(X1, X2))
fst(ok(X1), ok(X2)) -> ok(fst(X1, X2))
from(mark(X)) -> mark(from(X))
from(ok(X)) -> ok(from(X))
add(mark(X1), X2) -> mark(add(X1, X2))
add(X1, mark(X2)) -> mark(add(X1, X2))
add(ok(X1), ok(X2)) -> ok(add(X1, X2))
len(mark(X)) -> mark(len(X))
len(ok(X)) -> ok(len(X))
proper(0) -> ok(0)
proper(s(X)) -> s(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(fst(X1, X2)) -> fst(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(add(X1, X2)) -> add(proper(X1), proper(X2))
proper(len(X)) -> len(proper(X))
s(ok(X)) -> ok(s(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))





We number the DPs as follows:
  1. LEN(ok(X)) -> LEN(X)
  2. LEN(mark(X)) -> LEN(X)
and get the following Size-Change Graph(s):
{2, 1} , {2, 1}
1>1

which lead(s) to this/these maximal multigraph(s):
{2, 1} , {2, 1}
1>1

DP: empty set
Oriented Rules: none

We used the order Homeomorphic Embedding Order with Non-Strict Precedence.
trivial

with Argument Filtering System:
mark(x1) -> mark(x1)
ok(x1) -> ok(x1)

We obtain no new DP problems. 


   R
     ↳DPs
       →DP Problem 1
         ↳SCP
       →DP Problem 2
         ↳SCP
       →DP Problem 3
         ↳SCP
       →DP Problem 4
         ↳SCP
       →DP Problem 5
         ↳SCP
       →DP Problem 6
         ↳SCP
       →DP Problem 7
         ↳Size-Change Principle
       →DP Problem 8
         ↳SCP
       →DP Problem 9
         ↳Neg POLO


Dependency Pairs:

ACTIVE(len(X)) -> ACTIVE(X)
ACTIVE(add(X1, X2)) -> ACTIVE(X2)
ACTIVE(add(X1, X2)) -> ACTIVE(X1)
ACTIVE(from(X)) -> ACTIVE(X)
ACTIVE(fst(X1, X2)) -> ACTIVE(X2)
ACTIVE(fst(X1, X2)) -> ACTIVE(X1)
ACTIVE(cons(X1, X2)) -> ACTIVE(X1)


Rules:


active(fst(0, Z)) -> mark(nil)
active(fst(s(X), cons(Y, Z))) -> mark(cons(Y, fst(X, Z)))
active(from(X)) -> mark(cons(X, from(s(X))))
active(add(0, X)) -> mark(X)
active(add(s(X), Y)) -> mark(s(add(X, Y)))
active(len(nil)) -> mark(0)
active(len(cons(X, Z))) -> mark(s(len(Z)))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(fst(X1, X2)) -> fst(active(X1), X2)
active(fst(X1, X2)) -> fst(X1, active(X2))
active(from(X)) -> from(active(X))
active(add(X1, X2)) -> add(active(X1), X2)
active(add(X1, X2)) -> add(X1, active(X2))
active(len(X)) -> len(active(X))
cons(mark(X1), X2) -> mark(cons(X1, X2))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
fst(mark(X1), X2) -> mark(fst(X1, X2))
fst(X1, mark(X2)) -> mark(fst(X1, X2))
fst(ok(X1), ok(X2)) -> ok(fst(X1, X2))
from(mark(X)) -> mark(from(X))
from(ok(X)) -> ok(from(X))
add(mark(X1), X2) -> mark(add(X1, X2))
add(X1, mark(X2)) -> mark(add(X1, X2))
add(ok(X1), ok(X2)) -> ok(add(X1, X2))
len(mark(X)) -> mark(len(X))
len(ok(X)) -> ok(len(X))
proper(0) -> ok(0)
proper(s(X)) -> s(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(fst(X1, X2)) -> fst(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(add(X1, X2)) -> add(proper(X1), proper(X2))
proper(len(X)) -> len(proper(X))
s(ok(X)) -> ok(s(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))





We number the DPs as follows:
  1. ACTIVE(len(X)) -> ACTIVE(X)
  2. ACTIVE(add(X1, X2)) -> ACTIVE(X2)
  3. ACTIVE(add(X1, X2)) -> ACTIVE(X1)
  4. ACTIVE(from(X)) -> ACTIVE(X)
  5. ACTIVE(fst(X1, X2)) -> ACTIVE(X2)
  6. ACTIVE(fst(X1, X2)) -> ACTIVE(X1)
  7. ACTIVE(cons(X1, X2)) -> ACTIVE(X1)
and get the following Size-Change Graph(s):
{7, 6, 5, 4, 3, 2, 1} , {7, 6, 5, 4, 3, 2, 1}
1>1

which lead(s) to this/these maximal multigraph(s):
{7, 6, 5, 4, 3, 2, 1} , {7, 6, 5, 4, 3, 2, 1}
1>1

DP: empty set
Oriented Rules: none

We used the order Homeomorphic Embedding Order with Non-Strict Precedence.
trivial

with Argument Filtering System:
from(x1) -> from(x1)
len(x1) -> len(x1)
cons(x1, x2) -> cons(x1, x2)
fst(x1, x2) -> fst(x1, x2)
add(x1, x2) -> add(x1, x2)

We obtain no new DP problems. 


   R
     ↳DPs
       →DP Problem 1
         ↳SCP
       →DP Problem 2
         ↳SCP
       →DP Problem 3
         ↳SCP
       →DP Problem 4
         ↳SCP
       →DP Problem 5
         ↳SCP
       →DP Problem 6
         ↳SCP
       →DP Problem 7
         ↳SCP
       →DP Problem 8
         ↳Size-Change Principle
       →DP Problem 9
         ↳Neg POLO


Dependency Pairs:

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


Rules:


active(fst(0, Z)) -> mark(nil)
active(fst(s(X), cons(Y, Z))) -> mark(cons(Y, fst(X, Z)))
active(from(X)) -> mark(cons(X, from(s(X))))
active(add(0, X)) -> mark(X)
active(add(s(X), Y)) -> mark(s(add(X, Y)))
active(len(nil)) -> mark(0)
active(len(cons(X, Z))) -> mark(s(len(Z)))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(fst(X1, X2)) -> fst(active(X1), X2)
active(fst(X1, X2)) -> fst(X1, active(X2))
active(from(X)) -> from(active(X))
active(add(X1, X2)) -> add(active(X1), X2)
active(add(X1, X2)) -> add(X1, active(X2))
active(len(X)) -> len(active(X))
cons(mark(X1), X2) -> mark(cons(X1, X2))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
fst(mark(X1), X2) -> mark(fst(X1, X2))
fst(X1, mark(X2)) -> mark(fst(X1, X2))
fst(ok(X1), ok(X2)) -> ok(fst(X1, X2))
from(mark(X)) -> mark(from(X))
from(ok(X)) -> ok(from(X))
add(mark(X1), X2) -> mark(add(X1, X2))
add(X1, mark(X2)) -> mark(add(X1, X2))
add(ok(X1), ok(X2)) -> ok(add(X1, X2))
len(mark(X)) -> mark(len(X))
len(ok(X)) -> ok(len(X))
proper(0) -> ok(0)
proper(s(X)) -> s(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(fst(X1, X2)) -> fst(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(add(X1, X2)) -> add(proper(X1), proper(X2))
proper(len(X)) -> len(proper(X))
s(ok(X)) -> ok(s(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))





We number the DPs as follows:
  1. PROPER(len(X)) -> PROPER(X)
  2. PROPER(add(X1, X2)) -> PROPER(X2)
  3. PROPER(add(X1, X2)) -> PROPER(X1)
  4. PROPER(from(X)) -> PROPER(X)
  5. PROPER(fst(X1, X2)) -> PROPER(X2)
  6. PROPER(fst(X1, X2)) -> PROPER(X1)
  7. PROPER(cons(X1, X2)) -> PROPER(X2)
  8. PROPER(cons(X1, X2)) -> PROPER(X1)
  9. PROPER(s(X)) -> PROPER(X)
and get the following Size-Change Graph(s):
{9, 8, 7, 6, 5, 4, 3, 2, 1} , {9, 8, 7, 6, 5, 4, 3, 2, 1}
1>1

which lead(s) to this/these maximal multigraph(s):
{9, 8, 7, 6, 5, 4, 3, 2, 1} , {9, 8, 7, 6, 5, 4, 3, 2, 1}
1>1

DP: empty set
Oriented Rules: none

We used the order Homeomorphic Embedding Order with Non-Strict Precedence.
trivial

with Argument Filtering System:
from(x1) -> from(x1)
cons(x1, x2) -> cons(x1, x2)
len(x1) -> len(x1)
fst(x1, x2) -> fst(x1, x2)
s(x1) -> s(x1)
add(x1, x2) -> add(x1, x2)

We obtain no new DP problems. 


   R
     ↳DPs
       →DP Problem 1
         ↳SCP
       →DP Problem 2
         ↳SCP
       →DP Problem 3
         ↳SCP
       →DP Problem 4
         ↳SCP
       →DP Problem 5
         ↳SCP
       →DP Problem 6
         ↳SCP
       →DP Problem 7
         ↳SCP
       →DP Problem 8
         ↳SCP
       →DP Problem 9
         ↳Negative Polynomial Order


Dependency Pairs:

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


Rules:


active(fst(0, Z)) -> mark(nil)
active(fst(s(X), cons(Y, Z))) -> mark(cons(Y, fst(X, Z)))
active(from(X)) -> mark(cons(X, from(s(X))))
active(add(0, X)) -> mark(X)
active(add(s(X), Y)) -> mark(s(add(X, Y)))
active(len(nil)) -> mark(0)
active(len(cons(X, Z))) -> mark(s(len(Z)))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(fst(X1, X2)) -> fst(active(X1), X2)
active(fst(X1, X2)) -> fst(X1, active(X2))
active(from(X)) -> from(active(X))
active(add(X1, X2)) -> add(active(X1), X2)
active(add(X1, X2)) -> add(X1, active(X2))
active(len(X)) -> len(active(X))
cons(mark(X1), X2) -> mark(cons(X1, X2))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
fst(mark(X1), X2) -> mark(fst(X1, X2))
fst(X1, mark(X2)) -> mark(fst(X1, X2))
fst(ok(X1), ok(X2)) -> ok(fst(X1, X2))
from(mark(X)) -> mark(from(X))
from(ok(X)) -> ok(from(X))
add(mark(X1), X2) -> mark(add(X1, X2))
add(X1, mark(X2)) -> mark(add(X1, X2))
add(ok(X1), ok(X2)) -> ok(add(X1, X2))
len(mark(X)) -> mark(len(X))
len(ok(X)) -> ok(len(X))
proper(0) -> ok(0)
proper(s(X)) -> s(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(fst(X1, X2)) -> fst(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(add(X1, X2)) -> add(proper(X1), proper(X2))
proper(len(X)) -> len(proper(X))
s(ok(X)) -> ok(s(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))





The following Dependency Pair can be strictly oriented using the given order.

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


Moreover, the following usable rules (regarding the implicit AFS) are oriented.

active(fst(0, Z)) -> mark(nil)
active(fst(s(X), cons(Y, Z))) -> mark(cons(Y, fst(X, Z)))
active(from(X)) -> mark(cons(X, from(s(X))))
active(add(0, X)) -> mark(X)
active(add(s(X), Y)) -> mark(s(add(X, Y)))
active(len(nil)) -> mark(0)
active(len(cons(X, Z))) -> mark(s(len(Z)))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(fst(X1, X2)) -> fst(active(X1), X2)
active(fst(X1, X2)) -> fst(X1, active(X2))
active(from(X)) -> from(active(X))
active(add(X1, X2)) -> add(active(X1), X2)
active(add(X1, X2)) -> add(X1, active(X2))
active(len(X)) -> len(active(X))
proper(0) -> ok(0)
proper(s(X)) -> s(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(fst(X1, X2)) -> fst(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(add(X1, X2)) -> add(proper(X1), proper(X2))
proper(len(X)) -> len(proper(X))
cons(mark(X1), X2) -> mark(cons(X1, X2))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
fst(mark(X1), X2) -> mark(fst(X1, X2))
fst(X1, mark(X2)) -> mark(fst(X1, X2))
fst(ok(X1), ok(X2)) -> ok(fst(X1, X2))
from(mark(X)) -> mark(from(X))
from(ok(X)) -> ok(from(X))
add(mark(X1), X2) -> mark(add(X1, X2))
add(X1, mark(X2)) -> mark(add(X1, X2))
add(ok(X1), ok(X2)) -> ok(add(X1, X2))
len(mark(X)) -> mark(len(X))
len(ok(X)) -> ok(len(X))
s(ok(X)) -> ok(s(X))


Used ordering:
Polynomial Order with Interpretation:

POL( TOP(x1) ) = x1

POL( mark(x1) ) = x1 + 1

POL( proper(x1) ) = x1

POL( ok(x1) ) = x1

POL( active(x1) ) = x1

POL( fst(x1, x2) ) = x1 + x2 + 1

POL( 0 ) = 0

POL( nil ) = 0

POL( s(x1) ) = 0

POL( cons(x1, x2) ) = x1

POL( from(x1) ) = x1 + 1

POL( add(x1, x2) ) = x1 + x2 + 1

POL( len(x1) ) = x1 + 1


This results in one new DP problem. 


   R
     ↳DPs
       →DP Problem 1
         ↳SCP
       →DP Problem 2
         ↳SCP
       →DP Problem 3
         ↳SCP
       →DP Problem 4
         ↳SCP
       →DP Problem 5
         ↳SCP
       →DP Problem 6
         ↳SCP
       →DP Problem 7
         ↳SCP
       →DP Problem 8
         ↳SCP
       →DP Problem 9
         ↳Neg POLO
           →DP Problem 10
             ↳Negative Polynomial Order


Dependency Pair:

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


Rules:


active(fst(0, Z)) -> mark(nil)
active(fst(s(X), cons(Y, Z))) -> mark(cons(Y, fst(X, Z)))
active(from(X)) -> mark(cons(X, from(s(X))))
active(add(0, X)) -> mark(X)
active(add(s(X), Y)) -> mark(s(add(X, Y)))
active(len(nil)) -> mark(0)
active(len(cons(X, Z))) -> mark(s(len(Z)))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(fst(X1, X2)) -> fst(active(X1), X2)
active(fst(X1, X2)) -> fst(X1, active(X2))
active(from(X)) -> from(active(X))
active(add(X1, X2)) -> add(active(X1), X2)
active(add(X1, X2)) -> add(X1, active(X2))
active(len(X)) -> len(active(X))
cons(mark(X1), X2) -> mark(cons(X1, X2))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
fst(mark(X1), X2) -> mark(fst(X1, X2))
fst(X1, mark(X2)) -> mark(fst(X1, X2))
fst(ok(X1), ok(X2)) -> ok(fst(X1, X2))
from(mark(X)) -> mark(from(X))
from(ok(X)) -> ok(from(X))
add(mark(X1), X2) -> mark(add(X1, X2))
add(X1, mark(X2)) -> mark(add(X1, X2))
add(ok(X1), ok(X2)) -> ok(add(X1, X2))
len(mark(X)) -> mark(len(X))
len(ok(X)) -> ok(len(X))
proper(0) -> ok(0)
proper(s(X)) -> s(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(fst(X1, X2)) -> fst(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(add(X1, X2)) -> add(proper(X1), proper(X2))
proper(len(X)) -> len(proper(X))
s(ok(X)) -> ok(s(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))





The following Dependency Pair can be strictly oriented using the given order.

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


Moreover, the following usable rules (regarding the implicit AFS) are oriented.

active(fst(0, Z)) -> mark(nil)
active(fst(s(X), cons(Y, Z))) -> mark(cons(Y, fst(X, Z)))
active(from(X)) -> mark(cons(X, from(s(X))))
active(add(0, X)) -> mark(X)
active(add(s(X), Y)) -> mark(s(add(X, Y)))
active(len(nil)) -> mark(0)
active(len(cons(X, Z))) -> mark(s(len(Z)))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(fst(X1, X2)) -> fst(active(X1), X2)
active(fst(X1, X2)) -> fst(X1, active(X2))
active(from(X)) -> from(active(X))
active(add(X1, X2)) -> add(active(X1), X2)
active(add(X1, X2)) -> add(X1, active(X2))
active(len(X)) -> len(active(X))
cons(mark(X1), X2) -> mark(cons(X1, X2))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
fst(mark(X1), X2) -> mark(fst(X1, X2))
fst(X1, mark(X2)) -> mark(fst(X1, X2))
fst(ok(X1), ok(X2)) -> ok(fst(X1, X2))
from(mark(X)) -> mark(from(X))
from(ok(X)) -> ok(from(X))
add(mark(X1), X2) -> mark(add(X1, X2))
add(X1, mark(X2)) -> mark(add(X1, X2))
add(ok(X1), ok(X2)) -> ok(add(X1, X2))
len(mark(X)) -> mark(len(X))
len(ok(X)) -> ok(len(X))
s(ok(X)) -> ok(s(X))


Used ordering:
Polynomial Order with Interpretation:

POL( TOP(x1) ) = x1

POL( ok(x1) ) = x1 + 1

POL( active(x1) ) = x1

POL( fst(x1, x2) ) = x2

POL( mark(x1) ) = 0

POL( cons(x1, x2) ) = x2

POL( from(x1) ) = x1

POL( add(x1, x2) ) = x2

POL( len(x1) ) = x1

POL( s(x1) ) = x1


This results in one new DP problem. 


   R
     ↳DPs
       →DP Problem 1
         ↳SCP
       →DP Problem 2
         ↳SCP
       →DP Problem 3
         ↳SCP
       →DP Problem 4
         ↳SCP
       →DP Problem 5
         ↳SCP
       →DP Problem 6
         ↳SCP
       →DP Problem 7
         ↳SCP
       →DP Problem 8
         ↳SCP
       →DP Problem 9
         ↳Neg POLO
           →DP Problem 10
             ↳Neg POLO
             ...
               →DP Problem 11
                 ↳Dependency Graph


Dependency Pair:


Rules:


active(fst(0, Z)) -> mark(nil)
active(fst(s(X), cons(Y, Z))) -> mark(cons(Y, fst(X, Z)))
active(from(X)) -> mark(cons(X, from(s(X))))
active(add(0, X)) -> mark(X)
active(add(s(X), Y)) -> mark(s(add(X, Y)))
active(len(nil)) -> mark(0)
active(len(cons(X, Z))) -> mark(s(len(Z)))
active(cons(X1, X2)) -> cons(active(X1), X2)
active(fst(X1, X2)) -> fst(active(X1), X2)
active(fst(X1, X2)) -> fst(X1, active(X2))
active(from(X)) -> from(active(X))
active(add(X1, X2)) -> add(active(X1), X2)
active(add(X1, X2)) -> add(X1, active(X2))
active(len(X)) -> len(active(X))
cons(mark(X1), X2) -> mark(cons(X1, X2))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
fst(mark(X1), X2) -> mark(fst(X1, X2))
fst(X1, mark(X2)) -> mark(fst(X1, X2))
fst(ok(X1), ok(X2)) -> ok(fst(X1, X2))
from(mark(X)) -> mark(from(X))
from(ok(X)) -> ok(from(X))
add(mark(X1), X2) -> mark(add(X1, X2))
add(X1, mark(X2)) -> mark(add(X1, X2))
add(ok(X1), ok(X2)) -> ok(add(X1, X2))
len(mark(X)) -> mark(len(X))
len(ok(X)) -> ok(len(X))
proper(0) -> ok(0)
proper(s(X)) -> s(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(fst(X1, X2)) -> fst(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(add(X1, X2)) -> add(proper(X1), proper(X2))
proper(len(X)) -> len(proper(X))
s(ok(X)) -> ok(s(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))





Using the Dependency Graph resulted in no new DP problems.

Termination of R successfully shown.
Duration:
0:08 minutes