0.00/0.00 c SCIP version 2.0.1.4 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.4]
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-3452115-1307102287.opb>
0.00/0.00 c original problem has 84 variables (84 bin, 0 int, 0 impl, 0 cont) and 9 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) 4 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 25 chg coeffs, 0 upgd conss, 994 impls, 0 clqs
0.00/0.01 c (round 2) 18 del vars, 12 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 37 chg coeffs, 5 upgd conss, 1498 impls, 0 clqs
0.00/0.01 c (round 3) 32 del vars, 24 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 49 chg coeffs, 5 upgd conss, 1834 impls, 0 clqs
0.00/0.01 c (round 4) 46 del vars, 36 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 61 chg coeffs, 5 upgd conss, 2002 impls, 0 clqs
0.00/0.01 c (round 5) 60 del vars, 48 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 73 chg coeffs, 5 upgd conss, 2002 impls, 0 clqs
0.00/0.01 c (0.0s) probing: 144/220 (65.5%) - 0 fixings, 0 aggregations, 8 implications, 0 bound changes
0.00/0.01 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.00/0.01 c presolving (6 rounds):
0.00/0.01 c 60 deleted vars, 48 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 73 changed coefficients
0.00/0.01 c 2018 implications, 0 cliques
0.00/0.01 c presolved problem has 220 variables (220 bin, 0 int, 0 impl, 0 cont) and 153 constraints
0.00/0.01 c 144 constraints of type <and>
0.00/0.01 c 4 constraints of type <linear>
0.00/0.01 c 5 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 2.0.1.4
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 = 1800
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 # belongs reading time to solving time?
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c timing/reading = TRUE
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.02 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.02 c 0.0s| 1 | 0 | 10 | - |1026k| 0 | 4 | 220 | 167 | 220 | 297 | 0 | 14 | 0 | 3.000000e+00 | -- | Inf
0.00/0.06 o 3
0.00/0.06 c U 0.1s| 1 | 0 | 124 | - |1039k| 0 | - | 220 | 167 | 220 | 297 | 0 | 14 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.00/0.06 c 0.1s| 1 | 0 | 124 | - |1037k| 0 | - | 220 | 168 | 220 | 297 | 0 | 14 | 0 | 3.000000e+00 | 3.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.06
0.00/0.06 c Solving Nodes : 1
0.00/0.06 c Primal Bound : +3.00000000000000e+00 (1 solutions)
0.00/0.06 c Dual Bound : +3.00000000000000e+00
0.00/0.06 c Gap : 0.00 %
0.00/0.06 s OPTIMUM FOUND
0.00/0.06 v -x84 -x83 -x82 -x81 -x80 -x79 x78 -x77 -x76 -x75 -x74 -x73 -x72 x71 -x56 x55 -x54 x53 -x52 x51 x50 -x70 -x69 -x68 -x67 -x66 -x65
0.00/0.06 v -x64 -x49 x48 x47 x46 -x45 -x44 x43 -x63 -x62 -x61 -x60 -x59 -x58 x57 -x42 -x41 x40 -x39 -x38 x37 x36 -x35 -x34 -x33 -x32 -x31
0.00/0.06 v x30 x29 -x28 -x27 -x26 -x25 -x24 x23 x22 -x21 -x20 -x19 -x18 -x17 x16 x15 -x14 x13 x12 -x11 -x10 -x9 x8 -x7 -x6 -x5 -x4 -x3
0.00/0.06 v x2 x1
0.00/0.06 c SCIP Status : problem is solved [optimal solution found]
0.00/0.06 c Total Time : 0.06
0.00/0.06 c solving : 0.06
0.00/0.06 c presolving : 0.01 (included in solving)
0.00/0.06 c reading : 0.00 (included in solving)
0.00/0.06 c Original Problem :
0.00/0.06 c Problem name : HOME/instance-3452115-1307102287.opb
0.00/0.06 c Variables : 84 (84 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.06 c Constraints : 9 initial, 9 maximal
0.00/0.06 c Presolved Problem :
0.00/0.06 c Problem name : t_HOME/instance-3452115-1307102287.opb
0.00/0.06 c Variables : 220 (220 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.06 c Constraints : 153 initial, 168 maximal
0.00/0.06 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.00/0.06 c trivial : 0.00 0 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
0.00/0.06 c boundshift : 0.00 0 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
0.00/0.06 c implics : 0.00 0 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
0.00/0.06 c and : 0.00 8 48 0 0 0 48 0 0 48
0.00/0.06 c linear : 0.00 1 3 0 0 0 0 0 0 25
0.00/0.06 c logicor : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.06 c root node : - 0 - - 0 - - - - -
0.00/0.06 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
0.00/0.06 c integral : 0 0 0 0 0 7 0 0 0 0 0 0
0.00/0.06 c and : 144 0 428 0 0 4 1192 1 0 0 0 0
0.00/0.06 c linear : 4 0 427 0 0 3 256 10 0 0 0 0
0.00/0.06 c logicor : 5+ 0 89 0 0 2 48 4 0 0 0 0
0.00/0.06 c countsols : 0 0 0 0 0 3 0 0 0 0 0 0
0.00/0.06 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
0.00/0.06 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.06 c and : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.06 c linear : 0.00 0.00 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.00
0.00/0.06 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.06 c Propagators : #Propagate #Resprop Cutoffs DomReds
0.00/0.06 c vbounds : 0 0 0 0
0.00/0.06 c rootredcost : 0 0 0 0
0.00/0.06 c pseudoobj : 135 0 0 0
0.00/0.06 c Propagator Timings : TotalTime Propagate Resprop
0.00/0.06 c vbounds : 0.00 0.00 0.00
0.00/0.06 c rootredcost : 0.00 0.00 0.00
0.00/0.06 c pseudoobj : 0.00 0.00 0.00
0.00/0.06 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.00/0.06 c propagation : 0.00 15 14 241 84.3 1 45.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 : - - - 14 24.6 - - -
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 0 - - 0 - (maximal pool size: 0)
0.00/0.06 c redcost : 0.00 0 0 0 0 0
0.00/0.06 c impliedbounds : 0.00 0 0 0 0 0
0.00/0.06 c intobj : 0.00 0 0 0 0 0
0.00/0.06 c gomory : 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 closecuts : 0.00 0 0 0 0 0
0.00/0.06 c strongcg : 0.00 0 0 0 0 0
0.00/0.06 c cmir : 0.00 0 0 0 0 0
0.00/0.06 c flowcover : 0.00 0 0 0 0 0
0.00/0.06 c clique : 0.00 0 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 0 0 0 0 0
0.00/0.06 c oddcycle : 0.00 0 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 oneopt : 0.00 0 0
0.00/0.06 c trivial : 0.00 2 0
0.00/0.06 c shiftandpropagate: 0.01 1 0
0.00/0.06 c simplerounding : 0.00 0 0
0.00/0.06 c zirounding : 0.00 0 0
0.00/0.06 c rounding : 0.00 1 0
0.00/0.06 c shifting : 0.00 1 0
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 1 0
0.00/0.06 c clique : 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.00 0 0
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 crossover : 0.00 0 0
0.00/0.06 c dins : 0.00 0 0
0.00/0.06 c vbounds : 0.00 0 0
0.00/0.06 c undercover : 0.04 1 1
0.00/0.06 c subnlp : 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 1 10 10.00 -
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 7 114 16.29 -
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 : 1 (1 improvements)
0.00/0.06 c First Solution : +3.00000000000000e+00 (in run 1, after 1 nodes, 0.06 seconds, depth 0, found by <undercover>)
0.00/0.06 c Primal Bound : +3.00000000000000e+00 (in run 1, after 1 nodes, 0.06 seconds, depth 0, found by <undercover>)
0.00/0.06 c Dual Bound : +3.00000000000000e+00
0.00/0.06 c Gap : 0.00 %
0.00/0.06 c Root Dual Bound : +3.00000000000000e+00
0.00/0.06 c Root Iterations : 124
0.00/0.06 c Time complete: 0.06.
runsolver Copyright (C) 2010-2011 Olivier ROUSSEL
This is runsolver version 3.3.0 (svn: 977)
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-3452115-1307102287/watcher-3452115-1307102287 -o /tmp/evaluation-result-3452115-1307102287/solver-3452115-1307102287 -C 1800 -W 1900 -M 15500 HOME/scip-2.0.1.4.linux.x86_64.gnu.opt.spx -f HOME/instance-3452115-1307102287.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.98 2.01 2.00 2/527 8986
/proc/meminfo: memFree=24924236/32951124 swapFree=56241860/67111528
[pid=8986] ppid=8984 vsize=15508 CPUtime=0 cores=1,3,5,7
/proc/8986/stat : 8986 (scip-2.0.1.4.li) R 8984 8986 5807 0 -1 4202496 2890 0 0 0 0 0 0 0 25 0 1 0 900459394 15880192 2586 33554432000 4194304 9128323 140737292934256 18446744073709551615 8062775 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/8986/statm: 3877 2586 494 1205 0 2668 0
Solver just ended. Dumping a history of the last processes samples
Child status: 0
Real time (s): 0.069857
CPU time (s): 0.069988
CPU user time (s): 0.054991
CPU system time (s): 0.014997
CPU usage (%): 100.188
Max. virtual memory (cumulated for all children) (KiB): 0
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 0.054991
system time used= 0.014997
maximum resident set size= 0
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 9672
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.003999 second user time and 0.017997 second system time
The end