Termination Proof using AProVE

Term Rewriting System R:
[X, Y]
min(X, 0) -> X
min(s(X), s(Y)) -> min(X, Y)
quot(0, s(Y)) -> 0
quot(s(X), s(Y)) -> s(quot(min(X, Y), s(Y)))
log(s(0)) -> 0
log(s(s(X))) -> s(log(s(quot(X, s(s(0))))))

Termination of R to be shown.

     ↳Dependency Pair Analysis

R contains the following Dependency Pairs:

MIN(s(X), s(Y)) -> MIN(X, Y)
QUOT(s(X), s(Y)) -> QUOT(min(X, Y), s(Y))
QUOT(s(X), s(Y)) -> MIN(X, Y)
LOG(s(s(X))) -> LOG(s(quot(X, s(s(0)))))
LOG(s(s(X))) -> QUOT(X, s(s(0)))

Furthermore, R contains three SCCs.

     ↳DPs

       →DP Problem 1

         ↳Argument Filtering and Ordering

       →DP Problem 2

         ↳AFS

       →DP Problem 3

         ↳AFS

Dependency Pair:

MIN(s(X), s(Y)) -> MIN(X, Y)

Rules:

min(X, 0) -> X
min(s(X), s(Y)) -> min(X, Y)
quot(0, s(Y)) -> 0
quot(s(X), s(Y)) -> s(quot(min(X, Y), s(Y)))
log(s(0)) -> 0
log(s(s(X))) -> s(log(s(quot(X, s(s(0))))))

The following dependency pair can be strictly oriented:

MIN(s(X), s(Y)) -> MIN(X, Y)

There are no usable rules w.r.t. to the AFS that need to be oriented.
Used ordering: Homeomorphic Embedding Order with EMB
resulting in one new DP problem.
Used Argument Filtering System:

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

     ↳DPs

       →DP Problem 1

         ↳AFS

           →DP Problem 4

             ↳Dependency Graph

       →DP Problem 2

         ↳AFS

       →DP Problem 3

         ↳AFS

Dependency Pair:

Rules:

min(X, 0) -> X
min(s(X), s(Y)) -> min(X, Y)
quot(0, s(Y)) -> 0
quot(s(X), s(Y)) -> s(quot(min(X, Y), s(Y)))
log(s(0)) -> 0
log(s(s(X))) -> s(log(s(quot(X, s(s(0))))))

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

Dependency Pair:

QUOT(s(X), s(Y)) -> QUOT(min(X, Y), s(Y))

Rules:

min(X, 0) -> X
min(s(X), s(Y)) -> min(X, Y)
quot(0, s(Y)) -> 0
quot(s(X), s(Y)) -> s(quot(min(X, Y), s(Y)))
log(s(0)) -> 0
log(s(s(X))) -> s(log(s(quot(X, s(s(0))))))

The following dependency pair can be strictly oriented:

QUOT(s(X), s(Y)) -> QUOT(min(X, Y), s(Y))

The following usable rules w.r.t. to the AFS can be oriented:

min(X, 0) -> X
min(s(X), s(Y)) -> min(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₁)
min(x₁, x₂) -> x₁

     ↳DPs

       →DP Problem 1

         ↳AFS

       →DP Problem 2

         ↳AFS

           →DP Problem 5

             ↳Dependency Graph

       →DP Problem 3

         ↳AFS

Dependency Pair:

Rules:

min(X, 0) -> X
min(s(X), s(Y)) -> min(X, Y)
quot(0, s(Y)) -> 0
quot(s(X), s(Y)) -> s(quot(min(X, Y), s(Y)))
log(s(0)) -> 0
log(s(s(X))) -> s(log(s(quot(X, s(s(0))))))

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

Dependency Pair:

LOG(s(s(X))) -> LOG(s(quot(X, s(s(0)))))

Rules:

min(X, 0) -> X
min(s(X), s(Y)) -> min(X, Y)
quot(0, s(Y)) -> 0
quot(s(X), s(Y)) -> s(quot(min(X, Y), s(Y)))
log(s(0)) -> 0
log(s(s(X))) -> s(log(s(quot(X, s(s(0))))))

The following dependency pair can be strictly oriented:

LOG(s(s(X))) -> LOG(s(quot(X, s(s(0)))))

The following usable rules w.r.t. to the AFS can be oriented:

quot(0, s(Y)) -> 0
quot(s(X), s(Y)) -> s(quot(min(X, Y), s(Y)))
min(X, 0) -> X
min(s(X), s(Y)) -> min(X, Y)

Used ordering: Homeomorphic Embedding Order with EMB
resulting in one new DP problem.
Used Argument Filtering System:

LOG(x₁) -> LOG(x₁)
s(x₁) -> s(x₁)
quot(x₁, x₂) -> x₁
min(x₁, x₂) -> x₁

     ↳DPs

       →DP Problem 1

         ↳AFS

       →DP Problem 2

         ↳AFS

       →DP Problem 3

         ↳AFS

           →DP Problem 6

             ↳Dependency Graph

Dependency Pair:

Rules:

min(X, 0) -> X
min(s(X), s(Y)) -> min(X, Y)
quot(0, s(Y)) -> 0
quot(s(X), s(Y)) -> s(quot(min(X, Y), s(Y)))
log(s(0)) -> 0
log(s(s(X))) -> s(log(s(quot(X, s(s(0))))))

Using the Dependency Graph resulted in no new DP problems.

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