minus(

minus(s(

le(0,

le(s(

le(s(

quot(0, s(

quot(s(

R

↳Dependency Pair Analysis

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

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

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

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

Furthermore,

R

↳DPs

→DP Problem 1

↳Argument Filtering and Ordering

→DP Problem 2

↳AFS

→DP Problem 3

↳Rw

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

minus(x, 0) ->x

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

le(0,y) -> true

le(s(x), 0) -> false

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

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

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

innermost

The following dependency pair can be strictly oriented:

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

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:

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

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

R

↳DPs

→DP Problem 1

↳AFS

→DP Problem 4

↳Dependency Graph

→DP Problem 2

↳AFS

→DP Problem 3

↳Rw

minus(x, 0) ->x

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

le(0,y) -> true

le(s(x), 0) -> false

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

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

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

innermost

Using the Dependency Graph resulted in no new DP problems.

R

↳DPs

→DP Problem 1

↳AFS

→DP Problem 2

↳Argument Filtering and Ordering

→DP Problem 3

↳Rw

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

minus(x, 0) ->x

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

le(0,y) -> true

le(s(x), 0) -> false

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

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

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

innermost

The following dependency pair can be strictly oriented:

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

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:

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

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

R

↳DPs

→DP Problem 1

↳AFS

→DP Problem 2

↳AFS

→DP Problem 5

↳Dependency Graph

→DP Problem 3

↳Rw

minus(x, 0) ->x

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

le(0,y) -> true

le(s(x), 0) -> false

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

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

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

innermost

Using the Dependency Graph resulted in no new DP problems.

R

↳DPs

→DP Problem 1

↳AFS

→DP Problem 2

↳AFS

→DP Problem 3

↳Rewriting Transformation

**QUOT(s( x), s(y)) -> QUOT(minus(s(x), s(y)), s(y))**

minus(x, 0) ->x

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

le(0,y) -> true

le(s(x), 0) -> false

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

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

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

innermost

On this DP problem, a Rewriting SCC transformation can be performed.

As a result of transforming the rule

one new Dependency Pair is created:

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

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

The transformation is resulting in one new DP problem:

R

↳DPs

→DP Problem 1

↳AFS

→DP Problem 2

↳AFS

→DP Problem 3

↳Rw

→DP Problem 6

↳Argument Filtering and Ordering

**QUOT(s( x), s(y)) -> QUOT(minus(x, y), s(y))**

minus(x, 0) ->x

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

le(0,y) -> true

le(s(x), 0) -> false

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

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

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

innermost

The following dependency pair can be strictly oriented:

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

The following usable rules for innermost can be oriented:

minus(x, 0) ->x

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

Used ordering: Homeomorphic Embedding Order with EMB

resulting in one new DP problem.

Used Argument Filtering System:

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

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

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

R

↳DPs

→DP Problem 1

↳AFS

→DP Problem 2

↳AFS

→DP Problem 3

↳Rw

→DP Problem 6

↳AFS

...

→DP Problem 7

↳Dependency Graph

minus(x, 0) ->x

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

le(0,y) -> true

le(s(x), 0) -> false

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

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

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

innermost

Using the Dependency Graph resulted in no new DP problems.

Duration:

0:00 minutes