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