div(0, y) → 0
div(x, y) → quot(x, y, y)
quot(0, s(y), z) → 0
quot(s(x), s(y), z) → quot(x, y, z)
quot(x, 0, s(z)) → s(div(x, s(z)))
↳ QTRS
↳ DependencyPairsProof
div(0, y) → 0
div(x, y) → quot(x, y, y)
quot(0, s(y), z) → 0
quot(s(x), s(y), z) → quot(x, y, z)
quot(x, 0, s(z)) → s(div(x, s(z)))
QUOT(x, 0, s(z)) → DIV(x, s(z))
QUOT(s(x), s(y), z) → QUOT(x, y, z)
DIV(x, y) → QUOT(x, y, y)
div(0, y) → 0
div(x, y) → quot(x, y, y)
quot(0, s(y), z) → 0
quot(s(x), s(y), z) → quot(x, y, z)
quot(x, 0, s(z)) → s(div(x, s(z)))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ QDPOrderProof
QUOT(x, 0, s(z)) → DIV(x, s(z))
QUOT(s(x), s(y), z) → QUOT(x, y, z)
DIV(x, y) → QUOT(x, y, y)
div(0, y) → 0
div(x, y) → quot(x, y, y)
quot(0, s(y), z) → 0
quot(s(x), s(y), z) → quot(x, y, z)
quot(x, 0, s(z)) → s(div(x, s(z)))
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
QUOT(s(x), s(y), z) → QUOT(x, y, z)
Used ordering: Polynomial interpretation [25,35]:
QUOT(x, 0, s(z)) → DIV(x, s(z))
DIV(x, y) → QUOT(x, y, y)
The value of delta used in the strict ordering is 16.
POL(QUOT(x1, x2, x3)) = (4)x_1
POL(DIV(x1, x2)) = (4)x_1
POL(s(x1)) = 4 + (2)x_1
POL(0) = 0
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ QDPOrderProof
QUOT(x, 0, s(z)) → DIV(x, s(z))
DIV(x, y) → QUOT(x, y, y)
div(0, y) → 0
div(x, y) → quot(x, y, y)
quot(0, s(y), z) → 0
quot(s(x), s(y), z) → quot(x, y, z)
quot(x, 0, s(z)) → s(div(x, s(z)))
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
QUOT(x, 0, s(z)) → DIV(x, s(z))
DIV(x, y) → QUOT(x, y, y)
The value of delta used in the strict ordering is 3.
POL(QUOT(x1, x2, x3)) = (3)x_2
POL(DIV(x1, x2)) = 3 + (4)x_2
POL(s(x1)) = 0
POL(0) = 2
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ PisEmptyProof
div(0, y) → 0
div(x, y) → quot(x, y, y)
quot(0, s(y), z) → 0
quot(s(x), s(y), z) → quot(x, y, z)
quot(x, 0, s(z)) → s(div(x, s(z)))