Term Rewriting System R:
[x, y, z]
*(x, +(y, z)) -> +(*(x, y), *(x, z))

Termination of R to be shown. 



   R
     ↳Dependency Pair Analysis



R contains the following Dependency Pairs:

*'(x, +(y, z)) -> *'(x, y)
*'(x, +(y, z)) -> *'(x, z)

Furthermore, R contains one SCC. 


   R
     ↳DPs
       →DP Problem 1
         ↳Polynomial Ordering


Dependency Pairs:

*'(x, +(y, z)) -> *'(x, z)
*'(x, +(y, z)) -> *'(x, y)


Rule:


*(x, +(y, z)) -> +(*(x, y), *(x, z))





The following dependency pairs can be strictly oriented:

*'(x, +(y, z)) -> *'(x, z)
*'(x, +(y, z)) -> *'(x, y)


Additionally, the following rule can be oriented:

*(x, +(y, z)) -> +(*(x, y), *(x, z))


Used ordering: Polynomial ordering with Polynomial interpretation:
  POL(*'(x1, x2))=  x2  
  POL(*(x1, x2))=  x2  
  POL(+(x1, x2))=  1 + x1 + x2  

resulting in one new DP problem. 



   R
     ↳DPs
       →DP Problem 1
         ↳Polo
           →DP Problem 2
             ↳Dependency Graph


Dependency Pair:


Rule:


*(x, +(y, z)) -> +(*(x, y), *(x, z))





Using the Dependency Graph resulted in no new DP problems.

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