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