On Cullen numbers which are both Riesel and Sierpiński numbers

We describe an algorithm to determine whether or not a given system of congruences is satisfied by Cullen numbers. We use this algorithm to prove that there are infinitely many Cullen numbers which are both Riesel and Sierpiński. (Such numbers should be discarded if you are searching prime numbers with Prothʼs theorem.)