Here we compare the difference between 64-bit and 32-bit implementations of algorithms for the satisfiability test. This comparison answers the question: which precision should we adopt, 32-bit, 64-bit or GNU multi-precision? This question is raised since we do know that 32-bit computation can be faster and requires less memory space than 64-bit, and much faster than GNU Multi Precision, but we do not know exactly how much of precision we lose because of computing overflows. Unfortunately we do not have a complete set of implementations supporting GNU multi-precision, therefore comparisons between 64-bit and GNU multi-precision are not yet available.