Term Rewriting System R:
[X, Y]
f(0, 1, X) -> f(g(X, X), X, X)
g(X, Y) -> X
g(X, Y) -> Y

Termination of R to be shown.



   R
Dependency Pair Analysis



R contains the following Dependency Pairs:

F(0, 1, X) -> F(g(X, X), X, X)
F(0, 1, X) -> G(X, X)

Furthermore, R contains one SCC.


   R
DPs
       →DP Problem 1
Remaining Obligation(s)




The following remains to be proven:
Dependency Pair:

F(0, 1, X) -> F(g(X, X), X, X)


Rules:


f(0, 1, X) -> f(g(X, X), X, X)
g(X, Y) -> X
g(X, Y) -> Y




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