MAYBE

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

The following DP Processors were used


Problem 1 remains open; application of the following processors failed [DependencyGraph (6ms), SubtermCriterion (1ms), DependencyGraph (1ms), PolynomialLinearRange4iUR (96ms), DependencyGraph (2ms), PolynomialLinearRange8NegiUR (36ms), DependencyGraph (1ms), ReductionPairSAT (22ms), DependencyGraph (2ms), SizeChangePrinciple (4ms)].

The following open problems remain:

Open Dependency Pair Problem 1

Dependency Pairs

f#(a, X) → f#(X, X)

Rewrite Rules

f(a, X) → f(X, X)c → a
c → b

Original Signature

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