Certification Problem
Input (TPDB TRS_Outermost/Strategy_outermost_added_08/Ex7_BLR02_L)
The rewrite relation of the following TRS is considered.
|
2nd(cons(X)) |
→ |
head(XS) |
(1) |
|
sel(s(N),cons(X)) |
→ |
sel(N,XS) |
(2) |
|
from(X) |
→ |
cons(X) |
(3) |
|
head(cons(X)) |
→ |
X |
(4) |
|
take(0,XS) |
→ |
nil |
(5) |
|
take(s(N),cons(X)) |
→ |
cons(X) |
(6) |
|
sel(0,cons(X)) |
→ |
X |
(7) |
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
|
= |
2nd(cons(X)) |
|
→
|
head(2nd(cons(X))) |
|
= |
t1
|
where t1 =
C[t0]
and
C = head(☐)