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