Term Rewriting System R:
[x, y, z]
double(0) -> 0
double(s(x)) -> s(s(double(x)))
half(0) -> 0
half(s(0)) -> 0
half(s(s(x))) -> s(half(x))
half(double(x)) -> x
-(x, 0) -> x
-(s(x), s(y)) -> -(x, y)
if(0, y, z) -> y
if(s(x), y, z) -> z

Termination of R to be shown.

`   R`
`     ↳Dependency Pair Analysis`

R contains the following Dependency Pairs:

DOUBLE(s(x)) -> DOUBLE(x)
HALF(s(s(x))) -> HALF(x)
-'(s(x), s(y)) -> -'(x, y)

Furthermore, R contains three SCCs.

`   R`
`     ↳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:

DOUBLE(s(x)) -> DOUBLE(x)

Rules:

double(0) -> 0
double(s(x)) -> s(s(double(x)))
half(0) -> 0
half(s(0)) -> 0
half(s(s(x))) -> s(half(x))
half(double(x)) -> x
-(x, 0) -> x
-(s(x), s(y)) -> -(x, y)
if(0, y, z) -> y
if(s(x), y, z) -> z

• Dependency Pair:

HALF(s(s(x))) -> HALF(x)

Rules:

double(0) -> 0
double(s(x)) -> s(s(double(x)))
half(0) -> 0
half(s(0)) -> 0
half(s(s(x))) -> s(half(x))
half(double(x)) -> x
-(x, 0) -> x
-(s(x), s(y)) -> -(x, y)
if(0, y, z) -> y
if(s(x), y, z) -> z

• Dependency Pair:

-'(s(x), s(y)) -> -'(x, y)

Rules:

double(0) -> 0
double(s(x)) -> s(s(double(x)))
half(0) -> 0
half(s(0)) -> 0
half(s(s(x))) -> s(half(x))
half(double(x)) -> x
-(x, 0) -> x
-(s(x), s(y)) -> -(x, y)
if(0, y, z) -> y
if(s(x), y, z) -> z

`   R`
`     ↳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:

DOUBLE(s(x)) -> DOUBLE(x)

Rules:

double(0) -> 0
double(s(x)) -> s(s(double(x)))
half(0) -> 0
half(s(0)) -> 0
half(s(s(x))) -> s(half(x))
half(double(x)) -> x
-(x, 0) -> x
-(s(x), s(y)) -> -(x, y)
if(0, y, z) -> y
if(s(x), y, z) -> z

• Dependency Pair:

HALF(s(s(x))) -> HALF(x)

Rules:

double(0) -> 0
double(s(x)) -> s(s(double(x)))
half(0) -> 0
half(s(0)) -> 0
half(s(s(x))) -> s(half(x))
half(double(x)) -> x
-(x, 0) -> x
-(s(x), s(y)) -> -(x, y)
if(0, y, z) -> y
if(s(x), y, z) -> z

• Dependency Pair:

-'(s(x), s(y)) -> -'(x, y)

Rules:

double(0) -> 0
double(s(x)) -> s(s(double(x)))
half(0) -> 0
half(s(0)) -> 0
half(s(s(x))) -> s(half(x))
half(double(x)) -> x
-(x, 0) -> x
-(s(x), s(y)) -> -(x, y)
if(0, y, z) -> y
if(s(x), y, z) -> z

`   R`
`     ↳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:

DOUBLE(s(x)) -> DOUBLE(x)

Rules:

double(0) -> 0
double(s(x)) -> s(s(double(x)))
half(0) -> 0
half(s(0)) -> 0
half(s(s(x))) -> s(half(x))
half(double(x)) -> x
-(x, 0) -> x
-(s(x), s(y)) -> -(x, y)
if(0, y, z) -> y
if(s(x), y, z) -> z

• Dependency Pair:

HALF(s(s(x))) -> HALF(x)

Rules:

double(0) -> 0
double(s(x)) -> s(s(double(x)))
half(0) -> 0
half(s(0)) -> 0
half(s(s(x))) -> s(half(x))
half(double(x)) -> x
-(x, 0) -> x
-(s(x), s(y)) -> -(x, y)
if(0, y, z) -> y
if(s(x), y, z) -> z

• Dependency Pair:

-'(s(x), s(y)) -> -'(x, y)

Rules:

double(0) -> 0
double(s(x)) -> s(s(double(x)))
half(0) -> 0
half(s(0)) -> 0
half(s(s(x))) -> s(half(x))
half(double(x)) -> x
-(x, 0) -> x
-(s(x), s(y)) -> -(x, y)
if(0, y, z) -> y
if(s(x), y, z) -> z

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