0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2] [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-2667492-1276418064.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.02 c problem read
0.00/0.02 c presolving settings loaded
0.00/0.02 c presolving:
0.00/0.02 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 3 chg coeffs, 0 upgd conss, 224 impls, 0 clqs
0.00/0.04 c (round 2) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 3 chg coeffs, 440 upgd conss, 224 impls, 0 clqs
0.00/0.04 c (0.0s) probing: 101/200 (50.5%) - 0 fixings, 0 aggregations, 0 implications, 0 bound changes
0.00/0.04 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.00/0.04 c presolving (3 rounds):
0.00/0.04 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 3 changed coefficients
0.00/0.04 c 224 implications, 0 cliques
0.00/0.04 c presolved problem has 200 variables (200 bin, 0 int, 0 impl, 0 cont) and 440 constraints
0.00/0.04 c 440 constraints of type <logicor>
0.00/0.04 c transformed objective value is always integral (scale: 1)
0.00/0.04 c Presolving Time: 0.02
0.00/0.04 c - non default parameters ----------------------------------------------------------------------
0.00/0.04 c # SCIP version 1.2.1.2
0.00/0.04 c
0.00/0.04 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.04 c conflict/interconss = 0
0.00/0.04 c
0.00/0.04 c # should binary conflicts be preferred?
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c conflict/preferbinary = TRUE
0.00/0.04 c
0.00/0.04 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.04 c constraints/agelimit = 1
0.00/0.04 c
0.00/0.04 c # should enforcement of pseudo solution be disabled?
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c constraints/disableenfops = TRUE
0.00/0.04 c
0.00/0.04 c # frequency for displaying node information lines
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.04 c display/freq = 10000
0.00/0.04 c
0.00/0.04 c # maximal time in seconds to run
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.04 c limits/time = 1799.99
0.00/0.04 c
0.00/0.04 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.04 c limits/memory = 1620
0.00/0.04 c
0.00/0.04 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.04 c lp/solvefreq = 0
0.00/0.04 c
0.00/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.00/0.04 c # [type: char, range: {lafpsqd}, default: l]
0.00/0.04 c lp/pricing = a
0.00/0.04 c
0.00/0.04 c # should presolving try to simplify inequalities
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c constraints/linear/simplifyinequalities = TRUE
0.00/0.04 c
0.00/0.04 c # should presolving try to simplify knapsacks
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.04 c
0.00/0.04 c # priority of node selection rule <dfs> in standard mode
0.00/0.04 c # [type: int, range: [-536870912,536870911], default: 0]
0.00/0.04 c nodeselection/dfs/stdpriority = 1000000
0.00/0.04 c
0.00/0.04 c -----------------------------------------------------------------------------------------------
0.00/0.04 c start solving
0.00/0.05 c
0.09/0.13 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.13 c 0.1s| 1 | 0 | 813 | - |1164k| 0 | 200 | 200 | 440 | 200 | 440 | 0 | 0 | 0 | 6.766667e+01 | -- | Inf
0.59/0.63 c 0.6s| 1 | 0 | 2537 | - |2676k| 0 | 200 | 200 | 440 | 200 | 441 | 1 | 0 | 0 | 6.800000e+01 | -- | Inf
0.69/0.77 c 0.7s| 1 | 0 | 2733 | - |4144k| 0 | 200 | 200 | 440 | 200 | 442 | 2 | 0 | 0 | 6.816667e+01 | -- | Inf
0.89/0.93 c 0.9s| 1 | 0 | 2964 | - |5689k| 0 | 200 | 200 | 440 | 200 | 443 | 3 | 0 | 0 | 6.828103e+01 | -- | Inf
1.00/1.07 c 1.0s| 1 | 0 | 3058 | - |7202k| 0 | 200 | 200 | 440 | 200 | 444 | 4 | 0 | 0 | 6.830612e+01 | -- | Inf
1.19/1.22 c 1.2s| 1 | 0 | 3254 | - |8494k| 0 | 200 | 200 | 440 | 200 | 445 | 5 | 0 | 0 | 6.833425e+01 | -- | Inf
1.29/1.37 c 1.3s| 1 | 0 | 3362 | - |9757k| 0 | 200 | 200 | 440 | 200 | 446 | 6 | 0 | 0 | 6.834395e+01 | -- | Inf
1.49/1.54 c 1.5s| 1 | 0 | 3495 | - | 11M| 0 | 200 | 200 | 440 | 200 | 447 | 7 | 0 | 0 | 6.835351e+01 | -- | Inf
1.69/1.71 c 1.7s| 1 | 0 | 3649 | - | 12M| 0 | 200 | 200 | 440 | 200 | 448 | 8 | 0 | 0 | 6.837289e+01 | -- | Inf
1.79/1.89 c 1.8s| 1 | 0 | 3819 | - | 12M| 0 | 200 | 200 | 440 | 200 | 449 | 9 | 0 | 0 | 6.838551e+01 | -- | Inf
1.99/2.03 c 2.0s| 1 | 0 | 3911 | - | 13M| 0 | 200 | 200 | 440 | 200 | 450 | 10 | 0 | 0 | 6.838871e+01 | -- | Inf
2.10/2.16 c 2.1s| 1 | 0 | 3981 | - | 13M| 0 | 200 | 200 | 440 | 200 | 451 | 11 | 0 | 0 | 6.839133e+01 | -- | Inf
2.29/2.31 c 2.2s| 1 | 0 | 4145 | - | 13M| 0 | 200 | 200 | 440 | 200 | 452 | 12 | 0 | 0 | 6.840131e+01 | -- | Inf
2.39/2.44 c 2.4s| 1 | 0 | 4227 | - | 13M| 0 | 200 | 200 | 440 | 200 | 453 | 13 | 0 | 0 | 6.840292e+01 | -- | Inf
2.49/2.56 c 2.5s| 1 | 0 | 4289 | - | 13M| 0 | 200 | 200 | 440 | 200 | 454 | 14 | 0 | 0 | 6.840389e+01 | -- | Inf
2.69/2.74 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
2.69/2.74 c 2.7s| 1 | 0 | 4470 | - | 13M| 0 | 200 | 200 | 440 | 200 | 455 | 15 | 0 | 0 | 6.841370e+01 | -- | Inf
2.79/2.86 c 2.8s| 1 | 0 | 4529 | - | 13M| 0 | 200 | 200 | 440 | 200 | 456 | 16 | 0 | 0 | 6.841424e+01 | -- | Inf
2.89/2.99 c 2.9s| 1 | 0 | 4599 | - | 13M| 0 | 200 | 200 | 440 | 200 | 457 | 17 | 0 | 0 | 6.841458e+01 | -- | Inf
9.29/9.33 c 9.2s| 1 | 2 | 4599 | - | 13M| 0 | 200 | 200 | 440 | 200 | 457 | 17 | 0 | 27 | 6.841458e+01 | -- | Inf
9.39/9.49 o 100
9.39/9.49 c * 9.3s| 379 | 2 | 4599 | 0.0 | 13M| 21 | - | 200 | 453 | 0 | 0 | 17 | 258 | 27 | 6.966667e+01 | 1.000000e+02 | 43.54%
9.49/9.56 c
9.49/9.56 c SCIP Status : problem is solved [optimal solution found]
9.49/9.56 c Solving Time (sec) : 9.37
9.49/9.56 c Solving Nodes : 580
9.49/9.56 c Primal Bound : +1.00000000000000e+02 (1 solutions)
9.49/9.56 c Dual Bound : +1.00000000000000e+02
9.49/9.56 c Gap : 0.00 %
9.49/9.56 s OPTIMUM FOUND
9.49/9.56 v -x200 x199 x198 -x197 x196 -x195 x194 -x193 x192 -x191 -x190 x189 x188 -x187 x186 -x185 x184 -x183 -x182 x181 x180 -x179 -x178
9.49/9.56 v x177 -x176 x175 x174 -x173 -x172 x171 x170 -x169 -x168 x167 -x166 x165 -x164 x163 -x162 x161 -x160 x159 x158 -x157 -x156 x155
9.49/9.56 v x154 -x153 x152 -x151 x150 -x149 -x148 x147 -x146 x145 x144 -x143 -x142 x141 -x140 x139 -x138 x137 -x136 x135 -x134 x133 x132
9.49/9.56 v -x131 -x130 x129 -x128 x127 -x126 x125 x124 -x123 x122 -x121 -x120 x119 x118 -x117 -x116 x115 x114 -x113 -x112 x111 -x110 x109
9.49/9.56 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
9.49/9.56 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
9.49/9.56 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
9.49/9.56 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
9.49/9.56 c SCIP Status : problem is solved [optimal solution found]
9.49/9.56 c Solving Time : 9.37
9.49/9.56 c Original Problem :
9.49/9.56 c Problem name : HOME/instance-2667492-1276418064.opb
9.49/9.56 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
9.49/9.56 c Constraints : 440 initial, 440 maximal
9.49/9.56 c Presolved Problem :
9.49/9.56 c Problem name : t_HOME/instance-2667492-1276418064.opb
9.49/9.56 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
9.49/9.56 c Constraints : 440 initial, 463 maximal
9.49/9.56 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
9.49/9.56 c trivial : 0.00 0 0 0 0 0 0 0 0
9.49/9.56 c dualfix : 0.00 0 0 0 0 0 0 0 0
9.49/9.56 c boundshift : 0.00 0 0 0 0 0 0 0 0
9.49/9.56 c inttobinary : 0.00 0 0 0 0 0 0 0 0
9.49/9.56 c implics : 0.00 0 0 0 0 0 0 0 0
9.49/9.56 c probing : 0.00 0 0 0 0 0 0 0 0
9.49/9.56 c linear : 0.01 0 0 0 0 0 0 0 3
9.49/9.56 c logicor : 0.01 0 0 0 0 0 0 0 0
9.49/9.56 c root node : - 133 - - 133 - - - -
9.49/9.56 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
9.49/9.56 c integral : 0 0 0 1 0 0 0 0 0 2
9.49/9.56 c logicor : 440+ 18 5614 0 1 308 12719 0 0 0
9.49/9.56 c countsols : 0 0 0 0 1 0 0 0 0 0
9.49/9.56 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
9.49/9.56 c integral : 6.14 0.00 0.00 6.14 0.00
9.49/9.56 c logicor : 0.02 0.00 0.02 0.00 0.00
9.49/9.56 c countsols : 0.00 0.00 0.00 0.00 0.00
9.49/9.56 c Propagators : Time Calls Cutoffs DomReds
9.49/9.56 c vbounds : 0.00 2 0 0
9.49/9.56 c rootredcost : 0.00 1 0 0
9.49/9.56 c pseudoobj : 0.08 5892 0 0
9.49/9.56 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
9.49/9.56 c propagation : 0.00 308 289 289 4.1 103 4.0 -
9.49/9.56 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
9.49/9.56 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
9.49/9.56 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
9.49/9.56 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
9.49/9.56 c applied globally : - - - 392 4.1 - - -
9.49/9.56 c applied locally : - - - 0 0.0 - - -
9.49/9.56 c Separators : Time Calls Cutoffs DomReds Cuts Conss
9.49/9.56 c cut pool : 0.03 17 - - 1209 - (maximal pool size: 2281)
9.49/9.56 c redcost : 0.00 18 0 0 0 0
9.49/9.56 c impliedbounds : 0.00 18 0 0 0 0
9.49/9.56 c intobj : 0.00 0 0 0 0 0
9.49/9.56 c cgmip : 0.00 0 0 0 0 0
9.49/9.56 c gomory : 0.89 18 0 0 0 0
9.49/9.56 c strongcg : 0.86 18 0 0 2550 0
9.49/9.56 c cmir : 0.03 10 0 0 0 0
9.49/9.56 c flowcover : 0.08 10 0 0 0 0
9.49/9.56 c clique : 0.00 1 0 0 0 0
9.49/9.56 c zerohalf : 0.00 0 0 0 0 0
9.49/9.56 c mcf : 0.00 1 0 0 0 0
9.49/9.56 c rapidlearning : 0.00 0 0 0 0 0
9.49/9.56 c Pricers : Time Calls Vars
9.49/9.56 c problem variables: 0.00 0 0
9.49/9.56 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
9.49/9.56 c relpscost : 6.14 1 0 0 0 0 2
9.49/9.56 c pscost : 0.00 0 0 0 0 0 0
9.49/9.56 c inference : 0.01 400 0 0 0 0 800
9.49/9.56 c mostinf : 0.00 0 0 0 0 0 0
9.49/9.56 c leastinf : 0.00 0 0 0 0 0 0
9.49/9.56 c fullstrong : 0.00 0 0 0 0 0 0
9.49/9.56 c allfullstrong : 0.00 0 0 0 0 0 0
9.49/9.56 c random : 0.00 0 0 0 0 0 0
9.49/9.56 c Primal Heuristics : Time Calls Found
9.49/9.56 c LP solutions : 0.00 - 0
9.49/9.56 c pseudo solutions : 0.00 - 1
9.49/9.56 c oneopt : 0.00 0 0
9.49/9.56 c crossover : 0.00 0 0
9.49/9.56 c trivial : 0.00 2 0
9.49/9.56 c simplerounding : 0.00 0 0
9.49/9.56 c zirounding : 0.00 1 0
9.49/9.56 c rounding : 0.02 18 0
9.49/9.56 c shifting : 0.02 18 0
9.49/9.56 c intshifting : 0.00 0 0
9.49/9.56 c twoopt : 0.00 0 0
9.49/9.56 c fixandinfer : 0.00 0 0
9.49/9.56 c feaspump : 0.37 1 0
9.49/9.56 c coefdiving : 0.00 0 0
9.49/9.56 c pscostdiving : 0.00 0 0
9.49/9.56 c fracdiving : 0.00 0 0
9.49/9.56 c veclendiving : 0.00 0 0
9.49/9.56 c intdiving : 0.00 0 0
9.49/9.56 c actconsdiving : 0.00 0 0
9.49/9.56 c objpscostdiving : 0.00 0 0
9.49/9.56 c rootsoldiving : 0.00 0 0
9.49/9.56 c linesearchdiving : 0.00 0 0
9.49/9.56 c guideddiving : 0.00 0 0
9.49/9.56 c octane : 0.00 0 0
9.49/9.56 c rens : 0.00 0 0
9.49/9.56 c rins : 0.00 0 0
9.49/9.56 c localbranching : 0.00 0 0
9.49/9.56 c mutation : 0.00 0 0
9.49/9.56 c dins : 0.00 0 0
9.49/9.56 c undercover : 0.00 0 0
9.49/9.56 c nlp : 0.00 0 0
9.49/9.56 c trysol : 0.00 0 0
9.49/9.56 c LP : Time Calls Iterations Iter/call Iter/sec
9.49/9.56 c primal LP : 0.00 0 0 0.00 -
9.49/9.56 c dual LP : 0.70 18 3005 166.94 4292.86
9.49/9.56 c lex dual LP : 0.00 0 0 0.00 -
9.49/9.56 c barrier LP : 0.00 0 0 0.00 -
9.49/9.56 c diving/probing LP: 0.37 27 1594 59.04 4308.11
9.49/9.56 c strong branching : 6.14 27 18107 670.63 2949.02
9.49/9.56 c (at root node) : - 27 18107 670.63 -
9.49/9.56 c conflict analysis: 0.00 0 0 0.00 -
9.49/9.56 c B&B Tree :
9.49/9.56 c number of runs : 1
9.49/9.56 c nodes : 580
9.49/9.56 c nodes (total) : 580
9.49/9.56 c nodes left : 0
9.49/9.56 c max depth : 21
9.49/9.56 c max depth (total): 21
9.49/9.56 c backtracks : 151 (26.0%)
9.49/9.56 c delayed cutoffs : 223
9.49/9.56 c repropagations : 594 (5791 domain reductions, 130 cutoffs)
9.49/9.56 c avg switch length: 3.13
9.49/9.56 c switching time : 0.01
9.49/9.56 c Solution :
9.49/9.56 c Solutions found : 1 (1 improvements)
9.49/9.56 c First Solution : +1.00000000000000e+02 (in run 1, after 379 nodes, 9.30 seconds, depth 10, found by <relaxation>)
9.49/9.56 c Primal Bound : +1.00000000000000e+02 (in run 1, after 379 nodes, 9.30 seconds, depth 10, found by <relaxation>)
9.49/9.56 c Dual Bound : +1.00000000000000e+02
9.49/9.56 c Gap : 0.00 %
9.49/9.56 c Root Dual Bound : +6.84145794533619e+01
9.49/9.56 c Root Iterations : 4599
9.49/9.57 c Time complete: 9.57.