The rewrite relation of the following TRS is considered.
active(and(true,X)) | → | mark(X) | (1) |
active(and(false,Y)) | → | mark(false) | (2) |
active(if(true,X,Y)) | → | mark(X) | (3) |
active(if(false,X,Y)) | → | mark(Y) | (4) |
active(add(0,X)) | → | mark(X) | (5) |
active(add(s(X),Y)) | → | mark(s(add(X,Y))) | (6) |
active(first(0,X)) | → | mark(nil) | (7) |
active(first(s(X),cons(Y,Z))) | → | mark(cons(Y,first(X,Z))) | (8) |
active(from(X)) | → | mark(cons(X,from(s(X)))) | (9) |
active(and(X1,X2)) | → | and(active(X1),X2) | (10) |
active(if(X1,X2,X3)) | → | if(active(X1),X2,X3) | (11) |
active(add(X1,X2)) | → | add(active(X1),X2) | (12) |
active(first(X1,X2)) | → | first(active(X1),X2) | (13) |
active(first(X1,X2)) | → | first(X1,active(X2)) | (14) |
and(mark(X1),X2) | → | mark(and(X1,X2)) | (15) |
if(mark(X1),X2,X3) | → | mark(if(X1,X2,X3)) | (16) |
add(mark(X1),X2) | → | mark(add(X1,X2)) | (17) |
first(mark(X1),X2) | → | mark(first(X1,X2)) | (18) |
first(X1,mark(X2)) | → | mark(first(X1,X2)) | (19) |
proper(and(X1,X2)) | → | and(proper(X1),proper(X2)) | (20) |
proper(true) | → | ok(true) | (21) |
proper(false) | → | ok(false) | (22) |
proper(if(X1,X2,X3)) | → | if(proper(X1),proper(X2),proper(X3)) | (23) |
proper(add(X1,X2)) | → | add(proper(X1),proper(X2)) | (24) |
proper(0) | → | ok(0) | (25) |
proper(s(X)) | → | s(proper(X)) | (26) |
proper(first(X1,X2)) | → | first(proper(X1),proper(X2)) | (27) |
proper(nil) | → | ok(nil) | (28) |
proper(cons(X1,X2)) | → | cons(proper(X1),proper(X2)) | (29) |
proper(from(X)) | → | from(proper(X)) | (30) |
and(ok(X1),ok(X2)) | → | ok(and(X1,X2)) | (31) |
if(ok(X1),ok(X2),ok(X3)) | → | ok(if(X1,X2,X3)) | (32) |
add(ok(X1),ok(X2)) | → | ok(add(X1,X2)) | (33) |
s(ok(X)) | → | ok(s(X)) | (34) |
first(ok(X1),ok(X2)) | → | ok(first(X1,X2)) | (35) |
cons(ok(X1),ok(X2)) | → | ok(cons(X1,X2)) | (36) |
from(ok(X)) | → | ok(from(X)) | (37) |
top(mark(X)) | → | top(proper(X)) | (38) |
top(ok(X)) | → | top(active(X)) | (39) |
proper#(cons(X1,X2)) | → | proper#(X1) | (40) |
add#(mark(X1),X2) | → | add#(X1,X2) | (41) |
proper#(from(X)) | → | from#(proper(X)) | (42) |
top#(ok(X)) | → | active#(X) | (43) |
proper#(s(X)) | → | s#(proper(X)) | (44) |
proper#(first(X1,X2)) | → | proper#(X2) | (45) |
proper#(first(X1,X2)) | → | proper#(X1) | (46) |
active#(and(X1,X2)) | → | active#(X1) | (47) |
proper#(s(X)) | → | proper#(X) | (48) |
first#(mark(X1),X2) | → | first#(X1,X2) | (49) |
cons#(ok(X1),ok(X2)) | → | cons#(X1,X2) | (50) |
add#(ok(X1),ok(X2)) | → | add#(X1,X2) | (51) |
top#(mark(X)) | → | top#(proper(X)) | (52) |
proper#(first(X1,X2)) | → | first#(proper(X1),proper(X2)) | (53) |
active#(first(s(X),cons(Y,Z))) | → | first#(X,Z) | (54) |
active#(from(X)) | → | from#(s(X)) | (55) |
active#(add(s(X),Y)) | → | add#(X,Y) | (56) |
active#(first(X1,X2)) | → | active#(X1) | (57) |
active#(add(X1,X2)) | → | add#(active(X1),X2) | (58) |
proper#(if(X1,X2,X3)) | → | proper#(X3) | (59) |
first#(X1,mark(X2)) | → | first#(X1,X2) | (60) |
active#(from(X)) | → | cons#(X,from(s(X))) | (61) |
proper#(and(X1,X2)) | → | and#(proper(X1),proper(X2)) | (62) |
active#(from(X)) | → | s#(X) | (63) |
proper#(from(X)) | → | proper#(X) | (64) |
and#(mark(X1),X2) | → | and#(X1,X2) | (65) |
if#(mark(X1),X2,X3) | → | if#(X1,X2,X3) | (66) |
active#(add(X1,X2)) | → | active#(X1) | (67) |
proper#(if(X1,X2,X3)) | → | if#(proper(X1),proper(X2),proper(X3)) | (68) |
top#(mark(X)) | → | proper#(X) | (69) |
s#(ok(X)) | → | s#(X) | (70) |
active#(first(X1,X2)) | → | first#(active(X1),X2) | (71) |
proper#(and(X1,X2)) | → | proper#(X2) | (72) |
from#(ok(X)) | → | from#(X) | (73) |
if#(ok(X1),ok(X2),ok(X3)) | → | if#(X1,X2,X3) | (74) |
active#(first(X1,X2)) | → | active#(X2) | (75) |
proper#(if(X1,X2,X3)) | → | proper#(X2) | (76) |
top#(ok(X)) | → | top#(active(X)) | (77) |
active#(first(X1,X2)) | → | first#(X1,active(X2)) | (78) |
proper#(add(X1,X2)) | → | add#(proper(X1),proper(X2)) | (79) |
proper#(and(X1,X2)) | → | proper#(X1) | (80) |
proper#(add(X1,X2)) | → | proper#(X2) | (81) |
and#(ok(X1),ok(X2)) | → | and#(X1,X2) | (82) |
active#(and(X1,X2)) | → | and#(active(X1),X2) | (83) |
proper#(if(X1,X2,X3)) | → | proper#(X1) | (84) |
active#(if(X1,X2,X3)) | → | active#(X1) | (85) |
proper#(cons(X1,X2)) | → | proper#(X2) | (86) |
proper#(cons(X1,X2)) | → | cons#(proper(X1),proper(X2)) | (87) |
active#(add(s(X),Y)) | → | s#(add(X,Y)) | (88) |
active#(if(X1,X2,X3)) | → | if#(active(X1),X2,X3) | (89) |
first#(ok(X1),ok(X2)) | → | first#(X1,X2) | (90) |
active#(first(s(X),cons(Y,Z))) | → | cons#(Y,first(X,Z)) | (91) |
proper#(add(X1,X2)) | → | proper#(X1) | (92) |
The dependency pairs are split into 10 components.
top#(mark(X)) | → | top#(proper(X)) | (52) |
top#(ok(X)) | → | top#(active(X)) | (77) |
[cons#(x1, x2)] | = | 0 |
[s(x1)] | = | 1 |
[top(x1)] | = | 0 |
[and(x1, x2)] | = | x1 + x2 + 17067 |
[false] | = | 32018 |
[top#(x1)] | = | x1 + 0 |
[true] | = | 1 |
[proper(x1)] | = | x1 + 0 |
[ok(x1)] | = | x1 + 0 |
[if(x1, x2, x3)] | = | x1 + x2 + x3 + 41054 |
[0] | = | 7177 |
[from(x1)] | = | x1 + 25836 |
[s#(x1)] | = | 0 |
[first#(x1, x2)] | = | 0 |
[nil] | = | 14611 |
[mark(x1)] | = | x1 + 1 |
[first(x1, x2)] | = | x1 + x2 + 7435 |
[proper#(x1)] | = | 0 |
[from#(x1)] | = | 0 |
[active(x1)] | = | x1 + 0 |
[cons(x1, x2)] | = | x1 + 25835 |
[if#(x1, x2, x3)] | = | 0 |
[active#(x1)] | = | 0 |
[add#(x1, x2)] | = | 0 |
[add(x1, x2)] | = | x1 + x2 + 1 |
[and#(x1, x2)] | = | 0 |
first(mark(X1),X2) | → | mark(first(X1,X2)) | (18) |
active(if(false,X,Y)) | → | mark(Y) | (4) |
and(mark(X1),X2) | → | mark(and(X1,X2)) | (15) |
active(first(s(X),cons(Y,Z))) | → | mark(cons(Y,first(X,Z))) | (8) |
active(and(true,X)) | → | mark(X) | (1) |
active(if(true,X,Y)) | → | mark(X) | (3) |
if(mark(X1),X2,X3) | → | mark(if(X1,X2,X3)) | (16) |
proper(true) | → | ok(true) | (21) |
cons(ok(X1),ok(X2)) | → | ok(cons(X1,X2)) | (36) |
proper(s(X)) | → | s(proper(X)) | (26) |
first(X1,mark(X2)) | → | mark(first(X1,X2)) | (19) |
if(ok(X1),ok(X2),ok(X3)) | → | ok(if(X1,X2,X3)) | (32) |
add(mark(X1),X2) | → | mark(add(X1,X2)) | (17) |
proper(first(X1,X2)) | → | first(proper(X1),proper(X2)) | (27) |
s(ok(X)) | → | ok(s(X)) | (34) |
proper(false) | → | ok(false) | (22) |
proper(nil) | → | ok(nil) | (28) |
active(add(0,X)) | → | mark(X) | (5) |
add(ok(X1),ok(X2)) | → | ok(add(X1,X2)) | (33) |
active(and(X1,X2)) | → | and(active(X1),X2) | (10) |
active(first(0,X)) | → | mark(nil) | (7) |
proper(and(X1,X2)) | → | and(proper(X1),proper(X2)) | (20) |
proper(0) | → | ok(0) | (25) |
proper(from(X)) | → | from(proper(X)) | (30) |
active(first(X1,X2)) | → | first(X1,active(X2)) | (14) |
and(ok(X1),ok(X2)) | → | ok(and(X1,X2)) | (31) |
active(add(X1,X2)) | → | add(active(X1),X2) | (12) |
proper(if(X1,X2,X3)) | → | if(proper(X1),proper(X2),proper(X3)) | (23) |
proper(add(X1,X2)) | → | add(proper(X1),proper(X2)) | (24) |
active(if(X1,X2,X3)) | → | if(active(X1),X2,X3) | (11) |
active(from(X)) | → | mark(cons(X,from(s(X)))) | (9) |
active(first(X1,X2)) | → | first(active(X1),X2) | (13) |
active(add(s(X),Y)) | → | mark(s(add(X,Y))) | (6) |
from(ok(X)) | → | ok(from(X)) | (37) |
first(ok(X1),ok(X2)) | → | ok(first(X1,X2)) | (35) |
proper(cons(X1,X2)) | → | cons(proper(X1),proper(X2)) | (29) |
active(and(false,Y)) | → | mark(false) | (2) |
top#(mark(X)) | → | top#(proper(X)) | (52) |
The dependency pairs are split into 1 component.
top#(ok(X)) | → | top#(active(X)) | (77) |
[cons#(x1, x2)] | = | 0 |
[s(x1)] | = | x1 + 1 |
[top(x1)] | = | 0 |
[and(x1, x2)] | = | x2 + 240 |
[false] | = | 1 |
[top#(x1)] | = | x1 + 0 |
[true] | = | 1 |
[proper(x1)] | = | x1 + 4188 |
[ok(x1)] | = | x1 + 4188 |
[if(x1, x2, x3)] | = | x1 + 18825 |
[0] | = | 40512 |
[from(x1)] | = | x1 + 29007 |
[s#(x1)] | = | 0 |
[first#(x1, x2)] | = | 0 |
[nil] | = | 10336 |
[mark(x1)] | = | 1 |
[first(x1, x2)] | = | x2 + 1 |
[proper#(x1)] | = | 0 |
[from#(x1)] | = | 0 |
[active(x1)] | = | x1 + 1 |
[cons(x1, x2)] | = | x2 + 41927 |
[if#(x1, x2, x3)] | = | 0 |
[active#(x1)] | = | 0 |
[add#(x1, x2)] | = | 0 |
[add(x1, x2)] | = | x2 + 1 |
[and#(x1, x2)] | = | 0 |
first(mark(X1),X2) | → | mark(first(X1,X2)) | (18) |
active(if(false,X,Y)) | → | mark(Y) | (4) |
and(mark(X1),X2) | → | mark(and(X1,X2)) | (15) |
active(first(s(X),cons(Y,Z))) | → | mark(cons(Y,first(X,Z))) | (8) |
active(and(true,X)) | → | mark(X) | (1) |
active(if(true,X,Y)) | → | mark(X) | (3) |
if(mark(X1),X2,X3) | → | mark(if(X1,X2,X3)) | (16) |
proper(true) | → | ok(true) | (21) |
cons(ok(X1),ok(X2)) | → | ok(cons(X1,X2)) | (36) |
proper(s(X)) | → | s(proper(X)) | (26) |
first(X1,mark(X2)) | → | mark(first(X1,X2)) | (19) |
if(ok(X1),ok(X2),ok(X3)) | → | ok(if(X1,X2,X3)) | (32) |
add(mark(X1),X2) | → | mark(add(X1,X2)) | (17) |
proper(first(X1,X2)) | → | first(proper(X1),proper(X2)) | (27) |
s(ok(X)) | → | ok(s(X)) | (34) |
proper(false) | → | ok(false) | (22) |
proper(nil) | → | ok(nil) | (28) |
active(add(0,X)) | → | mark(X) | (5) |
add(ok(X1),ok(X2)) | → | ok(add(X1,X2)) | (33) |
active(and(X1,X2)) | → | and(active(X1),X2) | (10) |
active(first(0,X)) | → | mark(nil) | (7) |
proper(and(X1,X2)) | → | and(proper(X1),proper(X2)) | (20) |
proper(0) | → | ok(0) | (25) |
proper(from(X)) | → | from(proper(X)) | (30) |
active(first(X1,X2)) | → | first(X1,active(X2)) | (14) |
and(ok(X1),ok(X2)) | → | ok(and(X1,X2)) | (31) |
active(add(X1,X2)) | → | add(active(X1),X2) | (12) |
proper(if(X1,X2,X3)) | → | if(proper(X1),proper(X2),proper(X3)) | (23) |
proper(add(X1,X2)) | → | add(proper(X1),proper(X2)) | (24) |
active(if(X1,X2,X3)) | → | if(active(X1),X2,X3) | (11) |
active(from(X)) | → | mark(cons(X,from(s(X)))) | (9) |
active(first(X1,X2)) | → | first(active(X1),X2) | (13) |
active(add(s(X),Y)) | → | mark(s(add(X,Y))) | (6) |
from(ok(X)) | → | ok(from(X)) | (37) |
first(ok(X1),ok(X2)) | → | ok(first(X1,X2)) | (35) |
proper(cons(X1,X2)) | → | cons(proper(X1),proper(X2)) | (29) |
active(and(false,Y)) | → | mark(false) | (2) |
top#(ok(X)) | → | top#(active(X)) | (77) |
The dependency pairs are split into 0 components.
active#(add(X1,X2)) | → | active#(X1) | (67) |
active#(if(X1,X2,X3)) | → | active#(X1) | (85) |
active#(first(X1,X2)) | → | active#(X1) | (57) |
active#(first(X1,X2)) | → | active#(X2) | (75) |
active#(and(X1,X2)) | → | active#(X1) | (47) |
[cons#(x1, x2)] | = | 0 |
[s(x1)] | = | x1 + 0 |
[top(x1)] | = | 0 |
[and(x1, x2)] | = | x1 + 1 |
[false] | = | 59342 |
[top#(x1)] | = | 0 |
[true] | = | 1 |
[proper(x1)] | = | 0 |
[ok(x1)] | = | 0 |
[if(x1, x2, x3)] | = | x1 + 1 |
[0] | = | 13466 |
[from(x1)] | = | 1 |
[s#(x1)] | = | 0 |
[first#(x1, x2)] | = | 0 |
[nil] | = | 1 |
[mark(x1)] | = | 22072 |
[first(x1, x2)] | = | x1 + x2 + 0 |
[proper#(x1)] | = | 0 |
[from#(x1)] | = | 0 |
[active(x1)] | = | x1 + 22071 |
[cons(x1, x2)] | = | 1 |
[if#(x1, x2, x3)] | = | 0 |
[active#(x1)] | = | x1 + 0 |
[add#(x1, x2)] | = | 0 |
[add(x1, x2)] | = | x1 + 1 |
[and#(x1, x2)] | = | 0 |
first(mark(X1),X2) | → | mark(first(X1,X2)) | (18) |
active(if(false,X,Y)) | → | mark(Y) | (4) |
and(mark(X1),X2) | → | mark(and(X1,X2)) | (15) |
active(first(s(X),cons(Y,Z))) | → | mark(cons(Y,first(X,Z))) | (8) |
active(and(true,X)) | → | mark(X) | (1) |
active(if(true,X,Y)) | → | mark(X) | (3) |
if(mark(X1),X2,X3) | → | mark(if(X1,X2,X3)) | (16) |
proper(true) | → | ok(true) | (21) |
cons(ok(X1),ok(X2)) | → | ok(cons(X1,X2)) | (36) |
first(X1,mark(X2)) | → | mark(first(X1,X2)) | (19) |
if(ok(X1),ok(X2),ok(X3)) | → | ok(if(X1,X2,X3)) | (32) |
add(mark(X1),X2) | → | mark(add(X1,X2)) | (17) |
s(ok(X)) | → | ok(s(X)) | (34) |
proper(false) | → | ok(false) | (22) |
proper(nil) | → | ok(nil) | (28) |
active(add(0,X)) | → | mark(X) | (5) |
add(ok(X1),ok(X2)) | → | ok(add(X1,X2)) | (33) |
active(and(X1,X2)) | → | and(active(X1),X2) | (10) |
active(first(0,X)) | → | mark(nil) | (7) |
proper(0) | → | ok(0) | (25) |
active(first(X1,X2)) | → | first(X1,active(X2)) | (14) |
and(ok(X1),ok(X2)) | → | ok(and(X1,X2)) | (31) |
active(add(X1,X2)) | → | add(active(X1),X2) | (12) |
active(if(X1,X2,X3)) | → | if(active(X1),X2,X3) | (11) |
active(from(X)) | → | mark(cons(X,from(s(X)))) | (9) |
active(first(X1,X2)) | → | first(active(X1),X2) | (13) |
active(add(s(X),Y)) | → | mark(s(add(X,Y))) | (6) |
from(ok(X)) | → | ok(from(X)) | (37) |
first(ok(X1),ok(X2)) | → | ok(first(X1,X2)) | (35) |
active(and(false,Y)) | → | mark(false) | (2) |
active#(add(X1,X2)) | → | active#(X1) | (67) |
active#(if(X1,X2,X3)) | → | active#(X1) | (85) |
active#(and(X1,X2)) | → | active#(X1) | (47) |
The dependency pairs are split into 1 component.
active#(first(X1,X2)) | → | active#(X2) | (75) |
active#(first(X1,X2)) | → | active#(X1) | (57) |
[cons#(x1, x2)] | = | 0 |
[s(x1)] | = | x1 + 0 |
[top(x1)] | = | 0 |
[and(x1, x2)] | = | 12745 |
[false] | = | 1 |
[top#(x1)] | = | 0 |
[true] | = | 1 |
[proper(x1)] | = | 0 |
[ok(x1)] | = | 0 |
[if(x1, x2, x3)] | = | 1 |
[0] | = | 1 |
[from(x1)] | = | 1 |
[s#(x1)] | = | 0 |
[first#(x1, x2)] | = | 0 |
[nil] | = | 1 |
[mark(x1)] | = | 1 |
[first(x1, x2)] | = | x1 + x2 + 1 |
[proper#(x1)] | = | 0 |
[from#(x1)] | = | 0 |
[active(x1)] | = | 12744 |
[cons(x1, x2)] | = | 16892 |
[if#(x1, x2, x3)] | = | 0 |
[active#(x1)] | = | x1 + 0 |
[add#(x1, x2)] | = | 0 |
[add(x1, x2)] | = | 12745 |
[and#(x1, x2)] | = | 0 |
first(mark(X1),X2) | → | mark(first(X1,X2)) | (18) |
active(if(false,X,Y)) | → | mark(Y) | (4) |
and(mark(X1),X2) | → | mark(and(X1,X2)) | (15) |
active(first(s(X),cons(Y,Z))) | → | mark(cons(Y,first(X,Z))) | (8) |
active(and(true,X)) | → | mark(X) | (1) |
active(if(true,X,Y)) | → | mark(X) | (3) |
if(mark(X1),X2,X3) | → | mark(if(X1,X2,X3)) | (16) |
proper(true) | → | ok(true) | (21) |
cons(ok(X1),ok(X2)) | → | ok(cons(X1,X2)) | (36) |
first(X1,mark(X2)) | → | mark(first(X1,X2)) | (19) |
if(ok(X1),ok(X2),ok(X3)) | → | ok(if(X1,X2,X3)) | (32) |
add(mark(X1),X2) | → | mark(add(X1,X2)) | (17) |
s(ok(X)) | → | ok(s(X)) | (34) |
proper(false) | → | ok(false) | (22) |
proper(nil) | → | ok(nil) | (28) |
active(add(0,X)) | → | mark(X) | (5) |
add(ok(X1),ok(X2)) | → | ok(add(X1,X2)) | (33) |
active(first(0,X)) | → | mark(nil) | (7) |
proper(0) | → | ok(0) | (25) |
and(ok(X1),ok(X2)) | → | ok(and(X1,X2)) | (31) |
active(from(X)) | → | mark(cons(X,from(s(X)))) | (9) |
active(add(s(X),Y)) | → | mark(s(add(X,Y))) | (6) |
from(ok(X)) | → | ok(from(X)) | (37) |
first(ok(X1),ok(X2)) | → | ok(first(X1,X2)) | (35) |
active(and(false,Y)) | → | mark(false) | (2) |
active#(first(X1,X2)) | → | active#(X2) | (75) |
active#(first(X1,X2)) | → | active#(X1) | (57) |
The dependency pairs are split into 0 components.
proper#(add(X1,X2)) | → | proper#(X1) | (92) |
proper#(from(X)) | → | proper#(X) | (64) |
proper#(if(X1,X2,X3)) | → | proper#(X3) | (59) |
proper#(cons(X1,X2)) | → | proper#(X2) | (86) |
proper#(if(X1,X2,X3)) | → | proper#(X1) | (84) |
proper#(and(X1,X2)) | → | proper#(X1) | (80) |
proper#(add(X1,X2)) | → | proper#(X2) | (81) |
proper#(if(X1,X2,X3)) | → | proper#(X2) | (76) |
proper#(s(X)) | → | proper#(X) | (48) |
proper#(and(X1,X2)) | → | proper#(X2) | (72) |
proper#(first(X1,X2)) | → | proper#(X1) | (46) |
proper#(first(X1,X2)) | → | proper#(X2) | (45) |
proper#(cons(X1,X2)) | → | proper#(X1) | (40) |
[cons#(x1, x2)] | = | 0 |
[s(x1)] | = | x1 + 1 |
[top(x1)] | = | 0 |
[and(x1, x2)] | = | x1 + x2 + 1 |
[false] | = | 1 |
[top#(x1)] | = | 0 |
[true] | = | 0 |
[proper(x1)] | = | 0 |
[ok(x1)] | = | x1 + 0 |
[if(x1, x2, x3)] | = | x1 + x2 + x3 + 1 |
[0] | = | 0 |
[from(x1)] | = | x1 + 1 |
[s#(x1)] | = | 0 |
[first#(x1, x2)] | = | 0 |
[nil] | = | 0 |
[mark(x1)] | = | x1 + 9836 |
[first(x1, x2)] | = | x1 + x2 + 1 |
[proper#(x1)] | = | x1 + 0 |
[from#(x1)] | = | 0 |
[active(x1)] | = | x1 + 31093 |
[cons(x1, x2)] | = | x1 + x2 + 21256 |
[if#(x1, x2, x3)] | = | 0 |
[active#(x1)] | = | 0 |
[add#(x1, x2)] | = | 0 |
[add(x1, x2)] | = | x1 + x2 + 1 |
[and#(x1, x2)] | = | 0 |
first(mark(X1),X2) | → | mark(first(X1,X2)) | (18) |
active(if(false,X,Y)) | → | mark(Y) | (4) |
and(mark(X1),X2) | → | mark(and(X1,X2)) | (15) |
active(first(s(X),cons(Y,Z))) | → | mark(cons(Y,first(X,Z))) | (8) |
active(and(true,X)) | → | mark(X) | (1) |
active(if(true,X,Y)) | → | mark(X) | (3) |
if(mark(X1),X2,X3) | → | mark(if(X1,X2,X3)) | (16) |
proper(true) | → | ok(true) | (21) |
cons(ok(X1),ok(X2)) | → | ok(cons(X1,X2)) | (36) |
first(X1,mark(X2)) | → | mark(first(X1,X2)) | (19) |
if(ok(X1),ok(X2),ok(X3)) | → | ok(if(X1,X2,X3)) | (32) |
add(mark(X1),X2) | → | mark(add(X1,X2)) | (17) |
s(ok(X)) | → | ok(s(X)) | (34) |
proper(nil) | → | ok(nil) | (28) |
active(add(0,X)) | → | mark(X) | (5) |
add(ok(X1),ok(X2)) | → | ok(add(X1,X2)) | (33) |
active(first(0,X)) | → | mark(nil) | (7) |
proper(0) | → | ok(0) | (25) |
and(ok(X1),ok(X2)) | → | ok(and(X1,X2)) | (31) |
active(add(s(X),Y)) | → | mark(s(add(X,Y))) | (6) |
from(ok(X)) | → | ok(from(X)) | (37) |
first(ok(X1),ok(X2)) | → | ok(first(X1,X2)) | (35) |
active(and(false,Y)) | → | mark(false) | (2) |
proper#(add(X1,X2)) | → | proper#(X1) | (92) |
proper#(from(X)) | → | proper#(X) | (64) |
proper#(if(X1,X2,X3)) | → | proper#(X3) | (59) |
proper#(cons(X1,X2)) | → | proper#(X2) | (86) |
proper#(if(X1,X2,X3)) | → | proper#(X1) | (84) |
proper#(and(X1,X2)) | → | proper#(X1) | (80) |
proper#(add(X1,X2)) | → | proper#(X2) | (81) |
proper#(if(X1,X2,X3)) | → | proper#(X2) | (76) |
proper#(s(X)) | → | proper#(X) | (48) |
proper#(and(X1,X2)) | → | proper#(X2) | (72) |
proper#(first(X1,X2)) | → | proper#(X1) | (46) |
proper#(first(X1,X2)) | → | proper#(X2) | (45) |
proper#(cons(X1,X2)) | → | proper#(X1) | (40) |
The dependency pairs are split into 0 components.
cons#(ok(X1),ok(X2)) | → | cons#(X1,X2) | (50) |
[cons#(x1, x2)] | = | x2 + 0 |
[s(x1)] | = | x1 + 1 |
[top(x1)] | = | 0 |
[and(x1, x2)] | = | x1 + x2 + 1 |
[false] | = | 1 |
[top#(x1)] | = | 0 |
[true] | = | 0 |
[proper(x1)] | = | 0 |
[ok(x1)] | = | x1 + 1 |
[if(x1, x2, x3)] | = | x1 + x2 + x3 + 1 |
[0] | = | 0 |
[from(x1)] | = | x1 + 15538 |
[s#(x1)] | = | 0 |
[first#(x1, x2)] | = | 0 |
[nil] | = | 0 |
[mark(x1)] | = | x1 + 0 |
[first(x1, x2)] | = | x1 + 1 |
[proper#(x1)] | = | 0 |
[from#(x1)] | = | 0 |
[active(x1)] | = | x1 + 2 |
[cons(x1, x2)] | = | x1 + x2 + 1 |
[if#(x1, x2, x3)] | = | 0 |
[active#(x1)] | = | 0 |
[add#(x1, x2)] | = | 0 |
[add(x1, x2)] | = | x1 + x2 + 1 |
[and#(x1, x2)] | = | 0 |
first(mark(X1),X2) | → | mark(first(X1,X2)) | (18) |
active(if(false,X,Y)) | → | mark(Y) | (4) |
and(mark(X1),X2) | → | mark(and(X1,X2)) | (15) |
active(and(true,X)) | → | mark(X) | (1) |
active(if(true,X,Y)) | → | mark(X) | (3) |
if(mark(X1),X2,X3) | → | mark(if(X1,X2,X3)) | (16) |
cons(ok(X1),ok(X2)) | → | ok(cons(X1,X2)) | (36) |
first(X1,mark(X2)) | → | mark(first(X1,X2)) | (19) |
if(ok(X1),ok(X2),ok(X3)) | → | ok(if(X1,X2,X3)) | (32) |
add(mark(X1),X2) | → | mark(add(X1,X2)) | (17) |
s(ok(X)) | → | ok(s(X)) | (34) |
active(add(0,X)) | → | mark(X) | (5) |
add(ok(X1),ok(X2)) | → | ok(add(X1,X2)) | (33) |
active(first(0,X)) | → | mark(nil) | (7) |
and(ok(X1),ok(X2)) | → | ok(and(X1,X2)) | (31) |
active(add(s(X),Y)) | → | mark(s(add(X,Y))) | (6) |
from(ok(X)) | → | ok(from(X)) | (37) |
first(ok(X1),ok(X2)) | → | ok(first(X1,X2)) | (35) |
active(and(false,Y)) | → | mark(false) | (2) |
cons#(ok(X1),ok(X2)) | → | cons#(X1,X2) | (50) |
The dependency pairs are split into 0 components.
add#(ok(X1),ok(X2)) | → | add#(X1,X2) | (51) |
add#(mark(X1),X2) | → | add#(X1,X2) | (41) |
[cons#(x1, x2)] | = | 0 |
[s(x1)] | = | x1 + 1 |
[top(x1)] | = | 0 |
[and(x1, x2)] | = | x1 + x2 + 1 |
[false] | = | 1 |
[top#(x1)] | = | 0 |
[true] | = | 0 |
[proper(x1)] | = | 0 |
[ok(x1)] | = | x1 + 1 |
[if(x1, x2, x3)] | = | x1 + x2 + x3 + 1 |
[0] | = | 0 |
[from(x1)] | = | x1 + 22142 |
[s#(x1)] | = | 0 |
[first#(x1, x2)] | = | 0 |
[nil] | = | 0 |
[mark(x1)] | = | x1 + 0 |
[first(x1, x2)] | = | x1 + 1 |
[proper#(x1)] | = | 0 |
[from#(x1)] | = | 0 |
[active(x1)] | = | x1 + 2 |
[cons(x1, x2)] | = | x1 + x2 + 1 |
[if#(x1, x2, x3)] | = | 0 |
[active#(x1)] | = | 0 |
[add#(x1, x2)] | = | x2 + 0 |
[add(x1, x2)] | = | x1 + x2 + 1 |
[and#(x1, x2)] | = | 0 |
first(mark(X1),X2) | → | mark(first(X1,X2)) | (18) |
active(if(false,X,Y)) | → | mark(Y) | (4) |
and(mark(X1),X2) | → | mark(and(X1,X2)) | (15) |
active(and(true,X)) | → | mark(X) | (1) |
active(if(true,X,Y)) | → | mark(X) | (3) |
if(mark(X1),X2,X3) | → | mark(if(X1,X2,X3)) | (16) |
cons(ok(X1),ok(X2)) | → | ok(cons(X1,X2)) | (36) |
first(X1,mark(X2)) | → | mark(first(X1,X2)) | (19) |
if(ok(X1),ok(X2),ok(X3)) | → | ok(if(X1,X2,X3)) | (32) |
add(mark(X1),X2) | → | mark(add(X1,X2)) | (17) |
s(ok(X)) | → | ok(s(X)) | (34) |
active(add(0,X)) | → | mark(X) | (5) |
add(ok(X1),ok(X2)) | → | ok(add(X1,X2)) | (33) |
active(first(0,X)) | → | mark(nil) | (7) |
and(ok(X1),ok(X2)) | → | ok(and(X1,X2)) | (31) |
active(add(s(X),Y)) | → | mark(s(add(X,Y))) | (6) |
from(ok(X)) | → | ok(from(X)) | (37) |
first(ok(X1),ok(X2)) | → | ok(first(X1,X2)) | (35) |
active(and(false,Y)) | → | mark(false) | (2) |
add#(ok(X1),ok(X2)) | → | add#(X1,X2) | (51) |
The dependency pairs are split into 1 component.
add#(mark(X1),X2) | → | add#(X1,X2) | (41) |
[cons#(x1, x2)] | = | 0 |
[s(x1)] | = | x1 + 1 |
[top(x1)] | = | 0 |
[and(x1, x2)] | = | x1 + x2 + 1 |
[false] | = | 1 |
[top#(x1)] | = | 0 |
[true] | = | 0 |
[proper(x1)] | = | 0 |
[ok(x1)] | = | x1 + 1 |
[if(x1, x2, x3)] | = | x1 + x2 + x3 + 1 |
[0] | = | 0 |
[from(x1)] | = | x1 + 22142 |
[s#(x1)] | = | 0 |
[first#(x1, x2)] | = | 0 |
[nil] | = | 0 |
[mark(x1)] | = | x1 + 1 |
[first(x1, x2)] | = | x1 + 1 |
[proper#(x1)] | = | 0 |
[from#(x1)] | = | 0 |
[active(x1)] | = | x1 + 3 |
[cons(x1, x2)] | = | x1 + x2 + 1 |
[if#(x1, x2, x3)] | = | 0 |
[active#(x1)] | = | 0 |
[add#(x1, x2)] | = | x1 + 0 |
[add(x1, x2)] | = | x1 + x2 + 1 |
[and#(x1, x2)] | = | 0 |
active(if(false,X,Y)) | → | mark(Y) | (4) |
and(mark(X1),X2) | → | mark(and(X1,X2)) | (15) |
active(and(true,X)) | → | mark(X) | (1) |
active(if(true,X,Y)) | → | mark(X) | (3) |
if(mark(X1),X2,X3) | → | mark(if(X1,X2,X3)) | (16) |
cons(ok(X1),ok(X2)) | → | ok(cons(X1,X2)) | (36) |
if(ok(X1),ok(X2),ok(X3)) | → | ok(if(X1,X2,X3)) | (32) |
add(mark(X1),X2) | → | mark(add(X1,X2)) | (17) |
s(ok(X)) | → | ok(s(X)) | (34) |
active(add(0,X)) | → | mark(X) | (5) |
add(ok(X1),ok(X2)) | → | ok(add(X1,X2)) | (33) |
active(first(0,X)) | → | mark(nil) | (7) |
and(ok(X1),ok(X2)) | → | ok(and(X1,X2)) | (31) |
active(add(s(X),Y)) | → | mark(s(add(X,Y))) | (6) |
from(ok(X)) | → | ok(from(X)) | (37) |
active(and(false,Y)) | → | mark(false) | (2) |
add#(mark(X1),X2) | → | add#(X1,X2) | (41) |
The dependency pairs are split into 0 components.
from#(ok(X)) | → | from#(X) | (73) |
[cons#(x1, x2)] | = | 0 |
[s(x1)] | = | x1 + 1 |
[top(x1)] | = | 0 |
[and(x1, x2)] | = | x1 + x2 + 1 |
[false] | = | 1 |
[top#(x1)] | = | 0 |
[true] | = | 0 |
[proper(x1)] | = | 0 |
[ok(x1)] | = | x1 + 1 |
[if(x1, x2, x3)] | = | x1 + x2 + x3 + 1 |
[0] | = | 0 |
[from(x1)] | = | x1 + 22142 |
[s#(x1)] | = | 0 |
[first#(x1, x2)] | = | 0 |
[nil] | = | 0 |
[mark(x1)] | = | x1 + 1 |
[first(x1, x2)] | = | x1 + 1 |
[proper#(x1)] | = | 0 |
[from#(x1)] | = | x1 + 0 |
[active(x1)] | = | x1 + 3 |
[cons(x1, x2)] | = | x1 + x2 + 1 |
[if#(x1, x2, x3)] | = | 0 |
[active#(x1)] | = | 0 |
[add#(x1, x2)] | = | 0 |
[add(x1, x2)] | = | x1 + x2 + 1 |
[and#(x1, x2)] | = | 0 |
active(if(false,X,Y)) | → | mark(Y) | (4) |
and(mark(X1),X2) | → | mark(and(X1,X2)) | (15) |
active(and(true,X)) | → | mark(X) | (1) |
active(if(true,X,Y)) | → | mark(X) | (3) |
if(mark(X1),X2,X3) | → | mark(if(X1,X2,X3)) | (16) |
cons(ok(X1),ok(X2)) | → | ok(cons(X1,X2)) | (36) |
if(ok(X1),ok(X2),ok(X3)) | → | ok(if(X1,X2,X3)) | (32) |
add(mark(X1),X2) | → | mark(add(X1,X2)) | (17) |
s(ok(X)) | → | ok(s(X)) | (34) |
active(add(0,X)) | → | mark(X) | (5) |
add(ok(X1),ok(X2)) | → | ok(add(X1,X2)) | (33) |
active(first(0,X)) | → | mark(nil) | (7) |
and(ok(X1),ok(X2)) | → | ok(and(X1,X2)) | (31) |
active(add(s(X),Y)) | → | mark(s(add(X,Y))) | (6) |
from(ok(X)) | → | ok(from(X)) | (37) |
active(and(false,Y)) | → | mark(false) | (2) |
from#(ok(X)) | → | from#(X) | (73) |
The dependency pairs are split into 0 components.
and#(mark(X1),X2) | → | and#(X1,X2) | (65) |
and#(ok(X1),ok(X2)) | → | and#(X1,X2) | (82) |
[cons#(x1, x2)] | = | 0 |
[s(x1)] | = | x1 + 1 |
[top(x1)] | = | 0 |
[and(x1, x2)] | = | x1 + x2 + 1 |
[false] | = | 1 |
[top#(x1)] | = | 0 |
[true] | = | 0 |
[proper(x1)] | = | 0 |
[ok(x1)] | = | x1 + 1 |
[if(x1, x2, x3)] | = | x1 + x2 + x3 + 1 |
[0] | = | 0 |
[from(x1)] | = | x1 + 30478 |
[s#(x1)] | = | 0 |
[first#(x1, x2)] | = | 0 |
[nil] | = | 0 |
[mark(x1)] | = | x1 + 1 |
[first(x1, x2)] | = | x1 + 1 |
[proper#(x1)] | = | 0 |
[from#(x1)] | = | 0 |
[active(x1)] | = | x1 + 3 |
[cons(x1, x2)] | = | x1 + x2 + 1 |
[if#(x1, x2, x3)] | = | 0 |
[active#(x1)] | = | 0 |
[add#(x1, x2)] | = | 0 |
[add(x1, x2)] | = | x1 + x2 + 1 |
[and#(x1, x2)] | = | x1 + 0 |
active(if(false,X,Y)) | → | mark(Y) | (4) |
and(mark(X1),X2) | → | mark(and(X1,X2)) | (15) |
active(and(true,X)) | → | mark(X) | (1) |
active(if(true,X,Y)) | → | mark(X) | (3) |
if(mark(X1),X2,X3) | → | mark(if(X1,X2,X3)) | (16) |
cons(ok(X1),ok(X2)) | → | ok(cons(X1,X2)) | (36) |
if(ok(X1),ok(X2),ok(X3)) | → | ok(if(X1,X2,X3)) | (32) |
add(mark(X1),X2) | → | mark(add(X1,X2)) | (17) |
s(ok(X)) | → | ok(s(X)) | (34) |
active(add(0,X)) | → | mark(X) | (5) |
add(ok(X1),ok(X2)) | → | ok(add(X1,X2)) | (33) |
active(first(0,X)) | → | mark(nil) | (7) |
and(ok(X1),ok(X2)) | → | ok(and(X1,X2)) | (31) |
active(add(s(X),Y)) | → | mark(s(add(X,Y))) | (6) |
from(ok(X)) | → | ok(from(X)) | (37) |
active(and(false,Y)) | → | mark(false) | (2) |
and#(mark(X1),X2) | → | and#(X1,X2) | (65) |
and#(ok(X1),ok(X2)) | → | and#(X1,X2) | (82) |
The dependency pairs are split into 0 components.
first#(ok(X1),ok(X2)) | → | first#(X1,X2) | (90) |
first#(X1,mark(X2)) | → | first#(X1,X2) | (60) |
first#(mark(X1),X2) | → | first#(X1,X2) | (49) |
[cons#(x1, x2)] | = | 0 |
[s(x1)] | = | x1 + 1 |
[top(x1)] | = | 0 |
[and(x1, x2)] | = | x1 + x2 + 1 |
[false] | = | 1 |
[top#(x1)] | = | 0 |
[true] | = | 0 |
[proper(x1)] | = | 0 |
[ok(x1)] | = | x1 + 1 |
[if(x1, x2, x3)] | = | x1 + x2 + x3 + 1 |
[0] | = | 0 |
[from(x1)] | = | x1 + 30478 |
[s#(x1)] | = | 0 |
[first#(x1, x2)] | = | x1 + x2 + 0 |
[nil] | = | 0 |
[mark(x1)] | = | x1 + 1 |
[first(x1, x2)] | = | x1 + 1 |
[proper#(x1)] | = | 0 |
[from#(x1)] | = | 0 |
[active(x1)] | = | x1 + 3 |
[cons(x1, x2)] | = | x1 + x2 + 1 |
[if#(x1, x2, x3)] | = | 0 |
[active#(x1)] | = | 0 |
[add#(x1, x2)] | = | 0 |
[add(x1, x2)] | = | x1 + x2 + 1 |
[and#(x1, x2)] | = | 0 |
active(if(false,X,Y)) | → | mark(Y) | (4) |
and(mark(X1),X2) | → | mark(and(X1,X2)) | (15) |
active(and(true,X)) | → | mark(X) | (1) |
active(if(true,X,Y)) | → | mark(X) | (3) |
if(mark(X1),X2,X3) | → | mark(if(X1,X2,X3)) | (16) |
cons(ok(X1),ok(X2)) | → | ok(cons(X1,X2)) | (36) |
if(ok(X1),ok(X2),ok(X3)) | → | ok(if(X1,X2,X3)) | (32) |
add(mark(X1),X2) | → | mark(add(X1,X2)) | (17) |
s(ok(X)) | → | ok(s(X)) | (34) |
active(add(0,X)) | → | mark(X) | (5) |
add(ok(X1),ok(X2)) | → | ok(add(X1,X2)) | (33) |
active(first(0,X)) | → | mark(nil) | (7) |
and(ok(X1),ok(X2)) | → | ok(and(X1,X2)) | (31) |
active(add(s(X),Y)) | → | mark(s(add(X,Y))) | (6) |
from(ok(X)) | → | ok(from(X)) | (37) |
active(and(false,Y)) | → | mark(false) | (2) |
first#(ok(X1),ok(X2)) | → | first#(X1,X2) | (90) |
first#(X1,mark(X2)) | → | first#(X1,X2) | (60) |
first#(mark(X1),X2) | → | first#(X1,X2) | (49) |
The dependency pairs are split into 0 components.
s#(ok(X)) | → | s#(X) | (70) |
[cons#(x1, x2)] | = | 0 |
[s(x1)] | = | x1 + 1 |
[top(x1)] | = | 0 |
[and(x1, x2)] | = | x1 + x2 + 1 |
[false] | = | 1 |
[top#(x1)] | = | 0 |
[true] | = | 0 |
[proper(x1)] | = | 1 |
[ok(x1)] | = | x1 + 2 |
[if(x1, x2, x3)] | = | x1 + 1 |
[0] | = | 1 |
[from(x1)] | = | x1 + 1 |
[s#(x1)] | = | x1 + 0 |
[first#(x1, x2)] | = | 0 |
[nil] | = | 1 |
[mark(x1)] | = | x1 + 1 |
[first(x1, x2)] | = | x1 + 1 |
[proper#(x1)] | = | 0 |
[from#(x1)] | = | 0 |
[active(x1)] | = | x1 + 3 |
[cons(x1, x2)] | = | x1 + x2 + 1 |
[if#(x1, x2, x3)] | = | 0 |
[active#(x1)] | = | 0 |
[add#(x1, x2)] | = | 0 |
[add(x1, x2)] | = | x1 + x2 + 1 |
[and#(x1, x2)] | = | 0 |
and(mark(X1),X2) | → | mark(and(X1,X2)) | (15) |
active(and(true,X)) | → | mark(X) | (1) |
if(mark(X1),X2,X3) | → | mark(if(X1,X2,X3)) | (16) |
cons(ok(X1),ok(X2)) | → | ok(cons(X1,X2)) | (36) |
if(ok(X1),ok(X2),ok(X3)) | → | ok(if(X1,X2,X3)) | (32) |
add(mark(X1),X2) | → | mark(add(X1,X2)) | (17) |
s(ok(X)) | → | ok(s(X)) | (34) |
active(add(0,X)) | → | mark(X) | (5) |
add(ok(X1),ok(X2)) | → | ok(add(X1,X2)) | (33) |
active(first(0,X)) | → | mark(nil) | (7) |
and(ok(X1),ok(X2)) | → | ok(and(X1,X2)) | (31) |
active(add(s(X),Y)) | → | mark(s(add(X,Y))) | (6) |
from(ok(X)) | → | ok(from(X)) | (37) |
active(and(false,Y)) | → | mark(false) | (2) |
s#(ok(X)) | → | s#(X) | (70) |
The dependency pairs are split into 0 components.
if#(mark(X1),X2,X3) | → | if#(X1,X2,X3) | (66) |
if#(ok(X1),ok(X2),ok(X3)) | → | if#(X1,X2,X3) | (74) |
[cons#(x1, x2)] | = | 0 |
[s(x1)] | = | x1 + 1 |
[top(x1)] | = | 0 |
[and(x1, x2)] | = | x1 + x2 + 1 |
[false] | = | 1 |
[top#(x1)] | = | 0 |
[true] | = | 0 |
[proper(x1)] | = | 1 |
[ok(x1)] | = | x1 + 2 |
[if(x1, x2, x3)] | = | x1 + 1 |
[0] | = | 1 |
[from(x1)] | = | x1 + 1 |
[s#(x1)] | = | 0 |
[first#(x1, x2)] | = | 0 |
[nil] | = | 1 |
[mark(x1)] | = | x1 + 1 |
[first(x1, x2)] | = | x1 + 1 |
[proper#(x1)] | = | 0 |
[from#(x1)] | = | 0 |
[active(x1)] | = | x1 + 3 |
[cons(x1, x2)] | = | x1 + x2 + 1 |
[if#(x1, x2, x3)] | = | x2 + 0 |
[active#(x1)] | = | 0 |
[add#(x1, x2)] | = | 0 |
[add(x1, x2)] | = | x1 + x2 + 1 |
[and#(x1, x2)] | = | 0 |
and(mark(X1),X2) | → | mark(and(X1,X2)) | (15) |
active(and(true,X)) | → | mark(X) | (1) |
if(mark(X1),X2,X3) | → | mark(if(X1,X2,X3)) | (16) |
cons(ok(X1),ok(X2)) | → | ok(cons(X1,X2)) | (36) |
if(ok(X1),ok(X2),ok(X3)) | → | ok(if(X1,X2,X3)) | (32) |
add(mark(X1),X2) | → | mark(add(X1,X2)) | (17) |
s(ok(X)) | → | ok(s(X)) | (34) |
active(add(0,X)) | → | mark(X) | (5) |
add(ok(X1),ok(X2)) | → | ok(add(X1,X2)) | (33) |
active(first(0,X)) | → | mark(nil) | (7) |
and(ok(X1),ok(X2)) | → | ok(and(X1,X2)) | (31) |
active(add(s(X),Y)) | → | mark(s(add(X,Y))) | (6) |
from(ok(X)) | → | ok(from(X)) | (37) |
active(and(false,Y)) | → | mark(false) | (2) |
if#(ok(X1),ok(X2),ok(X3)) | → | if#(X1,X2,X3) | (74) |
The dependency pairs are split into 1 component.
if#(mark(X1),X2,X3) | → | if#(X1,X2,X3) | (66) |
[cons#(x1, x2)] | = | 0 |
[s(x1)] | = | x1 + 23720 |
[top(x1)] | = | 0 |
[and(x1, x2)] | = | 2 |
[false] | = | 1 |
[top#(x1)] | = | 0 |
[true] | = | 1 |
[proper(x1)] | = | 1 |
[ok(x1)] | = | 3 |
[if(x1, x2, x3)] | = | x1 + x2 + x3 + 1 |
[0] | = | 1 |
[from(x1)] | = | 2 |
[s#(x1)] | = | 0 |
[first#(x1, x2)] | = | 0 |
[nil] | = | 39802 |
[mark(x1)] | = | x1 + 27542 |
[first(x1, x2)] | = | 2 |
[proper#(x1)] | = | 0 |
[from#(x1)] | = | 0 |
[active(x1)] | = | 1 |
[cons(x1, x2)] | = | 2 |
[if#(x1, x2, x3)] | = | x1 + 0 |
[active#(x1)] | = | 0 |
[add#(x1, x2)] | = | 0 |
[add(x1, x2)] | = | 2 |
[and#(x1, x2)] | = | 0 |
if#(mark(X1),X2,X3) | → | if#(X1,X2,X3) | (66) |
The dependency pairs are split into 0 components.