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-3736447-1338707067.opb>
0.00/0.00 c original problem has 108 variables (108 bin, 0 int, 0 impl, 0 cont) and 77 constraints
0.00/0.00 c problem read
0.00/0.00 c presolving settings loaded
0.00/0.00 c presolving:
0.00/0.01 c (round 1) 2 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 12 chg coeffs, 0 upgd conss, 316 impls, 0 clqs
0.00/0.01 c (round 2) 14 del vars, 10 del conss, 0 chg bounds, 0 chg sides, 22 chg coeffs, 3 upgd conss, 436 impls, 0 clqs
0.00/0.01 c (round 3) 26 del vars, 20 del conss, 0 chg bounds, 0 chg sides, 32 chg coeffs, 3 upgd conss, 436 impls, 0 clqs
0.00/0.01 c presolving (4 rounds):
0.00/0.01 c 26 deleted vars, 20 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 32 changed coefficients
0.00/0.01 c 448 implications, 0 cliques
0.00/0.01 c presolved problem has 82 variables (82 bin, 0 int, 0 impl, 0 cont) and 55 constraints
0.00/0.01 c 50 constraints of type <and>
0.00/0.01 c 2 constraints of type <linear>
0.00/0.01 c 3 constraints of type <logicor>
0.00/0.01 c transformed objective value is always integral (scale: 2)
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 primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01 c heuristics/undercover/freq = 0
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 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 0.0s| 1 | 0 | 8 | - | 473k| 0 | 5 | 82 | 55 | 82 | 105 | 0 | 0 | 0 | 3.000000e+00 | -- | Inf
0.00/0.08 o 3
0.00/0.08 c u 0.1s| 1 | 0 | 116 | - | 479k| 0 | - | 82 | 55 | 82 | 105 | 0 | 0 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.00/0.08 c 0.1s| 1 | 0 | 116 | - | 477k| 0 | - | 82 | 55 | 82 | 105 | 0 | 0 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.00/0.08 c
0.00/0.08 c SCIP Status : problem is solved [optimal solution found]
0.00/0.08 c Solving Time (sec) : 0.08
0.00/0.08 c Solving Nodes : 1
0.00/0.08 c Primal Bound : +3.00000000000000e+00 (1 solutions)
0.00/0.08 c Dual Bound : +3.00000000000000e+00
0.00/0.08 c Gap : 0.00 %
0.00/0.08 s OPTIMUM FOUND
0.00/0.08 v -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 x11 x10 -x9 -x8
0.00/0.08 v x7 -x6 -x5 -x4 -x3 x2 x1
0.00/0.08 c SCIP Status : problem is solved [optimal solution found]
0.00/0.08 c Solving Time : 0.08
0.00/0.08 c Original Problem :
0.00/0.08 c Problem name : HOME/instance-3736447-1338707067.opb
0.00/0.08 c Variables : 108 (108 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.08 c Constraints : 77 initial, 77 maximal
0.00/0.08 c Presolved Problem :
0.00/0.08 c Problem name : t_HOME/instance-3736447-1338707067.opb
0.00/0.08 c Variables : 82 (82 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.08 c Constraints : 55 initial, 55 maximal
0.00/0.08 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.00/0.08 c trivial : 0.00 0 0 0 0 0 0 0 0
0.00/0.08 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.00/0.08 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.00/0.08 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.00/0.08 c implics : 0.00 0 0 0 0 0 0 0 0
0.00/0.08 c probing : 0.00 0 0 0 0 0 0 0 0
0.00/0.08 c and : 0.00 4 20 0 0 0 20 0 20
0.00/0.08 c linear : 0.00 1 1 0 0 0 0 0 12
0.00/0.08 c logicor : 0.00 0 0 0 0 0 0 0 0
0.00/0.08 c root node : - 0 - - 0 - - - -
0.00/0.08 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.00/0.08 c integral : 0 0 0 0 0 0 0 0 0 0
0.00/0.08 c and : 50 0 187 0 0 0 0 0 0 0
0.00/0.08 c linear : 2 0 187 0 0 0 0 0 0 0
0.00/0.08 c logicor : 3 0 38 0 0 0 0 0 0 0
0.00/0.08 c countsols : 0 0 0 0 0 0 0 0 0 0
0.00/0.08 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.00/0.08 c integral : 0.00 0.00 0.00 0.00 0.00
0.00/0.08 c and : 0.00 0.00 0.00 0.00 0.00
0.00/0.08 c linear : 0.00 0.00 0.00 0.00 0.00
0.00/0.08 c logicor : 0.00 0.00 0.00 0.00 0.00
0.00/0.08 c countsols : 0.00 0.00 0.00 0.00 0.00
0.00/0.08 c Propagators : Time Calls Cutoffs DomReds
0.00/0.08 c vbounds : 0.00 2 0 0
0.00/0.08 c rootredcost : 0.00 0 0 0
0.00/0.08 c pseudoobj : 0.00 18 0 0
0.00/0.08 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.00/0.08 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.00/0.08 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.08 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.08 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.08 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.00/0.08 c applied globally : - - - 0 0.0 - - -
0.00/0.08 c applied locally : - - - 0 0.0 - - -
0.00/0.08 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.00/0.08 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.00/0.08 c redcost : 0.00 0 0 0 0 0
0.00/0.08 c impliedbounds : 0.00 0 0 0 0 0
0.00/0.08 c intobj : 0.00 0 0 0 0 0
0.00/0.08 c cgmip : 0.00 0 0 0 0 0
0.00/0.08 c gomory : 0.00 0 0 0 0 0
0.00/0.08 c strongcg : 0.00 0 0 0 0 0
0.00/0.08 c cmir : 0.00 0 0 0 0 0
0.00/0.08 c flowcover : 0.00 0 0 0 0 0
0.00/0.08 c clique : 0.00 0 0 0 0 0
0.00/0.08 c zerohalf : 0.00 0 0 0 0 0
0.00/0.08 c mcf : 0.00 0 0 0 0 0
0.00/0.08 c rapidlearning : 0.00 0 0 0 0 0
0.00/0.08 c Pricers : Time Calls Vars
0.00/0.08 c problem variables: 0.00 0 0
0.00/0.08 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.00/0.08 c pscost : 0.00 0 0 0 0 0 0
0.00/0.08 c inference : 0.00 0 0 0 0 0 0
0.00/0.08 c mostinf : 0.00 0 0 0 0 0 0
0.00/0.08 c leastinf : 0.00 0 0 0 0 0 0
0.00/0.08 c fullstrong : 0.00 0 0 0 0 0 0
0.00/0.08 c allfullstrong : 0.00 0 0 0 0 0 0
0.00/0.08 c random : 0.00 0 0 0 0 0 0
0.00/0.08 c relpscost : 0.00 0 0 0 0 0 0
0.00/0.08 c Primal Heuristics : Time Calls Found
0.00/0.08 c LP solutions : 0.00 - 0
0.00/0.08 c pseudo solutions : 0.00 - 0
0.00/0.08 c oneopt : 0.00 0 0
0.00/0.08 c trivial : 0.00 2 0
0.00/0.08 c simplerounding : 0.00 0 0
0.00/0.08 c zirounding : 0.00 0 0
0.00/0.08 c rounding : 0.00 1 0
0.00/0.08 c shifting : 0.00 1 0
0.00/0.08 c intshifting : 0.00 0 0
0.00/0.08 c twoopt : 0.00 0 0
0.00/0.08 c fixandinfer : 0.00 0 0
0.00/0.08 c feaspump : 0.00 1 0
0.00/0.08 c coefdiving : 0.00 0 0
0.00/0.08 c pscostdiving : 0.00 0 0
0.00/0.08 c fracdiving : 0.00 0 0
0.00/0.08 c veclendiving : 0.00 0 0
0.00/0.08 c intdiving : 0.00 0 0
0.00/0.08 c actconsdiving : 0.00 0 0
0.00/0.08 c objpscostdiving : 0.00 0 0
0.00/0.08 c rootsoldiving : 0.00 0 0
0.00/0.08 c linesearchdiving : 0.00 0 0
0.00/0.08 c guideddiving : 0.00 0 0
0.00/0.08 c octane : 0.00 0 0
0.00/0.08 c rens : 0.00 0 0
0.00/0.08 c rins : 0.00 0 0
0.00/0.08 c localbranching : 0.00 0 0
0.00/0.08 c mutation : 0.00 0 0
0.00/0.08 c crossover : 0.00 0 0
0.00/0.08 c dins : 0.00 0 0
0.00/0.08 c undercover : 0.07 1 1
0.00/0.08 c nlp : 0.00 0 0
0.00/0.08 c trysol : 0.00 0 0
0.00/0.08 c LP : Time Calls Iterations Iter/call Iter/sec
0.00/0.08 c primal LP : 0.00 0 0 0.00 -
0.00/0.08 c dual LP : 0.00 1 8 8.00 -
0.00/0.08 c lex dual LP : 0.00 0 0 0.00 -
0.00/0.08 c barrier LP : 0.00 0 0 0.00 -
0.00/0.08 c diving/probing LP: 0.00 11 108 9.82 -
0.00/0.08 c strong branching : 0.00 0 0 0.00 -
0.00/0.08 c (at root node) : - 0 0 0.00 -
0.00/0.08 c conflict analysis: 0.00 0 0 0.00 -
0.00/0.08 c B&B Tree :
0.00/0.08 c number of runs : 1
0.00/0.08 c nodes : 1
0.00/0.08 c nodes (total) : 1
0.00/0.08 c nodes left : 0
0.00/0.08 c max depth : 0
0.00/0.08 c max depth (total): 0
0.00/0.08 c backtracks : 0 (0.0%)
0.00/0.08 c delayed cutoffs : 0
0.00/0.08 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.00/0.08 c avg switch length: 2.00
0.00/0.08 c switching time : 0.00
0.00/0.08 c Solution :
0.00/0.08 c Solutions found : 1 (1 improvements)
0.00/0.08 c First Solution : +3.00000000000000e+00 (in run 1, after 1 nodes, 0.07 seconds, depth 0, found by <undercover>)
0.00/0.08 c Primal Bound : +3.00000000000000e+00 (in run 1, after 1 nodes, 0.07 seconds, depth 0, found by <undercover>)
0.00/0.08 c Dual Bound : +3.00000000000000e+00
0.00/0.08 c Gap : 0.00 %
0.00/0.08 c Root Dual Bound : +3.00000000000000e+00
0.00/0.08 c Root Iterations : 116
0.00/0.08 c Time complete: 0.08.
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-3736447-1338707067/watcher-3736447-1338707067 -o /tmp/evaluation-result-3736447-1338707067/solver-3736447-1338707067 -C 1800 -W 1900 -M 15500 HOME/pbscip.linux.x86_64.gnu.opt.spx -f HOME/instance-3736447-1338707067.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.08 2.04 2.00 3/176 29151
/proc/meminfo: memFree=31472344/32873844 swapFree=7116/7116
[pid=29151] ppid=29149 vsize=8944 CPUtime=0 cores=1,3,5,7
/proc/29151/stat : 29151 (pbscip.linux.x8) R 29149 29151 25766 0 -1 4202496 1495 0 0 0 0 0 0 0 20 0 1 0 336835259 9158656 1442 33554432000 4194304 8395647 140736331032208 140734296400344 7382157 0 0 4096 0 0 0 0 17 5 0 0 0 0 0
/proc/29151/statm: 2236 1451 374 1026 0 1206 0
Solver just ended. Dumping a history of the last processes samples
Child status: 0
Real time (s): 0.089379
CPU time (s): 0.087986
CPU user time (s): 0.071989
CPU system time (s): 0.015997
CPU usage (%): 98.4414
Max. virtual memory (cumulated for all children) (KiB): 0
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 0.071989
system time used= 0.015997
maximum resident set size= 25280
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 11166
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.002999 second user time and 0.003999 second system time
The end