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-2666525-1276649520.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, 376 impls, 0 clqs
0.00/0.02 c (round 2) 17 del vars, 9 del conss, 0 chg bounds, 0 chg sides, 21 chg coeffs, 0 upgd conss, 587 impls, 0 clqs
0.00/0.02 c (round 3) 27 del vars, 17 del conss, 0 chg bounds, 0 chg sides, 29 chg coeffs, 4 upgd conss, 667 impls, 0 clqs
0.00/0.03 c (round 4) 37 del vars, 25 del conss, 0 chg bounds, 0 chg sides, 37 chg coeffs, 4 upgd conss, 667 impls, 0 clqs
0.00/0.04 c presolving (5 rounds):
0.00/0.04 c 37 deleted vars, 25 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 37 changed coefficients
0.00/0.04 c 685 implications, 0 cliques
0.00/0.04 c presolved problem has 83 variables (83 bin, 0 int, 0 impl, 0 cont) and 54 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 5 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 | 6 | - | 493k| 0 | 2 | 83 | 54 | 83 | 99 | 0 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.10 c 0.1s| 1 | 0 | 114 | - | 502k| 0 | 11 | 83 | 54 | 83 | 104 | 5 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.11 c 0.1s| 1 | 0 | 120 | - | 519k| 0 | 13 | 83 | 54 | 83 | 110 | 11 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.12 c 0.1s| 1 | 0 | 131 | - | 534k| 0 | 12 | 83 | 54 | 83 | 114 | 15 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.13 c 0.1s| 1 | 0 | 161 | - | 556k| 0 | 17 | 83 | 54 | 83 | 120 | 21 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.14 c 0.1s| 1 | 0 | 186 | - | 578k| 0 | 25 | 83 | 54 | 83 | 132 | 33 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.15 c 0.1s| 1 | 0 | 214 | - | 592k| 0 | 21 | 83 | 54 | 83 | 140 | 41 | 0 | 0 | 3.000000e+00 | -- | Inf
0.19/0.21 c 0.2s| 1 | 2 | 214 | - | 593k| 0 | 21 | 83 | 54 | 83 | 140 | 41 | 0 | 9 | 3.000000e+00 | -- | Inf
0.29/0.31 o 5
0.29/0.31 c * 0.2s| 33 | 11 | 490 | 8.6 | 622k| 15 | - | 83 | 74 | 83 | 68 | 116 | 20 | 150 | 3.000000e+00 | 5.000000e+00 | 66.67%
0.29/0.32 o 3
0.29/0.32 c * 0.3s| 39 | 0 | 536 | 8.5 | 609k| 15 | - | 83 | 62 | 83 | 59 | 127 | 27 | 166 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.29/0.32 c
0.29/0.32 c SCIP Status : problem is solved [optimal solution found]
0.29/0.32 c Solving Time (sec) : 0.26
0.29/0.32 c Solving Nodes : 39
0.29/0.32 c Primal Bound : +3.00000000000000e+00 (2 solutions)
0.29/0.32 c Dual Bound : +3.00000000000000e+00
0.29/0.32 c Gap : 0.00 %
0.29/0.32 s OPTIMUM FOUND
0.29/0.32 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 -x18
0.29/0.32 v x17 x16 -x15 x14 -x13 x12 x11 -x10 x9 x8 x7 x6 -x5 -x4 -x3 x2 x1
0.29/0.32 c SCIP Status : problem is solved [optimal solution found]
0.29/0.32 c Solving Time : 0.26
0.29/0.32 c Original Problem :
0.29/0.32 c Problem name : HOME/instance-2666525-1276649520.opb
0.29/0.32 c Variables : 120 (120 binary, 0 integer, 0 implicit integer, 0 continuous)
0.29/0.32 c Constraints : 82 initial, 82 maximal
0.29/0.32 c Presolved Problem :
0.29/0.32 c Problem name : t_HOME/instance-2666525-1276649520.opb
0.29/0.32 c Variables : 83 (83 binary, 0 integer, 0 implicit integer, 0 continuous)
0.29/0.32 c Constraints : 54 initial, 74 maximal
0.29/0.32 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.29/0.32 c trivial : 0.00 0 0 0 0 0 0 0 0
0.29/0.32 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.29/0.32 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.29/0.32 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.29/0.32 c implics : 0.00 0 0 0 0 0 0 0 0
0.29/0.32 c probing : 0.01 0 0 0 0 0 0 0 0
0.29/0.32 c and : 0.01 6 25 0 0 0 25 0 25
0.29/0.32 c linear : 0.00 2 4 0 0 0 0 0 12
0.29/0.32 c logicor : 0.00 0 0 0 0 0 0 0 0
0.29/0.32 c root node : - 19 - - 19 - - - -
0.29/0.32 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.29/0.32 c integral : 0 0 0 42 0 2 17 0 0 56
0.29/0.32 c and : 46 84 307 0 0 6 130 99 0 0
0.29/0.32 c linear : 3 6 300 0 0 4 97 0 0 0
0.29/0.32 c logicor : 5+ 6 94 2 0 0 11 0 0 0
0.29/0.32 c countsols : 0 0 0 2 0 0 0 0 0 0
0.29/0.32 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.29/0.32 c integral : 0.13 0.00 0.00 0.13 0.00
0.29/0.32 c and : 0.01 0.00 0.01 0.00 0.00
0.29/0.32 c linear : 0.00 0.00 0.00 0.00 0.00
0.29/0.32 c logicor : 0.00 0.00 0.00 0.00 0.00
0.29/0.32 c countsols : 0.00 0.00 0.00 0.00 0.00
0.29/0.32 c Propagators : Time Calls Cutoffs DomReds
0.29/0.32 c vbounds : 0.00 2 0 0
0.29/0.32 c rootredcost : 0.00 1 0 3
0.29/0.32 c pseudoobj : 0.00 134 0 1
0.29/0.32 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.29/0.32 c propagation : 0.00 10 10 61 21.5 10 12.0 -
0.29/0.32 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.29/0.32 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.29/0.32 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.29/0.32 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.29/0.32 c applied globally : - - - 27 12.9 - - -
0.29/0.32 c applied locally : - - - 0 0.0 - - -
0.29/0.32 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.29/0.32 c cut pool : 0.00 5 - - 22 - (maximal pool size: 77)
0.29/0.32 c redcost : 0.00 86 0 0 0 0
0.29/0.32 c impliedbounds : 0.00 6 0 0 17 0
0.29/0.32 c intobj : 0.00 0 0 0 0 0
0.29/0.32 c cgmip : 0.00 0 0 0 0 0
0.29/0.32 c gomory : 0.01 6 0 0 0 0
0.29/0.32 c strongcg : 0.00 6 0 0 70 0
0.29/0.32 c cmir : 0.01 6 0 0 27 0
0.29/0.32 c flowcover : 0.01 6 0 0 45 0
0.29/0.32 c clique : 0.00 6 0 0 0 0
0.29/0.32 c zerohalf : 0.00 0 0 0 0 0
0.29/0.32 c mcf : 0.00 1 0 0 0 0
0.29/0.32 c rapidlearning : 0.03 1 0 0 0 0
0.29/0.32 c Pricers : Time Calls Vars
0.29/0.32 c problem variables: 0.00 0 0
0.29/0.32 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.29/0.32 c relpscost : 0.13 40 2 17 0 0 56
0.29/0.32 c pscost : 0.00 0 0 0 0 0 0
0.29/0.32 c inference : 0.00 0 0 0 0 0 0
0.29/0.32 c mostinf : 0.00 0 0 0 0 0 0
0.29/0.32 c leastinf : 0.00 0 0 0 0 0 0
0.29/0.32 c fullstrong : 0.00 0 0 0 0 0 0
0.29/0.32 c allfullstrong : 0.00 0 0 0 0 0 0
0.29/0.32 c random : 0.00 0 0 0 0 0 0
0.29/0.32 c Primal Heuristics : Time Calls Found
0.29/0.32 c LP solutions : 0.00 - 2
0.29/0.32 c pseudo solutions : 0.00 - 0
0.29/0.32 c crossover : 0.00 0 0
0.29/0.32 c pscostdiving : 0.00 0 0
0.29/0.32 c fracdiving : 0.00 0 0
0.29/0.32 c veclendiving : 0.00 0 0
0.29/0.32 c objpscostdiving : 0.00 0 0
0.29/0.32 c rootsoldiving : 0.00 0 0
0.29/0.32 c linesearchdiving : 0.00 0 0
0.29/0.32 c guideddiving : 0.00 0 0
0.29/0.32 c intshifting : 0.00 0 0
0.29/0.32 c oneopt : 0.00 1 0
0.29/0.32 c coefdiving : 0.00 1 0
0.29/0.32 c trivial : 0.00 2 0
0.29/0.32 c simplerounding : 0.00 0 0
0.29/0.32 c zirounding : 0.00 30 0
0.29/0.32 c rounding : 0.00 89 0
0.29/0.32 c shifting : 0.01 14 0
0.29/0.32 c twoopt : 0.00 0 0
0.29/0.32 c fixandinfer : 0.00 0 0
0.29/0.32 c feaspump : 0.01 1 0
0.29/0.32 c intdiving : 0.00 0 0
0.29/0.32 c actconsdiving : 0.00 0 0
0.29/0.32 c octane : 0.00 0 0
0.29/0.32 c rens : 0.01 1 0
0.29/0.32 c rins : 0.00 0 0
0.29/0.32 c localbranching : 0.00 0 0
0.29/0.32 c mutation : 0.00 0 0
0.29/0.32 c dins : 0.00 0 0
0.29/0.32 c undercover : 0.00 1 0
0.29/0.32 c nlp : 0.00 0 0
0.29/0.32 c trysol : 0.00 0 0
0.29/0.32 c LP : Time Calls Iterations Iter/call Iter/sec
0.29/0.32 c primal LP : 0.00 0 0 0.00 -
0.29/0.32 c dual LP : 0.02 89 433 4.87 21650.00
0.29/0.32 c lex dual LP : 0.00 0 0 0.00 -
0.29/0.32 c barrier LP : 0.00 0 0 0.00 -
0.29/0.32 c diving/probing LP: 0.01 12 103 8.58 10300.00
0.29/0.32 c strong branching : 0.12 166 1991 11.99 16591.67
0.29/0.32 c (at root node) : - 9 585 65.00 -
0.29/0.32 c conflict analysis: 0.00 0 0 0.00 -
0.29/0.32 c B&B Tree :
0.29/0.32 c number of runs : 1
0.29/0.32 c nodes : 39
0.29/0.32 c nodes (total) : 39
0.29/0.32 c nodes left : 0
0.29/0.32 c max depth : 15
0.29/0.32 c max depth (total): 15
0.29/0.32 c backtracks : 4 (10.3%)
0.29/0.32 c delayed cutoffs : 1
0.29/0.32 c repropagations : 17 (42 domain reductions, 1 cutoffs)
0.29/0.32 c avg switch length: 2.67
0.29/0.32 c switching time : 0.00
0.29/0.32 c Solution :
0.29/0.32 c Solutions found : 2 (2 improvements)
0.29/0.32 c First Solution : +5.00000000000000e+00 (in run 1, after 33 nodes, 0.25 seconds, depth 15, found by <relaxation>)
0.29/0.32 c Primal Bound : +3.00000000000000e+00 (in run 1, after 39 nodes, 0.26 seconds, depth 10, found by <relaxation>)
0.29/0.32 c Dual Bound : +3.00000000000000e+00
0.29/0.32 c Gap : 0.00 %
0.29/0.32 c Root Dual Bound : +3.00000000000000e+00
0.29/0.32 c Root Iterations : 214
0.29/0.33 c Time complete: 0.32.