Termination Proof using AProVE

Term Rewriting System R:
[y, x]
le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
minus(x, 0) -> x
minus(0, x) -> 0
minus(s(x), s(y)) -> minus(x, y)
gcd(0, y) -> y
gcd(s(x), 0) -> s(x)
gcd(s(x), s(y)) -> if_gcd(le(y, x), s(x), s(y))
if_gcd(true, x, y) -> gcd(minus(x, y), y)
if_gcd(false, x, y) -> gcd(minus(y, x), x)

Innermost Termination of R to be shown.

     ↳Dependency Pair Analysis

R contains the following Dependency Pairs:

LE(s(x), s(y)) -> LE(x, y)
MINUS(s(x), s(y)) -> MINUS(x, y)
GCD(s(x), s(y)) -> IF_GCD(le(y, x), s(x), s(y))
GCD(s(x), s(y)) -> LE(y, x)
IF_GCD(true, x, y) -> GCD(minus(x, y), y)
IF_GCD(true, x, y) -> MINUS(x, y)
IF_GCD(false, x, y) -> GCD(minus(y, x), x)
IF_GCD(false, x, y) -> MINUS(y, x)

Furthermore, R contains three SCCs.

     ↳DPs

       →DP Problem 1

         ↳Polynomial Ordering

       →DP Problem 2

         ↳Polo

       →DP Problem 3

         ↳Nar

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)
minus(x, 0) -> x
minus(0, x) -> 0
minus(s(x), s(y)) -> minus(x, y)
gcd(0, y) -> y
gcd(s(x), 0) -> s(x)
gcd(s(x), s(y)) -> if_gcd(le(y, x), s(x), s(y))
if_gcd(true, x, y) -> gcd(minus(x, y), y)
if_gcd(false, x, y) -> gcd(minus(y, x), 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: Polynomial ordering with Polynomial interpretation:

POL(LE(x₁, x₂)) = x₁

POL(s(x₁)) = 1 + x₁

resulting in one new DP problem.

     ↳DPs

       →DP Problem 1

         ↳Polo

           →DP Problem 4

             ↳Dependency Graph

       →DP Problem 2

         ↳Polo

       →DP Problem 3

         ↳Nar

Dependency Pair:

Rules:

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

Strategy:

innermost

Using the Dependency Graph resulted in no new DP problems.

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Polynomial Ordering

       →DP Problem 3

         ↳Nar

Dependency Pair:

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

Rules:

le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
minus(x, 0) -> x
minus(0, x) -> 0
minus(s(x), s(y)) -> minus(x, y)
gcd(0, y) -> y
gcd(s(x), 0) -> s(x)
gcd(s(x), s(y)) -> if_gcd(le(y, x), s(x), s(y))
if_gcd(true, x, y) -> gcd(minus(x, y), y)
if_gcd(false, x, y) -> gcd(minus(y, x), 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: Polynomial ordering with Polynomial interpretation:

POL(MINUS(x₁, x₂)) = x₁

POL(s(x₁)) = 1 + x₁

resulting in one new DP problem.

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Polo

           →DP Problem 5

             ↳Dependency Graph

       →DP Problem 3

         ↳Nar

Dependency Pair:

Rules:

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

Strategy:

innermost

Using the Dependency Graph resulted in no new DP problems.

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Polo

       →DP Problem 3

         ↳Narrowing Transformation

Dependency Pairs:

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

Rules:

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

Strategy:

innermost

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

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

three new Dependency Pairs are created:

GCD(s(x'), s(0)) -> IF_GCD(true, s(x'), s(0))
GCD(s(0), s(s(x''))) -> IF_GCD(false, s(0), s(s(x'')))
GCD(s(s(y'')), s(s(x''))) -> IF_GCD(le(x'', y''), s(s(y'')), s(s(x'')))

The transformation is resulting in one new DP problem:

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Polo

       →DP Problem 3

         ↳Nar

           →DP Problem 6

             ↳Narrowing Transformation

Dependency Pairs:

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

Rules:

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

Strategy:

innermost

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

IF_GCD(true, x, y) -> GCD(minus(x, y), y)

three new Dependency Pairs are created:

IF_GCD(true, x'', 0) -> GCD(x'', 0)
IF_GCD(true, 0, y') -> GCD(0, y')
IF_GCD(true, s(x''), s(y'')) -> GCD(minus(x'', y''), s(y''))

The transformation is resulting in one new DP problem:

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Polo

       →DP Problem 3

         ↳Nar

           →DP Problem 6

             ↳Nar

...

               →DP Problem 7

                 ↳Narrowing Transformation

Dependency Pairs:

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

Rules:

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

Strategy:

innermost

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

IF_GCD(false, x, y) -> GCD(minus(y, x), x)

three new Dependency Pairs are created:

IF_GCD(false, 0, y') -> GCD(y', 0)
IF_GCD(false, x'', 0) -> GCD(0, x'')
IF_GCD(false, s(y''), s(x'')) -> GCD(minus(x'', y''), s(y''))

The transformation is resulting in one new DP problem:

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Polo

       →DP Problem 3

         ↳Nar

           →DP Problem 6

             ↳Nar

...

               →DP Problem 8

                 ↳Instantiation Transformation

Dependency Pairs:

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

Rules:

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

Strategy:

innermost

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

IF_GCD(true, s(x''), s(y'')) -> GCD(minus(x'', y''), s(y''))

two new Dependency Pairs are created:

IF_GCD(true, s(x''''), s(0)) -> GCD(minus(x'''', 0), s(0))
IF_GCD(true, s(s(y'''')), s(s(x''''))) -> GCD(minus(s(y''''), s(x'''')), s(s(x'''')))

The transformation is resulting in two new DP problems:

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Polo

       →DP Problem 3

         ↳Nar

           →DP Problem 6

             ↳Nar

...

               →DP Problem 9

                 ↳Polynomial Ordering

Dependency Pairs:

IF_GCD(true, s(x''''), s(0)) -> GCD(minus(x'''', 0), s(0))
GCD(s(x'), s(0)) -> IF_GCD(true, s(x'), s(0))

Rules:

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

Strategy:

innermost

The following dependency pair can be strictly oriented:

IF_GCD(true, s(x''''), s(0)) -> GCD(minus(x'''', 0), s(0))

Additionally, the following usable rules for innermost can be oriented:

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

Used ordering: Polynomial ordering with Polynomial interpretation:

POL(0) = 0

POL(GCD(x₁, x₂)) = x₁

POL(minus(x₁, x₂)) = x₁

POL(IF_GCD(x₁, x₂, x₃)) = x₂

POL(true) = 0

POL(s(x₁)) = 1 + x₁

resulting in one new DP problem.

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Polo

       →DP Problem 3

         ↳Nar

           →DP Problem 6

             ↳Nar

...

               →DP Problem 12

                 ↳Dependency Graph

Dependency Pair:

GCD(s(x'), s(0)) -> IF_GCD(true, s(x'), s(0))

Rules:

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

Strategy:

innermost

Using the Dependency Graph resulted in no new DP problems.

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Polo

       →DP Problem 3

         ↳Nar

           →DP Problem 6

             ↳Nar

...

               →DP Problem 10

                 ↳Instantiation Transformation

Dependency Pairs:

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

Rules:

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

Strategy:

innermost

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

IF_GCD(false, s(y''), s(x'')) -> GCD(minus(x'', y''), s(y''))

two new Dependency Pairs are created:

IF_GCD(false, s(0), s(s(x''''))) -> GCD(minus(s(x''''), 0), s(0))
IF_GCD(false, s(s(y'''')), s(s(x''''))) -> GCD(minus(s(x''''), s(y'''')), s(s(y'''')))

The transformation is resulting in one new DP problem:

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Polo

       →DP Problem 3

         ↳Nar

           →DP Problem 6

             ↳Nar

...

               →DP Problem 11

                 ↳Polynomial Ordering

Dependency Pairs:

IF_GCD(false, s(s(y'''')), s(s(x''''))) -> GCD(minus(s(x''''), s(y'''')), s(s(y'''')))
GCD(s(s(y'')), s(s(x''))) -> IF_GCD(le(x'', y''), s(s(y'')), s(s(x'')))
IF_GCD(true, s(s(y'''')), s(s(x''''))) -> GCD(minus(s(y''''), s(x'''')), s(s(x'''')))

Rules:

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

Strategy:

innermost

The following dependency pairs can be strictly oriented:

IF_GCD(false, s(s(y'''')), s(s(x''''))) -> GCD(minus(s(x''''), s(y'''')), s(s(y'''')))
IF_GCD(true, s(s(y'''')), s(s(x''''))) -> GCD(minus(s(y''''), s(x'''')), s(s(x'''')))

Additionally, the following usable rules for innermost can be oriented:

minus(x, 0) -> x
minus(0, x) -> 0
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)

Used ordering: Polynomial ordering with Polynomial interpretation:

POL(0) = 0

POL(GCD(x₁, x₂)) = x₁ + x₂

POL(false) = 0

POL(minus(x₁, x₂)) = x₁

POL(true) = 0

POL(IF_GCD(x₁, x₂, x₃)) = x₂ + x₃

POL(s(x₁)) = 1 + x₁

POL(le(x₁, x₂)) = 0

resulting in one new DP problem.

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Polo

       →DP Problem 3

         ↳Nar

           →DP Problem 6

             ↳Nar

...

               →DP Problem 13

                 ↳Dependency Graph

Dependency Pair:

GCD(s(s(y'')), s(s(x''))) -> IF_GCD(le(x'', y''), s(s(y'')), s(s(x'')))

Rules:

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

Strategy:

innermost

Using the Dependency Graph resulted in no new DP problems.

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

POL(0)	= 0
POL(GCD(x₁, x₂))	= x₁
POL(minus(x₁, x₂))	= x₁
POL(IF_GCD(x₁, x₂, x₃))	= x₂
POL(true)	= 0
POL(s(x₁))	= 1 + x₁

POL(0)	= 0
POL(GCD(x₁, x₂))	= x₁ + x₂
POL(false)	= 0
POL(minus(x₁, x₂))	= x₁
POL(true)	= 0
POL(IF_GCD(x₁, x₂, x₃))	= x₂ + x₃
POL(s(x₁))	= 1 + x₁
POL(le(x₁, x₂))	= 0