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