The rewrite relation of the following TRS is considered.
a(x1) | → | b(x1) | (1) |
a(b(b(x1))) | → | c(x1) | (2) |
c(c(x1)) | → | a(b(c(a(x1)))) | (3) |
a#(b(b(x1))) | → | c#(x1) | (4) |
c#(c(x1)) | → | a#(x1) | (5) |
c#(c(x1)) | → | c#(a(x1)) | (6) |
c#(c(x1)) | → | a#(b(c(a(x1)))) | (7) |
[c#(x1)] | = | 2 · x1 + -∞ |
[b(x1)] | = | 1 · x1 + -∞ |
[a#(x1)] | = | 0 · x1 + -∞ |
[a(x1)] | = | 1 · x1 + -∞ |
[c(x1)] | = | 3 · x1 + -∞ |
a(x1) | → | b(x1) | (1) |
a(b(b(x1))) | → | c(x1) | (2) |
c(c(x1)) | → | a(b(c(a(x1)))) | (3) |
c#(c(x1)) | → | a#(x1) | (5) |
c#(c(x1)) | → | c#(a(x1)) | (6) |
[c#(x1)] | = |
|
||||||||||||||||||||||||
[b(x1)] | = |
|
||||||||||||||||||||||||
[a#(x1)] | = |
|
||||||||||||||||||||||||
[a(x1)] | = |
|
||||||||||||||||||||||||
[c(x1)] | = |
|
a(x1) | → | b(x1) | (1) |
a(b(b(x1))) | → | c(x1) | (2) |
c(c(x1)) | → | a(b(c(a(x1)))) | (3) |
a#(b(b(x1))) | → | c#(x1) | (4) |
The dependency pairs are split into 0 components.