The rewrite relation of the following TRS is considered.
| U11(tt) | → | s(length(L)) | (1) |
| and(tt) | → | X | (2) |
| zeros | → | cons(0) | (3) |
| isNat | → | tt | (4) |
| isNat | → | isNatList | (5) |
| isNat | → | isNat | (6) |
| isNatIList | → | isNatList | (7) |
| isNatIList | → | tt | (8) |
| isNatIList | → | and(isNat) | (9) |
| isNatList | → | tt | (10) |
| isNatList | → | and(isNat) | (11) |
| length(nil) | → | 0 | (12) |
| length(cons(N)) | → | U11(and(isNatList)) | (13) |
The TRS violates one of the two variable conditions. Thus, it is not terminating.