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