YES

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

The following DP Processors were used


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

Problem 1: DependencyGraph

Dependency Pair Problem

Dependency Pairs

a#(b(x)) → a#(c(b(x)))

Rewrite Rules

a(b(x)) → a(c(b(x)))

Original Signature

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

Strategy

There are no SCCs!