MAYBE
The TRS could not be proven terminating. The proof attempt took 16426 ms.
The following DP Processors were used
Problem 1 was processed with processor DependencyGraph (0ms).
| – Problem 2 was processed with processor SubtermCriterion (0ms).
| | – Problem 5 was processed with processor PolynomialLinearRange4iUR (0ms).
| | | – Problem 7 was processed with processor PolynomialLinearRange4iUR (0ms).
| | | | – Problem 9 was processed with processor PolynomialLinearRange4iUR (0ms).
| | | | | – Problem 11 was processed with processor PolynomialLinearRange4iUR (0ms).
| – Problem 3 was processed with processor PolynomialLinearRange4iUR (0ms).
| | – Problem 6 was processed with processor PolynomialLinearRange4iUR (0ms).
| | | – Problem 8 was processed with processor PolynomialLinearRange4iUR (0ms).
| | | | – Problem 10 was processed with processor PolynomialLinearRange4iUR (0ms).
| | | | | – Problem 12 was processed with processor PolynomialLinearRange4iUR (0ms).
| | | | | | – Problem 13 was processed with processor PolynomialLinearRange4iUR (0ms).
| | | | | | | – Problem 14 remains open; application of the following processors failed [DependencyGraph (2ms), PolynomialLinearRange4iUR (300ms), DependencyGraph (2ms), PolynomialLinearRange8NegiUR (2594ms), DependencyGraph (2ms), ReductionPairSAT (4502ms), DependencyGraph (1ms), SizeChangePrinciple (17ms)].
| – Problem 4 was processed with processor SubtermCriterion (0ms).
The following open problems remain:
Open Dependency Pair Problem 14
Dependency Pairs
| active#(f(X, g(X), Y)) | → | mark#(f(Y, Y, Y)) | | mark#(f(X1, X2, X3)) | → | active#(f(X1, X2, X3)) |
Rewrite Rules
| active(f(X, g(X), Y)) | → | mark(f(Y, Y, Y)) | | active(g(b)) | → | mark(c) |
| active(b) | → | mark(c) | | mark(f(X1, X2, X3)) | → | active(f(X1, X2, X3)) |
| mark(g(X)) | → | active(g(mark(X))) | | mark(b) | → | active(b) |
| mark(c) | → | active(c) | | f(mark(X1), X2, X3) | → | f(X1, X2, X3) |
| f(X1, mark(X2), X3) | → | f(X1, X2, X3) | | f(X1, X2, mark(X3)) | → | f(X1, X2, X3) |
| f(active(X1), X2, X3) | → | f(X1, X2, X3) | | f(X1, active(X2), X3) | → | f(X1, X2, X3) |
| f(X1, X2, active(X3)) | → | f(X1, X2, X3) | | g(mark(X)) | → | g(X) |
| g(active(X)) | → | g(X) |
Original Signature
Termination of terms over the following signature is verified: f, g, b, c, active, mark
Problem 1: DependencyGraph
Dependency Pair Problem
Dependency Pairs
| g#(mark(X)) | → | g#(X) | | mark#(g(X)) | → | g#(mark(X)) |
| mark#(g(X)) | → | mark#(X) | | f#(X1, mark(X2), X3) | → | f#(X1, X2, X3) |
| active#(b) | → | mark#(c) | | mark#(f(X1, X2, X3)) | → | f#(X1, X2, X3) |
| mark#(c) | → | active#(c) | | g#(active(X)) | → | g#(X) |
| f#(X1, X2, mark(X3)) | → | f#(X1, X2, X3) | | mark#(b) | → | active#(b) |
| f#(mark(X1), X2, X3) | → | f#(X1, X2, X3) | | active#(f(X, g(X), Y)) | → | mark#(f(Y, Y, Y)) |
| mark#(g(X)) | → | active#(g(mark(X))) | | f#(active(X1), X2, X3) | → | f#(X1, X2, X3) |
| f#(X1, active(X2), X3) | → | f#(X1, X2, X3) | | active#(f(X, g(X), Y)) | → | f#(Y, Y, Y) |
| active#(g(b)) | → | mark#(c) | | mark#(f(X1, X2, X3)) | → | active#(f(X1, X2, X3)) |
| f#(X1, X2, active(X3)) | → | f#(X1, X2, X3) |
Rewrite Rules
| active(f(X, g(X), Y)) | → | mark(f(Y, Y, Y)) | | active(g(b)) | → | mark(c) |
| active(b) | → | mark(c) | | mark(f(X1, X2, X3)) | → | active(f(X1, X2, X3)) |
| mark(g(X)) | → | active(g(mark(X))) | | mark(b) | → | active(b) |
| mark(c) | → | active(c) | | f(mark(X1), X2, X3) | → | f(X1, X2, X3) |
| f(X1, mark(X2), X3) | → | f(X1, X2, X3) | | f(X1, X2, mark(X3)) | → | f(X1, X2, X3) |
| f(active(X1), X2, X3) | → | f(X1, X2, X3) | | f(X1, active(X2), X3) | → | f(X1, X2, X3) |
| f(X1, X2, active(X3)) | → | f(X1, X2, X3) | | g(mark(X)) | → | g(X) |
| g(active(X)) | → | g(X) |
Original Signature
Termination of terms over the following signature is verified: f, g, b, c, active, mark
Strategy
The following SCCs where found
| mark#(b) → active#(b) | mark#(g(X)) → mark#(X) |
| active#(f(X, g(X), Y)) → mark#(f(Y, Y, Y)) | mark#(g(X)) → active#(g(mark(X))) |
| active#(b) → mark#(c) | active#(g(b)) → mark#(c) |
| mark#(c) → active#(c) | mark#(f(X1, X2, X3)) → active#(f(X1, X2, X3)) |
| f#(X1, X2, mark(X3)) → f#(X1, X2, X3) | f#(mark(X1), X2, X3) → f#(X1, X2, X3) |
| f#(X1, mark(X2), X3) → f#(X1, X2, X3) | f#(X1, active(X2), X3) → f#(X1, X2, X3) |
| f#(active(X1), X2, X3) → f#(X1, X2, X3) | f#(X1, X2, active(X3)) → f#(X1, X2, X3) |
| g#(active(X)) → g#(X) | g#(mark(X)) → g#(X) |
Problem 2: SubtermCriterion
Dependency Pair Problem
Dependency Pairs
| f#(X1, X2, mark(X3)) | → | f#(X1, X2, X3) | | f#(mark(X1), X2, X3) | → | f#(X1, X2, X3) |
| f#(X1, mark(X2), X3) | → | f#(X1, X2, X3) | | f#(X1, active(X2), X3) | → | f#(X1, X2, X3) |
| f#(active(X1), X2, X3) | → | f#(X1, X2, X3) | | f#(X1, X2, active(X3)) | → | f#(X1, X2, X3) |
Rewrite Rules
| active(f(X, g(X), Y)) | → | mark(f(Y, Y, Y)) | | active(g(b)) | → | mark(c) |
| active(b) | → | mark(c) | | mark(f(X1, X2, X3)) | → | active(f(X1, X2, X3)) |
| mark(g(X)) | → | active(g(mark(X))) | | mark(b) | → | active(b) |
| mark(c) | → | active(c) | | f(mark(X1), X2, X3) | → | f(X1, X2, X3) |
| f(X1, mark(X2), X3) | → | f(X1, X2, X3) | | f(X1, X2, mark(X3)) | → | f(X1, X2, X3) |
| f(active(X1), X2, X3) | → | f(X1, X2, X3) | | f(X1, active(X2), X3) | → | f(X1, X2, X3) |
| f(X1, X2, active(X3)) | → | f(X1, X2, X3) | | g(mark(X)) | → | g(X) |
| g(active(X)) | → | g(X) |
Original Signature
Termination of terms over the following signature is verified: f, g, b, c, active, mark
Strategy
Projection
The following projection was used:
Thus, the following dependency pairs are removed:
| f#(mark(X1), X2, X3) | → | f#(X1, X2, X3) | | f#(active(X1), X2, X3) | → | f#(X1, X2, X3) |
Problem 5: PolynomialLinearRange4iUR
Dependency Pair Problem
Dependency Pairs
| f#(X1, X2, mark(X3)) | → | f#(X1, X2, X3) | | f#(X1, mark(X2), X3) | → | f#(X1, X2, X3) |
| f#(X1, active(X2), X3) | → | f#(X1, X2, X3) | | f#(X1, X2, active(X3)) | → | f#(X1, X2, X3) |
Rewrite Rules
| active(f(X, g(X), Y)) | → | mark(f(Y, Y, Y)) | | active(g(b)) | → | mark(c) |
| active(b) | → | mark(c) | | mark(f(X1, X2, X3)) | → | active(f(X1, X2, X3)) |
| mark(g(X)) | → | active(g(mark(X))) | | mark(b) | → | active(b) |
| mark(c) | → | active(c) | | f(mark(X1), X2, X3) | → | f(X1, X2, X3) |
| f(X1, mark(X2), X3) | → | f(X1, X2, X3) | | f(X1, X2, mark(X3)) | → | f(X1, X2, X3) |
| f(active(X1), X2, X3) | → | f(X1, X2, X3) | | f(X1, active(X2), X3) | → | f(X1, X2, X3) |
| f(X1, X2, active(X3)) | → | f(X1, X2, X3) | | g(mark(X)) | → | g(X) |
| g(active(X)) | → | g(X) |
Original Signature
Termination of terms over the following signature is verified: f, g, b, c, active, mark
Strategy
Polynomial Interpretation
- active(x): x
- b: 0
- c: 0
- f(x,y,z): 0
- f#(x,y,z): z
- g(x): 0
- mark(x): 2x + 1
There are no usable rules
The following dependency pairs are strictly oriented by an ordering on the given polynomial interpretation, thus they are removed:
| f#(X1, X2, mark(X3)) | → | f#(X1, X2, X3) |
Problem 7: PolynomialLinearRange4iUR
Dependency Pair Problem
Dependency Pairs
| f#(X1, mark(X2), X3) | → | f#(X1, X2, X3) | | f#(X1, active(X2), X3) | → | f#(X1, X2, X3) |
| f#(X1, X2, active(X3)) | → | f#(X1, X2, X3) |
Rewrite Rules
| active(f(X, g(X), Y)) | → | mark(f(Y, Y, Y)) | | active(g(b)) | → | mark(c) |
| active(b) | → | mark(c) | | mark(f(X1, X2, X3)) | → | active(f(X1, X2, X3)) |
| mark(g(X)) | → | active(g(mark(X))) | | mark(b) | → | active(b) |
| mark(c) | → | active(c) | | f(mark(X1), X2, X3) | → | f(X1, X2, X3) |
| f(X1, mark(X2), X3) | → | f(X1, X2, X3) | | f(X1, X2, mark(X3)) | → | f(X1, X2, X3) |
| f(active(X1), X2, X3) | → | f(X1, X2, X3) | | f(X1, active(X2), X3) | → | f(X1, X2, X3) |
| f(X1, X2, active(X3)) | → | f(X1, X2, X3) | | g(mark(X)) | → | g(X) |
| g(active(X)) | → | g(X) |
Original Signature
Termination of terms over the following signature is verified: f, g, b, c, active, mark
Strategy
Polynomial Interpretation
- active(x): 2x
- b: 0
- c: 0
- f(x,y,z): 0
- f#(x,y,z): 2z + y + 1
- g(x): 0
- mark(x): 2x + 2
There are no usable rules
The following dependency pairs are strictly oriented by an ordering on the given polynomial interpretation, thus they are removed:
| f#(X1, mark(X2), X3) | → | f#(X1, X2, X3) |
Problem 9: PolynomialLinearRange4iUR
Dependency Pair Problem
Dependency Pairs
| f#(X1, active(X2), X3) | → | f#(X1, X2, X3) | | f#(X1, X2, active(X3)) | → | f#(X1, X2, X3) |
Rewrite Rules
| active(f(X, g(X), Y)) | → | mark(f(Y, Y, Y)) | | active(g(b)) | → | mark(c) |
| active(b) | → | mark(c) | | mark(f(X1, X2, X3)) | → | active(f(X1, X2, X3)) |
| mark(g(X)) | → | active(g(mark(X))) | | mark(b) | → | active(b) |
| mark(c) | → | active(c) | | f(mark(X1), X2, X3) | → | f(X1, X2, X3) |
| f(X1, mark(X2), X3) | → | f(X1, X2, X3) | | f(X1, X2, mark(X3)) | → | f(X1, X2, X3) |
| f(active(X1), X2, X3) | → | f(X1, X2, X3) | | f(X1, active(X2), X3) | → | f(X1, X2, X3) |
| f(X1, X2, active(X3)) | → | f(X1, X2, X3) | | g(mark(X)) | → | g(X) |
| g(active(X)) | → | g(X) |
Original Signature
Termination of terms over the following signature is verified: f, g, b, c, active, mark
Strategy
Polynomial Interpretation
- active(x): x + 1
- b: 0
- c: 0
- f(x,y,z): 0
- f#(x,y,z): z
- g(x): 0
- mark(x): 0
There are no usable rules
The following dependency pairs are strictly oriented by an ordering on the given polynomial interpretation, thus they are removed:
| f#(X1, X2, active(X3)) | → | f#(X1, X2, X3) |
Problem 11: PolynomialLinearRange4iUR
Dependency Pair Problem
Dependency Pairs
| f#(X1, active(X2), X3) | → | f#(X1, X2, X3) |
Rewrite Rules
| active(f(X, g(X), Y)) | → | mark(f(Y, Y, Y)) | | active(g(b)) | → | mark(c) |
| active(b) | → | mark(c) | | mark(f(X1, X2, X3)) | → | active(f(X1, X2, X3)) |
| mark(g(X)) | → | active(g(mark(X))) | | mark(b) | → | active(b) |
| mark(c) | → | active(c) | | f(mark(X1), X2, X3) | → | f(X1, X2, X3) |
| f(X1, mark(X2), X3) | → | f(X1, X2, X3) | | f(X1, X2, mark(X3)) | → | f(X1, X2, X3) |
| f(active(X1), X2, X3) | → | f(X1, X2, X3) | | f(X1, active(X2), X3) | → | f(X1, X2, X3) |
| f(X1, X2, active(X3)) | → | f(X1, X2, X3) | | g(mark(X)) | → | g(X) |
| g(active(X)) | → | g(X) |
Original Signature
Termination of terms over the following signature is verified: f, g, b, c, active, mark
Strategy
Polynomial Interpretation
- active(x): 2x + 1
- b: 0
- c: 0
- f(x,y,z): 0
- f#(x,y,z): z + 2y + x + 1
- g(x): 0
- mark(x): 0
There are no usable rules
The following dependency pairs are strictly oriented by an ordering on the given polynomial interpretation, thus they are removed:
| f#(X1, active(X2), X3) | → | f#(X1, X2, X3) |
Problem 3: PolynomialLinearRange4iUR
Dependency Pair Problem
Dependency Pairs
| mark#(b) | → | active#(b) | | mark#(g(X)) | → | mark#(X) |
| active#(f(X, g(X), Y)) | → | mark#(f(Y, Y, Y)) | | mark#(g(X)) | → | active#(g(mark(X))) |
| active#(b) | → | mark#(c) | | active#(g(b)) | → | mark#(c) |
| mark#(c) | → | active#(c) | | mark#(f(X1, X2, X3)) | → | active#(f(X1, X2, X3)) |
Rewrite Rules
| active(f(X, g(X), Y)) | → | mark(f(Y, Y, Y)) | | active(g(b)) | → | mark(c) |
| active(b) | → | mark(c) | | mark(f(X1, X2, X3)) | → | active(f(X1, X2, X3)) |
| mark(g(X)) | → | active(g(mark(X))) | | mark(b) | → | active(b) |
| mark(c) | → | active(c) | | f(mark(X1), X2, X3) | → | f(X1, X2, X3) |
| f(X1, mark(X2), X3) | → | f(X1, X2, X3) | | f(X1, X2, mark(X3)) | → | f(X1, X2, X3) |
| f(active(X1), X2, X3) | → | f(X1, X2, X3) | | f(X1, active(X2), X3) | → | f(X1, X2, X3) |
| f(X1, X2, active(X3)) | → | f(X1, X2, X3) | | g(mark(X)) | → | g(X) |
| g(active(X)) | → | g(X) |
Original Signature
Termination of terms over the following signature is verified: f, g, b, c, active, mark
Strategy
Polynomial Interpretation
- active(x): x
- active#(x): 1
- b: 1
- c: 0
- f(x,y,z): 0
- g(x): 2x
- mark(x): 0
- mark#(x): 2x + 1
Improved Usable rules
| f(X1, X2, mark(X3)) | → | f(X1, X2, X3) | | f(mark(X1), X2, X3) | → | f(X1, X2, X3) |
| f(active(X1), X2, X3) | → | f(X1, X2, X3) | | f(X1, mark(X2), X3) | → | f(X1, X2, X3) |
| f(X1, X2, active(X3)) | → | f(X1, X2, X3) | | f(X1, active(X2), X3) | → | f(X1, X2, X3) |
The following dependency pairs are strictly oriented by an ordering on the given polynomial interpretation, thus they are removed:
Problem 6: PolynomialLinearRange4iUR
Dependency Pair Problem
Dependency Pairs
| mark#(g(X)) | → | mark#(X) | | active#(f(X, g(X), Y)) | → | mark#(f(Y, Y, Y)) |
| active#(b) | → | mark#(c) | | mark#(g(X)) | → | active#(g(mark(X))) |
| active#(g(b)) | → | mark#(c) | | mark#(f(X1, X2, X3)) | → | active#(f(X1, X2, X3)) |
| mark#(c) | → | active#(c) |
Rewrite Rules
| active(f(X, g(X), Y)) | → | mark(f(Y, Y, Y)) | | active(g(b)) | → | mark(c) |
| active(b) | → | mark(c) | | mark(f(X1, X2, X3)) | → | active(f(X1, X2, X3)) |
| mark(g(X)) | → | active(g(mark(X))) | | mark(b) | → | active(b) |
| mark(c) | → | active(c) | | f(mark(X1), X2, X3) | → | f(X1, X2, X3) |
| f(X1, mark(X2), X3) | → | f(X1, X2, X3) | | f(X1, X2, mark(X3)) | → | f(X1, X2, X3) |
| f(active(X1), X2, X3) | → | f(X1, X2, X3) | | f(X1, active(X2), X3) | → | f(X1, X2, X3) |
| f(X1, X2, active(X3)) | → | f(X1, X2, X3) | | g(mark(X)) | → | g(X) |
| g(active(X)) | → | g(X) |
Original Signature
Termination of terms over the following signature is verified: f, g, b, c, active, mark
Strategy
Polynomial Interpretation
- active(x): 0
- active#(x): 2x
- b: 1
- c: 0
- f(x,y,z): 0
- g(x): 0
- mark(x): 1
- mark#(x): 0
Improved Usable rules
| f(X1, X2, mark(X3)) | → | f(X1, X2, X3) | | f(mark(X1), X2, X3) | → | f(X1, X2, X3) |
| f(active(X1), X2, X3) | → | f(X1, X2, X3) | | f(X1, mark(X2), X3) | → | f(X1, X2, X3) |
| g(active(X)) | → | g(X) | | f(X1, X2, active(X3)) | → | f(X1, X2, X3) |
| f(X1, active(X2), X3) | → | f(X1, X2, X3) | | g(mark(X)) | → | g(X) |
The following dependency pairs are strictly oriented by an ordering on the given polynomial interpretation, thus they are removed:
Problem 8: PolynomialLinearRange4iUR
Dependency Pair Problem
Dependency Pairs
| mark#(g(X)) | → | mark#(X) | | active#(f(X, g(X), Y)) | → | mark#(f(Y, Y, Y)) |
| mark#(g(X)) | → | active#(g(mark(X))) | | active#(g(b)) | → | mark#(c) |
| mark#(c) | → | active#(c) | | mark#(f(X1, X2, X3)) | → | active#(f(X1, X2, X3)) |
Rewrite Rules
| active(f(X, g(X), Y)) | → | mark(f(Y, Y, Y)) | | active(g(b)) | → | mark(c) |
| active(b) | → | mark(c) | | mark(f(X1, X2, X3)) | → | active(f(X1, X2, X3)) |
| mark(g(X)) | → | active(g(mark(X))) | | mark(b) | → | active(b) |
| mark(c) | → | active(c) | | f(mark(X1), X2, X3) | → | f(X1, X2, X3) |
| f(X1, mark(X2), X3) | → | f(X1, X2, X3) | | f(X1, X2, mark(X3)) | → | f(X1, X2, X3) |
| f(active(X1), X2, X3) | → | f(X1, X2, X3) | | f(X1, active(X2), X3) | → | f(X1, X2, X3) |
| f(X1, X2, active(X3)) | → | f(X1, X2, X3) | | g(mark(X)) | → | g(X) |
| g(active(X)) | → | g(X) |
Original Signature
Termination of terms over the following signature is verified: f, g, b, c, active, mark
Strategy
Polynomial Interpretation
- active(x): x
- active#(x): x
- b: 1
- c: 0
- f(x,y,z): 0
- g(x): 3x
- mark(x): x
- mark#(x): 3x
Improved Usable rules
| f(X1, X2, mark(X3)) | → | f(X1, X2, X3) | | f(mark(X1), X2, X3) | → | f(X1, X2, X3) |
| f(active(X1), X2, X3) | → | f(X1, X2, X3) | | g(active(X)) | → | g(X) |
| f(X1, X2, active(X3)) | → | f(X1, X2, X3) | | mark(c) | → | active(c) |
| f(X1, active(X2), X3) | → | f(X1, X2, X3) | | active(f(X, g(X), Y)) | → | mark(f(Y, Y, Y)) |
| active(b) | → | mark(c) | | mark(g(X)) | → | active(g(mark(X))) |
| active(g(b)) | → | mark(c) | | mark(f(X1, X2, X3)) | → | active(f(X1, X2, X3)) |
| f(X1, mark(X2), X3) | → | f(X1, X2, X3) | | mark(b) | → | active(b) |
| g(mark(X)) | → | g(X) |
The following dependency pairs are strictly oriented by an ordering on the given polynomial interpretation, thus they are removed:
Problem 10: PolynomialLinearRange4iUR
Dependency Pair Problem
Dependency Pairs
| mark#(g(X)) | → | mark#(X) | | active#(f(X, g(X), Y)) | → | mark#(f(Y, Y, Y)) |
| mark#(g(X)) | → | active#(g(mark(X))) | | mark#(f(X1, X2, X3)) | → | active#(f(X1, X2, X3)) |
| mark#(c) | → | active#(c) |
Rewrite Rules
| active(f(X, g(X), Y)) | → | mark(f(Y, Y, Y)) | | active(g(b)) | → | mark(c) |
| active(b) | → | mark(c) | | mark(f(X1, X2, X3)) | → | active(f(X1, X2, X3)) |
| mark(g(X)) | → | active(g(mark(X))) | | mark(b) | → | active(b) |
| mark(c) | → | active(c) | | f(mark(X1), X2, X3) | → | f(X1, X2, X3) |
| f(X1, mark(X2), X3) | → | f(X1, X2, X3) | | f(X1, X2, mark(X3)) | → | f(X1, X2, X3) |
| f(active(X1), X2, X3) | → | f(X1, X2, X3) | | f(X1, active(X2), X3) | → | f(X1, X2, X3) |
| f(X1, X2, active(X3)) | → | f(X1, X2, X3) | | g(mark(X)) | → | g(X) |
| g(active(X)) | → | g(X) |
Original Signature
Termination of terms over the following signature is verified: f, g, b, c, active, mark
Strategy
Polynomial Interpretation
- active(x): 1
- active#(x): 2x
- b: 1
- c: 1
- f(x,y,z): 1
- g(x): 0
- mark(x): 2x + 1
- mark#(x): 2
Improved Usable rules
| f(X1, X2, mark(X3)) | → | f(X1, X2, X3) | | f(mark(X1), X2, X3) | → | f(X1, X2, X3) |
| f(active(X1), X2, X3) | → | f(X1, X2, X3) | | f(X1, mark(X2), X3) | → | f(X1, X2, X3) |
| g(active(X)) | → | g(X) | | f(X1, X2, active(X3)) | → | f(X1, X2, X3) |
| f(X1, active(X2), X3) | → | f(X1, X2, X3) | | g(mark(X)) | → | g(X) |
The following dependency pairs are strictly oriented by an ordering on the given polynomial interpretation, thus they are removed:
| mark#(g(X)) | → | active#(g(mark(X))) |
Problem 12: PolynomialLinearRange4iUR
Dependency Pair Problem
Dependency Pairs
| mark#(g(X)) | → | mark#(X) | | active#(f(X, g(X), Y)) | → | mark#(f(Y, Y, Y)) |
| mark#(c) | → | active#(c) | | mark#(f(X1, X2, X3)) | → | active#(f(X1, X2, X3)) |
Rewrite Rules
| active(f(X, g(X), Y)) | → | mark(f(Y, Y, Y)) | | active(g(b)) | → | mark(c) |
| active(b) | → | mark(c) | | mark(f(X1, X2, X3)) | → | active(f(X1, X2, X3)) |
| mark(g(X)) | → | active(g(mark(X))) | | mark(b) | → | active(b) |
| mark(c) | → | active(c) | | f(mark(X1), X2, X3) | → | f(X1, X2, X3) |
| f(X1, mark(X2), X3) | → | f(X1, X2, X3) | | f(X1, X2, mark(X3)) | → | f(X1, X2, X3) |
| f(active(X1), X2, X3) | → | f(X1, X2, X3) | | f(X1, active(X2), X3) | → | f(X1, X2, X3) |
| f(X1, X2, active(X3)) | → | f(X1, X2, X3) | | g(mark(X)) | → | g(X) |
| g(active(X)) | → | g(X) |
Original Signature
Termination of terms over the following signature is verified: f, g, b, c, active, mark
Strategy
Polynomial Interpretation
- active(x): 3x + 3
- active#(x): 0
- b: 0
- c: 1
- f(x,y,z): 0
- g(x): 3x
- mark(x): 3x + 3
- mark#(x): 3x
Improved Usable rules
| f(X1, X2, mark(X3)) | → | f(X1, X2, X3) | | f(mark(X1), X2, X3) | → | f(X1, X2, X3) |
| f(active(X1), X2, X3) | → | f(X1, X2, X3) | | f(X1, mark(X2), X3) | → | f(X1, X2, X3) |
| f(X1, X2, active(X3)) | → | f(X1, X2, X3) | | f(X1, active(X2), X3) | → | f(X1, X2, X3) |
The following dependency pairs are strictly oriented by an ordering on the given polynomial interpretation, thus they are removed:
Problem 13: PolynomialLinearRange4iUR
Dependency Pair Problem
Dependency Pairs
| mark#(g(X)) | → | mark#(X) | | active#(f(X, g(X), Y)) | → | mark#(f(Y, Y, Y)) |
| mark#(f(X1, X2, X3)) | → | active#(f(X1, X2, X3)) |
Rewrite Rules
| active(f(X, g(X), Y)) | → | mark(f(Y, Y, Y)) | | active(g(b)) | → | mark(c) |
| active(b) | → | mark(c) | | mark(f(X1, X2, X3)) | → | active(f(X1, X2, X3)) |
| mark(g(X)) | → | active(g(mark(X))) | | mark(b) | → | active(b) |
| mark(c) | → | active(c) | | f(mark(X1), X2, X3) | → | f(X1, X2, X3) |
| f(X1, mark(X2), X3) | → | f(X1, X2, X3) | | f(X1, X2, mark(X3)) | → | f(X1, X2, X3) |
| f(active(X1), X2, X3) | → | f(X1, X2, X3) | | f(X1, active(X2), X3) | → | f(X1, X2, X3) |
| f(X1, X2, active(X3)) | → | f(X1, X2, X3) | | g(mark(X)) | → | g(X) |
| g(active(X)) | → | g(X) |
Original Signature
Termination of terms over the following signature is verified: f, g, b, c, active, mark
Strategy
Polynomial Interpretation
- active(x): 3x + 3
- active#(x): x
- b: 0
- c: 0
- f(x,y,z): 2
- g(x): x + 1
- mark(x): 3x + 1
- mark#(x): x
Improved Usable rules
| f(X1, X2, mark(X3)) | → | f(X1, X2, X3) | | f(mark(X1), X2, X3) | → | f(X1, X2, X3) |
| f(active(X1), X2, X3) | → | f(X1, X2, X3) | | f(X1, mark(X2), X3) | → | f(X1, X2, X3) |
| f(X1, X2, active(X3)) | → | f(X1, X2, X3) | | f(X1, active(X2), X3) | → | f(X1, X2, X3) |
The following dependency pairs are strictly oriented by an ordering on the given polynomial interpretation, thus they are removed:
Problem 4: SubtermCriterion
Dependency Pair Problem
Dependency Pairs
| g#(active(X)) | → | g#(X) | | g#(mark(X)) | → | g#(X) |
Rewrite Rules
| active(f(X, g(X), Y)) | → | mark(f(Y, Y, Y)) | | active(g(b)) | → | mark(c) |
| active(b) | → | mark(c) | | mark(f(X1, X2, X3)) | → | active(f(X1, X2, X3)) |
| mark(g(X)) | → | active(g(mark(X))) | | mark(b) | → | active(b) |
| mark(c) | → | active(c) | | f(mark(X1), X2, X3) | → | f(X1, X2, X3) |
| f(X1, mark(X2), X3) | → | f(X1, X2, X3) | | f(X1, X2, mark(X3)) | → | f(X1, X2, X3) |
| f(active(X1), X2, X3) | → | f(X1, X2, X3) | | f(X1, active(X2), X3) | → | f(X1, X2, X3) |
| f(X1, X2, active(X3)) | → | f(X1, X2, X3) | | g(mark(X)) | → | g(X) |
| g(active(X)) | → | g(X) |
Original Signature
Termination of terms over the following signature is verified: f, g, b, c, active, mark
Strategy
Projection
The following projection was used:
Thus, the following dependency pairs are removed:
| g#(active(X)) | → | g#(X) | | g#(mark(X)) | → | g#(X) |