Term Rewriting System R:
[f, x, xs, 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(sum, app(app(cons, x), xs)) -> app(app(plus, x), app(sum, xs))
app(size, app(app(node, x), xs)) -> app(s, app(sum, app(app(map, size), xs)))
app(app(plus, 0), x) -> 0
app(app(plus, app(s, x)), y) -> app(s, app(app(plus, x), y))

Innermost Termination of R to be shown.



   R
Dependency Pair Analysis



R contains the following Dependency Pairs:

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(cons, app(f, x))
APP(app(map, f), app(app(cons, x), xs)) -> APP(f, x)
APP(app(map, f), app(app(cons, x), xs)) -> APP(app(map, f), xs)
APP(sum, app(app(cons, x), xs)) -> APP(app(plus, x), app(sum, xs))
APP(sum, app(app(cons, x), xs)) -> APP(plus, x)
APP(sum, app(app(cons, x), xs)) -> APP(sum, xs)
APP(size, app(app(node, x), xs)) -> APP(s, app(sum, app(app(map, size), xs)))
APP(size, app(app(node, x), xs)) -> APP(sum, app(app(map, size), xs))
APP(size, app(app(node, x), xs)) -> APP(app(map, size), xs)
APP(size, app(app(node, x), xs)) -> APP(map, size)
APP(app(plus, app(s, x)), y) -> APP(s, app(app(plus, x), y))
APP(app(plus, app(s, x)), y) -> APP(app(plus, x), y)
APP(app(plus, app(s, x)), y) -> APP(plus, x)

Furthermore, R contains one SCC.


   R
DPs
       →DP Problem 1
Remaining Obligation(s)




The following remains to be proven:
Dependency Pairs:

APP(app(plus, app(s, x)), y) -> APP(app(plus, x), y)
APP(size, app(app(node, x), xs)) -> APP(app(map, size), xs)
APP(size, app(app(node, x), xs)) -> APP(sum, app(app(map, size), xs))
APP(sum, app(app(cons, x), xs)) -> APP(sum, xs)
APP(sum, app(app(cons, x), xs)) -> APP(app(plus, x), app(sum, xs))
APP(app(map, f), app(app(cons, x), xs)) -> APP(app(map, f), xs)
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))


Rules:


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(sum, app(app(cons, x), xs)) -> app(app(plus, x), app(sum, xs))
app(size, app(app(node, x), xs)) -> app(s, app(sum, app(app(map, size), xs)))
app(app(plus, 0), x) -> 0
app(app(plus, app(s, x)), y) -> app(s, app(app(plus, x), y))


Strategy:

innermost



Innermost Termination of R could not be shown.
Duration:
0:01 minutes