Termination Proof using AProVE

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

Innermost Termination of R to be shown.

     ↳Dependency Pair Analysis

R contains the following Dependency Pairs:

MINUS(s(x), s(y)) -> MINUS(x, y)
QUOT(s(x), s(y)) -> QUOT(minus(x, y), s(y))
QUOT(s(x), s(y)) -> MINUS(x, y)
LE(s(x), s(y)) -> LE(x, y)
APP(add(n, x), y) -> APP(x, y)
LOW(n, add(m, x)) -> IF_LOW(le(m, n), n, add(m, x))
LOW(n, add(m, x)) -> LE(m, n)
IF_LOW(true, n, add(m, x)) -> LOW(n, x)
IF_LOW(false, n, add(m, x)) -> LOW(n, x)
HIGH(n, add(m, x)) -> IF_HIGH(le(m, n), n, add(m, x))
HIGH(n, add(m, x)) -> LE(m, n)
IF_HIGH(true, n, add(m, x)) -> HIGH(n, x)
IF_HIGH(false, n, add(m, x)) -> HIGH(n, x)
QUICKSORT(add(n, x)) -> APP(quicksort(low(n, x)), add(n, quicksort(high(n, x))))
QUICKSORT(add(n, x)) -> QUICKSORT(low(n, x))
QUICKSORT(add(n, x)) -> LOW(n, x)
QUICKSORT(add(n, x)) -> QUICKSORT(high(n, x))
QUICKSORT(add(n, x)) -> HIGH(n, x)

Furthermore, R contains seven SCCs.

     ↳DPs

       →DP Problem 1

         ↳Argument Filtering and Ordering

       →DP Problem 2

         ↳AFS

       →DP Problem 3

         ↳AFS

       →DP Problem 4

         ↳AFS

       →DP Problem 5

         ↳Nar

       →DP Problem 6

         ↳Remaining

       →DP Problem 7

         ↳Remaining

Dependency Pair:

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

Rules:

minus(x, 0) -> x
minus(s(x), s(y)) -> minus(x, y)
quot(0, s(y)) -> 0
quot(s(x), s(y)) -> s(quot(minus(x, y), s(y)))
le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
low(n, nil) -> nil
low(n, add(m, x)) -> if_low(le(m, n), n, add(m, x))
if_low(true, n, add(m, x)) -> add(m, low(n, x))
if_low(false, n, add(m, x)) -> low(n, x)
high(n, nil) -> nil
high(n, add(m, x)) -> if_high(le(m, n), n, add(m, x))
if_high(true, n, add(m, x)) -> high(n, x)
if_high(false, n, add(m, x)) -> add(m, high(n, x))
quicksort(nil) -> nil
quicksort(add(n, x)) -> app(quicksort(low(n, x)), add(n, quicksort(high(n, x))))

Strategy:

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₁, x₂) -> MINUS(x₁, x₂)
s(x₁) -> s(x₁)

     ↳DPs

       →DP Problem 1

         ↳AFS

           →DP Problem 8

             ↳Dependency Graph

       →DP Problem 2

         ↳AFS

       →DP Problem 3

         ↳AFS

       →DP Problem 4

         ↳AFS

       →DP Problem 5

         ↳Nar

       →DP Problem 6

         ↳Remaining

       →DP Problem 7

         ↳Remaining

Dependency Pair:

Rules:

minus(x, 0) -> x
minus(s(x), s(y)) -> minus(x, y)
quot(0, s(y)) -> 0
quot(s(x), s(y)) -> s(quot(minus(x, y), s(y)))
le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
low(n, nil) -> nil
low(n, add(m, x)) -> if_low(le(m, n), n, add(m, x))
if_low(true, n, add(m, x)) -> add(m, low(n, x))
if_low(false, n, add(m, x)) -> low(n, x)
high(n, nil) -> nil
high(n, add(m, x)) -> if_high(le(m, n), n, add(m, x))
if_high(true, n, add(m, x)) -> high(n, x)
if_high(false, n, add(m, x)) -> add(m, high(n, x))
quicksort(nil) -> nil
quicksort(add(n, x)) -> app(quicksort(low(n, x)), add(n, quicksort(high(n, x))))

Strategy:

innermost

Using the Dependency Graph resulted in no new DP problems.

     ↳DPs

       →DP Problem 1

         ↳AFS

       →DP Problem 2

         ↳Argument Filtering and Ordering

       →DP Problem 3

         ↳AFS

       →DP Problem 4

         ↳AFS

       →DP Problem 5

         ↳Nar

       →DP Problem 6

         ↳Remaining

       →DP Problem 7

         ↳Remaining

Dependency Pair:

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

Rules:

minus(x, 0) -> x
minus(s(x), s(y)) -> minus(x, y)
quot(0, s(y)) -> 0
quot(s(x), s(y)) -> s(quot(minus(x, y), s(y)))
le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
low(n, nil) -> nil
low(n, add(m, x)) -> if_low(le(m, n), n, add(m, x))
if_low(true, n, add(m, x)) -> add(m, low(n, x))
if_low(false, n, add(m, x)) -> low(n, x)
high(n, nil) -> nil
high(n, add(m, x)) -> if_high(le(m, n), n, add(m, x))
if_high(true, n, add(m, x)) -> high(n, x)
if_high(false, n, add(m, x)) -> add(m, high(n, x))
quicksort(nil) -> nil
quicksort(add(n, x)) -> app(quicksort(low(n, x)), add(n, quicksort(high(n, x))))

Strategy:

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₁, x₂) -> LE(x₁, x₂)
s(x₁) -> s(x₁)

     ↳DPs

       →DP Problem 1

         ↳AFS

       →DP Problem 2

         ↳AFS

           →DP Problem 9

             ↳Dependency Graph

       →DP Problem 3

         ↳AFS

       →DP Problem 4

         ↳AFS

       →DP Problem 5

         ↳Nar

       →DP Problem 6

         ↳Remaining

       →DP Problem 7

         ↳Remaining

Dependency Pair:

Rules:

minus(x, 0) -> x
minus(s(x), s(y)) -> minus(x, y)
quot(0, s(y)) -> 0
quot(s(x), s(y)) -> s(quot(minus(x, y), s(y)))
le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
low(n, nil) -> nil
low(n, add(m, x)) -> if_low(le(m, n), n, add(m, x))
if_low(true, n, add(m, x)) -> add(m, low(n, x))
if_low(false, n, add(m, x)) -> low(n, x)
high(n, nil) -> nil
high(n, add(m, x)) -> if_high(le(m, n), n, add(m, x))
if_high(true, n, add(m, x)) -> high(n, x)
if_high(false, n, add(m, x)) -> add(m, high(n, x))
quicksort(nil) -> nil
quicksort(add(n, x)) -> app(quicksort(low(n, x)), add(n, quicksort(high(n, x))))

Strategy:

innermost

Using the Dependency Graph resulted in no new DP problems.

     ↳DPs

       →DP Problem 1

         ↳AFS

       →DP Problem 2

         ↳AFS

       →DP Problem 3

         ↳Argument Filtering and Ordering

       →DP Problem 4

         ↳AFS

       →DP Problem 5

         ↳Nar

       →DP Problem 6

         ↳Remaining

       →DP Problem 7

         ↳Remaining

Dependency Pair:

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

Rules:

minus(x, 0) -> x
minus(s(x), s(y)) -> minus(x, y)
quot(0, s(y)) -> 0
quot(s(x), s(y)) -> s(quot(minus(x, y), s(y)))
le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
low(n, nil) -> nil
low(n, add(m, x)) -> if_low(le(m, n), n, add(m, x))
if_low(true, n, add(m, x)) -> add(m, low(n, x))
if_low(false, n, add(m, x)) -> low(n, x)
high(n, nil) -> nil
high(n, add(m, x)) -> if_high(le(m, n), n, add(m, x))
if_high(true, n, add(m, x)) -> high(n, x)
if_high(false, n, add(m, x)) -> add(m, high(n, x))
quicksort(nil) -> nil
quicksort(add(n, x)) -> app(quicksort(low(n, x)), add(n, quicksort(high(n, x))))

Strategy:

innermost

The following dependency pair can be strictly oriented:

APP(add(n, x), y) -> APP(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:

APP(x₁, x₂) -> APP(x₁, x₂)
add(x₁, x₂) -> add(x₁, x₂)

     ↳DPs

       →DP Problem 1

         ↳AFS

       →DP Problem 2

         ↳AFS

       →DP Problem 3

         ↳AFS

           →DP Problem 10

             ↳Dependency Graph

       →DP Problem 4

         ↳AFS

       →DP Problem 5

         ↳Nar

       →DP Problem 6

         ↳Remaining

       →DP Problem 7

         ↳Remaining

Dependency Pair:

Rules:

minus(x, 0) -> x
minus(s(x), s(y)) -> minus(x, y)
quot(0, s(y)) -> 0
quot(s(x), s(y)) -> s(quot(minus(x, y), s(y)))
le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
low(n, nil) -> nil
low(n, add(m, x)) -> if_low(le(m, n), n, add(m, x))
if_low(true, n, add(m, x)) -> add(m, low(n, x))
if_low(false, n, add(m, x)) -> low(n, x)
high(n, nil) -> nil
high(n, add(m, x)) -> if_high(le(m, n), n, add(m, x))
if_high(true, n, add(m, x)) -> high(n, x)
if_high(false, n, add(m, x)) -> add(m, high(n, x))
quicksort(nil) -> nil
quicksort(add(n, x)) -> app(quicksort(low(n, x)), add(n, quicksort(high(n, x))))

Strategy:

innermost

Using the Dependency Graph resulted in no new DP problems.

     ↳DPs

       →DP Problem 1

         ↳AFS

       →DP Problem 2

         ↳AFS

       →DP Problem 3

         ↳AFS

       →DP Problem 4

         ↳Argument Filtering and Ordering

       →DP Problem 5

         ↳Nar

       →DP Problem 6

         ↳Remaining

       →DP Problem 7

         ↳Remaining

Dependency Pair:

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

Rules:

minus(x, 0) -> x
minus(s(x), s(y)) -> minus(x, y)
quot(0, s(y)) -> 0
quot(s(x), s(y)) -> s(quot(minus(x, y), s(y)))
le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
low(n, nil) -> nil
low(n, add(m, x)) -> if_low(le(m, n), n, add(m, x))
if_low(true, n, add(m, x)) -> add(m, low(n, x))
if_low(false, n, add(m, x)) -> low(n, x)
high(n, nil) -> nil
high(n, add(m, x)) -> if_high(le(m, n), n, add(m, x))
if_high(true, n, add(m, x)) -> high(n, x)
if_high(false, n, add(m, x)) -> add(m, high(n, x))
quicksort(nil) -> nil
quicksort(add(n, x)) -> app(quicksort(low(n, x)), add(n, quicksort(high(n, x))))

Strategy:

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₁, x₂) -> QUOT(x₁, x₂)
s(x₁) -> s(x₁)
minus(x₁, x₂) -> x₁

     ↳DPs

       →DP Problem 1

         ↳AFS

       →DP Problem 2

         ↳AFS

       →DP Problem 3

         ↳AFS

       →DP Problem 4

         ↳AFS

           →DP Problem 11

             ↳Dependency Graph

       →DP Problem 5

         ↳Nar

       →DP Problem 6

         ↳Remaining

       →DP Problem 7

         ↳Remaining

Dependency Pair:

Rules:

minus(x, 0) -> x
minus(s(x), s(y)) -> minus(x, y)
quot(0, s(y)) -> 0
quot(s(x), s(y)) -> s(quot(minus(x, y), s(y)))
le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
low(n, nil) -> nil
low(n, add(m, x)) -> if_low(le(m, n), n, add(m, x))
if_low(true, n, add(m, x)) -> add(m, low(n, x))
if_low(false, n, add(m, x)) -> low(n, x)
high(n, nil) -> nil
high(n, add(m, x)) -> if_high(le(m, n), n, add(m, x))
if_high(true, n, add(m, x)) -> high(n, x)
if_high(false, n, add(m, x)) -> add(m, high(n, x))
quicksort(nil) -> nil
quicksort(add(n, x)) -> app(quicksort(low(n, x)), add(n, quicksort(high(n, x))))

Strategy:

innermost

Using the Dependency Graph resulted in no new DP problems.

     ↳DPs

       →DP Problem 1

         ↳AFS

       →DP Problem 2

         ↳AFS

       →DP Problem 3

         ↳AFS

       →DP Problem 4

         ↳AFS

       →DP Problem 5

         ↳Narrowing Transformation

       →DP Problem 6

         ↳Remaining

       →DP Problem 7

         ↳Remaining

Dependency Pairs:

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

Rules:

minus(x, 0) -> x
minus(s(x), s(y)) -> minus(x, y)
quot(0, s(y)) -> 0
quot(s(x), s(y)) -> s(quot(minus(x, y), s(y)))
le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
low(n, nil) -> nil
low(n, add(m, x)) -> if_low(le(m, n), n, add(m, x))
if_low(true, n, add(m, x)) -> add(m, low(n, x))
if_low(false, n, add(m, x)) -> low(n, x)
high(n, nil) -> nil
high(n, add(m, x)) -> if_high(le(m, n), n, add(m, x))
if_high(true, n, add(m, x)) -> high(n, x)
if_high(false, n, add(m, x)) -> add(m, high(n, x))
quicksort(nil) -> nil
quicksort(add(n, x)) -> app(quicksort(low(n, x)), add(n, quicksort(high(n, x))))

Strategy:

innermost

On this DP problem, a Narrowing SCC transformation can be performed.
As a result of transforming the rule

LOW(n, add(m, x)) -> IF_LOW(le(m, n), n, add(m, x))

three new Dependency Pairs are created:

LOW(n', add(0, x)) -> IF_LOW(true, n', add(0, x))
LOW(0, add(s(x''), x)) -> IF_LOW(false, 0, add(s(x''), x))
LOW(s(y'), add(s(x''), x)) -> IF_LOW(le(x'', y'), s(y'), add(s(x''), x))

The transformation is resulting in one new DP problem:

     ↳DPs

       →DP Problem 1

         ↳AFS

       →DP Problem 2

         ↳AFS

       →DP Problem 3

         ↳AFS

       →DP Problem 4

         ↳AFS

       →DP Problem 5

         ↳Nar

           →DP Problem 12

             ↳Instantiation Transformation

       →DP Problem 6

         ↳Remaining

       →DP Problem 7

         ↳Remaining

Dependency Pairs:

LOW(s(y'), add(s(x''), x)) -> IF_LOW(le(x'', y'), s(y'), add(s(x''), x))
LOW(0, add(s(x''), x)) -> IF_LOW(false, 0, add(s(x''), x))
IF_LOW(true, n, add(m, x)) -> LOW(n, x)
LOW(n', add(0, x)) -> IF_LOW(true, n', add(0, x))
IF_LOW(false, n, add(m, x)) -> LOW(n, x)

Rules:

minus(x, 0) -> x
minus(s(x), s(y)) -> minus(x, y)
quot(0, s(y)) -> 0
quot(s(x), s(y)) -> s(quot(minus(x, y), s(y)))
le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
low(n, nil) -> nil
low(n, add(m, x)) -> if_low(le(m, n), n, add(m, x))
if_low(true, n, add(m, x)) -> add(m, low(n, x))
if_low(false, n, add(m, x)) -> low(n, x)
high(n, nil) -> nil
high(n, add(m, x)) -> if_high(le(m, n), n, add(m, x))
if_high(true, n, add(m, x)) -> high(n, x)
if_high(false, n, add(m, x)) -> add(m, high(n, x))
quicksort(nil) -> nil
quicksort(add(n, x)) -> app(quicksort(low(n, x)), add(n, quicksort(high(n, x))))

Strategy:

innermost

On this DP problem, an Instantiation SCC transformation can be performed.
As a result of transforming the rule

IF_LOW(true, n, add(m, x)) -> LOW(n, x)

two new Dependency Pairs are created:

IF_LOW(true, n', add(0, x'')) -> LOW(n', x'')
IF_LOW(true, s(y'''), add(s(x'''''), x')) -> LOW(s(y'''), x')

The transformation is resulting in one new DP problem:

     ↳DPs

       →DP Problem 1

         ↳AFS

       →DP Problem 2

         ↳AFS

       →DP Problem 3

         ↳AFS

       →DP Problem 4

         ↳AFS

       →DP Problem 5

         ↳Nar

           →DP Problem 12

             ↳Inst

...

               →DP Problem 13

                 ↳Instantiation Transformation

       →DP Problem 6

         ↳Remaining

       →DP Problem 7

         ↳Remaining

Dependency Pairs:

IF_LOW(true, s(y'''), add(s(x'''''), x')) -> LOW(s(y'''), x')
LOW(0, add(s(x''), x)) -> IF_LOW(false, 0, add(s(x''), x))
IF_LOW(true, n', add(0, x'')) -> LOW(n', x'')
LOW(n', add(0, x)) -> IF_LOW(true, n', add(0, x))
IF_LOW(false, n, add(m, x)) -> LOW(n, x)
LOW(s(y'), add(s(x''), x)) -> IF_LOW(le(x'', y'), s(y'), add(s(x''), x))

Rules:

minus(x, 0) -> x
minus(s(x), s(y)) -> minus(x, y)
quot(0, s(y)) -> 0
quot(s(x), s(y)) -> s(quot(minus(x, y), s(y)))
le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
low(n, nil) -> nil
low(n, add(m, x)) -> if_low(le(m, n), n, add(m, x))
if_low(true, n, add(m, x)) -> add(m, low(n, x))
if_low(false, n, add(m, x)) -> low(n, x)
high(n, nil) -> nil
high(n, add(m, x)) -> if_high(le(m, n), n, add(m, x))
if_high(true, n, add(m, x)) -> high(n, x)
if_high(false, n, add(m, x)) -> add(m, high(n, x))
quicksort(nil) -> nil
quicksort(add(n, x)) -> app(quicksort(low(n, x)), add(n, quicksort(high(n, x))))

Strategy:

innermost

On this DP problem, an Instantiation SCC transformation can be performed.
As a result of transforming the rule

IF_LOW(false, n, add(m, x)) -> LOW(n, x)

two new Dependency Pairs are created:

IF_LOW(false, 0, add(s(x''''), x'')) -> LOW(0, x'')
IF_LOW(false, s(y'''), add(s(x'''''), x')) -> LOW(s(y'''), x')

The transformation is resulting in one new DP problem:

     ↳DPs

       →DP Problem 1

         ↳AFS

       →DP Problem 2

         ↳AFS

       →DP Problem 3

         ↳AFS

       →DP Problem 4

         ↳AFS

       →DP Problem 5

         ↳Nar

           →DP Problem 12

             ↳Inst

...

               →DP Problem 14

                 ↳Forward Instantiation Transformation

       →DP Problem 6

         ↳Remaining

       →DP Problem 7

         ↳Remaining

Dependency Pairs:

IF_LOW(false, s(y'''), add(s(x'''''), x')) -> LOW(s(y'''), x')
LOW(s(y'), add(s(x''), x)) -> IF_LOW(le(x'', y'), s(y'), add(s(x''), x))
IF_LOW(false, 0, add(s(x''''), x'')) -> LOW(0, x'')
LOW(0, add(s(x''), x)) -> IF_LOW(false, 0, add(s(x''), x))
IF_LOW(true, n', add(0, x'')) -> LOW(n', x'')
LOW(n', add(0, x)) -> IF_LOW(true, n', add(0, x))
IF_LOW(true, s(y'''), add(s(x'''''), x')) -> LOW(s(y'''), x')

Rules:

minus(x, 0) -> x
minus(s(x), s(y)) -> minus(x, y)
quot(0, s(y)) -> 0
quot(s(x), s(y)) -> s(quot(minus(x, y), s(y)))
le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
low(n, nil) -> nil
low(n, add(m, x)) -> if_low(le(m, n), n, add(m, x))
if_low(true, n, add(m, x)) -> add(m, low(n, x))
if_low(false, n, add(m, x)) -> low(n, x)
high(n, nil) -> nil
high(n, add(m, x)) -> if_high(le(m, n), n, add(m, x))
if_high(true, n, add(m, x)) -> high(n, x)
if_high(false, n, add(m, x)) -> add(m, high(n, x))
quicksort(nil) -> nil
quicksort(add(n, x)) -> app(quicksort(low(n, x)), add(n, quicksort(high(n, x))))

Strategy:

innermost

On this DP problem, a Forward Instantiation SCC transformation can be performed.
As a result of transforming the rule

IF_LOW(true, n', add(0, x'')) -> LOW(n', x'')

three new Dependency Pairs are created:

IF_LOW(true, n''', add(0, add(0, x'''))) -> LOW(n''', add(0, x'''))
IF_LOW(true, 0, add(0, add(s(x''''), x'0))) -> LOW(0, add(s(x''''), x'0))
IF_LOW(true, s(y'''), add(0, add(s(x''''), x'0))) -> LOW(s(y'''), add(s(x''''), x'0))

The transformation is resulting in one new DP problem:

     ↳DPs

       →DP Problem 1

         ↳AFS

       →DP Problem 2

         ↳AFS

       →DP Problem 3

         ↳AFS

       →DP Problem 4

         ↳AFS

       →DP Problem 5

         ↳Nar

           →DP Problem 12

             ↳Inst

...

               →DP Problem 15

                 ↳Forward Instantiation Transformation

       →DP Problem 6

         ↳Remaining

       →DP Problem 7

         ↳Remaining

Dependency Pairs:

IF_LOW(true, s(y'''), add(s(x'''''), x')) -> LOW(s(y'''), x')
LOW(s(y'), add(s(x''), x)) -> IF_LOW(le(x'', y'), s(y'), add(s(x''), x))
IF_LOW(true, s(y'''), add(0, add(s(x''''), x'0))) -> LOW(s(y'''), add(s(x''''), x'0))
IF_LOW(false, 0, add(s(x''''), x'')) -> LOW(0, x'')
LOW(0, add(s(x''), x)) -> IF_LOW(false, 0, add(s(x''), x))
IF_LOW(true, 0, add(0, add(s(x''''), x'0))) -> LOW(0, add(s(x''''), x'0))
IF_LOW(true, n''', add(0, add(0, x'''))) -> LOW(n''', add(0, x'''))
LOW(n', add(0, x)) -> IF_LOW(true, n', add(0, x))
IF_LOW(false, s(y'''), add(s(x'''''), x')) -> LOW(s(y'''), x')

Rules:

minus(x, 0) -> x
minus(s(x), s(y)) -> minus(x, y)
quot(0, s(y)) -> 0
quot(s(x), s(y)) -> s(quot(minus(x, y), s(y)))
le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
low(n, nil) -> nil
low(n, add(m, x)) -> if_low(le(m, n), n, add(m, x))
if_low(true, n, add(m, x)) -> add(m, low(n, x))
if_low(false, n, add(m, x)) -> low(n, x)
high(n, nil) -> nil
high(n, add(m, x)) -> if_high(le(m, n), n, add(m, x))
if_high(true, n, add(m, x)) -> high(n, x)
if_high(false, n, add(m, x)) -> add(m, high(n, x))
quicksort(nil) -> nil
quicksort(add(n, x)) -> app(quicksort(low(n, x)), add(n, quicksort(high(n, x))))

Strategy:

innermost

On this DP problem, a Forward Instantiation SCC transformation can be performed.
As a result of transforming the rule

LOW(n', add(0, x)) -> IF_LOW(true, n', add(0, x))

three new Dependency Pairs are created:

LOW(n'', add(0, add(0, x'''''))) -> IF_LOW(true, n'', add(0, add(0, x''''')))
LOW(0, add(0, add(s(x''''''), x'0''))) -> IF_LOW(true, 0, add(0, add(s(x''''''), x'0'')))
LOW(s(y'''''), add(0, add(s(x''''''), x'0''))) -> IF_LOW(true, s(y'''''), add(0, add(s(x''''''), x'0'')))

The transformation is resulting in one new DP problem:

     ↳DPs

       →DP Problem 1

         ↳AFS

       →DP Problem 2

         ↳AFS

       →DP Problem 3

         ↳AFS

       →DP Problem 4

         ↳AFS

       →DP Problem 5

         ↳Nar

           →DP Problem 12

             ↳Inst

...

               →DP Problem 16

                 ↳Forward Instantiation Transformation

       →DP Problem 6

         ↳Remaining

       →DP Problem 7

         ↳Remaining

Dependency Pairs:

IF_LOW(true, s(y'''), add(0, add(s(x''''), x'0))) -> LOW(s(y'''), add(s(x''''), x'0))
LOW(s(y'''''), add(0, add(s(x''''''), x'0''))) -> IF_LOW(true, s(y'''''), add(0, add(s(x''''''), x'0'')))
IF_LOW(false, 0, add(s(x''''), x'')) -> LOW(0, x'')
LOW(0, add(s(x''), x)) -> IF_LOW(false, 0, add(s(x''), x))
IF_LOW(true, 0, add(0, add(s(x''''), x'0))) -> LOW(0, add(s(x''''), x'0))
LOW(0, add(0, add(s(x''''''), x'0''))) -> IF_LOW(true, 0, add(0, add(s(x''''''), x'0'')))
IF_LOW(true, n''', add(0, add(0, x'''))) -> LOW(n''', add(0, x'''))
LOW(n'', add(0, add(0, x'''''))) -> IF_LOW(true, n'', add(0, add(0, x''''')))
IF_LOW(false, s(y'''), add(s(x'''''), x')) -> LOW(s(y'''), x')
LOW(s(y'), add(s(x''), x)) -> IF_LOW(le(x'', y'), s(y'), add(s(x''), x))
IF_LOW(true, s(y'''), add(s(x'''''), x')) -> LOW(s(y'''), x')

Rules:

minus(x, 0) -> x
minus(s(x), s(y)) -> minus(x, y)
quot(0, s(y)) -> 0
quot(s(x), s(y)) -> s(quot(minus(x, y), s(y)))
le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
low(n, nil) -> nil
low(n, add(m, x)) -> if_low(le(m, n), n, add(m, x))
if_low(true, n, add(m, x)) -> add(m, low(n, x))
if_low(false, n, add(m, x)) -> low(n, x)
high(n, nil) -> nil
high(n, add(m, x)) -> if_high(le(m, n), n, add(m, x))
if_high(true, n, add(m, x)) -> high(n, x)
if_high(false, n, add(m, x)) -> add(m, high(n, x))
quicksort(nil) -> nil
quicksort(add(n, x)) -> app(quicksort(low(n, x)), add(n, quicksort(high(n, x))))

Strategy:

innermost

On this DP problem, a Forward Instantiation SCC transformation can be performed.
As a result of transforming the rule

IF_LOW(true, s(y'''), add(s(x'''''), x')) -> LOW(s(y'''), x')

three new Dependency Pairs are created:

IF_LOW(true, s(y''''), add(s(x'''''), add(s(x''''), x0'))) -> LOW(s(y''''), add(s(x''''), x0'))
IF_LOW(true, s(y''''), add(s(x'''''), add(0, add(0, x''''''')))) -> LOW(s(y''''), add(0, add(0, x''''''')))
IF_LOW(true, s(y''''), add(s(x'''''), add(0, add(s(x''''''''), x'0'''')))) -> LOW(s(y''''), add(0, add(s(x''''''''), x'0'''')))

The transformation is resulting in one new DP problem:

     ↳DPs

       →DP Problem 1

         ↳AFS

       →DP Problem 2

         ↳AFS

       →DP Problem 3

         ↳AFS

       →DP Problem 4

         ↳AFS

       →DP Problem 5

         ↳Nar

           →DP Problem 12

             ↳Inst

...

               →DP Problem 17

                 ↳Forward Instantiation Transformation

       →DP Problem 6

         ↳Remaining

       →DP Problem 7

         ↳Remaining

Dependency Pairs:

Rules:

minus(x, 0) -> x
minus(s(x), s(y)) -> minus(x, y)
quot(0, s(y)) -> 0
quot(s(x), s(y)) -> s(quot(minus(x, y), s(y)))
le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
low(n, nil) -> nil
low(n, add(m, x)) -> if_low(le(m, n), n, add(m, x))
if_low(true, n, add(m, x)) -> add(m, low(n, x))
if_low(false, n, add(m, x)) -> low(n, x)
high(n, nil) -> nil
high(n, add(m, x)) -> if_high(le(m, n), n, add(m, x))
if_high(true, n, add(m, x)) -> high(n, x)
if_high(false, n, add(m, x)) -> add(m, high(n, x))
quicksort(nil) -> nil
quicksort(add(n, x)) -> app(quicksort(low(n, x)), add(n, quicksort(high(n, x))))

Strategy:

innermost

On this DP problem, a Forward Instantiation SCC transformation can be performed.
As a result of transforming the rule

IF_LOW(false, 0, add(s(x''''), x'')) -> LOW(0, x'')

three new Dependency Pairs are created:

IF_LOW(false, 0, add(s(x''''), add(s(x''''), x'0))) -> LOW(0, add(s(x''''), x'0))
IF_LOW(false, 0, add(s(x''''), add(0, add(0, x''''''')))) -> LOW(0, add(0, add(0, x''''''')))
IF_LOW(false, 0, add(s(x''''), add(0, add(s(x''''''''), x'0'''')))) -> LOW(0, add(0, add(s(x''''''''), x'0'''')))

The transformation is resulting in one new DP problem:

     ↳DPs

       →DP Problem 1

         ↳AFS

       →DP Problem 2

         ↳AFS

       →DP Problem 3

         ↳AFS

       →DP Problem 4

         ↳AFS

       →DP Problem 5

         ↳Nar

           →DP Problem 12

             ↳Inst

...

               →DP Problem 18

                 ↳Forward Instantiation Transformation

       →DP Problem 6

         ↳Remaining

       →DP Problem 7

         ↳Remaining

Dependency Pairs:

IF_LOW(true, s(y''''), add(s(x'''''), add(0, add(0, x''''''')))) -> LOW(s(y''''), add(0, add(0, x''''''')))
IF_LOW(true, s(y''''), add(s(x'''''), add(s(x''''), x0'))) -> LOW(s(y''''), add(s(x''''), x0'))
IF_LOW(false, 0, add(s(x''''), add(0, add(s(x''''''''), x'0'''')))) -> LOW(0, add(0, add(s(x''''''''), x'0'''')))
IF_LOW(false, 0, add(s(x''''), add(0, add(0, x''''''')))) -> LOW(0, add(0, add(0, x''''''')))
IF_LOW(false, 0, add(s(x''''), add(s(x''''), x'0))) -> LOW(0, add(s(x''''), x'0))
LOW(0, add(s(x''), x)) -> IF_LOW(false, 0, add(s(x''), x))
IF_LOW(true, 0, add(0, add(s(x''''), x'0))) -> LOW(0, add(s(x''''), x'0))
LOW(0, add(0, add(s(x''''''), x'0''))) -> IF_LOW(true, 0, add(0, add(s(x''''''), x'0'')))
IF_LOW(true, n''', add(0, add(0, x'''))) -> LOW(n''', add(0, x'''))
LOW(n'', add(0, add(0, x'''''))) -> IF_LOW(true, n'', add(0, add(0, x''''')))
IF_LOW(false, s(y'''), add(s(x'''''), x')) -> LOW(s(y'''), x')
LOW(s(y'), add(s(x''), x)) -> IF_LOW(le(x'', y'), s(y'), add(s(x''), x))
IF_LOW(true, s(y'''), add(0, add(s(x''''), x'0))) -> LOW(s(y'''), add(s(x''''), x'0))
LOW(s(y'''''), add(0, add(s(x''''''), x'0''))) -> IF_LOW(true, s(y'''''), add(0, add(s(x''''''), x'0'')))
IF_LOW(true, s(y''''), add(s(x'''''), add(0, add(s(x''''''''), x'0'''')))) -> LOW(s(y''''), add(0, add(s(x''''''''), x'0'''')))

Rules:

minus(x, 0) -> x
minus(s(x), s(y)) -> minus(x, y)
quot(0, s(y)) -> 0
quot(s(x), s(y)) -> s(quot(minus(x, y), s(y)))
le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
low(n, nil) -> nil
low(n, add(m, x)) -> if_low(le(m, n), n, add(m, x))
if_low(true, n, add(m, x)) -> add(m, low(n, x))
if_low(false, n, add(m, x)) -> low(n, x)
high(n, nil) -> nil
high(n, add(m, x)) -> if_high(le(m, n), n, add(m, x))
if_high(true, n, add(m, x)) -> high(n, x)
if_high(false, n, add(m, x)) -> add(m, high(n, x))
quicksort(nil) -> nil
quicksort(add(n, x)) -> app(quicksort(low(n, x)), add(n, quicksort(high(n, x))))

Strategy:

innermost

On this DP problem, a Forward Instantiation SCC transformation can be performed.
As a result of transforming the rule

LOW(0, add(s(x''), x)) -> IF_LOW(false, 0, add(s(x''), x))

three new Dependency Pairs are created:

LOW(0, add(s(x'''), add(s(x'''''''), x'0''))) -> IF_LOW(false, 0, add(s(x'''), add(s(x'''''''), x'0'')))
LOW(0, add(s(x'''), add(0, add(0, x''''''''')))) -> IF_LOW(false, 0, add(s(x'''), add(0, add(0, x'''''''''))))
LOW(0, add(s(x'''), add(0, add(s(x''''''''''), x'0'''''')))) -> IF_LOW(false, 0, add(s(x'''), add(0, add(s(x''''''''''), x'0''''''))))

The transformation is resulting in one new DP problem:

     ↳DPs

       →DP Problem 1

         ↳AFS

       →DP Problem 2

         ↳AFS

       →DP Problem 3

         ↳AFS

       →DP Problem 4

         ↳AFS

       →DP Problem 5

         ↳Nar

           →DP Problem 12

             ↳Inst

...

               →DP Problem 19

                 ↳Forward Instantiation Transformation

       →DP Problem 6

         ↳Remaining

       →DP Problem 7

         ↳Remaining

Dependency Pairs:

IF_LOW(true, s(y''''), add(s(x'''''), add(0, add(s(x''''''''), x'0'''')))) -> LOW(s(y''''), add(0, add(s(x''''''''), x'0'''')))
IF_LOW(true, s(y''''), add(s(x'''''), add(s(x''''), x0'))) -> LOW(s(y''''), add(s(x''''), x0'))
IF_LOW(false, s(y'''), add(s(x'''''), x')) -> LOW(s(y'''), x')
LOW(s(y'), add(s(x''), x)) -> IF_LOW(le(x'', y'), s(y'), add(s(x''), x))
IF_LOW(true, s(y'''), add(0, add(s(x''''), x'0))) -> LOW(s(y'''), add(s(x''''), x'0))
LOW(s(y'''''), add(0, add(s(x''''''), x'0''))) -> IF_LOW(true, s(y'''''), add(0, add(s(x''''''), x'0'')))
IF_LOW(false, 0, add(s(x''''), add(0, add(s(x''''''''), x'0'''')))) -> LOW(0, add(0, add(s(x''''''''), x'0'''')))
LOW(0, add(s(x'''), add(0, add(s(x''''''''''), x'0'''''')))) -> IF_LOW(false, 0, add(s(x'''), add(0, add(s(x''''''''''), x'0''''''))))
IF_LOW(false, 0, add(s(x''''), add(0, add(0, x''''''')))) -> LOW(0, add(0, add(0, x''''''')))
LOW(0, add(s(x'''), add(0, add(0, x''''''''')))) -> IF_LOW(false, 0, add(s(x'''), add(0, add(0, x'''''''''))))
IF_LOW(false, 0, add(s(x''''), add(s(x''''), x'0))) -> LOW(0, add(s(x''''), x'0))
LOW(0, add(s(x'''), add(s(x'''''''), x'0''))) -> IF_LOW(false, 0, add(s(x'''), add(s(x'''''''), x'0'')))
IF_LOW(true, 0, add(0, add(s(x''''), x'0))) -> LOW(0, add(s(x''''), x'0))
LOW(0, add(0, add(s(x''''''), x'0''))) -> IF_LOW(true, 0, add(0, add(s(x''''''), x'0'')))
IF_LOW(true, n''', add(0, add(0, x'''))) -> LOW(n''', add(0, x'''))
LOW(n'', add(0, add(0, x'''''))) -> IF_LOW(true, n'', add(0, add(0, x''''')))
IF_LOW(true, s(y''''), add(s(x'''''), add(0, add(0, x''''''')))) -> LOW(s(y''''), add(0, add(0, x''''''')))

Rules:

minus(x, 0) -> x
minus(s(x), s(y)) -> minus(x, y)
quot(0, s(y)) -> 0
quot(s(x), s(y)) -> s(quot(minus(x, y), s(y)))
le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
low(n, nil) -> nil
low(n, add(m, x)) -> if_low(le(m, n), n, add(m, x))
if_low(true, n, add(m, x)) -> add(m, low(n, x))
if_low(false, n, add(m, x)) -> low(n, x)
high(n, nil) -> nil
high(n, add(m, x)) -> if_high(le(m, n), n, add(m, x))
if_high(true, n, add(m, x)) -> high(n, x)
if_high(false, n, add(m, x)) -> add(m, high(n, x))
quicksort(nil) -> nil
quicksort(add(n, x)) -> app(quicksort(low(n, x)), add(n, quicksort(high(n, x))))

Strategy:

innermost

On this DP problem, a Forward Instantiation SCC transformation can be performed.
As a result of transforming the rule

IF_LOW(false, s(y'''), add(s(x'''''), x')) -> LOW(s(y'''), x')

three new Dependency Pairs are created:

IF_LOW(false, s(y''''), add(s(x'''''), add(s(x''''), x0'))) -> LOW(s(y''''), add(s(x''''), x0'))
IF_LOW(false, s(y''''), add(s(x'''''), add(0, add(0, x''''''')))) -> LOW(s(y''''), add(0, add(0, x''''''')))
IF_LOW(false, s(y''''), add(s(x'''''), add(0, add(s(x''''''''), x'0'''')))) -> LOW(s(y''''), add(0, add(s(x''''''''), x'0'''')))

The transformation is resulting in one new DP problem:

     ↳DPs

       →DP Problem 1

         ↳AFS

       →DP Problem 2

         ↳AFS

       →DP Problem 3

         ↳AFS

       →DP Problem 4

         ↳AFS

       →DP Problem 5

         ↳Nar

           →DP Problem 12

             ↳Inst

...

               →DP Problem 20

                 ↳Forward Instantiation Transformation

       →DP Problem 6

         ↳Remaining

       →DP Problem 7

         ↳Remaining

Dependency Pairs:

IF_LOW(false, s(y''''), add(s(x'''''), add(0, add(s(x''''''''), x'0'''')))) -> LOW(s(y''''), add(0, add(s(x''''''''), x'0'''')))
IF_LOW(false, s(y''''), add(s(x'''''), add(0, add(0, x''''''')))) -> LOW(s(y''''), add(0, add(0, x''''''')))
IF_LOW(false, s(y''''), add(s(x'''''), add(s(x''''), x0'))) -> LOW(s(y''''), add(s(x''''), x0'))
IF_LOW(false, 0, add(s(x''''), add(0, add(s(x''''''''), x'0'''')))) -> LOW(0, add(0, add(s(x''''''''), x'0'''')))
LOW(0, add(s(x'''), add(0, add(s(x''''''''''), x'0'''''')))) -> IF_LOW(false, 0, add(s(x'''), add(0, add(s(x''''''''''), x'0''''''))))
IF_LOW(false, 0, add(s(x''''), add(0, add(0, x''''''')))) -> LOW(0, add(0, add(0, x''''''')))
LOW(0, add(s(x'''), add(0, add(0, x''''''''')))) -> IF_LOW(false, 0, add(s(x'''), add(0, add(0, x'''''''''))))
IF_LOW(false, 0, add(s(x''''), add(s(x''''), x'0))) -> LOW(0, add(s(x''''), x'0))
LOW(0, add(s(x'''), add(s(x'''''''), x'0''))) -> IF_LOW(false, 0, add(s(x'''), add(s(x'''''''), x'0'')))
IF_LOW(true, 0, add(0, add(s(x''''), x'0))) -> LOW(0, add(s(x''''), x'0))
LOW(0, add(0, add(s(x''''''), x'0''))) -> IF_LOW(true, 0, add(0, add(s(x''''''), x'0'')))
IF_LOW(true, n''', add(0, add(0, x'''))) -> LOW(n''', add(0, x'''))
LOW(n'', add(0, add(0, x'''''))) -> IF_LOW(true, n'', add(0, add(0, x''''')))
IF_LOW(true, s(y''''), add(s(x'''''), add(0, add(0, x''''''')))) -> LOW(s(y''''), add(0, add(0, x''''''')))
IF_LOW(true, s(y''''), add(s(x'''''), add(s(x''''), x0'))) -> LOW(s(y''''), add(s(x''''), x0'))
LOW(s(y'), add(s(x''), x)) -> IF_LOW(le(x'', y'), s(y'), add(s(x''), x))
IF_LOW(true, s(y'''), add(0, add(s(x''''), x'0))) -> LOW(s(y'''), add(s(x''''), x'0))
LOW(s(y'''''), add(0, add(s(x''''''), x'0''))) -> IF_LOW(true, s(y'''''), add(0, add(s(x''''''), x'0'')))
IF_LOW(true, s(y''''), add(s(x'''''), add(0, add(s(x''''''''), x'0'''')))) -> LOW(s(y''''), add(0, add(s(x''''''''), x'0'''')))

Rules:

minus(x, 0) -> x
minus(s(x), s(y)) -> minus(x, y)
quot(0, s(y)) -> 0
quot(s(x), s(y)) -> s(quot(minus(x, y), s(y)))
le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
low(n, nil) -> nil
low(n, add(m, x)) -> if_low(le(m, n), n, add(m, x))
if_low(true, n, add(m, x)) -> add(m, low(n, x))
if_low(false, n, add(m, x)) -> low(n, x)
high(n, nil) -> nil
high(n, add(m, x)) -> if_high(le(m, n), n, add(m, x))
if_high(true, n, add(m, x)) -> high(n, x)
if_high(false, n, add(m, x)) -> add(m, high(n, x))
quicksort(nil) -> nil
quicksort(add(n, x)) -> app(quicksort(low(n, x)), add(n, quicksort(high(n, x))))

Strategy:

innermost

On this DP problem, a Forward Instantiation SCC transformation can be performed.
As a result of transforming the rule

LOW(s(y'), add(s(x''), x)) -> IF_LOW(le(x'', y'), s(y'), add(s(x''), x))

three new Dependency Pairs are created:

LOW(s(y''), add(s(x''''), add(s(x''''0'), x0'''))) -> IF_LOW(le(x'''', y''), s(y''), add(s(x''''), add(s(x''''0'), x0''')))
LOW(s(y''), add(s(x''''), add(0, add(0, x''''''''')))) -> IF_LOW(le(x'''', y''), s(y''), add(s(x''''), add(0, add(0, x'''''''''))))
LOW(s(y''), add(s(x''''), add(0, add(s(x''''''''''), x'0'''''')))) -> IF_LOW(le(x'''', y''), s(y''), add(s(x''''), add(0, add(s(x''''''''''), x'0''''''))))

The transformation is resulting in one new DP problem:

     ↳DPs

       →DP Problem 1

         ↳AFS

       →DP Problem 2

         ↳AFS

       →DP Problem 3

         ↳AFS

       →DP Problem 4

         ↳AFS

       →DP Problem 5

         ↳Nar

       →DP Problem 6

         ↳Remaining Obligation(s)

       →DP Problem 7

         ↳Remaining Obligation(s)

The following remains to be proven:

Dependency Pairs:
IF_LOW(false, s(y''''), add(s(x'''''), add(s(x''''), x0'))) -> LOW(s(y''''), add(s(x''''), x0'))
IF_LOW(true, s(y''''), add(s(x'''''), add(0, add(s(x''''''''), x'0'''')))) -> LOW(s(y''''), add(0, add(s(x''''''''), x'0'''')))
LOW(s(y''), add(s(x''''), add(0, add(s(x''''''''''), x'0'''''')))) -> IF_LOW(le(x'''', y''), s(y''), add(s(x''''), add(0, add(s(x''''''''''), x'0''''''))))
IF_LOW(false, s(y''''), add(s(x'''''), add(0, add(0, x''''''')))) -> LOW(s(y''''), add(0, add(0, x''''''')))
IF_LOW(false, 0, add(s(x''''), add(0, add(s(x''''''''), x'0'''')))) -> LOW(0, add(0, add(s(x''''''''), x'0'''')))
LOW(0, add(s(x'''), add(0, add(s(x''''''''''), x'0'''''')))) -> IF_LOW(false, 0, add(s(x'''), add(0, add(s(x''''''''''), x'0''''''))))
IF_LOW(false, 0, add(s(x''''), add(0, add(0, x''''''')))) -> LOW(0, add(0, add(0, x''''''')))
LOW(0, add(s(x'''), add(0, add(0, x''''''''')))) -> IF_LOW(false, 0, add(s(x'''), add(0, add(0, x'''''''''))))
IF_LOW(false, 0, add(s(x''''), add(s(x''''), x'0))) -> LOW(0, add(s(x''''), x'0))
LOW(0, add(s(x'''), add(s(x'''''''), x'0''))) -> IF_LOW(false, 0, add(s(x'''), add(s(x'''''''), x'0'')))
IF_LOW(true, 0, add(0, add(s(x''''), x'0))) -> LOW(0, add(s(x''''), x'0))
LOW(0, add(0, add(s(x''''''), x'0''))) -> IF_LOW(true, 0, add(0, add(s(x''''''), x'0'')))
IF_LOW(true, n''', add(0, add(0, x'''))) -> LOW(n''', add(0, x'''))
LOW(n'', add(0, add(0, x'''''))) -> IF_LOW(true, n'', add(0, add(0, x''''')))
IF_LOW(true, s(y''''), add(s(x'''''), add(0, add(0, x''''''')))) -> LOW(s(y''''), add(0, add(0, x''''''')))
LOW(s(y''), add(s(x''''), add(0, add(0, x''''''''')))) -> IF_LOW(le(x'''', y''), s(y''), add(s(x''''), add(0, add(0, x'''''''''))))
IF_LOW(true, s(y''''), add(s(x'''''), add(s(x''''), x0'))) -> LOW(s(y''''), add(s(x''''), x0'))
LOW(s(y''), add(s(x''''), add(s(x''''0'), x0'''))) -> IF_LOW(le(x'''', y''), s(y''), add(s(x''''), add(s(x''''0'), x0''')))
IF_LOW(true, s(y'''), add(0, add(s(x''''), x'0))) -> LOW(s(y'''), add(s(x''''), x'0))
LOW(s(y'''''), add(0, add(s(x''''''), x'0''))) -> IF_LOW(true, s(y'''''), add(0, add(s(x''''''), x'0'')))
IF_LOW(false, s(y''''), add(s(x'''''), add(0, add(s(x''''''''), x'0'''')))) -> LOW(s(y''''), add(0, add(s(x''''''''), x'0'''')))

Rules:

minus(x, 0) -> x
minus(s(x), s(y)) -> minus(x, y)
quot(0, s(y)) -> 0
quot(s(x), s(y)) -> s(quot(minus(x, y), s(y)))
le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
low(n, nil) -> nil
low(n, add(m, x)) -> if_low(le(m, n), n, add(m, x))
if_low(true, n, add(m, x)) -> add(m, low(n, x))
if_low(false, n, add(m, x)) -> low(n, x)
high(n, nil) -> nil
high(n, add(m, x)) -> if_high(le(m, n), n, add(m, x))
if_high(true, n, add(m, x)) -> high(n, x)
if_high(false, n, add(m, x)) -> add(m, high(n, x))
quicksort(nil) -> nil
quicksort(add(n, x)) -> app(quicksort(low(n, x)), add(n, quicksort(high(n, x))))

Strategy:
innermost
Dependency Pairs:
IF_HIGH(false, n, add(m, x)) -> HIGH(n, x)
IF_HIGH(true, n, add(m, x)) -> HIGH(n, x)
HIGH(n, add(m, x)) -> IF_HIGH(le(m, n), n, add(m, x))

Rules:

minus(x, 0) -> x
minus(s(x), s(y)) -> minus(x, y)
quot(0, s(y)) -> 0
quot(s(x), s(y)) -> s(quot(minus(x, y), s(y)))
le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
low(n, nil) -> nil
low(n, add(m, x)) -> if_low(le(m, n), n, add(m, x))
if_low(true, n, add(m, x)) -> add(m, low(n, x))
if_low(false, n, add(m, x)) -> low(n, x)
high(n, nil) -> nil
high(n, add(m, x)) -> if_high(le(m, n), n, add(m, x))
if_high(true, n, add(m, x)) -> high(n, x)
if_high(false, n, add(m, x)) -> add(m, high(n, x))
quicksort(nil) -> nil
quicksort(add(n, x)) -> app(quicksort(low(n, x)), add(n, quicksort(high(n, x))))

Strategy:
innermost
Dependency Pairs:
QUICKSORT(add(n, x)) -> QUICKSORT(high(n, x))
QUICKSORT(add(n, x)) -> QUICKSORT(low(n, x))

Rules:

minus(x, 0) -> x
minus(s(x), s(y)) -> minus(x, y)
quot(0, s(y)) -> 0
quot(s(x), s(y)) -> s(quot(minus(x, y), s(y)))
le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
low(n, nil) -> nil
low(n, add(m, x)) -> if_low(le(m, n), n, add(m, x))
if_low(true, n, add(m, x)) -> add(m, low(n, x))
if_low(false, n, add(m, x)) -> low(n, x)
high(n, nil) -> nil
high(n, add(m, x)) -> if_high(le(m, n), n, add(m, x))
if_high(true, n, add(m, x)) -> high(n, x)
if_high(false, n, add(m, x)) -> add(m, high(n, x))
quicksort(nil) -> nil
quicksort(add(n, x)) -> app(quicksort(low(n, x)), add(n, quicksort(high(n, x))))

Strategy:
innermost

     ↳DPs

       →DP Problem 1

         ↳AFS

       →DP Problem 2

         ↳AFS

       →DP Problem 3

         ↳AFS

       →DP Problem 4

         ↳AFS

       →DP Problem 5

         ↳Nar

       →DP Problem 6

         ↳Remaining Obligation(s)

       →DP Problem 7

         ↳Remaining Obligation(s)

The following remains to be proven:

Dependency Pairs:
IF_LOW(false, s(y''''), add(s(x'''''), add(s(x''''), x0'))) -> LOW(s(y''''), add(s(x''''), x0'))
IF_LOW(true, s(y''''), add(s(x'''''), add(0, add(s(x''''''''), x'0'''')))) -> LOW(s(y''''), add(0, add(s(x''''''''), x'0'''')))
LOW(s(y''), add(s(x''''), add(0, add(s(x''''''''''), x'0'''''')))) -> IF_LOW(le(x'''', y''), s(y''), add(s(x''''), add(0, add(s(x''''''''''), x'0''''''))))
IF_LOW(false, s(y''''), add(s(x'''''), add(0, add(0, x''''''')))) -> LOW(s(y''''), add(0, add(0, x''''''')))
IF_LOW(false, 0, add(s(x''''), add(0, add(s(x''''''''), x'0'''')))) -> LOW(0, add(0, add(s(x''''''''), x'0'''')))
LOW(0, add(s(x'''), add(0, add(s(x''''''''''), x'0'''''')))) -> IF_LOW(false, 0, add(s(x'''), add(0, add(s(x''''''''''), x'0''''''))))
IF_LOW(false, 0, add(s(x''''), add(0, add(0, x''''''')))) -> LOW(0, add(0, add(0, x''''''')))
LOW(0, add(s(x'''), add(0, add(0, x''''''''')))) -> IF_LOW(false, 0, add(s(x'''), add(0, add(0, x'''''''''))))
IF_LOW(false, 0, add(s(x''''), add(s(x''''), x'0))) -> LOW(0, add(s(x''''), x'0))
LOW(0, add(s(x'''), add(s(x'''''''), x'0''))) -> IF_LOW(false, 0, add(s(x'''), add(s(x'''''''), x'0'')))
IF_LOW(true, 0, add(0, add(s(x''''), x'0))) -> LOW(0, add(s(x''''), x'0))
LOW(0, add(0, add(s(x''''''), x'0''))) -> IF_LOW(true, 0, add(0, add(s(x''''''), x'0'')))
IF_LOW(true, n''', add(0, add(0, x'''))) -> LOW(n''', add(0, x'''))
LOW(n'', add(0, add(0, x'''''))) -> IF_LOW(true, n'', add(0, add(0, x''''')))
IF_LOW(true, s(y''''), add(s(x'''''), add(0, add(0, x''''''')))) -> LOW(s(y''''), add(0, add(0, x''''''')))
LOW(s(y''), add(s(x''''), add(0, add(0, x''''''''')))) -> IF_LOW(le(x'''', y''), s(y''), add(s(x''''), add(0, add(0, x'''''''''))))
IF_LOW(true, s(y''''), add(s(x'''''), add(s(x''''), x0'))) -> LOW(s(y''''), add(s(x''''), x0'))
LOW(s(y''), add(s(x''''), add(s(x''''0'), x0'''))) -> IF_LOW(le(x'''', y''), s(y''), add(s(x''''), add(s(x''''0'), x0''')))
IF_LOW(true, s(y'''), add(0, add(s(x''''), x'0))) -> LOW(s(y'''), add(s(x''''), x'0))
LOW(s(y'''''), add(0, add(s(x''''''), x'0''))) -> IF_LOW(true, s(y'''''), add(0, add(s(x''''''), x'0'')))
IF_LOW(false, s(y''''), add(s(x'''''), add(0, add(s(x''''''''), x'0'''')))) -> LOW(s(y''''), add(0, add(s(x''''''''), x'0'''')))

Rules:

minus(x, 0) -> x
minus(s(x), s(y)) -> minus(x, y)
quot(0, s(y)) -> 0
quot(s(x), s(y)) -> s(quot(minus(x, y), s(y)))
le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
low(n, nil) -> nil
low(n, add(m, x)) -> if_low(le(m, n), n, add(m, x))
if_low(true, n, add(m, x)) -> add(m, low(n, x))
if_low(false, n, add(m, x)) -> low(n, x)
high(n, nil) -> nil
high(n, add(m, x)) -> if_high(le(m, n), n, add(m, x))
if_high(true, n, add(m, x)) -> high(n, x)
if_high(false, n, add(m, x)) -> add(m, high(n, x))
quicksort(nil) -> nil
quicksort(add(n, x)) -> app(quicksort(low(n, x)), add(n, quicksort(high(n, x))))

Strategy:
innermost
Dependency Pairs:
IF_HIGH(false, n, add(m, x)) -> HIGH(n, x)
IF_HIGH(true, n, add(m, x)) -> HIGH(n, x)
HIGH(n, add(m, x)) -> IF_HIGH(le(m, n), n, add(m, x))

Rules:

minus(x, 0) -> x
minus(s(x), s(y)) -> minus(x, y)
quot(0, s(y)) -> 0
quot(s(x), s(y)) -> s(quot(minus(x, y), s(y)))
le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
low(n, nil) -> nil
low(n, add(m, x)) -> if_low(le(m, n), n, add(m, x))
if_low(true, n, add(m, x)) -> add(m, low(n, x))
if_low(false, n, add(m, x)) -> low(n, x)
high(n, nil) -> nil
high(n, add(m, x)) -> if_high(le(m, n), n, add(m, x))
if_high(true, n, add(m, x)) -> high(n, x)
if_high(false, n, add(m, x)) -> add(m, high(n, x))
quicksort(nil) -> nil
quicksort(add(n, x)) -> app(quicksort(low(n, x)), add(n, quicksort(high(n, x))))

Strategy:
innermost
Dependency Pairs:
QUICKSORT(add(n, x)) -> QUICKSORT(high(n, x))
QUICKSORT(add(n, x)) -> QUICKSORT(low(n, x))

Rules:

minus(x, 0) -> x
minus(s(x), s(y)) -> minus(x, y)
quot(0, s(y)) -> 0
quot(s(x), s(y)) -> s(quot(minus(x, y), s(y)))
le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
low(n, nil) -> nil
low(n, add(m, x)) -> if_low(le(m, n), n, add(m, x))
if_low(true, n, add(m, x)) -> add(m, low(n, x))
if_low(false, n, add(m, x)) -> low(n, x)
high(n, nil) -> nil
high(n, add(m, x)) -> if_high(le(m, n), n, add(m, x))
if_high(true, n, add(m, x)) -> high(n, x)
if_high(false, n, add(m, x)) -> add(m, high(n, x))
quicksort(nil) -> nil
quicksort(add(n, x)) -> app(quicksort(low(n, x)), add(n, quicksort(high(n, x))))

Strategy:
innermost

     ↳DPs

       →DP Problem 1

         ↳AFS

       →DP Problem 2

         ↳AFS

       →DP Problem 3

         ↳AFS

       →DP Problem 4

         ↳AFS

       →DP Problem 5

         ↳Nar

       →DP Problem 6

         ↳Remaining Obligation(s)

       →DP Problem 7

         ↳Remaining Obligation(s)

The following remains to be proven:

Dependency Pairs:
IF_LOW(false, s(y''''), add(s(x'''''), add(s(x''''), x0'))) -> LOW(s(y''''), add(s(x''''), x0'))
IF_LOW(true, s(y''''), add(s(x'''''), add(0, add(s(x''''''''), x'0'''')))) -> LOW(s(y''''), add(0, add(s(x''''''''), x'0'''')))
LOW(s(y''), add(s(x''''), add(0, add(s(x''''''''''), x'0'''''')))) -> IF_LOW(le(x'''', y''), s(y''), add(s(x''''), add(0, add(s(x''''''''''), x'0''''''))))
IF_LOW(false, s(y''''), add(s(x'''''), add(0, add(0, x''''''')))) -> LOW(s(y''''), add(0, add(0, x''''''')))
IF_LOW(false, 0, add(s(x''''), add(0, add(s(x''''''''), x'0'''')))) -> LOW(0, add(0, add(s(x''''''''), x'0'''')))
LOW(0, add(s(x'''), add(0, add(s(x''''''''''), x'0'''''')))) -> IF_LOW(false, 0, add(s(x'''), add(0, add(s(x''''''''''), x'0''''''))))
IF_LOW(false, 0, add(s(x''''), add(0, add(0, x''''''')))) -> LOW(0, add(0, add(0, x''''''')))
LOW(0, add(s(x'''), add(0, add(0, x''''''''')))) -> IF_LOW(false, 0, add(s(x'''), add(0, add(0, x'''''''''))))
IF_LOW(false, 0, add(s(x''''), add(s(x''''), x'0))) -> LOW(0, add(s(x''''), x'0))
LOW(0, add(s(x'''), add(s(x'''''''), x'0''))) -> IF_LOW(false, 0, add(s(x'''), add(s(x'''''''), x'0'')))
IF_LOW(true, 0, add(0, add(s(x''''), x'0))) -> LOW(0, add(s(x''''), x'0))
LOW(0, add(0, add(s(x''''''), x'0''))) -> IF_LOW(true, 0, add(0, add(s(x''''''), x'0'')))
IF_LOW(true, n''', add(0, add(0, x'''))) -> LOW(n''', add(0, x'''))
LOW(n'', add(0, add(0, x'''''))) -> IF_LOW(true, n'', add(0, add(0, x''''')))
IF_LOW(true, s(y''''), add(s(x'''''), add(0, add(0, x''''''')))) -> LOW(s(y''''), add(0, add(0, x''''''')))
LOW(s(y''), add(s(x''''), add(0, add(0, x''''''''')))) -> IF_LOW(le(x'''', y''), s(y''), add(s(x''''), add(0, add(0, x'''''''''))))
IF_LOW(true, s(y''''), add(s(x'''''), add(s(x''''), x0'))) -> LOW(s(y''''), add(s(x''''), x0'))
LOW(s(y''), add(s(x''''), add(s(x''''0'), x0'''))) -> IF_LOW(le(x'''', y''), s(y''), add(s(x''''), add(s(x''''0'), x0''')))
IF_LOW(true, s(y'''), add(0, add(s(x''''), x'0))) -> LOW(s(y'''), add(s(x''''), x'0))
LOW(s(y'''''), add(0, add(s(x''''''), x'0''))) -> IF_LOW(true, s(y'''''), add(0, add(s(x''''''), x'0'')))
IF_LOW(false, s(y''''), add(s(x'''''), add(0, add(s(x''''''''), x'0'''')))) -> LOW(s(y''''), add(0, add(s(x''''''''), x'0'''')))

Rules:

minus(x, 0) -> x
minus(s(x), s(y)) -> minus(x, y)
quot(0, s(y)) -> 0
quot(s(x), s(y)) -> s(quot(minus(x, y), s(y)))
le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
low(n, nil) -> nil
low(n, add(m, x)) -> if_low(le(m, n), n, add(m, x))
if_low(true, n, add(m, x)) -> add(m, low(n, x))
if_low(false, n, add(m, x)) -> low(n, x)
high(n, nil) -> nil
high(n, add(m, x)) -> if_high(le(m, n), n, add(m, x))
if_high(true, n, add(m, x)) -> high(n, x)
if_high(false, n, add(m, x)) -> add(m, high(n, x))
quicksort(nil) -> nil
quicksort(add(n, x)) -> app(quicksort(low(n, x)), add(n, quicksort(high(n, x))))

Strategy:
innermost
Dependency Pairs:
IF_HIGH(false, n, add(m, x)) -> HIGH(n, x)
IF_HIGH(true, n, add(m, x)) -> HIGH(n, x)
HIGH(n, add(m, x)) -> IF_HIGH(le(m, n), n, add(m, x))

Rules:

minus(x, 0) -> x
minus(s(x), s(y)) -> minus(x, y)
quot(0, s(y)) -> 0
quot(s(x), s(y)) -> s(quot(minus(x, y), s(y)))
le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
low(n, nil) -> nil
low(n, add(m, x)) -> if_low(le(m, n), n, add(m, x))
if_low(true, n, add(m, x)) -> add(m, low(n, x))
if_low(false, n, add(m, x)) -> low(n, x)
high(n, nil) -> nil
high(n, add(m, x)) -> if_high(le(m, n), n, add(m, x))
if_high(true, n, add(m, x)) -> high(n, x)
if_high(false, n, add(m, x)) -> add(m, high(n, x))
quicksort(nil) -> nil
quicksort(add(n, x)) -> app(quicksort(low(n, x)), add(n, quicksort(high(n, x))))

Strategy:
innermost
Dependency Pairs:
QUICKSORT(add(n, x)) -> QUICKSORT(high(n, x))
QUICKSORT(add(n, x)) -> QUICKSORT(low(n, x))

Rules:

minus(x, 0) -> x
minus(s(x), s(y)) -> minus(x, y)
quot(0, s(y)) -> 0
quot(s(x), s(y)) -> s(quot(minus(x, y), s(y)))
le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
low(n, nil) -> nil
low(n, add(m, x)) -> if_low(le(m, n), n, add(m, x))
if_low(true, n, add(m, x)) -> add(m, low(n, x))
if_low(false, n, add(m, x)) -> low(n, x)
high(n, nil) -> nil
high(n, add(m, x)) -> if_high(le(m, n), n, add(m, x))
if_high(true, n, add(m, x)) -> high(n, x)
if_high(false, n, add(m, x)) -> add(m, high(n, x))
quicksort(nil) -> nil
quicksort(add(n, x)) -> app(quicksort(low(n, x)), add(n, quicksort(high(n, x))))

Strategy:
innermost

Innermost Termination of R could not be shown.
Duration:
0:08 minutes