YES

The TRS could be proven terminating. The proof took 19 ms.

The following DP Processors were used


Problem 1 was processed with processor SubtermCriterion (0ms).

Problem 1: SubtermCriterion



Dependency Pair Problem

Dependency Pairs

*#(x, +(y, z))*#(x, z)*#(x, +(y, z))*#(x, y)

Rewrite Rules

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

Original Signature

Termination of terms over the following signature is verified: *, +

Strategy


Projection

The following projection was used:

Thus, the following dependency pairs are removed:

*#(x, +(y, z))*#(x, z)*#(x, +(y, z))*#(x, y)