Certification Problem
Input (TPDB TRS_Standard/SK90/4.34)
The rewrite relation of the following TRS is considered.
|
a(b(x)) |
→ |
b(b(a(a(x)))) |
(1) |
Property / Task
Prove or disprove termination.Answer / Result
No.Proof (by ttt2 @ termCOMP 2023)
1 Loop
The following loop proves nontermination.
| t0
|
= |
a(b(b(x8))) |
|
→
|
b(b(a(a(b(x8))))) |
|
→
|
b(b(a(b(b(a(a(x8))))))) |
|
= |
t2
|
where t2 =
C[t0σ]
and
σ =
{x8/a(a(x8))}
and
C = b(b(☐))