Termination Proof using AProVE

Term Rewriting System R:
[x, y, z]
0(#) -> #
+(#, x) -> x
+(x, #) -> x
+(0(x), 0(y)) -> 0(+(x, y))
+(0(x), 1(y)) -> 1(+(x, y))
+(1(x), 0(y)) -> 1(+(x, y))
+(1(x), 1(y)) -> 0(+(+(x, y), 1(#)))
+(+(x, y), z) -> +(x, +(y, z))
-(#, x) -> #
-(x, #) -> x
-(0(x), 0(y)) -> 0(-(x, y))
-(0(x), 1(y)) -> 1(-(-(x, y), 1(#)))
-(1(x), 0(y)) -> 1(-(x, y))
-(1(x), 1(y)) -> 0(-(x, y))
not(true) -> false
not(false) -> true
if(true, x, y) -> x
if(false, x, y) -> y
ge(0(x), 0(y)) -> ge(x, y)
ge(0(x), 1(y)) -> not(ge(y, x))
ge(1(x), 0(y)) -> ge(x, y)
ge(1(x), 1(y)) -> ge(x, y)
ge(x, #) -> true
ge(#, 0(x)) -> ge(#, x)
ge(#, 1(x)) -> false
log(x) -> -(log'(x), 1(#))
log'(#) -> #
log'(1(x)) -> +(log'(x), 1(#))
log'(0(x)) -> if(ge(x, 1(#)), +(log'(x), 1(#)), #)

Innermost Termination of R to be shown.

     ↳Dependency Pair Analysis

R contains the following Dependency Pairs:

+'(0(x), 0(y)) -> 0'(+(x, y))
+'(0(x), 0(y)) -> +'(x, y)
+'(0(x), 1(y)) -> +'(x, y)
+'(1(x), 0(y)) -> +'(x, y)
+'(1(x), 1(y)) -> 0'(+(+(x, y), 1(#)))
+'(1(x), 1(y)) -> +'(+(x, y), 1(#))
+'(1(x), 1(y)) -> +'(x, y)
+'(+(x, y), z) -> +'(x, +(y, z))
+'(+(x, y), z) -> +'(y, z)
-'(0(x), 0(y)) -> 0'(-(x, y))
-'(0(x), 0(y)) -> -'(x, y)
-'(0(x), 1(y)) -> -'(-(x, y), 1(#))
-'(0(x), 1(y)) -> -'(x, y)
-'(1(x), 0(y)) -> -'(x, y)
-'(1(x), 1(y)) -> 0'(-(x, y))
-'(1(x), 1(y)) -> -'(x, y)
GE(0(x), 0(y)) -> GE(x, y)
GE(0(x), 1(y)) -> NOT(ge(y, x))
GE(0(x), 1(y)) -> GE(y, x)
GE(1(x), 0(y)) -> GE(x, y)
GE(1(x), 1(y)) -> GE(x, y)
GE(#, 0(x)) -> GE(#, x)
LOG(x) -> -'(log'(x), 1(#))
LOG(x) -> LOG'(x)
LOG'(1(x)) -> +'(log'(x), 1(#))
LOG'(1(x)) -> LOG'(x)
LOG'(0(x)) -> IF(ge(x, 1(#)), +(log'(x), 1(#)), #)
LOG'(0(x)) -> GE(x, 1(#))
LOG'(0(x)) -> +'(log'(x), 1(#))
LOG'(0(x)) -> LOG'(x)

Furthermore, R contains five SCCs.

     ↳DPs

       →DP Problem 1

         ↳Polynomial Ordering

       →DP Problem 2

         ↳Polo

       →DP Problem 3

         ↳Polo

       →DP Problem 4

         ↳Polo

       →DP Problem 5

         ↳Polo

Dependency Pairs:

+'(+(x, y), z) -> +'(y, z)
+'(+(x, y), z) -> +'(x, +(y, z))
+'(1(x), 1(y)) -> +'(x, y)
+'(1(x), 1(y)) -> +'(+(x, y), 1(#))
+'(1(x), 0(y)) -> +'(x, y)
+'(0(x), 1(y)) -> +'(x, y)
+'(0(x), 0(y)) -> +'(x, y)

Rules:

0(#) -> #
+(#, x) -> x
+(x, #) -> x
+(0(x), 0(y)) -> 0(+(x, y))
+(0(x), 1(y)) -> 1(+(x, y))
+(1(x), 0(y)) -> 1(+(x, y))
+(1(x), 1(y)) -> 0(+(+(x, y), 1(#)))
+(+(x, y), z) -> +(x, +(y, z))
-(#, x) -> #
-(x, #) -> x
-(0(x), 0(y)) -> 0(-(x, y))
-(0(x), 1(y)) -> 1(-(-(x, y), 1(#)))
-(1(x), 0(y)) -> 1(-(x, y))
-(1(x), 1(y)) -> 0(-(x, y))
not(true) -> false
not(false) -> true
if(true, x, y) -> x
if(false, x, y) -> y
ge(0(x), 0(y)) -> ge(x, y)
ge(0(x), 1(y)) -> not(ge(y, x))
ge(1(x), 0(y)) -> ge(x, y)
ge(1(x), 1(y)) -> ge(x, y)
ge(x, #) -> true
ge(#, 0(x)) -> ge(#, x)
ge(#, 1(x)) -> false
log(x) -> -(log'(x), 1(#))
log'(#) -> #
log'(1(x)) -> +(log'(x), 1(#))
log'(0(x)) -> if(ge(x, 1(#)), +(log'(x), 1(#)), #)

Strategy:

innermost

The following dependency pairs can be strictly oriented:

+'(+(x, y), z) -> +'(y, z)
+'(1(x), 1(y)) -> +'(x, y)
+'(1(x), 0(y)) -> +'(x, y)
+'(0(x), 1(y)) -> +'(x, y)

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

+(#, x) -> x
+(x, #) -> x
+(0(x), 0(y)) -> 0(+(x, y))
+(0(x), 1(y)) -> 1(+(x, y))
+(1(x), 0(y)) -> 1(+(x, y))
+(1(x), 1(y)) -> 0(+(+(x, y), 1(#)))
+(+(x, y), z) -> +(x, +(y, z))
0(#) -> #

Used ordering: Polynomial ordering with Polynomial interpretation:

POL(#) = 0

POL(0(x₁)) = x₁

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

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

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

resulting in one new DP problem.

     ↳DPs

       →DP Problem 1

         ↳Polo

           →DP Problem 6

             ↳Polynomial Ordering

       →DP Problem 2

         ↳Polo

       →DP Problem 3

         ↳Polo

       →DP Problem 4

         ↳Polo

       →DP Problem 5

         ↳Polo

Dependency Pairs:

+'(+(x, y), z) -> +'(x, +(y, z))
+'(1(x), 1(y)) -> +'(+(x, y), 1(#))
+'(0(x), 0(y)) -> +'(x, y)

Rules:

0(#) -> #
+(#, x) -> x
+(x, #) -> x
+(0(x), 0(y)) -> 0(+(x, y))
+(0(x), 1(y)) -> 1(+(x, y))
+(1(x), 0(y)) -> 1(+(x, y))
+(1(x), 1(y)) -> 0(+(+(x, y), 1(#)))
+(+(x, y), z) -> +(x, +(y, z))
-(#, x) -> #
-(x, #) -> x
-(0(x), 0(y)) -> 0(-(x, y))
-(0(x), 1(y)) -> 1(-(-(x, y), 1(#)))
-(1(x), 0(y)) -> 1(-(x, y))
-(1(x), 1(y)) -> 0(-(x, y))
not(true) -> false
not(false) -> true
if(true, x, y) -> x
if(false, x, y) -> y
ge(0(x), 0(y)) -> ge(x, y)
ge(0(x), 1(y)) -> not(ge(y, x))
ge(1(x), 0(y)) -> ge(x, y)
ge(1(x), 1(y)) -> ge(x, y)
ge(x, #) -> true
ge(#, 0(x)) -> ge(#, x)
ge(#, 1(x)) -> false
log(x) -> -(log'(x), 1(#))
log'(#) -> #
log'(1(x)) -> +(log'(x), 1(#))
log'(0(x)) -> if(ge(x, 1(#)), +(log'(x), 1(#)), #)

Strategy:

innermost

The following dependency pair can be strictly oriented:

+'(1(x), 1(y)) -> +'(+(x, y), 1(#))

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

+(#, x) -> x
+(x, #) -> x
+(0(x), 0(y)) -> 0(+(x, y))
+(0(x), 1(y)) -> 1(+(x, y))
+(1(x), 0(y)) -> 1(+(x, y))
+(1(x), 1(y)) -> 0(+(+(x, y), 1(#)))
+(+(x, y), z) -> +(x, +(y, z))
0(#) -> #

Used ordering: Polynomial ordering with Polynomial interpretation:

POL(#) = 0

POL(0(x₁)) = x₁

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

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

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

resulting in one new DP problem.

     ↳DPs

       →DP Problem 1

         ↳Polo

           →DP Problem 6

             ↳Polo

...

               →DP Problem 7

                 ↳Polynomial Ordering

       →DP Problem 2

         ↳Polo

       →DP Problem 3

         ↳Polo

       →DP Problem 4

         ↳Polo

       →DP Problem 5

         ↳Polo

Dependency Pairs:

+'(+(x, y), z) -> +'(x, +(y, z))
+'(0(x), 0(y)) -> +'(x, y)

Rules:

0(#) -> #
+(#, x) -> x
+(x, #) -> x
+(0(x), 0(y)) -> 0(+(x, y))
+(0(x), 1(y)) -> 1(+(x, y))
+(1(x), 0(y)) -> 1(+(x, y))
+(1(x), 1(y)) -> 0(+(+(x, y), 1(#)))
+(+(x, y), z) -> +(x, +(y, z))
-(#, x) -> #
-(x, #) -> x
-(0(x), 0(y)) -> 0(-(x, y))
-(0(x), 1(y)) -> 1(-(-(x, y), 1(#)))
-(1(x), 0(y)) -> 1(-(x, y))
-(1(x), 1(y)) -> 0(-(x, y))
not(true) -> false
not(false) -> true
if(true, x, y) -> x
if(false, x, y) -> y
ge(0(x), 0(y)) -> ge(x, y)
ge(0(x), 1(y)) -> not(ge(y, x))
ge(1(x), 0(y)) -> ge(x, y)
ge(1(x), 1(y)) -> ge(x, y)
ge(x, #) -> true
ge(#, 0(x)) -> ge(#, x)
ge(#, 1(x)) -> false
log(x) -> -(log'(x), 1(#))
log'(#) -> #
log'(1(x)) -> +(log'(x), 1(#))
log'(0(x)) -> if(ge(x, 1(#)), +(log'(x), 1(#)), #)

Strategy:

innermost

The following dependency pair can be strictly oriented:

+'(+(x, y), z) -> +'(x, +(y, z))

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

+(#, x) -> x
+(x, #) -> x
+(0(x), 0(y)) -> 0(+(x, y))
+(0(x), 1(y)) -> 1(+(x, y))
+(1(x), 0(y)) -> 1(+(x, y))
+(1(x), 1(y)) -> 0(+(+(x, y), 1(#)))
+(+(x, y), z) -> +(x, +(y, z))
0(#) -> #

Used ordering: Polynomial ordering with Polynomial interpretation:

POL(#) = 0

POL(0(x₁)) = x₁

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

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

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

resulting in one new DP problem.

     ↳DPs

       →DP Problem 1

         ↳Polo

           →DP Problem 6

             ↳Polo

...

               →DP Problem 8

                 ↳Polynomial Ordering

       →DP Problem 2

         ↳Polo

       →DP Problem 3

         ↳Polo

       →DP Problem 4

         ↳Polo

       →DP Problem 5

         ↳Polo

Dependency Pair:

+'(0(x), 0(y)) -> +'(x, y)

Rules:

0(#) -> #
+(#, x) -> x
+(x, #) -> x
+(0(x), 0(y)) -> 0(+(x, y))
+(0(x), 1(y)) -> 1(+(x, y))
+(1(x), 0(y)) -> 1(+(x, y))
+(1(x), 1(y)) -> 0(+(+(x, y), 1(#)))
+(+(x, y), z) -> +(x, +(y, z))
-(#, x) -> #
-(x, #) -> x
-(0(x), 0(y)) -> 0(-(x, y))
-(0(x), 1(y)) -> 1(-(-(x, y), 1(#)))
-(1(x), 0(y)) -> 1(-(x, y))
-(1(x), 1(y)) -> 0(-(x, y))
not(true) -> false
not(false) -> true
if(true, x, y) -> x
if(false, x, y) -> y
ge(0(x), 0(y)) -> ge(x, y)
ge(0(x), 1(y)) -> not(ge(y, x))
ge(1(x), 0(y)) -> ge(x, y)
ge(1(x), 1(y)) -> ge(x, y)
ge(x, #) -> true
ge(#, 0(x)) -> ge(#, x)
ge(#, 1(x)) -> false
log(x) -> -(log'(x), 1(#))
log'(#) -> #
log'(1(x)) -> +(log'(x), 1(#))
log'(0(x)) -> if(ge(x, 1(#)), +(log'(x), 1(#)), #)

Strategy:

innermost

The following dependency pair can be strictly oriented:

+'(0(x), 0(y)) -> +'(x, y)

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

Used ordering: Polynomial ordering with Polynomial interpretation:

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

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

resulting in one new DP problem.

     ↳DPs

       →DP Problem 1

         ↳Polo

           →DP Problem 6

             ↳Polo

...

               →DP Problem 9

                 ↳Dependency Graph

       →DP Problem 2

         ↳Polo

       →DP Problem 3

         ↳Polo

       →DP Problem 4

         ↳Polo

       →DP Problem 5

         ↳Polo

Dependency Pair:

Rules:

0(#) -> #
+(#, x) -> x
+(x, #) -> x
+(0(x), 0(y)) -> 0(+(x, y))
+(0(x), 1(y)) -> 1(+(x, y))
+(1(x), 0(y)) -> 1(+(x, y))
+(1(x), 1(y)) -> 0(+(+(x, y), 1(#)))
+(+(x, y), z) -> +(x, +(y, z))
-(#, x) -> #
-(x, #) -> x
-(0(x), 0(y)) -> 0(-(x, y))
-(0(x), 1(y)) -> 1(-(-(x, y), 1(#)))
-(1(x), 0(y)) -> 1(-(x, y))
-(1(x), 1(y)) -> 0(-(x, y))
not(true) -> false
not(false) -> true
if(true, x, y) -> x
if(false, x, y) -> y
ge(0(x), 0(y)) -> ge(x, y)
ge(0(x), 1(y)) -> not(ge(y, x))
ge(1(x), 0(y)) -> ge(x, y)
ge(1(x), 1(y)) -> ge(x, y)
ge(x, #) -> true
ge(#, 0(x)) -> ge(#, x)
ge(#, 1(x)) -> false
log(x) -> -(log'(x), 1(#))
log'(#) -> #
log'(1(x)) -> +(log'(x), 1(#))
log'(0(x)) -> if(ge(x, 1(#)), +(log'(x), 1(#)), #)

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

         ↳Polo

       →DP Problem 4

         ↳Polo

       →DP Problem 5

         ↳Polo

Dependency Pairs:

-'(1(x), 1(y)) -> -'(x, y)
-'(1(x), 0(y)) -> -'(x, y)
-'(0(x), 1(y)) -> -'(x, y)
-'(0(x), 1(y)) -> -'(-(x, y), 1(#))
-'(0(x), 0(y)) -> -'(x, y)

Rules:

0(#) -> #
+(#, x) -> x
+(x, #) -> x
+(0(x), 0(y)) -> 0(+(x, y))
+(0(x), 1(y)) -> 1(+(x, y))
+(1(x), 0(y)) -> 1(+(x, y))
+(1(x), 1(y)) -> 0(+(+(x, y), 1(#)))
+(+(x, y), z) -> +(x, +(y, z))
-(#, x) -> #
-(x, #) -> x
-(0(x), 0(y)) -> 0(-(x, y))
-(0(x), 1(y)) -> 1(-(-(x, y), 1(#)))
-(1(x), 0(y)) -> 1(-(x, y))
-(1(x), 1(y)) -> 0(-(x, y))
not(true) -> false
not(false) -> true
if(true, x, y) -> x
if(false, x, y) -> y
ge(0(x), 0(y)) -> ge(x, y)
ge(0(x), 1(y)) -> not(ge(y, x))
ge(1(x), 0(y)) -> ge(x, y)
ge(1(x), 1(y)) -> ge(x, y)
ge(x, #) -> true
ge(#, 0(x)) -> ge(#, x)
ge(#, 1(x)) -> false
log(x) -> -(log'(x), 1(#))
log'(#) -> #
log'(1(x)) -> +(log'(x), 1(#))
log'(0(x)) -> if(ge(x, 1(#)), +(log'(x), 1(#)), #)

Strategy:

innermost

The following dependency pairs can be strictly oriented:

-'(1(x), 1(y)) -> -'(x, y)
-'(1(x), 0(y)) -> -'(x, y)
-'(0(x), 1(y)) -> -'(x, y)
-'(0(x), 0(y)) -> -'(x, y)

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

-(#, x) -> #
-(x, #) -> x
-(0(x), 0(y)) -> 0(-(x, y))
-(0(x), 1(y)) -> 1(-(-(x, y), 1(#)))
-(1(x), 0(y)) -> 1(-(x, y))
-(1(x), 1(y)) -> 0(-(x, y))
0(#) -> #

Used ordering: Polynomial ordering with Polynomial interpretation:

POL(#) = 0

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

POL(-'(x₁, x₂)) = x₂

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

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

resulting in one new DP problem.

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Polo

           →DP Problem 10

             ↳Polynomial Ordering

       →DP Problem 3

         ↳Polo

       →DP Problem 4

         ↳Polo

       →DP Problem 5

         ↳Polo

Dependency Pair:

-'(0(x), 1(y)) -> -'(-(x, y), 1(#))

Rules:

0(#) -> #
+(#, x) -> x
+(x, #) -> x
+(0(x), 0(y)) -> 0(+(x, y))
+(0(x), 1(y)) -> 1(+(x, y))
+(1(x), 0(y)) -> 1(+(x, y))
+(1(x), 1(y)) -> 0(+(+(x, y), 1(#)))
+(+(x, y), z) -> +(x, +(y, z))
-(#, x) -> #
-(x, #) -> x
-(0(x), 0(y)) -> 0(-(x, y))
-(0(x), 1(y)) -> 1(-(-(x, y), 1(#)))
-(1(x), 0(y)) -> 1(-(x, y))
-(1(x), 1(y)) -> 0(-(x, y))
not(true) -> false
not(false) -> true
if(true, x, y) -> x
if(false, x, y) -> y
ge(0(x), 0(y)) -> ge(x, y)
ge(0(x), 1(y)) -> not(ge(y, x))
ge(1(x), 0(y)) -> ge(x, y)
ge(1(x), 1(y)) -> ge(x, y)
ge(x, #) -> true
ge(#, 0(x)) -> ge(#, x)
ge(#, 1(x)) -> false
log(x) -> -(log'(x), 1(#))
log'(#) -> #
log'(1(x)) -> +(log'(x), 1(#))
log'(0(x)) -> if(ge(x, 1(#)), +(log'(x), 1(#)), #)

Strategy:

innermost

The following dependency pair can be strictly oriented:

-'(0(x), 1(y)) -> -'(-(x, y), 1(#))

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

-(#, x) -> #
-(x, #) -> x
-(0(x), 0(y)) -> 0(-(x, y))
-(0(x), 1(y)) -> 1(-(-(x, y), 1(#)))
-(1(x), 0(y)) -> 1(-(x, y))
-(1(x), 1(y)) -> 0(-(x, y))
0(#) -> #

Used ordering: Polynomial ordering with Polynomial interpretation:

POL(#) = 0

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

POL(-'(x₁, x₂)) = x₁

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

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

resulting in one new DP problem.

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Polo

           →DP Problem 10

             ↳Polo

...

               →DP Problem 11

                 ↳Dependency Graph

       →DP Problem 3

         ↳Polo

       →DP Problem 4

         ↳Polo

       →DP Problem 5

         ↳Polo

Dependency Pair:

Rules:

0(#) -> #
+(#, x) -> x
+(x, #) -> x
+(0(x), 0(y)) -> 0(+(x, y))
+(0(x), 1(y)) -> 1(+(x, y))
+(1(x), 0(y)) -> 1(+(x, y))
+(1(x), 1(y)) -> 0(+(+(x, y), 1(#)))
+(+(x, y), z) -> +(x, +(y, z))
-(#, x) -> #
-(x, #) -> x
-(0(x), 0(y)) -> 0(-(x, y))
-(0(x), 1(y)) -> 1(-(-(x, y), 1(#)))
-(1(x), 0(y)) -> 1(-(x, y))
-(1(x), 1(y)) -> 0(-(x, y))
not(true) -> false
not(false) -> true
if(true, x, y) -> x
if(false, x, y) -> y
ge(0(x), 0(y)) -> ge(x, y)
ge(0(x), 1(y)) -> not(ge(y, x))
ge(1(x), 0(y)) -> ge(x, y)
ge(1(x), 1(y)) -> ge(x, y)
ge(x, #) -> true
ge(#, 0(x)) -> ge(#, x)
ge(#, 1(x)) -> false
log(x) -> -(log'(x), 1(#))
log'(#) -> #
log'(1(x)) -> +(log'(x), 1(#))
log'(0(x)) -> if(ge(x, 1(#)), +(log'(x), 1(#)), #)

Strategy:

innermost

Using the Dependency Graph resulted in no new DP problems.

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Polo

       →DP Problem 3

         ↳Polynomial Ordering

       →DP Problem 4

         ↳Polo

       →DP Problem 5

         ↳Polo

Dependency Pair:

GE(#, 0(x)) -> GE(#, x)

Rules:

0(#) -> #
+(#, x) -> x
+(x, #) -> x
+(0(x), 0(y)) -> 0(+(x, y))
+(0(x), 1(y)) -> 1(+(x, y))
+(1(x), 0(y)) -> 1(+(x, y))
+(1(x), 1(y)) -> 0(+(+(x, y), 1(#)))
+(+(x, y), z) -> +(x, +(y, z))
-(#, x) -> #
-(x, #) -> x
-(0(x), 0(y)) -> 0(-(x, y))
-(0(x), 1(y)) -> 1(-(-(x, y), 1(#)))
-(1(x), 0(y)) -> 1(-(x, y))
-(1(x), 1(y)) -> 0(-(x, y))
not(true) -> false
not(false) -> true
if(true, x, y) -> x
if(false, x, y) -> y
ge(0(x), 0(y)) -> ge(x, y)
ge(0(x), 1(y)) -> not(ge(y, x))
ge(1(x), 0(y)) -> ge(x, y)
ge(1(x), 1(y)) -> ge(x, y)
ge(x, #) -> true
ge(#, 0(x)) -> ge(#, x)
ge(#, 1(x)) -> false
log(x) -> -(log'(x), 1(#))
log'(#) -> #
log'(1(x)) -> +(log'(x), 1(#))
log'(0(x)) -> if(ge(x, 1(#)), +(log'(x), 1(#)), #)

Strategy:

innermost

The following dependency pair can be strictly oriented:

GE(#, 0(x)) -> GE(#, x)

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

Used ordering: Polynomial ordering with Polynomial interpretation:

POL(#) = 0

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

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

resulting in one new DP problem.

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Polo

       →DP Problem 3

         ↳Polo

           →DP Problem 12

             ↳Dependency Graph

       →DP Problem 4

         ↳Polo

       →DP Problem 5

         ↳Polo

Dependency Pair:

Rules:

0(#) -> #
+(#, x) -> x
+(x, #) -> x
+(0(x), 0(y)) -> 0(+(x, y))
+(0(x), 1(y)) -> 1(+(x, y))
+(1(x), 0(y)) -> 1(+(x, y))
+(1(x), 1(y)) -> 0(+(+(x, y), 1(#)))
+(+(x, y), z) -> +(x, +(y, z))
-(#, x) -> #
-(x, #) -> x
-(0(x), 0(y)) -> 0(-(x, y))
-(0(x), 1(y)) -> 1(-(-(x, y), 1(#)))
-(1(x), 0(y)) -> 1(-(x, y))
-(1(x), 1(y)) -> 0(-(x, y))
not(true) -> false
not(false) -> true
if(true, x, y) -> x
if(false, x, y) -> y
ge(0(x), 0(y)) -> ge(x, y)
ge(0(x), 1(y)) -> not(ge(y, x))
ge(1(x), 0(y)) -> ge(x, y)
ge(1(x), 1(y)) -> ge(x, y)
ge(x, #) -> true
ge(#, 0(x)) -> ge(#, x)
ge(#, 1(x)) -> false
log(x) -> -(log'(x), 1(#))
log'(#) -> #
log'(1(x)) -> +(log'(x), 1(#))
log'(0(x)) -> if(ge(x, 1(#)), +(log'(x), 1(#)), #)

Strategy:

innermost

Using the Dependency Graph resulted in no new DP problems.

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Polo

       →DP Problem 3

         ↳Polo

       →DP Problem 4

         ↳Polynomial Ordering

       →DP Problem 5

         ↳Polo

Dependency Pairs:

GE(1(x), 1(y)) -> GE(x, y)
GE(1(x), 0(y)) -> GE(x, y)
GE(0(x), 1(y)) -> GE(y, x)
GE(0(x), 0(y)) -> GE(x, y)

Rules:

0(#) -> #
+(#, x) -> x
+(x, #) -> x
+(0(x), 0(y)) -> 0(+(x, y))
+(0(x), 1(y)) -> 1(+(x, y))
+(1(x), 0(y)) -> 1(+(x, y))
+(1(x), 1(y)) -> 0(+(+(x, y), 1(#)))
+(+(x, y), z) -> +(x, +(y, z))
-(#, x) -> #
-(x, #) -> x
-(0(x), 0(y)) -> 0(-(x, y))
-(0(x), 1(y)) -> 1(-(-(x, y), 1(#)))
-(1(x), 0(y)) -> 1(-(x, y))
-(1(x), 1(y)) -> 0(-(x, y))
not(true) -> false
not(false) -> true
if(true, x, y) -> x
if(false, x, y) -> y
ge(0(x), 0(y)) -> ge(x, y)
ge(0(x), 1(y)) -> not(ge(y, x))
ge(1(x), 0(y)) -> ge(x, y)
ge(1(x), 1(y)) -> ge(x, y)
ge(x, #) -> true
ge(#, 0(x)) -> ge(#, x)
ge(#, 1(x)) -> false
log(x) -> -(log'(x), 1(#))
log'(#) -> #
log'(1(x)) -> +(log'(x), 1(#))
log'(0(x)) -> if(ge(x, 1(#)), +(log'(x), 1(#)), #)

Strategy:

innermost

The following dependency pairs can be strictly oriented:

GE(1(x), 1(y)) -> GE(x, y)
GE(1(x), 0(y)) -> GE(x, y)
GE(0(x), 1(y)) -> GE(y, x)
GE(0(x), 0(y)) -> GE(x, y)

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

Used ordering: Polynomial ordering with Polynomial interpretation:

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

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

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

resulting in one new DP problem.

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Polo

       →DP Problem 3

         ↳Polo

       →DP Problem 4

         ↳Polo

           →DP Problem 13

             ↳Dependency Graph

       →DP Problem 5

         ↳Polo

Dependency Pair:

Rules:

0(#) -> #
+(#, x) -> x
+(x, #) -> x
+(0(x), 0(y)) -> 0(+(x, y))
+(0(x), 1(y)) -> 1(+(x, y))
+(1(x), 0(y)) -> 1(+(x, y))
+(1(x), 1(y)) -> 0(+(+(x, y), 1(#)))
+(+(x, y), z) -> +(x, +(y, z))
-(#, x) -> #
-(x, #) -> x
-(0(x), 0(y)) -> 0(-(x, y))
-(0(x), 1(y)) -> 1(-(-(x, y), 1(#)))
-(1(x), 0(y)) -> 1(-(x, y))
-(1(x), 1(y)) -> 0(-(x, y))
not(true) -> false
not(false) -> true
if(true, x, y) -> x
if(false, x, y) -> y
ge(0(x), 0(y)) -> ge(x, y)
ge(0(x), 1(y)) -> not(ge(y, x))
ge(1(x), 0(y)) -> ge(x, y)
ge(1(x), 1(y)) -> ge(x, y)
ge(x, #) -> true
ge(#, 0(x)) -> ge(#, x)
ge(#, 1(x)) -> false
log(x) -> -(log'(x), 1(#))
log'(#) -> #
log'(1(x)) -> +(log'(x), 1(#))
log'(0(x)) -> if(ge(x, 1(#)), +(log'(x), 1(#)), #)

Strategy:

innermost

Using the Dependency Graph resulted in no new DP problems.

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Polo

       →DP Problem 3

         ↳Polo

       →DP Problem 4

         ↳Polo

       →DP Problem 5

         ↳Polynomial Ordering

Dependency Pairs:

LOG'(0(x)) -> LOG'(x)
LOG'(1(x)) -> LOG'(x)

Rules:

0(#) -> #
+(#, x) -> x
+(x, #) -> x
+(0(x), 0(y)) -> 0(+(x, y))
+(0(x), 1(y)) -> 1(+(x, y))
+(1(x), 0(y)) -> 1(+(x, y))
+(1(x), 1(y)) -> 0(+(+(x, y), 1(#)))
+(+(x, y), z) -> +(x, +(y, z))
-(#, x) -> #
-(x, #) -> x
-(0(x), 0(y)) -> 0(-(x, y))
-(0(x), 1(y)) -> 1(-(-(x, y), 1(#)))
-(1(x), 0(y)) -> 1(-(x, y))
-(1(x), 1(y)) -> 0(-(x, y))
not(true) -> false
not(false) -> true
if(true, x, y) -> x
if(false, x, y) -> y
ge(0(x), 0(y)) -> ge(x, y)
ge(0(x), 1(y)) -> not(ge(y, x))
ge(1(x), 0(y)) -> ge(x, y)
ge(1(x), 1(y)) -> ge(x, y)
ge(x, #) -> true
ge(#, 0(x)) -> ge(#, x)
ge(#, 1(x)) -> false
log(x) -> -(log'(x), 1(#))
log'(#) -> #
log'(1(x)) -> +(log'(x), 1(#))
log'(0(x)) -> if(ge(x, 1(#)), +(log'(x), 1(#)), #)

Strategy:

innermost

The following dependency pair can be strictly oriented:

LOG'(0(x)) -> LOG'(x)

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

Used ordering: Polynomial ordering with Polynomial interpretation:

POL(LOG'(x₁)) = x₁

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

POL(1(x₁)) = x₁

resulting in one new DP problem.

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Polo

       →DP Problem 3

         ↳Polo

       →DP Problem 4

         ↳Polo

       →DP Problem 5

         ↳Polo

           →DP Problem 14

             ↳Polynomial Ordering

Dependency Pair:

LOG'(1(x)) -> LOG'(x)

Rules:

0(#) -> #
+(#, x) -> x
+(x, #) -> x
+(0(x), 0(y)) -> 0(+(x, y))
+(0(x), 1(y)) -> 1(+(x, y))
+(1(x), 0(y)) -> 1(+(x, y))
+(1(x), 1(y)) -> 0(+(+(x, y), 1(#)))
+(+(x, y), z) -> +(x, +(y, z))
-(#, x) -> #
-(x, #) -> x
-(0(x), 0(y)) -> 0(-(x, y))
-(0(x), 1(y)) -> 1(-(-(x, y), 1(#)))
-(1(x), 0(y)) -> 1(-(x, y))
-(1(x), 1(y)) -> 0(-(x, y))
not(true) -> false
not(false) -> true
if(true, x, y) -> x
if(false, x, y) -> y
ge(0(x), 0(y)) -> ge(x, y)
ge(0(x), 1(y)) -> not(ge(y, x))
ge(1(x), 0(y)) -> ge(x, y)
ge(1(x), 1(y)) -> ge(x, y)
ge(x, #) -> true
ge(#, 0(x)) -> ge(#, x)
ge(#, 1(x)) -> false
log(x) -> -(log'(x), 1(#))
log'(#) -> #
log'(1(x)) -> +(log'(x), 1(#))
log'(0(x)) -> if(ge(x, 1(#)), +(log'(x), 1(#)), #)

Strategy:

innermost

The following dependency pair can be strictly oriented:

LOG'(1(x)) -> LOG'(x)

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

Used ordering: Polynomial ordering with Polynomial interpretation:

POL(LOG'(x₁)) = x₁

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

resulting in one new DP problem.

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Polo

       →DP Problem 3

         ↳Polo

       →DP Problem 4

         ↳Polo

       →DP Problem 5

         ↳Polo

           →DP Problem 14

             ↳Polo

...

               →DP Problem 15

                 ↳Dependency Graph

Dependency Pair:

Rules:

0(#) -> #
+(#, x) -> x
+(x, #) -> x
+(0(x), 0(y)) -> 0(+(x, y))
+(0(x), 1(y)) -> 1(+(x, y))
+(1(x), 0(y)) -> 1(+(x, y))
+(1(x), 1(y)) -> 0(+(+(x, y), 1(#)))
+(+(x, y), z) -> +(x, +(y, z))
-(#, x) -> #
-(x, #) -> x
-(0(x), 0(y)) -> 0(-(x, y))
-(0(x), 1(y)) -> 1(-(-(x, y), 1(#)))
-(1(x), 0(y)) -> 1(-(x, y))
-(1(x), 1(y)) -> 0(-(x, y))
not(true) -> false
not(false) -> true
if(true, x, y) -> x
if(false, x, y) -> y
ge(0(x), 0(y)) -> ge(x, y)
ge(0(x), 1(y)) -> not(ge(y, x))
ge(1(x), 0(y)) -> ge(x, y)
ge(1(x), 1(y)) -> ge(x, y)
ge(x, #) -> true
ge(#, 0(x)) -> ge(#, x)
ge(#, 1(x)) -> false
log(x) -> -(log'(x), 1(#))
log'(#) -> #
log'(1(x)) -> +(log'(x), 1(#))
log'(0(x)) -> if(ge(x, 1(#)), +(log'(x), 1(#)), #)

Strategy:

innermost

Using the Dependency Graph resulted in no new DP problems.

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

POL(#)	= 0
POL(0(x₁))	= x₁
POL(1(x₁))	= 1 + x₁
POL(+(x₁, x₂))	= 1 + x₁ + x₂
POL(+'(x₁, x₂))	= 1 + x₁ + x₂

POL(0(x₁))	= 1 + x₁
POL(GE(x₁, x₂))	= 1 + x₁ + x₂
POL(1(x₁))	= 1 + x₁

POL(LOG'(x₁))	= x₁
POL(0(x₁))	= 1 + x₁
POL(1(x₁))	= x₁