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