Applications of e-graphs to program synthesis have recently seen a rise in popularity. The efficient equality saturation workload that they enable makes them an ideal tool for program search and optimization. Unfortunately, straightforward approaches to dealing with beta-reduction in a complete manner cause equality saturation to be overrun with additional terms, making the process slow and often intractable. Yet some of us would still like to have complete (or close to complete) beta-reduction in the languages on which we perform equality saturation. We give an overview of approaches to dealing with beta-reduction and propose a fast and simple method that keeps the e-graph size down by culling unnecessary terms.