TIMEOUT

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

The following DP Processors were used

Problem 1 remains open; application of the following processors failed [DependencyGraph (44ms), SubtermCriterion (1ms), DependencyGraph (19ms), PolynomialLinearRange4iUR (1374ms), DependencyGraph (17ms), PolynomialLinearRange8NegiUR (29997ms), ReductionPairSAT (28500ms)].

The following open problems remain:

Open Dependency Pair Problem 1

Dependency Pairs

a^#(g, a(f, a(g, x)))	→	a^#(f, a(f, a(g, x)))		a^#(g, a(f, a(g, x)))	→	a^#(g, x)
a^#(f, a(g, a(f, x)))	→	a^#(g, a(g, a(f, x)))		a^#(g, a(f, a(g, x)))	→	a^#(g, a(f, a(f, a(g, x))))
a^#(g, a(f, a(g, x)))	→	a^#(f, a(g, x))		a^#(f, a(g, a(f, x)))	→	a^#(g, a(f, x))
a^#(f, a(g, a(f, x)))	→	a^#(f, a(g, a(g, a(f, x))))		a^#(f, a(g, a(f, x)))	→	a^#(f, x)

Rewrite Rules

a(f, a(g, a(f, x)))

→

a(f, a(g, a(g, a(f, x))))

a(g, a(f, a(g, x)))

→

a(g, a(f, a(f, a(g, x))))

Original Signature

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