Term Rewriting System R:
[x, y, z, u]
+(x, +(y, z)) -> +(+(x, y), z)
+(+(x, *(y, z)), *(y, u)) -> +(x, *(y, +(z, u)))
*(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), z)
+'(x, +(y, z)) -> +'(x, y)
+'(+(x, *(y, z)), *(y, u)) -> +'(x, *(y, +(z, u)))
+'(+(x, *(y, z)), *(y, u)) -> *'(y, +(z, u))
+'(+(x, *(y, z)), *(y, u)) -> +'(z, u)
*'(x, +(y, z)) -> +'(*(x, y), *(x, z))
*'(x, +(y, z)) -> *'(x, y)
*'(x, +(y, z)) -> *'(x, z)

Furthermore, R contains one SCC. 


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




The following remains to be proven:
Dependency Pairs:

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


Rules:


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




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