Term Rewriting System R:
[y, x, n, m]
le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
app(nil, y) -> y
low(n, nil) -> nil
iflow(false, n, add(m, x)) -> low(n, x)
high(n, nil) -> nil
ifhigh(true, n, add(m, x)) -> high(n, x)
quicksort(nil) -> nil

Termination of R to be shown.

`   R`
`     ↳Dependency Pair Analysis`

R contains the following Dependency Pairs:

LE(s(x), s(y)) -> LE(x, y)
APP(add(n, x), y) -> APP(x, y)
LOW(n, add(m, x)) -> LE(m, n)
IFLOW(true, n, add(m, x)) -> LOW(n, x)
IFLOW(false, n, add(m, x)) -> LOW(n, x)
HIGH(n, add(m, x)) -> LE(m, n)
IFHIGH(true, n, add(m, x)) -> HIGH(n, x)
IFHIGH(false, n, add(m, x)) -> HIGH(n, x)

Furthermore, R contains five SCCs.

`   R`
`     ↳DPs`
`       →DP Problem 1`
`         ↳Remaining Obligation(s)`
`       →DP Problem 2`
`         ↳Remaining Obligation(s)`
`       →DP Problem 3`
`         ↳Remaining Obligation(s)`
`       →DP Problem 4`
`         ↳Remaining Obligation(s)`
`       →DP Problem 5`
`         ↳Remaining Obligation(s)`

The following remains to be proven:
• Dependency Pair:

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

Rules:

le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
app(nil, y) -> y
low(n, nil) -> nil
iflow(false, n, add(m, x)) -> low(n, x)
high(n, nil) -> nil
ifhigh(true, n, add(m, x)) -> high(n, x)
quicksort(nil) -> nil

• Dependency Pair:

APP(add(n, x), y) -> APP(x, y)

Rules:

le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
app(nil, y) -> y
low(n, nil) -> nil
iflow(false, n, add(m, x)) -> low(n, x)
high(n, nil) -> nil
ifhigh(true, n, add(m, x)) -> high(n, x)
quicksort(nil) -> nil

• Dependency Pairs:

IFLOW(false, n, add(m, x)) -> LOW(n, x)
IFLOW(true, n, add(m, x)) -> LOW(n, x)

Rules:

le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
app(nil, y) -> y
low(n, nil) -> nil
iflow(false, n, add(m, x)) -> low(n, x)
high(n, nil) -> nil
ifhigh(true, n, add(m, x)) -> high(n, x)
quicksort(nil) -> nil

• Dependency Pairs:

IFHIGH(false, n, add(m, x)) -> HIGH(n, x)
IFHIGH(true, n, add(m, x)) -> HIGH(n, x)

Rules:

le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
app(nil, y) -> y
low(n, nil) -> nil
iflow(false, n, add(m, x)) -> low(n, x)
high(n, nil) -> nil
ifhigh(true, n, add(m, x)) -> high(n, x)
quicksort(nil) -> nil

• Dependency Pairs:

Rules:

le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
app(nil, y) -> y
low(n, nil) -> nil
iflow(false, n, add(m, x)) -> low(n, x)
high(n, nil) -> nil
ifhigh(true, n, add(m, x)) -> high(n, x)
quicksort(nil) -> nil

`   R`
`     ↳DPs`
`       →DP Problem 1`
`         ↳Remaining Obligation(s)`
`       →DP Problem 2`
`         ↳Remaining Obligation(s)`
`       →DP Problem 3`
`         ↳Remaining Obligation(s)`
`       →DP Problem 4`
`         ↳Remaining Obligation(s)`
`       →DP Problem 5`
`         ↳Remaining Obligation(s)`

The following remains to be proven:
• Dependency Pair:

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

Rules:

le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
app(nil, y) -> y
low(n, nil) -> nil
iflow(false, n, add(m, x)) -> low(n, x)
high(n, nil) -> nil
ifhigh(true, n, add(m, x)) -> high(n, x)
quicksort(nil) -> nil

• Dependency Pair:

APP(add(n, x), y) -> APP(x, y)

Rules:

le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
app(nil, y) -> y
low(n, nil) -> nil
iflow(false, n, add(m, x)) -> low(n, x)
high(n, nil) -> nil
ifhigh(true, n, add(m, x)) -> high(n, x)
quicksort(nil) -> nil

• Dependency Pairs:

IFLOW(false, n, add(m, x)) -> LOW(n, x)
IFLOW(true, n, add(m, x)) -> LOW(n, x)

Rules:

le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
app(nil, y) -> y
low(n, nil) -> nil
iflow(false, n, add(m, x)) -> low(n, x)
high(n, nil) -> nil
ifhigh(true, n, add(m, x)) -> high(n, x)
quicksort(nil) -> nil

• Dependency Pairs:

IFHIGH(false, n, add(m, x)) -> HIGH(n, x)
IFHIGH(true, n, add(m, x)) -> HIGH(n, x)

Rules:

le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
app(nil, y) -> y
low(n, nil) -> nil
iflow(false, n, add(m, x)) -> low(n, x)
high(n, nil) -> nil
ifhigh(true, n, add(m, x)) -> high(n, x)
quicksort(nil) -> nil

• Dependency Pairs:

Rules:

le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
app(nil, y) -> y
low(n, nil) -> nil
iflow(false, n, add(m, x)) -> low(n, x)
high(n, nil) -> nil
ifhigh(true, n, add(m, x)) -> high(n, x)
quicksort(nil) -> nil

`   R`
`     ↳DPs`
`       →DP Problem 1`
`         ↳Remaining Obligation(s)`
`       →DP Problem 2`
`         ↳Remaining Obligation(s)`
`       →DP Problem 3`
`         ↳Remaining Obligation(s)`
`       →DP Problem 4`
`         ↳Remaining Obligation(s)`
`       →DP Problem 5`
`         ↳Remaining Obligation(s)`

The following remains to be proven:
• Dependency Pair:

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

Rules:

le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
app(nil, y) -> y
low(n, nil) -> nil
iflow(false, n, add(m, x)) -> low(n, x)
high(n, nil) -> nil
ifhigh(true, n, add(m, x)) -> high(n, x)
quicksort(nil) -> nil

• Dependency Pair:

APP(add(n, x), y) -> APP(x, y)

Rules:

le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
app(nil, y) -> y
low(n, nil) -> nil
iflow(false, n, add(m, x)) -> low(n, x)
high(n, nil) -> nil
ifhigh(true, n, add(m, x)) -> high(n, x)
quicksort(nil) -> nil

• Dependency Pairs:

IFLOW(false, n, add(m, x)) -> LOW(n, x)
IFLOW(true, n, add(m, x)) -> LOW(n, x)

Rules:

le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
app(nil, y) -> y
low(n, nil) -> nil
iflow(false, n, add(m, x)) -> low(n, x)
high(n, nil) -> nil
ifhigh(true, n, add(m, x)) -> high(n, x)
quicksort(nil) -> nil

• Dependency Pairs:

IFHIGH(false, n, add(m, x)) -> HIGH(n, x)
IFHIGH(true, n, add(m, x)) -> HIGH(n, x)

Rules:

le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
app(nil, y) -> y
low(n, nil) -> nil
iflow(false, n, add(m, x)) -> low(n, x)
high(n, nil) -> nil
ifhigh(true, n, add(m, x)) -> high(n, x)
quicksort(nil) -> nil

• Dependency Pairs:

Rules:

le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
app(nil, y) -> y
low(n, nil) -> nil
iflow(false, n, add(m, x)) -> low(n, x)
high(n, nil) -> nil
ifhigh(true, n, add(m, x)) -> high(n, x)
quicksort(nil) -> nil

`   R`
`     ↳DPs`
`       →DP Problem 1`
`         ↳Remaining Obligation(s)`
`       →DP Problem 2`
`         ↳Remaining Obligation(s)`
`       →DP Problem 3`
`         ↳Remaining Obligation(s)`
`       →DP Problem 4`
`         ↳Remaining Obligation(s)`
`       →DP Problem 5`
`         ↳Remaining Obligation(s)`

The following remains to be proven:
• Dependency Pair:

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

Rules:

le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
app(nil, y) -> y
low(n, nil) -> nil
iflow(false, n, add(m, x)) -> low(n, x)
high(n, nil) -> nil
ifhigh(true, n, add(m, x)) -> high(n, x)
quicksort(nil) -> nil

• Dependency Pair:

APP(add(n, x), y) -> APP(x, y)

Rules:

le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
app(nil, y) -> y
low(n, nil) -> nil
iflow(false, n, add(m, x)) -> low(n, x)
high(n, nil) -> nil
ifhigh(true, n, add(m, x)) -> high(n, x)
quicksort(nil) -> nil

• Dependency Pairs:

IFLOW(false, n, add(m, x)) -> LOW(n, x)
IFLOW(true, n, add(m, x)) -> LOW(n, x)

Rules:

le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
app(nil, y) -> y
low(n, nil) -> nil
iflow(false, n, add(m, x)) -> low(n, x)
high(n, nil) -> nil
ifhigh(true, n, add(m, x)) -> high(n, x)
quicksort(nil) -> nil

• Dependency Pairs:

IFHIGH(false, n, add(m, x)) -> HIGH(n, x)
IFHIGH(true, n, add(m, x)) -> HIGH(n, x)

Rules:

le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
app(nil, y) -> y
low(n, nil) -> nil
iflow(false, n, add(m, x)) -> low(n, x)
high(n, nil) -> nil
ifhigh(true, n, add(m, x)) -> high(n, x)
quicksort(nil) -> nil

• Dependency Pairs:

Rules:

le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
app(nil, y) -> y
low(n, nil) -> nil
iflow(false, n, add(m, x)) -> low(n, x)
high(n, nil) -> nil
ifhigh(true, n, add(m, x)) -> high(n, x)
quicksort(nil) -> nil

`   R`
`     ↳DPs`
`       →DP Problem 1`
`         ↳Remaining Obligation(s)`
`       →DP Problem 2`
`         ↳Remaining Obligation(s)`
`       →DP Problem 3`
`         ↳Remaining Obligation(s)`
`       →DP Problem 4`
`         ↳Remaining Obligation(s)`
`       →DP Problem 5`
`         ↳Remaining Obligation(s)`

The following remains to be proven:
• Dependency Pair:

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

Rules:

le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
app(nil, y) -> y
low(n, nil) -> nil
iflow(false, n, add(m, x)) -> low(n, x)
high(n, nil) -> nil
ifhigh(true, n, add(m, x)) -> high(n, x)
quicksort(nil) -> nil

• Dependency Pair:

APP(add(n, x), y) -> APP(x, y)

Rules:

le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
app(nil, y) -> y
low(n, nil) -> nil
iflow(false, n, add(m, x)) -> low(n, x)
high(n, nil) -> nil
ifhigh(true, n, add(m, x)) -> high(n, x)
quicksort(nil) -> nil

• Dependency Pairs:

IFLOW(false, n, add(m, x)) -> LOW(n, x)
IFLOW(true, n, add(m, x)) -> LOW(n, x)

Rules:

le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
app(nil, y) -> y
low(n, nil) -> nil
iflow(false, n, add(m, x)) -> low(n, x)
high(n, nil) -> nil
ifhigh(true, n, add(m, x)) -> high(n, x)
quicksort(nil) -> nil

• Dependency Pairs:

IFHIGH(false, n, add(m, x)) -> HIGH(n, x)
IFHIGH(true, n, add(m, x)) -> HIGH(n, x)

Rules:

le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
app(nil, y) -> y
low(n, nil) -> nil
iflow(false, n, add(m, x)) -> low(n, x)
high(n, nil) -> nil
ifhigh(true, n, add(m, x)) -> high(n, x)
quicksort(nil) -> nil

• Dependency Pairs:

Rules:

le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
app(nil, y) -> y
low(n, nil) -> nil
iflow(false, n, add(m, x)) -> low(n, x)
high(n, nil) -> nil