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