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