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

Innermost Termination of R to be shown. 



   R
     ↳Removing Redundant Rules for Innermost Termination



Removing the following rules from R which left hand sides contain non normal subterms

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


   R
     ↳RRRI
       →TRS2
         ↳Removing Redundant Rules



Removing the following rules from R which fullfill a polynomial ordering:

g(x, y) -> x
g(x, y) -> y

where the Polynomial interpretation:
  POL(g(x1, x2))=  1 + x1 + x2  
was used.

All Rules of R can be deleted. 


   R
     ↳RRRI
       →TRS2
         ↳RRRPolo
           →TRS3
             ↳Dependency Pair Analysis



R contains no Dependency Pairs and therefore no SCCs.

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