Term Rewriting System R:
[x]
f(x) -> f(f(x))

Innermost Termination of R to be shown. 



   R
     ↳Dependency Pair Analysis



R contains the following Dependency Pairs:

F(x) -> F(f(x))
F(x) -> F(x)

Furthermore, R contains one SCC. 


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




The following remains to be proven:
Dependency Pairs:

F(x) -> F(x)
F(x) -> F(f(x))


Rule:


f(x) -> f(f(x))


Strategy:

innermost



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