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 (101ms).
| – Problem 2 was processed with processor BackwardInstantiation (2ms).
| | – Problem 11 remains open; application of the following processors failed [ForwardInstantiation (4ms), Propagation (0ms), ForwardNarrowing (0ms), BackwardInstantiation (1ms), ForwardInstantiation (2ms), Propagation (1ms)].
| – Problem 3 was processed with processor SubtermCriterion (0ms).
| – Problem 4 was processed with processor SubtermCriterion (0ms).
| – Problem 5 was processed with processor SubtermCriterion (1ms).
| – Problem 6 was processed with processor SubtermCriterion (0ms).
| – Problem 7 was processed with processor SubtermCriterion (1ms).
| – Problem 8 was processed with processor SubtermCriterion (3ms).
| – Problem 9 was processed with processor SubtermCriterion (0ms).
| – Problem 10 was processed with processor SubtermCriterion (3ms).
The following open problems remain:
Open Dependency Pair Problem 2
Dependency Pairs
| ify#(true, x, y) | → | if#(ge(x, y), x, y) | | div#(x, y) | → | ify#(ge(y, s(0)), x, y) |
| if#(true, x, y) | → | div#(minus(x, y), y) |
Rewrite Rules
| ge(0, 0) | → | true | | ge(s(x), 0) | → | ge(x, 0) |
| ge(0, s(0)) | → | false | | ge(0, s(s(x))) | → | ge(0, s(x)) |
| ge(s(x), s(y)) | → | ge(x, y) | | minus(0, 0) | → | 0 |
| minus(0, s(x)) | → | minus(0, x) | | minus(s(x), 0) | → | s(minus(x, 0)) |
| minus(s(x), s(y)) | → | minus(x, y) | | plus(0, 0) | → | 0 |
| plus(0, s(x)) | → | s(plus(0, x)) | | plus(s(x), y) | → | s(plus(x, y)) |
| div(x, y) | → | ify(ge(y, s(0)), x, y) | | ify(false, x, y) | → | divByZeroError |
| ify(true, x, y) | → | if(ge(x, y), x, y) | | if(false, x, y) | → | 0 |
| if(true, x, y) | → | s(div(minus(x, y), y)) |
Original Signature
Termination of terms over the following signature is verified: plus, minus, 0, s, if, ify, divByZeroError, div, false, true, ge
Problem 1: DependencyGraph
Dependency Pair Problem
Dependency Pairs
| ify#(true, x, y) | → | ge#(x, y) | | ge#(s(x), 0) | → | ge#(x, 0) |
| minus#(0, s(x)) | → | minus#(0, x) | | minus#(s(x), 0) | → | minus#(x, 0) |
| ify#(true, x, y) | → | if#(ge(x, y), x, y) | | ge#(0, s(s(x))) | → | ge#(0, s(x)) |
| div#(x, y) | → | ify#(ge(y, s(0)), x, y) | | plus#(s(x), y) | → | plus#(x, y) |
| div#(x, y) | → | ge#(y, s(0)) | | ge#(s(x), s(y)) | → | ge#(x, y) |
| minus#(s(x), s(y)) | → | minus#(x, y) | | if#(true, x, y) | → | minus#(x, y) |
| if#(true, x, y) | → | div#(minus(x, y), y) | | plus#(0, s(x)) | → | plus#(0, x) |
Rewrite Rules
| ge(0, 0) | → | true | | ge(s(x), 0) | → | ge(x, 0) |
| ge(0, s(0)) | → | false | | ge(0, s(s(x))) | → | ge(0, s(x)) |
| ge(s(x), s(y)) | → | ge(x, y) | | minus(0, 0) | → | 0 |
| minus(0, s(x)) | → | minus(0, x) | | minus(s(x), 0) | → | s(minus(x, 0)) |
| minus(s(x), s(y)) | → | minus(x, y) | | plus(0, 0) | → | 0 |
| plus(0, s(x)) | → | s(plus(0, x)) | | plus(s(x), y) | → | s(plus(x, y)) |
| div(x, y) | → | ify(ge(y, s(0)), x, y) | | ify(false, x, y) | → | divByZeroError |
| ify(true, x, y) | → | if(ge(x, y), x, y) | | if(false, x, y) | → | 0 |
| if(true, x, y) | → | s(div(minus(x, y), y)) |
Original Signature
Termination of terms over the following signature is verified: plus, 0, minus, s, ify, if, div, divByZeroError, true, false, ge
Strategy
The following SCCs where found
| ge#(0, s(s(x))) → ge#(0, s(x)) |
| plus#(s(x), y) → plus#(x, y) |
| minus#(0, s(x)) → minus#(0, x) |
| minus#(s(x), s(y)) → minus#(x, y) |
| ge#(s(x), s(y)) → ge#(x, y) |
| plus#(0, s(x)) → plus#(0, x) |
| minus#(s(x), 0) → minus#(x, 0) |
| ify#(true, x, y) → if#(ge(x, y), x, y) | div#(x, y) → ify#(ge(y, s(0)), x, y) |
| if#(true, x, y) → div#(minus(x, y), y) |
Problem 2: BackwardInstantiation
Dependency Pair Problem
Dependency Pairs
| ify#(true, x, y) | → | if#(ge(x, y), x, y) | | div#(x, y) | → | ify#(ge(y, s(0)), x, y) |
| if#(true, x, y) | → | div#(minus(x, y), y) |
Rewrite Rules
| ge(0, 0) | → | true | | ge(s(x), 0) | → | ge(x, 0) |
| ge(0, s(0)) | → | false | | ge(0, s(s(x))) | → | ge(0, s(x)) |
| ge(s(x), s(y)) | → | ge(x, y) | | minus(0, 0) | → | 0 |
| minus(0, s(x)) | → | minus(0, x) | | minus(s(x), 0) | → | s(minus(x, 0)) |
| minus(s(x), s(y)) | → | minus(x, y) | | plus(0, 0) | → | 0 |
| plus(0, s(x)) | → | s(plus(0, x)) | | plus(s(x), y) | → | s(plus(x, y)) |
| div(x, y) | → | ify(ge(y, s(0)), x, y) | | ify(false, x, y) | → | divByZeroError |
| ify(true, x, y) | → | if(ge(x, y), x, y) | | if(false, x, y) | → | 0 |
| if(true, x, y) | → | s(div(minus(x, y), y)) |
Original Signature
Termination of terms over the following signature is verified: plus, 0, minus, s, ify, if, div, divByZeroError, true, false, ge
Strategy
Instantiation
For all potential predecessors l → r of the rule div
#(
x,
y) → ify
#(ge(
y, s(0)),
x,
y) on dependency pair chains it holds that:
- div#(x, y) matches r,
- all variables of div#(x, y) are embedded in constructor contexts, i.e., each subterm of div#(x, y), containing a variable is rooted by a constructor symbol.
Thus, div
#(
x,
y) → ify
#(ge(
y, s(0)),
x,
y) is replaced by instances determined through the above matching. These instances are:
| div#(minus(_x, _y), _y) → ify#(ge(_y, s(0)), minus(_x, _y), _y) |
Problem 3: SubtermCriterion
Dependency Pair Problem
Dependency Pairs
| minus#(s(x), s(y)) | → | minus#(x, y) |
Rewrite Rules
| ge(0, 0) | → | true | | ge(s(x), 0) | → | ge(x, 0) |
| ge(0, s(0)) | → | false | | ge(0, s(s(x))) | → | ge(0, s(x)) |
| ge(s(x), s(y)) | → | ge(x, y) | | minus(0, 0) | → | 0 |
| minus(0, s(x)) | → | minus(0, x) | | minus(s(x), 0) | → | s(minus(x, 0)) |
| minus(s(x), s(y)) | → | minus(x, y) | | plus(0, 0) | → | 0 |
| plus(0, s(x)) | → | s(plus(0, x)) | | plus(s(x), y) | → | s(plus(x, y)) |
| div(x, y) | → | ify(ge(y, s(0)), x, y) | | ify(false, x, y) | → | divByZeroError |
| ify(true, x, y) | → | if(ge(x, y), x, y) | | if(false, x, y) | → | 0 |
| if(true, x, y) | → | s(div(minus(x, y), y)) |
Original Signature
Termination of terms over the following signature is verified: plus, 0, minus, s, ify, if, div, divByZeroError, true, false, ge
Strategy
Projection
The following projection was used:
Thus, the following dependency pairs are removed:
| minus#(s(x), s(y)) | → | minus#(x, y) |
Problem 4: SubtermCriterion
Dependency Pair Problem
Dependency Pairs
| ge#(0, s(s(x))) | → | ge#(0, s(x)) |
Rewrite Rules
| ge(0, 0) | → | true | | ge(s(x), 0) | → | ge(x, 0) |
| ge(0, s(0)) | → | false | | ge(0, s(s(x))) | → | ge(0, s(x)) |
| ge(s(x), s(y)) | → | ge(x, y) | | minus(0, 0) | → | 0 |
| minus(0, s(x)) | → | minus(0, x) | | minus(s(x), 0) | → | s(minus(x, 0)) |
| minus(s(x), s(y)) | → | minus(x, y) | | plus(0, 0) | → | 0 |
| plus(0, s(x)) | → | s(plus(0, x)) | | plus(s(x), y) | → | s(plus(x, y)) |
| div(x, y) | → | ify(ge(y, s(0)), x, y) | | ify(false, x, y) | → | divByZeroError |
| ify(true, x, y) | → | if(ge(x, y), x, y) | | if(false, x, y) | → | 0 |
| if(true, x, y) | → | s(div(minus(x, y), y)) |
Original Signature
Termination of terms over the following signature is verified: plus, 0, minus, s, ify, if, div, divByZeroError, true, false, ge
Strategy
Projection
The following projection was used:
Thus, the following dependency pairs are removed:
| ge#(0, s(s(x))) | → | ge#(0, s(x)) |
Problem 5: SubtermCriterion
Dependency Pair Problem
Dependency Pairs
| minus#(s(x), 0) | → | minus#(x, 0) |
Rewrite Rules
| ge(0, 0) | → | true | | ge(s(x), 0) | → | ge(x, 0) |
| ge(0, s(0)) | → | false | | ge(0, s(s(x))) | → | ge(0, s(x)) |
| ge(s(x), s(y)) | → | ge(x, y) | | minus(0, 0) | → | 0 |
| minus(0, s(x)) | → | minus(0, x) | | minus(s(x), 0) | → | s(minus(x, 0)) |
| minus(s(x), s(y)) | → | minus(x, y) | | plus(0, 0) | → | 0 |
| plus(0, s(x)) | → | s(plus(0, x)) | | plus(s(x), y) | → | s(plus(x, y)) |
| div(x, y) | → | ify(ge(y, s(0)), x, y) | | ify(false, x, y) | → | divByZeroError |
| ify(true, x, y) | → | if(ge(x, y), x, y) | | if(false, x, y) | → | 0 |
| if(true, x, y) | → | s(div(minus(x, y), y)) |
Original Signature
Termination of terms over the following signature is verified: plus, 0, minus, s, ify, if, div, divByZeroError, true, false, ge
Strategy
Projection
The following projection was used:
Thus, the following dependency pairs are removed:
| minus#(s(x), 0) | → | minus#(x, 0) |
Problem 6: SubtermCriterion
Dependency Pair Problem
Dependency Pairs
| plus#(0, s(x)) | → | plus#(0, x) |
Rewrite Rules
| ge(0, 0) | → | true | | ge(s(x), 0) | → | ge(x, 0) |
| ge(0, s(0)) | → | false | | ge(0, s(s(x))) | → | ge(0, s(x)) |
| ge(s(x), s(y)) | → | ge(x, y) | | minus(0, 0) | → | 0 |
| minus(0, s(x)) | → | minus(0, x) | | minus(s(x), 0) | → | s(minus(x, 0)) |
| minus(s(x), s(y)) | → | minus(x, y) | | plus(0, 0) | → | 0 |
| plus(0, s(x)) | → | s(plus(0, x)) | | plus(s(x), y) | → | s(plus(x, y)) |
| div(x, y) | → | ify(ge(y, s(0)), x, y) | | ify(false, x, y) | → | divByZeroError |
| ify(true, x, y) | → | if(ge(x, y), x, y) | | if(false, x, y) | → | 0 |
| if(true, x, y) | → | s(div(minus(x, y), y)) |
Original Signature
Termination of terms over the following signature is verified: plus, 0, minus, s, ify, if, div, divByZeroError, true, false, ge
Strategy
Projection
The following projection was used:
Thus, the following dependency pairs are removed:
| plus#(0, s(x)) | → | plus#(0, x) |
Problem 7: SubtermCriterion
Dependency Pair Problem
Dependency Pairs
| ge#(s(x), s(y)) | → | ge#(x, y) |
Rewrite Rules
| ge(0, 0) | → | true | | ge(s(x), 0) | → | ge(x, 0) |
| ge(0, s(0)) | → | false | | ge(0, s(s(x))) | → | ge(0, s(x)) |
| ge(s(x), s(y)) | → | ge(x, y) | | minus(0, 0) | → | 0 |
| minus(0, s(x)) | → | minus(0, x) | | minus(s(x), 0) | → | s(minus(x, 0)) |
| minus(s(x), s(y)) | → | minus(x, y) | | plus(0, 0) | → | 0 |
| plus(0, s(x)) | → | s(plus(0, x)) | | plus(s(x), y) | → | s(plus(x, y)) |
| div(x, y) | → | ify(ge(y, s(0)), x, y) | | ify(false, x, y) | → | divByZeroError |
| ify(true, x, y) | → | if(ge(x, y), x, y) | | if(false, x, y) | → | 0 |
| if(true, x, y) | → | s(div(minus(x, y), y)) |
Original Signature
Termination of terms over the following signature is verified: plus, 0, minus, s, ify, if, div, divByZeroError, true, false, ge
Strategy
Projection
The following projection was used:
Thus, the following dependency pairs are removed:
| ge#(s(x), s(y)) | → | ge#(x, y) |
Problem 8: SubtermCriterion
Dependency Pair Problem
Dependency Pairs
| minus#(0, s(x)) | → | minus#(0, x) |
Rewrite Rules
| ge(0, 0) | → | true | | ge(s(x), 0) | → | ge(x, 0) |
| ge(0, s(0)) | → | false | | ge(0, s(s(x))) | → | ge(0, s(x)) |
| ge(s(x), s(y)) | → | ge(x, y) | | minus(0, 0) | → | 0 |
| minus(0, s(x)) | → | minus(0, x) | | minus(s(x), 0) | → | s(minus(x, 0)) |
| minus(s(x), s(y)) | → | minus(x, y) | | plus(0, 0) | → | 0 |
| plus(0, s(x)) | → | s(plus(0, x)) | | plus(s(x), y) | → | s(plus(x, y)) |
| div(x, y) | → | ify(ge(y, s(0)), x, y) | | ify(false, x, y) | → | divByZeroError |
| ify(true, x, y) | → | if(ge(x, y), x, y) | | if(false, x, y) | → | 0 |
| if(true, x, y) | → | s(div(minus(x, y), y)) |
Original Signature
Termination of terms over the following signature is verified: plus, 0, minus, s, ify, if, div, divByZeroError, true, false, ge
Strategy
Projection
The following projection was used:
Thus, the following dependency pairs are removed:
| minus#(0, s(x)) | → | minus#(0, x) |
Problem 9: SubtermCriterion
Dependency Pair Problem
Dependency Pairs
| plus#(s(x), y) | → | plus#(x, y) |
Rewrite Rules
| ge(0, 0) | → | true | | ge(s(x), 0) | → | ge(x, 0) |
| ge(0, s(0)) | → | false | | ge(0, s(s(x))) | → | ge(0, s(x)) |
| ge(s(x), s(y)) | → | ge(x, y) | | minus(0, 0) | → | 0 |
| minus(0, s(x)) | → | minus(0, x) | | minus(s(x), 0) | → | s(minus(x, 0)) |
| minus(s(x), s(y)) | → | minus(x, y) | | plus(0, 0) | → | 0 |
| plus(0, s(x)) | → | s(plus(0, x)) | | plus(s(x), y) | → | s(plus(x, y)) |
| div(x, y) | → | ify(ge(y, s(0)), x, y) | | ify(false, x, y) | → | divByZeroError |
| ify(true, x, y) | → | if(ge(x, y), x, y) | | if(false, x, y) | → | 0 |
| if(true, x, y) | → | s(div(minus(x, y), y)) |
Original Signature
Termination of terms over the following signature is verified: plus, 0, minus, s, ify, if, div, divByZeroError, true, false, ge
Strategy
Projection
The following projection was used:
Thus, the following dependency pairs are removed:
| plus#(s(x), y) | → | plus#(x, y) |
Problem 10: SubtermCriterion
Dependency Pair Problem
Dependency Pairs
Rewrite Rules
| ge(0, 0) | → | true | | ge(s(x), 0) | → | ge(x, 0) |
| ge(0, s(0)) | → | false | | ge(0, s(s(x))) | → | ge(0, s(x)) |
| ge(s(x), s(y)) | → | ge(x, y) | | minus(0, 0) | → | 0 |
| minus(0, s(x)) | → | minus(0, x) | | minus(s(x), 0) | → | s(minus(x, 0)) |
| minus(s(x), s(y)) | → | minus(x, y) | | plus(0, 0) | → | 0 |
| plus(0, s(x)) | → | s(plus(0, x)) | | plus(s(x), y) | → | s(plus(x, y)) |
| div(x, y) | → | ify(ge(y, s(0)), x, y) | | ify(false, x, y) | → | divByZeroError |
| ify(true, x, y) | → | if(ge(x, y), x, y) | | if(false, x, y) | → | 0 |
| if(true, x, y) | → | s(div(minus(x, y), y)) |
Original Signature
Termination of terms over the following signature is verified: plus, 0, minus, s, ify, if, div, divByZeroError, true, false, ge
Strategy
Projection
The following projection was used:
Thus, the following dependency pairs are removed: