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