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-2702970-1278564363.opb>
0.00/0.01 c original problem has 378 variables (378 bin, 0 int, 0 impl, 0 cont) and 267 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) 7 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 32 chg coeffs, 0 upgd conss, 1596 impls, 0 clqs
0.00/0.03 c (round 2) 19 del vars, 10 del conss, 0 chg bounds, 0 chg sides, 42 chg coeffs, 8 upgd conss, 2316 impls, 0 clqs
0.00/0.04 c (round 3) 31 del vars, 20 del conss, 0 chg bounds, 0 chg sides, 52 chg coeffs, 8 upgd conss, 2916 impls, 0 clqs
0.00/0.04 c (round 4) 43 del vars, 30 del conss, 0 chg bounds, 0 chg sides, 62 chg coeffs, 8 upgd conss, 3396 impls, 0 clqs
0.00/0.04 c (round 5) 55 del vars, 40 del conss, 0 chg bounds, 0 chg sides, 72 chg coeffs, 8 upgd conss, 3756 impls, 0 clqs
0.00/0.04 c (round 6) 67 del vars, 50 del conss, 0 chg bounds, 0 chg sides, 82 chg coeffs, 8 upgd conss, 3996 impls, 0 clqs
0.03/0.05 c (round 7) 79 del vars, 60 del conss, 0 chg bounds, 0 chg sides, 92 chg coeffs, 8 upgd conss, 4116 impls, 0 clqs
0.03/0.05 c (round 8) 91 del vars, 70 del conss, 0 chg bounds, 0 chg sides, 102 chg coeffs, 8 upgd conss, 4116 impls, 0 clqs
0.03/0.06 c (0.0s) probing: 167/287 (58.2%) - 0 fixings, 0 aggregations, 14 implications, 0 bound changes
0.03/0.06 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.03/0.06 c presolving (9 rounds):
0.03/0.06 c 91 deleted vars, 70 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 102 changed coefficients
0.03/0.06 c 4144 implications, 0 cliques
0.03/0.06 c presolved problem has 287 variables (287 bin, 0 int, 0 impl, 0 cont) and 190 constraints
0.03/0.06 c 175 constraints of type <and>
0.03/0.06 c 7 constraints of type <linear>
0.03/0.06 c 8 constraints of type <logicor>
0.03/0.06 c transformed objective value is always integral (scale: 2)
0.03/0.06 c Presolving Time: 0.04
0.03/0.06 c - non default parameters ----------------------------------------------------------------------
0.03/0.06 c # SCIP version 1.2.1.3
0.03/0.06 c
0.03/0.06 c # frequency for displaying node information lines
0.03/0.06 c # [type: int, range: [-1,2147483647], default: 100]
0.03/0.06 c display/freq = 10000
0.03/0.06 c
0.03/0.06 c # maximal time in seconds to run
0.03/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.03/0.06 c limits/time = 1789.99
0.03/0.06 c
0.03/0.06 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.03/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.03/0.06 c limits/memory = 1620
0.03/0.06 c
0.03/0.06 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.03/0.06 c # [type: int, range: [1,2], default: 1]
0.03/0.06 c timing/clocktype = 2
0.03/0.06 c
0.03/0.06 c # should presolving try to simplify inequalities
0.03/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.03/0.06 c constraints/linear/simplifyinequalities = TRUE
0.03/0.06 c
0.03/0.06 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.03/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.03/0.06 c constraints/indicator/addCouplingCons = TRUE
0.03/0.06 c
0.03/0.06 c # should presolving try to simplify knapsacks
0.03/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.03/0.06 c constraints/knapsack/simplifyinequalities = TRUE
0.03/0.06 c
0.03/0.06 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.03/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.03/0.06 c heuristics/undercover/freq = 0
0.03/0.06 c
0.03/0.06 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.03/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.03/0.06 c separating/rapidlearning/freq = 0
0.03/0.06 c
0.03/0.06 c -----------------------------------------------------------------------------------------------
0.03/0.06 c start solving
0.03/0.06 c
0.03/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.03/0.07 c 0.1s| 1 | 0 | 18 | - |1395k| 0 | 10 | 287 | 190 | 287 | 365 | 0 | 0 | 0 | 3.000000e+00 | -- | Inf
0.59/0.60 c 0.6s| 1 | 0 | 306 | - |1427k| 0 | 29 | 287 | 190 | 287 | 373 | 8 | 0 | 0 | 3.000000e+00 | -- | Inf
0.59/0.63 c 0.6s| 1 | 0 | 325 | - |1464k| 0 | 39 | 287 | 190 | 287 | 387 | 22 | 0 | 0 | 3.000000e+00 | -- | Inf
0.59/0.66 c 0.7s| 1 | 0 | 360 | - |1515k| 0 | 40 | 287 | 190 | 287 | 400 | 35 | 0 | 0 | 3.000000e+00 | -- | Inf
0.69/0.71 c 0.7s| 1 | 0 | 385 | - |1557k| 0 | 50 | 287 | 190 | 287 | 414 | 49 | 0 | 0 | 3.000000e+00 | -- | Inf
0.69/0.76 c 0.7s| 1 | 0 | 418 | - |1594k| 0 | 59 | 287 | 190 | 287 | 428 | 63 | 0 | 0 | 3.000000e+00 | -- | Inf
0.79/0.82 c 0.8s| 1 | 0 | 470 | - |1635k| 0 | 62 | 287 | 190 | 287 | 446 | 81 | 0 | 0 | 3.000000e+00 | -- | Inf
1.00/1.06 c 1.0s| 1 | 2 | 470 | - |1636k| 0 | 62 | 287 | 190 | 287 | 446 | 81 | 0 | 21 | 3.000000e+00 | -- | Inf
2.99/3.07 o 3
2.99/3.07 c * 3.1s| 301 | 0 | 3247 | 9.3 |1786k| 51 | - | 287 | 297 | 287 | 215 | 796 | 111 |1341 | 3.000000e+00 | 3.000000e+00 | 0.00%
2.99/3.07 c
2.99/3.07 c SCIP Status : problem is solved [optimal solution found]
2.99/3.07 c Solving Time (sec) : 3.06
2.99/3.07 c Solving Nodes : 301
2.99/3.07 c Primal Bound : +3.00000000000000e+00 (1 solutions)
2.99/3.07 c Dual Bound : +3.00000000000000e+00
2.99/3.07 c Gap : 0.00 %
2.99/3.07 s OPTIMUM FOUND
2.99/3.07 v x126 x125 -x124 -x123 -x122 -x121 -x120 x119 x118 -x117 -x116 -x115 x84 x83 x82 -x81 x80 x79 x114 x113 -x112 -x111 -x110 -x109
2.99/3.07 v x78 x77 -x76 x75 x74 x73 -x108 -x107 x106 -x105 -x104 x103 x72 x71 -x70 x69 -x68 x67 -x102 -x101 -x100 -x99 x98 -x97 x66 -x65
2.99/3.07 v -x64 x63 -x62 x61 x96 x95 -x94 x93 -x92 -x91 -x60 -x59 x58 -x57 x56 x55 -x90 -x89 -x88 -x87 -x86 x85 x54 x53 -x52 x51 -x50 x49
2.99/3.07 v x48 x47 -x46 x45 -x44 x43 -x42 x41 x40 x39 -x38 x37 x36 x35 x34 -x33 x32 x31 -x30 x29 -x28 -x27 -x26 x25 -x24 -x23 x22 x21
2.99/3.07 v x20 x19 x18 x17 x16 x15 x14 x13 x12 -x11 -x10 x9 x8 x7 -x6 -x5 -x4 -x3 x2 x1
2.99/3.07 c SCIP Status : problem is solved [optimal solution found]
2.99/3.07 c Solving Time : 3.06
2.99/3.07 c Original Problem :
2.99/3.07 c Problem name : HOME/instance-2702970-1278564363.opb
2.99/3.07 c Variables : 378 (378 binary, 0 integer, 0 implicit integer, 0 continuous)
2.99/3.07 c Constraints : 267 initial, 267 maximal
2.99/3.07 c Presolved Problem :
2.99/3.07 c Problem name : t_HOME/instance-2702970-1278564363.opb
2.99/3.07 c Variables : 287 (287 binary, 0 integer, 0 implicit integer, 0 continuous)
2.99/3.07 c Constraints : 190 initial, 297 maximal
2.99/3.07 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
2.99/3.07 c trivial : 0.00 0 0 0 0 0 0 0 0
2.99/3.07 c dualfix : 0.00 0 0 0 0 0 0 0 0
2.99/3.07 c boundshift : 0.00 0 0 0 0 0 0 0 0
2.99/3.07 c inttobinary : 0.00 0 0 0 0 0 0 0 0
2.99/3.07 c implics : 0.00 0 0 0 0 0 0 0 0
2.99/3.07 c probing : 0.01 0 0 0 0 0 0 0 0
2.99/3.07 c and : 0.01 14 70 0 0 0 70 0 70
2.99/3.07 c linear : 0.01 1 6 0 0 0 0 0 32
2.99/3.07 c logicor : 0.00 0 0 0 0 0 0 0 0
2.99/3.07 c root node : - 0 - - 0 - - - -
2.99/3.07 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
2.99/3.07 c integral : 0 0 0 285 0 1 47 0 0 498
2.99/3.07 c and : 175 601 1457 1 0 17 1124 734 0 0
2.99/3.07 c linear : 7 6 1440 1 0 54 527 0 0 0
2.99/3.07 c logicor : 8+ 6 290 1 0 1 46 0 0 0
2.99/3.07 c countsols : 0 0 0 1 0 0 0 0 0 0
2.99/3.07 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
2.99/3.07 c integral : 1.68 0.00 0.00 1.68 0.00
2.99/3.07 c and : 0.03 0.01 0.01 0.00 0.00
2.99/3.07 c linear : 0.02 0.00 0.02 0.00 0.00
2.99/3.07 c logicor : 0.00 0.00 0.00 0.00 0.00
2.99/3.07 c countsols : 0.00 0.00 0.00 0.00 0.00
2.99/3.07 c Propagators : Time Calls Cutoffs DomReds
2.99/3.07 c vbounds : 0.00 2 0 0
2.99/3.07 c rootredcost : 0.00 0 0 0
2.99/3.07 c pseudoobj : 0.00 1112 0 0
2.99/3.07 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.99/3.07 c propagation : 0.01 72 72 541 31.8 12 15.8 -
2.99/3.07 c infeasible LP : 0.00 1 1 5 20.8 0 0.0 0
2.99/3.07 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.99/3.07 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.99/3.07 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.99/3.07 c applied globally : - - - 107 15.9 - - -
2.99/3.07 c applied locally : - - - 4 39.2 - - -
2.99/3.07 c Separators : Time Calls Cutoffs DomReds Cuts Conss
2.99/3.07 c cut pool : 0.00 5 - - 24 - (maximal pool size: 188)
2.99/3.07 c redcost : 0.01 601 0 0 0 0
2.99/3.07 c impliedbounds : 0.00 6 0 0 22 0
2.99/3.07 c intobj : 0.00 0 0 0 0 0
2.99/3.07 c cgmip : 0.00 0 0 0 0 0
2.99/3.07 c gomory : 0.07 6 0 0 18 0
2.99/3.07 c strongcg : 0.05 6 0 0 167 0
2.99/3.07 c cmir : 0.03 6 0 0 72 0
2.99/3.07 c flowcover : 0.05 6 0 0 121 0
2.99/3.07 c clique : 0.00 1 0 0 0 0
2.99/3.07 c zerohalf : 0.00 0 0 0 0 0
2.99/3.07 c mcf : 0.00 1 0 0 0 0
2.99/3.07 c rapidlearning : 0.04 1 0 0 0 0
2.99/3.07 c Pricers : Time Calls Vars
2.99/3.07 c problem variables: 0.00 0 0
2.99/3.07 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
2.99/3.07 c relpscost : 1.68 284 1 47 0 0 498
2.99/3.07 c pscost : 0.00 0 0 0 0 0 0
2.99/3.07 c inference : 0.00 0 0 0 0 0 0
2.99/3.07 c mostinf : 0.00 0 0 0 0 0 0
2.99/3.07 c leastinf : 0.00 0 0 0 0 0 0
2.99/3.07 c fullstrong : 0.00 0 0 0 0 0 0
2.99/3.07 c allfullstrong : 0.00 0 0 0 0 0 0
2.99/3.07 c random : 0.00 0 0 0 0 0 0
2.99/3.07 c Primal Heuristics : Time Calls Found
2.99/3.07 c LP solutions : 0.00 - 1
2.99/3.07 c pseudo solutions : 0.00 - 0
2.99/3.07 c oneopt : 0.00 0 0
2.99/3.07 c crossover : 0.00 0 0
2.99/3.07 c rootsoldiving : 0.00 0 0
2.99/3.07 c linesearchdiving : 0.00 0 0
2.99/3.07 c guideddiving : 0.00 0 0
2.99/3.07 c intshifting : 0.00 0 0
2.99/3.07 c coefdiving : 0.01 1 0
2.99/3.07 c pscostdiving : 0.02 1 0
2.99/3.07 c fracdiving : 0.01 1 0
2.99/3.07 c veclendiving : 0.01 1 0
2.99/3.07 c feaspump : 0.01 1 0
2.99/3.07 c objpscostdiving : 0.01 1 0
2.99/3.07 c trivial : 0.00 2 0
2.99/3.07 c simplerounding : 0.00 0 0
2.99/3.07 c zirounding : 0.00 243 0
2.99/3.07 c rounding : 0.02 285 0
2.99/3.07 c shifting : 0.06 55 0
2.99/3.07 c twoopt : 0.00 0 0
2.99/3.07 c fixandinfer : 0.00 0 0
2.99/3.07 c intdiving : 0.00 0 0
2.99/3.07 c actconsdiving : 0.00 0 0
2.99/3.07 c octane : 0.00 0 0
2.99/3.07 c rens : 0.02 1 0
2.99/3.07 c rins : 0.00 0 0
2.99/3.07 c localbranching : 0.00 0 0
2.99/3.07 c mutation : 0.00 0 0
2.99/3.07 c dins : 0.00 0 0
2.99/3.07 c undercover : 0.48 1 0
2.99/3.07 c nlp : 0.00 0 0
2.99/3.07 c trysol : 0.00 0 0
2.99/3.07 c LP : Time Calls Iterations Iter/call Iter/sec
2.99/3.07 c primal LP : 0.01 0 0 0.00 -
2.99/3.07 c dual LP : 0.28 616 2598 4.22 9345.39
2.99/3.07 c lex dual LP : 0.00 0 0 0.00 -
2.99/3.07 c barrier LP : 0.00 0 0 0.00 -
2.99/3.07 c diving/probing LP: 0.04 130 649 4.99 15452.75
2.99/3.07 c strong branching : 1.67 1341 17894 13.34 10715.02
2.99/3.07 c (at root node) : - 21 1724 82.10 -
2.99/3.07 c conflict analysis: 0.00 0 0 0.00 -
2.99/3.07 c B&B Tree :
2.99/3.07 c number of runs : 1
2.99/3.07 c nodes : 301
2.99/3.07 c nodes (total) : 301
2.99/3.07 c nodes left : 0
2.99/3.07 c max depth : 51
2.99/3.07 c max depth (total): 51
2.99/3.07 c backtracks : 31 (10.3%)
2.99/3.07 c delayed cutoffs : 15
2.99/3.07 c repropagations : 91 (270 domain reductions, 11 cutoffs)
2.99/3.07 c avg switch length: 2.80
2.99/3.07 c switching time : 0.02
2.99/3.07 c Solution :
2.99/3.07 c Solutions found : 1 (1 improvements)
2.99/3.07 c First Solution : +3.00000000000000e+00 (in run 1, after 301 nodes, 3.06 seconds, depth 51, found by <relaxation>)
2.99/3.07 c Primal Bound : +3.00000000000000e+00 (in run 1, after 301 nodes, 3.06 seconds, depth 51, found by <relaxation>)
2.99/3.07 c Dual Bound : +3.00000000000000e+00
2.99/3.07 c Gap : 0.00 %
2.99/3.07 c Root Dual Bound : +3.00000000000000e+00
2.99/3.07 c Root Iterations : 470
2.99/3.08 c Time complete: 3.07.