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