Termination Proof using AProVE

Term Rewriting System R:
[y, x, z]
minus_active(0, y) -> 0
minus_active(s(x), s(y)) -> minus_active(x, y)
minus_active(x, y) -> minus(x, y)
mark(0) -> 0
mark(s(x)) -> s(mark(x))
mark(minus(x, y)) -> minus_active(x, y)
mark(ge(x, y)) -> ge_active(x, y)
mark(div(x, y)) -> div_active(mark(x), y)
mark(if(x, y, z)) -> if_active(mark(x), y, z)
ge_active(x, 0) -> true
ge_active(0, s(y)) -> false
ge_active(s(x), s(y)) -> ge_active(x, y)
ge_active(x, y) -> ge(x, y)
div_active(0, s(y)) -> 0
div_active(s(x), s(y)) -> if_active(ge_active(x, y), s(div(minus(x, y), s(y))), 0)
div_active(x, y) -> div(x, y)
if_active(true, x, y) -> mark(x)
if_active(false, x, y) -> mark(y)
if_active(x, y, z) -> if(x, y, z)

Termination of R to be shown.

     ↳Dependency Pair Analysis

R contains the following Dependency Pairs:

MINUS_ACTIVE(s(x), s(y)) -> MINUS_ACTIVE(x, y)
MARK(s(x)) -> MARK(x)
MARK(minus(x, y)) -> MINUS_ACTIVE(x, y)
MARK(ge(x, y)) -> GE_ACTIVE(x, y)
MARK(div(x, y)) -> DIV_ACTIVE(mark(x), y)
MARK(div(x, y)) -> MARK(x)
MARK(if(x, y, z)) -> IF_ACTIVE(mark(x), y, z)
MARK(if(x, y, z)) -> MARK(x)
GE_ACTIVE(s(x), s(y)) -> GE_ACTIVE(x, y)
DIV_ACTIVE(s(x), s(y)) -> IF_ACTIVE(ge_active(x, y), s(div(minus(x, y), s(y))), 0)
DIV_ACTIVE(s(x), s(y)) -> GE_ACTIVE(x, y)
IF_ACTIVE(true, x, y) -> MARK(x)
IF_ACTIVE(false, x, y) -> MARK(y)

Furthermore, R contains three SCCs.

     ↳DPs

       →DP Problem 1

         ↳Remaining Obligation(s)

       →DP Problem 2

         ↳Remaining Obligation(s)

       →DP Problem 3

         ↳Remaining Obligation(s)

The following remains to be proven:

Dependency Pair:
MINUS_ACTIVE(s(x), s(y)) -> MINUS_ACTIVE(x, y)

Rules:

minus_active(0, y) -> 0
minus_active(s(x), s(y)) -> minus_active(x, y)
minus_active(x, y) -> minus(x, y)
mark(0) -> 0
mark(s(x)) -> s(mark(x))
mark(minus(x, y)) -> minus_active(x, y)
mark(ge(x, y)) -> ge_active(x, y)
mark(div(x, y)) -> div_active(mark(x), y)
mark(if(x, y, z)) -> if_active(mark(x), y, z)
ge_active(x, 0) -> true
ge_active(0, s(y)) -> false
ge_active(s(x), s(y)) -> ge_active(x, y)
ge_active(x, y) -> ge(x, y)
div_active(0, s(y)) -> 0
div_active(s(x), s(y)) -> if_active(ge_active(x, y), s(div(minus(x, y), s(y))), 0)
div_active(x, y) -> div(x, y)
if_active(true, x, y) -> mark(x)
if_active(false, x, y) -> mark(y)
if_active(x, y, z) -> if(x, y, z)
Dependency Pair:
GE_ACTIVE(s(x), s(y)) -> GE_ACTIVE(x, y)

Rules:

minus_active(0, y) -> 0
minus_active(s(x), s(y)) -> minus_active(x, y)
minus_active(x, y) -> minus(x, y)
mark(0) -> 0
mark(s(x)) -> s(mark(x))
mark(minus(x, y)) -> minus_active(x, y)
mark(ge(x, y)) -> ge_active(x, y)
mark(div(x, y)) -> div_active(mark(x), y)
mark(if(x, y, z)) -> if_active(mark(x), y, z)
ge_active(x, 0) -> true
ge_active(0, s(y)) -> false
ge_active(s(x), s(y)) -> ge_active(x, y)
ge_active(x, y) -> ge(x, y)
div_active(0, s(y)) -> 0
div_active(s(x), s(y)) -> if_active(ge_active(x, y), s(div(minus(x, y), s(y))), 0)
div_active(x, y) -> div(x, y)
if_active(true, x, y) -> mark(x)
if_active(false, x, y) -> mark(y)
if_active(x, y, z) -> if(x, y, z)
Dependency Pairs:
MARK(if(x, y, z)) -> MARK(x)
IF_ACTIVE(false, x, y) -> MARK(y)
MARK(if(x, y, z)) -> IF_ACTIVE(mark(x), y, z)
MARK(div(x, y)) -> MARK(x)
IF_ACTIVE(true, x, y) -> MARK(x)
DIV_ACTIVE(s(x), s(y)) -> IF_ACTIVE(ge_active(x, y), s(div(minus(x, y), s(y))), 0)
MARK(div(x, y)) -> DIV_ACTIVE(mark(x), y)
MARK(s(x)) -> MARK(x)

Rules:

minus_active(0, y) -> 0
minus_active(s(x), s(y)) -> minus_active(x, y)
minus_active(x, y) -> minus(x, y)
mark(0) -> 0
mark(s(x)) -> s(mark(x))
mark(minus(x, y)) -> minus_active(x, y)
mark(ge(x, y)) -> ge_active(x, y)
mark(div(x, y)) -> div_active(mark(x), y)
mark(if(x, y, z)) -> if_active(mark(x), y, z)
ge_active(x, 0) -> true
ge_active(0, s(y)) -> false
ge_active(s(x), s(y)) -> ge_active(x, y)
ge_active(x, y) -> ge(x, y)
div_active(0, s(y)) -> 0
div_active(s(x), s(y)) -> if_active(ge_active(x, y), s(div(minus(x, y), s(y))), 0)
div_active(x, y) -> div(x, y)
if_active(true, x, y) -> mark(x)
if_active(false, x, y) -> mark(y)
if_active(x, y, z) -> if(x, y, z)

     ↳DPs

       →DP Problem 1

         ↳Remaining Obligation(s)

       →DP Problem 2

         ↳Remaining Obligation(s)

       →DP Problem 3

         ↳Remaining Obligation(s)

The following remains to be proven:

Dependency Pair:
MINUS_ACTIVE(s(x), s(y)) -> MINUS_ACTIVE(x, y)

Rules:

minus_active(0, y) -> 0
minus_active(s(x), s(y)) -> minus_active(x, y)
minus_active(x, y) -> minus(x, y)
mark(0) -> 0
mark(s(x)) -> s(mark(x))
mark(minus(x, y)) -> minus_active(x, y)
mark(ge(x, y)) -> ge_active(x, y)
mark(div(x, y)) -> div_active(mark(x), y)
mark(if(x, y, z)) -> if_active(mark(x), y, z)
ge_active(x, 0) -> true
ge_active(0, s(y)) -> false
ge_active(s(x), s(y)) -> ge_active(x, y)
ge_active(x, y) -> ge(x, y)
div_active(0, s(y)) -> 0
div_active(s(x), s(y)) -> if_active(ge_active(x, y), s(div(minus(x, y), s(y))), 0)
div_active(x, y) -> div(x, y)
if_active(true, x, y) -> mark(x)
if_active(false, x, y) -> mark(y)
if_active(x, y, z) -> if(x, y, z)
Dependency Pair:
GE_ACTIVE(s(x), s(y)) -> GE_ACTIVE(x, y)

Rules:

minus_active(0, y) -> 0
minus_active(s(x), s(y)) -> minus_active(x, y)
minus_active(x, y) -> minus(x, y)
mark(0) -> 0
mark(s(x)) -> s(mark(x))
mark(minus(x, y)) -> minus_active(x, y)
mark(ge(x, y)) -> ge_active(x, y)
mark(div(x, y)) -> div_active(mark(x), y)
mark(if(x, y, z)) -> if_active(mark(x), y, z)
ge_active(x, 0) -> true
ge_active(0, s(y)) -> false
ge_active(s(x), s(y)) -> ge_active(x, y)
ge_active(x, y) -> ge(x, y)
div_active(0, s(y)) -> 0
div_active(s(x), s(y)) -> if_active(ge_active(x, y), s(div(minus(x, y), s(y))), 0)
div_active(x, y) -> div(x, y)
if_active(true, x, y) -> mark(x)
if_active(false, x, y) -> mark(y)
if_active(x, y, z) -> if(x, y, z)
Dependency Pairs:
MARK(if(x, y, z)) -> MARK(x)
IF_ACTIVE(false, x, y) -> MARK(y)
MARK(if(x, y, z)) -> IF_ACTIVE(mark(x), y, z)
MARK(div(x, y)) -> MARK(x)
IF_ACTIVE(true, x, y) -> MARK(x)
DIV_ACTIVE(s(x), s(y)) -> IF_ACTIVE(ge_active(x, y), s(div(minus(x, y), s(y))), 0)
MARK(div(x, y)) -> DIV_ACTIVE(mark(x), y)
MARK(s(x)) -> MARK(x)

Rules:

minus_active(0, y) -> 0
minus_active(s(x), s(y)) -> minus_active(x, y)
minus_active(x, y) -> minus(x, y)
mark(0) -> 0
mark(s(x)) -> s(mark(x))
mark(minus(x, y)) -> minus_active(x, y)
mark(ge(x, y)) -> ge_active(x, y)
mark(div(x, y)) -> div_active(mark(x), y)
mark(if(x, y, z)) -> if_active(mark(x), y, z)
ge_active(x, 0) -> true
ge_active(0, s(y)) -> false
ge_active(s(x), s(y)) -> ge_active(x, y)
ge_active(x, y) -> ge(x, y)
div_active(0, s(y)) -> 0
div_active(s(x), s(y)) -> if_active(ge_active(x, y), s(div(minus(x, y), s(y))), 0)
div_active(x, y) -> div(x, y)
if_active(true, x, y) -> mark(x)
if_active(false, x, y) -> mark(y)
if_active(x, y, z) -> if(x, y, z)

     ↳DPs

       →DP Problem 1

         ↳Remaining Obligation(s)

       →DP Problem 2

         ↳Remaining Obligation(s)

       →DP Problem 3

         ↳Remaining Obligation(s)

The following remains to be proven:

Dependency Pair:
MINUS_ACTIVE(s(x), s(y)) -> MINUS_ACTIVE(x, y)

Rules:

minus_active(0, y) -> 0
minus_active(s(x), s(y)) -> minus_active(x, y)
minus_active(x, y) -> minus(x, y)
mark(0) -> 0
mark(s(x)) -> s(mark(x))
mark(minus(x, y)) -> minus_active(x, y)
mark(ge(x, y)) -> ge_active(x, y)
mark(div(x, y)) -> div_active(mark(x), y)
mark(if(x, y, z)) -> if_active(mark(x), y, z)
ge_active(x, 0) -> true
ge_active(0, s(y)) -> false
ge_active(s(x), s(y)) -> ge_active(x, y)
ge_active(x, y) -> ge(x, y)
div_active(0, s(y)) -> 0
div_active(s(x), s(y)) -> if_active(ge_active(x, y), s(div(minus(x, y), s(y))), 0)
div_active(x, y) -> div(x, y)
if_active(true, x, y) -> mark(x)
if_active(false, x, y) -> mark(y)
if_active(x, y, z) -> if(x, y, z)
Dependency Pair:
GE_ACTIVE(s(x), s(y)) -> GE_ACTIVE(x, y)

Rules:

minus_active(0, y) -> 0
minus_active(s(x), s(y)) -> minus_active(x, y)
minus_active(x, y) -> minus(x, y)
mark(0) -> 0
mark(s(x)) -> s(mark(x))
mark(minus(x, y)) -> minus_active(x, y)
mark(ge(x, y)) -> ge_active(x, y)
mark(div(x, y)) -> div_active(mark(x), y)
mark(if(x, y, z)) -> if_active(mark(x), y, z)
ge_active(x, 0) -> true
ge_active(0, s(y)) -> false
ge_active(s(x), s(y)) -> ge_active(x, y)
ge_active(x, y) -> ge(x, y)
div_active(0, s(y)) -> 0
div_active(s(x), s(y)) -> if_active(ge_active(x, y), s(div(minus(x, y), s(y))), 0)
div_active(x, y) -> div(x, y)
if_active(true, x, y) -> mark(x)
if_active(false, x, y) -> mark(y)
if_active(x, y, z) -> if(x, y, z)
Dependency Pairs:
MARK(if(x, y, z)) -> MARK(x)
IF_ACTIVE(false, x, y) -> MARK(y)
MARK(if(x, y, z)) -> IF_ACTIVE(mark(x), y, z)
MARK(div(x, y)) -> MARK(x)
IF_ACTIVE(true, x, y) -> MARK(x)
DIV_ACTIVE(s(x), s(y)) -> IF_ACTIVE(ge_active(x, y), s(div(minus(x, y), s(y))), 0)
MARK(div(x, y)) -> DIV_ACTIVE(mark(x), y)
MARK(s(x)) -> MARK(x)

Rules:

minus_active(0, y) -> 0
minus_active(s(x), s(y)) -> minus_active(x, y)
minus_active(x, y) -> minus(x, y)
mark(0) -> 0
mark(s(x)) -> s(mark(x))
mark(minus(x, y)) -> minus_active(x, y)
mark(ge(x, y)) -> ge_active(x, y)
mark(div(x, y)) -> div_active(mark(x), y)
mark(if(x, y, z)) -> if_active(mark(x), y, z)
ge_active(x, 0) -> true
ge_active(0, s(y)) -> false
ge_active(s(x), s(y)) -> ge_active(x, y)
ge_active(x, y) -> ge(x, y)
div_active(0, s(y)) -> 0
div_active(s(x), s(y)) -> if_active(ge_active(x, y), s(div(minus(x, y), s(y))), 0)
div_active(x, y) -> div(x, y)
if_active(true, x, y) -> mark(x)
if_active(false, x, y) -> mark(y)
if_active(x, y, z) -> if(x, y, z)

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