Term Rewriting System R:
[y, x, g, f, xs]
app(app(plus, 0), y) -> y
app(app(plus, app(s, x)), y) -> app(s, app(app(plus, x), y))
app(app(times, 0), y) -> 0
app(app(times, app(s, x)), y) -> app(app(plus, app(app(times, x), y)), y)
app(app(app(curry, g), x), y) -> app(app(g, x), 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))
inc -> app(map, app(app(curry, plus), app(s, 0)))
double -> app(map, app(app(curry, times), app(s, app(s, 0))))

Innermost Termination of R to be shown. 



   R
     ↳Dependency Pair Analysis



R contains the following Dependency Pairs:

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)
APP(app(times, app(s, x)), y) -> APP(app(plus, app(app(times, x), y)), y)
APP(app(times, app(s, x)), y) -> APP(plus, app(app(times, x), y))
APP(app(times, app(s, x)), y) -> APP(app(times, x), y)
APP(app(times, app(s, x)), y) -> APP(times, x)
APP(app(app(curry, g), x), y) -> APP(app(g, x), y)
APP(app(app(curry, g), x), y) -> APP(g, x)
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)
INC -> APP(map, app(app(curry, plus), app(s, 0)))
INC -> APP(app(curry, plus), app(s, 0))
INC -> APP(curry, plus)
INC -> APP(s, 0)
DOUBLE -> APP(map, app(app(curry, times), app(s, app(s, 0))))
DOUBLE -> APP(app(curry, times), app(s, app(s, 0)))
DOUBLE -> APP(curry, times)
DOUBLE -> APP(s, app(s, 0))
DOUBLE -> APP(s, 0)

Furthermore, R contains one SCC. 


   R
     ↳DPs
       →DP Problem 1
         ↳Remaining Obligation(s)




The following remains to be proven:
Dependency Pairs:

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))
APP(app(app(curry, g), x), y) -> APP(g, x)
APP(app(app(curry, g), x), y) -> APP(app(g, x), y)
APP(app(times, app(s, x)), y) -> APP(app(times, x), y)
APP(app(times, app(s, x)), y) -> APP(app(plus, app(app(times, x), y)), y)
APP(app(plus, app(s, x)), y) -> APP(app(plus, x), y)


Rules:


app(app(plus, 0), y) -> y
app(app(plus, app(s, x)), y) -> app(s, app(app(plus, x), y))
app(app(times, 0), y) -> 0
app(app(times, app(s, x)), y) -> app(app(plus, app(app(times, x), y)), y)
app(app(app(curry, g), x), y) -> app(app(g, x), 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))
inc -> app(map, app(app(curry, plus), app(s, 0)))
double -> app(map, app(app(curry, times), app(s, app(s, 0))))


Strategy:

innermost



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