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-2665005-1276647565.opb>
0.00/0.01 c original problem has 200 variables (200 bin, 0 int, 0 impl, 0 cont) and 136 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.01 c presolving:
0.00/0.02 c (round 1) 6 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 18 chg coeffs, 0 upgd conss, 784 impls, 0 clqs
0.00/0.03 c (round 2) 18 del vars, 8 del conss, 0 chg bounds, 0 chg sides, 26 chg coeffs, 0 upgd conss, 1151 impls, 0 clqs
0.00/0.03 c (round 3) 29 del vars, 17 del conss, 0 chg bounds, 0 chg sides, 35 chg coeffs, 6 upgd conss, 1391 impls, 0 clqs
0.00/0.04 c (round 4) 39 del vars, 25 del conss, 0 chg bounds, 0 chg sides, 43 chg coeffs, 6 upgd conss, 1551 impls, 0 clqs
0.00/0.04 c (round 5) 49 del vars, 33 del conss, 0 chg bounds, 0 chg sides, 51 chg coeffs, 6 upgd conss, 1631 impls, 0 clqs
0.00/0.04 c (round 6) 59 del vars, 41 del conss, 0 chg bounds, 0 chg sides, 59 chg coeffs, 6 upgd conss, 1631 impls, 0 clqs
0.00/0.06 c presolving (7 rounds):
0.00/0.06 c 59 deleted vars, 41 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 59 changed coefficients
0.00/0.06 c 1661 implications, 0 cliques
0.00/0.06 c presolved problem has 141 variables (141 bin, 0 int, 0 impl, 0 cont) and 90 constraints
0.00/0.06 c 78 constraints of type <and>
0.00/0.06 c 5 constraints of type <linear>
0.00/0.06 c 7 constraints of type <logicor>
0.00/0.06 c transformed objective value is always integral (scale: 2)
0.00/0.06 c Presolving Time: 0.02
0.00/0.06 c - non default parameters ----------------------------------------------------------------------
0.00/0.06 c # SCIP version 1.2.1.2
0.00/0.06 c
0.00/0.06 c # frequency for displaying node information lines
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.06 c display/freq = 10000
0.00/0.06 c
0.00/0.06 c # maximal time in seconds to run
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.06 c limits/time = 1800
0.00/0.06 c
0.00/0.06 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.06 c limits/memory = 1620
0.00/0.06 c
0.00/0.06 c # should presolving try to simplify inequalities
0.00/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.06 c constraints/linear/simplifyinequalities = TRUE
0.00/0.06 c
0.00/0.06 c # should presolving try to simplify knapsacks
0.00/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.06 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.06 c heuristics/undercover/freq = 0
0.00/0.06 c
0.00/0.06 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.06 c separating/rapidlearning/freq = 0
0.00/0.06 c
0.00/0.06 c -----------------------------------------------------------------------------------------------
0.00/0.06 c start solving
0.00/0.06 c
0.00/0.06 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.06 c 0.0s| 1 | 0 | 13 | - | 764k| 0 | 7 | 141 | 90 | 141 | 167 | 0 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.15 c 0.1s| 1 | 0 | 26 | - | 789k| 0 | 20 | 141 | 90 | 141 | 175 | 8 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.16 c 0.1s| 1 | 0 | 45 | - | 821k| 0 | 33 | 141 | 90 | 141 | 185 | 18 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.18 c 0.1s| 1 | 0 | 78 | - | 888k| 0 | 48 | 141 | 90 | 141 | 200 | 33 | 0 | 0 | 3.000000e+00 | -- | Inf
0.19/0.22 c 0.2s| 1 | 0 | 112 | - |1020k| 0 | 57 | 141 | 90 | 141 | 221 | 54 | 0 | 0 | 3.000000e+00 | -- | Inf
0.19/0.26 c 0.2s| 1 | 0 | 149 | - |1094k| 0 | 67 | 141 | 90 | 141 | 240 | 73 | 0 | 0 | 3.000000e+00 | -- | Inf
0.29/0.30 c 0.2s| 1 | 0 | 185 | - |1220k| 0 | 58 | 141 | 90 | 141 | 254 | 87 | 0 | 0 | 3.000000e+00 | -- | Inf
0.29/0.35 c 0.3s| 1 | 2 | 185 | - |1221k| 0 | 58 | 141 | 90 | 141 | 254 | 87 | 0 | 9 | 3.000000e+00 | -- | Inf
0.49/0.52 o 19
0.49/0.52 c * 0.4s| 24 | 17 | 386 | 8.7 |1230k| 22 | - | 141 | 93 | 141 | 138 | 149 | 3 | 148 | 3.000000e+00 | 1.900000e+01 | 533.33%
0.69/0.79 o 17
0.69/0.79 c * 0.7s| 98 | 34 | 883 | 7.2 |1286k| 28 | - | 141 | 127 | 141 | 127 | 315 | 37 | 343 | 3.000000e+00 | 1.700000e+01 | 466.67%
0.79/0.82 o 13
0.79/0.82 c * 0.7s| 108 | 40 | 955 | 7.2 |1290k| 28 | - | 141 | 122 | 141 | 128 | 332 | 39 | 360 | 3.000000e+00 | 1.300000e+01 | 333.33%
0.79/0.83 o 7
0.79/0.83 c * 0.7s| 113 | 37 | 984 | 7.1 |1292k| 28 | - | 141 | 124 | 141 | 129 | 337 | 41 | 364 | 3.000000e+00 | 7.000000e+00 | 133.33%
0.79/0.83 o 3
0.79/0.83 c * 0.7s| 114 | 0 | 984 | 7.1 |1275k| 28 | - | 141 | 124 | 141 | 126 | 337 | 41 | 364 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.79/0.83 c
0.79/0.83 c SCIP Status : problem is solved [optimal solution found]
0.79/0.83 c Solving Time (sec) : 0.68
0.79/0.83 c Solving Nodes : 114
0.79/0.83 c Primal Bound : +3.00000000000000e+00 (5 solutions)
0.79/0.83 c Dual Bound : +3.00000000000000e+00
0.79/0.83 c Gap : 0.00 %
0.79/0.83 s OPTIMUM FOUND
0.79/0.83 v -x75 -x74 -x73 -x72 -x71 -x70 -x69 -x68 x67 -x66 -x50 -x49 -x48 -x47 x46 x65 -x64 -x63 x62 -x61 -x45 x44 x43 -x42 x41 -x60 -x59
0.79/0.83 v x58 x57 x56 x40 -x39 -x38 x37 x36 -x55 -x54 -x53 -x52 -x51 x35 x34 -x33 x32 x31 x30 -x29 -x28 x27 x26 -x25 -x24 x23 -x22 x21
0.79/0.83 v x20 x19 x18 x17 x16 -x15 x14 -x13 -x12 x11 -x10 x9 -x8 -x7 x6 -x5 -x4 -x3 x2 x1
0.79/0.83 c SCIP Status : problem is solved [optimal solution found]
0.79/0.83 c Solving Time : 0.68
0.79/0.83 c Original Problem :
0.79/0.83 c Problem name : HOME/instance-2665005-1276647565.opb
0.79/0.83 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
0.79/0.83 c Constraints : 136 initial, 136 maximal
0.79/0.83 c Presolved Problem :
0.79/0.83 c Problem name : t_HOME/instance-2665005-1276647565.opb
0.79/0.83 c Variables : 141 (141 binary, 0 integer, 0 implicit integer, 0 continuous)
0.79/0.83 c Constraints : 90 initial, 127 maximal
0.79/0.83 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.79/0.83 c trivial : 0.00 0 0 0 0 0 0 0 0
0.79/0.83 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.79/0.83 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.79/0.83 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.79/0.83 c implics : 0.00 0 0 0 0 0 0 0 0
0.79/0.83 c probing : 0.00 0 0 0 0 0 0 0 0
0.79/0.83 c and : 0.01 10 41 0 0 0 41 0 41
0.79/0.83 c linear : 0.01 2 6 0 0 0 0 0 18
0.79/0.83 c logicor : 0.00 0 0 0 0 0 0 0 0
0.79/0.83 c root node : - 7 - - 7 - - - -
0.79/0.83 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.79/0.83 c integral : 0 0 0 105 0 0 15 0 0 182
0.79/0.83 c and : 78 223 608 0 0 9 394 276 0 0
0.79/0.83 c linear : 5 6 595 0 0 12 263 0 0 0
0.79/0.83 c logicor : 7+ 6 174 5 0 1 22 0 0 0
0.79/0.83 c countsols : 0 0 0 5 0 0 0 0 0 0
0.79/0.83 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.79/0.83 c integral : 0.25 0.00 0.00 0.25 0.00
0.79/0.83 c and : 0.01 0.01 0.00 0.00 0.00
0.79/0.83 c linear : 0.00 0.00 0.00 0.00 0.00
0.79/0.83 c logicor : 0.00 0.00 0.00 0.00 0.00
0.79/0.83 c countsols : 0.00 0.00 0.00 0.00 0.00
0.79/0.83 c Propagators : Time Calls Cutoffs DomReds
0.79/0.83 c vbounds : 0.00 2 0 0
0.79/0.83 c rootredcost : 0.00 4 0 2
0.79/0.83 c pseudoobj : 0.00 313 0 21
0.79/0.83 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.79/0.83 c propagation : 0.00 22 22 129 22.1 6 20.0 -
0.79/0.83 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.79/0.83 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.79/0.83 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.79/0.83 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.79/0.83 c applied globally : - - - 41 14.8 - - -
0.79/0.83 c applied locally : - - - 0 0.0 - - -
0.79/0.83 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.79/0.83 c cut pool : 0.00 5 - - 37 - (maximal pool size: 296)
0.79/0.83 c redcost : 0.00 231 0 4 0 0
0.79/0.83 c impliedbounds : 0.00 6 0 0 43 0
0.79/0.83 c intobj : 0.00 0 0 0 0 0
0.79/0.83 c cgmip : 0.00 0 0 0 0 0
0.79/0.83 c gomory : 0.05 6 0 0 144 0
0.79/0.83 c strongcg : 0.04 6 0 0 436 0
0.79/0.83 c cmir : 0.01 6 0 0 74 0
0.79/0.83 c flowcover : 0.02 6 0 0 137 0
0.79/0.83 c clique : 0.00 6 0 0 1 0
0.79/0.83 c zerohalf : 0.00 0 0 0 0 0
0.79/0.83 c mcf : 0.00 1 0 0 0 0
0.79/0.83 c rapidlearning : 0.05 1 0 0 0 0
0.79/0.83 c Pricers : Time Calls Vars
0.79/0.83 c problem variables: 0.00 0 0
0.79/0.83 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.79/0.83 c relpscost : 0.25 100 0 15 0 0 182
0.79/0.83 c pscost : 0.00 0 0 0 0 0 0
0.79/0.83 c inference : 0.00 0 0 0 0 0 0
0.79/0.83 c mostinf : 0.00 0 0 0 0 0 0
0.79/0.83 c leastinf : 0.00 0 0 0 0 0 0
0.79/0.83 c fullstrong : 0.00 0 0 0 0 0 0
0.79/0.83 c allfullstrong : 0.00 0 0 0 0 0 0
0.79/0.83 c random : 0.00 0 0 0 0 0 0
0.79/0.83 c Primal Heuristics : Time Calls Found
0.79/0.83 c LP solutions : 0.00 - 5
0.79/0.83 c pseudo solutions : 0.00 - 0
0.79/0.83 c crossover : 0.00 0 0
0.79/0.83 c coefdiving : 0.00 0 0
0.79/0.83 c pscostdiving : 0.00 0 0
0.79/0.83 c fracdiving : 0.00 0 0
0.79/0.83 c veclendiving : 0.00 0 0
0.79/0.83 c objpscostdiving : 0.00 0 0
0.79/0.83 c rootsoldiving : 0.00 0 0
0.79/0.83 c linesearchdiving : 0.00 0 0
0.79/0.83 c guideddiving : 0.00 0 0
0.79/0.83 c feaspump : 0.00 1 0
0.79/0.83 c trivial : 0.00 2 0
0.79/0.83 c simplerounding : 0.00 0 0
0.79/0.83 c zirounding : 0.00 87 0
0.79/0.83 c rounding : 0.00 174 0
0.79/0.83 c shifting : 0.03 29 0
0.79/0.83 c intshifting : 0.00 0 0
0.79/0.83 c oneopt : 0.00 4 0
0.79/0.83 c twoopt : 0.00 0 0
0.79/0.83 c fixandinfer : 0.00 0 0
0.79/0.83 c intdiving : 0.00 0 0
0.79/0.83 c actconsdiving : 0.00 0 0
0.79/0.83 c octane : 0.00 0 0
0.79/0.83 c rens : 0.01 1 0
0.79/0.83 c rins : 0.00 0 0
0.79/0.83 c localbranching : 0.00 0 0
0.79/0.83 c mutation : 0.00 0 0
0.79/0.83 c dins : 0.00 0 0
0.79/0.83 c undercover : 0.01 1 0
0.79/0.83 c nlp : 0.00 0 0
0.79/0.83 c trysol : 0.00 0 0
0.79/0.83 c LP : Time Calls Iterations Iter/call Iter/sec
0.79/0.83 c primal LP : 0.04 0 0 0.00 0.00
0.79/0.83 c dual LP : 0.11 231 984 4.26 8945.45
0.79/0.83 c lex dual LP : 0.00 0 0 0.00 -
0.79/0.83 c barrier LP : 0.00 0 0 0.00 -
0.79/0.83 c diving/probing LP: 0.00 0 0 0.00 -
0.79/0.83 c strong branching : 0.25 364 3176 8.73 12704.00
0.79/0.83 c (at root node) : - 9 473 52.56 -
0.79/0.83 c conflict analysis: 0.00 0 0 0.00 -
0.79/0.83 c B&B Tree :
0.79/0.83 c number of runs : 1
0.79/0.83 c nodes : 114
0.79/0.83 c nodes (total) : 114
0.79/0.83 c nodes left : 0
0.79/0.83 c max depth : 28
0.79/0.83 c max depth (total): 28
0.79/0.83 c backtracks : 10 (8.8%)
0.79/0.83 c delayed cutoffs : 5
0.79/0.83 c repropagations : 38 (64 domain reductions, 4 cutoffs)
0.79/0.83 c avg switch length: 2.46
0.79/0.83 c switching time : 0.06
0.79/0.83 c Solution :
0.79/0.83 c Solutions found : 5 (5 improvements)
0.79/0.83 c First Solution : +1.90000000000000e+01 (in run 1, after 24 nodes, 0.42 seconds, depth 22, found by <relaxation>)
0.79/0.83 c Primal Bound : +3.00000000000000e+00 (in run 1, after 114 nodes, 0.68 seconds, depth 24, found by <relaxation>)
0.79/0.83 c Dual Bound : +3.00000000000000e+00
0.79/0.83 c Gap : 0.00 %
0.79/0.83 c Root Dual Bound : +3.00000000000000e+00
0.79/0.83 c Root Iterations : 185
0.79/0.84 c Time complete: 0.83.