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