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-2666461-1276647967.opb>
0.00/0.01 c original problem has 264 variables (264 bin, 0 int, 0 impl, 0 cont) and 199 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.01 c presolving:
0.02/0.03 c (round 1) 3 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 24 chg coeffs, 0 upgd conss, 876 impls, 0 clqs
0.02/0.04 c (round 2) 19 del vars, 14 del conss, 0 chg bounds, 0 chg sides, 38 chg coeffs, 4 upgd conss, 1324 impls, 0 clqs
0.02/0.04 c (round 3) 35 del vars, 28 del conss, 0 chg bounds, 0 chg sides, 52 chg coeffs, 4 upgd conss, 1548 impls, 0 clqs
0.02/0.05 c (round 4) 51 del vars, 42 del conss, 0 chg bounds, 0 chg sides, 66 chg coeffs, 4 upgd conss, 1548 impls, 0 clqs
0.02/0.06 c (0.0s) probing: 137/213 (64.3%) - 0 fixings, 0 aggregations, 6 implications, 0 bound changes
0.02/0.06 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.02/0.06 c presolving (5 rounds):
0.02/0.06 c 51 deleted vars, 42 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 66 changed coefficients
0.02/0.06 c 1560 implications, 0 cliques
0.02/0.06 c presolved problem has 213 variables (213 bin, 0 int, 0 impl, 0 cont) and 154 constraints
0.02/0.06 c 147 constraints of type <and>
0.02/0.06 c 3 constraints of type <linear>
0.02/0.06 c 4 constraints of type <logicor>
0.02/0.06 c transformed objective value is always integral (scale: 2)
0.02/0.06 c Presolving Time: 0.03
0.02/0.06 c - non default parameters ----------------------------------------------------------------------
0.02/0.06 c # SCIP version 1.2.1.2
0.02/0.06 c
0.02/0.06 c # frequency for displaying node information lines
0.02/0.06 c # [type: int, range: [-1,2147483647], default: 100]
0.02/0.06 c display/freq = 10000
0.02/0.06 c
0.02/0.06 c # maximal time in seconds to run
0.02/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.02/0.06 c limits/time = 1800
0.02/0.06 c
0.02/0.06 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.02/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.02/0.06 c limits/memory = 1620
0.02/0.06 c
0.02/0.06 c # should presolving try to simplify inequalities
0.02/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.06 c constraints/linear/simplifyinequalities = TRUE
0.02/0.06 c
0.02/0.06 c # should presolving try to simplify knapsacks
0.02/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.06 c constraints/knapsack/simplifyinequalities = TRUE
0.02/0.06 c
0.02/0.06 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.02/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.06 c heuristics/undercover/freq = 0
0.02/0.06 c
0.02/0.06 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.02/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.06 c separating/rapidlearning/freq = 0
0.02/0.06 c
0.02/0.06 c -----------------------------------------------------------------------------------------------
0.02/0.06 c start solving
0.02/0.06 c
0.02/0.07 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.07 c 0.0s| 1 | 0 | 10 | - |1052k| 0 | 6 | 213 | 154 | 213 | 301 | 0 | 0 | 0 | 3.000000e+00 | -- | Inf
0.49/0.55 c 0.3s| 1 | 0 | 162 | - |1072k| 0 | 10 | 213 | 154 | 213 | 303 | 2 | 0 | 0 | 3.000000e+00 | -- | Inf
0.49/0.57 c 0.4s| 1 | 0 | 173 | - |1094k| 0 | 19 | 213 | 154 | 213 | 308 | 7 | 0 | 0 | 3.000000e+00 | -- | Inf
0.59/0.60 c 0.4s| 1 | 0 | 183 | - |1117k| 0 | 23 | 213 | 154 | 213 | 313 | 12 | 0 | 0 | 3.000000e+00 | -- | Inf
0.59/0.64 c 0.4s| 1 | 0 | 196 | - |1148k| 0 | 30 | 213 | 154 | 213 | 322 | 21 | 0 | 0 | 3.000000e+00 | -- | Inf
0.59/0.69 c 0.5s| 1 | 0 | 201 | - |1160k| 0 | 31 | 213 | 154 | 213 | 326 | 25 | 0 | 0 | 3.000000e+00 | -- | Inf
0.69/0.75 c 0.5s| 1 | 0 | 210 | - |1166k| 0 | 31 | 213 | 154 | 213 | 328 | 27 | 0 | 0 | 3.000000e+00 | -- | Inf
0.89/0.99 c 0.8s| 1 | 2 | 210 | - |1167k| 0 | 31 | 213 | 154 | 213 | 328 | 27 | 0 | 26 | 3.000000e+00 | -- | Inf
2.39/2.49 o 3
2.39/2.49 c * 2.2s| 126 | 0 | 2028 | 14.5 |1244k| 32 | - | 213 | 188 | 213 | 111 | 507 | 36 | 729 | 3.000000e+00 | 3.000000e+00 | 0.00%
2.39/2.49 c
2.39/2.49 c SCIP Status : problem is solved [optimal solution found]
2.39/2.49 c Solving Time (sec) : 2.20
2.39/2.49 c Solving Nodes : 126
2.39/2.49 c Primal Bound : +3.00000000000000e+00 (1 solutions)
2.39/2.49 c Dual Bound : +3.00000000000000e+00
2.39/2.49 c Gap : 0.00 %
2.39/2.49 s OPTIMUM FOUND
2.39/2.49 v x72 x71 -x70 x69 -x68 x67 -x66 -x65 x64 -x63 x62 -x61 -x60 -x59 -x58 -x57 x48 x47 x46 x45 x44 -x43 x42 x41 -x56 -x55 -x54 -x53
2.39/2.49 v -x52 -x51 x50 -x49 x40 x39 x38 x37 -x36 -x35 -x34 x33 x32 x31 -x30 x29 x28 -x27 -x26 x25 x24 -x23 x22 -x21 x20 -x19 x18 x17 x16
2.39/2.49 v x15 x14 x13 x12 -x11 x10 x9 -x8 -x7 -x6 -x5 -x4 -x3 x2 x1
2.39/2.49 c SCIP Status : problem is solved [optimal solution found]
2.39/2.49 c Solving Time : 2.20
2.39/2.49 c Original Problem :
2.39/2.49 c Problem name : HOME/instance-2666461-1276647967.opb
2.39/2.49 c Variables : 264 (264 binary, 0 integer, 0 implicit integer, 0 continuous)
2.39/2.49 c Constraints : 199 initial, 199 maximal
2.39/2.49 c Presolved Problem :
2.39/2.49 c Problem name : t_HOME/instance-2666461-1276647967.opb
2.39/2.49 c Variables : 213 (213 binary, 0 integer, 0 implicit integer, 0 continuous)
2.39/2.49 c Constraints : 154 initial, 188 maximal
2.39/2.49 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
2.39/2.49 c trivial : 0.00 0 0 0 0 0 0 0 0
2.39/2.49 c dualfix : 0.00 0 0 0 0 0 0 0 0
2.39/2.49 c boundshift : 0.00 0 0 0 0 0 0 0 0
2.39/2.49 c inttobinary : 0.00 0 0 0 0 0 0 0 0
2.39/2.49 c implics : 0.00 0 0 0 0 0 0 0 0
2.39/2.49 c probing : 0.01 0 0 0 0 0 0 0 0
2.39/2.49 c and : 0.00 6 42 0 0 0 42 0 42
2.39/2.49 c linear : 0.00 1 2 0 0 0 0 0 24
2.39/2.49 c logicor : 0.00 0 0 0 0 0 0 0 0
2.39/2.49 c root node : - 0 - - 0 - - - -
2.39/2.49 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
2.39/2.49 c integral : 0 0 0 122 0 0 13 0 0 216
2.39/2.49 c and : 147 247 748 1 0 12 647 490 0 0
2.39/2.49 c linear : 3 6 736 1 0 17 218 0 0 0
2.39/2.49 c logicor : 4+ 6 116 0 0 0 16 0 0 0
2.39/2.49 c countsols : 0 0 0 1 0 0 0 0 0 0
2.39/2.49 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
2.39/2.49 c integral : 1.42 0.00 0.00 1.42 0.00
2.39/2.49 c and : 0.02 0.00 0.02 0.00 0.00
2.39/2.49 c linear : 0.04 0.00 0.04 0.00 0.00
2.39/2.49 c logicor : 0.01 0.00 0.01 0.00 0.00
2.39/2.49 c countsols : 0.00 0.00 0.00 0.00 0.00
2.39/2.49 c Propagators : Time Calls Cutoffs DomReds
2.39/2.49 c vbounds : 0.00 2 0 0
2.39/2.49 c rootredcost : 0.00 0 0 0
2.39/2.49 c pseudoobj : 0.00 471 0 0
2.39/2.49 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.39/2.49 c propagation : 0.03 29 29 329 46.8 2 20.5 -
2.39/2.49 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
2.39/2.49 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.39/2.49 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.39/2.49 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.39/2.49 c applied globally : - - - 34 19.9 - - -
2.39/2.49 c applied locally : - - - 2 35.5 - - -
2.39/2.49 c Separators : Time Calls Cutoffs DomReds Cuts Conss
2.39/2.49 c cut pool : 0.00 5 - - 11 - (maximal pool size: 52)
2.39/2.49 c redcost : 0.00 247 0 0 0 0
2.39/2.49 c impliedbounds : 0.00 6 0 0 11 0
2.39/2.49 c intobj : 0.00 0 0 0 0 0
2.39/2.49 c cgmip : 0.00 0 0 0 0 0
2.39/2.49 c gomory : 0.05 6 0 0 14 0
2.39/2.49 c strongcg : 0.02 6 0 0 52 0
2.39/2.49 c cmir : 0.01 6 0 0 24 0
2.39/2.49 c flowcover : 0.10 6 0 0 36 0
2.39/2.49 c clique : 0.00 1 0 0 0 0
2.39/2.49 c zerohalf : 0.00 0 0 0 0 0
2.39/2.49 c mcf : 0.00 1 0 0 0 0
2.39/2.49 c rapidlearning : 0.02 1 0 0 0 0
2.39/2.49 c Pricers : Time Calls Vars
2.39/2.49 c problem variables: 0.00 0 0
2.39/2.49 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
2.39/2.49 c relpscost : 1.42 121 0 13 0 0 216
2.39/2.49 c pscost : 0.00 0 0 0 0 0 0
2.39/2.49 c inference : 0.00 0 0 0 0 0 0
2.39/2.49 c mostinf : 0.00 0 0 0 0 0 0
2.39/2.49 c leastinf : 0.00 0 0 0 0 0 0
2.39/2.49 c fullstrong : 0.00 0 0 0 0 0 0
2.39/2.49 c allfullstrong : 0.00 0 0 0 0 0 0
2.39/2.49 c random : 0.00 0 0 0 0 0 0
2.39/2.49 c Primal Heuristics : Time Calls Found
2.39/2.49 c LP solutions : 0.00 - 1
2.39/2.49 c pseudo solutions : 0.00 - 0
2.39/2.49 c oneopt : 0.00 0 0
2.39/2.49 c crossover : 0.00 0 0
2.39/2.49 c veclendiving : 0.00 0 0
2.39/2.49 c objpscostdiving : 0.00 0 0
2.39/2.49 c rootsoldiving : 0.00 0 0
2.39/2.49 c linesearchdiving : 0.00 0 0
2.39/2.49 c guideddiving : 0.00 0 0
2.39/2.49 c intshifting : 0.00 0 0
2.39/2.49 c coefdiving : 0.01 1 0
2.39/2.49 c pscostdiving : 0.01 1 0
2.39/2.49 c fracdiving : 0.01 1 0
2.39/2.49 c feaspump : 0.00 1 0
2.39/2.49 c trivial : 0.00 2 0
2.39/2.49 c simplerounding : 0.00 0 0
2.39/2.49 c zirounding : 0.01 107 0
2.39/2.49 c rounding : 0.01 185 0
2.39/2.49 c shifting : 0.02 24 0
2.39/2.49 c twoopt : 0.00 0 0
2.39/2.49 c fixandinfer : 0.00 0 0
2.39/2.49 c intdiving : 0.00 0 0
2.39/2.49 c actconsdiving : 0.00 0 0
2.39/2.49 c octane : 0.00 0 0
2.39/2.49 c rens : 0.02 1 0
2.39/2.49 c rins : 0.00 0 0
2.39/2.49 c localbranching : 0.00 0 0
2.39/2.49 c mutation : 0.00 0 0
2.39/2.49 c dins : 0.00 0 0
2.39/2.49 c undercover : 0.28 1 0
2.39/2.49 c nlp : 0.00 0 0
2.39/2.49 c trysol : 0.00 0 0
2.39/2.49 c LP : Time Calls Iterations Iter/call Iter/sec
2.39/2.49 c primal LP : 0.00 0 0 0.00 -
2.39/2.49 c dual LP : 0.13 262 1807 6.90 13900.00
2.39/2.49 c lex dual LP : 0.00 0 0 0.00 -
2.39/2.49 c barrier LP : 0.00 0 0 0.00 -
2.39/2.49 c diving/probing LP: 0.01 49 221 4.51 22100.00
2.39/2.49 c strong branching : 1.42 729 20605 28.26 14510.56
2.39/2.49 c (at root node) : - 26 2140 82.31 -
2.39/2.49 c conflict analysis: 0.00 0 0 0.00 -
2.39/2.49 c B&B Tree :
2.39/2.49 c number of runs : 1
2.39/2.49 c nodes : 126
2.39/2.49 c nodes (total) : 126
2.39/2.49 c nodes left : 0
2.39/2.49 c max depth : 32
2.39/2.49 c max depth (total): 32
2.39/2.49 c backtracks : 11 (8.7%)
2.39/2.49 c delayed cutoffs : 7
2.39/2.49 c repropagations : 23 (196 domain reductions, 7 cutoffs)
2.39/2.49 c avg switch length: 2.24
2.39/2.49 c switching time : 0.00
2.39/2.49 c Solution :
2.39/2.49 c Solutions found : 1 (1 improvements)
2.39/2.49 c First Solution : +3.00000000000000e+00 (in run 1, after 126 nodes, 2.20 seconds, depth 31, found by <relaxation>)
2.39/2.49 c Primal Bound : +3.00000000000000e+00 (in run 1, after 126 nodes, 2.20 seconds, depth 31, found by <relaxation>)
2.39/2.49 c Dual Bound : +3.00000000000000e+00
2.39/2.49 c Gap : 0.00 %
2.39/2.49 c Root Dual Bound : +3.00000000000000e+00
2.39/2.49 c Root Iterations : 210
2.39/2.50 c Time complete: 2.49.