0.00/0.00 c SCIP version 1.2.1.3 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2]
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-2703017-1278564394.opb>
0.00/0.01 c original problem has 280 variables (280 bin, 0 int, 0 impl, 0 cont) and 205 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.02 c (round 1) 4 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 25 chg coeffs, 0 upgd conss, 976 impls, 0 clqs
0.00/0.03 c (round 2) 18 del vars, 12 del conss, 0 chg bounds, 0 chg sides, 37 chg coeffs, 5 upgd conss, 1480 impls, 0 clqs
0.00/0.03 c (round 3) 32 del vars, 24 del conss, 0 chg bounds, 0 chg sides, 49 chg coeffs, 5 upgd conss, 1816 impls, 0 clqs
0.00/0.03 c (round 4) 46 del vars, 36 del conss, 0 chg bounds, 0 chg sides, 61 chg coeffs, 5 upgd conss, 1984 impls, 0 clqs
0.00/0.03 c (round 5) 60 del vars, 48 del conss, 0 chg bounds, 0 chg sides, 73 chg coeffs, 5 upgd conss, 1984 impls, 0 clqs
0.00/0.05 c (0.0s) probing: 144/220 (65.5%) - 0 fixings, 0 aggregations, 8 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 (6 rounds):
0.00/0.05 c 60 deleted vars, 48 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 73 changed coefficients
0.00/0.05 c 2000 implications, 0 cliques
0.00/0.05 c presolved problem has 220 variables (220 bin, 0 int, 0 impl, 0 cont) and 153 constraints
0.00/0.05 c 144 constraints of type <and>
0.00/0.05 c 4 constraints of type <linear>
0.00/0.05 c 5 constraints of type <logicor>
0.00/0.05 c transformed objective value is always integral (scale: 2)
0.00/0.05 c Presolving Time: 0.03
0.00/0.05 c - non default parameters ----------------------------------------------------------------------
0.00/0.05 c # SCIP version 1.2.1.3
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 = 1790
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 # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.05 c # [type: int, range: [1,2], default: 1]
0.00/0.05 c timing/clocktype = 2
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 # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05 c constraints/indicator/addCouplingCons = 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 # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.05 c heuristics/undercover/freq = 0
0.00/0.05 c
0.00/0.05 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.05 c separating/rapidlearning/freq = 0
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 0.0s| 1 | 0 | 12 | - |1092k| 0 | 7 | 220 | 153 | 220 | 297 | 0 | 0 | 0 | 3.000000e+00 | -- | Inf
0.49/0.53 c 0.5s| 1 | 0 | 285 | - |1111k| 0 | 17 | 220 | 153 | 220 | 301 | 4 | 0 | 0 | 3.000000e+00 | -- | Inf
0.49/0.55 c 0.5s| 1 | 0 | 294 | - |1142k| 0 | 24 | 220 | 153 | 220 | 307 | 10 | 0 | 0 | 3.000000e+00 | -- | Inf
0.49/0.58 c 0.6s| 1 | 0 | 312 | - |1173k| 0 | 29 | 220 | 153 | 220 | 315 | 18 | 0 | 0 | 3.000000e+00 | -- | Inf
0.59/0.61 c 0.6s| 1 | 0 | 367 | - |1211k| 0 | 46 | 220 | 153 | 220 | 328 | 31 | 0 | 0 | 3.000000e+00 | -- | Inf
0.59/0.67 c 0.7s| 1 | 0 | 432 | - |1236k| 0 | 53 | 220 | 153 | 220 | 349 | 52 | 0 | 0 | 3.000000e+00 | -- | Inf
0.69/0.74 c 0.7s| 1 | 0 | 489 | - |1252k| 0 | 55 | 220 | 153 | 220 | 360 | 63 | 0 | 0 | 3.000000e+00 | -- | Inf
1.00/1.01 c 1.0s| 1 | 2 | 489 | - |1253k| 0 | 55 | 220 | 153 | 220 | 360 | 63 | 0 | 18 | 3.000000e+00 | -- | Inf
3.59/3.64 o 7
3.59/3.64 c * 3.6s| 572 | 140 | 5980 | 9.6 |1619k| 47 | - | 220 | 512 | 220 | 161 |1502 | 359 |1440 | 3.000000e+00 | 7.000000e+00 | 133.33%
3.89/3.97 o 5
3.89/3.97 c * 4.0s| 825 | 201 | 7246 | 8.2 |1788k| 47 | - | 220 | 702 | 220 | 150 |1931 | 590 |1563 | 3.000000e+00 | 5.000000e+00 | 66.67%
3.89/3.97 o 3
3.89/3.97 c * 4.0s| 826 | 0 | 7246 | 8.2 |1581k| 47 | - | 220 | 702 | 220 | 144 |1931 | 590 |1563 | 3.000000e+00 | 3.000000e+00 | 0.00%
3.89/3.97 c
3.89/3.97 c SCIP Status : problem is solved [optimal solution found]
3.89/3.97 c Solving Time (sec) : 3.96
3.89/3.97 c Solving Nodes : 826
3.89/3.97 c Primal Bound : +3.00000000000000e+00 (3 solutions)
3.89/3.97 c Dual Bound : +3.00000000000000e+00
3.89/3.97 c Gap : 0.00 %
3.89/3.97 s OPTIMUM FOUND
3.89/3.97 v x84 x83 -x82 -x81 x80 -x79 x78 -x77 -x76 -x75 x74 x73 -x72 x71 x56 x55 x54 x53 -x52 -x51 x50 x70 -x69 -x68 -x67 -x66 x65 x64 -x49
3.89/3.97 v -x48 -x47 x46 x45 x44 x43 -x63 -x62 -x61 -x60 -x59 x58 -x57 x42 -x41 -x40 -x39 x38 x37 x36 x35 x34 -x33 x32 -x31 x30 x29 x28
3.89/3.97 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
3.89/3.97 c SCIP Status : problem is solved [optimal solution found]
3.89/3.97 c Solving Time : 3.96
3.89/3.97 c Original Problem :
3.89/3.97 c Problem name : HOME/instance-2703017-1278564394.opb
3.89/3.97 c Variables : 280 (280 binary, 0 integer, 0 implicit integer, 0 continuous)
3.89/3.97 c Constraints : 205 initial, 205 maximal
3.89/3.97 c Presolved Problem :
3.89/3.97 c Problem name : t_HOME/instance-2703017-1278564394.opb
3.89/3.97 c Variables : 220 (220 binary, 0 integer, 0 implicit integer, 0 continuous)
3.89/3.97 c Constraints : 153 initial, 702 maximal
3.89/3.97 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
3.89/3.97 c trivial : 0.00 0 0 0 0 0 0 0 0
3.89/3.97 c dualfix : 0.00 0 0 0 0 0 0 0 0
3.89/3.97 c boundshift : 0.00 0 0 0 0 0 0 0 0
3.89/3.97 c inttobinary : 0.00 0 0 0 0 0 0 0 0
3.89/3.97 c implics : 0.00 0 0 0 0 0 0 0 0
3.89/3.97 c probing : 0.01 0 0 0 0 0 0 0 0
3.89/3.97 c and : 0.01 8 48 0 0 0 48 0 48
3.89/3.97 c linear : 0.00 1 3 0 0 0 0 0 25
3.89/3.97 c logicor : 0.00 0 0 0 0 0 0 0 0
3.89/3.97 c root node : - 34 - - 34 - - - -
3.89/3.97 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
3.89/3.97 c integral : 0 0 0 675 0 0 69 0 0 1250
3.89/3.97 c and : 144 1357 2963 2 0 60 3541 1895 0 0
3.89/3.97 c linear : 4 6 2902 2 0 232 1487 0 0 0
3.89/3.97 c logicor : 5+ 6 1051 2 0 9 311 0 0 0
3.89/3.97 c countsols : 0 0 0 3 0 0 0 0 0 0
3.89/3.97 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
3.89/3.97 c integral : 2.12 0.00 0.00 2.12 0.00
3.89/3.97 c and : 0.05 0.03 0.02 0.00 0.00
3.89/3.97 c linear : 0.06 0.00 0.06 0.00 0.00
3.89/3.97 c logicor : 0.01 0.00 0.01 0.00 0.00
3.89/3.97 c countsols : 0.00 0.00 0.00 0.00 0.00
3.89/3.97 c Propagators : Time Calls Cutoffs DomReds
3.89/3.97 c vbounds : 0.00 2 0 0
3.89/3.97 c rootredcost : 0.00 2 0 5
3.89/3.97 c pseudoobj : 0.00 2670 0 12
3.89/3.97 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
3.89/3.97 c propagation : 0.04 301 298 2056 31.7 166 23.8 -
3.89/3.97 c infeasible LP : 0.00 11 10 26 36.1 6 7.0 0
3.89/3.97 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
3.89/3.97 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
3.89/3.97 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
3.89/3.97 c applied globally : - - - 590 17.8 - - -
3.89/3.97 c applied locally : - - - 0 0.0 - - -
3.89/3.97 c Separators : Time Calls Cutoffs DomReds Cuts Conss
3.89/3.97 c cut pool : 0.00 5 - - 36 - (maximal pool size: 107)
3.89/3.97 c redcost : 0.01 1358 0 0 0 0
3.89/3.97 c impliedbounds : 0.00 6 0 0 18 0
3.89/3.97 c intobj : 0.00 0 0 0 0 0
3.89/3.97 c cgmip : 0.00 0 0 0 0 0
3.89/3.97 c gomory : 0.06 6 0 0 43 0
3.89/3.97 c strongcg : 0.05 6 0 0 78 0
3.89/3.97 c cmir : 0.02 6 0 0 47 0
3.89/3.97 c flowcover : 0.05 6 0 0 75 0
3.89/3.97 c clique : 0.00 1 0 0 0 0
3.89/3.97 c zerohalf : 0.00 0 0 0 0 0
3.89/3.97 c mcf : 0.00 1 0 0 0 0
3.89/3.97 c rapidlearning : 0.03 1 0 0 0 0
3.89/3.97 c Pricers : Time Calls Vars
3.89/3.97 c problem variables: 0.00 0 0
3.89/3.97 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
3.89/3.97 c relpscost : 2.12 672 0 69 0 0 1250
3.89/3.97 c pscost : 0.00 0 0 0 0 0 0
3.89/3.97 c inference : 0.00 0 0 0 0 0 0
3.89/3.97 c mostinf : 0.00 0 0 0 0 0 0
3.89/3.97 c leastinf : 0.00 0 0 0 0 0 0
3.89/3.97 c fullstrong : 0.00 0 0 0 0 0 0
3.89/3.97 c allfullstrong : 0.00 0 0 0 0 0 0
3.89/3.97 c random : 0.00 0 0 0 0 0 0
3.89/3.97 c Primal Heuristics : Time Calls Found
3.89/3.97 c LP solutions : 0.00 - 3
3.89/3.97 c pseudo solutions : 0.00 - 0
3.89/3.97 c crossover : 0.00 0 0
3.89/3.97 c guideddiving : 0.00 0 0
3.89/3.97 c intshifting : 0.00 0 0
3.89/3.97 c pscostdiving : 0.00 1 0
3.89/3.97 c fracdiving : 0.01 1 0
3.89/3.97 c veclendiving : 0.00 1 0
3.89/3.97 c linesearchdiving : 0.00 1 0
3.89/3.97 c feaspump : 0.01 1 0
3.89/3.97 c objpscostdiving : 0.01 1 0
3.89/3.97 c rootsoldiving : 0.03 1 0
3.89/3.97 c coefdiving : 0.01 2 0
3.89/3.97 c trivial : 0.00 2 0
3.89/3.97 c simplerounding : 0.00 0 0
3.89/3.97 c zirounding : 0.01 621 0
3.89/3.97 c rounding : 0.02 508 0
3.89/3.97 c shifting : 0.13 109 0
3.89/3.97 c oneopt : 0.00 2 0
3.89/3.97 c twoopt : 0.00 0 0
3.89/3.97 c fixandinfer : 0.00 0 0
3.89/3.97 c intdiving : 0.00 0 0
3.89/3.97 c actconsdiving : 0.00 0 0
3.89/3.97 c octane : 0.00 0 0
3.89/3.97 c rens : 0.03 1 0
3.89/3.97 c rins : 0.00 0 0
3.89/3.97 c localbranching : 0.00 0 0
3.89/3.97 c mutation : 0.00 0 0
3.89/3.97 c dins : 0.00 0 0
3.89/3.97 c undercover : 0.43 1 0
3.89/3.97 c nlp : 0.00 0 0
3.89/3.97 c trysol : 0.00 0 0
3.89/3.97 c LP : Time Calls Iterations Iter/call Iter/sec
3.89/3.97 c primal LP : 0.02 0 0 0.00 0.00
3.89/3.97 c dual LP : 0.55 1390 6338 4.56 11481.74
3.89/3.97 c lex dual LP : 0.00 0 0 0.00 -
3.89/3.97 c barrier LP : 0.00 0 0 0.00 -
3.89/3.97 c diving/probing LP: 0.05 171 908 5.31 18159.64
3.89/3.97 c strong branching : 2.11 1563 25676 16.43 12162.79
3.89/3.97 c (at root node) : - 18 1921 106.72 -
3.89/3.97 c conflict analysis: 0.00 0 0 0.00 -
3.89/3.97 c B&B Tree :
3.89/3.97 c number of runs : 1
3.89/3.97 c nodes : 826
3.89/3.97 c nodes (total) : 826
3.89/3.97 c nodes left : 0
3.89/3.97 c max depth : 47
3.89/3.97 c max depth (total): 47
3.89/3.97 c backtracks : 135 (16.3%)
3.89/3.97 c delayed cutoffs : 113
3.89/3.97 c repropagations : 478 (1101 domain reductions, 92 cutoffs)
3.89/3.97 c avg switch length: 3.67
3.89/3.97 c switching time : 0.05
3.89/3.97 c Solution :
3.89/3.97 c Solutions found : 3 (3 improvements)
3.89/3.97 c First Solution : +7.00000000000000e+00 (in run 1, after 572 nodes, 3.63 seconds, depth 47, found by <relaxation>)
3.89/3.97 c Primal Bound : +3.00000000000000e+00 (in run 1, after 826 nodes, 3.96 seconds, depth 39, found by <relaxation>)
3.89/3.97 c Dual Bound : +3.00000000000000e+00
3.89/3.97 c Gap : 0.00 %
3.89/3.97 c Root Dual Bound : +3.00000000000000e+00
3.89/3.97 c Root Iterations : 489
3.89/3.98 c Time complete: 3.98.