Term Rewriting System R:
[f, x, xs, g]
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(app(comp, f), g), x) -> app(f, app(g, x))
app(twice, f) -> app(app(comp, f), f)

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(app(app(comp, f), g), x) -> APP(f, app(g, x))
APP(app(app(comp, f), g), x) -> APP(g, x)
APP(twice, f) -> APP(app(comp, f), f)
APP(twice, f) -> APP(comp, f)

Furthermore, R contains one SCC. 


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




The following remains to be proven:
Dependency Pairs:

APP(twice, f) -> APP(app(comp, f), f)
APP(app(app(comp, f), g), x) -> APP(g, x)
APP(app(app(comp, f), g), x) -> APP(f, app(g, 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(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(app(app(comp, f), g), x) -> app(f, app(g, x))
app(twice, f) -> app(app(comp, f), f)


Strategy:

innermost



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