YES
Confluence Proof
Confluence Proof
by ACP
Input
The rewrite relation of the following TRS is considered.
|
f(a,b) |
→ |
c |
| a |
→ |
a' |
| b |
→ |
b' |
| c |
→ |
f(a',b) |
| c |
→ |
f(a,b') |
| c |
→ |
f(a,b) |
Proof
1 Strongly closed
Confluence is proven since the TRS is strongly closed.
The joins can be performed within 5 step(s).
Tool configuration
ACP