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