Many thanks to @notoria for these very useful predicates!
CLP(B): Constraint Logic Programming over Boolean variables,
a BDD-based SAT solver provided via the predicates
`sat/1`, `taut/2`, `labeling/1` etc.
+* [`arithmetic`](src/prolog/lib/arithmetic.pl)
+ Arithmetic predicates such as `lsb/2`, `msb/2` and
+ `number_to_rational/2`.
* [`time`](src/prolog/lib/time.pl)
`time/1` reports the CPU time of a goal. It is useful
for measuring the performance of your code.