YES Confluence Proof

Confluence Proof

by csi

Input

The rewrite relation of the following TRS is considered.

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

Proof

1 Redundant Rules Transformation

To prove that the TRS is (non-)confluent, we show (non-)confluence of the following modified system:

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

All redundant rules that were added or removed can be simulated in 2 steps .

1.1 Redundant Rules Transformation

To prove that the TRS is (non-)confluent, we show (non-)confluence of the following modified system:

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

All redundant rules that were added or removed can be simulated in 2 steps .

1.1.1 Decreasing Diagrams

1.1.1.1 Relative Termination Proof

The duplicating rules (R) terminate relative to the other rules (S).

1.1.1.1.1 R is empty

There are no rules in the TRS R. Hence, R/S is relative terminating.

1.1.1.2 Rule Labeling

Confluence is proven, because all critical peaks can be joined decreasingly using the following rule labeling function (rules that are not shown have label 0). All critical pairs are joinable:

Tool configuration

csi