Certification Problem

Input (COPS 1127)

We consider the TRS containing the following rules:

-(0,x) 0 (1)
-(x,0) x (2)
-(s(x),s(y)) -(x,y) (3)

The underlying signature is as follows:

{-/2, 0/0, s/1}

Property / Task

Prove or disprove confluence.

Answer / Result

Yes.

Proof (by ACP @ CoCo 2021)

1 Strongly closed

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