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

Innermost Termination of R to be shown. 



   R
     ↳Dependency Pair Analysis



R contains the following Dependency Pairs:

APP(app(rec, h), app(g, app(s, x))) -> APP(app(h, x), app(app(rec, h), app(g, x)))
APP(app(rec, h), app(g, app(s, x))) -> APP(h, x)
APP(app(rec, h), app(g, app(s, x))) -> APP(app(rec, h), app(g, x))
APP(app(rec, h), app(g, app(s, x))) -> APP(g, x)

Furthermore, R contains one SCC. 


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




The following remains to be proven:
Dependency Pairs:

APP(app(rec, h), app(g, app(s, x))) -> APP(g, x)
APP(app(rec, h), app(g, app(s, x))) -> APP(app(rec, h), app(g, x))
APP(app(rec, h), app(g, app(s, x))) -> APP(h, x)
APP(app(rec, h), app(g, app(s, x))) -> APP(app(h, x), app(app(rec, h), app(g, x)))


Rules:


app(app(rec, h), app(g, 0)) -> g
app(app(rec, h), app(g, app(s, x))) -> app(app(h, x), app(app(rec, h), app(g, x)))


Strategy:

innermost



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