YES
by Hakusan
The rewrite relation of the following TRS is considered.
c(c(x)) | → | b(b(x)) |
a(a(x)) | → | b(a(x)) |
c(c(x)) | → | a(a(x)) |
b(b(x)) | → | c(b(x)) |
b(c(x)) | → | a(c(x)) |
a(a(x)) | → | a(a(x)) |
a(a(x)) | → | b(c(x)) |
b(c(x)) | → | b(a(x)) |
a(a(x)) | → | c(b(x)) |
b(b(x)) | → | c(c(x)) |
c(b(x)) | → | c(c(x)) |
a(c(x)) | → | b(c(x)) |
c(b(x)) | → | a(c(x)) |
b(b(x)) | → | b(b(x)) |
c(b(x)) | → | b(c(x)) |
b(c(x)) | → | b(c(x)) |
c(a(x)) | → | a(a(x)) |
a(c(x)) | → | c(a(x)) |
a(b(x)) | → | a(a(x)) |
c(c(x)) | → | a(a(x)) |
c(c(x)) | → | b(b(x)) |
a(a(x)) | → | b(a(x)) |
c(c(x)) | → | a(a(x)) |
b(b(x)) | → | c(b(x)) |
b(c(x)) | → | a(c(x)) |
a(a(x)) | → | b(c(x)) |
b(c(x)) | → | b(a(x)) |
a(a(x)) | → | c(b(x)) |
b(b(x)) | → | c(c(x)) |
c(b(x)) | → | c(c(x)) |
a(c(x)) | → | b(c(x)) |
c(b(x)) | → | a(c(x)) |
b(b(x)) | → | b(b(x)) |
c(b(x)) | → | b(c(x)) |
b(c(x)) | → | b(c(x)) |
c(a(x)) | → | a(a(x)) |
a(c(x)) | → | c(a(x)) |
a(b(x)) | → | a(a(x)) |
c(c(x)) | → | a(a(x)) |
c(c(x)) | → | b(b(x)) |
a(a(x)) | → | b(a(x)) |
c(c(x)) | → | a(a(x)) |
b(b(x)) | → | c(b(x)) |
b(c(x)) | → | a(c(x)) |
a(a(x)) | → | b(c(x)) |
b(c(x)) | → | b(a(x)) |
a(a(x)) | → | c(b(x)) |
b(b(x)) | → | c(c(x)) |
c(b(x)) | → | c(c(x)) |
a(c(x)) | → | b(c(x)) |
c(b(x)) | → | a(c(x)) |
c(b(x)) | → | b(c(x)) |
b(c(x)) | → | b(c(x)) |
c(a(x)) | → | a(a(x)) |
a(c(x)) | → | c(a(x)) |
a(b(x)) | → | a(a(x)) |
c(c(x)) | → | a(a(x)) |
c(c(x)) | → | b(b(x)) |
a(a(x)) | → | b(a(x)) |
c(c(x)) | → | a(a(x)) |
b(b(x)) | → | c(b(x)) |
b(c(x)) | → | a(c(x)) |
a(a(x)) | → | b(c(x)) |
b(c(x)) | → | b(a(x)) |
a(a(x)) | → | c(b(x)) |
b(b(x)) | → | c(c(x)) |
c(b(x)) | → | c(c(x)) |
a(c(x)) | → | b(c(x)) |
c(b(x)) | → | a(c(x)) |
c(b(x)) | → | b(c(x)) |
c(a(x)) | → | a(a(x)) |
a(c(x)) | → | c(a(x)) |
a(b(x)) | → | a(a(x)) |
c(c(x)) | → | a(a(x)) |
There are no rules.
Hakusan