TIMEOUT

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

The following DP Processors were used


Problem 1 remains open; application of the following processors failed [DependencyGraph (35ms), SubtermCriterion (1ms), DependencyGraph (12ms), PolynomialLinearRange4iUR (896ms), DependencyGraph (15ms), PolynomialLinearRange8NegiUR (3033ms), DependencyGraph (7ms), ReductionPairSAT (timeout)].

The following open problems remain:



Open Dependency Pair Problem 1

Dependency Pairs

:#(:(:(:(C, x), y), z), u):#(:(x, z), :(:(:(x, y), z), u)):#(:(:(:(C, x), y), z), u):#(x, y)
:#(:(:(:(C, x), y), z), u):#(:(:(x, y), z), u):#(:(:(:(C, x), y), z), u):#(:(x, y), z)
:#(:(:(:(C, x), y), z), u):#(x, z)

Rewrite Rules

:(:(:(:(C, x), y), z), u):(:(x, z), :(:(:(x, y), z), u))

Original Signature

Termination of terms over the following signature is verified: C, :