YES
The TRS could be proven terminating. The proof took 199 ms.
The following DP Processors were used
Problem 1 was processed with processor DependencyGraph (96ms).
| – Problem 2 was processed with processor SubtermCriterion (1ms).
| – Problem 3 was processed with processor SubtermCriterion (1ms).
| – Problem 4 was processed with processor SubtermCriterion (1ms).
Problem 1: DependencyGraph
Dependency Pair Problem
Dependency Pairs
| from#(X) | → | cons#(X, n__from(s(X))) | | 2ndsneg#(s(N), cons(X, n__cons(Y, Z))) | → | 2ndspos#(N, activate(Z)) |
| activate#(n__from(X)) | → | from#(X) | | pi#(X) | → | 2ndspos#(X, from(0)) |
| 2ndspos#(s(N), cons(X, n__cons(Y, Z))) | → | activate#(Z) | | pi#(X) | → | from#(0) |
| times#(s(X), Y) | → | plus#(Y, times(X, Y)) | | times#(s(X), Y) | → | times#(X, Y) |
| square#(X) | → | times#(X, X) | | 2ndsneg#(s(N), cons(X, n__cons(Y, Z))) | → | activate#(Z) |
| 2ndspos#(s(N), cons(X, n__cons(Y, Z))) | → | 2ndsneg#(N, activate(Z)) | | 2ndspos#(s(N), cons(X, n__cons(Y, Z))) | → | activate#(Y) |
| plus#(s(X), Y) | → | plus#(X, Y) | | activate#(n__cons(X1, X2)) | → | cons#(X1, X2) |
| 2ndsneg#(s(N), cons(X, n__cons(Y, Z))) | → | activate#(Y) |
Rewrite Rules
| from(X) | → | cons(X, n__from(s(X))) | | 2ndspos(0, Z) | → | rnil |
| 2ndspos(s(N), cons(X, n__cons(Y, Z))) | → | rcons(posrecip(activate(Y)), 2ndsneg(N, activate(Z))) | | 2ndsneg(0, Z) | → | rnil |
| 2ndsneg(s(N), cons(X, n__cons(Y, Z))) | → | rcons(negrecip(activate(Y)), 2ndspos(N, activate(Z))) | | pi(X) | → | 2ndspos(X, from(0)) |
| plus(0, Y) | → | Y | | plus(s(X), Y) | → | s(plus(X, Y)) |
| times(0, Y) | → | 0 | | times(s(X), Y) | → | plus(Y, times(X, Y)) |
| square(X) | → | times(X, X) | | from(X) | → | n__from(X) |
| cons(X1, X2) | → | n__cons(X1, X2) | | activate(n__from(X)) | → | from(X) |
| activate(n__cons(X1, X2)) | → | cons(X1, X2) | | activate(X) | → | X |
Original Signature
Termination of terms over the following signature is verified: plus, posrecip, negrecip, n__from, rnil, from, rcons, activate, n__cons, 2ndspos, 0, s, 2ndsneg, times, square, pi, cons
Strategy
The following SCCs where found
| plus#(s(X), Y) → plus#(X, Y) |
| 2ndspos#(s(N), cons(X, n__cons(Y, Z))) → 2ndsneg#(N, activate(Z)) | 2ndsneg#(s(N), cons(X, n__cons(Y, Z))) → 2ndspos#(N, activate(Z)) |
| times#(s(X), Y) → times#(X, Y) |
Problem 2: SubtermCriterion
Dependency Pair Problem
Dependency Pairs
| 2ndspos#(s(N), cons(X, n__cons(Y, Z))) | → | 2ndsneg#(N, activate(Z)) | | 2ndsneg#(s(N), cons(X, n__cons(Y, Z))) | → | 2ndspos#(N, activate(Z)) |
Rewrite Rules
| from(X) | → | cons(X, n__from(s(X))) | | 2ndspos(0, Z) | → | rnil |
| 2ndspos(s(N), cons(X, n__cons(Y, Z))) | → | rcons(posrecip(activate(Y)), 2ndsneg(N, activate(Z))) | | 2ndsneg(0, Z) | → | rnil |
| 2ndsneg(s(N), cons(X, n__cons(Y, Z))) | → | rcons(negrecip(activate(Y)), 2ndspos(N, activate(Z))) | | pi(X) | → | 2ndspos(X, from(0)) |
| plus(0, Y) | → | Y | | plus(s(X), Y) | → | s(plus(X, Y)) |
| times(0, Y) | → | 0 | | times(s(X), Y) | → | plus(Y, times(X, Y)) |
| square(X) | → | times(X, X) | | from(X) | → | n__from(X) |
| cons(X1, X2) | → | n__cons(X1, X2) | | activate(n__from(X)) | → | from(X) |
| activate(n__cons(X1, X2)) | → | cons(X1, X2) | | activate(X) | → | X |
Original Signature
Termination of terms over the following signature is verified: plus, posrecip, negrecip, n__from, rnil, from, rcons, activate, n__cons, 2ndspos, 0, s, 2ndsneg, times, square, pi, cons
Strategy
Projection
The following projection was used:
- π (2ndspos#): 1
- π (2ndsneg#): 1
Thus, the following dependency pairs are removed:
| 2ndspos#(s(N), cons(X, n__cons(Y, Z))) | → | 2ndsneg#(N, activate(Z)) | | 2ndsneg#(s(N), cons(X, n__cons(Y, Z))) | → | 2ndspos#(N, activate(Z)) |
Problem 3: SubtermCriterion
Dependency Pair Problem
Dependency Pairs
| plus#(s(X), Y) | → | plus#(X, Y) |
Rewrite Rules
| from(X) | → | cons(X, n__from(s(X))) | | 2ndspos(0, Z) | → | rnil |
| 2ndspos(s(N), cons(X, n__cons(Y, Z))) | → | rcons(posrecip(activate(Y)), 2ndsneg(N, activate(Z))) | | 2ndsneg(0, Z) | → | rnil |
| 2ndsneg(s(N), cons(X, n__cons(Y, Z))) | → | rcons(negrecip(activate(Y)), 2ndspos(N, activate(Z))) | | pi(X) | → | 2ndspos(X, from(0)) |
| plus(0, Y) | → | Y | | plus(s(X), Y) | → | s(plus(X, Y)) |
| times(0, Y) | → | 0 | | times(s(X), Y) | → | plus(Y, times(X, Y)) |
| square(X) | → | times(X, X) | | from(X) | → | n__from(X) |
| cons(X1, X2) | → | n__cons(X1, X2) | | activate(n__from(X)) | → | from(X) |
| activate(n__cons(X1, X2)) | → | cons(X1, X2) | | activate(X) | → | X |
Original Signature
Termination of terms over the following signature is verified: plus, posrecip, negrecip, n__from, rnil, from, rcons, activate, n__cons, 2ndspos, 0, s, 2ndsneg, times, square, pi, cons
Strategy
Projection
The following projection was used:
Thus, the following dependency pairs are removed:
| plus#(s(X), Y) | → | plus#(X, Y) |
Problem 4: SubtermCriterion
Dependency Pair Problem
Dependency Pairs
| times#(s(X), Y) | → | times#(X, Y) |
Rewrite Rules
| from(X) | → | cons(X, n__from(s(X))) | | 2ndspos(0, Z) | → | rnil |
| 2ndspos(s(N), cons(X, n__cons(Y, Z))) | → | rcons(posrecip(activate(Y)), 2ndsneg(N, activate(Z))) | | 2ndsneg(0, Z) | → | rnil |
| 2ndsneg(s(N), cons(X, n__cons(Y, Z))) | → | rcons(negrecip(activate(Y)), 2ndspos(N, activate(Z))) | | pi(X) | → | 2ndspos(X, from(0)) |
| plus(0, Y) | → | Y | | plus(s(X), Y) | → | s(plus(X, Y)) |
| times(0, Y) | → | 0 | | times(s(X), Y) | → | plus(Y, times(X, Y)) |
| square(X) | → | times(X, X) | | from(X) | → | n__from(X) |
| cons(X1, X2) | → | n__cons(X1, X2) | | activate(n__from(X)) | → | from(X) |
| activate(n__cons(X1, X2)) | → | cons(X1, X2) | | activate(X) | → | X |
Original Signature
Termination of terms over the following signature is verified: plus, posrecip, negrecip, n__from, rnil, from, rcons, activate, n__cons, 2ndspos, 0, s, 2ndsneg, times, square, pi, cons
Strategy
Projection
The following projection was used:
Thus, the following dependency pairs are removed:
| times#(s(X), Y) | → | times#(X, Y) |