YES

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

The following DP Processors were used


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

Problem 1: DependencyGraph

Dependency Pair Problem

Dependency Pairs

f#(f(a)) → f#(g)

Rewrite Rules

f(f(a)) → f(g)

Original Signature

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

Strategy

There are no SCCs!