YES
Confluence Proof
Confluence Proof
by ACP
Input
The rewrite relation of the following TRS is considered.
|
f(0,0) |
→ |
f(0,1) |
|
f(1,0) |
→ |
f(0,0) |
|
f(x,y) |
→ |
f(y,x) |
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