YES Confluence Proof

Confluence Proof

by csi

Input

The rewrite relation of the following TRS is considered.

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

Proof

1 Redundant Rules Transformation

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

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

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

1.1 Locally confluent and terminating

Confluence is proven by showing local confluence and termination.

1.1.1 Rule Removal

Using the linear polynomial interpretation over the naturals
[b(x1)] = 1 · x1 + 3
[c(x1)] = 1 · x1 + 1
[a(x1)] = 1 · x1 + 4
the rules
c(c(c(x))) → b(x)
a(x) → c(b(x))
b(c(x)) → a(x)
b(c(x)) → c(b(x))
remain.

1.1.1.1 Rule Removal

Using the linear polynomial interpretation over the naturals
[b(x1)] = 1 · x1 + 1
[c(x1)] = 1 · x1 + 4
[a(x1)] = 1 · x1 + 5
the rules
a(x) → c(b(x))
b(c(x)) → a(x)
b(c(x)) → c(b(x))
remain.

1.1.1.1.1 Rule Removal

Using the linear polynomial interpretation over the naturals
[b(x1)] = 2 · x1 + 1
[c(x1)] = 2 · x1 + 4
[a(x1)] = 4 · x1 + 7
all rules could be removed.

1.1.1.1.1.1 R is empty

There are no rules in the TRS. Hence, it is terminating.

1.1.2 Local Confluence Proof

All critical pairs are joinable which can be seen by computing normal forms of all critical pairs.

Tool configuration

csi