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

Innermost Termination of R to be shown. 



   TRS
     ↳Dependency Pair Analysis



R contains the following Dependency Pairs:

F(a) -> F(a)

Furthermore, R contains one SCC. 


   TRS
     ↳DPs
       →DP Problem 1
         ↳Non Termination


Dependency Pair:

F(a) -> F(a)


Rule:


f(a) -> f(a)


Strategy:

innermost




Found an infinite P-chain over R:
P =

F(a) -> F(a)

R =

f(a) -> f(a)

s = F(a)
evaluates to t =F(a)

Thus, s starts an infinite chain.

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