0.00/0.00 c SCIP version 2.0.1.4 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.4]
0.00/0.00 c Copyright (c) 2002-2011 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-3453286-1307093814.opb>
0.00/0.00 c original problem has 50 variables (50 bin, 0 int, 0 impl, 0 cont) and 100 constraints
0.00/0.00 c problem read
0.00/0.00 c presolving settings loaded
0.00/0.01 o 50
0.00/0.01 c feasible solution found by trivial heuristic, objective value 5.000000e+01
0.00/0.01 c presolving:
0.00/0.01 c (round 1) 0 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 100 upgd conss, 0 impls, 0 clqs
0.00/0.01 c presolving (2 rounds):
0.00/0.01 c 0 deleted vars, 0 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.01 c 0 implications, 0 cliques
0.00/0.01 c presolved problem has 50 variables (50 bin, 0 int, 0 impl, 0 cont) and 100 constraints
0.00/0.01 c 100 constraints of type <logicor>
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.0.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 # 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 = 1800
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 # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01 c lp/solvefreq = 0
0.00/0.01 c
0.00/0.01 c # LP pricing strategy ('l'pi default, 'a'uto, 'f'ull pricing, 'p'artial, 's'teepest edge pricing, 'q'uickstart steepest edge pricing, 'd'evex pricing)
0.00/0.01 c # [type: char, range: {lafpsqd}, default: l]
0.00/0.01 c lp/pricing = a
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 # 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 # priority of node selection rule <dfs> in standard mode
0.00/0.01 c # [type: int, range: [-536870912,536870911], default: 0]
0.00/0.01 c nodeselection/dfs/stdpriority = 1000000
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.03 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.03 c t 0.0s| 1 | 0 | 400 | - | 694k| 0 | 50 | 50 | 100 | 50 | 100 | 0 | 0 | 0 | 1.250000e+00 | 5.000000e+01 |3900.00%
0.00/0.03 o 49
0.00/0.03 c R 0.0s| 1 | 0 | 400 | - | 697k| 0 | 50 | 50 | 100 | 50 | 100 | 0 | 0 | 0 | 1.250000e+00 | 4.900000e+01 |3820.00%
0.00/0.03 o 48
0.00/0.03 c s 0.0s| 1 | 0 | 400 | - | 698k| 0 | 50 | 50 | 100 | 50 | 100 | 0 | 0 | 0 | 1.250000e+00 | 4.800000e+01 |3740.00%
0.00/0.03 o 4
0.00/0.03 c z 0.0s| 1 | 0 | 400 | - | 700k| 0 | 50 | 50 | 100 | 50 | 100 | 0 | 0 | 0 | 1.250000e+00 | 4.000000e+00 | 220.00%
0.00/0.04 c 0.0s| 1 | 0 | 400 | - | 700k| 0 | 50 | 50 | 100 | 50 | 100 | 0 | 0 | 0 | 1.250000e+00 | 4.000000e+00 | 220.00%
0.19/0.23 c 0.2s| 1 | 2 | 400 | - | 700k| 0 | 50 | 50 | 100 | 50 | 100 | 0 | 0 | 20 | 1.250000e+00 | 4.000000e+00 | 220.00%
0.19/0.23 o 3
0.19/0.23 c * 0.2s| 8 | 1 | 400 | 0.0 | 706k| 5 | - | 50 | 100 | 0 | 0 | 0 | 0 | 20 | 1.256345e+00 | 3.000000e+00 | 138.79%
0.19/0.25 o 2
0.19/0.25 c * 0.3s| 274 | 0 | 400 | 0.0 | 760k| 47 | - | 50 | 102 | 0 | 0 | 0 | 133 | 20 | 2.000000e+00 | 2.000000e+00 | 0.00%
0.19/0.25 c
0.19/0.25 c SCIP Status : problem is solved [optimal solution found]
0.19/0.25 c Solving Time (sec) : 0.25
0.19/0.25 c Solving Nodes : 274
0.19/0.25 c Primal Bound : +2.00000000000000e+00 (6 solutions)
0.19/0.25 c Dual Bound : +2.00000000000000e+00
0.19/0.25 c Gap : 0.00 %
0.19/0.25 s OPTIMUM FOUND
0.19/0.25 v -x50 -x49 -x48 -x47 -x46 -x45 -x44 -x43 -x42 -x41 -x40 -x39 -x38 -x37 -x36 -x35 -x34 -x33 -x32 -x31 -x30 -x29 -x28 x27 -x26 -x25
0.19/0.25 v -x24 -x23 -x22 -x21 x20 -x19 -x18 -x17 -x16 -x15 -x14 -x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 -x1
0.19/0.25 c SCIP Status : problem is solved [optimal solution found]
0.19/0.25 c Total Time : 0.25
0.19/0.25 c solving : 0.25
0.19/0.25 c presolving : 0.00 (included in solving)
0.19/0.25 c reading : 0.00 (included in solving)
0.19/0.25 c Original Problem :
0.19/0.25 c Problem name : HOME/instance-3453286-1307093814.opb
0.19/0.25 c Variables : 50 (50 binary, 0 integer, 0 implicit integer, 0 continuous)
0.19/0.25 c Constraints : 100 initial, 100 maximal
0.19/0.25 c Presolved Problem :
0.19/0.25 c Problem name : t_HOME/instance-3453286-1307093814.opb
0.19/0.25 c Variables : 50 (50 binary, 0 integer, 0 implicit integer, 0 continuous)
0.19/0.25 c Constraints : 100 initial, 144 maximal
0.19/0.25 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.19/0.25 c trivial : 0.00 0 0 0 0 0 0 0 0 0
0.19/0.25 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
0.19/0.25 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
0.19/0.25 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
0.19/0.25 c implics : 0.00 0 0 0 0 0 0 0 0 0
0.19/0.25 c probing : 0.00 0 0 0 0 0 0 0 0 0
0.19/0.25 c linear : 0.00 0 0 0 0 0 0 0 0 0
0.19/0.25 c logicor : 0.00 0 0 0 0 0 0 0 0 0
0.19/0.25 c root node : - 4 - - 4 - - - - -
0.19/0.25 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
0.19/0.25 c integral : 0 0 0 1 0 9 0 0 0 0 0 2
0.19/0.25 c logicor : 100+ 1 328 0 0 4 2384 135 136 0 0 0
0.19/0.25 c countsols : 0 0 0 0 2 7 0 0 0 0 0 0
0.19/0.25 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
0.19/0.25 c integral : 0.19 0.00 0.00 0.19 0.00 0.00 0.00
0.19/0.25 c logicor : 0.01 0.00 0.00 0.00 0.00 0.00 0.00
0.19/0.25 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.19/0.25 c Propagators : #Propagate #Resprop Cutoffs DomReds
0.19/0.25 c vbounds : 0 0 0 0
0.19/0.25 c rootredcost : 1 0 0 0
0.19/0.25 c pseudoobj : 3095 2815 0 3498
0.19/0.25 c Propagator Timings : TotalTime Propagate Resprop
0.19/0.25 c vbounds : 0.00 0.00 0.00
0.19/0.25 c rootredcost : 0.00 0.00 0.00
0.19/0.25 c pseudoobj : 0.01 0.00 0.00
0.19/0.25 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.19/0.25 c propagation : 0.00 135 133 133 2.0 0 0.0 -
0.19/0.25 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.19/0.25 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.19/0.25 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.19/0.25 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.19/0.25 c applied globally : - - - 133 2.0 - - -
0.19/0.25 c applied locally : - - - 0 0.0 - - -
0.19/0.25 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.19/0.25 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.19/0.25 c redcost : 0.00 2 0 0 0 0
0.19/0.25 c impliedbounds : 0.00 2 0 0 0 0
0.19/0.25 c intobj : 0.00 0 0 0 0 0
0.19/0.25 c gomory : 0.00 2 0 0 0 0
0.19/0.25 c cgmip : 0.00 0 0 0 0 0
0.19/0.25 c closecuts : 0.00 0 0 0 0 0
0.19/0.25 c strongcg : 0.00 2 0 0 0 0
0.19/0.25 c cmir : 0.00 2 0 0 0 0
0.19/0.25 c flowcover : 0.00 2 0 0 0 0
0.19/0.25 c clique : 0.00 1 0 0 0 0
0.19/0.25 c zerohalf : 0.00 0 0 0 0 0
0.19/0.25 c mcf : 0.00 1 0 0 0 0
0.19/0.25 c oddcycle : 0.00 0 0 0 0 0
0.19/0.25 c rapidlearning : 0.00 0 0 0 0 0
0.19/0.25 c Pricers : Time Calls Vars
0.19/0.25 c problem variables: 0.00 0 0
0.19/0.25 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.19/0.25 c relpscost : 0.19 1 0 0 0 0 2
0.19/0.25 c pscost : 0.00 0 0 0 0 0 0
0.19/0.25 c inference : 0.00 139 0 0 0 0 278
0.19/0.25 c mostinf : 0.00 0 0 0 0 0 0
0.19/0.25 c leastinf : 0.00 0 0 0 0 0 0
0.19/0.25 c fullstrong : 0.00 0 0 0 0 0 0
0.19/0.25 c allfullstrong : 0.00 0 0 0 0 0 0
0.19/0.25 c random : 0.00 0 0 0 0 0 0
0.19/0.25 c Primal Heuristics : Time Calls Found
0.19/0.25 c LP solutions : 0.00 - 0
0.19/0.25 c pseudo solutions : 0.00 - 2
0.19/0.25 c crossover : 0.00 0 0
0.19/0.25 c oneopt : 0.00 1 0
0.19/0.25 c trivial : 0.00 2 1
0.19/0.25 c shiftandpropagate: 0.00 0 0
0.19/0.25 c simplerounding : 0.00 1 0
0.19/0.25 c zirounding : 0.00 1 1
0.19/0.25 c rounding : 0.00 1 1
0.19/0.25 c shifting : 0.00 1 1
0.19/0.25 c intshifting : 0.00 0 0
0.19/0.25 c twoopt : 0.00 0 0
0.19/0.25 c fixandinfer : 0.00 0 0
0.19/0.25 c feaspump : 0.00 0 0
0.19/0.25 c clique : 0.00 0 0
0.19/0.25 c coefdiving : 0.00 0 0
0.19/0.25 c pscostdiving : 0.00 0 0
0.19/0.25 c fracdiving : 0.00 0 0
0.19/0.25 c veclendiving : 0.00 0 0
0.19/0.25 c intdiving : 0.00 0 0
0.19/0.25 c actconsdiving : 0.00 0 0
0.19/0.25 c objpscostdiving : 0.00 0 0
0.19/0.25 c rootsoldiving : 0.00 0 0
0.19/0.25 c linesearchdiving : 0.00 0 0
0.19/0.25 c guideddiving : 0.00 0 0
0.19/0.25 c octane : 0.00 0 0
0.19/0.25 c rens : 0.00 0 0
0.19/0.25 c rins : 0.00 0 0
0.19/0.25 c localbranching : 0.00 0 0
0.19/0.25 c mutation : 0.00 0 0
0.19/0.25 c dins : 0.00 0 0
0.19/0.25 c vbounds : 0.00 0 0
0.19/0.25 c undercover : 0.00 0 0
0.19/0.25 c subnlp : 0.00 0 0
0.19/0.25 c trysol : 0.00 0 0
0.19/0.25 c LP : Time Calls Iterations Iter/call Iter/sec
0.19/0.25 c primal LP : 0.00 0 0 0.00 -
0.19/0.25 c dual LP : 0.02 1 400 400.00 24815.44
0.19/0.25 c lex dual LP : 0.00 0 0 0.00 -
0.19/0.25 c barrier LP : 0.00 0 0 0.00 -
0.19/0.25 c diving/probing LP: 0.00 0 0 0.00 -
0.19/0.25 c strong branching : 0.19 20 4238 211.90 21881.23
0.19/0.25 c (at root node) : - 20 4238 211.90 -
0.19/0.25 c conflict analysis: 0.00 0 0 0.00 -
0.19/0.25 c B&B Tree :
0.19/0.25 c number of runs : 1
0.19/0.25 c nodes : 274
0.19/0.25 c nodes (total) : 274
0.19/0.25 c nodes left : 0
0.19/0.25 c max depth : 47
0.19/0.25 c max depth (total): 47
0.19/0.25 c backtracks : 4 (1.5%)
0.19/0.25 c delayed cutoffs : 3
0.19/0.25 c repropagations : 2682 (146 domain reductions, 3 cutoffs)
0.19/0.25 c avg switch length: 20.61
0.19/0.25 c switching time : 0.00
0.19/0.25 c Solution :
0.19/0.25 c Solutions found : 6 (6 improvements)
0.19/0.25 c First Solution : +5.00000000000000e+01 (in run 1, after 0 nodes, 0.01 seconds, depth 0, found by <trivial>)
0.19/0.25 c Primal Bound : +2.00000000000000e+00 (in run 1, after 274 nodes, 0.25 seconds, depth 8, found by <relaxation>)
0.19/0.25 c Dual Bound : +2.00000000000000e+00
0.19/0.25 c Gap : 0.00 %
0.19/0.25 c Root Dual Bound : +1.25000000000000e+00
0.19/0.25 c Root Iterations : 400
0.19/0.25 c Time complete: 0.25.
runsolver Copyright (C) 2010-2011 Olivier ROUSSEL
This is runsolver version 3.3.0 (svn: 977)
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-3453286-1307093814/watcher-3453286-1307093814 -o /tmp/evaluation-result-3453286-1307093814/solver-3453286-1307093814 -C 1800 -W 1900 -M 15500 HOME/scip-2.0.1.4.linux.x86_64.gnu.opt.spx -f HOME/instance-3453286-1307093814.opb -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: 1.77 2.00 1.99 2/572 20890
/proc/meminfo: memFree=31911460/32950928 swapFree=43925852/67111528
[pid=20890] ppid=20888 vsize=18156 CPUtime=0 cores=1,3,5,7
/proc/20890/stat : 20890 (scip-2.0.1.4.li) R 20888 20890 20770 0 -1 4202496 3635 0 0 0 0 0 0 0 25 0 1 0 820980220 18591744 3328 33554432000 4194304 9128323 140733689165920 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/20890/statm: 4539 3328 619 1205 0 3330 0
[startup+0.110145 s]
/proc/loadavg: 1.77 2.00 1.99 2/572 20890
/proc/meminfo: memFree=31911460/32950928 swapFree=43925852/67111528
[pid=20890] ppid=20888 vsize=19420 CPUtime=0.1 cores=1,3,5,7
/proc/20890/stat : 20890 (scip-2.0.1.4.li) R 20888 20890 20770 0 -1 4202496 4735 0 0 0 9 1 0 0 25 0 1 0 820980220 19886080 3818 33554432000 4194304 9128323 140733689165920 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/20890/statm: 4855 3818 684 1205 0 3646 0
Current children cumulated CPU time (s) 0.1
Current children cumulated vsize (KiB) 19420
[startup+0.201128 s]
/proc/loadavg: 1.77 2.00 1.99 2/572 20890
/proc/meminfo: memFree=31911460/32950928 swapFree=43925852/67111528
[pid=20890] ppid=20888 vsize=19420 CPUtime=0.19 cores=1,3,5,7
/proc/20890/stat : 20890 (scip-2.0.1.4.li) R 20888 20890 20770 0 -1 4202496 4735 0 0 0 18 1 0 0 25 0 1 0 820980220 19886080 3818 33554432000 4194304 9128323 140733689165920 18446744073709551615 7357560 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/20890/statm: 4855 3818 684 1205 0 3646 0
Current children cumulated CPU time (s) 0.19
Current children cumulated vsize (KiB) 19420
Solver just ended. Dumping a history of the last processes samples
Child status: 0
Real time (s): 0.25947
CPU time (s): 0.258959
CPU user time (s): 0.230964
CPU system time (s): 0.027995
CPU usage (%): 99.8031
Max. virtual memory (cumulated for all children) (KiB): 19420
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 0.230964
system time used= 0.027995
maximum resident set size= 0
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 4759
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= 5
involuntary context switches= 4
runsolver used 0.004999 second user time and 0.018997 second system time
The end