In this note, we show that the variety of Boolean \(SQS\)-skeins can be defined by a single axiom and, in the process, we find all of the shortest single axioms for said variety. Our investigations were aided by the automated theorem-prover Prover9 and the finite model-finder Mace4.