quot(0, s(

quot(s(

quot(

plus(0,

plus(s(

R

↳Dependency Pair Analysis

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

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

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

PLUS(s(x),y) -> PLUS(x,y)

Furthermore,

R

↳DPs

→DP Problem 1

↳Argument Filtering and Ordering

→DP Problem 2

↳AFS

**PLUS(s( x), y) -> PLUS(x, y)**

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, plus(z, s(0)), s(z)))

plus(0,y) ->y

plus(s(x),y) -> s(plus(x,y))

The following dependency pair can be strictly oriented:

PLUS(s(x),y) -> PLUS(x,y)

There are no usable rules w.r.t. to the AFS that need to be oriented.

Used ordering: Lexicographic Path Order with Non-Strict Precedence with Quasi Precedence:

trivial

resulting in one new DP problem.

Used Argument Filtering System:

PLUS(x,_{1}x) -> PLUS(_{2}x,_{1}x)_{2}

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

R

↳DPs

→DP Problem 1

↳AFS

→DP Problem 3

↳Dependency Graph

→DP Problem 2

↳AFS

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, plus(z, s(0)), s(z)))

plus(0,y) ->y

plus(s(x),y) -> s(plus(x,y))

Using the Dependency Graph resulted in no new DP problems.

R

↳DPs

→DP Problem 1

↳AFS

→DP Problem 2

↳Argument Filtering and Ordering

**QUOT( x, 0, s(z)) -> QUOT(x, plus(z, s(0)), 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, plus(z, s(0)), s(z)))

plus(0,y) ->y

plus(s(x),y) -> s(plus(x,y))

The following dependency pair can be strictly oriented:

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

There are no usable rules w.r.t. to the AFS that need to be oriented.

Used ordering: Lexicographic Path Order with Non-Strict Precedence with Quasi Precedence:

trivial

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

↳AFS

→DP Problem 4

↳Argument Filtering and Ordering

**QUOT( x, 0, s(z)) -> QUOT(x, plus(z, s(0)), 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, plus(z, s(0)), s(z)))

plus(0,y) ->y

plus(s(x),y) -> s(plus(x,y))

The following dependency pair can be strictly oriented:

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

The following usable rules w.r.t. to the AFS can be oriented:

plus(0,y) ->y

plus(s(x),y) -> s(plus(x,y))

Used ordering: Lexicographic Path Order with Non-Strict Precedence with Quasi Precedence:

0 > s

plus > s

QUOT > s

resulting in one new DP problem.

Used Argument Filtering System:

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

s(x) -> s_{1}

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

R

↳DPs

→DP Problem 1

↳AFS

→DP Problem 2

↳AFS

→DP Problem 4

↳AFS

...

→DP Problem 5

↳Dependency Graph

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, plus(z, s(0)), s(z)))

plus(0,y) ->y

plus(s(x),y) -> s(plus(x,y))

Using the Dependency Graph resulted in no new DP problems.

Duration:

0:00 minutes