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