--- Job enigma Start 07/17/08 18:28:44 GAMS Rev 227 Copyright (C) 1987-2008 GAMS Development. All rights reserved Licensee: Stefan Vigerske G071106/0001CB-LNX Humboldt University Berlin, Numerical Mathematics DC5918 --- Starting compilation --- enigma.gms(106) 2 Mb --- GDXin=/home/stefan/work/gams/models/LINlib/enigma.gdx --- enigma.gms(148) 3 Mb --- Starting execution: elapsed 0:00:00.005 --- enigma.gms(123) 4 Mb --- Generating MIP model m --- enigma.gms(124) 4 Mb --- 22 rows 101 columns 299 non-zeroes --- 100 discrete-columns --- Executing Cbc: elapsed 0:00:00.008 GAMS/Cbc 2.1 LP/MIP Solver written by J. Forrest Reading parameter(s) from "/home/stefan/work/gams/benchmarks/LINLib.MIP/cbc.op2" >> threads 2 Finished reading from "/home/stefan/work/gams/benchmarks/LINLib.MIP/cbc.op2" Problem statistics: 100 columns and 21 rows. 100 variables have integrality restrictions. Calling CBC main solution routine... Coin Cbc and Clp Solver version 2.10.00, build Jul 15 2008 command line - GAMS/CBC -threads 2 -solve -quit threads was changed from 0 to 2 Continuous objective value is 0 - -0.00 seconds processed model has 21 rows, 100 columns (100 integer) and 289 elements Objective coefficients multiple of 1 Cutoff increment increased from 1e-05 to 0.999 Pass 1: suminf. 0.20955 obj. 0 iterations 31 Pass 2: suminf. 1.71569 obj. 0 iterations 22 Pass 3: suminf. 1.71569 obj. 0 iterations 17 Pass 4: suminf. 4.76060 obj. 2.85636 iterations 20 Pass 5: suminf. 1.44974 obj. 0 iterations 30 Pass 6: suminf. 1.44974 obj. 0 iterations 22 Pass 7: suminf. 0.06540 obj. 2.01869 iterations 20 Pass 8: suminf. 0.03364 obj. 2 iterations 15 Pass 9: suminf. 1.74824 obj. 2 iterations 17 Pass 10: suminf. 1.74824 obj. 2 iterations 13 Pass 11: suminf. 1.43300 obj. 2 iterations 18 Pass 12: suminf. 1.43300 obj. 2 iterations 18 Pass 13: suminf. 1.62308 obj. 2 iterations 13 Pass 14: suminf. 1.62308 obj. 2 iterations 23 Pass 15: suminf. 0.99710 obj. 3.75362 iterations 23 Pass 16: suminf. 0.55282 obj. 5 iterations 13 Pass 17: suminf. 1.66471 obj. 5 iterations 11 Pass 18: suminf. 1.66471 obj. 5 iterations 13 Pass 19: suminf. 1.34310 obj. 4.73138 iterations 22 Pass 20: suminf. 0.41288 obj. 5 iterations 19 No solution found this major pass Before mini branch and bound, 55 integers at bound fixed and 0 continuous Full problem 21 rows 100 columns, reduced to 20 rows 44 columns Mini branch and bound did not improve solution (0.05 seconds) Full problem 22 rows 100 columns, reduced to 22 rows 100 columns After 0.18 seconds - Feasibility pump exiting - took 0.18 seconds 1 added rows had average density of 99 At root node, 1 cuts changed objective from 0 to 0 in 50 passes Cut generator 0 (Probing) - 2 row cuts (0 active), 0 column cuts in 0.112 seconds - new frequency is 5 Cut generator 1 (Gomory) - 365 row cuts (1 active), 0 column cuts in 0.012 seconds - new frequency is 1 Cut generator 2 (Knapsack) - 5 row cuts (0 active), 0 column cuts in 0.004 seconds - new frequency is -100 Cut generator 3 (Clique) - 0 row cuts (0 active), 0 column cuts in 0.000 seconds - new frequency is -100 Cut generator 4 (MixedIntegerRounding2) - 0 row cuts (0 active), 0 column cuts in 0.000 seconds - new frequency is -100 Cut generator 5 (FlowCover) - 0 row cuts (0 active), 0 column cuts in 0.004 seconds - new frequency is -100 Cut generator 6 (TwoMirCuts) - 88 row cuts (0 active), 0 column cuts in 0.008 seconds - new frequency is -100 After 0 nodes, 1 on tree, 1e+50 best solution, best possible 0 (0.35 seconds) After 1000 nodes, 139 on tree, 1e+50 best solution, best possible 0 (1.88 seconds) After 2000 nodes, 155 on tree, 1e+50 best solution, best possible 0 (2.89 seconds) After 3000 nodes, 166 on tree, 1e+50 best solution, best possible 0 (3.66 seconds) Thread 0 used 2063 times, waiting to start 0.146364, 10914 locks, 0.0491067 locked, 0.0202841 waiting for locks Thread 1 used 1750 times, waiting to start 0.239508, 9253 locks, 0.0424838 locked, 0.0181152 waiting for locks Main thread 2.09567 waiting for threads, 7639 locks, 0.0153408 locked, 0.013983 waiting for locks Search completed - best objective 0, took 17946 iterations and 3813 nodes (4.16 seconds) Strong branching done 16848 times (73218 iterations), fathomed 1 nodes and fixed 0 variables Maximum depth 28, 0 variables fixed on reduced cost Cuts at root node changed objective from 0 to 0 Probing was tried 625 times and created 129 cuts of which 30 were active after adding rounds of cuts (0.456 seconds) Gomory was tried 707 times and created 3439 cuts of which 302 were active after adding rounds of cuts (0.140 seconds) Knapsack was tried 150 times and created 15 cuts of which 0 were active after adding rounds of cuts (0.012 seconds) Clique was tried 150 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 150 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 150 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.012 seconds) TwoMirCuts was tried 150 times and created 264 cuts of which 0 were active after adding rounds of cuts (0.024 seconds) Result - Finished objective 0 after 3813 nodes and 17946 iterations - took 4.18 seconds (total time 4.18) Total time 4.18 Solved to optimality. wallclocktime: 2.59812 used seconds: 4.18 MIP solution: 0 (3813 nodes, 4.18 seconds) Best possible: 0 Absolute gap: 0 (absolute tolerance optca: 0) Relative gap: 0 (relative tolerance optcr: 0) --- Restarting execution --- enigma.gms(124) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job enigma.gms Stop 07/17/08 18:28:47 elapsed 0:00:02.629