Certification Problem
Input (TPDB TRS_Outermost/Strategy_outermost_added_08/Ex4_7_77_Bor03)
The rewrite relation of the following TRS is considered.
| zeros |
→ |
cons(0,zeros) |
(1) |
|
tail(cons(X,XS)) |
→ |
XS |
(2) |
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
|
= |
zeros |
|
→
|
cons(0,zeros) |
|
= |
t1
|
where t1 =
C[t0]
and
C = cons(0,☐)