Certification Problem
Input (TPDB TRS_Standard/Strategy_removed_mixed_05/ex2)
The rewrite relation of the following TRS is considered.
|
cons(x,cons(y,z)) |
→ |
big |
(1) |
|
inf(x) |
→ |
cons(x,inf(s(x))) |
(2) |
Property / Task
Prove or disprove termination.Answer / Result
No.Proof (by ttt2 @ termCOMP 2023)
1 Loop
The following loop proves nontermination.
| t0
|
= |
inf(x) |
|
→
|
cons(x,inf(s(x))) |
|
= |
t1
|
where t1 =
C[t0σ]
and
σ =
{x/s(x)}
and
C = cons(x,☐)