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