Certification Problem
Input (TPDB TRS_Outermost/Strategy_outermost_added_08/Ex24_GM04_L)
The rewrite relation of the following TRS is considered.
| f |
→ |
f |
(1) |
|
g(b) |
→ |
c |
(2) |
| b |
→ |
c |
(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.
where t1 =
t0