Termination Proof using AProVE

Term Rewriting System R:
[X, Y, X1, X2]
fact(X) -> if(zero(X), n_{_s}(n_₀), n_{_prod}(X, n_{_fact}(n_{_p}(X))))
fact(X) -> n_{_fact}(X)
add(0, X) -> X
add(s(X), Y) -> s(add(X, Y))
prod(0, X) -> 0
prod(s(X), Y) -> add(Y, prod(X, Y))
prod(X1, X2) -> n_{_prod}(X1, X2)
if(true, X, Y) -> activate(X)
if(false, X, Y) -> activate(Y)
zero(0) -> true
zero(s(X)) -> false
p(s(X)) -> X
p(X) -> n_{_p}(X)
s(X) -> n_{_s}(X)
0 -> n_₀
activate(n_{_s}(X)) -> s(activate(X))
activate(n_₀) -> 0
activate(n_{_prod}(X1, X2)) -> prod(activate(X1), activate(X2))
activate(n_{_fact}(X)) -> fact(activate(X))
activate(n_{_p}(X)) -> p(activate(X))
activate(X) -> X

Termination of R to be shown.

     ↳Dependency Pair Analysis

R contains the following Dependency Pairs:

FACT(X) -> IF(zero(X), n_{_s}(n_₀), n_{_prod}(X, n_{_fact}(n_{_p}(X))))
FACT(X) -> ZERO(X)
ADD(s(X), Y) -> S(add(X, Y))
ADD(s(X), Y) -> ADD(X, Y)
PROD(s(X), Y) -> ADD(Y, prod(X, Y))
PROD(s(X), Y) -> PROD(X, Y)
IF(true, X, Y) -> ACTIVATE(X)
IF(false, X, Y) -> ACTIVATE(Y)
ACTIVATE(n_{_s}(X)) -> S(activate(X))
ACTIVATE(n_{_s}(X)) -> ACTIVATE(X)
ACTIVATE(n_₀) -> 0'
ACTIVATE(n_{_prod}(X1, X2)) -> PROD(activate(X1), activate(X2))
ACTIVATE(n_{_prod}(X1, X2)) -> ACTIVATE(X1)
ACTIVATE(n_{_prod}(X1, X2)) -> ACTIVATE(X2)
ACTIVATE(n_{_fact}(X)) -> FACT(activate(X))
ACTIVATE(n_{_fact}(X)) -> ACTIVATE(X)
ACTIVATE(n_{_p}(X)) -> P(activate(X))
ACTIVATE(n_{_p}(X)) -> ACTIVATE(X)

Furthermore, R contains three SCCs.

     ↳DPs

       →DP Problem 1

         ↳Argument Filtering and Ordering

       →DP Problem 2

         ↳AFS

       →DP Problem 3

         ↳Remaining

Dependency Pair:

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

Rules:

fact(X) -> if(zero(X), n_{_s}(n_₀), n_{_prod}(X, n_{_fact}(n_{_p}(X))))
fact(X) -> n_{_fact}(X)
add(0, X) -> X
add(s(X), Y) -> s(add(X, Y))
prod(0, X) -> 0
prod(s(X), Y) -> add(Y, prod(X, Y))
prod(X1, X2) -> n_{_prod}(X1, X2)
if(true, X, Y) -> activate(X)
if(false, X, Y) -> activate(Y)
zero(0) -> true
zero(s(X)) -> false
p(s(X)) -> X
p(X) -> n_{_p}(X)
s(X) -> n_{_s}(X)
0 -> n_₀
activate(n_{_s}(X)) -> s(activate(X))
activate(n_₀) -> 0
activate(n_{_prod}(X1, X2)) -> prod(activate(X1), activate(X2))
activate(n_{_fact}(X)) -> fact(activate(X))
activate(n_{_p}(X)) -> p(activate(X))
activate(X) -> X

The following dependency pair can be strictly oriented:

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

There are no usable rules using the Ce-refinement that need to be oriented.
Used ordering: Homeomorphic Embedding Order with EMB
resulting in one new DP problem.
Used Argument Filtering System:

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

     ↳DPs

       →DP Problem 1

         ↳AFS

           →DP Problem 4

             ↳Dependency Graph

       →DP Problem 2

         ↳AFS

       →DP Problem 3

         ↳Remaining

Dependency Pair:

Rules:

fact(X) -> if(zero(X), n_{_s}(n_₀), n_{_prod}(X, n_{_fact}(n_{_p}(X))))
fact(X) -> n_{_fact}(X)
add(0, X) -> X
add(s(X), Y) -> s(add(X, Y))
prod(0, X) -> 0
prod(s(X), Y) -> add(Y, prod(X, Y))
prod(X1, X2) -> n_{_prod}(X1, X2)
if(true, X, Y) -> activate(X)
if(false, X, Y) -> activate(Y)
zero(0) -> true
zero(s(X)) -> false
p(s(X)) -> X
p(X) -> n_{_p}(X)
s(X) -> n_{_s}(X)
0 -> n_₀
activate(n_{_s}(X)) -> s(activate(X))
activate(n_₀) -> 0
activate(n_{_prod}(X1, X2)) -> prod(activate(X1), activate(X2))
activate(n_{_fact}(X)) -> fact(activate(X))
activate(n_{_p}(X)) -> p(activate(X))
activate(X) -> X

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

         ↳Remaining

Dependency Pair:

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

Rules:

fact(X) -> if(zero(X), n_{_s}(n_₀), n_{_prod}(X, n_{_fact}(n_{_p}(X))))
fact(X) -> n_{_fact}(X)
add(0, X) -> X
add(s(X), Y) -> s(add(X, Y))
prod(0, X) -> 0
prod(s(X), Y) -> add(Y, prod(X, Y))
prod(X1, X2) -> n_{_prod}(X1, X2)
if(true, X, Y) -> activate(X)
if(false, X, Y) -> activate(Y)
zero(0) -> true
zero(s(X)) -> false
p(s(X)) -> X
p(X) -> n_{_p}(X)
s(X) -> n_{_s}(X)
0 -> n_₀
activate(n_{_s}(X)) -> s(activate(X))
activate(n_₀) -> 0
activate(n_{_prod}(X1, X2)) -> prod(activate(X1), activate(X2))
activate(n_{_fact}(X)) -> fact(activate(X))
activate(n_{_p}(X)) -> p(activate(X))
activate(X) -> X

The following dependency pair can be strictly oriented:

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

There are no usable rules using the Ce-refinement that need to be oriented.
Used ordering: Homeomorphic Embedding Order with EMB
resulting in one new DP problem.
Used Argument Filtering System:

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

     ↳DPs

       →DP Problem 1

         ↳AFS

       →DP Problem 2

         ↳AFS

           →DP Problem 5

             ↳Dependency Graph

       →DP Problem 3

         ↳Remaining

Dependency Pair:

Rules:

fact(X) -> if(zero(X), n_{_s}(n_₀), n_{_prod}(X, n_{_fact}(n_{_p}(X))))
fact(X) -> n_{_fact}(X)
add(0, X) -> X
add(s(X), Y) -> s(add(X, Y))
prod(0, X) -> 0
prod(s(X), Y) -> add(Y, prod(X, Y))
prod(X1, X2) -> n_{_prod}(X1, X2)
if(true, X, Y) -> activate(X)
if(false, X, Y) -> activate(Y)
zero(0) -> true
zero(s(X)) -> false
p(s(X)) -> X
p(X) -> n_{_p}(X)
s(X) -> n_{_s}(X)
0 -> n_₀
activate(n_{_s}(X)) -> s(activate(X))
activate(n_₀) -> 0
activate(n_{_prod}(X1, X2)) -> prod(activate(X1), activate(X2))
activate(n_{_fact}(X)) -> fact(activate(X))
activate(n_{_p}(X)) -> p(activate(X))
activate(X) -> X

Using the Dependency Graph resulted in no new DP problems.

     ↳DPs

       →DP Problem 1

         ↳AFS

       →DP Problem 2

         ↳AFS

       →DP Problem 3

         ↳Remaining Obligation(s)

The following remains to be proven:
Dependency Pairs:

IF(false, X, Y) -> ACTIVATE(Y)
ACTIVATE(n_{_p}(X)) -> ACTIVATE(X)
ACTIVATE(n_{_fact}(X)) -> ACTIVATE(X)
ACTIVATE(n_{_fact}(X)) -> FACT(activate(X))
ACTIVATE(n_{_prod}(X1, X2)) -> ACTIVATE(X2)
ACTIVATE(n_{_prod}(X1, X2)) -> ACTIVATE(X1)
ACTIVATE(n_{_s}(X)) -> ACTIVATE(X)
IF(true, X, Y) -> ACTIVATE(X)
FACT(X) -> IF(zero(X), n_{_s}(n_₀), n_{_prod}(X, n_{_fact}(n_{_p}(X))))

Rules:

fact(X) -> if(zero(X), n_{_s}(n_₀), n_{_prod}(X, n_{_fact}(n_{_p}(X))))
fact(X) -> n_{_fact}(X)
add(0, X) -> X
add(s(X), Y) -> s(add(X, Y))
prod(0, X) -> 0
prod(s(X), Y) -> add(Y, prod(X, Y))
prod(X1, X2) -> n_{_prod}(X1, X2)
if(true, X, Y) -> activate(X)
if(false, X, Y) -> activate(Y)
zero(0) -> true
zero(s(X)) -> false
p(s(X)) -> X
p(X) -> n_{_p}(X)
s(X) -> n_{_s}(X)
0 -> n_₀
activate(n_{_s}(X)) -> s(activate(X))
activate(n_₀) -> 0
activate(n_{_prod}(X1, X2)) -> prod(activate(X1), activate(X2))
activate(n_{_fact}(X)) -> fact(activate(X))
activate(n_{_p}(X)) -> p(activate(X))
activate(X) -> X

Termination of R could not be shown.
Duration:
0:01 minutes