Certification Problem
Input (COPS 149)
We consider the TRS containing the following rules:
|
-(+(x,y)) |
→ |
+(-(x),-(y)) |
(1) |
|
+(x,y) |
→ |
+(y,x) |
(2) |
The underlying signature is as follows:
{-/1, +/2}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
3
step(s).