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