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-2664670-1276447996.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.00/0.03 c presolving:
0.00/0.04 c (round 1) 3 del vars, 0 del conss, 4 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 782 impls, 0 clqs
0.00/0.04 c (round 2) 9 del vars, 52 del conss, 6 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 792 impls, 0 clqs
0.00/0.05 c (round 3) 13 del vars, 68 del conss, 7 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 812 impls, 0 clqs
0.00/0.05 c (round 4) 17 del vars, 103 del conss, 11 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 812 impls, 0 clqs
0.00/0.05 c (round 5) 18 del vars, 127 del conss, 12 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 844 impls, 0 clqs
0.00/0.05 c (round 6) 20 del vars, 143 del conss, 14 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 844 impls, 0 clqs
0.00/0.05 c (round 7) 20 del vars, 145 del conss, 14 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 872 impls, 0 clqs
0.00/0.07 c (round 8) 20 del vars, 165 del conss, 14 chg bounds, 20 chg sides, 0 chg coeffs, 0 upgd conss, 872 impls, 0 clqs
0.08/0.10 c (round 9) 20 del vars, 167 del conss, 14 chg bounds, 20 chg sides, 0 chg coeffs, 735 upgd conss, 872 impls, 0 clqs
0.09/0.13 c (round 10) 42 del vars, 167 del conss, 15 chg bounds, 20 chg sides, 0 chg coeffs, 735 upgd conss, 4299 impls, 0 clqs
0.09/0.13 c (round 11) 42 del vars, 316 del conss, 15 chg bounds, 20 chg sides, 0 chg coeffs, 735 upgd conss, 4391 impls, 0 clqs
0.09/0.15 c (round 12) 42 del vars, 321 del conss, 15 chg bounds, 20 chg sides, 0 chg coeffs, 735 upgd conss, 4391 impls, 0 clqs
0.09/0.15 c presolving (13 rounds):
0.09/0.15 c 42 deleted vars, 321 deleted constraints, 15 tightened bounds, 0 added holes, 20 changed sides, 0 changed coefficients
0.09/0.15 c 4391 implications, 0 cliques
0.09/0.15 c presolved problem has 158 variables (158 bin, 0 int, 0 impl, 0 cont) and 579 constraints
0.09/0.15 c 579 constraints of type <logicor>
0.09/0.15 c transformed objective value is always integral (scale: 1)
0.09/0.15 c Presolving Time: 0.09
0.09/0.15 c - non default parameters ----------------------------------------------------------------------
0.09/0.15 c # SCIP version 1.2.1.2
0.09/0.15 c
0.09/0.15 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.15 c conflict/interconss = 0
0.09/0.15 c
0.09/0.15 c # should binary conflicts be preferred?
0.09/0.15 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.15 c conflict/preferbinary = TRUE
0.09/0.15 c
0.09/0.15 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.15 c constraints/agelimit = 1
0.09/0.15 c
0.09/0.15 c # should enforcement of pseudo solution be disabled?
0.09/0.15 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.15 c constraints/disableenfops = TRUE
0.09/0.15 c
0.09/0.15 c # frequency for displaying node information lines
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.15 c display/freq = 10000
0.09/0.15 c
0.09/0.15 c # maximal time in seconds to run
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.15 c limits/time = 1799.98
0.09/0.15 c
0.09/0.15 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.15 c limits/memory = 1620
0.09/0.15 c
0.09/0.15 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c lp/solvefreq = -1
0.09/0.15 c
0.09/0.15 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.15 c # [type: char, range: {lafpsqd}, default: l]
0.09/0.15 c lp/pricing = a
0.09/0.15 c
0.09/0.15 c # should presolving try to simplify inequalities
0.09/0.15 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.15 c constraints/linear/simplifyinequalities = TRUE
0.09/0.15 c
0.09/0.15 c # should presolving try to simplify knapsacks
0.09/0.15 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.15 c constraints/knapsack/simplifyinequalities = TRUE
0.09/0.15 c
0.09/0.15 c # priority of node selection rule <dfs> in standard mode
0.09/0.15 c # [type: int, range: [-536870912,536870911], default: 0]
0.09/0.15 c nodeselection/dfs/stdpriority = 1000000
0.09/0.15 c
0.09/0.15 c -----------------------------------------------------------------------------------------------
0.09/0.15 c start solving
0.09/0.15 c
0.09/0.15 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.15 c 0.1s| 1 | 2 | 0 | - |1303k| 0 | - | 158 | 579 | 0 | 0 | 0 | 0 | 0 | 2.100000e+01 | -- | Inf
0.09/0.16 o 95
0.09/0.16 c * 0.1s| 34 | 5 | 0 | 0.0 |1243k| 11 | - | 158 | 579 | 0 | 0 | 0 | 12 | 0 | 6.600000e+01 | 9.500000e+01 | 43.94%
0.09/0.17 o 94
0.09/0.17 c * 0.1s| 40 | 9 | 0 | 0.0 |1247k| 11 | - | 158 | 579 | 0 | 0 | 0 | 12 | 0 | 6.600000e+01 | 9.400000e+01 | 42.42%
0.09/0.18 c
0.09/0.18 c SCIP Status : problem is solved [optimal solution found]
0.09/0.18 c Solving Time (sec) : 0.12
0.09/0.18 c Solving Nodes : 90
0.09/0.18 c Primal Bound : +9.40000000000000e+01 (2 solutions)
0.09/0.18 c Dual Bound : +9.40000000000000e+01
0.09/0.18 c Gap : 0.00 %
0.09/0.18 s OPTIMUM FOUND
0.09/0.18 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.09/0.18 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.09/0.18 v -x154 x153 -x152 x151 -x150 x149 -x148 x147 -x146 x145 x144 -x143 x142 -x141 x140 -x139 -x138 x137 -x136 -x135 x134 -x133
0.09/0.18 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.09/0.18 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.09/0.18 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.09/0.18 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
0.09/0.18 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.09/0.18 c SCIP Status : problem is solved [optimal solution found]
0.09/0.18 c Solving Time : 0.12
0.09/0.18 c Original Problem :
0.09/0.18 c Problem name : HOME/instance-2664670-1276447996.opb
0.09/0.18 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
0.09/0.18 c Constraints : 900 initial, 900 maximal
0.09/0.18 c Presolved Problem :
0.09/0.18 c Problem name : t_HOME/instance-2664670-1276447996.opb
0.09/0.18 c Variables : 158 (158 binary, 0 integer, 0 implicit integer, 0 continuous)
0.09/0.18 c Constraints : 579 initial, 585 maximal
0.09/0.18 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.09/0.18 c trivial : 0.00 4 0 0 0 0 0 0 0
0.09/0.18 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.09/0.18 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.09/0.18 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.09/0.18 c implics : 0.00 0 6 0 0 0 0 0 0
0.09/0.18 c probing : 0.03 21 1 0 1 0 0 0 0
0.09/0.18 c linear : 0.02 10 0 0 14 0 165 20 0
0.09/0.18 c logicor : 0.03 0 0 0 0 0 156 0 0
0.09/0.18 c root node : - 142 - - 142 - - - -
0.09/0.18 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.09/0.18 c integral : 0 0 0 0 0 0 0 0 0 0
0.09/0.18 c logicor : 579+ 0 1504 0 2 40 1296 0 0 0
0.09/0.18 c countsols : 0 0 0 0 2 0 0 0 0 0
0.09/0.18 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.09/0.18 c integral : 0.00 0.00 0.00 0.00 0.00
0.09/0.18 c logicor : 0.00 0.00 0.00 0.00 0.00
0.09/0.18 c countsols : 0.00 0.00 0.00 0.00 0.00
0.09/0.18 c Propagators : Time Calls Cutoffs DomReds
0.09/0.18 c vbounds : 0.00 2 0 0
0.09/0.18 c rootredcost : 0.00 0 0 0
0.09/0.18 c pseudoobj : 0.01 724 14 175
0.09/0.18 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.09/0.18 c propagation : 0.00 47 44 44 2.9 0 0.0 -
0.09/0.18 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.09/0.18 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.09/0.18 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.09/0.18 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.09/0.18 c applied globally : - - - 44 2.9 - - -
0.09/0.18 c applied locally : - - - 0 0.0 - - -
0.09/0.18 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.09/0.18 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.09/0.18 c redcost : 0.00 0 0 0 0 0
0.09/0.18 c impliedbounds : 0.00 0 0 0 0 0
0.09/0.18 c intobj : 0.00 0 0 0 0 0
0.09/0.18 c cgmip : 0.00 0 0 0 0 0
0.09/0.18 c gomory : 0.00 0 0 0 0 0
0.09/0.18 c strongcg : 0.00 0 0 0 0 0
0.09/0.18 c cmir : 0.00 0 0 0 0 0
0.09/0.18 c flowcover : 0.00 0 0 0 0 0
0.09/0.18 c clique : 0.00 0 0 0 0 0
0.09/0.18 c zerohalf : 0.00 0 0 0 0 0
0.09/0.18 c mcf : 0.00 0 0 0 0 0
0.09/0.18 c rapidlearning : 0.00 0 0 0 0 0
0.09/0.18 c Pricers : Time Calls Vars
0.09/0.18 c problem variables: 0.00 0 0
0.09/0.18 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.09/0.18 c relpscost : 0.00 0 0 0 0 0 0
0.09/0.18 c pscost : 0.00 0 0 0 0 0 0
0.09/0.18 c inference : 0.00 62 0 0 0 0 124
0.09/0.18 c mostinf : 0.00 0 0 0 0 0 0
0.09/0.18 c leastinf : 0.00 0 0 0 0 0 0
0.09/0.18 c fullstrong : 0.00 0 0 0 0 0 0
0.09/0.18 c allfullstrong : 0.00 0 0 0 0 0 0
0.09/0.18 c random : 0.00 0 0 0 0 0 0
0.09/0.18 c Primal Heuristics : Time Calls Found
0.09/0.18 c LP solutions : 0.00 - 0
0.09/0.18 c pseudo solutions : 0.00 - 2
0.09/0.18 c oneopt : 0.00 0 0
0.09/0.18 c trivial : 0.00 2 0
0.09/0.18 c simplerounding : 0.00 0 0
0.09/0.18 c zirounding : 0.00 0 0
0.09/0.18 c rounding : 0.00 0 0
0.09/0.18 c shifting : 0.00 0 0
0.09/0.18 c intshifting : 0.00 0 0
0.09/0.18 c twoopt : 0.00 0 0
0.09/0.18 c fixandinfer : 0.00 0 0
0.09/0.18 c feaspump : 0.00 0 0
0.09/0.18 c coefdiving : 0.00 0 0
0.09/0.18 c pscostdiving : 0.00 0 0
0.09/0.18 c fracdiving : 0.00 0 0
0.09/0.18 c veclendiving : 0.00 0 0
0.09/0.18 c intdiving : 0.00 0 0
0.09/0.18 c actconsdiving : 0.00 0 0
0.09/0.18 c objpscostdiving : 0.00 0 0
0.09/0.18 c rootsoldiving : 0.00 0 0
0.09/0.18 c linesearchdiving : 0.00 0 0
0.09/0.18 c guideddiving : 0.00 0 0
0.09/0.18 c octane : 0.00 0 0
0.09/0.18 c rens : 0.00 0 0
0.09/0.18 c rins : 0.00 0 0
0.09/0.18 c localbranching : 0.00 0 0
0.09/0.18 c mutation : 0.00 0 0
0.09/0.18 c crossover : 0.00 0 0
0.09/0.18 c dins : 0.00 0 0
0.09/0.18 c undercover : 0.00 0 0
0.09/0.18 c nlp : 0.00 0 0
0.09/0.18 c trysol : 0.00 0 0
0.09/0.18 c LP : Time Calls Iterations Iter/call Iter/sec
0.09/0.18 c primal LP : 0.00 0 0 0.00 -
0.09/0.18 c dual LP : 0.00 0 0 0.00 -
0.09/0.18 c lex dual LP : 0.00 0 0 0.00 -
0.09/0.18 c barrier LP : 0.00 0 0 0.00 -
0.09/0.18 c diving/probing LP: 0.00 0 0 0.00 -
0.09/0.18 c strong branching : 0.00 0 0 0.00 -
0.09/0.18 c (at root node) : - 0 0 0.00 -
0.09/0.18 c conflict analysis: 0.00 0 0 0.00 -
0.09/0.18 c B&B Tree :
0.09/0.18 c number of runs : 1
0.09/0.18 c nodes : 90
0.09/0.18 c nodes (total) : 90
0.09/0.18 c nodes left : 0
0.09/0.18 c max depth : 11
0.09/0.18 c max depth (total): 11
0.09/0.18 c backtracks : 22 (24.4%)
0.09/0.18 c delayed cutoffs : 30
0.09/0.18 c repropagations : 82 (599 domain reductions, 21 cutoffs)
0.09/0.18 c avg switch length: 2.87
0.09/0.18 c switching time : 0.00
0.09/0.18 c Solution :
0.09/0.18 c Solutions found : 2 (2 improvements)
0.09/0.18 c First Solution : +9.50000000000000e+01 (in run 1, after 34 nodes, 0.11 seconds, depth 11, found by <relaxation>)
0.09/0.18 c Primal Bound : +9.40000000000000e+01 (in run 1, after 40 nodes, 0.11 seconds, depth 11, found by <relaxation>)
0.09/0.18 c Dual Bound : +9.40000000000000e+01
0.09/0.18 c Gap : 0.00 %
0.09/0.18 c Root Dual Bound : +2.10000000000000e+01
0.09/0.18 c Root Iterations : 0
0.09/0.19 c Time complete: 0.18.