Term Rewriting System R:
[X, Y, X1, X2]
active(nats) -> mark(adx(zeros))
active(zeros) -> mark(cons(0, zeros))
active(incr(cons(X, Y))) -> mark(cons(s(X), incr(Y)))
active(adx(cons(X, Y))) -> mark(incr(cons(X, adx(Y))))
active(hd(cons(X, Y))) -> mark(X)
active(tl(cons(X, Y))) -> mark(Y)
active(adx(X)) -> adx(active(X))
active(incr(X)) -> incr(active(X))
active(hd(X)) -> hd(active(X))
active(tl(X)) -> tl(active(X))
adx(mark(X)) -> mark(adx(X))
adx(ok(X)) -> ok(adx(X))
incr(mark(X)) -> mark(incr(X))
incr(ok(X)) -> ok(incr(X))
hd(mark(X)) -> mark(hd(X))
hd(ok(X)) -> ok(hd(X))
tl(mark(X)) -> mark(tl(X))
tl(ok(X)) -> ok(tl(X))
proper(nats) -> ok(nats)
proper(adx(X)) -> adx(proper(X))
proper(zeros) -> ok(zeros)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(0) -> ok(0)
proper(incr(X)) -> incr(proper(X))
proper(s(X)) -> s(proper(X))
proper(hd(X)) -> hd(proper(X))
proper(tl(X)) -> tl(proper(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
s(ok(X)) -> ok(s(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(nats) -> ADX(zeros)
ACTIVE(zeros) -> CONS(0, zeros)
ACTIVE(incr(cons(X, Y))) -> CONS(s(X), incr(Y))
ACTIVE(incr(cons(X, Y))) -> S(X)
ACTIVE(incr(cons(X, Y))) -> INCR(Y)
ACTIVE(adx(cons(X, Y))) -> INCR(cons(X, adx(Y)))
ACTIVE(adx(cons(X, Y))) -> CONS(X, adx(Y))
ACTIVE(adx(cons(X, Y))) -> ADX(Y)
ACTIVE(adx(X)) -> ADX(active(X))
ACTIVE(adx(X)) -> ACTIVE(X)
ACTIVE(incr(X)) -> INCR(active(X))
ACTIVE(incr(X)) -> ACTIVE(X)
ACTIVE(hd(X)) -> HD(active(X))
ACTIVE(hd(X)) -> ACTIVE(X)
ACTIVE(tl(X)) -> TL(active(X))
ACTIVE(tl(X)) -> ACTIVE(X)
ADX(mark(X)) -> ADX(X)
ADX(ok(X)) -> ADX(X)
INCR(mark(X)) -> INCR(X)
INCR(ok(X)) -> INCR(X)
HD(mark(X)) -> HD(X)
HD(ok(X)) -> HD(X)
TL(mark(X)) -> TL(X)
TL(ok(X)) -> TL(X)
PROPER(adx(X)) -> ADX(proper(X))
PROPER(adx(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(incr(X)) -> INCR(proper(X))
PROPER(incr(X)) -> PROPER(X)
PROPER(s(X)) -> S(proper(X))
PROPER(s(X)) -> PROPER(X)
PROPER(hd(X)) -> HD(proper(X))
PROPER(hd(X)) -> PROPER(X)
PROPER(tl(X)) -> TL(proper(X))
PROPER(tl(X)) -> PROPER(X)
CONS(ok(X1), ok(X2)) -> CONS(X1, X2)
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
         ↳Usable Rules (Innermost)
       →DP Problem 2
         ↳UsableRules
       →DP Problem 3
         ↳UsableRules
       →DP Problem 4
         ↳UsableRules
       →DP Problem 5
         ↳UsableRules
       →DP Problem 6
         ↳UsableRules
       →DP Problem 7
         ↳UsableRules
       →DP Problem 8
         ↳UsableRules
       →DP Problem 9
         ↳UsableRules


Dependency Pair:

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


Rules:


active(nats) -> mark(adx(zeros))
active(zeros) -> mark(cons(0, zeros))
active(incr(cons(X, Y))) -> mark(cons(s(X), incr(Y)))
active(adx(cons(X, Y))) -> mark(incr(cons(X, adx(Y))))
active(hd(cons(X, Y))) -> mark(X)
active(tl(cons(X, Y))) -> mark(Y)
active(adx(X)) -> adx(active(X))
active(incr(X)) -> incr(active(X))
active(hd(X)) -> hd(active(X))
active(tl(X)) -> tl(active(X))
adx(mark(X)) -> mark(adx(X))
adx(ok(X)) -> ok(adx(X))
incr(mark(X)) -> mark(incr(X))
incr(ok(X)) -> ok(incr(X))
hd(mark(X)) -> mark(hd(X))
hd(ok(X)) -> ok(hd(X))
tl(mark(X)) -> mark(tl(X))
tl(ok(X)) -> ok(tl(X))
proper(nats) -> ok(nats)
proper(adx(X)) -> adx(proper(X))
proper(zeros) -> ok(zeros)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(0) -> ok(0)
proper(incr(X)) -> incr(proper(X))
proper(s(X)) -> s(proper(X))
proper(hd(X)) -> hd(proper(X))
proper(tl(X)) -> tl(proper(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
s(ok(X)) -> ok(s(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))


Strategy:

innermost




As we are in the innermost case, we can delete all 31 non-usable-rules.


   R
     ↳DPs
       →DP Problem 1
         ↳UsableRules
           →DP Problem 10
             ↳Size-Change Principle
       →DP Problem 2
         ↳UsableRules
       →DP Problem 3
         ↳UsableRules
       →DP Problem 4
         ↳UsableRules
       →DP Problem 5
         ↳UsableRules
       →DP Problem 6
         ↳UsableRules
       →DP Problem 7
         ↳UsableRules
       →DP Problem 8
         ↳UsableRules
       →DP Problem 9
         ↳UsableRules


Dependency Pair:

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


Rule:

none


Strategy:

innermost




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

which lead(s) to this/these maximal multigraph(s):
{1} , {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:
ok(x1) -> ok(x1)

We obtain no new DP problems. 


   R
     ↳DPs
       →DP Problem 1
         ↳UsableRules
       →DP Problem 2
         ↳Usable Rules (Innermost)
       →DP Problem 3
         ↳UsableRules
       →DP Problem 4
         ↳UsableRules
       →DP Problem 5
         ↳UsableRules
       →DP Problem 6
         ↳UsableRules
       →DP Problem 7
         ↳UsableRules
       →DP Problem 8
         ↳UsableRules
       →DP Problem 9
         ↳UsableRules


Dependency Pair:

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


Rules:


active(nats) -> mark(adx(zeros))
active(zeros) -> mark(cons(0, zeros))
active(incr(cons(X, Y))) -> mark(cons(s(X), incr(Y)))
active(adx(cons(X, Y))) -> mark(incr(cons(X, adx(Y))))
active(hd(cons(X, Y))) -> mark(X)
active(tl(cons(X, Y))) -> mark(Y)
active(adx(X)) -> adx(active(X))
active(incr(X)) -> incr(active(X))
active(hd(X)) -> hd(active(X))
active(tl(X)) -> tl(active(X))
adx(mark(X)) -> mark(adx(X))
adx(ok(X)) -> ok(adx(X))
incr(mark(X)) -> mark(incr(X))
incr(ok(X)) -> ok(incr(X))
hd(mark(X)) -> mark(hd(X))
hd(ok(X)) -> ok(hd(X))
tl(mark(X)) -> mark(tl(X))
tl(ok(X)) -> ok(tl(X))
proper(nats) -> ok(nats)
proper(adx(X)) -> adx(proper(X))
proper(zeros) -> ok(zeros)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(0) -> ok(0)
proper(incr(X)) -> incr(proper(X))
proper(s(X)) -> s(proper(X))
proper(hd(X)) -> hd(proper(X))
proper(tl(X)) -> tl(proper(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
s(ok(X)) -> ok(s(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))


Strategy:

innermost




As we are in the innermost case, we can delete all 31 non-usable-rules.


   R
     ↳DPs
       →DP Problem 1
         ↳UsableRules
       →DP Problem 2
         ↳UsableRules
           →DP Problem 11
             ↳Size-Change Principle
       →DP Problem 3
         ↳UsableRules
       →DP Problem 4
         ↳UsableRules
       →DP Problem 5
         ↳UsableRules
       →DP Problem 6
         ↳UsableRules
       →DP Problem 7
         ↳UsableRules
       →DP Problem 8
         ↳UsableRules
       →DP Problem 9
         ↳UsableRules


Dependency Pair:

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


Rule:

none


Strategy:

innermost




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
         ↳UsableRules
       →DP Problem 2
         ↳UsableRules
       →DP Problem 3
         ↳Usable Rules (Innermost)
       →DP Problem 4
         ↳UsableRules
       →DP Problem 5
         ↳UsableRules
       →DP Problem 6
         ↳UsableRules
       →DP Problem 7
         ↳UsableRules
       →DP Problem 8
         ↳UsableRules
       →DP Problem 9
         ↳UsableRules


Dependency Pairs:

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


Rules:


active(nats) -> mark(adx(zeros))
active(zeros) -> mark(cons(0, zeros))
active(incr(cons(X, Y))) -> mark(cons(s(X), incr(Y)))
active(adx(cons(X, Y))) -> mark(incr(cons(X, adx(Y))))
active(hd(cons(X, Y))) -> mark(X)
active(tl(cons(X, Y))) -> mark(Y)
active(adx(X)) -> adx(active(X))
active(incr(X)) -> incr(active(X))
active(hd(X)) -> hd(active(X))
active(tl(X)) -> tl(active(X))
adx(mark(X)) -> mark(adx(X))
adx(ok(X)) -> ok(adx(X))
incr(mark(X)) -> mark(incr(X))
incr(ok(X)) -> ok(incr(X))
hd(mark(X)) -> mark(hd(X))
hd(ok(X)) -> ok(hd(X))
tl(mark(X)) -> mark(tl(X))
tl(ok(X)) -> ok(tl(X))
proper(nats) -> ok(nats)
proper(adx(X)) -> adx(proper(X))
proper(zeros) -> ok(zeros)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(0) -> ok(0)
proper(incr(X)) -> incr(proper(X))
proper(s(X)) -> s(proper(X))
proper(hd(X)) -> hd(proper(X))
proper(tl(X)) -> tl(proper(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
s(ok(X)) -> ok(s(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))


Strategy:

innermost




As we are in the innermost case, we can delete all 31 non-usable-rules.


   R
     ↳DPs
       →DP Problem 1
         ↳UsableRules
       →DP Problem 2
         ↳UsableRules
       →DP Problem 3
         ↳UsableRules
           →DP Problem 12
             ↳Size-Change Principle
       →DP Problem 4
         ↳UsableRules
       →DP Problem 5
         ↳UsableRules
       →DP Problem 6
         ↳UsableRules
       →DP Problem 7
         ↳UsableRules
       →DP Problem 8
         ↳UsableRules
       →DP Problem 9
         ↳UsableRules


Dependency Pairs:

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


Rule:

none


Strategy:

innermost




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

which lead(s) to this/these maximal multigraph(s):
{1, 2} , {1, 2}
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
         ↳UsableRules
       →DP Problem 2
         ↳UsableRules
       →DP Problem 3
         ↳UsableRules
       →DP Problem 4
         ↳Usable Rules (Innermost)
       →DP Problem 5
         ↳UsableRules
       →DP Problem 6
         ↳UsableRules
       →DP Problem 7
         ↳UsableRules
       →DP Problem 8
         ↳UsableRules
       →DP Problem 9
         ↳UsableRules


Dependency Pairs:

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


Rules:


active(nats) -> mark(adx(zeros))
active(zeros) -> mark(cons(0, zeros))
active(incr(cons(X, Y))) -> mark(cons(s(X), incr(Y)))
active(adx(cons(X, Y))) -> mark(incr(cons(X, adx(Y))))
active(hd(cons(X, Y))) -> mark(X)
active(tl(cons(X, Y))) -> mark(Y)
active(adx(X)) -> adx(active(X))
active(incr(X)) -> incr(active(X))
active(hd(X)) -> hd(active(X))
active(tl(X)) -> tl(active(X))
adx(mark(X)) -> mark(adx(X))
adx(ok(X)) -> ok(adx(X))
incr(mark(X)) -> mark(incr(X))
incr(ok(X)) -> ok(incr(X))
hd(mark(X)) -> mark(hd(X))
hd(ok(X)) -> ok(hd(X))
tl(mark(X)) -> mark(tl(X))
tl(ok(X)) -> ok(tl(X))
proper(nats) -> ok(nats)
proper(adx(X)) -> adx(proper(X))
proper(zeros) -> ok(zeros)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(0) -> ok(0)
proper(incr(X)) -> incr(proper(X))
proper(s(X)) -> s(proper(X))
proper(hd(X)) -> hd(proper(X))
proper(tl(X)) -> tl(proper(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
s(ok(X)) -> ok(s(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))


Strategy:

innermost




As we are in the innermost case, we can delete all 31 non-usable-rules.


   R
     ↳DPs
       →DP Problem 1
         ↳UsableRules
       →DP Problem 2
         ↳UsableRules
       →DP Problem 3
         ↳UsableRules
       →DP Problem 4
         ↳UsableRules
           →DP Problem 13
             ↳Size-Change Principle
       →DP Problem 5
         ↳UsableRules
       →DP Problem 6
         ↳UsableRules
       →DP Problem 7
         ↳UsableRules
       →DP Problem 8
         ↳UsableRules
       →DP Problem 9
         ↳UsableRules


Dependency Pairs:

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


Rule:

none


Strategy:

innermost




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

which lead(s) to this/these maximal multigraph(s):
{1, 2} , {1, 2}
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
         ↳UsableRules
       →DP Problem 2
         ↳UsableRules
       →DP Problem 3
         ↳UsableRules
       →DP Problem 4
         ↳UsableRules
       →DP Problem 5
         ↳Usable Rules (Innermost)
       →DP Problem 6
         ↳UsableRules
       →DP Problem 7
         ↳UsableRules
       →DP Problem 8
         ↳UsableRules
       →DP Problem 9
         ↳UsableRules


Dependency Pairs:

HD(ok(X)) -> HD(X)
HD(mark(X)) -> HD(X)


Rules:


active(nats) -> mark(adx(zeros))
active(zeros) -> mark(cons(0, zeros))
active(incr(cons(X, Y))) -> mark(cons(s(X), incr(Y)))
active(adx(cons(X, Y))) -> mark(incr(cons(X, adx(Y))))
active(hd(cons(X, Y))) -> mark(X)
active(tl(cons(X, Y))) -> mark(Y)
active(adx(X)) -> adx(active(X))
active(incr(X)) -> incr(active(X))
active(hd(X)) -> hd(active(X))
active(tl(X)) -> tl(active(X))
adx(mark(X)) -> mark(adx(X))
adx(ok(X)) -> ok(adx(X))
incr(mark(X)) -> mark(incr(X))
incr(ok(X)) -> ok(incr(X))
hd(mark(X)) -> mark(hd(X))
hd(ok(X)) -> ok(hd(X))
tl(mark(X)) -> mark(tl(X))
tl(ok(X)) -> ok(tl(X))
proper(nats) -> ok(nats)
proper(adx(X)) -> adx(proper(X))
proper(zeros) -> ok(zeros)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(0) -> ok(0)
proper(incr(X)) -> incr(proper(X))
proper(s(X)) -> s(proper(X))
proper(hd(X)) -> hd(proper(X))
proper(tl(X)) -> tl(proper(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
s(ok(X)) -> ok(s(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))


Strategy:

innermost




As we are in the innermost case, we can delete all 31 non-usable-rules.


   R
     ↳DPs
       →DP Problem 1
         ↳UsableRules
       →DP Problem 2
         ↳UsableRules
       →DP Problem 3
         ↳UsableRules
       →DP Problem 4
         ↳UsableRules
       →DP Problem 5
         ↳UsableRules
           →DP Problem 14
             ↳Size-Change Principle
       →DP Problem 6
         ↳UsableRules
       →DP Problem 7
         ↳UsableRules
       →DP Problem 8
         ↳UsableRules
       →DP Problem 9
         ↳UsableRules


Dependency Pairs:

HD(ok(X)) -> HD(X)
HD(mark(X)) -> HD(X)


Rule:

none


Strategy:

innermost




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

which lead(s) to this/these maximal multigraph(s):
{1, 2} , {1, 2}
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
         ↳UsableRules
       →DP Problem 2
         ↳UsableRules
       →DP Problem 3
         ↳UsableRules
       →DP Problem 4
         ↳UsableRules
       →DP Problem 5
         ↳UsableRules
       →DP Problem 6
         ↳Usable Rules (Innermost)
       →DP Problem 7
         ↳UsableRules
       →DP Problem 8
         ↳UsableRules
       →DP Problem 9
         ↳UsableRules


Dependency Pairs:

TL(ok(X)) -> TL(X)
TL(mark(X)) -> TL(X)


Rules:


active(nats) -> mark(adx(zeros))
active(zeros) -> mark(cons(0, zeros))
active(incr(cons(X, Y))) -> mark(cons(s(X), incr(Y)))
active(adx(cons(X, Y))) -> mark(incr(cons(X, adx(Y))))
active(hd(cons(X, Y))) -> mark(X)
active(tl(cons(X, Y))) -> mark(Y)
active(adx(X)) -> adx(active(X))
active(incr(X)) -> incr(active(X))
active(hd(X)) -> hd(active(X))
active(tl(X)) -> tl(active(X))
adx(mark(X)) -> mark(adx(X))
adx(ok(X)) -> ok(adx(X))
incr(mark(X)) -> mark(incr(X))
incr(ok(X)) -> ok(incr(X))
hd(mark(X)) -> mark(hd(X))
hd(ok(X)) -> ok(hd(X))
tl(mark(X)) -> mark(tl(X))
tl(ok(X)) -> ok(tl(X))
proper(nats) -> ok(nats)
proper(adx(X)) -> adx(proper(X))
proper(zeros) -> ok(zeros)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(0) -> ok(0)
proper(incr(X)) -> incr(proper(X))
proper(s(X)) -> s(proper(X))
proper(hd(X)) -> hd(proper(X))
proper(tl(X)) -> tl(proper(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
s(ok(X)) -> ok(s(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))


Strategy:

innermost




As we are in the innermost case, we can delete all 31 non-usable-rules.


   R
     ↳DPs
       →DP Problem 1
         ↳UsableRules
       →DP Problem 2
         ↳UsableRules
       →DP Problem 3
         ↳UsableRules
       →DP Problem 4
         ↳UsableRules
       →DP Problem 5
         ↳UsableRules
       →DP Problem 6
         ↳UsableRules
           →DP Problem 15
             ↳Size-Change Principle
       →DP Problem 7
         ↳UsableRules
       →DP Problem 8
         ↳UsableRules
       →DP Problem 9
         ↳UsableRules


Dependency Pairs:

TL(ok(X)) -> TL(X)
TL(mark(X)) -> TL(X)


Rule:

none


Strategy:

innermost




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

which lead(s) to this/these maximal multigraph(s):
{1, 2} , {1, 2}
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
         ↳UsableRules
       →DP Problem 2
         ↳UsableRules
       →DP Problem 3
         ↳UsableRules
       →DP Problem 4
         ↳UsableRules
       →DP Problem 5
         ↳UsableRules
       →DP Problem 6
         ↳UsableRules
       →DP Problem 7
         ↳Usable Rules (Innermost)
       →DP Problem 8
         ↳UsableRules
       →DP Problem 9
         ↳UsableRules


Dependency Pairs:

ACTIVE(tl(X)) -> ACTIVE(X)
ACTIVE(hd(X)) -> ACTIVE(X)
ACTIVE(incr(X)) -> ACTIVE(X)
ACTIVE(adx(X)) -> ACTIVE(X)


Rules:


active(nats) -> mark(adx(zeros))
active(zeros) -> mark(cons(0, zeros))
active(incr(cons(X, Y))) -> mark(cons(s(X), incr(Y)))
active(adx(cons(X, Y))) -> mark(incr(cons(X, adx(Y))))
active(hd(cons(X, Y))) -> mark(X)
active(tl(cons(X, Y))) -> mark(Y)
active(adx(X)) -> adx(active(X))
active(incr(X)) -> incr(active(X))
active(hd(X)) -> hd(active(X))
active(tl(X)) -> tl(active(X))
adx(mark(X)) -> mark(adx(X))
adx(ok(X)) -> ok(adx(X))
incr(mark(X)) -> mark(incr(X))
incr(ok(X)) -> ok(incr(X))
hd(mark(X)) -> mark(hd(X))
hd(ok(X)) -> ok(hd(X))
tl(mark(X)) -> mark(tl(X))
tl(ok(X)) -> ok(tl(X))
proper(nats) -> ok(nats)
proper(adx(X)) -> adx(proper(X))
proper(zeros) -> ok(zeros)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(0) -> ok(0)
proper(incr(X)) -> incr(proper(X))
proper(s(X)) -> s(proper(X))
proper(hd(X)) -> hd(proper(X))
proper(tl(X)) -> tl(proper(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
s(ok(X)) -> ok(s(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))


Strategy:

innermost




As we are in the innermost case, we can delete all 31 non-usable-rules.


   R
     ↳DPs
       →DP Problem 1
         ↳UsableRules
       →DP Problem 2
         ↳UsableRules
       →DP Problem 3
         ↳UsableRules
       →DP Problem 4
         ↳UsableRules
       →DP Problem 5
         ↳UsableRules
       →DP Problem 6
         ↳UsableRules
       →DP Problem 7
         ↳UsableRules
           →DP Problem 16
             ↳Size-Change Principle
       →DP Problem 8
         ↳UsableRules
       →DP Problem 9
         ↳UsableRules


Dependency Pairs:

ACTIVE(tl(X)) -> ACTIVE(X)
ACTIVE(hd(X)) -> ACTIVE(X)
ACTIVE(incr(X)) -> ACTIVE(X)
ACTIVE(adx(X)) -> ACTIVE(X)


Rule:

none


Strategy:

innermost




We number the DPs as follows:
  1. ACTIVE(tl(X)) -> ACTIVE(X)
  2. ACTIVE(hd(X)) -> ACTIVE(X)
  3. ACTIVE(incr(X)) -> ACTIVE(X)
  4. ACTIVE(adx(X)) -> ACTIVE(X)
and get the following Size-Change Graph(s):
{1, 2, 3, 4} , {1, 2, 3, 4}
1>1

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

DP: empty set
Oriented Rules: none

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

with Argument Filtering System:
adx(x1) -> adx(x1)
hd(x1) -> hd(x1)
incr(x1) -> incr(x1)
tl(x1) -> tl(x1)

We obtain no new DP problems. 


   R
     ↳DPs
       →DP Problem 1
         ↳UsableRules
       →DP Problem 2
         ↳UsableRules
       →DP Problem 3
         ↳UsableRules
       →DP Problem 4
         ↳UsableRules
       →DP Problem 5
         ↳UsableRules
       →DP Problem 6
         ↳UsableRules
       →DP Problem 7
         ↳UsableRules
       →DP Problem 8
         ↳Usable Rules (Innermost)
       →DP Problem 9
         ↳UsableRules


Dependency Pairs:

PROPER(tl(X)) -> PROPER(X)
PROPER(hd(X)) -> PROPER(X)
PROPER(s(X)) -> PROPER(X)
PROPER(incr(X)) -> PROPER(X)
PROPER(cons(X1, X2)) -> PROPER(X2)
PROPER(cons(X1, X2)) -> PROPER(X1)
PROPER(adx(X)) -> PROPER(X)


Rules:


active(nats) -> mark(adx(zeros))
active(zeros) -> mark(cons(0, zeros))
active(incr(cons(X, Y))) -> mark(cons(s(X), incr(Y)))
active(adx(cons(X, Y))) -> mark(incr(cons(X, adx(Y))))
active(hd(cons(X, Y))) -> mark(X)
active(tl(cons(X, Y))) -> mark(Y)
active(adx(X)) -> adx(active(X))
active(incr(X)) -> incr(active(X))
active(hd(X)) -> hd(active(X))
active(tl(X)) -> tl(active(X))
adx(mark(X)) -> mark(adx(X))
adx(ok(X)) -> ok(adx(X))
incr(mark(X)) -> mark(incr(X))
incr(ok(X)) -> ok(incr(X))
hd(mark(X)) -> mark(hd(X))
hd(ok(X)) -> ok(hd(X))
tl(mark(X)) -> mark(tl(X))
tl(ok(X)) -> ok(tl(X))
proper(nats) -> ok(nats)
proper(adx(X)) -> adx(proper(X))
proper(zeros) -> ok(zeros)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(0) -> ok(0)
proper(incr(X)) -> incr(proper(X))
proper(s(X)) -> s(proper(X))
proper(hd(X)) -> hd(proper(X))
proper(tl(X)) -> tl(proper(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
s(ok(X)) -> ok(s(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))


Strategy:

innermost




As we are in the innermost case, we can delete all 31 non-usable-rules.


   R
     ↳DPs
       →DP Problem 1
         ↳UsableRules
       →DP Problem 2
         ↳UsableRules
       →DP Problem 3
         ↳UsableRules
       →DP Problem 4
         ↳UsableRules
       →DP Problem 5
         ↳UsableRules
       →DP Problem 6
         ↳UsableRules
       →DP Problem 7
         ↳UsableRules
       →DP Problem 8
         ↳UsableRules
           →DP Problem 17
             ↳Size-Change Principle
       →DP Problem 9
         ↳UsableRules


Dependency Pairs:

PROPER(tl(X)) -> PROPER(X)
PROPER(hd(X)) -> PROPER(X)
PROPER(s(X)) -> PROPER(X)
PROPER(incr(X)) -> PROPER(X)
PROPER(cons(X1, X2)) -> PROPER(X2)
PROPER(cons(X1, X2)) -> PROPER(X1)
PROPER(adx(X)) -> PROPER(X)


Rule:

none


Strategy:

innermost




We number the DPs as follows:
  1. PROPER(tl(X)) -> PROPER(X)
  2. PROPER(hd(X)) -> PROPER(X)
  3. PROPER(s(X)) -> PROPER(X)
  4. PROPER(incr(X)) -> PROPER(X)
  5. PROPER(cons(X1, X2)) -> PROPER(X2)
  6. PROPER(cons(X1, X2)) -> PROPER(X1)
  7. PROPER(adx(X)) -> PROPER(X)
and get the following Size-Change Graph(s):
{1, 2, 3, 4, 5, 6, 7} , {1, 2, 3, 4, 5, 6, 7}
1>1

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

DP: empty set
Oriented Rules: none

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

with Argument Filtering System:
adx(x1) -> adx(x1)
cons(x1, x2) -> cons(x1, x2)
hd(x1) -> hd(x1)
incr(x1) -> incr(x1)
s(x1) -> s(x1)
tl(x1) -> tl(x1)

We obtain no new DP problems. 


   R
     ↳DPs
       →DP Problem 1
         ↳UsableRules
       →DP Problem 2
         ↳UsableRules
       →DP Problem 3
         ↳UsableRules
       →DP Problem 4
         ↳UsableRules
       →DP Problem 5
         ↳UsableRules
       →DP Problem 6
         ↳UsableRules
       →DP Problem 7
         ↳UsableRules
       →DP Problem 8
         ↳UsableRules
       →DP Problem 9
         ↳Usable Rules (Innermost)


Dependency Pairs:

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


Rules:


active(nats) -> mark(adx(zeros))
active(zeros) -> mark(cons(0, zeros))
active(incr(cons(X, Y))) -> mark(cons(s(X), incr(Y)))
active(adx(cons(X, Y))) -> mark(incr(cons(X, adx(Y))))
active(hd(cons(X, Y))) -> mark(X)
active(tl(cons(X, Y))) -> mark(Y)
active(adx(X)) -> adx(active(X))
active(incr(X)) -> incr(active(X))
active(hd(X)) -> hd(active(X))
active(tl(X)) -> tl(active(X))
adx(mark(X)) -> mark(adx(X))
adx(ok(X)) -> ok(adx(X))
incr(mark(X)) -> mark(incr(X))
incr(ok(X)) -> ok(incr(X))
hd(mark(X)) -> mark(hd(X))
hd(ok(X)) -> ok(hd(X))
tl(mark(X)) -> mark(tl(X))
tl(ok(X)) -> ok(tl(X))
proper(nats) -> ok(nats)
proper(adx(X)) -> adx(proper(X))
proper(zeros) -> ok(zeros)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(0) -> ok(0)
proper(incr(X)) -> incr(proper(X))
proper(s(X)) -> s(proper(X))
proper(hd(X)) -> hd(proper(X))
proper(tl(X)) -> tl(proper(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
s(ok(X)) -> ok(s(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))


Strategy:

innermost




As we are in the innermost case, we can delete all 2 non-usable-rules.


   R
     ↳DPs
       →DP Problem 1
         ↳UsableRules
       →DP Problem 2
         ↳UsableRules
       →DP Problem 3
         ↳UsableRules
       →DP Problem 4
         ↳UsableRules
       →DP Problem 5
         ↳UsableRules
       →DP Problem 6
         ↳UsableRules
       →DP Problem 7
         ↳UsableRules
       →DP Problem 8
         ↳UsableRules
       →DP Problem 9
         ↳UsableRules
           →DP Problem 18
             ↳Modular Removal of Rules


Dependency Pairs:

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


Rules:


incr(ok(X)) -> ok(incr(X))
incr(mark(X)) -> mark(incr(X))
active(adx(X)) -> adx(active(X))
active(adx(cons(X, Y))) -> mark(incr(cons(X, adx(Y))))
active(zeros) -> mark(cons(0, zeros))
active(tl(cons(X, Y))) -> mark(Y)
active(tl(X)) -> tl(active(X))
active(incr(cons(X, Y))) -> mark(cons(s(X), incr(Y)))
active(incr(X)) -> incr(active(X))
active(hd(cons(X, Y))) -> mark(X)
active(hd(X)) -> hd(active(X))
active(nats) -> mark(adx(zeros))
adx(mark(X)) -> mark(adx(X))
adx(ok(X)) -> ok(adx(X))
tl(ok(X)) -> ok(tl(X))
tl(mark(X)) -> mark(tl(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
hd(mark(X)) -> mark(hd(X))
hd(ok(X)) -> ok(hd(X))
s(ok(X)) -> ok(s(X))
proper(zeros) -> ok(zeros)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(hd(X)) -> hd(proper(X))
proper(nats) -> ok(nats)
proper(tl(X)) -> tl(proper(X))
proper(incr(X)) -> incr(proper(X))
proper(s(X)) -> s(proper(X))
proper(adx(X)) -> adx(proper(X))
proper(0) -> ok(0)


Strategy:

innermost




We have the following set of usable rules:

incr(ok(X)) -> ok(incr(X))
incr(mark(X)) -> mark(incr(X))
active(adx(X)) -> adx(active(X))
active(adx(cons(X, Y))) -> mark(incr(cons(X, adx(Y))))
active(zeros) -> mark(cons(0, zeros))
active(tl(cons(X, Y))) -> mark(Y)
active(tl(X)) -> tl(active(X))
active(incr(cons(X, Y))) -> mark(cons(s(X), incr(Y)))
active(incr(X)) -> incr(active(X))
active(hd(cons(X, Y))) -> mark(X)
active(hd(X)) -> hd(active(X))
active(nats) -> mark(adx(zeros))
adx(mark(X)) -> mark(adx(X))
adx(ok(X)) -> ok(adx(X))
tl(ok(X)) -> ok(tl(X))
tl(mark(X)) -> mark(tl(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
hd(mark(X)) -> mark(hd(X))
hd(ok(X)) -> ok(hd(X))
s(ok(X)) -> ok(s(X))
proper(zeros) -> ok(zeros)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(hd(X)) -> hd(proper(X))
proper(nats) -> ok(nats)
proper(tl(X)) -> tl(proper(X))
proper(incr(X)) -> incr(proper(X))
proper(s(X)) -> s(proper(X))
proper(adx(X)) -> adx(proper(X))
proper(0) -> ok(0)
To remove rules and DPs from this DP problem we used the following monotonic and CE-compatible order: Polynomial ordering.
Polynomial interpretation:
  POL(proper(x1))=  x1  
  POL(adx(x1))=  x1  
  POL(incr(x1))=  x1  
  POL(mark(x1))=  x1  
  POL(tl(x1))=  x1  
  POL(TOP(x1))=  x1  
  POL(ok(x1))=  x1  
  POL(active(x1))=  x1  
  POL(0)=  0  
  POL(cons(x1, x2))=  x1 + x2  
  POL(hd(x1))=  x1  
  POL(nats)=  1  
  POL(s(x1))=  x1  
  POL(zeros)=  0  

We have the following set D of usable symbols: {proper, adx, incr, mark, tl, TOP, ok, active, 0, cons, hd, nats, s, zeros}
No Dependency Pairs can be deleted.
The following rules can be deleted as the lhs is strictly greater than the corresponding rhs:

active(nats) -> mark(adx(zeros))


The result of this processor delivers one new DP problem.



   R
     ↳DPs
       →DP Problem 1
         ↳UsableRules
       →DP Problem 2
         ↳UsableRules
       →DP Problem 3
         ↳UsableRules
       →DP Problem 4
         ↳UsableRules
       →DP Problem 5
         ↳UsableRules
       →DP Problem 6
         ↳UsableRules
       →DP Problem 7
         ↳UsableRules
       →DP Problem 8
         ↳UsableRules
       →DP Problem 9
         ↳UsableRules
           →DP Problem 18
             ↳MRR
             ...
               →DP Problem 19
                 ↳Modular Removal of Rules


Dependency Pairs:

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


Rules:


incr(ok(X)) -> ok(incr(X))
incr(mark(X)) -> mark(incr(X))
active(adx(X)) -> adx(active(X))
active(adx(cons(X, Y))) -> mark(incr(cons(X, adx(Y))))
active(zeros) -> mark(cons(0, zeros))
active(tl(cons(X, Y))) -> mark(Y)
active(tl(X)) -> tl(active(X))
active(incr(cons(X, Y))) -> mark(cons(s(X), incr(Y)))
active(incr(X)) -> incr(active(X))
active(hd(cons(X, Y))) -> mark(X)
active(hd(X)) -> hd(active(X))
adx(mark(X)) -> mark(adx(X))
adx(ok(X)) -> ok(adx(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
tl(ok(X)) -> ok(tl(X))
tl(mark(X)) -> mark(tl(X))
s(ok(X)) -> ok(s(X))
hd(mark(X)) -> mark(hd(X))
hd(ok(X)) -> ok(hd(X))
proper(zeros) -> ok(zeros)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(hd(X)) -> hd(proper(X))
proper(nats) -> ok(nats)
proper(tl(X)) -> tl(proper(X))
proper(incr(X)) -> incr(proper(X))
proper(s(X)) -> s(proper(X))
proper(adx(X)) -> adx(proper(X))
proper(0) -> ok(0)


Strategy:

innermost




We have the following set of usable rules:

incr(ok(X)) -> ok(incr(X))
active(adx(X)) -> adx(active(X))
tl(ok(X)) -> ok(tl(X))
active(adx(cons(X, Y))) -> mark(incr(cons(X, adx(Y))))
hd(mark(X)) -> mark(hd(X))
active(zeros) -> mark(cons(0, zeros))
s(ok(X)) -> ok(s(X))
active(tl(cons(X, Y))) -> mark(Y)
tl(mark(X)) -> mark(tl(X))
active(tl(X)) -> tl(active(X))
hd(ok(X)) -> ok(hd(X))
adx(mark(X)) -> mark(adx(X))
incr(mark(X)) -> mark(incr(X))
active(incr(cons(X, Y))) -> mark(cons(s(X), incr(Y)))
adx(ok(X)) -> ok(adx(X))
active(incr(X)) -> incr(active(X))
active(hd(cons(X, Y))) -> mark(X)
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
active(hd(X)) -> hd(active(X))
proper(zeros) -> ok(zeros)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(nats) -> ok(nats)
proper(hd(X)) -> hd(proper(X))
proper(tl(X)) -> tl(proper(X))
proper(incr(X)) -> incr(proper(X))
proper(s(X)) -> s(proper(X))
proper(adx(X)) -> adx(proper(X))
proper(0) -> ok(0)
To remove rules and DPs from this DP problem we used the following monotonic and CE-compatible order: Polynomial ordering.
Polynomial interpretation:
  POL(proper(x1))=  x1  
  POL(adx(x1))=  x1  
  POL(incr(x1))=  x1  
  POL(mark(x1))=  x1  
  POL(tl(x1))=  1 + x1  
  POL(TOP(x1))=  x1  
  POL(ok(x1))=  x1  
  POL(active(x1))=  x1  
  POL(0)=  0  
  POL(cons(x1, x2))=  x1 + x2  
  POL(hd(x1))=  x1  
  POL(nats)=  0  
  POL(s(x1))=  x1  
  POL(zeros)=  0  

We have the following set D of usable symbols: {proper, adx, incr, tl, mark, TOP, ok, active, 0, cons, hd, nats, s, zeros}
No Dependency Pairs can be deleted.
The following rules can be deleted as the lhs is strictly greater than the corresponding rhs:

active(tl(cons(X, Y))) -> mark(Y)


The result of this processor delivers one new DP problem.



   R
     ↳DPs
       →DP Problem 1
         ↳UsableRules
       →DP Problem 2
         ↳UsableRules
       →DP Problem 3
         ↳UsableRules
       →DP Problem 4
         ↳UsableRules
       →DP Problem 5
         ↳UsableRules
       →DP Problem 6
         ↳UsableRules
       →DP Problem 7
         ↳UsableRules
       →DP Problem 8
         ↳UsableRules
       →DP Problem 9
         ↳UsableRules
           →DP Problem 18
             ↳MRR
             ...
               →DP Problem 20
                 ↳Modular Removal of Rules


Dependency Pairs:

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


Rules:


incr(ok(X)) -> ok(incr(X))
incr(mark(X)) -> mark(incr(X))
active(adx(X)) -> adx(active(X))
active(adx(cons(X, Y))) -> mark(incr(cons(X, adx(Y))))
active(zeros) -> mark(cons(0, zeros))
active(tl(X)) -> tl(active(X))
active(incr(cons(X, Y))) -> mark(cons(s(X), incr(Y)))
active(incr(X)) -> incr(active(X))
active(hd(cons(X, Y))) -> mark(X)
active(hd(X)) -> hd(active(X))
adx(mark(X)) -> mark(adx(X))
adx(ok(X)) -> ok(adx(X))
tl(ok(X)) -> ok(tl(X))
tl(mark(X)) -> mark(tl(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
hd(mark(X)) -> mark(hd(X))
hd(ok(X)) -> ok(hd(X))
s(ok(X)) -> ok(s(X))
proper(zeros) -> ok(zeros)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(nats) -> ok(nats)
proper(hd(X)) -> hd(proper(X))
proper(tl(X)) -> tl(proper(X))
proper(incr(X)) -> incr(proper(X))
proper(s(X)) -> s(proper(X))
proper(adx(X)) -> adx(proper(X))
proper(0) -> ok(0)


Strategy:

innermost




We have the following set of usable rules:

incr(ok(X)) -> ok(incr(X))
active(adx(X)) -> adx(active(X))
tl(ok(X)) -> ok(tl(X))
active(adx(cons(X, Y))) -> mark(incr(cons(X, adx(Y))))
hd(mark(X)) -> mark(hd(X))
active(zeros) -> mark(cons(0, zeros))
s(ok(X)) -> ok(s(X))
tl(mark(X)) -> mark(tl(X))
active(tl(X)) -> tl(active(X))
hd(ok(X)) -> ok(hd(X))
adx(mark(X)) -> mark(adx(X))
incr(mark(X)) -> mark(incr(X))
active(incr(cons(X, Y))) -> mark(cons(s(X), incr(Y)))
adx(ok(X)) -> ok(adx(X))
active(incr(X)) -> incr(active(X))
active(hd(cons(X, Y))) -> mark(X)
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
active(hd(X)) -> hd(active(X))
proper(zeros) -> ok(zeros)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(hd(X)) -> hd(proper(X))
proper(nats) -> ok(nats)
proper(tl(X)) -> tl(proper(X))
proper(incr(X)) -> incr(proper(X))
proper(s(X)) -> s(proper(X))
proper(adx(X)) -> adx(proper(X))
proper(0) -> ok(0)
To remove rules and DPs from this DP problem we used the following monotonic and CE-compatible order: Polynomial ordering.
Polynomial interpretation:
  POL(proper(x1))=  x1  
  POL(adx(x1))=  x1  
  POL(incr(x1))=  x1  
  POL(mark(x1))=  x1  
  POL(tl(x1))=  x1  
  POL(TOP(x1))=  1 + x1  
  POL(ok(x1))=  x1  
  POL(active(x1))=  x1  
  POL(0)=  0  
  POL(cons(x1, x2))=  x1 + x2  
  POL(hd(x1))=  1 + x1  
  POL(nats)=  0  
  POL(s(x1))=  x1  
  POL(zeros)=  0  

We have the following set D of usable symbols: {proper, adx, incr, tl, mark, TOP, ok, active, 0, cons, hd, nats, s, zeros}
No Dependency Pairs can be deleted.
The following rules can be deleted as the lhs is strictly greater than the corresponding rhs:

active(hd(cons(X, Y))) -> mark(X)


The result of this processor delivers one new DP problem.



   R
     ↳DPs
       →DP Problem 1
         ↳UsableRules
       →DP Problem 2
         ↳UsableRules
       →DP Problem 3
         ↳UsableRules
       →DP Problem 4
         ↳UsableRules
       →DP Problem 5
         ↳UsableRules
       →DP Problem 6
         ↳UsableRules
       →DP Problem 7
         ↳UsableRules
       →DP Problem 8
         ↳UsableRules
       →DP Problem 9
         ↳UsableRules
           →DP Problem 18
             ↳MRR
             ...
               →DP Problem 21
                 ↳Argument Filtering and Ordering


Dependency Pairs:

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


Rules:


incr(ok(X)) -> ok(incr(X))
incr(mark(X)) -> mark(incr(X))
active(adx(X)) -> adx(active(X))
active(adx(cons(X, Y))) -> mark(incr(cons(X, adx(Y))))
active(zeros) -> mark(cons(0, zeros))
active(tl(X)) -> tl(active(X))
active(incr(cons(X, Y))) -> mark(cons(s(X), incr(Y)))
active(incr(X)) -> incr(active(X))
active(hd(X)) -> hd(active(X))
adx(mark(X)) -> mark(adx(X))
adx(ok(X)) -> ok(adx(X))
tl(ok(X)) -> ok(tl(X))
tl(mark(X)) -> mark(tl(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
hd(mark(X)) -> mark(hd(X))
hd(ok(X)) -> ok(hd(X))
s(ok(X)) -> ok(s(X))
proper(zeros) -> ok(zeros)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(hd(X)) -> hd(proper(X))
proper(nats) -> ok(nats)
proper(tl(X)) -> tl(proper(X))
proper(incr(X)) -> incr(proper(X))
proper(s(X)) -> s(proper(X))
proper(adx(X)) -> adx(proper(X))
proper(0) -> ok(0)


Strategy:

innermost




The following dependency pair can be strictly oriented:

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


The following usable rules w.r.t. the AFS can be oriented:

active(adx(X)) -> adx(active(X))
tl(ok(X)) -> ok(tl(X))
incr(ok(X)) -> ok(incr(X))
active(adx(cons(X, Y))) -> mark(incr(cons(X, adx(Y))))
hd(mark(X)) -> mark(hd(X))
active(zeros) -> mark(cons(0, zeros))
s(ok(X)) -> ok(s(X))
tl(mark(X)) -> mark(tl(X))
active(tl(X)) -> tl(active(X))
hd(ok(X)) -> ok(hd(X))
adx(mark(X)) -> mark(adx(X))
incr(mark(X)) -> mark(incr(X))
active(incr(cons(X, Y))) -> mark(cons(s(X), incr(Y)))
adx(ok(X)) -> ok(adx(X))
active(incr(X)) -> incr(active(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
active(hd(X)) -> hd(active(X))
proper(zeros) -> ok(zeros)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(nats) -> ok(nats)
proper(hd(X)) -> hd(proper(X))
proper(tl(X)) -> tl(proper(X))
proper(incr(X)) -> incr(proper(X))
proper(s(X)) -> s(proper(X))
proper(adx(X)) -> adx(proper(X))
proper(0) -> ok(0)


Used ordering: Lexicographic Path Order with Precedence:
adx > incr > mark
zeros > mark
zeros > 0

resulting in one new DP problem.
Used Argument Filtering System:
TOP(x1) -> x1
ok(x1) -> x1
active(x1) -> x1
adx(x1) -> adx(x1)
incr(x1) -> incr(x1)
cons(x1, x2) -> x1
mark(x1) -> mark(x1)
tl(x1) -> x1
hd(x1) -> x1
s(x1) -> x1
proper(x1) -> x1


   R
     ↳DPs
       →DP Problem 1
         ↳UsableRules
       →DP Problem 2
         ↳UsableRules
       →DP Problem 3
         ↳UsableRules
       →DP Problem 4
         ↳UsableRules
       →DP Problem 5
         ↳UsableRules
       →DP Problem 6
         ↳UsableRules
       →DP Problem 7
         ↳UsableRules
       →DP Problem 8
         ↳UsableRules
       →DP Problem 9
         ↳UsableRules
           →DP Problem 18
             ↳MRR
             ...
               →DP Problem 22
                 ↳Usable Rules (Innermost)


Dependency Pair:

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


Rules:


incr(ok(X)) -> ok(incr(X))
incr(mark(X)) -> mark(incr(X))
active(adx(X)) -> adx(active(X))
active(adx(cons(X, Y))) -> mark(incr(cons(X, adx(Y))))
active(zeros) -> mark(cons(0, zeros))
active(tl(X)) -> tl(active(X))
active(incr(cons(X, Y))) -> mark(cons(s(X), incr(Y)))
active(incr(X)) -> incr(active(X))
active(hd(X)) -> hd(active(X))
adx(mark(X)) -> mark(adx(X))
adx(ok(X)) -> ok(adx(X))
tl(ok(X)) -> ok(tl(X))
tl(mark(X)) -> mark(tl(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
hd(mark(X)) -> mark(hd(X))
hd(ok(X)) -> ok(hd(X))
s(ok(X)) -> ok(s(X))
proper(zeros) -> ok(zeros)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(hd(X)) -> hd(proper(X))
proper(nats) -> ok(nats)
proper(tl(X)) -> tl(proper(X))
proper(incr(X)) -> incr(proper(X))
proper(s(X)) -> s(proper(X))
proper(adx(X)) -> adx(proper(X))
proper(0) -> ok(0)


Strategy:

innermost




As we are in the innermost case, we can delete all 9 non-usable-rules.


   R
     ↳DPs
       →DP Problem 1
         ↳UsableRules
       →DP Problem 2
         ↳UsableRules
       →DP Problem 3
         ↳UsableRules
       →DP Problem 4
         ↳UsableRules
       →DP Problem 5
         ↳UsableRules
       →DP Problem 6
         ↳UsableRules
       →DP Problem 7
         ↳UsableRules
       →DP Problem 8
         ↳UsableRules
       →DP Problem 9
         ↳UsableRules
           →DP Problem 18
             ↳MRR
             ...
               →DP Problem 23
                 ↳Modular Removal of Rules


Dependency Pair:

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


Rules:


active(adx(X)) -> adx(active(X))
active(adx(cons(X, Y))) -> mark(incr(cons(X, adx(Y))))
active(zeros) -> mark(cons(0, zeros))
active(tl(X)) -> tl(active(X))
active(incr(cons(X, Y))) -> mark(cons(s(X), incr(Y)))
active(incr(X)) -> incr(active(X))
active(hd(X)) -> hd(active(X))
adx(mark(X)) -> mark(adx(X))
adx(ok(X)) -> ok(adx(X))
tl(ok(X)) -> ok(tl(X))
tl(mark(X)) -> mark(tl(X))
incr(ok(X)) -> ok(incr(X))
incr(mark(X)) -> mark(incr(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
hd(mark(X)) -> mark(hd(X))
hd(ok(X)) -> ok(hd(X))
s(ok(X)) -> ok(s(X))


Strategy:

innermost




We have the following set of usable rules:

active(adx(X)) -> adx(active(X))
active(adx(cons(X, Y))) -> mark(incr(cons(X, adx(Y))))
active(zeros) -> mark(cons(0, zeros))
active(tl(X)) -> tl(active(X))
active(incr(cons(X, Y))) -> mark(cons(s(X), incr(Y)))
active(incr(X)) -> incr(active(X))
active(hd(X)) -> hd(active(X))
adx(mark(X)) -> mark(adx(X))
adx(ok(X)) -> ok(adx(X))
tl(ok(X)) -> ok(tl(X))
tl(mark(X)) -> mark(tl(X))
incr(ok(X)) -> ok(incr(X))
incr(mark(X)) -> mark(incr(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
hd(mark(X)) -> mark(hd(X))
hd(ok(X)) -> ok(hd(X))
s(ok(X)) -> ok(s(X))
To remove rules and DPs from this DP problem we used the following monotonic and CE-compatible order: Polynomial ordering.
Polynomial interpretation:
  POL(active(x1))=  x1  
  POL(adx(x1))=  x1  
  POL(0)=  0  
  POL(cons(x1, x2))=  x1 + x2  
  POL(hd(x1))=  x1  
  POL(incr(x1))=  x1  
  POL(s(x1))=  x1  
  POL(mark(x1))=  x1  
  POL(zeros)=  0  
  POL(tl(x1))=  x1  
  POL(TOP(x1))=  1 + x1  
  POL(ok(x1))=  1 + x1  

We have the following set D of usable symbols: {active, 0, adx, cons, hd, incr, s, tl, zeros, mark, TOP, ok}
The following Dependency Pairs can be deleted as the lhs is strictly greater than the corresponding rhs:

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

No Rules can be deleted.

After the removal, there are no SCCs in the dependency graph which results in no DP problems which have to be solved.


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