Term Rewriting System R:
[y, x, z]
f(a, g(y)) -> g(g(y))
f(g(x), a) -> f(x, g(a))
f(g(x), g(y)) -> h(g(y), x, g(y))
h(g(x), y, z) -> f(y, h(x, y, z))
h(a, y, z) -> z

Innermost Termination of R to be shown. 



   R
     ↳Dependency Pair Analysis



R contains the following Dependency Pairs:

F(g(x), a) -> F(x, g(a))
F(g(x), g(y)) -> H(g(y), x, g(y))
H(g(x), y, z) -> F(y, h(x, y, z))
H(g(x), y, z) -> H(x, y, z)

Furthermore, R contains one SCC. 


   R
     ↳DPs
       →DP Problem 1
         ↳Polynomial Ordering


Dependency Pairs:

H(g(x), y, z) -> H(x, y, z)
H(g(x), y, z) -> F(y, h(x, y, z))
F(g(x), g(y)) -> H(g(y), x, g(y))
F(g(x), a) -> F(x, g(a))


Rules:


f(a, g(y)) -> g(g(y))
f(g(x), a) -> f(x, g(a))
f(g(x), g(y)) -> h(g(y), x, g(y))
h(g(x), y, z) -> f(y, h(x, y, z))
h(a, y, z) -> z


Strategy:

innermost




The following dependency pair can be strictly oriented:

F(g(x), a) -> F(x, g(a))


Additionally, the following usable rules for innermost can be oriented:

h(g(x), y, z) -> f(y, h(x, y, z))
h(a, y, z) -> z
f(a, g(y)) -> g(g(y))
f(g(x), a) -> f(x, g(a))
f(g(x), g(y)) -> h(g(y), x, g(y))


Used ordering: Polynomial ordering with Polynomial interpretation:
  POL(g(x1))=  0  
  POL(h(x1, x2, x3))=  x3  
  POL(a)=  1  
  POL(H(x1, x2, x3))=  x3  
  POL(f(x1, x2))=  0  
  POL(F(x1, x2))=  x2  

resulting in one new DP problem. 



   R
     ↳DPs
       →DP Problem 1
         ↳Polo
           →DP Problem 2
             ↳Remaining Obligation(s)




The following remains to be proven:
Dependency Pairs:

H(g(x), y, z) -> H(x, y, z)
H(g(x), y, z) -> F(y, h(x, y, z))
F(g(x), g(y)) -> H(g(y), x, g(y))


Rules:


f(a, g(y)) -> g(g(y))
f(g(x), a) -> f(x, g(a))
f(g(x), g(y)) -> h(g(y), x, g(y))
h(g(x), y, z) -> f(y, h(x, y, z))
h(a, y, z) -> z


Strategy:

innermost



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