NO Non-Confluence Proof

Non-Confluence Proof

by csi

Input

The rewrite relation of the following TRS is considered.

b → a
b → c
c → b
c → d

Proof

1 Non-Joinable Fork

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

t0 = b
→ε a
= t1

t0 = b
→ε c
→ε d
= t2

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

Tool configuration

csi