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

Termination of R to be shown.



   R
Dependency Pair Analysis



R contains the following Dependency Pairs:

G(a) -> G(b)
G(a) -> B
B -> F(a, a)
F(a, a) -> G(d)

Furthermore, R contains one SCC.


   R
DPs
       →DP Problem 1
Remaining Obligation(s)




The following remains to be proven:
Dependency Pair:

G(a) -> G(b)


Rules:


g(a) -> g(b)
b -> f(a, a)
f(a, a) -> g(d)




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