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