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-3736256-1338706952.opb>
0.00/0.00 c original problem has 194 variables (194 bin, 0 int, 0 impl, 0 cont) and 292 constraints
0.00/0.00 c problem read
0.00/0.00 c presolving settings loaded
0.00/0.01 o 111
0.00/0.01 c feasible solution found by trivial heuristic, objective value 1.110000e+02
0.00/0.01 c presolving:
0.00/0.01 c (round 1) 72 del vars, 137 del conss, 3 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 406 impls, 0 clqs
0.00/0.01 c (round 2) 73 del vars, 140 del conss, 3 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 406 impls, 0 clqs
0.00/0.01 c (round 3) 73 del vars, 140 del conss, 3 chg bounds, 0 chg sides, 0 chg coeffs, 115 upgd conss, 406 impls, 0 clqs
0.00/0.01 c (round 4) 73 del vars, 140 del conss, 3 chg bounds, 0 chg sides, 0 chg coeffs, 152 upgd conss, 406 impls, 0 clqs
0.00/0.01 c (0.0s) probing: 101/121 (83.5%) - 0 fixings, 0 aggregations, 0 implications, 0 bound changes
0.00/0.01 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.00/0.01 c presolving (5 rounds):
0.00/0.01 c 73 deleted vars, 140 deleted constraints, 3 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.01 c 406 implications, 0 cliques
0.00/0.01 c presolved problem has 121 variables (121 bin, 0 int, 0 impl, 0 cont) and 152 constraints
0.00/0.01 c 131 constraints of type <setppc>
0.00/0.01 c 21 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.01
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 # 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 # 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 # 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 -----------------------------------------------------------------------------------------------
0.00/0.01 c start solving
0.00/0.01 c
0.00/0.01 o 110
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 | - | 645k| 0 | - | 121 | 152 | 0 | 0 | 0 | 0 | 0 | -- | 1.100000e+02 | Inf
0.00/0.01 o 28
0.00/0.01 c b 0.0s| 1 | 0 | 0 | - | 743k| 0 | - | 121 | 152 | 121 | 152 | 0 | 0 | 0 | -- | 2.800000e+01 | Inf
0.00/0.01 o 10
0.00/0.01 c * 0.0s| 1 | 0 | 16 | - | 742k| 0 | - | 121 | 152 | 121 | 152 | 0 | 0 | 0 | 4.000000e+00 | 1.000000e+01 | 150.00%
0.00/0.01 c 0.0s| 1 | 0 | 16 | - | 742k| 0 | - | 121 | 152 | 121 | 152 | 0 | 0 | 0 | 1.000000e+01 | 1.000000e+01 | 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+01 (4 solutions)
0.00/0.01 c Dual Bound : +1.00000000000000e+01
0.00/0.01 c Gap : 0.00 %
0.00/0.01 s OPTIMUM FOUND
0.00/0.01 v -x18 -x174 -x17 -x16 -x170 -x15 -x166 -x163 -x160 -x14 -x156 -x13 -x152 -x12 -x150 -x147 -x11 -x144 -x10 -x141 -x139 -x137 -x135
0.00/0.01 v -x132 -x130 -x128 -x126 -x123 -x120 -x118 -x9 -x116 -x8 -x113 -x111 -x7 -x6 -x107 -x104 -x5 -x102 -x100 -x97 -x95 -x93 -x4
0.00/0.01 v -x91 -x88 -x86 -x84 -x82 -x79 -x76 -x3 -x74 -x72 -x69 -x67 -x65 -x63 -x2 -x61 -x59 -x57 -x55 -x53 -x50 -x1 -x48 -x46 -x44 -x42
0.00/0.01 v -x39 -x37 -x35 -x33 -x31 -x29 -x27 -x25 -x23 -x21 -x19 x194 x193 -x192 x191 x190 -x189 -x188 x187 -x186 -x185 x184 -x183 -x182
0.00/0.01 v -x181 -x180 -x179 x178 -x177 -x176 -x175 -x173 -x172 -x171 -x169 -x168 -x167 -x165 -x164 -x162 -x161 -x159 -x158 -x157 -x155
0.00/0.01 v -x154 -x153 -x151 -x149 -x148 -x146 -x145 -x143 -x142 -x140 -x138 -x136 x134 -x133 -x131 -x129 -x127 -x125 -x124 -x122 -x121
0.00/0.01 v -x119 -x117 -x115 -x114 -x112 -x110 -x109 -x108 -x106 -x105 -x103 -x101 -x99 -x98 -x96 -x94 -x92 -x90 -x89 -x87 -x85 -x83
0.00/0.01 v x81 -x80 -x78 -x77 -x75 -x73 -x71 -x70 -x68 -x66 -x64 -x62 -x60 -x58 -x56 -x54 -x52 -x51 -x49 -x47 -x45 -x43 x41 -x40 -x38 -x36
0.00/0.01 v -x34 -x32 -x30 -x28 -x26 -x24 -x22 -x20
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-3736256-1338706952.opb
0.00/0.01 c Variables : 194 (194 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.01 c Constraints : 292 initial, 292 maximal
0.00/0.01 c Presolved Problem :
0.00/0.01 c Problem name : t_HOME/instance-3736256-1338706952.opb
0.00/0.01 c Variables : 121 (121 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.01 c Constraints : 152 initial, 152 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 1 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 setppc : 0.00 0 0 0 0 0 0 0 0
0.00/0.01 c linear : 0.00 3 69 0 3 0 140 0 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 setppc : 131 0 201 0 0 0 0 0 0 0
0.00/0.01 c logicor : 21 0 81 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 setppc : 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 1 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 trivial : 0.00 2 2
0.00/0.01 c simplerounding : 0.00 0 0
0.00/0.01 c zirounding : 0.00 0 0
0.00/0.01 c rounding : 0.00 0 0
0.00/0.01 c shifting : 0.00 0 0
0.00/0.01 c intshifting : 0.00 0 0
0.00/0.01 c oneopt : 0.00 1 1
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 feaspump : 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 16 16.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.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 : 4 (4 improvements)
0.00/0.01 c First Solution : +1.11000000000000e+02 (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
0.00/0.01 c Primal Bound : +1.00000000000000e+01 (in run 1, after 1 nodes, 0.01 seconds, depth 0, found by <relaxation>)
0.00/0.01 c Dual Bound : +1.00000000000000e+01
0.00/0.01 c Gap : 0.00 %
0.00/0.01 c Root Dual Bound : +1.00000000000000e+01
0.00/0.01 c Root Iterations : 16
0.00/0.02 c Time complete: 0.01.
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-3736256-1338706952/watcher-3736256-1338706952 -o /tmp/evaluation-result-3736256-1338706952/solver-3736256-1338706952 -C 1800 -W 1900 -M 15500 HOME/pbscip.linux.x86_64.gnu.opt.spx -f HOME/instance-3736256-1338706952.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.02 2.01 2.00 3/176 17714
/proc/meminfo: memFree=27049964/32873660 swapFree=7120/7120
[pid=17714] ppid=17712 vsize=8944 CPUtime=0 cores=0,2,4,6
/proc/17714/stat : 17714 (pbscip.linux.x8) R 17712 17714 13836 0 -1 4202496 1411 0 0 0 0 0 0 0 20 0 1 0 336820999 9158656 1357 33554432000 4194304 8395647 140733357499712 140737424984792 7382157 0 0 4096 0 0 0 0 17 0 0 0 0 0 0
/proc/17714/statm: 2236 1366 374 1026 0 1206 0
Solver just ended. Dumping a history of the last processes samples
Child status: 0
Real time (s): 0.02273
CPU time (s): 0.021995
CPU user time (s): 0.013997
CPU system time (s): 0.007998
CPU usage (%): 96.7664
Max. virtual memory (cumulated for all children) (KiB): 0
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 0.013997
system time used= 0.007998
maximum resident set size= 10648
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 3077
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= 1
runsolver used 0.000999 second user time and 0.005999 second system time
The end