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