The TRS could be proven terminating. The proof took 56 ms.
Problem 1 was processed with processor SubtermCriterion (1ms).
| a#(b(x)) | → | a#(x) |
| a(b(x)) | → | b(a(x)) | a(c(x)) | → | x |
Termination of terms over the following signature is verified: b, c, a
The following projection was used:
Thus, the following dependency pairs are removed:
| a#(b(x)) | → | a#(x) |