The Steiner system problem and the boolean satisfiability problem (SAT) are defined. Then it is shown how to convert a Steiner system problem into an instance of SAT. Solving the resulting SAT using genetic algorithms has not been very fruitful. Several reasons are suggested. This poor performance may tarnish the reputation of genetic algorithms as an effective and efficient method for solving combinatorial optimization problems such as SAT. To increase their exposure in the research community, Steiner system-derived SATs should be added to a genetic algorithm" test suite" or, alternatively, to the DIMACS Challenge set of SAT benchmark problems.