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 Strongly closed
Confluence is proven since the TRS is strongly closed.
The joins can be performed within 3 step(s).
Tool configuration
ACP