2. Fourier-Motzkin Additional Tests for Timeout Exceptions:

Since the number of timeout exceptions raised by the Fourier-Motzkin algorithm is rather small, $2$ in 6_tab:PerfectClub_satisfiability_exception_100 and $14$ in 6_tab:SPEC95_satisfiability_exception_100, and from the fact that the inequalities combination in this algorithm is explosive, we have tested these constraint systems again without the $2$ minutes timeout activation. The result is that they all raised out-of-memory space exceptions. This means that if the Fourier-Motzkin method takes more than two minutes, it likely results in much longer execution time before an out-of-memory space occurs.

Thus our conclusion for the sampled databases is that JANUS 64-bit and Simplex are more robust than the other two algorithms. Now we consider the filtered databases.

We need to remind the reader that Tables related to filtered databases cannot be compared to Tables related to sampled databases.