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