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