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