Certification Problem

Input (COPS 223)

We consider the TRS containing the following rules:

f(f(a)) → f(f(f(a))) (1)
f(f(a)) → f(a) (2)

The underlying signature is as follows:

{f/1, a/0}

Property / Task

Prove or disprove confluence.

Answer / Result

Yes.

Proof (by csi @ CoCo 2020)

1 Redundant Rules Transformation

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

f(f(a)) → f(a) (2)

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

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 R is empty

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