YES
The TRS could be proven terminating. The proof took 16 ms.
The following DP Processors were used
Problem 1 was processed with processor DependencyGraph (3ms).
| – Problem 2 was processed with processor SubtermCriterion (1ms).
Problem 1: DependencyGraph
Dependency Pair Problem
Dependency Pairs
| sum#(s(x)) | → | sqr#(s(x)) | | sum#(s(x)) | → | sum#(x) |
Rewrite Rules
| sum(0) | → | 0 | | sum(s(x)) | → | +(sqr(s(x)), sum(x)) |
| sqr(x) | → | *(x, x) | | sum(s(x)) | → | +(*(s(x), s(x)), sum(x)) |
Original Signature
Termination of terms over the following signature is verified: 0, s, sqr, *, sum, +
Strategy
The following SCCs where found
Problem 2: SubtermCriterion
Dependency Pair Problem
Dependency Pairs
Rewrite Rules
| sum(0) | → | 0 | | sum(s(x)) | → | +(sqr(s(x)), sum(x)) |
| sqr(x) | → | *(x, x) | | sum(s(x)) | → | +(*(s(x), s(x)), sum(x)) |
Original Signature
Termination of terms over the following signature is verified: 0, s, sqr, *, sum, +
Strategy
Projection
The following projection was used:
Thus, the following dependency pairs are removed: