MAYBE

The TRS could not be proven terminating. The proof attempt took 967 ms.

The following DP Processors were used


Problem 1 remains open; application of the following processors failed [DependencyGraph (6ms), SubtermCriterion (1ms), DependencyGraph (11ms), PolynomialLinearRange4iUR (151ms), DependencyGraph (1ms), PolynomialLinearRange8NegiUR (416ms), DependencyGraph (2ms), ReductionPairSAT (146ms), DependencyGraph (1ms), SizeChangePrinciple (8ms)].

The following open problems remain:

Open Dependency Pair Problem 1

Dependency Pairs

a#(b(x)) → a#(x)a#(b(x)) → a#(a(x))

Rewrite Rules

a(b(x)) → b(b(a(a(x))))

Original Signature

Termination of terms over the following signature is verified: b, a