YES

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

The following DP Processors were used


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

Problem 1: DependencyGraph



Dependency Pair Problem

Dependency Pairs

activate#(n__f(X))f#(X)f#(f(a))f#(g(n__f(a)))

Rewrite Rules

f(f(a))f(g(n__f(a)))f(X)n__f(X)
activate(n__f(X))f(X)activate(X)X

Original Signature

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

Strategy


There are no SCCs!