The TRS could be proven non-terminating. The proof took 204 ms.
The following reduction sequence is a witness for non-termination:
f# →* f#
Problem 1 remains open; application of the following processors failed [DependencyGraph (5ms), SubtermCriterion (0ms), DependencyGraph (1ms), PolynomialLinearRange4iUR (82ms), DependencyGraph (1ms), PolynomialLinearRange8NegiUR (30ms), DependencyGraph (0ms), ReductionPairSAT (8ms), DependencyGraph (1ms), SizeChangePrinciple (1ms), ForwardNarrowing (1ms), BackwardInstantiation (1ms), ForwardInstantiation (0ms), Propagation (1ms)].