Termination Proof using AProVE

Term Rewriting System R:
[X, Y, Z]
f(X) -> cons(X, n_{_f}(n_{_g}(X)))
f(X) -> n_{_f}(X)
g(0) -> s(0)
g(s(X)) -> s(s(g(X)))
g(X) -> n_{_g}(X)
sel(0, cons(X, Y)) -> X
sel(s(X), cons(Y, Z)) -> sel(X, activate(Z))
activate(n_{_f}(X)) -> f(activate(X))
activate(n_{_g}(X)) -> g(activate(X))
activate(X) -> X

Innermost Termination of R to be shown.

     ↳Dependency Pair Analysis

R contains the following Dependency Pairs:

G(s(X)) -> G(X)
SEL(s(X), cons(Y, Z)) -> SEL(X, activate(Z))
SEL(s(X), cons(Y, Z)) -> ACTIVATE(Z)
ACTIVATE(n_{_f}(X)) -> F(activate(X))
ACTIVATE(n_{_f}(X)) -> ACTIVATE(X)
ACTIVATE(n_{_g}(X)) -> G(activate(X))
ACTIVATE(n_{_g}(X)) -> ACTIVATE(X)

Furthermore, R contains three SCCs.

     ↳DPs

       →DP Problem 1

         ↳Argument Filtering and Ordering

       →DP Problem 2

         ↳AFS

       →DP Problem 3

         ↳AFS

Dependency Pair:

G(s(X)) -> G(X)

Rules:

f(X) -> cons(X, n_{_f}(n_{_g}(X)))
f(X) -> n_{_f}(X)
g(0) -> s(0)
g(s(X)) -> s(s(g(X)))
g(X) -> n_{_g}(X)
sel(0, cons(X, Y)) -> X
sel(s(X), cons(Y, Z)) -> sel(X, activate(Z))
activate(n_{_f}(X)) -> f(activate(X))
activate(n_{_g}(X)) -> g(activate(X))
activate(X) -> X

Strategy:

innermost

The following dependency pair can be strictly oriented:

G(s(X)) -> G(X)

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:

G(x₁) -> G(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:

f(X) -> cons(X, n_{_f}(n_{_g}(X)))
f(X) -> n_{_f}(X)
g(0) -> s(0)
g(s(X)) -> s(s(g(X)))
g(X) -> n_{_g}(X)
sel(0, cons(X, Y)) -> X
sel(s(X), cons(Y, Z)) -> sel(X, activate(Z))
activate(n_{_f}(X)) -> f(activate(X))
activate(n_{_g}(X)) -> g(activate(X))
activate(X) -> X

Strategy:

innermost

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 Pairs:

ACTIVATE(n_{_g}(X)) -> ACTIVATE(X)
ACTIVATE(n_{_f}(X)) -> ACTIVATE(X)

Rules:

f(X) -> cons(X, n_{_f}(n_{_g}(X)))
f(X) -> n_{_f}(X)
g(0) -> s(0)
g(s(X)) -> s(s(g(X)))
g(X) -> n_{_g}(X)
sel(0, cons(X, Y)) -> X
sel(s(X), cons(Y, Z)) -> sel(X, activate(Z))
activate(n_{_f}(X)) -> f(activate(X))
activate(n_{_g}(X)) -> g(activate(X))
activate(X) -> X

Strategy:

innermost

The following dependency pairs can be strictly oriented:

ACTIVATE(n_{_g}(X)) -> ACTIVATE(X)
ACTIVATE(n_{_f}(X)) -> ACTIVATE(X)

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:

ACTIVATE(x₁) -> ACTIVATE(x₁)
n_{_g}(x₁) -> n_{_g}(x₁)
n_{_f}(x₁) -> n_{_f}(x₁)

     ↳DPs

       →DP Problem 1

         ↳AFS

       →DP Problem 2

         ↳AFS

           →DP Problem 5

             ↳Dependency Graph

       →DP Problem 3

         ↳AFS

Dependency Pair:

Rules:

f(X) -> cons(X, n_{_f}(n_{_g}(X)))
f(X) -> n_{_f}(X)
g(0) -> s(0)
g(s(X)) -> s(s(g(X)))
g(X) -> n_{_g}(X)
sel(0, cons(X, Y)) -> X
sel(s(X), cons(Y, Z)) -> sel(X, activate(Z))
activate(n_{_f}(X)) -> f(activate(X))
activate(n_{_g}(X)) -> g(activate(X))
activate(X) -> X

Strategy:

innermost

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:

SEL(s(X), cons(Y, Z)) -> SEL(X, activate(Z))

Rules:

f(X) -> cons(X, n_{_f}(n_{_g}(X)))
f(X) -> n_{_f}(X)
g(0) -> s(0)
g(s(X)) -> s(s(g(X)))
g(X) -> n_{_g}(X)
sel(0, cons(X, Y)) -> X
sel(s(X), cons(Y, Z)) -> sel(X, activate(Z))
activate(n_{_f}(X)) -> f(activate(X))
activate(n_{_g}(X)) -> g(activate(X))
activate(X) -> X

Strategy:

innermost

The following dependency pair can be strictly oriented:

SEL(s(X), cons(Y, Z)) -> SEL(X, activate(Z))

The following usable rules for innermost can be oriented:

activate(n_{_f}(X)) -> f(activate(X))
activate(n_{_g}(X)) -> g(activate(X))
activate(X) -> X
f(X) -> cons(X, n_{_f}(n_{_g}(X)))
f(X) -> n_{_f}(X)
g(0) -> s(0)
g(s(X)) -> s(s(g(X)))
g(X) -> n_{_g}(X)

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

SEL > activate > f > n_{_f}
SEL > activate > f > cons
SEL > activate > f > n_{_g}
SEL > activate > g > n_{_g}
SEL > activate > g > s

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

SEL(x₁, x₂) -> SEL(x₁, x₂)
s(x₁) -> s(x₁)
cons(x₁, x₂) -> cons(x₁, x₂)
activate(x₁) -> activate(x₁)
n_{_f}(x₁) -> n_{_f}(x₁)
f(x₁) -> f(x₁)
n_{_g}(x₁) -> n_{_g}(x₁)
g(x₁) -> g(x₁)

     ↳DPs

       →DP Problem 1

         ↳AFS

       →DP Problem 2

         ↳AFS

       →DP Problem 3

         ↳AFS

           →DP Problem 6

             ↳Dependency Graph

Dependency Pair:

Rules:

f(X) -> cons(X, n_{_f}(n_{_g}(X)))
f(X) -> n_{_f}(X)
g(0) -> s(0)
g(s(X)) -> s(s(g(X)))
g(X) -> n_{_g}(X)
sel(0, cons(X, Y)) -> X
sel(s(X), cons(Y, Z)) -> sel(X, activate(Z))
activate(n_{_f}(X)) -> f(activate(X))
activate(n_{_g}(X)) -> g(activate(X))
activate(X) -> X

Strategy:

innermost

Using the Dependency Graph resulted in no new DP problems.

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