Certification Problem
Input (TPDB TRS_Outermost/Strategy_outermost_added_08/Ex5_Zan97_L)
The rewrite relation of the following TRS is considered.
|
if(false,X) |
→ |
Y |
(1) |
|
f(X) |
→ |
if(X,c) |
(2) |
|
if(true,X) |
→ |
X |
(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
|
= |
if(false,X) |
|
→
|
if(false,X) |
|
= |
t1
|
where t1 =
t0