NO Non-Confluence Proof

Non-Confluence Proof

by csi

Input

The rewrite relation of the following TRS is considered.

a h(g(b))
a h(c)
b g(b)
h(g(x)) g(h(x))
g(x) h(x)

Proof

1 Non-Joinable Fork

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

t0 = a
ε h(g(b))
= t1

t0 = a
ε h(c)
= t1

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

Tool configuration

csi