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