0.00/0.00 c SCIP version 1.2.1.3 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: Clp 1.11.1]
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-2705331-1278578356.wbo>
0.00/0.00 c original problem has 331 variables (199 bin, 0 int, 132 impl, 0 cont) and 265 constraints
0.00/0.00 c problem read
0.00/0.00 c presolving settings loaded
0.00/0.00 o 6581
0.00/0.00 c feasible solution found by trivial heuristic, objective value 6.581000e+03
0.00/0.00 c presolving:
0.00/0.00 c (round 1) 0 del vars, 1 del conss, 0 chg bounds, 6 chg sides, 12 chg coeffs, 0 upgd conss, 0 impls, 0 clqs
0.00/0.00 c (round 2) 0 del vars, 1 del conss, 132 chg bounds, 6 chg sides, 12 chg coeffs, 0 upgd conss, 0 impls, 0 clqs
0.00/0.01 c (round 3) 0 del vars, 1 del conss, 132 chg bounds, 6 chg sides, 12 chg coeffs, 1 upgd conss, 252 impls, 0 clqs
0.00/0.01 c (0.0s) probing: 101/199 (50.8%) - 0 fixings, 0 aggregations, 0 implications, 0 bound changes
0.00/0.01 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.00/0.01 c presolving (4 rounds):
0.00/0.01 c 0 deleted vars, 1 deleted constraints, 132 tightened bounds, 0 added holes, 6 changed sides, 12 changed coefficients
0.00/0.01 c 256 implications, 0 cliques
0.00/0.01 c presolved problem has 331 variables (199 bin, 0 int, 132 impl, 0 cont) and 264 constraints
0.00/0.01 c 1 constraints of type <varbound>
0.00/0.01 c 131 constraints of type <linear>
0.00/0.01 c 132 constraints of type <indicator>
0.00/0.01 c transformed objective value is always integral (scale: 1)
0.00/0.01 c Presolving Time: 0.00
0.00/0.01 c - non default parameters ----------------------------------------------------------------------
0.00/0.01 c # SCIP version 1.2.1.3
0.00/0.01 c
0.00/0.01 c # frequency for displaying node information lines
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.01 c display/freq = 10000
0.00/0.01 c
0.00/0.01 c # maximal time in seconds to run
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.01 c limits/time = 1790
0.00/0.01 c
0.00/0.01 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.01 c limits/memory = 3420
0.00/0.01 c
0.00/0.01 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.01 c # [type: int, range: [1,2], default: 1]
0.00/0.01 c timing/clocktype = 2
0.00/0.01 c
0.00/0.01 c # should presolving try to simplify inequalities
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c constraints/linear/simplifyinequalities = TRUE
0.00/0.01 c
0.00/0.01 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c constraints/indicator/addCouplingCons = TRUE
0.00/0.01 c
0.00/0.01 c # should presolving try to simplify knapsacks
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.01 c
0.00/0.01 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01 c separating/rapidlearning/freq = 0
0.00/0.01 c
0.00/0.01 c -----------------------------------------------------------------------------------------------
0.00/0.01 c start solving
0.00/0.01 c
0.00/0.01 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.01 c t 0.0s| 1 | 0 | 0 | - |1200k| 0 | 0 | 331 | 264 | 331 | 0 | 0 | 0 | 0 | 0.000000e+00 | 6.581000e+03 | Inf
0.01/0.03 c 0.0s| 1 | 0 | 19 | - |1217k| 0 | 5 | 331 | 264 | 331 | 19 | 19 | 0 | 0 | 0.000000e+00 | 6.581000e+03 | Inf
0.01/0.03 c 0.0s| 1 | 0 | 42 | - |1229k| 0 | 5 | 331 | 264 | 331 | 42 | 42 | 0 | 0 | 0.000000e+00 | 6.581000e+03 | Inf
0.01/0.03 c 0.0s| 1 | 0 | 49 | - |1248k| 0 | 5 | 331 | 264 | 331 | 48 | 48 | 0 | 0 | 0.000000e+00 | 6.581000e+03 | Inf
0.01/0.03 c 0.0s| 1 | 0 | 55 | - |1264k| 0 | 5 | 331 | 264 | 331 | 54 | 54 | 0 | 0 | 0.000000e+00 | 6.581000e+03 | Inf
0.01/0.03 c 0.0s| 1 | 0 | 58 | - |1277k| 0 | 3 | 331 | 264 | 331 | 56 | 56 | 0 | 0 | 0.000000e+00 | 6.581000e+03 | Inf
0.01/0.03 c 0.0s| 1 | 0 | 62 | - |1285k| 0 | 4 | 331 | 264 | 331 | 59 | 59 | 0 | 0 | 0.000000e+00 | 6.581000e+03 | Inf
0.01/0.03 o 6495
0.01/0.03 c y 0.0s| 1 | 0 | 62 | - |1290k| 0 | 4 | 331 | 264 | 331 | 59 | 59 | 0 | 0 | 0.000000e+00 | 6.495000e+03 | Inf
0.01/0.03 c 0.0s| 1 | 0 | 65 | - |1299k| 0 | 5 | 331 | 264 | 331 | 61 | 61 | 0 | 0 | 0.000000e+00 | 6.495000e+03 | Inf
0.01/0.04 c 0.0s| 1 | 0 | 72 | - |1306k| 0 | 5 | 331 | 264 | 331 | 63 | 63 | 0 | 0 | 0.000000e+00 | 6.495000e+03 | Inf
0.01/0.04 c 0.0s| 1 | 0 | 75 | - |1310k| 0 | 5 | 331 | 264 | 331 | 65 | 65 | 0 | 0 | 0.000000e+00 | 6.495000e+03 | Inf
0.01/0.04 c 0.0s| 1 | 0 | 77 | - |1339k| 0 | 0 | 331 | 264 | 331 | 66 | 66 | 0 | 0 | 0.000000e+00 | 6.495000e+03 | Inf
0.01/0.04 c 0.0s| 1 | 2 | 77 | - |1340k| 0 | 0 | 331 | 264 | 331 | 66 | 66 | 0 | 0 | 0.000000e+00 | 6.495000e+03 | Inf
0.59/0.68 o 96
0.59/0.68 c * 0.7s| 3049 | 1352 | 1230 | 0.4 |2760k| 122 | - | 331 | 267 | 331 | 67 | 165 | 3 | 165 | 0.000000e+00 | 9.600000e+01 | Inf
0.59/0.69 o 26
0.59/0.69 c * 0.7s| 3050 | 337 | 1230 | 0.4 |2266k| 122 | - | 331 | 267 | 331 | 67 | 165 | 3 | 165 | 0.000000e+00 | 2.600000e+01 | Inf
0.69/0.70 o 21
0.69/0.70 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.69/0.70 c * 0.7s| 3107 | 303 | 1305 | 0.4 |2129k| 122 | - | 331 | 159 | 331 | 62 | 174 | 5 | 176 | 0.000000e+00 | 2.100000e+01 | Inf
0.69/0.71 o 12
0.69/0.71 c * 0.7s| 3143 | 174 | 1311 | 0.4 |1996k| 122 | - | 331 | 157 | 331 | 62 | 179 | 7 | 176 | 0.000000e+00 | 1.200000e+01 | Inf
0.69/0.71 o 2
0.69/0.71 c * 0.7s| 3144 | 39 | 1313 | 0.4 |1889k| 122 | - | 331 | 157 | 331 | 62 | 179 | 7 | 176 | 0.000000e+00 | 2.000000e+00 | Inf
0.69/0.71 c
0.69/0.71 c SCIP Status : problem is solved [optimal solution found]
0.69/0.71 c Solving Time (sec) : 0.71
0.69/0.71 c Solving Nodes : 3151
0.69/0.71 c Primal Bound : +2.00000000000000e+00 (114 solutions)
0.69/0.71 c Dual Bound : +2.00000000000000e+00
0.69/0.71 c Gap : 0.00 %
0.69/0.71 s OPTIMUM FOUND
0.69/0.71 v x67 -x66 x65 x64 -x63 -x62 -x61 -x60 x59 -x58 x57 -x56 x55 -x54 -x53 x52 x51 x50 x49 x48 x47 -x46 x45 x44 -x43 -x42 -x41 -x40 x39
0.69/0.71 v -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 -x13
0.69/0.71 v x12 -x11 x10 x9 x8 -x7 x6 -x5 -x4 x3 -x2 -x1
0.69/0.71 c SCIP Status : problem is solved [optimal solution found]
0.69/0.71 c Solving Time : 0.71
0.69/0.71 c Original Problem :
0.69/0.71 c Problem name : HOME/instance-2705331-1278578356.wbo
0.69/0.71 c Variables : 331 (199 binary, 0 integer, 132 implicit integer, 0 continuous)
0.69/0.71 c Constraints : 265 initial, 265 maximal
0.69/0.71 c Presolved Problem :
0.69/0.71 c Problem name : t_HOME/instance-2705331-1278578356.wbo
0.69/0.71 c Variables : 331 (199 binary, 0 integer, 132 implicit integer, 0 continuous)
0.69/0.71 c Constraints : 264 initial, 267 maximal
0.69/0.71 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.69/0.71 c trivial : 0.00 0 0 0 0 0 0 0 0
0.69/0.71 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.69/0.71 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.69/0.71 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.69/0.71 c implics : 0.00 0 0 0 0 0 0 0 0
0.69/0.71 c probing : 0.00 0 0 0 0 0 0 0 0
0.69/0.71 c varbound : 0.00 0 0 0 0 0 0 0 0
0.69/0.71 c linear : 0.00 0 0 0 132 0 1 6 12
0.69/0.71 c indicator : 0.00 0 0 0 0 0 0 0 0
0.69/0.71 c logicor : 0.00 0 0 0 0 0 0 0 0
0.69/0.71 c bounddisjunction : 0.00 0 0 0 0 0 0 0 0
0.69/0.71 c root node : - 280 - - 280 - - - -
0.69/0.71 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.69/0.71 c integral : 0 0 0 3245 0 0 1 0 0 644
0.69/0.71 c varbound : 1 11 278 51 0 0 16 1 0 0
0.69/0.71 c linear : 131 11 4667 2921 0 11 772 162 0 0
0.69/0.71 c indicator : 132 0 4657 2922 0 0 2316 0 0 0
0.69/0.71 c logicor : 0+ 0 20 0 0 0 10 0 0 0
0.69/0.71 c bounddisjunction : 0+ 0 107 0 0 0 11 0 0 0
0.69/0.71 c countsols : 0 0 0 2821 0 0 0 0 0 0
0.69/0.71 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.69/0.71 c integral : 0.04 0.00 0.00 0.04 0.00
0.69/0.71 c varbound : 0.00 0.00 0.00 0.00 0.00
0.69/0.71 c linear : 0.04 0.00 0.01 0.03 0.00
0.69/0.71 c indicator : 0.03 0.00 0.01 0.02 0.00
0.69/0.71 c logicor : 0.00 0.00 0.00 0.00 0.00
0.69/0.71 c bounddisjunction : 0.00 0.00 0.00 0.00 0.00
0.69/0.71 c countsols : 0.00 0.00 0.00 0.00 0.00
0.69/0.71 c Propagators : Time Calls Cutoffs DomReds
0.69/0.71 c vbounds : 0.00 472 0 284
0.69/0.71 c rootredcost : 0.00 6 0 131
0.69/0.71 c pseudoobj : 0.02 4468 0 74
0.69/0.71 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.69/0.71 c propagation : 0.00 11 10 12 3.2 1 3.0 -
0.69/0.71 c infeasible LP : 0.00 1 1 1 4.0 0 0.0 0
0.69/0.71 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.69/0.71 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.69/0.71 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.69/0.71 c applied globally : - - - 13 3.2 - - -
0.69/0.71 c applied locally : - - - 0 0.0 - - -
0.69/0.71 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.69/0.71 c cut pool : 0.00 9 - - 49 - (maximal pool size: 153)
0.69/0.71 c redcost : 0.03 3256 0 3 0 0
0.69/0.71 c impliedbounds : 0.00 9 0 0 0 0
0.69/0.71 c intobj : 0.00 0 0 0 0 0
0.69/0.71 c cgmip : 0.00 0 0 0 0 0
0.69/0.71 c gomory : 0.00 9 0 0 61 0
0.69/0.71 c strongcg : 0.00 9 0 0 86 0
0.69/0.71 c cmir : 0.00 9 0 0 32 0
0.69/0.71 c flowcover : 0.00 9 0 0 57 0
0.69/0.71 c clique : 0.00 1 0 0 0 0
0.69/0.71 c zerohalf : 0.00 0 0 0 0 0
0.69/0.71 c mcf : 0.00 1 0 0 0 0
0.69/0.71 c rapidlearning : 0.02 1 0 0 0 0
0.69/0.71 c Pricers : Time Calls Vars
0.69/0.71 c problem variables: 0.00 0 0
0.69/0.71 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.69/0.71 c relpscost : 0.03 323 0 1 0 0 644
0.69/0.71 c pscost : 0.00 0 0 0 0 0 0
0.69/0.71 c inference : 0.06 2816 0 0 0 0 5633
0.69/0.71 c mostinf : 0.00 0 0 0 0 0 0
0.69/0.71 c leastinf : 0.00 0 0 0 0 0 0
0.69/0.71 c fullstrong : 0.00 0 0 0 0 0 0
0.69/0.71 c allfullstrong : 0.00 0 0 0 0 0 0
0.69/0.71 c random : 0.00 0 0 0 0 0 0
0.69/0.71 c Primal Heuristics : Time Calls Found
0.69/0.71 c LP solutions : 0.00 - 5
0.69/0.71 c pseudo solutions : 0.00 - 0
0.69/0.71 c feaspump : 0.00 0 0
0.69/0.71 c intshifting : 0.00 0 0
0.69/0.71 c oneopt : 0.00 4 0
0.69/0.71 c crossover : 0.02 4 0
0.69/0.71 c veclendiving : 0.01 65 0
0.69/0.71 c pscostdiving : 0.01 66 0
0.69/0.71 c fracdiving : 0.01 66 0
0.69/0.71 c linesearchdiving : 0.01 66 0
0.69/0.71 c guideddiving : 0.01 66 0
0.69/0.71 c coefdiving : 0.01 66 0
0.69/0.71 c objpscostdiving : 0.01 63 0
0.69/0.71 c rootsoldiving : 0.01 64 0
0.69/0.71 c trivial : 0.00 2 2
0.69/0.71 c simplerounding : 0.00 331 0
0.69/0.71 c zirounding : 0.01 321 0
0.69/0.71 c rounding : 0.01 211 0
0.69/0.71 c shifting : 0.00 45 0
0.69/0.71 c twoopt : 0.00 0 0
0.69/0.71 c fixandinfer : 0.00 0 0
0.69/0.71 c intdiving : 0.00 0 0
0.69/0.71 c actconsdiving : 0.00 0 0
0.69/0.71 c octane : 0.00 0 0
0.69/0.71 c rens : 0.00 0 0
0.69/0.71 c rins : 0.00 0 0
0.69/0.71 c localbranching : 0.00 0 0
0.69/0.71 c mutation : 0.00 0 0
0.69/0.71 c dins : 0.00 0 0
0.69/0.71 c undercover : 0.00 0 0
0.69/0.71 c nlp : 0.00 0 0
0.69/0.71 c trysol : 0.01 285 107
0.69/0.71 c LP : Time Calls Iterations Iter/call Iter/sec
0.69/0.71 c primal LP : 0.00 0 0 0.00 -
0.69/0.71 c dual LP : 0.20 593 1327 2.24 6799.93
0.69/0.71 c lex dual LP : 0.00 0 0 0.00 -
0.69/0.71 c barrier LP : 0.00 0 0 0.00 -
0.69/0.71 c diving/probing LP: 0.00 8 12 1.50 -
0.69/0.71 c strong branching : 0.03 191 758 3.97 23110.46
0.69/0.71 c (at root node) : - 0 0 0.00 -
0.69/0.71 c conflict analysis: 0.00 0 0 0.00 -
0.69/0.71 c B&B Tree :
0.69/0.71 c number of runs : 1
0.69/0.71 c nodes : 3151
0.69/0.71 c nodes (total) : 3151
0.69/0.71 c nodes left : 0
0.69/0.71 c max depth : 122
0.69/0.71 c max depth (total): 122
0.69/0.71 c backtracks : 77 (2.4%)
0.69/0.71 c delayed cutoffs : 42
0.69/0.71 c repropagations : 220 (328 domain reductions, 4 cutoffs)
0.69/0.71 c avg switch length: 2.25
0.69/0.71 c switching time : 0.03
0.69/0.71 c Solution :
0.69/0.71 c Solutions found : 114 (7 improvements)
0.69/0.71 c First Solution : +6.58100000000000e+03 (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
0.69/0.71 c Primal Bound : +2.00000000000000e+00 (in run 1, after 3144 nodes, 0.70 seconds, depth 76, found by <relaxation>)
0.69/0.71 c Dual Bound : +2.00000000000000e+00
0.69/0.71 c Gap : 0.00 %
0.69/0.71 c Root Dual Bound : +0.00000000000000e+00
0.69/0.71 c Root Iterations : 77
0.69/0.72 c Time complete: 0.71.