The rewrite relation of the following TRS is considered.
| f(f(x)) | → | f(c(f(x))) | (1) |
| f(f(x)) | → | f(d(f(x))) | (2) |
| g(c(x)) | → | x | (3) |
| g(d(x)) | → | x | (4) |
| g(c(0)) | → | g(d(1)) | (5) |
| g(c(1)) | → | g(d(0)) | (6) |
| g#(c(1)) | → | g#(d(0)) | (7) |
| g#(c(0)) | → | g#(d(1)) | (8) |
| f#(f(x)) | → | f#(d(f(x))) | (9) |
| f#(f(x)) | → | f#(c(f(x))) | (10) |
The dependency pairs are split into 0 components.