Term Rewriting System R:
[f, x, y]
app(app(app(rec, f), x), 0) -> x
app(app(app(rec, f), x), app(s, y)) -> app(app(f, app(s, y)), app(app(app(rec, f), x), y))

Termination of R to be shown. 



   R
     ↳Dependency Pair Analysis



R contains the following Dependency Pairs:

APP(app(app(rec, f), x), app(s, y)) -> APP(app(f, app(s, y)), app(app(app(rec, f), x), y))
APP(app(app(rec, f), x), app(s, y)) -> APP(f, app(s, y))
APP(app(app(rec, f), x), app(s, y)) -> APP(app(app(rec, f), x), y)

Furthermore, R contains one SCC. 


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




The following remains to be proven:
Dependency Pairs:

APP(app(app(rec, f), x), app(s, y)) -> APP(app(app(rec, f), x), y)
APP(app(app(rec, f), x), app(s, y)) -> APP(f, app(s, y))
APP(app(app(rec, f), x), app(s, y)) -> APP(app(f, app(s, y)), app(app(app(rec, f), x), y))


Rules:


app(app(app(rec, f), x), 0) -> x
app(app(app(rec, f), x), app(s, y)) -> app(app(f, app(s, y)), app(app(app(rec, f), x), y))




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