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