The rewrite relation of the following TRS is considered.
if(true) | → | X | (1) |
if(false) | → | Y | (2) |
minus | → | 0 | (3) |
minus | → | minus | (4) |
geq | → | true | (5) |
geq | → | false | (6) |
geq | → | geq | (7) |
div(0) | → | 0 | (8) |
div(s(X)) | → | if(geq) | (9) |
The TRS violates one of the two variable conditions. Thus, it is not terminating.