YES
Confluence Proof
Confluence Proof
by ACP
Input
The rewrite relation of the following TRS is considered.
|
-(+(x,y)) |
→ |
+(-(x),-(y)) |
|
+(-(x),-(y)) |
→ |
-(+(x,y)) |
Proof
1 Strongly closed
Confluence is proven since the TRS is strongly closed.
The joins can be performed within 2 step(s).
Tool configuration
ACP