Certification Problem
Input (TPDB TRS_Standard/Kaliszyk_19/not_3258)
The rewrite relation of the following TRS is considered.
There are 4004 ruless (increase limit for explicit display).
Property / Task
Prove or disprove termination.Answer / Result
No.Proof (by ttt2 @ termCOMP 2023)
1 Loop
The following loop proves nontermination.
| t0
|
= |
iapply(iapply(realu_add,m),n) |
|
→
|
iapply(iapply(realu_add,n),m) |
|
= |
t1
|
where t1 =
t0σ
and
σ =
{m/n, n/m}