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