Term Rewriting System R:

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

Termination of R to be shown.


R contains the following Dependency Pairs: 


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

Furthermore, R contains two SCCs.


SCC1:

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

Removing rules from R by ordering and analyzing Dependency Pairs, Usable Rules, and Usable Equations.

This is possible by using the following (C_E-compatible) Polynomial ordering.

Polynomial interpretation:
POL(+'(x_1, x_2)) = 1 + x_1 + x_2
POL(+(x_1, x_2)) = x_1 + x_2

No Dependency Pairs can be deleted.

The following rules of R can be deleted: 

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


 This transformation is resulting in one new subcycle:


SCC1.MRR1:

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

Removing rules from R by ordering and analyzing Dependency Pairs, Usable Rules, and Usable Equations.

This is possible by using the following (C_E-compatible) Polynomial ordering.

Polynomial interpretation:
POL(+'(x_1, x_2)) = 1 + x_1 + x_2
POL(+(x_1, x_2)) = 1 + x_1 + x_2

The following Dependency Pairs can be deleted:

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

No rules of R can be deleted.


 This transformation is resulting in one new subcycle:


SCC1.MRR1.MRR1:

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

By using a polynomial ordering, at least one Dependency Pair of this SCC can be strictly oriented.

No rules need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:
POL(+(x_1, x_2)) = 1 + x_1
POL(+'(x_1, x_2)) = x_1

 resulting in no subcycles.


SCC2:

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

By using a polynomial ordering, at least one Dependency Pair of this SCC can be strictly oriented.

Additionally, the following rules can be oriented: 

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


Used ordering: Polynomial ordering with Polynomial interpretation:
POL(*(x_1, x_2)) = x_1 + x_1*x_2 + x_2
POL(*'(x_1, x_2)) = x_1 + x_1*x_2
POL(+(x_1, x_2)) = 1 + x_1 + x_2

 resulting in one subcycle.


SCC2.Polo1:

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

By using a polynomial ordering, at least one Dependency Pair of this SCC can be strictly oriented.

No rules need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:
POL(*(x_1, x_2)) = 1 + x_1 + x_2
POL(*'(x_1, x_2)) = x_1
POL(+(x_1, x_2)) = 0

 resulting in one subcycle.


SCC2.Polo1.Polo1:

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

Removing rules from R by ordering and analyzing Dependency Pairs, Usable Rules, and Usable Equations.

This is possible by using the following (C_E-compatible) Polynomial ordering.

Polynomial interpretation:
POL(*'(x_1, x_2)) = 1 + x_1 + x_2
POL(+(x_1, x_2)) = 1 + x_1 + x_2

The following Dependency Pairs can be deleted:

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



 This transformation is resulting in no new subcycles.




Termination of R successfully shown.


Duration: 10.858 seconds.