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-2664655-1276427838.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) 0 del vars, 0 del conss, 2 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 722 impls, 0 clqs
0.00/0.04 c (round 2) 4 del vars, 38 del conss, 4 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 732 impls, 0 clqs
0.00/0.04 c (round 3) 5 del vars, 47 del conss, 5 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 738 impls, 0 clqs
0.00/0.05 c (round 4) 9 del vars, 65 del conss, 9 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 738 impls, 0 clqs
0.00/0.05 c (round 5) 14 del vars, 116 del conss, 14 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 776 impls, 0 clqs
0.00/0.05 c (round 6) 16 del vars, 147 del conss, 16 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 812 impls, 0 clqs
0.00/0.05 c (round 7) 19 del vars, 170 del conss, 19 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 812 impls, 0 clqs
0.00/0.06 c (round 8) 22 del vars, 191 del conss, 22 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 830 impls, 0 clqs
0.00/0.06 c (round 9) 22 del vars, 194 del conss, 22 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 844 impls, 0 clqs
0.00/0.07 c (round 10) 22 del vars, 211 del conss, 22 chg bounds, 17 chg sides, 0 chg coeffs, 0 upgd conss, 844 impls, 0 clqs
0.07/0.09 c (round 11) 22 del vars, 211 del conss, 22 chg bounds, 17 chg sides, 0 chg coeffs, 689 upgd conss, 844 impls, 0 clqs
0.09/0.13 c (round 12) 72 del vars, 211 del conss, 26 chg bounds, 17 chg sides, 0 chg coeffs, 689 upgd conss, 5922 impls, 0 clqs
0.09/0.13 c (round 13) 72 del vars, 461 del conss, 26 chg bounds, 17 chg sides, 0 chg coeffs, 689 upgd conss, 5964 impls, 0 clqs
0.09/0.14 c (round 14) 72 del vars, 471 del conss, 26 chg bounds, 17 chg sides, 0 chg coeffs, 689 upgd conss, 5964 impls, 0 clqs
0.09/0.15 c (round 15) 73 del vars, 471 del conss, 26 chg bounds, 17 chg sides, 0 chg coeffs, 689 upgd conss, 6040 impls, 0 clqs
0.09/0.15 c (round 16) 73 del vars, 479 del conss, 26 chg bounds, 17 chg sides, 0 chg coeffs, 689 upgd conss, 6040 impls, 0 clqs
0.09/0.15 c presolving (17 rounds):
0.09/0.15 c 73 deleted vars, 479 deleted constraints, 26 tightened bounds, 0 added holes, 17 changed sides, 0 changed coefficients
0.09/0.15 c 6040 implications, 0 cliques
0.09/0.15 c presolved problem has 127 variables (127 bin, 0 int, 0 impl, 0 cont) and 421 constraints
0.09/0.15 c 421 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.10
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 | - |1264k| 0 | - | 127 | 421 | 0 | 0 | 0 | 0 | 0 | 3.600000e+01 | -- | Inf
0.09/0.16 o 95
0.09/0.16 c * 0.1s| 31 | 4 | 0 | 0.0 |1275k| 16 | - | 127 | 425 | 0 | 0 | 0 | 9 | 0 | 3.700000e+01 | 9.500000e+01 | 156.76%
0.09/0.17 o 93
0.09/0.17 c * 0.1s| 61 | 10 | 0 | 0.0 |1280k| 21 | - | 127 | 429 | 0 | 0 | 0 | 17 | 0 | 3.700000e+01 | 9.300000e+01 | 151.35%
0.09/0.19 o 92
0.09/0.19 c * 0.1s| 206 | 13 | 0 | 0.0 |1268k| 21 | - | 127 | 424 | 0 | 0 | 0 | 54 | 0 | 4.200000e+01 | 9.200000e+01 | 119.05%
0.19/0.20 o 91
0.19/0.20 c * 0.1s| 232 | 15 | 0 | 0.0 |1272k| 24 | - | 127 | 427 | 0 | 0 | 0 | 64 | 0 | 4.200000e+01 | 9.100000e+01 | 116.67%
0.19/0.20 o 90
0.19/0.20 c * 0.1s| 267 | 10 | 0 | 0.0 |1275k| 24 | - | 127 | 434 | 0 | 0 | 0 | 79 | 0 | 4.200000e+01 | 9.000000e+01 | 114.29%
0.59/0.68 o 89
0.59/0.68 c * 0.6s| 2639 | 9 | 0 | 0.0 |1290k| 25 | - | 127 | 470 | 0 | 0 | 0 |1493 | 0 | 4.200000e+01 | 8.900000e+01 | 111.90%
0.99/1.03 o 88
0.99/1.03 c * 0.9s| 4334 | 10 | 0 | 0.0 |1283k| 25 | - | 127 | 455 | 0 | 0 | 0 |2465 | 0 | 4.600000e+01 | 8.800000e+01 | 91.30%
1.49/1.55 c
1.49/1.55 c SCIP Status : problem is solved [optimal solution found]
1.49/1.55 c Solving Time (sec) : 1.33
1.49/1.55 c Solving Nodes : 6864
1.49/1.55 c Primal Bound : +8.80000000000000e+01 (7 solutions)
1.49/1.55 c Dual Bound : +8.80000000000000e+01
1.49/1.55 c Gap : 0.00 %
1.49/1.55 s OPTIMUM FOUND
1.49/1.55 v -x200 -x199 -x198 x197 x196 -x195 -x194 x193 -x192 x191 -x190 x189 -x188 -x187 -x186 x185 x184 -x183 -x182 -x181 -x180 -x179 -x178
1.49/1.55 v x177 -x176 x175 x174 -x173 -x172 x171 x170 -x169 -x168 x167 -x166 x165 x164 -x163 -x162 x161 -x160 x159 x158 -x157 x156 -x155
1.49/1.55 v -x154 x153 -x152 x151 -x150 x149 -x148 x147 x146 -x145 -x144 x143 -x142 x141 x140 -x139 x138 -x137 x136 -x135 -x134 x133
1.49/1.55 v x132 -x131 x130 -x129 -x128 x127 -x126 x125 x124 -x123 -x122 -x121 x120 -x119 x118 -x117 -x116 x115 -x114 x113 -x112 x111 -x110
1.49/1.55 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
1.49/1.55 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
1.49/1.55 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
1.49/1.55 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
1.49/1.55 c SCIP Status : problem is solved [optimal solution found]
1.49/1.55 c Solving Time : 1.33
1.49/1.55 c Original Problem :
1.49/1.55 c Problem name : HOME/instance-2664655-1276427838.opb
1.49/1.55 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
1.49/1.55 c Constraints : 900 initial, 900 maximal
1.49/1.55 c Presolved Problem :
1.49/1.55 c Problem name : t_HOME/instance-2664655-1276427838.opb
1.49/1.55 c Variables : 127 (127 binary, 0 integer, 0 implicit integer, 0 continuous)
1.49/1.55 c Constraints : 421 initial, 501 maximal
1.49/1.55 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.49/1.55 c trivial : 0.00 2 0 0 0 0 0 0 0
1.49/1.55 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.49/1.55 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.49/1.55 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.49/1.55 c implics : 0.00 0 0 0 0 0 0 0 0
1.49/1.55 c probing : 0.04 39 12 0 4 0 0 0 0
1.49/1.55 c linear : 0.04 20 0 0 22 0 211 17 0
1.49/1.55 c logicor : 0.02 0 0 0 0 0 268 0 0
1.49/1.55 c root node : - 119 - - 119 - - - -
1.49/1.55 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.49/1.55 c integral : 0 0 0 0 0 0 0 0 0 0
1.49/1.55 c logicor : 421+ 0 22417 0 7 3075 32027 0 0 0
1.49/1.55 c countsols : 0 0 0 0 7 0 0 0 0 0
1.49/1.55 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.49/1.55 c integral : 0.00 0.00 0.00 0.00 0.00
1.49/1.55 c logicor : 0.34 0.00 0.34 0.00 0.00
1.49/1.55 c countsols : 0.00 0.00 0.00 0.00 0.00
1.49/1.55 c Propagators : Time Calls Cutoffs DomReds
1.49/1.55 c vbounds : 0.02 2 0 0
1.49/1.55 c rootredcost : 0.00 0 0 0
1.49/1.55 c pseudoobj : 0.30 30703 914 50165
1.49/1.55 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.49/1.55 c propagation : 0.25 3975 3933 3933 8.3 15 5.8 -
1.49/1.55 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.49/1.55 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.49/1.55 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.49/1.55 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.49/1.55 c applied globally : - - - 3948 8.3 - - -
1.49/1.55 c applied locally : - - - 0 0.0 - - -
1.49/1.55 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.49/1.55 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
1.49/1.55 c redcost : 0.00 0 0 0 0 0
1.49/1.55 c impliedbounds : 0.00 0 0 0 0 0
1.49/1.55 c intobj : 0.00 0 0 0 0 0
1.49/1.55 c cgmip : 0.00 0 0 0 0 0
1.49/1.55 c gomory : 0.00 0 0 0 0 0
1.49/1.55 c strongcg : 0.00 0 0 0 0 0
1.49/1.55 c cmir : 0.00 0 0 0 0 0
1.49/1.55 c flowcover : 0.00 0 0 0 0 0
1.49/1.55 c clique : 0.00 0 0 0 0 0
1.49/1.55 c zerohalf : 0.00 0 0 0 0 0
1.49/1.55 c mcf : 0.00 0 0 0 0 0
1.49/1.55 c rapidlearning : 0.00 0 0 0 0 0
1.49/1.55 c Pricers : Time Calls Vars
1.49/1.55 c problem variables: 0.00 0 0
1.49/1.55 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.49/1.55 c relpscost : 0.00 0 0 0 0 0 0
1.49/1.55 c pscost : 0.00 0 0 0 0 0 0
1.49/1.55 c inference : 0.03 4702 0 0 0 0 9404
1.49/1.55 c mostinf : 0.00 0 0 0 0 0 0
1.49/1.55 c leastinf : 0.00 0 0 0 0 0 0
1.49/1.55 c fullstrong : 0.00 0 0 0 0 0 0
1.49/1.55 c allfullstrong : 0.00 0 0 0 0 0 0
1.49/1.55 c random : 0.00 0 0 0 0 0 0
1.49/1.55 c Primal Heuristics : Time Calls Found
1.49/1.55 c LP solutions : 0.00 - 0
1.49/1.55 c pseudo solutions : 0.00 - 7
1.49/1.55 c oneopt : 0.01 0 0
1.49/1.55 c trivial : 0.00 2 0
1.49/1.55 c simplerounding : 0.00 0 0
1.49/1.55 c zirounding : 0.00 0 0
1.49/1.55 c rounding : 0.00 0 0
1.49/1.55 c shifting : 0.00 0 0
1.49/1.55 c intshifting : 0.00 0 0
1.49/1.55 c twoopt : 0.00 0 0
1.49/1.55 c fixandinfer : 0.00 0 0
1.49/1.55 c feaspump : 0.00 0 0
1.49/1.55 c coefdiving : 0.00 0 0
1.49/1.55 c pscostdiving : 0.00 0 0
1.49/1.55 c fracdiving : 0.00 0 0
1.49/1.55 c veclendiving : 0.00 0 0
1.49/1.55 c intdiving : 0.00 0 0
1.49/1.55 c actconsdiving : 0.00 0 0
1.49/1.55 c objpscostdiving : 0.00 0 0
1.49/1.55 c rootsoldiving : 0.00 0 0
1.49/1.55 c linesearchdiving : 0.00 0 0
1.49/1.55 c guideddiving : 0.00 0 0
1.49/1.55 c octane : 0.00 0 0
1.49/1.55 c rens : 0.00 0 0
1.49/1.55 c rins : 0.00 0 0
1.49/1.55 c localbranching : 0.00 0 0
1.49/1.55 c mutation : 0.00 0 0
1.49/1.55 c crossover : 0.00 0 0
1.49/1.55 c dins : 0.00 0 0
1.49/1.55 c undercover : 0.00 0 0
1.49/1.55 c nlp : 0.00 0 0
1.49/1.55 c trysol : 0.00 0 0
1.49/1.55 c LP : Time Calls Iterations Iter/call Iter/sec
1.49/1.55 c primal LP : 0.00 0 0 0.00 -
1.49/1.55 c dual LP : 0.00 0 0 0.00 -
1.49/1.55 c lex dual LP : 0.00 0 0 0.00 -
1.49/1.55 c barrier LP : 0.00 0 0 0.00 -
1.49/1.55 c diving/probing LP: 0.00 0 0 0.00 -
1.49/1.55 c strong branching : 0.00 0 0 0.00 -
1.49/1.55 c (at root node) : - 0 0 0.00 -
1.49/1.55 c conflict analysis: 0.00 0 0 0.00 -
1.49/1.55 c B&B Tree :
1.49/1.55 c number of runs : 1
1.49/1.55 c nodes : 6864
1.49/1.55 c nodes (total) : 6864
1.49/1.55 c nodes left : 0
1.49/1.55 c max depth : 25
1.49/1.55 c max depth (total): 25
1.49/1.55 c backtracks : 1856 (27.0%)
1.49/1.55 c delayed cutoffs : 2517
1.49/1.55 c repropagations : 6640 (40066 domain reductions, 1820 cutoffs)
1.49/1.55 c avg switch length: 2.81
1.49/1.55 c switching time : 0.15
1.49/1.55 c Solution :
1.49/1.55 c Solutions found : 7 (7 improvements)
1.49/1.55 c First Solution : +9.50000000000000e+01 (in run 1, after 31 nodes, 0.11 seconds, depth 16, found by <relaxation>)
1.49/1.55 c Primal Bound : +8.80000000000000e+01 (in run 1, after 4334 nodes, 0.86 seconds, depth 18, found by <relaxation>)
1.49/1.55 c Dual Bound : +8.80000000000000e+01
1.49/1.55 c Gap : 0.00 %
1.49/1.55 c Root Dual Bound : +3.60000000000000e+01
1.49/1.55 c Root Iterations : 0
1.49/1.55 c Time complete: 1.54.