Certification Problem
Input (TPDB TRS_Outermost/Strategy_outermost_added_08/LISTUTILITIES_complete-noand_L)
The rewrite relation of the following TRS is considered.
There are 149 ruless (increase limit for explicit display).
The evaluation strategy is outermostProperty / Task
Prove or disprove termination.Answer / Result
No.Proof (by AProVE @ termCOMP 2023)
1 Loop
The following loop proves nontermination.
| t0
|
= |
U14(tt) |
|
→
|
snd(splitAt(U14(tt),U14(tt))) |
|
= |
t1
|
where t1 =
C[t0]
and
C = snd(splitAt(☐,U14(tt)))