Certification Problem
Input (TPDB TRS_Standard/Transformed_CSR_04/Ex14_AEGL02_L)
The rewrite relation of the following TRS is considered.
|
from(X) |
→ |
cons(X) |
(1) |
| length |
→ |
0 |
(2) |
| length |
→ |
s(length1) |
(3) |
| length1 |
→ |
length |
(4) |
Property / Task
Prove or disprove termination.Answer / Result
No.Proof (by ttt2 @ termCOMP 2023)
1 Loop
The following loop proves nontermination.
| t0
|
= |
length |
|
→
|
s(length1) |
|
→
|
s(length) |
|
= |
t2
|
where t2 =
C[t0]
and
C = s(☐)