Certification Problem
Input (TPDB TRS_Standard/Strategy_removed_CSR_05/Ex5_Zan97)
The rewrite relation of the following TRS is considered.
f(X) |
→ |
if(X,c,f(true)) |
(1) |
if(true,X,Y) |
→ |
X |
(2) |
if(false,X,Y) |
→ |
Y |
(3) |
Property / Task
Prove or disprove termination.Answer / Result
No.Proof (by ttt2 @ termCOMP 2023)
1 Loop
The following loop proves nontermination.
t0
|
= |
f(X) |
|
→
|
if(X,c,f(true)) |
|
= |
t1
|
where t1 =
C[t0σ]
and
σ =
{X/true}
and
C = if(X,c,☐)