We present a case study in experimental yet rigorous mathematics by describing an algorithm, fully implemented in both Mathematica and Maple, that automatically conjectures, and then automatically proves, closed-form expressions extending Dyson's celebrated constant-term conjecture.