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

Innermost Termination of R to be shown. 



   R
     ↳Dependency Pair Analysis



R contains the following Dependency Pairs:

G(0) -> G(f(0))
G(0) -> F(0)

Furthermore, R contains one SCC. 


   R
     ↳DPs
       →DP Problem 1
         ↳Narrowing Transformation


Dependency Pair:

G(0) -> G(f(0))


Rules:


f(f(x)) -> f(x)
g(0) -> g(f(0))


Strategy:

innermost




On this DP problem, a Narrowing SCC transformation can be performed.
As a result of transforming the rule

G(0) -> G(f(0))
no new Dependency Pairs are created.
The transformation is resulting in no new DP problems.


Innermost Termination of R successfully shown.
Duration:
0:00 minutes