NO Non-Confluence Proof

Non-Confluence Proof

by csi

Input

The rewrite relation of the following TRS is considered.

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

Proof

1 Non-Joinable Fork

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

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

t0 = f(a)
ε b
ε h(b,h(c,a))
1 h(h(b,h(c,a)),h(c,a))
= t3

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

Tool configuration

csi