NO Non-Confluence Proof

Non-Confluence Proof

by csi

Input

The rewrite relation of the following TRS is considered.

F(x) A
F(x) G(F(x))
G(F(x)) F(H(x))
G(F(x)) B

Proof

1 Non-Joinable Fork

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

t0 = G(F(x))
1 G(A)
= t1

t0 = G(F(x))
ε B
= t1

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

Tool configuration

csi