The TRS could not be proven terminating. The proof attempt took 60000 ms.
Problem 1 remains open; application of the following processors failed [DependencyGraph (408ms), SubtermCriterion (1ms), DependencyGraph (325ms), PolynomialLinearRange4iUR (5408ms), DependencyGraph (254ms), PolynomialLinearRange8NegiUR (12151ms), DependencyGraph (229ms), ReductionPairSAT (timeout)].
| ap#(dropLast, ap(ap(cons, x), ap(ap(cons, y), ys))) | → | ap#(cons, x) | ap#(dropLast, ap(ap(cons, x), ap(ap(cons, y), ys))) | → | ap#(ap(cons, x), ap(dropLast, ap(ap(cons, y), ys))) | |
| ap#(last, ap(ap(cons, x), ap(ap(cons, y), ys))) | → | ap#(cons, y) | ap#(ap(map, f), xs) | → | ap#(ap(ap(if, ap(isEmpty, xs)), f), xs) | |
| ap#(ap(map, f), xs) | → | ap#(ap(if, ap(isEmpty, xs)), f) | ap#(ap(ap(if, null), f), xs) | → | ap#(ap(cons, ap(f, ap(last, xs))), ap(ap(if2, f), xs)) | |
| ap#(ap(if2, f), xs) | → | ap#(ap(map, f), ap(dropLast, xs)) | ap#(ap(ap(if, null), f), xs) | → | ap#(last, xs) | |
| ap#(last, ap(ap(cons, x), ap(ap(cons, y), ys))) | → | ap#(ap(cons, y), ys) | ap#(dropLast, ap(ap(cons, x), ap(ap(cons, y), ys))) | → | ap#(dropLast, ap(ap(cons, y), ys)) | |
| ap#(ap(map, f), xs) | → | ap#(if, ap(isEmpty, xs)) | ap#(ap(ap(if, null), f), xs) | → | ap#(cons, ap(f, ap(last, xs))) | |
| ap#(dropLast, ap(ap(cons, x), ap(ap(cons, y), ys))) | → | ap#(ap(cons, y), ys) | ap#(ap(ap(if, null), f), xs) | → | ap#(ap(if2, f), xs) | |
| ap#(last, ap(ap(cons, x), ap(ap(cons, y), ys))) | → | ap#(last, ap(ap(cons, y), ys)) | ap#(ap(ap(if, null), f), xs) | → | ap#(f, ap(last, xs)) | |
| ap#(ap(if2, f), xs) | → | ap#(dropLast, xs) | ap#(ap(ap(if, null), f), xs) | → | ap#(if2, f) | |
| ap#(ap(map, f), xs) | → | ap#(isEmpty, xs) | ap#(dropLast, ap(ap(cons, x), ap(ap(cons, y), ys))) | → | ap#(cons, y) | |
| ap#(ap(if2, f), xs) | → | ap#(map, f) |
| ap(ap(map, f), xs) | → | ap(ap(ap(if, ap(isEmpty, xs)), f), xs) | ap(ap(ap(if, true), f), xs) | → | null | |
| ap(ap(ap(if, null), f), xs) | → | ap(ap(cons, ap(f, ap(last, xs))), ap(ap(if2, f), xs)) | ap(ap(if2, f), xs) | → | ap(ap(map, f), ap(dropLast, xs)) | |
| ap(isEmpty, null) | → | true | ap(isEmpty, ap(ap(cons, x), xs)) | → | null | |
| ap(last, ap(ap(cons, x), null)) | → | x | ap(last, ap(ap(cons, x), ap(ap(cons, y), ys))) | → | ap(last, ap(ap(cons, y), ys)) | |
| ap(dropLast, ap(ap(cons, x), null)) | → | null | ap(dropLast, ap(ap(cons, x), ap(ap(cons, y), ys))) | → | ap(ap(cons, x), ap(dropLast, ap(ap(cons, y), ys))) |
Termination of terms over the following signature is verified: isEmpty, dropLast, last, ap, if, map, true, if2, null, cons