YES

The TRS could be proven terminating. The proof took 24 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) → g#(a)g#(b) → f#(b)
g#(b) → b#

Rewrite Rules

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

Original Signature

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

Strategy

There are no SCCs!