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