MAYBE
The TRS could not be proven terminating. The proof attempt took 305 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 (6ms), DependencyGraph (1ms), PolynomialLinearRange4iUR (73ms), DependencyGraph (1ms), PolynomialLinearRange8NegiUR (30ms), DependencyGraph (1ms), ReductionPairSAT (15ms), DependencyGraph (2ms), SizeChangePrinciple (7ms)].
The following open problems remain:
Open Dependency Pair Problem 2
Dependency Pairs
Rewrite Rules
| cons(x, cons(y, z)) | → | big | | inf(x) | → | cons(x, inf(s(x))) |
Original Signature
Termination of terms over the following signature is verified: s, inf, big, cons
Problem 1: DependencyGraph
Dependency Pair Problem
Dependency Pairs
| inf#(x) | → | cons#(x, inf(s(x))) | | inf#(x) | → | inf#(s(x)) |
Rewrite Rules
| cons(x, cons(y, z)) | → | big | | inf(x) | → | cons(x, inf(s(x))) |
Original Signature
Termination of terms over the following signature is verified: s, inf, big, cons
Strategy
The following SCCs where found