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-2664663-1276430139.opb>
0.00/0.01 c original problem has 200 variables (200 bin, 0 int, 0 impl, 0 cont) and 440 constraints
0.00/0.01 c problem read
0.00/0.01 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.01/0.02 c presolving:
0.01/0.04 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 440 upgd conss, 200 impls, 0 clqs
0.01/0.04 c (0.0s) probing: 101/200 (50.5%) - 0 fixings, 0 aggregations, 0 implications, 0 bound changes
0.01/0.04 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.01/0.04 c presolving (2 rounds):
0.01/0.04 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.01/0.04 c 200 implications, 0 cliques
0.01/0.04 c presolved problem has 200 variables (200 bin, 0 int, 0 impl, 0 cont) and 440 constraints
0.01/0.04 c 440 constraints of type <logicor>
0.01/0.04 c transformed objective value is always integral (scale: 1)
0.01/0.04 c Presolving Time: 0.02
0.01/0.04 c - non default parameters ----------------------------------------------------------------------
0.01/0.04 c # SCIP version 1.2.1.2
0.01/0.04 c
0.01/0.04 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.04 c conflict/interconss = 0
0.01/0.04 c
0.01/0.04 c # should binary conflicts be preferred?
0.01/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.04 c conflict/preferbinary = TRUE
0.01/0.04 c
0.01/0.04 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.04 c constraints/agelimit = 1
0.01/0.04 c
0.01/0.04 c # should enforcement of pseudo solution be disabled?
0.01/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.04 c constraints/disableenfops = TRUE
0.01/0.04 c
0.01/0.04 c # frequency for displaying node information lines
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 100]
0.01/0.04 c display/freq = 10000
0.01/0.04 c
0.01/0.04 c # maximal time in seconds to run
0.01/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.04 c limits/time = 1799.99
0.01/0.04 c
0.01/0.04 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.01/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.04 c limits/memory = 1620
0.01/0.04 c
0.01/0.04 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.04 c lp/solvefreq = -1
0.01/0.04 c
0.01/0.04 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.01/0.04 c # [type: char, range: {lafpsqd}, default: l]
0.01/0.04 c lp/pricing = a
0.01/0.04 c
0.01/0.04 c # should presolving try to simplify inequalities
0.01/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.04 c constraints/linear/simplifyinequalities = TRUE
0.01/0.04 c
0.01/0.04 c # should presolving try to simplify knapsacks
0.01/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.04 c constraints/knapsack/simplifyinequalities = TRUE
0.01/0.04 c
0.01/0.04 c # priority of node selection rule <dfs> in standard mode
0.01/0.04 c # [type: int, range: [-536870912,536870911], default: 0]
0.01/0.04 c nodeselection/dfs/stdpriority = 1000000
0.01/0.04 c
0.01/0.04 c -----------------------------------------------------------------------------------------------
0.01/0.04 c start solving
0.01/0.04 c
0.01/0.04 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.01/0.04 c 0.0s| 1 | 2 | 0 | - | 923k| 0 | - | 200 | 440 | 0 | 0 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.17 o 100
0.09/0.17 c * 0.1s| 361 | 4 | 0 | 0.0 | 992k| 19 | - | 200 | 463 | 0 | 0 | 0 | 301 | 0 | 1.000000e+00 | 1.000000e+02 |9900.00%
0.19/0.24 c
0.19/0.24 c SCIP Status : problem is solved [optimal solution found]
0.19/0.24 c Solving Time (sec) : 0.18
0.19/0.24 c Solving Nodes : 560
0.19/0.24 c Primal Bound : +1.00000000000000e+02 (1 solutions)
0.19/0.24 c Dual Bound : +1.00000000000000e+02
0.19/0.24 c Gap : 0.00 %
0.19/0.24 s OPTIMUM FOUND
0.19/0.24 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.24 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.24 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.19/0.24 v x131 -x130 x129 x128 -x127 x126 -x125 x124 -x123 -x122 x121 -x120 x119 -x118 x117 -x116 x115 x114 -x113 x112 -x111 -x110 x109
0.19/0.24 v -x108 x107 x106 -x105 -x104 x103 -x102 x101 x100 -x99 -x98 x97 -x96 x95 -x94 x93 x92 -x91 -x90 x89 x88 -x87 x86 -x85 -x84
0.19/0.24 v 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 -x56
0.19/0.24 v 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 -x28
0.19/0.24 v 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.24 c SCIP Status : problem is solved [optimal solution found]
0.19/0.24 c Solving Time : 0.18
0.19/0.24 c Original Problem :
0.19/0.24 c Problem name : HOME/instance-2664663-1276430139.opb
0.19/0.24 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
0.19/0.24 c Constraints : 440 initial, 440 maximal
0.19/0.24 c Presolved Problem :
0.19/0.24 c Problem name : t_HOME/instance-2664663-1276430139.opb
0.19/0.24 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
0.19/0.24 c Constraints : 440 initial, 474 maximal
0.19/0.24 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.19/0.24 c trivial : 0.00 0 0 0 0 0 0 0 0
0.19/0.24 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.19/0.24 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.19/0.24 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.19/0.24 c implics : 0.00 0 0 0 0 0 0 0 0
0.19/0.24 c probing : 0.00 0 0 0 0 0 0 0 0
0.19/0.24 c logicor : 0.01 0 0 0 0 0 0 0 0
0.19/0.24 c root node : - 51 - - 51 - - - -
0.19/0.24 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.19/0.24 c integral : 0 0 0 0 0 0 0 0 0 0
0.19/0.24 c logicor : 440+ 0 4860 0 1 299 9035 0 0 0
0.19/0.24 c countsols : 0 0 0 0 1 0 0 0 0 0
0.19/0.24 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.19/0.24 c integral : 0.00 0.00 0.00 0.00 0.00
0.19/0.24 c logicor : 0.02 0.00 0.02 0.00 0.00
0.19/0.24 c countsols : 0.00 0.00 0.00 0.00 0.00
0.19/0.24 c Propagators : Time Calls Cutoffs DomReds
0.19/0.24 c vbounds : 0.00 2 0 0
0.19/0.24 c rootredcost : 0.00 0 0 0
0.19/0.24 c pseudoobj : 0.09 5143 0 0
0.19/0.24 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.19/0.24 c propagation : 0.01 299 295 295 3.8 171 3.5 -
0.19/0.24 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.19/0.24 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.19/0.24 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.19/0.24 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.19/0.24 c applied globally : - - - 466 3.7 - - -
0.19/0.24 c applied locally : - - - 0 0.0 - - -
0.19/0.24 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.19/0.24 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.19/0.24 c redcost : 0.00 0 0 0 0 0
0.19/0.24 c impliedbounds : 0.00 0 0 0 0 0
0.19/0.24 c intobj : 0.00 0 0 0 0 0
0.19/0.24 c cgmip : 0.00 0 0 0 0 0
0.19/0.24 c gomory : 0.00 0 0 0 0 0
0.19/0.24 c strongcg : 0.00 0 0 0 0 0
0.19/0.24 c cmir : 0.00 0 0 0 0 0
0.19/0.24 c flowcover : 0.00 0 0 0 0 0
0.19/0.24 c clique : 0.00 0 0 0 0 0
0.19/0.24 c zerohalf : 0.00 0 0 0 0 0
0.19/0.24 c mcf : 0.00 0 0 0 0 0
0.19/0.24 c rapidlearning : 0.00 0 0 0 0 0
0.19/0.24 c Pricers : Time Calls Vars
0.19/0.24 c problem variables: 0.00 0 0
0.19/0.24 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.19/0.24 c relpscost : 0.00 0 0 0 0 0 0
0.19/0.24 c pscost : 0.00 0 0 0 0 0 0
0.19/0.24 c inference : 0.00 362 0 0 0 0 724
0.19/0.24 c mostinf : 0.00 0 0 0 0 0 0
0.19/0.24 c leastinf : 0.00 0 0 0 0 0 0
0.19/0.24 c fullstrong : 0.00 0 0 0 0 0 0
0.19/0.24 c allfullstrong : 0.00 0 0 0 0 0 0
0.19/0.24 c random : 0.00 0 0 0 0 0 0
0.19/0.24 c Primal Heuristics : Time Calls Found
0.19/0.24 c LP solutions : 0.00 - 0
0.19/0.24 c pseudo solutions : 0.00 - 1
0.19/0.24 c oneopt : 0.00 0 0
0.19/0.24 c trivial : 0.00 2 0
0.19/0.24 c simplerounding : 0.00 0 0
0.19/0.24 c zirounding : 0.00 0 0
0.19/0.24 c rounding : 0.00 0 0
0.19/0.24 c shifting : 0.00 0 0
0.19/0.24 c intshifting : 0.00 0 0
0.19/0.24 c twoopt : 0.00 0 0
0.19/0.24 c fixandinfer : 0.00 0 0
0.19/0.24 c feaspump : 0.00 0 0
0.19/0.24 c coefdiving : 0.00 0 0
0.19/0.24 c pscostdiving : 0.00 0 0
0.19/0.24 c fracdiving : 0.00 0 0
0.19/0.24 c veclendiving : 0.00 0 0
0.19/0.24 c intdiving : 0.00 0 0
0.19/0.24 c actconsdiving : 0.00 0 0
0.19/0.24 c objpscostdiving : 0.00 0 0
0.19/0.24 c rootsoldiving : 0.00 0 0
0.19/0.24 c linesearchdiving : 0.00 0 0
0.19/0.24 c guideddiving : 0.00 0 0
0.19/0.24 c octane : 0.00 0 0
0.19/0.24 c rens : 0.00 0 0
0.19/0.24 c rins : 0.00 0 0
0.19/0.24 c localbranching : 0.00 0 0
0.19/0.24 c mutation : 0.00 0 0
0.19/0.24 c crossover : 0.00 0 0
0.19/0.24 c dins : 0.00 0 0
0.19/0.24 c undercover : 0.00 0 0
0.19/0.24 c nlp : 0.00 0 0
0.19/0.24 c trysol : 0.00 0 0
0.19/0.24 c LP : Time Calls Iterations Iter/call Iter/sec
0.19/0.24 c primal LP : 0.00 0 0 0.00 -
0.19/0.24 c dual LP : 0.00 0 0 0.00 -
0.19/0.24 c lex dual LP : 0.00 0 0 0.00 -
0.19/0.24 c barrier LP : 0.00 0 0 0.00 -
0.19/0.24 c diving/probing LP: 0.00 0 0 0.00 -
0.19/0.24 c strong branching : 0.00 0 0 0.00 -
0.19/0.24 c (at root node) : - 0 0 0.00 -
0.19/0.24 c conflict analysis: 0.00 0 0 0.00 -
0.19/0.24 c B&B Tree :
0.19/0.24 c number of runs : 1
0.19/0.24 c nodes : 560
0.19/0.24 c nodes (total) : 560
0.19/0.24 c nodes left : 0
0.19/0.24 c max depth : 19
0.19/0.24 c max depth (total): 19
0.19/0.24 c backtracks : 133 (23.8%)
0.19/0.24 c delayed cutoffs : 165
0.19/0.24 c repropagations : 622 (3770 domain reductions, 102 cutoffs)
0.19/0.24 c avg switch length: 3.31
0.19/0.24 c switching time : 0.01
0.19/0.24 c Solution :
0.19/0.24 c Solutions found : 1 (1 improvements)
0.19/0.24 c First Solution : +1.00000000000000e+02 (in run 1, after 361 nodes, 0.12 seconds, depth 13, found by <relaxation>)
0.19/0.24 c Primal Bound : +1.00000000000000e+02 (in run 1, after 361 nodes, 0.12 seconds, depth 13, found by <relaxation>)
0.19/0.24 c Dual Bound : +1.00000000000000e+02
0.19/0.24 c Gap : 0.00 %
0.19/0.24 c Root Dual Bound : +0.00000000000000e+00
0.19/0.24 c Root Iterations : 0
0.19/0.25 c Time complete: 0.24.