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-2664696-1276461847.opb>
0.00/0.03 c original problem has 200 variables (200 bin, 0 int, 0 impl, 0 cont) and 900 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.03/0.03 c presolving:
0.03/0.08 c (round 1) 0 del vars, 15 del conss, 0 chg bounds, 15 chg sides, 0 chg coeffs, 885 upgd conss, 616 impls, 0 clqs
0.09/0.11 c presolving (2 rounds):
0.09/0.11 c 0 deleted vars, 15 deleted constraints, 0 tightened bounds, 0 added holes, 15 changed sides, 0 changed coefficients
0.09/0.11 c 1272 implications, 0 cliques
0.09/0.11 c presolved problem has 200 variables (200 bin, 0 int, 0 impl, 0 cont) and 885 constraints
0.09/0.11 c 885 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.07
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 | - |1356k| 0 | - | 200 | 885 | 0 | 0 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.20/0.28 o 96
0.20/0.28 c * 0.2s| 321 | 9 | 0 | 0.0 |1372k| 26 | - | 200 | 907 | 0 | 0 | 0 | 185 | 0 | 4.000000e+00 | 9.600000e+01 |2300.00%
0.20/0.28 o 94
0.20/0.28 c * 0.2s| 337 | 10 | 0 | 0.0 |1376k| 32 | - | 200 | 908 | 0 | 0 | 0 | 186 | 0 | 4.000000e+00 | 9.400000e+01 |2250.00%
0.39/0.40 c
0.39/0.40 c SCIP Status : problem is solved [optimal solution found]
0.39/0.40 c Solving Time (sec) : 0.32
0.39/0.40 c Solving Nodes : 538
0.39/0.40 c Primal Bound : +9.40000000000000e+01 (2 solutions)
0.39/0.40 c Dual Bound : +9.40000000000000e+01
0.39/0.40 c Gap : 0.00 %
0.39/0.40 s OPTIMUM FOUND
0.39/0.40 v -x200 x199 x198 -x197 x196 -x195 x194 -x193 x192 -x191 x190 -x189 -x188 x187 -x186 x185 x184 -x183 x182 -x181 -x180 x179 x178 -x177
0.39/0.40 v x176 -x175 -x174 x173 -x172 x171 -x170 x169 -x168 x167 -x166 x165 -x164 x163 -x162 x161 -x160 -x159 x158 -x157 -x156 x155
0.39/0.40 v -x154 x153 x152 -x151 x150 -x149 x148 -x147 x146 -x145 -x144 x143 x142 -x141 -x140 x139 -x138 -x137 x136 -x135 x134 -x133 -x132
0.39/0.40 v x131 -x130 x129 x128 -x127 x126 -x125 x124 -x123 x122 -x121 x120 -x119 -x118 x117 -x116 -x115 -x114 x113 -x112 x111 -x110
0.39/0.40 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.39/0.40 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
0.39/0.40 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 x29
0.39/0.40 v -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.39/0.40 c SCIP Status : problem is solved [optimal solution found]
0.39/0.40 c Solving Time : 0.32
0.39/0.40 c Original Problem :
0.39/0.40 c Problem name : HOME/instance-2664696-1276461847.opb
0.39/0.40 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
0.39/0.40 c Constraints : 900 initial, 900 maximal
0.39/0.40 c Presolved Problem :
0.39/0.40 c Problem name : t_HOME/instance-2664696-1276461847.opb
0.39/0.40 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
0.39/0.40 c Constraints : 885 initial, 928 maximal
0.39/0.40 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.39/0.40 c trivial : 0.00 0 0 0 0 0 0 0 0
0.39/0.40 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.39/0.40 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.39/0.40 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.39/0.40 c implics : 0.00 0 0 0 0 0 0 0 0
0.39/0.40 c probing : 0.02 0 0 0 0 0 0 0 0
0.39/0.40 c linear : 0.03 0 0 0 0 0 15 15 0
0.39/0.40 c logicor : 0.02 0 0 0 0 0 0 0 0
0.39/0.40 c root node : - 133 - - 133 - - - -
0.39/0.40 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.39/0.40 c integral : 0 0 0 0 0 0 0 0 0 0
0.39/0.40 c logicor : 885+ 0 6583 0 2 295 17712 0 0 0
0.39/0.40 c countsols : 0 0 0 0 2 0 0 0 0 0
0.39/0.40 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.39/0.40 c integral : 0.00 0.00 0.00 0.00 0.00
0.39/0.40 c logicor : 0.09 0.00 0.09 0.00 0.00
0.39/0.40 c countsols : 0.00 0.00 0.00 0.00 0.00
0.39/0.40 c Propagators : Time Calls Cutoffs DomReds
0.39/0.40 c vbounds : 0.00 2 0 0
0.39/0.40 c rootredcost : 0.01 0 0 0
0.39/0.40 c pseudoobj : 0.07 6490 7 34
0.39/0.40 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.39/0.40 c propagation : 0.01 297 287 287 5.2 30 5.4 -
0.39/0.40 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.39/0.40 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.39/0.40 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.39/0.40 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.39/0.40 c applied globally : - - - 317 5.2 - - -
0.39/0.40 c applied locally : - - - 0 0.0 - - -
0.39/0.40 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.39/0.40 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.39/0.40 c redcost : 0.00 0 0 0 0 0
0.39/0.40 c impliedbounds : 0.00 0 0 0 0 0
0.39/0.40 c intobj : 0.00 0 0 0 0 0
0.39/0.40 c cgmip : 0.00 0 0 0 0 0
0.39/0.40 c gomory : 0.00 0 0 0 0 0
0.39/0.40 c strongcg : 0.00 0 0 0 0 0
0.39/0.40 c cmir : 0.00 0 0 0 0 0
0.39/0.40 c flowcover : 0.00 0 0 0 0 0
0.39/0.40 c clique : 0.00 0 0 0 0 0
0.39/0.40 c zerohalf : 0.00 0 0 0 0 0
0.39/0.40 c mcf : 0.00 0 0 0 0 0
0.39/0.40 c rapidlearning : 0.00 0 0 0 0 0
0.39/0.40 c Pricers : Time Calls Vars
0.39/0.40 c problem variables: 0.00 0 0
0.39/0.40 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.39/0.40 c relpscost : 0.00 0 0 0 0 0 0
0.39/0.40 c pscost : 0.00 0 0 0 0 0 0
0.39/0.40 c inference : 0.01 345 0 0 0 0 690
0.39/0.40 c mostinf : 0.00 0 0 0 0 0 0
0.39/0.40 c leastinf : 0.00 0 0 0 0 0 0
0.39/0.40 c fullstrong : 0.00 0 0 0 0 0 0
0.39/0.40 c allfullstrong : 0.00 0 0 0 0 0 0
0.39/0.40 c random : 0.00 0 0 0 0 0 0
0.39/0.40 c Primal Heuristics : Time Calls Found
0.39/0.40 c LP solutions : 0.00 - 0
0.39/0.40 c pseudo solutions : 0.00 - 2
0.39/0.40 c oneopt : 0.00 0 0
0.39/0.40 c trivial : 0.00 2 0
0.39/0.40 c simplerounding : 0.00 0 0
0.39/0.40 c zirounding : 0.00 0 0
0.39/0.40 c rounding : 0.00 0 0
0.39/0.40 c shifting : 0.00 0 0
0.39/0.40 c intshifting : 0.00 0 0
0.39/0.40 c twoopt : 0.00 0 0
0.39/0.40 c fixandinfer : 0.00 0 0
0.39/0.40 c feaspump : 0.00 0 0
0.39/0.40 c coefdiving : 0.00 0 0
0.39/0.40 c pscostdiving : 0.00 0 0
0.39/0.40 c fracdiving : 0.00 0 0
0.39/0.40 c veclendiving : 0.00 0 0
0.39/0.40 c intdiving : 0.00 0 0
0.39/0.40 c actconsdiving : 0.00 0 0
0.39/0.40 c objpscostdiving : 0.00 0 0
0.39/0.40 c rootsoldiving : 0.00 0 0
0.39/0.40 c linesearchdiving : 0.00 0 0
0.39/0.40 c guideddiving : 0.00 0 0
0.39/0.40 c octane : 0.00 0 0
0.39/0.40 c rens : 0.00 0 0
0.39/0.40 c rins : 0.00 0 0
0.39/0.40 c localbranching : 0.00 0 0
0.39/0.40 c mutation : 0.00 0 0
0.39/0.40 c crossover : 0.00 0 0
0.39/0.40 c dins : 0.00 0 0
0.39/0.40 c undercover : 0.00 0 0
0.39/0.40 c nlp : 0.00 0 0
0.39/0.40 c trysol : 0.00 0 0
0.39/0.40 c LP : Time Calls Iterations Iter/call Iter/sec
0.39/0.40 c primal LP : 0.00 0 0 0.00 -
0.39/0.40 c dual LP : 0.00 0 0 0.00 -
0.39/0.40 c lex dual LP : 0.00 0 0 0.00 -
0.39/0.40 c barrier LP : 0.00 0 0 0.00 -
0.39/0.40 c diving/probing LP: 0.00 0 0 0.00 -
0.39/0.40 c strong branching : 0.00 0 0 0.00 -
0.39/0.40 c (at root node) : - 0 0 0.00 -
0.39/0.40 c conflict analysis: 0.00 0 0 0.00 -
0.39/0.40 c B&B Tree :
0.39/0.40 c number of runs : 1
0.39/0.40 c nodes : 538
0.39/0.40 c nodes (total) : 538
0.39/0.40 c nodes left : 0
0.39/0.40 c max depth : 32
0.39/0.40 c max depth (total): 32
0.39/0.40 c backtracks : 132 (24.5%)
0.39/0.40 c delayed cutoffs : 134
0.39/0.40 c repropagations : 488 (6797 domain reductions, 111 cutoffs)
0.39/0.40 c avg switch length: 2.89
0.39/0.40 c switching time : 0.05
0.39/0.40 c Solution :
0.39/0.40 c Solutions found : 2 (2 improvements)
0.39/0.40 c First Solution : +9.60000000000000e+01 (in run 1, after 321 nodes, 0.22 seconds, depth 26, found by <relaxation>)
0.39/0.40 c Primal Bound : +9.40000000000000e+01 (in run 1, after 337 nodes, 0.22 seconds, depth 32, found by <relaxation>)
0.39/0.40 c Dual Bound : +9.40000000000000e+01
0.39/0.40 c Gap : 0.00 %
0.39/0.40 c Root Dual Bound : +0.00000000000000e+00
0.39/0.40 c Root Iterations : 0
0.39/0.41 c Time complete: 0.4.