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-3731225-1338684167.opb>
0.00/0.00 c original problem has 9 variables (9 bin, 0 int, 0 impl, 0 cont) and 13 constraints
0.00/0.00 c problem read
0.00/0.00 c presolving settings loaded
0.00/0.00 o 9
0.00/0.00 c feasible solution found by trivial heuristic, objective value 9.000000e+00
0.00/0.00 c presolving:
0.00/0.01 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 13 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 9 variables (9 bin, 0 int, 0 impl, 0 cont) and 13 constraints
0.00/0.01 c 1 constraints of type <knapsack>
0.00/0.01 c 12 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 # 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 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 | 10 | - | 143k| 0 | 6 | 9 | 13 | 9 | 13 | 0 | 0 | 0 | 4.000000e+00 | 9.000000e+00 | 125.00%
0.00/0.01 o 7
0.00/0.01 c r 0.0s| 1 | 0 | 10 | - | 143k| 0 | 6 | 9 | 13 | 9 | 13 | 0 | 0 | 0 | 4.000000e+00 | 7.000000e+00 | 75.00%
0.00/0.01 o 6
0.00/0.01 c R 0.0s| 1 | 0 | 10 | - | 144k| 0 | 6 | 9 | 13 | 9 | 13 | 0 | 0 | 0 | 4.000000e+00 | 6.000000e+00 | 50.00%
0.00/0.01 o 5
0.00/0.01 c s 0.0s| 1 | 0 | 10 | - | 144k| 0 | 6 | 9 | 13 | 9 | 13 | 0 | 0 | 0 | 4.000000e+00 | 5.000000e+00 | 25.00%
0.00/0.02 c 0.0s| 1 | 0 | 12 | - | 145k| 0 | 6 | 9 | 13 | 9 | 14 | 1 | 0 | 0 | 4.000000e+00 | 5.000000e+00 | 25.00%
0.00/0.02 c 0.0s| 1 | 0 | 14 | - | 148k| 0 | 6 | 9 | 13 | 9 | 15 | 2 | 0 | 0 | 4.000000e+00 | 5.000000e+00 | 25.00%
0.00/0.02 c 0.0s| 1 | 0 | 15 | - | 152k| 0 | 6 | 9 | 13 | 9 | 16 | 3 | 0 | 0 | 4.000000e+00 | 5.000000e+00 | 25.00%
0.00/0.02 c 0.0s| 1 | 0 | 17 | - | 154k| 0 | 6 | 9 | 13 | 9 | 17 | 4 | 0 | 0 | 4.000000e+00 | 5.000000e+00 | 25.00%
0.00/0.02 c 0.0s| 1 | 0 | 19 | - | 158k| 0 | 8 | 9 | 13 | 9 | 18 | 5 | 0 | 0 | 4.000000e+00 | 5.000000e+00 | 25.00%
0.00/0.02 c 0.0s| 1 | 0 | 24 | - | 165k| 0 | 6 | 9 | 13 | 9 | 19 | 6 | 0 | 0 | 4.000000e+00 | 5.000000e+00 | 25.00%
0.00/0.02 c 0.0s| 1 | 0 | 24 | - | 166k| 0 | - | 9 | 13 | 9 | 19 | 6 | 0 | 6 | 4.000000e+00 | 5.000000e+00 | 25.00%
0.00/0.02 c (run 1, node 1) restarting after 2 global fixings of integer variables
0.00/0.02 c
0.00/0.02 c (restart) converted 6 cuts from the global cut pool into linear constraints
0.00/0.02 c
0.00/0.03 c presolving:
0.00/0.03 c (round 1) 3 del vars, 3 del conss, 0 chg bounds, 1 chg sides, 1 chg coeffs, 0 upgd conss, 12 impls, 0 clqs
0.00/0.03 c (round 2) 3 del vars, 6 del conss, 0 chg bounds, 4 chg sides, 7 chg coeffs, 4 upgd conss, 12 impls, 0 clqs
0.00/0.03 c (round 3) 3 del vars, 19 del conss, 0 chg bounds, 16 chg sides, 31 chg coeffs, 5 upgd conss, 12 impls, 0 clqs
0.00/0.03 c (round 4) 3 del vars, 23 del conss, 0 chg bounds, 19 chg sides, 37 chg coeffs, 5 upgd conss, 12 impls, 0 clqs
0.00/0.03 c presolving (5 rounds):
0.00/0.03 c 3 deleted vars, 23 deleted constraints, 0 tightened bounds, 0 added holes, 19 changed sides, 37 changed coefficients
0.00/0.03 c 12 implications, 0 cliques
0.00/0.03 c presolved problem has 6 variables (6 bin, 0 int, 0 impl, 0 cont) and 14 constraints
0.00/0.03 c 6 constraints of type <setppc>
0.00/0.03 c 8 constraints of type <logicor>
0.00/0.03 c transformed objective value is always integral (scale: 1)
0.00/0.03 c Presolving Time: 0.01
0.00/0.03 c
0.00/0.03 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.03 c 0.0s| 1 | 0 | 30 | - | 149k| 0 | 6 | 6 | 14 | 6 | 14 | 0 | 0 | 6 | 4.000000e+00 | 5.000000e+00 | 25.00%
0.00/0.03 o 5
0.00/0.03 c s 0.0s| 1 | 0 | 30 | - | 150k| 0 | 6 | 6 | 14 | 6 | 14 | 0 | 0 | 6 | 4.000000e+00 | 5.000000e+00 | 25.00%
0.00/0.03 c 0.0s| 1 | 0 | 33 | - | 151k| 0 | - | 6 | 14 | 6 | 15 | 1 | 0 | 6 | 5.000000e+00 | 5.000000e+00 | 0.00%
0.00/0.03 c 0.0s| 1 | 0 | 33 | - | 151k| 0 | - | 6 | 14 | 6 | 15 | 1 | 0 | 6 | 5.000000e+00 | 5.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.03
0.00/0.03 c Solving Nodes : 1 (total of 2 nodes in 2 runs)
0.00/0.03 c Primal Bound : +5.00000000000000e+00 (21 solutions)
0.00/0.03 c Dual Bound : +5.00000000000000e+00
0.00/0.03 c Gap : 0.00 %
0.00/0.03 s OPTIMUM FOUND
0.00/0.03 v 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.03
0.00/0.03 c Original Problem :
0.00/0.03 c Problem name : HOME/instance-3731225-1338684167.opb
0.00/0.03 c Variables : 9 (9 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.03 c Constraints : 13 initial, 13 maximal
0.00/0.03 c Presolved Problem :
0.00/0.03 c Problem name : t_HOME/instance-3731225-1338684167.opb
0.00/0.03 c Variables : 6 (6 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.03 c Constraints : 14 initial, 14 maximal
0.00/0.03 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.00/0.03 c trivial : 0.00 2 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 knapsack : 0.00 0 0 0 0 0 6 18 36
0.00/0.03 c setppc : 0.00 0 0 0 0 0 12 0 0
0.00/0.03 c linear : 0.00 0 0 0 0 0 1 1 1
0.00/0.03 c logicor : 0.00 1 0 0 0 0 4 0 0
0.00/0.03 c root node : - 2 - - 2 - - - -
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 1 0 0 2 0 0 0
0.00/0.03 c setppc : 6 1 1 0 0 0 0 0 0 0
0.00/0.03 c logicor : 8 7 10 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 setppc : 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 3 0 0
0.00/0.03 c rootredcost : 0.00 0 0 0
0.00/0.03 c pseudoobj : 0.00 5 1 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: 2)
0.00/0.03 c redcost : 0.00 7 0 0 0 0
0.00/0.03 c impliedbounds : 0.00 7 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 7 0 0 53 0
0.00/0.03 c strongcg : 0.00 7 0 0 53 0
0.00/0.03 c cmir : 0.00 7 0 0 0 0
0.00/0.03 c flowcover : 0.00 7 0 0 0 0
0.00/0.03 c clique : 0.00 2 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 2 0 0 0 0
0.00/0.03 c rapidlearning : 0.01 1 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 relpscost : 0.00 1 0 2 0 0 0
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 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 oneopt : 0.00 1 0
0.00/0.03 c trivial : 0.00 2 3
0.00/0.03 c simplerounding : 0.00 8 8
0.00/0.03 c zirounding : 0.00 1 1
0.00/0.03 c rounding : 0.00 8 1
0.00/0.03 c shifting : 0.00 8 8
0.00/0.03 c intshifting : 0.00 0 0
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.00 9 33 3.67 -
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 6 38 6.33 -
0.00/0.03 c (at root node) : - 6 38 6.33 -
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 : 2
0.00/0.03 c nodes : 1
0.00/0.03 c nodes (total) : 2
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 : 21 (5 improvements)
0.00/0.03 c First Solution : +9.00000000000000e+00 (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
0.00/0.03 c Primal Bound : +5.00000000000000e+00 (in run 2, after 1 nodes, 0.03 seconds, depth 0, found by <shifting>)
0.00/0.03 c Dual Bound : +5.00000000000000e+00
0.00/0.03 c Gap : 0.00 %
0.00/0.03 c Root Dual Bound : +5.00000000000000e+00
0.00/0.03 c Root Iterations : 33
0.00/0.03 c Time complete: 0.03.
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-3731225-1338684167/watcher-3731225-1338684167 -o /tmp/evaluation-result-3731225-1338684167/solver-3731225-1338684167 -C 1800 -W 1900 -M 15500 HOME/pbscip.linux.x86_64.gnu.opt.spx -f HOME/instance-3731225-1338684167.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: 1.89 1.97 1.93 2/176 22620
/proc/meminfo: memFree=27439788/32873648 swapFree=7388/7388
[pid=22620] ppid=22618 vsize=8944 CPUtime=0 cores=0,2,4,6
/proc/22620/stat : 22620 (pbscip.linux.x8) R 22618 22620 21664 0 -1 4202496 1499 0 0 0 0 0 0 0 20 0 1 0 334541161 9158656 1445 33554432000 4194304 8395647 140737400121776 140733421330680 7382157 0 0 4096 0 0 0 0 17 0 0 0 0 0 0
/proc/22620/statm: 2236 1456 374 1026 0 1206 0
Solver just ended. Dumping a history of the last processes samples
Child status: 0
Real time (s): 0.0367801
CPU time (s): 0.035994
CPU user time (s): 0.023996
CPU system time (s): 0.011998
CPU usage (%): 97.8627
Max. virtual memory (cumulated for all children) (KiB): 0
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 0.023996
system time used= 0.011998
maximum resident set size= 16856
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 5378
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.006998 second system time
The end