NO Non-Confluence Proof

Non-Confluence Proof

by csi

Input

The rewrite relation of the following TRS is considered.

f(b) → a
f(b) → f(c)
f(c) → f(b)
f(c) → d
b → e
c → e'
f(e) → a
f(e') → d

Proof

1 Non-Joinable Fork

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

t0 = f(b)
→ε a
= t1

t0 = f(b)
→ε f(c)
→1 f(e')
→ε d
= t3

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

Tool configuration

csi