YES

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

The following DP Processors were used


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

Problem 1: DependencyGraph

Dependency Pair Problem

Dependency Pairs

f#(a) → f#(b)g#(b) → g#(a)
f#(x) → g#(x)

Rewrite Rules

f(a) → f(b)g(b) → g(a)
f(x) → g(x)

Original Signature

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

Strategy

There are no SCCs!