NO Non-Confluence Proof

Non-Confluence Proof

by csi

Input

The rewrite relation of the following TRS is considered.

a → c
a → f(c)
f(x) → f(g(x))

Proof

1 Non-Joinable Fork

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

t0 = a
→ε c
= t1

t0 = a
→ε f(c)
= t1

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

Tool configuration

csi