Term Rewriting System R:
[x, y, z]
f(0, 1, x) -> f(x, x, x)
f(x, y, z) -> 2
0 -> 2
1 -> 2
g(x, x, y) -> y
g(x, y, y) -> x

Termination of R to be shown.



   R
Dependency Pair Analysis



R contains the following Dependency Pairs:

F(0, 1, x) -> F(x, 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(x, x, x)


Rules:


f(0, 1, x) -> f(x, x, x)
f(x, y, z) -> 2
0 -> 2
1 -> 2
g(x, x, y) -> y
g(x, y, y) -> x




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