0.00/0.00 c SCIP version 2.1.1.4 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.6.0.3] [GitHash: a3bf3a4-dirty]
0.00/0.00 c Copyright (c) 2002-2012 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-3717595-1338203106.wbo>
0.00/0.00 c original problem has 165 variables (165 bin, 0 int, 0 impl, 0 cont) and 121 constraints
0.00/0.00 c problem read in 0.00
0.00/0.00 c presolving:
0.00/0.01 c (round 1) 105 del vars, 55 del conss, 0 add conss, 50 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 10 impls, 10 clqs
0.00/0.01 c (round 2) 105 del vars, 55 del conss, 0 add conss, 105 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 110 impls, 10 clqs
0.00/0.01 c (round 3) 110 del vars, 60 del conss, 0 add conss, 105 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 110 impls, 10 clqs
0.00/0.01 c (round 4) 110 del vars, 60 del conss, 0 add conss, 105 chg bounds, 0 chg sides, 0 chg coeffs, 61 upgd conss, 110 impls, 10 clqs
0.00/0.02 c (0.0s) probing cycle finished: starting next cycle
0.00/0.02 c (round 5) 115 del vars, 60 del conss, 0 add conss, 105 chg bounds, 0 chg sides, 0 chg coeffs, 61 upgd conss, 420 impls, 10 clqs
0.00/0.02 c (0.0s) probing: 51/105 (48.6%) - 0 fixings, 5 aggregations, 155 implications, 0 bound changes
0.00/0.02 c (0.0s) probing aborted: 50/50 successive totally useless probings
0.00/0.02 c presolving (6 rounds):
0.00/0.02 c 115 deleted vars, 60 deleted constraints, 0 added constraints, 105 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.02 c 420 implications, 10 cliques
0.00/0.02 c presolved problem has 155 variables (105 bin, 0 int, 50 impl, 0 cont) and 166 constraints
0.00/0.02 c 1 constraints of type <knapsack>
0.00/0.02 c 60 constraints of type <setppc>
0.00/0.02 c 50 constraints of type <linear>
0.00/0.02 c 55 constraints of type <indicator>
0.00/0.02 c transformed objective value is always integral (scale: 1)
0.00/0.02 c Presolving Time: 0.02
0.00/0.02 c - non default parameters ----------------------------------------------------------------------
0.00/0.02 c # SCIP version 2.1.1.4
0.00/0.02 c
0.00/0.02 c # maximal time in seconds to run
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.02 c limits/time = 1797
0.00/0.02 c
0.00/0.02 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.02 c limits/memory = 13950
0.00/0.02 c
0.00/0.02 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.02 c # [type: int, range: [1,2], default: 1]
0.00/0.02 c timing/clocktype = 2
0.00/0.02 c
0.00/0.02 c # belongs reading time to solving time?
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c timing/reading = TRUE
0.00/0.02 c
0.00/0.02 c # force restart if we have a max FS instance and gap is 1?
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/indicator/forcerestart = TRUE
0.00/0.02 c
0.00/0.02 c # priority of branching rule <inference>
0.00/0.02 c # [type: int, range: [-536870912,536870911], default: 1000]
0.00/0.02 c branching/inference/priority = 1000000
0.00/0.02 c
0.00/0.02 c # frequency offset for calling primal heuristic <coefdiving>
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1]
0.00/0.02 c heuristics/coefdiving/freqofs = 0
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c heuristics/shiftandpropagate/freq = -1
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c heuristics/undercover/freq = -1
0.00/0.02 c
0.00/0.02 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c separating/rapidlearning/freq = 0
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <indrounding> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c heuristics/indrounding/freq = 1
0.00/0.02 c
0.00/0.02 c -----------------------------------------------------------------------------------------------
0.00/0.02 c start solving
0.00/0.02 c
0.00/0.02 o 328
0.00/0.02 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.02 c * 0.0s| 1 | 0 | 167 | - | 978k| 0 | - | 155 | 166 | 155 | 160 | 0 | 0 | 0 | 3.280000e+02 | 3.280000e+02 | 0.00%
0.00/0.02 c 0.0s| 1 | 0 | 167 | - | 978k| 0 | - | 155 | 166 | 155 | 160 | 0 | 0 | 0 | 3.280000e+02 | 3.280000e+02 | 0.00%
0.00/0.02 c
0.00/0.02 c SCIP Status : problem is solved [optimal solution found]
0.00/0.02 c Solving Time (sec) : 0.03
0.00/0.02 c Solving Nodes : 1
0.00/0.02 c Primal Bound : +3.28000000000000e+02 (1 solutions)
0.00/0.02 c Dual Bound : +3.28000000000000e+02
0.00/0.02 c Gap : 0.00 %
0.00/0.02 s OPTIMUM FOUND
0.00/0.02 v x60 -x59 -x58 x57 -x56 x55 x54 -x53 x52 -x51 -x50 -x49 -x48 -x47 x46 -x45 -x44 -x43 x42 -x41 -x40 -x39 -x38 -x37 x36 -x35 -x34
0.00/0.02 v -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
0.00/0.02 v -x6 -x5 -x4 -x3 -x2 x1
0.00/0.02 c SCIP Status : problem is solved [optimal solution found]
0.00/0.02 c Total Time : 0.03
0.00/0.02 c solving : 0.03
0.00/0.02 c presolving : 0.02 (included in solving)
0.00/0.02 c reading : 0.00 (included in solving)
0.00/0.02 c copying : 0.00 (0 times copied the problem)
0.00/0.02 c Original Problem :
0.00/0.02 c Problem name : HOME/instance-3717595-1338203106.wbo
0.00/0.02 c Variables : 165 (165 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.02 c Constraints : 121 initial, 121 maximal
0.00/0.02 c Objective sense : minimize
0.00/0.02 c Presolved Problem :
0.00/0.02 c Problem name : t_HOME/instance-3717595-1338203106.wbo
0.00/0.02 c Variables : 155 (105 binary, 0 integer, 50 implicit integer, 0 continuous)
0.00/0.02 c Constraints : 166 initial, 166 maximal
0.00/0.02 c Presolvers : ExecTime SetupTime FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.00/0.02 c domcol : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.02 c trivial : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.02 c dualfix : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.02 c boundshift : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.02 c inttobinary : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.02 c convertinttobin : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.02 c gateextraction : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.02 c implics : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.02 c components : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.02 c pseudoobj : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.02 c probing : 0.01 0.00 0 5 0 0 0 0 0 0 0
0.00/0.02 c knapsack : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.02 c setppc : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.02 c linear : 0.00 0.00 50 10 0 105 0 10 0 0 0
0.00/0.02 c indicator : 0.00 0.00 50 0 0 0 0 50 0 0 0
0.00/0.02 c root node : - - 0 - - 0 - - - - -
0.00/0.02 c Constraints : Number MaxNumber #Separate #Propagate #EnfoLP #EnfoPS #Check #ResProp Cutoffs DomReds Cuts Conss Children
0.00/0.02 c integral : 0 0 0 0 0 0 8 0 0 0 0 0 0
0.00/0.02 c knapsack : 1 1 0 376 0 0 6 0 0 0 0 0 0
0.00/0.02 c setppc : 60 60 0 376 0 0 4 0 0 0 0 0 0
0.00/0.02 c linear : 50 50 0 376 0 0 1 0 0 0 0 0 0
0.00/0.02 c indicator : 55 55 0 376 0 0 1 0 0 0 0 0 0
0.00/0.02 c countsols : 0 0 0 0 0 0 3 0 0 0 0 0 0
0.00/0.02 c Constraint Timings : TotalTime SetupTime Separate Propagate EnfoLP EnfoPS Check ResProp
0.00/0.02 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.02 c knapsack : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.02 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.02 c linear : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.02 c indicator : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.02 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.02 c Propagators : #Propagate #ResProp Cutoffs DomReds
0.00/0.02 c rootredcost : 0 0 0 0
0.00/0.02 c pseudoobj : 1 0 0 0
0.00/0.02 c vbounds : 1 0 0 0
0.00/0.02 c redcost : 0 0 0 0
0.00/0.02 c probing : 0 0 0 0
0.00/0.02 c Propagator Timings : TotalTime SetupTime Presolve Propagate ResProp
0.00/0.02 c rootredcost : 0.00 0.00 0.00 0.00 0.00
0.00/0.02 c pseudoobj : 0.00 0.00 0.00 0.00 0.00
0.00/0.02 c vbounds : 0.00 0.00 0.00 0.00 0.00
0.00/0.02 c redcost : 0.00 0.00 0.00 0.00 0.00
0.00/0.02 c probing : 0.01 0.00 0.01 0.00 0.00
0.00/0.02 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.00/0.02 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.00/0.02 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.02 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.02 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.02 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.00/0.02 c applied globally : - - - 0 0.0 - - -
0.00/0.02 c applied locally : - - - 0 0.0 - - -
0.00/0.02 c Separators : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss
0.00/0.02 c cut pool : 0.00 0 - - 0 - (maximal pool size: 51)
0.00/0.02 c clique : 0.00 0.00 0 0 0 0 0
0.00/0.02 c closecuts : 0.00 0.00 0 0 0 0 0
0.00/0.02 c cgmip : 0.00 0.00 0 0 0 0 0
0.00/0.02 c cmir : 0.00 0.00 0 0 0 0 0
0.00/0.02 c flowcover : 0.00 0.00 0 0 0 0 0
0.00/0.02 c gomory : 0.00 0.00 0 0 0 0 0
0.00/0.02 c impliedbounds : 0.00 0.00 0 0 0 0 0
0.00/0.02 c intobj : 0.00 0.00 0 0 0 0 0
0.00/0.02 c mcf : 0.00 0.00 0 0 0 0 0
0.00/0.02 c oddcycle : 0.00 0.00 0 0 0 0 0
0.00/0.02 c rapidlearning : 0.00 0.00 0 0 0 0 0
0.00/0.02 c strongcg : 0.00 0.00 0 0 0 0 0
0.00/0.02 c zerohalf : 0.00 0.00 0 0 0 0 0
0.00/0.02 c Pricers : ExecTime SetupTime Calls Vars
0.00/0.02 c problem variables: 0.00 - 0 0
0.00/0.02 c Branching Rules : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss Children
0.00/0.02 c pscost : 0.00 0.00 0 0 0 0 0 0
0.00/0.02 c inference : 0.00 0.00 0 0 0 0 0 0
0.00/0.02 c mostinf : 0.00 0.00 0 0 0 0 0 0
0.00/0.02 c leastinf : 0.00 0.00 0 0 0 0 0 0
0.00/0.02 c fullstrong : 0.00 0.00 0 0 0 0 0 0
0.00/0.02 c allfullstrong : 0.00 0.00 0 0 0 0 0 0
0.00/0.02 c random : 0.00 0.00 0 0 0 0 0 0
0.00/0.02 c relpscost : 0.00 0.00 0 0 0 0 0 0
0.00/0.02 c Primal Heuristics : ExecTime SetupTime Calls Found
0.00/0.02 c LP solutions : 0.00 - - 0
0.00/0.02 c pseudo solutions : 0.00 - - 0
0.00/0.02 c oneopt : 0.00 0.00 0 0
0.00/0.02 c smallcard : 0.00 0.00 0 0
0.00/0.02 c trivial : 0.00 0.00 2 0
0.00/0.02 c shiftandpropagate: 0.00 0.00 0 0
0.00/0.02 c simplerounding : 0.00 0.00 0 0
0.00/0.02 c zirounding : 0.00 0.00 0 0
0.00/0.02 c rounding : 0.00 0.00 0 0
0.00/0.02 c shifting : 0.00 0.00 0 0
0.00/0.02 c intshifting : 0.00 0.00 0 0
0.00/0.02 c twoopt : 0.00 0.00 0 0
0.00/0.02 c indtwoopt : 0.00 0.00 0 0
0.00/0.02 c indoneopt : 0.00 0.00 1 0
0.00/0.02 c fixandinfer : 0.00 0.00 0 0
0.00/0.02 c feaspump : 0.00 0.00 0 0
0.00/0.02 c clique : 0.00 0.00 0 0
0.00/0.02 c indrounding : 0.00 0.00 0 0
0.00/0.02 c indcoefdiving : 0.00 0.00 0 0
0.00/0.02 c coefdiving : 0.00 0.00 0 0
0.00/0.02 c pscostdiving : 0.00 0.00 0 0
0.00/0.02 c nlpdiving : 0.00 0.00 0 0
0.00/0.02 c fracdiving : 0.00 0.00 0 0
0.00/0.02 c veclendiving : 0.00 0.00 0 0
0.00/0.02 c intdiving : 0.00 0.00 0 0
0.00/0.02 c actconsdiving : 0.00 0.00 0 0
0.00/0.02 c objpscostdiving : 0.00 0.00 0 0
0.00/0.02 c rootsoldiving : 0.00 0.00 0 0
0.00/0.02 c linesearchdiving : 0.00 0.00 0 0
0.00/0.02 c guideddiving : 0.00 0.00 0 0
0.00/0.02 c octane : 0.00 0.00 0 0
0.00/0.02 c rens : 0.00 0.00 0 0
0.00/0.02 c rins : 0.00 0.00 0 0
0.00/0.02 c localbranching : 0.00 0.00 0 0
0.00/0.02 c mutation : 0.00 0.00 0 0
0.00/0.02 c crossover : 0.00 0.00 0 0
0.00/0.02 c dins : 0.00 0.00 0 0
0.00/0.02 c vbounds : 0.00 0.00 0 0
0.00/0.02 c undercover : 0.00 0.00 0 0
0.00/0.02 c subnlp : 0.00 0.00 0 0
0.00/0.02 c trysol : 0.00 0.00 0 0
0.00/0.02 c LP : Time Calls Iterations Iter/call Iter/sec Time-0-It Calls-0-It
0.00/0.02 c primal LP : 0.00 0 0 0.00 - 0.00 0
0.00/0.02 c dual LP : 0.00 1 167 167.00 - 0.00 0
0.00/0.02 c lex dual LP : 0.00 0 0 0.00 -
0.00/0.02 c barrier LP : 0.00 0 0 0.00 - 0.00 0
0.00/0.02 c diving/probing LP: 0.00 0 0 0.00 -
0.00/0.02 c strong branching : 0.00 0 0 0.00 -
0.00/0.02 c (at root node) : - 0 0 0.00 -
0.00/0.02 c conflict analysis: 0.00 0 0 0.00 -
0.00/0.02 c B&B Tree :
0.00/0.02 c number of runs : 1
0.00/0.02 c nodes : 1
0.00/0.02 c nodes (total) : 1
0.00/0.02 c nodes left : 0
0.00/0.02 c max depth : 0
0.00/0.02 c max depth (total): 0
0.00/0.02 c backtracks : 0 (0.0%)
0.00/0.02 c delayed cutoffs : 0
0.00/0.02 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.00/0.02 c avg switch length: 2.00
0.00/0.02 c switching time : 0.00
0.00/0.02 c Solution :
0.00/0.02 c Solutions found : 1 (1 improvements)
0.00/0.02 c First Solution : +3.28000000000000e+02 (in run 1, after 1 nodes, 0.03 seconds, depth 0, found by <relaxation>)
0.00/0.02 c Primal Bound : +3.28000000000000e+02 (in run 1, after 1 nodes, 0.03 seconds, depth 0, found by <relaxation>)
0.00/0.02 c Dual Bound : +3.28000000000000e+02
0.00/0.02 c Gap : 0.00 %
0.00/0.02 c Root Dual Bound : +3.28000000000000e+02
0.00/0.02 c Root Iterations : 167
0.00/0.03 c Time complete: 0.03.