TIMEOUT
The TRS could not be proven terminating. The proof attempt took 60001 ms.
The following DP Processors were used
Problem 1 was processed with processor DependencyGraph (21ms).
| – Problem 2 was processed with processor SubtermCriterion (2ms).
| – Problem 3 remains open; application of the following processors failed [SubtermCriterion (1ms), DependencyGraph (2ms), PolynomialLinearRange4iUR (237ms), DependencyGraph (1ms), PolynomialLinearRange8NegiUR (577ms), DependencyGraph (3ms), ReductionPairSAT (595ms), DependencyGraph (0ms), SizeChangePrinciple (38ms), ForwardNarrowing (1ms), BackwardInstantiation (1ms), ForwardInstantiation (24ms), Propagation (1ms)].
The following open problems remain:
Open Dependency Pair Problem 3
Dependency Pairs
| cond#(true, x, y) | → | cond#(gr(x, y), p(x), s(y)) |
Rewrite Rules
| cond(true, x, y) | → | cond(gr(x, y), p(x), s(y)) | | gr(0, x) | → | false |
| gr(s(x), 0) | → | true | | gr(s(x), s(y)) | → | gr(x, y) |
| p(0) | → | 0 | | p(s(x)) | → | x |
Original Signature
Termination of terms over the following signature is verified: 0, s, p, false, true, gr, cond
Problem 1: DependencyGraph
Dependency Pair Problem
Dependency Pairs
| cond#(true, x, y) | → | gr#(x, y) | | cond#(true, x, y) | → | p#(x) |
| cond#(true, x, y) | → | cond#(gr(x, y), p(x), s(y)) | | gr#(s(x), s(y)) | → | gr#(x, y) |
Rewrite Rules
| cond(true, x, y) | → | cond(gr(x, y), p(x), s(y)) | | gr(0, x) | → | false |
| gr(s(x), 0) | → | true | | gr(s(x), s(y)) | → | gr(x, y) |
| p(0) | → | 0 | | p(s(x)) | → | x |
Original Signature
Termination of terms over the following signature is verified: 0, s, p, true, false, gr, cond
Strategy
The following SCCs where found
| cond#(true, x, y) → cond#(gr(x, y), p(x), s(y)) |
| gr#(s(x), s(y)) → gr#(x, y) |
Problem 2: SubtermCriterion
Dependency Pair Problem
Dependency Pairs
| gr#(s(x), s(y)) | → | gr#(x, y) |
Rewrite Rules
| cond(true, x, y) | → | cond(gr(x, y), p(x), s(y)) | | gr(0, x) | → | false |
| gr(s(x), 0) | → | true | | gr(s(x), s(y)) | → | gr(x, y) |
| p(0) | → | 0 | | p(s(x)) | → | x |
Original Signature
Termination of terms over the following signature is verified: 0, s, p, true, false, gr, cond
Strategy
Projection
The following projection was used:
Thus, the following dependency pairs are removed:
| gr#(s(x), s(y)) | → | gr#(x, y) |