0.00/0.00 c SCIP version 2.0.1.5 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.5]
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-3732525-1338704575.opb>
0.00/0.00 c original problem has 128 variables (128 bin, 0 int, 0 impl, 0 cont) and 318 constraints
0.00/0.00 c problem read
0.00/0.00 c presolving settings loaded
0.00/0.01 c presolving:
0.00/0.01 c (round 1) 0 del vars, 30 del conss, 0 add conss, 0 chg bounds, 30 chg sides, 0 chg coeffs, 0 upgd conss, 368 impls, 0 clqs
0.00/0.01 c (round 2) 0 del vars, 30 del conss, 0 add conss, 0 chg bounds, 30 chg sides, 0 chg coeffs, 287 upgd conss, 368 impls, 0 clqs
0.00/0.01 c (round 3) 0 del vars, 30 del conss, 0 add conss, 0 chg bounds, 30 chg sides, 0 chg coeffs, 288 upgd conss, 368 impls, 0 clqs
0.00/0.02 c (round 4) 35 del vars, 30 del conss, 0 add conss, 0 chg bounds, 30 chg sides, 0 chg coeffs, 288 upgd conss, 4016 impls, 0 clqs
0.00/0.02 c (round 5) 35 del vars, 61 del conss, 0 add conss, 0 chg bounds, 30 chg sides, 0 chg coeffs, 288 upgd conss, 4016 impls, 0 clqs
0.00/0.02 c presolving (6 rounds):
0.00/0.02 c 35 deleted vars, 61 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 30 changed sides, 0 changed coefficients
0.00/0.02 c 4016 implications, 0 cliques
0.00/0.02 c presolved problem has 93 variables (93 bin, 0 int, 0 impl, 0 cont) and 257 constraints
0.00/0.02 c 63 constraints of type <setppc>
0.00/0.02 c 194 constraints of type <logicor>
0.00/0.02 c transformed objective value is always integral (scale: 1)
0.00/0.02 c Presolving Time: 0.01
0.00/0.02 c - non default parameters ----------------------------------------------------------------------
0.00/0.02 c # SCIP version 2.0.1.5
0.00/0.02 c
0.00/0.02 c # frequency for displaying node information lines
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.02 c display/freq = 10000
0.00/0.02 c
0.00/0.02 c # maximal time in seconds to run
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.02 c limits/time = 1797
0.00/0.02 c
0.00/0.02 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.02 c limits/memory = 13950
0.00/0.02 c
0.00/0.02 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.02 c # [type: int, range: [1,2], default: 1]
0.00/0.02 c timing/clocktype = 2
0.00/0.02 c
0.00/0.02 c # belongs reading time to solving time?
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c timing/reading = TRUE
0.00/0.02 c
0.00/0.02 c # should presolving try to simplify inequalities
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/linear/simplifyinequalities = TRUE
0.00/0.02 c
0.00/0.02 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/indicator/addCouplingCons = TRUE
0.00/0.02 c
0.00/0.02 c # should presolving try to simplify knapsacks
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.02 c
0.00/0.02 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c separating/rapidlearning/freq = 0
0.00/0.02 c
0.00/0.02 c -----------------------------------------------------------------------------------------------
0.00/0.02 c start solving
0.00/0.02 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 0.0s| 1 | 0 | 82 | - | 844k| 0 | 54 | 93 | 269 | 93 | 253 | 0 | 12 | 0 | 4.900000e+01 | -- | Inf
0.00/0.04 o 64
0.00/0.04 c y 0.0s| 1 | 0 | 212 | - | 952k| 0 | 54 | 93 | 269 | 93 | 253 | 0 | 12 | 0 | 4.900000e+01 | 6.400000e+01 | 30.61%
0.00/0.05 c 0.0s| 1 | 0 | 249 | - | 822k| 0 | - | 93 | 269 | 93 | 253 | 0 | 12 | 0 | 6.400000e+01 | 6.400000e+01 | 0.00%
0.00/0.05 c 0.0s| 1 | 0 | 249 | - | 822k| 0 | - | 93 | 269 | 93 | 253 | 0 | 12 | 0 | 6.400000e+01 | 6.400000e+01 | 0.00%
0.00/0.05 c
0.00/0.05 c SCIP Status : problem is solved [optimal solution found]
0.00/0.05 c Solving Time (sec) : 0.05
0.00/0.05 c Solving Nodes : 1
0.00/0.05 c Primal Bound : +6.40000000000000e+01 (1 solutions)
0.00/0.05 c Dual Bound : +6.40000000000000e+01
0.00/0.05 c Gap : 0.00 %
0.00/0.05 s OPTIMUM FOUND
0.00/0.05 v x128 -x127 -x126 x125 -x124 x123 -x122 x121 x120 -x119 -x118 x117 x116 -x115 -x114 x113 -x112 x111 -x110 x109 -x108 x107 -x106
0.00/0.05 v x105 x104 -x103 -x102 x101 -x100 x99 -x98 x97 -x96 x95 -x94 x93 x92 -x91 -x90 x89 -x88 x87 -x86 x85 -x84 x83 -x82 x81 x80 -x79
0.00/0.05 v -x78 x77 -x76 x75 x74 -x73 -x72 x71 -x70 x69 x68 -x67 x66 -x65 -x64 x63 x62 -x61 x60 -x59 x58 -x57 x56 -x55 x54 -x53 x52 -x51
0.00/0.05 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 x24 -x23
0.00/0.05 v 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.05 c SCIP Status : problem is solved [optimal solution found]
0.00/0.05 c Total Time : 0.05
0.00/0.05 c solving : 0.05
0.00/0.05 c presolving : 0.01 (included in solving)
0.00/0.05 c reading : 0.00 (included in solving)
0.00/0.05 c Original Problem :
0.00/0.05 c Problem name : HOME/instance-3732525-1338704575.opb
0.00/0.05 c Variables : 128 (128 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.05 c Constraints : 318 initial, 318 maximal
0.00/0.05 c Presolved Problem :
0.00/0.05 c Problem name : t_HOME/instance-3732525-1338704575.opb
0.00/0.05 c Variables : 93 (93 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.05 c Constraints : 257 initial, 269 maximal
0.00/0.05 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.00/0.05 c trivial : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.05 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.05 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.05 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.05 c pseudoobj : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.05 c implics : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.05 c probing : 0.01 0 35 0 0 0 0 0 0 0
0.00/0.05 c setppc : 0.00 0 0 0 0 0 31 0 0 0
0.00/0.05 c linear : 0.00 0 0 0 0 0 30 0 30 0
0.00/0.05 c logicor : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.05 c root node : - 67 - - 67 - - - - -
0.00/0.05 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
0.00/0.05 c integral : 0 0 0 0 0 7 0 0 0 0 0 0
0.00/0.05 c setppc : 63 1 436 0 0 4 55 3 0 0 0 0
0.00/0.05 c logicor : 194+ 1 312 0 0 2 25 12 0 0 0 0
0.00/0.05 c countsols : 0 0 0 0 0 3 0 0 0 0 0 0
0.00/0.05 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
0.00/0.05 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.05 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.05 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.05 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.05 c Propagators : #Propagate #Resprop Cutoffs DomReds
0.00/0.05 c vbounds : 0 0 0 0
0.00/0.05 c rootredcost : 0 0 0 0
0.00/0.05 c pseudoobj : 35 0 0 0
0.00/0.05 c Propagator Timings : TotalTime Propagate Resprop
0.00/0.05 c vbounds : 0.00 0.00 0.00
0.00/0.05 c rootredcost : 0.00 0.00 0.00
0.00/0.05 c pseudoobj : 0.00 0.00 0.00
0.00/0.05 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.00/0.05 c propagation : 0.00 15 10 14 3.1 0 0.0 -
0.00/0.05 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.05 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.05 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.05 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.00/0.05 c applied globally : - - - 12 2.9 - - -
0.00/0.05 c applied locally : - - - 0 0.0 - - -
0.00/0.05 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.00/0.05 c cut pool : 0.00 0 - - 0 - (maximal pool size: 36)
0.00/0.05 c redcost : 0.00 1 0 0 0 0
0.00/0.05 c impliedbounds : 0.00 1 0 0 0 0
0.00/0.05 c intobj : 0.00 0 0 0 0 0
0.00/0.05 c gomory : 0.00 1 0 0 87 0
0.00/0.05 c cgmip : 0.00 0 0 0 0 0
0.00/0.05 c closecuts : 0.00 0 0 0 0 0
0.00/0.05 c strongcg : 0.00 1 0 0 87 0
0.00/0.05 c cmir : 0.00 1 0 0 0 0
0.00/0.05 c flowcover : 0.00 1 0 0 0 0
0.00/0.05 c clique : 0.00 1 0 0 6 0
0.00/0.05 c zerohalf : 0.00 0 0 0 0 0
0.00/0.05 c mcf : 0.00 1 0 0 0 0
0.00/0.05 c oddcycle : 0.00 0 0 0 0 0
0.00/0.05 c rapidlearning : 0.02 1 0 67 0 0
0.00/0.05 c Pricers : Time Calls Vars
0.00/0.05 c problem variables: 0.00 0 0
0.00/0.05 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.00/0.05 c pscost : 0.00 0 0 0 0 0 0
0.00/0.05 c inference : 0.00 0 0 0 0 0 0
0.00/0.05 c mostinf : 0.00 0 0 0 0 0 0
0.00/0.05 c leastinf : 0.00 0 0 0 0 0 0
0.00/0.05 c fullstrong : 0.00 0 0 0 0 0 0
0.00/0.05 c allfullstrong : 0.00 0 0 0 0 0 0
0.00/0.05 c random : 0.00 0 0 0 0 0 0
0.00/0.05 c relpscost : 0.00 0 0 0 0 0 0
0.00/0.05 c Primal Heuristics : Time Calls Found
0.00/0.05 c LP solutions : 0.00 - 0
0.00/0.05 c pseudo solutions : 0.00 - 0
0.00/0.05 c oneopt : 0.00 0 0
0.00/0.05 c trivial : 0.00 2 0
0.00/0.05 c shiftandpropagate: 0.00 1 0
0.00/0.05 c simplerounding : 0.00 0 0
0.00/0.05 c zirounding : 0.00 0 0
0.00/0.05 c rounding : 0.00 1 0
0.00/0.05 c shifting : 0.00 1 0
0.00/0.05 c intshifting : 0.00 0 0
0.00/0.05 c twoopt : 0.00 0 0
0.00/0.05 c fixandinfer : 0.00 0 0
0.00/0.05 c feaspump : 0.00 1 0
0.00/0.05 c clique : 0.00 0 0
0.00/0.05 c coefdiving : 0.00 0 0
0.00/0.05 c pscostdiving : 0.00 0 0
0.00/0.05 c fracdiving : 0.00 0 0
0.00/0.05 c veclendiving : 0.00 0 0
0.00/0.05 c intdiving : 0.00 0 0
0.00/0.05 c actconsdiving : 0.00 0 0
0.00/0.05 c objpscostdiving : 0.00 0 0
0.00/0.05 c rootsoldiving : 0.00 0 0
0.00/0.05 c linesearchdiving : 0.00 0 0
0.00/0.05 c guideddiving : 0.00 0 0
0.00/0.05 c octane : 0.00 0 0
0.00/0.05 c rens : 0.00 0 0
0.00/0.05 c rins : 0.00 0 0
0.00/0.05 c localbranching : 0.00 0 0
0.00/0.05 c mutation : 0.00 0 0
0.00/0.05 c crossover : 0.00 0 0
0.00/0.05 c dins : 0.00 0 0
0.00/0.05 c vbounds : 0.00 0 0
0.00/0.05 c undercover : 0.00 0 0
0.00/0.05 c subnlp : 0.00 0 0
0.00/0.05 c trysol : 0.00 0 0
0.00/0.05 c LP : Time Calls Iterations Iter/call Iter/sec
0.00/0.05 c primal LP : 0.00 0 0 0.00 -
0.00/0.05 c dual LP : 0.00 2 119 59.50 -
0.00/0.05 c lex dual LP : 0.00 0 0 0.00 -
0.00/0.05 c barrier LP : 0.00 0 0 0.00 -
0.00/0.05 c diving/probing LP: 0.00 17 130 7.65 -
0.00/0.05 c strong branching : 0.00 0 0 0.00 -
0.00/0.05 c (at root node) : - 0 0 0.00 -
0.00/0.05 c conflict analysis: 0.00 0 0 0.00 -
0.00/0.05 c B&B Tree :
0.00/0.05 c number of runs : 1
0.00/0.05 c nodes : 1
0.00/0.05 c nodes (total) : 1
0.00/0.05 c nodes left : 0
0.00/0.05 c max depth : 0
0.00/0.05 c max depth (total): 0
0.00/0.05 c backtracks : 0 (0.0%)
0.00/0.05 c delayed cutoffs : 0
0.00/0.05 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.00/0.05 c avg switch length: 2.00
0.00/0.05 c switching time : 0.00
0.00/0.05 c Solution :
0.00/0.05 c Solutions found : 1 (1 improvements)
0.00/0.05 c First Solution : +6.40000000000000e+01 (in run 1, after 1 nodes, 0.04 seconds, depth 0, found by <trysol>)
0.00/0.05 c Primal Bound : +6.40000000000000e+01 (in run 1, after 1 nodes, 0.04 seconds, depth 0, found by <trysol>)
0.00/0.05 c Dual Bound : +6.40000000000000e+01
0.00/0.05 c Gap : 0.00 %
0.00/0.05 c Root Dual Bound : +6.40000000000000e+01
0.00/0.05 c Root Iterations : 249
0.00/0.05 c Time complete: 0.04.
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-3732525-1338704575/watcher-3732525-1338704575 -o /tmp/evaluation-result-3732525-1338704575/solver-3732525-1338704575 -C 1800 -W 1900 -M 15500 HOME/scip-2.0.1.4b_2.linux.x86_64.gnu.opt.spx -f HOME/instance-3732525-1338704575.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: 2.06 2.02 2.00 3/176 3402
/proc/meminfo: memFree=30295436/32873648 swapFree=7628/7628
[pid=3402] ppid=3400 vsize=9588 CPUtime=0 cores=1,3,5,7
/proc/3402/stat : 3402 (scip-2.0.1.4b_2) R 3400 3402 20657 0 -1 4202496 1525 0 0 0 0 0 0 0 20 0 1 0 336583523 9818112 1481 33554432000 4194304 9016284 140736499284736 140736374109896 7875499 0 0 4096 0 0 0 0 17 5 0 0 0 0 0
/proc/3402/statm: 2397 1481 311 1178 0 1215 0
Solver just ended. Dumping a history of the last processes samples
Child status: 0
Real time (s): 0.0581389
CPU time (s): 0.05699
CPU user time (s): 0.049992
CPU system time (s): 0.006998
CPU usage (%): 98.0239
Max. virtual memory (cumulated for all children) (KiB): 0
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 0.049992
system time used= 0.006998
maximum resident set size= 25528
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 6697
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.000999 second user time and 0.004999 second system time
The end