MAYBE

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

The following DP Processors were used


Problem 1 remains open; application of the following processors failed [DependencyGraph (23ms), SubtermCriterion (1ms), DependencyGraph (7ms), PolynomialLinearRange4iUR (582ms), DependencyGraph (6ms), PolynomialLinearRange8NegiUR (1629ms), DependencyGraph (8ms), ReductionPairSAT (18077ms), DependencyGraph (5ms), SizeChangePrinciple (10ms)].

The following open problems remain:

Open Dependency Pair Problem 1

Dependency Pairs

f#(f(f(f(j, a), b), c), d) → f#(f(a, b), f(f(a, d), c))f#(f(f(f(j, a), b), c), d) → f#(a, b)
f#(f(f(f(j, a), b), c), d) → f#(a, d)f#(f(f(f(j, a), b), c), d) → f#(f(a, d), c)

Rewrite Rules

f(f(f(f(j, a), b), c), d) → f(f(a, b), f(f(a, d), c))

Original Signature

Termination of terms over the following signature is verified: f, j