YES

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

The following DP Processors were used


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

Problem 1: DependencyGraph

Dependency Pair Problem

Dependency Pairs

activate#(n__b) → b#f#(X, X) → f#(a, n__b)

Rewrite Rules

f(X, X) → f(a, n__b)b → a
b → n__bactivate(n__b) → b
activate(X) → X

Original Signature

Termination of terms over the following signature is verified: f, activate, n__b, b, a

Strategy

There are no SCCs!