a(a(x1)) → c(b(x1))
b(b(x1)) → a(c(x1))
c(c(x1)) → b(a(x1))
↳ QTRS
↳ DependencyPairsProof
a(a(x1)) → c(b(x1))
b(b(x1)) → a(c(x1))
c(c(x1)) → b(a(x1))
C(c(x1)) → A(x1)
B(b(x1)) → C(x1)
A(a(x1)) → C(b(x1))
C(c(x1)) → B(a(x1))
B(b(x1)) → A(c(x1))
A(a(x1)) → B(x1)
a(a(x1)) → c(b(x1))
b(b(x1)) → a(c(x1))
c(c(x1)) → b(a(x1))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ QDPOrderProof
C(c(x1)) → A(x1)
B(b(x1)) → C(x1)
A(a(x1)) → C(b(x1))
C(c(x1)) → B(a(x1))
B(b(x1)) → A(c(x1))
A(a(x1)) → B(x1)
a(a(x1)) → c(b(x1))
b(b(x1)) → a(c(x1))
c(c(x1)) → b(a(x1))
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
C(c(x1)) → A(x1)
B(b(x1)) → C(x1)
A(a(x1)) → B(x1)
Used ordering: Polynomial interpretation [25,35]:
A(a(x1)) → C(b(x1))
C(c(x1)) → B(a(x1))
B(b(x1)) → A(c(x1))
The value of delta used in the strict ordering is 1.
POL(C(x1)) = x_1
POL(c(x1)) = 1 + x_1
POL(B(x1)) = x_1
POL(a(x1)) = 1 + x_1
POL(A(x1)) = x_1
POL(b(x1)) = 1 + x_1
c(c(x1)) → b(a(x1))
b(b(x1)) → a(c(x1))
a(a(x1)) → c(b(x1))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ QDPOrderProof
↳ QDP
A(a(x1)) → C(b(x1))
B(b(x1)) → A(c(x1))
C(c(x1)) → B(a(x1))
a(a(x1)) → c(b(x1))
b(b(x1)) → a(c(x1))
c(c(x1)) → b(a(x1))