This document presents a reduction from the problem of solving energy games to the satisfiability problem for formulas of propositional logic. Energy games model resource-constrained reactive systems and are equivalent to mean-payoff games. The document proposes encoding winning strategies for energy games using difference logic and propositional logic. It reports tight size bounds for these encodings and argues they could lead to more efficient solving algorithms by leveraging modern SAT solvers.