NO Non-Confluence Proof

Non-Confluence Proof

by csi

Input

The rewrite relation of the following TRS is considered.

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

Proof

1 Non-Joinable Fork

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

t0 = a
→ε h(a)
→1 h(f(c))
= t2

t0 = a
→ε f(c)
→ε h(g(c))
= t2

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

Tool configuration

csi