mark#(zip(X1,X2)) |
→ |
mark#(X2) |
(56) |
mark#(repItems(X)) |
→ |
a__repItems#(mark(X)) |
(40) |
mark#(incr(X)) |
→ |
mark#(X) |
(55) |
mark#(cons(X1,X2)) |
→ |
mark#(X1) |
(39) |
mark#(s(X)) |
→ |
mark#(X) |
(54) |
mark#(tail(X)) |
→ |
a__tail#(mark(X)) |
(38) |
mark#(pair(X1,X2)) |
→ |
mark#(X2) |
(53) |
a__oddNs# |
→ |
a__incr#(a__pairNs) |
(52) |
mark#(take(X1,X2)) |
→ |
mark#(X1) |
(37) |
mark#(incr(X)) |
→ |
a__incr#(mark(X)) |
(51) |
mark#(take(X1,X2)) |
→ |
mark#(X2) |
(36) |
mark#(zip(X1,X2)) |
→ |
a__zip#(mark(X1),mark(X2)) |
(50) |
a__zip#(cons(X,XS),cons(Y,YS)) |
→ |
mark#(Y) |
(49) |
mark#(repItems(X)) |
→ |
mark#(X) |
(48) |
a__take#(s(N),cons(X,XS)) |
→ |
mark#(X) |
(35) |
mark#(tail(X)) |
→ |
mark#(X) |
(33) |
a__incr#(cons(X,XS)) |
→ |
mark#(X) |
(47) |
mark#(zip(X1,X2)) |
→ |
mark#(X1) |
(46) |
a__repItems#(cons(X,XS)) |
→ |
mark#(X) |
(32) |
mark#(take(X1,X2)) |
→ |
a__take#(mark(X1),mark(X2)) |
(45) |
a__tail#(cons(X,XS)) |
→ |
mark#(XS) |
(44) |
mark#(oddNs) |
→ |
a__oddNs# |
(43) |
mark#(pair(X1,X2)) |
→ |
mark#(X1) |
(42) |
a__zip#(cons(X,XS),cons(Y,YS)) |
→ |
mark#(X) |
(41) |
[repItems(x1)] |
=
|
x1 + 17069 |
[incr(x1)] |
=
|
x1 + 0 |
[s(x1)] |
=
|
x1 + 0 |
[a__zip#(x1, x2)] |
=
|
max(x1 + 47645, x2 + 17067, 0) |
[a__incr(x1)] |
=
|
x1 + 0 |
[take(x1, x2)] |
=
|
max(x1 + 17069, x2 + 17069, 0) |
[pair(x1, x2)] |
=
|
max(x1 + 13506, x2 + 13507, 0) |
[a__take#(x1, x2)] |
=
|
max(x1 + 17067, x2 + 17069, 0) |
[a__pairNs#] |
=
|
0 |
[tail(x1)] |
=
|
x1 + 7631 |
[mark#(x1)] |
=
|
x1 + 17068 |
[0] |
=
|
41054 |
[a__repItems(x1)] |
=
|
x1 + 17069 |
[nil] |
=
|
7320 |
[a__oddNs#] |
=
|
58124 |
[mark(x1)] |
=
|
x1 + 0 |
[pairNs] |
=
|
58123 |
[a__zip(x1, x2)] |
=
|
max(x1 + 30578, x2 + 30576, 0) |
[a__repItems#(x1)] |
=
|
x1 + 17069 |
[oddNs] |
=
|
58123 |
[a__incr#(x1)] |
=
|
x1 + 0 |
[cons(x1, x2)] |
=
|
max(x1 + 17069, x2 + 0, 0) |
[a__oddNs] |
=
|
58123 |
[a__take(x1, x2)] |
=
|
max(x1 + 17069, x2 + 17069, 0) |
[a__pairNs] |
=
|
58123 |
[a__tail(x1)] |
=
|
x1 + 7631 |
[a__tail#(x1)] |
=
|
x1 + 17069 |
[zip(x1, x2)] |
=
|
max(x1 + 30578, x2 + 30576, 0) |
together with the usable
rules
mark(repItems(X)) |
→ |
a__repItems(mark(X)) |
(18) |
a__take(0,XS) |
→ |
nil |
(4) |
mark(take(X1,X2)) |
→ |
a__take(mark(X1),mark(X2)) |
(15) |
a__zip(cons(X,XS),cons(Y,YS)) |
→ |
cons(pair(mark(X),mark(Y)),zip(XS,YS)) |
(8) |
a__pairNs |
→ |
cons(0,incr(oddNs)) |
(1) |
a__incr(cons(X,XS)) |
→ |
cons(s(mark(X)),incr(XS)) |
(3) |
mark(zip(X1,X2)) |
→ |
a__zip(mark(X1),mark(X2)) |
(16) |
mark(s(X)) |
→ |
s(mark(X)) |
(21) |
a__oddNs |
→ |
oddNs |
(26) |
mark(cons(X1,X2)) |
→ |
cons(mark(X1),X2) |
(19) |
mark(tail(X)) |
→ |
a__tail(mark(X)) |
(17) |
a__take(X1,X2) |
→ |
take(X1,X2) |
(27) |
mark(nil) |
→ |
nil |
(22) |
a__zip(X1,X2) |
→ |
zip(X1,X2) |
(28) |
a__take(s(N),cons(X,XS)) |
→ |
cons(mark(X),take(N,XS)) |
(5) |
a__repItems(nil) |
→ |
nil |
(10) |
a__zip(X,nil) |
→ |
nil |
(7) |
mark(0) |
→ |
0 |
(20) |
a__incr(X) |
→ |
incr(X) |
(25) |
a__repItems(X) |
→ |
repItems(X) |
(30) |
mark(oddNs) |
→ |
a__oddNs |
(14) |
mark(pairNs) |
→ |
a__pairNs |
(12) |
mark(pair(X1,X2)) |
→ |
pair(mark(X1),mark(X2)) |
(23) |
a__pairNs |
→ |
pairNs |
(24) |
a__repItems(cons(X,XS)) |
→ |
cons(mark(X),cons(X,repItems(XS))) |
(11) |
a__tail(cons(X,XS)) |
→ |
mark(XS) |
(9) |
mark(incr(X)) |
→ |
a__incr(mark(X)) |
(13) |
a__zip(nil,XS) |
→ |
nil |
(6) |
a__tail(X) |
→ |
tail(X) |
(29) |
a__oddNs |
→ |
a__incr(a__pairNs) |
(2) |
(w.r.t. the implicit argument filter of the reduction pair),
the
pairs
mark#(zip(X1,X2)) |
→ |
mark#(X2) |
(56) |
mark#(repItems(X)) |
→ |
a__repItems#(mark(X)) |
(40) |
mark#(cons(X1,X2)) |
→ |
mark#(X1) |
(39) |
mark#(tail(X)) |
→ |
a__tail#(mark(X)) |
(38) |
mark#(pair(X1,X2)) |
→ |
mark#(X2) |
(53) |
a__oddNs# |
→ |
a__incr#(a__pairNs) |
(52) |
mark#(take(X1,X2)) |
→ |
mark#(X1) |
(37) |
mark#(incr(X)) |
→ |
a__incr#(mark(X)) |
(51) |
mark#(take(X1,X2)) |
→ |
mark#(X2) |
(36) |
mark#(zip(X1,X2)) |
→ |
a__zip#(mark(X1),mark(X2)) |
(50) |
a__zip#(cons(X,XS),cons(Y,YS)) |
→ |
mark#(Y) |
(49) |
mark#(repItems(X)) |
→ |
mark#(X) |
(48) |
a__take#(s(N),cons(X,XS)) |
→ |
mark#(X) |
(35) |
mark#(tail(X)) |
→ |
mark#(X) |
(33) |
a__incr#(cons(X,XS)) |
→ |
mark#(X) |
(47) |
mark#(zip(X1,X2)) |
→ |
mark#(X1) |
(46) |
a__repItems#(cons(X,XS)) |
→ |
mark#(X) |
(32) |
mark#(take(X1,X2)) |
→ |
a__take#(mark(X1),mark(X2)) |
(45) |
a__tail#(cons(X,XS)) |
→ |
mark#(XS) |
(44) |
mark#(oddNs) |
→ |
a__oddNs# |
(43) |
mark#(pair(X1,X2)) |
→ |
mark#(X1) |
(42) |
a__zip#(cons(X,XS),cons(Y,YS)) |
→ |
mark#(X) |
(41) |
could be deleted.
The dependency pairs are split into 1
component.