NO Non-Confluence Proof

Non-Confluence Proof

by ACP

Input

The rewrite relation of the following TRS is considered.

W(B(x)) I(x)
B(S(x)) S(x)
W(x) I(x)

Proof

1 Non-Joinable Fork

The system is not confluent due to the following forking derivations.

t0 = W(B(c_1))
ε I(B(c_1))
= t1

t0 = W(B(c_1))
ε I(c_1)
= t1

The two resulting terms cannot be joined for the following reason:

Tool configuration

ACP