Certification Problem
Input (TPDB TRS_Standard/Strategy_removed_AG01/#4.18)
The rewrite relation of the following TRS is considered.
|
a(b(a(b(x)))) |
→ |
b(a(b(a(a(b(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(a(b(a(b(x10)))))) |
|
→
|
b(a(b(a(a(b(a(b(x10)))))))) |
|
→
|
b(a(b(a(b(a(b(a(a(b(x10)))))))))) |
|
= |
t2
|
where t2 =
C[t0σ]
and
σ =
{x10/a(a(b(x10)))}
and
C = b(☐)