Term Rewriting System R:
[X, Y, Z, X1, X2]
active(dbl(0)) -> mark(0)
active(dbl(s(X))) -> mark(s(s(dbl(X))))
active(dbls(nil)) -> mark(nil)
active(dbls(cons(X, Y))) -> mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) -> mark(X)
active(sel(s(X), cons(Y, Z))) -> mark(sel(X, Z))
active(indx(nil, X)) -> mark(nil)
active(indx(cons(X, Y), Z)) -> mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) -> mark(cons(X, from(s(X))))
active(dbl1(0)) -> mark(01)
active(dbl1(s(X))) -> mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) -> mark(X)
active(sel1(s(X), cons(Y, Z))) -> mark(sel1(X, Z))
active(quote(0)) -> mark(01)
active(quote(s(X))) -> mark(s1(quote(X)))
active(quote(dbl(X))) -> mark(dbl1(X))
active(quote(sel(X, Y))) -> mark(sel1(X, Y))
active(dbl(X)) -> dbl(active(X))
active(dbls(X)) -> dbls(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(indx(X1, X2)) -> indx(active(X1), X2)
active(dbl1(X)) -> dbl1(active(X))
active(s1(X)) -> s1(active(X))
active(sel1(X1, X2)) -> sel1(active(X1), X2)
active(sel1(X1, X2)) -> sel1(X1, active(X2))
active(quote(X)) -> quote(active(X))
dbl(mark(X)) -> mark(dbl(X))
dbl(ok(X)) -> ok(dbl(X))
dbls(mark(X)) -> mark(dbls(X))
dbls(ok(X)) -> ok(dbls(X))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
indx(mark(X1), X2) -> mark(indx(X1, X2))
indx(ok(X1), ok(X2)) -> ok(indx(X1, X2))
dbl1(mark(X)) -> mark(dbl1(X))
dbl1(ok(X)) -> ok(dbl1(X))
s1(mark(X)) -> mark(s1(X))
s1(ok(X)) -> ok(s1(X))
sel1(mark(X1), X2) -> mark(sel1(X1, X2))
sel1(X1, mark(X2)) -> mark(sel1(X1, X2))
sel1(ok(X1), ok(X2)) -> ok(sel1(X1, X2))
quote(mark(X)) -> mark(quote(X))
quote(ok(X)) -> ok(quote(X))
proper(dbl(X)) -> dbl(proper(X))
proper(0) -> ok(0)
proper(s(X)) -> s(proper(X))
proper(dbls(X)) -> dbls(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(indx(X1, X2)) -> indx(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(dbl1(X)) -> dbl1(proper(X))
proper(01) -> ok(01)
proper(s1(X)) -> s1(proper(X))
proper(sel1(X1, X2)) -> sel1(proper(X1), proper(X2))
proper(quote(X)) -> quote(proper(X))
s(ok(X)) -> ok(s(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
from(ok(X)) -> ok(from(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(dbl(s(X))) -> S(s(dbl(X)))
ACTIVE(dbl(s(X))) -> S(dbl(X))
ACTIVE(dbl(s(X))) -> DBL(X)
ACTIVE(dbls(cons(X, Y))) -> CONS(dbl(X), dbls(Y))
ACTIVE(dbls(cons(X, Y))) -> DBL(X)
ACTIVE(dbls(cons(X, Y))) -> DBLS(Y)
ACTIVE(sel(s(X), cons(Y, Z))) -> SEL(X, Z)
ACTIVE(indx(cons(X, Y), Z)) -> CONS(sel(X, Z), indx(Y, Z))
ACTIVE(indx(cons(X, Y), Z)) -> SEL(X, Z)
ACTIVE(indx(cons(X, Y), Z)) -> INDX(Y, Z)
ACTIVE(from(X)) -> CONS(X, from(s(X)))
ACTIVE(from(X)) -> FROM(s(X))
ACTIVE(from(X)) -> S(X)
ACTIVE(dbl1(s(X))) -> S1(s1(dbl1(X)))
ACTIVE(dbl1(s(X))) -> S1(dbl1(X))
ACTIVE(dbl1(s(X))) -> DBL1(X)
ACTIVE(sel1(s(X), cons(Y, Z))) -> SEL1(X, Z)
ACTIVE(quote(s(X))) -> S1(quote(X))
ACTIVE(quote(s(X))) -> QUOTE(X)
ACTIVE(quote(dbl(X))) -> DBL1(X)
ACTIVE(quote(sel(X, Y))) -> SEL1(X, Y)
ACTIVE(dbl(X)) -> DBL(active(X))
ACTIVE(dbl(X)) -> ACTIVE(X)
ACTIVE(dbls(X)) -> DBLS(active(X))
ACTIVE(dbls(X)) -> ACTIVE(X)
ACTIVE(sel(X1, X2)) -> SEL(active(X1), X2)
ACTIVE(sel(X1, X2)) -> ACTIVE(X1)
ACTIVE(sel(X1, X2)) -> SEL(X1, active(X2))
ACTIVE(sel(X1, X2)) -> ACTIVE(X2)
ACTIVE(indx(X1, X2)) -> INDX(active(X1), X2)
ACTIVE(indx(X1, X2)) -> ACTIVE(X1)
ACTIVE(dbl1(X)) -> DBL1(active(X))
ACTIVE(dbl1(X)) -> ACTIVE(X)
ACTIVE(s1(X)) -> S1(active(X))
ACTIVE(s1(X)) -> ACTIVE(X)
ACTIVE(sel1(X1, X2)) -> SEL1(active(X1), X2)
ACTIVE(sel1(X1, X2)) -> ACTIVE(X1)
ACTIVE(sel1(X1, X2)) -> SEL1(X1, active(X2))
ACTIVE(sel1(X1, X2)) -> ACTIVE(X2)
ACTIVE(quote(X)) -> QUOTE(active(X))
ACTIVE(quote(X)) -> ACTIVE(X)
DBL(mark(X)) -> DBL(X)
DBL(ok(X)) -> DBL(X)
DBLS(mark(X)) -> DBLS(X)
DBLS(ok(X)) -> DBLS(X)
SEL(mark(X1), X2) -> SEL(X1, X2)
SEL(X1, mark(X2)) -> SEL(X1, X2)
SEL(ok(X1), ok(X2)) -> SEL(X1, X2)
INDX(mark(X1), X2) -> INDX(X1, X2)
INDX(ok(X1), ok(X2)) -> INDX(X1, X2)
DBL1(mark(X)) -> DBL1(X)
DBL1(ok(X)) -> DBL1(X)
S1(mark(X)) -> S1(X)
S1(ok(X)) -> S1(X)
SEL1(mark(X1), X2) -> SEL1(X1, X2)
SEL1(X1, mark(X2)) -> SEL1(X1, X2)
SEL1(ok(X1), ok(X2)) -> SEL1(X1, X2)
QUOTE(mark(X)) -> QUOTE(X)
QUOTE(ok(X)) -> QUOTE(X)
PROPER(dbl(X)) -> DBL(proper(X))
PROPER(dbl(X)) -> PROPER(X)
PROPER(s(X)) -> S(proper(X))
PROPER(s(X)) -> PROPER(X)
PROPER(dbls(X)) -> DBLS(proper(X))
PROPER(dbls(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(sel(X1, X2)) -> SEL(proper(X1), proper(X2))
PROPER(sel(X1, X2)) -> PROPER(X1)
PROPER(sel(X1, X2)) -> PROPER(X2)
PROPER(indx(X1, X2)) -> INDX(proper(X1), proper(X2))
PROPER(indx(X1, X2)) -> PROPER(X1)
PROPER(indx(X1, X2)) -> PROPER(X2)
PROPER(from(X)) -> FROM(proper(X))
PROPER(from(X)) -> PROPER(X)
PROPER(dbl1(X)) -> DBL1(proper(X))
PROPER(dbl1(X)) -> PROPER(X)
PROPER(s1(X)) -> S1(proper(X))
PROPER(s1(X)) -> PROPER(X)
PROPER(sel1(X1, X2)) -> SEL1(proper(X1), proper(X2))
PROPER(sel1(X1, X2)) -> PROPER(X1)
PROPER(sel1(X1, X2)) -> PROPER(X2)
PROPER(quote(X)) -> QUOTE(proper(X))
PROPER(quote(X)) -> PROPER(X)
S(ok(X)) -> S(X)
CONS(ok(X1), ok(X2)) -> CONS(X1, X2)
FROM(ok(X)) -> FROM(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 14 SCCs. 


   R
     ↳DPs
       →DP Problem 1
         ↳Polynomial Ordering
       →DP Problem 2
         ↳Polo
       →DP Problem 3
         ↳Polo
       →DP Problem 4
         ↳Polo
       →DP Problem 5
         ↳Polo
       →DP Problem 6
         ↳Polo
       →DP Problem 7
         ↳Polo
       →DP Problem 8
         ↳Polo
       →DP Problem 9
         ↳Polo
       →DP Problem 10
         ↳Polo
       →DP Problem 11
         ↳Polo
       →DP Problem 12
         ↳Polo
       →DP Problem 13
         ↳Polo
       →DP Problem 14
         ↳Remaining


Dependency Pair:

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


Rules:


active(dbl(0)) -> mark(0)
active(dbl(s(X))) -> mark(s(s(dbl(X))))
active(dbls(nil)) -> mark(nil)
active(dbls(cons(X, Y))) -> mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) -> mark(X)
active(sel(s(X), cons(Y, Z))) -> mark(sel(X, Z))
active(indx(nil, X)) -> mark(nil)
active(indx(cons(X, Y), Z)) -> mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) -> mark(cons(X, from(s(X))))
active(dbl1(0)) -> mark(01)
active(dbl1(s(X))) -> mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) -> mark(X)
active(sel1(s(X), cons(Y, Z))) -> mark(sel1(X, Z))
active(quote(0)) -> mark(01)
active(quote(s(X))) -> mark(s1(quote(X)))
active(quote(dbl(X))) -> mark(dbl1(X))
active(quote(sel(X, Y))) -> mark(sel1(X, Y))
active(dbl(X)) -> dbl(active(X))
active(dbls(X)) -> dbls(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(indx(X1, X2)) -> indx(active(X1), X2)
active(dbl1(X)) -> dbl1(active(X))
active(s1(X)) -> s1(active(X))
active(sel1(X1, X2)) -> sel1(active(X1), X2)
active(sel1(X1, X2)) -> sel1(X1, active(X2))
active(quote(X)) -> quote(active(X))
dbl(mark(X)) -> mark(dbl(X))
dbl(ok(X)) -> ok(dbl(X))
dbls(mark(X)) -> mark(dbls(X))
dbls(ok(X)) -> ok(dbls(X))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
indx(mark(X1), X2) -> mark(indx(X1, X2))
indx(ok(X1), ok(X2)) -> ok(indx(X1, X2))
dbl1(mark(X)) -> mark(dbl1(X))
dbl1(ok(X)) -> ok(dbl1(X))
s1(mark(X)) -> mark(s1(X))
s1(ok(X)) -> ok(s1(X))
sel1(mark(X1), X2) -> mark(sel1(X1, X2))
sel1(X1, mark(X2)) -> mark(sel1(X1, X2))
sel1(ok(X1), ok(X2)) -> ok(sel1(X1, X2))
quote(mark(X)) -> mark(quote(X))
quote(ok(X)) -> ok(quote(X))
proper(dbl(X)) -> dbl(proper(X))
proper(0) -> ok(0)
proper(s(X)) -> s(proper(X))
proper(dbls(X)) -> dbls(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(indx(X1, X2)) -> indx(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(dbl1(X)) -> dbl1(proper(X))
proper(01) -> ok(01)
proper(s1(X)) -> s1(proper(X))
proper(sel1(X1, X2)) -> sel1(proper(X1), proper(X2))
proper(quote(X)) -> quote(proper(X))
s(ok(X)) -> ok(s(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
from(ok(X)) -> ok(from(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))


Strategy:

innermost




The following dependency pair can be strictly oriented:

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


There are no usable rules for innermost w.r.t. to the implicit AFS that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:
  POL(S(x1))=  x1  
  POL(ok(x1))=  1 + x1  

resulting in one new DP problem. 



   R
     ↳DPs
       →DP Problem 1
         ↳Polo
           →DP Problem 15
             ↳Dependency Graph
       →DP Problem 2
         ↳Polo
       →DP Problem 3
         ↳Polo
       →DP Problem 4
         ↳Polo
       →DP Problem 5
         ↳Polo
       →DP Problem 6
         ↳Polo
       →DP Problem 7
         ↳Polo
       →DP Problem 8
         ↳Polo
       →DP Problem 9
         ↳Polo
       →DP Problem 10
         ↳Polo
       →DP Problem 11
         ↳Polo
       →DP Problem 12
         ↳Polo
       →DP Problem 13
         ↳Polo
       →DP Problem 14
         ↳Remaining


Dependency Pair:


Rules:


active(dbl(0)) -> mark(0)
active(dbl(s(X))) -> mark(s(s(dbl(X))))
active(dbls(nil)) -> mark(nil)
active(dbls(cons(X, Y))) -> mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) -> mark(X)
active(sel(s(X), cons(Y, Z))) -> mark(sel(X, Z))
active(indx(nil, X)) -> mark(nil)
active(indx(cons(X, Y), Z)) -> mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) -> mark(cons(X, from(s(X))))
active(dbl1(0)) -> mark(01)
active(dbl1(s(X))) -> mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) -> mark(X)
active(sel1(s(X), cons(Y, Z))) -> mark(sel1(X, Z))
active(quote(0)) -> mark(01)
active(quote(s(X))) -> mark(s1(quote(X)))
active(quote(dbl(X))) -> mark(dbl1(X))
active(quote(sel(X, Y))) -> mark(sel1(X, Y))
active(dbl(X)) -> dbl(active(X))
active(dbls(X)) -> dbls(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(indx(X1, X2)) -> indx(active(X1), X2)
active(dbl1(X)) -> dbl1(active(X))
active(s1(X)) -> s1(active(X))
active(sel1(X1, X2)) -> sel1(active(X1), X2)
active(sel1(X1, X2)) -> sel1(X1, active(X2))
active(quote(X)) -> quote(active(X))
dbl(mark(X)) -> mark(dbl(X))
dbl(ok(X)) -> ok(dbl(X))
dbls(mark(X)) -> mark(dbls(X))
dbls(ok(X)) -> ok(dbls(X))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
indx(mark(X1), X2) -> mark(indx(X1, X2))
indx(ok(X1), ok(X2)) -> ok(indx(X1, X2))
dbl1(mark(X)) -> mark(dbl1(X))
dbl1(ok(X)) -> ok(dbl1(X))
s1(mark(X)) -> mark(s1(X))
s1(ok(X)) -> ok(s1(X))
sel1(mark(X1), X2) -> mark(sel1(X1, X2))
sel1(X1, mark(X2)) -> mark(sel1(X1, X2))
sel1(ok(X1), ok(X2)) -> ok(sel1(X1, X2))
quote(mark(X)) -> mark(quote(X))
quote(ok(X)) -> ok(quote(X))
proper(dbl(X)) -> dbl(proper(X))
proper(0) -> ok(0)
proper(s(X)) -> s(proper(X))
proper(dbls(X)) -> dbls(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(indx(X1, X2)) -> indx(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(dbl1(X)) -> dbl1(proper(X))
proper(01) -> ok(01)
proper(s1(X)) -> s1(proper(X))
proper(sel1(X1, X2)) -> sel1(proper(X1), proper(X2))
proper(quote(X)) -> quote(proper(X))
s(ok(X)) -> ok(s(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
from(ok(X)) -> ok(from(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
         ↳Polo
       →DP Problem 2
         ↳Polynomial Ordering
       →DP Problem 3
         ↳Polo
       →DP Problem 4
         ↳Polo
       →DP Problem 5
         ↳Polo
       →DP Problem 6
         ↳Polo
       →DP Problem 7
         ↳Polo
       →DP Problem 8
         ↳Polo
       →DP Problem 9
         ↳Polo
       →DP Problem 10
         ↳Polo
       →DP Problem 11
         ↳Polo
       →DP Problem 12
         ↳Polo
       →DP Problem 13
         ↳Polo
       →DP Problem 14
         ↳Remaining


Dependency Pairs:

DBL(ok(X)) -> DBL(X)
DBL(mark(X)) -> DBL(X)


Rules:


active(dbl(0)) -> mark(0)
active(dbl(s(X))) -> mark(s(s(dbl(X))))
active(dbls(nil)) -> mark(nil)
active(dbls(cons(X, Y))) -> mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) -> mark(X)
active(sel(s(X), cons(Y, Z))) -> mark(sel(X, Z))
active(indx(nil, X)) -> mark(nil)
active(indx(cons(X, Y), Z)) -> mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) -> mark(cons(X, from(s(X))))
active(dbl1(0)) -> mark(01)
active(dbl1(s(X))) -> mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) -> mark(X)
active(sel1(s(X), cons(Y, Z))) -> mark(sel1(X, Z))
active(quote(0)) -> mark(01)
active(quote(s(X))) -> mark(s1(quote(X)))
active(quote(dbl(X))) -> mark(dbl1(X))
active(quote(sel(X, Y))) -> mark(sel1(X, Y))
active(dbl(X)) -> dbl(active(X))
active(dbls(X)) -> dbls(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(indx(X1, X2)) -> indx(active(X1), X2)
active(dbl1(X)) -> dbl1(active(X))
active(s1(X)) -> s1(active(X))
active(sel1(X1, X2)) -> sel1(active(X1), X2)
active(sel1(X1, X2)) -> sel1(X1, active(X2))
active(quote(X)) -> quote(active(X))
dbl(mark(X)) -> mark(dbl(X))
dbl(ok(X)) -> ok(dbl(X))
dbls(mark(X)) -> mark(dbls(X))
dbls(ok(X)) -> ok(dbls(X))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
indx(mark(X1), X2) -> mark(indx(X1, X2))
indx(ok(X1), ok(X2)) -> ok(indx(X1, X2))
dbl1(mark(X)) -> mark(dbl1(X))
dbl1(ok(X)) -> ok(dbl1(X))
s1(mark(X)) -> mark(s1(X))
s1(ok(X)) -> ok(s1(X))
sel1(mark(X1), X2) -> mark(sel1(X1, X2))
sel1(X1, mark(X2)) -> mark(sel1(X1, X2))
sel1(ok(X1), ok(X2)) -> ok(sel1(X1, X2))
quote(mark(X)) -> mark(quote(X))
quote(ok(X)) -> ok(quote(X))
proper(dbl(X)) -> dbl(proper(X))
proper(0) -> ok(0)
proper(s(X)) -> s(proper(X))
proper(dbls(X)) -> dbls(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(indx(X1, X2)) -> indx(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(dbl1(X)) -> dbl1(proper(X))
proper(01) -> ok(01)
proper(s1(X)) -> s1(proper(X))
proper(sel1(X1, X2)) -> sel1(proper(X1), proper(X2))
proper(quote(X)) -> quote(proper(X))
s(ok(X)) -> ok(s(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
from(ok(X)) -> ok(from(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))


Strategy:

innermost




The following dependency pair can be strictly oriented:

DBL(ok(X)) -> DBL(X)


There are no usable rules for innermost w.r.t. to the implicit AFS that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:
  POL(mark(x1))=  x1  
  POL(ok(x1))=  1 + x1  
  POL(DBL(x1))=  x1  

resulting in one new DP problem. 



   R
     ↳DPs
       →DP Problem 1
         ↳Polo
       →DP Problem 2
         ↳Polo
           →DP Problem 16
             ↳Polynomial Ordering
       →DP Problem 3
         ↳Polo
       →DP Problem 4
         ↳Polo
       →DP Problem 5
         ↳Polo
       →DP Problem 6
         ↳Polo
       →DP Problem 7
         ↳Polo
       →DP Problem 8
         ↳Polo
       →DP Problem 9
         ↳Polo
       →DP Problem 10
         ↳Polo
       →DP Problem 11
         ↳Polo
       →DP Problem 12
         ↳Polo
       →DP Problem 13
         ↳Polo
       →DP Problem 14
         ↳Remaining


Dependency Pair:

DBL(mark(X)) -> DBL(X)


Rules:


active(dbl(0)) -> mark(0)
active(dbl(s(X))) -> mark(s(s(dbl(X))))
active(dbls(nil)) -> mark(nil)
active(dbls(cons(X, Y))) -> mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) -> mark(X)
active(sel(s(X), cons(Y, Z))) -> mark(sel(X, Z))
active(indx(nil, X)) -> mark(nil)
active(indx(cons(X, Y), Z)) -> mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) -> mark(cons(X, from(s(X))))
active(dbl1(0)) -> mark(01)
active(dbl1(s(X))) -> mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) -> mark(X)
active(sel1(s(X), cons(Y, Z))) -> mark(sel1(X, Z))
active(quote(0)) -> mark(01)
active(quote(s(X))) -> mark(s1(quote(X)))
active(quote(dbl(X))) -> mark(dbl1(X))
active(quote(sel(X, Y))) -> mark(sel1(X, Y))
active(dbl(X)) -> dbl(active(X))
active(dbls(X)) -> dbls(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(indx(X1, X2)) -> indx(active(X1), X2)
active(dbl1(X)) -> dbl1(active(X))
active(s1(X)) -> s1(active(X))
active(sel1(X1, X2)) -> sel1(active(X1), X2)
active(sel1(X1, X2)) -> sel1(X1, active(X2))
active(quote(X)) -> quote(active(X))
dbl(mark(X)) -> mark(dbl(X))
dbl(ok(X)) -> ok(dbl(X))
dbls(mark(X)) -> mark(dbls(X))
dbls(ok(X)) -> ok(dbls(X))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
indx(mark(X1), X2) -> mark(indx(X1, X2))
indx(ok(X1), ok(X2)) -> ok(indx(X1, X2))
dbl1(mark(X)) -> mark(dbl1(X))
dbl1(ok(X)) -> ok(dbl1(X))
s1(mark(X)) -> mark(s1(X))
s1(ok(X)) -> ok(s1(X))
sel1(mark(X1), X2) -> mark(sel1(X1, X2))
sel1(X1, mark(X2)) -> mark(sel1(X1, X2))
sel1(ok(X1), ok(X2)) -> ok(sel1(X1, X2))
quote(mark(X)) -> mark(quote(X))
quote(ok(X)) -> ok(quote(X))
proper(dbl(X)) -> dbl(proper(X))
proper(0) -> ok(0)
proper(s(X)) -> s(proper(X))
proper(dbls(X)) -> dbls(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(indx(X1, X2)) -> indx(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(dbl1(X)) -> dbl1(proper(X))
proper(01) -> ok(01)
proper(s1(X)) -> s1(proper(X))
proper(sel1(X1, X2)) -> sel1(proper(X1), proper(X2))
proper(quote(X)) -> quote(proper(X))
s(ok(X)) -> ok(s(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
from(ok(X)) -> ok(from(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))


Strategy:

innermost




The following dependency pair can be strictly oriented:

DBL(mark(X)) -> DBL(X)


There are no usable rules for innermost w.r.t. to the implicit AFS that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:
  POL(mark(x1))=  1 + x1  
  POL(DBL(x1))=  x1  

resulting in one new DP problem. 



   R
     ↳DPs
       →DP Problem 1
         ↳Polo
       →DP Problem 2
         ↳Polo
           →DP Problem 16
             ↳Polo
             ...
               →DP Problem 17
                 ↳Dependency Graph
       →DP Problem 3
         ↳Polo
       →DP Problem 4
         ↳Polo
       →DP Problem 5
         ↳Polo
       →DP Problem 6
         ↳Polo
       →DP Problem 7
         ↳Polo
       →DP Problem 8
         ↳Polo
       →DP Problem 9
         ↳Polo
       →DP Problem 10
         ↳Polo
       →DP Problem 11
         ↳Polo
       →DP Problem 12
         ↳Polo
       →DP Problem 13
         ↳Polo
       →DP Problem 14
         ↳Remaining


Dependency Pair:


Rules:


active(dbl(0)) -> mark(0)
active(dbl(s(X))) -> mark(s(s(dbl(X))))
active(dbls(nil)) -> mark(nil)
active(dbls(cons(X, Y))) -> mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) -> mark(X)
active(sel(s(X), cons(Y, Z))) -> mark(sel(X, Z))
active(indx(nil, X)) -> mark(nil)
active(indx(cons(X, Y), Z)) -> mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) -> mark(cons(X, from(s(X))))
active(dbl1(0)) -> mark(01)
active(dbl1(s(X))) -> mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) -> mark(X)
active(sel1(s(X), cons(Y, Z))) -> mark(sel1(X, Z))
active(quote(0)) -> mark(01)
active(quote(s(X))) -> mark(s1(quote(X)))
active(quote(dbl(X))) -> mark(dbl1(X))
active(quote(sel(X, Y))) -> mark(sel1(X, Y))
active(dbl(X)) -> dbl(active(X))
active(dbls(X)) -> dbls(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(indx(X1, X2)) -> indx(active(X1), X2)
active(dbl1(X)) -> dbl1(active(X))
active(s1(X)) -> s1(active(X))
active(sel1(X1, X2)) -> sel1(active(X1), X2)
active(sel1(X1, X2)) -> sel1(X1, active(X2))
active(quote(X)) -> quote(active(X))
dbl(mark(X)) -> mark(dbl(X))
dbl(ok(X)) -> ok(dbl(X))
dbls(mark(X)) -> mark(dbls(X))
dbls(ok(X)) -> ok(dbls(X))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
indx(mark(X1), X2) -> mark(indx(X1, X2))
indx(ok(X1), ok(X2)) -> ok(indx(X1, X2))
dbl1(mark(X)) -> mark(dbl1(X))
dbl1(ok(X)) -> ok(dbl1(X))
s1(mark(X)) -> mark(s1(X))
s1(ok(X)) -> ok(s1(X))
sel1(mark(X1), X2) -> mark(sel1(X1, X2))
sel1(X1, mark(X2)) -> mark(sel1(X1, X2))
sel1(ok(X1), ok(X2)) -> ok(sel1(X1, X2))
quote(mark(X)) -> mark(quote(X))
quote(ok(X)) -> ok(quote(X))
proper(dbl(X)) -> dbl(proper(X))
proper(0) -> ok(0)
proper(s(X)) -> s(proper(X))
proper(dbls(X)) -> dbls(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(indx(X1, X2)) -> indx(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(dbl1(X)) -> dbl1(proper(X))
proper(01) -> ok(01)
proper(s1(X)) -> s1(proper(X))
proper(sel1(X1, X2)) -> sel1(proper(X1), proper(X2))
proper(quote(X)) -> quote(proper(X))
s(ok(X)) -> ok(s(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
from(ok(X)) -> ok(from(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
         ↳Polo
       →DP Problem 2
         ↳Polo
       →DP Problem 3
         ↳Polynomial Ordering
       →DP Problem 4
         ↳Polo
       →DP Problem 5
         ↳Polo
       →DP Problem 6
         ↳Polo
       →DP Problem 7
         ↳Polo
       →DP Problem 8
         ↳Polo
       →DP Problem 9
         ↳Polo
       →DP Problem 10
         ↳Polo
       →DP Problem 11
         ↳Polo
       →DP Problem 12
         ↳Polo
       →DP Problem 13
         ↳Polo
       →DP Problem 14
         ↳Remaining


Dependency Pair:

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


Rules:


active(dbl(0)) -> mark(0)
active(dbl(s(X))) -> mark(s(s(dbl(X))))
active(dbls(nil)) -> mark(nil)
active(dbls(cons(X, Y))) -> mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) -> mark(X)
active(sel(s(X), cons(Y, Z))) -> mark(sel(X, Z))
active(indx(nil, X)) -> mark(nil)
active(indx(cons(X, Y), Z)) -> mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) -> mark(cons(X, from(s(X))))
active(dbl1(0)) -> mark(01)
active(dbl1(s(X))) -> mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) -> mark(X)
active(sel1(s(X), cons(Y, Z))) -> mark(sel1(X, Z))
active(quote(0)) -> mark(01)
active(quote(s(X))) -> mark(s1(quote(X)))
active(quote(dbl(X))) -> mark(dbl1(X))
active(quote(sel(X, Y))) -> mark(sel1(X, Y))
active(dbl(X)) -> dbl(active(X))
active(dbls(X)) -> dbls(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(indx(X1, X2)) -> indx(active(X1), X2)
active(dbl1(X)) -> dbl1(active(X))
active(s1(X)) -> s1(active(X))
active(sel1(X1, X2)) -> sel1(active(X1), X2)
active(sel1(X1, X2)) -> sel1(X1, active(X2))
active(quote(X)) -> quote(active(X))
dbl(mark(X)) -> mark(dbl(X))
dbl(ok(X)) -> ok(dbl(X))
dbls(mark(X)) -> mark(dbls(X))
dbls(ok(X)) -> ok(dbls(X))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
indx(mark(X1), X2) -> mark(indx(X1, X2))
indx(ok(X1), ok(X2)) -> ok(indx(X1, X2))
dbl1(mark(X)) -> mark(dbl1(X))
dbl1(ok(X)) -> ok(dbl1(X))
s1(mark(X)) -> mark(s1(X))
s1(ok(X)) -> ok(s1(X))
sel1(mark(X1), X2) -> mark(sel1(X1, X2))
sel1(X1, mark(X2)) -> mark(sel1(X1, X2))
sel1(ok(X1), ok(X2)) -> ok(sel1(X1, X2))
quote(mark(X)) -> mark(quote(X))
quote(ok(X)) -> ok(quote(X))
proper(dbl(X)) -> dbl(proper(X))
proper(0) -> ok(0)
proper(s(X)) -> s(proper(X))
proper(dbls(X)) -> dbls(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(indx(X1, X2)) -> indx(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(dbl1(X)) -> dbl1(proper(X))
proper(01) -> ok(01)
proper(s1(X)) -> s1(proper(X))
proper(sel1(X1, X2)) -> sel1(proper(X1), proper(X2))
proper(quote(X)) -> quote(proper(X))
s(ok(X)) -> ok(s(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
from(ok(X)) -> ok(from(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))


Strategy:

innermost




The following dependency pair can be strictly oriented:

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


There are no usable rules for innermost w.r.t. to the implicit AFS that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:
  POL(ok(x1))=  1 + x1  
  POL(CONS(x1, x2))=  x1  

resulting in one new DP problem. 



   R
     ↳DPs
       →DP Problem 1
         ↳Polo
       →DP Problem 2
         ↳Polo
       →DP Problem 3
         ↳Polo
           →DP Problem 18
             ↳Dependency Graph
       →DP Problem 4
         ↳Polo
       →DP Problem 5
         ↳Polo
       →DP Problem 6
         ↳Polo
       →DP Problem 7
         ↳Polo
       →DP Problem 8
         ↳Polo
       →DP Problem 9
         ↳Polo
       →DP Problem 10
         ↳Polo
       →DP Problem 11
         ↳Polo
       →DP Problem 12
         ↳Polo
       →DP Problem 13
         ↳Polo
       →DP Problem 14
         ↳Remaining


Dependency Pair:


Rules:


active(dbl(0)) -> mark(0)
active(dbl(s(X))) -> mark(s(s(dbl(X))))
active(dbls(nil)) -> mark(nil)
active(dbls(cons(X, Y))) -> mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) -> mark(X)
active(sel(s(X), cons(Y, Z))) -> mark(sel(X, Z))
active(indx(nil, X)) -> mark(nil)
active(indx(cons(X, Y), Z)) -> mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) -> mark(cons(X, from(s(X))))
active(dbl1(0)) -> mark(01)
active(dbl1(s(X))) -> mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) -> mark(X)
active(sel1(s(X), cons(Y, Z))) -> mark(sel1(X, Z))
active(quote(0)) -> mark(01)
active(quote(s(X))) -> mark(s1(quote(X)))
active(quote(dbl(X))) -> mark(dbl1(X))
active(quote(sel(X, Y))) -> mark(sel1(X, Y))
active(dbl(X)) -> dbl(active(X))
active(dbls(X)) -> dbls(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(indx(X1, X2)) -> indx(active(X1), X2)
active(dbl1(X)) -> dbl1(active(X))
active(s1(X)) -> s1(active(X))
active(sel1(X1, X2)) -> sel1(active(X1), X2)
active(sel1(X1, X2)) -> sel1(X1, active(X2))
active(quote(X)) -> quote(active(X))
dbl(mark(X)) -> mark(dbl(X))
dbl(ok(X)) -> ok(dbl(X))
dbls(mark(X)) -> mark(dbls(X))
dbls(ok(X)) -> ok(dbls(X))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
indx(mark(X1), X2) -> mark(indx(X1, X2))
indx(ok(X1), ok(X2)) -> ok(indx(X1, X2))
dbl1(mark(X)) -> mark(dbl1(X))
dbl1(ok(X)) -> ok(dbl1(X))
s1(mark(X)) -> mark(s1(X))
s1(ok(X)) -> ok(s1(X))
sel1(mark(X1), X2) -> mark(sel1(X1, X2))
sel1(X1, mark(X2)) -> mark(sel1(X1, X2))
sel1(ok(X1), ok(X2)) -> ok(sel1(X1, X2))
quote(mark(X)) -> mark(quote(X))
quote(ok(X)) -> ok(quote(X))
proper(dbl(X)) -> dbl(proper(X))
proper(0) -> ok(0)
proper(s(X)) -> s(proper(X))
proper(dbls(X)) -> dbls(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(indx(X1, X2)) -> indx(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(dbl1(X)) -> dbl1(proper(X))
proper(01) -> ok(01)
proper(s1(X)) -> s1(proper(X))
proper(sel1(X1, X2)) -> sel1(proper(X1), proper(X2))
proper(quote(X)) -> quote(proper(X))
s(ok(X)) -> ok(s(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
from(ok(X)) -> ok(from(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
         ↳Polo
       →DP Problem 2
         ↳Polo
       →DP Problem 3
         ↳Polo
       →DP Problem 4
         ↳Polynomial Ordering
       →DP Problem 5
         ↳Polo
       →DP Problem 6
         ↳Polo
       →DP Problem 7
         ↳Polo
       →DP Problem 8
         ↳Polo
       →DP Problem 9
         ↳Polo
       →DP Problem 10
         ↳Polo
       →DP Problem 11
         ↳Polo
       →DP Problem 12
         ↳Polo
       →DP Problem 13
         ↳Polo
       →DP Problem 14
         ↳Remaining


Dependency Pairs:

DBLS(ok(X)) -> DBLS(X)
DBLS(mark(X)) -> DBLS(X)


Rules:


active(dbl(0)) -> mark(0)
active(dbl(s(X))) -> mark(s(s(dbl(X))))
active(dbls(nil)) -> mark(nil)
active(dbls(cons(X, Y))) -> mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) -> mark(X)
active(sel(s(X), cons(Y, Z))) -> mark(sel(X, Z))
active(indx(nil, X)) -> mark(nil)
active(indx(cons(X, Y), Z)) -> mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) -> mark(cons(X, from(s(X))))
active(dbl1(0)) -> mark(01)
active(dbl1(s(X))) -> mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) -> mark(X)
active(sel1(s(X), cons(Y, Z))) -> mark(sel1(X, Z))
active(quote(0)) -> mark(01)
active(quote(s(X))) -> mark(s1(quote(X)))
active(quote(dbl(X))) -> mark(dbl1(X))
active(quote(sel(X, Y))) -> mark(sel1(X, Y))
active(dbl(X)) -> dbl(active(X))
active(dbls(X)) -> dbls(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(indx(X1, X2)) -> indx(active(X1), X2)
active(dbl1(X)) -> dbl1(active(X))
active(s1(X)) -> s1(active(X))
active(sel1(X1, X2)) -> sel1(active(X1), X2)
active(sel1(X1, X2)) -> sel1(X1, active(X2))
active(quote(X)) -> quote(active(X))
dbl(mark(X)) -> mark(dbl(X))
dbl(ok(X)) -> ok(dbl(X))
dbls(mark(X)) -> mark(dbls(X))
dbls(ok(X)) -> ok(dbls(X))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
indx(mark(X1), X2) -> mark(indx(X1, X2))
indx(ok(X1), ok(X2)) -> ok(indx(X1, X2))
dbl1(mark(X)) -> mark(dbl1(X))
dbl1(ok(X)) -> ok(dbl1(X))
s1(mark(X)) -> mark(s1(X))
s1(ok(X)) -> ok(s1(X))
sel1(mark(X1), X2) -> mark(sel1(X1, X2))
sel1(X1, mark(X2)) -> mark(sel1(X1, X2))
sel1(ok(X1), ok(X2)) -> ok(sel1(X1, X2))
quote(mark(X)) -> mark(quote(X))
quote(ok(X)) -> ok(quote(X))
proper(dbl(X)) -> dbl(proper(X))
proper(0) -> ok(0)
proper(s(X)) -> s(proper(X))
proper(dbls(X)) -> dbls(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(indx(X1, X2)) -> indx(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(dbl1(X)) -> dbl1(proper(X))
proper(01) -> ok(01)
proper(s1(X)) -> s1(proper(X))
proper(sel1(X1, X2)) -> sel1(proper(X1), proper(X2))
proper(quote(X)) -> quote(proper(X))
s(ok(X)) -> ok(s(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
from(ok(X)) -> ok(from(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))


Strategy:

innermost




The following dependency pair can be strictly oriented:

DBLS(ok(X)) -> DBLS(X)


There are no usable rules for innermost w.r.t. to the implicit AFS that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:
  POL(mark(x1))=  x1  
  POL(ok(x1))=  1 + x1  
  POL(DBLS(x1))=  x1  

resulting in one new DP problem. 



   R
     ↳DPs
       →DP Problem 1
         ↳Polo
       →DP Problem 2
         ↳Polo
       →DP Problem 3
         ↳Polo
       →DP Problem 4
         ↳Polo
           →DP Problem 19
             ↳Polynomial Ordering
       →DP Problem 5
         ↳Polo
       →DP Problem 6
         ↳Polo
       →DP Problem 7
         ↳Polo
       →DP Problem 8
         ↳Polo
       →DP Problem 9
         ↳Polo
       →DP Problem 10
         ↳Polo
       →DP Problem 11
         ↳Polo
       →DP Problem 12
         ↳Polo
       →DP Problem 13
         ↳Polo
       →DP Problem 14
         ↳Remaining


Dependency Pair:

DBLS(mark(X)) -> DBLS(X)


Rules:


active(dbl(0)) -> mark(0)
active(dbl(s(X))) -> mark(s(s(dbl(X))))
active(dbls(nil)) -> mark(nil)
active(dbls(cons(X, Y))) -> mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) -> mark(X)
active(sel(s(X), cons(Y, Z))) -> mark(sel(X, Z))
active(indx(nil, X)) -> mark(nil)
active(indx(cons(X, Y), Z)) -> mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) -> mark(cons(X, from(s(X))))
active(dbl1(0)) -> mark(01)
active(dbl1(s(X))) -> mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) -> mark(X)
active(sel1(s(X), cons(Y, Z))) -> mark(sel1(X, Z))
active(quote(0)) -> mark(01)
active(quote(s(X))) -> mark(s1(quote(X)))
active(quote(dbl(X))) -> mark(dbl1(X))
active(quote(sel(X, Y))) -> mark(sel1(X, Y))
active(dbl(X)) -> dbl(active(X))
active(dbls(X)) -> dbls(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(indx(X1, X2)) -> indx(active(X1), X2)
active(dbl1(X)) -> dbl1(active(X))
active(s1(X)) -> s1(active(X))
active(sel1(X1, X2)) -> sel1(active(X1), X2)
active(sel1(X1, X2)) -> sel1(X1, active(X2))
active(quote(X)) -> quote(active(X))
dbl(mark(X)) -> mark(dbl(X))
dbl(ok(X)) -> ok(dbl(X))
dbls(mark(X)) -> mark(dbls(X))
dbls(ok(X)) -> ok(dbls(X))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
indx(mark(X1), X2) -> mark(indx(X1, X2))
indx(ok(X1), ok(X2)) -> ok(indx(X1, X2))
dbl1(mark(X)) -> mark(dbl1(X))
dbl1(ok(X)) -> ok(dbl1(X))
s1(mark(X)) -> mark(s1(X))
s1(ok(X)) -> ok(s1(X))
sel1(mark(X1), X2) -> mark(sel1(X1, X2))
sel1(X1, mark(X2)) -> mark(sel1(X1, X2))
sel1(ok(X1), ok(X2)) -> ok(sel1(X1, X2))
quote(mark(X)) -> mark(quote(X))
quote(ok(X)) -> ok(quote(X))
proper(dbl(X)) -> dbl(proper(X))
proper(0) -> ok(0)
proper(s(X)) -> s(proper(X))
proper(dbls(X)) -> dbls(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(indx(X1, X2)) -> indx(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(dbl1(X)) -> dbl1(proper(X))
proper(01) -> ok(01)
proper(s1(X)) -> s1(proper(X))
proper(sel1(X1, X2)) -> sel1(proper(X1), proper(X2))
proper(quote(X)) -> quote(proper(X))
s(ok(X)) -> ok(s(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
from(ok(X)) -> ok(from(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))


Strategy:

innermost




The following dependency pair can be strictly oriented:

DBLS(mark(X)) -> DBLS(X)


There are no usable rules for innermost w.r.t. to the implicit AFS that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:
  POL(mark(x1))=  1 + x1  
  POL(DBLS(x1))=  x1  

resulting in one new DP problem. 



   R
     ↳DPs
       →DP Problem 1
         ↳Polo
       →DP Problem 2
         ↳Polo
       →DP Problem 3
         ↳Polo
       →DP Problem 4
         ↳Polo
           →DP Problem 19
             ↳Polo
             ...
               →DP Problem 20
                 ↳Dependency Graph
       →DP Problem 5
         ↳Polo
       →DP Problem 6
         ↳Polo
       →DP Problem 7
         ↳Polo
       →DP Problem 8
         ↳Polo
       →DP Problem 9
         ↳Polo
       →DP Problem 10
         ↳Polo
       →DP Problem 11
         ↳Polo
       →DP Problem 12
         ↳Polo
       →DP Problem 13
         ↳Polo
       →DP Problem 14
         ↳Remaining


Dependency Pair:


Rules:


active(dbl(0)) -> mark(0)
active(dbl(s(X))) -> mark(s(s(dbl(X))))
active(dbls(nil)) -> mark(nil)
active(dbls(cons(X, Y))) -> mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) -> mark(X)
active(sel(s(X), cons(Y, Z))) -> mark(sel(X, Z))
active(indx(nil, X)) -> mark(nil)
active(indx(cons(X, Y), Z)) -> mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) -> mark(cons(X, from(s(X))))
active(dbl1(0)) -> mark(01)
active(dbl1(s(X))) -> mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) -> mark(X)
active(sel1(s(X), cons(Y, Z))) -> mark(sel1(X, Z))
active(quote(0)) -> mark(01)
active(quote(s(X))) -> mark(s1(quote(X)))
active(quote(dbl(X))) -> mark(dbl1(X))
active(quote(sel(X, Y))) -> mark(sel1(X, Y))
active(dbl(X)) -> dbl(active(X))
active(dbls(X)) -> dbls(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(indx(X1, X2)) -> indx(active(X1), X2)
active(dbl1(X)) -> dbl1(active(X))
active(s1(X)) -> s1(active(X))
active(sel1(X1, X2)) -> sel1(active(X1), X2)
active(sel1(X1, X2)) -> sel1(X1, active(X2))
active(quote(X)) -> quote(active(X))
dbl(mark(X)) -> mark(dbl(X))
dbl(ok(X)) -> ok(dbl(X))
dbls(mark(X)) -> mark(dbls(X))
dbls(ok(X)) -> ok(dbls(X))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
indx(mark(X1), X2) -> mark(indx(X1, X2))
indx(ok(X1), ok(X2)) -> ok(indx(X1, X2))
dbl1(mark(X)) -> mark(dbl1(X))
dbl1(ok(X)) -> ok(dbl1(X))
s1(mark(X)) -> mark(s1(X))
s1(ok(X)) -> ok(s1(X))
sel1(mark(X1), X2) -> mark(sel1(X1, X2))
sel1(X1, mark(X2)) -> mark(sel1(X1, X2))
sel1(ok(X1), ok(X2)) -> ok(sel1(X1, X2))
quote(mark(X)) -> mark(quote(X))
quote(ok(X)) -> ok(quote(X))
proper(dbl(X)) -> dbl(proper(X))
proper(0) -> ok(0)
proper(s(X)) -> s(proper(X))
proper(dbls(X)) -> dbls(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(indx(X1, X2)) -> indx(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(dbl1(X)) -> dbl1(proper(X))
proper(01) -> ok(01)
proper(s1(X)) -> s1(proper(X))
proper(sel1(X1, X2)) -> sel1(proper(X1), proper(X2))
proper(quote(X)) -> quote(proper(X))
s(ok(X)) -> ok(s(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
from(ok(X)) -> ok(from(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
         ↳Polo
       →DP Problem 2
         ↳Polo
       →DP Problem 3
         ↳Polo
       →DP Problem 4
         ↳Polo
       →DP Problem 5
         ↳Polynomial Ordering
       →DP Problem 6
         ↳Polo
       →DP Problem 7
         ↳Polo
       →DP Problem 8
         ↳Polo
       →DP Problem 9
         ↳Polo
       →DP Problem 10
         ↳Polo
       →DP Problem 11
         ↳Polo
       →DP Problem 12
         ↳Polo
       →DP Problem 13
         ↳Polo
       →DP Problem 14
         ↳Remaining


Dependency Pairs:

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


Rules:


active(dbl(0)) -> mark(0)
active(dbl(s(X))) -> mark(s(s(dbl(X))))
active(dbls(nil)) -> mark(nil)
active(dbls(cons(X, Y))) -> mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) -> mark(X)
active(sel(s(X), cons(Y, Z))) -> mark(sel(X, Z))
active(indx(nil, X)) -> mark(nil)
active(indx(cons(X, Y), Z)) -> mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) -> mark(cons(X, from(s(X))))
active(dbl1(0)) -> mark(01)
active(dbl1(s(X))) -> mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) -> mark(X)
active(sel1(s(X), cons(Y, Z))) -> mark(sel1(X, Z))
active(quote(0)) -> mark(01)
active(quote(s(X))) -> mark(s1(quote(X)))
active(quote(dbl(X))) -> mark(dbl1(X))
active(quote(sel(X, Y))) -> mark(sel1(X, Y))
active(dbl(X)) -> dbl(active(X))
active(dbls(X)) -> dbls(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(indx(X1, X2)) -> indx(active(X1), X2)
active(dbl1(X)) -> dbl1(active(X))
active(s1(X)) -> s1(active(X))
active(sel1(X1, X2)) -> sel1(active(X1), X2)
active(sel1(X1, X2)) -> sel1(X1, active(X2))
active(quote(X)) -> quote(active(X))
dbl(mark(X)) -> mark(dbl(X))
dbl(ok(X)) -> ok(dbl(X))
dbls(mark(X)) -> mark(dbls(X))
dbls(ok(X)) -> ok(dbls(X))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
indx(mark(X1), X2) -> mark(indx(X1, X2))
indx(ok(X1), ok(X2)) -> ok(indx(X1, X2))
dbl1(mark(X)) -> mark(dbl1(X))
dbl1(ok(X)) -> ok(dbl1(X))
s1(mark(X)) -> mark(s1(X))
s1(ok(X)) -> ok(s1(X))
sel1(mark(X1), X2) -> mark(sel1(X1, X2))
sel1(X1, mark(X2)) -> mark(sel1(X1, X2))
sel1(ok(X1), ok(X2)) -> ok(sel1(X1, X2))
quote(mark(X)) -> mark(quote(X))
quote(ok(X)) -> ok(quote(X))
proper(dbl(X)) -> dbl(proper(X))
proper(0) -> ok(0)
proper(s(X)) -> s(proper(X))
proper(dbls(X)) -> dbls(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(indx(X1, X2)) -> indx(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(dbl1(X)) -> dbl1(proper(X))
proper(01) -> ok(01)
proper(s1(X)) -> s1(proper(X))
proper(sel1(X1, X2)) -> sel1(proper(X1), proper(X2))
proper(quote(X)) -> quote(proper(X))
s(ok(X)) -> ok(s(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
from(ok(X)) -> ok(from(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))


Strategy:

innermost




The following dependency pair can be strictly oriented:

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


There are no usable rules for innermost w.r.t. to the implicit AFS that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:
  POL(SEL(x1, x2))=  x1  
  POL(mark(x1))=  x1  
  POL(ok(x1))=  1 + x1  

resulting in one new DP problem. 



   R
     ↳DPs
       →DP Problem 1
         ↳Polo
       →DP Problem 2
         ↳Polo
       →DP Problem 3
         ↳Polo
       →DP Problem 4
         ↳Polo
       →DP Problem 5
         ↳Polo
           →DP Problem 21
             ↳Polynomial Ordering
       →DP Problem 6
         ↳Polo
       →DP Problem 7
         ↳Polo
       →DP Problem 8
         ↳Polo
       →DP Problem 9
         ↳Polo
       →DP Problem 10
         ↳Polo
       →DP Problem 11
         ↳Polo
       →DP Problem 12
         ↳Polo
       →DP Problem 13
         ↳Polo
       →DP Problem 14
         ↳Remaining


Dependency Pairs:

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


Rules:


active(dbl(0)) -> mark(0)
active(dbl(s(X))) -> mark(s(s(dbl(X))))
active(dbls(nil)) -> mark(nil)
active(dbls(cons(X, Y))) -> mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) -> mark(X)
active(sel(s(X), cons(Y, Z))) -> mark(sel(X, Z))
active(indx(nil, X)) -> mark(nil)
active(indx(cons(X, Y), Z)) -> mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) -> mark(cons(X, from(s(X))))
active(dbl1(0)) -> mark(01)
active(dbl1(s(X))) -> mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) -> mark(X)
active(sel1(s(X), cons(Y, Z))) -> mark(sel1(X, Z))
active(quote(0)) -> mark(01)
active(quote(s(X))) -> mark(s1(quote(X)))
active(quote(dbl(X))) -> mark(dbl1(X))
active(quote(sel(X, Y))) -> mark(sel1(X, Y))
active(dbl(X)) -> dbl(active(X))
active(dbls(X)) -> dbls(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(indx(X1, X2)) -> indx(active(X1), X2)
active(dbl1(X)) -> dbl1(active(X))
active(s1(X)) -> s1(active(X))
active(sel1(X1, X2)) -> sel1(active(X1), X2)
active(sel1(X1, X2)) -> sel1(X1, active(X2))
active(quote(X)) -> quote(active(X))
dbl(mark(X)) -> mark(dbl(X))
dbl(ok(X)) -> ok(dbl(X))
dbls(mark(X)) -> mark(dbls(X))
dbls(ok(X)) -> ok(dbls(X))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
indx(mark(X1), X2) -> mark(indx(X1, X2))
indx(ok(X1), ok(X2)) -> ok(indx(X1, X2))
dbl1(mark(X)) -> mark(dbl1(X))
dbl1(ok(X)) -> ok(dbl1(X))
s1(mark(X)) -> mark(s1(X))
s1(ok(X)) -> ok(s1(X))
sel1(mark(X1), X2) -> mark(sel1(X1, X2))
sel1(X1, mark(X2)) -> mark(sel1(X1, X2))
sel1(ok(X1), ok(X2)) -> ok(sel1(X1, X2))
quote(mark(X)) -> mark(quote(X))
quote(ok(X)) -> ok(quote(X))
proper(dbl(X)) -> dbl(proper(X))
proper(0) -> ok(0)
proper(s(X)) -> s(proper(X))
proper(dbls(X)) -> dbls(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(indx(X1, X2)) -> indx(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(dbl1(X)) -> dbl1(proper(X))
proper(01) -> ok(01)
proper(s1(X)) -> s1(proper(X))
proper(sel1(X1, X2)) -> sel1(proper(X1), proper(X2))
proper(quote(X)) -> quote(proper(X))
s(ok(X)) -> ok(s(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
from(ok(X)) -> ok(from(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))


Strategy:

innermost




The following dependency pair can be strictly oriented:

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


There are no usable rules for innermost w.r.t. to the implicit AFS that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:
  POL(SEL(x1, x2))=  x2  
  POL(mark(x1))=  1 + x1  

resulting in one new DP problem. 



   R
     ↳DPs
       →DP Problem 1
         ↳Polo
       →DP Problem 2
         ↳Polo
       →DP Problem 3
         ↳Polo
       →DP Problem 4
         ↳Polo
       →DP Problem 5
         ↳Polo
           →DP Problem 21
             ↳Polo
             ...
               →DP Problem 22
                 ↳Polynomial Ordering
       →DP Problem 6
         ↳Polo
       →DP Problem 7
         ↳Polo
       →DP Problem 8
         ↳Polo
       →DP Problem 9
         ↳Polo
       →DP Problem 10
         ↳Polo
       →DP Problem 11
         ↳Polo
       →DP Problem 12
         ↳Polo
       →DP Problem 13
         ↳Polo
       →DP Problem 14
         ↳Remaining


Dependency Pair:

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


Rules:


active(dbl(0)) -> mark(0)
active(dbl(s(X))) -> mark(s(s(dbl(X))))
active(dbls(nil)) -> mark(nil)
active(dbls(cons(X, Y))) -> mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) -> mark(X)
active(sel(s(X), cons(Y, Z))) -> mark(sel(X, Z))
active(indx(nil, X)) -> mark(nil)
active(indx(cons(X, Y), Z)) -> mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) -> mark(cons(X, from(s(X))))
active(dbl1(0)) -> mark(01)
active(dbl1(s(X))) -> mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) -> mark(X)
active(sel1(s(X), cons(Y, Z))) -> mark(sel1(X, Z))
active(quote(0)) -> mark(01)
active(quote(s(X))) -> mark(s1(quote(X)))
active(quote(dbl(X))) -> mark(dbl1(X))
active(quote(sel(X, Y))) -> mark(sel1(X, Y))
active(dbl(X)) -> dbl(active(X))
active(dbls(X)) -> dbls(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(indx(X1, X2)) -> indx(active(X1), X2)
active(dbl1(X)) -> dbl1(active(X))
active(s1(X)) -> s1(active(X))
active(sel1(X1, X2)) -> sel1(active(X1), X2)
active(sel1(X1, X2)) -> sel1(X1, active(X2))
active(quote(X)) -> quote(active(X))
dbl(mark(X)) -> mark(dbl(X))
dbl(ok(X)) -> ok(dbl(X))
dbls(mark(X)) -> mark(dbls(X))
dbls(ok(X)) -> ok(dbls(X))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
indx(mark(X1), X2) -> mark(indx(X1, X2))
indx(ok(X1), ok(X2)) -> ok(indx(X1, X2))
dbl1(mark(X)) -> mark(dbl1(X))
dbl1(ok(X)) -> ok(dbl1(X))
s1(mark(X)) -> mark(s1(X))
s1(ok(X)) -> ok(s1(X))
sel1(mark(X1), X2) -> mark(sel1(X1, X2))
sel1(X1, mark(X2)) -> mark(sel1(X1, X2))
sel1(ok(X1), ok(X2)) -> ok(sel1(X1, X2))
quote(mark(X)) -> mark(quote(X))
quote(ok(X)) -> ok(quote(X))
proper(dbl(X)) -> dbl(proper(X))
proper(0) -> ok(0)
proper(s(X)) -> s(proper(X))
proper(dbls(X)) -> dbls(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(indx(X1, X2)) -> indx(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(dbl1(X)) -> dbl1(proper(X))
proper(01) -> ok(01)
proper(s1(X)) -> s1(proper(X))
proper(sel1(X1, X2)) -> sel1(proper(X1), proper(X2))
proper(quote(X)) -> quote(proper(X))
s(ok(X)) -> ok(s(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
from(ok(X)) -> ok(from(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))


Strategy:

innermost




The following dependency pair can be strictly oriented:

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


There are no usable rules for innermost w.r.t. to the implicit AFS that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:
  POL(SEL(x1, x2))=  x1  
  POL(mark(x1))=  1 + x1  

resulting in one new DP problem. 



   R
     ↳DPs
       →DP Problem 1
         ↳Polo
       →DP Problem 2
         ↳Polo
       →DP Problem 3
         ↳Polo
       →DP Problem 4
         ↳Polo
       →DP Problem 5
         ↳Polo
           →DP Problem 21
             ↳Polo
             ...
               →DP Problem 23
                 ↳Dependency Graph
       →DP Problem 6
         ↳Polo
       →DP Problem 7
         ↳Polo
       →DP Problem 8
         ↳Polo
       →DP Problem 9
         ↳Polo
       →DP Problem 10
         ↳Polo
       →DP Problem 11
         ↳Polo
       →DP Problem 12
         ↳Polo
       →DP Problem 13
         ↳Polo
       →DP Problem 14
         ↳Remaining


Dependency Pair:


Rules:


active(dbl(0)) -> mark(0)
active(dbl(s(X))) -> mark(s(s(dbl(X))))
active(dbls(nil)) -> mark(nil)
active(dbls(cons(X, Y))) -> mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) -> mark(X)
active(sel(s(X), cons(Y, Z))) -> mark(sel(X, Z))
active(indx(nil, X)) -> mark(nil)
active(indx(cons(X, Y), Z)) -> mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) -> mark(cons(X, from(s(X))))
active(dbl1(0)) -> mark(01)
active(dbl1(s(X))) -> mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) -> mark(X)
active(sel1(s(X), cons(Y, Z))) -> mark(sel1(X, Z))
active(quote(0)) -> mark(01)
active(quote(s(X))) -> mark(s1(quote(X)))
active(quote(dbl(X))) -> mark(dbl1(X))
active(quote(sel(X, Y))) -> mark(sel1(X, Y))
active(dbl(X)) -> dbl(active(X))
active(dbls(X)) -> dbls(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(indx(X1, X2)) -> indx(active(X1), X2)
active(dbl1(X)) -> dbl1(active(X))
active(s1(X)) -> s1(active(X))
active(sel1(X1, X2)) -> sel1(active(X1), X2)
active(sel1(X1, X2)) -> sel1(X1, active(X2))
active(quote(X)) -> quote(active(X))
dbl(mark(X)) -> mark(dbl(X))
dbl(ok(X)) -> ok(dbl(X))
dbls(mark(X)) -> mark(dbls(X))
dbls(ok(X)) -> ok(dbls(X))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
indx(mark(X1), X2) -> mark(indx(X1, X2))
indx(ok(X1), ok(X2)) -> ok(indx(X1, X2))
dbl1(mark(X)) -> mark(dbl1(X))
dbl1(ok(X)) -> ok(dbl1(X))
s1(mark(X)) -> mark(s1(X))
s1(ok(X)) -> ok(s1(X))
sel1(mark(X1), X2) -> mark(sel1(X1, X2))
sel1(X1, mark(X2)) -> mark(sel1(X1, X2))
sel1(ok(X1), ok(X2)) -> ok(sel1(X1, X2))
quote(mark(X)) -> mark(quote(X))
quote(ok(X)) -> ok(quote(X))
proper(dbl(X)) -> dbl(proper(X))
proper(0) -> ok(0)
proper(s(X)) -> s(proper(X))
proper(dbls(X)) -> dbls(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(indx(X1, X2)) -> indx(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(dbl1(X)) -> dbl1(proper(X))
proper(01) -> ok(01)
proper(s1(X)) -> s1(proper(X))
proper(sel1(X1, X2)) -> sel1(proper(X1), proper(X2))
proper(quote(X)) -> quote(proper(X))
s(ok(X)) -> ok(s(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
from(ok(X)) -> ok(from(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
         ↳Polo
       →DP Problem 2
         ↳Polo
       →DP Problem 3
         ↳Polo
       →DP Problem 4
         ↳Polo
       →DP Problem 5
         ↳Polo
       →DP Problem 6
         ↳Polynomial Ordering
       →DP Problem 7
         ↳Polo
       →DP Problem 8
         ↳Polo
       →DP Problem 9
         ↳Polo
       →DP Problem 10
         ↳Polo
       →DP Problem 11
         ↳Polo
       →DP Problem 12
         ↳Polo
       →DP Problem 13
         ↳Polo
       →DP Problem 14
         ↳Remaining


Dependency Pairs:

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


Rules:


active(dbl(0)) -> mark(0)
active(dbl(s(X))) -> mark(s(s(dbl(X))))
active(dbls(nil)) -> mark(nil)
active(dbls(cons(X, Y))) -> mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) -> mark(X)
active(sel(s(X), cons(Y, Z))) -> mark(sel(X, Z))
active(indx(nil, X)) -> mark(nil)
active(indx(cons(X, Y), Z)) -> mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) -> mark(cons(X, from(s(X))))
active(dbl1(0)) -> mark(01)
active(dbl1(s(X))) -> mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) -> mark(X)
active(sel1(s(X), cons(Y, Z))) -> mark(sel1(X, Z))
active(quote(0)) -> mark(01)
active(quote(s(X))) -> mark(s1(quote(X)))
active(quote(dbl(X))) -> mark(dbl1(X))
active(quote(sel(X, Y))) -> mark(sel1(X, Y))
active(dbl(X)) -> dbl(active(X))
active(dbls(X)) -> dbls(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(indx(X1, X2)) -> indx(active(X1), X2)
active(dbl1(X)) -> dbl1(active(X))
active(s1(X)) -> s1(active(X))
active(sel1(X1, X2)) -> sel1(active(X1), X2)
active(sel1(X1, X2)) -> sel1(X1, active(X2))
active(quote(X)) -> quote(active(X))
dbl(mark(X)) -> mark(dbl(X))
dbl(ok(X)) -> ok(dbl(X))
dbls(mark(X)) -> mark(dbls(X))
dbls(ok(X)) -> ok(dbls(X))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
indx(mark(X1), X2) -> mark(indx(X1, X2))
indx(ok(X1), ok(X2)) -> ok(indx(X1, X2))
dbl1(mark(X)) -> mark(dbl1(X))
dbl1(ok(X)) -> ok(dbl1(X))
s1(mark(X)) -> mark(s1(X))
s1(ok(X)) -> ok(s1(X))
sel1(mark(X1), X2) -> mark(sel1(X1, X2))
sel1(X1, mark(X2)) -> mark(sel1(X1, X2))
sel1(ok(X1), ok(X2)) -> ok(sel1(X1, X2))
quote(mark(X)) -> mark(quote(X))
quote(ok(X)) -> ok(quote(X))
proper(dbl(X)) -> dbl(proper(X))
proper(0) -> ok(0)
proper(s(X)) -> s(proper(X))
proper(dbls(X)) -> dbls(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(indx(X1, X2)) -> indx(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(dbl1(X)) -> dbl1(proper(X))
proper(01) -> ok(01)
proper(s1(X)) -> s1(proper(X))
proper(sel1(X1, X2)) -> sel1(proper(X1), proper(X2))
proper(quote(X)) -> quote(proper(X))
s(ok(X)) -> ok(s(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
from(ok(X)) -> ok(from(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))


Strategy:

innermost




The following dependency pair can be strictly oriented:

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


There are no usable rules for innermost w.r.t. to the implicit AFS that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:
  POL(INDX(x1, x2))=  x2  
  POL(mark(x1))=  0  
  POL(ok(x1))=  1 + x1  

resulting in one new DP problem. 



   R
     ↳DPs
       →DP Problem 1
         ↳Polo
       →DP Problem 2
         ↳Polo
       →DP Problem 3
         ↳Polo
       →DP Problem 4
         ↳Polo
       →DP Problem 5
         ↳Polo
       →DP Problem 6
         ↳Polo
           →DP Problem 24
             ↳Polynomial Ordering
       →DP Problem 7
         ↳Polo
       →DP Problem 8
         ↳Polo
       →DP Problem 9
         ↳Polo
       →DP Problem 10
         ↳Polo
       →DP Problem 11
         ↳Polo
       →DP Problem 12
         ↳Polo
       →DP Problem 13
         ↳Polo
       →DP Problem 14
         ↳Remaining


Dependency Pair:

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


Rules:


active(dbl(0)) -> mark(0)
active(dbl(s(X))) -> mark(s(s(dbl(X))))
active(dbls(nil)) -> mark(nil)
active(dbls(cons(X, Y))) -> mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) -> mark(X)
active(sel(s(X), cons(Y, Z))) -> mark(sel(X, Z))
active(indx(nil, X)) -> mark(nil)
active(indx(cons(X, Y), Z)) -> mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) -> mark(cons(X, from(s(X))))
active(dbl1(0)) -> mark(01)
active(dbl1(s(X))) -> mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) -> mark(X)
active(sel1(s(X), cons(Y, Z))) -> mark(sel1(X, Z))
active(quote(0)) -> mark(01)
active(quote(s(X))) -> mark(s1(quote(X)))
active(quote(dbl(X))) -> mark(dbl1(X))
active(quote(sel(X, Y))) -> mark(sel1(X, Y))
active(dbl(X)) -> dbl(active(X))
active(dbls(X)) -> dbls(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(indx(X1, X2)) -> indx(active(X1), X2)
active(dbl1(X)) -> dbl1(active(X))
active(s1(X)) -> s1(active(X))
active(sel1(X1, X2)) -> sel1(active(X1), X2)
active(sel1(X1, X2)) -> sel1(X1, active(X2))
active(quote(X)) -> quote(active(X))
dbl(mark(X)) -> mark(dbl(X))
dbl(ok(X)) -> ok(dbl(X))
dbls(mark(X)) -> mark(dbls(X))
dbls(ok(X)) -> ok(dbls(X))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
indx(mark(X1), X2) -> mark(indx(X1, X2))
indx(ok(X1), ok(X2)) -> ok(indx(X1, X2))
dbl1(mark(X)) -> mark(dbl1(X))
dbl1(ok(X)) -> ok(dbl1(X))
s1(mark(X)) -> mark(s1(X))
s1(ok(X)) -> ok(s1(X))
sel1(mark(X1), X2) -> mark(sel1(X1, X2))
sel1(X1, mark(X2)) -> mark(sel1(X1, X2))
sel1(ok(X1), ok(X2)) -> ok(sel1(X1, X2))
quote(mark(X)) -> mark(quote(X))
quote(ok(X)) -> ok(quote(X))
proper(dbl(X)) -> dbl(proper(X))
proper(0) -> ok(0)
proper(s(X)) -> s(proper(X))
proper(dbls(X)) -> dbls(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(indx(X1, X2)) -> indx(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(dbl1(X)) -> dbl1(proper(X))
proper(01) -> ok(01)
proper(s1(X)) -> s1(proper(X))
proper(sel1(X1, X2)) -> sel1(proper(X1), proper(X2))
proper(quote(X)) -> quote(proper(X))
s(ok(X)) -> ok(s(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
from(ok(X)) -> ok(from(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))


Strategy:

innermost




The following dependency pair can be strictly oriented:

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


There are no usable rules for innermost w.r.t. to the implicit AFS that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:
  POL(INDX(x1, x2))=  x1  
  POL(mark(x1))=  1 + x1  

resulting in one new DP problem. 



   R
     ↳DPs
       →DP Problem 1
         ↳Polo
       →DP Problem 2
         ↳Polo
       →DP Problem 3
         ↳Polo
       →DP Problem 4
         ↳Polo
       →DP Problem 5
         ↳Polo
       →DP Problem 6
         ↳Polo
           →DP Problem 24
             ↳Polo
             ...
               →DP Problem 25
                 ↳Dependency Graph
       →DP Problem 7
         ↳Polo
       →DP Problem 8
         ↳Polo
       →DP Problem 9
         ↳Polo
       →DP Problem 10
         ↳Polo
       →DP Problem 11
         ↳Polo
       →DP Problem 12
         ↳Polo
       →DP Problem 13
         ↳Polo
       →DP Problem 14
         ↳Remaining


Dependency Pair:


Rules:


active(dbl(0)) -> mark(0)
active(dbl(s(X))) -> mark(s(s(dbl(X))))
active(dbls(nil)) -> mark(nil)
active(dbls(cons(X, Y))) -> mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) -> mark(X)
active(sel(s(X), cons(Y, Z))) -> mark(sel(X, Z))
active(indx(nil, X)) -> mark(nil)
active(indx(cons(X, Y), Z)) -> mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) -> mark(cons(X, from(s(X))))
active(dbl1(0)) -> mark(01)
active(dbl1(s(X))) -> mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) -> mark(X)
active(sel1(s(X), cons(Y, Z))) -> mark(sel1(X, Z))
active(quote(0)) -> mark(01)
active(quote(s(X))) -> mark(s1(quote(X)))
active(quote(dbl(X))) -> mark(dbl1(X))
active(quote(sel(X, Y))) -> mark(sel1(X, Y))
active(dbl(X)) -> dbl(active(X))
active(dbls(X)) -> dbls(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(indx(X1, X2)) -> indx(active(X1), X2)
active(dbl1(X)) -> dbl1(active(X))
active(s1(X)) -> s1(active(X))
active(sel1(X1, X2)) -> sel1(active(X1), X2)
active(sel1(X1, X2)) -> sel1(X1, active(X2))
active(quote(X)) -> quote(active(X))
dbl(mark(X)) -> mark(dbl(X))
dbl(ok(X)) -> ok(dbl(X))
dbls(mark(X)) -> mark(dbls(X))
dbls(ok(X)) -> ok(dbls(X))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
indx(mark(X1), X2) -> mark(indx(X1, X2))
indx(ok(X1), ok(X2)) -> ok(indx(X1, X2))
dbl1(mark(X)) -> mark(dbl1(X))
dbl1(ok(X)) -> ok(dbl1(X))
s1(mark(X)) -> mark(s1(X))
s1(ok(X)) -> ok(s1(X))
sel1(mark(X1), X2) -> mark(sel1(X1, X2))
sel1(X1, mark(X2)) -> mark(sel1(X1, X2))
sel1(ok(X1), ok(X2)) -> ok(sel1(X1, X2))
quote(mark(X)) -> mark(quote(X))
quote(ok(X)) -> ok(quote(X))
proper(dbl(X)) -> dbl(proper(X))
proper(0) -> ok(0)
proper(s(X)) -> s(proper(X))
proper(dbls(X)) -> dbls(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(indx(X1, X2)) -> indx(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(dbl1(X)) -> dbl1(proper(X))
proper(01) -> ok(01)
proper(s1(X)) -> s1(proper(X))
proper(sel1(X1, X2)) -> sel1(proper(X1), proper(X2))
proper(quote(X)) -> quote(proper(X))
s(ok(X)) -> ok(s(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
from(ok(X)) -> ok(from(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
         ↳Polo
       →DP Problem 2
         ↳Polo
       →DP Problem 3
         ↳Polo
       →DP Problem 4
         ↳Polo
       →DP Problem 5
         ↳Polo
       →DP Problem 6
         ↳Polo
       →DP Problem 7
         ↳Polynomial Ordering
       →DP Problem 8
         ↳Polo
       →DP Problem 9
         ↳Polo
       →DP Problem 10
         ↳Polo
       →DP Problem 11
         ↳Polo
       →DP Problem 12
         ↳Polo
       →DP Problem 13
         ↳Polo
       →DP Problem 14
         ↳Remaining


Dependency Pair:

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


Rules:


active(dbl(0)) -> mark(0)
active(dbl(s(X))) -> mark(s(s(dbl(X))))
active(dbls(nil)) -> mark(nil)
active(dbls(cons(X, Y))) -> mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) -> mark(X)
active(sel(s(X), cons(Y, Z))) -> mark(sel(X, Z))
active(indx(nil, X)) -> mark(nil)
active(indx(cons(X, Y), Z)) -> mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) -> mark(cons(X, from(s(X))))
active(dbl1(0)) -> mark(01)
active(dbl1(s(X))) -> mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) -> mark(X)
active(sel1(s(X), cons(Y, Z))) -> mark(sel1(X, Z))
active(quote(0)) -> mark(01)
active(quote(s(X))) -> mark(s1(quote(X)))
active(quote(dbl(X))) -> mark(dbl1(X))
active(quote(sel(X, Y))) -> mark(sel1(X, Y))
active(dbl(X)) -> dbl(active(X))
active(dbls(X)) -> dbls(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(indx(X1, X2)) -> indx(active(X1), X2)
active(dbl1(X)) -> dbl1(active(X))
active(s1(X)) -> s1(active(X))
active(sel1(X1, X2)) -> sel1(active(X1), X2)
active(sel1(X1, X2)) -> sel1(X1, active(X2))
active(quote(X)) -> quote(active(X))
dbl(mark(X)) -> mark(dbl(X))
dbl(ok(X)) -> ok(dbl(X))
dbls(mark(X)) -> mark(dbls(X))
dbls(ok(X)) -> ok(dbls(X))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
indx(mark(X1), X2) -> mark(indx(X1, X2))
indx(ok(X1), ok(X2)) -> ok(indx(X1, X2))
dbl1(mark(X)) -> mark(dbl1(X))
dbl1(ok(X)) -> ok(dbl1(X))
s1(mark(X)) -> mark(s1(X))
s1(ok(X)) -> ok(s1(X))
sel1(mark(X1), X2) -> mark(sel1(X1, X2))
sel1(X1, mark(X2)) -> mark(sel1(X1, X2))
sel1(ok(X1), ok(X2)) -> ok(sel1(X1, X2))
quote(mark(X)) -> mark(quote(X))
quote(ok(X)) -> ok(quote(X))
proper(dbl(X)) -> dbl(proper(X))
proper(0) -> ok(0)
proper(s(X)) -> s(proper(X))
proper(dbls(X)) -> dbls(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(indx(X1, X2)) -> indx(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(dbl1(X)) -> dbl1(proper(X))
proper(01) -> ok(01)
proper(s1(X)) -> s1(proper(X))
proper(sel1(X1, X2)) -> sel1(proper(X1), proper(X2))
proper(quote(X)) -> quote(proper(X))
s(ok(X)) -> ok(s(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
from(ok(X)) -> ok(from(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))


Strategy:

innermost




The following dependency pair can be strictly oriented:

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


There are no usable rules for innermost w.r.t. to the implicit AFS that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:
  POL(FROM(x1))=  x1  
  POL(ok(x1))=  1 + x1  

resulting in one new DP problem. 



   R
     ↳DPs
       →DP Problem 1
         ↳Polo
       →DP Problem 2
         ↳Polo
       →DP Problem 3
         ↳Polo
       →DP Problem 4
         ↳Polo
       →DP Problem 5
         ↳Polo
       →DP Problem 6
         ↳Polo
       →DP Problem 7
         ↳Polo
           →DP Problem 26
             ↳Dependency Graph
       →DP Problem 8
         ↳Polo
       →DP Problem 9
         ↳Polo
       →DP Problem 10
         ↳Polo
       →DP Problem 11
         ↳Polo
       →DP Problem 12
         ↳Polo
       →DP Problem 13
         ↳Polo
       →DP Problem 14
         ↳Remaining


Dependency Pair:


Rules:


active(dbl(0)) -> mark(0)
active(dbl(s(X))) -> mark(s(s(dbl(X))))
active(dbls(nil)) -> mark(nil)
active(dbls(cons(X, Y))) -> mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) -> mark(X)
active(sel(s(X), cons(Y, Z))) -> mark(sel(X, Z))
active(indx(nil, X)) -> mark(nil)
active(indx(cons(X, Y), Z)) -> mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) -> mark(cons(X, from(s(X))))
active(dbl1(0)) -> mark(01)
active(dbl1(s(X))) -> mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) -> mark(X)
active(sel1(s(X), cons(Y, Z))) -> mark(sel1(X, Z))
active(quote(0)) -> mark(01)
active(quote(s(X))) -> mark(s1(quote(X)))
active(quote(dbl(X))) -> mark(dbl1(X))
active(quote(sel(X, Y))) -> mark(sel1(X, Y))
active(dbl(X)) -> dbl(active(X))
active(dbls(X)) -> dbls(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(indx(X1, X2)) -> indx(active(X1), X2)
active(dbl1(X)) -> dbl1(active(X))
active(s1(X)) -> s1(active(X))
active(sel1(X1, X2)) -> sel1(active(X1), X2)
active(sel1(X1, X2)) -> sel1(X1, active(X2))
active(quote(X)) -> quote(active(X))
dbl(mark(X)) -> mark(dbl(X))
dbl(ok(X)) -> ok(dbl(X))
dbls(mark(X)) -> mark(dbls(X))
dbls(ok(X)) -> ok(dbls(X))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
indx(mark(X1), X2) -> mark(indx(X1, X2))
indx(ok(X1), ok(X2)) -> ok(indx(X1, X2))
dbl1(mark(X)) -> mark(dbl1(X))
dbl1(ok(X)) -> ok(dbl1(X))
s1(mark(X)) -> mark(s1(X))
s1(ok(X)) -> ok(s1(X))
sel1(mark(X1), X2) -> mark(sel1(X1, X2))
sel1(X1, mark(X2)) -> mark(sel1(X1, X2))
sel1(ok(X1), ok(X2)) -> ok(sel1(X1, X2))
quote(mark(X)) -> mark(quote(X))
quote(ok(X)) -> ok(quote(X))
proper(dbl(X)) -> dbl(proper(X))
proper(0) -> ok(0)
proper(s(X)) -> s(proper(X))
proper(dbls(X)) -> dbls(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(indx(X1, X2)) -> indx(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(dbl1(X)) -> dbl1(proper(X))
proper(01) -> ok(01)
proper(s1(X)) -> s1(proper(X))
proper(sel1(X1, X2)) -> sel1(proper(X1), proper(X2))
proper(quote(X)) -> quote(proper(X))
s(ok(X)) -> ok(s(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
from(ok(X)) -> ok(from(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
         ↳Polo
       →DP Problem 2
         ↳Polo
       →DP Problem 3
         ↳Polo
       →DP Problem 4
         ↳Polo
       →DP Problem 5
         ↳Polo
       →DP Problem 6
         ↳Polo
       →DP Problem 7
         ↳Polo
       →DP Problem 8
         ↳Polynomial Ordering
       →DP Problem 9
         ↳Polo
       →DP Problem 10
         ↳Polo
       →DP Problem 11
         ↳Polo
       →DP Problem 12
         ↳Polo
       →DP Problem 13
         ↳Polo
       →DP Problem 14
         ↳Remaining


Dependency Pairs:

S1(ok(X)) -> S1(X)
S1(mark(X)) -> S1(X)


Rules:


active(dbl(0)) -> mark(0)
active(dbl(s(X))) -> mark(s(s(dbl(X))))
active(dbls(nil)) -> mark(nil)
active(dbls(cons(X, Y))) -> mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) -> mark(X)
active(sel(s(X), cons(Y, Z))) -> mark(sel(X, Z))
active(indx(nil, X)) -> mark(nil)
active(indx(cons(X, Y), Z)) -> mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) -> mark(cons(X, from(s(X))))
active(dbl1(0)) -> mark(01)
active(dbl1(s(X))) -> mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) -> mark(X)
active(sel1(s(X), cons(Y, Z))) -> mark(sel1(X, Z))
active(quote(0)) -> mark(01)
active(quote(s(X))) -> mark(s1(quote(X)))
active(quote(dbl(X))) -> mark(dbl1(X))
active(quote(sel(X, Y))) -> mark(sel1(X, Y))
active(dbl(X)) -> dbl(active(X))
active(dbls(X)) -> dbls(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(indx(X1, X2)) -> indx(active(X1), X2)
active(dbl1(X)) -> dbl1(active(X))
active(s1(X)) -> s1(active(X))
active(sel1(X1, X2)) -> sel1(active(X1), X2)
active(sel1(X1, X2)) -> sel1(X1, active(X2))
active(quote(X)) -> quote(active(X))
dbl(mark(X)) -> mark(dbl(X))
dbl(ok(X)) -> ok(dbl(X))
dbls(mark(X)) -> mark(dbls(X))
dbls(ok(X)) -> ok(dbls(X))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
indx(mark(X1), X2) -> mark(indx(X1, X2))
indx(ok(X1), ok(X2)) -> ok(indx(X1, X2))
dbl1(mark(X)) -> mark(dbl1(X))
dbl1(ok(X)) -> ok(dbl1(X))
s1(mark(X)) -> mark(s1(X))
s1(ok(X)) -> ok(s1(X))
sel1(mark(X1), X2) -> mark(sel1(X1, X2))
sel1(X1, mark(X2)) -> mark(sel1(X1, X2))
sel1(ok(X1), ok(X2)) -> ok(sel1(X1, X2))
quote(mark(X)) -> mark(quote(X))
quote(ok(X)) -> ok(quote(X))
proper(dbl(X)) -> dbl(proper(X))
proper(0) -> ok(0)
proper(s(X)) -> s(proper(X))
proper(dbls(X)) -> dbls(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(indx(X1, X2)) -> indx(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(dbl1(X)) -> dbl1(proper(X))
proper(01) -> ok(01)
proper(s1(X)) -> s1(proper(X))
proper(sel1(X1, X2)) -> sel1(proper(X1), proper(X2))
proper(quote(X)) -> quote(proper(X))
s(ok(X)) -> ok(s(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
from(ok(X)) -> ok(from(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))


Strategy:

innermost




The following dependency pair can be strictly oriented:

S1(ok(X)) -> S1(X)


There are no usable rules for innermost w.r.t. to the implicit AFS that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:
  POL(S1(x1))=  x1  
  POL(mark(x1))=  x1  
  POL(ok(x1))=  1 + x1  

resulting in one new DP problem. 



   R
     ↳DPs
       →DP Problem 1
         ↳Polo
       →DP Problem 2
         ↳Polo
       →DP Problem 3
         ↳Polo
       →DP Problem 4
         ↳Polo
       →DP Problem 5
         ↳Polo
       →DP Problem 6
         ↳Polo
       →DP Problem 7
         ↳Polo
       →DP Problem 8
         ↳Polo
           →DP Problem 27
             ↳Polynomial Ordering
       →DP Problem 9
         ↳Polo
       →DP Problem 10
         ↳Polo
       →DP Problem 11
         ↳Polo
       →DP Problem 12
         ↳Polo
       →DP Problem 13
         ↳Polo
       →DP Problem 14
         ↳Remaining


Dependency Pair:

S1(mark(X)) -> S1(X)


Rules:


active(dbl(0)) -> mark(0)
active(dbl(s(X))) -> mark(s(s(dbl(X))))
active(dbls(nil)) -> mark(nil)
active(dbls(cons(X, Y))) -> mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) -> mark(X)
active(sel(s(X), cons(Y, Z))) -> mark(sel(X, Z))
active(indx(nil, X)) -> mark(nil)
active(indx(cons(X, Y), Z)) -> mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) -> mark(cons(X, from(s(X))))
active(dbl1(0)) -> mark(01)
active(dbl1(s(X))) -> mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) -> mark(X)
active(sel1(s(X), cons(Y, Z))) -> mark(sel1(X, Z))
active(quote(0)) -> mark(01)
active(quote(s(X))) -> mark(s1(quote(X)))
active(quote(dbl(X))) -> mark(dbl1(X))
active(quote(sel(X, Y))) -> mark(sel1(X, Y))
active(dbl(X)) -> dbl(active(X))
active(dbls(X)) -> dbls(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(indx(X1, X2)) -> indx(active(X1), X2)
active(dbl1(X)) -> dbl1(active(X))
active(s1(X)) -> s1(active(X))
active(sel1(X1, X2)) -> sel1(active(X1), X2)
active(sel1(X1, X2)) -> sel1(X1, active(X2))
active(quote(X)) -> quote(active(X))
dbl(mark(X)) -> mark(dbl(X))
dbl(ok(X)) -> ok(dbl(X))
dbls(mark(X)) -> mark(dbls(X))
dbls(ok(X)) -> ok(dbls(X))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
indx(mark(X1), X2) -> mark(indx(X1, X2))
indx(ok(X1), ok(X2)) -> ok(indx(X1, X2))
dbl1(mark(X)) -> mark(dbl1(X))
dbl1(ok(X)) -> ok(dbl1(X))
s1(mark(X)) -> mark(s1(X))
s1(ok(X)) -> ok(s1(X))
sel1(mark(X1), X2) -> mark(sel1(X1, X2))
sel1(X1, mark(X2)) -> mark(sel1(X1, X2))
sel1(ok(X1), ok(X2)) -> ok(sel1(X1, X2))
quote(mark(X)) -> mark(quote(X))
quote(ok(X)) -> ok(quote(X))
proper(dbl(X)) -> dbl(proper(X))
proper(0) -> ok(0)
proper(s(X)) -> s(proper(X))
proper(dbls(X)) -> dbls(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(indx(X1, X2)) -> indx(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(dbl1(X)) -> dbl1(proper(X))
proper(01) -> ok(01)
proper(s1(X)) -> s1(proper(X))
proper(sel1(X1, X2)) -> sel1(proper(X1), proper(X2))
proper(quote(X)) -> quote(proper(X))
s(ok(X)) -> ok(s(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
from(ok(X)) -> ok(from(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))


Strategy:

innermost




The following dependency pair can be strictly oriented:

S1(mark(X)) -> S1(X)


There are no usable rules for innermost w.r.t. to the implicit AFS that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:
  POL(S1(x1))=  x1  
  POL(mark(x1))=  1 + x1  

resulting in one new DP problem. 



   R
     ↳DPs
       →DP Problem 1
         ↳Polo
       →DP Problem 2
         ↳Polo
       →DP Problem 3
         ↳Polo
       →DP Problem 4
         ↳Polo
       →DP Problem 5
         ↳Polo
       →DP Problem 6
         ↳Polo
       →DP Problem 7
         ↳Polo
       →DP Problem 8
         ↳Polo
           →DP Problem 27
             ↳Polo
             ...
               →DP Problem 28
                 ↳Dependency Graph
       →DP Problem 9
         ↳Polo
       →DP Problem 10
         ↳Polo
       →DP Problem 11
         ↳Polo
       →DP Problem 12
         ↳Polo
       →DP Problem 13
         ↳Polo
       →DP Problem 14
         ↳Remaining


Dependency Pair:


Rules:


active(dbl(0)) -> mark(0)
active(dbl(s(X))) -> mark(s(s(dbl(X))))
active(dbls(nil)) -> mark(nil)
active(dbls(cons(X, Y))) -> mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) -> mark(X)
active(sel(s(X), cons(Y, Z))) -> mark(sel(X, Z))
active(indx(nil, X)) -> mark(nil)
active(indx(cons(X, Y), Z)) -> mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) -> mark(cons(X, from(s(X))))
active(dbl1(0)) -> mark(01)
active(dbl1(s(X))) -> mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) -> mark(X)
active(sel1(s(X), cons(Y, Z))) -> mark(sel1(X, Z))
active(quote(0)) -> mark(01)
active(quote(s(X))) -> mark(s1(quote(X)))
active(quote(dbl(X))) -> mark(dbl1(X))
active(quote(sel(X, Y))) -> mark(sel1(X, Y))
active(dbl(X)) -> dbl(active(X))
active(dbls(X)) -> dbls(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(indx(X1, X2)) -> indx(active(X1), X2)
active(dbl1(X)) -> dbl1(active(X))
active(s1(X)) -> s1(active(X))
active(sel1(X1, X2)) -> sel1(active(X1), X2)
active(sel1(X1, X2)) -> sel1(X1, active(X2))
active(quote(X)) -> quote(active(X))
dbl(mark(X)) -> mark(dbl(X))
dbl(ok(X)) -> ok(dbl(X))
dbls(mark(X)) -> mark(dbls(X))
dbls(ok(X)) -> ok(dbls(X))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
indx(mark(X1), X2) -> mark(indx(X1, X2))
indx(ok(X1), ok(X2)) -> ok(indx(X1, X2))
dbl1(mark(X)) -> mark(dbl1(X))
dbl1(ok(X)) -> ok(dbl1(X))
s1(mark(X)) -> mark(s1(X))
s1(ok(X)) -> ok(s1(X))
sel1(mark(X1), X2) -> mark(sel1(X1, X2))
sel1(X1, mark(X2)) -> mark(sel1(X1, X2))
sel1(ok(X1), ok(X2)) -> ok(sel1(X1, X2))
quote(mark(X)) -> mark(quote(X))
quote(ok(X)) -> ok(quote(X))
proper(dbl(X)) -> dbl(proper(X))
proper(0) -> ok(0)
proper(s(X)) -> s(proper(X))
proper(dbls(X)) -> dbls(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(indx(X1, X2)) -> indx(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(dbl1(X)) -> dbl1(proper(X))
proper(01) -> ok(01)
proper(s1(X)) -> s1(proper(X))
proper(sel1(X1, X2)) -> sel1(proper(X1), proper(X2))
proper(quote(X)) -> quote(proper(X))
s(ok(X)) -> ok(s(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
from(ok(X)) -> ok(from(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
         ↳Polo
       →DP Problem 2
         ↳Polo
       →DP Problem 3
         ↳Polo
       →DP Problem 4
         ↳Polo
       →DP Problem 5
         ↳Polo
       →DP Problem 6
         ↳Polo
       →DP Problem 7
         ↳Polo
       →DP Problem 8
         ↳Polo
       →DP Problem 9
         ↳Polynomial Ordering
       →DP Problem 10
         ↳Polo
       →DP Problem 11
         ↳Polo
       →DP Problem 12
         ↳Polo
       →DP Problem 13
         ↳Polo
       →DP Problem 14
         ↳Remaining


Dependency Pairs:

DBL1(ok(X)) -> DBL1(X)
DBL1(mark(X)) -> DBL1(X)


Rules:


active(dbl(0)) -> mark(0)
active(dbl(s(X))) -> mark(s(s(dbl(X))))
active(dbls(nil)) -> mark(nil)
active(dbls(cons(X, Y))) -> mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) -> mark(X)
active(sel(s(X), cons(Y, Z))) -> mark(sel(X, Z))
active(indx(nil, X)) -> mark(nil)
active(indx(cons(X, Y), Z)) -> mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) -> mark(cons(X, from(s(X))))
active(dbl1(0)) -> mark(01)
active(dbl1(s(X))) -> mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) -> mark(X)
active(sel1(s(X), cons(Y, Z))) -> mark(sel1(X, Z))
active(quote(0)) -> mark(01)
active(quote(s(X))) -> mark(s1(quote(X)))
active(quote(dbl(X))) -> mark(dbl1(X))
active(quote(sel(X, Y))) -> mark(sel1(X, Y))
active(dbl(X)) -> dbl(active(X))
active(dbls(X)) -> dbls(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(indx(X1, X2)) -> indx(active(X1), X2)
active(dbl1(X)) -> dbl1(active(X))
active(s1(X)) -> s1(active(X))
active(sel1(X1, X2)) -> sel1(active(X1), X2)
active(sel1(X1, X2)) -> sel1(X1, active(X2))
active(quote(X)) -> quote(active(X))
dbl(mark(X)) -> mark(dbl(X))
dbl(ok(X)) -> ok(dbl(X))
dbls(mark(X)) -> mark(dbls(X))
dbls(ok(X)) -> ok(dbls(X))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
indx(mark(X1), X2) -> mark(indx(X1, X2))
indx(ok(X1), ok(X2)) -> ok(indx(X1, X2))
dbl1(mark(X)) -> mark(dbl1(X))
dbl1(ok(X)) -> ok(dbl1(X))
s1(mark(X)) -> mark(s1(X))
s1(ok(X)) -> ok(s1(X))
sel1(mark(X1), X2) -> mark(sel1(X1, X2))
sel1(X1, mark(X2)) -> mark(sel1(X1, X2))
sel1(ok(X1), ok(X2)) -> ok(sel1(X1, X2))
quote(mark(X)) -> mark(quote(X))
quote(ok(X)) -> ok(quote(X))
proper(dbl(X)) -> dbl(proper(X))
proper(0) -> ok(0)
proper(s(X)) -> s(proper(X))
proper(dbls(X)) -> dbls(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(indx(X1, X2)) -> indx(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(dbl1(X)) -> dbl1(proper(X))
proper(01) -> ok(01)
proper(s1(X)) -> s1(proper(X))
proper(sel1(X1, X2)) -> sel1(proper(X1), proper(X2))
proper(quote(X)) -> quote(proper(X))
s(ok(X)) -> ok(s(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
from(ok(X)) -> ok(from(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))


Strategy:

innermost




The following dependency pair can be strictly oriented:

DBL1(ok(X)) -> DBL1(X)


There are no usable rules for innermost w.r.t. to the implicit AFS that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:
  POL(DBL1(x1))=  x1  
  POL(mark(x1))=  x1  
  POL(ok(x1))=  1 + x1  

resulting in one new DP problem. 



   R
     ↳DPs
       →DP Problem 1
         ↳Polo
       →DP Problem 2
         ↳Polo
       →DP Problem 3
         ↳Polo
       →DP Problem 4
         ↳Polo
       →DP Problem 5
         ↳Polo
       →DP Problem 6
         ↳Polo
       →DP Problem 7
         ↳Polo
       →DP Problem 8
         ↳Polo
       →DP Problem 9
         ↳Polo
           →DP Problem 29
             ↳Polynomial Ordering
       →DP Problem 10
         ↳Polo
       →DP Problem 11
         ↳Polo
       →DP Problem 12
         ↳Polo
       →DP Problem 13
         ↳Polo
       →DP Problem 14
         ↳Remaining


Dependency Pair:

DBL1(mark(X)) -> DBL1(X)


Rules:


active(dbl(0)) -> mark(0)
active(dbl(s(X))) -> mark(s(s(dbl(X))))
active(dbls(nil)) -> mark(nil)
active(dbls(cons(X, Y))) -> mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) -> mark(X)
active(sel(s(X), cons(Y, Z))) -> mark(sel(X, Z))
active(indx(nil, X)) -> mark(nil)
active(indx(cons(X, Y), Z)) -> mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) -> mark(cons(X, from(s(X))))
active(dbl1(0)) -> mark(01)
active(dbl1(s(X))) -> mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) -> mark(X)
active(sel1(s(X), cons(Y, Z))) -> mark(sel1(X, Z))
active(quote(0)) -> mark(01)
active(quote(s(X))) -> mark(s1(quote(X)))
active(quote(dbl(X))) -> mark(dbl1(X))
active(quote(sel(X, Y))) -> mark(sel1(X, Y))
active(dbl(X)) -> dbl(active(X))
active(dbls(X)) -> dbls(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(indx(X1, X2)) -> indx(active(X1), X2)
active(dbl1(X)) -> dbl1(active(X))
active(s1(X)) -> s1(active(X))
active(sel1(X1, X2)) -> sel1(active(X1), X2)
active(sel1(X1, X2)) -> sel1(X1, active(X2))
active(quote(X)) -> quote(active(X))
dbl(mark(X)) -> mark(dbl(X))
dbl(ok(X)) -> ok(dbl(X))
dbls(mark(X)) -> mark(dbls(X))
dbls(ok(X)) -> ok(dbls(X))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
indx(mark(X1), X2) -> mark(indx(X1, X2))
indx(ok(X1), ok(X2)) -> ok(indx(X1, X2))
dbl1(mark(X)) -> mark(dbl1(X))
dbl1(ok(X)) -> ok(dbl1(X))
s1(mark(X)) -> mark(s1(X))
s1(ok(X)) -> ok(s1(X))
sel1(mark(X1), X2) -> mark(sel1(X1, X2))
sel1(X1, mark(X2)) -> mark(sel1(X1, X2))
sel1(ok(X1), ok(X2)) -> ok(sel1(X1, X2))
quote(mark(X)) -> mark(quote(X))
quote(ok(X)) -> ok(quote(X))
proper(dbl(X)) -> dbl(proper(X))
proper(0) -> ok(0)
proper(s(X)) -> s(proper(X))
proper(dbls(X)) -> dbls(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(indx(X1, X2)) -> indx(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(dbl1(X)) -> dbl1(proper(X))
proper(01) -> ok(01)
proper(s1(X)) -> s1(proper(X))
proper(sel1(X1, X2)) -> sel1(proper(X1), proper(X2))
proper(quote(X)) -> quote(proper(X))
s(ok(X)) -> ok(s(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
from(ok(X)) -> ok(from(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))


Strategy:

innermost




The following dependency pair can be strictly oriented:

DBL1(mark(X)) -> DBL1(X)


There are no usable rules for innermost w.r.t. to the implicit AFS that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:
  POL(DBL1(x1))=  x1  
  POL(mark(x1))=  1 + x1  

resulting in one new DP problem. 



   R
     ↳DPs
       →DP Problem 1
         ↳Polo
       →DP Problem 2
         ↳Polo
       →DP Problem 3
         ↳Polo
       →DP Problem 4
         ↳Polo
       →DP Problem 5
         ↳Polo
       →DP Problem 6
         ↳Polo
       →DP Problem 7
         ↳Polo
       →DP Problem 8
         ↳Polo
       →DP Problem 9
         ↳Polo
           →DP Problem 29
             ↳Polo
             ...
               →DP Problem 30
                 ↳Dependency Graph
       →DP Problem 10
         ↳Polo
       →DP Problem 11
         ↳Polo
       →DP Problem 12
         ↳Polo
       →DP Problem 13
         ↳Polo
       →DP Problem 14
         ↳Remaining


Dependency Pair:


Rules:


active(dbl(0)) -> mark(0)
active(dbl(s(X))) -> mark(s(s(dbl(X))))
active(dbls(nil)) -> mark(nil)
active(dbls(cons(X, Y))) -> mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) -> mark(X)
active(sel(s(X), cons(Y, Z))) -> mark(sel(X, Z))
active(indx(nil, X)) -> mark(nil)
active(indx(cons(X, Y), Z)) -> mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) -> mark(cons(X, from(s(X))))
active(dbl1(0)) -> mark(01)
active(dbl1(s(X))) -> mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) -> mark(X)
active(sel1(s(X), cons(Y, Z))) -> mark(sel1(X, Z))
active(quote(0)) -> mark(01)
active(quote(s(X))) -> mark(s1(quote(X)))
active(quote(dbl(X))) -> mark(dbl1(X))
active(quote(sel(X, Y))) -> mark(sel1(X, Y))
active(dbl(X)) -> dbl(active(X))
active(dbls(X)) -> dbls(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(indx(X1, X2)) -> indx(active(X1), X2)
active(dbl1(X)) -> dbl1(active(X))
active(s1(X)) -> s1(active(X))
active(sel1(X1, X2)) -> sel1(active(X1), X2)
active(sel1(X1, X2)) -> sel1(X1, active(X2))
active(quote(X)) -> quote(active(X))
dbl(mark(X)) -> mark(dbl(X))
dbl(ok(X)) -> ok(dbl(X))
dbls(mark(X)) -> mark(dbls(X))
dbls(ok(X)) -> ok(dbls(X))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
indx(mark(X1), X2) -> mark(indx(X1, X2))
indx(ok(X1), ok(X2)) -> ok(indx(X1, X2))
dbl1(mark(X)) -> mark(dbl1(X))
dbl1(ok(X)) -> ok(dbl1(X))
s1(mark(X)) -> mark(s1(X))
s1(ok(X)) -> ok(s1(X))
sel1(mark(X1), X2) -> mark(sel1(X1, X2))
sel1(X1, mark(X2)) -> mark(sel1(X1, X2))
sel1(ok(X1), ok(X2)) -> ok(sel1(X1, X2))
quote(mark(X)) -> mark(quote(X))
quote(ok(X)) -> ok(quote(X))
proper(dbl(X)) -> dbl(proper(X))
proper(0) -> ok(0)
proper(s(X)) -> s(proper(X))
proper(dbls(X)) -> dbls(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(indx(X1, X2)) -> indx(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(dbl1(X)) -> dbl1(proper(X))
proper(01) -> ok(01)
proper(s1(X)) -> s1(proper(X))
proper(sel1(X1, X2)) -> sel1(proper(X1), proper(X2))
proper(quote(X)) -> quote(proper(X))
s(ok(X)) -> ok(s(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
from(ok(X)) -> ok(from(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
         ↳Polo
       →DP Problem 2
         ↳Polo
       →DP Problem 3
         ↳Polo
       →DP Problem 4
         ↳Polo
       →DP Problem 5
         ↳Polo
       →DP Problem 6
         ↳Polo
       →DP Problem 7
         ↳Polo
       →DP Problem 8
         ↳Polo
       →DP Problem 9
         ↳Polo
       →DP Problem 10
         ↳Polynomial Ordering
       →DP Problem 11
         ↳Polo
       →DP Problem 12
         ↳Polo
       →DP Problem 13
         ↳Polo
       →DP Problem 14
         ↳Remaining


Dependency Pairs:

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


Rules:


active(dbl(0)) -> mark(0)
active(dbl(s(X))) -> mark(s(s(dbl(X))))
active(dbls(nil)) -> mark(nil)
active(dbls(cons(X, Y))) -> mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) -> mark(X)
active(sel(s(X), cons(Y, Z))) -> mark(sel(X, Z))
active(indx(nil, X)) -> mark(nil)
active(indx(cons(X, Y), Z)) -> mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) -> mark(cons(X, from(s(X))))
active(dbl1(0)) -> mark(01)
active(dbl1(s(X))) -> mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) -> mark(X)
active(sel1(s(X), cons(Y, Z))) -> mark(sel1(X, Z))
active(quote(0)) -> mark(01)
active(quote(s(X))) -> mark(s1(quote(X)))
active(quote(dbl(X))) -> mark(dbl1(X))
active(quote(sel(X, Y))) -> mark(sel1(X, Y))
active(dbl(X)) -> dbl(active(X))
active(dbls(X)) -> dbls(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(indx(X1, X2)) -> indx(active(X1), X2)
active(dbl1(X)) -> dbl1(active(X))
active(s1(X)) -> s1(active(X))
active(sel1(X1, X2)) -> sel1(active(X1), X2)
active(sel1(X1, X2)) -> sel1(X1, active(X2))
active(quote(X)) -> quote(active(X))
dbl(mark(X)) -> mark(dbl(X))
dbl(ok(X)) -> ok(dbl(X))
dbls(mark(X)) -> mark(dbls(X))
dbls(ok(X)) -> ok(dbls(X))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
indx(mark(X1), X2) -> mark(indx(X1, X2))
indx(ok(X1), ok(X2)) -> ok(indx(X1, X2))
dbl1(mark(X)) -> mark(dbl1(X))
dbl1(ok(X)) -> ok(dbl1(X))
s1(mark(X)) -> mark(s1(X))
s1(ok(X)) -> ok(s1(X))
sel1(mark(X1), X2) -> mark(sel1(X1, X2))
sel1(X1, mark(X2)) -> mark(sel1(X1, X2))
sel1(ok(X1), ok(X2)) -> ok(sel1(X1, X2))
quote(mark(X)) -> mark(quote(X))
quote(ok(X)) -> ok(quote(X))
proper(dbl(X)) -> dbl(proper(X))
proper(0) -> ok(0)
proper(s(X)) -> s(proper(X))
proper(dbls(X)) -> dbls(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(indx(X1, X2)) -> indx(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(dbl1(X)) -> dbl1(proper(X))
proper(01) -> ok(01)
proper(s1(X)) -> s1(proper(X))
proper(sel1(X1, X2)) -> sel1(proper(X1), proper(X2))
proper(quote(X)) -> quote(proper(X))
s(ok(X)) -> ok(s(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
from(ok(X)) -> ok(from(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))


Strategy:

innermost




The following dependency pair can be strictly oriented:

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


There are no usable rules for innermost w.r.t. to the implicit AFS that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:
  POL(mark(x1))=  x1  
  POL(ok(x1))=  1 + x1  
  POL(SEL1(x1, x2))=  x1  

resulting in one new DP problem. 



   R
     ↳DPs
       →DP Problem 1
         ↳Polo
       →DP Problem 2
         ↳Polo
       →DP Problem 3
         ↳Polo
       →DP Problem 4
         ↳Polo
       →DP Problem 5
         ↳Polo
       →DP Problem 6
         ↳Polo
       →DP Problem 7
         ↳Polo
       →DP Problem 8
         ↳Polo
       →DP Problem 9
         ↳Polo
       →DP Problem 10
         ↳Polo
           →DP Problem 31
             ↳Polynomial Ordering
       →DP Problem 11
         ↳Polo
       →DP Problem 12
         ↳Polo
       →DP Problem 13
         ↳Polo
       →DP Problem 14
         ↳Remaining


Dependency Pairs:

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


Rules:


active(dbl(0)) -> mark(0)
active(dbl(s(X))) -> mark(s(s(dbl(X))))
active(dbls(nil)) -> mark(nil)
active(dbls(cons(X, Y))) -> mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) -> mark(X)
active(sel(s(X), cons(Y, Z))) -> mark(sel(X, Z))
active(indx(nil, X)) -> mark(nil)
active(indx(cons(X, Y), Z)) -> mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) -> mark(cons(X, from(s(X))))
active(dbl1(0)) -> mark(01)
active(dbl1(s(X))) -> mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) -> mark(X)
active(sel1(s(X), cons(Y, Z))) -> mark(sel1(X, Z))
active(quote(0)) -> mark(01)
active(quote(s(X))) -> mark(s1(quote(X)))
active(quote(dbl(X))) -> mark(dbl1(X))
active(quote(sel(X, Y))) -> mark(sel1(X, Y))
active(dbl(X)) -> dbl(active(X))
active(dbls(X)) -> dbls(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(indx(X1, X2)) -> indx(active(X1), X2)
active(dbl1(X)) -> dbl1(active(X))
active(s1(X)) -> s1(active(X))
active(sel1(X1, X2)) -> sel1(active(X1), X2)
active(sel1(X1, X2)) -> sel1(X1, active(X2))
active(quote(X)) -> quote(active(X))
dbl(mark(X)) -> mark(dbl(X))
dbl(ok(X)) -> ok(dbl(X))
dbls(mark(X)) -> mark(dbls(X))
dbls(ok(X)) -> ok(dbls(X))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
indx(mark(X1), X2) -> mark(indx(X1, X2))
indx(ok(X1), ok(X2)) -> ok(indx(X1, X2))
dbl1(mark(X)) -> mark(dbl1(X))
dbl1(ok(X)) -> ok(dbl1(X))
s1(mark(X)) -> mark(s1(X))
s1(ok(X)) -> ok(s1(X))
sel1(mark(X1), X2) -> mark(sel1(X1, X2))
sel1(X1, mark(X2)) -> mark(sel1(X1, X2))
sel1(ok(X1), ok(X2)) -> ok(sel1(X1, X2))
quote(mark(X)) -> mark(quote(X))
quote(ok(X)) -> ok(quote(X))
proper(dbl(X)) -> dbl(proper(X))
proper(0) -> ok(0)
proper(s(X)) -> s(proper(X))
proper(dbls(X)) -> dbls(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(indx(X1, X2)) -> indx(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(dbl1(X)) -> dbl1(proper(X))
proper(01) -> ok(01)
proper(s1(X)) -> s1(proper(X))
proper(sel1(X1, X2)) -> sel1(proper(X1), proper(X2))
proper(quote(X)) -> quote(proper(X))
s(ok(X)) -> ok(s(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
from(ok(X)) -> ok(from(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))


Strategy:

innermost




The following dependency pair can be strictly oriented:

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


There are no usable rules for innermost w.r.t. to the implicit AFS that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:
  POL(mark(x1))=  1 + x1  
  POL(SEL1(x1, x2))=  x2  

resulting in one new DP problem. 



   R
     ↳DPs
       →DP Problem 1
         ↳Polo
       →DP Problem 2
         ↳Polo
       →DP Problem 3
         ↳Polo
       →DP Problem 4
         ↳Polo
       →DP Problem 5
         ↳Polo
       →DP Problem 6
         ↳Polo
       →DP Problem 7
         ↳Polo
       →DP Problem 8
         ↳Polo
       →DP Problem 9
         ↳Polo
       →DP Problem 10
         ↳Polo
           →DP Problem 31
             ↳Polo
             ...
               →DP Problem 32
                 ↳Polynomial Ordering
       →DP Problem 11
         ↳Polo
       →DP Problem 12
         ↳Polo
       →DP Problem 13
         ↳Polo
       →DP Problem 14
         ↳Remaining


Dependency Pair:

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


Rules:


active(dbl(0)) -> mark(0)
active(dbl(s(X))) -> mark(s(s(dbl(X))))
active(dbls(nil)) -> mark(nil)
active(dbls(cons(X, Y))) -> mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) -> mark(X)
active(sel(s(X), cons(Y, Z))) -> mark(sel(X, Z))
active(indx(nil, X)) -> mark(nil)
active(indx(cons(X, Y), Z)) -> mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) -> mark(cons(X, from(s(X))))
active(dbl1(0)) -> mark(01)
active(dbl1(s(X))) -> mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) -> mark(X)
active(sel1(s(X), cons(Y, Z))) -> mark(sel1(X, Z))
active(quote(0)) -> mark(01)
active(quote(s(X))) -> mark(s1(quote(X)))
active(quote(dbl(X))) -> mark(dbl1(X))
active(quote(sel(X, Y))) -> mark(sel1(X, Y))
active(dbl(X)) -> dbl(active(X))
active(dbls(X)) -> dbls(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(indx(X1, X2)) -> indx(active(X1), X2)
active(dbl1(X)) -> dbl1(active(X))
active(s1(X)) -> s1(active(X))
active(sel1(X1, X2)) -> sel1(active(X1), X2)
active(sel1(X1, X2)) -> sel1(X1, active(X2))
active(quote(X)) -> quote(active(X))
dbl(mark(X)) -> mark(dbl(X))
dbl(ok(X)) -> ok(dbl(X))
dbls(mark(X)) -> mark(dbls(X))
dbls(ok(X)) -> ok(dbls(X))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
indx(mark(X1), X2) -> mark(indx(X1, X2))
indx(ok(X1), ok(X2)) -> ok(indx(X1, X2))
dbl1(mark(X)) -> mark(dbl1(X))
dbl1(ok(X)) -> ok(dbl1(X))
s1(mark(X)) -> mark(s1(X))
s1(ok(X)) -> ok(s1(X))
sel1(mark(X1), X2) -> mark(sel1(X1, X2))
sel1(X1, mark(X2)) -> mark(sel1(X1, X2))
sel1(ok(X1), ok(X2)) -> ok(sel1(X1, X2))
quote(mark(X)) -> mark(quote(X))
quote(ok(X)) -> ok(quote(X))
proper(dbl(X)) -> dbl(proper(X))
proper(0) -> ok(0)
proper(s(X)) -> s(proper(X))
proper(dbls(X)) -> dbls(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(indx(X1, X2)) -> indx(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(dbl1(X)) -> dbl1(proper(X))
proper(01) -> ok(01)
proper(s1(X)) -> s1(proper(X))
proper(sel1(X1, X2)) -> sel1(proper(X1), proper(X2))
proper(quote(X)) -> quote(proper(X))
s(ok(X)) -> ok(s(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
from(ok(X)) -> ok(from(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))


Strategy:

innermost




The following dependency pair can be strictly oriented:

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


There are no usable rules for innermost w.r.t. to the implicit AFS that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:
  POL(mark(x1))=  1 + x1  
  POL(SEL1(x1, x2))=  x1  

resulting in one new DP problem. 



   R
     ↳DPs
       →DP Problem 1
         ↳Polo
       →DP Problem 2
         ↳Polo
       →DP Problem 3
         ↳Polo
       →DP Problem 4
         ↳Polo
       →DP Problem 5
         ↳Polo
       →DP Problem 6
         ↳Polo
       →DP Problem 7
         ↳Polo
       →DP Problem 8
         ↳Polo
       →DP Problem 9
         ↳Polo
       →DP Problem 10
         ↳Polo
           →DP Problem 31
             ↳Polo
             ...
               →DP Problem 33
                 ↳Dependency Graph
       →DP Problem 11
         ↳Polo
       →DP Problem 12
         ↳Polo
       →DP Problem 13
         ↳Polo
       →DP Problem 14
         ↳Remaining


Dependency Pair:


Rules:


active(dbl(0)) -> mark(0)
active(dbl(s(X))) -> mark(s(s(dbl(X))))
active(dbls(nil)) -> mark(nil)
active(dbls(cons(X, Y))) -> mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) -> mark(X)
active(sel(s(X), cons(Y, Z))) -> mark(sel(X, Z))
active(indx(nil, X)) -> mark(nil)
active(indx(cons(X, Y), Z)) -> mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) -> mark(cons(X, from(s(X))))
active(dbl1(0)) -> mark(01)
active(dbl1(s(X))) -> mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) -> mark(X)
active(sel1(s(X), cons(Y, Z))) -> mark(sel1(X, Z))
active(quote(0)) -> mark(01)
active(quote(s(X))) -> mark(s1(quote(X)))
active(quote(dbl(X))) -> mark(dbl1(X))
active(quote(sel(X, Y))) -> mark(sel1(X, Y))
active(dbl(X)) -> dbl(active(X))
active(dbls(X)) -> dbls(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(indx(X1, X2)) -> indx(active(X1), X2)
active(dbl1(X)) -> dbl1(active(X))
active(s1(X)) -> s1(active(X))
active(sel1(X1, X2)) -> sel1(active(X1), X2)
active(sel1(X1, X2)) -> sel1(X1, active(X2))
active(quote(X)) -> quote(active(X))
dbl(mark(X)) -> mark(dbl(X))
dbl(ok(X)) -> ok(dbl(X))
dbls(mark(X)) -> mark(dbls(X))
dbls(ok(X)) -> ok(dbls(X))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
indx(mark(X1), X2) -> mark(indx(X1, X2))
indx(ok(X1), ok(X2)) -> ok(indx(X1, X2))
dbl1(mark(X)) -> mark(dbl1(X))
dbl1(ok(X)) -> ok(dbl1(X))
s1(mark(X)) -> mark(s1(X))
s1(ok(X)) -> ok(s1(X))
sel1(mark(X1), X2) -> mark(sel1(X1, X2))
sel1(X1, mark(X2)) -> mark(sel1(X1, X2))
sel1(ok(X1), ok(X2)) -> ok(sel1(X1, X2))
quote(mark(X)) -> mark(quote(X))
quote(ok(X)) -> ok(quote(X))
proper(dbl(X)) -> dbl(proper(X))
proper(0) -> ok(0)
proper(s(X)) -> s(proper(X))
proper(dbls(X)) -> dbls(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(indx(X1, X2)) -> indx(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(dbl1(X)) -> dbl1(proper(X))
proper(01) -> ok(01)
proper(s1(X)) -> s1(proper(X))
proper(sel1(X1, X2)) -> sel1(proper(X1), proper(X2))
proper(quote(X)) -> quote(proper(X))
s(ok(X)) -> ok(s(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
from(ok(X)) -> ok(from(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
         ↳Polo
       →DP Problem 2
         ↳Polo
       →DP Problem 3
         ↳Polo
       →DP Problem 4
         ↳Polo
       →DP Problem 5
         ↳Polo
       →DP Problem 6
         ↳Polo
       →DP Problem 7
         ↳Polo
       →DP Problem 8
         ↳Polo
       →DP Problem 9
         ↳Polo
       →DP Problem 10
         ↳Polo
       →DP Problem 11
         ↳Polynomial Ordering
       →DP Problem 12
         ↳Polo
       →DP Problem 13
         ↳Polo
       →DP Problem 14
         ↳Remaining


Dependency Pairs:

QUOTE(ok(X)) -> QUOTE(X)
QUOTE(mark(X)) -> QUOTE(X)


Rules:


active(dbl(0)) -> mark(0)
active(dbl(s(X))) -> mark(s(s(dbl(X))))
active(dbls(nil)) -> mark(nil)
active(dbls(cons(X, Y))) -> mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) -> mark(X)
active(sel(s(X), cons(Y, Z))) -> mark(sel(X, Z))
active(indx(nil, X)) -> mark(nil)
active(indx(cons(X, Y), Z)) -> mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) -> mark(cons(X, from(s(X))))
active(dbl1(0)) -> mark(01)
active(dbl1(s(X))) -> mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) -> mark(X)
active(sel1(s(X), cons(Y, Z))) -> mark(sel1(X, Z))
active(quote(0)) -> mark(01)
active(quote(s(X))) -> mark(s1(quote(X)))
active(quote(dbl(X))) -> mark(dbl1(X))
active(quote(sel(X, Y))) -> mark(sel1(X, Y))
active(dbl(X)) -> dbl(active(X))
active(dbls(X)) -> dbls(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(indx(X1, X2)) -> indx(active(X1), X2)
active(dbl1(X)) -> dbl1(active(X))
active(s1(X)) -> s1(active(X))
active(sel1(X1, X2)) -> sel1(active(X1), X2)
active(sel1(X1, X2)) -> sel1(X1, active(X2))
active(quote(X)) -> quote(active(X))
dbl(mark(X)) -> mark(dbl(X))
dbl(ok(X)) -> ok(dbl(X))
dbls(mark(X)) -> mark(dbls(X))
dbls(ok(X)) -> ok(dbls(X))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
indx(mark(X1), X2) -> mark(indx(X1, X2))
indx(ok(X1), ok(X2)) -> ok(indx(X1, X2))
dbl1(mark(X)) -> mark(dbl1(X))
dbl1(ok(X)) -> ok(dbl1(X))
s1(mark(X)) -> mark(s1(X))
s1(ok(X)) -> ok(s1(X))
sel1(mark(X1), X2) -> mark(sel1(X1, X2))
sel1(X1, mark(X2)) -> mark(sel1(X1, X2))
sel1(ok(X1), ok(X2)) -> ok(sel1(X1, X2))
quote(mark(X)) -> mark(quote(X))
quote(ok(X)) -> ok(quote(X))
proper(dbl(X)) -> dbl(proper(X))
proper(0) -> ok(0)
proper(s(X)) -> s(proper(X))
proper(dbls(X)) -> dbls(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(indx(X1, X2)) -> indx(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(dbl1(X)) -> dbl1(proper(X))
proper(01) -> ok(01)
proper(s1(X)) -> s1(proper(X))
proper(sel1(X1, X2)) -> sel1(proper(X1), proper(X2))
proper(quote(X)) -> quote(proper(X))
s(ok(X)) -> ok(s(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
from(ok(X)) -> ok(from(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))


Strategy:

innermost




The following dependency pair can be strictly oriented:

QUOTE(ok(X)) -> QUOTE(X)


There are no usable rules for innermost w.r.t. to the implicit AFS that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:
  POL(QUOTE(x1))=  x1  
  POL(mark(x1))=  x1  
  POL(ok(x1))=  1 + x1  

resulting in one new DP problem. 



   R
     ↳DPs
       →DP Problem 1
         ↳Polo
       →DP Problem 2
         ↳Polo
       →DP Problem 3
         ↳Polo
       →DP Problem 4
         ↳Polo
       →DP Problem 5
         ↳Polo
       →DP Problem 6
         ↳Polo
       →DP Problem 7
         ↳Polo
       →DP Problem 8
         ↳Polo
       →DP Problem 9
         ↳Polo
       →DP Problem 10
         ↳Polo
       →DP Problem 11
         ↳Polo
           →DP Problem 34
             ↳Polynomial Ordering
       →DP Problem 12
         ↳Polo
       →DP Problem 13
         ↳Polo
       →DP Problem 14
         ↳Remaining


Dependency Pair:

QUOTE(mark(X)) -> QUOTE(X)


Rules:


active(dbl(0)) -> mark(0)
active(dbl(s(X))) -> mark(s(s(dbl(X))))
active(dbls(nil)) -> mark(nil)
active(dbls(cons(X, Y))) -> mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) -> mark(X)
active(sel(s(X), cons(Y, Z))) -> mark(sel(X, Z))
active(indx(nil, X)) -> mark(nil)
active(indx(cons(X, Y), Z)) -> mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) -> mark(cons(X, from(s(X))))
active(dbl1(0)) -> mark(01)
active(dbl1(s(X))) -> mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) -> mark(X)
active(sel1(s(X), cons(Y, Z))) -> mark(sel1(X, Z))
active(quote(0)) -> mark(01)
active(quote(s(X))) -> mark(s1(quote(X)))
active(quote(dbl(X))) -> mark(dbl1(X))
active(quote(sel(X, Y))) -> mark(sel1(X, Y))
active(dbl(X)) -> dbl(active(X))
active(dbls(X)) -> dbls(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(indx(X1, X2)) -> indx(active(X1), X2)
active(dbl1(X)) -> dbl1(active(X))
active(s1(X)) -> s1(active(X))
active(sel1(X1, X2)) -> sel1(active(X1), X2)
active(sel1(X1, X2)) -> sel1(X1, active(X2))
active(quote(X)) -> quote(active(X))
dbl(mark(X)) -> mark(dbl(X))
dbl(ok(X)) -> ok(dbl(X))
dbls(mark(X)) -> mark(dbls(X))
dbls(ok(X)) -> ok(dbls(X))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
indx(mark(X1), X2) -> mark(indx(X1, X2))
indx(ok(X1), ok(X2)) -> ok(indx(X1, X2))
dbl1(mark(X)) -> mark(dbl1(X))
dbl1(ok(X)) -> ok(dbl1(X))
s1(mark(X)) -> mark(s1(X))
s1(ok(X)) -> ok(s1(X))
sel1(mark(X1), X2) -> mark(sel1(X1, X2))
sel1(X1, mark(X2)) -> mark(sel1(X1, X2))
sel1(ok(X1), ok(X2)) -> ok(sel1(X1, X2))
quote(mark(X)) -> mark(quote(X))
quote(ok(X)) -> ok(quote(X))
proper(dbl(X)) -> dbl(proper(X))
proper(0) -> ok(0)
proper(s(X)) -> s(proper(X))
proper(dbls(X)) -> dbls(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(indx(X1, X2)) -> indx(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(dbl1(X)) -> dbl1(proper(X))
proper(01) -> ok(01)
proper(s1(X)) -> s1(proper(X))
proper(sel1(X1, X2)) -> sel1(proper(X1), proper(X2))
proper(quote(X)) -> quote(proper(X))
s(ok(X)) -> ok(s(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
from(ok(X)) -> ok(from(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))


Strategy:

innermost




The following dependency pair can be strictly oriented:

QUOTE(mark(X)) -> QUOTE(X)


There are no usable rules for innermost w.r.t. to the implicit AFS that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:
  POL(QUOTE(x1))=  x1  
  POL(mark(x1))=  1 + x1  

resulting in one new DP problem. 



   R
     ↳DPs
       →DP Problem 1
         ↳Polo
       →DP Problem 2
         ↳Polo
       →DP Problem 3
         ↳Polo
       →DP Problem 4
         ↳Polo
       →DP Problem 5
         ↳Polo
       →DP Problem 6
         ↳Polo
       →DP Problem 7
         ↳Polo
       →DP Problem 8
         ↳Polo
       →DP Problem 9
         ↳Polo
       →DP Problem 10
         ↳Polo
       →DP Problem 11
         ↳Polo
           →DP Problem 34
             ↳Polo
             ...
               →DP Problem 35
                 ↳Dependency Graph
       →DP Problem 12
         ↳Polo
       →DP Problem 13
         ↳Polo
       →DP Problem 14
         ↳Remaining


Dependency Pair:


Rules:


active(dbl(0)) -> mark(0)
active(dbl(s(X))) -> mark(s(s(dbl(X))))
active(dbls(nil)) -> mark(nil)
active(dbls(cons(X, Y))) -> mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) -> mark(X)
active(sel(s(X), cons(Y, Z))) -> mark(sel(X, Z))
active(indx(nil, X)) -> mark(nil)
active(indx(cons(X, Y), Z)) -> mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) -> mark(cons(X, from(s(X))))
active(dbl1(0)) -> mark(01)
active(dbl1(s(X))) -> mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) -> mark(X)
active(sel1(s(X), cons(Y, Z))) -> mark(sel1(X, Z))
active(quote(0)) -> mark(01)
active(quote(s(X))) -> mark(s1(quote(X)))
active(quote(dbl(X))) -> mark(dbl1(X))
active(quote(sel(X, Y))) -> mark(sel1(X, Y))
active(dbl(X)) -> dbl(active(X))
active(dbls(X)) -> dbls(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(indx(X1, X2)) -> indx(active(X1), X2)
active(dbl1(X)) -> dbl1(active(X))
active(s1(X)) -> s1(active(X))
active(sel1(X1, X2)) -> sel1(active(X1), X2)
active(sel1(X1, X2)) -> sel1(X1, active(X2))
active(quote(X)) -> quote(active(X))
dbl(mark(X)) -> mark(dbl(X))
dbl(ok(X)) -> ok(dbl(X))
dbls(mark(X)) -> mark(dbls(X))
dbls(ok(X)) -> ok(dbls(X))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
indx(mark(X1), X2) -> mark(indx(X1, X2))
indx(ok(X1), ok(X2)) -> ok(indx(X1, X2))
dbl1(mark(X)) -> mark(dbl1(X))
dbl1(ok(X)) -> ok(dbl1(X))
s1(mark(X)) -> mark(s1(X))
s1(ok(X)) -> ok(s1(X))
sel1(mark(X1), X2) -> mark(sel1(X1, X2))
sel1(X1, mark(X2)) -> mark(sel1(X1, X2))
sel1(ok(X1), ok(X2)) -> ok(sel1(X1, X2))
quote(mark(X)) -> mark(quote(X))
quote(ok(X)) -> ok(quote(X))
proper(dbl(X)) -> dbl(proper(X))
proper(0) -> ok(0)
proper(s(X)) -> s(proper(X))
proper(dbls(X)) -> dbls(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(indx(X1, X2)) -> indx(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(dbl1(X)) -> dbl1(proper(X))
proper(01) -> ok(01)
proper(s1(X)) -> s1(proper(X))
proper(sel1(X1, X2)) -> sel1(proper(X1), proper(X2))
proper(quote(X)) -> quote(proper(X))
s(ok(X)) -> ok(s(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
from(ok(X)) -> ok(from(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
         ↳Polo
       →DP Problem 2
         ↳Polo
       →DP Problem 3
         ↳Polo
       →DP Problem 4
         ↳Polo
       →DP Problem 5
         ↳Polo
       →DP Problem 6
         ↳Polo
       →DP Problem 7
         ↳Polo
       →DP Problem 8
         ↳Polo
       →DP Problem 9
         ↳Polo
       →DP Problem 10
         ↳Polo
       →DP Problem 11
         ↳Polo
       →DP Problem 12
         ↳Polynomial Ordering
       →DP Problem 13
         ↳Polo
       →DP Problem 14
         ↳Remaining


Dependency Pairs:

ACTIVE(quote(X)) -> ACTIVE(X)
ACTIVE(sel1(X1, X2)) -> ACTIVE(X2)
ACTIVE(sel1(X1, X2)) -> ACTIVE(X1)
ACTIVE(s1(X)) -> ACTIVE(X)
ACTIVE(dbl1(X)) -> ACTIVE(X)
ACTIVE(indx(X1, X2)) -> ACTIVE(X1)
ACTIVE(sel(X1, X2)) -> ACTIVE(X2)
ACTIVE(sel(X1, X2)) -> ACTIVE(X1)
ACTIVE(dbls(X)) -> ACTIVE(X)
ACTIVE(dbl(X)) -> ACTIVE(X)


Rules:


active(dbl(0)) -> mark(0)
active(dbl(s(X))) -> mark(s(s(dbl(X))))
active(dbls(nil)) -> mark(nil)
active(dbls(cons(X, Y))) -> mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) -> mark(X)
active(sel(s(X), cons(Y, Z))) -> mark(sel(X, Z))
active(indx(nil, X)) -> mark(nil)
active(indx(cons(X, Y), Z)) -> mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) -> mark(cons(X, from(s(X))))
active(dbl1(0)) -> mark(01)
active(dbl1(s(X))) -> mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) -> mark(X)
active(sel1(s(X), cons(Y, Z))) -> mark(sel1(X, Z))
active(quote(0)) -> mark(01)
active(quote(s(X))) -> mark(s1(quote(X)))
active(quote(dbl(X))) -> mark(dbl1(X))
active(quote(sel(X, Y))) -> mark(sel1(X, Y))
active(dbl(X)) -> dbl(active(X))
active(dbls(X)) -> dbls(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(indx(X1, X2)) -> indx(active(X1), X2)
active(dbl1(X)) -> dbl1(active(X))
active(s1(X)) -> s1(active(X))
active(sel1(X1, X2)) -> sel1(active(X1), X2)
active(sel1(X1, X2)) -> sel1(X1, active(X2))
active(quote(X)) -> quote(active(X))
dbl(mark(X)) -> mark(dbl(X))
dbl(ok(X)) -> ok(dbl(X))
dbls(mark(X)) -> mark(dbls(X))
dbls(ok(X)) -> ok(dbls(X))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
indx(mark(X1), X2) -> mark(indx(X1, X2))
indx(ok(X1), ok(X2)) -> ok(indx(X1, X2))
dbl1(mark(X)) -> mark(dbl1(X))
dbl1(ok(X)) -> ok(dbl1(X))
s1(mark(X)) -> mark(s1(X))
s1(ok(X)) -> ok(s1(X))
sel1(mark(X1), X2) -> mark(sel1(X1, X2))
sel1(X1, mark(X2)) -> mark(sel1(X1, X2))
sel1(ok(X1), ok(X2)) -> ok(sel1(X1, X2))
quote(mark(X)) -> mark(quote(X))
quote(ok(X)) -> ok(quote(X))
proper(dbl(X)) -> dbl(proper(X))
proper(0) -> ok(0)
proper(s(X)) -> s(proper(X))
proper(dbls(X)) -> dbls(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(indx(X1, X2)) -> indx(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(dbl1(X)) -> dbl1(proper(X))
proper(01) -> ok(01)
proper(s1(X)) -> s1(proper(X))
proper(sel1(X1, X2)) -> sel1(proper(X1), proper(X2))
proper(quote(X)) -> quote(proper(X))
s(ok(X)) -> ok(s(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
from(ok(X)) -> ok(from(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))


Strategy:

innermost




The following dependency pair can be strictly oriented:

ACTIVE(quote(X)) -> ACTIVE(X)


There are no usable rules for innermost w.r.t. to the implicit AFS that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:
  POL(s1(x1))=  x1  
  POL(ACTIVE(x1))=  x1  
  POL(dbls(x1))=  x1  
  POL(quote(x1))=  1 + x1  
  POL(indx(x1, x2))=  x1  
  POL(dbl(x1))=  x1  
  POL(sel(x1, x2))=  x1 + x2  
  POL(sel1(x1, x2))=  x1 + x2  
  POL(dbl1(x1))=  x1  

resulting in one new DP problem. 



   R
     ↳DPs
       →DP Problem 1
         ↳Polo
       →DP Problem 2
         ↳Polo
       →DP Problem 3
         ↳Polo
       →DP Problem 4
         ↳Polo
       →DP Problem 5
         ↳Polo
       →DP Problem 6
         ↳Polo
       →DP Problem 7
         ↳Polo
       →DP Problem 8
         ↳Polo
       →DP Problem 9
         ↳Polo
       →DP Problem 10
         ↳Polo
       →DP Problem 11
         ↳Polo
       →DP Problem 12
         ↳Polo
           →DP Problem 36
             ↳Polynomial Ordering
       →DP Problem 13
         ↳Polo
       →DP Problem 14
         ↳Remaining


Dependency Pairs:

ACTIVE(sel1(X1, X2)) -> ACTIVE(X2)
ACTIVE(sel1(X1, X2)) -> ACTIVE(X1)
ACTIVE(s1(X)) -> ACTIVE(X)
ACTIVE(dbl1(X)) -> ACTIVE(X)
ACTIVE(indx(X1, X2)) -> ACTIVE(X1)
ACTIVE(sel(X1, X2)) -> ACTIVE(X2)
ACTIVE(sel(X1, X2)) -> ACTIVE(X1)
ACTIVE(dbls(X)) -> ACTIVE(X)
ACTIVE(dbl(X)) -> ACTIVE(X)


Rules:


active(dbl(0)) -> mark(0)
active(dbl(s(X))) -> mark(s(s(dbl(X))))
active(dbls(nil)) -> mark(nil)
active(dbls(cons(X, Y))) -> mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) -> mark(X)
active(sel(s(X), cons(Y, Z))) -> mark(sel(X, Z))
active(indx(nil, X)) -> mark(nil)
active(indx(cons(X, Y), Z)) -> mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) -> mark(cons(X, from(s(X))))
active(dbl1(0)) -> mark(01)
active(dbl1(s(X))) -> mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) -> mark(X)
active(sel1(s(X), cons(Y, Z))) -> mark(sel1(X, Z))
active(quote(0)) -> mark(01)
active(quote(s(X))) -> mark(s1(quote(X)))
active(quote(dbl(X))) -> mark(dbl1(X))
active(quote(sel(X, Y))) -> mark(sel1(X, Y))
active(dbl(X)) -> dbl(active(X))
active(dbls(X)) -> dbls(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(indx(X1, X2)) -> indx(active(X1), X2)
active(dbl1(X)) -> dbl1(active(X))
active(s1(X)) -> s1(active(X))
active(sel1(X1, X2)) -> sel1(active(X1), X2)
active(sel1(X1, X2)) -> sel1(X1, active(X2))
active(quote(X)) -> quote(active(X))
dbl(mark(X)) -> mark(dbl(X))
dbl(ok(X)) -> ok(dbl(X))
dbls(mark(X)) -> mark(dbls(X))
dbls(ok(X)) -> ok(dbls(X))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
indx(mark(X1), X2) -> mark(indx(X1, X2))
indx(ok(X1), ok(X2)) -> ok(indx(X1, X2))
dbl1(mark(X)) -> mark(dbl1(X))
dbl1(ok(X)) -> ok(dbl1(X))
s1(mark(X)) -> mark(s1(X))
s1(ok(X)) -> ok(s1(X))
sel1(mark(X1), X2) -> mark(sel1(X1, X2))
sel1(X1, mark(X2)) -> mark(sel1(X1, X2))
sel1(ok(X1), ok(X2)) -> ok(sel1(X1, X2))
quote(mark(X)) -> mark(quote(X))
quote(ok(X)) -> ok(quote(X))
proper(dbl(X)) -> dbl(proper(X))
proper(0) -> ok(0)
proper(s(X)) -> s(proper(X))
proper(dbls(X)) -> dbls(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(indx(X1, X2)) -> indx(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(dbl1(X)) -> dbl1(proper(X))
proper(01) -> ok(01)
proper(s1(X)) -> s1(proper(X))
proper(sel1(X1, X2)) -> sel1(proper(X1), proper(X2))
proper(quote(X)) -> quote(proper(X))
s(ok(X)) -> ok(s(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
from(ok(X)) -> ok(from(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))


Strategy:

innermost




The following dependency pairs can be strictly oriented:

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


There are no usable rules for innermost w.r.t. to the implicit AFS that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:
  POL(s1(x1))=  x1  
  POL(ACTIVE(x1))=  x1  
  POL(dbls(x1))=  x1  
  POL(indx(x1, x2))=  x1  
  POL(dbl(x1))=  x1  
  POL(sel(x1, x2))=  x1 + x2  
  POL(sel1(x1, x2))=  1 + x1 + x2  
  POL(dbl1(x1))=  x1  

resulting in one new DP problem. 



   R
     ↳DPs
       →DP Problem 1
         ↳Polo
       →DP Problem 2
         ↳Polo
       →DP Problem 3
         ↳Polo
       →DP Problem 4
         ↳Polo
       →DP Problem 5
         ↳Polo
       →DP Problem 6
         ↳Polo
       →DP Problem 7
         ↳Polo
       →DP Problem 8
         ↳Polo
       →DP Problem 9
         ↳Polo
       →DP Problem 10
         ↳Polo
       →DP Problem 11
         ↳Polo
       →DP Problem 12
         ↳Polo
           →DP Problem 36
             ↳Polo
             ...
               →DP Problem 37
                 ↳Polynomial Ordering
       →DP Problem 13
         ↳Polo
       →DP Problem 14
         ↳Remaining


Dependency Pairs:

ACTIVE(s1(X)) -> ACTIVE(X)
ACTIVE(dbl1(X)) -> ACTIVE(X)
ACTIVE(indx(X1, X2)) -> ACTIVE(X1)
ACTIVE(sel(X1, X2)) -> ACTIVE(X2)
ACTIVE(sel(X1, X2)) -> ACTIVE(X1)
ACTIVE(dbls(X)) -> ACTIVE(X)
ACTIVE(dbl(X)) -> ACTIVE(X)


Rules:


active(dbl(0)) -> mark(0)
active(dbl(s(X))) -> mark(s(s(dbl(X))))
active(dbls(nil)) -> mark(nil)
active(dbls(cons(X, Y))) -> mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) -> mark(X)
active(sel(s(X), cons(Y, Z))) -> mark(sel(X, Z))
active(indx(nil, X)) -> mark(nil)
active(indx(cons(X, Y), Z)) -> mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) -> mark(cons(X, from(s(X))))
active(dbl1(0)) -> mark(01)
active(dbl1(s(X))) -> mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) -> mark(X)
active(sel1(s(X), cons(Y, Z))) -> mark(sel1(X, Z))
active(quote(0)) -> mark(01)
active(quote(s(X))) -> mark(s1(quote(X)))
active(quote(dbl(X))) -> mark(dbl1(X))
active(quote(sel(X, Y))) -> mark(sel1(X, Y))
active(dbl(X)) -> dbl(active(X))
active(dbls(X)) -> dbls(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(indx(X1, X2)) -> indx(active(X1), X2)
active(dbl1(X)) -> dbl1(active(X))
active(s1(X)) -> s1(active(X))
active(sel1(X1, X2)) -> sel1(active(X1), X2)
active(sel1(X1, X2)) -> sel1(X1, active(X2))
active(quote(X)) -> quote(active(X))
dbl(mark(X)) -> mark(dbl(X))
dbl(ok(X)) -> ok(dbl(X))
dbls(mark(X)) -> mark(dbls(X))
dbls(ok(X)) -> ok(dbls(X))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
indx(mark(X1), X2) -> mark(indx(X1, X2))
indx(ok(X1), ok(X2)) -> ok(indx(X1, X2))
dbl1(mark(X)) -> mark(dbl1(X))
dbl1(ok(X)) -> ok(dbl1(X))
s1(mark(X)) -> mark(s1(X))
s1(ok(X)) -> ok(s1(X))
sel1(mark(X1), X2) -> mark(sel1(X1, X2))
sel1(X1, mark(X2)) -> mark(sel1(X1, X2))
sel1(ok(X1), ok(X2)) -> ok(sel1(X1, X2))
quote(mark(X)) -> mark(quote(X))
quote(ok(X)) -> ok(quote(X))
proper(dbl(X)) -> dbl(proper(X))
proper(0) -> ok(0)
proper(s(X)) -> s(proper(X))
proper(dbls(X)) -> dbls(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(indx(X1, X2)) -> indx(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(dbl1(X)) -> dbl1(proper(X))
proper(01) -> ok(01)
proper(s1(X)) -> s1(proper(X))
proper(sel1(X1, X2)) -> sel1(proper(X1), proper(X2))
proper(quote(X)) -> quote(proper(X))
s(ok(X)) -> ok(s(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
from(ok(X)) -> ok(from(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))


Strategy:

innermost




The following dependency pair can be strictly oriented:

ACTIVE(s1(X)) -> ACTIVE(X)


There are no usable rules for innermost w.r.t. to the implicit AFS that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:
  POL(s1(x1))=  1 + x1  
  POL(ACTIVE(x1))=  x1  
  POL(dbls(x1))=  x1  
  POL(indx(x1, x2))=  x1  
  POL(dbl(x1))=  x1  
  POL(sel(x1, x2))=  x1 + x2  
  POL(dbl1(x1))=  x1  

resulting in one new DP problem. 



   R
     ↳DPs
       →DP Problem 1
         ↳Polo
       →DP Problem 2
         ↳Polo
       →DP Problem 3
         ↳Polo
       →DP Problem 4
         ↳Polo
       →DP Problem 5
         ↳Polo
       →DP Problem 6
         ↳Polo
       →DP Problem 7
         ↳Polo
       →DP Problem 8
         ↳Polo
       →DP Problem 9
         ↳Polo
       →DP Problem 10
         ↳Polo
       →DP Problem 11
         ↳Polo
       →DP Problem 12
         ↳Polo
           →DP Problem 36
             ↳Polo
             ...
               →DP Problem 38
                 ↳Polynomial Ordering
       →DP Problem 13
         ↳Polo
       →DP Problem 14
         ↳Remaining


Dependency Pairs:

ACTIVE(dbl1(X)) -> ACTIVE(X)
ACTIVE(indx(X1, X2)) -> ACTIVE(X1)
ACTIVE(sel(X1, X2)) -> ACTIVE(X2)
ACTIVE(sel(X1, X2)) -> ACTIVE(X1)
ACTIVE(dbls(X)) -> ACTIVE(X)
ACTIVE(dbl(X)) -> ACTIVE(X)


Rules:


active(dbl(0)) -> mark(0)
active(dbl(s(X))) -> mark(s(s(dbl(X))))
active(dbls(nil)) -> mark(nil)
active(dbls(cons(X, Y))) -> mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) -> mark(X)
active(sel(s(X), cons(Y, Z))) -> mark(sel(X, Z))
active(indx(nil, X)) -> mark(nil)
active(indx(cons(X, Y), Z)) -> mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) -> mark(cons(X, from(s(X))))
active(dbl1(0)) -> mark(01)
active(dbl1(s(X))) -> mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) -> mark(X)
active(sel1(s(X), cons(Y, Z))) -> mark(sel1(X, Z))
active(quote(0)) -> mark(01)
active(quote(s(X))) -> mark(s1(quote(X)))
active(quote(dbl(X))) -> mark(dbl1(X))
active(quote(sel(X, Y))) -> mark(sel1(X, Y))
active(dbl(X)) -> dbl(active(X))
active(dbls(X)) -> dbls(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(indx(X1, X2)) -> indx(active(X1), X2)
active(dbl1(X)) -> dbl1(active(X))
active(s1(X)) -> s1(active(X))
active(sel1(X1, X2)) -> sel1(active(X1), X2)
active(sel1(X1, X2)) -> sel1(X1, active(X2))
active(quote(X)) -> quote(active(X))
dbl(mark(X)) -> mark(dbl(X))
dbl(ok(X)) -> ok(dbl(X))
dbls(mark(X)) -> mark(dbls(X))
dbls(ok(X)) -> ok(dbls(X))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
indx(mark(X1), X2) -> mark(indx(X1, X2))
indx(ok(X1), ok(X2)) -> ok(indx(X1, X2))
dbl1(mark(X)) -> mark(dbl1(X))
dbl1(ok(X)) -> ok(dbl1(X))
s1(mark(X)) -> mark(s1(X))
s1(ok(X)) -> ok(s1(X))
sel1(mark(X1), X2) -> mark(sel1(X1, X2))
sel1(X1, mark(X2)) -> mark(sel1(X1, X2))
sel1(ok(X1), ok(X2)) -> ok(sel1(X1, X2))
quote(mark(X)) -> mark(quote(X))
quote(ok(X)) -> ok(quote(X))
proper(dbl(X)) -> dbl(proper(X))
proper(0) -> ok(0)
proper(s(X)) -> s(proper(X))
proper(dbls(X)) -> dbls(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(indx(X1, X2)) -> indx(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(dbl1(X)) -> dbl1(proper(X))
proper(01) -> ok(01)
proper(s1(X)) -> s1(proper(X))
proper(sel1(X1, X2)) -> sel1(proper(X1), proper(X2))
proper(quote(X)) -> quote(proper(X))
s(ok(X)) -> ok(s(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
from(ok(X)) -> ok(from(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))


Strategy:

innermost




The following dependency pair can be strictly oriented:

ACTIVE(dbl1(X)) -> ACTIVE(X)


There are no usable rules for innermost w.r.t. to the implicit AFS that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:
  POL(ACTIVE(x1))=  x1  
  POL(dbls(x1))=  x1  
  POL(indx(x1, x2))=  x1  
  POL(dbl(x1))=  x1  
  POL(sel(x1, x2))=  x1 + x2  
  POL(dbl1(x1))=  1 + x1  

resulting in one new DP problem. 



   R
     ↳DPs
       →DP Problem 1
         ↳Polo
       →DP Problem 2
         ↳Polo
       →DP Problem 3
         ↳Polo
       →DP Problem 4
         ↳Polo
       →DP Problem 5
         ↳Polo
       →DP Problem 6
         ↳Polo
       →DP Problem 7
         ↳Polo
       →DP Problem 8
         ↳Polo
       →DP Problem 9
         ↳Polo
       →DP Problem 10
         ↳Polo
       →DP Problem 11
         ↳Polo
       →DP Problem 12
         ↳Polo
           →DP Problem 36
             ↳Polo
             ...
               →DP Problem 39
                 ↳Polynomial Ordering
       →DP Problem 13
         ↳Polo
       →DP Problem 14
         ↳Remaining


Dependency Pairs:

ACTIVE(indx(X1, X2)) -> ACTIVE(X1)
ACTIVE(sel(X1, X2)) -> ACTIVE(X2)
ACTIVE(sel(X1, X2)) -> ACTIVE(X1)
ACTIVE(dbls(X)) -> ACTIVE(X)
ACTIVE(dbl(X)) -> ACTIVE(X)


Rules:


active(dbl(0)) -> mark(0)
active(dbl(s(X))) -> mark(s(s(dbl(X))))
active(dbls(nil)) -> mark(nil)
active(dbls(cons(X, Y))) -> mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) -> mark(X)
active(sel(s(X), cons(Y, Z))) -> mark(sel(X, Z))
active(indx(nil, X)) -> mark(nil)
active(indx(cons(X, Y), Z)) -> mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) -> mark(cons(X, from(s(X))))
active(dbl1(0)) -> mark(01)
active(dbl1(s(X))) -> mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) -> mark(X)
active(sel1(s(X), cons(Y, Z))) -> mark(sel1(X, Z))
active(quote(0)) -> mark(01)
active(quote(s(X))) -> mark(s1(quote(X)))
active(quote(dbl(X))) -> mark(dbl1(X))
active(quote(sel(X, Y))) -> mark(sel1(X, Y))
active(dbl(X)) -> dbl(active(X))
active(dbls(X)) -> dbls(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(indx(X1, X2)) -> indx(active(X1), X2)
active(dbl1(X)) -> dbl1(active(X))
active(s1(X)) -> s1(active(X))
active(sel1(X1, X2)) -> sel1(active(X1), X2)
active(sel1(X1, X2)) -> sel1(X1, active(X2))
active(quote(X)) -> quote(active(X))
dbl(mark(X)) -> mark(dbl(X))
dbl(ok(X)) -> ok(dbl(X))
dbls(mark(X)) -> mark(dbls(X))
dbls(ok(X)) -> ok(dbls(X))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
indx(mark(X1), X2) -> mark(indx(X1, X2))
indx(ok(X1), ok(X2)) -> ok(indx(X1, X2))
dbl1(mark(X)) -> mark(dbl1(X))
dbl1(ok(X)) -> ok(dbl1(X))
s1(mark(X)) -> mark(s1(X))
s1(ok(X)) -> ok(s1(X))
sel1(mark(X1), X2) -> mark(sel1(X1, X2))
sel1(X1, mark(X2)) -> mark(sel1(X1, X2))
sel1(ok(X1), ok(X2)) -> ok(sel1(X1, X2))
quote(mark(X)) -> mark(quote(X))
quote(ok(X)) -> ok(quote(X))
proper(dbl(X)) -> dbl(proper(X))
proper(0) -> ok(0)
proper(s(X)) -> s(proper(X))
proper(dbls(X)) -> dbls(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(indx(X1, X2)) -> indx(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(dbl1(X)) -> dbl1(proper(X))
proper(01) -> ok(01)
proper(s1(X)) -> s1(proper(X))
proper(sel1(X1, X2)) -> sel1(proper(X1), proper(X2))
proper(quote(X)) -> quote(proper(X))
s(ok(X)) -> ok(s(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
from(ok(X)) -> ok(from(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))


Strategy:

innermost




The following dependency pair can be strictly oriented:

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


There are no usable rules for innermost w.r.t. to the implicit AFS that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:
  POL(ACTIVE(x1))=  x1  
  POL(dbls(x1))=  x1  
  POL(indx(x1, x2))=  1 + x1  
  POL(dbl(x1))=  x1  
  POL(sel(x1, x2))=  x1 + x2  

resulting in one new DP problem. 



   R
     ↳DPs
       →DP Problem 1
         ↳Polo
       →DP Problem 2
         ↳Polo
       →DP Problem 3
         ↳Polo
       →DP Problem 4
         ↳Polo
       →DP Problem 5
         ↳Polo
       →DP Problem 6
         ↳Polo
       →DP Problem 7
         ↳Polo
       →DP Problem 8
         ↳Polo
       →DP Problem 9
         ↳Polo
       →DP Problem 10
         ↳Polo
       →DP Problem 11
         ↳Polo
       →DP Problem 12
         ↳Polo
           →DP Problem 36
             ↳Polo
             ...
               →DP Problem 40
                 ↳Polynomial Ordering
       →DP Problem 13
         ↳Polo
       →DP Problem 14
         ↳Remaining


Dependency Pairs:

ACTIVE(sel(X1, X2)) -> ACTIVE(X2)
ACTIVE(sel(X1, X2)) -> ACTIVE(X1)
ACTIVE(dbls(X)) -> ACTIVE(X)
ACTIVE(dbl(X)) -> ACTIVE(X)


Rules:


active(dbl(0)) -> mark(0)
active(dbl(s(X))) -> mark(s(s(dbl(X))))
active(dbls(nil)) -> mark(nil)
active(dbls(cons(X, Y))) -> mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) -> mark(X)
active(sel(s(X), cons(Y, Z))) -> mark(sel(X, Z))
active(indx(nil, X)) -> mark(nil)
active(indx(cons(X, Y), Z)) -> mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) -> mark(cons(X, from(s(X))))
active(dbl1(0)) -> mark(01)
active(dbl1(s(X))) -> mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) -> mark(X)
active(sel1(s(X), cons(Y, Z))) -> mark(sel1(X, Z))
active(quote(0)) -> mark(01)
active(quote(s(X))) -> mark(s1(quote(X)))
active(quote(dbl(X))) -> mark(dbl1(X))
active(quote(sel(X, Y))) -> mark(sel1(X, Y))
active(dbl(X)) -> dbl(active(X))
active(dbls(X)) -> dbls(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(indx(X1, X2)) -> indx(active(X1), X2)
active(dbl1(X)) -> dbl1(active(X))
active(s1(X)) -> s1(active(X))
active(sel1(X1, X2)) -> sel1(active(X1), X2)
active(sel1(X1, X2)) -> sel1(X1, active(X2))
active(quote(X)) -> quote(active(X))
dbl(mark(X)) -> mark(dbl(X))
dbl(ok(X)) -> ok(dbl(X))
dbls(mark(X)) -> mark(dbls(X))
dbls(ok(X)) -> ok(dbls(X))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
indx(mark(X1), X2) -> mark(indx(X1, X2))
indx(ok(X1), ok(X2)) -> ok(indx(X1, X2))
dbl1(mark(X)) -> mark(dbl1(X))
dbl1(ok(X)) -> ok(dbl1(X))
s1(mark(X)) -> mark(s1(X))
s1(ok(X)) -> ok(s1(X))
sel1(mark(X1), X2) -> mark(sel1(X1, X2))
sel1(X1, mark(X2)) -> mark(sel1(X1, X2))
sel1(ok(X1), ok(X2)) -> ok(sel1(X1, X2))
quote(mark(X)) -> mark(quote(X))
quote(ok(X)) -> ok(quote(X))
proper(dbl(X)) -> dbl(proper(X))
proper(0) -> ok(0)
proper(s(X)) -> s(proper(X))
proper(dbls(X)) -> dbls(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(indx(X1, X2)) -> indx(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(dbl1(X)) -> dbl1(proper(X))
proper(01) -> ok(01)
proper(s1(X)) -> s1(proper(X))
proper(sel1(X1, X2)) -> sel1(proper(X1), proper(X2))
proper(quote(X)) -> quote(proper(X))
s(ok(X)) -> ok(s(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
from(ok(X)) -> ok(from(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))


Strategy:

innermost




The following dependency pairs can be strictly oriented:

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


There are no usable rules for innermost w.r.t. to the implicit AFS that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:
  POL(ACTIVE(x1))=  x1  
  POL(dbls(x1))=  x1  
  POL(dbl(x1))=  x1  
  POL(sel(x1, x2))=  1 + x1 + x2  

resulting in one new DP problem. 



   R
     ↳DPs
       →DP Problem 1
         ↳Polo
       →DP Problem 2
         ↳Polo
       →DP Problem 3
         ↳Polo
       →DP Problem 4
         ↳Polo
       →DP Problem 5
         ↳Polo
       →DP Problem 6
         ↳Polo
       →DP Problem 7
         ↳Polo
       →DP Problem 8
         ↳Polo
       →DP Problem 9
         ↳Polo
       →DP Problem 10
         ↳Polo
       →DP Problem 11
         ↳Polo
       →DP Problem 12
         ↳Polo
           →DP Problem 36
             ↳Polo
             ...
               →DP Problem 41
                 ↳Polynomial Ordering
       →DP Problem 13
         ↳Polo
       →DP Problem 14
         ↳Remaining


Dependency Pairs:

ACTIVE(dbls(X)) -> ACTIVE(X)
ACTIVE(dbl(X)) -> ACTIVE(X)


Rules:


active(dbl(0)) -> mark(0)
active(dbl(s(X))) -> mark(s(s(dbl(X))))
active(dbls(nil)) -> mark(nil)
active(dbls(cons(X, Y))) -> mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) -> mark(X)
active(sel(s(X), cons(Y, Z))) -> mark(sel(X, Z))
active(indx(nil, X)) -> mark(nil)
active(indx(cons(X, Y), Z)) -> mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) -> mark(cons(X, from(s(X))))
active(dbl1(0)) -> mark(01)
active(dbl1(s(X))) -> mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) -> mark(X)
active(sel1(s(X), cons(Y, Z))) -> mark(sel1(X, Z))
active(quote(0)) -> mark(01)
active(quote(s(X))) -> mark(s1(quote(X)))
active(quote(dbl(X))) -> mark(dbl1(X))
active(quote(sel(X, Y))) -> mark(sel1(X, Y))
active(dbl(X)) -> dbl(active(X))
active(dbls(X)) -> dbls(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(indx(X1, X2)) -> indx(active(X1), X2)
active(dbl1(X)) -> dbl1(active(X))
active(s1(X)) -> s1(active(X))
active(sel1(X1, X2)) -> sel1(active(X1), X2)
active(sel1(X1, X2)) -> sel1(X1, active(X2))
active(quote(X)) -> quote(active(X))
dbl(mark(X)) -> mark(dbl(X))
dbl(ok(X)) -> ok(dbl(X))
dbls(mark(X)) -> mark(dbls(X))
dbls(ok(X)) -> ok(dbls(X))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
indx(mark(X1), X2) -> mark(indx(X1, X2))
indx(ok(X1), ok(X2)) -> ok(indx(X1, X2))
dbl1(mark(X)) -> mark(dbl1(X))
dbl1(ok(X)) -> ok(dbl1(X))
s1(mark(X)) -> mark(s1(X))
s1(ok(X)) -> ok(s1(X))
sel1(mark(X1), X2) -> mark(sel1(X1, X2))
sel1(X1, mark(X2)) -> mark(sel1(X1, X2))
sel1(ok(X1), ok(X2)) -> ok(sel1(X1, X2))
quote(mark(X)) -> mark(quote(X))
quote(ok(X)) -> ok(quote(X))
proper(dbl(X)) -> dbl(proper(X))
proper(0) -> ok(0)
proper(s(X)) -> s(proper(X))
proper(dbls(X)) -> dbls(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(indx(X1, X2)) -> indx(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(dbl1(X)) -> dbl1(proper(X))
proper(01) -> ok(01)
proper(s1(X)) -> s1(proper(X))
proper(sel1(X1, X2)) -> sel1(proper(X1), proper(X2))
proper(quote(X)) -> quote(proper(X))
s(ok(X)) -> ok(s(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
from(ok(X)) -> ok(from(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))


Strategy:

innermost




The following dependency pair can be strictly oriented:

ACTIVE(dbls(X)) -> ACTIVE(X)


There are no usable rules for innermost w.r.t. to the implicit AFS that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:
  POL(ACTIVE(x1))=  x1  
  POL(dbls(x1))=  1 + x1  
  POL(dbl(x1))=  x1  

resulting in one new DP problem. 



   R
     ↳DPs
       →DP Problem 1
         ↳Polo
       →DP Problem 2
         ↳Polo
       →DP Problem 3
         ↳Polo
       →DP Problem 4
         ↳Polo
       →DP Problem 5
         ↳Polo
       →DP Problem 6
         ↳Polo
       →DP Problem 7
         ↳Polo
       →DP Problem 8
         ↳Polo
       →DP Problem 9
         ↳Polo
       →DP Problem 10
         ↳Polo
       →DP Problem 11
         ↳Polo
       →DP Problem 12
         ↳Polo
           →DP Problem 36
             ↳Polo
             ...
               →DP Problem 42
                 ↳Polynomial Ordering
       →DP Problem 13
         ↳Polo
       →DP Problem 14
         ↳Remaining


Dependency Pair:

ACTIVE(dbl(X)) -> ACTIVE(X)


Rules:


active(dbl(0)) -> mark(0)
active(dbl(s(X))) -> mark(s(s(dbl(X))))
active(dbls(nil)) -> mark(nil)
active(dbls(cons(X, Y))) -> mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) -> mark(X)
active(sel(s(X), cons(Y, Z))) -> mark(sel(X, Z))
active(indx(nil, X)) -> mark(nil)
active(indx(cons(X, Y), Z)) -> mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) -> mark(cons(X, from(s(X))))
active(dbl1(0)) -> mark(01)
active(dbl1(s(X))) -> mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) -> mark(X)
active(sel1(s(X), cons(Y, Z))) -> mark(sel1(X, Z))
active(quote(0)) -> mark(01)
active(quote(s(X))) -> mark(s1(quote(X)))
active(quote(dbl(X))) -> mark(dbl1(X))
active(quote(sel(X, Y))) -> mark(sel1(X, Y))
active(dbl(X)) -> dbl(active(X))
active(dbls(X)) -> dbls(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(indx(X1, X2)) -> indx(active(X1), X2)
active(dbl1(X)) -> dbl1(active(X))
active(s1(X)) -> s1(active(X))
active(sel1(X1, X2)) -> sel1(active(X1), X2)
active(sel1(X1, X2)) -> sel1(X1, active(X2))
active(quote(X)) -> quote(active(X))
dbl(mark(X)) -> mark(dbl(X))
dbl(ok(X)) -> ok(dbl(X))
dbls(mark(X)) -> mark(dbls(X))
dbls(ok(X)) -> ok(dbls(X))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
indx(mark(X1), X2) -> mark(indx(X1, X2))
indx(ok(X1), ok(X2)) -> ok(indx(X1, X2))
dbl1(mark(X)) -> mark(dbl1(X))
dbl1(ok(X)) -> ok(dbl1(X))
s1(mark(X)) -> mark(s1(X))
s1(ok(X)) -> ok(s1(X))
sel1(mark(X1), X2) -> mark(sel1(X1, X2))
sel1(X1, mark(X2)) -> mark(sel1(X1, X2))
sel1(ok(X1), ok(X2)) -> ok(sel1(X1, X2))
quote(mark(X)) -> mark(quote(X))
quote(ok(X)) -> ok(quote(X))
proper(dbl(X)) -> dbl(proper(X))
proper(0) -> ok(0)
proper(s(X)) -> s(proper(X))
proper(dbls(X)) -> dbls(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(indx(X1, X2)) -> indx(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(dbl1(X)) -> dbl1(proper(X))
proper(01) -> ok(01)
proper(s1(X)) -> s1(proper(X))
proper(sel1(X1, X2)) -> sel1(proper(X1), proper(X2))
proper(quote(X)) -> quote(proper(X))
s(ok(X)) -> ok(s(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
from(ok(X)) -> ok(from(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))


Strategy:

innermost




The following dependency pair can be strictly oriented:

ACTIVE(dbl(X)) -> ACTIVE(X)


There are no usable rules for innermost w.r.t. to the implicit AFS that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:
  POL(ACTIVE(x1))=  x1  
  POL(dbl(x1))=  1 + x1  

resulting in one new DP problem. 



   R
     ↳DPs
       →DP Problem 1
         ↳Polo
       →DP Problem 2
         ↳Polo
       →DP Problem 3
         ↳Polo
       →DP Problem 4
         ↳Polo
       →DP Problem 5
         ↳Polo
       →DP Problem 6
         ↳Polo
       →DP Problem 7
         ↳Polo
       →DP Problem 8
         ↳Polo
       →DP Problem 9
         ↳Polo
       →DP Problem 10
         ↳Polo
       →DP Problem 11
         ↳Polo
       →DP Problem 12
         ↳Polo
           →DP Problem 36
             ↳Polo
             ...
               →DP Problem 43
                 ↳Dependency Graph
       →DP Problem 13
         ↳Polo
       →DP Problem 14
         ↳Remaining


Dependency Pair:


Rules:


active(dbl(0)) -> mark(0)
active(dbl(s(X))) -> mark(s(s(dbl(X))))
active(dbls(nil)) -> mark(nil)
active(dbls(cons(X, Y))) -> mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) -> mark(X)
active(sel(s(X), cons(Y, Z))) -> mark(sel(X, Z))
active(indx(nil, X)) -> mark(nil)
active(indx(cons(X, Y), Z)) -> mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) -> mark(cons(X, from(s(X))))
active(dbl1(0)) -> mark(01)
active(dbl1(s(X))) -> mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) -> mark(X)
active(sel1(s(X), cons(Y, Z))) -> mark(sel1(X, Z))
active(quote(0)) -> mark(01)
active(quote(s(X))) -> mark(s1(quote(X)))
active(quote(dbl(X))) -> mark(dbl1(X))
active(quote(sel(X, Y))) -> mark(sel1(X, Y))
active(dbl(X)) -> dbl(active(X))
active(dbls(X)) -> dbls(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(indx(X1, X2)) -> indx(active(X1), X2)
active(dbl1(X)) -> dbl1(active(X))
active(s1(X)) -> s1(active(X))
active(sel1(X1, X2)) -> sel1(active(X1), X2)
active(sel1(X1, X2)) -> sel1(X1, active(X2))
active(quote(X)) -> quote(active(X))
dbl(mark(X)) -> mark(dbl(X))
dbl(ok(X)) -> ok(dbl(X))
dbls(mark(X)) -> mark(dbls(X))
dbls(ok(X)) -> ok(dbls(X))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
indx(mark(X1), X2) -> mark(indx(X1, X2))
indx(ok(X1), ok(X2)) -> ok(indx(X1, X2))
dbl1(mark(X)) -> mark(dbl1(X))
dbl1(ok(X)) -> ok(dbl1(X))
s1(mark(X)) -> mark(s1(X))
s1(ok(X)) -> ok(s1(X))
sel1(mark(X1), X2) -> mark(sel1(X1, X2))
sel1(X1, mark(X2)) -> mark(sel1(X1, X2))
sel1(ok(X1), ok(X2)) -> ok(sel1(X1, X2))
quote(mark(X)) -> mark(quote(X))
quote(ok(X)) -> ok(quote(X))
proper(dbl(X)) -> dbl(proper(X))
proper(0) -> ok(0)
proper(s(X)) -> s(proper(X))
proper(dbls(X)) -> dbls(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(indx(X1, X2)) -> indx(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(dbl1(X)) -> dbl1(proper(X))
proper(01) -> ok(01)
proper(s1(X)) -> s1(proper(X))
proper(sel1(X1, X2)) -> sel1(proper(X1), proper(X2))
proper(quote(X)) -> quote(proper(X))
s(ok(X)) -> ok(s(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
from(ok(X)) -> ok(from(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
         ↳Polo
       →DP Problem 2
         ↳Polo
       →DP Problem 3
         ↳Polo
       →DP Problem 4
         ↳Polo
       →DP Problem 5
         ↳Polo
       →DP Problem 6
         ↳Polo
       →DP Problem 7
         ↳Polo
       →DP Problem 8
         ↳Polo
       →DP Problem 9
         ↳Polo
       →DP Problem 10
         ↳Polo
       →DP Problem 11
         ↳Polo
       →DP Problem 12
         ↳Polo
       →DP Problem 13
         ↳Polynomial Ordering
       →DP Problem 14
         ↳Remaining


Dependency Pairs:

PROPER(quote(X)) -> PROPER(X)
PROPER(sel1(X1, X2)) -> PROPER(X2)
PROPER(sel1(X1, X2)) -> PROPER(X1)
PROPER(s1(X)) -> PROPER(X)
PROPER(dbl1(X)) -> PROPER(X)
PROPER(from(X)) -> PROPER(X)
PROPER(indx(X1, X2)) -> PROPER(X2)
PROPER(indx(X1, X2)) -> PROPER(X1)
PROPER(sel(X1, X2)) -> PROPER(X2)
PROPER(sel(X1, X2)) -> PROPER(X1)
PROPER(cons(X1, X2)) -> PROPER(X2)
PROPER(cons(X1, X2)) -> PROPER(X1)
PROPER(dbls(X)) -> PROPER(X)
PROPER(s(X)) -> PROPER(X)
PROPER(dbl(X)) -> PROPER(X)


Rules:


active(dbl(0)) -> mark(0)
active(dbl(s(X))) -> mark(s(s(dbl(X))))
active(dbls(nil)) -> mark(nil)
active(dbls(cons(X, Y))) -> mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) -> mark(X)
active(sel(s(X), cons(Y, Z))) -> mark(sel(X, Z))
active(indx(nil, X)) -> mark(nil)
active(indx(cons(X, Y), Z)) -> mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) -> mark(cons(X, from(s(X))))
active(dbl1(0)) -> mark(01)
active(dbl1(s(X))) -> mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) -> mark(X)
active(sel1(s(X), cons(Y, Z))) -> mark(sel1(X, Z))
active(quote(0)) -> mark(01)
active(quote(s(X))) -> mark(s1(quote(X)))
active(quote(dbl(X))) -> mark(dbl1(X))
active(quote(sel(X, Y))) -> mark(sel1(X, Y))
active(dbl(X)) -> dbl(active(X))
active(dbls(X)) -> dbls(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(indx(X1, X2)) -> indx(active(X1), X2)
active(dbl1(X)) -> dbl1(active(X))
active(s1(X)) -> s1(active(X))
active(sel1(X1, X2)) -> sel1(active(X1), X2)
active(sel1(X1, X2)) -> sel1(X1, active(X2))
active(quote(X)) -> quote(active(X))
dbl(mark(X)) -> mark(dbl(X))
dbl(ok(X)) -> ok(dbl(X))
dbls(mark(X)) -> mark(dbls(X))
dbls(ok(X)) -> ok(dbls(X))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
indx(mark(X1), X2) -> mark(indx(X1, X2))
indx(ok(X1), ok(X2)) -> ok(indx(X1, X2))
dbl1(mark(X)) -> mark(dbl1(X))
dbl1(ok(X)) -> ok(dbl1(X))
s1(mark(X)) -> mark(s1(X))
s1(ok(X)) -> ok(s1(X))
sel1(mark(X1), X2) -> mark(sel1(X1, X2))
sel1(X1, mark(X2)) -> mark(sel1(X1, X2))
sel1(ok(X1), ok(X2)) -> ok(sel1(X1, X2))
quote(mark(X)) -> mark(quote(X))
quote(ok(X)) -> ok(quote(X))
proper(dbl(X)) -> dbl(proper(X))
proper(0) -> ok(0)
proper(s(X)) -> s(proper(X))
proper(dbls(X)) -> dbls(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(indx(X1, X2)) -> indx(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(dbl1(X)) -> dbl1(proper(X))
proper(01) -> ok(01)
proper(s1(X)) -> s1(proper(X))
proper(sel1(X1, X2)) -> sel1(proper(X1), proper(X2))
proper(quote(X)) -> quote(proper(X))
s(ok(X)) -> ok(s(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
from(ok(X)) -> ok(from(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))


Strategy:

innermost




The following dependency pair can be strictly oriented:

PROPER(quote(X)) -> PROPER(X)


There are no usable rules for innermost w.r.t. to the implicit AFS that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:
  POL(s1(x1))=  x1  
  POL(from(x1))=  x1  
  POL(dbls(x1))=  x1  
  POL(quote(x1))=  1 + x1  
  POL(indx(x1, x2))=  x1 + x2  
  POL(PROPER(x1))=  x1  
  POL(cons(x1, x2))=  x1 + x2  
  POL(dbl(x1))=  x1  
  POL(sel(x1, x2))=  x1 + x2  
  POL(s(x1))=  x1  
  POL(sel1(x1, x2))=  x1 + x2  
  POL(dbl1(x1))=  x1  

resulting in one new DP problem. 



   R
     ↳DPs
       →DP Problem 1
         ↳Polo
       →DP Problem 2
         ↳Polo
       →DP Problem 3
         ↳Polo
       →DP Problem 4
         ↳Polo
       →DP Problem 5
         ↳Polo
       →DP Problem 6
         ↳Polo
       →DP Problem 7
         ↳Polo
       →DP Problem 8
         ↳Polo
       →DP Problem 9
         ↳Polo
       →DP Problem 10
         ↳Polo
       →DP Problem 11
         ↳Polo
       →DP Problem 12
         ↳Polo
       →DP Problem 13
         ↳Polo
           →DP Problem 44
             ↳Polynomial Ordering
       →DP Problem 14
         ↳Remaining


Dependency Pairs:

PROPER(sel1(X1, X2)) -> PROPER(X2)
PROPER(sel1(X1, X2)) -> PROPER(X1)
PROPER(s1(X)) -> PROPER(X)
PROPER(dbl1(X)) -> PROPER(X)
PROPER(from(X)) -> PROPER(X)
PROPER(indx(X1, X2)) -> PROPER(X2)
PROPER(indx(X1, X2)) -> PROPER(X1)
PROPER(sel(X1, X2)) -> PROPER(X2)
PROPER(sel(X1, X2)) -> PROPER(X1)
PROPER(cons(X1, X2)) -> PROPER(X2)
PROPER(cons(X1, X2)) -> PROPER(X1)
PROPER(dbls(X)) -> PROPER(X)
PROPER(s(X)) -> PROPER(X)
PROPER(dbl(X)) -> PROPER(X)


Rules:


active(dbl(0)) -> mark(0)
active(dbl(s(X))) -> mark(s(s(dbl(X))))
active(dbls(nil)) -> mark(nil)
active(dbls(cons(X, Y))) -> mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) -> mark(X)
active(sel(s(X), cons(Y, Z))) -> mark(sel(X, Z))
active(indx(nil, X)) -> mark(nil)
active(indx(cons(X, Y), Z)) -> mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) -> mark(cons(X, from(s(X))))
active(dbl1(0)) -> mark(01)
active(dbl1(s(X))) -> mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) -> mark(X)
active(sel1(s(X), cons(Y, Z))) -> mark(sel1(X, Z))
active(quote(0)) -> mark(01)
active(quote(s(X))) -> mark(s1(quote(X)))
active(quote(dbl(X))) -> mark(dbl1(X))
active(quote(sel(X, Y))) -> mark(sel1(X, Y))
active(dbl(X)) -> dbl(active(X))
active(dbls(X)) -> dbls(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(indx(X1, X2)) -> indx(active(X1), X2)
active(dbl1(X)) -> dbl1(active(X))
active(s1(X)) -> s1(active(X))
active(sel1(X1, X2)) -> sel1(active(X1), X2)
active(sel1(X1, X2)) -> sel1(X1, active(X2))
active(quote(X)) -> quote(active(X))
dbl(mark(X)) -> mark(dbl(X))
dbl(ok(X)) -> ok(dbl(X))
dbls(mark(X)) -> mark(dbls(X))
dbls(ok(X)) -> ok(dbls(X))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
indx(mark(X1), X2) -> mark(indx(X1, X2))
indx(ok(X1), ok(X2)) -> ok(indx(X1, X2))
dbl1(mark(X)) -> mark(dbl1(X))
dbl1(ok(X)) -> ok(dbl1(X))
s1(mark(X)) -> mark(s1(X))
s1(ok(X)) -> ok(s1(X))
sel1(mark(X1), X2) -> mark(sel1(X1, X2))
sel1(X1, mark(X2)) -> mark(sel1(X1, X2))
sel1(ok(X1), ok(X2)) -> ok(sel1(X1, X2))
quote(mark(X)) -> mark(quote(X))
quote(ok(X)) -> ok(quote(X))
proper(dbl(X)) -> dbl(proper(X))
proper(0) -> ok(0)
proper(s(X)) -> s(proper(X))
proper(dbls(X)) -> dbls(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(indx(X1, X2)) -> indx(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(dbl1(X)) -> dbl1(proper(X))
proper(01) -> ok(01)
proper(s1(X)) -> s1(proper(X))
proper(sel1(X1, X2)) -> sel1(proper(X1), proper(X2))
proper(quote(X)) -> quote(proper(X))
s(ok(X)) -> ok(s(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
from(ok(X)) -> ok(from(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))


Strategy:

innermost




The following dependency pairs can be strictly oriented:

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


There are no usable rules for innermost w.r.t. to the implicit AFS that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:
  POL(s1(x1))=  x1  
  POL(from(x1))=  x1  
  POL(dbls(x1))=  x1  
  POL(indx(x1, x2))=  x1 + x2  
  POL(PROPER(x1))=  x1  
  POL(cons(x1, x2))=  x1 + x2  
  POL(dbl(x1))=  x1  
  POL(sel(x1, x2))=  x1 + x2  
  POL(s(x1))=  x1  
  POL(sel1(x1, x2))=  1 + x1 + x2  
  POL(dbl1(x1))=  x1  

resulting in one new DP problem. 



   R
     ↳DPs
       →DP Problem 1
         ↳Polo
       →DP Problem 2
         ↳Polo
       →DP Problem 3
         ↳Polo
       →DP Problem 4
         ↳Polo
       →DP Problem 5
         ↳Polo
       →DP Problem 6
         ↳Polo
       →DP Problem 7
         ↳Polo
       →DP Problem 8
         ↳Polo
       →DP Problem 9
         ↳Polo
       →DP Problem 10
         ↳Polo
       →DP Problem 11
         ↳Polo
       →DP Problem 12
         ↳Polo
       →DP Problem 13
         ↳Polo
           →DP Problem 44
             ↳Polo
             ...
               →DP Problem 45
                 ↳Polynomial Ordering
       →DP Problem 14
         ↳Remaining


Dependency Pairs:

PROPER(s1(X)) -> PROPER(X)
PROPER(dbl1(X)) -> PROPER(X)
PROPER(from(X)) -> PROPER(X)
PROPER(indx(X1, X2)) -> PROPER(X2)
PROPER(indx(X1, X2)) -> PROPER(X1)
PROPER(sel(X1, X2)) -> PROPER(X2)
PROPER(sel(X1, X2)) -> PROPER(X1)
PROPER(cons(X1, X2)) -> PROPER(X2)
PROPER(cons(X1, X2)) -> PROPER(X1)
PROPER(dbls(X)) -> PROPER(X)
PROPER(s(X)) -> PROPER(X)
PROPER(dbl(X)) -> PROPER(X)


Rules:


active(dbl(0)) -> mark(0)
active(dbl(s(X))) -> mark(s(s(dbl(X))))
active(dbls(nil)) -> mark(nil)
active(dbls(cons(X, Y))) -> mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) -> mark(X)
active(sel(s(X), cons(Y, Z))) -> mark(sel(X, Z))
active(indx(nil, X)) -> mark(nil)
active(indx(cons(X, Y), Z)) -> mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) -> mark(cons(X, from(s(X))))
active(dbl1(0)) -> mark(01)
active(dbl1(s(X))) -> mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) -> mark(X)
active(sel1(s(X), cons(Y, Z))) -> mark(sel1(X, Z))
active(quote(0)) -> mark(01)
active(quote(s(X))) -> mark(s1(quote(X)))
active(quote(dbl(X))) -> mark(dbl1(X))
active(quote(sel(X, Y))) -> mark(sel1(X, Y))
active(dbl(X)) -> dbl(active(X))
active(dbls(X)) -> dbls(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(indx(X1, X2)) -> indx(active(X1), X2)
active(dbl1(X)) -> dbl1(active(X))
active(s1(X)) -> s1(active(X))
active(sel1(X1, X2)) -> sel1(active(X1), X2)
active(sel1(X1, X2)) -> sel1(X1, active(X2))
active(quote(X)) -> quote(active(X))
dbl(mark(X)) -> mark(dbl(X))
dbl(ok(X)) -> ok(dbl(X))
dbls(mark(X)) -> mark(dbls(X))
dbls(ok(X)) -> ok(dbls(X))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
indx(mark(X1), X2) -> mark(indx(X1, X2))
indx(ok(X1), ok(X2)) -> ok(indx(X1, X2))
dbl1(mark(X)) -> mark(dbl1(X))
dbl1(ok(X)) -> ok(dbl1(X))
s1(mark(X)) -> mark(s1(X))
s1(ok(X)) -> ok(s1(X))
sel1(mark(X1), X2) -> mark(sel1(X1, X2))
sel1(X1, mark(X2)) -> mark(sel1(X1, X2))
sel1(ok(X1), ok(X2)) -> ok(sel1(X1, X2))
quote(mark(X)) -> mark(quote(X))
quote(ok(X)) -> ok(quote(X))
proper(dbl(X)) -> dbl(proper(X))
proper(0) -> ok(0)
proper(s(X)) -> s(proper(X))
proper(dbls(X)) -> dbls(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(indx(X1, X2)) -> indx(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(dbl1(X)) -> dbl1(proper(X))
proper(01) -> ok(01)
proper(s1(X)) -> s1(proper(X))
proper(sel1(X1, X2)) -> sel1(proper(X1), proper(X2))
proper(quote(X)) -> quote(proper(X))
s(ok(X)) -> ok(s(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
from(ok(X)) -> ok(from(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))


Strategy:

innermost




The following dependency pair can be strictly oriented:

PROPER(s1(X)) -> PROPER(X)


There are no usable rules for innermost w.r.t. to the implicit AFS that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:
  POL(s1(x1))=  1 + x1  
  POL(from(x1))=  x1  
  POL(dbls(x1))=  x1  
  POL(indx(x1, x2))=  x1 + x2  
  POL(PROPER(x1))=  x1  
  POL(cons(x1, x2))=  x1 + x2  
  POL(dbl(x1))=  x1  
  POL(sel(x1, x2))=  x1 + x2  
  POL(s(x1))=  x1  
  POL(dbl1(x1))=  x1  

resulting in one new DP problem. 



   R
     ↳DPs
       →DP Problem 1
         ↳Polo
       →DP Problem 2
         ↳Polo
       →DP Problem 3
         ↳Polo
       →DP Problem 4
         ↳Polo
       →DP Problem 5
         ↳Polo
       →DP Problem 6
         ↳Polo
       →DP Problem 7
         ↳Polo
       →DP Problem 8
         ↳Polo
       →DP Problem 9
         ↳Polo
       →DP Problem 10
         ↳Polo
       →DP Problem 11
         ↳Polo
       →DP Problem 12
         ↳Polo
       →DP Problem 13
         ↳Polo
           →DP Problem 44
             ↳Polo
             ...
               →DP Problem 46
                 ↳Polynomial Ordering
       →DP Problem 14
         ↳Remaining


Dependency Pairs:

PROPER(dbl1(X)) -> PROPER(X)
PROPER(from(X)) -> PROPER(X)
PROPER(indx(X1, X2)) -> PROPER(X2)
PROPER(indx(X1, X2)) -> PROPER(X1)
PROPER(sel(X1, X2)) -> PROPER(X2)
PROPER(sel(X1, X2)) -> PROPER(X1)
PROPER(cons(X1, X2)) -> PROPER(X2)
PROPER(cons(X1, X2)) -> PROPER(X1)
PROPER(dbls(X)) -> PROPER(X)
PROPER(s(X)) -> PROPER(X)
PROPER(dbl(X)) -> PROPER(X)


Rules:


active(dbl(0)) -> mark(0)
active(dbl(s(X))) -> mark(s(s(dbl(X))))
active(dbls(nil)) -> mark(nil)
active(dbls(cons(X, Y))) -> mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) -> mark(X)
active(sel(s(X), cons(Y, Z))) -> mark(sel(X, Z))
active(indx(nil, X)) -> mark(nil)
active(indx(cons(X, Y), Z)) -> mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) -> mark(cons(X, from(s(X))))
active(dbl1(0)) -> mark(01)
active(dbl1(s(X))) -> mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) -> mark(X)
active(sel1(s(X), cons(Y, Z))) -> mark(sel1(X, Z))
active(quote(0)) -> mark(01)
active(quote(s(X))) -> mark(s1(quote(X)))
active(quote(dbl(X))) -> mark(dbl1(X))
active(quote(sel(X, Y))) -> mark(sel1(X, Y))
active(dbl(X)) -> dbl(active(X))
active(dbls(X)) -> dbls(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(indx(X1, X2)) -> indx(active(X1), X2)
active(dbl1(X)) -> dbl1(active(X))
active(s1(X)) -> s1(active(X))
active(sel1(X1, X2)) -> sel1(active(X1), X2)
active(sel1(X1, X2)) -> sel1(X1, active(X2))
active(quote(X)) -> quote(active(X))
dbl(mark(X)) -> mark(dbl(X))
dbl(ok(X)) -> ok(dbl(X))
dbls(mark(X)) -> mark(dbls(X))
dbls(ok(X)) -> ok(dbls(X))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
indx(mark(X1), X2) -> mark(indx(X1, X2))
indx(ok(X1), ok(X2)) -> ok(indx(X1, X2))
dbl1(mark(X)) -> mark(dbl1(X))
dbl1(ok(X)) -> ok(dbl1(X))
s1(mark(X)) -> mark(s1(X))
s1(ok(X)) -> ok(s1(X))
sel1(mark(X1), X2) -> mark(sel1(X1, X2))
sel1(X1, mark(X2)) -> mark(sel1(X1, X2))
sel1(ok(X1), ok(X2)) -> ok(sel1(X1, X2))
quote(mark(X)) -> mark(quote(X))
quote(ok(X)) -> ok(quote(X))
proper(dbl(X)) -> dbl(proper(X))
proper(0) -> ok(0)
proper(s(X)) -> s(proper(X))
proper(dbls(X)) -> dbls(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(indx(X1, X2)) -> indx(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(dbl1(X)) -> dbl1(proper(X))
proper(01) -> ok(01)
proper(s1(X)) -> s1(proper(X))
proper(sel1(X1, X2)) -> sel1(proper(X1), proper(X2))
proper(quote(X)) -> quote(proper(X))
s(ok(X)) -> ok(s(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
from(ok(X)) -> ok(from(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))


Strategy:

innermost




The following dependency pair can be strictly oriented:

PROPER(dbl1(X)) -> PROPER(X)


There are no usable rules for innermost w.r.t. to the implicit AFS that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:
  POL(from(x1))=  x1  
  POL(dbls(x1))=  x1  
  POL(indx(x1, x2))=  x1 + x2  
  POL(PROPER(x1))=  x1  
  POL(cons(x1, x2))=  x1 + x2  
  POL(dbl(x1))=  x1  
  POL(sel(x1, x2))=  x1 + x2  
  POL(s(x1))=  x1  
  POL(dbl1(x1))=  1 + x1  

resulting in one new DP problem. 



   R
     ↳DPs
       →DP Problem 1
         ↳Polo
       →DP Problem 2
         ↳Polo
       →DP Problem 3
         ↳Polo
       →DP Problem 4
         ↳Polo
       →DP Problem 5
         ↳Polo
       →DP Problem 6
         ↳Polo
       →DP Problem 7
         ↳Polo
       →DP Problem 8
         ↳Polo
       →DP Problem 9
         ↳Polo
       →DP Problem 10
         ↳Polo
       →DP Problem 11
         ↳Polo
       →DP Problem 12
         ↳Polo
       →DP Problem 13
         ↳Polo
           →DP Problem 44
             ↳Polo
             ...
               →DP Problem 47
                 ↳Polynomial Ordering
       →DP Problem 14
         ↳Remaining


Dependency Pairs:

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


Rules:


active(dbl(0)) -> mark(0)
active(dbl(s(X))) -> mark(s(s(dbl(X))))
active(dbls(nil)) -> mark(nil)
active(dbls(cons(X, Y))) -> mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) -> mark(X)
active(sel(s(X), cons(Y, Z))) -> mark(sel(X, Z))
active(indx(nil, X)) -> mark(nil)
active(indx(cons(X, Y), Z)) -> mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) -> mark(cons(X, from(s(X))))
active(dbl1(0)) -> mark(01)
active(dbl1(s(X))) -> mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) -> mark(X)
active(sel1(s(X), cons(Y, Z))) -> mark(sel1(X, Z))
active(quote(0)) -> mark(01)
active(quote(s(X))) -> mark(s1(quote(X)))
active(quote(dbl(X))) -> mark(dbl1(X))
active(quote(sel(X, Y))) -> mark(sel1(X, Y))
active(dbl(X)) -> dbl(active(X))
active(dbls(X)) -> dbls(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(indx(X1, X2)) -> indx(active(X1), X2)
active(dbl1(X)) -> dbl1(active(X))
active(s1(X)) -> s1(active(X))
active(sel1(X1, X2)) -> sel1(active(X1), X2)
active(sel1(X1, X2)) -> sel1(X1, active(X2))
active(quote(X)) -> quote(active(X))
dbl(mark(X)) -> mark(dbl(X))
dbl(ok(X)) -> ok(dbl(X))
dbls(mark(X)) -> mark(dbls(X))
dbls(ok(X)) -> ok(dbls(X))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
indx(mark(X1), X2) -> mark(indx(X1, X2))
indx(ok(X1), ok(X2)) -> ok(indx(X1, X2))
dbl1(mark(X)) -> mark(dbl1(X))
dbl1(ok(X)) -> ok(dbl1(X))
s1(mark(X)) -> mark(s1(X))
s1(ok(X)) -> ok(s1(X))
sel1(mark(X1), X2) -> mark(sel1(X1, X2))
sel1(X1, mark(X2)) -> mark(sel1(X1, X2))
sel1(ok(X1), ok(X2)) -> ok(sel1(X1, X2))
quote(mark(X)) -> mark(quote(X))
quote(ok(X)) -> ok(quote(X))
proper(dbl(X)) -> dbl(proper(X))
proper(0) -> ok(0)
proper(s(X)) -> s(proper(X))
proper(dbls(X)) -> dbls(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(indx(X1, X2)) -> indx(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(dbl1(X)) -> dbl1(proper(X))
proper(01) -> ok(01)
proper(s1(X)) -> s1(proper(X))
proper(sel1(X1, X2)) -> sel1(proper(X1), proper(X2))
proper(quote(X)) -> quote(proper(X))
s(ok(X)) -> ok(s(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
from(ok(X)) -> ok(from(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))


Strategy:

innermost




The following dependency pair can be strictly oriented:

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


There are no usable rules for innermost w.r.t. to the implicit AFS that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:
  POL(from(x1))=  1 + x1  
  POL(dbls(x1))=  x1  
  POL(indx(x1, x2))=  x1 + x2  
  POL(PROPER(x1))=  x1  
  POL(cons(x1, x2))=  x1 + x2  
  POL(dbl(x1))=  x1  
  POL(sel(x1, x2))=  x1 + x2  
  POL(s(x1))=  x1  

resulting in one new DP problem. 



   R
     ↳DPs
       →DP Problem 1
         ↳Polo
       →DP Problem 2
         ↳Polo
       →DP Problem 3
         ↳Polo
       →DP Problem 4
         ↳Polo
       →DP Problem 5
         ↳Polo
       →DP Problem 6
         ↳Polo
       →DP Problem 7
         ↳Polo
       →DP Problem 8
         ↳Polo
       →DP Problem 9
         ↳Polo
       →DP Problem 10
         ↳Polo
       →DP Problem 11
         ↳Polo
       →DP Problem 12
         ↳Polo
       →DP Problem 13
         ↳Polo
           →DP Problem 44
             ↳Polo
             ...
               →DP Problem 48
                 ↳Polynomial Ordering
       →DP Problem 14
         ↳Remaining


Dependency Pairs:

PROPER(indx(X1, X2)) -> PROPER(X2)
PROPER(indx(X1, X2)) -> PROPER(X1)
PROPER(sel(X1, X2)) -> PROPER(X2)
PROPER(sel(X1, X2)) -> PROPER(X1)
PROPER(cons(X1, X2)) -> PROPER(X2)
PROPER(cons(X1, X2)) -> PROPER(X1)
PROPER(dbls(X)) -> PROPER(X)
PROPER(s(X)) -> PROPER(X)
PROPER(dbl(X)) -> PROPER(X)


Rules:


active(dbl(0)) -> mark(0)
active(dbl(s(X))) -> mark(s(s(dbl(X))))
active(dbls(nil)) -> mark(nil)
active(dbls(cons(X, Y))) -> mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) -> mark(X)
active(sel(s(X), cons(Y, Z))) -> mark(sel(X, Z))
active(indx(nil, X)) -> mark(nil)
active(indx(cons(X, Y), Z)) -> mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) -> mark(cons(X, from(s(X))))
active(dbl1(0)) -> mark(01)
active(dbl1(s(X))) -> mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) -> mark(X)
active(sel1(s(X), cons(Y, Z))) -> mark(sel1(X, Z))
active(quote(0)) -> mark(01)
active(quote(s(X))) -> mark(s1(quote(X)))
active(quote(dbl(X))) -> mark(dbl1(X))
active(quote(sel(X, Y))) -> mark(sel1(X, Y))
active(dbl(X)) -> dbl(active(X))
active(dbls(X)) -> dbls(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(indx(X1, X2)) -> indx(active(X1), X2)
active(dbl1(X)) -> dbl1(active(X))
active(s1(X)) -> s1(active(X))
active(sel1(X1, X2)) -> sel1(active(X1), X2)
active(sel1(X1, X2)) -> sel1(X1, active(X2))
active(quote(X)) -> quote(active(X))
dbl(mark(X)) -> mark(dbl(X))
dbl(ok(X)) -> ok(dbl(X))
dbls(mark(X)) -> mark(dbls(X))
dbls(ok(X)) -> ok(dbls(X))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
indx(mark(X1), X2) -> mark(indx(X1, X2))
indx(ok(X1), ok(X2)) -> ok(indx(X1, X2))
dbl1(mark(X)) -> mark(dbl1(X))
dbl1(ok(X)) -> ok(dbl1(X))
s1(mark(X)) -> mark(s1(X))
s1(ok(X)) -> ok(s1(X))
sel1(mark(X1), X2) -> mark(sel1(X1, X2))
sel1(X1, mark(X2)) -> mark(sel1(X1, X2))
sel1(ok(X1), ok(X2)) -> ok(sel1(X1, X2))
quote(mark(X)) -> mark(quote(X))
quote(ok(X)) -> ok(quote(X))
proper(dbl(X)) -> dbl(proper(X))
proper(0) -> ok(0)
proper(s(X)) -> s(proper(X))
proper(dbls(X)) -> dbls(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(indx(X1, X2)) -> indx(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(dbl1(X)) -> dbl1(proper(X))
proper(01) -> ok(01)
proper(s1(X)) -> s1(proper(X))
proper(sel1(X1, X2)) -> sel1(proper(X1), proper(X2))
proper(quote(X)) -> quote(proper(X))
s(ok(X)) -> ok(s(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
from(ok(X)) -> ok(from(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))


Strategy:

innermost




The following dependency pairs can be strictly oriented:

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


There are no usable rules for innermost w.r.t. to the implicit AFS that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:
  POL(dbls(x1))=  x1  
  POL(indx(x1, x2))=  1 + x1 + x2  
  POL(PROPER(x1))=  x1  
  POL(cons(x1, x2))=  x1 + x2  
  POL(dbl(x1))=  x1  
  POL(sel(x1, x2))=  x1 + x2  
  POL(s(x1))=  x1  

resulting in one new DP problem. 



   R
     ↳DPs
       →DP Problem 1
         ↳Polo
       →DP Problem 2
         ↳Polo
       →DP Problem 3
         ↳Polo
       →DP Problem 4
         ↳Polo
       →DP Problem 5
         ↳Polo
       →DP Problem 6
         ↳Polo
       →DP Problem 7
         ↳Polo
       →DP Problem 8
         ↳Polo
       →DP Problem 9
         ↳Polo
       →DP Problem 10
         ↳Polo
       →DP Problem 11
         ↳Polo
       →DP Problem 12
         ↳Polo
       →DP Problem 13
         ↳Polo
           →DP Problem 44
             ↳Polo
             ...
               →DP Problem 49
                 ↳Polynomial Ordering
       →DP Problem 14
         ↳Remaining


Dependency Pairs:

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


Rules:


active(dbl(0)) -> mark(0)
active(dbl(s(X))) -> mark(s(s(dbl(X))))
active(dbls(nil)) -> mark(nil)
active(dbls(cons(X, Y))) -> mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) -> mark(X)
active(sel(s(X), cons(Y, Z))) -> mark(sel(X, Z))
active(indx(nil, X)) -> mark(nil)
active(indx(cons(X, Y), Z)) -> mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) -> mark(cons(X, from(s(X))))
active(dbl1(0)) -> mark(01)
active(dbl1(s(X))) -> mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) -> mark(X)
active(sel1(s(X), cons(Y, Z))) -> mark(sel1(X, Z))
active(quote(0)) -> mark(01)
active(quote(s(X))) -> mark(s1(quote(X)))
active(quote(dbl(X))) -> mark(dbl1(X))
active(quote(sel(X, Y))) -> mark(sel1(X, Y))
active(dbl(X)) -> dbl(active(X))
active(dbls(X)) -> dbls(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(indx(X1, X2)) -> indx(active(X1), X2)
active(dbl1(X)) -> dbl1(active(X))
active(s1(X)) -> s1(active(X))
active(sel1(X1, X2)) -> sel1(active(X1), X2)
active(sel1(X1, X2)) -> sel1(X1, active(X2))
active(quote(X)) -> quote(active(X))
dbl(mark(X)) -> mark(dbl(X))
dbl(ok(X)) -> ok(dbl(X))
dbls(mark(X)) -> mark(dbls(X))
dbls(ok(X)) -> ok(dbls(X))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
indx(mark(X1), X2) -> mark(indx(X1, X2))
indx(ok(X1), ok(X2)) -> ok(indx(X1, X2))
dbl1(mark(X)) -> mark(dbl1(X))
dbl1(ok(X)) -> ok(dbl1(X))
s1(mark(X)) -> mark(s1(X))
s1(ok(X)) -> ok(s1(X))
sel1(mark(X1), X2) -> mark(sel1(X1, X2))
sel1(X1, mark(X2)) -> mark(sel1(X1, X2))
sel1(ok(X1), ok(X2)) -> ok(sel1(X1, X2))
quote(mark(X)) -> mark(quote(X))
quote(ok(X)) -> ok(quote(X))
proper(dbl(X)) -> dbl(proper(X))
proper(0) -> ok(0)
proper(s(X)) -> s(proper(X))
proper(dbls(X)) -> dbls(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(indx(X1, X2)) -> indx(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(dbl1(X)) -> dbl1(proper(X))
proper(01) -> ok(01)
proper(s1(X)) -> s1(proper(X))
proper(sel1(X1, X2)) -> sel1(proper(X1), proper(X2))
proper(quote(X)) -> quote(proper(X))
s(ok(X)) -> ok(s(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
from(ok(X)) -> ok(from(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))


Strategy:

innermost




The following dependency pairs can be strictly oriented:

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


There are no usable rules for innermost w.r.t. to the implicit AFS that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:
  POL(dbls(x1))=  x1  
  POL(PROPER(x1))=  x1  
  POL(cons(x1, x2))=  x1 + x2  
  POL(dbl(x1))=  x1  
  POL(sel(x1, x2))=  1 + x1 + x2  
  POL(s(x1))=  x1  

resulting in one new DP problem. 



   R
     ↳DPs
       →DP Problem 1
         ↳Polo
       →DP Problem 2
         ↳Polo
       →DP Problem 3
         ↳Polo
       →DP Problem 4
         ↳Polo
       →DP Problem 5
         ↳Polo
       →DP Problem 6
         ↳Polo
       →DP Problem 7
         ↳Polo
       →DP Problem 8
         ↳Polo
       →DP Problem 9
         ↳Polo
       →DP Problem 10
         ↳Polo
       →DP Problem 11
         ↳Polo
       →DP Problem 12
         ↳Polo
       →DP Problem 13
         ↳Polo
           →DP Problem 44
             ↳Polo
             ...
               →DP Problem 50
                 ↳Polynomial Ordering
       →DP Problem 14
         ↳Remaining


Dependency Pairs:

PROPER(cons(X1, X2)) -> PROPER(X2)
PROPER(cons(X1, X2)) -> PROPER(X1)
PROPER(dbls(X)) -> PROPER(X)
PROPER(s(X)) -> PROPER(X)
PROPER(dbl(X)) -> PROPER(X)


Rules:


active(dbl(0)) -> mark(0)
active(dbl(s(X))) -> mark(s(s(dbl(X))))
active(dbls(nil)) -> mark(nil)
active(dbls(cons(X, Y))) -> mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) -> mark(X)
active(sel(s(X), cons(Y, Z))) -> mark(sel(X, Z))
active(indx(nil, X)) -> mark(nil)
active(indx(cons(X, Y), Z)) -> mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) -> mark(cons(X, from(s(X))))
active(dbl1(0)) -> mark(01)
active(dbl1(s(X))) -> mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) -> mark(X)
active(sel1(s(X), cons(Y, Z))) -> mark(sel1(X, Z))
active(quote(0)) -> mark(01)
active(quote(s(X))) -> mark(s1(quote(X)))
active(quote(dbl(X))) -> mark(dbl1(X))
active(quote(sel(X, Y))) -> mark(sel1(X, Y))
active(dbl(X)) -> dbl(active(X))
active(dbls(X)) -> dbls(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(indx(X1, X2)) -> indx(active(X1), X2)
active(dbl1(X)) -> dbl1(active(X))
active(s1(X)) -> s1(active(X))
active(sel1(X1, X2)) -> sel1(active(X1), X2)
active(sel1(X1, X2)) -> sel1(X1, active(X2))
active(quote(X)) -> quote(active(X))
dbl(mark(X)) -> mark(dbl(X))
dbl(ok(X)) -> ok(dbl(X))
dbls(mark(X)) -> mark(dbls(X))
dbls(ok(X)) -> ok(dbls(X))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
indx(mark(X1), X2) -> mark(indx(X1, X2))
indx(ok(X1), ok(X2)) -> ok(indx(X1, X2))
dbl1(mark(X)) -> mark(dbl1(X))
dbl1(ok(X)) -> ok(dbl1(X))
s1(mark(X)) -> mark(s1(X))
s1(ok(X)) -> ok(s1(X))
sel1(mark(X1), X2) -> mark(sel1(X1, X2))
sel1(X1, mark(X2)) -> mark(sel1(X1, X2))
sel1(ok(X1), ok(X2)) -> ok(sel1(X1, X2))
quote(mark(X)) -> mark(quote(X))
quote(ok(X)) -> ok(quote(X))
proper(dbl(X)) -> dbl(proper(X))
proper(0) -> ok(0)
proper(s(X)) -> s(proper(X))
proper(dbls(X)) -> dbls(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(indx(X1, X2)) -> indx(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(dbl1(X)) -> dbl1(proper(X))
proper(01) -> ok(01)
proper(s1(X)) -> s1(proper(X))
proper(sel1(X1, X2)) -> sel1(proper(X1), proper(X2))
proper(quote(X)) -> quote(proper(X))
s(ok(X)) -> ok(s(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
from(ok(X)) -> ok(from(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))


Strategy:

innermost




The following dependency pairs can be strictly oriented:

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


There are no usable rules for innermost w.r.t. to the implicit AFS that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:
  POL(dbls(x1))=  x1  
  POL(PROPER(x1))=  x1  
  POL(cons(x1, x2))=  1 + x1 + x2  
  POL(dbl(x1))=  x1  
  POL(s(x1))=  x1  

resulting in one new DP problem. 



   R
     ↳DPs
       →DP Problem 1
         ↳Polo
       →DP Problem 2
         ↳Polo
       →DP Problem 3
         ↳Polo
       →DP Problem 4
         ↳Polo
       →DP Problem 5
         ↳Polo
       →DP Problem 6
         ↳Polo
       →DP Problem 7
         ↳Polo
       →DP Problem 8
         ↳Polo
       →DP Problem 9
         ↳Polo
       →DP Problem 10
         ↳Polo
       →DP Problem 11
         ↳Polo
       →DP Problem 12
         ↳Polo
       →DP Problem 13
         ↳Polo
           →DP Problem 44
             ↳Polo
             ...
               →DP Problem 51
                 ↳Polynomial Ordering
       →DP Problem 14
         ↳Remaining


Dependency Pairs:

PROPER(dbls(X)) -> PROPER(X)
PROPER(s(X)) -> PROPER(X)
PROPER(dbl(X)) -> PROPER(X)


Rules:


active(dbl(0)) -> mark(0)
active(dbl(s(X))) -> mark(s(s(dbl(X))))
active(dbls(nil)) -> mark(nil)
active(dbls(cons(X, Y))) -> mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) -> mark(X)
active(sel(s(X), cons(Y, Z))) -> mark(sel(X, Z))
active(indx(nil, X)) -> mark(nil)
active(indx(cons(X, Y), Z)) -> mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) -> mark(cons(X, from(s(X))))
active(dbl1(0)) -> mark(01)
active(dbl1(s(X))) -> mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) -> mark(X)
active(sel1(s(X), cons(Y, Z))) -> mark(sel1(X, Z))
active(quote(0)) -> mark(01)
active(quote(s(X))) -> mark(s1(quote(X)))
active(quote(dbl(X))) -> mark(dbl1(X))
active(quote(sel(X, Y))) -> mark(sel1(X, Y))
active(dbl(X)) -> dbl(active(X))
active(dbls(X)) -> dbls(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(indx(X1, X2)) -> indx(active(X1), X2)
active(dbl1(X)) -> dbl1(active(X))
active(s1(X)) -> s1(active(X))
active(sel1(X1, X2)) -> sel1(active(X1), X2)
active(sel1(X1, X2)) -> sel1(X1, active(X2))
active(quote(X)) -> quote(active(X))
dbl(mark(X)) -> mark(dbl(X))
dbl(ok(X)) -> ok(dbl(X))
dbls(mark(X)) -> mark(dbls(X))
dbls(ok(X)) -> ok(dbls(X))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
indx(mark(X1), X2) -> mark(indx(X1, X2))
indx(ok(X1), ok(X2)) -> ok(indx(X1, X2))
dbl1(mark(X)) -> mark(dbl1(X))
dbl1(ok(X)) -> ok(dbl1(X))
s1(mark(X)) -> mark(s1(X))
s1(ok(X)) -> ok(s1(X))
sel1(mark(X1), X2) -> mark(sel1(X1, X2))
sel1(X1, mark(X2)) -> mark(sel1(X1, X2))
sel1(ok(X1), ok(X2)) -> ok(sel1(X1, X2))
quote(mark(X)) -> mark(quote(X))
quote(ok(X)) -> ok(quote(X))
proper(dbl(X)) -> dbl(proper(X))
proper(0) -> ok(0)
proper(s(X)) -> s(proper(X))
proper(dbls(X)) -> dbls(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(indx(X1, X2)) -> indx(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(dbl1(X)) -> dbl1(proper(X))
proper(01) -> ok(01)
proper(s1(X)) -> s1(proper(X))
proper(sel1(X1, X2)) -> sel1(proper(X1), proper(X2))
proper(quote(X)) -> quote(proper(X))
s(ok(X)) -> ok(s(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
from(ok(X)) -> ok(from(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))


Strategy:

innermost




The following dependency pair can be strictly oriented:

PROPER(dbls(X)) -> PROPER(X)


There are no usable rules for innermost w.r.t. to the implicit AFS that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:
  POL(dbls(x1))=  1 + x1  
  POL(PROPER(x1))=  x1  
  POL(dbl(x1))=  x1  
  POL(s(x1))=  x1  

resulting in one new DP problem. 



   R
     ↳DPs
       →DP Problem 1
         ↳Polo
       →DP Problem 2
         ↳Polo
       →DP Problem 3
         ↳Polo
       →DP Problem 4
         ↳Polo
       →DP Problem 5
         ↳Polo
       →DP Problem 6
         ↳Polo
       →DP Problem 7
         ↳Polo
       →DP Problem 8
         ↳Polo
       →DP Problem 9
         ↳Polo
       →DP Problem 10
         ↳Polo
       →DP Problem 11
         ↳Polo
       →DP Problem 12
         ↳Polo
       →DP Problem 13
         ↳Polo
           →DP Problem 44
             ↳Polo
             ...
               →DP Problem 52
                 ↳Polynomial Ordering
       →DP Problem 14
         ↳Remaining


Dependency Pairs:

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


Rules:


active(dbl(0)) -> mark(0)
active(dbl(s(X))) -> mark(s(s(dbl(X))))
active(dbls(nil)) -> mark(nil)
active(dbls(cons(X, Y))) -> mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) -> mark(X)
active(sel(s(X), cons(Y, Z))) -> mark(sel(X, Z))
active(indx(nil, X)) -> mark(nil)
active(indx(cons(X, Y), Z)) -> mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) -> mark(cons(X, from(s(X))))
active(dbl1(0)) -> mark(01)
active(dbl1(s(X))) -> mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) -> mark(X)
active(sel1(s(X), cons(Y, Z))) -> mark(sel1(X, Z))
active(quote(0)) -> mark(01)
active(quote(s(X))) -> mark(s1(quote(X)))
active(quote(dbl(X))) -> mark(dbl1(X))
active(quote(sel(X, Y))) -> mark(sel1(X, Y))
active(dbl(X)) -> dbl(active(X))
active(dbls(X)) -> dbls(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(indx(X1, X2)) -> indx(active(X1), X2)
active(dbl1(X)) -> dbl1(active(X))
active(s1(X)) -> s1(active(X))
active(sel1(X1, X2)) -> sel1(active(X1), X2)
active(sel1(X1, X2)) -> sel1(X1, active(X2))
active(quote(X)) -> quote(active(X))
dbl(mark(X)) -> mark(dbl(X))
dbl(ok(X)) -> ok(dbl(X))
dbls(mark(X)) -> mark(dbls(X))
dbls(ok(X)) -> ok(dbls(X))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
indx(mark(X1), X2) -> mark(indx(X1, X2))
indx(ok(X1), ok(X2)) -> ok(indx(X1, X2))
dbl1(mark(X)) -> mark(dbl1(X))
dbl1(ok(X)) -> ok(dbl1(X))
s1(mark(X)) -> mark(s1(X))
s1(ok(X)) -> ok(s1(X))
sel1(mark(X1), X2) -> mark(sel1(X1, X2))
sel1(X1, mark(X2)) -> mark(sel1(X1, X2))
sel1(ok(X1), ok(X2)) -> ok(sel1(X1, X2))
quote(mark(X)) -> mark(quote(X))
quote(ok(X)) -> ok(quote(X))
proper(dbl(X)) -> dbl(proper(X))
proper(0) -> ok(0)
proper(s(X)) -> s(proper(X))
proper(dbls(X)) -> dbls(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(indx(X1, X2)) -> indx(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(dbl1(X)) -> dbl1(proper(X))
proper(01) -> ok(01)
proper(s1(X)) -> s1(proper(X))
proper(sel1(X1, X2)) -> sel1(proper(X1), proper(X2))
proper(quote(X)) -> quote(proper(X))
s(ok(X)) -> ok(s(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
from(ok(X)) -> ok(from(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))


Strategy:

innermost




The following dependency pair can be strictly oriented:

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


There are no usable rules for innermost w.r.t. to the implicit AFS that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:
  POL(PROPER(x1))=  x1  
  POL(dbl(x1))=  x1  
  POL(s(x1))=  1 + x1  

resulting in one new DP problem. 



   R
     ↳DPs
       →DP Problem 1
         ↳Polo
       →DP Problem 2
         ↳Polo
       →DP Problem 3
         ↳Polo
       →DP Problem 4
         ↳Polo
       →DP Problem 5
         ↳Polo
       →DP Problem 6
         ↳Polo
       →DP Problem 7
         ↳Polo
       →DP Problem 8
         ↳Polo
       →DP Problem 9
         ↳Polo
       →DP Problem 10
         ↳Polo
       →DP Problem 11
         ↳Polo
       →DP Problem 12
         ↳Polo
       →DP Problem 13
         ↳Polo
           →DP Problem 44
             ↳Polo
             ...
               →DP Problem 53
                 ↳Polynomial Ordering
       →DP Problem 14
         ↳Remaining


Dependency Pair:

PROPER(dbl(X)) -> PROPER(X)


Rules:


active(dbl(0)) -> mark(0)
active(dbl(s(X))) -> mark(s(s(dbl(X))))
active(dbls(nil)) -> mark(nil)
active(dbls(cons(X, Y))) -> mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) -> mark(X)
active(sel(s(X), cons(Y, Z))) -> mark(sel(X, Z))
active(indx(nil, X)) -> mark(nil)
active(indx(cons(X, Y), Z)) -> mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) -> mark(cons(X, from(s(X))))
active(dbl1(0)) -> mark(01)
active(dbl1(s(X))) -> mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) -> mark(X)
active(sel1(s(X), cons(Y, Z))) -> mark(sel1(X, Z))
active(quote(0)) -> mark(01)
active(quote(s(X))) -> mark(s1(quote(X)))
active(quote(dbl(X))) -> mark(dbl1(X))
active(quote(sel(X, Y))) -> mark(sel1(X, Y))
active(dbl(X)) -> dbl(active(X))
active(dbls(X)) -> dbls(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(indx(X1, X2)) -> indx(active(X1), X2)
active(dbl1(X)) -> dbl1(active(X))
active(s1(X)) -> s1(active(X))
active(sel1(X1, X2)) -> sel1(active(X1), X2)
active(sel1(X1, X2)) -> sel1(X1, active(X2))
active(quote(X)) -> quote(active(X))
dbl(mark(X)) -> mark(dbl(X))
dbl(ok(X)) -> ok(dbl(X))
dbls(mark(X)) -> mark(dbls(X))
dbls(ok(X)) -> ok(dbls(X))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
indx(mark(X1), X2) -> mark(indx(X1, X2))
indx(ok(X1), ok(X2)) -> ok(indx(X1, X2))
dbl1(mark(X)) -> mark(dbl1(X))
dbl1(ok(X)) -> ok(dbl1(X))
s1(mark(X)) -> mark(s1(X))
s1(ok(X)) -> ok(s1(X))
sel1(mark(X1), X2) -> mark(sel1(X1, X2))
sel1(X1, mark(X2)) -> mark(sel1(X1, X2))
sel1(ok(X1), ok(X2)) -> ok(sel1(X1, X2))
quote(mark(X)) -> mark(quote(X))
quote(ok(X)) -> ok(quote(X))
proper(dbl(X)) -> dbl(proper(X))
proper(0) -> ok(0)
proper(s(X)) -> s(proper(X))
proper(dbls(X)) -> dbls(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(indx(X1, X2)) -> indx(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(dbl1(X)) -> dbl1(proper(X))
proper(01) -> ok(01)
proper(s1(X)) -> s1(proper(X))
proper(sel1(X1, X2)) -> sel1(proper(X1), proper(X2))
proper(quote(X)) -> quote(proper(X))
s(ok(X)) -> ok(s(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
from(ok(X)) -> ok(from(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))


Strategy:

innermost




The following dependency pair can be strictly oriented:

PROPER(dbl(X)) -> PROPER(X)


There are no usable rules for innermost w.r.t. to the implicit AFS that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:
  POL(PROPER(x1))=  x1  
  POL(dbl(x1))=  1 + x1  

resulting in one new DP problem. 



   R
     ↳DPs
       →DP Problem 1
         ↳Polo
       →DP Problem 2
         ↳Polo
       →DP Problem 3
         ↳Polo
       →DP Problem 4
         ↳Polo
       →DP Problem 5
         ↳Polo
       →DP Problem 6
         ↳Polo
       →DP Problem 7
         ↳Polo
       →DP Problem 8
         ↳Polo
       →DP Problem 9
         ↳Polo
       →DP Problem 10
         ↳Polo
       →DP Problem 11
         ↳Polo
       →DP Problem 12
         ↳Polo
       →DP Problem 13
         ↳Polo
           →DP Problem 44
             ↳Polo
             ...
               →DP Problem 54
                 ↳Dependency Graph
       →DP Problem 14
         ↳Remaining


Dependency Pair:


Rules:


active(dbl(0)) -> mark(0)
active(dbl(s(X))) -> mark(s(s(dbl(X))))
active(dbls(nil)) -> mark(nil)
active(dbls(cons(X, Y))) -> mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) -> mark(X)
active(sel(s(X), cons(Y, Z))) -> mark(sel(X, Z))
active(indx(nil, X)) -> mark(nil)
active(indx(cons(X, Y), Z)) -> mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) -> mark(cons(X, from(s(X))))
active(dbl1(0)) -> mark(01)
active(dbl1(s(X))) -> mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) -> mark(X)
active(sel1(s(X), cons(Y, Z))) -> mark(sel1(X, Z))
active(quote(0)) -> mark(01)
active(quote(s(X))) -> mark(s1(quote(X)))
active(quote(dbl(X))) -> mark(dbl1(X))
active(quote(sel(X, Y))) -> mark(sel1(X, Y))
active(dbl(X)) -> dbl(active(X))
active(dbls(X)) -> dbls(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(indx(X1, X2)) -> indx(active(X1), X2)
active(dbl1(X)) -> dbl1(active(X))
active(s1(X)) -> s1(active(X))
active(sel1(X1, X2)) -> sel1(active(X1), X2)
active(sel1(X1, X2)) -> sel1(X1, active(X2))
active(quote(X)) -> quote(active(X))
dbl(mark(X)) -> mark(dbl(X))
dbl(ok(X)) -> ok(dbl(X))
dbls(mark(X)) -> mark(dbls(X))
dbls(ok(X)) -> ok(dbls(X))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
indx(mark(X1), X2) -> mark(indx(X1, X2))
indx(ok(X1), ok(X2)) -> ok(indx(X1, X2))
dbl1(mark(X)) -> mark(dbl1(X))
dbl1(ok(X)) -> ok(dbl1(X))
s1(mark(X)) -> mark(s1(X))
s1(ok(X)) -> ok(s1(X))
sel1(mark(X1), X2) -> mark(sel1(X1, X2))
sel1(X1, mark(X2)) -> mark(sel1(X1, X2))
sel1(ok(X1), ok(X2)) -> ok(sel1(X1, X2))
quote(mark(X)) -> mark(quote(X))
quote(ok(X)) -> ok(quote(X))
proper(dbl(X)) -> dbl(proper(X))
proper(0) -> ok(0)
proper(s(X)) -> s(proper(X))
proper(dbls(X)) -> dbls(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(indx(X1, X2)) -> indx(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(dbl1(X)) -> dbl1(proper(X))
proper(01) -> ok(01)
proper(s1(X)) -> s1(proper(X))
proper(sel1(X1, X2)) -> sel1(proper(X1), proper(X2))
proper(quote(X)) -> quote(proper(X))
s(ok(X)) -> ok(s(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
from(ok(X)) -> ok(from(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
         ↳Polo
       →DP Problem 2
         ↳Polo
       →DP Problem 3
         ↳Polo
       →DP Problem 4
         ↳Polo
       →DP Problem 5
         ↳Polo
       →DP Problem 6
         ↳Polo
       →DP Problem 7
         ↳Polo
       →DP Problem 8
         ↳Polo
       →DP Problem 9
         ↳Polo
       →DP Problem 10
         ↳Polo
       →DP Problem 11
         ↳Polo
       →DP Problem 12
         ↳Polo
       →DP Problem 13
         ↳Polo
       →DP Problem 14
         ↳Remaining Obligation(s)




The following remains to be proven:
Dependency Pairs:

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


Rules:


active(dbl(0)) -> mark(0)
active(dbl(s(X))) -> mark(s(s(dbl(X))))
active(dbls(nil)) -> mark(nil)
active(dbls(cons(X, Y))) -> mark(cons(dbl(X), dbls(Y)))
active(sel(0, cons(X, Y))) -> mark(X)
active(sel(s(X), cons(Y, Z))) -> mark(sel(X, Z))
active(indx(nil, X)) -> mark(nil)
active(indx(cons(X, Y), Z)) -> mark(cons(sel(X, Z), indx(Y, Z)))
active(from(X)) -> mark(cons(X, from(s(X))))
active(dbl1(0)) -> mark(01)
active(dbl1(s(X))) -> mark(s1(s1(dbl1(X))))
active(sel1(0, cons(X, Y))) -> mark(X)
active(sel1(s(X), cons(Y, Z))) -> mark(sel1(X, Z))
active(quote(0)) -> mark(01)
active(quote(s(X))) -> mark(s1(quote(X)))
active(quote(dbl(X))) -> mark(dbl1(X))
active(quote(sel(X, Y))) -> mark(sel1(X, Y))
active(dbl(X)) -> dbl(active(X))
active(dbls(X)) -> dbls(active(X))
active(sel(X1, X2)) -> sel(active(X1), X2)
active(sel(X1, X2)) -> sel(X1, active(X2))
active(indx(X1, X2)) -> indx(active(X1), X2)
active(dbl1(X)) -> dbl1(active(X))
active(s1(X)) -> s1(active(X))
active(sel1(X1, X2)) -> sel1(active(X1), X2)
active(sel1(X1, X2)) -> sel1(X1, active(X2))
active(quote(X)) -> quote(active(X))
dbl(mark(X)) -> mark(dbl(X))
dbl(ok(X)) -> ok(dbl(X))
dbls(mark(X)) -> mark(dbls(X))
dbls(ok(X)) -> ok(dbls(X))
sel(mark(X1), X2) -> mark(sel(X1, X2))
sel(X1, mark(X2)) -> mark(sel(X1, X2))
sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
indx(mark(X1), X2) -> mark(indx(X1, X2))
indx(ok(X1), ok(X2)) -> ok(indx(X1, X2))
dbl1(mark(X)) -> mark(dbl1(X))
dbl1(ok(X)) -> ok(dbl1(X))
s1(mark(X)) -> mark(s1(X))
s1(ok(X)) -> ok(s1(X))
sel1(mark(X1), X2) -> mark(sel1(X1, X2))
sel1(X1, mark(X2)) -> mark(sel1(X1, X2))
sel1(ok(X1), ok(X2)) -> ok(sel1(X1, X2))
quote(mark(X)) -> mark(quote(X))
quote(ok(X)) -> ok(quote(X))
proper(dbl(X)) -> dbl(proper(X))
proper(0) -> ok(0)
proper(s(X)) -> s(proper(X))
proper(dbls(X)) -> dbls(proper(X))
proper(nil) -> ok(nil)
proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
proper(indx(X1, X2)) -> indx(proper(X1), proper(X2))
proper(from(X)) -> from(proper(X))
proper(dbl1(X)) -> dbl1(proper(X))
proper(01) -> ok(01)
proper(s1(X)) -> s1(proper(X))
proper(sel1(X1, X2)) -> sel1(proper(X1), proper(X2))
proper(quote(X)) -> quote(proper(X))
s(ok(X)) -> ok(s(X))
cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
from(ok(X)) -> ok(from(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))


Strategy:

innermost



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