Certification Problem
Input (TPDB TRS_Outermost/Strategy_outermost_added_08/muladd)
The rewrite relation of the following TRS is considered.
|
*(X,+(Y,1)) |
→ |
+(*(X,+(Y,*(1,0))),X) |
(1) |
|
*(X,1) |
→ |
X |
(2) |
|
*(X,0) |
→ |
X |
(3) |
|
*(X,0) |
→ |
0 |
(4) |
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
|
= |
*(X,+(Y,*(1,0))) |
|
→
|
*(X,+(Y,1)) |
|
→
|
+(*(X,+(Y,*(1,0))),X) |
|
= |
t2
|
where t2 =
C[t0]
and
C = +(☐,X)