a(a(x1)) → b(x1)
b(c(x1)) → a(x1)
c(b(x1)) → b(c(c(a(x1))))
↳ QTRS
↳ DependencyPairsProof
a(a(x1)) → b(x1)
b(c(x1)) → a(x1)
c(b(x1)) → b(c(c(a(x1))))
C(b(x1)) → A(x1)
C(b(x1)) → B(c(c(a(x1))))
B(c(x1)) → A(x1)
C(b(x1)) → C(a(x1))
C(b(x1)) → C(c(a(x1)))
A(a(x1)) → B(x1)
a(a(x1)) → b(x1)
b(c(x1)) → a(x1)
c(b(x1)) → b(c(c(a(x1))))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
C(b(x1)) → A(x1)
C(b(x1)) → B(c(c(a(x1))))
B(c(x1)) → A(x1)
C(b(x1)) → C(a(x1))
C(b(x1)) → C(c(a(x1)))
A(a(x1)) → B(x1)
a(a(x1)) → b(x1)
b(c(x1)) → a(x1)
c(b(x1)) → b(c(c(a(x1))))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDPOrderProof
↳ QDP
B(c(x1)) → A(x1)
A(a(x1)) → B(x1)
a(a(x1)) → b(x1)
b(c(x1)) → a(x1)
c(b(x1)) → b(c(c(a(x1))))
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
B(c(x1)) → A(x1)
A(a(x1)) → B(x1)
The value of delta used in the strict ordering is 1.
POL(c(x1)) = 1 + (4)x_1
POL(B(x1)) = 1 + (4)x_1
POL(a(x1)) = (2)x_1
POL(A(x1)) = 2 + (3)x_1
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ PisEmptyProof
↳ QDP
a(a(x1)) → b(x1)
b(c(x1)) → a(x1)
c(b(x1)) → b(c(c(a(x1))))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
C(b(x1)) → C(a(x1))
C(b(x1)) → C(c(a(x1)))
a(a(x1)) → b(x1)
b(c(x1)) → a(x1)
c(b(x1)) → b(c(c(a(x1))))