0.00/0.01 c SCIP version 1.2.1.3 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2]
0.00/0.01 c Copyright (c) 2002-2010 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB)
0.00/0.01 c
0.00/0.01 c user parameter file <scip.set> not found - using default parameters
0.00/0.01 c reading problem <HOME/instance-3734382-1338699950.opb>
0.00/0.01 c original problem has 63 variables (63 bin, 0 int, 0 impl, 0 cont) and 45 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.01 o 63
0.00/0.01 c feasible solution found by trivial heuristic, objective value 6.300000e+01
0.00/0.01 c presolving:
0.00/0.01 c (round 1) 1 del vars, 12 del conss, 1 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 2 impls, 0 clqs
0.00/0.01 c (round 2) 2 del vars, 17 del conss, 1 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 2 impls, 0 clqs
0.00/0.01 c (round 3) 3 del vars, 24 del conss, 1 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 2 impls, 0 clqs
0.00/0.01 c (round 4) 4 del vars, 26 del conss, 1 chg bounds, 2 chg sides, 0 chg coeffs, 0 upgd conss, 2 impls, 0 clqs
0.00/0.01 c (round 5) 4 del vars, 26 del conss, 1 chg bounds, 2 chg sides, 0 chg coeffs, 19 upgd conss, 2 impls, 0 clqs
0.00/0.01 c presolving (6 rounds):
0.00/0.01 c 4 deleted vars, 26 deleted constraints, 1 tightened bounds, 0 added holes, 2 changed sides, 0 changed coefficients
0.00/0.01 c 2 implications, 0 cliques
0.00/0.01 c presolved problem has 59 variables (59 bin, 0 int, 0 impl, 0 cont) and 19 constraints
0.00/0.01 c 19 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 1.2.1.3
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 = 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 = 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 # 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.01 o 61
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 | - | 304k| 0 | - | 59 | 19 | 0 | 0 | 0 | 0 | 0 | -- | 6.100000e+01 | Inf
0.00/0.01 o 8
0.00/0.01 c b 0.0s| 1 | 0 | 0 | - | 351k| 0 | - | 59 | 19 | 59 | 19 | 0 | 0 | 0 | -- | 8.000000e+00 | Inf
0.00/0.01 c 0.0s| 1 | 0 | 21 | - | 350k| 0 | 15 | 59 | 19 | 59 | 19 | 0 | 0 | 0 | 4.500000e+00 | 8.000000e+00 | 77.78%
0.00/0.01 o 7
0.00/0.01 c R 0.0s| 1 | 0 | 21 | - | 353k| 0 | 15 | 59 | 19 | 59 | 19 | 0 | 0 | 0 | 4.500000e+00 | 7.000000e+00 | 55.56%
0.00/0.01 o 5
0.00/0.01 c b 0.0s| 1 | 0 | 21 | - | 355k| 0 | - | 59 | 19 | 59 | 19 | 0 | 0 | 0 | 4.500000e+00 | 5.000000e+00 | 11.11%
0.00/0.01 c 0.0s| 1 | 0 | 21 | - | 354k| 0 | - | 59 | 19 | 59 | 19 | 0 | 0 | 0 | 5.000000e+00 | 5.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 : +5.00000000000000e+00 (7 solutions)
0.00/0.01 c Dual Bound : +5.00000000000000e+00
0.00/0.01 c Gap : 0.00 %
0.00/0.01 s OPTIMUM FOUND
0.00/0.01 v -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 -x38
0.00/0.01 v 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 -x12
0.00/0.01 v -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 Solving Time : 0.01
0.00/0.01 c Original Problem :
0.00/0.01 c Problem name : HOME/instance-3734382-1338699950.opb
0.00/0.01 c Variables : 63 (63 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.01 c Constraints : 45 initial, 45 maximal
0.00/0.01 c Presolved Problem :
0.00/0.01 c Problem name : t_HOME/instance-3734382-1338699950.opb
0.00/0.01 c Variables : 59 (59 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.01 c Constraints : 19 initial, 19 maximal
0.00/0.01 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.00/0.01 c trivial : 0.00 0 0 0 0 0 0 0 0
0.00/0.01 c dualfix : 0.00 2 0 0 0 0 0 0 0
0.00/0.01 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.00/0.01 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.00/0.01 c implics : 0.00 0 0 0 0 0 0 0 0
0.00/0.01 c probing : 0.00 0 0 0 0 0 0 0 0
0.00/0.01 c linear : 0.00 1 1 0 1 0 26 2 0
0.00/0.01 c logicor : 0.00 0 0 0 0 0 0 0 0
0.00/0.01 c root node : - 0 - - 0 - - - -
0.00/0.01 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.00/0.01 c integral : 0 0 0 0 0 0 0 0 0 0
0.00/0.01 c logicor : 19 0 34 0 0 0 0 0 0 0
0.00/0.01 c countsols : 0 0 0 0 0 0 0 0 0 0
0.00/0.01 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.00/0.01 c integral : 0.00 0.00 0.00 0.00 0.00
0.00/0.01 c logicor : 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.01 c Propagators : Time Calls Cutoffs DomReds
0.00/0.01 c vbounds : 0.00 2 0 0
0.00/0.01 c rootredcost : 0.00 0 0 0
0.00/0.01 c pseudoobj : 0.00 2 0 0
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 : Time 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 redcost : 0.00 0 0 0 0 0
0.00/0.01 c impliedbounds : 0.00 0 0 0 0 0
0.00/0.01 c intobj : 0.00 0 0 0 0 0
0.00/0.01 c cgmip : 0.00 0 0 0 0 0
0.00/0.01 c gomory : 0.00 0 0 0 0 0
0.00/0.01 c strongcg : 0.00 0 0 0 0 0
0.00/0.01 c cmir : 0.00 0 0 0 0 0
0.00/0.01 c flowcover : 0.00 0 0 0 0 0
0.00/0.01 c clique : 0.00 0 0 0 0 0
0.00/0.01 c zerohalf : 0.00 0 0 0 0 0
0.00/0.01 c mcf : 0.00 0 0 0 0 0
0.00/0.01 c rapidlearning : 0.00 0 0 0 0 0
0.00/0.01 c Pricers : Time Calls Vars
0.00/0.01 c problem variables: 0.00 0 0
0.00/0.01 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.00/0.01 c pscost : 0.00 0 0 0 0 0 0
0.00/0.01 c inference : 0.00 0 0 0 0 0 0
0.00/0.01 c mostinf : 0.00 0 0 0 0 0 0
0.00/0.01 c leastinf : 0.00 0 0 0 0 0 0
0.00/0.01 c fullstrong : 0.00 0 0 0 0 0 0
0.00/0.01 c allfullstrong : 0.00 0 0 0 0 0 0
0.00/0.01 c random : 0.00 0 0 0 0 0 0
0.00/0.01 c relpscost : 0.00 0 0 0 0 0 0
0.00/0.01 c Primal Heuristics : Time 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 feaspump : 0.00 0 0
0.00/0.01 c trivial : 0.00 2 3
0.00/0.01 c simplerounding : 0.00 1 1
0.00/0.01 c zirounding : 0.00 0 0
0.00/0.01 c rounding : 0.00 1 1
0.00/0.01 c shifting : 0.00 1 0
0.00/0.01 c intshifting : 0.00 0 0
0.00/0.01 c oneopt : 0.00 2 2
0.00/0.01 c twoopt : 0.00 0 0
0.00/0.01 c fixandinfer : 0.00 0 0
0.00/0.01 c coefdiving : 0.00 0 0
0.00/0.01 c pscostdiving : 0.00 0 0
0.00/0.01 c fracdiving : 0.00 0 0
0.00/0.01 c veclendiving : 0.00 0 0
0.00/0.01 c intdiving : 0.00 0 0
0.00/0.01 c actconsdiving : 0.00 0 0
0.00/0.01 c objpscostdiving : 0.00 0 0
0.00/0.01 c rootsoldiving : 0.00 0 0
0.00/0.01 c linesearchdiving : 0.00 0 0
0.00/0.01 c guideddiving : 0.00 0 0
0.00/0.01 c octane : 0.00 0 0
0.00/0.01 c rens : 0.00 0 0
0.00/0.01 c rins : 0.00 0 0
0.00/0.01 c localbranching : 0.00 0 0
0.00/0.01 c mutation : 0.00 0 0
0.00/0.01 c crossover : 0.00 0 0
0.00/0.01 c dins : 0.00 0 0
0.00/0.01 c undercover : 0.00 0 0
0.00/0.01 c nlp : 0.00 0 0
0.00/0.01 c trysol : 0.00 0 0
0.00/0.01 c LP : Time Calls Iterations Iter/call Iter/sec
0.00/0.01 c primal LP : 0.00 0 0 0.00 -
0.00/0.01 c dual LP : 0.00 1 21 21.00 -
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.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.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 : 7 (5 improvements)
0.00/0.02 c First Solution : +6.30000000000000e+01 (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
0.00/0.02 c Primal Bound : +5.00000000000000e+00 (in run 1, after 1 nodes, 0.01 seconds, depth 0, found by <oneopt>)
0.00/0.02 c Dual Bound : +5.00000000000000e+00
0.00/0.02 c Gap : 0.00 %
0.00/0.02 c Root Dual Bound : +5.00000000000000e+00
0.00/0.02 c Root Iterations : 21
0.00/0.02 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-3734382-1338699950/watcher-3734382-1338699950 -o /tmp/evaluation-result-3734382-1338699950/solver-3734382-1338699950 -C 1800 -W 1900 -M 15500 HOME/pbscip.linux.x86_64.gnu.opt.spx -f HOME/instance-3734382-1338699950.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
[startup+0 s]
/proc/loadavg: 2.00 2.00 2.00 3/175 24180
/proc/meminfo: memFree=28374876/32873648 swapFree=7388/7388
[pid=24180] ppid=24178 vsize=11812 CPUtime=0 cores=1,3,5,7
/proc/24180/stat : 24180 (runsolver) R 24178 21664 21664 0 -1 4202560 40 0 0 0 0 0 0 0 20 0 1 0 336119534 12095488 49 33554432000 4194304 5436572 140737481145568 140737481141568 4268383 0 0 4096 24578 0 0 0 17 7 0 0 0 0 0
/proc/24180/statm: 2953 49 29 304 0 2645 0
[startup+0.0190569 s]
/proc/loadavg: 2.00 2.00 2.00 3/175 24180
/proc/meminfo: memFree=28374876/32873648 swapFree=7388/7388
[pid=24180] ppid=24178 vsize=14784 CPUtime=0 cores=1,3,5,7
/proc/24180/stat : 24180 (pbscip.linux.x8) R 24178 24180 21664 0 -1 4202496 2899 0 0 0 0 0 0 0 20 0 1 0 336119534 15138816 2492 33554432000 4194304 8395647 140736549231632 140737481141752 6482800 0 0 4096 16384 0 0 0 17 1 0 0 0 0 0
/proc/24180/statm: 3696 2508 564 1026 0 2666 0
Current children cumulated CPU time (s) 0
Current children cumulated vsize (KiB) 14784
Solver just ended. Dumping a history of the last processes samples
[startup+0.0190569 s]
/proc/loadavg: 2.00 2.00 2.00 3/175 24180
/proc/meminfo: memFree=28374876/32873648 swapFree=7388/7388
[pid=24180] ppid=24178 vsize=14784 CPUtime=0 cores=1,3,5,7
/proc/24180/stat : 24180 (pbscip.linux.x8) R 24178 24180 21664 0 -1 4202496 2899 0 0 0 0 0 0 0 20 0 1 0 336119534 15138816 2492 33554432000 4194304 8395647 140736549231632 140737481141752 6482800 0 0 4096 16384 0 0 0 17 1 0 0 0 0 0
/proc/24180/statm: 3696 2508 564 1026 0 2666 0
Current children cumulated CPU time (s) 0
Current children cumulated vsize (KiB) 14784
Child status: 0
Real time (s): 0.0224799
CPU time (s): 0.014997
CPU user time (s): 0.008998
CPU system time (s): 0.005999
CPU usage (%): 66.713
Max. virtual memory (cumulated for all children) (KiB): 14784
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 0.008998
system time used= 0.005999
maximum resident set size= 10112
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 2943
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= 3
runsolver used 0.002999 second user time and 0.004999 second system time
The end