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