NO Non-Confluence Proof

Non-Confluence Proof

by ACP

Input

The rewrite relation of the following TRS is considered.

c f(c,d)
c h(c,d)
f(x,y) f(g(y),x)
h(x,y) h(g(y),x)

Proof

1 Non-Joinable Fork

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

t0 = c
ε f(c,d)
= t1

t0 = c
ε h(c,d)
= t1

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

Tool configuration

ACP