Certification Problem

Input (COPS 803)

We consider the TRS containing the following rules:

g(a,y) y (1)
f(x,a) f(x,g(x,b)) (2)
g(h(x),y) g(x,h(y)) (3)

The underlying signature is as follows:

{g/2, a/0, f/2, b/0, h/1}

Property / Task

Prove or disprove confluence.

Answer / Result

Yes.

Proof (by ACP @ CoCo 2023)

1 Development Closed

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