Certification Problem
Input (TPDB TRS_Standard/Transformed_CSR_04/Ex1_GL02a_L)
The rewrite relation of the following TRS is considered.
| eq |
→ |
true |
(1) |
| eq |
→ |
eq |
(2) |
| eq |
→ |
false |
(3) |
|
inf(X) |
→ |
cons |
(4) |
|
take(0,X) |
→ |
nil |
(5) |
|
take(s,cons) |
→ |
cons |
(6) |
|
length(nil) |
→ |
0 |
(7) |
|
length(cons) |
→ |
s |
(8) |
Property / Task
Prove or disprove termination.Answer / Result
No.Proof (by ttt2 @ termCOMP 2023)
1 Loop
The following loop proves nontermination.
where t1 =
t0