YES

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

The following DP Processors were used


Problem 1 was processed with processor SubtermCriterion (1ms).
 | – Problem 2 was processed with processor DependencyGraph (1ms).

Problem 1: SubtermCriterion



Dependency Pair Problem

Dependency Pairs

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

Rewrite Rules

f(f(x))g(f(x))g(g(x))f(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#(f(x))f#(x)g#(g(x))f#(x)

Problem 2: DependencyGraph



Dependency Pair Problem

Dependency Pairs

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

Rewrite Rules

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

Original Signature

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

Strategy


There are no SCCs!