Term Rewriting System R:
[x]
f(0, 1, x) -> f(x, x, 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
         ↳Forward Instantiation Transformation


Dependency Pair:

F(0, 1, x) -> F(x, x, x)


Rule:


f(0, 1, x) -> f(x, x, x)





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

F(0, 1, x) -> F(x, x, x)
no new Dependency Pairs are created.
The transformation is resulting in no new DP problems.


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