Yes. A concrete example of nonunique factorization in a congruence submonoid is
The four factors are distinct and each is congruent to one modulo ten. The primes can be checked by trial division by two and three. Their elementary prime decompositions are
For any one of these products , where are the indicated distinct primes, its positive divisors are . This divisor assertion does not require unique factorization: if and , then by the Euclid lemma proved in (a), so and is either one or . If , write and obtain , giving or .
None of is congruent to one modulo ten. Consequently no listed product has a proper nonunit divisor in . Thus each is an irreducible element of a commutative monoid, and the displayed equality proves the claim. Ordinary prime decompositions and irreducibility relative to the smaller commutative monoid are different notions.