NO Non-Confluence Proof

Non-Confluence Proof

by ACP

Input

The rewrite relation of the following TRS is considered.

c a
f(c) f(h(b,c))
a c
c h(f(c),h(b,h(h(b,c),a)))
c b

Proof

1 Non-Joinable Fork

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

t0 = f(c)
ε f(h(b,c))
1.2 f(h(b,a))
= t2

t0 = f(c)
1 f(b)
= t1

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

Tool configuration

ACP