The TRS could be proven terminating. The proof took 17 ms.
Problem 1 was processed with processor DependencyGraph (4ms).
| minux#(+(x, y)) | → | +#(minus(y), minus(x)) | minux#(+(x, y)) | → | minus#(y) | |
| minux#(+(x, y)) | → | minus#(x) |
| minus(minus(x)) | → | x | minux(+(x, y)) | → | +(minus(y), minus(x)) | |
| +(minus(x), +(x, y)) | → | y | +(+(x, y), minus(y)) | → | x |
Termination of terms over the following signature is verified: minus, minux, +