0.00/0.00 c SCIP version 2.0.1.4 [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-3484886-1307779550.opb>
0.00/0.00 c original problem has 168 variables (168 bin, 0 int, 0 impl, 0 cont) and 17 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) 8 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 45 chg coeffs, 0 upgd conss, 2450 impls, 0 clqs
0.00/0.01 c (round 2) 22 del vars, 12 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 57 chg coeffs, 9 upgd conss, 3626 impls, 0 clqs
0.00/0.02 c (round 3) 36 del vars, 24 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 69 chg coeffs, 9 upgd conss, 4634 impls, 0 clqs
0.00/0.02 c (round 4) 50 del vars, 36 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 81 chg coeffs, 9 upgd conss, 5474 impls, 0 clqs
0.00/0.02 c (round 5) 64 del vars, 48 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 93 chg coeffs, 9 upgd conss, 6146 impls, 0 clqs
0.00/0.02 c (round 6) 78 del vars, 60 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 105 chg coeffs, 9 upgd conss, 6650 impls, 0 clqs
0.00/0.02 c (round 7) 92 del vars, 72 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 117 chg coeffs, 9 upgd conss, 6986 impls, 0 clqs
0.00/0.02 c (round 8) 106 del vars, 84 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 129 chg coeffs, 9 upgd conss, 7154 impls, 0 clqs
0.00/0.02 c (round 9) 120 del vars, 96 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 141 chg coeffs, 9 upgd conss, 7154 impls, 0 clqs
0.00/0.03 c (0.0s) probing: 192/440 (43.6%) - 0 fixings, 0 aggregations, 16 implications, 0 bound changes
0.00/0.03 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.00/0.03 c presolving (10 rounds):
0.00/0.03 c 120 deleted vars, 96 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 141 changed coefficients
0.00/0.03 c 7186 implications, 0 cliques
0.00/0.03 c presolved problem has 440 variables (440 bin, 0 int, 0 impl, 0 cont) and 305 constraints
0.00/0.03 c 288 constraints of type <and>
0.00/0.03 c 8 constraints of type <linear>
0.00/0.03 c 9 constraints of type <logicor>
0.00/0.03 c transformed objective value is always integral (scale: 2)
0.00/0.03 c Presolving Time: 0.03
0.00/0.03 c - non default parameters ----------------------------------------------------------------------
0.00/0.03 c # SCIP version 2.0.1.4
0.00/0.03 c
0.00/0.03 c # frequency for displaying node information lines
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.03 c display/freq = 10000
0.00/0.03 c
0.00/0.03 c # maximal time in seconds to run
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/time = 1797
0.00/0.03 c
0.00/0.03 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/memory = 13950
0.00/0.03 c
0.00/0.03 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.03 c # [type: int, range: [1,2], default: 1]
0.00/0.03 c timing/clocktype = 2
0.00/0.03 c
0.00/0.03 c # belongs reading time to solving time?
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c timing/reading = TRUE
0.00/0.03 c
0.00/0.03 c # should presolving try to simplify inequalities
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/linear/simplifyinequalities = TRUE
0.00/0.03 c
0.00/0.03 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/indicator/addCouplingCons = TRUE
0.00/0.03 c
0.00/0.03 c # should presolving try to simplify knapsacks
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.03 c
0.00/0.03 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c separating/rapidlearning/freq = 0
0.00/0.03 c
0.00/0.03 c -----------------------------------------------------------------------------------------------
0.00/0.03 c start solving
0.00/0.03 c
0.00/0.04 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.04 c 0.0s| 1 | 0 | 20 | - |1952k| 0 | 11 | 440 | 306 | 440 | 593 | 0 | 10 | 0 | 3.000000e+00 | -- | Inf
0.10/0.10 o 3
0.10/0.10 c U 0.1s| 1 | 0 | 250 | - |1986k| 0 | - | 440 | 306 | 440 | 593 | 0 | 10 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.10/0.11 c 0.1s| 1 | 0 | 250 | - |1979k| 0 | - | 440 | 307 | 440 | 593 | 0 | 10 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.10/0.11 c
0.10/0.11 c SCIP Status : problem is solved [optimal solution found]
0.10/0.11 c Solving Time (sec) : 0.11
0.10/0.11 c Solving Nodes : 1
0.10/0.11 c Primal Bound : +3.00000000000000e+00 (1 solutions)
0.10/0.11 c Dual Bound : +3.00000000000000e+00
0.10/0.11 c Gap : 0.00 %
0.10/0.11 s OPTIMUM FOUND
0.10/0.11 v -x168 -x167 -x166 -x165 -x164 x163 x162 -x161 -x160 -x159 -x158 -x157 -x156 x155 -x112 -x111 -x110 -x109 x108 x107 x106 -x154 -x153
0.10/0.11 v -x152 -x151 -x150 -x149 -x148 -x105 x104 -x103 x102 x101 -x100 x99 -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x98 -x97 -x96
0.10/0.11 v x95 x94 x93 x92 -x140 -x139 -x138 -x137 -x136 x135 -x134 -x91 -x90 -x89 -x88 x87 -x86 x85 -x133 -x132 -x131 -x130 -x129 -x128
0.10/0.11 v -x127 x84 -x83 x82 -x81 x80 x79 x78 -x126 -x125 -x124 -x123 -x122 x121 -x120 -x77 -x76 x75 x74 x73 -x72 x71 -x119 -x118
0.10/0.11 v -x117 -x116 -x115 x114 -x113 x70 -x69 x68 x67 x66 x65 x64 x63 -x62 -x61 -x60 -x59 x58 x57 -x56 -x55 -x54 -x53 -x52 x51 x50 -x49
0.10/0.11 v -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.10/0.11 v x22 -x21 -x20 -x19 -x18 -x17 x16 x15 x14 x13 x12 -x11 x10 -x9 x8 -x7 -x6 -x5 -x4 -x3 x2 x1
0.10/0.11 c SCIP Status : problem is solved [optimal solution found]
0.10/0.11 c Total Time : 0.11
0.10/0.11 c solving : 0.11
0.10/0.11 c presolving : 0.03 (included in solving)
0.10/0.11 c reading : 0.00 (included in solving)
0.10/0.11 c Original Problem :
0.10/0.11 c Problem name : HOME/instance-3484886-1307779550.opb
0.10/0.11 c Variables : 168 (168 binary, 0 integer, 0 implicit integer, 0 continuous)
0.10/0.11 c Constraints : 17 initial, 17 maximal
0.10/0.11 c Presolved Problem :
0.10/0.11 c Problem name : t_HOME/instance-3484886-1307779550.opb
0.10/0.11 c Variables : 440 (440 binary, 0 integer, 0 implicit integer, 0 continuous)
0.10/0.11 c Constraints : 305 initial, 307 maximal
0.10/0.11 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.10/0.11 c trivial : 0.00 0 0 0 0 0 0 0 0 0
0.10/0.11 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
0.10/0.11 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
0.10/0.11 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
0.10/0.11 c implics : 0.00 0 0 0 0 0 0 0 0 0
0.10/0.11 c probing : 0.01 0 0 0 0 0 0 0 0 0
0.10/0.11 c and : 0.01 16 96 0 0 0 96 0 0 96
0.10/0.11 c linear : 0.00 1 7 0 0 0 0 0 0 45
0.10/0.11 c logicor : 0.00 0 0 0 0 0 0 0 0 0
0.10/0.11 c root node : - 0 - - 0 - - - - -
0.10/0.11 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
0.10/0.11 c integral : 0 0 0 0 0 7 0 0 0 0 0 0
0.10/0.11 c and : 288 0 604 0 0 4 2055 0 0 0 0 0
0.10/0.11 c linear : 8 0 604 0 0 3 688 9 0 0 0 0
0.10/0.11 c logicor : 9+ 0 108 0 0 1 81 6 0 0 0 0
0.10/0.11 c countsols : 0 0 0 0 0 3 0 0 0 0 0 0
0.10/0.11 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
0.10/0.11 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.10/0.11 c and : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.10/0.11 c linear : 0.01 0.00 0.01 0.00 0.00 0.00 0.00
0.10/0.11 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.10/0.11 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.10/0.11 c Propagators : #Propagate #Resprop Cutoffs DomReds
0.10/0.11 c vbounds : 0 0 0 0
0.10/0.11 c rootredcost : 0 0 0 0
0.10/0.11 c pseudoobj : 207 0 0 0
0.10/0.11 c Propagator Timings : TotalTime Propagate Resprop
0.10/0.11 c vbounds : 0.00 0.00 0.00
0.10/0.11 c rootredcost : 0.00 0.00 0.00
0.10/0.11 c pseudoobj : 0.00 0.00 0.00
0.10/0.11 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.10/0.11 c propagation : 0.01 15 10 312 162.1 0 0.0 -
0.10/0.11 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.10/0.11 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.10/0.11 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.10/0.11 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.10/0.11 c applied globally : - - - 1 44.0 - - -
0.10/0.11 c applied locally : - - - 9 45.0 - - -
0.10/0.11 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.10/0.11 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.10/0.11 c redcost : 0.00 0 0 0 0 0
0.10/0.11 c impliedbounds : 0.00 0 0 0 0 0
0.10/0.11 c intobj : 0.00 0 0 0 0 0
0.10/0.11 c gomory : 0.00 0 0 0 0 0
0.10/0.11 c cgmip : 0.00 0 0 0 0 0
0.10/0.11 c closecuts : 0.00 0 0 0 0 0
0.10/0.11 c strongcg : 0.00 0 0 0 0 0
0.10/0.11 c cmir : 0.00 0 0 0 0 0
0.10/0.11 c flowcover : 0.00 0 0 0 0 0
0.10/0.11 c clique : 0.00 0 0 0 0 0
0.10/0.11 c zerohalf : 0.00 0 0 0 0 0
0.10/0.11 c mcf : 0.00 0 0 0 0 0
0.10/0.11 c oddcycle : 0.00 0 0 0 0 0
0.10/0.11 c rapidlearning : 0.00 0 0 0 0 0
0.10/0.11 c Pricers : Time Calls Vars
0.10/0.11 c problem variables: 0.00 0 0
0.10/0.11 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.10/0.11 c pscost : 0.00 0 0 0 0 0 0
0.10/0.11 c inference : 0.00 0 0 0 0 0 0
0.10/0.11 c mostinf : 0.00 0 0 0 0 0 0
0.10/0.11 c leastinf : 0.00 0 0 0 0 0 0
0.10/0.11 c fullstrong : 0.00 0 0 0 0 0 0
0.10/0.11 c allfullstrong : 0.00 0 0 0 0 0 0
0.10/0.11 c random : 0.00 0 0 0 0 0 0
0.10/0.11 c relpscost : 0.00 0 0 0 0 0 0
0.10/0.11 c Primal Heuristics : Time Calls Found
0.10/0.11 c LP solutions : 0.00 - 0
0.10/0.11 c pseudo solutions : 0.00 - 0
0.10/0.11 c oneopt : 0.00 0 0
0.10/0.11 c trivial : 0.00 2 0
0.10/0.11 c shiftandpropagate: 0.01 1 0
0.10/0.11 c simplerounding : 0.00 0 0
0.10/0.11 c zirounding : 0.00 0 0
0.10/0.11 c rounding : 0.00 1 0
0.10/0.11 c shifting : 0.00 1 0
0.10/0.11 c intshifting : 0.00 0 0
0.10/0.11 c twoopt : 0.00 0 0
0.10/0.11 c fixandinfer : 0.00 0 0
0.10/0.11 c feaspump : 0.01 1 0
0.10/0.11 c clique : 0.00 0 0
0.10/0.11 c coefdiving : 0.00 0 0
0.10/0.11 c pscostdiving : 0.00 0 0
0.10/0.11 c fracdiving : 0.00 0 0
0.10/0.11 c veclendiving : 0.00 0 0
0.10/0.11 c intdiving : 0.00 0 0
0.10/0.11 c actconsdiving : 0.00 0 0
0.10/0.11 c objpscostdiving : 0.00 0 0
0.10/0.11 c rootsoldiving : 0.00 0 0
0.10/0.11 c linesearchdiving : 0.00 0 0
0.10/0.11 c guideddiving : 0.00 0 0
0.10/0.11 c octane : 0.00 0 0
0.10/0.11 c rens : 0.00 0 0
0.10/0.11 c rins : 0.00 0 0
0.10/0.11 c localbranching : 0.00 0 0
0.10/0.11 c mutation : 0.00 0 0
0.10/0.11 c crossover : 0.00 0 0
0.10/0.11 c dins : 0.00 0 0
0.10/0.11 c vbounds : 0.00 0 0
0.10/0.11 c undercover : 0.06 1 1
0.10/0.11 c subnlp : 0.00 0 0
0.10/0.11 c trysol : 0.00 0 0
0.10/0.11 c LP : Time Calls Iterations Iter/call Iter/sec
0.10/0.11 c primal LP : 0.00 0 0 0.00 -
0.10/0.11 c dual LP : 0.00 1 20 20.00 -
0.10/0.11 c lex dual LP : 0.00 0 0 0.00 -
0.10/0.11 c barrier LP : 0.00 0 0 0.00 -
0.10/0.11 c diving/probing LP: 0.00 10 230 23.00 -
0.10/0.11 c strong branching : 0.00 0 0 0.00 -
0.10/0.11 c (at root node) : - 0 0 0.00 -
0.10/0.11 c conflict analysis: 0.00 0 0 0.00 -
0.10/0.11 c B&B Tree :
0.10/0.11 c number of runs : 1
0.10/0.11 c nodes : 1
0.10/0.11 c nodes (total) : 1
0.10/0.11 c nodes left : 0
0.10/0.11 c max depth : 0
0.10/0.11 c max depth (total): 0
0.10/0.11 c backtracks : 0 (0.0%)
0.10/0.11 c delayed cutoffs : 0
0.10/0.11 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.10/0.11 c avg switch length: 2.00
0.10/0.11 c switching time : 0.00
0.10/0.11 c Solution :
0.10/0.11 c Solutions found : 1 (1 improvements)
0.10/0.11 c First Solution : +3.00000000000000e+00 (in run 1, after 1 nodes, 0.10 seconds, depth 0, found by <undercover>)
0.10/0.11 c Primal Bound : +3.00000000000000e+00 (in run 1, after 1 nodes, 0.10 seconds, depth 0, found by <undercover>)
0.10/0.11 c Dual Bound : +3.00000000000000e+00
0.10/0.11 c Gap : 0.00 %
0.10/0.11 c Root Dual Bound : +3.00000000000000e+00
0.10/0.11 c Root Iterations : 250
0.10/0.11 c Time complete: 0.11.
runsolver Copyright (C) 2010-2011 Olivier ROUSSEL
This is runsolver version 3.3.1 (svn: 988)
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-3484886-1307779550/watcher-3484886-1307779550 -o /tmp/evaluation-result-3484886-1307779550/solver-3484886-1307779550 -C 1800 -W 1900 -M 15500 HOME/scip-2.0.1.4_2.linux.x86_64.gnu.opt.spx -f HOME/instance-3484886-1307779550.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: 1.87 1.98 1.98 3/177 4648
/proc/meminfo: memFree=31330064/32950928 swapFree=67054844/67111528
[pid=4648] ppid=4646 vsize=11328 CPUtime=0 cores=1,3,5,7
/proc/4648/stat : 4648 (scip-2.0.1.4_2.) R 4646 4648 32526 0 -1 4202496 1681 0 0 0 0 0 0 0 25 0 1 0 968185714 11599872 1635 33554432000 4194304 8979876 140736656183504 18446744073709551615 7836189 0 0 4096 2 0 0 0 17 1 0 0 0
/proc/4648/statm: 2832 1645 411 1169 0 1659 0
[startup+0.0840791 s]
/proc/loadavg: 1.87 1.98 1.98 3/177 4648
/proc/meminfo: memFree=31330064/32950928 swapFree=67054844/67111528
[pid=4648] ppid=4646 vsize=40060 CPUtime=0.08 cores=1,3,5,7
/proc/4648/stat : 4648 (scip-2.0.1.4_2.) R 4646 4648 32526 0 -1 4202496 9206 0 0 0 7 1 0 0 25 0 1 0 968185714 41021440 8542 33554432000 4194304 8979876 140736656183504 18446744073709551615 7836159 0 0 4096 2 0 0 0 17 1 0 0 0
/proc/4648/statm: 10015 8607 685 1169 0 8842 0
Current children cumulated CPU time (s) 0.08
Current children cumulated vsize (KiB) 40060
[startup+0.101079 s]
/proc/loadavg: 1.87 1.98 1.98 3/177 4648
/proc/meminfo: memFree=31330064/32950928 swapFree=67054844/67111528
[pid=4648] ppid=4646 vsize=37696 CPUtime=0.1 cores=1,3,5,7
/proc/4648/stat : 4648 (scip-2.0.1.4_2.) R 4646 4648 32526 0 -1 4202496 10541 0 0 0 8 2 0 0 25 0 1 0 968185714 38600704 8122 33554432000 4194304 8979876 140736656183504 18446744073709551615 7890762 0 0 4096 2 0 0 0 17 1 0 0 0
/proc/4648/statm: 9424 8122 691 1169 0 8251 0
Current children cumulated CPU time (s) 0.1
Current children cumulated vsize (KiB) 37696
Solver just ended. Dumping a history of the last processes samples
Child status: 0
Real time (s): 0.116485
CPU time (s): 0.116982
CPU user time (s): 0.091986
CPU system time (s): 0.024996
CPU usage (%): 100.427
Max. virtual memory (cumulated for all children) (KiB): 40060
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 0.091986
system time used= 0.024996
maximum resident set size= 0
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 10553
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.002999 second system time
The end