YES
Confluence Proof
Confluence Proof
by ACP
Input
The rewrite relation of the following TRS is considered.
|
f(a,a) |
→ |
g(f(a,a)) |
| a |
→ |
b |
|
f(b,x) |
→ |
g(f(x,x)) |
|
f(x,b) |
→ |
g(f(x,x)) |
Proof
1 Development Closed
Confluence is proven since the TRS is development closed.
Tool configuration
ACP