Certification Problem

Input (COPS 662)

We consider the TRS containing the following rules:

f(b) → c (1)
c → c (2)
f(c) → b (3)
a → b (4)

The underlying signature is as follows:

{f/1, b/0, c/0, a/0}

Property / Task

Prove or disprove confluence.

Answer / Result

Yes.

Proof (by csi @ CoCo 2021)

1 Redundant Rules Transformation

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

a → b (4)
f(c) → b (3)
f(b) → c (1)

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

1.1 Redundant Rules Transformation

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

a → b (4)
f(c) → b (3)
f(b) → c (1)

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

1.1.1 Critical Pair Closing System

Confluence is proven using the following terminating critical-pair-closing-system R:

There are no rules.

1.1.1.1 R is empty

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