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