TIMEOUT
The TRS could not be proven terminating. The proof attempt took 60001 ms.
The following DP Processors were used
Problem 1 was processed with processor DependencyGraph (48ms).
| – Problem 2 remains open; application of the following processors failed [SubtermCriterion (1ms), DependencyGraph (1ms), PolynomialLinearRange4iUR (370ms), DependencyGraph (1ms), PolynomialLinearRange4iUR (297ms), DependencyGraph (1ms), PolynomialLinearRange4iUR (306ms), DependencyGraph (1ms), PolynomialLinearRange8NegiUR (4795ms), DependencyGraph (1ms), ReductionPairSAT (6033ms), DependencyGraph (0ms), SizeChangePrinciple (113ms), ForwardNarrowing (0ms), BackwardInstantiation (1ms), ForwardInstantiation (0ms), Propagation (0ms)].
| – Problem 3 was processed with processor SubtermCriterion (1ms).
| | – Problem 5 was processed with processor PolynomialLinearRange4iUR (111ms).
| | | – Problem 6 was processed with processor PolynomialLinearRange4iUR (23ms).
| – Problem 4 was processed with processor SubtermCriterion (1ms).
The following open problems remain:
Open Dependency Pair Problem 2
Dependency Pairs
| h#(z, e(x)) | → | h#(c(z), d(z, x)) |
Rewrite Rules
| h(z, e(x)) | → | h(c(z), d(z, x)) | | d(z, g(0, 0)) | → | e(0) |
| d(z, g(x, y)) | → | g(e(x), d(z, y)) | | d(c(z), g(g(x, y), 0)) | → | g(d(c(z), g(x, y)), d(z, g(x, y))) |
| g(e(x), e(y)) | → | e(g(x, y)) |
Original Signature
Termination of terms over the following signature is verified: g, d, 0, e, c, h
Problem 1: DependencyGraph
Dependency Pair Problem
Dependency Pairs
| d#(z, g(x, y)) | → | g#(e(x), d(z, y)) | | d#(c(z), g(g(x, y), 0)) | → | g#(x, y) |
| d#(c(z), g(g(x, y), 0)) | → | d#(z, g(x, y)) | | g#(e(x), e(y)) | → | g#(x, y) |
| d#(z, g(x, y)) | → | d#(z, y) | | d#(c(z), g(g(x, y), 0)) | → | d#(c(z), g(x, y)) |
| h#(z, e(x)) | → | d#(z, x) | | d#(c(z), g(g(x, y), 0)) | → | g#(d(c(z), g(x, y)), d(z, g(x, y))) |
| h#(z, e(x)) | → | h#(c(z), d(z, x)) |
Rewrite Rules
| h(z, e(x)) | → | h(c(z), d(z, x)) | | d(z, g(0, 0)) | → | e(0) |
| d(z, g(x, y)) | → | g(e(x), d(z, y)) | | d(c(z), g(g(x, y), 0)) | → | g(d(c(z), g(x, y)), d(z, g(x, y))) |
| g(e(x), e(y)) | → | e(g(x, y)) |
Original Signature
Termination of terms over the following signature is verified: g, d, e, 0, c, h
Strategy
The following SCCs where found
| d#(c(z), g(g(x, y), 0)) → d#(z, g(x, y)) | d#(z, g(x, y)) → d#(z, y) |
| d#(c(z), g(g(x, y), 0)) → d#(c(z), g(x, y)) |
| g#(e(x), e(y)) → g#(x, y) |
| h#(z, e(x)) → h#(c(z), d(z, x)) |
Problem 3: SubtermCriterion
Dependency Pair Problem
Dependency Pairs
| d#(c(z), g(g(x, y), 0)) | → | d#(z, g(x, y)) | | d#(z, g(x, y)) | → | d#(z, y) |
| d#(c(z), g(g(x, y), 0)) | → | d#(c(z), g(x, y)) |
Rewrite Rules
| h(z, e(x)) | → | h(c(z), d(z, x)) | | d(z, g(0, 0)) | → | e(0) |
| d(z, g(x, y)) | → | g(e(x), d(z, y)) | | d(c(z), g(g(x, y), 0)) | → | g(d(c(z), g(x, y)), d(z, g(x, y))) |
| g(e(x), e(y)) | → | e(g(x, y)) |
Original Signature
Termination of terms over the following signature is verified: g, d, e, 0, c, h
Strategy
Projection
The following projection was used:
Thus, the following dependency pairs are removed:
| d#(c(z), g(g(x, y), 0)) | → | d#(z, g(x, y)) |
Problem 5: PolynomialLinearRange4iUR
Dependency Pair Problem
Dependency Pairs
| d#(z, g(x, y)) | → | d#(z, y) | | d#(c(z), g(g(x, y), 0)) | → | d#(c(z), g(x, y)) |
Rewrite Rules
| h(z, e(x)) | → | h(c(z), d(z, x)) | | d(z, g(0, 0)) | → | e(0) |
| d(z, g(x, y)) | → | g(e(x), d(z, y)) | | d(c(z), g(g(x, y), 0)) | → | g(d(c(z), g(x, y)), d(z, g(x, y))) |
| g(e(x), e(y)) | → | e(g(x, y)) |
Original Signature
Termination of terms over the following signature is verified: g, d, 0, e, c, h
Strategy
Polynomial Interpretation
- 0: 1
- c(x): 3
- d(x,y): 0
- d#(x,y): y
- e(x): 1
- g(x,y): y + x
- h(x,y): 0
Improved Usable rules
| g(e(x), e(y)) | → | e(g(x, y)) |
The following dependency pairs are strictly oriented by an ordering on the given polynomial interpretation, thus they are removed:
| d#(c(z), g(g(x, y), 0)) | → | d#(c(z), g(x, y)) |
Problem 6: PolynomialLinearRange4iUR
Dependency Pair Problem
Dependency Pairs
| d#(z, g(x, y)) | → | d#(z, y) |
Rewrite Rules
| h(z, e(x)) | → | h(c(z), d(z, x)) | | d(z, g(0, 0)) | → | e(0) |
| d(z, g(x, y)) | → | g(e(x), d(z, y)) | | d(c(z), g(g(x, y), 0)) | → | g(d(c(z), g(x, y)), d(z, g(x, y))) |
| g(e(x), e(y)) | → | e(g(x, y)) |
Original Signature
Termination of terms over the following signature is verified: g, d, e, 0, c, h
Strategy
Polynomial Interpretation
- 0: 0
- c(x): 0
- d(x,y): 0
- d#(x,y): y + x + 1
- e(x): 0
- g(x,y): y + 1
- h(x,y): 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:
| d#(z, g(x, y)) | → | d#(z, y) |
Problem 4: SubtermCriterion
Dependency Pair Problem
Dependency Pairs
| g#(e(x), e(y)) | → | g#(x, y) |
Rewrite Rules
| h(z, e(x)) | → | h(c(z), d(z, x)) | | d(z, g(0, 0)) | → | e(0) |
| d(z, g(x, y)) | → | g(e(x), d(z, y)) | | d(c(z), g(g(x, y), 0)) | → | g(d(c(z), g(x, y)), d(z, g(x, y))) |
| g(e(x), e(y)) | → | e(g(x, y)) |
Original Signature
Termination of terms over the following signature is verified: g, d, e, 0, c, h
Strategy
Projection
The following projection was used:
Thus, the following dependency pairs are removed:
| g#(e(x), e(y)) | → | g#(x, y) |