The Robbins problem - are all Robbins algebras Boolean? - has been solved: Every Robbins algebra is Boolean. This theorem was proved automatically by EQP, a theorem proving program developed at Argonne National Laboratory. Information on the solution; a preprint of a paper on the topic that appears in the Journal of Automated Reasoning (JAR) (the JAR paper has simpler proofs than the ones on this page); input files and proofs corresponding to the JAR paper; and a press release.