Selection policy that orders literals from the left to the right,
but moves all negated literals to the right.
Using this selection policy can proof R(a) from -P(x),Q(x) -> R(x),Q(a) , using
'left most selection' would only be able to do this with prerequisites
being in a different position.