YES

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

The following DP Processors were used


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

Problem 1: DependencyGraph

Dependency Pair Problem

Dependency Pairs

c# → f#

Rewrite Rules

c → ff → g

Original Signature

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

Strategy

There are no SCCs!