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-3717587-1338203093.wbo>
0.00/0.00 c original problem has 76 variables (76 bin, 0 int, 0 impl, 0 cont) and 65 constraints
0.00/0.00 c problem read in 0.00
0.00/0.00 c presolving:
0.00/0.01 c (round 1) 104 del vars, 52 del conss, 0 add conss, 52 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 4 clqs
0.00/0.01 c (round 2) 104 del vars, 52 del conss, 0 add conss, 60 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 104 impls, 4 clqs
0.00/0.01 c (round 3) 104 del vars, 52 del conss, 0 add conss, 60 chg bounds, 0 chg sides, 0 chg coeffs, 57 upgd conss, 104 impls, 4 clqs
0.00/0.01 c (0.0s) probing cycle finished: starting next cycle
0.00/0.01 c (round 4) 119 del vars, 52 del conss, 0 add conss, 60 chg bounds, 0 chg sides, 0 chg coeffs, 57 upgd conss, 217 impls, 0 clqs
0.00/0.01 c (round 5) 119 del vars, 114 del conss, 0 add conss, 60 chg bounds, 0 chg sides, 0 chg coeffs, 57 upgd conss, 217 impls, 0 clqs
0.00/0.01 c (round 6) 132 del vars, 122 del conss, 0 add conss, 60 chg bounds, 0 chg sides, 0 chg coeffs, 57 upgd conss, 217 impls, 0 clqs
0.00/0.01 c presolving (7 rounds):
0.00/0.01 c 136 deleted vars, 125 deleted constraints, 0 added constraints, 60 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.01 c 217 implications, 0 cliques
0.00/0.01 c presolved problem has 0 variables (0 bin, 0 int, 0 impl, 0 cont) and 0 constraints
0.00/0.01 c transformed objective value is always integral (scale: 1)
0.00/0.01 c Presolving Time: 0.01
0.00/0.01 c - non default parameters ----------------------------------------------------------------------
0.00/0.01 c # SCIP version 2.1.1.4
0.00/0.01 c
0.00/0.01 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01 c conflict/interconss = 0
0.00/0.01 c
0.00/0.01 c # should binary conflicts be preferred?
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c conflict/preferbinary = TRUE
0.00/0.01 c
0.00/0.01 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01 c constraints/agelimit = 1
0.00/0.01 c
0.00/0.01 c # should enforcement of pseudo solution be disabled?
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c constraints/disableenfops = TRUE
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 = 1797
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 = 13950
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 # belongs reading time to solving time?
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c timing/reading = TRUE
0.00/0.01 c
0.00/0.01 c # force restart if we have a max FS instance and gap is 1?
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c constraints/indicator/forcerestart = TRUE
0.00/0.01 c
0.00/0.01 c # priority of branching rule <inference>
0.00/0.01 c # [type: int, range: [-536870912,536870911], default: 1000]
0.00/0.01 c branching/inference/priority = 1000000
0.00/0.01 c
0.00/0.01 c # frequency offset for calling primal heuristic <coefdiving>
0.00/0.01 c # [type: int, range: [0,2147483647], default: 1]
0.00/0.01 c heuristics/coefdiving/freqofs = 0
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01 c heuristics/shiftandpropagate/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01 c heuristics/undercover/freq = -1
0.00/0.01 c
0.00/0.01 c # frequency for calling primal heuristic <indrounding> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01 c heuristics/indrounding/freq = 1
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 o 0
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 | - | 416k| 0 | - | 0 | 0 | 0 | 0 | 0 | 0 | 0 | -- | 0.000000e+00 | Inf
0.00/0.01 c 0.0s| 1 | 0 | 0 | - | 415k| 0 | - | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0.000000e+00 | 0.000000e+00 | 0.00%
0.00/0.01 c
0.00/0.01 c SCIP Status : problem is solved [optimal solution found]
0.00/0.01 c Solving Time (sec) : 0.01
0.00/0.01 c Solving Nodes : 1
0.00/0.01 c Primal Bound : +0.00000000000000e+00 (1 solutions)
0.00/0.01 c Dual Bound : +0.00000000000000e+00
0.00/0.01 c Gap : 0.00 %
0.00/0.01 s OPTIMUM FOUND
0.00/0.01 v -x16 -x15 x14 -x13 x12 -x11 -x10 -x9 -x8 -x7 -x6 x5 -x4 x3 -x2 -x1
0.00/0.01 c SCIP Status : problem is solved [optimal solution found]
0.00/0.01 c Total Time : 0.01
0.00/0.01 c solving : 0.01
0.00/0.01 c presolving : 0.01 (included in solving)
0.00/0.01 c reading : 0.00 (included in solving)
0.00/0.01 c copying : 0.00 (0 times copied the problem)
0.00/0.01 c Original Problem :
0.00/0.01 c Problem name : HOME/instance-3717587-1338203093.wbo
0.00/0.01 c Variables : 76 (76 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.01 c Constraints : 65 initial, 65 maximal
0.00/0.01 c Objective sense : minimize
0.00/0.01 c Presolved Problem :
0.00/0.01 c Problem name : t_HOME/instance-3717587-1338203093.wbo
0.00/0.01 c Variables : 0 (0 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.01 c Constraints : 0 initial, 0 maximal
0.00/0.01 c Presolvers : ExecTime SetupTime FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.00/0.01 c domcol : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.01 c trivial : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.01 c dualfix : 0.00 0.00 9 0 0 0 0 0 0 0 0
0.00/0.01 c boundshift : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.01 c inttobinary : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.01 c convertinttobin : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.01 c gateextraction : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.01 c implics : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.01 c components : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.01 c pseudoobj : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.01 c probing : 0.00 0.00 8 7 0 0 0 0 0 0 0
0.00/0.01 c knapsack : 0.00 0.00 0 0 0 0 0 1 0 0 0
0.00/0.01 c setppc : 0.00 0.00 0 0 0 0 0 56 0 0 0
0.00/0.01 c linear : 0.00 0.00 52 0 0 60 0 8 0 0 0
0.00/0.01 c indicator : 0.00 0.00 60 0 0 0 0 60 0 0 0
0.00/0.01 c root node : - - 0 - - 0 - - - - -
0.00/0.01 c Constraints : Number MaxNumber #Separate #Propagate #EnfoLP #EnfoPS #Check #ResProp Cutoffs DomReds Cuts Conss Children
0.00/0.01 c integral : 0 0 0 0 0 0 3 0 0 0 0 0 0
0.00/0.01 c countsols : 0 0 0 0 0 0 3 0 0 0 0 0 0
0.00/0.01 c Constraint Timings : TotalTime SetupTime Separate Propagate EnfoLP EnfoPS Check ResProp
0.00/0.01 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.01 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.01 c Propagators : #Propagate #ResProp Cutoffs DomReds
0.00/0.01 c pseudoobj : 0 0 0 0
0.00/0.01 c rootredcost : 0 0 0 0
0.00/0.01 c vbounds : 0 0 0 0
0.00/0.01 c redcost : 0 0 0 0
0.00/0.01 c probing : 0 0 0 0
0.00/0.01 c Propagator Timings : TotalTime SetupTime Presolve Propagate ResProp
0.00/0.01 c pseudoobj : 0.00 0.00 0.00 0.00 0.00
0.00/0.01 c rootredcost : 0.00 0.00 0.00 0.00 0.00
0.00/0.01 c vbounds : 0.00 0.00 0.00 0.00 0.00
0.00/0.01 c redcost : 0.00 0.00 0.00 0.00 0.00
0.00/0.01 c probing : 0.00 0.00 0.00 0.00 0.00
0.00/0.01 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.00/0.01 c propagation : 0.00 3 0 0 0.0 0 0.0 -
0.00/0.01 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.01 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.01 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.01 c pseudo solution : 0.00 1 0 0 0.0 0 0.0 -
0.00/0.01 c applied globally : - - - 0 0.0 - - -
0.00/0.01 c applied locally : - - - 0 0.0 - - -
0.00/0.01 c Separators : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss
0.00/0.01 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.00/0.01 c clique : 0.00 0.00 0 0 0 0 0
0.00/0.01 c closecuts : 0.00 0.00 0 0 0 0 0
0.00/0.01 c cgmip : 0.00 0.00 0 0 0 0 0
0.00/0.01 c cmir : 0.00 0.00 0 0 0 0 0
0.00/0.01 c flowcover : 0.00 0.00 0 0 0 0 0
0.00/0.01 c gomory : 0.00 0.00 0 0 0 0 0
0.00/0.01 c impliedbounds : 0.00 0.00 0 0 0 0 0
0.00/0.01 c intobj : 0.00 0.00 0 0 0 0 0
0.00/0.01 c mcf : 0.00 0.00 0 0 0 0 0
0.00/0.01 c oddcycle : 0.00 0.00 0 0 0 0 0
0.00/0.01 c rapidlearning : 0.00 0.00 0 0 0 0 0
0.00/0.01 c strongcg : 0.00 0.00 0 0 0 0 0
0.00/0.01 c zerohalf : 0.00 0.00 0 0 0 0 0
0.00/0.01 c Pricers : ExecTime SetupTime Calls Vars
0.00/0.01 c problem variables: 0.00 - 0 0
0.00/0.01 c Branching Rules : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss Children
0.00/0.01 c pscost : 0.00 0.00 0 0 0 0 0 0
0.00/0.01 c inference : 0.00 0.00 0 0 0 0 0 0
0.00/0.01 c mostinf : 0.00 0.00 0 0 0 0 0 0
0.00/0.01 c leastinf : 0.00 0.00 0 0 0 0 0 0
0.00/0.01 c fullstrong : 0.00 0.00 0 0 0 0 0 0
0.00/0.01 c allfullstrong : 0.00 0.00 0 0 0 0 0 0
0.00/0.01 c random : 0.00 0.00 0 0 0 0 0 0
0.00/0.01 c relpscost : 0.00 0.00 0 0 0 0 0 0
0.00/0.01 c Primal Heuristics : ExecTime SetupTime Calls Found
0.00/0.01 c LP solutions : 0.00 - - 0
0.00/0.01 c pseudo solutions : 0.00 - - 0
0.00/0.01 c smallcard : 0.00 0.00 0 0
0.00/0.01 c trivial : 0.00 0.00 2 1
0.00/0.01 c shiftandpropagate: 0.00 0.00 0 0
0.00/0.01 c simplerounding : 0.00 0.00 0 0
0.00/0.01 c zirounding : 0.00 0.00 0 0
0.00/0.01 c rounding : 0.00 0.00 0 0
0.00/0.01 c shifting : 0.00 0.00 0 0
0.00/0.01 c intshifting : 0.00 0.00 0 0
0.00/0.01 c oneopt : 0.00 0.00 0 0
0.00/0.01 c twoopt : 0.00 0.00 0 0
0.00/0.01 c indtwoopt : 0.00 0.00 0 0
0.00/0.01 c indoneopt : 0.00 0.00 0 0
0.00/0.01 c fixandinfer : 0.00 0.00 0 0
0.00/0.01 c feaspump : 0.00 0.00 0 0
0.00/0.01 c clique : 0.00 0.00 0 0
0.00/0.01 c indrounding : 0.00 0.00 0 0
0.00/0.01 c indcoefdiving : 0.00 0.00 0 0
0.00/0.01 c coefdiving : 0.00 0.00 0 0
0.00/0.01 c pscostdiving : 0.00 0.00 0 0
0.00/0.01 c nlpdiving : 0.00 0.00 0 0
0.00/0.01 c fracdiving : 0.00 0.00 0 0
0.00/0.01 c veclendiving : 0.00 0.00 0 0
0.00/0.01 c intdiving : 0.00 0.00 0 0
0.00/0.01 c actconsdiving : 0.00 0.00 0 0
0.00/0.01 c objpscostdiving : 0.00 0.00 0 0
0.00/0.01 c rootsoldiving : 0.00 0.00 0 0
0.00/0.01 c linesearchdiving : 0.00 0.00 0 0
0.00/0.01 c guideddiving : 0.00 0.00 0 0
0.00/0.01 c octane : 0.00 0.00 0 0
0.00/0.01 c rens : 0.00 0.00 0 0
0.00/0.01 c rins : 0.00 0.00 0 0
0.00/0.01 c localbranching : 0.00 0.00 0 0
0.00/0.01 c mutation : 0.00 0.00 0 0
0.00/0.01 c crossover : 0.00 0.00 0 0
0.00/0.01 c dins : 0.00 0.00 0 0
0.00/0.01 c vbounds : 0.00 0.00 0 0
0.00/0.01 c undercover : 0.00 0.00 0 0
0.00/0.01 c subnlp : 0.00 0.00 0 0
0.00/0.01 c trysol : 0.00 0.00 0 0
0.00/0.01 c LP : Time Calls Iterations Iter/call Iter/sec Time-0-It Calls-0-It
0.00/0.01 c primal LP : 0.00 0 0 0.00 - 0.00 0
0.00/0.01 c dual LP : 0.00 0 0 0.00 - 0.00 0
0.00/0.01 c lex dual LP : 0.00 0 0 0.00 -
0.00/0.01 c barrier LP : 0.00 0 0 0.00 - 0.00 0
0.00/0.01 c diving/probing LP: 0.00 0 0 0.00 -
0.00/0.01 c strong branching : 0.00 0 0 0.00 -
0.00/0.01 c (at root node) : - 0 0 0.00 -
0.00/0.01 c conflict analysis: 0.00 0 0 0.00 -
0.00/0.01 c B&B Tree :
0.00/0.01 c number of runs : 1
0.00/0.01 c nodes : 1
0.00/0.01 c nodes (total) : 1
0.00/0.01 c nodes left : 0
0.00/0.01 c max depth : 0
0.00/0.01 c max depth (total): 0
0.00/0.01 c backtracks : 0 (0.0%)
0.00/0.01 c delayed cutoffs : 0
0.00/0.01 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.00/0.01 c avg switch length: 2.00
0.00/0.01 c switching time : 0.00
0.00/0.01 c Solution :
0.00/0.01 c Solutions found : 1 (1 improvements)
0.00/0.01 c First Solution : +0.00000000000000e+00 (in run 1, after 1 nodes, 0.01 seconds, depth 0, found by <trivial>)
0.00/0.01 c Primal Bound : +0.00000000000000e+00 (in run 1, after 1 nodes, 0.01 seconds, depth 0, found by <trivial>)
0.00/0.01 c Dual Bound : +0.00000000000000e+00
0.00/0.01 c Gap : 0.00 %
0.00/0.01 c Root Dual Bound : +0.00000000000000e+00
0.00/0.01 c Root Iterations : 0
0.00/0.02 c Time complete: 0.01.