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-2663973-1276642760.opb>
0.00/0.01 c original problem has 190 variables (190 bin, 0 int, 0 impl, 0 cont) and 419 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.01 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.02 o 92
0.00/0.02 c feasible solution found by trivial heuristic, objective value 9.200000e+01
0.00/0.02 c presolving:
0.00/0.02 c (round 1) 56 del vars, 82 del conss, 30 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 1558 impls, 0 clqs
0.00/0.04 c (round 2) 56 del vars, 82 del conss, 30 chg bounds, 0 chg sides, 0 chg coeffs, 323 upgd conss, 1558 impls, 0 clqs
0.00/0.04 c (round 3) 56 del vars, 82 del conss, 30 chg bounds, 0 chg sides, 0 chg coeffs, 337 upgd conss, 1558 impls, 0 clqs
0.00/0.05 c (0.0s) probing: 118/134 (88.1%) - 0 fixings, 3 aggregations, 28 implications, 0 bound changes
0.00/0.05 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.00/0.05 c (round 4) 59 del vars, 82 del conss, 30 chg bounds, 0 chg sides, 0 chg coeffs, 337 upgd conss, 1608 impls, 0 clqs
0.00/0.05 c (0.0s) probing: 128/134 (95.5%) - 0 fixings, 3 aggregations, 28 implications, 0 bound changes
0.00/0.05 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.00/0.05 c presolving (5 rounds):
0.00/0.05 c 59 deleted vars, 82 deleted constraints, 30 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.05 c 1608 implications, 0 cliques
0.00/0.05 c presolved problem has 131 variables (131 bin, 0 int, 0 impl, 0 cont) and 337 constraints
0.00/0.05 c 337 constraints of type <logicor>
0.00/0.05 c transformed objective value is always integral (scale: 1)
0.00/0.05 c Presolving Time: 0.02
0.00/0.05 c - non default parameters ----------------------------------------------------------------------
0.00/0.05 c # SCIP version 1.2.1.2
0.00/0.05 c
0.00/0.05 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.05 c conflict/interconss = 0
0.00/0.05 c
0.00/0.05 c # should binary conflicts be preferred?
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05 c conflict/preferbinary = TRUE
0.00/0.05 c
0.00/0.05 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.05 c constraints/agelimit = 1
0.00/0.05 c
0.00/0.05 c # should enforcement of pseudo solution be disabled?
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05 c constraints/disableenfops = TRUE
0.00/0.05 c
0.00/0.05 c # frequency for displaying node information lines
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.05 c display/freq = 10000
0.00/0.05 c
0.00/0.05 c # maximal time in seconds to run
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.05 c limits/time = 1799.99
0.00/0.05 c
0.00/0.05 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.05 c limits/memory = 1620
0.00/0.05 c
0.00/0.05 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.05 c lp/solvefreq = -1
0.00/0.05 c
0.00/0.05 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.05 c # [type: char, range: {lafpsqd}, default: l]
0.00/0.05 c lp/pricing = a
0.00/0.05 c
0.00/0.05 c # should presolving try to simplify inequalities
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05 c constraints/linear/simplifyinequalities = TRUE
0.00/0.05 c
0.00/0.05 c # should presolving try to simplify knapsacks
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.05 c
0.00/0.05 c # priority of node selection rule <dfs> in standard mode
0.00/0.05 c # [type: int, range: [-536870912,536870911], default: 0]
0.00/0.05 c nodeselection/dfs/stdpriority = 1000000
0.00/0.05 c
0.00/0.05 c -----------------------------------------------------------------------------------------------
0.00/0.05 c start solving
0.00/0.05 c
0.00/0.05 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.05 c t 0.0s| 1 | 2 | 0 | - | 855k| 0 | - | 131 | 337 | 0 | 0 | 0 | 0 | 0 | 3.000000e+01 | 9.200000e+01 | 206.67%
0.00/0.06 o 34
0.00/0.06 c * 0.0s| 33 | 27 | 0 | 0.0 | 871k| 32 | - | 131 | 337 | 0 | 0 | 0 | 0 | 0 | 3.000000e+01 | 3.400000e+01 | 13.33%
0.00/0.06 o 33
0.00/0.06 c * 0.0s| 40 | 20 | 0 | 0.0 | 873k| 32 | - | 131 | 340 | 0 | 0 | 0 | 6 | 0 | 3.000000e+01 | 3.300000e+01 | 10.00%
0.00/0.08 c
0.00/0.08 c SCIP Status : problem is solved [optimal solution found]
0.00/0.08 c Solving Time (sec) : 0.05
0.00/0.08 c Solving Nodes : 150
0.00/0.08 c Primal Bound : +3.30000000000000e+01 (4 solutions)
0.00/0.08 c Dual Bound : +3.30000000000000e+01
0.00/0.08 c Gap : 0.00 %
0.00/0.08 s OPTIMUM FOUND
0.00/0.08 v -x190 -x187 -x184 -x183 -x182 -x179 x176 -x173 -x172 -x169 -x166 -x162 -x160 -x167 x158 -x155 -x154 -x153 -x150 -x146 -x142 -x148
0.00/0.08 v -x141 x140 -x137 -x135 -x133 -x132 -x131 -x121 -x118 x117 -x108 -x105 -x103 -x99 -x106 -x98 -x97 -x96 -x82 -x129 -x81 -x80
0.00/0.08 v -x79 -x78 -x72 -x64 -x63 -x188 -x62 -x61 -x60 -x59 -x185 -x180 -x177 -x174 -x58 -x170 -x51 -x50 -x164 -x49 -x48 x156 -x47 -x46
0.00/0.08 v -x45 -x40 -x151 -x39 -x38 -x37 -x144 -x138 -x36 -x35 -x115 -x34 -x31 -x30 -x29 -x28 -x119 -x27 -x26 -x25 -x24 -x23 -x94 -x22
0.00/0.08 v -x21 -x20 -x19 -x76 -x70 -x6 -x189 -x186 -x181 -x178 -x175 -x171 -x168 -x165 -x163 -x161 -x159 x157 -x152 -x149 -x147 -x145
0.00/0.08 v -x143 -x139 -x136 -x134 -x130 -x128 -x127 x126 -x125 -x124 -x123 -x122 -x120 -x116 -x114 -x113 -x112 -x111 -x110 -x109 -x107
0.00/0.08 v -x104 -x102 -x101 -x100 -x95 -x93 -x92 -x91 -x90 -x89 -x88 -x87 -x86 -x85 -x84 -x83 -x77 -x75 -x74 -x73 -x71 x69 -x68 -x67
0.00/0.08 v -x66 x65 x57 x56 x55 x54 x53 x52 x44 x43 x42 x41 x33 x32 x18 x17 x16 x15 x14 x13 x12 x11 x10 x9 x8 x7 x5 x4 x3 x2 x1
0.00/0.08 c SCIP Status : problem is solved [optimal solution found]
0.00/0.08 c Solving Time : 0.05
0.00/0.08 c Original Problem :
0.00/0.08 c Problem name : HOME/instance-2663973-1276642760.opb
0.00/0.08 c Variables : 190 (190 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.08 c Constraints : 419 initial, 419 maximal
0.00/0.08 c Presolved Problem :
0.00/0.08 c Problem name : t_HOME/instance-2663973-1276642760.opb
0.00/0.08 c Variables : 131 (131 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.08 c Constraints : 337 initial, 346 maximal
0.00/0.08 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.00/0.08 c trivial : 0.00 0 0 0 0 0 0 0 0
0.00/0.08 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.00/0.08 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.00/0.08 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.00/0.08 c implics : 0.00 0 0 0 0 0 0 0 0
0.00/0.08 c probing : 0.01 0 3 0 0 0 0 0 0
0.00/0.08 c linear : 0.01 30 26 0 30 0 82 0 0
0.00/0.08 c logicor : 0.00 0 0 0 0 0 0 0 0
0.00/0.08 c root node : - 125 - - 125 - - - -
0.00/0.08 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.00/0.08 c integral : 0 0 0 0 0 0 0 0 0 0
0.00/0.08 c logicor : 337+ 0 636 0 2 72 1208 0 0 0
0.00/0.08 c countsols : 0 0 0 0 2 0 0 0 0 0
0.00/0.08 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.00/0.08 c integral : 0.00 0.00 0.00 0.00 0.00
0.00/0.08 c logicor : 0.00 0.00 0.00 0.00 0.00
0.00/0.08 c countsols : 0.00 0.00 0.00 0.00 0.00
0.00/0.08 c Propagators : Time Calls Cutoffs DomReds
0.00/0.08 c vbounds : 0.00 2 0 0
0.00/0.08 c rootredcost : 0.00 0 0 0
0.00/0.08 c pseudoobj : 0.00 459 1 2821
0.00/0.08 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.00/0.08 c propagation : 0.00 73 62 62 8.5 1 19.0 -
0.00/0.08 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.08 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.08 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.08 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.00/0.08 c applied globally : - - - 63 8.7 - - -
0.00/0.08 c applied locally : - - - 0 0.0 - - -
0.00/0.08 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.00/0.08 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.00/0.08 c redcost : 0.00 0 0 0 0 0
0.00/0.08 c impliedbounds : 0.00 0 0 0 0 0
0.00/0.08 c intobj : 0.00 0 0 0 0 0
0.00/0.08 c cgmip : 0.00 0 0 0 0 0
0.00/0.08 c gomory : 0.00 0 0 0 0 0
0.00/0.08 c strongcg : 0.00 0 0 0 0 0
0.00/0.08 c cmir : 0.00 0 0 0 0 0
0.00/0.08 c flowcover : 0.00 0 0 0 0 0
0.00/0.08 c clique : 0.00 0 0 0 0 0
0.00/0.08 c zerohalf : 0.00 0 0 0 0 0
0.00/0.08 c mcf : 0.00 0 0 0 0 0
0.00/0.08 c rapidlearning : 0.00 0 0 0 0 0
0.00/0.08 c Pricers : Time Calls Vars
0.00/0.08 c problem variables: 0.00 0 0
0.00/0.08 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.00/0.08 c relpscost : 0.00 0 0 0 0 0 0
0.00/0.08 c pscost : 0.00 0 0 0 0 0 0
0.00/0.08 c inference : 0.00 99 0 0 0 0 198
0.00/0.08 c mostinf : 0.00 0 0 0 0 0 0
0.00/0.08 c leastinf : 0.00 0 0 0 0 0 0
0.00/0.08 c fullstrong : 0.00 0 0 0 0 0 0
0.00/0.08 c allfullstrong : 0.00 0 0 0 0 0 0
0.00/0.08 c random : 0.00 0 0 0 0 0 0
0.00/0.08 c Primal Heuristics : Time Calls Found
0.00/0.08 c LP solutions : 0.00 - 0
0.00/0.08 c pseudo solutions : 0.00 - 2
0.00/0.08 c oneopt : 0.00 0 0
0.00/0.08 c trivial : 0.00 2 2
0.00/0.08 c simplerounding : 0.00 0 0
0.00/0.08 c zirounding : 0.00 0 0
0.00/0.08 c rounding : 0.00 0 0
0.00/0.08 c shifting : 0.00 0 0
0.00/0.08 c intshifting : 0.00 0 0
0.00/0.08 c twoopt : 0.00 0 0
0.00/0.08 c fixandinfer : 0.00 0 0
0.00/0.08 c feaspump : 0.00 0 0
0.00/0.08 c coefdiving : 0.00 0 0
0.00/0.08 c pscostdiving : 0.00 0 0
0.00/0.08 c fracdiving : 0.00 0 0
0.00/0.08 c veclendiving : 0.00 0 0
0.00/0.08 c intdiving : 0.00 0 0
0.00/0.08 c actconsdiving : 0.00 0 0
0.00/0.08 c objpscostdiving : 0.00 0 0
0.00/0.08 c rootsoldiving : 0.00 0 0
0.00/0.08 c linesearchdiving : 0.00 0 0
0.00/0.08 c guideddiving : 0.00 0 0
0.00/0.08 c octane : 0.00 0 0
0.00/0.08 c rens : 0.00 0 0
0.00/0.08 c rins : 0.00 0 0
0.00/0.08 c localbranching : 0.00 0 0
0.00/0.08 c mutation : 0.00 0 0
0.00/0.08 c crossover : 0.00 0 0
0.00/0.08 c dins : 0.00 0 0
0.00/0.08 c undercover : 0.00 0 0
0.00/0.08 c nlp : 0.00 0 0
0.00/0.08 c trysol : 0.00 0 0
0.00/0.08 c LP : Time Calls Iterations Iter/call Iter/sec
0.00/0.08 c primal LP : 0.00 0 0 0.00 -
0.00/0.08 c dual LP : 0.00 0 0 0.00 -
0.00/0.08 c lex dual LP : 0.00 0 0 0.00 -
0.00/0.08 c barrier LP : 0.00 0 0 0.00 -
0.00/0.08 c diving/probing LP: 0.00 0 0 0.00 -
0.00/0.08 c strong branching : 0.00 0 0 0.00 -
0.00/0.08 c (at root node) : - 0 0 0.00 -
0.00/0.08 c conflict analysis: 0.00 0 0 0.00 -
0.00/0.08 c B&B Tree :
0.00/0.08 c number of runs : 1
0.00/0.08 c nodes : 150
0.00/0.08 c nodes (total) : 150
0.00/0.08 c nodes left : 0
0.00/0.08 c max depth : 32
0.00/0.08 c max depth (total): 32
0.00/0.08 c backtracks : 64 (42.7%)
0.00/0.08 c delayed cutoffs : 43
0.00/0.08 c repropagations : 119 (1220 domain reductions, 24 cutoffs)
0.00/0.08 c avg switch length: 2.96
0.00/0.08 c switching time : 0.01
0.00/0.08 c Solution :
0.00/0.08 c Solutions found : 4 (3 improvements)
0.00/0.08 c First Solution : +9.20000000000000e+01 (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
0.00/0.08 c Primal Bound : +3.30000000000000e+01 (in run 1, after 40 nodes, 0.03 seconds, depth 23, found by <relaxation>)
0.00/0.08 c Dual Bound : +3.30000000000000e+01
0.00/0.08 c Gap : 0.00 %
0.00/0.08 c Root Dual Bound : +3.00000000000000e+01
0.00/0.08 c Root Iterations : 0
0.00/0.09 c Time complete: 0.09.