MAYBE
The TRS could not be proven terminating. The proof attempt took 263 ms.
The following DP Processors were used
Problem 1 was processed with processor DependencyGraph (0ms).
| – Problem 2 remains open; application of the following processors failed [SubtermCriterion (1ms), DependencyGraph (7ms), PolynomialLinearRange4iUR (70ms), DependencyGraph (2ms), PolynomialLinearRange8NegiUR (59ms), DependencyGraph (1ms), ReductionPairSAT (29ms), DependencyGraph (2ms), SizeChangePrinciple (5ms)].
The following open problems remain:
Open Dependency Pair Problem 2
Dependency Pairs
Rewrite Rules
| f(x, x) | → | f(g(x), x) | | g(x) | → | s(x) |
Original Signature
Termination of terms over the following signature is verified: f, g, s
Problem 1: DependencyGraph
Dependency Pair Problem
Dependency Pairs
| f#(x, x) | → | f#(g(x), x) | | f#(x, x) | → | g#(x) |
Rewrite Rules
| f(x, x) | → | f(g(x), x) | | g(x) | → | s(x) |
Original Signature
Termination of terms over the following signature is verified: f, g, s
Strategy
The following SCCs where found