0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2] [Expressions interpreter: NONE]
0.00/0.00 c Copyright (c) 2002-2010 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB)
0.00/0.00 c
0.00/0.00 c user parameter file <scip.set> not found - using default parameters
0.00/0.00 c reading problem <HOME/instance-2666757-1276673335.opb>
0.00/0.01 c original problem has 68 variables (68 bin, 0 int, 0 impl, 0 cont) and 79 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.01 o 0
0.00/0.01 c feasible solution found by trivial heuristic, objective value 0.000000e+00
0.00/0.01 c presolving:
0.00/0.02 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 30 upgd conss, 404 impls, 20 clqs
0.00/0.04 c presolving (2 rounds):
0.00/0.04 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.04 c 3008 implications, 20 cliques
0.00/0.04 c presolved problem has 68 variables (68 bin, 0 int, 0 impl, 0 cont) and 79 constraints
0.00/0.04 c 20 constraints of type <setppc>
0.00/0.04 c 48 constraints of type <and>
0.00/0.04 c 1 constraints of type <linear>
0.00/0.04 c 10 constraints of type <logicor>
0.00/0.04 c transformed objective value is always integral (scale: 1)
0.00/0.04 c Presolving Time: 0.02
0.00/0.04 c - non default parameters ----------------------------------------------------------------------
0.00/0.04 c # SCIP version 1.2.1.2
0.00/0.04 c
0.00/0.04 c # frequency for displaying node information lines
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.04 c display/freq = 10000
0.00/0.04 c
0.00/0.04 c # maximal time in seconds to run
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.04 c limits/time = 1800
0.00/0.04 c
0.00/0.04 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.04 c limits/memory = 1620
0.00/0.04 c
0.00/0.04 c # should presolving try to simplify inequalities
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c constraints/linear/simplifyinequalities = TRUE
0.00/0.04 c
0.00/0.04 c # should presolving try to simplify knapsacks
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.04 c
0.00/0.04 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.04 c heuristics/undercover/freq = 0
0.00/0.04 c
0.00/0.04 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.04 c separating/rapidlearning/freq = 0
0.00/0.04 c
0.00/0.04 c -----------------------------------------------------------------------------------------------
0.00/0.04 c start solving
0.00/0.04 c
0.00/0.05 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.00/0.05 c t 0.0s| 1 | 0 | 191 | - | 506k| 0 | 51 | 68 | 79 | 68 | 127 | 0 | 0 | 0 |-5.000000e+00 | 0.000000e+00 | 100.00%
0.09/0.11 o -1
0.09/0.11 c u 0.1s| 1 | 0 | 191 | - | 508k| 0 | 51 | 68 | 79 | 68 | 127 | 0 | 0 | 0 |-5.000000e+00 |-1.000000e+00 | 80.00%
0.19/0.22 o -3
0.19/0.22 c y 0.1s| 1 | 0 | 191 | - | 654k| 0 | 51 | 68 | 79 | 68 | 127 | 0 | 0 | 0 |-5.000000e+00 |-3.000000e+00 | 40.00%
0.19/0.23 c 0.1s| 1 | 0 | 276 | - | 830k| 0 | 42 | 68 | 295 | 68 | 145 | 40 | 0 | 0 |-4.824561e+00 |-3.000000e+00 | 37.82%
0.19/0.25 c 0.2s| 1 | 0 | 311 | - | 927k| 0 | 32 | 68 | 295 | 68 | 161 | 56 | 0 | 0 |-4.500000e+00 |-3.000000e+00 | 33.33%
0.19/0.27 c 0.2s| 1 | 0 | 336 | - |1007k| 0 | 34 | 68 | 295 | 68 | 178 | 73 | 0 | 0 |-4.500000e+00 |-3.000000e+00 | 33.33%
0.19/0.29 c 0.2s| 1 | 0 | 362 | - |1049k| 0 | 26 | 68 | 295 | 68 | 186 | 81 | 0 | 0 |-4.500000e+00 |-3.000000e+00 | 33.33%
0.29/0.31 c 0.2s| 1 | 0 | 376 | - |1087k| 0 | 31 | 68 | 295 | 68 | 193 | 88 | 0 | 0 |-4.500000e+00 |-3.000000e+00 | 33.33%
0.29/0.34 c 0.2s| 1 | 0 | 407 | - |1131k| 0 | 32 | 68 | 295 | 68 | 196 | 91 | 0 | 0 |-4.500000e+00 |-3.000000e+00 | 33.33%
0.29/0.36 c 0.3s| 1 | 0 | 448 | - |1186k| 0 | 29 | 68 | 295 | 68 | 200 | 95 | 0 | 0 |-4.467527e+00 |-3.000000e+00 | 32.85%
0.29/0.39 c 0.3s| 1 | 0 | 465 | - |1199k| 0 | 27 | 68 | 295 | 68 | 205 | 100 | 0 | 0 |-4.445592e+00 |-3.000000e+00 | 32.52%
0.39/0.41 c 0.3s| 1 | 0 | 485 | - |1212k| 0 | 28 | 68 | 295 | 68 | 209 | 104 | 0 | 0 |-4.423777e+00 |-3.000000e+00 | 32.18%
0.39/0.44 c 0.3s| 1 | 0 | 518 | - |1220k| 0 | 26 | 68 | 295 | 68 | 172 | 109 | 0 | 0 |-4.391227e+00 |-3.000000e+00 | 31.68%
0.39/0.46 c 0.4s| 1 | 0 | 549 | - |1250k| 0 | 26 | 68 | 295 | 68 | 177 | 114 | 0 | 0 |-4.378655e+00 |-3.000000e+00 | 31.49%
0.39/0.47 c 0.4s| 1 | 0 | 570 | - |1282k| 0 | 30 | 68 | 295 | 68 | 181 | 118 | 0 | 0 |-4.358931e+00 |-3.000000e+00 | 31.18%
0.39/0.49 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.39/0.49 c 0.4s| 1 | 0 | 585 | - |1336k| 0 | 31 | 68 | 295 | 68 | 188 | 125 | 0 | 0 |-4.356536e+00 |-3.000000e+00 | 31.14%
0.49/0.51 c 0.4s| 1 | 0 | 604 | - |1385k| 0 | 29 | 68 | 295 | 68 | 190 | 127 | 0 | 0 |-4.346415e+00 |-3.000000e+00 | 30.98%
0.49/0.53 c 0.4s| 1 | 0 | 627 | - |1429k| 0 | 28 | 68 | 295 | 68 | 194 | 131 | 0 | 0 |-4.341194e+00 |-3.000000e+00 | 30.89%
0.49/0.56 c 0.5s| 1 | 0 | 658 | - |1482k| 0 | 29 | 68 | 295 | 68 | 114 | 137 | 0 | 0 |-4.331503e+00 |-3.000000e+00 | 30.74%
0.49/0.57 c 0.5s| 1 | 0 | 688 | - |1516k| 0 | 28 | 68 | 295 | 68 | 116 | 139 | 0 | 0 |-4.317960e+00 |-3.000000e+00 | 30.52%
0.49/0.58 c 0.5s| 1 | 0 | 711 | - |1556k| 0 | 26 | 68 | 295 | 68 | 120 | 143 | 0 | 0 |-4.311182e+00 |-3.000000e+00 | 30.41%
0.49/0.59 c 0.5s| 1 | 0 | 740 | - |1575k| 0 | 29 | 68 | 295 | 68 | 126 | 149 | 0 | 0 |-4.303560e+00 |-3.000000e+00 | 30.29%
0.59/0.61 c 0.5s| 1 | 0 | 769 | - |1605k| 0 | 28 | 68 | 295 | 68 | 127 | 150 | 0 | 0 |-4.299750e+00 |-3.000000e+00 | 30.23%
0.59/0.61 c 0.5s| 1 | 0 | 796 | - |1608k| 0 | 30 | 68 | 295 | 68 | 130 | 153 | 0 | 0 |-4.298092e+00 |-3.000000e+00 | 30.20%
0.59/0.62 c 0.5s| 1 | 0 | 802 | - |1611k| 0 | 29 | 68 | 295 | 68 | 117 | 155 | 0 | 0 |-4.298034e+00 |-3.000000e+00 | 30.20%
0.79/0.87 c 0.8s| 1 | 0 | 845 | - |1587k| 0 | 25 | 68 | 288 | 68 | 117 | 155 | 0 | 23 |-4.282845e+00 |-3.000000e+00 | 29.95%
0.79/0.87 c 0.8s| 1 | 0 | 875 | - |1589k| 0 | 25 | 68 | 288 | 68 | 124 | 162 | 0 | 23 |-4.274156e+00 |-3.000000e+00 | 29.81%
0.79/0.89 c 0.8s| 1 | 0 | 875 | - |1582k| 0 | - | 68 | 288 | 68 | 124 | 162 | 0 | 29 |-4.274156e+00 |-3.000000e+00 | 29.81%
0.79/0.89 c (run 1, node 1) restarting after 23 global fixings of integer variables
0.79/0.89 c
0.79/0.89 c (restart) converted 64 cuts from the global cut pool into linear constraints
0.79/0.89 c
0.79/0.89 c presolving:
0.79/0.90 c (round 1) 23 del vars, 5 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 3036 impls, 52 clqs
0.89/0.90 c (round 2) 23 del vars, 37 del conss, 0 chg bounds, 30 chg sides, 0 chg coeffs, 0 upgd conss, 3036 impls, 52 clqs
0.89/0.91 c (round 3) 23 del vars, 57 del conss, 0 chg bounds, 30 chg sides, 0 chg coeffs, 253 upgd conss, 3036 impls, 52 clqs
0.89/0.92 c (round 4) 23 del vars, 69 del conss, 0 chg bounds, 33 chg sides, 54 chg coeffs, 253 upgd conss, 3036 impls, 52 clqs
0.89/0.92 c (round 5) 23 del vars, 69 del conss, 0 chg bounds, 33 chg sides, 109 chg coeffs, 253 upgd conss, 3036 impls, 52 clqs
0.89/0.93 c (round 6) 23 del vars, 69 del conss, 0 chg bounds, 33 chg sides, 161 chg coeffs, 253 upgd conss, 3036 impls, 52 clqs
0.89/0.93 c (round 7) 23 del vars, 69 del conss, 0 chg bounds, 33 chg sides, 226 chg coeffs, 253 upgd conss, 3036 impls, 52 clqs
0.89/0.94 c (round 8) 23 del vars, 69 del conss, 0 chg bounds, 33 chg sides, 278 chg coeffs, 253 upgd conss, 3036 impls, 52 clqs
0.89/0.94 c (round 9) 23 del vars, 69 del conss, 0 chg bounds, 33 chg sides, 332 chg coeffs, 253 upgd conss, 3036 impls, 52 clqs
0.89/0.95 c (round 10) 23 del vars, 69 del conss, 0 chg bounds, 33 chg sides, 379 chg coeffs, 253 upgd conss, 3036 impls, 52 clqs
0.89/0.95 c (round 11) 23 del vars, 69 del conss, 0 chg bounds, 33 chg sides, 419 chg coeffs, 253 upgd conss, 3036 impls, 52 clqs
0.89/0.96 c (round 12) 23 del vars, 69 del conss, 0 chg bounds, 33 chg sides, 448 chg coeffs, 253 upgd conss, 3036 impls, 52 clqs
0.89/0.96 c (round 13) 23 del vars, 69 del conss, 0 chg bounds, 33 chg sides, 473 chg coeffs, 253 upgd conss, 3036 impls, 52 clqs
0.89/0.97 c (round 14) 23 del vars, 69 del conss, 0 chg bounds, 33 chg sides, 495 chg coeffs, 253 upgd conss, 3036 impls, 52 clqs
0.89/0.97 c (round 15) 23 del vars, 69 del conss, 0 chg bounds, 33 chg sides, 514 chg coeffs, 253 upgd conss, 3036 impls, 52 clqs
0.89/0.97 c (round 16) 23 del vars, 69 del conss, 0 chg bounds, 33 chg sides, 527 chg coeffs, 253 upgd conss, 3036 impls, 52 clqs
0.89/0.98 c (round 17) 23 del vars, 69 del conss, 0 chg bounds, 33 chg sides, 536 chg coeffs, 253 upgd conss, 3036 impls, 52 clqs
0.89/0.98 c (round 18) 23 del vars, 69 del conss, 0 chg bounds, 33 chg sides, 542 chg coeffs, 253 upgd conss, 3036 impls, 52 clqs
0.89/0.98 c (round 19) 23 del vars, 69 del conss, 0 chg bounds, 33 chg sides, 544 chg coeffs, 253 upgd conss, 3036 impls, 52 clqs
0.89/0.99 c (round 20) 23 del vars, 69 del conss, 0 chg bounds, 33 chg sides, 545 chg coeffs, 253 upgd conss, 3036 impls, 52 clqs
0.89/0.99 c (round 21) 23 del vars, 69 del conss, 0 chg bounds, 33 chg sides, 546 chg coeffs, 253 upgd conss, 3036 impls, 52 clqs
0.89/0.99 c presolving (22 rounds):
0.89/0.99 c 23 deleted vars, 69 deleted constraints, 0 tightened bounds, 0 added holes, 33 changed sides, 546 changed coefficients
0.89/0.99 c 3036 implications, 52 cliques
0.89/0.99 c presolved problem has 45 variables (45 bin, 0 int, 0 impl, 0 cont) and 286 constraints
0.89/0.99 c 17 constraints of type <knapsack>
0.89/0.99 c 47 constraints of type <setppc>
0.89/0.99 c 27 constraints of type <and>
0.89/0.99 c 1 constraints of type <linear>
0.89/0.99 c 194 constraints of type <logicor>
0.89/0.99 c transformed objective value is always integral (scale: 1)
0.89/0.99 c Presolving Time: 0.09
0.89/0.99 c
0.89/0.99 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.89/0.99 c 0.9s| 1 | 0 | 926 | - | 720k| 0 | 22 | 45 | 286 | 45 | 140 | 0 | 0 | 29 |-4.180984e+00 |-3.000000e+00 | 28.25%
1.00/1.02 c 0.9s| 1 | 0 | 946 | - | 722k| 0 | 23 | 45 | 282 | 45 | 131 | 5 | 0 | 29 |-4.079696e+00 |-3.000000e+00 | 26.47%
1.00/1.02 c 0.9s| 1 | 0 | 946 | - | 723k| 0 | 23 | 45 | 282 | 45 | 131 | 5 | 0 | 30 |-3.000000e+00 |-3.000000e+00 | 0.00%
1.00/1.02 c
1.00/1.02 c SCIP Status : problem is solved [optimal solution found]
1.00/1.02 c Solving Time (sec) : 0.88
1.00/1.02 c Solving Nodes : 1 (total of 2 nodes in 2 runs)
1.00/1.02 c Primal Bound : -3.00000000000000e+00 (12 solutions)
1.00/1.02 c Dual Bound : -3.00000000000000e+00
1.00/1.02 c Gap : 0.00 %
1.00/1.02 s OPTIMUM FOUND
1.00/1.02 v x20 x12 -x11 -x19 -x15 -x13 -x16 -x18 x17 -x14 -x10 x9 x8 -x7 -x6 -x5 -x4 -x3 -x2 x1
1.00/1.02 c SCIP Status : problem is solved [optimal solution found]
1.00/1.02 c Solving Time : 0.88
1.00/1.02 c Original Problem :
1.00/1.02 c Problem name : HOME/instance-2666757-1276673335.opb
1.00/1.02 c Variables : 68 (68 binary, 0 integer, 0 implicit integer, 0 continuous)
1.00/1.02 c Constraints : 79 initial, 79 maximal
1.00/1.02 c Presolved Problem :
1.00/1.02 c Problem name : t_HOME/instance-2666757-1276673335.opb
1.00/1.02 c Variables : 45 (45 binary, 0 integer, 0 implicit integer, 0 continuous)
1.00/1.02 c Constraints : 286 initial, 286 maximal
1.00/1.02 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.00/1.02 c trivial : 0.00 23 0 0 0 0 0 0 0
1.00/1.02 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.00/1.02 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.00/1.02 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.00/1.02 c implics : 0.00 0 0 0 0 0 0 0 0
1.00/1.02 c probing : 0.01 0 0 0 0 0 0 0 0
1.00/1.02 c knapsack : 0.05 0 0 0 0 0 0 3 546
1.00/1.02 c setppc : 0.01 0 0 0 0 0 13 0 0
1.00/1.02 c and : 0.01 0 0 0 0 0 0 0 0
1.00/1.02 c linear : 0.01 0 0 0 0 0 34 30 0
1.00/1.02 c logicor : 0.00 0 0 0 0 0 22 0 0
1.00/1.02 c root node : - 33 - - 33 - - - -
1.00/1.02 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.00/1.02 c integral : 0 0 0 3 0 1 10 0 0 0
1.00/1.02 c knapsack : 17 1 2 0 0 0 0 0 0 0
1.00/1.02 c setppc : 47 26 246 0 0 0 0 0 0 0
1.00/1.02 c and : 27 26 246 0 0 0 5 27 0 0
1.00/1.02 c linear : 1 26 246 0 0 0 0 0 0 0
1.00/1.02 c logicor : 194+ 26 141 0 0 0 0 2 0 0
1.00/1.02 c countsols : 0 0 0 0 0 0 0 0 0 0
1.00/1.02 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.00/1.02 c integral : 0.18 0.00 0.00 0.18 0.00
1.00/1.02 c knapsack : 0.00 0.00 0.00 0.00 0.00
1.00/1.02 c setppc : 0.00 0.00 0.00 0.00 0.00
1.00/1.02 c and : 0.00 0.00 0.00 0.00 0.00
1.00/1.02 c linear : 0.01 0.01 0.00 0.00 0.00
1.00/1.02 c logicor : 0.00 0.00 0.00 0.00 0.00
1.00/1.02 c countsols : 0.00 0.00 0.00 0.00 0.00
1.00/1.02 c Propagators : Time Calls Cutoffs DomReds
1.00/1.02 c vbounds : 0.00 3 0 0
1.00/1.02 c rootredcost : 0.00 0 0 0
1.00/1.02 c pseudoobj : 0.00 47 0 0
1.00/1.02 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.00/1.02 c propagation : 0.00 0 0 0 0.0 0 0.0 -
1.00/1.02 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.00/1.02 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.00/1.02 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.00/1.02 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.00/1.02 c applied globally : - - - 0 0.0 - - -
1.00/1.02 c applied locally : - - - 0 0.0 - - -
1.00/1.02 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.00/1.02 c cut pool : 0.00 0 - - 0 - (maximal pool size: 27)
1.00/1.02 c redcost : 0.00 25 0 10 0 0
1.00/1.02 c impliedbounds : 0.00 25 0 0 123 0
1.00/1.02 c intobj : 0.00 0 0 0 0 0
1.00/1.02 c cgmip : 0.00 0 0 0 0 0
1.00/1.02 c gomory : 0.17 25 0 0 258 0
1.00/1.02 c strongcg : 0.11 21 0 0 1221 0
1.00/1.02 c cmir : 0.02 11 0 0 15 0
1.00/1.02 c flowcover : 0.03 11 0 0 30 0
1.00/1.02 c clique : 0.00 25 0 0 121 0
1.00/1.02 c zerohalf : 0.00 0 0 0 0 0
1.00/1.02 c mcf : 0.00 2 0 0 0 0
1.00/1.02 c rapidlearning : 0.08 1 0 8 0 291
1.00/1.02 c Pricers : Time Calls Vars
1.00/1.02 c problem variables: 0.00 0 0
1.00/1.02 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.00/1.02 c relpscost : 0.18 3 1 10 0 0 0
1.00/1.02 c pscost : 0.00 0 0 0 0 0 0
1.00/1.02 c inference : 0.00 0 0 0 0 0 0
1.00/1.02 c mostinf : 0.00 0 0 0 0 0 0
1.00/1.02 c leastinf : 0.00 0 0 0 0 0 0
1.00/1.02 c fullstrong : 0.00 0 0 0 0 0 0
1.00/1.02 c allfullstrong : 0.00 0 0 0 0 0 0
1.00/1.02 c random : 0.00 0 0 0 0 0 0
1.00/1.02 c Primal Heuristics : Time Calls Found
1.00/1.02 c LP solutions : 0.00 - 0
1.00/1.02 c pseudo solutions : 0.00 - 0
1.00/1.02 c oneopt : 0.00 1 0
1.00/1.02 c trivial : 0.00 2 3
1.00/1.02 c simplerounding : 0.00 0 0
1.00/1.02 c zirounding : 0.00 1 0
1.00/1.02 c rounding : 0.00 27 0
1.00/1.02 c shifting : 0.01 27 7
1.00/1.02 c intshifting : 0.00 0 0
1.00/1.02 c twoopt : 0.00 0 0
1.00/1.02 c fixandinfer : 0.00 0 0
1.00/1.02 c feaspump : 0.00 0 0
1.00/1.02 c coefdiving : 0.00 0 0
1.00/1.02 c pscostdiving : 0.00 0 0
1.00/1.02 c fracdiving : 0.00 0 0
1.00/1.02 c veclendiving : 0.00 0 0
1.00/1.02 c intdiving : 0.00 0 0
1.00/1.02 c actconsdiving : 0.00 0 0
1.00/1.02 c objpscostdiving : 0.00 0 0
1.00/1.02 c rootsoldiving : 0.00 0 0
1.00/1.02 c linesearchdiving : 0.00 0 0
1.00/1.02 c guideddiving : 0.00 0 0
1.00/1.02 c octane : 0.00 0 0
1.00/1.02 c rens : 0.05 1 0
1.00/1.02 c rins : 0.00 0 0
1.00/1.02 c localbranching : 0.00 0 0
1.00/1.02 c mutation : 0.00 0 0
1.00/1.02 c crossover : 0.00 0 0
1.00/1.02 c dins : 0.00 0 0
1.00/1.02 c undercover : 0.02 1 1
1.00/1.02 c nlp : 0.00 0 0
1.00/1.02 c trysol : 0.00 0 0
1.00/1.02 c LP : Time Calls Iterations Iter/call Iter/sec
1.00/1.02 c primal LP : 0.00 0 0 0.00 -
1.00/1.02 c dual LP : 0.04 28 946 33.79 23650.00
1.00/1.02 c lex dual LP : 0.00 0 0 0.00 -
1.00/1.02 c barrier LP : 0.00 0 0 0.00 -
1.00/1.02 c diving/probing LP: 0.00 0 0 0.00 -
1.00/1.02 c strong branching : 0.18 30 2630 87.67 14611.11
1.00/1.02 c (at root node) : - 30 2630 87.67 -
1.00/1.02 c conflict analysis: 0.00 0 0 0.00 -
1.00/1.02 c B&B Tree :
1.00/1.02 c number of runs : 2
1.00/1.02 c nodes : 1
1.00/1.02 c nodes (total) : 2
1.00/1.02 c nodes left : 0
1.00/1.02 c max depth : 0
1.00/1.02 c max depth (total): 0
1.00/1.02 c backtracks : 0 (0.0%)
1.00/1.02 c delayed cutoffs : 0
1.00/1.02 c repropagations : 0 (0 domain reductions, 0 cutoffs)
1.00/1.02 c avg switch length: 2.00
1.00/1.02 c switching time : 0.00
1.00/1.02 c Solution :
1.00/1.02 c Solutions found : 12 (3 improvements)
1.00/1.02 c First Solution : +0.00000000000000e+00 (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
1.00/1.02 c Primal Bound : -3.00000000000000e+00 (in run 1, after 1 nodes, 0.14 seconds, depth 0, found by <trysol>)
1.00/1.02 c Dual Bound : -3.00000000000000e+00
1.00/1.02 c Gap : 0.00 %
1.00/1.02 c Root Dual Bound : -3.00000000000000e+00
1.00/1.02 c Root Iterations : 946
1.00/1.03 c Time complete: 1.02.