TIMEOUT
The TRS could not be proven terminating. The proof attempt took 60076 ms.
The following DP Processors were used
Problem 1 was processed with processor DependencyGraph (31ms).
| – Problem 2 remains open; application of the following processors failed [SubtermCriterion (1ms), DependencyGraph (3ms), PolynomialLinearRange4iUR (353ms), DependencyGraph (3ms), PolynomialLinearRange8NegiUR (1478ms), DependencyGraph (2ms), ReductionPairSAT (58132ms)].
| – Problem 3 was processed with processor SubtermCriterion (1ms).
| – Problem 4 was processed with processor SubtermCriterion (1ms).
The following open problems remain:
Open Dependency Pair Problem 2
Dependency Pairs
| f#(true, x, y, z) | → | f#(gt(x, plus(y, z)), x, s(y), z) | | f#(true, x, y, z) | → | f#(gt(x, plus(y, z)), x, y, s(z)) |
Rewrite Rules
| f(true, x, y, z) | → | f(gt(x, plus(y, z)), x, s(y), z) | | f(true, x, y, z) | → | f(gt(x, plus(y, z)), x, y, s(z)) |
| plus(n, 0) | → | n | | plus(n, s(m)) | → | s(plus(n, m)) |
| gt(0, v) | → | false | | gt(s(u), 0) | → | true |
| gt(s(u), s(v)) | → | gt(u, v) |
Original Signature
Termination of terms over the following signature is verified: f, plus, 0, s, false, true, gt
Problem 1: DependencyGraph
Dependency Pair Problem
Dependency Pairs
| f#(true, x, y, z) | → | plus#(y, z) | | f#(true, x, y, z) | → | f#(gt(x, plus(y, z)), x, s(y), z) |
| f#(true, x, y, z) | → | gt#(x, plus(y, z)) | | gt#(s(u), s(v)) | → | gt#(u, v) |
| f#(true, x, y, z) | → | f#(gt(x, plus(y, z)), x, y, s(z)) | | plus#(n, s(m)) | → | plus#(n, m) |
Rewrite Rules
| f(true, x, y, z) | → | f(gt(x, plus(y, z)), x, s(y), z) | | f(true, x, y, z) | → | f(gt(x, plus(y, z)), x, y, s(z)) |
| plus(n, 0) | → | n | | plus(n, s(m)) | → | s(plus(n, m)) |
| gt(0, v) | → | false | | gt(s(u), 0) | → | true |
| gt(s(u), s(v)) | → | gt(u, v) |
Original Signature
Termination of terms over the following signature is verified: f, plus, 0, s, true, false, gt
Strategy
The following SCCs where found
| f#(true, x, y, z) → f#(gt(x, plus(y, z)), x, s(y), z) | f#(true, x, y, z) → f#(gt(x, plus(y, z)), x, y, s(z)) |
| gt#(s(u), s(v)) → gt#(u, v) |
| plus#(n, s(m)) → plus#(n, m) |
Problem 3: SubtermCriterion
Dependency Pair Problem
Dependency Pairs
| gt#(s(u), s(v)) | → | gt#(u, v) |
Rewrite Rules
| f(true, x, y, z) | → | f(gt(x, plus(y, z)), x, s(y), z) | | f(true, x, y, z) | → | f(gt(x, plus(y, z)), x, y, s(z)) |
| plus(n, 0) | → | n | | plus(n, s(m)) | → | s(plus(n, m)) |
| gt(0, v) | → | false | | gt(s(u), 0) | → | true |
| gt(s(u), s(v)) | → | gt(u, v) |
Original Signature
Termination of terms over the following signature is verified: f, plus, 0, s, true, false, gt
Strategy
Projection
The following projection was used:
Thus, the following dependency pairs are removed:
| gt#(s(u), s(v)) | → | gt#(u, v) |
Problem 4: SubtermCriterion
Dependency Pair Problem
Dependency Pairs
| plus#(n, s(m)) | → | plus#(n, m) |
Rewrite Rules
| f(true, x, y, z) | → | f(gt(x, plus(y, z)), x, s(y), z) | | f(true, x, y, z) | → | f(gt(x, plus(y, z)), x, y, s(z)) |
| plus(n, 0) | → | n | | plus(n, s(m)) | → | s(plus(n, m)) |
| gt(0, v) | → | false | | gt(s(u), 0) | → | true |
| gt(s(u), s(v)) | → | gt(u, v) |
Original Signature
Termination of terms over the following signature is verified: f, plus, 0, s, true, false, gt
Strategy
Projection
The following projection was used:
Thus, the following dependency pairs are removed:
| plus#(n, s(m)) | → | plus#(n, m) |