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