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 (0ms).

Problem 1: SubtermCriterion

Dependency Pair Problem

Dependency Pairs

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

Rewrite Rules

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

Original Signature

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

Strategy

Projection

The following projection was used:

Thus, the following dependency pairs are removed:

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