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-2703088-1278564454.opb>
0.00/0.01 c original problem has 240 variables (240 bin, 0 int, 0 impl, 0 cont) and 163 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) 7 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 21 chg coeffs, 0 upgd conss, 1012 impls, 0 clqs
0.00/0.02 c (round 2) 19 del vars, 8 del conss, 0 chg bounds, 0 chg sides, 29 chg coeffs, 0 upgd conss, 1463 impls, 0 clqs
0.02/0.03 c (round 3) 30 del vars, 17 del conss, 0 chg bounds, 0 chg sides, 38 chg coeffs, 7 upgd conss, 1783 impls, 0 clqs
0.02/0.03 c (round 4) 40 del vars, 25 del conss, 0 chg bounds, 0 chg sides, 46 chg coeffs, 7 upgd conss, 2023 impls, 0 clqs
0.02/0.03 c (round 5) 50 del vars, 33 del conss, 0 chg bounds, 0 chg sides, 54 chg coeffs, 7 upgd conss, 2183 impls, 0 clqs
0.02/0.03 c (round 6) 60 del vars, 41 del conss, 0 chg bounds, 0 chg sides, 62 chg coeffs, 7 upgd conss, 2263 impls, 0 clqs
0.02/0.04 c (round 7) 70 del vars, 49 del conss, 0 chg bounds, 0 chg sides, 70 chg coeffs, 7 upgd conss, 2263 impls, 0 clqs
0.02/0.05 c (0.0s) probing: 144/170 (84.7%) - 0 fixings, 0 aggregations, 12 implications, 0 bound changes
0.02/0.05 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.02/0.05 c presolving (8 rounds):
0.02/0.05 c 70 deleted vars, 49 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 70 changed coefficients
0.02/0.05 c 2287 implications, 0 cliques
0.02/0.05 c presolved problem has 170 variables (170 bin, 0 int, 0 impl, 0 cont) and 108 constraints
0.02/0.05 c 94 constraints of type <and>
0.02/0.05 c 6 constraints of type <linear>
0.02/0.05 c 8 constraints of type <logicor>
0.02/0.05 c transformed objective value is always integral (scale: 2)
0.02/0.05 c Presolving Time: 0.03
0.02/0.05 c - non default parameters ----------------------------------------------------------------------
0.02/0.05 c # SCIP version 1.2.1.3
0.02/0.05 c
0.02/0.05 c # frequency for displaying node information lines
0.02/0.05 c # [type: int, range: [-1,2147483647], default: 100]
0.02/0.05 c display/freq = 10000
0.02/0.05 c
0.02/0.05 c # maximal time in seconds to run
0.02/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.02/0.05 c limits/time = 1790
0.02/0.05 c
0.02/0.05 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.02/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.02/0.05 c limits/memory = 1620
0.02/0.05 c
0.02/0.05 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.02/0.05 c # [type: int, range: [1,2], default: 1]
0.02/0.05 c timing/clocktype = 2
0.02/0.05 c
0.02/0.05 c # should presolving try to simplify inequalities
0.02/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.05 c constraints/linear/simplifyinequalities = TRUE
0.02/0.05 c
0.02/0.05 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.02/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.05 c constraints/indicator/addCouplingCons = TRUE
0.02/0.05 c
0.02/0.05 c # should presolving try to simplify knapsacks
0.02/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.05 c constraints/knapsack/simplifyinequalities = TRUE
0.02/0.05 c
0.02/0.05 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.02/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.05 c heuristics/undercover/freq = 0
0.02/0.05 c
0.02/0.05 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.02/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.05 c separating/rapidlearning/freq = 0
0.02/0.05 c
0.02/0.05 c -----------------------------------------------------------------------------------------------
0.02/0.05 c start solving
0.02/0.05 c
0.02/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.02/0.05 c 0.0s| 1 | 0 | 16 | - | 891k| 0 | 8 | 170 | 108 | 170 | 201 | 0 | 0 | 0 | 3.000000e+00 | -- | Inf
0.09/0.18 o 17
0.09/0.18 c y 0.2s| 1 | 0 | 173 | - | 953k| 0 | 8 | 170 | 108 | 170 | 201 | 0 | 0 | 0 | 3.000000e+00 | 1.700000e+01 | 466.67%
0.09/0.19 c 0.2s| 1 | 0 | 188 | - |1344k| 0 | 22 | 170 | 353 | 170 | 205 | 14 | 0 | 0 | 3.000000e+00 | 1.700000e+01 | 466.67%
0.19/0.21 c 0.2s| 1 | 0 | 205 | - |1396k| 0 | 36 | 170 | 353 | 170 | 221 | 30 | 0 | 0 | 3.000000e+00 | 1.700000e+01 | 466.67%
0.19/0.23 c 0.2s| 1 | 0 | 228 | - |1476k| 0 | 47 | 170 | 353 | 170 | 238 | 47 | 0 | 0 | 3.000000e+00 | 1.700000e+01 | 466.67%
0.19/0.27 c 0.3s| 1 | 0 | 256 | - |1607k| 0 | 47 | 170 | 353 | 170 | 254 | 63 | 0 | 0 | 3.000000e+00 | 1.700000e+01 | 466.67%
0.29/0.31 c 0.3s| 1 | 0 | 278 | - |1628k| 0 | 53 | 170 | 353 | 170 | 268 | 77 | 0 | 0 | 3.000000e+00 | 1.700000e+01 | 466.67%
0.29/0.36 c 0.3s| 1 | 0 | 305 | - |1671k| 0 | 63 | 170 | 353 | 170 | 284 | 93 | 0 | 0 | 3.000000e+00 | 1.700000e+01 | 466.67%
0.39/0.44 c 0.4s| 1 | 2 | 305 | - |1672k| 0 | 63 | 170 | 353 | 170 | 284 | 93 | 0 | 9 | 3.000000e+00 | 1.700000e+01 | 466.67%
1.39/1.46 o 3
1.39/1.46 c * 1.4s| 258 | 0 | 2253 | 7.6 |1764k| 34 | - | 170 | 458 | 170 | 139 | 549 | 105 | 813 | 3.000000e+00 | 3.000000e+00 | 0.00%
1.39/1.46 c
1.39/1.46 c SCIP Status : problem is solved [optimal solution found]
1.39/1.46 c Solving Time (sec) : 1.45
1.39/1.46 c Solving Nodes : 258
1.39/1.46 c Primal Bound : +3.00000000000000e+00 (2 solutions)
1.39/1.46 c Dual Bound : +3.00000000000000e+00
1.39/1.46 c Gap : 0.00 %
1.39/1.46 s OPTIMUM FOUND
1.39/1.46 v -x90 -x89 x88 x87 -x86 -x85 -x84 -x83 -x82 x81 -x60 -x59 x58 x57 x56 -x80 -x79 -x78 x77 x76 -x55 -x54 -x53 x52 x51 -x75 x74 -x73
1.39/1.46 v -x72 x71 -x50 x49 -x48 -x47 x46 -x70 -x69 x68 -x67 -x66 x45 x44 -x43 x42 x41 -x65 -x64 -x63 x62 -x61 -x40 -x39 x38 -x37 x36
1.39/1.46 v x35 x34 x33 -x32 x31 -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
1.39/1.46 v -x5 -x4 -x3 x2 x1
1.39/1.46 c SCIP Status : problem is solved [optimal solution found]
1.39/1.46 c Solving Time : 1.45
1.39/1.46 c Original Problem :
1.39/1.46 c Problem name : HOME/instance-2703088-1278564454.opb
1.39/1.46 c Variables : 240 (240 binary, 0 integer, 0 implicit integer, 0 continuous)
1.39/1.46 c Constraints : 163 initial, 163 maximal
1.39/1.46 c Presolved Problem :
1.39/1.46 c Problem name : t_HOME/instance-2703088-1278564454.opb
1.39/1.46 c Variables : 170 (170 binary, 0 integer, 0 implicit integer, 0 continuous)
1.39/1.46 c Constraints : 108 initial, 458 maximal
1.39/1.46 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.39/1.46 c trivial : 0.00 0 0 0 0 0 0 0 0
1.39/1.46 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.39/1.46 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.39/1.46 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.39/1.46 c implics : 0.00 0 0 0 0 0 0 0 0
1.39/1.46 c probing : 0.01 0 0 0 0 0 0 0 0
1.39/1.46 c and : 0.01 12 49 0 0 0 49 0 49
1.39/1.46 c linear : 0.01 2 7 0 0 0 0 0 21
1.39/1.46 c logicor : 0.00 0 0 0 0 0 0 0 0
1.39/1.46 c root node : - 6 - - 6 - - - -
1.39/1.46 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.39/1.46 c integral : 0 0 0 235 0 1 36 0 0 408
1.39/1.46 c and : 94 422 1110 1 0 23 788 475 0 0
1.39/1.46 c linear : 6+ 7 1087 1 0 47 432 89 0 0
1.39/1.46 c logicor : 8+ 7 358 1 0 4 101 0 0 0
1.39/1.46 c countsols : 0 0 0 1 0 0 0 0 0 0
1.39/1.46 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.39/1.46 c integral : 0.76 0.00 0.00 0.76 0.00
1.39/1.46 c and : 0.01 0.01 0.01 0.00 0.00
1.39/1.46 c linear : 0.03 0.00 0.03 0.00 0.00
1.39/1.46 c logicor : 0.00 0.00 0.00 0.00 0.00
1.39/1.46 c countsols : 0.00 0.00 0.00 0.00 0.00
1.39/1.46 c Propagators : Time Calls Cutoffs DomReds
1.39/1.46 c vbounds : 0.00 2 0 0
1.39/1.46 c rootredcost : 0.00 0 0 0
1.39/1.46 c pseudoobj : 0.00 813 0 0
1.39/1.46 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.39/1.46 c propagation : 0.00 74 74 276 16.4 8 12.4 -
1.39/1.46 c infeasible LP : 0.00 1 1 4 12.5 0 0.0 0
1.39/1.46 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.39/1.46 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.39/1.46 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.39/1.46 c applied globally : - - - 105 11.6 - - -
1.39/1.46 c applied locally : - - - 0 0.0 - - -
1.39/1.46 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.39/1.46 c cut pool : 0.00 5 - - 50 - (maximal pool size: 257)
1.39/1.46 c redcost : 0.00 421 0 0 0 0
1.39/1.46 c impliedbounds : 0.00 6 0 0 32 0
1.39/1.46 c intobj : 0.00 0 0 0 0 0
1.39/1.46 c cgmip : 0.00 0 0 0 0 0
1.39/1.46 c gomory : 0.05 6 0 0 78 0
1.39/1.46 c strongcg : 0.04 6 0 0 279 0
1.39/1.46 c cmir : 0.02 6 0 0 64 0
1.39/1.46 c flowcover : 0.03 6 0 0 133 0
1.39/1.46 c clique : 0.00 6 0 0 1 0
1.39/1.46 c zerohalf : 0.00 0 0 0 0 0
1.39/1.46 c mcf : 0.00 1 0 0 0 0
1.39/1.46 c rapidlearning : 0.11 1 0 6 0 249
1.39/1.46 c Pricers : Time Calls Vars
1.39/1.46 c problem variables: 0.00 0 0
1.39/1.46 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.39/1.46 c relpscost : 0.76 234 1 36 0 0 408
1.39/1.46 c pscost : 0.00 0 0 0 0 0 0
1.39/1.46 c inference : 0.00 0 0 0 0 0 0
1.39/1.46 c mostinf : 0.00 0 0 0 0 0 0
1.39/1.46 c leastinf : 0.00 0 0 0 0 0 0
1.39/1.46 c fullstrong : 0.00 0 0 0 0 0 0
1.39/1.46 c allfullstrong : 0.00 0 0 0 0 0 0
1.39/1.46 c random : 0.00 0 0 0 0 0 0
1.39/1.46 c Primal Heuristics : Time Calls Found
1.39/1.46 c LP solutions : 0.00 - 1
1.39/1.46 c pseudo solutions : 0.00 - 0
1.39/1.46 c crossover : 0.00 0 0
1.39/1.46 c veclendiving : 0.00 0 0
1.39/1.46 c objpscostdiving : 0.00 0 0
1.39/1.46 c rootsoldiving : 0.00 0 0
1.39/1.46 c linesearchdiving : 0.00 0 0
1.39/1.46 c guideddiving : 0.00 0 0
1.39/1.46 c intshifting : 0.00 0 0
1.39/1.46 c oneopt : 0.00 1 0
1.39/1.46 c coefdiving : 0.01 1 0
1.39/1.46 c pscostdiving : 0.01 1 0
1.39/1.46 c fracdiving : 0.00 1 0
1.39/1.46 c feaspump : 0.01 1 0
1.39/1.46 c trivial : 0.00 2 0
1.39/1.46 c simplerounding : 0.00 0 0
1.39/1.46 c zirounding : 0.00 202 0
1.39/1.46 c rounding : 0.01 244 0
1.39/1.46 c shifting : 0.05 46 0
1.39/1.46 c twoopt : 0.00 0 0
1.39/1.46 c fixandinfer : 0.00 0 0
1.39/1.46 c intdiving : 0.00 0 0
1.39/1.46 c actconsdiving : 0.00 0 0
1.39/1.46 c octane : 0.00 0 0
1.39/1.46 c rens : 0.02 1 0
1.39/1.46 c rins : 0.00 0 0
1.39/1.46 c localbranching : 0.00 0 0
1.39/1.46 c mutation : 0.00 0 0
1.39/1.46 c dins : 0.00 0 0
1.39/1.46 c undercover : 0.02 1 0
1.39/1.46 c nlp : 0.00 0 0
1.39/1.46 c trysol : 0.00 0 0
1.39/1.46 c LP : Time Calls Iterations Iter/call Iter/sec
1.39/1.46 c primal LP : 0.01 0 0 0.00 -
1.39/1.46 c dual LP : 0.16 432 1998 4.62 12646.13
1.39/1.46 c lex dual LP : 0.00 0 0 0.00 -
1.39/1.46 c barrier LP : 0.00 0 0 0.00 -
1.39/1.46 c diving/probing LP: 0.01 51 255 5.00 21250.00
1.39/1.46 c strong branching : 0.75 813 9005 11.08 11927.47
1.39/1.46 c (at root node) : - 9 565 62.78 -
1.39/1.46 c conflict analysis: 0.00 0 0 0.00 -
1.39/1.46 c B&B Tree :
1.39/1.46 c number of runs : 1
1.39/1.46 c nodes : 258
1.39/1.46 c nodes (total) : 258
1.39/1.46 c nodes left : 0
1.39/1.46 c max depth : 34
1.39/1.46 c max depth (total): 34
1.39/1.46 c backtracks : 24 (9.3%)
1.39/1.46 c delayed cutoffs : 13
1.39/1.46 c repropagations : 73 (166 domain reductions, 13 cutoffs)
1.39/1.46 c avg switch length: 2.44
1.39/1.46 c switching time : 0.02
1.39/1.46 c Solution :
1.39/1.46 c Solutions found : 2 (2 improvements)
1.39/1.46 c First Solution : +1.70000000000000e+01 (in run 1, after 1 nodes, 0.17 seconds, depth 0, found by <trysol>)
1.39/1.46 c Primal Bound : +3.00000000000000e+00 (in run 1, after 258 nodes, 1.44 seconds, depth 34, found by <relaxation>)
1.39/1.46 c Dual Bound : +3.00000000000000e+00
1.39/1.46 c Gap : 0.00 %
1.39/1.46 c Root Dual Bound : +3.00000000000000e+00
1.39/1.46 c Root Iterations : 305
1.39/1.47 c Time complete: 1.46.