Termination Proof using AProVE

Term Rewriting System R:
[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(x, s(y)) -> if_quot(le(s(y), x), x, s(y))
if_quot(true, x, y) -> s(quot(minus(x, y), y))
if_quot(false, x, y) -> 0

Innermost Termination of R to be shown.

     ↳Dependency Pair Analysis

R contains the following Dependency Pairs:

MINUS(s(x), s(y)) -> MINUS(x, y)
LE(s(x), s(y)) -> LE(x, y)
QUOT(x, s(y)) -> IF_QUOT(le(s(y), x), x, s(y))
QUOT(x, s(y)) -> LE(s(y), x)
IF_QUOT(true, x, y) -> QUOT(minus(x, y), y)
IF_QUOT(true, x, y) -> MINUS(x, y)

Furthermore, R contains three SCCs.

     ↳DPs

       →DP Problem 1

         ↳Forward Instantiation Transformation

       →DP Problem 2

         ↳FwdInst

       →DP Problem 3

         ↳Nar

Dependency Pair:

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

Rules:

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(x, s(y)) -> if_quot(le(s(y), x), x, s(y))
if_quot(true, x, y) -> s(quot(minus(x, y), y))
if_quot(false, x, y) -> 0

Strategy:

innermost

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

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

one new Dependency Pair is created:

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

The transformation is resulting in one new DP problem:

     ↳DPs

       →DP Problem 1

         ↳FwdInst

           →DP Problem 4

             ↳Forward Instantiation Transformation

       →DP Problem 2

         ↳FwdInst

       →DP Problem 3

         ↳Nar

Dependency Pair:

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

Rules:

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(x, s(y)) -> if_quot(le(s(y), x), x, s(y))
if_quot(true, x, y) -> s(quot(minus(x, y), y))
if_quot(false, x, y) -> 0

Strategy:

innermost

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

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

one new Dependency Pair is created:

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

The transformation is resulting in one new DP problem:

     ↳DPs

       →DP Problem 1

         ↳FwdInst

           →DP Problem 4

             ↳FwdInst

...

               →DP Problem 5

                 ↳Argument Filtering and Ordering

       →DP Problem 2

         ↳FwdInst

       →DP Problem 3

         ↳Nar

Dependency Pair:

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

Rules:

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(x, s(y)) -> if_quot(le(s(y), x), x, s(y))
if_quot(true, x, y) -> s(quot(minus(x, y), y))
if_quot(false, x, y) -> 0

Strategy:

innermost

The following dependency pair can be strictly oriented:

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

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

MINUS(x₁, x₂) -> MINUS(x₁, x₂)
s(x₁) -> s(x₁)

     ↳DPs

       →DP Problem 1

         ↳FwdInst

           →DP Problem 4

             ↳FwdInst

...

               →DP Problem 6

                 ↳Dependency Graph

       →DP Problem 2

         ↳FwdInst

       →DP Problem 3

         ↳Nar

Dependency Pair:

Rules:

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(x, s(y)) -> if_quot(le(s(y), x), x, s(y))
if_quot(true, x, y) -> s(quot(minus(x, y), y))
if_quot(false, x, y) -> 0

Strategy:

innermost

Using the Dependency Graph resulted in no new DP problems.

     ↳DPs

       →DP Problem 1

         ↳FwdInst

       →DP Problem 2

         ↳Forward Instantiation Transformation

       →DP Problem 3

         ↳Nar

Dependency Pair:

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

Rules:

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(x, s(y)) -> if_quot(le(s(y), x), x, s(y))
if_quot(true, x, y) -> s(quot(minus(x, y), y))
if_quot(false, x, y) -> 0

Strategy:

innermost

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

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

one new Dependency Pair is created:

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

The transformation is resulting in one new DP problem:

     ↳DPs

       →DP Problem 1

         ↳FwdInst

       →DP Problem 2

         ↳FwdInst

           →DP Problem 7

             ↳Forward Instantiation Transformation

       →DP Problem 3

         ↳Nar

Dependency Pair:

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

Rules:

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(x, s(y)) -> if_quot(le(s(y), x), x, s(y))
if_quot(true, x, y) -> s(quot(minus(x, y), y))
if_quot(false, x, y) -> 0

Strategy:

innermost

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

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

one new Dependency Pair is created:

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

The transformation is resulting in one new DP problem:

     ↳DPs

       →DP Problem 1

         ↳FwdInst

       →DP Problem 2

         ↳FwdInst

           →DP Problem 7

             ↳FwdInst

...

               →DP Problem 8

                 ↳Argument Filtering and Ordering

       →DP Problem 3

         ↳Nar

Dependency Pair:

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

Rules:

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(x, s(y)) -> if_quot(le(s(y), x), x, s(y))
if_quot(true, x, y) -> s(quot(minus(x, y), y))
if_quot(false, x, y) -> 0

Strategy:

innermost

The following dependency pair can be strictly oriented:

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

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

LE(x₁, x₂) -> LE(x₁, x₂)
s(x₁) -> s(x₁)

     ↳DPs

       →DP Problem 1

         ↳FwdInst

       →DP Problem 2

         ↳FwdInst

           →DP Problem 7

             ↳FwdInst

...

               →DP Problem 9

                 ↳Dependency Graph

       →DP Problem 3

         ↳Nar

Dependency Pair:

Rules:

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(x, s(y)) -> if_quot(le(s(y), x), x, s(y))
if_quot(true, x, y) -> s(quot(minus(x, y), y))
if_quot(false, x, y) -> 0

Strategy:

innermost

Using the Dependency Graph resulted in no new DP problems.

     ↳DPs

       →DP Problem 1

         ↳FwdInst

       →DP Problem 2

         ↳FwdInst

       →DP Problem 3

         ↳Narrowing Transformation

Dependency Pairs:

IF_QUOT(true, x, y) -> QUOT(minus(x, y), y)
QUOT(x, s(y)) -> IF_QUOT(le(s(y), x), x, s(y))

Rules:

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(x, s(y)) -> if_quot(le(s(y), x), x, s(y))
if_quot(true, x, y) -> s(quot(minus(x, y), y))
if_quot(false, x, y) -> 0

Strategy:

innermost

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

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

two new Dependency Pairs are created:

QUOT(0, s(y')) -> IF_QUOT(false, 0, s(y'))
QUOT(s(y''), s(y0)) -> IF_QUOT(le(y0, y''), s(y''), s(y0))

The transformation is resulting in one new DP problem:

     ↳DPs

       →DP Problem 1

         ↳FwdInst

       →DP Problem 2

         ↳FwdInst

       →DP Problem 3

         ↳Nar

           →DP Problem 10

             ↳Narrowing Transformation

Dependency Pairs:

QUOT(s(y''), s(y0)) -> IF_QUOT(le(y0, y''), s(y''), s(y0))
IF_QUOT(true, x, y) -> QUOT(minus(x, y), y)

Rules:

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(x, s(y)) -> if_quot(le(s(y), x), x, s(y))
if_quot(true, x, y) -> s(quot(minus(x, y), y))
if_quot(false, x, y) -> 0

Strategy:

innermost

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

IF_QUOT(true, x, y) -> QUOT(minus(x, y), y)

two new Dependency Pairs are created:

IF_QUOT(true, x'', 0) -> QUOT(x'', 0)
IF_QUOT(true, s(x''), s(y'')) -> QUOT(minus(x'', y''), s(y''))

The transformation is resulting in one new DP problem:

     ↳DPs

       →DP Problem 1

         ↳FwdInst

       →DP Problem 2

         ↳FwdInst

       →DP Problem 3

         ↳Nar

           →DP Problem 10

             ↳Nar

...

               →DP Problem 11

                 ↳Narrowing Transformation

Dependency Pairs:

IF_QUOT(true, s(x''), s(y'')) -> QUOT(minus(x'', y''), s(y''))
QUOT(s(y''), s(y0)) -> IF_QUOT(le(y0, y''), s(y''), s(y0))

Rules:

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(x, s(y)) -> if_quot(le(s(y), x), x, s(y))
if_quot(true, x, y) -> s(quot(minus(x, y), y))
if_quot(false, x, y) -> 0

Strategy:

innermost

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

QUOT(s(y''), s(y0)) -> IF_QUOT(le(y0, y''), s(y''), s(y0))

three new Dependency Pairs are created:

QUOT(s(y'''), s(0)) -> IF_QUOT(true, s(y'''), s(0))
QUOT(s(0), s(s(x'))) -> IF_QUOT(false, s(0), s(s(x')))
QUOT(s(s(y')), s(s(x'))) -> IF_QUOT(le(x', y'), s(s(y')), s(s(x')))

The transformation is resulting in one new DP problem:

     ↳DPs

       →DP Problem 1

         ↳FwdInst

       →DP Problem 2

         ↳FwdInst

       →DP Problem 3

         ↳Nar

           →DP Problem 10

             ↳Nar

...

               →DP Problem 12

                 ↳Narrowing Transformation

Dependency Pairs:

QUOT(s(s(y')), s(s(x'))) -> IF_QUOT(le(x', y'), s(s(y')), s(s(x')))
QUOT(s(y'''), s(0)) -> IF_QUOT(true, s(y'''), s(0))
IF_QUOT(true, s(x''), s(y'')) -> QUOT(minus(x'', y''), s(y''))

Rules:

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(x, s(y)) -> if_quot(le(s(y), x), x, s(y))
if_quot(true, x, y) -> s(quot(minus(x, y), y))
if_quot(false, x, y) -> 0

Strategy:

innermost

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

IF_QUOT(true, s(x''), s(y'')) -> QUOT(minus(x'', y''), s(y''))

two new Dependency Pairs are created:

IF_QUOT(true, s(x'''), s(0)) -> QUOT(x''', s(0))
IF_QUOT(true, s(s(x')), s(s(y'))) -> QUOT(minus(x', y'), s(s(y')))

The transformation is resulting in two new DP problems:

     ↳DPs

       →DP Problem 1

         ↳FwdInst

       →DP Problem 2

         ↳FwdInst

       →DP Problem 3

         ↳Nar

           →DP Problem 10

             ↳Nar

...

               →DP Problem 13

                 ↳Argument Filtering and Ordering

Dependency Pairs:

IF_QUOT(true, s(s(x')), s(s(y'))) -> QUOT(minus(x', y'), s(s(y')))
QUOT(s(s(y')), s(s(x'))) -> IF_QUOT(le(x', y'), s(s(y')), s(s(x')))

Rules:

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(x, s(y)) -> if_quot(le(s(y), x), x, s(y))
if_quot(true, x, y) -> s(quot(minus(x, y), y))
if_quot(false, x, y) -> 0

Strategy:

innermost

The following dependency pair can be strictly oriented:

IF_QUOT(true, s(s(x')), s(s(y'))) -> QUOT(minus(x', y'), s(s(y')))

The following usable rules for innermost can be oriented:

le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
minus(x, 0) -> x
minus(s(x), s(y)) -> minus(x, y)

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

{0, false} > true
minus > true
{QUOT, IF_QUOT} > true
s > true
le > true

resulting in one new DP problem.
Used Argument Filtering System:

QUOT(x₁, x₂) -> QUOT(x₁, x₂)
IF_QUOT(x₁, x₂, x₃) -> IF_QUOT(x₂, x₃)
s(x₁) -> s(x₁)
minus(x₁, x₂) -> x₁
le(x₁, x₂) -> le(x₁, x₂)

     ↳DPs

       →DP Problem 1

         ↳FwdInst

       →DP Problem 2

         ↳FwdInst

       →DP Problem 3

         ↳Nar

           →DP Problem 10

             ↳Nar

...

               →DP Problem 15

                 ↳Dependency Graph

Dependency Pair:

QUOT(s(s(y')), s(s(x'))) -> IF_QUOT(le(x', y'), s(s(y')), s(s(x')))

Rules:

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(x, s(y)) -> if_quot(le(s(y), x), x, s(y))
if_quot(true, x, y) -> s(quot(minus(x, y), y))
if_quot(false, x, y) -> 0

Strategy:

innermost

Using the Dependency Graph resulted in no new DP problems.

     ↳DPs

       →DP Problem 1

         ↳FwdInst

       →DP Problem 2

         ↳FwdInst

       →DP Problem 3

         ↳Nar

           →DP Problem 10

             ↳Nar

...

               →DP Problem 14

                 ↳Argument Filtering and Ordering

Dependency Pairs:

IF_QUOT(true, s(x'''), s(0)) -> QUOT(x''', s(0))
QUOT(s(y'''), s(0)) -> IF_QUOT(true, s(y'''), s(0))

Rules:

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(x, s(y)) -> if_quot(le(s(y), x), x, s(y))
if_quot(true, x, y) -> s(quot(minus(x, y), y))
if_quot(false, x, y) -> 0

Strategy:

innermost

The following dependency pairs can be strictly oriented:

IF_QUOT(true, s(x'''), s(0)) -> QUOT(x''', s(0))
QUOT(s(y'''), s(0)) -> IF_QUOT(true, s(y'''), s(0))

There are no usable rules for innermost that need to be oriented.
Used ordering: Lexicographic Path Order with Non-Strict Precedence with Quasi Precedence:

{QUOT, IF_QUOT} > 0
{QUOT, IF_QUOT} > s

resulting in one new DP problem.
Used Argument Filtering System:

QUOT(x₁, x₂) -> QUOT(x₁, x₂)
IF_QUOT(x₁, x₂, x₃) -> IF_QUOT(x₂)
s(x₁) -> s(x₁)

     ↳DPs

       →DP Problem 1

         ↳FwdInst

       →DP Problem 2

         ↳FwdInst

       →DP Problem 3

         ↳Nar

           →DP Problem 10

             ↳Nar

...

               →DP Problem 16

                 ↳Dependency Graph

Dependency Pair:

Rules:

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(x, s(y)) -> if_quot(le(s(y), x), x, s(y))
if_quot(true, x, y) -> s(quot(minus(x, y), y))
if_quot(false, x, y) -> 0

Strategy:

innermost

Using the Dependency Graph resulted in no new DP problems.

Innermost Termination of R successfully shown.
Duration:
0:20 minutes