0.00/0.00 c SCIP version 1.2.1.3 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2]
0.00/0.00 c Copyright (c) 2002-2010 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-3734613-1338700371.opb>
0.00/0.01 c original problem has 100 variables (100 bin, 0 int, 0 impl, 0 cont) and 50 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.01 o 100
0.00/0.01 c feasible solution found by trivial heuristic, objective value 1.000000e+02
0.00/0.01 c presolving:
0.00/0.01 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 50 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 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 100 variables (100 bin, 0 int, 0 impl, 0 cont) and 50 constraints
0.00/0.01 c 50 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.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 t 0.0s| 1 | 0 | 162 | - | 798k| 0 | 37 | 100 | 50 | 100 | 50 | 0 | 0 | 0 | 1.073893e+00 | 1.000000e+02 |9211.91%
0.00/0.02 o 37
0.00/0.02 c r 0.0s| 1 | 0 | 162 | - | 800k| 0 | 37 | 100 | 50 | 100 | 50 | 0 | 0 | 0 | 1.073893e+00 | 3.700000e+01 |3345.41%
0.00/0.02 o 36
0.00/0.02 c R 0.0s| 1 | 0 | 162 | - | 802k| 0 | 37 | 100 | 50 | 100 | 50 | 0 | 0 | 0 | 1.073893e+00 | 3.600000e+01 |3252.29%
0.00/0.02 o 35
0.00/0.02 c s 0.0s| 1 | 0 | 162 | - | 805k| 0 | 37 | 100 | 50 | 100 | 50 | 0 | 0 | 0 | 1.073893e+00 | 3.500000e+01 |3159.17%
0.00/0.03 c 0.0s| 1 | 0 | 290 | - | 813k| 0 | 0 | 100 | 50 | 100 | 51 | 1 | 0 | 0 | 2.000000e+00 | 3.500000e+01 |1650.00%
0.00/0.03 o 2
0.00/0.03 c b 0.0s| 1 | 0 | 290 | - | 816k| 0 | - | 100 | 50 | 100 | 51 | 1 | 0 | 0 | 2.000000e+00 | 2.000000e+00 | 0.00%
0.00/0.03 c 0.0s| 1 | 0 | 290 | - | 815k| 0 | - | 100 | 50 | 100 | 51 | 1 | 0 | 0 | 2.000000e+00 | 2.000000e+00 | 0.00%
0.00/0.03 c
0.00/0.03 c SCIP Status : problem is solved [optimal solution found]
0.00/0.03 c Solving Time (sec) : 0.02
0.00/0.03 c Solving Nodes : 1
0.00/0.03 c Primal Bound : +1.99999999999999e+00 (7 solutions)
0.00/0.03 c Dual Bound : +1.99999999999999e+00
0.00/0.03 c Gap : 0.00 %
0.00/0.03 s OPTIMUM FOUND
0.00/0.03 v -x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92 x91 -x90 x89 -x88 -x87 -x86 -x85 -x84 -x83 -x82 -x81 -x80 -x79 -x78 -x77 -x76 -x75
0.00/0.03 v -x74 -x73 -x72 -x71 -x70 -x69 -x68 -x67 -x66 -x65 -x64 -x63 -x62 -x61 -x60 -x59 -x58 -x57 -x56 -x55 -x54 -x53 -x52 -x51 -x50
0.00/0.03 v -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.00/0.03 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.00/0.03 c SCIP Status : problem is solved [optimal solution found]
0.00/0.03 c Solving Time : 0.02
0.00/0.03 c Original Problem :
0.00/0.03 c Problem name : HOME/instance-3734613-1338700371.opb
0.00/0.03 c Variables : 100 (100 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.03 c Constraints : 50 initial, 50 maximal
0.00/0.03 c Presolved Problem :
0.00/0.03 c Problem name : t_HOME/instance-3734613-1338700371.opb
0.00/0.03 c Variables : 100 (100 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.03 c Constraints : 50 initial, 50 maximal
0.00/0.03 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.00/0.03 c trivial : 0.00 0 0 0 0 0 0 0 0
0.00/0.03 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.00/0.03 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.00/0.03 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.00/0.03 c implics : 0.00 0 0 0 0 0 0 0 0
0.00/0.03 c probing : 0.00 0 0 0 0 0 0 0 0
0.00/0.03 c logicor : 0.00 0 0 0 0 0 0 0 0
0.00/0.03 c root node : - 0 - - 0 - - - -
0.00/0.03 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.00/0.03 c integral : 0 0 0 0 0 0 0 0 0 0
0.00/0.03 c logicor : 50 1 19 0 0 0 0 0 0 0
0.00/0.03 c countsols : 0 0 0 0 0 0 0 0 0 0
0.00/0.03 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.00/0.03 c integral : 0.00 0.00 0.00 0.00 0.00
0.00/0.03 c logicor : 0.00 0.00 0.00 0.00 0.00
0.00/0.03 c countsols : 0.00 0.00 0.00 0.00 0.00
0.00/0.03 c Propagators : Time Calls Cutoffs DomReds
0.00/0.03 c vbounds : 0.00 2 0 0
0.00/0.03 c rootredcost : 0.00 0 0 0
0.00/0.03 c pseudoobj : 0.00 3 0 0
0.00/0.03 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.00/0.03 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.00/0.03 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.03 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.03 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.03 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.00/0.03 c applied globally : - - - 0 0.0 - - -
0.00/0.03 c applied locally : - - - 0 0.0 - - -
0.00/0.03 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.00/0.03 c cut pool : 0.00 0 - - 0 - (maximal pool size: 1)
0.00/0.03 c redcost : 0.00 1 0 0 0 0
0.00/0.03 c impliedbounds : 0.00 1 0 0 0 0
0.00/0.03 c intobj : 0.00 0 0 0 0 0
0.00/0.03 c cgmip : 0.00 0 0 0 0 0
0.00/0.03 c gomory : 0.00 1 0 0 4 0
0.00/0.03 c strongcg : 0.00 1 0 0 1 0
0.00/0.03 c cmir : 0.00 1 0 0 0 0
0.00/0.03 c flowcover : 0.00 1 0 0 0 0
0.00/0.03 c clique : 0.00 1 0 0 0 0
0.00/0.03 c zerohalf : 0.00 0 0 0 0 0
0.00/0.03 c mcf : 0.00 1 0 0 0 0
0.00/0.03 c rapidlearning : 0.00 0 0 0 0 0
0.00/0.03 c Pricers : Time Calls Vars
0.00/0.03 c problem variables: 0.00 0 0
0.00/0.03 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.00/0.03 c pscost : 0.00 0 0 0 0 0 0
0.00/0.03 c inference : 0.00 0 0 0 0 0 0
0.00/0.03 c mostinf : 0.00 0 0 0 0 0 0
0.00/0.03 c leastinf : 0.00 0 0 0 0 0 0
0.00/0.03 c fullstrong : 0.00 0 0 0 0 0 0
0.00/0.03 c allfullstrong : 0.00 0 0 0 0 0 0
0.00/0.03 c random : 0.00 0 0 0 0 0 0
0.00/0.03 c relpscost : 0.00 0 0 0 0 0 0
0.00/0.03 c Primal Heuristics : Time Calls Found
0.00/0.03 c LP solutions : 0.00 - 0
0.00/0.03 c pseudo solutions : 0.00 - 0
0.00/0.03 c trivial : 0.00 2 3
0.00/0.03 c simplerounding : 0.00 1 1
0.00/0.03 c zirounding : 0.00 0 0
0.00/0.03 c rounding : 0.00 1 1
0.00/0.03 c shifting : 0.00 1 1
0.00/0.03 c intshifting : 0.00 0 0
0.00/0.03 c oneopt : 0.00 1 1
0.00/0.03 c twoopt : 0.00 0 0
0.00/0.03 c fixandinfer : 0.00 0 0
0.00/0.03 c feaspump : 0.00 0 0
0.00/0.03 c coefdiving : 0.00 0 0
0.00/0.03 c pscostdiving : 0.00 0 0
0.00/0.03 c fracdiving : 0.00 0 0
0.00/0.03 c veclendiving : 0.00 0 0
0.00/0.03 c intdiving : 0.00 0 0
0.00/0.03 c actconsdiving : 0.00 0 0
0.00/0.03 c objpscostdiving : 0.00 0 0
0.00/0.03 c rootsoldiving : 0.00 0 0
0.00/0.03 c linesearchdiving : 0.00 0 0
0.00/0.03 c guideddiving : 0.00 0 0
0.00/0.03 c octane : 0.00 0 0
0.00/0.03 c rens : 0.00 0 0
0.00/0.03 c rins : 0.00 0 0
0.00/0.03 c localbranching : 0.00 0 0
0.00/0.03 c mutation : 0.00 0 0
0.00/0.03 c crossover : 0.00 0 0
0.00/0.03 c dins : 0.00 0 0
0.00/0.03 c undercover : 0.00 0 0
0.00/0.03 c nlp : 0.00 0 0
0.00/0.03 c trysol : 0.00 0 0
0.00/0.03 c LP : Time Calls Iterations Iter/call Iter/sec
0.00/0.03 c primal LP : 0.00 0 0 0.00 -
0.00/0.03 c dual LP : 0.01 2 290 145.00 -
0.00/0.03 c lex dual LP : 0.00 0 0 0.00 -
0.00/0.03 c barrier LP : 0.00 0 0 0.00 -
0.00/0.03 c diving/probing LP: 0.00 0 0 0.00 -
0.00/0.03 c strong branching : 0.00 0 0 0.00 -
0.00/0.03 c (at root node) : - 0 0 0.00 -
0.00/0.03 c conflict analysis: 0.00 0 0 0.00 -
0.00/0.03 c B&B Tree :
0.00/0.03 c number of runs : 1
0.00/0.03 c nodes : 1
0.00/0.03 c nodes (total) : 1
0.00/0.03 c nodes left : 0
0.00/0.03 c max depth : 0
0.00/0.03 c max depth (total): 0
0.00/0.03 c backtracks : 0 (0.0%)
0.00/0.03 c delayed cutoffs : 0
0.00/0.03 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.00/0.03 c avg switch length: 2.00
0.00/0.03 c switching time : 0.00
0.00/0.03 c Solution :
0.00/0.03 c Solutions found : 7 (5 improvements)
0.00/0.03 c First Solution : +1.00000000000000e+02 (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
0.00/0.03 c Primal Bound : +1.99999999999999e+00 (in run 1, after 1 nodes, 0.02 seconds, depth 0, found by <oneopt>)
0.00/0.03 c Dual Bound : +1.99999999999999e+00
0.00/0.03 c Gap : 0.00 %
0.00/0.03 c Root Dual Bound : +1.99999999999999e+00
0.00/0.03 c Root Iterations : 290
0.00/0.03 c Time complete: 0.02.
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-3734613-1338700371/watcher-3734613-1338700371 -o /tmp/evaluation-result-3734613-1338700371/solver-3734613-1338700371 -C 1800 -W 1900 -M 15500 HOME/pbscip.linux.x86_64.gnu.opt.spx -f HOME/instance-3734613-1338700371.opb -t 1800 -m 15500
running on 4 cores: 0,2,4,6
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.00 2.00 2.00 3/176 11299
/proc/meminfo: memFree=26297240/32873648 swapFree=6864/6864
[pid=11299] ppid=11297 vsize=6096 CPUtime=0 cores=0,2,4,6
/proc/11299/stat : 11299 (pbscip.linux.x8) R 11297 11299 7869 0 -1 4202496 847 0 0 0 0 0 0 0 20 0 1 0 336162514 6242304 795 33554432000 4194304 8395647 140736187710992 140734419630376 7385355 0 0 4096 0 0 0 0 17 0 0 0 0 0 0
/proc/11299/statm: 1524 795 351 1026 0 494 0
Solver just ended. Dumping a history of the last processes samples
Child status: 0
Real time (s): 0.0378131
CPU time (s): 0.034994
CPU user time (s): 0.029995
CPU system time (s): 0.004999
CPU usage (%): 92.5446
Max. virtual memory (cumulated for all children) (KiB): 0
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 0.029995
system time used= 0.004999
maximum resident set size= 11776
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 3359
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 second user time and 0.005999 second system time
The end