quot(0, s(

quot(s(

quot(

R

↳Dependency Pair Analysis

QUOT(s(x), s(y),z) -> QUOT(x,y,z)

QUOT(x, 0, s(z)) -> QUOT(x, s(z), s(z))

Furthermore,

R

↳DPs

→DP Problem 1

↳Argument Filtering and Ordering

**QUOT( x, 0, s(z)) -> QUOT(x, s(z), s(z))**

quot(0, s(y), s(z)) -> 0

quot(s(x), s(y),z) -> quot(x,y,z)

quot(x, 0, s(z)) -> s(quot(x, s(z), s(z)))

innermost

The following dependency pair can be strictly oriented:

QUOT(s(x), s(y),z) -> QUOT(x,y,z)

There are no usable rules for innermost that need to be oriented.

Used ordering: Homeomorphic Embedding Order with EMB

resulting in one new DP problem.

Used Argument Filtering System:

QUOT(x,_{1}x,_{2}x) ->_{3}x_{1}

s(x) -> s(_{1}x)_{1}

R

↳DPs

→DP Problem 1

↳AFS

→DP Problem 2

↳Dependency Graph

**QUOT( x, 0, s(z)) -> QUOT(x, s(z), s(z))**

quot(0, s(y), s(z)) -> 0

quot(s(x), s(y),z) -> quot(x,y,z)

quot(x, 0, s(z)) -> s(quot(x, s(z), s(z)))

innermost

Using the Dependency Graph resulted in no new DP problems.

Duration:

0:00 minutes