Term Rewriting System R:
[x]
f(g(a)) -> f(s(g(b)))
f(f(x)) -> b
g(x) -> f(g(x))

Innermost Termination of R to be shown. 



   R
     ↳Dependency Pair Analysis



R contains the following Dependency Pairs:

F(g(a)) -> F(s(g(b)))
F(g(a)) -> G(b)
G(x) -> F(g(x))
G(x) -> G(x)

Furthermore, R contains one SCC. 


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




The following remains to be proven:
Dependency Pair:

G(x) -> G(x)


Rules:


f(g(a)) -> f(s(g(b)))
f(f(x)) -> b
g(x) -> f(g(x))


Strategy:

innermost



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