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-2664669-1276447975.opb>
0.00/0.02 c original problem has 200 variables (200 bin, 0 int, 0 impl, 0 cont) and 900 constraints
0.00/0.02 c problem read
0.00/0.02 c presolving settings loaded
0.00/0.02 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.03 c presolving:
0.06/0.08 c (round 1) 0 del vars, 20 del conss, 0 chg bounds, 20 chg sides, 0 chg coeffs, 880 upgd conss, 584 impls, 0 clqs
0.09/0.11 c presolving (2 rounds):
0.09/0.11 c 0 deleted vars, 20 deleted constraints, 0 tightened bounds, 0 added holes, 20 changed sides, 0 changed coefficients
0.09/0.11 c 976 implications, 0 cliques
0.09/0.11 c presolved problem has 200 variables (200 bin, 0 int, 0 impl, 0 cont) and 880 constraints
0.09/0.11 c 880 constraints of type <logicor>
0.09/0.11 c transformed objective value is always integral (scale: 1)
0.09/0.11 c Presolving Time: 0.06
0.09/0.11 c - non default parameters ----------------------------------------------------------------------
0.09/0.11 c # SCIP version 1.2.1.2
0.09/0.11 c
0.09/0.11 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.11 c conflict/interconss = 0
0.09/0.11 c
0.09/0.11 c # should binary conflicts be preferred?
0.09/0.11 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.11 c conflict/preferbinary = TRUE
0.09/0.11 c
0.09/0.11 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.11 c constraints/agelimit = 1
0.09/0.11 c
0.09/0.11 c # should enforcement of pseudo solution be disabled?
0.09/0.11 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.11 c constraints/disableenfops = TRUE
0.09/0.11 c
0.09/0.11 c # frequency for displaying node information lines
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.11 c display/freq = 10000
0.09/0.11 c
0.09/0.11 c # maximal time in seconds to run
0.09/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.11 c limits/time = 1799.98
0.09/0.11 c
0.09/0.11 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.11 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.11 c limits/memory = 1620
0.09/0.11 c
0.09/0.11 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.09/0.11 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.11 c lp/solvefreq = -1
0.09/0.11 c
0.09/0.11 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.11 c # [type: char, range: {lafpsqd}, default: l]
0.09/0.11 c lp/pricing = a
0.09/0.11 c
0.09/0.11 c # should presolving try to simplify inequalities
0.09/0.11 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.11 c constraints/linear/simplifyinequalities = TRUE
0.09/0.11 c
0.09/0.11 c # should presolving try to simplify knapsacks
0.09/0.11 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.11 c constraints/knapsack/simplifyinequalities = TRUE
0.09/0.11 c
0.09/0.11 c # priority of node selection rule <dfs> in standard mode
0.09/0.11 c # [type: int, range: [-536870912,536870911], default: 0]
0.09/0.11 c nodeselection/dfs/stdpriority = 1000000
0.09/0.11 c
0.09/0.11 c -----------------------------------------------------------------------------------------------
0.09/0.11 c start solving
0.09/0.11 c
0.09/0.11 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.11 c 0.1s| 1 | 2 | 0 | - |1348k| 0 | - | 200 | 880 | 0 | 0 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.18 o 96
0.09/0.18 c * 0.1s| 157 | 8 | 0 | 0.0 |1364k| 21 | - | 200 | 905 | 0 | 0 | 0 | 86 | 0 | 3.000000e+00 | 9.600000e+01 |3100.00%
0.09/0.19 o 95
0.09/0.19 c * 0.1s| 165 | 6 | 0 | 0.0 |1366k| 21 | - | 200 | 906 | 0 | 0 | 0 | 88 | 0 | 3.000000e+00 | 9.500000e+01 |3066.67%
0.19/0.20 o 93
0.19/0.20 c * 0.1s| 201 | 6 | 0 | 0.0 |1370k| 25 | - | 200 | 908 | 0 | 0 | 0 | 102 | 0 | 3.000000e+00 | 9.300000e+01 |3000.00%
0.19/0.22 o 91
0.19/0.22 c * 0.2s| 267 | 14 | 0 | 0.0 |1374k| 33 | - | 200 | 905 | 0 | 0 | 0 | 122 | 0 | 3.000000e+00 | 9.100000e+01 |2933.33%
0.79/0.85 o 90
0.79/0.85 c * 0.7s| 1809 | 14 | 0 | 0.0 |1380k| 33 | - | 200 | 921 | 0 | 0 | 0 | 939 | 0 | 5.000000e+00 | 9.000000e+01 |1700.00%
3.49/3.54 o 89
3.49/3.54 c * 3.1s| 9363 | 9 | 0 | 0.0 |1394k| 35 | - | 200 | 956 | 0 | 0 | 0 |4451 | 0 | 8.000000e+00 | 8.900000e+01 |1012.50%
3.68/3.71 c 3.2s| 10000 | 12 | 0 | 0.0 |1399k| 35 | - | 200 | 970 | 0 | 0 | 0 |4693 | 0 | 8.000000e+00 | 8.900000e+01 |1012.50%
4.29/4.38 c
4.29/4.38 c SCIP Status : problem is solved [optimal solution found]
4.29/4.38 c Solving Time (sec) : 3.84
4.29/4.38 c Solving Nodes : 12056
4.29/4.38 c Primal Bound : +8.90000000000000e+01 (6 solutions)
4.29/4.38 c Dual Bound : +8.90000000000000e+01
4.29/4.38 c Gap : 0.00 %
4.29/4.38 s OPTIMUM FOUND
4.29/4.38 v -x200 x199 -x198 x197 x196 -x195 -x194 x193 -x192 x191 -x190 x189 -x188 x187 -x186 x185 -x184 x183 -x182 x181 -x180 -x179 x178
4.29/4.38 v -x177 -x176 x175 -x174 x173 -x172 x171 x170 -x169 x168 -x167 -x166 x165 -x164 x163 x162 -x161 -x160 x159 x158 -x157 -x156 x155
4.29/4.38 v x154 -x153 x152 -x151 -x150 x149 -x148 x147 -x146 x145 -x144 x143 -x142 x141 -x140 -x139 -x138 x137 x136 -x135 -x134 x133 -x132
4.29/4.38 v -x131 -x130 x129 x128 -x127 x126 -x125 -x124 x123 -x122 x121 x120 -x119 -x118 x117 x116 -x115 -x114 -x113 -x112 x111 -x110
4.29/4.38 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
4.29/4.38 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 x57
4.29/4.38 v 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
4.29/4.38 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
4.29/4.38 c SCIP Status : problem is solved [optimal solution found]
4.29/4.38 c Solving Time : 3.84
4.29/4.38 c Original Problem :
4.29/4.38 c Problem name : HOME/instance-2664669-1276447975.opb
4.29/4.38 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
4.29/4.38 c Constraints : 900 initial, 900 maximal
4.29/4.38 c Presolved Problem :
4.29/4.38 c Problem name : t_HOME/instance-2664669-1276447975.opb
4.29/4.38 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
4.29/4.38 c Constraints : 880 initial, 982 maximal
4.29/4.38 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
4.29/4.38 c trivial : 0.00 0 0 0 0 0 0 0 0
4.29/4.38 c dualfix : 0.00 0 0 0 0 0 0 0 0
4.29/4.38 c boundshift : 0.00 0 0 0 0 0 0 0 0
4.29/4.38 c inttobinary : 0.00 0 0 0 0 0 0 0 0
4.29/4.38 c implics : 0.00 0 0 0 0 0 0 0 0
4.29/4.38 c probing : 0.01 0 0 0 0 0 0 0 0
4.29/4.38 c linear : 0.03 0 0 0 0 0 20 20 0
4.29/4.38 c logicor : 0.02 0 0 0 0 0 0 0 0
4.29/4.38 c root node : - 142 - - 142 - - - -
4.29/4.38 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
4.29/4.38 c integral : 0 0 0 0 0 0 0 0 0 0
4.29/4.38 c logicor : 880+ 0 84196 0 6 5139 215132 0 0 0
4.29/4.38 c countsols : 0 0 0 0 6 0 0 0 0 0
4.29/4.38 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
4.29/4.38 c integral : 0.00 0.00 0.00 0.00 0.00
4.29/4.38 c logicor : 1.16 0.00 1.16 0.00 0.00
4.29/4.38 c countsols : 0.00 0.00 0.00 0.00 0.00
4.29/4.38 c Propagators : Time Calls Cutoffs DomReds
4.29/4.38 c vbounds : 0.03 2 0 0
4.29/4.38 c rootredcost : 0.04 0 0 0
4.29/4.38 c pseudoobj : 1.00 92188 1571 27572
4.29/4.38 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
4.29/4.38 c propagation : 0.39 5139 5134 5134 11.7 450 6.4 -
4.29/4.38 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
4.29/4.38 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
4.29/4.38 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
4.29/4.38 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
4.29/4.38 c applied globally : - - - 5583 11.3 - - -
4.29/4.38 c applied locally : - - - 0 0.0 - - -
4.29/4.38 c Separators : Time Calls Cutoffs DomReds Cuts Conss
4.29/4.38 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
4.29/4.38 c redcost : 0.00 0 0 0 0 0
4.29/4.38 c impliedbounds : 0.00 0 0 0 0 0
4.29/4.38 c intobj : 0.00 0 0 0 0 0
4.29/4.38 c cgmip : 0.00 0 0 0 0 0
4.29/4.38 c gomory : 0.00 0 0 0 0 0
4.29/4.38 c strongcg : 0.00 0 0 0 0 0
4.29/4.38 c cmir : 0.00 0 0 0 0 0
4.29/4.38 c flowcover : 0.00 0 0 0 0 0
4.29/4.38 c clique : 0.00 0 0 0 0 0
4.29/4.38 c zerohalf : 0.00 0 0 0 0 0
4.29/4.38 c mcf : 0.00 0 0 0 0 0
4.29/4.38 c rapidlearning : 0.00 0 0 0 0 0
4.29/4.38 c Pricers : Time Calls Vars
4.29/4.38 c problem variables: 0.00 0 0
4.29/4.38 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
4.29/4.38 c relpscost : 0.00 0 0 0 0 0 0
4.29/4.38 c pscost : 0.00 0 0 0 0 0 0
4.29/4.38 c inference : 0.08 7437 0 0 0 0 14874
4.29/4.38 c mostinf : 0.00 0 0 0 0 0 0
4.29/4.38 c leastinf : 0.00 0 0 0 0 0 0
4.29/4.38 c fullstrong : 0.00 0 0 0 0 0 0
4.29/4.38 c allfullstrong : 0.00 0 0 0 0 0 0
4.29/4.38 c random : 0.00 0 0 0 0 0 0
4.29/4.38 c Primal Heuristics : Time Calls Found
4.29/4.38 c LP solutions : 0.00 - 0
4.29/4.38 c pseudo solutions : 0.00 - 6
4.29/4.38 c oneopt : 0.00 0 0
4.29/4.38 c trivial : 0.00 2 0
4.29/4.38 c simplerounding : 0.00 0 0
4.29/4.38 c zirounding : 0.00 0 0
4.29/4.38 c rounding : 0.00 0 0
4.29/4.38 c shifting : 0.00 0 0
4.29/4.38 c intshifting : 0.00 0 0
4.29/4.38 c twoopt : 0.00 0 0
4.29/4.38 c fixandinfer : 0.00 0 0
4.29/4.38 c feaspump : 0.00 0 0
4.29/4.38 c coefdiving : 0.00 0 0
4.29/4.38 c pscostdiving : 0.00 0 0
4.29/4.38 c fracdiving : 0.00 0 0
4.29/4.38 c veclendiving : 0.00 0 0
4.29/4.38 c intdiving : 0.00 0 0
4.29/4.38 c actconsdiving : 0.00 0 0
4.29/4.38 c objpscostdiving : 0.00 0 0
4.29/4.38 c rootsoldiving : 0.00 0 0
4.29/4.38 c linesearchdiving : 0.00 0 0
4.29/4.38 c guideddiving : 0.00 0 0
4.29/4.38 c octane : 0.00 0 0
4.29/4.38 c rens : 0.00 0 0
4.29/4.38 c rins : 0.00 0 0
4.29/4.38 c localbranching : 0.00 0 0
4.29/4.38 c mutation : 0.00 0 0
4.29/4.38 c crossover : 0.00 0 0
4.29/4.38 c dins : 0.00 0 0
4.29/4.38 c undercover : 0.00 0 0
4.29/4.38 c nlp : 0.00 0 0
4.29/4.38 c trysol : 0.00 0 0
4.29/4.38 c LP : Time Calls Iterations Iter/call Iter/sec
4.29/4.38 c primal LP : 0.00 0 0 0.00 -
4.29/4.38 c dual LP : 0.00 0 0 0.00 -
4.29/4.38 c lex dual LP : 0.00 0 0 0.00 -
4.29/4.38 c barrier LP : 0.00 0 0 0.00 -
4.29/4.38 c diving/probing LP: 0.00 0 0 0.00 -
4.29/4.38 c strong branching : 0.00 0 0 0.00 -
4.29/4.38 c (at root node) : - 0 0 0.00 -
4.29/4.38 c conflict analysis: 0.00 0 0 0.00 -
4.29/4.38 c B&B Tree :
4.29/4.38 c number of runs : 1
4.29/4.38 c nodes : 12056
4.29/4.38 c nodes (total) : 12056
4.29/4.38 c nodes left : 0
4.29/4.38 c max depth : 35
4.29/4.38 c max depth (total): 35
4.29/4.38 c backtracks : 3176 (26.3%)
4.29/4.38 c delayed cutoffs : 2785
4.29/4.38 c repropagations : 6874 (92503 domain reductions, 2097 cutoffs)
4.29/4.38 c avg switch length: 2.44
4.29/4.38 c switching time : 0.37
4.29/4.38 c Solution :
4.29/4.38 c Solutions found : 6 (6 improvements)
4.29/4.38 c First Solution : +9.60000000000000e+01 (in run 1, after 157 nodes, 0.13 seconds, depth 21, found by <relaxation>)
4.29/4.38 c Primal Bound : +8.90000000000000e+01 (in run 1, after 9363 nodes, 3.09 seconds, depth 28, found by <relaxation>)
4.29/4.38 c Dual Bound : +8.90000000000000e+01
4.29/4.38 c Gap : 0.00 %
4.29/4.38 c Root Dual Bound : +0.00000000000000e+00
4.29/4.38 c Root Iterations : 0
4.29/4.39 c Time complete: 4.38.