Term Rewriting System R:
[x, y, z, u, v]
f(x, y, f(z, u, v)) -> f(f(x, y, z), u, f(x, y, v))

Termination of R to be shown. 



   R
     ↳Dependency Pair Analysis



R contains the following Dependency Pairs:

F(x, y, f(z, u, v)) -> F(f(x, y, z), u, f(x, y, v))
F(x, y, f(z, u, v)) -> F(x, y, z)
F(x, y, f(z, u, v)) -> F(x, y, v)

Furthermore, R contains one SCC. 


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




The following remains to be proven:
Dependency Pairs:

F(x, y, f(z, u, v)) -> F(x, y, v)
F(x, y, f(z, u, v)) -> F(x, y, z)
F(x, y, f(z, u, v)) -> F(f(x, y, z), u, f(x, y, v))


Rule:


f(x, y, f(z, u, v)) -> f(f(x, y, z), u, f(x, y, v))




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