Term Rewriting System R:
[x, y, z]
ap(f, x) -> x
ap(ap(ap(g, x), y), ap(s, z)) -> ap(ap(ap(g, x), y), ap(ap(x, y), 0))

Termination of R to be shown. 



   R
     ↳Dependency Pair Analysis



R contains the following Dependency Pairs:

AP(ap(ap(g, x), y), ap(s, z)) -> AP(ap(ap(g, x), y), ap(ap(x, y), 0))
AP(ap(ap(g, x), y), ap(s, z)) -> AP(ap(x, y), 0)
AP(ap(ap(g, x), y), ap(s, z)) -> AP(x, y)

Furthermore, R contains one SCC. 


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




The following remains to be proven:
Dependency Pairs:

AP(ap(ap(g, x), y), ap(s, z)) -> AP(x, y)
AP(ap(ap(g, x), y), ap(s, z)) -> AP(ap(ap(g, x), y), ap(ap(x, y), 0))


Rules:


ap(f, x) -> x
ap(ap(ap(g, x), y), ap(s, z)) -> ap(ap(ap(g, x), y), ap(ap(x, y), 0))




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