Term Rewriting System R:
[x, y, z, u, v]
if(true, x, y) -> x
if(false, x, y) -> y
if(x, y, y) -> y
if(if(x, y, z), u, v) -> if(x, if(y, u, v), if(z, u, v))
if(x, if(x, y, z), z) -> if(x, y, z)
if(x, y, if(x, y, z)) -> if(x, y, z)

Termination of R to be shown. 



   R
     ↳Dependency Pair Analysis



R contains the following Dependency Pairs:

IF(if(x, y, z), u, v) -> IF(x, if(y, u, v), if(z, u, v))
IF(if(x, y, z), u, v) -> IF(y, u, v)
IF(if(x, y, z), u, v) -> IF(z, u, v)

Furthermore, R contains one SCC. 


   R
     ↳DPs
       →DP Problem 1
         ↳Remaining Obligation(s)




The following remains to be proven:
Dependency Pairs:

IF(if(x, y, z), u, v) -> IF(z, u, v)
IF(if(x, y, z), u, v) -> IF(y, u, v)
IF(if(x, y, z), u, v) -> IF(x, if(y, u, v), if(z, u, v))


Rules:


if(true, x, y) -> x
if(false, x, y) -> y
if(x, y, y) -> y
if(if(x, y, z), u, v) -> if(x, if(y, u, v), if(z, u, v))
if(x, if(x, y, z), z) -> if(x, y, z)
if(x, y, if(x, y, z)) -> if(x, y, z)




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