NO Non-Confluence Proof

Non-Confluence Proof

by csi

Input

The rewrite relation of the following TRS is considered.

a a
g(g(a)) b
g(g(x)) g(g(g(b)))

Proof

1 Non-Joinable Fork

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

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

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

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

Tool configuration

csi