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-2664776-1276593209.opb>
0.00/0.03 c original problem has 220 variables (220 bin, 0 int, 0 impl, 0 cont) and 515 constraints
0.00/0.03 c problem read
0.00/0.03 c presolving settings loaded
0.00/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.00/0.04 o 220
0.00/0.04 o 211
0.00/0.04 c feasible solution found by trivial heuristic, objective value 2.110000e+02
0.00/0.04 c presolving:
0.00/0.06 c (round 1) 0 del vars, 5 del conss, 0 chg bounds, 4 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs
0.00/0.08 c (round 2) 0 del vars, 47 del conss, 0 chg bounds, 4 chg sides, 0 chg coeffs, 510 upgd conss, 0 impls, 0 clqs
0.00/0.08 c (0.0s) probing: 101/220 (45.9%) - 0 fixings, 0 aggregations, 0 implications, 0 bound changes
0.00/0.08 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.00/0.08 c presolving (3 rounds):
0.00/0.08 c 0 deleted vars, 47 deleted constraints, 0 tightened bounds, 0 added holes, 4 changed sides, 0 changed coefficients
0.00/0.08 c 0 implications, 0 cliques
0.00/0.08 c presolved problem has 220 variables (220 bin, 0 int, 0 impl, 0 cont) and 468 constraints
0.00/0.08 c 468 constraints of type <logicor>
0.00/0.08 c transformed objective value is always integral (scale: 1)
0.00/0.08 c Presolving Time: 0.04
0.00/0.08 c - non default parameters ----------------------------------------------------------------------
0.00/0.08 c # SCIP version 1.2.1.2
0.00/0.08 c
0.00/0.08 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.08 c conflict/interconss = 0
0.00/0.08 c
0.00/0.08 c # should binary conflicts be preferred?
0.00/0.08 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.08 c conflict/preferbinary = TRUE
0.00/0.08 c
0.00/0.08 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.08 c constraints/agelimit = 1
0.00/0.08 c
0.00/0.08 c # should enforcement of pseudo solution be disabled?
0.00/0.08 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.08 c constraints/disableenfops = TRUE
0.00/0.08 c
0.00/0.08 c # frequency for displaying node information lines
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.08 c display/freq = 10000
0.00/0.08 c
0.00/0.08 c # maximal time in seconds to run
0.00/0.08 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.08 c limits/time = 1799.97
0.00/0.08 c
0.00/0.08 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.08 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.08 c limits/memory = 1620
0.00/0.08 c
0.00/0.08 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.08 c lp/solvefreq = -1
0.00/0.08 c
0.00/0.08 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.00/0.08 c # [type: char, range: {lafpsqd}, default: l]
0.00/0.08 c lp/pricing = a
0.00/0.08 c
0.00/0.08 c # should presolving try to simplify inequalities
0.00/0.08 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.08 c constraints/linear/simplifyinequalities = TRUE
0.00/0.08 c
0.00/0.09 c # should presolving try to simplify knapsacks
0.00/0.09 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.09 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.09 c
0.00/0.09 c # priority of node selection rule <dfs> in standard mode
0.00/0.09 c # [type: int, range: [-536870912,536870911], default: 0]
0.00/0.09 c nodeselection/dfs/stdpriority = 1000000
0.00/0.09 c
0.00/0.09 c -----------------------------------------------------------------------------------------------
0.00/0.09 c start solving
0.00/0.09 c
0.00/0.09 o 189
0.00/0.09 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.09 c t 0.0s| 1 | 0 | 0 | - |1501k| 0 | - | 220 | 468 | 0 | 0 | 0 | 0 | 0 | -- | 1.890000e+02 | Inf
0.00/0.09 c 0.0s| 1 | 2 | 0 | - |1495k| 0 | - | 220 | 468 | 0 | 0 | 0 | 0 | 0 | 0.000000e+00 | 1.890000e+02 | Inf
0.09/0.10 o 6
0.09/0.10 c * 0.1s| 201 | 188 | 0 | 0.0 |1583k| 200 | - | 220 | 468 | 0 | 0 | 0 | 0 | 0 | 1.000000e+00 | 6.000000e+00 | 500.00%
0.09/0.13 o 5
0.09/0.13 c * 0.1s| 325 | 183 | 0 | 0.0 |1593k| 200 | - | 220 | 470 | 0 | 0 | 0 | 73 | 0 | 1.000000e+00 | 5.000000e+00 | 400.00%
2.59/2.63 c 2.3s| 10000 | 89 | 0 | 0.0 |1595k| 200 | - | 220 | 468 | 0 | 0 | 0 |5869 | 0 | 1.000000e+00 | 5.000000e+00 | 400.00%
4.19/4.20 o 4
4.19/4.20 c * 3.7s| 15519 | 57 | 0 | 0.0 |1603k| 200 | - | 220 | 471 | 0 | 0 | 0 |8773 | 0 | 1.000000e+00 | 4.000000e+00 | 300.00%
5.60/5.60 c 5.1s| 20000 | 28 | 0 | 0.0 |1596k| 200 | - | 220 | 468 | 0 | 0 | 0 | 10k| 0 | 1.000000e+00 | 4.000000e+00 | 300.00%
6.49/6.53 c
6.49/6.53 c SCIP Status : problem is solved [optimal solution found]
6.49/6.53 c Solving Time (sec) : 5.92
6.49/6.53 c Solving Nodes : 22672
6.49/6.53 c Primal Bound : +4.00000000000000e+00 (7 solutions)
6.49/6.53 c Dual Bound : +4.00000000000000e+00
6.49/6.53 c Gap : 0.00 %
6.49/6.53 s OPTIMUM FOUND
6.49/6.53 v -x220 -x219 -x218 -x217 -x216 -x215 -x214 -x213 -x212 -x211 -x210 -x209 -x208 -x207 -x206 -x205 -x204 -x203 -x202 -x201 x200 -x199
6.49/6.53 v -x198 -x197 -x196 -x195 -x194 -x193 -x192 -x191 -x190 -x189 -x188 -x187 -x186 -x185 -x184 -x183 -x182 -x181 -x180 -x179 -x178
6.49/6.53 v -x177 -x176 -x175 -x174 -x173 -x172 -x171 -x170 -x169 x168 -x167 -x166 -x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157
6.49/6.53 v -x156 -x155 -x154 -x153 -x152 -x151 -x150 -x149 -x148 -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137
6.49/6.53 v -x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127 -x126 -x125 -x124 -x123 -x122 -x121 x120 -x119 -x118 -x117 -x116
6.49/6.53 v -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106 -x105 -x104 -x103 -x102 -x101 -x100 -x99 -x98 -x97 -x96 -x95 -x94
6.49/6.53 v -x93 -x92 -x91 -x90 -x89 -x88 -x87 -x86 -x85 -x84 -x83 -x82 -x81 -x80 -x79 -x78 -x77 -x76 -x75 -x74 -x73 -x72 -x71 -x70 -x69
6.49/6.53 v -x68 -x67 -x66 -x65 -x64 -x63 -x62 -x61 -x60 -x59 -x58 -x57 -x56 -x55 -x54 -x53 -x52 -x51 -x50 -x49 -x48 -x47 -x46 -x45 -x44
6.49/6.53 v -x43 -x42 -x41 -x40 -x39 -x38 -x37 -x36 -x35 -x34 -x33 -x32 -x31 -x30 -x29 -x28 -x27 -x26 -x25 -x24 -x23 -x22 -x21 -x20 -x19
6.49/6.53 v -x18 -x17 x16 -x15 -x14 -x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 -x1
6.49/6.53 c SCIP Status : problem is solved [optimal solution found]
6.49/6.53 c Solving Time : 5.92
6.49/6.53 c Original Problem :
6.49/6.53 c Problem name : HOME/instance-2664776-1276593209.opb
6.49/6.53 c Variables : 220 (220 binary, 0 integer, 0 implicit integer, 0 continuous)
6.49/6.53 c Constraints : 515 initial, 515 maximal
6.49/6.53 c Presolved Problem :
6.49/6.53 c Problem name : t_HOME/instance-2664776-1276593209.opb
6.49/6.53 c Variables : 220 (220 binary, 0 integer, 0 implicit integer, 0 continuous)
6.49/6.53 c Constraints : 468 initial, 494 maximal
6.49/6.53 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
6.49/6.53 c trivial : 0.00 0 0 0 0 0 0 0 0
6.49/6.53 c dualfix : 0.00 0 0 0 0 0 0 0 0
6.49/6.53 c boundshift : 0.00 0 0 0 0 0 0 0 0
6.49/6.53 c inttobinary : 0.00 0 0 0 0 0 0 0 0
6.49/6.53 c implics : 0.00 0 0 0 0 0 0 0 0
6.49/6.53 c probing : 0.01 0 0 0 0 0 0 0 0
6.49/6.53 c linear : 0.02 0 0 0 0 0 5 4 0
6.49/6.53 c logicor : 0.01 0 0 0 0 0 42 0 0
6.49/6.53 c root node : - 200 - - 200 - - - -
6.49/6.53 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
6.49/6.53 c integral : 0 0 0 0 0 0 0 0 0 0
6.49/6.53 c logicor : 468+ 0 47616 0 1 10374 152504 0 0 0
6.49/6.53 c countsols : 0 0 0 0 3 0 0 0 0 0
6.49/6.53 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
6.49/6.53 c integral : 0.00 0.00 0.00 0.00 0.00
6.49/6.53 c logicor : 1.56 0.00 1.56 0.00 0.00
6.49/6.53 c countsols : 0.00 0.00 0.00 0.00 0.00
6.49/6.53 c Propagators : Time Calls Cutoffs DomReds
6.49/6.53 c vbounds : 0.05 2 0 0
6.49/6.53 c rootredcost : 0.04 0 0 0
6.49/6.53 c pseudoobj : 1.94 85468 2862 701005
6.49/6.53 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
6.49/6.53 c propagation : 1.01 12318 12316 12316 29.6 298 43.5 -
6.49/6.53 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
6.49/6.53 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
6.49/6.53 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
6.49/6.53 c pseudo solution : 0.00 2 2 2 7.0 0 0.0 -
6.49/6.53 c applied globally : - - - 8508 15.2 - - -
6.49/6.53 c applied locally : - - - 3963 60.0 - - -
6.49/6.53 c Separators : Time Calls Cutoffs DomReds Cuts Conss
6.49/6.53 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
6.49/6.53 c redcost : 0.00 0 0 0 0 0
6.49/6.53 c impliedbounds : 0.00 0 0 0 0 0
6.49/6.53 c intobj : 0.00 0 0 0 0 0
6.49/6.53 c cgmip : 0.00 0 0 0 0 0
6.49/6.53 c gomory : 0.00 0 0 0 0 0
6.49/6.53 c strongcg : 0.00 0 0 0 0 0
6.49/6.53 c cmir : 0.00 0 0 0 0 0
6.49/6.53 c flowcover : 0.00 0 0 0 0 0
6.49/6.53 c clique : 0.00 0 0 0 0 0
6.49/6.53 c zerohalf : 0.00 0 0 0 0 0
6.49/6.53 c mcf : 0.00 0 0 0 0 0
6.49/6.53 c rapidlearning : 0.00 0 0 0 0 0
6.49/6.53 c Pricers : Time Calls Vars
6.49/6.53 c problem variables: 0.00 0 0
6.49/6.53 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
6.49/6.53 c relpscost : 0.00 0 0 0 0 0 0
6.49/6.53 c pscost : 0.00 0 0 0 0 0 0
6.49/6.53 c inference : 0.33 15217 0 0 0 0 30434
6.49/6.53 c mostinf : 0.00 0 0 0 0 0 0
6.49/6.53 c leastinf : 0.00 0 0 0 0 0 0
6.49/6.53 c fullstrong : 0.00 0 0 0 0 0 0
6.49/6.53 c allfullstrong : 0.00 0 0 0 0 0 0
6.49/6.53 c random : 0.00 0 0 0 0 0 0
6.49/6.53 c Primal Heuristics : Time Calls Found
6.49/6.53 c LP solutions : 0.00 - 0
6.49/6.53 c pseudo solutions : 0.00 - 3
6.49/6.53 c oneopt : 0.01 0 0
6.49/6.53 c trivial : 0.00 2 4
6.49/6.53 c simplerounding : 0.00 0 0
6.49/6.53 c zirounding : 0.00 0 0
6.49/6.53 c rounding : 0.00 0 0
6.49/6.53 c shifting : 0.00 0 0
6.49/6.53 c intshifting : 0.00 0 0
6.49/6.53 c twoopt : 0.00 0 0
6.49/6.53 c fixandinfer : 0.00 0 0
6.49/6.53 c feaspump : 0.00 0 0
6.49/6.53 c coefdiving : 0.00 0 0
6.49/6.53 c pscostdiving : 0.00 0 0
6.49/6.53 c fracdiving : 0.00 0 0
6.49/6.53 c veclendiving : 0.00 0 0
6.49/6.53 c intdiving : 0.00 0 0
6.49/6.53 c actconsdiving : 0.00 0 0
6.49/6.53 c objpscostdiving : 0.00 0 0
6.49/6.53 c rootsoldiving : 0.00 0 0
6.49/6.53 c linesearchdiving : 0.00 0 0
6.49/6.53 c guideddiving : 0.00 0 0
6.49/6.53 c octane : 0.00 0 0
6.49/6.53 c rens : 0.00 0 0
6.49/6.53 c rins : 0.00 0 0
6.49/6.53 c localbranching : 0.00 0 0
6.49/6.53 c mutation : 0.00 0 0
6.49/6.53 c crossover : 0.00 0 0
6.49/6.53 c dins : 0.00 0 0
6.49/6.53 c undercover : 0.00 0 0
6.49/6.53 c nlp : 0.01 0 0
6.49/6.53 c trysol : 0.00 0 0
6.49/6.53 c LP : Time Calls Iterations Iter/call Iter/sec
6.49/6.53 c primal LP : 0.00 0 0 0.00 -
6.49/6.53 c dual LP : 0.00 0 0 0.00 -
6.49/6.53 c lex dual LP : 0.00 0 0 0.00 -
6.49/6.53 c barrier LP : 0.00 0 0 0.00 -
6.49/6.53 c diving/probing LP: 0.00 0 0 0.00 -
6.49/6.53 c strong branching : 0.00 0 0 0.00 -
6.49/6.53 c (at root node) : - 0 0 0.00 -
6.49/6.53 c conflict analysis: 0.00 0 0 0.00 -
6.49/6.53 c B&B Tree :
6.49/6.53 c number of runs : 1
6.49/6.53 c nodes : 22672
6.49/6.53 c nodes (total) : 22672
6.49/6.53 c nodes left : 0
6.49/6.53 c max depth : 200
6.49/6.53 c max depth (total): 200
6.49/6.53 c backtracks : 11222 (49.5%)
6.49/6.53 c delayed cutoffs : 7746
6.49/6.53 c repropagations : 38256 (340440 domain reductions, 5786 cutoffs)
6.49/6.53 c avg switch length: 4.47
6.49/6.53 c switching time : 0.83
6.49/6.53 c Solution :
6.49/6.53 c Solutions found : 7 (6 improvements)
6.49/6.53 c First Solution : +2.20000000000000e+02 (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
6.49/6.53 c Primal Bound : +4.00000000000000e+00 (in run 1, after 15519 nodes, 3.74 seconds, depth 63, found by <relaxation>)
6.49/6.53 c Dual Bound : +4.00000000000000e+00
6.49/6.53 c Gap : 0.00 %
6.49/6.53 c Root Dual Bound : +0.00000000000000e+00
6.49/6.53 c Root Iterations : 0
6.49/6.54 c Time complete: 6.53.