Use -SAT when: () You have binary choices for each variable. () Constraints are "at least one of two conditions must hold." () You need to find any valid assignment, not count them or find the best one. If you see these patterns, model it as -SAT and use the SCC algorithm.
If constraints involve three or more variables per clause, you need a different approach. -SAT is effective but limited to this specific structure. Do not force problems into -SAT if they do not fit.