The rewrite relation of the following TRS is considered.
active(terms(N)) | → | mark(cons(recip(sqr(N)),terms(s(N)))) | (1) |
active(sqr(0)) | → | mark(0) | (2) |
active(sqr(s(X))) | → | mark(s(add(sqr(X),dbl(X)))) | (3) |
active(dbl(0)) | → | mark(0) | (4) |
active(dbl(s(X))) | → | mark(s(s(dbl(X)))) | (5) |
active(add(0,X)) | → | mark(X) | (6) |
active(add(s(X),Y)) | → | mark(s(add(X,Y))) | (7) |
active(first(0,X)) | → | mark(nil) | (8) |
active(first(s(X),cons(Y,Z))) | → | mark(cons(Y,first(X,Z))) | (9) |
mark(terms(X)) | → | active(terms(mark(X))) | (10) |
mark(cons(X1,X2)) | → | active(cons(mark(X1),X2)) | (11) |
mark(recip(X)) | → | active(recip(mark(X))) | (12) |
mark(sqr(X)) | → | active(sqr(mark(X))) | (13) |
mark(s(X)) | → | active(s(X)) | (14) |
mark(0) | → | active(0) | (15) |
mark(add(X1,X2)) | → | active(add(mark(X1),mark(X2))) | (16) |
mark(dbl(X)) | → | active(dbl(mark(X))) | (17) |
mark(first(X1,X2)) | → | active(first(mark(X1),mark(X2))) | (18) |
mark(nil) | → | active(nil) | (19) |
terms(mark(X)) | → | terms(X) | (20) |
terms(active(X)) | → | terms(X) | (21) |
cons(mark(X1),X2) | → | cons(X1,X2) | (22) |
cons(X1,mark(X2)) | → | cons(X1,X2) | (23) |
cons(active(X1),X2) | → | cons(X1,X2) | (24) |
cons(X1,active(X2)) | → | cons(X1,X2) | (25) |
recip(mark(X)) | → | recip(X) | (26) |
recip(active(X)) | → | recip(X) | (27) |
sqr(mark(X)) | → | sqr(X) | (28) |
sqr(active(X)) | → | sqr(X) | (29) |
s(mark(X)) | → | s(X) | (30) |
s(active(X)) | → | s(X) | (31) |
add(mark(X1),X2) | → | add(X1,X2) | (32) |
add(X1,mark(X2)) | → | add(X1,X2) | (33) |
add(active(X1),X2) | → | add(X1,X2) | (34) |
add(X1,active(X2)) | → | add(X1,X2) | (35) |
dbl(mark(X)) | → | dbl(X) | (36) |
dbl(active(X)) | → | dbl(X) | (37) |
first(mark(X1),X2) | → | first(X1,X2) | (38) |
first(X1,mark(X2)) | → | first(X1,X2) | (39) |
first(active(X1),X2) | → | first(X1,X2) | (40) |
first(X1,active(X2)) | → | first(X1,X2) | (41) |
sqr#(active(X)) | → | sqr#(X) | (42) |
recip#(active(X)) | → | recip#(X) | (43) |
active#(add(s(X),Y)) | → | s#(add(X,Y)) | (44) |
add#(X1,mark(X2)) | → | add#(X1,X2) | (45) |
active#(terms(N)) | → | s#(N) | (46) |
mark#(dbl(X)) | → | mark#(X) | (47) |
add#(active(X1),X2) | → | add#(X1,X2) | (48) |
cons#(mark(X1),X2) | → | cons#(X1,X2) | (49) |
active#(dbl(s(X))) | → | s#(s(dbl(X))) | (50) |
mark#(first(X1,X2)) | → | mark#(X2) | (51) |
add#(mark(X1),X2) | → | add#(X1,X2) | (52) |
mark#(add(X1,X2)) | → | add#(mark(X1),mark(X2)) | (53) |
mark#(first(X1,X2)) | → | first#(mark(X1),mark(X2)) | (54) |
mark#(nil) | → | active#(nil) | (55) |
active#(sqr(s(X))) | → | add#(sqr(X),dbl(X)) | (56) |
active#(terms(N)) | → | mark#(cons(recip(sqr(N)),terms(s(N)))) | (57) |
active#(dbl(s(X))) | → | s#(dbl(X)) | (58) |
first#(mark(X1),X2) | → | first#(X1,X2) | (59) |
active#(sqr(s(X))) | → | sqr#(X) | (60) |
mark#(add(X1,X2)) | → | mark#(X2) | (61) |
active#(first(0,X)) | → | mark#(nil) | (62) |
sqr#(mark(X)) | → | sqr#(X) | (63) |
terms#(active(X)) | → | terms#(X) | (64) |
active#(first(s(X),cons(Y,Z))) | → | cons#(Y,first(X,Z)) | (65) |
mark#(sqr(X)) | → | active#(sqr(mark(X))) | (66) |
mark#(sqr(X)) | → | mark#(X) | (67) |
active#(sqr(s(X))) | → | s#(add(sqr(X),dbl(X))) | (68) |
mark#(s(X)) | → | active#(s(X)) | (69) |
mark#(first(X1,X2)) | → | active#(first(mark(X1),mark(X2))) | (70) |
s#(active(X)) | → | s#(X) | (71) |
mark#(dbl(X)) | → | dbl#(mark(X)) | (72) |
active#(dbl(0)) | → | mark#(0) | (73) |
active#(first(s(X),cons(Y,Z))) | → | mark#(cons(Y,first(X,Z))) | (74) |
first#(X1,mark(X2)) | → | first#(X1,X2) | (75) |
active#(sqr(s(X))) | → | mark#(s(add(sqr(X),dbl(X)))) | (76) |
active#(first(s(X),cons(Y,Z))) | → | first#(X,Z) | (77) |
active#(terms(N)) | → | cons#(recip(sqr(N)),terms(s(N))) | (78) |
active#(add(s(X),Y)) | → | add#(X,Y) | (79) |
mark#(add(X1,X2)) | → | active#(add(mark(X1),mark(X2))) | (80) |
recip#(mark(X)) | → | recip#(X) | (81) |
s#(mark(X)) | → | s#(X) | (82) |
mark#(recip(X)) | → | active#(recip(mark(X))) | (83) |
active#(add(0,X)) | → | mark#(X) | (84) |
active#(dbl(s(X))) | → | dbl#(X) | (85) |
mark#(sqr(X)) | → | sqr#(mark(X)) | (86) |
active#(terms(N)) | → | sqr#(N) | (87) |
mark#(terms(X)) | → | terms#(mark(X)) | (88) |
mark#(first(X1,X2)) | → | mark#(X1) | (89) |
dbl#(active(X)) | → | dbl#(X) | (90) |
mark#(dbl(X)) | → | active#(dbl(mark(X))) | (91) |
active#(terms(N)) | → | terms#(s(N)) | (92) |
active#(add(s(X),Y)) | → | mark#(s(add(X,Y))) | (93) |
mark#(recip(X)) | → | mark#(X) | (94) |
mark#(terms(X)) | → | mark#(X) | (95) |
terms#(mark(X)) | → | terms#(X) | (96) |
active#(sqr(s(X))) | → | dbl#(X) | (97) |
mark#(cons(X1,X2)) | → | mark#(X1) | (98) |
mark#(terms(X)) | → | active#(terms(mark(X))) | (99) |
cons#(X1,mark(X2)) | → | cons#(X1,X2) | (100) |
active#(terms(N)) | → | recip#(sqr(N)) | (101) |
cons#(X1,active(X2)) | → | cons#(X1,X2) | (102) |
mark#(0) | → | active#(0) | (103) |
active#(dbl(s(X))) | → | mark#(s(s(dbl(X)))) | (104) |
mark#(recip(X)) | → | recip#(mark(X)) | (105) |
mark#(cons(X1,X2)) | → | cons#(mark(X1),X2) | (106) |
add#(X1,active(X2)) | → | add#(X1,X2) | (107) |
active#(sqr(0)) | → | mark#(0) | (108) |
mark#(add(X1,X2)) | → | mark#(X1) | (109) |
first#(active(X1),X2) | → | first#(X1,X2) | (110) |
mark#(cons(X1,X2)) | → | active#(cons(mark(X1),X2)) | (111) |
first#(X1,active(X2)) | → | first#(X1,X2) | (112) |
dbl#(mark(X)) | → | dbl#(X) | (113) |
cons#(active(X1),X2) | → | cons#(X1,X2) | (114) |
The dependency pairs are split into 9 components.
mark#(add(X1,X2)) | → | active#(add(mark(X1),mark(X2))) | (80) |
mark#(cons(X1,X2)) | → | active#(cons(mark(X1),X2)) | (111) |
active#(sqr(s(X))) | → | mark#(s(add(sqr(X),dbl(X)))) | (76) |
active#(first(s(X),cons(Y,Z))) | → | mark#(cons(Y,first(X,Z))) | (74) |
mark#(add(X1,X2)) | → | mark#(X1) | (109) |
mark#(first(X1,X2)) | → | active#(first(mark(X1),mark(X2))) | (70) |
mark#(s(X)) | → | active#(s(X)) | (69) |
active#(dbl(s(X))) | → | mark#(s(s(dbl(X)))) | (104) |
mark#(sqr(X)) | → | mark#(X) | (67) |
mark#(sqr(X)) | → | active#(sqr(mark(X))) | (66) |
mark#(terms(X)) | → | active#(terms(mark(X))) | (99) |
mark#(cons(X1,X2)) | → | mark#(X1) | (98) |
mark#(add(X1,X2)) | → | mark#(X2) | (61) |
active#(terms(N)) | → | mark#(cons(recip(sqr(N)),terms(s(N)))) | (57) |
mark#(terms(X)) | → | mark#(X) | (95) |
mark#(recip(X)) | → | mark#(X) | (94) |
active#(add(s(X),Y)) | → | mark#(s(add(X,Y))) | (93) |
mark#(first(X1,X2)) | → | mark#(X2) | (51) |
mark#(dbl(X)) | → | active#(dbl(mark(X))) | (91) |
mark#(first(X1,X2)) | → | mark#(X1) | (89) |
mark#(dbl(X)) | → | mark#(X) | (47) |
active#(add(0,X)) | → | mark#(X) | (84) |
mark#(recip(X)) | → | active#(recip(mark(X))) | (83) |
[cons#(x1, x2)] | = | 0 |
[s(x1)] | = | 1431 |
[recip(x1)] | = | x1 + 1324 |
[recip#(x1)] | = | 0 |
[dbl(x1)] | = | x1 + 3102 |
[dbl#(x1)] | = | 0 |
[terms#(x1)] | = | 0 |
[sqr#(x1)] | = | 0 |
[mark#(x1)] | = | x1 + 3101 |
[0] | = | 31328 |
[s#(x1)] | = | 0 |
[first#(x1, x2)] | = | 0 |
[nil] | = | 18588 |
[mark(x1)] | = | x1 + 0 |
[first(x1, x2)] | = | x1 + x2 + 9726 |
[active(x1)] | = | x1 + 0 |
[cons(x1, x2)] | = | x1 + 1 |
[active#(x1)] | = | x1 + 0 |
[add#(x1, x2)] | = | 0 |
[add(x1, x2)] | = | x1 + x2 + 3102 |
[sqr(x1)] | = | x1 + 3102 |
[terms(x1)] | = | x1 + 7529 |
mark(first(X1,X2)) | → | active(first(mark(X1),mark(X2))) | (18) |
active(dbl(0)) | → | mark(0) | (4) |
mark(0) | → | active(0) | (15) |
active(first(0,X)) | → | mark(nil) | (8) |
active(terms(N)) | → | mark(cons(recip(sqr(N)),terms(s(N)))) | (1) |
active(sqr(s(X))) | → | mark(s(add(sqr(X),dbl(X)))) | (3) |
mark(add(X1,X2)) | → | active(add(mark(X1),mark(X2))) | (16) |
terms(active(X)) | → | terms(X) | (21) |
dbl(mark(X)) | → | dbl(X) | (36) |
recip(mark(X)) | → | recip(X) | (26) |
mark(nil) | → | active(nil) | (19) |
add(mark(X1),X2) | → | add(X1,X2) | (32) |
mark(dbl(X)) | → | active(dbl(mark(X))) | (17) |
recip(active(X)) | → | recip(X) | (27) |
add(active(X1),X2) | → | add(X1,X2) | (34) |
cons(mark(X1),X2) | → | cons(X1,X2) | (22) |
sqr(mark(X)) | → | sqr(X) | (28) |
active(dbl(s(X))) | → | mark(s(s(dbl(X)))) | (5) |
add(X1,mark(X2)) | → | add(X1,X2) | (33) |
mark(terms(X)) | → | active(terms(mark(X))) | (10) |
first(X1,mark(X2)) | → | first(X1,X2) | (39) |
active(add(s(X),Y)) | → | mark(s(add(X,Y))) | (7) |
terms(mark(X)) | → | terms(X) | (20) |
cons(X1,active(X2)) | → | cons(X1,X2) | (25) |
s(mark(X)) | → | s(X) | (30) |
mark(s(X)) | → | active(s(X)) | (14) |
s(active(X)) | → | s(X) | (31) |
mark(recip(X)) | → | active(recip(mark(X))) | (12) |
cons(X1,mark(X2)) | → | cons(X1,X2) | (23) |
cons(active(X1),X2) | → | cons(X1,X2) | (24) |
mark(cons(X1,X2)) | → | active(cons(mark(X1),X2)) | (11) |
active(first(s(X),cons(Y,Z))) | → | mark(cons(Y,first(X,Z))) | (9) |
mark(sqr(X)) | → | active(sqr(mark(X))) | (13) |
first(active(X1),X2) | → | first(X1,X2) | (40) |
active(add(0,X)) | → | mark(X) | (6) |
first(mark(X1),X2) | → | first(X1,X2) | (38) |
dbl(active(X)) | → | dbl(X) | (37) |
first(X1,active(X2)) | → | first(X1,X2) | (41) |
add(X1,active(X2)) | → | add(X1,X2) | (35) |
sqr(active(X)) | → | sqr(X) | (29) |
active(sqr(0)) | → | mark(0) | (2) |
mark#(add(X1,X2)) | → | active#(add(mark(X1),mark(X2))) | (80) |
mark#(cons(X1,X2)) | → | active#(cons(mark(X1),X2)) | (111) |
active#(sqr(s(X))) | → | mark#(s(add(sqr(X),dbl(X)))) | (76) |
active#(first(s(X),cons(Y,Z))) | → | mark#(cons(Y,first(X,Z))) | (74) |
mark#(add(X1,X2)) | → | mark#(X1) | (109) |
mark#(first(X1,X2)) | → | active#(first(mark(X1),mark(X2))) | (70) |
mark#(s(X)) | → | active#(s(X)) | (69) |
active#(dbl(s(X))) | → | mark#(s(s(dbl(X)))) | (104) |
mark#(sqr(X)) | → | mark#(X) | (67) |
mark#(sqr(X)) | → | active#(sqr(mark(X))) | (66) |
mark#(terms(X)) | → | active#(terms(mark(X))) | (99) |
mark#(cons(X1,X2)) | → | mark#(X1) | (98) |
mark#(add(X1,X2)) | → | mark#(X2) | (61) |
active#(terms(N)) | → | mark#(cons(recip(sqr(N)),terms(s(N)))) | (57) |
mark#(terms(X)) | → | mark#(X) | (95) |
mark#(recip(X)) | → | mark#(X) | (94) |
active#(add(s(X),Y)) | → | mark#(s(add(X,Y))) | (93) |
mark#(first(X1,X2)) | → | mark#(X2) | (51) |
mark#(dbl(X)) | → | active#(dbl(mark(X))) | (91) |
mark#(first(X1,X2)) | → | mark#(X1) | (89) |
mark#(dbl(X)) | → | mark#(X) | (47) |
active#(add(0,X)) | → | mark#(X) | (84) |
mark#(recip(X)) | → | active#(recip(mark(X))) | (83) |
The dependency pairs are split into 0 components.
add#(X1,active(X2)) | → | add#(X1,X2) | (107) |
add#(mark(X1),X2) | → | add#(X1,X2) | (52) |
add#(active(X1),X2) | → | add#(X1,X2) | (48) |
add#(X1,mark(X2)) | → | add#(X1,X2) | (45) |
[cons#(x1, x2)] | = | 0 |
[s(x1)] | = | 0 |
[recip(x1)] | = | 41734 |
[recip#(x1)] | = | 0 |
[dbl(x1)] | = | 11650 |
[dbl#(x1)] | = | 0 |
[terms#(x1)] | = | 0 |
[sqr#(x1)] | = | 0 |
[mark#(x1)] | = | 3101 |
[0] | = | 31328 |
[s#(x1)] | = | 0 |
[first#(x1, x2)] | = | 0 |
[nil] | = | 38741 |
[mark(x1)] | = | x1 + 19860 |
[first(x1, x2)] | = | x2 + 1 |
[active(x1)] | = | x1 + 1 |
[cons(x1, x2)] | = | x1 + x2 + 1 |
[active#(x1)] | = | 0 |
[add#(x1, x2)] | = | x1 + 0 |
[add(x1, x2)] | = | 4531 |
[sqr(x1)] | = | x1 + 19858 |
[terms(x1)] | = | 1 |
dbl(mark(X)) | → | dbl(X) | (36) |
recip(mark(X)) | → | recip(X) | (26) |
add(mark(X1),X2) | → | add(X1,X2) | (32) |
recip(active(X)) | → | recip(X) | (27) |
add(active(X1),X2) | → | add(X1,X2) | (34) |
add(X1,mark(X2)) | → | add(X1,X2) | (33) |
dbl(active(X)) | → | dbl(X) | (37) |
add(X1,active(X2)) | → | add(X1,X2) | (35) |
add#(mark(X1),X2) | → | add#(X1,X2) | (52) |
add#(active(X1),X2) | → | add#(X1,X2) | (48) |
The dependency pairs are split into 1 component.
add#(X1,mark(X2)) | → | add#(X1,X2) | (45) |
add#(X1,active(X2)) | → | add#(X1,X2) | (107) |
[cons#(x1, x2)] | = | 0 |
[s(x1)] | = | 0 |
[recip(x1)] | = | 32742 |
[recip#(x1)] | = | 0 |
[dbl(x1)] | = | 1 |
[dbl#(x1)] | = | 0 |
[terms#(x1)] | = | 0 |
[sqr#(x1)] | = | 0 |
[mark#(x1)] | = | 3101 |
[0] | = | 1 |
[s#(x1)] | = | 0 |
[first#(x1, x2)] | = | 0 |
[nil] | = | 22755 |
[mark(x1)] | = | x1 + 47716 |
[first(x1, x2)] | = | x2 + 1 |
[active(x1)] | = | x1 + 19858 |
[cons(x1, x2)] | = | x1 + x2 + 1 |
[active#(x1)] | = | 0 |
[add#(x1, x2)] | = | x2 + 0 |
[add(x1, x2)] | = | 5599 |
[sqr(x1)] | = | x1 + 1 |
[terms(x1)] | = | 1 |
dbl(mark(X)) | → | dbl(X) | (36) |
recip(mark(X)) | → | recip(X) | (26) |
add(mark(X1),X2) | → | add(X1,X2) | (32) |
recip(active(X)) | → | recip(X) | (27) |
add(active(X1),X2) | → | add(X1,X2) | (34) |
add(X1,mark(X2)) | → | add(X1,X2) | (33) |
dbl(active(X)) | → | dbl(X) | (37) |
add(X1,active(X2)) | → | add(X1,X2) | (35) |
add#(X1,mark(X2)) | → | add#(X1,X2) | (45) |
add#(X1,active(X2)) | → | add#(X1,X2) | (107) |
The dependency pairs are split into 0 components.
dbl#(mark(X)) | → | dbl#(X) | (113) |
dbl#(active(X)) | → | dbl#(X) | (90) |
[cons#(x1, x2)] | = | 0 |
[s(x1)] | = | 0 |
[recip(x1)] | = | 1 |
[recip#(x1)] | = | 0 |
[dbl(x1)] | = | 3024 |
[dbl#(x1)] | = | x1 + 0 |
[terms#(x1)] | = | 0 |
[sqr#(x1)] | = | 0 |
[mark#(x1)] | = | 3101 |
[0] | = | 1 |
[s#(x1)] | = | 0 |
[first#(x1, x2)] | = | 0 |
[nil] | = | 29111 |
[mark(x1)] | = | x1 + 30876 |
[first(x1, x2)] | = | x2 + 11820 |
[active(x1)] | = | x1 + 19858 |
[cons(x1, x2)] | = | x1 + x2 + 16842 |
[active#(x1)] | = | 0 |
[add#(x1, x2)] | = | 0 |
[add(x1, x2)] | = | 6904 |
[sqr(x1)] | = | x1 + 11017 |
[terms(x1)] | = | 13488 |
dbl(mark(X)) | → | dbl(X) | (36) |
recip(mark(X)) | → | recip(X) | (26) |
add(mark(X1),X2) | → | add(X1,X2) | (32) |
recip(active(X)) | → | recip(X) | (27) |
add(active(X1),X2) | → | add(X1,X2) | (34) |
add(X1,mark(X2)) | → | add(X1,X2) | (33) |
dbl(active(X)) | → | dbl(X) | (37) |
add(X1,active(X2)) | → | add(X1,X2) | (35) |
dbl#(mark(X)) | → | dbl#(X) | (113) |
dbl#(active(X)) | → | dbl#(X) | (90) |
The dependency pairs are split into 0 components.
first#(X1,active(X2)) | → | first#(X1,X2) | (112) |
first#(X1,mark(X2)) | → | first#(X1,X2) | (75) |
first#(active(X1),X2) | → | first#(X1,X2) | (110) |
first#(mark(X1),X2) | → | first#(X1,X2) | (59) |
[cons#(x1, x2)] | = | 0 |
[s(x1)] | = | 0 |
[recip(x1)] | = | 54886 |
[recip#(x1)] | = | 0 |
[dbl(x1)] | = | 1 |
[dbl#(x1)] | = | 0 |
[terms#(x1)] | = | 0 |
[sqr#(x1)] | = | 0 |
[mark#(x1)] | = | 3101 |
[0] | = | 1 |
[s#(x1)] | = | 0 |
[first#(x1, x2)] | = | x1 + x2 + 0 |
[nil] | = | 31233 |
[mark(x1)] | = | x1 + 25730 |
[first(x1, x2)] | = | x2 + 12237 |
[active(x1)] | = | x1 + 1 |
[cons(x1, x2)] | = | x1 + x2 + 28450 |
[active#(x1)] | = | 0 |
[add#(x1, x2)] | = | 0 |
[add(x1, x2)] | = | 1 |
[sqr(x1)] | = | x1 + 1 |
[terms(x1)] | = | 13488 |
dbl(mark(X)) | → | dbl(X) | (36) |
recip(mark(X)) | → | recip(X) | (26) |
add(mark(X1),X2) | → | add(X1,X2) | (32) |
recip(active(X)) | → | recip(X) | (27) |
add(active(X1),X2) | → | add(X1,X2) | (34) |
add(X1,mark(X2)) | → | add(X1,X2) | (33) |
dbl(active(X)) | → | dbl(X) | (37) |
add(X1,active(X2)) | → | add(X1,X2) | (35) |
first#(X1,active(X2)) | → | first#(X1,X2) | (112) |
first#(X1,mark(X2)) | → | first#(X1,X2) | (75) |
first#(active(X1),X2) | → | first#(X1,X2) | (110) |
first#(mark(X1),X2) | → | first#(X1,X2) | (59) |
The dependency pairs are split into 0 components.
cons#(active(X1),X2) | → | cons#(X1,X2) | (114) |
cons#(X1,active(X2)) | → | cons#(X1,X2) | (102) |
cons#(X1,mark(X2)) | → | cons#(X1,X2) | (100) |
cons#(mark(X1),X2) | → | cons#(X1,X2) | (49) |
[cons#(x1, x2)] | = | x2 + 0 |
[s(x1)] | = | 0 |
[recip(x1)] | = | 54886 |
[recip#(x1)] | = | 0 |
[dbl(x1)] | = | 1 |
[dbl#(x1)] | = | 0 |
[terms#(x1)] | = | 0 |
[sqr#(x1)] | = | 0 |
[mark#(x1)] | = | 3101 |
[0] | = | 1 |
[s#(x1)] | = | 0 |
[first#(x1, x2)] | = | 0 |
[nil] | = | 1 |
[mark(x1)] | = | x1 + 3 |
[first(x1, x2)] | = | x2 + 1 |
[active(x1)] | = | x1 + 1 |
[cons(x1, x2)] | = | x1 + x2 + 1 |
[active#(x1)] | = | 0 |
[add#(x1, x2)] | = | 0 |
[add(x1, x2)] | = | 1 |
[sqr(x1)] | = | x1 + 1 |
[terms(x1)] | = | 1 |
dbl(mark(X)) | → | dbl(X) | (36) |
recip(mark(X)) | → | recip(X) | (26) |
add(mark(X1),X2) | → | add(X1,X2) | (32) |
recip(active(X)) | → | recip(X) | (27) |
add(active(X1),X2) | → | add(X1,X2) | (34) |
add(X1,mark(X2)) | → | add(X1,X2) | (33) |
dbl(active(X)) | → | dbl(X) | (37) |
add(X1,active(X2)) | → | add(X1,X2) | (35) |
cons#(X1,active(X2)) | → | cons#(X1,X2) | (102) |
cons#(X1,mark(X2)) | → | cons#(X1,X2) | (100) |
The dependency pairs are split into 1 component.
cons#(mark(X1),X2) | → | cons#(X1,X2) | (49) |
cons#(active(X1),X2) | → | cons#(X1,X2) | (114) |
[cons#(x1, x2)] | = | x1 + 0 |
[s(x1)] | = | 0 |
[recip(x1)] | = | 27791 |
[recip#(x1)] | = | 0 |
[dbl(x1)] | = | 1 |
[dbl#(x1)] | = | 0 |
[terms#(x1)] | = | 0 |
[sqr#(x1)] | = | 0 |
[mark#(x1)] | = | 3101 |
[0] | = | 1 |
[s#(x1)] | = | 0 |
[first#(x1, x2)] | = | 0 |
[nil] | = | 42224 |
[mark(x1)] | = | x1 + 3827 |
[first(x1, x2)] | = | x2 + 1 |
[active(x1)] | = | x1 + 3825 |
[cons(x1, x2)] | = | x1 + x2 + 32963 |
[active#(x1)] | = | 0 |
[add#(x1, x2)] | = | 0 |
[add(x1, x2)] | = | 1 |
[sqr(x1)] | = | x1 + 1 |
[terms(x1)] | = | 40828 |
dbl(mark(X)) | → | dbl(X) | (36) |
recip(mark(X)) | → | recip(X) | (26) |
add(mark(X1),X2) | → | add(X1,X2) | (32) |
recip(active(X)) | → | recip(X) | (27) |
add(active(X1),X2) | → | add(X1,X2) | (34) |
add(X1,mark(X2)) | → | add(X1,X2) | (33) |
dbl(active(X)) | → | dbl(X) | (37) |
add(X1,active(X2)) | → | add(X1,X2) | (35) |
cons#(mark(X1),X2) | → | cons#(X1,X2) | (49) |
cons#(active(X1),X2) | → | cons#(X1,X2) | (114) |
The dependency pairs are split into 0 components.
recip#(mark(X)) | → | recip#(X) | (81) |
recip#(active(X)) | → | recip#(X) | (43) |
[cons#(x1, x2)] | = | 0 |
[s(x1)] | = | 0 |
[recip(x1)] | = | 1 |
[recip#(x1)] | = | x1 + 0 |
[dbl(x1)] | = | 285 |
[dbl#(x1)] | = | 0 |
[terms#(x1)] | = | 0 |
[sqr#(x1)] | = | 0 |
[mark#(x1)] | = | 3101 |
[0] | = | 15081 |
[s#(x1)] | = | 0 |
[first#(x1, x2)] | = | 0 |
[nil] | = | 27639 |
[mark(x1)] | = | x1 + 29656 |
[first(x1, x2)] | = | x2 + 28652 |
[active(x1)] | = | x1 + 1 |
[cons(x1, x2)] | = | x1 + x2 + 38368 |
[active#(x1)] | = | 0 |
[add#(x1, x2)] | = | 0 |
[add(x1, x2)] | = | 718 |
[sqr(x1)] | = | x1 + 29654 |
[terms(x1)] | = | 28254 |
dbl(mark(X)) | → | dbl(X) | (36) |
recip(mark(X)) | → | recip(X) | (26) |
add(mark(X1),X2) | → | add(X1,X2) | (32) |
recip(active(X)) | → | recip(X) | (27) |
add(active(X1),X2) | → | add(X1,X2) | (34) |
add(X1,mark(X2)) | → | add(X1,X2) | (33) |
dbl(active(X)) | → | dbl(X) | (37) |
add(X1,active(X2)) | → | add(X1,X2) | (35) |
recip#(mark(X)) | → | recip#(X) | (81) |
recip#(active(X)) | → | recip#(X) | (43) |
The dependency pairs are split into 0 components.
sqr#(mark(X)) | → | sqr#(X) | (63) |
sqr#(active(X)) | → | sqr#(X) | (42) |
[cons#(x1, x2)] | = | 0 |
[s(x1)] | = | 0 |
[recip(x1)] | = | 1 |
[recip#(x1)] | = | 0 |
[dbl(x1)] | = | 1 |
[dbl#(x1)] | = | 0 |
[terms#(x1)] | = | 0 |
[sqr#(x1)] | = | x1 + 0 |
[mark#(x1)] | = | 3101 |
[0] | = | 23166 |
[s#(x1)] | = | 0 |
[first#(x1, x2)] | = | 0 |
[nil] | = | 17889 |
[mark(x1)] | = | x1 + 3 |
[first(x1, x2)] | = | x2 + 2022 |
[active(x1)] | = | x1 + 1 |
[cons(x1, x2)] | = | x1 + x2 + 38545 |
[active#(x1)] | = | 0 |
[add#(x1, x2)] | = | 0 |
[add(x1, x2)] | = | 1 |
[sqr(x1)] | = | x1 + 1 |
[terms(x1)] | = | 20631 |
dbl(mark(X)) | → | dbl(X) | (36) |
recip(mark(X)) | → | recip(X) | (26) |
add(mark(X1),X2) | → | add(X1,X2) | (32) |
recip(active(X)) | → | recip(X) | (27) |
add(active(X1),X2) | → | add(X1,X2) | (34) |
add(X1,mark(X2)) | → | add(X1,X2) | (33) |
dbl(active(X)) | → | dbl(X) | (37) |
add(X1,active(X2)) | → | add(X1,X2) | (35) |
sqr#(mark(X)) | → | sqr#(X) | (63) |
sqr#(active(X)) | → | sqr#(X) | (42) |
The dependency pairs are split into 0 components.
terms#(active(X)) | → | terms#(X) | (64) |
terms#(mark(X)) | → | terms#(X) | (96) |
[cons#(x1, x2)] | = | 0 |
[s(x1)] | = | 0 |
[recip(x1)] | = | 24552 |
[recip#(x1)] | = | 0 |
[dbl(x1)] | = | 1 |
[dbl#(x1)] | = | 0 |
[terms#(x1)] | = | x1 + 0 |
[sqr#(x1)] | = | 0 |
[mark#(x1)] | = | 3101 |
[0] | = | 28447 |
[s#(x1)] | = | 0 |
[first#(x1, x2)] | = | 0 |
[nil] | = | 30744 |
[mark(x1)] | = | x1 + 3 |
[first(x1, x2)] | = | x2 + 1 |
[active(x1)] | = | x1 + 1 |
[cons(x1, x2)] | = | x1 + x2 + 35640 |
[active#(x1)] | = | 0 |
[add#(x1, x2)] | = | 0 |
[add(x1, x2)] | = | 1 |
[sqr(x1)] | = | x1 + 1 |
[terms(x1)] | = | 62216 |
dbl(mark(X)) | → | dbl(X) | (36) |
recip(mark(X)) | → | recip(X) | (26) |
add(mark(X1),X2) | → | add(X1,X2) | (32) |
recip(active(X)) | → | recip(X) | (27) |
add(active(X1),X2) | → | add(X1,X2) | (34) |
add(X1,mark(X2)) | → | add(X1,X2) | (33) |
dbl(active(X)) | → | dbl(X) | (37) |
add(X1,active(X2)) | → | add(X1,X2) | (35) |
terms#(active(X)) | → | terms#(X) | (64) |
terms#(mark(X)) | → | terms#(X) | (96) |
The dependency pairs are split into 0 components.
s#(mark(X)) | → | s#(X) | (82) |
s#(active(X)) | → | s#(X) | (71) |
[cons#(x1, x2)] | = | 0 |
[s(x1)] | = | 0 |
[recip(x1)] | = | 26373 |
[recip#(x1)] | = | 0 |
[dbl(x1)] | = | 1 |
[dbl#(x1)] | = | 0 |
[terms#(x1)] | = | 0 |
[sqr#(x1)] | = | 0 |
[mark#(x1)] | = | 3101 |
[0] | = | 28447 |
[s#(x1)] | = | x1 + 0 |
[first#(x1, x2)] | = | 0 |
[nil] | = | 32647 |
[mark(x1)] | = | x1 + 15878 |
[first(x1, x2)] | = | x2 + 1 |
[active(x1)] | = | x1 + 1 |
[cons(x1, x2)] | = | x1 + x2 + 52421 |
[active#(x1)] | = | 0 |
[add#(x1, x2)] | = | 0 |
[add(x1, x2)] | = | 3580 |
[sqr(x1)] | = | x1 + 15876 |
[terms(x1)] | = | 40618 |
dbl(mark(X)) | → | dbl(X) | (36) |
recip(mark(X)) | → | recip(X) | (26) |
add(mark(X1),X2) | → | add(X1,X2) | (32) |
recip(active(X)) | → | recip(X) | (27) |
add(active(X1),X2) | → | add(X1,X2) | (34) |
add(X1,mark(X2)) | → | add(X1,X2) | (33) |
dbl(active(X)) | → | dbl(X) | (37) |
add(X1,active(X2)) | → | add(X1,X2) | (35) |
s#(mark(X)) | → | s#(X) | (82) |
s#(active(X)) | → | s#(X) | (71) |
The dependency pairs are split into 0 components.