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