1. A method, in a data processing system, for simplifying a netlist before computational resources are exceeded, the method comprising: for each of a set of suspected equivalences in a proof graph of a netlist, determining, by a processor, whether equivalence holds for at least one of an equivalence or an equivalence class by identifying whether the equivalence or equivalence class is either affecting or non-affecting; responsive to the equivalence or equivalence class being affecting, recording, by the processor, a proof dependency as an edge in a proof graph; for each node in the proof graph, determining, by the processor, whether the node has a falsified dependency; responsive to the node failing to have a falsified dependency, identifying, by the processor, that all dependencies are satisfied and that the equivalences represented by the node in the proof graph are sequential equivalences; and simplifying, by the processor, the netlist by consuming the sequential equivalences.