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-3731236-1338684167.opb>
0.00/0.00 c original problem has 15 variables (15 bin, 0 int, 0 impl, 0 cont) and 36 constraints
0.00/0.00 c problem read
0.00/0.00 c presolving settings loaded
0.00/0.00 o 15
0.00/0.00 c feasible solution found by trivial heuristic, objective value 1.500000e+01
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, 36 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 15 variables (15 bin, 0 int, 0 impl, 0 cont) and 36 constraints
0.00/0.01 c 1 constraints of type <knapsack>
0.00/0.01 c 35 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 | 18 | - | 185k| 0 | 12 | 15 | 36 | 15 | 36 | 0 | 0 | 0 | 7.000000e+00 | 1.500000e+01 | 114.29%
0.00/0.01 o 14
0.00/0.01 c R 0.0s| 1 | 0 | 18 | - | 186k| 0 | 12 | 15 | 36 | 15 | 36 | 0 | 0 | 0 | 7.000000e+00 | 1.400000e+01 | 100.00%
0.00/0.01 o 13
0.00/0.01 c s 0.0s| 1 | 0 | 18 | - | 187k| 0 | 12 | 15 | 36 | 15 | 36 | 0 | 0 | 0 | 7.000000e+00 | 1.300000e+01 | 85.71%
0.00/0.03 o 9
0.00/0.03 c y 0.0s| 1 | 0 | 18 | - | 223k| 0 | 12 | 15 | 36 | 15 | 36 | 0 | 0 | 0 | 7.000000e+00 | 9.000000e+00 | 28.57%
0.00/0.04 c 0.0s| 1 | 0 | 24 | - | 425k| 0 | 13 | 15 | 276 | 15 | 30 | 1 | 0 | 0 | 7.000000e+00 | 9.000000e+00 | 28.57%
0.00/0.04 o 9
0.00/0.04 c s 0.0s| 1 | 0 | 24 | - | 425k| 0 | 13 | 15 | 276 | 15 | 30 | 1 | 0 | 0 | 7.000000e+00 | 9.000000e+00 | 28.57%
0.00/0.04 c 0.0s| 1 | 0 | 29 | - | 456k| 0 | 13 | 15 | 276 | 15 | 31 | 2 | 0 | 0 | 7.000000e+00 | 9.000000e+00 | 28.57%
0.00/0.04 c 0.0s| 1 | 0 | 33 | - | 481k| 0 | 13 | 15 | 276 | 15 | 32 | 3 | 0 | 0 | 7.000000e+00 | 9.000000e+00 | 28.57%
0.00/0.04 c 0.0s| 1 | 0 | 39 | - | 515k| 0 | 14 | 15 | 276 | 15 | 33 | 4 | 0 | 0 | 7.000000e+00 | 9.000000e+00 | 28.57%
0.00/0.04 o 9
0.00/0.04 c s 0.0s| 1 | 0 | 39 | - | 515k| 0 | 14 | 15 | 276 | 15 | 33 | 4 | 0 | 0 | 7.000000e+00 | 9.000000e+00 | 28.57%
0.00/0.04 c 0.0s| 1 | 0 | 43 | - | 536k| 0 | 14 | 15 | 276 | 15 | 34 | 5 | 0 | 0 | 7.000000e+00 | 9.000000e+00 | 28.57%
0.00/0.04 c 0.0s| 1 | 0 | 49 | - | 547k| 0 | 14 | 15 | 276 | 15 | 35 | 6 | 0 | 0 | 7.000000e+00 | 9.000000e+00 | 28.57%
0.00/0.05 c 0.0s| 1 | 2 | 49 | - | 549k| 0 | 14 | 15 | 276 | 15 | 35 | 6 | 0 | 9 | 7.000000e+00 | 9.000000e+00 | 28.57%
0.00/0.05 c (run 1, node 1) restarting after 1 global fixings of integer variables
0.00/0.05 c
0.00/0.05 c (restart) converted 4 cuts from the global cut pool into linear constraints
0.00/0.05 c
0.00/0.05 c presolving:
0.00/0.05 c (round 1) 1 del vars, 10 del conss, 0 chg bounds, 3 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs
0.00/0.05 c (round 2) 1 del vars, 47 del conss, 0 chg bounds, 3 chg sides, 0 chg coeffs, 241 upgd conss, 0 impls, 0 clqs
0.00/0.05 c presolving (3 rounds):
0.00/0.05 c 1 deleted vars, 47 deleted constraints, 0 tightened bounds, 0 added holes, 3 changed sides, 0 changed coefficients
0.00/0.05 c 0 implications, 0 cliques
0.00/0.05 c presolved problem has 14 variables (14 bin, 0 int, 0 impl, 0 cont) and 233 constraints
0.00/0.05 c 5 constraints of type <knapsack>
0.00/0.05 c 228 constraints of type <logicor>
0.00/0.05 c transformed objective value is always integral (scale: 1)
0.00/0.05 c Presolving Time: 0.01
0.00/0.05 c
0.00/0.05 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.05 c 0.0s| 1 | 0 | 70 | - | 310k| 0 | 14 | 14 | 233 | 14 | 33 | 0 | 0 | 9 | 7.000000e+00 | 9.000000e+00 | 28.57%
0.00/0.05 c 0.0s| 1 | 0 | 74 | - | 319k| 0 | 14 | 14 | 233 | 14 | 34 | 1 | 0 | 9 | 7.000000e+00 | 9.000000e+00 | 28.57%
0.00/0.05 o 9
0.00/0.05 c s 0.0s| 1 | 0 | 74 | - | 320k| 0 | 14 | 14 | 233 | 14 | 34 | 1 | 0 | 9 | 7.000000e+00 | 9.000000e+00 | 28.57%
0.00/0.06 c 0.1s| 1 | 2 | 74 | - | 321k| 0 | 14 | 14 | 233 | 14 | 34 | 1 | 0 | 23 | 7.000000e+00 | 9.000000e+00 | 28.57%
0.00/0.07 o 9
0.00/0.07 c z 0.1s| 9 | 2 | 136 | 7.8 | 331k| 3 | 10 | 14 | 233 | 14 | 34 | 1 | 0 | 77 | 7.184211e+00 | 9.000000e+00 | 25.27%
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.07
0.00/0.08 c Solving Nodes : 17 (total of 18 nodes in 2 runs)
0.00/0.08 c Primal Bound : +9.00000000000000e+00 (39 solutions)
0.00/0.08 c Dual Bound : +9.00000000000000e+00
0.00/0.08 c Gap : 0.00 %
0.00/0.08 s OPTIMUM FOUND
0.00/0.08 v x15 x14 x13 x12 -x11 -x10 x9 -x8 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.07
0.00/0.08 c Original Problem :
0.00/0.08 c Problem name : HOME/instance-3731236-1338684167.opb
0.00/0.08 c Variables : 15 (15 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.08 c Constraints : 36 initial, 36 maximal
0.00/0.08 c Presolved Problem :
0.00/0.08 c Problem name : t_HOME/instance-3731236-1338684167.opb
0.00/0.08 c Variables : 14 (14 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.08 c Constraints : 233 initial, 235 maximal
0.00/0.08 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.00/0.08 c trivial : 0.00 1 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 knapsack : 0.00 0 0 0 0 0 0 0 0
0.00/0.08 c linear : 0.00 0 0 0 0 0 3 3 0
0.00/0.08 c logicor : 0.00 0 0 0 0 0 44 0 0
0.00/0.08 c root node : - 2 - - 2 - - - -
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 18 0 6 11 0 0 18
0.00/0.08 c knapsack : 5 8 70 0 0 0 0 1 0 0
0.00/0.08 c logicor : 228+ 8 50 0 0 1 10 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.02 0.00 0.00 0.02 0.00
0.00/0.08 c knapsack : 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 3 0 0
0.00/0.08 c rootredcost : 0.00 0 0 0
0.00/0.08 c pseudoobj : 0.00 44 1 2
0.00/0.08 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.00/0.08 c propagation : 0.00 1 1 2 7.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 : - - - 2 7.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: 14)
0.00/0.08 c redcost : 0.00 24 0 1 0 0
0.00/0.08 c impliedbounds : 0.00 7 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 7 0 0 136 0
0.00/0.08 c strongcg : 0.00 7 0 0 156 0
0.00/0.08 c cmir : 0.00 7 0 0 2 0
0.00/0.08 c flowcover : 0.00 7 0 0 2 0
0.00/0.08 c clique : 0.00 2 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 2 0 0 0 0
0.00/0.08 c rapidlearning : 0.03 1 0 1 0 254
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 relpscost : 0.02 18 6 11 0 0 18
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 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 crossover : 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 objpscostdiving : 0.00 0 0
0.00/0.08 c oneopt : 0.00 5 1
0.00/0.08 c pscostdiving : 0.00 1 1
0.00/0.08 c trivial : 0.00 2 3
0.00/0.08 c simplerounding : 0.00 25 12
0.00/0.08 c zirounding : 0.00 15 12
0.00/0.08 c rounding : 0.00 25 1
0.00/0.08 c shifting : 0.00 9 7
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 0 0
0.00/0.08 c coefdiving : 0.00 1 1
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 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 dins : 0.00 0 0
0.00/0.08 c undercover : 0.00 0 0
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 28 179 6.39 -
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 6 23 3.83 -
0.00/0.08 c strong branching : 0.02 119 1658 13.93 77098.35
0.00/0.08 c (at root node) : - 23 526 22.87 -
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 : 2
0.00/0.08 c nodes : 17
0.00/0.08 c nodes (total) : 18
0.00/0.08 c nodes left : 0
0.00/0.08 c max depth : 4
0.00/0.08 c max depth (total): 4
0.00/0.08 c backtracks : 3 (17.6%)
0.00/0.08 c delayed cutoffs : 0
0.00/0.08 c repropagations : 1 (1 domain reductions, 0 cutoffs)
0.00/0.08 c avg switch length: 2.24
0.00/0.08 c switching time : 0.00
0.00/0.08 c Solution :
0.00/0.08 c Solutions found : 39 (8 improvements)
0.00/0.08 c First Solution : +1.50000000000000e+01 (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
0.00/0.08 c Primal Bound : +9.00000000000000e+00 (in run 2, after 9 nodes, 0.07 seconds, depth 3, found by <zirounding>)
0.00/0.08 c Dual Bound : +9.00000000000000e+00
0.00/0.08 c Gap : 0.00 %
0.00/0.08 c Root Dual Bound : +7.00000000000000e+00
0.00/0.08 c Root Iterations : 74
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-3731236-1338684167/watcher-3731236-1338684167 -o /tmp/evaluation-result-3731236-1338684167/solver-3731236-1338684167 -C 1800 -W 1900 -M 15500 HOME/pbscip.linux.x86_64.gnu.opt.spx -f HOME/instance-3731236-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 3/176 22658
/proc/meminfo: memFree=27439152/32873648 swapFree=7388/7388
[pid=22658] ppid=22656 vsize=8944 CPUtime=0 cores=0,2,4,6
/proc/22658/stat : 22658 (pbscip.linux.x8) R 22656 22658 21664 0 -1 4202496 1391 0 0 0 0 0 0 0 20 0 1 0 334541183 9158656 1338 33554432000 4194304 8395647 140736121095376 140733708583368 7382157 0 0 4096 0 0 0 0 17 0 0 0 0 0 0
/proc/22658/statm: 2236 1349 374 1026 0 1206 0
[startup+0.0143241 s]
/proc/loadavg: 1.89 1.97 1.93 3/176 22658
/proc/meminfo: memFree=27439152/32873648 swapFree=7388/7388
[pid=22658] ppid=22656 vsize=16008 CPUtime=0 cores=0,2,4,6
/proc/22658/stat : 22658 (pbscip.linux.x8) R 22656 22658 21664 0 -1 4202496 3248 0 0 0 0 0 0 0 20 0 1 0 334541183 16392192 2843 33554432000 4194304 8395647 140736121095376 140733708583368 7382157 0 0 4096 16384 0 0 0 17 0 0 0 0 0 0
/proc/22658/statm: 4002 2849 598 1026 0 2972 0
Current children cumulated CPU time (s) 0
Current children cumulated vsize (KiB) 16008
Solver just ended. Dumping a history of the last processes samples
[startup+0.0143241 s]
/proc/loadavg: 1.89 1.97 1.93 3/176 22658
/proc/meminfo: memFree=27439152/32873648 swapFree=7388/7388
[pid=22658] ppid=22656 vsize=16008 CPUtime=0 cores=0,2,4,6
/proc/22658/stat : 22658 (pbscip.linux.x8) R 22656 22658 21664 0 -1 4202496 3248 0 0 0 0 0 0 0 20 0 1 0 334541183 16392192 2843 33554432000 4194304 8395647 140736121095376 140733708583368 7382157 0 0 4096 16384 0 0 0 17 0 0 0 0 0 0
/proc/22658/statm: 4002 2849 598 1026 0 2972 0
Current children cumulated CPU time (s) 0
Current children cumulated vsize (KiB) 16008
Child status: 0
Real time (s): 0.086357
CPU time (s): 0.084986
CPU user time (s): 0.072988
CPU system time (s): 0.011998
CPU usage (%): 98.4124
Max. virtual memory (cumulated for all children) (KiB): 16008
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 0.072988
system time used= 0.011998
maximum resident set size= 18824
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 5115
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.004999 second system time
The end