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