Certification Problem

Input (COPS 709)

We consider the TRS containing the following rules:

b → c (1)
a → a (2)

The underlying signature is as follows:

{b/0, c/0, a/0}

Property / Task

Prove or disprove confluence.

Answer / Result

Yes.

Proof (by ACP @ CoCo 2020)

1 Strongly closed

Confluence is proven since the TRS is strongly closed. The joins can be performed using 0 step(s).