NO Non-Confluence Proof

Non-Confluence Proof

by ACP

Input

The rewrite relation of the following TRS is considered.

a f(a)
a g(h(a))
f(x) h(g(x))
h(x) f(g(x))

Proof

1 Non-Joinable Fork

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

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

t0 = a
ε f(a)
= t1

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

Tool configuration

ACP