Faster re-adding of first literal to learnt clause
Always do stamp-based literal removal on learnt clauses. It's cheap
Adding hyper-bin resolution to intree probing
Counting removed bins in intree-based probing

Also, making sure to only print to console when verbosity is high enough
Using templates for cancelUntil

Also, making it inline. May make it faster
Intree: only add to queue literals that are decision and not set
Fixing output of probing
tree_look() should just set solver->ok, not return anything
Clear bogoprops & hyper-bin before intree -- it's easier to count
We must clear these storage lists for hyper-bin/trans-red
Make sure literals are unassigned when adding to intree queue
A debug output to help with undefined literals in the solution
More strong assertions in the code

Now that we have fixed some things, the trail should contain no
Removed::elimed/replaced/decomposed literals from decision level 0
Don't perform stamp-based minimization all the time
Fixing cancelUntil, it has a template in the declaration
Always call the solution extender

For example, for intree we need ti no matter what, even if SCC is
switched off (!). Also, it's cheap to do it, so why not.
Currently, there is no such thing as a non-decision variable
Use binary clause marking to do transitive reduction
Print better short info about intree-based probing
Do less normal probing, since intree probing is also done