The rewrite relation of the following TRS is considered.
first(0,X) | → | nil | (1) |
first(s(X),cons(Y,Z)) | → | cons(Y,n__first(X,activate(Z))) | (2) |
from(X) | → | cons(X,n__from(s(X))) | (3) |
first(X1,X2) | → | n__first(X1,X2) | (4) |
from(X) | → | n__from(X) | (5) |
activate(n__first(X1,X2)) | → | first(X1,X2) | (6) |
activate(n__from(X)) | → | from(X) | (7) |
activate(X) | → | X | (8) |
|
originates from |
|
||||||||
|
originates from |
|
||||||||
|
originates from |
|
||||||||
|
originates from |
|
||||||||
|
originates from |
|
||||||||
|
originates from |
|
||||||||
|
originates from |
|
||||||||
|
originates from |
|
first#(0,z0) |
first#(s(z0),cons(z1,z2)) |
first#(z0,z1) |
from#(z0) |
from#(z0) |
activate#(n__first(z0,z1)) |
activate#(n__from(z0)) |
activate#(z0) |
first(0,z0) | → | nil | (9) |
first(s(z0),cons(z1,z2)) | → | cons(z1,n__first(z0,activate(z2))) | (11) |
first(z0,z1) | → | n__first(z0,z1) | (13) |
from(z0) | → | cons(z0,n__from(s(z0))) | (15) |
from(z0) | → | n__from(z0) | (17) |
activate(n__first(z0,z1)) | → | first(z0,z1) | (19) |
activate(n__from(z0)) | → | from(z0) | (21) |
activate(z0) | → | z0 | (23) |
first#(0,z0) | → | c | (10) |
first#(s(z0),cons(z1,z2)) | → | c1(activate#(z2)) | (12) |
first#(z0,z1) | → | c2 | (14) |
from#(z0) | → | c3 | (16) |
from#(z0) | → | c4 | (18) |
activate#(n__first(z0,z1)) | → | c5(first#(z0,z1)) | (20) |
activate#(n__from(z0)) | → | c6(from#(z0)) | (22) |
activate#(z0) | → | c7 | (24) |
[c] | = | 0 |
[c1(x1)] | = | 1 · x1 + 0 |
[c2] | = | 0 |
[c3] | = | 0 |
[c4] | = | 0 |
[c5(x1)] | = | 1 · x1 + 0 |
[c6(x1)] | = | 1 · x1 + 0 |
[c7] | = | 0 |
[first#(x1, x2)] | = | 1 + 1 · x1 + 1 · x2 |
[from#(x1)] | = | 1 + 1 · x1 |
[activate#(x1)] | = | 1 + 1 · x1 |
[0] | = | 0 |
[s(x1)] | = | 1 |
[cons(x1, x2)] | = | 1 · x2 + 0 |
[n__first(x1, x2)] | = | 1 + 1 · x1 + 1 · x2 |
[n__from(x1)] | = | 1 + 1 · x1 |
first#(0,z0) | → | c | (10) |
first#(s(z0),cons(z1,z2)) | → | c1(activate#(z2)) | (12) |
first#(z0,z1) | → | c2 | (14) |
from#(z0) | → | c3 | (16) |
from#(z0) | → | c4 | (18) |
activate#(n__first(z0,z1)) | → | c5(first#(z0,z1)) | (20) |
activate#(n__from(z0)) | → | c6(from#(z0)) | (22) |
activate#(z0) | → | c7 | (24) |
There are no rules in the TRS R. Hence, R/S has complexity O(1).