TIMEOUT
The TRS could not be proven terminating. The proof attempt took 60003 ms.
The following DP Processors were used
Problem 1 was processed with processor PolynomialLinearRange4iUR (487ms).
| – Problem 2 was processed with processor ForwardNarrowing (1ms).
| | – Problem 3 was processed with processor ForwardNarrowing (3ms).
| | | – Problem 4 was processed with processor ForwardNarrowing (2ms).
| | | | – Problem 5 was processed with processor ForwardNarrowing (2ms).
| | | | | – Problem 6 was processed with processor ForwardNarrowing (1ms).
| | | | | | – Problem 7 was processed with processor ForwardNarrowing (1ms).
| | | | | | | – Problem 8 was processed with processor ForwardNarrowing (2ms).
| | | | | | | | – Problem 9 was processed with processor ForwardNarrowing (3ms).
| | | | | | | | | – Problem 10 was processed with processor ForwardNarrowing (1ms).
| | | | | | | | | | – Problem 11 was processed with processor ForwardNarrowing (2ms).
| | | | | | | | | | | – Problem 12 was processed with processor ForwardNarrowing (1ms).
| | | | | | | | | | | | – Problem 13 was processed with processor ForwardNarrowing (1ms).
| | | | | | | | | | | | | – Problem 14 was processed with processor ForwardNarrowing (2ms).
| | | | | | | | | | | | | | – Problem 15 was processed with processor ForwardNarrowing (2ms).
| | | | | | | | | | | | | | | – Problem 16 was processed with processor ForwardNarrowing (2ms).
| | | | | | | | | | | | | | | | – Problem 17 was processed with processor ForwardNarrowing (2ms).
| | | | | | | | | | | | | | | | | – Problem 18 was processed with processor ForwardNarrowing (3ms).
| | | | | | | | | | | | | | | | | | – Problem 19 was processed with processor ForwardNarrowing (2ms).
| | | | | | | | | | | | | | | | | | | – Problem 20 was processed with processor ForwardNarrowing (2ms).
| | | | | | | | | | | | | | | | | | | | – Problem 21 was processed with processor ForwardNarrowing (4ms).
| | | | | | | | | | | | | | | | | | | | | – Problem 22 was processed with processor ForwardNarrowing (7ms).
| | | | | | | | | | | | | | | | | | | | | | – Problem 23 was processed with processor ForwardNarrowing (23ms).
| | | | | | | | | | | | | | | | | | | | | | | – Problem 24 was processed with processor ForwardNarrowing (49ms).
| | | | | | | | | | | | | | | | | | | | | | | | – Problem 25 was processed with processor ForwardNarrowing (69ms).
| | | | | | | | | | | | | | | | | | | | | | | | | – Problem 26 remains open; application of the following processors failed [ForwardNarrowing (67ms), ForwardNarrowing (69ms), ForwardNarrowing (98ms), ForwardNarrowing (69ms), ForwardNarrowing (68ms), ForwardNarrowing (73ms), ForwardNarrowing (71ms), ForwardNarrowing (73ms), ForwardNarrowing (75ms), ForwardNarrowing (74ms), ForwardNarrowing (72ms), ForwardNarrowing (73ms), ForwardNarrowing (77ms), ForwardNarrowing (76ms), ForwardNarrowing (78ms), ForwardNarrowing (76ms), ForwardNarrowing (79ms), ForwardNarrowing (78ms), ForwardNarrowing (80ms), ForwardNarrowing (80ms), ForwardNarrowing (78ms), ForwardNarrowing (80ms), ForwardNarrowing (83ms), ForwardNarrowing (80ms), ForwardNarrowing (84ms), ForwardNarrowing (84ms), ForwardNarrowing (83ms), ForwardNarrowing (86ms), ForwardNarrowing (85ms), ForwardNarrowing (88ms), ForwardNarrowing (94ms), ForwardNarrowing (timeout)].
The following open problems remain:
Open Dependency Pair Problem 2
Dependency Pairs
| f#(c, f(a, x)) | → | f#(a, f(c, x)) | | f#(a, f(b, x)) | → | f#(b, f(a, x)) |
| f#(b, f(c, x)) | → | f#(c, f(b, x)) |
Rewrite Rules
| f(a, f(b, x)) | → | f(b, f(a, x)) | | f(b, f(c, x)) | → | f(c, f(b, x)) |
| f(c, f(a, x)) | → | f(a, f(c, x)) |
Original Signature
Termination of terms over the following signature is verified: f, b, c, a
Problem 1: PolynomialLinearRange4iUR
Dependency Pair Problem
Dependency Pairs
| f#(a, f(b, x)) | → | f#(a, x) | | f#(c, f(a, x)) | → | f#(a, f(c, x)) |
| f#(b, f(c, x)) | → | f#(b, x) | | f#(a, f(b, x)) | → | f#(b, f(a, x)) |
| f#(c, f(a, x)) | → | f#(c, x) | | f#(b, f(c, x)) | → | f#(c, f(b, x)) |
Rewrite Rules
| f(a, f(b, x)) | → | f(b, f(a, x)) | | f(b, f(c, x)) | → | f(c, f(b, x)) |
| f(c, f(a, x)) | → | f(a, f(c, x)) |
Original Signature
Termination of terms over the following signature is verified: f, b, c, a
Strategy
Polynomial Interpretation
- a: 0
- b: 0
- c: 0
- f(x,y): y + 1
- f#(x,y): 2y
Improved Usable rules
| f(b, f(c, x)) | → | f(c, f(b, x)) | | f(a, f(b, x)) | → | f(b, f(a, x)) |
| f(c, f(a, x)) | → | f(a, f(c, x)) |
The following dependency pairs are strictly oriented by an ordering on the given polynomial interpretation, thus they are removed:
| f#(a, f(b, x)) | → | f#(a, x) | | f#(b, f(c, x)) | → | f#(b, x) |
| f#(c, f(a, x)) | → | f#(c, x) |
Problem 2: ForwardNarrowing
Dependency Pair Problem
Dependency Pairs
| f#(c, f(a, x)) | → | f#(a, f(c, x)) | | f#(a, f(b, x)) | → | f#(b, f(a, x)) |
| f#(b, f(c, x)) | → | f#(c, f(b, x)) |
Rewrite Rules
| f(a, f(b, x)) | → | f(b, f(a, x)) | | f(b, f(c, x)) | → | f(c, f(b, x)) |
| f(c, f(a, x)) | → | f(a, f(c, x)) |
Original Signature
Termination of terms over the following signature is verified: f, b, c, a
Strategy
The right-hand side of the rule f
#(c, f(a,
x)) → f
#(a, f(c,
x)) is narrowed to the following relevant and irrelevant terms (a narrowing is irrelevant if by dropping it the correctness (and completeness) of the processor is not influenced).
| Relevant Terms | Irrelevant Terms |
|---|
| f#(a, f(a, f(c, _x31))) | |
Thus, the rule f
#(c, f(a,
x)) → f
#(a, f(c,
x)) is replaced by the following rules:
| f#(c, f(a, f(a, _x31))) → f#(a, f(a, f(c, _x31))) |
Problem 3: ForwardNarrowing
Dependency Pair Problem
Dependency Pairs
| f#(c, f(a, f(a, _x31))) | → | f#(a, f(a, f(c, _x31))) | | f#(a, f(b, x)) | → | f#(b, f(a, x)) |
| f#(b, f(c, x)) | → | f#(c, f(b, x)) |
Rewrite Rules
| f(a, f(b, x)) | → | f(b, f(a, x)) | | f(b, f(c, x)) | → | f(c, f(b, x)) |
| f(c, f(a, x)) | → | f(a, f(c, x)) |
Original Signature
Termination of terms over the following signature is verified: f, b, c, a
Strategy
The right-hand side of the rule f
#(c, f(a, f(a,
_x31))) → f
#(a, f(a, f(c,
_x31))) is narrowed to the following relevant and irrelevant terms (a narrowing is irrelevant if by dropping it the correctness (and completeness) of the processor is not influenced).
| Relevant Terms | Irrelevant Terms |
|---|
| f#(a, f(a, f(a, f(c, _x61)))) | |
Thus, the rule f
#(c, f(a, f(a,
_x31))) → f
#(a, f(a, f(c,
_x31))) is replaced by the following rules:
| f#(c, f(a, f(a, f(a, _x61)))) → f#(a, f(a, f(a, f(c, _x61)))) |
Problem 4: ForwardNarrowing
Dependency Pair Problem
Dependency Pairs
| f#(c, f(a, f(a, f(a, _x61)))) | → | f#(a, f(a, f(a, f(c, _x61)))) | | f#(a, f(b, x)) | → | f#(b, f(a, x)) |
| f#(b, f(c, x)) | → | f#(c, f(b, x)) |
Rewrite Rules
| f(a, f(b, x)) | → | f(b, f(a, x)) | | f(b, f(c, x)) | → | f(c, f(b, x)) |
| f(c, f(a, x)) | → | f(a, f(c, x)) |
Original Signature
Termination of terms over the following signature is verified: f, b, c, a
Strategy
The right-hand side of the rule f
#(c, f(a, f(a, f(a,
_x61)))) → f
#(a, f(a, f(a, f(c,
_x61)))) is narrowed to the following relevant and irrelevant terms (a narrowing is irrelevant if by dropping it the correctness (and completeness) of the processor is not influenced).
| Relevant Terms | Irrelevant Terms |
|---|
| f#(a, f(a, f(a, f(a, f(c, _x71))))) | |
Thus, the rule f
#(c, f(a, f(a, f(a,
_x61)))) → f
#(a, f(a, f(a, f(c,
_x61)))) is replaced by the following rules:
| f#(c, f(a, f(a, f(a, f(a, _x71))))) → f#(a, f(a, f(a, f(a, f(c, _x71))))) |
Problem 5: ForwardNarrowing
Dependency Pair Problem
Dependency Pairs
| f#(c, f(a, f(a, f(a, f(a, _x71))))) | → | f#(a, f(a, f(a, f(a, f(c, _x71))))) | | f#(a, f(b, x)) | → | f#(b, f(a, x)) |
| f#(b, f(c, x)) | → | f#(c, f(b, x)) |
Rewrite Rules
| f(a, f(b, x)) | → | f(b, f(a, x)) | | f(b, f(c, x)) | → | f(c, f(b, x)) |
| f(c, f(a, x)) | → | f(a, f(c, x)) |
Original Signature
Termination of terms over the following signature is verified: f, b, c, a
Strategy
The right-hand side of the rule f
#(c, f(a, f(a, f(a, f(a,
_x71))))) → f
#(a, f(a, f(a, f(a, f(c,
_x71))))) is narrowed to the following relevant and irrelevant terms (a narrowing is irrelevant if by dropping it the correctness (and completeness) of the processor is not influenced).
| Relevant Terms | Irrelevant Terms |
|---|
| f#(a, f(a, f(a, f(a, f(a, f(c, _x101)))))) | |
Thus, the rule f
#(c, f(a, f(a, f(a, f(a,
_x71))))) → f
#(a, f(a, f(a, f(a, f(c,
_x71))))) is replaced by the following rules:
| f#(c, f(a, f(a, f(a, f(a, f(a, _x101)))))) → f#(a, f(a, f(a, f(a, f(a, f(c, _x101)))))) |
Problem 6: ForwardNarrowing
Dependency Pair Problem
Dependency Pairs
| f#(a, f(b, x)) | → | f#(b, f(a, x)) | | f#(b, f(c, x)) | → | f#(c, f(b, x)) |
| f#(c, f(a, f(a, f(a, f(a, f(a, _x101)))))) | → | f#(a, f(a, f(a, f(a, f(a, f(c, _x101)))))) |
Rewrite Rules
| f(a, f(b, x)) | → | f(b, f(a, x)) | | f(b, f(c, x)) | → | f(c, f(b, x)) |
| f(c, f(a, x)) | → | f(a, f(c, x)) |
Original Signature
Termination of terms over the following signature is verified: f, b, c, a
Strategy
The right-hand side of the rule f
#(a, f(b,
x)) → f
#(b, f(a,
x)) is narrowed to the following relevant and irrelevant terms (a narrowing is irrelevant if by dropping it the correctness (and completeness) of the processor is not influenced).
| Relevant Terms | Irrelevant Terms |
|---|
| f#(b, f(b, f(a, _x31))) | |
Thus, the rule f
#(a, f(b,
x)) → f
#(b, f(a,
x)) is replaced by the following rules:
| f#(a, f(b, f(b, _x31))) → f#(b, f(b, f(a, _x31))) |
Problem 7: ForwardNarrowing
Dependency Pair Problem
Dependency Pairs
| f#(a, f(b, f(b, _x31))) | → | f#(b, f(b, f(a, _x31))) | | f#(c, f(a, f(a, f(a, f(a, f(a, _x101)))))) | → | f#(a, f(a, f(a, f(a, f(a, f(c, _x101)))))) |
| f#(b, f(c, x)) | → | f#(c, f(b, x)) |
Rewrite Rules
| f(a, f(b, x)) | → | f(b, f(a, x)) | | f(b, f(c, x)) | → | f(c, f(b, x)) |
| f(c, f(a, x)) | → | f(a, f(c, x)) |
Original Signature
Termination of terms over the following signature is verified: f, b, c, a
Strategy
The right-hand side of the rule f
#(a, f(b, f(b,
_x31))) → f
#(b, f(b, f(a,
_x31))) is narrowed to the following relevant and irrelevant terms (a narrowing is irrelevant if by dropping it the correctness (and completeness) of the processor is not influenced).
| Relevant Terms | Irrelevant Terms |
|---|
| f#(b, f(b, f(b, f(a, _x61)))) | |
Thus, the rule f
#(a, f(b, f(b,
_x31))) → f
#(b, f(b, f(a,
_x31))) is replaced by the following rules:
| f#(a, f(b, f(b, f(b, _x61)))) → f#(b, f(b, f(b, f(a, _x61)))) |
Problem 8: ForwardNarrowing
Dependency Pair Problem
Dependency Pairs
| f#(a, f(b, f(b, f(b, _x61)))) | → | f#(b, f(b, f(b, f(a, _x61)))) | | f#(b, f(c, x)) | → | f#(c, f(b, x)) |
| f#(c, f(a, f(a, f(a, f(a, f(a, _x101)))))) | → | f#(a, f(a, f(a, f(a, f(a, f(c, _x101)))))) |
Rewrite Rules
| f(a, f(b, x)) | → | f(b, f(a, x)) | | f(b, f(c, x)) | → | f(c, f(b, x)) |
| f(c, f(a, x)) | → | f(a, f(c, x)) |
Original Signature
Termination of terms over the following signature is verified: f, b, c, a
Strategy
The right-hand side of the rule f
#(a, f(b, f(b, f(b,
_x61)))) → f
#(b, f(b, f(b, f(a,
_x61)))) is narrowed to the following relevant and irrelevant terms (a narrowing is irrelevant if by dropping it the correctness (and completeness) of the processor is not influenced).
| Relevant Terms | Irrelevant Terms |
|---|
| f#(b, f(b, f(b, f(b, f(a, _x71))))) | |
Thus, the rule f
#(a, f(b, f(b, f(b,
_x61)))) → f
#(b, f(b, f(b, f(a,
_x61)))) is replaced by the following rules:
| f#(a, f(b, f(b, f(b, f(b, _x71))))) → f#(b, f(b, f(b, f(b, f(a, _x71))))) |
Problem 9: ForwardNarrowing
Dependency Pair Problem
Dependency Pairs
| f#(a, f(b, f(b, f(b, f(b, _x71))))) | → | f#(b, f(b, f(b, f(b, f(a, _x71))))) | | f#(c, f(a, f(a, f(a, f(a, f(a, _x101)))))) | → | f#(a, f(a, f(a, f(a, f(a, f(c, _x101)))))) |
| f#(b, f(c, x)) | → | f#(c, f(b, x)) |
Rewrite Rules
| f(a, f(b, x)) | → | f(b, f(a, x)) | | f(b, f(c, x)) | → | f(c, f(b, x)) |
| f(c, f(a, x)) | → | f(a, f(c, x)) |
Original Signature
Termination of terms over the following signature is verified: f, b, c, a
Strategy
The right-hand side of the rule f
#(a, f(b, f(b, f(b, f(b,
_x71))))) → f
#(b, f(b, f(b, f(b, f(a,
_x71))))) is narrowed to the following relevant and irrelevant terms (a narrowing is irrelevant if by dropping it the correctness (and completeness) of the processor is not influenced).
| Relevant Terms | Irrelevant Terms |
|---|
| f#(b, f(b, f(b, f(b, f(b, f(a, _x101)))))) | |
Thus, the rule f
#(a, f(b, f(b, f(b, f(b,
_x71))))) → f
#(b, f(b, f(b, f(b, f(a,
_x71))))) is replaced by the following rules:
| f#(a, f(b, f(b, f(b, f(b, f(b, _x101)))))) → f#(b, f(b, f(b, f(b, f(b, f(a, _x101)))))) |
Problem 10: ForwardNarrowing
Dependency Pair Problem
Dependency Pairs
| f#(b, f(c, x)) | → | f#(c, f(b, x)) | | f#(c, f(a, f(a, f(a, f(a, f(a, _x101)))))) | → | f#(a, f(a, f(a, f(a, f(a, f(c, _x101)))))) |
| f#(a, f(b, f(b, f(b, f(b, f(b, _x101)))))) | → | f#(b, f(b, f(b, f(b, f(b, f(a, _x101)))))) |
Rewrite Rules
| f(a, f(b, x)) | → | f(b, f(a, x)) | | f(b, f(c, x)) | → | f(c, f(b, x)) |
| f(c, f(a, x)) | → | f(a, f(c, x)) |
Original Signature
Termination of terms over the following signature is verified: f, b, c, a
Strategy
The right-hand side of the rule f
#(c, f(a, f(a, f(a, f(a, f(a,
_x101)))))) → f
#(a, f(a, f(a, f(a, f(a, f(c,
_x101)))))) is narrowed to the following relevant and irrelevant terms (a narrowing is irrelevant if by dropping it the correctness (and completeness) of the processor is not influenced).
| Relevant Terms | Irrelevant Terms |
|---|
| f#(a, f(a, f(a, f(a, f(a, f(a, f(c, _x111))))))) | |
Thus, the rule f
#(c, f(a, f(a, f(a, f(a, f(a,
_x101)))))) → f
#(a, f(a, f(a, f(a, f(a, f(c,
_x101)))))) is replaced by the following rules:
| f#(c, f(a, f(a, f(a, f(a, f(a, f(a, _x111))))))) → f#(a, f(a, f(a, f(a, f(a, f(a, f(c, _x111))))))) |
Problem 11: ForwardNarrowing
Dependency Pair Problem
Dependency Pairs
| f#(c, f(a, f(a, f(a, f(a, f(a, f(a, _x111))))))) | → | f#(a, f(a, f(a, f(a, f(a, f(a, f(c, _x111))))))) | | f#(b, f(c, x)) | → | f#(c, f(b, x)) |
| f#(a, f(b, f(b, f(b, f(b, f(b, _x101)))))) | → | f#(b, f(b, f(b, f(b, f(b, f(a, _x101)))))) |
Rewrite Rules
| f(a, f(b, x)) | → | f(b, f(a, x)) | | f(b, f(c, x)) | → | f(c, f(b, x)) |
| f(c, f(a, x)) | → | f(a, f(c, x)) |
Original Signature
Termination of terms over the following signature is verified: f, b, c, a
Strategy
The right-hand side of the rule f
#(c, f(a, f(a, f(a, f(a, f(a, f(a,
_x111))))))) → f
#(a, f(a, f(a, f(a, f(a, f(a, f(c,
_x111))))))) is narrowed to the following relevant and irrelevant terms (a narrowing is irrelevant if by dropping it the correctness (and completeness) of the processor is not influenced).
| Relevant Terms | Irrelevant Terms |
|---|
| f#(a, f(a, f(a, f(a, f(a, f(a, f(a, f(c, _x141)))))))) | |
Thus, the rule f
#(c, f(a, f(a, f(a, f(a, f(a, f(a,
_x111))))))) → f
#(a, f(a, f(a, f(a, f(a, f(a, f(c,
_x111))))))) is replaced by the following rules:
| f#(c, f(a, f(a, f(a, f(a, f(a, f(a, f(a, _x141)))))))) → f#(a, f(a, f(a, f(a, f(a, f(a, f(a, f(c, _x141)))))))) |
Problem 12: ForwardNarrowing
Dependency Pair Problem
Dependency Pairs
| f#(b, f(c, x)) | → | f#(c, f(b, x)) | | f#(a, f(b, f(b, f(b, f(b, f(b, _x101)))))) | → | f#(b, f(b, f(b, f(b, f(b, f(a, _x101)))))) |
| f#(c, f(a, f(a, f(a, f(a, f(a, f(a, f(a, _x141)))))))) | → | f#(a, f(a, f(a, f(a, f(a, f(a, f(a, f(c, _x141)))))))) |
Rewrite Rules
| f(a, f(b, x)) | → | f(b, f(a, x)) | | f(b, f(c, x)) | → | f(c, f(b, x)) |
| f(c, f(a, x)) | → | f(a, f(c, x)) |
Original Signature
Termination of terms over the following signature is verified: f, b, c, a
Strategy
The right-hand side of the rule f
#(b, f(c,
x)) → f
#(c, f(b,
x)) is narrowed to the following relevant and irrelevant terms (a narrowing is irrelevant if by dropping it the correctness (and completeness) of the processor is not influenced).
| Relevant Terms | Irrelevant Terms |
|---|
| f#(c, f(c, f(b, _x31))) | |
Thus, the rule f
#(b, f(c,
x)) → f
#(c, f(b,
x)) is replaced by the following rules:
| f#(b, f(c, f(c, _x31))) → f#(c, f(c, f(b, _x31))) |
Problem 13: ForwardNarrowing
Dependency Pair Problem
Dependency Pairs
| f#(b, f(c, f(c, _x31))) | → | f#(c, f(c, f(b, _x31))) | | f#(a, f(b, f(b, f(b, f(b, f(b, _x101)))))) | → | f#(b, f(b, f(b, f(b, f(b, f(a, _x101)))))) |
| f#(c, f(a, f(a, f(a, f(a, f(a, f(a, f(a, _x141)))))))) | → | f#(a, f(a, f(a, f(a, f(a, f(a, f(a, f(c, _x141)))))))) |
Rewrite Rules
| f(a, f(b, x)) | → | f(b, f(a, x)) | | f(b, f(c, x)) | → | f(c, f(b, x)) |
| f(c, f(a, x)) | → | f(a, f(c, x)) |
Original Signature
Termination of terms over the following signature is verified: f, b, c, a
Strategy
The right-hand side of the rule f
#(b, f(c, f(c,
_x31))) → f
#(c, f(c, f(b,
_x31))) is narrowed to the following relevant and irrelevant terms (a narrowing is irrelevant if by dropping it the correctness (and completeness) of the processor is not influenced).
| Relevant Terms | Irrelevant Terms |
|---|
| f#(c, f(c, f(c, f(b, _x61)))) | |
Thus, the rule f
#(b, f(c, f(c,
_x31))) → f
#(c, f(c, f(b,
_x31))) is replaced by the following rules:
| f#(b, f(c, f(c, f(c, _x61)))) → f#(c, f(c, f(c, f(b, _x61)))) |
Problem 14: ForwardNarrowing
Dependency Pair Problem
Dependency Pairs
| f#(a, f(b, f(b, f(b, f(b, f(b, _x101)))))) | → | f#(b, f(b, f(b, f(b, f(b, f(a, _x101)))))) | | f#(b, f(c, f(c, f(c, _x61)))) | → | f#(c, f(c, f(c, f(b, _x61)))) |
| f#(c, f(a, f(a, f(a, f(a, f(a, f(a, f(a, _x141)))))))) | → | f#(a, f(a, f(a, f(a, f(a, f(a, f(a, f(c, _x141)))))))) |
Rewrite Rules
| f(a, f(b, x)) | → | f(b, f(a, x)) | | f(b, f(c, x)) | → | f(c, f(b, x)) |
| f(c, f(a, x)) | → | f(a, f(c, x)) |
Original Signature
Termination of terms over the following signature is verified: f, b, c, a
Strategy
The right-hand side of the rule f
#(b, f(c, f(c, f(c,
_x61)))) → f
#(c, f(c, f(c, f(b,
_x61)))) is narrowed to the following relevant and irrelevant terms (a narrowing is irrelevant if by dropping it the correctness (and completeness) of the processor is not influenced).
| Relevant Terms | Irrelevant Terms |
|---|
| f#(c, f(c, f(c, f(c, f(b, _x71))))) | |
Thus, the rule f
#(b, f(c, f(c, f(c,
_x61)))) → f
#(c, f(c, f(c, f(b,
_x61)))) is replaced by the following rules:
| f#(b, f(c, f(c, f(c, f(c, _x71))))) → f#(c, f(c, f(c, f(c, f(b, _x71))))) |
Problem 15: ForwardNarrowing
Dependency Pair Problem
Dependency Pairs
| f#(b, f(c, f(c, f(c, f(c, _x71))))) | → | f#(c, f(c, f(c, f(c, f(b, _x71))))) | | f#(a, f(b, f(b, f(b, f(b, f(b, _x101)))))) | → | f#(b, f(b, f(b, f(b, f(b, f(a, _x101)))))) |
| f#(c, f(a, f(a, f(a, f(a, f(a, f(a, f(a, _x141)))))))) | → | f#(a, f(a, f(a, f(a, f(a, f(a, f(a, f(c, _x141)))))))) |
Rewrite Rules
| f(a, f(b, x)) | → | f(b, f(a, x)) | | f(b, f(c, x)) | → | f(c, f(b, x)) |
| f(c, f(a, x)) | → | f(a, f(c, x)) |
Original Signature
Termination of terms over the following signature is verified: f, b, c, a
Strategy
The right-hand side of the rule f
#(b, f(c, f(c, f(c, f(c,
_x71))))) → f
#(c, f(c, f(c, f(c, f(b,
_x71))))) is narrowed to the following relevant and irrelevant terms (a narrowing is irrelevant if by dropping it the correctness (and completeness) of the processor is not influenced).
| Relevant Terms | Irrelevant Terms |
|---|
| f#(c, f(c, f(c, f(c, f(c, f(b, _x101)))))) | |
Thus, the rule f
#(b, f(c, f(c, f(c, f(c,
_x71))))) → f
#(c, f(c, f(c, f(c, f(b,
_x71))))) is replaced by the following rules:
| f#(b, f(c, f(c, f(c, f(c, f(c, _x101)))))) → f#(c, f(c, f(c, f(c, f(c, f(b, _x101)))))) |
Problem 16: ForwardNarrowing
Dependency Pair Problem
Dependency Pairs
| f#(a, f(b, f(b, f(b, f(b, f(b, _x101)))))) | → | f#(b, f(b, f(b, f(b, f(b, f(a, _x101)))))) | | f#(b, f(c, f(c, f(c, f(c, f(c, _x101)))))) | → | f#(c, f(c, f(c, f(c, f(c, f(b, _x101)))))) |
| f#(c, f(a, f(a, f(a, f(a, f(a, f(a, f(a, _x141)))))))) | → | f#(a, f(a, f(a, f(a, f(a, f(a, f(a, f(c, _x141)))))))) |
Rewrite Rules
| f(a, f(b, x)) | → | f(b, f(a, x)) | | f(b, f(c, x)) | → | f(c, f(b, x)) |
| f(c, f(a, x)) | → | f(a, f(c, x)) |
Original Signature
Termination of terms over the following signature is verified: f, b, c, a
Strategy
The right-hand side of the rule f
#(b, f(c, f(c, f(c, f(c, f(c,
_x101)))))) → f
#(c, f(c, f(c, f(c, f(c, f(b,
_x101)))))) is narrowed to the following relevant and irrelevant terms (a narrowing is irrelevant if by dropping it the correctness (and completeness) of the processor is not influenced).
| Relevant Terms | Irrelevant Terms |
|---|
| f#(c, f(c, f(c, f(c, f(c, f(c, f(b, _x111))))))) | |
Thus, the rule f
#(b, f(c, f(c, f(c, f(c, f(c,
_x101)))))) → f
#(c, f(c, f(c, f(c, f(c, f(b,
_x101)))))) is replaced by the following rules:
| f#(b, f(c, f(c, f(c, f(c, f(c, f(c, _x111))))))) → f#(c, f(c, f(c, f(c, f(c, f(c, f(b, _x111))))))) |
Problem 17: ForwardNarrowing
Dependency Pair Problem
Dependency Pairs
| f#(b, f(c, f(c, f(c, f(c, f(c, f(c, _x111))))))) | → | f#(c, f(c, f(c, f(c, f(c, f(c, f(b, _x111))))))) | | f#(a, f(b, f(b, f(b, f(b, f(b, _x101)))))) | → | f#(b, f(b, f(b, f(b, f(b, f(a, _x101)))))) |
| f#(c, f(a, f(a, f(a, f(a, f(a, f(a, f(a, _x141)))))))) | → | f#(a, f(a, f(a, f(a, f(a, f(a, f(a, f(c, _x141)))))))) |
Rewrite Rules
| f(a, f(b, x)) | → | f(b, f(a, x)) | | f(b, f(c, x)) | → | f(c, f(b, x)) |
| f(c, f(a, x)) | → | f(a, f(c, x)) |
Original Signature
Termination of terms over the following signature is verified: f, b, c, a
Strategy
The right-hand side of the rule f
#(b, f(c, f(c, f(c, f(c, f(c, f(c,
_x111))))))) → f
#(c, f(c, f(c, f(c, f(c, f(c, f(b,
_x111))))))) is narrowed to the following relevant and irrelevant terms (a narrowing is irrelevant if by dropping it the correctness (and completeness) of the processor is not influenced).
| Relevant Terms | Irrelevant Terms |
|---|
| f#(c, f(c, f(c, f(c, f(c, f(c, f(c, f(b, _x141)))))))) | |
Thus, the rule f
#(b, f(c, f(c, f(c, f(c, f(c, f(c,
_x111))))))) → f
#(c, f(c, f(c, f(c, f(c, f(c, f(b,
_x111))))))) is replaced by the following rules:
| f#(b, f(c, f(c, f(c, f(c, f(c, f(c, f(c, _x141)))))))) → f#(c, f(c, f(c, f(c, f(c, f(c, f(c, f(b, _x141)))))))) |
Problem 18: ForwardNarrowing
Dependency Pair Problem
Dependency Pairs
| f#(b, f(c, f(c, f(c, f(c, f(c, f(c, f(c, _x141)))))))) | → | f#(c, f(c, f(c, f(c, f(c, f(c, f(c, f(b, _x141)))))))) | | f#(a, f(b, f(b, f(b, f(b, f(b, _x101)))))) | → | f#(b, f(b, f(b, f(b, f(b, f(a, _x101)))))) |
| f#(c, f(a, f(a, f(a, f(a, f(a, f(a, f(a, _x141)))))))) | → | f#(a, f(a, f(a, f(a, f(a, f(a, f(a, f(c, _x141)))))))) |
Rewrite Rules
| f(a, f(b, x)) | → | f(b, f(a, x)) | | f(b, f(c, x)) | → | f(c, f(b, x)) |
| f(c, f(a, x)) | → | f(a, f(c, x)) |
Original Signature
Termination of terms over the following signature is verified: f, b, c, a
Strategy
The right-hand side of the rule f
#(b, f(c, f(c, f(c, f(c, f(c, f(c, f(c,
_x141)))))))) → f
#(c, f(c, f(c, f(c, f(c, f(c, f(c, f(b,
_x141)))))))) is narrowed to the following relevant and irrelevant terms (a narrowing is irrelevant if by dropping it the correctness (and completeness) of the processor is not influenced).
| Relevant Terms | Irrelevant Terms |
|---|
| f#(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(b, _x151))))))))) | |
Thus, the rule f
#(b, f(c, f(c, f(c, f(c, f(c, f(c, f(c,
_x141)))))))) → f
#(c, f(c, f(c, f(c, f(c, f(c, f(c, f(b,
_x141)))))))) is replaced by the following rules:
| f#(b, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, _x151))))))))) → f#(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(b, _x151))))))))) |
Problem 19: ForwardNarrowing
Dependency Pair Problem
Dependency Pairs
| f#(b, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, _x151))))))))) | → | f#(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(b, _x151))))))))) | | f#(a, f(b, f(b, f(b, f(b, f(b, _x101)))))) | → | f#(b, f(b, f(b, f(b, f(b, f(a, _x101)))))) |
| f#(c, f(a, f(a, f(a, f(a, f(a, f(a, f(a, _x141)))))))) | → | f#(a, f(a, f(a, f(a, f(a, f(a, f(a, f(c, _x141)))))))) |
Rewrite Rules
| f(a, f(b, x)) | → | f(b, f(a, x)) | | f(b, f(c, x)) | → | f(c, f(b, x)) |
| f(c, f(a, x)) | → | f(a, f(c, x)) |
Original Signature
Termination of terms over the following signature is verified: f, b, c, a
Strategy
The right-hand side of the rule f
#(b, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c,
_x151))))))))) → f
#(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(b,
_x151))))))))) is narrowed to the following relevant and irrelevant terms (a narrowing is irrelevant if by dropping it the correctness (and completeness) of the processor is not influenced).
| Relevant Terms | Irrelevant Terms |
|---|
| f#(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(b, _x181)))))))))) | |
Thus, the rule f
#(b, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c,
_x151))))))))) → f
#(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(b,
_x151))))))))) is replaced by the following rules:
| f#(b, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, _x181)))))))))) → f#(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(b, _x181)))))))))) |
Problem 20: ForwardNarrowing
Dependency Pair Problem
Dependency Pairs
| f#(b, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, _x181)))))))))) | → | f#(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(b, _x181)))))))))) | | f#(a, f(b, f(b, f(b, f(b, f(b, _x101)))))) | → | f#(b, f(b, f(b, f(b, f(b, f(a, _x101)))))) |
| f#(c, f(a, f(a, f(a, f(a, f(a, f(a, f(a, _x141)))))))) | → | f#(a, f(a, f(a, f(a, f(a, f(a, f(a, f(c, _x141)))))))) |
Rewrite Rules
| f(a, f(b, x)) | → | f(b, f(a, x)) | | f(b, f(c, x)) | → | f(c, f(b, x)) |
| f(c, f(a, x)) | → | f(a, f(c, x)) |
Original Signature
Termination of terms over the following signature is verified: f, b, c, a
Strategy
The right-hand side of the rule f
#(b, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c,
_x181)))))))))) → f
#(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(b,
_x181)))))))))) is narrowed to the following relevant and irrelevant terms (a narrowing is irrelevant if by dropping it the correctness (and completeness) of the processor is not influenced).
| Relevant Terms | Irrelevant Terms |
|---|
| f#(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(b, _x191))))))))))) | |
Thus, the rule f
#(b, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c,
_x181)))))))))) → f
#(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(b,
_x181)))))))))) is replaced by the following rules:
| f#(b, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, _x191))))))))))) → f#(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(b, _x191))))))))))) |
Problem 21: ForwardNarrowing
Dependency Pair Problem
Dependency Pairs
| f#(b, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, _x191))))))))))) | → | f#(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(b, _x191))))))))))) | | f#(a, f(b, f(b, f(b, f(b, f(b, _x101)))))) | → | f#(b, f(b, f(b, f(b, f(b, f(a, _x101)))))) |
| f#(c, f(a, f(a, f(a, f(a, f(a, f(a, f(a, _x141)))))))) | → | f#(a, f(a, f(a, f(a, f(a, f(a, f(a, f(c, _x141)))))))) |
Rewrite Rules
| f(a, f(b, x)) | → | f(b, f(a, x)) | | f(b, f(c, x)) | → | f(c, f(b, x)) |
| f(c, f(a, x)) | → | f(a, f(c, x)) |
Original Signature
Termination of terms over the following signature is verified: f, b, c, a
Strategy
The right-hand side of the rule f
#(b, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c,
_x191))))))))))) → f
#(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(b,
_x191))))))))))) is narrowed to the following relevant and irrelevant terms (a narrowing is irrelevant if by dropping it the correctness (and completeness) of the processor is not influenced).
| Relevant Terms | Irrelevant Terms |
|---|
| f#(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(b, _x221)))))))))))) | |
Thus, the rule f
#(b, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c,
_x191))))))))))) → f
#(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(b,
_x191))))))))))) is replaced by the following rules:
| f#(b, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, _x221)))))))))))) → f#(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(b, _x221)))))))))))) |
Problem 22: ForwardNarrowing
Dependency Pair Problem
Dependency Pairs
| f#(a, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, _x621)))))))))))))))))))))))))))))))) | → | f#(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(a, _x621)))))))))))))))))))))))))))))))) | | f#(c, f(a, f(a, f(a, f(a, f(a, f(a, f(a, _x141)))))))) | → | f#(a, f(a, f(a, f(a, f(a, f(a, f(a, f(c, _x141)))))))) |
| f#(b, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, _x301)))))))))))))))) | → | f#(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(b, _x301)))))))))))))))) |
Rewrite Rules
| f(a, f(b, x)) | → | f(b, f(a, x)) | | f(b, f(c, x)) | → | f(c, f(b, x)) |
| f(c, f(a, x)) | → | f(a, f(c, x)) |
Original Signature
Termination of terms over the following signature is verified: f, b, c, a
Strategy
The right-hand side of the rule f
#(a, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b,
_x621)))))))))))))))))))))))))))))))) → f
#(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(a,
_x621)))))))))))))))))))))))))))))))) is narrowed to the following relevant and irrelevant terms (a narrowing is irrelevant if by dropping it the correctness (and completeness) of the processor is not influenced).
| Relevant Terms | Irrelevant Terms |
|---|
| f#(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(a, _x631))))))))))))))))))))))))))))))))) | |
Thus, the rule f
#(a, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b,
_x621)))))))))))))))))))))))))))))))) → f
#(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(a,
_x621)))))))))))))))))))))))))))))))) is replaced by the following rules:
| f#(a, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, _x631))))))))))))))))))))))))))))))))) → f#(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(a, _x631))))))))))))))))))))))))))))))))) |
Problem 23: ForwardNarrowing
Dependency Pair Problem
Dependency Pairs
| f#(a, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, _x1621)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))) | → | f#(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(a, _x1621)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))) | | f#(c, f(a, f(a, f(a, f(a, f(a, f(a, f(a, _x141)))))))) | → | f#(a, f(a, f(a, f(a, f(a, f(a, f(a, f(c, _x141)))))))) |
| f#(b, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, _x301)))))))))))))))) | → | f#(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(b, _x301)))))))))))))))) |
Rewrite Rules
| f(a, f(b, x)) | → | f(b, f(a, x)) | | f(b, f(c, x)) | → | f(c, f(b, x)) |
| f(c, f(a, x)) | → | f(a, f(c, x)) |
Original Signature
Termination of terms over the following signature is verified: f, b, c, a
Strategy
The right-hand side of the rule f
#(a, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b,
_x1621)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))) → f
#(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(a,
_x1621)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))) is narrowed to the following relevant and irrelevant terms (a narrowing is irrelevant if by dropping it the correctness (and completeness) of the processor is not influenced).
| Relevant Terms | Irrelevant Terms |
|---|
| f#(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(a, _x1631))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))) | |
Thus, the rule f
#(a, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b,
_x1621)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))) → f
#(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(a,
_x1621)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))) is replaced by the following rules:
| f#(a, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, _x1631))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))) → f#(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(a, _x1631))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))) |
Problem 24: ForwardNarrowing
Dependency Pair Problem
Dependency Pairs
| f#(c, f(a, f(a, f(a, f(a, f(a, f(a, f(a, _x141)))))))) | → | f#(a, f(a, f(a, f(a, f(a, f(a, f(a, f(c, _x141)))))))) | | f#(b, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, _x301)))))))))))))))) | → | f#(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(b, _x301)))))))))))))))) |
| f#(a, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, _x2621)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))) | → | f#(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(a, _x2621)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))) |
Rewrite Rules
| f(a, f(b, x)) | → | f(b, f(a, x)) | | f(b, f(c, x)) | → | f(c, f(b, x)) |
| f(c, f(a, x)) | → | f(a, f(c, x)) |
Original Signature
Termination of terms over the following signature is verified: f, b, c, a
Strategy
The right-hand side of the rule f
#(a, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b,
_x2621)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))) → f
#(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(a,
_x2621)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))) is narrowed to the following relevant and irrelevant terms (a narrowing is irrelevant if by dropping it the correctness (and completeness) of the processor is not influenced).
| Relevant Terms | Irrelevant Terms |
|---|
| f#(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(a, _x2631))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))) | |
Thus, the rule f
#(a, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b,
_x2621)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))) → f
#(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(a,
_x2621)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))) is replaced by the following rules:
| f#(a, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, _x2631))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))) → f#(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(a, _x2631))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))) |
Problem 25: ForwardNarrowing
Dependency Pair Problem
Dependency Pairs
| f#(a, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, _x3641)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))) | → | f#(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(a, _x3641)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))) | | f#(c, f(a, f(a, f(a, f(a, f(a, f(a, f(a, _x141)))))))) | → | f#(a, f(a, f(a, f(a, f(a, f(a, f(a, f(c, _x141)))))))) |
| f#(b, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, _x301)))))))))))))))) | → | f#(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(c, f(b, _x301)))))))))))))))) |
Rewrite Rules
| f(a, f(b, x)) | → | f(b, f(a, x)) | | f(b, f(c, x)) | → | f(c, f(b, x)) |
| f(c, f(a, x)) | → | f(a, f(c, x)) |
Original Signature
Termination of terms over the following signature is verified: f, b, c, a
Strategy
The right-hand side of the rule f
#(a, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b,
_x3641)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))) → f
#(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(a,
_x3641)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))) is narrowed to the following relevant and irrelevant terms (a narrowing is irrelevant if by dropping it the correctness (and completeness) of the processor is not influenced).
| Relevant Terms | Irrelevant Terms |
|---|
| f#(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(a, _x3651))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))) | |
Thus, the rule f
#(a, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b,
_x3641)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))) → f
#(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(a,
_x3641)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))) is replaced by the following rules:
| f#(a, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, _x3651))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))) → f#(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(b, f(a, _x3651))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))) |