Term Rewriting System R:
[a, b, c, d]
f(f(f(f(j, a), b), c), d) -> f(f(a, b), f(f(a, d), c))

Innermost Termination of R to be shown. 



   R
     ↳Dependency Pair Analysis



R contains the following Dependency Pairs:

F(f(f(f(j, a), b), c), d) -> F(f(a, b), f(f(a, d), c))
F(f(f(f(j, a), b), c), d) -> F(a, b)
F(f(f(f(j, a), b), c), d) -> F(f(a, d), c)
F(f(f(f(j, a), b), c), d) -> F(a, d)

Furthermore, R contains one SCC. 


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




The following remains to be proven:
Dependency Pairs:

F(f(f(f(j, a), b), c), d) -> F(a, d)
F(f(f(f(j, a), b), c), d) -> F(f(a, d), c)
F(f(f(f(j, a), b), c), d) -> F(a, b)
F(f(f(f(j, a), b), c), d) -> F(f(a, b), f(f(a, d), c))


Rule:


f(f(f(f(j, a), b), c), d) -> f(f(a, b), f(f(a, d), c))


Strategy:

innermost



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