0 QTRS
↳1 DependencyPairsProof (⇔)
↳2 QDP
↳3 QDPOrderProof (⇔)
↳4 QDP
f(a, f(a, x)) → f(c, f(b, x))
f(b, f(b, x)) → f(a, f(c, x))
f(c, f(c, x)) → f(b, f(a, x))
F(a, f(a, x)) → F(c, f(b, x))
F(a, f(a, x)) → F(b, x)
F(b, f(b, x)) → F(a, f(c, x))
F(b, f(b, x)) → F(c, x)
F(c, f(c, x)) → F(b, f(a, x))
F(c, f(c, x)) → F(a, x)
f(a, f(a, x)) → f(c, f(b, x))
f(b, f(b, x)) → f(a, f(c, x))
f(c, f(c, x)) → f(b, f(a, x))
a1(a(x)) → c1(b(x))
a1(a(x)) → b1(x)
b1(b(x)) → a1(c(x))
b1(b(x)) → c1(x)
c1(c(x)) → b1(a(x))
c1(c(x)) → a1(x)
a(a(x)) → c(b(x))
b(b(x)) → a(c(x))
c(c(x)) → b(a(x))
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
F(a, f(a, x)) → F(b, x)
F(b, f(b, x)) → F(c, x)
F(c, f(c, x)) → F(a, x)
[a11, a1, c11, b1, b11, c1]
f(a, f(a, x)) → f(c, f(b, x))
f(b, f(b, x)) → f(a, f(c, x))
f(c, f(c, x)) → f(b, f(a, x))
F(a, f(a, x)) → F(c, f(b, x))
F(b, f(b, x)) → F(a, f(c, x))
F(c, f(c, x)) → F(b, f(a, x))
f(a, f(a, x)) → f(c, f(b, x))
f(b, f(b, x)) → f(a, f(c, x))
f(c, f(c, x)) → f(b, f(a, x))