The TRS could not be proven terminating. The proof attempt took 60010 ms.
Problem 1 remains open; application of the following processors failed [DependencyGraph (86ms), SubtermCriterion (0ms), DependencyGraph (60ms), PolynomialLinearRange4iUR (1828ms), DependencyGraph (47ms), PolynomialLinearRange8NegiUR (5843ms), DependencyGraph (44ms), ReductionPairSAT (timeout)].
| app#(app(treemap, f), app(app(node, x), xs)) | → | app#(map, app(treemap, f)) | app#(app(map, f), app(app(cons, x), xs)) | → | app#(f, x) | |
| app#(app(map, f), app(app(cons, x), xs)) | → | app#(app(cons, app(f, x)), app(app(map, f), xs)) | app#(app(treemap, f), app(app(node, x), xs)) | → | app#(treemap, f) | |
| app#(app(treemap, f), app(app(node, x), xs)) | → | app#(node, app(f, x)) | app#(app(treemap, f), app(app(node, x), xs)) | → | app#(app(node, app(f, x)), app(app(map, app(treemap, f)), xs)) | |
| app#(app(treemap, f), app(app(node, x), xs)) | → | app#(app(map, app(treemap, f)), xs) | app#(app(treemap, f), app(app(node, x), xs)) | → | app#(f, x) | |
| app#(app(map, f), app(app(cons, x), xs)) | → | app#(app(map, f), xs) | app#(app(map, f), app(app(cons, x), xs)) | → | app#(map, f) | |
| app#(app(map, f), app(app(cons, x), xs)) | → | app#(cons, app(f, x)) |
| app(app(map, f), nil) | → | nil | app(app(map, f), app(app(cons, x), xs)) | → | app(app(cons, app(f, x)), app(app(map, f), xs)) | |
| app(app(treemap, f), app(app(node, x), xs)) | → | app(app(node, app(f, x)), app(app(map, app(treemap, f)), xs)) |
Termination of terms over the following signature is verified: app, node, treemap, map, cons, nil