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