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-3734459-1338700294.opb>
0.00/0.00 c original problem has 67 variables (67 bin, 0 int, 0 impl, 0 cont) and 105 constraints
0.00/0.00 c problem read
0.00/0.00 c presolving settings loaded
0.00/0.01 o 67
0.00/0.01 c feasible solution found by trivial heuristic, objective value 6.700000e+01
0.00/0.01 c presolving:
0.00/0.01 c (round 1) 0 del vars, 55 del conss, 0 chg bounds, 55 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 0 clqs
0.00/0.01 c (round 2) 0 del vars, 55 del conss, 0 chg bounds, 55 chg sides, 0 chg coeffs, 50 upgd conss, 0 impls, 0 clqs
0.00/0.01 c presolving (3 rounds):
0.00/0.01 c 0 deleted vars, 55 deleted constraints, 0 tightened bounds, 0 added holes, 55 changed sides, 0 changed coefficients
0.00/0.01 c 0 implications, 0 cliques
0.00/0.01 c presolved problem has 67 variables (67 bin, 0 int, 0 impl, 0 cont) and 50 constraints
0.00/0.01 c 50 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 # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01 c conflict/interconss = 0
0.00/0.01 c
0.00/0.01 c # should binary conflicts be preferred?
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c conflict/preferbinary = TRUE
0.00/0.01 c
0.00/0.01 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01 c constraints/agelimit = 1
0.00/0.01 c
0.00/0.01 c # should enforcement of pseudo solution be disabled?
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c constraints/disableenfops = TRUE
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 # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01 c lp/solvefreq = 0
0.00/0.01 c
0.00/0.01 c # LP pricing strategy ('l'pi default, 'a'uto, 'f'ull pricing, 'p'artial, 's'teepest edge pricing, 'q'uickstart steepest edge pricing, 'd'evex pricing)
0.00/0.01 c # [type: char, range: {lafpsqd}, default: l]
0.00/0.01 c lp/pricing = a
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 # priority of node selection rule <dfs> in standard mode
0.00/0.01 c # [type: int, range: [-536870912,536870911], default: 0]
0.00/0.01 c nodeselection/dfs/stdpriority = 1000000
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 | 39 | - | 464k| 0 | 12 | 67 | 50 | 67 | 50 | 0 | 0 | 0 | 6.000000e+00 | 6.700000e+01 |1016.67%
0.00/0.01 o 13
0.00/0.01 c r 0.0s| 1 | 0 | 39 | - | 465k| 0 | 12 | 67 | 50 | 67 | 50 | 0 | 0 | 0 | 6.000000e+00 | 1.300000e+01 | 116.67%
0.00/0.01 o 12
0.00/0.01 c R 0.0s| 1 | 0 | 39 | - | 467k| 0 | 12 | 67 | 50 | 67 | 50 | 0 | 0 | 0 | 6.000000e+00 | 1.200000e+01 | 100.00%
0.00/0.01 o 11
0.00/0.01 c s 0.0s| 1 | 0 | 39 | - | 468k| 0 | 12 | 67 | 50 | 67 | 50 | 0 | 0 | 0 | 6.000000e+00 | 1.100000e+01 | 83.33%
0.00/0.01 c 0.0s| 1 | 0 | 51 | - | 489k| 0 | 14 | 67 | 50 | 67 | 54 | 4 | 0 | 0 | 6.500000e+00 | 1.100000e+01 | 69.23%
0.00/0.01 o 8
0.00/0.01 c b 0.0s| 1 | 0 | 51 | - | 491k| 0 | 14 | 67 | 50 | 67 | 54 | 4 | 0 | 0 | 6.500000e+00 | 8.000000e+00 | 23.08%
0.00/0.02 c 0.0s| 1 | 0 | 59 | - | 514k| 0 | 5 | 67 | 50 | 67 | 56 | 6 | 0 | 0 | 6.500000e+00 | 8.000000e+00 | 23.08%
0.00/0.02 c 0.0s| 1 | 0 | 66 | - | 538k| 0 | 11 | 67 | 50 | 67 | 58 | 8 | 0 | 0 | 6.500000e+00 | 8.000000e+00 | 23.08%
0.00/0.02 c 0.0s| 1 | 0 | 75 | - | 565k| 0 | 14 | 67 | 50 | 67 | 59 | 9 | 0 | 0 | 7.000000e+00 | 8.000000e+00 | 14.29%
0.00/0.03 c 0.0s| 1 | 0 | 77 | - | 613k| 0 | 12 | 67 | 50 | 67 | 60 | 10 | 0 | 0 | 7.000000e+00 | 8.000000e+00 | 14.29%
0.00/0.03 c 0.0s| 1 | 0 | 80 | - | 630k| 0 | 11 | 67 | 50 | 67 | 61 | 11 | 0 | 0 | 7.000000e+00 | 8.000000e+00 | 14.29%
0.00/0.03 c 0.0s| 1 | 0 | 85 | - | 649k| 0 | 11 | 67 | 50 | 67 | 62 | 12 | 0 | 0 | 7.000000e+00 | 8.000000e+00 | 14.29%
0.00/0.04 c 0.0s| 1 | 0 | 95 | - | 672k| 0 | 17 | 67 | 50 | 67 | 63 | 13 | 0 | 0 | 7.000000e+00 | 8.000000e+00 | 14.29%
0.00/0.04 c 0.0s| 1 | 0 | 109 | - | 773k| 0 | 16 | 67 | 50 | 67 | 64 | 14 | 0 | 0 | 7.000000e+00 | 8.000000e+00 | 14.29%
0.00/0.05 c 0.0s| 1 | 0 | 117 | - | 833k| 0 | 19 | 67 | 50 | 67 | 65 | 15 | 0 | 0 | 7.000000e+00 | 8.000000e+00 | 14.29%
0.00/0.06 o 7
0.00/0.06 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.06 c E 0.1s| 1 | 0 | 117 | - | 836k| 0 | - | 67 | 50 | 67 | 65 | 15 | 0 | 0 | 7.000000e+00 | 7.000000e+00 | 0.00%
0.00/0.06 c 0.1s| 1 | 0 | 117 | - | 836k| 0 | - | 67 | 50 | 67 | 65 | 15 | 0 | 0 | 7.000000e+00 | 7.000000e+00 | 0.00%
0.00/0.06 c
0.00/0.06 c SCIP Status : problem is solved [optimal solution found]
0.00/0.06 c Solving Time (sec) : 0.05
0.00/0.06 c Solving Nodes : 1
0.00/0.06 c Primal Bound : +7.00000000000000e+00 (22 solutions)
0.00/0.06 c Dual Bound : +7.00000000000000e+00
0.00/0.06 c Gap : 0.00 %
0.00/0.06 s OPTIMUM FOUND
0.00/0.06 v -x67 -x66 -x65 -x64 -x63 -x62 -x61 -x60 -x59 -x58 -x57 -x56 -x55 -x54 -x53 -x52 -x51 -x50 -x49 -x48 -x47 -x46 -x45 -x44 -x43 -x42
0.00/0.06 v -x41 -x40 -x39 x38 -x37 -x36 -x35 x34 -x33 -x32 -x31 -x30 -x29 -x28 -x27 x26 x25 -x24 -x23 -x22 -x21 x20 -x19 -x18 -x17 -x16
0.00/0.06 v -x15 x14 -x13 -x12 -x11 -x10 -x9 x8 -x7 -x6 -x5 -x4 -x3 -x2 -x1
0.00/0.06 c SCIP Status : problem is solved [optimal solution found]
0.00/0.06 c Solving Time : 0.05
0.00/0.06 c Original Problem :
0.00/0.06 c Problem name : HOME/instance-3734459-1338700294.opb
0.00/0.06 c Variables : 67 (67 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.06 c Constraints : 105 initial, 105 maximal
0.00/0.06 c Presolved Problem :
0.00/0.06 c Problem name : t_HOME/instance-3734459-1338700294.opb
0.00/0.06 c Variables : 67 (67 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.06 c Constraints : 50 initial, 50 maximal
0.00/0.06 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.00/0.06 c trivial : 0.00 0 0 0 0 0 0 0 0
0.00/0.06 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.00/0.06 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.00/0.06 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.00/0.06 c implics : 0.00 0 0 0 0 0 0 0 0
0.00/0.06 c probing : 0.00 0 0 0 0 0 0 0 0
0.00/0.06 c linear : 0.00 0 0 0 0 0 55 55 0
0.00/0.06 c logicor : 0.00 0 0 0 0 0 0 0 0
0.00/0.06 c root node : - 16 - - 16 - - - -
0.00/0.06 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.00/0.06 c integral : 0 0 0 0 0 0 0 0 0 0
0.00/0.06 c logicor : 50 10 54 0 0 0 0 0 0 0
0.00/0.06 c countsols : 0 0 0 0 0 0 0 0 0 0
0.00/0.06 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.00/0.06 c integral : 0.00 0.00 0.00 0.00 0.00
0.00/0.06 c logicor : 0.00 0.00 0.00 0.00 0.00
0.00/0.06 c countsols : 0.00 0.00 0.00 0.00 0.00
0.00/0.06 c Propagators : Time Calls Cutoffs DomReds
0.00/0.06 c vbounds : 0.00 2 0 0
0.00/0.06 c rootredcost : 0.00 0 0 0
0.00/0.06 c pseudoobj : 0.00 5 0 0
0.00/0.06 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.00/0.06 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.00/0.06 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.06 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.06 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.06 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.00/0.06 c applied globally : - - - 0 0.0 - - -
0.00/0.06 c applied locally : - - - 0 0.0 - - -
0.00/0.06 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.00/0.06 c cut pool : 0.00 9 - - 50 - (maximal pool size: 173)
0.00/0.06 c redcost : 0.00 10 0 16 0 0
0.00/0.06 c impliedbounds : 0.00 10 0 0 0 0
0.00/0.06 c intobj : 0.00 0 0 0 0 0
0.00/0.06 c cgmip : 0.00 0 0 0 0 0
0.00/0.06 c gomory : 0.01 10 0 0 397 0
0.00/0.06 c strongcg : 0.01 10 0 0 386 0
0.00/0.06 c cmir : 0.00 10 0 0 1 0
0.00/0.06 c flowcover : 0.01 10 0 0 2 0
0.00/0.06 c clique : 0.00 1 0 0 0 0
0.00/0.06 c zerohalf : 0.00 0 0 0 0 0
0.00/0.06 c mcf : 0.00 1 0 0 0 0
0.00/0.06 c rapidlearning : 0.00 0 0 0 0 0
0.00/0.06 c Pricers : Time Calls Vars
0.00/0.06 c problem variables: 0.00 0 0
0.00/0.06 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.00/0.06 c pscost : 0.00 0 0 0 0 0 0
0.00/0.06 c inference : 0.00 0 0 0 0 0 0
0.00/0.06 c mostinf : 0.00 0 0 0 0 0 0
0.00/0.06 c leastinf : 0.00 0 0 0 0 0 0
0.00/0.06 c fullstrong : 0.00 0 0 0 0 0 0
0.00/0.06 c allfullstrong : 0.00 0 0 0 0 0 0
0.00/0.06 c random : 0.00 0 0 0 0 0 0
0.00/0.06 c relpscost : 0.00 0 0 0 0 0 0
0.00/0.06 c Primal Heuristics : Time Calls Found
0.00/0.06 c LP solutions : 0.00 - 0
0.00/0.06 c pseudo solutions : 0.00 - 0
0.00/0.06 c crossover : 0.00 0 0
0.00/0.06 c oneopt : 0.00 2 1
0.00/0.06 c trivial : 0.00 2 3
0.00/0.06 c simplerounding : 0.00 11 11
0.00/0.06 c zirounding : 0.00 1 1
0.00/0.06 c rounding : 0.00 11 1
0.00/0.06 c shifting : 0.00 11 4
0.00/0.06 c intshifting : 0.00 0 0
0.00/0.06 c twoopt : 0.00 0 0
0.00/0.06 c fixandinfer : 0.00 0 0
0.00/0.06 c feaspump : 0.00 0 0
0.00/0.06 c coefdiving : 0.00 0 0
0.00/0.06 c pscostdiving : 0.00 0 0
0.00/0.06 c fracdiving : 0.00 0 0
0.00/0.06 c veclendiving : 0.00 0 0
0.00/0.06 c intdiving : 0.00 0 0
0.00/0.06 c actconsdiving : 0.00 0 0
0.00/0.06 c objpscostdiving : 0.00 0 0
0.00/0.06 c rootsoldiving : 0.00 0 0
0.00/0.06 c linesearchdiving : 0.00 0 0
0.00/0.06 c guideddiving : 0.00 0 0
0.00/0.06 c octane : 0.00 0 0
0.00/0.06 c rens : 0.01 1 1
0.00/0.06 c rins : 0.00 0 0
0.00/0.06 c localbranching : 0.00 0 0
0.00/0.06 c mutation : 0.00 0 0
0.00/0.06 c dins : 0.00 0 0
0.00/0.06 c undercover : 0.00 0 0
0.00/0.06 c nlp : 0.00 0 0
0.00/0.06 c trysol : 0.00 0 0
0.00/0.06 c LP : Time Calls Iterations Iter/call Iter/sec
0.00/0.06 c primal LP : 0.00 0 0 0.00 -
0.00/0.06 c dual LP : 0.00 11 117 10.64 -
0.00/0.06 c lex dual LP : 0.00 0 0 0.00 -
0.00/0.06 c barrier LP : 0.00 0 0 0.00 -
0.00/0.06 c diving/probing LP: 0.00 0 0 0.00 -
0.00/0.06 c strong branching : 0.00 0 0 0.00 -
0.00/0.06 c (at root node) : - 0 0 0.00 -
0.00/0.06 c conflict analysis: 0.00 0 0 0.00 -
0.00/0.06 c B&B Tree :
0.00/0.06 c number of runs : 1
0.00/0.06 c nodes : 1
0.00/0.06 c nodes (total) : 1
0.00/0.06 c nodes left : 0
0.00/0.06 c max depth : 0
0.00/0.06 c max depth (total): 0
0.00/0.06 c backtracks : 0 (0.0%)
0.00/0.06 c delayed cutoffs : 0
0.00/0.06 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.00/0.06 c avg switch length: 2.00
0.00/0.06 c switching time : 0.00
0.00/0.06 c Solution :
0.00/0.06 c Solutions found : 22 (6 improvements)
0.00/0.06 c First Solution : +6.70000000000000e+01 (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
0.00/0.06 c Primal Bound : +7.00000000000000e+00 (in run 1, after 1 nodes, 0.05 seconds, depth 0, found by <rens>)
0.00/0.06 c Dual Bound : +7.00000000000000e+00
0.00/0.06 c Gap : 0.00 %
0.00/0.06 c Root Dual Bound : +7.00000000000000e+00
0.00/0.06 c Root Iterations : 117
0.05/0.06 c Time complete: 0.06.
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-3734459-1338700294/watcher-3734459-1338700294 -o /tmp/evaluation-result-3734459-1338700294/solver-3734459-1338700294 -C 1800 -W 1900 -M 15500 HOME/pbscip.linux.x86_64.gnu.opt.spx -f HOME/instance-3734459-1338700294.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.02 2.00 2/176 24010
/proc/meminfo: memFree=26815044/32873844 swapFree=7628/7628
[pid=24010] ppid=24008 vsize=9972 CPUtime=0 cores=1,3,5,7
/proc/24010/stat : 24010 (pbscip.linux.x8) R 24008 24010 20882 0 -1 4202496 1617 0 0 0 0 0 0 0 20 0 1 0 336157926 10211328 1564 33554432000 4194304 8395647 140735886987472 140735886919304 7382157 0 0 4096 0 0 0 0 17 5 0 0 0 0 0
/proc/24010/statm: 2493 1573 374 1026 0 1463 0
[startup+0.0660519 s]
/proc/loadavg: 2.08 2.02 2.00 2/176 24010
/proc/meminfo: memFree=26815044/32873844 swapFree=7628/7628
[pid=24010] ppid=24008 vsize=15064 CPUtime=0.05 cores=1,3,5,7
/proc/24010/stat : 24010 (pbscip.linux.x8) R 24008 24010 20882 0 -1 4202496 5105 0 0 0 5 0 0 0 20 0 1 0 336157926 15425536 2930 33554432000 4194304 8395647 140735886987472 140735886919304 4288144 0 0 4096 0 0 0 0 17 5 0 0 0 0 0
/proc/24010/statm: 3766 2930 624 1026 0 2736 0
Current children cumulated CPU time (s) 0.05
Current children cumulated vsize (KiB) 15064
Solver just ended. Dumping a history of the last processes samples
[startup+0.0660519 s]
/proc/loadavg: 2.08 2.02 2.00 2/176 24010
/proc/meminfo: memFree=26815044/32873844 swapFree=7628/7628
[pid=24010] ppid=24008 vsize=15064 CPUtime=0.05 cores=1,3,5,7
/proc/24010/stat : 24010 (pbscip.linux.x8) R 24008 24010 20882 0 -1 4202496 5105 0 0 0 5 0 0 0 20 0 1 0 336157926 15425536 2930 33554432000 4194304 8395647 140735886987472 140735886919304 4288144 0 0 4096 0 0 0 0 17 5 0 0 0 0 0
/proc/24010/statm: 3766 2930 624 1026 0 2736 0
Current children cumulated CPU time (s) 0.05
Current children cumulated vsize (KiB) 15064
Child status: 0
Real time (s): 0.068892
CPU time (s): 0.067989
CPU user time (s): 0.056991
CPU system time (s): 0.010998
CPU usage (%): 98.6893
Max. virtual memory (cumulated for all children) (KiB): 15064
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 0.056991
system time used= 0.010998
maximum resident set size= 18780
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 5108
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.001999 second user time and 0.007998 second system time
The end