21 March 2009  12:45:05.430 PM
 
SATISFIABILITY_MPI
  FORTRAN90/MPI version
  We have a logical function of N logical arguments.
  We do an exhaustive search of all 2^N possibilities,
  seeking those inputs that make the function TRUE.
 
  The number of logical variables is N =       23
  The number of input vectors to check is  8388608
 
   # Processor       Index    ---------Input Values------------------------
 
 
Processor        0 iterates from        0 <= I <  8388608
 
   1         0     3656933    0 1 1 0 1 1 1 1 1 0 0 1 1 0 0 1 1 1 0 0 1 0 1
   2         0     3656941    0 1 1 0 1 1 1 1 1 0 0 1 1 0 0 1 1 1 0 1 1 0 1
   3         0     3656957    0 1 1 0 1 1 1 1 1 0 0 1 1 0 0 1 1 1 1 1 1 0 1
   4         0     3661029    0 1 1 0 1 1 1 1 1 0 1 1 1 0 0 1 1 1 0 0 1 0 1
   5         0     3661037    0 1 1 0 1 1 1 1 1 0 1 1 1 0 0 1 1 1 0 1 1 0 1
   6         0     3661053    0 1 1 0 1 1 1 1 1 0 1 1 1 0 0 1 1 1 1 1 1 0 1
   7         0     3665125    0 1 1 0 1 1 1 1 1 1 0 1 1 0 0 1 1 1 0 0 1 0 1
   8         0     5754104    1 0 1 0 1 1 1 1 1 0 0 1 1 0 0 1 1 1 1 1 0 0 0
   9         0     5754109    1 0 1 0 1 1 1 1 1 0 0 1 1 0 0 1 1 1 1 1 1 0 1
  10         0     5758200    1 0 1 0 1 1 1 1 1 0 1 1 1 0 0 1 1 1 1 1 0 0 0
  11         0     5758205    1 0 1 0 1 1 1 1 1 0 1 1 1 0 0 1 1 1 1 1 1 0 1
  12         0     7851229    1 1 1 0 1 1 1 1 1 0 0 1 1 0 0 1 1 0 1 1 1 0 1
  13         0     7851261    1 1 1 0 1 1 1 1 1 0 0 1 1 0 0 1 1 1 1 1 1 0 1
  14         0     7855325    1 1 1 0 1 1 1 1 1 0 1 1 1 0 0 1 1 0 1 1 1 0 1
  15         0     7855357    1 1 1 0 1 1 1 1 1 0 1 1 1 0 0 1 1 1 1 1 1 0 1
 
  Number of solutions found was       15
  Elapsed wall clock time (seconds)    4.27200    
 
SATISFIABILITY_MPI
  Normal end of execution.
 
21 March 2009  12:45:09.704 PM