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