YES

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

The following DP Processors were used


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

Problem 1: SubtermCriterion



Dependency Pair Problem

Dependency Pairs

a#(b(x))a#(x)

Rewrite Rules

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

Original Signature

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

Strategy


Projection

The following projection was used:

Thus, the following dependency pairs are removed:

a#(b(x))a#(x)