plus(0,

plus(s(

min(

min(s(

min(min(

quot(0, s(

quot(s(

R

↳Dependency Pair Analysis

PLUS(s(X),Y) -> PLUS(X,Y)

MIN(s(X), s(Y)) -> MIN(X,Y)

MIN(min(X,Y), Z) -> MIN(X, plus(Y, Z))

MIN(min(X,Y), Z) -> PLUS(Y, Z)

QUOT(s(X), s(Y)) -> QUOT(min(X,Y), s(Y))

QUOT(s(X), s(Y)) -> MIN(X,Y)

Furthermore,

R

↳DPs

→DP Problem 1

↳Argument Filtering and Ordering

→DP Problem 2

↳AFS

→DP Problem 3

↳AFS

**PLUS(s( X), Y) -> PLUS(X, Y)**

plus(0,Y) ->Y

plus(s(X),Y) -> s(plus(X,Y))

min(X, 0) ->X

min(s(X), s(Y)) -> min(X,Y)

min(min(X,Y), Z) -> min(X, plus(Y, Z))

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

quot(s(X), s(Y)) -> s(quot(min(X,Y), s(Y)))

innermost

The following dependency pair can be strictly oriented:

PLUS(s(X),Y) -> PLUS(X,Y)

There are no usable rules for innermost 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 4

↳Dependency Graph

→DP Problem 2

↳AFS

→DP Problem 3

↳AFS

plus(0,Y) ->Y

plus(s(X),Y) -> s(plus(X,Y))

min(X, 0) ->X

min(s(X), s(Y)) -> min(X,Y)

min(min(X,Y), Z) -> min(X, plus(Y, Z))

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

quot(s(X), s(Y)) -> s(quot(min(X,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

↳AFS

**MIN(min( X, Y), Z) -> MIN(X, plus(Y, Z))**

plus(0,Y) ->Y

plus(s(X),Y) -> s(plus(X,Y))

min(X, 0) ->X

min(s(X), s(Y)) -> min(X,Y)

min(min(X,Y), Z) -> min(X, plus(Y, Z))

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

quot(s(X), s(Y)) -> s(quot(min(X,Y), s(Y)))

innermost

The following dependency pairs can be strictly oriented:

MIN(min(X,Y), Z) -> MIN(X, plus(Y, Z))

MIN(s(X), s(Y)) -> MIN(X,Y)

The following usable rules for innermost 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:

{Z, min} > plus > s

resulting in one new DP problem.

Used Argument Filtering System:

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

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

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

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

R

↳DPs

→DP Problem 1

↳AFS

→DP Problem 2

↳AFS

→DP Problem 5

↳Dependency Graph

→DP Problem 3

↳AFS

plus(0,Y) ->Y

plus(s(X),Y) -> s(plus(X,Y))

min(X, 0) ->X

min(s(X), s(Y)) -> min(X,Y)

min(min(X,Y), Z) -> min(X, plus(Y, Z))

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

quot(s(X), s(Y)) -> s(quot(min(X,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

↳Argument Filtering and Ordering

**QUOT(s( X), s(Y)) -> QUOT(min(X, Y), s(Y))**

plus(0,Y) ->Y

plus(s(X),Y) -> s(plus(X,Y))

min(X, 0) ->X

min(s(X), s(Y)) -> min(X,Y)

min(min(X,Y), Z) -> min(X, plus(Y, Z))

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

quot(s(X), s(Y)) -> s(quot(min(X,Y), s(Y)))

innermost

The following dependency pair can be strictly oriented:

QUOT(s(X), s(Y)) -> QUOT(min(X,Y), s(Y))

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

min(X, 0) ->X

min(s(X), s(Y)) -> min(X,Y)

min(min(X,Y), Z) -> min(X, plus(Y, Z))

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) -> QUOT(_{2}x,_{1}x)_{2}

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

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

R

↳DPs

→DP Problem 1

↳AFS

→DP Problem 2

↳AFS

→DP Problem 3

↳AFS

→DP Problem 6

↳Dependency Graph

plus(0,Y) ->Y

plus(s(X),Y) -> s(plus(X,Y))

min(X, 0) ->X

min(s(X), s(Y)) -> min(X,Y)

min(min(X,Y), Z) -> min(X, plus(Y, Z))

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

quot(s(X), s(Y)) -> s(quot(min(X,Y), s(Y)))

innermost

Using the Dependency Graph resulted in no new DP problems.

Duration:

0:00 minutes