MAYBE

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

The following DP Processors were used


Problem 1 remains open; application of the following processors failed [DependencyGraph (5ms), SubtermCriterion (1ms), DependencyGraph (1ms), PolynomialLinearRange4iUR (74ms), DependencyGraph (1ms), PolynomialLinearRange8NegiUR (37ms), DependencyGraph (1ms), ReductionPairSAT (18ms), DependencyGraph (2ms), SizeChangePrinciple (8ms)].

The following open problems remain:

Open Dependency Pair Problem 1

Dependency Pairs

from#(X) → from#(s(X))

Rewrite Rules

2nd(cons(X, cons(Y, Z))) → Yfrom(X) → cons(X, from(s(X)))

Original Signature

Termination of terms over the following signature is verified: 2nd, s, from, cons