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