Term Rewriting System R:
[X]
a -> g(c)
g(a) -> b
f(g(X), b) -> f(a, X)

Termination of R to be shown.



   R
Removing Redundant Rules



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

a -> g(c)

where the Polynomial interpretation:
  POL(c)=  0  
  POL(g(x1))=  x1  
  POL(b)=  1  
  POL(a)=  1  
  POL(f(x1, x2))=  x1 + x2  
was used.

Not all Rules of R can be deleted, so we still have to regard a part of R.


   R
RRRPolo
       →TRS2
Removing Redundant Rules



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

f(g(X), b) -> f(a, X)
g(a) -> b

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

All Rules of R can be deleted.


   R
RRRPolo
       →TRS2
RRRPolo
           →TRS3
Overlay and local confluence Check



The TRS is overlay and locally confluent (all critical pairs are trivially joinable).Hence, we can switch to innermost.


   R
RRRPolo
       →TRS2
RRRPolo
           →TRS3
OC
             ...
               →TRS4
Dependency Pair Analysis



R contains no Dependency Pairs and therefore no SCCs.

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