Implement a csolve-greedy that only solves the branch with the fewest errors, and finishes as soon as one is done, instead of solving all of them. This should make working with disjunctions more pleasant.

Submitted by Hendrik van Antwerpen on 8 September 2016 at 13:10

NaBL2 uses a greedy solver by default now, which can greatly reduce solving time when disjunctions and ambiguities are used.