The TRS could be proven non-terminating. The proof took 213 ms.

The following reduction sequence is a witness for non-termination:

f#(a) →^* f#(a)

The following DP Processors were used

Problem 1 remains open; application of the following processors failed [DependencyGraph (3ms), SubtermCriterion (1ms), DependencyGraph (1ms), PolynomialOrdering (57ms), DependencyGraph (0ms), PolynomialOrdering (65ms), DependencyGraph (1ms), PolynomialOrdering (17ms), DependencyGraph (0ms), ReductionPairSAT (6ms), DependencyGraph (1ms), SizeChangePrinciple (3ms), BackwardsNarrowing (6ms), BackwardInstantiation (1ms), ForwardInstantiation (1ms), Propagation (1ms)].