Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Previously, many of FF's internal data structures were contextual.
I hoped that this would improve performance. It hasn't done so yet, so I'm ripping them out for now. The non-contextual theory is considerably simpler.
I tested on the QF_FF benchmarks from our paper. Testbed: quad partition, 8GB, 5min. Both solved 605/864 benchmarks (with 6 that flipped).
Scatter plot:
Total solve time on commonly solved benchmarks decreases by about 23%.
@ajreynol : as a side effect, this should reduce sensitivity to term registration.