Presolve eliminates 20 constraints and 360 variables.
Adjusted problem:
6282 variables, all binary
9989 constraints, all linear; 36520 nonzeros
1 linear objective; 18 nonzeros.

CPLEX 8.1.0: clocktype = 2
timing=1
mipdisplay=2
mipstartvalue=1
Clique table members: 10031
MIP emphasis: balance optimality and feasibility
Root relaxation solution time =   42.84 sec.

        Nodes                                         Cuts/
   Node  Left     Objective  IInf  Best Integer     Best Node    ItCnt     Gap

      0     0        4.8778  2565                      4.8778     7795         
                     5.4107  2308                  Cuts:  864    27374         
                    10.0000  2602                  Cuts:  586    36941         
                    10.0000  2758                  Cuts:  139    44669         
Heuristic still looking
Heuristic still looking
Heuristic still looking
Heuristic complete
    100    62       11.0000  1537                     10.0000   280240         
    200   111    infeasible                           10.0000   386527         
    300   158       12.0000  2235                     10.0000   554616         
    400   219       13.2500  1639                     10.0000   677720         
    500   271       10.2500  2128                     10.0000   845510         

<BREAK> (cplex)

GUB cover cuts applied:  176
Clique cuts applied:  502
Cover cuts applied:  335
Gomory fractional cuts applied: 1

Times (seconds):
Input =  0.15
Solve =  8989.57
Output = 0.01
CPLEX 8.1.0: aborted, no integer solution.
934197 MIP simplex iterations
574 branch-and-bound nodes; no basis.