Certification Problem

Input (COPS 941)

We consider the TRS containing the following rules:

b(b(c(a(b(c(x)))))) a(b(b(c(b(c(a(x))))))) (1)

The underlying signature is as follows:

{b/1, c/1, a/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).