Certification Problem

Input (COPS 648)

We consider the TRS containing the following rules:

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

The underlying signature is as follows:

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