21 January 2020 08:56:55 AM

SATISFY
  C 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

   #       Index    ---------Input Values------------------------

   1     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     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     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     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     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     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     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     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     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     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     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     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     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     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     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

SATISFY
  Normal end of execution.

21 January 2020 08:56:55 AM