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-2666554-1276650322.opb>
0.00/0.01 c original problem has 352 variables (352 bin, 0 int, 0 impl, 0 cont) and 265 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.02 c presolving:
0.00/0.05 c (round 1) 4 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 30 chg coeffs, 0 upgd conss, 1240 impls, 0 clqs
0.00/0.05 c (round 2) 20 del vars, 14 del conss, 0 chg bounds, 0 chg sides, 44 chg coeffs, 5 upgd conss, 1912 impls, 0 clqs
0.00/0.06 c (round 3) 36 del vars, 28 del conss, 0 chg bounds, 0 chg sides, 58 chg coeffs, 5 upgd conss, 2360 impls, 0 clqs
0.00/0.06 c (round 4) 52 del vars, 42 del conss, 0 chg bounds, 0 chg sides, 72 chg coeffs, 5 upgd conss, 2584 impls, 0 clqs
0.00/0.07 c (round 5) 68 del vars, 56 del conss, 0 chg bounds, 0 chg sides, 86 chg coeffs, 5 upgd conss, 2584 impls, 0 clqs
0.00/0.08 c (0.0s) probing: 151/284 (53.2%) - 0 fixings, 0 aggregations, 8 implications, 0 bound changes
0.00/0.08 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.00/0.08 c presolving (6 rounds):
0.00/0.08 c 68 deleted vars, 56 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 86 changed coefficients
0.00/0.08 c 2600 implications, 0 cliques
0.00/0.08 c presolved problem has 284 variables (284 bin, 0 int, 0 impl, 0 cont) and 205 constraints
0.00/0.08 c 196 constraints of type <and>
0.00/0.08 c 4 constraints of type <linear>
0.00/0.08 c 5 constraints of type <logicor>
0.00/0.08 c transformed objective value is always integral (scale: 2)
0.00/0.08 c Presolving Time: 0.04
0.00/0.08 c - non default parameters ----------------------------------------------------------------------
0.00/0.08 c # SCIP version 1.2.1.2
0.00/0.08 c
0.00/0.08 c # frequency for displaying node information lines
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.08 c display/freq = 10000
0.00/0.08 c
0.00/0.08 c # maximal time in seconds to run
0.00/0.08 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.08 c limits/time = 1800
0.00/0.08 c
0.00/0.08 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.08 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.08 c limits/memory = 1620
0.00/0.08 c
0.00/0.08 c # should presolving try to simplify inequalities
0.00/0.08 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.08 c constraints/linear/simplifyinequalities = TRUE
0.00/0.08 c
0.00/0.08 c # should presolving try to simplify knapsacks
0.00/0.08 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.08 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.08 c
0.00/0.08 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.08 c heuristics/undercover/freq = 0
0.00/0.08 c
0.00/0.08 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.08 c separating/rapidlearning/freq = 0
0.00/0.08 c
0.00/0.08 c -----------------------------------------------------------------------------------------------
0.00/0.08 c start solving
0.00/0.09 c
0.00/0.09 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.09 c 0.0s| 1 | 0 | 12 | - |1367k| 0 | 7 | 284 | 205 | 284 | 401 | 0 | 0 | 0 | 3.000000e+00 | -- | Inf
0.59/0.69 c 0.5s| 1 | 0 | 269 | - |1382k| 0 | 11 | 284 | 205 | 284 | 402 | 1 | 0 | 0 | 3.000000e+00 | -- | Inf
0.69/0.70 c 0.5s| 1 | 0 | 276 | - |1401k| 0 | 16 | 284 | 205 | 284 | 406 | 5 | 0 | 0 | 3.000000e+00 | -- | Inf
0.69/0.73 c 0.5s| 1 | 0 | 284 | - |1416k| 0 | 23 | 284 | 205 | 284 | 411 | 10 | 0 | 0 | 3.000000e+00 | -- | Inf
0.69/0.76 c 0.5s| 1 | 0 | 289 | - |1443k| 0 | 24 | 284 | 205 | 284 | 418 | 17 | 0 | 0 | 3.000000e+00 | -- | Inf
0.79/0.81 c 0.6s| 1 | 0 | 292 | - |1456k| 0 | 26 | 284 | 205 | 284 | 421 | 20 | 0 | 0 | 3.000000e+00 | -- | Inf
0.79/0.86 c 0.6s| 1 | 0 | 295 | - |1460k| 0 | 28 | 284 | 205 | 284 | 424 | 23 | 0 | 0 | 3.000000e+00 | -- | Inf
0.89/0.92 c 0.7s| 1 | 2 | 295 | - |1460k| 0 | 28 | 284 | 205 | 284 | 424 | 23 | 0 | 18 | 3.000000e+00 | -- | Inf
1.69/1.78 o 3
1.69/1.78 c * 1.5s| 218 | 0 | 1921 | 7.5 |1535k| 42 | - | 284 | 233 | 284 | 81 | 807 | 56 | 972 | 3.000000e+00 | 3.000000e+00 | 0.00%
1.69/1.78 c
1.69/1.78 c SCIP Status : problem is solved [optimal solution found]
1.69/1.78 c Solving Time (sec) : 1.49
1.69/1.78 c Solving Nodes : 218
1.69/1.78 c Primal Bound : +3.00000000000000e+00 (1 solutions)
1.69/1.78 c Dual Bound : +3.00000000000000e+00
1.69/1.78 c Gap : 0.00 %
1.69/1.78 s OPTIMUM FOUND
1.69/1.78 v -x96 x95 x94 -x93 -x92 -x91 x90 x89 -x88 x87 x86 -x85 -x84 -x83 -x82 -x81 x64 -x63 -x62 -x61 x60 x59 -x58 x57 -x80 x79 -x78 -x77
1.69/1.78 v -x76 x75 -x74 -x73 -x56 x55 x54 -x53 x52 -x51 x50 x49 -x72 -x71 -x70 -x69 -x68 -x67 -x66 x65 x48 -x47 -x46 x45 x44 -x43 x42
1.69/1.78 v x41 x40 -x39 x38 x37 -x36 x35 -x34 x33 x32 x31 x30 -x29 -x28 x27 x26 x25 -x24 x23 x22 x21 -x20 -x19 -x18 x17 x16 -x15 -x14 -x13
1.69/1.78 v x12 -x11 -x10 x9 -x8 -x7 -x6 -x5 -x4 -x3 x2 x1
1.69/1.78 c SCIP Status : problem is solved [optimal solution found]
1.69/1.78 c Solving Time : 1.49
1.69/1.78 c Original Problem :
1.69/1.78 c Problem name : HOME/instance-2666554-1276650322.opb
1.69/1.78 c Variables : 352 (352 binary, 0 integer, 0 implicit integer, 0 continuous)
1.69/1.78 c Constraints : 265 initial, 265 maximal
1.69/1.78 c Presolved Problem :
1.69/1.78 c Problem name : t_HOME/instance-2666554-1276650322.opb
1.69/1.78 c Variables : 284 (284 binary, 0 integer, 0 implicit integer, 0 continuous)
1.69/1.78 c Constraints : 205 initial, 233 maximal
1.69/1.78 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.69/1.78 c trivial : 0.00 0 0 0 0 0 0 0 0
1.69/1.78 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.69/1.78 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.69/1.78 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.69/1.78 c implics : 0.00 0 0 0 0 0 0 0 0
1.69/1.78 c probing : 0.01 0 0 0 0 0 0 0 0
1.69/1.78 c and : 0.03 8 56 0 0 0 56 0 56
1.69/1.78 c linear : 0.00 1 3 0 0 0 0 0 30
1.69/1.78 c logicor : 0.00 0 0 0 0 0 0 0 0
1.69/1.78 c root node : - 0 - - 0 - - - -
1.69/1.78 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.69/1.78 c integral : 0 0 0 193 0 0 12 0 0 368
1.69/1.78 c and : 196 396 1087 0 0 13 1012 787 0 0
1.69/1.78 c linear : 4 6 1073 0 0 44 365 0 0 0
1.69/1.78 c logicor : 5+ 6 160 0 0 0 28 0 0 0
1.69/1.78 c countsols : 0 0 0 1 0 0 0 0 0 0
1.69/1.78 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.69/1.78 c integral : 0.59 0.00 0.00 0.59 0.00
1.69/1.78 c and : 0.02 0.02 0.00 0.00 0.00
1.69/1.78 c linear : 0.04 0.00 0.04 0.00 0.00
1.69/1.78 c logicor : 0.00 0.00 0.00 0.00 0.00
1.69/1.78 c countsols : 0.00 0.00 0.00 0.00 0.00
1.69/1.78 c Propagators : Time Calls Cutoffs DomReds
1.69/1.78 c vbounds : 0.00 2 0 0
1.69/1.78 c rootredcost : 0.00 0 0 0
1.69/1.78 c pseudoobj : 0.00 782 0 0
1.69/1.78 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.69/1.78 c propagation : 0.02 53 51 702 58.2 6 40.0 -
1.69/1.78 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.69/1.78 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.69/1.78 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.69/1.78 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.69/1.78 c applied globally : - - - 28 17.2 - - -
1.69/1.78 c applied locally : - - - 28 38.9 - - -
1.69/1.78 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.69/1.78 c cut pool : 0.00 5 - - 9 - (maximal pool size: 39)
1.69/1.78 c redcost : 0.00 397 0 0 0 0
1.69/1.78 c impliedbounds : 0.00 6 0 0 1 0
1.69/1.78 c intobj : 0.00 0 0 0 0 0
1.69/1.78 c cgmip : 0.00 0 0 0 0 0
1.69/1.78 c gomory : 0.05 6 0 0 0 0
1.69/1.78 c strongcg : 0.03 6 0 0 1 0
1.69/1.78 c cmir : 0.03 6 0 0 21 0
1.69/1.78 c flowcover : 0.06 6 0 0 29 0
1.69/1.78 c clique : 0.00 1 0 0 0 0
1.69/1.78 c zerohalf : 0.00 0 0 0 0 0
1.69/1.78 c mcf : 0.00 1 0 0 0 0
1.69/1.78 c rapidlearning : 0.03 1 0 0 0 0
1.69/1.78 c Pricers : Time Calls Vars
1.69/1.78 c problem variables: 0.00 0 0
1.69/1.78 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.69/1.78 c relpscost : 0.59 192 0 12 0 0 368
1.69/1.78 c pscost : 0.00 0 0 0 0 0 0
1.69/1.78 c inference : 0.00 0 0 0 0 0 0
1.69/1.78 c mostinf : 0.00 0 0 0 0 0 0
1.69/1.78 c leastinf : 0.00 0 0 0 0 0 0
1.69/1.78 c fullstrong : 0.00 0 0 0 0 0 0
1.69/1.78 c allfullstrong : 0.00 0 0 0 0 0 0
1.69/1.78 c random : 0.00 0 0 0 0 0 0
1.69/1.78 c Primal Heuristics : Time Calls Found
1.69/1.78 c LP solutions : 0.00 - 1
1.69/1.78 c pseudo solutions : 0.00 - 0
1.69/1.78 c oneopt : 0.00 0 0
1.69/1.78 c crossover : 0.00 0 0
1.69/1.78 c veclendiving : 0.00 0 0
1.69/1.78 c objpscostdiving : 0.00 0 0
1.69/1.78 c rootsoldiving : 0.00 0 0
1.69/1.78 c linesearchdiving : 0.00 0 0
1.69/1.78 c guideddiving : 0.00 0 0
1.69/1.78 c coefdiving : 0.01 1 0
1.69/1.78 c pscostdiving : 0.01 1 0
1.69/1.78 c fracdiving : 0.01 1 0
1.69/1.78 c feaspump : 0.01 1 0
1.69/1.78 c trivial : 0.00 2 0
1.69/1.78 c simplerounding : 0.00 0 0
1.69/1.78 c zirounding : 0.00 183 0
1.69/1.78 c rounding : 0.00 234 0
1.69/1.78 c shifting : 0.05 46 0
1.69/1.78 c intshifting : 0.00 0 0
1.69/1.78 c twoopt : 0.00 0 0
1.69/1.78 c fixandinfer : 0.00 0 0
1.69/1.78 c intdiving : 0.00 0 0
1.69/1.78 c actconsdiving : 0.00 0 0
1.69/1.78 c octane : 0.00 0 0
1.69/1.78 c rens : 0.01 1 0
1.69/1.78 c rins : 0.00 0 0
1.69/1.78 c localbranching : 0.00 0 0
1.69/1.78 c mutation : 0.00 0 0
1.69/1.78 c dins : 0.00 0 0
1.69/1.78 c undercover : 0.35 1 0
1.69/1.78 c nlp : 0.00 0 0
1.69/1.78 c trysol : 0.00 0 0
1.69/1.78 c LP : Time Calls Iterations Iter/call Iter/sec
1.69/1.78 c primal LP : 0.02 0 0 0.00 0.00
1.69/1.78 c dual LP : 0.10 406 1537 3.79 15370.00
1.69/1.78 c lex dual LP : 0.00 0 0 0.00 -
1.69/1.79 c barrier LP : 0.00 0 0 0.00 -
1.69/1.79 c diving/probing LP: 0.02 90 384 4.27 19200.00
1.69/1.79 c strong branching : 0.58 972 6207 6.39 10701.72
1.69/1.79 c (at root node) : - 18 275 15.28 -
1.69/1.79 c conflict analysis: 0.00 0 0 0.00 -
1.69/1.79 c B&B Tree :
1.69/1.79 c number of runs : 1
1.69/1.79 c nodes : 218
1.69/1.79 c nodes (total) : 218
1.69/1.79 c nodes left : 0
1.69/1.79 c max depth : 42
1.69/1.79 c max depth (total): 42
1.69/1.79 c backtracks : 21 (9.6%)
1.69/1.79 c delayed cutoffs : 13
1.69/1.79 c repropagations : 54 (157 domain reductions, 13 cutoffs)
1.69/1.79 c avg switch length: 3.08
1.69/1.79 c switching time : 0.04
1.69/1.79 c Solution :
1.69/1.79 c Solutions found : 1 (1 improvements)
1.69/1.79 c First Solution : +3.00000000000000e+00 (in run 1, after 218 nodes, 1.49 seconds, depth 34, found by <relaxation>)
1.69/1.79 c Primal Bound : +3.00000000000000e+00 (in run 1, after 218 nodes, 1.49 seconds, depth 34, found by <relaxation>)
1.69/1.79 c Dual Bound : +3.00000000000000e+00
1.69/1.79 c Gap : 0.00 %
1.69/1.79 c Root Dual Bound : +3.00000000000000e+00
1.69/1.79 c Root Iterations : 295
1.69/1.79 c Time complete: 1.79.