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-3717764-1338198853.wbo>
0.00/0.00 c original problem has 131 variables (131 bin, 0 int, 0 impl, 0 cont) and 22 constraints
0.00/0.00 c problem read in 0.00
0.00/0.00 o 826
0.00/0.00 c feasible solution found by trivial heuristic, objective value 8.260000e+02
0.00/0.00 c presolving:
0.00/0.00 c (round 1) 0 del vars, 1 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs
0.00/0.00 c (round 2) 0 del vars, 1 del conss, 0 add conss, 21 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs
0.00/0.01 c (0.0s) probing: 51/131 (38.9%) - 0 fixings, 0 aggregations, 0 implications, 0 bound changes
0.00/0.01 c (0.0s) probing aborted: 50/50 successive totally useless probings
0.00/0.01 c presolving (3 rounds):
0.00/0.01 c 0 deleted vars, 1 deleted constraints, 0 added constraints, 21 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.01 c 21 implications, 0 cliques
0.00/0.01 c presolved problem has 152 variables (131 bin, 0 int, 21 impl, 0 cont) and 42 constraints
0.00/0.01 c 21 constraints of type <linear>
0.00/0.01 c 21 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 2.1.1.4
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 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 # 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 453
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 6 0.0s| 1 | 0 | 0 | - | 481k| 0 | - | 152 | 42 | 0 | 0 | 0 | 0 | 0 | -- | 4.530000e+02 | Inf
0.00/0.01 o 4
0.00/0.01 c 6 0.0s| 1 | 0 | 0 | - | 483k| 0 | - | 152 | 42 | 0 | 0 | 0 | 0 | 0 | -- | 4.000000e+00 | Inf
0.00/0.01 c Forcing restart, since 19 binary variables among 21 have been fixed.
0.00/0.01 o 1
0.00/0.01 c * 0.0s| 1 | 0 | 105 | - | 543k| 0 | - | 152 | 22 | 152 | 22 | 0 | 0 | 0 | 1.000000e+00 | 1.000000e+00 | 0.00%
0.00/0.01 c 0.0s| 1 | 0 | 105 | - | 543k| 0 | - | 152 | 22 | 152 | 22 | 0 | 0 | 0 | 1.000000e+00 | 1.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 : +1.00000000000000e+00 (6 solutions)
0.00/0.01 c Dual Bound : +1.00000000000000e+00
0.00/0.01 c Gap : 0.00 %
0.00/0.01 s OPTIMUM FOUND
0.00/0.01 v -x110 -x109 -x108 -x107 x106 -x105 -x104 -x103 -x102 -x101 -x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92 x91 -x90 -x89 -x88 -x87
0.00/0.01 v -x86 -x85 -x84 -x83 x82 -x81 -x80 -x79 -x78 -x77 -x76 -x75 -x74 x73 -x72 -x71 -x70 -x69 -x68 -x67 -x66 -x65 x64 -x63 -x62 -x61
0.00/0.01 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
0.00/0.01 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
0.00/0.01 v 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.00 (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-3717764-1338198853.wbo
0.00/0.01 c Variables : 131 (131 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.01 c Constraints : 22 initial, 22 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-3717764-1338198853.wbo
0.00/0.01 c Variables : 152 (131 binary, 0 integer, 21 implicit integer, 0 continuous)
0.00/0.01 c Constraints : 42 initial, 42 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 0 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 0 0 0 0 0 0 0 0 0
0.00/0.01 c linear : 0.00 0.00 0 0 0 21 0 1 0 0 0
0.00/0.01 c indicator : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.01 c root node : - - 40 - - 40 - - - - -
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 21 0 0 0 0 0 0
0.00/0.01 c linear : 21 21 0 98 0 0 18 0 0 0 0 0 0
0.00/0.01 c indicator : 21 21 0 98 0 0 16 0 0 20 0 0 0
0.00/0.01 c countsols : 0 0 0 0 0 0 19 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 linear : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.01 c indicator : 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 rootredcost : 0 0 0 0
0.00/0.01 c pseudoobj : 2 0 0 20
0.00/0.01 c vbounds : 1 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 rootredcost : 0.00 0.00 0.00 0.00 0.00
0.00/0.01 c pseudoobj : 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 0 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 0 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: 1)
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 oneopt : 0.00 0.00 0 0
0.00/0.01 c smallcard : 0.00 0.00 0 0
0.00/0.01 c trivial : 0.00 0.00 2 2
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 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 1 2
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 1 1
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 1 105 105.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 : 6 (4 improvements)
0.00/0.01 c First Solution : +8.26000000000000e+02 (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
0.00/0.01 c Primal Bound : +1.00000000000000e+00 (in run 1, after 1 nodes, 0.01 seconds, depth 0, found by <relaxation>)
0.00/0.01 c Dual Bound : +1.00000000000000e+00
0.00/0.01 c Gap : 0.00 %
0.00/0.01 c Root Dual Bound : +1.00000000000000e+00
0.00/0.01 c Root Iterations : 105
0.00/0.01 c Time complete: 0.
runsolver Copyright (C) 2010-2011 Olivier ROUSSEL
This is runsolver version 3.3.1 (svn: 989)
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
command line: BIN/runsolver --timestamp -w /tmp/evaluation-result-3717764-1338198853/watcher-3717764-1338198853 -o /tmp/evaluation-result-3717764-1338198853/solver-3717764-1338198853 -C 1800 -W 1900 -M 15500 HOME/scip-2.1.1.4fix.linux.x86_64.gnu.opt.spx -f HOME/instance-3717764-1338198853.wbo -t 1800 -m 15500
running on 4 cores: 1,3,5,7
Enforcing CPUTime limit (soft limit, will send SIGTERM then SIGKILL): 1800 seconds
Enforcing CPUTime limit (hard limit, will send SIGXCPU): 1830 seconds
Enforcing wall clock limit (soft limit, will send SIGTERM then SIGKILL): 1900 seconds
Enforcing VSIZE limit (soft limit, will send SIGTERM then SIGKILL): 15872000 KiB
Enforcing VSIZE limit (hard limit, stack expansion will fail with SIGSEGV, brk() and mmap() will return ENOMEM): 15923200 KiB
Current StackSize limit: 10240 KiB
[startup+0 s]
/proc/loadavg: 2.29 2.08 2.02 3/176 2290
/proc/meminfo: memFree=27619468/32873648 swapFree=7104/7104
[pid=2290] ppid=2288 vsize=11184 CPUtime=0 cores=1,3,5,7
/proc/2290/stat : 2290 (scip-2.1.1.4fix) R 2288 2290 32675 0 -1 4202496 1527 0 0 0 0 0 0 0 20 0 1 0 286010775 11452416 1482 33554432000 4194304 10173063 140737031887408 140734916076456 8846909 0 0 4096 16384 0 0 0 17 1 0 0 0 0 0
/proc/2290/statm: 3053 1492 466 1460 0 1584 0
Solver just ended. Dumping a history of the last processes samples
Child status: 0
Real time (s): 0.015705
CPU time (s): 0.012997
CPU user time (s): 0.007998
CPU system time (s): 0.004999
CPU usage (%): 82.7568
Max. virtual memory (cumulated for all children) (KiB): 0
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 0.007998
system time used= 0.004999
maximum resident set size= 11336
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 3154
page faults= 0
swaps= 0
block input operations= 0
block output operations= 0
messages sent= 0
messages received= 0
signals received= 0
voluntary context switches= 3
involuntary context switches= 2
runsolver used 0.002999 second user time and 0.004999 second system time
The end