NO Non-Confluence Proof

Non-Confluence Proof

by csi

Input

The rewrite relation of the following TRS is considered.

c f(c)
c h(c)
f(x) f(g(x))
h(x) h(g(x))
g(x) g(f(h(x)))

Proof

1 Non-Joinable Fork

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

t0 = c
ε f(c)
= t1

t0 = c
ε h(c)
= t1

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

Tool configuration

csi