Term Rewriting System R:
[f, x, xs]
app(app(mapt, f), app(leaf, x)) -> app(leaf, app(f, x))
app(app(mapt, f), app(node, xs)) -> app(node, app(app(maptlist, f), xs))
app(app(maptlist, f), nil) -> nil
app(app(maptlist, f), app(app(cons, x), xs)) -> app(app(cons, app(app(mapt, f), x)), app(app(maptlist, f), xs))

Termination of R to be shown. 



   R
     ↳Dependency Pair Analysis



R contains the following Dependency Pairs:

APP(app(mapt, f), app(leaf, x)) -> APP(leaf, app(f, x))
APP(app(mapt, f), app(leaf, x)) -> APP(f, x)
APP(app(mapt, f), app(node, xs)) -> APP(node, app(app(maptlist, f), xs))
APP(app(mapt, f), app(node, xs)) -> APP(app(maptlist, f), xs)
APP(app(mapt, f), app(node, xs)) -> APP(maptlist, f)
APP(app(maptlist, f), app(app(cons, x), xs)) -> APP(app(cons, app(app(mapt, f), x)), app(app(maptlist, f), xs))
APP(app(maptlist, f), app(app(cons, x), xs)) -> APP(cons, app(app(mapt, f), x))
APP(app(maptlist, f), app(app(cons, x), xs)) -> APP(app(mapt, f), x)
APP(app(maptlist, f), app(app(cons, x), xs)) -> APP(mapt, f)
APP(app(maptlist, f), app(app(cons, x), xs)) -> APP(app(maptlist, f), xs)

Furthermore, R contains one SCC. 


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




The following remains to be proven:
Dependency Pairs:

APP(app(maptlist, f), app(app(cons, x), xs)) -> APP(app(maptlist, f), xs)
APP(app(maptlist, f), app(app(cons, x), xs)) -> APP(app(mapt, f), x)
APP(app(maptlist, f), app(app(cons, x), xs)) -> APP(app(cons, app(app(mapt, f), x)), app(app(maptlist, f), xs))
APP(app(mapt, f), app(node, xs)) -> APP(app(maptlist, f), xs)
APP(app(mapt, f), app(leaf, x)) -> APP(f, x)


Rules:


app(app(mapt, f), app(leaf, x)) -> app(leaf, app(f, x))
app(app(mapt, f), app(node, xs)) -> app(node, app(app(maptlist, f), xs))
app(app(maptlist, f), nil) -> nil
app(app(maptlist, f), app(app(cons, x), xs)) -> app(app(cons, app(app(mapt, f), x)), app(app(maptlist, f), xs))




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