The TRS could not be proven terminating. The proof attempt took 60002 ms.
Problem 1 remains open; application of the following processors failed [DependencyGraph (128ms), SubtermCriterion (1ms), DependencyGraph (89ms), PolynomialLinearRange4iUR (2582ms), DependencyGraph (88ms), PolynomialLinearRange8NegiUR (7454ms), DependencyGraph (121ms), ReductionPairSAT (timeout)].
| app#(app(div, app(s, x)), app(s, y)) | → | app#(div, app(app(minus, x), y)) | app#(app(map, f), app(app(cons, x), xs)) | → | app#(app(cons, app(f, x)), app(app(map, f), xs)) | |
| app#(app(map, f), app(app(cons, x), xs)) | → | app#(f, x) | app#(app(div, app(s, x)), app(s, y)) | → | app#(s, y) | |
| app#(app(minus, app(s, x)), app(s, y)) | → | app#(minus, x) | app#(app(map, f), app(app(cons, x), xs)) | → | app#(app(map, f), xs) | |
| app#(app(div, app(s, x)), app(s, y)) | → | app#(app(minus, x), y) | app#(app(div, app(s, x)), app(s, y)) | → | app#(app(div, app(app(minus, x), y)), app(s, y)) | |
| app#(app(minus, app(s, x)), app(s, y)) | → | app#(app(minus, x), y) | app#(app(div, app(s, x)), app(s, y)) | → | app#(minus, x) | |
| app#(app(map, f), app(app(cons, x), xs)) | → | app#(cons, app(f, x)) | app#(app(map, f), app(app(cons, x), xs)) | → | app#(map, f) | |
| app#(app(div, app(s, x)), app(s, y)) | → | app#(s, app(app(div, app(app(minus, x), y)), app(s, y))) |
| 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(minus, x), 0) | → | x | app(app(minus, app(s, x)), app(s, y)) | → | app(app(minus, x), y) | |
| app(app(div, 0), app(s, y)) | → | 0 | app(app(div, app(s, x)), app(s, y)) | → | app(s, app(app(div, app(app(minus, x), y)), app(s, y))) |
Termination of terms over the following signature is verified: app, 0, minus, s, div, map, cons, nil