The rewrite relation of the following TRS is considered.
active(and(tt,X)) | → | mark(X) | (1) |
active(plus(N,0)) | → | mark(N) | (2) |
active(plus(N,s(M))) | → | mark(s(plus(N,M))) | (3) |
active(x(N,0)) | → | mark(0) | (4) |
active(x(N,s(M))) | → | mark(plus(x(N,M),N)) | (5) |
mark(and(X1,X2)) | → | active(and(mark(X1),X2)) | (6) |
mark(tt) | → | active(tt) | (7) |
mark(plus(X1,X2)) | → | active(plus(mark(X1),mark(X2))) | (8) |
mark(0) | → | active(0) | (9) |
mark(s(X)) | → | active(s(mark(X))) | (10) |
mark(x(X1,X2)) | → | active(x(mark(X1),mark(X2))) | (11) |
and(mark(X1),X2) | → | and(X1,X2) | (12) |
and(X1,mark(X2)) | → | and(X1,X2) | (13) |
and(active(X1),X2) | → | and(X1,X2) | (14) |
and(X1,active(X2)) | → | and(X1,X2) | (15) |
plus(mark(X1),X2) | → | plus(X1,X2) | (16) |
plus(X1,mark(X2)) | → | plus(X1,X2) | (17) |
plus(active(X1),X2) | → | plus(X1,X2) | (18) |
plus(X1,active(X2)) | → | plus(X1,X2) | (19) |
s(mark(X)) | → | s(X) | (20) |
s(active(X)) | → | s(X) | (21) |
x(mark(X1),X2) | → | x(X1,X2) | (22) |
x(X1,mark(X2)) | → | x(X1,X2) | (23) |
x(active(X1),X2) | → | x(X1,X2) | (24) |
x(X1,active(X2)) | → | x(X1,X2) | (25) |
mark#(and(X1,X2)) | → | active#(and(mark(X1),X2)) | (26) |
active#(plus(N,s(M))) | → | mark#(s(plus(N,M))) | (27) |
mark#(plus(X1,X2)) | → | mark#(X1) | (28) |
and#(X1,active(X2)) | → | and#(X1,X2) | (29) |
active#(x(N,0)) | → | mark#(0) | (30) |
mark#(0) | → | active#(0) | (31) |
and#(mark(X1),X2) | → | and#(X1,X2) | (32) |
mark#(x(X1,X2)) | → | mark#(X1) | (33) |
x#(active(X1),X2) | → | x#(X1,X2) | (34) |
x#(mark(X1),X2) | → | x#(X1,X2) | (35) |
active#(x(N,s(M))) | → | x#(N,M) | (36) |
x#(X1,mark(X2)) | → | x#(X1,X2) | (37) |
active#(plus(N,s(M))) | → | plus#(N,M) | (38) |
and#(active(X1),X2) | → | and#(X1,X2) | (39) |
active#(plus(N,s(M))) | → | s#(plus(N,M)) | (40) |
plus#(X1,mark(X2)) | → | plus#(X1,X2) | (41) |
mark#(s(X)) | → | mark#(X) | (42) |
mark#(x(X1,X2)) | → | active#(x(mark(X1),mark(X2))) | (43) |
plus#(active(X1),X2) | → | plus#(X1,X2) | (44) |
mark#(x(X1,X2)) | → | mark#(X2) | (45) |
mark#(plus(X1,X2)) | → | active#(plus(mark(X1),mark(X2))) | (46) |
and#(X1,mark(X2)) | → | and#(X1,X2) | (47) |
plus#(mark(X1),X2) | → | plus#(X1,X2) | (48) |
active#(x(N,s(M))) | → | plus#(x(N,M),N) | (49) |
mark#(plus(X1,X2)) | → | plus#(mark(X1),mark(X2)) | (50) |
s#(active(X)) | → | s#(X) | (51) |
mark#(tt) | → | active#(tt) | (52) |
active#(and(tt,X)) | → | mark#(X) | (53) |
mark#(s(X)) | → | s#(mark(X)) | (54) |
plus#(X1,active(X2)) | → | plus#(X1,X2) | (55) |
mark#(plus(X1,X2)) | → | mark#(X2) | (56) |
active#(x(N,s(M))) | → | mark#(plus(x(N,M),N)) | (57) |
s#(mark(X)) | → | s#(X) | (58) |
mark#(and(X1,X2)) | → | and#(mark(X1),X2) | (59) |
active#(plus(N,0)) | → | mark#(N) | (60) |
mark#(x(X1,X2)) | → | x#(mark(X1),mark(X2)) | (61) |
x#(X1,active(X2)) | → | x#(X1,X2) | (62) |
mark#(and(X1,X2)) | → | mark#(X1) | (63) |
mark#(s(X)) | → | active#(s(mark(X))) | (64) |
The dependency pairs are split into 5 components.
mark#(s(X)) | → | active#(s(mark(X))) | (64) |
mark#(and(X1,X2)) | → | mark#(X1) | (63) |
active#(plus(N,0)) | → | mark#(N) | (60) |
active#(x(N,s(M))) | → | mark#(plus(x(N,M),N)) | (57) |
mark#(plus(X1,X2)) | → | mark#(X2) | (56) |
mark#(x(X1,X2)) | → | mark#(X1) | (33) |
active#(and(tt,X)) | → | mark#(X) | (53) |
mark#(plus(X1,X2)) | → | active#(plus(mark(X1),mark(X2))) | (46) |
mark#(x(X1,X2)) | → | mark#(X2) | (45) |
mark#(x(X1,X2)) | → | active#(x(mark(X1),mark(X2))) | (43) |
mark#(plus(X1,X2)) | → | mark#(X1) | (28) |
active#(plus(N,s(M))) | → | mark#(s(plus(N,M))) | (27) |
mark#(and(X1,X2)) | → | active#(and(mark(X1),X2)) | (26) |
mark#(s(X)) | → | mark#(X) | (42) |
[s(x1)] | = | 39 |
[and(x1, x2)] | = | 40 |
[plus#(x1, x2)] | = | 0 |
[x(x1, x2)] | = | 40 |
[mark#(x1)] | = | 40 |
[0] | = | 1 |
[x#(x1, x2)] | = | 0 |
[s#(x1)] | = | 0 |
[mark(x1)] | = | 1 |
[plus(x1, x2)] | = | 40 |
[active(x1)] | = | 1 |
[active#(x1)] | = | x1 + 0 |
[tt] | = | 1 |
[and#(x1, x2)] | = | 0 |
plus(active(X1),X2) | → | plus(X1,X2) | (18) |
active(x(N,0)) | → | mark(0) | (4) |
and(X1,active(X2)) | → | and(X1,X2) | (15) |
mark(plus(X1,X2)) | → | active(plus(mark(X1),mark(X2))) | (8) |
active(and(tt,X)) | → | mark(X) | (1) |
active(plus(N,s(M))) | → | mark(s(plus(N,M))) | (3) |
plus(mark(X1),X2) | → | plus(X1,X2) | (16) |
s(active(X)) | → | s(X) | (21) |
plus(X1,active(X2)) | → | plus(X1,X2) | (19) |
plus(X1,mark(X2)) | → | plus(X1,X2) | (17) |
x(mark(X1),X2) | → | x(X1,X2) | (22) |
active(x(N,s(M))) | → | mark(plus(x(N,M),N)) | (5) |
mark(s(X)) | → | active(s(mark(X))) | (10) |
mark(tt) | → | active(tt) | (7) |
s(mark(X)) | → | s(X) | (20) |
x(X1,active(X2)) | → | x(X1,X2) | (25) |
and(active(X1),X2) | → | and(X1,X2) | (14) |
and(mark(X1),X2) | → | and(X1,X2) | (12) |
x(X1,mark(X2)) | → | x(X1,X2) | (23) |
x(active(X1),X2) | → | x(X1,X2) | (24) |
mark(x(X1,X2)) | → | active(x(mark(X1),mark(X2))) | (11) |
mark(0) | → | active(0) | (9) |
and(X1,mark(X2)) | → | and(X1,X2) | (13) |
mark(and(X1,X2)) | → | active(and(mark(X1),X2)) | (6) |
active(plus(N,0)) | → | mark(N) | (2) |
mark#(s(X)) | → | active#(s(mark(X))) | (64) |
The dependency pairs are split into 1 component.
mark#(plus(X1,X2)) | → | mark#(X2) | (56) |
mark#(plus(X1,X2)) | → | mark#(X1) | (28) |
mark#(plus(X1,X2)) | → | active#(plus(mark(X1),mark(X2))) | (46) |
active#(and(tt,X)) | → | mark#(X) | (53) |
active#(plus(N,s(M))) | → | mark#(s(plus(N,M))) | (27) |
active#(x(N,s(M))) | → | mark#(plus(x(N,M),N)) | (57) |
mark#(s(X)) | → | mark#(X) | (42) |
mark#(x(X1,X2)) | → | mark#(X2) | (45) |
mark#(x(X1,X2)) | → | mark#(X1) | (33) |
mark#(x(X1,X2)) | → | active#(x(mark(X1),mark(X2))) | (43) |
mark#(and(X1,X2)) | → | mark#(X1) | (63) |
mark#(and(X1,X2)) | → | active#(and(mark(X1),X2)) | (26) |
active#(plus(N,0)) | → | mark#(N) | (60) |
[s(x1)] | = | x1 + 0 |
[and(x1, x2)] | = | max(x1 + 14681, x2 + 40967, 0) |
[plus#(x1, x2)] | = | max(0) |
[x(x1, x2)] | = | max(x1 + 36460, x2 + 36459, 0) |
[mark#(x1)] | = | x1 + 0 |
[0] | = | 36461 |
[x#(x1, x2)] | = | max(0) |
[s#(x1)] | = | 0 |
[mark(x1)] | = | x1 + 0 |
[plus(x1, x2)] | = | max(x1 + 0, x2 + 36460, 0) |
[active(x1)] | = | x1 + 0 |
[active#(x1)] | = | x1 + 0 |
[tt] | = | 11943 |
[and#(x1, x2)] | = | max(0) |
plus(active(X1),X2) | → | plus(X1,X2) | (18) |
active(x(N,0)) | → | mark(0) | (4) |
and(X1,active(X2)) | → | and(X1,X2) | (15) |
mark(plus(X1,X2)) | → | active(plus(mark(X1),mark(X2))) | (8) |
active(and(tt,X)) | → | mark(X) | (1) |
active(plus(N,s(M))) | → | mark(s(plus(N,M))) | (3) |
plus(mark(X1),X2) | → | plus(X1,X2) | (16) |
s(active(X)) | → | s(X) | (21) |
plus(X1,active(X2)) | → | plus(X1,X2) | (19) |
plus(X1,mark(X2)) | → | plus(X1,X2) | (17) |
x(mark(X1),X2) | → | x(X1,X2) | (22) |
active(x(N,s(M))) | → | mark(plus(x(N,M),N)) | (5) |
mark(s(X)) | → | active(s(mark(X))) | (10) |
mark(tt) | → | active(tt) | (7) |
s(mark(X)) | → | s(X) | (20) |
x(X1,active(X2)) | → | x(X1,X2) | (25) |
and(active(X1),X2) | → | and(X1,X2) | (14) |
and(mark(X1),X2) | → | and(X1,X2) | (12) |
x(X1,mark(X2)) | → | x(X1,X2) | (23) |
x(active(X1),X2) | → | x(X1,X2) | (24) |
mark(x(X1,X2)) | → | active(x(mark(X1),mark(X2))) | (11) |
mark(0) | → | active(0) | (9) |
and(X1,mark(X2)) | → | and(X1,X2) | (13) |
mark(and(X1,X2)) | → | active(and(mark(X1),X2)) | (6) |
active(plus(N,0)) | → | mark(N) | (2) |
mark#(plus(X1,X2)) | → | mark#(X2) | (56) |
active#(and(tt,X)) | → | mark#(X) | (53) |
mark#(x(X1,X2)) | → | mark#(X2) | (45) |
mark#(x(X1,X2)) | → | mark#(X1) | (33) |
mark#(and(X1,X2)) | → | mark#(X1) | (63) |
The dependency pairs are split into 1 component.
mark#(plus(X1,X2)) | → | mark#(X1) | (28) |
mark#(plus(X1,X2)) | → | active#(plus(mark(X1),mark(X2))) | (46) |
active#(plus(N,s(M))) | → | mark#(s(plus(N,M))) | (27) |
active#(x(N,s(M))) | → | mark#(plus(x(N,M),N)) | (57) |
mark#(s(X)) | → | mark#(X) | (42) |
mark#(x(X1,X2)) | → | active#(x(mark(X1),mark(X2))) | (43) |
mark#(and(X1,X2)) | → | active#(and(mark(X1),X2)) | (26) |
active#(plus(N,0)) | → | mark#(N) | (60) |
[s(x1)] | = | 14682 |
[and(x1, x2)] | = | 14682 |
[plus#(x1, x2)] | = | 0 |
[x(x1, x2)] | = | 17680 |
[mark#(x1)] | = | 17680 |
[0] | = | 0 |
[x#(x1, x2)] | = | 0 |
[s#(x1)] | = | 0 |
[mark(x1)] | = | 14681 |
[plus(x1, x2)] | = | 17680 |
[active(x1)] | = | x1 + 0 |
[active#(x1)] | = | x1 + 0 |
[tt] | = | 0 |
[and#(x1, x2)] | = | 0 |
plus(active(X1),X2) | → | plus(X1,X2) | (18) |
and(X1,active(X2)) | → | and(X1,X2) | (15) |
plus(mark(X1),X2) | → | plus(X1,X2) | (16) |
s(active(X)) | → | s(X) | (21) |
plus(X1,active(X2)) | → | plus(X1,X2) | (19) |
plus(X1,mark(X2)) | → | plus(X1,X2) | (17) |
x(mark(X1),X2) | → | x(X1,X2) | (22) |
s(mark(X)) | → | s(X) | (20) |
x(X1,active(X2)) | → | x(X1,X2) | (25) |
and(active(X1),X2) | → | and(X1,X2) | (14) |
and(mark(X1),X2) | → | and(X1,X2) | (12) |
x(X1,mark(X2)) | → | x(X1,X2) | (23) |
x(active(X1),X2) | → | x(X1,X2) | (24) |
and(X1,mark(X2)) | → | and(X1,X2) | (13) |
mark#(and(X1,X2)) | → | active#(and(mark(X1),X2)) | (26) |
The dependency pairs are split into 1 component.
mark#(plus(X1,X2)) | → | mark#(X1) | (28) |
mark#(plus(X1,X2)) | → | active#(plus(mark(X1),mark(X2))) | (46) |
active#(plus(N,s(M))) | → | mark#(s(plus(N,M))) | (27) |
active#(x(N,s(M))) | → | mark#(plus(x(N,M),N)) | (57) |
mark#(s(X)) | → | mark#(X) | (42) |
mark#(x(X1,X2)) | → | active#(x(mark(X1),mark(X2))) | (43) |
active#(plus(N,0)) | → | mark#(N) | (60) |
π(and) | = | 2 |
π(mark) | = | 1 |
π(active) | = | 1 |
π(and#) | = | 2 |
prec(s) | = | 0 | status(s) | = | [1] | list-extension(s) | = | Lex | ||
prec(plus#) | = | 0 | status(plus#) | = | [] | list-extension(plus#) | = | Lex | ||
prec(x) | = | 4 | status(x) | = | [2, 1] | list-extension(x) | = | Lex | ||
prec(mark#) | = | 2 | status(mark#) | = | [1] | list-extension(mark#) | = | Lex | ||
prec(0) | = | 1 | status(0) | = | [] | list-extension(0) | = | Lex | ||
prec(x#) | = | 0 | status(x#) | = | [] | list-extension(x#) | = | Lex | ||
prec(s#) | = | 0 | status(s#) | = | [] | list-extension(s#) | = | Lex | ||
prec(plus) | = | 3 | status(plus) | = | [2, 1] | list-extension(plus) | = | Lex | ||
prec(active#) | = | 1 | status(active#) | = | [1] | list-extension(active#) | = | Lex | ||
prec(tt) | = | 5 | status(tt) | = | [] | list-extension(tt) | = | Lex |
[s(x1)] | = | x1 + 0 |
[plus#(x1, x2)] | = | max(0) |
[x(x1, x2)] | = | max(x1 + 0, x2 + 0, 0) |
[mark#(x1)] | = | x1 + 0 |
[0] | = | 0 |
[x#(x1, x2)] | = | max(0) |
[s#(x1)] | = | 0 |
[plus(x1, x2)] | = | max(x1 + 0, x2 + 0, 0) |
[active#(x1)] | = | x1 + 0 |
[tt] | = | 0 |
plus(active(X1),X2) | → | plus(X1,X2) | (18) |
active(x(N,0)) | → | mark(0) | (4) |
and(X1,active(X2)) | → | and(X1,X2) | (15) |
mark(plus(X1,X2)) | → | active(plus(mark(X1),mark(X2))) | (8) |
active(and(tt,X)) | → | mark(X) | (1) |
active(plus(N,s(M))) | → | mark(s(plus(N,M))) | (3) |
plus(mark(X1),X2) | → | plus(X1,X2) | (16) |
s(active(X)) | → | s(X) | (21) |
plus(X1,active(X2)) | → | plus(X1,X2) | (19) |
plus(X1,mark(X2)) | → | plus(X1,X2) | (17) |
x(mark(X1),X2) | → | x(X1,X2) | (22) |
active(x(N,s(M))) | → | mark(plus(x(N,M),N)) | (5) |
mark(s(X)) | → | active(s(mark(X))) | (10) |
mark(tt) | → | active(tt) | (7) |
s(mark(X)) | → | s(X) | (20) |
x(X1,active(X2)) | → | x(X1,X2) | (25) |
and(active(X1),X2) | → | and(X1,X2) | (14) |
and(mark(X1),X2) | → | and(X1,X2) | (12) |
x(X1,mark(X2)) | → | x(X1,X2) | (23) |
x(active(X1),X2) | → | x(X1,X2) | (24) |
mark(x(X1,X2)) | → | active(x(mark(X1),mark(X2))) | (11) |
mark(0) | → | active(0) | (9) |
and(X1,mark(X2)) | → | and(X1,X2) | (13) |
mark(and(X1,X2)) | → | active(and(mark(X1),X2)) | (6) |
active(plus(N,0)) | → | mark(N) | (2) |
mark#(plus(X1,X2)) | → | mark#(X1) | (28) |
mark#(plus(X1,X2)) | → | active#(plus(mark(X1),mark(X2))) | (46) |
active#(plus(N,s(M))) | → | mark#(s(plus(N,M))) | (27) |
active#(x(N,s(M))) | → | mark#(plus(x(N,M),N)) | (57) |
mark#(s(X)) | → | mark#(X) | (42) |
mark#(x(X1,X2)) | → | active#(x(mark(X1),mark(X2))) | (43) |
active#(plus(N,0)) | → | mark#(N) | (60) |
The dependency pairs are split into 0 components.
and#(active(X1),X2) | → | and#(X1,X2) | (39) |
and#(mark(X1),X2) | → | and#(X1,X2) | (32) |
and#(X1,mark(X2)) | → | and#(X1,X2) | (47) |
and#(X1,active(X2)) | → | and#(X1,X2) | (29) |
[s(x1)] | = | x1 + 20586 |
[and(x1, x2)] | = | 1 |
[plus#(x1, x2)] | = | 0 |
[x(x1, x2)] | = | x2 + 40436 |
[mark#(x1)] | = | 0 |
[0] | = | 17888 |
[x#(x1, x2)] | = | 0 |
[s#(x1)] | = | 0 |
[mark(x1)] | = | x1 + 1 |
[plus(x1, x2)] | = | x1 + 20588 |
[active(x1)] | = | x1 + 2 |
[active#(x1)] | = | 0 |
[tt] | = | 31598 |
[and#(x1, x2)] | = | x1 + 0 |
and#(active(X1),X2) | → | and#(X1,X2) | (39) |
and#(mark(X1),X2) | → | and#(X1,X2) | (32) |
The dependency pairs are split into 1 component.
and#(X1,active(X2)) | → | and#(X1,X2) | (29) |
and#(X1,mark(X2)) | → | and#(X1,X2) | (47) |
[s(x1)] | = | x1 + 19266 |
[and(x1, x2)] | = | 9508 |
[plus#(x1, x2)] | = | 0 |
[x(x1, x2)] | = | x2 + 38525 |
[mark#(x1)] | = | 0 |
[0] | = | 38578 |
[x#(x1, x2)] | = | 0 |
[s#(x1)] | = | 0 |
[mark(x1)] | = | x1 + 1 |
[plus(x1, x2)] | = | x1 + 38532 |
[active(x1)] | = | x1 + 19266 |
[active#(x1)] | = | 0 |
[tt] | = | 34444 |
[and#(x1, x2)] | = | x2 + 0 |
and#(X1,active(X2)) | → | and#(X1,X2) | (29) |
and#(X1,mark(X2)) | → | and#(X1,X2) | (47) |
The dependency pairs are split into 0 components.
x#(X1,active(X2)) | → | x#(X1,X2) | (62) |
x#(X1,mark(X2)) | → | x#(X1,X2) | (37) |
x#(mark(X1),X2) | → | x#(X1,X2) | (35) |
x#(active(X1),X2) | → | x#(X1,X2) | (34) |
[s(x1)] | = | x1 + 15262 |
[and(x1, x2)] | = | 9508 |
[plus#(x1, x2)] | = | 0 |
[x(x1, x2)] | = | x2 + 15943 |
[mark#(x1)] | = | 0 |
[0] | = | 4684 |
[x#(x1, x2)] | = | x1 + 0 |
[s#(x1)] | = | 0 |
[mark(x1)] | = | x1 + 1 |
[plus(x1, x2)] | = | x1 + 31967 |
[active(x1)] | = | x1 + 2 |
[active#(x1)] | = | 0 |
[tt] | = | 1 |
[and#(x1, x2)] | = | 0 |
x#(mark(X1),X2) | → | x#(X1,X2) | (35) |
x#(active(X1),X2) | → | x#(X1,X2) | (34) |
The dependency pairs are split into 1 component.
x#(X1,active(X2)) | → | x#(X1,X2) | (62) |
x#(X1,mark(X2)) | → | x#(X1,X2) | (37) |
[s(x1)] | = | x1 + 44199 |
[and(x1, x2)] | = | 2805 |
[plus#(x1, x2)] | = | 0 |
[x(x1, x2)] | = | x2 + 33840 |
[mark#(x1)] | = | 0 |
[0] | = | 1 |
[x#(x1, x2)] | = | x2 + 0 |
[s#(x1)] | = | 0 |
[mark(x1)] | = | x1 + 240 |
[plus(x1, x2)] | = | x1 + 44201 |
[active(x1)] | = | x1 + 241 |
[active#(x1)] | = | 0 |
[tt] | = | 7210 |
[and#(x1, x2)] | = | 0 |
x#(X1,active(X2)) | → | x#(X1,X2) | (62) |
x#(X1,mark(X2)) | → | x#(X1,X2) | (37) |
The dependency pairs are split into 0 components.
s#(mark(X)) | → | s#(X) | (58) |
s#(active(X)) | → | s#(X) | (51) |
[s(x1)] | = | x1 + 2 |
[and(x1, x2)] | = | 41347 |
[plus#(x1, x2)] | = | 0 |
[x(x1, x2)] | = | x2 + 39090 |
[mark#(x1)] | = | 0 |
[0] | = | 35873 |
[x#(x1, x2)] | = | 0 |
[s#(x1)] | = | x1 + 0 |
[mark(x1)] | = | x1 + 240 |
[plus(x1, x2)] | = | x1 + 12704 |
[active(x1)] | = | x1 + 241 |
[active#(x1)] | = | 0 |
[tt] | = | 55573 |
[and#(x1, x2)] | = | 0 |
s#(mark(X)) | → | s#(X) | (58) |
s#(active(X)) | → | s#(X) | (51) |
The dependency pairs are split into 0 components.
plus#(X1,mark(X2)) | → | plus#(X1,X2) | (41) |
plus#(X1,active(X2)) | → | plus#(X1,X2) | (55) |
plus#(mark(X1),X2) | → | plus#(X1,X2) | (48) |
plus#(active(X1),X2) | → | plus#(X1,X2) | (44) |
[s(x1)] | = | x1 + 29274 |
[and(x1, x2)] | = | 14459 |
[plus#(x1, x2)] | = | x1 + x2 + 0 |
[x(x1, x2)] | = | x2 + 44055 |
[mark#(x1)] | = | 0 |
[0] | = | 3578 |
[x#(x1, x2)] | = | 0 |
[s#(x1)] | = | 0 |
[mark(x1)] | = | x1 + 15047 |
[plus(x1, x2)] | = | x1 + 29276 |
[active(x1)] | = | x1 + 15048 |
[active#(x1)] | = | 0 |
[tt] | = | 25532 |
[and#(x1, x2)] | = | 0 |
plus#(X1,mark(X2)) | → | plus#(X1,X2) | (41) |
plus#(X1,active(X2)) | → | plus#(X1,X2) | (55) |
plus#(mark(X1),X2) | → | plus#(X1,X2) | (48) |
plus#(active(X1),X2) | → | plus#(X1,X2) | (44) |
The dependency pairs are split into 0 components.