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