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-2666459-1276647905.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) 17 del vars, 8 del conss, 0 chg bounds, 0 chg sides, 23 chg coeffs, 0 upgd conss, 863 impls, 0 clqs
0.00/0.03 c (round 3) 28 del vars, 17 del conss, 0 chg bounds, 0 chg sides, 32 chg coeffs, 5 upgd conss, 1023 impls, 0 clqs
0.00/0.03 c (round 4) 38 del vars, 25 del conss, 0 chg bounds, 0 chg sides, 40 chg coeffs, 5 upgd conss, 1103 impls, 0 clqs
0.00/0.04 c (round 5) 48 del vars, 33 del conss, 0 chg bounds, 0 chg sides, 48 chg coeffs, 5 upgd conss, 1103 impls, 0 clqs
0.00/0.05 c presolving (6 rounds):
0.00/0.05 c 48 deleted vars, 33 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 48 changed coefficients
0.00/0.05 c 1127 implications, 0 cliques
0.00/0.05 c presolved problem has 112 variables (112 bin, 0 int, 0 impl, 0 cont) and 72 constraints
0.00/0.05 c 62 constraints of type <and>
0.00/0.05 c 4 constraints of type <linear>
0.00/0.05 c 6 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.02
0.00/0.05 c - non default parameters ----------------------------------------------------------------------
0.00/0.05 c # SCIP version 1.2.1.2
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 = 1800
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 # 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 # 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 | - | 628k| 0 | 6 | 112 | 72 | 112 | 133 | 0 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.12 c 0.1s| 1 | 0 | 168 | - | 648k| 0 | 21 | 112 | 72 | 112 | 142 | 9 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.14 c 0.1s| 1 | 0 | 184 | - | 696k| 0 | 26 | 112 | 72 | 112 | 155 | 22 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.16 c 0.1s| 1 | 0 | 198 | - | 752k| 0 | 35 | 112 | 72 | 112 | 165 | 32 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.18 c 0.1s| 1 | 0 | 214 | - | 799k| 0 | 38 | 112 | 72 | 112 | 176 | 43 | 0 | 0 | 3.000000e+00 | -- | Inf
0.19/0.21 c 0.2s| 1 | 0 | 242 | - | 842k| 0 | 47 | 112 | 72 | 112 | 185 | 52 | 0 | 0 | 3.000000e+00 | -- | Inf
0.19/0.24 c 0.2s| 1 | 0 | 267 | - | 902k| 0 | 50 | 112 | 72 | 112 | 200 | 67 | 0 | 0 | 3.000000e+00 | -- | Inf
0.29/0.35 c 0.3s| 1 | 2 | 267 | - | 903k| 0 | 50 | 112 | 72 | 112 | 200 | 67 | 0 | 10 | 3.000000e+00 | -- | Inf
0.69/0.77 o 7
0.69/0.77 c * 0.7s| 62 | 28 | 864 | 9.8 | 939k| 23 | - | 112 | 104 | 112 | 97 | 227 | 32 | 362 | 3.000000e+00 | 7.000000e+00 | 133.33%
0.69/0.78 o 3
0.69/0.78 c * 0.7s| 69 | 0 | 898 | 9.3 | 927k| 23 | - | 112 | 100 | 112 | 96 | 237 | 36 | 370 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.69/0.78 c
0.69/0.78 c SCIP Status : problem is solved [optimal solution found]
0.69/0.78 c Solving Time (sec) : 0.68
0.69/0.78 c Solving Nodes : 69
0.69/0.78 c Primal Bound : +3.00000000000000e+00 (2 solutions)
0.69/0.78 c Dual Bound : +3.00000000000000e+00
0.69/0.78 c Gap : 0.00 %
0.69/0.78 s OPTIMUM FOUND
0.69/0.78 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.69/0.78 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.69/0.78 v x1
0.69/0.78 c SCIP Status : problem is solved [optimal solution found]
0.69/0.78 c Solving Time : 0.68
0.69/0.78 c Original Problem :
0.69/0.78 c Problem name : HOME/instance-2666459-1276647905.opb
0.69/0.78 c Variables : 160 (160 binary, 0 integer, 0 implicit integer, 0 continuous)
0.69/0.78 c Constraints : 109 initial, 109 maximal
0.69/0.78 c Presolved Problem :
0.69/0.78 c Problem name : t_HOME/instance-2666459-1276647905.opb
0.69/0.78 c Variables : 112 (112 binary, 0 integer, 0 implicit integer, 0 continuous)
0.69/0.78 c Constraints : 72 initial, 104 maximal
0.69/0.78 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.69/0.78 c trivial : 0.00 0 0 0 0 0 0 0 0
0.69/0.78 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.69/0.78 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.69/0.78 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.69/0.78 c implics : 0.00 0 0 0 0 0 0 0 0
0.69/0.78 c probing : 0.01 0 0 0 0 0 0 0 0
0.69/0.78 c and : 0.00 8 33 0 0 0 33 0 33
0.69/0.78 c linear : 0.01 2 5 0 0 0 0 0 15
0.69/0.78 c logicor : 0.00 0 0 0 0 0 0 0 0
0.69/0.78 c root node : - 12 - - 12 - - - -
0.69/0.78 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.69/0.78 c integral : 0 0 0 66 0 0 7 0 0 114
0.69/0.78 c and : 62 134 457 0 0 7 220 191 0 0
0.69/0.78 c linear : 4 6 448 0 0 9 119 0 0 0
0.69/0.78 c logicor : 6+ 6 108 1 0 0 12 0 0 0
0.69/0.78 c countsols : 0 0 0 2 0 0 0 0 0 0
0.69/0.78 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.69/0.78 c integral : 0.42 0.00 0.00 0.42 0.00
0.69/0.78 c and : 0.00 0.00 0.00 0.00 0.00
0.69/0.78 c linear : 0.00 0.00 0.00 0.00 0.00
0.69/0.78 c logicor : 0.00 0.00 0.00 0.00 0.00
0.69/0.78 c countsols : 0.00 0.00 0.00 0.00 0.00
0.69/0.78 c Propagators : Time Calls Cutoffs DomReds
0.69/0.78 c vbounds : 0.00 2 0 0
0.69/0.78 c rootredcost : 0.00 1 0 2
0.69/0.78 c pseudoobj : 0.00 225 0 2
0.69/0.78 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.69/0.78 c propagation : 0.00 16 16 112 20.2 4 19.8 -
0.69/0.78 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.69/0.78 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.69/0.78 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.69/0.78 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.69/0.78 c applied globally : - - - 36 15.6 - - -
0.69/0.78 c applied locally : - - - 0 0.0 - - -
0.69/0.78 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.69/0.78 c cut pool : 0.00 5 - - 42 - (maximal pool size: 186)
0.69/0.78 c redcost : 0.00 136 0 0 0 0
0.69/0.78 c impliedbounds : 0.00 6 0 0 36 0
0.69/0.78 c intobj : 0.00 0 0 0 0 0
0.69/0.78 c cgmip : 0.00 0 0 0 0 0
0.69/0.78 c gomory : 0.03 6 0 0 30 0
0.69/0.78 c strongcg : 0.03 6 0 0 251 0
0.69/0.78 c cmir : 0.01 6 0 0 43 0
0.69/0.78 c flowcover : 0.03 6 0 0 78 0
0.69/0.78 c clique : 0.00 6 0 0 0 0
0.69/0.78 c zerohalf : 0.00 0 0 0 0 0
0.69/0.78 c mcf : 0.00 1 0 0 0 0
0.69/0.78 c rapidlearning : 0.04 1 0 0 0 0
0.69/0.78 c Pricers : Time Calls Vars
0.69/0.78 c problem variables: 0.00 0 0
0.69/0.78 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.69/0.78 c relpscost : 0.42 64 0 7 0 0 114
0.69/0.78 c pscost : 0.00 0 0 0 0 0 0
0.69/0.78 c inference : 0.00 0 0 0 0 0 0
0.69/0.78 c mostinf : 0.00 0 0 0 0 0 0
0.69/0.78 c leastinf : 0.00 0 0 0 0 0 0
0.69/0.78 c fullstrong : 0.00 0 0 0 0 0 0
0.69/0.78 c allfullstrong : 0.00 0 0 0 0 0 0
0.69/0.78 c random : 0.00 0 0 0 0 0 0
0.69/0.78 c Primal Heuristics : Time Calls Found
0.69/0.78 c LP solutions : 0.00 - 2
0.69/0.78 c pseudo solutions : 0.00 - 0
0.69/0.78 c crossover : 0.00 0 0
0.69/0.78 c pscostdiving : 0.00 0 0
0.69/0.78 c fracdiving : 0.00 0 0
0.69/0.78 c veclendiving : 0.00 0 0
0.69/0.78 c objpscostdiving : 0.00 0 0
0.69/0.78 c rootsoldiving : 0.00 0 0
0.69/0.78 c linesearchdiving : 0.00 0 0
0.69/0.78 c guideddiving : 0.00 0 0
0.69/0.78 c oneopt : 0.00 1 0
0.69/0.78 c coefdiving : 0.00 1 0
0.69/0.78 c feaspump : 0.00 1 0
0.69/0.78 c trivial : 0.00 2 0
0.69/0.78 c simplerounding : 0.00 0 0
0.69/0.78 c zirounding : 0.00 57 0
0.69/0.78 c rounding : 0.01 118 0
0.69/0.78 c shifting : 0.01 19 0
0.69/0.78 c intshifting : 0.00 0 0
0.69/0.78 c twoopt : 0.00 0 0
0.69/0.78 c fixandinfer : 0.00 0 0
0.69/0.78 c intdiving : 0.00 0 0
0.69/0.78 c actconsdiving : 0.00 0 0
0.69/0.78 c octane : 0.00 0 0
0.69/0.78 c rens : 0.01 1 0
0.69/0.78 c rins : 0.00 0 0
0.69/0.78 c localbranching : 0.00 0 0
0.69/0.78 c mutation : 0.00 0 0
0.69/0.78 c dins : 0.00 0 0
0.69/0.78 c undercover : 0.01 1 0
0.69/0.78 c nlp : 0.00 0 0
0.69/0.78 c trysol : 0.00 0 0
0.69/0.78 c LP : Time Calls Iterations Iter/call Iter/sec
0.69/0.78 c primal LP : 0.00 0 0 0.00 -
0.69/0.78 c dual LP : 0.04 143 743 5.20 18575.00
0.69/0.78 c lex dual LP : 0.00 0 0 0.00 -
0.69/0.78 c barrier LP : 0.00 0 0 0.00 -
0.69/0.78 c diving/probing LP: 0.00 19 155 8.16 -
0.69/0.78 c strong branching : 0.42 370 6162 16.65 14671.43
0.69/0.78 c (at root node) : - 10 879 87.90 -
0.69/0.78 c conflict analysis: 0.00 0 0 0.00 -
0.69/0.78 c B&B Tree :
0.69/0.78 c number of runs : 1
0.69/0.78 c nodes : 69
0.69/0.78 c nodes (total) : 69
0.69/0.78 c nodes left : 0
0.69/0.78 c max depth : 23
0.69/0.78 c max depth (total): 23
0.69/0.78 c backtracks : 8 (11.6%)
0.69/0.78 c delayed cutoffs : 4
0.69/0.78 c repropagations : 38 (77 domain reductions, 4 cutoffs)
0.69/0.78 c avg switch length: 3.16
0.69/0.78 c switching time : 0.00
0.69/0.78 c Solution :
0.69/0.78 c Solutions found : 2 (2 improvements)
0.69/0.78 c First Solution : +7.00000000000000e+00 (in run 1, after 62 nodes, 0.68 seconds, depth 22, found by <relaxation>)
0.69/0.78 c Primal Bound : +3.00000000000000e+00 (in run 1, after 69 nodes, 0.68 seconds, depth 21, found by <relaxation>)
0.69/0.78 c Dual Bound : +3.00000000000000e+00
0.69/0.78 c Gap : 0.00 %
0.69/0.78 c Root Dual Bound : +3.00000000000000e+00
0.69/0.78 c Root Iterations : 267
0.69/0.78 c Time complete: 0.78.