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