Certification Problem
Input (TPDB TRS_Outermost/Strategy_outermost_added_08/ttt2)
The rewrite relation of the following TRS is considered.
|
+(1,x) |
→ |
+(+(0,1),x) |
(1) |
|
+(0,x) |
→ |
x |
(2) |
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
|
= |
+(+(0,1),x) |
|
→
|
+(1,x) |
|
→
|
+(+(0,1),x) |
|
= |
t2
|
where t2 =
t0