NO Non-Confluence Proof

Non-Confluence Proof

by csi

Input

The rewrite relation of the following TRS is considered.

a(x) b(x)
b(b(c(x))) c(a(c(a(a(x)))))
c(c(x)) x

Proof

1 Non-Joinable Fork

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

t0 = b(b(c(c(x109))))
1.1 b(b(x109))
= t1

t0 = b(b(c(c(x109))))
ε c(a(c(a(a(c(x109))))))
1.1.1.1 c(a(c(a(b(c(x109))))))
1.1.1 c(a(c(b(b(c(x109))))))
1 c(b(c(b(b(c(x109))))))
1.1.1 c(b(c(c(a(c(a(a(x109))))))))
1.1.1.1.1.1.1 c(b(c(c(a(c(a(b(x109))))))))
1.1.1.1.1.1 c(b(c(c(a(c(b(b(x109))))))))
1.1.1.1 c(b(c(c(b(c(b(b(x109))))))))
1.1 c(b(b(c(b(b(x109))))))
1 c(c(a(c(a(a(b(b(x109))))))))
1.1.1.1.1 c(c(a(c(a(b(b(b(x109))))))))
1.1.1.1 c(c(a(c(b(b(b(b(x109))))))))
1.1 c(c(b(c(b(b(b(b(x109))))))))
ε b(c(b(b(b(b(x109))))))
= t14

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

Tool configuration

csi