0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: NONE] [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-2664711-1276471278.opb>
0.01/0.03 c original problem has 200 variables (200 bin, 0 int, 0 impl, 0 cont) and 900 constraints
0.01/0.03 c problem read
0.01/0.03 c presolving settings loaded
0.01/0.03 c [src/scip/lpi_none.c:41] ERROR: there is no LP solver linked to the binary (LPS=none); you should set the parameter <lp/solvefreq> to <-1> to avoid solving LPs
0.01/0.03 c presolving:
0.01/0.04 c (round 1) 0 del vars, 0 del conss, 4 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 788 impls, 0 clqs
0.01/0.04 c (round 2) 8 del vars, 71 del conss, 8 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 812 impls, 0 clqs
0.01/0.04 c (round 3) 13 del vars, 94 del conss, 10 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 838 impls, 0 clqs
0.01/0.05 c (round 4) 22 del vars, 161 del conss, 19 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 844 impls, 0 clqs
0.01/0.05 c (round 5) 25 del vars, 197 del conss, 22 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 962 impls, 0 clqs
0.01/0.07 c (round 6) 25 del vars, 215 del conss, 22 chg bounds, 17 chg sides, 0 chg coeffs, 0 upgd conss, 984 impls, 0 clqs
0.01/0.09 c (round 7) 25 del vars, 217 del conss, 22 chg bounds, 17 chg sides, 0 chg coeffs, 685 upgd conss, 984 impls, 0 clqs
0.09/0.11 c (round 8) 48 del vars, 217 del conss, 22 chg bounds, 17 chg sides, 0 chg coeffs, 685 upgd conss, 2166 impls, 0 clqs
0.09/0.11 c (round 9) 48 del vars, 402 del conss, 22 chg bounds, 17 chg sides, 0 chg coeffs, 685 upgd conss, 2168 impls, 0 clqs
0.09/0.12 c (round 10) 48 del vars, 405 del conss, 22 chg bounds, 17 chg sides, 0 chg coeffs, 685 upgd conss, 2168 impls, 0 clqs
0.09/0.12 c presolving (11 rounds):
0.09/0.12 c 48 deleted vars, 405 deleted constraints, 22 tightened bounds, 0 added holes, 17 changed sides, 0 changed coefficients
0.09/0.12 c 2168 implications, 0 cliques
0.09/0.12 c presolved problem has 152 variables (152 bin, 0 int, 0 impl, 0 cont) and 495 constraints
0.09/0.12 c 495 constraints of type <logicor>
0.09/0.12 c transformed objective value is always integral (scale: 1)
0.09/0.12 c Presolving Time: 0.08
0.09/0.12 c - non default parameters ----------------------------------------------------------------------
0.09/0.12 c # SCIP version 1.2.1.2
0.09/0.12 c
0.09/0.12 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.12 c conflict/interconss = 0
0.09/0.12 c
0.09/0.12 c # should binary conflicts be preferred?
0.09/0.12 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.12 c conflict/preferbinary = TRUE
0.09/0.12 c
0.09/0.12 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.12 c constraints/agelimit = 1
0.09/0.12 c
0.09/0.12 c # should enforcement of pseudo solution be disabled?
0.09/0.12 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.12 c constraints/disableenfops = TRUE
0.09/0.12 c
0.09/0.12 c # frequency for displaying node information lines
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.12 c display/freq = 10000
0.09/0.12 c
0.09/0.12 c # maximal time in seconds to run
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.12 c limits/time = 1799.98
0.09/0.12 c
0.09/0.12 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.12 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.12 c limits/memory = 1620
0.09/0.12 c
0.09/0.12 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.09/0.12 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.12 c lp/solvefreq = -1
0.09/0.12 c
0.09/0.12 c # LP pricing strategy ('l'pi default, 'a'uto, 'f'ull pricing, 'p'artial, 's'teepest edge pricing, 'q'uickstart steepest edge pricing, 'd'evex pricing)
0.09/0.12 c # [type: char, range: {lafpsqd}, default: l]
0.09/0.12 c lp/pricing = a
0.09/0.12 c
0.09/0.12 c # should presolving try to simplify inequalities
0.09/0.12 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.12 c constraints/linear/simplifyinequalities = TRUE
0.09/0.12 c
0.09/0.12 c # should presolving try to simplify knapsacks
0.09/0.12 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.12 c constraints/knapsack/simplifyinequalities = TRUE
0.09/0.12 c
0.09/0.12 c # priority of node selection rule <dfs> in standard mode
0.09/0.12 c # [type: int, range: [-536870912,536870911], default: 0]
0.09/0.12 c nodeselection/dfs/stdpriority = 1000000
0.09/0.12 c
0.09/0.12 c -----------------------------------------------------------------------------------------------
0.09/0.12 c start solving
0.09/0.12 c
0.09/0.13 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.09/0.13 c 0.1s| 1 | 2 | 0 | - |1242k| 0 | - | 152 | 495 | 0 | 0 | 0 | 0 | 0 | 2.400000e+01 | -- | Inf
0.09/0.16 o 96
0.09/0.16 c * 0.1s| 76 | 9 | 0 | 0.0 |1253k| 18 | - | 152 | 509 | 0 | 0 | 0 | 33 | 0 | 2.700000e+01 | 9.600000e+01 | 255.56%
0.09/0.16 o 95
0.09/0.16 c * 0.1s| 106 | 10 | 0 | 0.0 |1256k| 20 | - | 152 | 509 | 0 | 0 | 0 | 44 | 0 | 2.700000e+01 | 9.500000e+01 | 251.85%
0.09/0.19 o 94
0.09/0.19 c * 0.1s| 258 | 12 | 0 | 0.0 |1257k| 20 | - | 152 | 508 | 0 | 0 | 0 | 105 | 0 | 3.000000e+01 | 9.400000e+01 | 213.33%
0.19/0.20 o 90
0.19/0.20 c * 0.1s| 290 | 16 | 0 | 0.0 |1261k| 32 | - | 152 | 506 | 0 | 0 | 0 | 113 | 0 | 3.000000e+01 | 9.000000e+01 | 200.00%
0.19/0.29 c
0.19/0.29 c SCIP Status : problem is solved [optimal solution found]
0.19/0.29 c Solving Time (sec) : 0.21
0.19/0.29 c Solving Nodes : 711
0.19/0.29 c Primal Bound : +9.00000000000000e+01 (4 solutions)
0.19/0.29 c Dual Bound : +9.00000000000000e+01
0.19/0.29 c Gap : 0.00 %
0.19/0.29 s OPTIMUM FOUND
0.19/0.29 v -x200 x199 x198 -x197 -x196 x195 -x194 x193 -x192 x191 -x190 -x189 -x188 x187 -x186 x185 -x184 x183 -x182 x181 x180 -x179 -x178
0.19/0.29 v x177 -x176 x175 -x174 x173 x172 -x171 x170 -x169 x168 -x167 -x166 x165 -x164 x163 -x162 -x161 -x160 -x159 -x158 x157 -x156 x155
0.19/0.29 v -x154 x153 x152 -x151 -x150 x149 -x148 x147 -x146 -x145 x144 -x143 -x142 x141 -x140 x139 -x138 x137 -x136 x135 x134 -x133
0.19/0.29 v -x132 x131 -x130 x129 x128 -x127 -x126 x125 x124 -x123 -x122 x121 -x120 x119 -x118 x117 -x116 -x115 -x114 x113 -x112 x111 -x110
0.19/0.29 v x109 x108 -x107 -x106 x105 -x104 x103 x102 -x101 x100 -x99 -x98 x97 -x96 x95 -x94 x93 -x92 x91 -x90 x89 -x88 -x87 x86 -x85
0.19/0.29 v -x84 x83 x82 -x81 -x80 -x79 -x78 x77 -x76 x75 x74 -x73 x72 -x71 -x70 x69 x68 -x67 -x66 x65 x64 -x63 x62 -x61 -x60 x59 -x58
0.19/0.29 v x57 -x56 x55 -x54 x53 -x52 x51 x50 -x49 x48 -x47 x46 -x45 x44 -x43 -x42 x41 -x40 x39 x38 -x37 -x36 -x35 -x34 x33 x32 -x31 x30
0.19/0.29 v -x29 x28 -x27 x26 -x25 x24 -x23 -x22 x21 x20 -x19 -x18 -x17 -x16 x15 x14 -x13 -x12 x11 x10 -x9 x8 -x7 -x6 x5 -x4 x3 -x2 -x1
0.19/0.29 c SCIP Status : problem is solved [optimal solution found]
0.19/0.29 c Solving Time : 0.21
0.19/0.29 c Original Problem :
0.19/0.29 c Problem name : HOME/instance-2664711-1276471278.opb
0.19/0.29 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
0.19/0.29 c Constraints : 900 initial, 900 maximal
0.19/0.29 c Presolved Problem :
0.19/0.29 c Problem name : t_HOME/instance-2664711-1276471278.opb
0.19/0.29 c Variables : 152 (152 binary, 0 integer, 0 implicit integer, 0 continuous)
0.19/0.29 c Constraints : 495 initial, 521 maximal
0.19/0.29 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.19/0.29 c trivial : 0.00 4 0 0 0 0 0 0 0
0.19/0.29 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.19/0.29 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.19/0.29 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.19/0.29 c implics : 0.00 0 3 0 0 0 0 0 0
0.19/0.29 c probing : 0.02 23 0 0 0 0 0 0 0
0.19/0.29 c linear : 0.03 18 0 0 22 0 215 17 0
0.19/0.29 c logicor : 0.03 0 0 0 0 0 190 0 0
0.19/0.29 c root node : - 105 - - 105 - - - -
0.19/0.29 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.19/0.29 c integral : 0 0 0 0 0 0 0 0 0 0
0.19/0.29 c logicor : 495+ 0 3689 0 4 273 6641 0 0 0
0.19/0.29 c countsols : 0 0 0 0 4 0 0 0 0 0
0.19/0.29 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.19/0.29 c integral : 0.00 0.00 0.00 0.00 0.00
0.19/0.29 c logicor : 0.05 0.00 0.05 0.00 0.00
0.19/0.29 c countsols : 0.00 0.00 0.00 0.00 0.00
0.19/0.29 c Propagators : Time Calls Cutoffs DomReds
0.19/0.29 c vbounds : 0.00 2 0 0
0.19/0.29 c rootredcost : 0.01 0 0 0
0.19/0.29 c pseudoobj : 0.03 3596 115 2312
0.19/0.29 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.19/0.29 c propagation : 0.01 268 261 261 8.3 6 4.5 -
0.19/0.29 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.19/0.29 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.19/0.29 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.19/0.29 c pseudo solution : 0.00 3 0 0 0.0 0 0.0 -
0.19/0.29 c applied globally : - - - 267 8.2 - - -
0.19/0.29 c applied locally : - - - 0 0.0 - - -
0.19/0.29 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.19/0.29 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.19/0.29 c redcost : 0.00 0 0 0 0 0
0.19/0.29 c impliedbounds : 0.00 0 0 0 0 0
0.19/0.29 c intobj : 0.00 0 0 0 0 0
0.19/0.29 c cgmip : 0.00 0 0 0 0 0
0.19/0.29 c gomory : 0.00 0 0 0 0 0
0.19/0.29 c strongcg : 0.00 0 0 0 0 0
0.19/0.29 c cmir : 0.00 0 0 0 0 0
0.19/0.29 c flowcover : 0.00 0 0 0 0 0
0.19/0.29 c clique : 0.00 0 0 0 0 0
0.19/0.29 c zerohalf : 0.00 0 0 0 0 0
0.19/0.29 c mcf : 0.00 0 0 0 0 0
0.19/0.29 c rapidlearning : 0.00 0 0 0 0 0
0.19/0.29 c Pricers : Time Calls Vars
0.19/0.29 c problem variables: 0.00 0 0
0.19/0.29 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.19/0.29 c relpscost : 0.00 0 0 0 0 0 0
0.19/0.29 c pscost : 0.00 0 0 0 0 0 0
0.19/0.29 c inference : 0.01 429 0 0 0 0 858
0.19/0.29 c mostinf : 0.00 0 0 0 0 0 0
0.19/0.29 c leastinf : 0.00 0 0 0 0 0 0
0.19/0.29 c fullstrong : 0.00 0 0 0 0 0 0
0.19/0.29 c allfullstrong : 0.00 0 0 0 0 0 0
0.19/0.29 c random : 0.00 0 0 0 0 0 0
0.19/0.29 c Primal Heuristics : Time Calls Found
0.19/0.29 c LP solutions : 0.00 - 0
0.19/0.29 c pseudo solutions : 0.00 - 4
0.19/0.29 c oneopt : 0.00 0 0
0.19/0.29 c trivial : 0.00 2 0
0.19/0.29 c simplerounding : 0.00 0 0
0.19/0.29 c zirounding : 0.00 0 0
0.19/0.29 c rounding : 0.00 0 0
0.19/0.29 c shifting : 0.00 0 0
0.19/0.29 c intshifting : 0.00 0 0
0.19/0.29 c twoopt : 0.00 0 0
0.19/0.29 c fixandinfer : 0.00 0 0
0.19/0.29 c feaspump : 0.00 0 0
0.19/0.29 c coefdiving : 0.00 0 0
0.19/0.29 c pscostdiving : 0.00 0 0
0.19/0.29 c fracdiving : 0.00 0 0
0.19/0.29 c veclendiving : 0.00 0 0
0.19/0.29 c intdiving : 0.00 0 0
0.19/0.29 c actconsdiving : 0.00 0 0
0.19/0.29 c objpscostdiving : 0.00 0 0
0.19/0.29 c rootsoldiving : 0.00 0 0
0.19/0.29 c linesearchdiving : 0.00 0 0
0.19/0.29 c guideddiving : 0.00 0 0
0.19/0.29 c octane : 0.00 0 0
0.19/0.29 c rens : 0.00 0 0
0.19/0.29 c rins : 0.00 0 0
0.19/0.29 c localbranching : 0.00 0 0
0.19/0.29 c mutation : 0.00 0 0
0.19/0.29 c crossover : 0.00 0 0
0.19/0.29 c dins : 0.00 0 0
0.19/0.29 c undercover : 0.00 0 0
0.19/0.29 c nlp : 0.00 0 0
0.19/0.29 c trysol : 0.00 0 0
0.19/0.29 c LP : Time Calls Iterations Iter/call Iter/sec
0.19/0.29 c primal LP : 0.00 0 0 0.00 -
0.19/0.29 c dual LP : 0.00 0 0 0.00 -
0.19/0.29 c lex dual LP : 0.00 0 0 0.00 -
0.19/0.29 c barrier LP : 0.00 0 0 0.00 -
0.19/0.29 c diving/probing LP: 0.00 0 0 0.00 -
0.19/0.29 c strong branching : 0.00 0 0 0.00 -
0.19/0.29 c (at root node) : - 0 0 0.00 -
0.19/0.29 c conflict analysis: 0.00 0 0 0.00 -
0.19/0.29 c B&B Tree :
0.19/0.29 c number of runs : 1
0.19/0.29 c nodes : 711
0.19/0.29 c nodes (total) : 711
0.19/0.29 c nodes left : 0
0.19/0.29 c max depth : 32
0.19/0.29 c max depth (total): 32
0.19/0.29 c backtracks : 183 (25.7%)
0.19/0.29 c delayed cutoffs : 134
0.19/0.29 c repropagations : 313 (3034 domain reductions, 108 cutoffs)
0.19/0.29 c avg switch length: 2.32
0.19/0.29 c switching time : 0.01
0.19/0.29 c Solution :
0.19/0.29 c Solutions found : 4 (4 improvements)
0.19/0.29 c First Solution : +9.60000000000000e+01 (in run 1, after 76 nodes, 0.10 seconds, depth 18, found by <relaxation>)
0.19/0.29 c Primal Bound : +9.00000000000000e+01 (in run 1, after 290 nodes, 0.14 seconds, depth 32, found by <relaxation>)
0.19/0.29 c Dual Bound : +9.00000000000000e+01
0.19/0.29 c Gap : 0.00 %
0.19/0.29 c Root Dual Bound : +2.40000000000000e+01
0.19/0.29 c Root Iterations : 0
0.19/0.30 c Time complete: 0.29.