YES

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

The following DP Processors were used


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

Problem 1: SubtermCriterion



Dependency Pair Problem

Dependency Pairs

f#(g(x))f#(x)

Rewrite Rules

f(g(x))g(g(f(x)))f(g(x))g(g(g(x)))

Original Signature

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

Strategy


Projection

The following projection was used:

Thus, the following dependency pairs are removed:

f#(g(x))f#(x)