ap.theories.bitvectors
Class implementing some bit-vector-specific simplification rules for inequalities over zero-one variables: s >= 2*t - 1 --> s >= t and 2*s >= t --> s >= t.
s >= 2*t - 1 --> s >= t
2*s >= t --> s >= t
TODO: can those rules be implemented within the ModReducer?
(Since version ) see corresponding Javadoc for more information.
Class implementing some bit-vector-specific simplification rules for inequalities over zero-one variables:
s >= 2*t - 1 --> s >= tand2*s >= t --> s >= t.TODO: can those rules be implemented within the ModReducer?