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