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

Innermost Termination of R to be shown. 



   R
     ↳Dependency Pair Analysis



R contains the following Dependency Pairs:

F(x, y, z) -> G(x, y, z)
G(0, 1, x) -> F(x, x, x)

Furthermore, R contains one SCC. 


   R
     ↳DPs
       →DP Problem 1
         ↳Usable Rules (Innermost)


Dependency Pairs:

G(0, 1, x) -> F(x, x, x)
F(x, y, z) -> G(x, y, z)


Rules:


f(x, y, z) -> g(x, y, z)
g(0, 1, x) -> f(x, x, x)
a -> b
a -> c


Strategy:

innermost




As we are in the innermost case, we can delete all 4 non-usable-rules.


   R
     ↳DPs
       →DP Problem 1
         ↳UsableRules
           →DP Problem 2
             ↳Instantiation Transformation


Dependency Pairs:

G(0, 1, x) -> F(x, x, x)
F(x, y, z) -> G(x, y, z)


Rule:

none


Strategy:

innermost




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

F(x, y, z) -> G(x, y, z)
one new Dependency Pair is created:

F(z', z', z') -> G(z', z', z')

The transformation is resulting in no new DP problems.


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