Figure out a way to test UNSAT cache
Open
- Dominant language
- Haskell
- Stars
- 358
- Forks
- 79
- Avg merge
- 1d 1h
- Merged PRs (30d)
- 6
Description
Due to improvements in #935, our previous test for UNSAT cache had to be removed, because propagating inequalities made the whole example trivial to solve.
We need a new way to test that UNSAT cache mechanism is working.
Contributor guide
No contributing guide indexed for this repository
Research direction
Start by reading issue #935 and inspecting the current UNSAT cache mechanism and the location where it is exercised. Identify the previous removed test or its replacement entry point, then add a test that demonstrates the cache is used without the example becoming trivial; done means the test distinguishes cached UNSAT results from ordinary propagation.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- haskell
- Domain
- testing
- Issue type
- Feature
- Difficulty
- 4/5
- Estimated time
- 3-5 days
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 35/100