YES
The TRS could be proven terminating. The proof took 21 ms.
The following DP Processors were used
Problem 1 was processed with processor DependencyGraph (3ms).
| – Problem 2 was processed with processor SubtermCriterion (0ms).
Problem 1: DependencyGraph
Dependency Pair Problem
Dependency Pairs
| a#(a(x)) | → | a#(b(a(x))) | | a#(a(x)) | → | a#(x) |
Rewrite Rules
Original Signature
Termination of terms over the following signature is verified: b, a
Strategy
The following SCCs where found
Problem 2: SubtermCriterion
Dependency Pair Problem
Dependency Pairs
Rewrite Rules
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: