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