0.00/0.00 c SCIP version 1.2.1.3 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2]
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-2703006-1278564388.opb>
0.00/0.01 c original problem has 320 variables (320 bin, 0 int, 0 impl, 0 cont) and 217 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.02 c presolving:
0.00/0.03 c (round 1) 9 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 27 chg coeffs, 0 upgd conss, 1476 impls, 0 clqs
0.00/0.03 c (round 2) 22 del vars, 9 del conss, 0 chg bounds, 0 chg sides, 36 chg coeffs, 0 upgd conss, 2127 impls, 0 clqs
0.00/0.03 c (round 3) 32 del vars, 17 del conss, 0 chg bounds, 0 chg sides, 44 chg coeffs, 9 upgd conss, 2607 impls, 0 clqs
0.00/0.03 c (round 4) 42 del vars, 25 del conss, 0 chg bounds, 0 chg sides, 52 chg coeffs, 9 upgd conss, 3007 impls, 0 clqs
0.00/0.04 c (round 5) 52 del vars, 33 del conss, 0 chg bounds, 0 chg sides, 60 chg coeffs, 9 upgd conss, 3327 impls, 0 clqs
0.00/0.04 c (round 6) 62 del vars, 41 del conss, 0 chg bounds, 0 chg sides, 68 chg coeffs, 9 upgd conss, 3567 impls, 0 clqs
0.00/0.04 c (round 7) 72 del vars, 49 del conss, 0 chg bounds, 0 chg sides, 76 chg coeffs, 9 upgd conss, 3727 impls, 0 clqs
0.00/0.04 c (round 8) 82 del vars, 57 del conss, 0 chg bounds, 0 chg sides, 84 chg coeffs, 9 upgd conss, 3807 impls, 0 clqs
0.00/0.04 c (round 9) 92 del vars, 65 del conss, 0 chg bounds, 0 chg sides, 92 chg coeffs, 9 upgd conss, 3807 impls, 0 clqs
0.00/0.06 c (0.0s) probing: 161/228 (70.6%) - 0 fixings, 0 aggregations, 16 implications, 0 bound changes
0.00/0.06 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.00/0.06 c presolving (10 rounds):
0.00/0.06 c 92 deleted vars, 65 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 92 changed coefficients
0.00/0.06 c 3839 implications, 0 cliques
0.00/0.06 c presolved problem has 228 variables (228 bin, 0 int, 0 impl, 0 cont) and 144 constraints
0.00/0.06 c 126 constraints of type <and>
0.00/0.06 c 8 constraints of type <linear>
0.00/0.06 c 10 constraints of type <logicor>
0.00/0.06 c transformed objective value is always integral (scale: 2)
0.00/0.06 c Presolving Time: 0.04
0.00/0.06 c - non default parameters ----------------------------------------------------------------------
0.00/0.06 c # SCIP version 1.2.1.3
0.00/0.06 c
0.00/0.06 c # frequency for displaying node information lines
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.06 c display/freq = 10000
0.00/0.06 c
0.00/0.06 c # maximal time in seconds to run
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.06 c limits/time = 1790
0.00/0.06 c
0.00/0.06 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.06 c limits/memory = 1620
0.00/0.06 c
0.00/0.06 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.06 c # [type: int, range: [1,2], default: 1]
0.00/0.06 c timing/clocktype = 2
0.00/0.06 c
0.00/0.06 c # should presolving try to simplify inequalities
0.00/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.06 c constraints/linear/simplifyinequalities = TRUE
0.00/0.06 c
0.00/0.06 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.06 c constraints/indicator/addCouplingCons = TRUE
0.00/0.06 c
0.00/0.06 c # should presolving try to simplify knapsacks
0.00/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.06 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.06 c heuristics/undercover/freq = 0
0.00/0.06 c
0.00/0.06 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.06 c separating/rapidlearning/freq = 0
0.00/0.06 c
0.00/0.06 c -----------------------------------------------------------------------------------------------
0.00/0.06 c start solving
0.00/0.06 c
0.00/0.06 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.06 c 0.1s| 1 | 0 | 18 | - |1157k| 0 | 9 | 228 | 144 | 228 | 269 | 0 | 0 | 0 | 3.000000e+00 | -- | Inf
0.10/0.13 c 0.1s| 1 | 0 | 266 | - |1188k| 0 | 32 | 228 | 144 | 228 | 281 | 12 | 0 | 0 | 3.000000e+00 | -- | Inf
0.10/0.15 c 0.1s| 1 | 0 | 283 | - |1229k| 0 | 44 | 228 | 144 | 228 | 298 | 29 | 0 | 0 | 3.000000e+00 | -- | Inf
0.10/0.18 c 0.2s| 1 | 0 | 309 | - |1294k| 0 | 49 | 228 | 144 | 228 | 315 | 46 | 0 | 0 | 3.000000e+00 | -- | Inf
0.19/0.21 c 0.2s| 1 | 0 | 348 | - |1369k| 0 | 52 | 228 | 144 | 228 | 332 | 63 | 0 | 0 | 3.000000e+00 | -- | Inf
0.19/0.25 c 0.2s| 1 | 0 | 373 | - |1451k| 0 | 66 | 228 | 144 | 228 | 350 | 81 | 0 | 0 | 3.000000e+00 | -- | Inf
0.29/0.31 c 0.3s| 1 | 0 | 423 | - |1537k| 0 | 70 | 228 | 144 | 228 | 367 | 98 | 0 | 0 | 3.000000e+00 | -- | Inf
0.39/0.42 c 0.4s| 1 | 2 | 423 | - |1538k| 0 | 70 | 228 | 144 | 228 | 367 | 98 | 0 | 16 | 3.000000e+00 | -- | Inf
1.59/1.64 o 3
1.59/1.64 c * 1.6s| 304 | 0 | 2225 | 5.9 |1730k| 35 | - | 228 | 418 | 228 | 151 | 545 | 274 |1019 | 3.000000e+00 | 3.000000e+00 | 0.00%
1.59/1.64 c
1.59/1.64 c SCIP Status : problem is solved [optimal solution found]
1.59/1.64 c Solving Time (sec) : 1.63
1.59/1.64 c Solving Nodes : 304
1.59/1.64 c Primal Bound : +3.00000000000000e+00 (1 solutions)
1.59/1.64 c Dual Bound : +3.00000000000000e+00
1.59/1.64 c Gap : 0.00 %
1.59/1.64 s OPTIMUM FOUND
1.59/1.64 v -x120 -x119 -x118 x117 x116 -x115 -x114 x113 x112 -x111 x80 x79 -x78 -x77 x76 -x110 -x109 x108 -x107 -x106 -x75 -x74 x73 x72 x71
1.59/1.64 v -x105 -x104 -x103 x102 -x101 -x70 -x69 x68 -x67 x66 x100 -x99 -x98 -x97 x96 x65 -x64 x63 x62 x61 -x95 x94 x93 x92 -x91 x60
1.59/1.64 v x59 -x58 x57 x56 -x90 -x89 x88 -x87 -x86 x55 x54 -x53 -x52 x51 -x85 -x84 -x83 -x82 -x81 -x50 x49 -x48 -x47 x46 -x45 -x44 x43
1.59/1.64 v -x42 x41 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 x15 -x14
1.59/1.64 v -x13 -x12 x11 -x10 -x9 -x8 x7 x6 -x5 -x4 -x3 x2 x1
1.59/1.64 c SCIP Status : problem is solved [optimal solution found]
1.59/1.64 c Solving Time : 1.63
1.59/1.64 c Original Problem :
1.59/1.64 c Problem name : HOME/instance-2703006-1278564388.opb
1.59/1.64 c Variables : 320 (320 binary, 0 integer, 0 implicit integer, 0 continuous)
1.59/1.64 c Constraints : 217 initial, 217 maximal
1.59/1.64 c Presolved Problem :
1.59/1.64 c Problem name : t_HOME/instance-2703006-1278564388.opb
1.59/1.64 c Variables : 228 (228 binary, 0 integer, 0 implicit integer, 0 continuous)
1.59/1.64 c Constraints : 144 initial, 418 maximal
1.59/1.64 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.59/1.64 c trivial : 0.00 0 0 0 0 0 0 0 0
1.59/1.64 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.59/1.64 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.59/1.64 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.59/1.64 c implics : 0.00 0 0 0 0 0 0 0 0
1.59/1.64 c probing : 0.01 0 0 0 0 0 0 0 0
1.59/1.64 c and : 0.01 16 65 0 0 0 65 0 65
1.59/1.64 c linear : 0.01 2 9 0 0 0 0 0 27
1.59/1.64 c logicor : 0.00 0 0 0 0 0 0 0 0
1.59/1.64 c root node : - 0 - - 0 - - - -
1.59/1.64 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.59/1.64 c integral : 0 0 0 258 0 1 58 0 0 426
1.59/1.64 c and : 126 491 1426 1 0 26 1044 458 0 0
1.59/1.64 c linear : 8 6 1400 1 0 106 565 0 0 0
1.59/1.64 c logicor : 10+ 6 462 1 0 3 121 0 0 0
1.59/1.64 c countsols : 0 0 0 1 0 0 0 0 0 0
1.59/1.64 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.59/1.64 c integral : 0.95 0.00 0.00 0.95 0.00
1.59/1.64 c and : 0.01 0.00 0.01 0.00 0.00
1.59/1.64 c linear : 0.03 0.00 0.03 0.00 0.00
1.59/1.64 c logicor : 0.00 0.00 0.00 0.00 0.00
1.59/1.64 c countsols : 0.00 0.00 0.00 0.00 0.00
1.59/1.64 c Propagators : Time Calls Cutoffs DomReds
1.59/1.64 c vbounds : 0.00 2 0 0
1.59/1.64 c rootredcost : 0.00 0 0 0
1.59/1.64 c pseudoobj : 0.00 1091 0 0
1.59/1.64 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.59/1.64 c propagation : 0.01 135 134 777 18.7 42 15.9 -
1.59/1.64 c infeasible LP : 0.00 1 1 11 25.2 1 18.0 0
1.59/1.64 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.59/1.64 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.59/1.64 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.59/1.64 c applied globally : - - - 274 13.7 - - -
1.59/1.64 c applied locally : - - - 0 0.0 - - -
1.59/1.64 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.59/1.64 c cut pool : 0.00 5 - - 86 - (maximal pool size: 344)
1.59/1.64 c redcost : 0.00 491 0 0 0 0
1.59/1.64 c impliedbounds : 0.00 6 0 0 20 0
1.59/1.64 c intobj : 0.00 0 0 0 0 0
1.59/1.64 c cgmip : 0.00 0 0 0 0 0
1.59/1.64 c gomory : 0.05 6 0 0 161 0
1.59/1.64 c strongcg : 0.04 6 0 0 415 0
1.59/1.64 c cmir : 0.02 6 0 0 83 0
1.59/1.64 c flowcover : 0.04 6 0 0 158 0
1.59/1.64 c clique : 0.00 6 0 0 1 0
1.59/1.64 c zerohalf : 0.00 0 0 0 0 0
1.59/1.64 c mcf : 0.00 1 0 0 0 0
1.59/1.64 c rapidlearning : 0.04 1 0 0 0 0
1.59/1.64 c Pricers : Time Calls Vars
1.59/1.64 c problem variables: 0.00 0 0
1.59/1.64 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.59/1.64 c relpscost : 0.95 257 1 58 0 0 426
1.59/1.64 c pscost : 0.00 0 0 0 0 0 0
1.59/1.64 c inference : 0.00 0 0 0 0 0 0
1.59/1.64 c mostinf : 0.00 0 0 0 0 0 0
1.59/1.64 c leastinf : 0.00 0 0 0 0 0 0
1.59/1.64 c fullstrong : 0.00 0 0 0 0 0 0
1.59/1.64 c allfullstrong : 0.00 0 0 0 0 0 0
1.59/1.64 c random : 0.00 0 0 0 0 0 0
1.59/1.64 c Primal Heuristics : Time Calls Found
1.59/1.64 c LP solutions : 0.00 - 1
1.59/1.64 c pseudo solutions : 0.00 - 0
1.59/1.64 c oneopt : 0.00 0 0
1.59/1.64 c crossover : 0.00 0 0
1.59/1.64 c rootsoldiving : 0.00 0 0
1.59/1.64 c linesearchdiving : 0.00 0 0
1.59/1.64 c guideddiving : 0.00 0 0
1.59/1.64 c intshifting : 0.00 0 0
1.59/1.64 c coefdiving : 0.01 1 0
1.59/1.64 c pscostdiving : 0.01 1 0
1.59/1.64 c fracdiving : 0.01 1 0
1.59/1.64 c veclendiving : 0.00 1 0
1.59/1.64 c feaspump : 0.01 1 0
1.59/1.64 c objpscostdiving : 0.00 1 0
1.59/1.64 c trivial : 0.00 2 0
1.59/1.64 c simplerounding : 0.00 0 0
1.59/1.64 c zirounding : 0.00 210 0
1.59/1.64 c rounding : 0.01 262 0
1.59/1.64 c shifting : 0.05 48 0
1.59/1.64 c twoopt : 0.00 0 0
1.59/1.64 c fixandinfer : 0.00 0 0
1.59/1.64 c intdiving : 0.00 0 0
1.59/1.64 c actconsdiving : 0.00 0 0
1.59/1.64 c octane : 0.00 0 0
1.59/1.64 c rens : 0.02 1 0
1.59/1.64 c rins : 0.00 0 0
1.59/1.64 c localbranching : 0.00 0 0
1.59/1.64 c mutation : 0.00 0 0
1.59/1.64 c dins : 0.00 0 0
1.59/1.64 c undercover : 0.02 1 0
1.59/1.64 c nlp : 0.00 0 0
1.59/1.64 c trysol : 0.00 0 0
1.59/1.64 c LP : Time Calls Iterations Iter/call Iter/sec
1.59/1.64 c primal LP : 0.00 0 0 0.00 -
1.59/1.64 c dual LP : 0.17 487 1746 3.59 10455.34
1.59/1.64 c lex dual LP : 0.00 0 0 0.00 -
1.59/1.64 c barrier LP : 0.00 0 0 0.00 -
1.59/1.64 c diving/probing LP: 0.02 91 479 5.26 19958.33
1.59/1.64 c strong branching : 0.95 1019 10344 10.15 10888.66
1.59/1.64 c (at root node) : - 16 746 46.62 -
1.59/1.64 c conflict analysis: 0.00 0 0 0.00 -
1.59/1.64 c B&B Tree :
1.59/1.64 c number of runs : 1
1.59/1.64 c nodes : 304
1.59/1.64 c nodes (total) : 304
1.59/1.64 c nodes left : 0
1.59/1.64 c max depth : 35
1.59/1.64 c max depth (total): 35
1.59/1.64 c backtracks : 57 (18.8%)
1.59/1.64 c delayed cutoffs : 36
1.59/1.64 c repropagations : 124 (424 domain reductions, 31 cutoffs)
1.59/1.64 c avg switch length: 3.01
1.59/1.64 c switching time : 0.02
1.59/1.64 c Solution :
1.59/1.64 c Solutions found : 1 (1 improvements)
1.59/1.64 c First Solution : +3.00000000000000e+00 (in run 1, after 304 nodes, 1.63 seconds, depth 35, found by <relaxation>)
1.59/1.64 c Primal Bound : +3.00000000000000e+00 (in run 1, after 304 nodes, 1.63 seconds, depth 35, found by <relaxation>)
1.59/1.64 c Dual Bound : +3.00000000000000e+00
1.59/1.64 c Gap : 0.00 %
1.59/1.64 c Root Dual Bound : +3.00000000000000e+00
1.59/1.64 c Root Iterations : 423
1.59/1.65 c Time complete: 1.65.