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-2666367-1276645905.opb>
0.00/0.01 c original problem has 160 variables (160 bin, 0 int, 0 impl, 0 cont) and 109 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.01 c presolving:
0.00/0.02 c (round 1) 5 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 15 chg coeffs, 0 upgd conss, 580 impls, 0 clqs
0.00/0.02 c (round 2) 18 del vars, 8 del conss, 0 chg bounds, 0 chg sides, 23 chg coeffs, 0 upgd conss, 882 impls, 0 clqs
0.02/0.03 c (round 3) 28 del vars, 16 del conss, 0 chg bounds, 0 chg sides, 31 chg coeffs, 5 upgd conss, 1042 impls, 0 clqs
0.02/0.03 c (round 4) 38 del vars, 24 del conss, 0 chg bounds, 0 chg sides, 39 chg coeffs, 5 upgd conss, 1122 impls, 0 clqs
0.02/0.03 c (round 5) 48 del vars, 32 del conss, 0 chg bounds, 0 chg sides, 47 chg coeffs, 5 upgd conss, 1122 impls, 0 clqs
0.02/0.04 c presolving (6 rounds):
0.02/0.04 c 48 deleted vars, 32 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 47 changed coefficients
0.02/0.04 c 1146 implications, 0 cliques
0.02/0.04 c presolved problem has 112 variables (112 bin, 0 int, 0 impl, 0 cont) and 73 constraints
0.02/0.04 c 62 constraints of type <and>
0.02/0.04 c 4 constraints of type <linear>
0.02/0.04 c 7 constraints of type <logicor>
0.02/0.04 c transformed objective value is always integral (scale: 2)
0.02/0.04 c Presolving Time: 0.02
0.02/0.04 c - non default parameters ----------------------------------------------------------------------
0.02/0.04 c # SCIP version 1.2.1.2
0.02/0.04 c
0.02/0.04 c # frequency for displaying node information lines
0.02/0.04 c # [type: int, range: [-1,2147483647], default: 100]
0.02/0.04 c display/freq = 10000
0.02/0.04 c
0.02/0.04 c # maximal time in seconds to run
0.02/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.02/0.04 c limits/time = 1800
0.02/0.04 c
0.02/0.04 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.02/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.02/0.04 c limits/memory = 1620
0.02/0.04 c
0.02/0.04 c # should presolving try to simplify inequalities
0.02/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.04 c constraints/linear/simplifyinequalities = TRUE
0.02/0.04 c
0.02/0.04 c # should presolving try to simplify knapsacks
0.02/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.04 c constraints/knapsack/simplifyinequalities = TRUE
0.02/0.04 c
0.02/0.04 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.04 c heuristics/undercover/freq = 0
0.02/0.04 c
0.02/0.04 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.04 c separating/rapidlearning/freq = 0
0.02/0.04 c
0.02/0.04 c -----------------------------------------------------------------------------------------------
0.02/0.04 c start solving
0.02/0.04 c
0.02/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.02/0.05 c 0.0s| 1 | 0 | 9 | - | 629k| 0 | 2 | 112 | 73 | 112 | 133 | 0 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.13 c 0.1s| 1 | 0 | 135 | - | 638k| 0 | 11 | 112 | 73 | 112 | 138 | 5 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.13 c 0.1s| 1 | 0 | 141 | - | 656k| 0 | 13 | 112 | 73 | 112 | 144 | 11 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.14 c 0.1s| 1 | 0 | 152 | - | 670k| 0 | 12 | 112 | 73 | 112 | 148 | 15 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.15 c 0.1s| 1 | 0 | 182 | - | 693k| 0 | 17 | 112 | 73 | 112 | 154 | 21 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.16 c 0.1s| 1 | 0 | 203 | - | 714k| 0 | 24 | 112 | 73 | 112 | 166 | 33 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.18 c 0.1s| 1 | 0 | 264 | - | 734k| 0 | 17 | 112 | 73 | 112 | 172 | 39 | 0 | 0 | 3.000000e+00 | -- | Inf
0.19/0.22 c 0.1s| 1 | 2 | 264 | - | 735k| 0 | 17 | 112 | 73 | 112 | 172 | 39 | 0 | 9 | 3.000000e+00 | -- | Inf
0.39/0.40 o 3
0.39/0.40 c * 0.3s| 62 | 0 | 829 | 9.3 | 783k| 18 | - | 112 | 107 | 112 | 82 | 178 | 34 | 281 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.39/0.40 c
0.39/0.40 c SCIP Status : problem is solved [optimal solution found]
0.39/0.40 c Solving Time (sec) : 0.32
0.39/0.40 c Solving Nodes : 62
0.39/0.40 c Primal Bound : +3.00000000000000e+00 (1 solutions)
0.39/0.40 c Dual Bound : +3.00000000000000e+00
0.39/0.40 c Gap : 0.00 %
0.39/0.40 s OPTIMUM FOUND
0.39/0.40 v -x60 -x59 x58 -x57 x56 x55 x54 -x53 -x52 -x51 -x40 -x39 x38 x37 x36 -x50 -x49 x48 x47 -x46 x35 x34 -x33 -x32 x31 -x45 -x44 -x43
0.39/0.40 v -x42 x41 -x30 -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
0.39/0.40 v x1
0.39/0.40 c SCIP Status : problem is solved [optimal solution found]
0.39/0.40 c Solving Time : 0.32
0.39/0.40 c Original Problem :
0.39/0.40 c Problem name : HOME/instance-2666367-1276645905.opb
0.39/0.40 c Variables : 160 (160 binary, 0 integer, 0 implicit integer, 0 continuous)
0.39/0.40 c Constraints : 109 initial, 109 maximal
0.39/0.40 c Presolved Problem :
0.39/0.40 c Problem name : t_HOME/instance-2666367-1276645905.opb
0.39/0.40 c Variables : 112 (112 binary, 0 integer, 0 implicit integer, 0 continuous)
0.39/0.40 c Constraints : 73 initial, 107 maximal
0.39/0.40 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.39/0.40 c trivial : 0.00 0 0 0 0 0 0 0 0
0.39/0.40 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.39/0.40 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.39/0.40 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.39/0.40 c implics : 0.00 0 0 0 0 0 0 0 0
0.39/0.40 c probing : 0.01 0 0 0 0 0 0 0 0
0.39/0.40 c and : 0.01 8 32 0 0 0 32 0 32
0.39/0.40 c linear : 0.00 3 5 0 0 0 0 0 15
0.39/0.40 c logicor : 0.00 0 0 0 0 0 0 0 0
0.39/0.40 c root node : - 0 - - 0 - - - -
0.39/0.40 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.39/0.40 c integral : 0 0 0 71 0 0 25 0 0 108
0.39/0.40 c and : 62 130 443 0 0 5 203 151 0 0
0.39/0.40 c linear : 4 6 438 0 0 9 107 0 0 0
0.39/0.40 c logicor : 7+ 6 98 1 0 0 6 0 0 0
0.39/0.40 c countsols : 0 0 0 1 0 0 0 0 0 0
0.39/0.40 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.39/0.40 c integral : 0.12 0.00 0.00 0.12 0.00
0.39/0.40 c and : 0.00 0.00 0.00 0.00 0.00
0.39/0.40 c linear : 0.01 0.00 0.01 0.00 0.00
0.39/0.40 c logicor : 0.00 0.00 0.00 0.00 0.00
0.39/0.40 c countsols : 0.00 0.00 0.00 0.00 0.00
0.39/0.40 c Propagators : Time Calls Cutoffs DomReds
0.39/0.40 c vbounds : 0.00 2 0 0
0.39/0.40 c rootredcost : 0.00 0 0 0
0.39/0.40 c pseudoobj : 0.00 209 0 0
0.39/0.40 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.39/0.40 c propagation : 0.00 14 14 99 23.0 3 12.0 -
0.39/0.40 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.39/0.41 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.39/0.41 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.39/0.41 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.39/0.41 c applied globally : - - - 34 16.9 - - -
0.39/0.41 c applied locally : - - - 0 0.0 - - -
0.39/0.41 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.39/0.41 c cut pool : 0.00 5 - - 22 - (maximal pool size: 80)
0.39/0.41 c redcost : 0.00 131 0 0 0 0
0.39/0.41 c impliedbounds : 0.00 6 0 0 16 0
0.39/0.41 c intobj : 0.00 0 0 0 0 0
0.39/0.41 c cgmip : 0.00 0 0 0 0 0
0.39/0.41 c gomory : 0.02 6 0 0 0 0
0.39/0.41 c strongcg : 0.01 6 0 0 74 0
0.39/0.41 c cmir : 0.02 6 0 0 25 0
0.39/0.41 c flowcover : 0.00 6 0 0 46 0
0.39/0.41 c clique : 0.00 1 0 0 0 0
0.39/0.41 c zerohalf : 0.00 0 0 0 0 0
0.39/0.41 c mcf : 0.00 1 0 0 0 0
0.39/0.41 c rapidlearning : 0.03 1 0 0 0 0
0.39/0.41 c Pricers : Time Calls Vars
0.39/0.41 c problem variables: 0.00 0 0
0.39/0.41 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.39/0.41 c relpscost : 0.12 70 0 25 0 0 108
0.39/0.41 c pscost : 0.00 0 0 0 0 0 0
0.39/0.41 c inference : 0.00 0 0 0 0 0 0
0.39/0.41 c mostinf : 0.00 0 0 0 0 0 0
0.39/0.41 c leastinf : 0.00 0 0 0 0 0 0
0.39/0.41 c fullstrong : 0.00 0 0 0 0 0 0
0.39/0.41 c allfullstrong : 0.00 0 0 0 0 0 0
0.39/0.41 c random : 0.00 0 0 0 0 0 0
0.39/0.41 c Primal Heuristics : Time Calls Found
0.39/0.41 c LP solutions : 0.00 - 1
0.39/0.41 c pseudo solutions : 0.00 - 0
0.39/0.41 c oneopt : 0.00 0 0
0.39/0.41 c crossover : 0.00 0 0
0.39/0.41 c fracdiving : 0.00 0 0
0.39/0.41 c veclendiving : 0.00 0 0
0.39/0.41 c objpscostdiving : 0.00 0 0
0.39/0.41 c rootsoldiving : 0.00 0 0
0.39/0.41 c linesearchdiving : 0.00 0 0
0.39/0.41 c guideddiving : 0.00 0 0
0.39/0.41 c intshifting : 0.00 0 0
0.39/0.41 c coefdiving : 0.00 1 0
0.39/0.41 c pscostdiving : 0.00 1 0
0.39/0.41 c trivial : 0.00 2 0
0.39/0.41 c simplerounding : 0.00 0 0
0.39/0.41 c zirounding : 0.01 53 0
0.39/0.41 c rounding : 0.00 119 0
0.39/0.41 c shifting : 0.01 15 0
0.39/0.41 c twoopt : 0.00 0 0
0.39/0.41 c fixandinfer : 0.00 0 0
0.39/0.41 c feaspump : 0.01 1 0
0.39/0.41 c intdiving : 0.00 0 0
0.39/0.41 c actconsdiving : 0.00 0 0
0.39/0.41 c octane : 0.00 0 0
0.39/0.41 c rens : 0.01 1 0
0.39/0.41 c rins : 0.00 0 0
0.39/0.41 c localbranching : 0.00 0 0
0.39/0.41 c mutation : 0.00 0 0
0.39/0.41 c dins : 0.00 0 0
0.39/0.41 c undercover : 0.00 1 0
0.39/0.41 c nlp : 0.00 0 0
0.39/0.41 c trysol : 0.00 0 0
0.39/0.41 c LP : Time Calls Iterations Iter/call Iter/sec
0.39/0.41 c primal LP : 0.00 0 0 0.00 -
0.39/0.41 c dual LP : 0.05 137 686 5.01 13720.00
0.39/0.41 c lex dual LP : 0.00 0 0 0.00 -
0.39/0.41 c barrier LP : 0.00 0 0 0.00 -
0.39/0.41 c diving/probing LP: 0.01 22 143 6.50 14300.00
0.39/0.41 c strong branching : 0.12 281 2333 8.30 19441.67
0.39/0.41 c (at root node) : - 9 345 38.33 -
0.39/0.41 c conflict analysis: 0.00 0 0 0.00 -
0.39/0.41 c B&B Tree :
0.39/0.41 c number of runs : 1
0.39/0.41 c nodes : 62
0.39/0.41 c nodes (total) : 62
0.39/0.41 c nodes left : 0
0.39/0.41 c max depth : 18
0.39/0.41 c max depth (total): 18
0.39/0.41 c backtracks : 5 (8.1%)
0.39/0.41 c delayed cutoffs : 2
0.39/0.41 c repropagations : 6 (27 domain reductions, 2 cutoffs)
0.39/0.41 c avg switch length: 2.03
0.39/0.41 c switching time : 0.00
0.39/0.41 c Solution :
0.39/0.41 c Solutions found : 1 (1 improvements)
0.39/0.41 c First Solution : +3.00000000000000e+00 (in run 1, after 62 nodes, 0.32 seconds, depth 17, found by <relaxation>)
0.39/0.41 c Primal Bound : +3.00000000000000e+00 (in run 1, after 62 nodes, 0.32 seconds, depth 17, found by <relaxation>)
0.39/0.41 c Dual Bound : +3.00000000000000e+00
0.39/0.41 c Gap : 0.00 %
0.39/0.41 c Root Dual Bound : +3.00000000000000e+00
0.39/0.41 c Root Iterations : 264
0.39/0.41 c Time complete: 0.41.