YES

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

The following DP Processors were used


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

Problem 1: SubtermCriterion



Dependency Pair Problem

Dependency Pairs

f#(x, g(y))f#(g(x), y)

Rewrite Rules

f(x, a)xf(x, g(y))f(g(x), y)

Original Signature

Termination of terms over the following signature is verified: f, g, a

Strategy


Projection

The following projection was used:

Thus, the following dependency pairs are removed:

f#(x, g(y))f#(g(x), y)