We consider the TRS containing the following rules:
| +(s(x),y) | → | s(+(x,y)) | (1) |
| +(x,s(y)) | → | s(+(x,y)) | (2) |
| +(x,y) | → | +(y,x) | (3) |
The underlying signature is as follows:
{+/2, s/1}To prove that the TRS is (non-)confluent, we show (non-)confluence of the following modified system:
| +(x,y) | → | +(y,x) | (3) |
| +(x,s(y)) | → | s(+(x,y)) | (2) |
| +(s(x),y) | → | s(+(x,y)) | (1) |
| +(x,y) | → | +(x,y) | (4) |
| +(x,s(y)) | → | s(+(y,x)) | (5) |
| +(s(x),y) | → | s(+(y,x)) | (6) |
All redundant rules that were added or removed can be simulated in 2 steps .