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-2666456-1276647856.opb>
0.00/0.01 c original problem has 120 variables (120 bin, 0 int, 0 impl, 0 cont) and 82 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) 4 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 12 chg coeffs, 0 upgd conss, 400 impls, 0 clqs
0.00/0.02 c (round 2) 17 del vars, 8 del conss, 0 chg bounds, 0 chg sides, 20 chg coeffs, 0 upgd conss, 618 impls, 0 clqs
0.00/0.03 c (round 3) 27 del vars, 16 del conss, 0 chg bounds, 0 chg sides, 28 chg coeffs, 4 upgd conss, 698 impls, 0 clqs
0.00/0.03 c (round 4) 37 del vars, 24 del conss, 0 chg bounds, 0 chg sides, 36 chg coeffs, 4 upgd conss, 698 impls, 0 clqs
0.00/0.04 c presolving (5 rounds):
0.00/0.04 c 37 deleted vars, 24 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 36 changed coefficients
0.00/0.04 c 716 implications, 0 cliques
0.00/0.04 c presolved problem has 83 variables (83 bin, 0 int, 0 impl, 0 cont) and 55 constraints
0.00/0.04 c 46 constraints of type <and>
0.00/0.04 c 3 constraints of type <linear>
0.00/0.04 c 6 constraints of type <logicor>
0.00/0.04 c transformed objective value is always integral (scale: 2)
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 # 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 = 1800
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 # 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 # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.04 c heuristics/undercover/freq = 0
0.00/0.04 c
0.00/0.04 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.04 c separating/rapidlearning/freq = 0
0.00/0.04 c
0.00/0.04 c -----------------------------------------------------------------------------------------------
0.00/0.04 c start solving
0.00/0.04 c
0.00/0.04 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.04 c 0.0s| 1 | 0 | 9 | - | 494k| 0 | 4 | 83 | 55 | 83 | 99 | 0 | 0 | 0 | 3.000000e+00 | -- | Inf
0.05/0.09 c 0.1s| 1 | 0 | 120 | - | 510k| 0 | 10 | 83 | 55 | 83 | 107 | 8 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.10 c 0.1s| 1 | 0 | 138 | - | 544k| 0 | 24 | 83 | 55 | 83 | 114 | 15 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.11 c 0.1s| 1 | 0 | 151 | - | 597k| 0 | 26 | 83 | 55 | 83 | 124 | 25 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.13 c 0.1s| 1 | 0 | 166 | - | 658k| 0 | 20 | 83 | 55 | 83 | 131 | 32 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.15 c 0.1s| 1 | 0 | 195 | - | 684k| 0 | 28 | 83 | 55 | 83 | 139 | 40 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.16 c 0.1s| 1 | 0 | 209 | - | 700k| 0 | 34 | 83 | 55 | 83 | 146 | 47 | 0 | 0 | 3.000000e+00 | -- | Inf
0.19/0.24 c 0.2s| 1 | 2 | 209 | - | 700k| 0 | 34 | 83 | 55 | 83 | 146 | 47 | 0 | 9 | 3.000000e+00 | -- | Inf
0.49/0.57 o 5
0.49/0.57 c * 0.5s| 100 | 23 | 995 | 7.9 | 759k| 20 | - | 83 | 108 | 83 | 78 | 221 | 53 | 434 | 3.000000e+00 | 5.000000e+00 | 66.67%
0.49/0.59 o 3
0.49/0.59 c * 0.5s| 110 | 0 | 1082 | 8.0 | 731k| 20 | - | 83 | 79 | 83 | 66 | 237 | 57 | 450 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.49/0.59 c
0.49/0.59 c SCIP Status : problem is solved [optimal solution found]
0.49/0.59 c Solving Time (sec) : 0.51
0.49/0.59 c Solving Nodes : 110
0.49/0.59 c Primal Bound : +3.00000000000000e+00 (2 solutions)
0.49/0.59 c Dual Bound : +3.00000000000000e+00
0.49/0.59 c Gap : 0.00 %
0.49/0.59 s OPTIMUM FOUND
0.49/0.59 v -x45 -x44 -x43 -x42 x41 -x40 -x39 -x38 x37 x36 x30 -x29 x28 -x27 x26 -x35 -x34 -x33 -x32 -x31 -x25 x24 -x23 -x22 x21 -x20 -x19
0.49/0.59 v -x18 x17 x16 -x15 x14 x13 -x12 x11 -x10 -x9 -x8 x7 x6 -x5 -x4 -x3 x2 x1
0.49/0.59 c SCIP Status : problem is solved [optimal solution found]
0.49/0.59 c Solving Time : 0.51
0.49/0.59 c Original Problem :
0.49/0.59 c Problem name : HOME/instance-2666456-1276647856.opb
0.49/0.59 c Variables : 120 (120 binary, 0 integer, 0 implicit integer, 0 continuous)
0.49/0.59 c Constraints : 82 initial, 82 maximal
0.49/0.59 c Presolved Problem :
0.49/0.59 c Problem name : t_HOME/instance-2666456-1276647856.opb
0.49/0.59 c Variables : 83 (83 binary, 0 integer, 0 implicit integer, 0 continuous)
0.49/0.59 c Constraints : 55 initial, 108 maximal
0.49/0.59 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.49/0.59 c trivial : 0.00 0 0 0 0 0 0 0 0
0.49/0.59 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.49/0.59 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.49/0.59 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.49/0.59 c implics : 0.00 0 0 0 0 0 0 0 0
0.49/0.59 c probing : 0.01 0 0 0 0 0 0 0 0
0.49/0.59 c and : 0.01 6 24 0 0 0 24 0 24
0.49/0.59 c linear : 0.00 3 4 0 0 0 0 0 12
0.49/0.59 c logicor : 0.00 0 0 0 0 0 0 0 0
0.49/0.59 c root node : - 19 - - 19 - - - -
0.49/0.59 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.49/0.59 c integral : 0 0 0 103 0 0 18 0 0 176
0.49/0.59 c and : 46 179 520 2 0 14 334 202 0 0
0.49/0.59 c linear : 3 6 506 2 0 20 197 0 0 0
0.49/0.59 c logicor : 6+ 6 153 2 0 0 22 0 0 0
0.49/0.59 c countsols : 0 0 0 2 0 0 0 0 0 0
0.49/0.59 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.49/0.59 c integral : 0.30 0.00 0.00 0.30 0.00
0.49/0.59 c and : 0.00 0.00 0.00 0.00 0.00
0.49/0.59 c linear : 0.02 0.00 0.02 0.00 0.00
0.49/0.59 c logicor : 0.00 0.00 0.00 0.00 0.00
0.49/0.59 c countsols : 0.00 0.00 0.00 0.00 0.00
0.49/0.59 c Propagators : Time Calls Cutoffs DomReds
0.49/0.59 c vbounds : 0.00 2 0 0
0.49/0.59 c rootredcost : 0.00 1 0 3
0.49/0.59 c pseudoobj : 0.00 346 0 1
0.49/0.59 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.49/0.59 c propagation : 0.00 34 34 167 17.1 1 14.0 -
0.49/0.59 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.49/0.59 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.49/0.59 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.49/0.59 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.49/0.59 c applied globally : - - - 57 13.1 - - -
0.49/0.59 c applied locally : - - - 0 0.0 - - -
0.49/0.59 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.49/0.59 c cut pool : 0.00 5 - - 32 - (maximal pool size: 160)
0.49/0.59 c redcost : 0.00 179 0 0 0 0
0.49/0.59 c impliedbounds : 0.00 6 0 0 24 0
0.49/0.59 c intobj : 0.00 0 0 0 0 0
0.49/0.59 c cgmip : 0.00 0 0 0 0 0
0.49/0.59 c gomory : 0.02 6 0 0 24 0
0.49/0.59 c strongcg : 0.02 6 0 0 200 0
0.49/0.59 c cmir : 0.00 6 0 0 37 0
0.49/0.59 c flowcover : 0.01 6 0 0 77 0
0.49/0.59 c clique : 0.00 1 0 0 0 0
0.49/0.59 c zerohalf : 0.00 0 0 0 0 0
0.49/0.59 c mcf : 0.01 1 0 0 0 0
0.49/0.59 c rapidlearning : 0.02 1 0 0 0 0
0.49/0.59 c Pricers : Time Calls Vars
0.49/0.59 c problem variables: 0.00 0 0
0.49/0.59 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.49/0.59 c relpscost : 0.30 101 0 18 0 0 176
0.49/0.59 c pscost : 0.00 0 0 0 0 0 0
0.49/0.59 c inference : 0.00 0 0 0 0 0 0
0.49/0.59 c mostinf : 0.00 0 0 0 0 0 0
0.49/0.59 c leastinf : 0.00 0 0 0 0 0 0
0.49/0.59 c fullstrong : 0.00 0 0 0 0 0 0
0.49/0.59 c allfullstrong : 0.00 0 0 0 0 0 0
0.49/0.59 c random : 0.00 0 0 0 0 0 0
0.49/0.59 c Primal Heuristics : Time Calls Found
0.49/0.59 c LP solutions : 0.00 - 2
0.49/0.59 c pseudo solutions : 0.00 - 0
0.49/0.59 c crossover : 0.00 0 0
0.49/0.59 c pscostdiving : 0.00 0 0
0.49/0.59 c fracdiving : 0.00 0 0
0.49/0.59 c veclendiving : 0.00 0 0
0.49/0.59 c objpscostdiving : 0.00 0 0
0.49/0.59 c rootsoldiving : 0.00 0 0
0.49/0.59 c linesearchdiving : 0.00 0 0
0.49/0.59 c guideddiving : 0.00 0 0
0.49/0.59 c intshifting : 0.00 0 0
0.49/0.59 c oneopt : 0.00 1 0
0.49/0.59 c coefdiving : 0.00 1 0
0.49/0.59 c feaspump : 0.00 1 0
0.49/0.59 c trivial : 0.00 2 0
0.49/0.59 c simplerounding : 0.00 0 0
0.49/0.59 c zirounding : 0.00 88 0
0.49/0.59 c rounding : 0.00 137 0
0.49/0.59 c shifting : 0.01 23 0
0.49/0.59 c twoopt : 0.00 0 0
0.49/0.59 c fixandinfer : 0.00 0 0
0.49/0.59 c intdiving : 0.00 0 0
0.49/0.59 c actconsdiving : 0.00 0 0
0.49/0.59 c octane : 0.00 0 0
0.49/0.59 c rens : 0.01 1 0
0.49/0.59 c rins : 0.00 0 0
0.49/0.59 c localbranching : 0.00 0 0
0.49/0.59 c mutation : 0.00 0 0
0.49/0.59 c dins : 0.00 0 0
0.49/0.59 c undercover : 0.01 1 0
0.49/0.59 c nlp : 0.00 0 0
0.49/0.59 c trysol : 0.00 0 0
0.49/0.59 c LP : Time Calls Iterations Iter/call Iter/sec
0.49/0.59 c primal LP : 0.00 0 0 0.00 -
0.49/0.59 c dual LP : 0.04 187 973 5.20 24325.00
0.49/0.59 c lex dual LP : 0.00 0 0 0.00 -
0.49/0.59 c barrier LP : 0.00 0 0 0.00 -
0.49/0.59 c diving/probing LP: 0.00 16 109 6.81 -
0.49/0.59 c strong branching : 0.30 450 5626 12.50 18753.33
0.49/0.59 c (at root node) : - 9 658 73.11 -
0.49/0.59 c conflict analysis: 0.00 0 0 0.00 -
0.49/0.59 c B&B Tree :
0.49/0.59 c number of runs : 1
0.49/0.59 c nodes : 110
0.49/0.59 c nodes (total) : 110
0.49/0.59 c nodes left : 0
0.49/0.59 c max depth : 20
0.49/0.59 c max depth (total): 20
0.49/0.59 c backtracks : 17 (15.5%)
0.49/0.59 c delayed cutoffs : 12
0.49/0.59 c repropagations : 46 (154 domain reductions, 12 cutoffs)
0.49/0.59 c avg switch length: 2.89
0.49/0.59 c switching time : 0.00
0.49/0.59 c Solution :
0.49/0.59 c Solutions found : 2 (2 improvements)
0.49/0.59 c First Solution : +5.00000000000000e+00 (in run 1, after 100 nodes, 0.50 seconds, depth 16, found by <relaxation>)
0.49/0.60 c Primal Bound : +3.00000000000000e+00 (in run 1, after 110 nodes, 0.51 seconds, depth 10, found by <relaxation>)
0.49/0.60 c Dual Bound : +3.00000000000000e+00
0.49/0.60 c Gap : 0.00 %
0.49/0.60 c Root Dual Bound : +3.00000000000000e+00
0.49/0.60 c Root Iterations : 209
0.59/0.60 c Time complete: 0.59.