0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: Clp 1.11.1] [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-2665327-1276673334.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.01/0.01 o 0
0.01/0.01 c feasible solution found by trivial heuristic, objective value 0.000000e+00
0.01/0.01 c presolving:
0.01/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.01/0.03 c presolving (2 rounds):
0.01/0.03 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.01/0.03 c 3008 implications, 20 cliques
0.01/0.03 c presolved problem has 68 variables (68 bin, 0 int, 0 impl, 0 cont) and 79 constraints
0.01/0.03 c 20 constraints of type <setppc>
0.01/0.03 c 48 constraints of type <and>
0.01/0.03 c 1 constraints of type <linear>
0.01/0.03 c 10 constraints of type <logicor>
0.01/0.03 c transformed objective value is always integral (scale: 1)
0.01/0.03 c Presolving Time: 0.01
0.01/0.03 c - non default parameters ----------------------------------------------------------------------
0.01/0.03 c # SCIP version 1.2.1.2
0.01/0.03 c
0.01/0.03 c # frequency for displaying node information lines
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 100]
0.01/0.03 c display/freq = 10000
0.01/0.03 c
0.01/0.03 c # maximal time in seconds to run
0.01/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.04 c limits/time = 1800
0.01/0.04 c
0.01/0.04 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.01/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.04 c limits/memory = 1620
0.01/0.04 c
0.01/0.04 c # should presolving try to simplify inequalities
0.01/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.04 c constraints/linear/simplifyinequalities = TRUE
0.01/0.04 c
0.01/0.04 c # should presolving try to simplify knapsacks
0.01/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.04 c constraints/knapsack/simplifyinequalities = TRUE
0.01/0.04 c
0.01/0.04 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.04 c heuristics/undercover/freq = 0
0.01/0.04 c
0.01/0.04 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.04 c separating/rapidlearning/freq = 0
0.01/0.04 c
0.01/0.04 c -----------------------------------------------------------------------------------------------
0.01/0.04 c start solving
0.01/0.04 c
0.01/0.04 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.01/0.04 c t 0.0s| 1 | 0 | 23 | - | 506k| 0 | 20 | 68 | 79 | 68 | 127 | 0 | 0 | 0 |-5.000000e+00 | 0.000000e+00 | 100.00%
0.01/0.04 o -1
0.01/0.04 c s 0.0s| 1 | 0 | 23 | - | 508k| 0 | 20 | 68 | 79 | 68 | 127 | 0 | 0 | 0 |-5.000000e+00 |-1.000000e+00 | 80.00%
0.01/0.08 o -2
0.01/0.08 c u 0.1s| 1 | 0 | 23 | - | 510k| 0 | 20 | 68 | 79 | 68 | 127 | 0 | 0 | 0 |-5.000000e+00 |-2.000000e+00 | 60.00%
0.09/0.18 o -3
0.09/0.18 c y 0.1s| 1 | 0 | 23 | - | 552k| 0 | 20 | 68 | 79 | 68 | 127 | 0 | 0 | 0 |-5.000000e+00 |-3.000000e+00 | 40.00%
0.19/0.20 c 0.1s| 1 | 0 | 73 | - | 745k| 0 | 41 | 68 | 310 | 68 | 113 | 2 | 0 | 0 |-4.787234e+00 |-3.000000e+00 | 37.33%
0.19/0.21 c 0.1s| 1 | 0 | 110 | - | 840k| 0 | 36 | 68 | 310 | 68 | 154 | 43 | 0 | 0 |-4.500000e+00 |-3.000000e+00 | 33.33%
0.19/0.23 c 0.2s| 1 | 0 | 153 | - | 930k| 0 | 39 | 68 | 310 | 68 | 172 | 61 | 0 | 0 |-4.500000e+00 |-3.000000e+00 | 33.33%
0.19/0.26 c 0.2s| 1 | 0 | 220 | - |1041k| 0 | 34 | 68 | 310 | 68 | 189 | 78 | 0 | 0 |-4.500000e+00 |-3.000000e+00 | 33.33%
0.19/0.28 c 0.2s| 1 | 0 | 268 | - |1090k| 0 | 33 | 68 | 310 | 68 | 208 | 97 | 0 | 0 |-4.476190e+00 |-3.000000e+00 | 32.98%
0.29/0.31 c 0.2s| 1 | 0 | 329 | - |1107k| 0 | 28 | 68 | 296 | 68 | 195 | 113 | 0 | 0 |-4.476190e+00 |-3.000000e+00 | 32.98%
0.29/0.34 c 0.3s| 1 | 0 | 379 | - |1175k| 0 | 33 | 68 | 296 | 68 | 199 | 117 | 0 | 0 |-4.476190e+00 |-3.000000e+00 | 32.98%
0.29/0.37 c 0.3s| 1 | 0 | 463 | - |1224k| 0 | 27 | 68 | 296 | 68 | 209 | 127 | 0 | 0 |-4.394267e+00 |-3.000000e+00 | 31.73%
0.39/0.40 c 0.3s| 1 | 0 | 533 | - |1243k| 0 | 27 | 68 | 296 | 68 | 219 | 137 | 0 | 0 |-4.000000e+00 |-3.000000e+00 | 25.00%
0.39/0.43 c 0.4s| 1 | 0 | 566 | - |1276k| 0 | 28 | 68 | 296 | 68 | 193 | 145 | 0 | 0 |-4.000000e+00 |-3.000000e+00 | 25.00%
0.39/0.45 c 0.4s| 1 | 0 | 635 | - |1303k| 0 | 29 | 68 | 296 | 68 | 201 | 153 | 0 | 0 |-4.000000e+00 |-3.000000e+00 | 25.00%
0.39/0.47 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.47 c 0.4s| 1 | 0 | 671 | - |1308k| 0 | 37 | 68 | 296 | 68 | 206 | 158 | 0 | 0 |-4.000000e+00 |-3.000000e+00 | 25.00%
0.49/0.50 c 0.4s| 1 | 0 | 737 | - |1386k| 0 | 33 | 68 | 296 | 68 | 208 | 160 | 0 | 0 |-4.000000e+00 |-3.000000e+00 | 25.00%
0.49/0.52 c 0.5s| 1 | 0 | 782 | - |1473k| 0 | 33 | 68 | 296 | 68 | 215 | 167 | 0 | 0 |-4.000000e+00 |-3.000000e+00 | 25.00%
0.59/0.69 c 0.6s| 1 | 0 | 782 | - |1468k| 0 | - | 68 | 296 | 68 | 215 | 167 | 0 | 5 |-4.000000e+00 |-3.000000e+00 | 25.00%
0.59/0.69 c (run 1, node 1) restarting after 21 global fixings of integer variables
0.59/0.69 c
0.59/0.69 c (restart) converted 147 cuts from the global cut pool into linear constraints
0.59/0.69 c
0.59/0.69 c presolving:
0.69/0.70 c (round 1) 40 del vars, 190 del conss, 0 chg bounds, 2 chg sides, 0 chg coeffs, 0 upgd conss, 3008 impls, 32 clqs
0.69/0.70 c (round 2) 40 del vars, 295 del conss, 0 chg bounds, 61 chg sides, 0 chg coeffs, 0 upgd conss, 3008 impls, 32 clqs
0.69/0.71 c (round 3) 40 del vars, 300 del conss, 0 chg bounds, 61 chg sides, 0 chg coeffs, 99 upgd conss, 3008 impls, 32 clqs
0.69/0.72 c (round 4) 40 del vars, 379 del conss, 0 chg bounds, 150 chg sides, 237 chg coeffs, 99 upgd conss, 3008 impls, 35 clqs
0.69/0.72 c (round 5) 40 del vars, 380 del conss, 0 chg bounds, 154 chg sides, 291 chg coeffs, 99 upgd conss, 3008 impls, 35 clqs
0.69/0.72 c (round 6) 40 del vars, 380 del conss, 0 chg bounds, 154 chg sides, 329 chg coeffs, 99 upgd conss, 3008 impls, 35 clqs
0.69/0.72 c (round 7) 40 del vars, 380 del conss, 0 chg bounds, 154 chg sides, 374 chg coeffs, 99 upgd conss, 3008 impls, 35 clqs
0.69/0.73 c (round 8) 40 del vars, 380 del conss, 0 chg bounds, 154 chg sides, 412 chg coeffs, 99 upgd conss, 3008 impls, 35 clqs
0.69/0.73 c (round 9) 40 del vars, 380 del conss, 0 chg bounds, 154 chg sides, 451 chg coeffs, 99 upgd conss, 3008 impls, 35 clqs
0.69/0.73 c (round 10) 40 del vars, 380 del conss, 0 chg bounds, 154 chg sides, 485 chg coeffs, 99 upgd conss, 3008 impls, 36 clqs
0.69/0.74 c (round 11) 40 del vars, 380 del conss, 0 chg bounds, 154 chg sides, 518 chg coeffs, 99 upgd conss, 3008 impls, 38 clqs
0.69/0.74 c (round 12) 40 del vars, 380 del conss, 0 chg bounds, 154 chg sides, 550 chg coeffs, 99 upgd conss, 3008 impls, 39 clqs
0.69/0.74 c (round 13) 40 del vars, 380 del conss, 0 chg bounds, 154 chg sides, 571 chg coeffs, 99 upgd conss, 3008 impls, 39 clqs
0.69/0.75 c (round 14) 40 del vars, 380 del conss, 0 chg bounds, 154 chg sides, 587 chg coeffs, 99 upgd conss, 3008 impls, 40 clqs
0.69/0.75 c (round 15) 40 del vars, 380 del conss, 0 chg bounds, 154 chg sides, 596 chg coeffs, 99 upgd conss, 3008 impls, 40 clqs
0.69/0.76 c (round 16) 40 del vars, 380 del conss, 0 chg bounds, 154 chg sides, 601 chg coeffs, 99 upgd conss, 3008 impls, 40 clqs
0.69/0.76 c (round 17) 40 del vars, 380 del conss, 0 chg bounds, 154 chg sides, 602 chg coeffs, 99 upgd conss, 3008 impls, 40 clqs
0.69/0.76 c presolving (18 rounds):
0.69/0.76 c 40 deleted vars, 380 deleted constraints, 0 tightened bounds, 0 added holes, 154 changed sides, 602 changed coefficients
0.69/0.76 c 3008 implications, 40 cliques
0.69/0.76 c presolved problem has 28 variables (28 bin, 0 int, 0 impl, 0 cont) and 118 constraints
0.69/0.76 c 11 constraints of type <knapsack>
0.69/0.76 c 27 constraints of type <setppc>
0.69/0.76 c 15 constraints of type <and>
0.69/0.76 c 1 constraints of type <linear>
0.69/0.76 c 64 constraints of type <logicor>
0.69/0.76 c transformed objective value is always integral (scale: 1)
0.69/0.76 c Presolving Time: 0.05
0.69/0.76 c
0.69/0.76 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.69/0.76 c 0.6s| 1 | 0 | 804 | - | 564k| 0 | - | 28 | 118 | 28 | 85 | 0 | 0 | 5 |-3.000000e+00 |-3.000000e+00 | 0.00%
0.69/0.76 c 0.6s| 1 | 0 | 804 | - | 564k| 0 | - | 28 | 118 | 28 | 85 | 0 | 0 | 5 |-3.000000e+00 |-3.000000e+00 | 0.00%
0.69/0.76 c
0.69/0.76 c SCIP Status : problem is solved [optimal solution found]
0.69/0.76 c Solving Time (sec) : 0.63
0.69/0.76 c Solving Nodes : 1 (total of 2 nodes in 2 runs)
0.69/0.76 c Primal Bound : -3.00000000000000e+00 (12 solutions)
0.69/0.76 c Dual Bound : -3.00000000000000e+00
0.69/0.76 c Gap : 0.00 %
0.69/0.76 s OPTIMUM FOUND
0.69/0.76 v x20 x12 -x11 -x19 -x15 -x13 -x16 -x18 x17 -x14 -x10 x9 x8 -x7 -x6 -x5 -x4 -x3 -x2 x1
0.69/0.76 c SCIP Status : problem is solved [optimal solution found]
0.69/0.76 c Solving Time : 0.63
0.69/0.76 c Original Problem :
0.69/0.76 c Problem name : HOME/instance-2665327-1276673334.opb
0.69/0.76 c Variables : 68 (68 binary, 0 integer, 0 implicit integer, 0 continuous)
0.69/0.76 c Constraints : 79 initial, 79 maximal
0.69/0.76 c Presolved Problem :
0.69/0.76 c Problem name : t_HOME/instance-2665327-1276673334.opb
0.69/0.76 c Variables : 28 (28 binary, 0 integer, 0 implicit integer, 0 continuous)
0.69/0.76 c Constraints : 118 initial, 118 maximal
0.69/0.76 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.69/0.76 c trivial : 0.00 21 0 0 0 0 0 0 0
0.69/0.76 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.69/0.76 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.69/0.76 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.69/0.76 c implics : 0.00 0 0 0 0 0 0 0 0
0.69/0.76 c probing : 0.01 0 0 0 0 0 0 0 0
0.69/0.76 c knapsack : 0.02 0 0 0 0 0 4 93 602
0.69/0.76 c setppc : 0.00 0 0 0 0 0 85 0 0
0.69/0.76 c and : 0.00 19 0 0 0 0 0 0 0
0.69/0.76 c linear : 0.01 0 0 0 0 0 281 61 0
0.69/0.76 c logicor : 0.00 0 0 0 0 0 10 0 0
0.69/0.76 c root node : - 21 - - 21 - - - -
0.69/0.76 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.69/0.76 c integral : 0 0 0 1 0 0 5 0 0 0
0.69/0.76 c knapsack : 11 0 1 0 0 0 0 0 0 0
0.69/0.76 c setppc : 27 15 243 0 0 0 0 0 0 0
0.69/0.76 c and : 15 15 243 0 0 0 7 24 0 0
0.69/0.76 c linear : 1 15 243 0 0 0 0 2 0 0
0.69/0.76 c logicor : 64 15 139 0 0 0 0 0 0 0
0.69/0.76 c countsols : 0 0 0 0 0 0 0 0 0 0
0.69/0.76 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.69/0.76 c integral : 0.07 0.00 0.00 0.07 0.00
0.69/0.76 c knapsack : 0.00 0.00 0.00 0.00 0.00
0.69/0.76 c setppc : 0.00 0.00 0.00 0.00 0.00
0.69/0.76 c and : 0.00 0.00 0.00 0.00 0.00
0.69/0.76 c linear : 0.01 0.01 0.00 0.00 0.00
0.69/0.76 c logicor : 0.00 0.00 0.00 0.00 0.00
0.69/0.76 c countsols : 0.00 0.00 0.00 0.00 0.00
0.69/0.76 c Propagators : Time Calls Cutoffs DomReds
0.69/0.76 c vbounds : 0.00 3 0 0
0.69/0.76 c rootredcost : 0.00 0 0 0
0.69/0.76 c pseudoobj : 0.00 28 1 0
0.69/0.76 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.69/0.76 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.69/0.76 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.69/0.76 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.69/0.76 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.69/0.76 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.69/0.76 c applied globally : - - - 0 0.0 - - -
0.69/0.76 c applied locally : - - - 0 0.0 - - -
0.69/0.76 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.69/0.76 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.69/0.76 c redcost : 0.00 14 0 1 0 0
0.69/0.76 c impliedbounds : 0.00 14 0 0 177 0
0.69/0.76 c intobj : 0.00 0 0 0 0 0
0.69/0.76 c cgmip : 0.00 0 0 0 0 0
0.69/0.76 c gomory : 0.11 14 0 0 204 0
0.69/0.76 c strongcg : 0.06 14 0 0 963 0
0.69/0.76 c cmir : 0.02 10 0 0 18 0
0.69/0.76 c flowcover : 0.06 10 0 0 44 0
0.69/0.76 c clique : 0.01 14 0 0 90 0
0.69/0.76 c zerohalf : 0.00 0 0 0 0 0
0.69/0.76 c mcf : 0.00 1 0 0 0 0
0.69/0.76 c rapidlearning : 0.07 1 0 8 0 305
0.69/0.76 c Pricers : Time Calls Vars
0.69/0.76 c problem variables: 0.00 0 0
0.69/0.76 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.69/0.76 c relpscost : 0.07 1 0 5 0 0 0
0.69/0.76 c pscost : 0.00 0 0 0 0 0 0
0.69/0.76 c inference : 0.00 0 0 0 0 0 0
0.69/0.76 c mostinf : 0.00 0 0 0 0 0 0
0.69/0.76 c leastinf : 0.00 0 0 0 0 0 0
0.69/0.76 c fullstrong : 0.00 0 0 0 0 0 0
0.69/0.76 c allfullstrong : 0.00 0 0 0 0 0 0
0.69/0.76 c random : 0.00 0 0 0 0 0 0
0.69/0.76 c Primal Heuristics : Time Calls Found
0.69/0.76 c LP solutions : 0.00 - 0
0.69/0.76 c pseudo solutions : 0.00 - 0
0.69/0.76 c oneopt : 0.00 1 0
0.69/0.76 c trivial : 0.00 2 3
0.69/0.76 c simplerounding : 0.00 0 0
0.69/0.76 c zirounding : 0.00 1 0
0.69/0.76 c rounding : 0.00 15 0
0.69/0.76 c shifting : 0.00 15 7
0.69/0.76 c intshifting : 0.00 0 0
0.69/0.76 c twoopt : 0.00 0 0
0.69/0.76 c fixandinfer : 0.00 0 0
0.69/0.76 c feaspump : 0.00 0 0
0.69/0.76 c coefdiving : 0.00 0 0
0.69/0.76 c pscostdiving : 0.00 0 0
0.69/0.76 c fracdiving : 0.00 0 0
0.69/0.76 c veclendiving : 0.00 0 0
0.69/0.76 c intdiving : 0.00 0 0
0.69/0.76 c actconsdiving : 0.00 0 0
0.69/0.76 c objpscostdiving : 0.00 0 0
0.69/0.76 c rootsoldiving : 0.00 0 0
0.69/0.76 c linesearchdiving : 0.00 0 0
0.69/0.76 c guideddiving : 0.00 0 0
0.69/0.76 c octane : 0.00 0 0
0.69/0.76 c rens : 0.06 1 0
0.69/0.76 c rins : 0.00 0 0
0.69/0.76 c localbranching : 0.00 0 0
0.69/0.76 c mutation : 0.00 0 0
0.69/0.76 c crossover : 0.00 0 0
0.69/0.76 c dins : 0.00 0 0
0.69/0.76 c undercover : 0.03 1 1
0.69/0.76 c nlp : 0.00 0 0
0.69/0.76 c trysol : 0.00 0 0
0.69/0.76 c LP : Time Calls Iterations Iter/call Iter/sec
0.69/0.76 c primal LP : 0.00 0 0 0.00 -
0.69/0.76 c dual LP : 0.07 17 804 47.29 11485.71
0.69/0.76 c lex dual LP : 0.00 0 0 0.00 -
0.69/0.76 c barrier LP : 0.00 0 0 0.00 -
0.69/0.76 c diving/probing LP: 0.00 0 0 0.00 -
0.69/0.76 c strong branching : 0.07 5 1015 203.00 14500.00
0.69/0.76 c (at root node) : - 5 1015 203.00 -
0.69/0.76 c conflict analysis: 0.00 0 0 0.00 -
0.69/0.76 c B&B Tree :
0.69/0.76 c number of runs : 2
0.69/0.76 c nodes : 1
0.69/0.76 c nodes (total) : 2
0.69/0.76 c nodes left : 0
0.69/0.76 c max depth : 0
0.69/0.76 c max depth (total): 0
0.69/0.76 c backtracks : 0 (0.0%)
0.69/0.76 c delayed cutoffs : 0
0.69/0.76 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.69/0.76 c avg switch length: 2.00
0.69/0.76 c switching time : 0.00
0.69/0.76 c Solution :
0.69/0.76 c Solutions found : 12 (4 improvements)
0.69/0.76 c First Solution : +0.00000000000000e+00 (in run 1, after 0 nodes, 0.01 seconds, depth 0, found by <trivial>)
0.69/0.76 c Primal Bound : -3.00000000000000e+00 (in run 1, after 1 nodes, 0.12 seconds, depth 0, found by <trysol>)
0.69/0.76 c Dual Bound : -3.00000000000000e+00
0.69/0.76 c Gap : 0.00 %
0.69/0.76 c Root Dual Bound : -3.00000000000000e+00
0.69/0.76 c Root Iterations : 804
0.69/0.77 c Time complete: 0.77.