Certification Problem
Input (TPDB TRS_Outermost/Strategy_outermost_added_08/Ex4_7_56_Bor03)
The rewrite relation of the following TRS is considered.
|
from(X) |
→ |
cons(X,from(s(X))) |
(1) |
|
after(0,XS) |
→ |
XS |
(2) |
|
after(s(N),cons(X,XS)) |
→ |
after(N,XS) |
(3) |
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
|
= |
from(X) |
|
→
|
cons(X,from(s(X))) |
|
= |
t1
|
where t1 =
C[t0σ]
and
σ =
{X/s(X)}
and
C = cons(X,☐)