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(0, y) -> 0
minus(s(x), y) -> if_minus(le(s(x), y), s(x), y)
if_minus(true, s(x), y) -> 0
if_minus(false, s(x), y) -> s(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, s(x), s(y)) -> gcd(minus(x, y), s(y))
if_gcd(false, s(x), s(y)) -> gcd(minus(y, x), s(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), y) -> IF_MINUS(le(s(x), y), s(x), y)
MINUS(s(x), y) -> LE(s(x), y)
IF_MINUS(false, s(x), 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, s(x), s(y)) -> GCD(minus(x, y), s(y))
IF_GCD(true, s(x), s(y)) -> MINUS(x, y)
IF_GCD(false, s(x), s(y)) -> GCD(minus(y, x), s(x))
IF_GCD(false, s(x), s(y)) -> MINUS(y, x)

Furthermore, R contains three SCCs.

     ↳DPs

       →DP Problem 1

         ↳Forward Instantiation Transformation

       →DP Problem 2

         ↳Nar

       →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(0, y) -> 0
minus(s(x), y) -> if_minus(le(s(x), y), s(x), y)
if_minus(true, s(x), y) -> 0
if_minus(false, s(x), y) -> s(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, s(x), s(y)) -> gcd(minus(x, y), s(y))
if_gcd(false, s(x), s(y)) -> gcd(minus(y, x), s(x))

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 4

             ↳Forward Instantiation Transformation

       →DP Problem 2

         ↳Nar

       →DP Problem 3

         ↳Nar

Dependency Pair:

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

Rules:

le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
minus(0, y) -> 0
minus(s(x), y) -> if_minus(le(s(x), y), s(x), y)
if_minus(true, s(x), y) -> 0
if_minus(false, s(x), y) -> s(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, s(x), s(y)) -> gcd(minus(x, y), s(y))
if_gcd(false, s(x), s(y)) -> gcd(minus(y, x), s(x))

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 4

             ↳FwdInst

...

               →DP Problem 5

                 ↳Polynomial Ordering

       →DP Problem 2

         ↳Nar

       →DP Problem 3

         ↳Nar

Dependency Pair:

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

Rules:

le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
minus(0, y) -> 0
minus(s(x), y) -> if_minus(le(s(x), y), s(x), y)
if_minus(true, s(x), y) -> 0
if_minus(false, s(x), y) -> s(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, s(x), s(y)) -> gcd(minus(x, y), s(y))
if_gcd(false, s(x), s(y)) -> gcd(minus(y, x), s(x))

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: Polynomial ordering with Polynomial interpretation:

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

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

resulting in one new DP problem.

     ↳DPs

       →DP Problem 1

         ↳FwdInst

           →DP Problem 4

             ↳FwdInst

...

               →DP Problem 6

                 ↳Dependency Graph

       →DP Problem 2

         ↳Nar

       →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(0, y) -> 0
minus(s(x), y) -> if_minus(le(s(x), y), s(x), y)
if_minus(true, s(x), y) -> 0
if_minus(false, s(x), y) -> s(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, s(x), s(y)) -> gcd(minus(x, y), s(y))
if_gcd(false, s(x), s(y)) -> gcd(minus(y, x), s(x))

Strategy:

innermost

Using the Dependency Graph resulted in no new DP problems.

     ↳DPs

       →DP Problem 1

         ↳FwdInst

       →DP Problem 2

         ↳Narrowing Transformation

       →DP Problem 3

         ↳Nar

Dependency Pairs:

IF_MINUS(false, s(x), y) -> MINUS(x, y)
MINUS(s(x), y) -> IF_MINUS(le(s(x), y), s(x), y)

Rules:

le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
minus(0, y) -> 0
minus(s(x), y) -> if_minus(le(s(x), y), s(x), y)
if_minus(true, s(x), y) -> 0
if_minus(false, s(x), y) -> s(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, s(x), s(y)) -> gcd(minus(x, y), s(y))
if_gcd(false, s(x), s(y)) -> gcd(minus(y, x), s(x))

Strategy:

innermost

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

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

two new Dependency Pairs are created:

MINUS(s(x''), 0) -> IF_MINUS(false, s(x''), 0)
MINUS(s(x''), s(y'')) -> IF_MINUS(le(x'', y''), s(x''), s(y''))

The transformation is resulting in one new DP problem:

     ↳DPs

       →DP Problem 1

         ↳FwdInst

       →DP Problem 2

         ↳Nar

           →DP Problem 7

             ↳Narrowing Transformation

       →DP Problem 3

         ↳Nar

Dependency Pairs:

MINUS(s(x''), s(y'')) -> IF_MINUS(le(x'', y''), s(x''), s(y''))
MINUS(s(x''), 0) -> IF_MINUS(false, s(x''), 0)
IF_MINUS(false, s(x), y) -> MINUS(x, y)

Rules:

le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
minus(0, y) -> 0
minus(s(x), y) -> if_minus(le(s(x), y), s(x), y)
if_minus(true, s(x), y) -> 0
if_minus(false, s(x), y) -> s(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, s(x), s(y)) -> gcd(minus(x, y), s(y))
if_gcd(false, s(x), s(y)) -> gcd(minus(y, x), s(x))

Strategy:

innermost

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

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

three new Dependency Pairs are created:

MINUS(s(0), s(y''')) -> IF_MINUS(true, s(0), s(y'''))
MINUS(s(s(x')), s(0)) -> IF_MINUS(false, s(s(x')), s(0))
MINUS(s(s(x')), s(s(y'))) -> IF_MINUS(le(x', y'), s(s(x')), s(s(y')))

The transformation is resulting in one new DP problem:

     ↳DPs

       →DP Problem 1

         ↳FwdInst

       →DP Problem 2

         ↳Nar

           →DP Problem 7

             ↳Nar

...

               →DP Problem 8

                 ↳Instantiation Transformation

       →DP Problem 3

         ↳Nar

Dependency Pairs:

MINUS(s(s(x')), s(s(y'))) -> IF_MINUS(le(x', y'), s(s(x')), s(s(y')))
MINUS(s(s(x')), s(0)) -> IF_MINUS(false, s(s(x')), s(0))
IF_MINUS(false, s(x), y) -> MINUS(x, y)
MINUS(s(x''), 0) -> IF_MINUS(false, s(x''), 0)

Rules:

le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
minus(0, y) -> 0
minus(s(x), y) -> if_minus(le(s(x), y), s(x), y)
if_minus(true, s(x), y) -> 0
if_minus(false, s(x), y) -> s(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, s(x), s(y)) -> gcd(minus(x, y), s(y))
if_gcd(false, s(x), s(y)) -> gcd(minus(y, x), s(x))

Strategy:

innermost

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

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

three new Dependency Pairs are created:

IF_MINUS(false, s(x'), 0) -> MINUS(x', 0)
IF_MINUS(false, s(s(x''')), s(0)) -> MINUS(s(x'''), s(0))
IF_MINUS(false, s(s(x'0')), s(s(y'''))) -> MINUS(s(x'0'), s(s(y''')))

The transformation is resulting in three new DP problems:

     ↳DPs

       →DP Problem 1

         ↳FwdInst

       →DP Problem 2

         ↳Nar

           →DP Problem 7

             ↳Nar

...

               →DP Problem 9

                 ↳Forward Instantiation Transformation

       →DP Problem 3

         ↳Nar

Dependency Pairs:

IF_MINUS(false, s(s(x'0')), s(s(y'''))) -> MINUS(s(x'0'), s(s(y''')))
MINUS(s(s(x')), s(s(y'))) -> IF_MINUS(le(x', y'), s(s(x')), s(s(y')))

Rules:

le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
minus(0, y) -> 0
minus(s(x), y) -> if_minus(le(s(x), y), s(x), y)
if_minus(true, s(x), y) -> 0
if_minus(false, s(x), y) -> s(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, s(x), s(y)) -> gcd(minus(x, y), s(y))
if_gcd(false, s(x), s(y)) -> gcd(minus(y, x), s(x))

Strategy:

innermost

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

IF_MINUS(false, s(s(x'0')), s(s(y'''))) -> MINUS(s(x'0'), s(s(y''')))

one new Dependency Pair is created:

IF_MINUS(false, s(s(s(x'''))), 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 2

         ↳Nar

           →DP Problem 7

             ↳Nar

...

               →DP Problem 12

                 ↳Polynomial Ordering

       →DP Problem 3

         ↳Nar

Dependency Pairs:

IF_MINUS(false, s(s(s(x'''))), s(s(y''''))) -> MINUS(s(s(x''')), s(s(y'''')))
MINUS(s(s(x')), s(s(y'))) -> IF_MINUS(le(x', y'), s(s(x')), s(s(y')))

Rules:

le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
minus(0, y) -> 0
minus(s(x), y) -> if_minus(le(s(x), y), s(x), y)
if_minus(true, s(x), y) -> 0
if_minus(false, s(x), y) -> s(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, s(x), s(y)) -> gcd(minus(x, y), s(y))
if_gcd(false, s(x), s(y)) -> gcd(minus(y, x), s(x))

Strategy:

innermost

The following dependency pair can be strictly oriented:

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

Additionally, 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)

Used ordering: Polynomial ordering with Polynomial interpretation:

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

POL(0) = 0

POL(false) = 0

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

POL(true) = 0

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

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

resulting in one new DP problem.

     ↳DPs

       →DP Problem 1

         ↳FwdInst

       →DP Problem 2

         ↳Nar

           →DP Problem 7

             ↳Nar

...

               →DP Problem 16

                 ↳Dependency Graph

       →DP Problem 3

         ↳Nar

Dependency Pair:

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

Rules:

le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
minus(0, y) -> 0
minus(s(x), y) -> if_minus(le(s(x), y), s(x), y)
if_minus(true, s(x), y) -> 0
if_minus(false, s(x), y) -> s(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, s(x), s(y)) -> gcd(minus(x, y), s(y))
if_gcd(false, s(x), s(y)) -> gcd(minus(y, x), s(x))

Strategy:

innermost

Using the Dependency Graph resulted in no new DP problems.

     ↳DPs

       →DP Problem 1

         ↳FwdInst

       →DP Problem 2

         ↳Nar

           →DP Problem 7

             ↳Nar

...

               →DP Problem 10

                 ↳Forward Instantiation Transformation

       →DP Problem 3

         ↳Nar

Dependency Pairs:

IF_MINUS(false, s(s(x''')), s(0)) -> MINUS(s(x'''), s(0))
MINUS(s(s(x')), s(0)) -> IF_MINUS(false, s(s(x')), s(0))

Rules:

le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
minus(0, y) -> 0
minus(s(x), y) -> if_minus(le(s(x), y), s(x), y)
if_minus(true, s(x), y) -> 0
if_minus(false, s(x), y) -> s(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, s(x), s(y)) -> gcd(minus(x, y), s(y))
if_gcd(false, s(x), s(y)) -> gcd(minus(y, x), s(x))

Strategy:

innermost

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

IF_MINUS(false, s(s(x''')), s(0)) -> MINUS(s(x'''), s(0))

one new Dependency Pair is created:

IF_MINUS(false, s(s(s(x''''))), s(0)) -> MINUS(s(s(x'''')), s(0))

The transformation is resulting in one new DP problem:

     ↳DPs

       →DP Problem 1

         ↳FwdInst

       →DP Problem 2

         ↳Nar

           →DP Problem 7

             ↳Nar

...

               →DP Problem 13

                 ↳Polynomial Ordering

       →DP Problem 3

         ↳Nar

Dependency Pairs:

IF_MINUS(false, s(s(s(x''''))), s(0)) -> MINUS(s(s(x'''')), s(0))
MINUS(s(s(x')), s(0)) -> IF_MINUS(false, s(s(x')), s(0))

Rules:

le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
minus(0, y) -> 0
minus(s(x), y) -> if_minus(le(s(x), y), s(x), y)
if_minus(true, s(x), y) -> 0
if_minus(false, s(x), y) -> s(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, s(x), s(y)) -> gcd(minus(x, y), s(y))
if_gcd(false, s(x), s(y)) -> gcd(minus(y, x), s(x))

Strategy:

innermost

The following dependency pair can be strictly oriented:

IF_MINUS(false, s(s(s(x''''))), s(0)) -> MINUS(s(s(x'''')), s(0))

There are no usable rules for innermost that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:

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

POL(0) = 0

POL(false) = 0

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

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

resulting in one new DP problem.

     ↳DPs

       →DP Problem 1

         ↳FwdInst

       →DP Problem 2

         ↳Nar

           →DP Problem 7

             ↳Nar

...

               →DP Problem 17

                 ↳Dependency Graph

       →DP Problem 3

         ↳Nar

Dependency Pair:

MINUS(s(s(x')), s(0)) -> IF_MINUS(false, s(s(x')), s(0))

Rules:

le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
minus(0, y) -> 0
minus(s(x), y) -> if_minus(le(s(x), y), s(x), y)
if_minus(true, s(x), y) -> 0
if_minus(false, s(x), y) -> s(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, s(x), s(y)) -> gcd(minus(x, y), s(y))
if_gcd(false, s(x), s(y)) -> gcd(minus(y, x), s(x))

Strategy:

innermost

Using the Dependency Graph resulted in no new DP problems.

     ↳DPs

       →DP Problem 1

         ↳FwdInst

       →DP Problem 2

         ↳Nar

           →DP Problem 7

             ↳Nar

...

               →DP Problem 11

                 ↳Forward Instantiation Transformation

       →DP Problem 3

         ↳Nar

Dependency Pairs:

IF_MINUS(false, s(x'), 0) -> MINUS(x', 0)
MINUS(s(x''), 0) -> IF_MINUS(false, s(x''), 0)

Rules:

le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
minus(0, y) -> 0
minus(s(x), y) -> if_minus(le(s(x), y), s(x), y)
if_minus(true, s(x), y) -> 0
if_minus(false, s(x), y) -> s(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, s(x), s(y)) -> gcd(minus(x, y), s(y))
if_gcd(false, s(x), s(y)) -> gcd(minus(y, x), s(x))

Strategy:

innermost

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

IF_MINUS(false, s(x'), 0) -> MINUS(x', 0)

one new Dependency Pair is created:

IF_MINUS(false, s(s(x'''')), 0) -> MINUS(s(x''''), 0)

The transformation is resulting in one new DP problem:

     ↳DPs

       →DP Problem 1

         ↳FwdInst

       →DP Problem 2

         ↳Nar

           →DP Problem 7

             ↳Nar

...

               →DP Problem 14

                 ↳Forward Instantiation Transformation

       →DP Problem 3

         ↳Nar

Dependency Pairs:

IF_MINUS(false, s(s(x'''')), 0) -> MINUS(s(x''''), 0)
MINUS(s(x''), 0) -> IF_MINUS(false, s(x''), 0)

Rules:

le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
minus(0, y) -> 0
minus(s(x), y) -> if_minus(le(s(x), y), s(x), y)
if_minus(true, s(x), y) -> 0
if_minus(false, s(x), y) -> s(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, s(x), s(y)) -> gcd(minus(x, y), s(y))
if_gcd(false, s(x), s(y)) -> gcd(minus(y, x), s(x))

Strategy:

innermost

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

MINUS(s(x''), 0) -> IF_MINUS(false, s(x''), 0)

one new Dependency Pair is created:

MINUS(s(s(x'''''')), 0) -> IF_MINUS(false, s(s(x'''''')), 0)

The transformation is resulting in one new DP problem:

     ↳DPs

       →DP Problem 1

         ↳FwdInst

       →DP Problem 2

         ↳Nar

           →DP Problem 7

             ↳Nar

...

               →DP Problem 15

                 ↳Polynomial Ordering

       →DP Problem 3

         ↳Nar

Dependency Pairs:

MINUS(s(s(x'''''')), 0) -> IF_MINUS(false, s(s(x'''''')), 0)
IF_MINUS(false, s(s(x'''')), 0) -> MINUS(s(x''''), 0)

Rules:

le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
minus(0, y) -> 0
minus(s(x), y) -> if_minus(le(s(x), y), s(x), y)
if_minus(true, s(x), y) -> 0
if_minus(false, s(x), y) -> s(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, s(x), s(y)) -> gcd(minus(x, y), s(y))
if_gcd(false, s(x), s(y)) -> gcd(minus(y, x), s(x))

Strategy:

innermost

The following dependency pair can be strictly oriented:

IF_MINUS(false, s(s(x'''')), 0) -> MINUS(s(x''''), 0)

There are no usable rules for innermost that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:

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

POL(0) = 0

POL(false) = 0

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

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

resulting in one new DP problem.

     ↳DPs

       →DP Problem 1

         ↳FwdInst

       →DP Problem 2

         ↳Nar

           →DP Problem 7

             ↳Nar

...

               →DP Problem 18

                 ↳Dependency Graph

       →DP Problem 3

         ↳Nar

Dependency Pair:

MINUS(s(s(x'''''')), 0) -> IF_MINUS(false, s(s(x'''''')), 0)

Rules:

le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
minus(0, y) -> 0
minus(s(x), y) -> if_minus(le(s(x), y), s(x), y)
if_minus(true, s(x), y) -> 0
if_minus(false, s(x), y) -> s(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, s(x), s(y)) -> gcd(minus(x, y), s(y))
if_gcd(false, s(x), s(y)) -> gcd(minus(y, x), s(x))

Strategy:

innermost

Using the Dependency Graph resulted in no new DP problems.

     ↳DPs

       →DP Problem 1

         ↳FwdInst

       →DP Problem 2

         ↳Nar

       →DP Problem 3

         ↳Narrowing Transformation

Dependency Pairs:

IF_GCD(false, s(x), s(y)) -> GCD(minus(y, x), s(x))
IF_GCD(true, s(x), s(y)) -> GCD(minus(x, y), s(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(0, y) -> 0
minus(s(x), y) -> if_minus(le(s(x), y), s(x), y)
if_minus(true, s(x), y) -> 0
if_minus(false, s(x), y) -> s(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, s(x), s(y)) -> gcd(minus(x, y), s(y))
if_gcd(false, s(x), s(y)) -> gcd(minus(y, x), s(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

         ↳FwdInst

       →DP Problem 2

         ↳Nar

       →DP Problem 3

         ↳Nar

           →DP Problem 19

             ↳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, 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(x), s(y)) -> GCD(minus(y, x), s(x))

Rules:

le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
minus(0, y) -> 0
minus(s(x), y) -> if_minus(le(s(x), y), s(x), y)
if_minus(true, s(x), y) -> 0
if_minus(false, s(x), y) -> s(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, s(x), s(y)) -> gcd(minus(x, y), s(y))
if_gcd(false, s(x), s(y)) -> gcd(minus(y, x), s(x))

Strategy:

innermost

On this DP problem, a Narrowing 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(0), s(y'')) -> GCD(0, s(y''))
IF_GCD(true, s(s(x'')), s(y'')) -> GCD(if_minus(le(s(x''), y''), s(x''), y''), s(y''))

The transformation is resulting in one new DP problem:

     ↳DPs

       →DP Problem 1

         ↳FwdInst

       →DP Problem 2

         ↳Nar

       →DP Problem 3

         ↳Nar

           →DP Problem 19

             ↳Nar

...

               →DP Problem 20

                 ↳Narrowing Transformation

Dependency Pairs:

GCD(s(0), s(s(x''))) -> IF_GCD(false, s(0), s(s(x'')))
IF_GCD(true, s(s(x'')), s(y'')) -> GCD(if_minus(le(s(x''), y''), s(x''), y''), s(y''))
GCD(s(x'), s(0)) -> IF_GCD(true, s(x'), s(0))
IF_GCD(false, s(x), s(y)) -> GCD(minus(y, x), s(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(0, y) -> 0
minus(s(x), y) -> if_minus(le(s(x), y), s(x), y)
if_minus(true, s(x), y) -> 0
if_minus(false, s(x), y) -> s(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, s(x), s(y)) -> gcd(minus(x, y), s(y))
if_gcd(false, s(x), s(y)) -> gcd(minus(y, x), s(x))

Strategy:

innermost

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

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

two new Dependency Pairs are created:

IF_GCD(false, s(x'), s(0)) -> GCD(0, s(x'))
IF_GCD(false, s(x0), s(s(x''))) -> GCD(if_minus(le(s(x''), x0), s(x''), x0), s(x0))

The transformation is resulting in one new DP problem:

     ↳DPs

       →DP Problem 1

         ↳FwdInst

       →DP Problem 2

         ↳Nar

       →DP Problem 3

         ↳Nar

           →DP Problem 19

             ↳Nar

...

               →DP Problem 21

                 ↳Narrowing 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(s(x'')), s(y'')) -> GCD(if_minus(le(s(x''), y''), s(x''), y''), s(y''))
GCD(s(x'), s(0)) -> IF_GCD(true, s(x'), s(0))
IF_GCD(false, s(x0), s(s(x''))) -> GCD(if_minus(le(s(x''), x0), s(x''), x0), s(x0))
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(0, y) -> 0
minus(s(x), y) -> if_minus(le(s(x), y), s(x), y)
if_minus(true, s(x), y) -> 0
if_minus(false, s(x), y) -> s(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, s(x), s(y)) -> gcd(minus(x, y), s(y))
if_gcd(false, s(x), s(y)) -> gcd(minus(y, x), s(x))

Strategy:

innermost

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

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

three new Dependency Pairs are created:

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

The transformation is resulting in one new DP problem:

     ↳DPs

       →DP Problem 1

         ↳FwdInst

       →DP Problem 2

         ↳Nar

       →DP Problem 3

         ↳Nar

           →DP Problem 19

             ↳Nar

...

               →DP Problem 22

                 ↳Narrowing Transformation

Dependency Pairs:

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

Rules:

le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
minus(0, y) -> 0
minus(s(x), y) -> if_minus(le(s(x), y), s(x), y)
if_minus(true, s(x), y) -> 0
if_minus(false, s(x), y) -> s(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, s(x), s(y)) -> gcd(minus(x, y), s(y))
if_gcd(false, s(x), s(y)) -> gcd(minus(y, x), s(x))

Strategy:

innermost

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

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

two new Dependency Pairs are created:

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

The transformation is resulting in two new DP problems:

     ↳DPs

       →DP Problem 1

         ↳FwdInst

       →DP Problem 2

         ↳Nar

       →DP Problem 3

         ↳Nar

           →DP Problem 19

             ↳Nar

...

               →DP Problem 23

                 ↳Rewriting Transformation

Dependency Pairs:

IF_GCD(true, s(s(x''')), s(0)) -> GCD(if_minus(false, s(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(0, y) -> 0
minus(s(x), y) -> if_minus(le(s(x), y), s(x), y)
if_minus(true, s(x), y) -> 0
if_minus(false, s(x), y) -> s(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, s(x), s(y)) -> gcd(minus(x, y), s(y))
if_gcd(false, s(x), s(y)) -> gcd(minus(y, x), s(x))

Strategy:

innermost

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

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

one new Dependency Pair is created:

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

The transformation is resulting in one new DP problem:

     ↳DPs

       →DP Problem 1

         ↳FwdInst

       →DP Problem 2

         ↳Nar

       →DP Problem 3

         ↳Nar

           →DP Problem 19

             ↳Nar

...

               →DP Problem 25

                 ↳Forward Instantiation Transformation

Dependency Pairs:

IF_GCD(true, s(s(x''')), s(0)) -> GCD(s(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(0, y) -> 0
minus(s(x), y) -> if_minus(le(s(x), y), s(x), y)
if_minus(true, s(x), y) -> 0
if_minus(false, s(x), y) -> s(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, s(x), s(y)) -> gcd(minus(x, y), s(y))
if_gcd(false, s(x), s(y)) -> gcd(minus(y, x), s(x))

Strategy:

innermost

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

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

one new Dependency Pair is created:

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

The transformation is resulting in one new DP problem:

     ↳DPs

       →DP Problem 1

         ↳FwdInst

       →DP Problem 2

         ↳Nar

       →DP Problem 3

         ↳Nar

           →DP Problem 19

             ↳Nar

...

               →DP Problem 27

                 ↳Polynomial Ordering

Dependency Pairs:

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

Rules:

le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
minus(0, y) -> 0
minus(s(x), y) -> if_minus(le(s(x), y), s(x), y)
if_minus(true, s(x), y) -> 0
if_minus(false, s(x), y) -> s(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, s(x), s(y)) -> gcd(minus(x, y), s(y))
if_gcd(false, s(x), s(y)) -> gcd(minus(y, x), s(x))

Strategy:

innermost

The following dependency pair can be strictly oriented:

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

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

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

POL(false) = 0

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

POL(true) = 0

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

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

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

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

resulting in one new DP problem.

     ↳DPs

       →DP Problem 1

         ↳FwdInst

       →DP Problem 2

         ↳Nar

       →DP Problem 3

         ↳Nar

           →DP Problem 19

             ↳Nar

...

               →DP Problem 29

                 ↳Dependency Graph

Dependency Pair:

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

Rules:

le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
minus(0, y) -> 0
minus(s(x), y) -> if_minus(le(s(x), y), s(x), y)
if_minus(true, s(x), y) -> 0
if_minus(false, s(x), y) -> s(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, s(x), s(y)) -> gcd(minus(x, y), s(y))
if_gcd(false, s(x), s(y)) -> gcd(minus(y, x), s(x))

Strategy:

innermost

Using the Dependency Graph resulted in no new DP problems.

     ↳DPs

       →DP Problem 1

         ↳FwdInst

       →DP Problem 2

         ↳Nar

       →DP Problem 3

         ↳Nar

           →DP Problem 19

             ↳Nar

...

               →DP Problem 24

                 ↳Narrowing Transformation

Dependency Pairs:

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

Rules:

le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
minus(0, y) -> 0
minus(s(x), y) -> if_minus(le(s(x), y), s(x), y)
if_minus(true, s(x), y) -> 0
if_minus(false, s(x), y) -> s(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, s(x), s(y)) -> gcd(minus(x, y), s(y))
if_gcd(false, s(x), s(y)) -> gcd(minus(y, x), s(x))

Strategy:

innermost

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

IF_GCD(false, s(x0), s(s(x''))) -> GCD(if_minus(le(s(x''), x0), s(x''), x0), s(x0))

two new Dependency Pairs are created:

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

The transformation is resulting in one new DP problem:

     ↳DPs

       →DP Problem 1

         ↳FwdInst

       →DP Problem 2

         ↳Nar

       →DP Problem 3

         ↳Nar

           →DP Problem 19

             ↳Nar

...

               →DP Problem 26

                 ↳Polynomial Ordering

Dependency Pairs:

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

Rules:

le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
minus(0, y) -> 0
minus(s(x), y) -> if_minus(le(s(x), y), s(x), y)
if_minus(true, s(x), y) -> 0
if_minus(false, s(x), y) -> s(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, s(x), s(y)) -> gcd(minus(x, y), s(y))
if_gcd(false, s(x), s(y)) -> gcd(minus(y, x), s(x))

Strategy:

innermost

The following dependency pairs can be strictly oriented:

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

Additionally, 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)
if_minus(true, s(x), y) -> 0
if_minus(false, s(x), y) -> s(minus(x, y))
minus(0, y) -> 0
minus(s(x), y) -> if_minus(le(s(x), y), s(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(if_minus(x₁, x₂, x₃)) = x₂

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

resulting in one new DP problem.

     ↳DPs

       →DP Problem 1

         ↳FwdInst

       →DP Problem 2

         ↳Nar

       →DP Problem 3

         ↳Nar

           →DP Problem 19

             ↳Nar

...

               →DP Problem 28

                 ↳Dependency Graph

Dependency Pairs:

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

Rules:

le(0, y) -> true
le(s(x), 0) -> false
le(s(x), s(y)) -> le(x, y)
minus(0, y) -> 0
minus(s(x), y) -> if_minus(le(s(x), y), s(x), y)
if_minus(true, s(x), y) -> 0
if_minus(false, s(x), y) -> s(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, s(x), s(y)) -> gcd(minus(x, y), s(y))
if_gcd(false, s(x), s(y)) -> gcd(minus(y, x), s(x))

Strategy:

innermost

Using the Dependency Graph resulted in no new DP problems.

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

POL(IF_MINUS(x₁, x₂, x₃))	= x₂
POL(0)	= 0
POL(false)	= 0
POL(MINUS(x₁, x₂))	= x₁
POL(true)	= 0
POL(s(x₁))	= 1 + x₁
POL(le(x₁, x₂))	= 0

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

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(if_minus(x₁, x₂, x₃))	= x₂
POL(le(x₁, x₂))	= 0