Certification Problem
Input (COPS 940)
We consider the TRS containing the following rules:
|
a(a(b(a(b(a(b(a(b(x))))))))) |
→ |
a(b(a(b(a(b(a(b(a(a(a(a(a(b(x)))))))))))))) |
(1) |
The underlying signature is as follows:
{a/1, b/1}Property / Task
Prove or disprove confluence.Answer / Result
Yes.Proof (by ACP @ CoCo 2021)
1 Strongly closed
Confluence is proven since the TRS is strongly closed.
The joins can be performed using
0
step(s).