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