The rewrite relation of the following TRS is considered.
from(X) | → | cons(X,n__from(s(X))) | (1) |
2ndspos(0,Z) | → | rnil | (2) |
2ndspos(s(N),cons(X,n__cons(Y,Z))) | → | rcons(posrecip(activate(Y)),2ndsneg(N,activate(Z))) | (3) |
2ndsneg(0,Z) | → | rnil | (4) |
2ndsneg(s(N),cons(X,n__cons(Y,Z))) | → | rcons(negrecip(activate(Y)),2ndspos(N,activate(Z))) | (5) |
pi(X) | → | 2ndspos(X,from(0)) | (6) |
plus(0,Y) | → | Y | (7) |
plus(s(X),Y) | → | s(plus(X,Y)) | (8) |
times(0,Y) | → | 0 | (9) |
times(s(X),Y) | → | plus(Y,times(X,Y)) | (10) |
square(X) | → | times(X,X) | (11) |
from(X) | → | n__from(X) | (12) |
cons(X1,X2) | → | n__cons(X1,X2) | (13) |
activate(n__from(X)) | → | from(X) | (14) |
activate(n__cons(X1,X2)) | → | cons(X1,X2) | (15) |
activate(X) | → | X | (16) |
pi#(X) | → | from#(0) | (17) |
times#(s(X),Y) | → | times#(X,Y) | (18) |
from#(X) | → | cons#(X,n__from(s(X))) | (19) |
2ndsneg#(s(N),cons(X,n__cons(Y,Z))) | → | activate#(Z) | (20) |
2ndspos#(s(N),cons(X,n__cons(Y,Z))) | → | 2ndsneg#(N,activate(Z)) | (21) |
2ndspos#(s(N),cons(X,n__cons(Y,Z))) | → | activate#(Z) | (22) |
plus#(s(X),Y) | → | plus#(X,Y) | (23) |
2ndsneg#(s(N),cons(X,n__cons(Y,Z))) | → | activate#(Y) | (24) |
2ndspos#(s(N),cons(X,n__cons(Y,Z))) | → | activate#(Y) | (25) |
times#(s(X),Y) | → | plus#(Y,times(X,Y)) | (26) |
square#(X) | → | times#(X,X) | (27) |
pi#(X) | → | 2ndspos#(X,from(0)) | (28) |
2ndsneg#(s(N),cons(X,n__cons(Y,Z))) | → | 2ndspos#(N,activate(Z)) | (29) |
activate#(n__cons(X1,X2)) | → | cons#(X1,X2) | (30) |
activate#(n__from(X)) | → | from#(X) | (31) |
The dependency pairs are split into 3 components.
2ndsneg#(s(N),cons(X,n__cons(Y,Z))) | → | 2ndspos#(N,activate(Z)) | (29) |
2ndspos#(s(N),cons(X,n__cons(Y,Z))) | → | 2ndsneg#(N,activate(Z)) | (21) |
[negrecip(x1)] | = | 0 |
[cons#(x1, x2)] | = | 0 |
[s(x1)] | = | x1 + 1 |
[2ndspos(x1, x2)] | = | 0 |
[activate(x1)] | = | x1 + 16732 |
[rnil] | = | 0 |
[plus#(x1, x2)] | = | 0 |
[n__from(x1)] | = | x1 + 44083 |
[square(x1)] | = | 0 |
[activate#(x1)] | = | 0 |
[square#(x1)] | = | 0 |
[pi(x1)] | = | 0 |
[rcons(x1, x2)] | = | 0 |
[times#(x1, x2)] | = | 0 |
[0] | = | 0 |
[from(x1)] | = | x1 + 60815 |
[times(x1, x2)] | = | 0 |
[n__cons(x1, x2)] | = | x2 + 8366 |
[2ndsneg(x1, x2)] | = | 0 |
[plus(x1, x2)] | = | 0 |
[2ndspos#(x1, x2)] | = | x1 + x2 + 0 |
[from#(x1)] | = | 0 |
[cons(x1, x2)] | = | x2 + 8366 |
[pi#(x1)] | = | 0 |
[2ndsneg#(x1, x2)] | = | x1 + x2 + 0 |
[posrecip(x1)] | = | 0 |
activate(n__cons(X1,X2)) | → | cons(X1,X2) | (15) |
from(X) | → | cons(X,n__from(s(X))) | (1) |
activate(X) | → | X | (16) |
activate(n__from(X)) | → | from(X) | (14) |
from(X) | → | n__from(X) | (12) |
cons(X1,X2) | → | n__cons(X1,X2) | (13) |
2ndsneg#(s(N),cons(X,n__cons(Y,Z))) | → | 2ndspos#(N,activate(Z)) | (29) |
2ndspos#(s(N),cons(X,n__cons(Y,Z))) | → | 2ndsneg#(N,activate(Z)) | (21) |
The dependency pairs are split into 0 components.
times#(s(X),Y) | → | times#(X,Y) | (18) |
[negrecip(x1)] | = | 0 |
[cons#(x1, x2)] | = | 0 |
[s(x1)] | = | x1 + 44083 |
[2ndspos(x1, x2)] | = | 0 |
[activate(x1)] | = | x1 + 93511 |
[rnil] | = | 0 |
[plus#(x1, x2)] | = | 0 |
[n__from(x1)] | = | x1 + 1 |
[square(x1)] | = | 0 |
[activate#(x1)] | = | 0 |
[square#(x1)] | = | 0 |
[pi(x1)] | = | 0 |
[rcons(x1, x2)] | = | 0 |
[times#(x1, x2)] | = | x1 + 0 |
[0] | = | 0 |
[from(x1)] | = | x1 + 93512 |
[times(x1, x2)] | = | 0 |
[n__cons(x1, x2)] | = | x2 + 41063 |
[2ndsneg(x1, x2)] | = | 0 |
[plus(x1, x2)] | = | 0 |
[2ndspos#(x1, x2)] | = | x2 + 0 |
[from#(x1)] | = | 0 |
[cons(x1, x2)] | = | x2 + 41063 |
[pi#(x1)] | = | 0 |
[2ndsneg#(x1, x2)] | = | x2 + 0 |
[posrecip(x1)] | = | 0 |
activate(n__cons(X1,X2)) | → | cons(X1,X2) | (15) |
from(X) | → | cons(X,n__from(s(X))) | (1) |
activate(X) | → | X | (16) |
activate(n__from(X)) | → | from(X) | (14) |
from(X) | → | n__from(X) | (12) |
cons(X1,X2) | → | n__cons(X1,X2) | (13) |
times#(s(X),Y) | → | times#(X,Y) | (18) |
The dependency pairs are split into 0 components.
plus#(s(X),Y) | → | plus#(X,Y) | (23) |
[negrecip(x1)] | = | 0 |
[cons#(x1, x2)] | = | 0 |
[s(x1)] | = | x1 + 1 |
[2ndspos(x1, x2)] | = | 0 |
[activate(x1)] | = | x1 + 49429 |
[rnil] | = | 0 |
[plus#(x1, x2)] | = | x1 + 0 |
[n__from(x1)] | = | x1 + 33954 |
[square(x1)] | = | 0 |
[activate#(x1)] | = | 0 |
[square#(x1)] | = | 0 |
[pi(x1)] | = | 0 |
[rcons(x1, x2)] | = | 0 |
[times#(x1, x2)] | = | 0 |
[0] | = | 0 |
[from(x1)] | = | x1 + 83383 |
[times(x1, x2)] | = | 0 |
[n__cons(x1, x2)] | = | x2 + 41063 |
[2ndsneg(x1, x2)] | = | 0 |
[plus(x1, x2)] | = | 0 |
[2ndspos#(x1, x2)] | = | x2 + 0 |
[from#(x1)] | = | 0 |
[cons(x1, x2)] | = | x2 + 41063 |
[pi#(x1)] | = | 0 |
[2ndsneg#(x1, x2)] | = | x2 + 0 |
[posrecip(x1)] | = | 0 |
activate(n__cons(X1,X2)) | → | cons(X1,X2) | (15) |
from(X) | → | cons(X,n__from(s(X))) | (1) |
activate(X) | → | X | (16) |
activate(n__from(X)) | → | from(X) | (14) |
from(X) | → | n__from(X) | (12) |
cons(X1,X2) | → | n__cons(X1,X2) | (13) |
plus#(s(X),Y) | → | plus#(X,Y) | (23) |
The dependency pairs are split into 0 components.