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

Termination of R to be shown. 



   R
     ↳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
     ↳OC
       →TRS2
         ↳Dependency Pair Analysis



R contains the following Dependency Pairs:

F(a, b) -> F(a, c)
F(c, d) -> F(b, d)

R contains no SCCs.

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