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-3452202-1307102510.opb>
0.00/0.00 c original problem has 30 variables (30 bin, 0 int, 0 impl, 0 cont) and 5 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.00 c (round 1) 3 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 9 chg coeffs, 0 upgd conss, 250 impls, 0 clqs
0.00/0.00 c (round 2) 16 del vars, 9 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 17 chg coeffs, 1 upgd conss, 384 impls, 0 clqs
0.00/0.00 c (round 3) 26 del vars, 18 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 25 chg coeffs, 5 upgd conss, 384 impls, 0 clqs
0.00/0.01 c presolving (4 rounds):
0.00/0.01 c 26 deleted vars, 18 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 25 changed coefficients
0.00/0.01 c 396 implications, 0 cliques
0.00/0.01 c presolved problem has 54 variables (54 bin, 0 int, 0 impl, 0 cont) and 35 constraints
0.00/0.01 c 30 constraints of type <and>
0.00/0.01 c 2 constraints of type <linear>
0.00/0.01 c 3 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.00
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.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 0.0s| 1 | 0 | 8 | - | 351k| 0 | 5 | 54 | 49 | 54 | 65 | 0 | 14 | 0 | 3.000000e+00 | -- | Inf
0.00/0.03 o 3
0.00/0.03 c y 0.0s| 1 | 0 | 84 | - | 373k| 0 | - | 54 | 49 | 54 | 65 | 0 | 14 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.00/0.03 c 0.0s| 1 | 0 | 84 | - | 379k| 0 | - | 54 | 68 | 54 | 65 | 0 | 14 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.00/0.03 c 0.0s| 1 | 0 | 84 | - | 379k| 0 | - | 54 | 68 | 54 | 65 | 0 | 14 | 0 | 3.000000e+00 | 3.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
0.00/0.03 c Primal Bound : +3.00000000000000e+00 (1 solutions)
0.00/0.03 c Dual Bound : +3.00000000000000e+00
0.00/0.03 c Gap : 0.00 %
0.00/0.03 s OPTIMUM FOUND
0.00/0.03 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 x2 x1
0.00/0.03 c SCIP Status : problem is solved [optimal solution found]
0.00/0.03 c Total Time : 0.03
0.00/0.03 c solving : 0.03
0.00/0.03 c presolving : 0.00 (included in solving)
0.00/0.03 c reading : 0.00 (included in solving)
0.00/0.03 c Original Problem :
0.00/0.03 c Problem name : HOME/instance-3452202-1307102510.opb
0.00/0.03 c Variables : 30 (30 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.03 c Constraints : 5 initial, 5 maximal
0.00/0.03 c Presolved Problem :
0.00/0.03 c Problem name : t_HOME/instance-3452202-1307102510.opb
0.00/0.03 c Variables : 54 (54 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.03 c Constraints : 35 initial, 68 maximal
0.00/0.03 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.00/0.03 c trivial : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.03 c dualfix : 0.00 0 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
0.00/0.03 c inttobinary : 0.00 0 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
0.00/0.03 c probing : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.03 c and : 0.00 4 16 0 0 0 16 0 0 16
0.00/0.03 c linear : 0.00 3 3 0 0 0 0 0 0 9
0.00/0.03 c logicor : 0.00 0 0 0 0 0 2 0 0 0
0.00/0.03 c root node : - 20 - - 20 - - - - -
0.00/0.03 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
0.00/0.03 c integral : 0 0 0 0 0 7 0 0 0 0 0 0
0.00/0.03 c and : 30 1 151 0 0 4 129 0 0 0 0 0
0.00/0.03 c linear : 2+ 1 151 0 0 1 41 7 0 0 0 0
0.00/0.03 c logicor : 3+ 1 49 0 0 1 14 6 0 0 0 0
0.00/0.03 c countsols : 0 0 0 0 0 3 0 0 0 0 0 0
0.00/0.03 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
0.00/0.03 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.03 c and : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.03 c linear : 0.00 0.00 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.00
0.00/0.03 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.03 c Propagators : #Propagate #Resprop Cutoffs DomReds
0.00/0.03 c vbounds : 0 0 0 0
0.00/0.03 c rootredcost : 0 0 0 0
0.00/0.03 c pseudoobj : 38 0 0 0
0.00/0.03 c Propagator Timings : TotalTime Propagate Resprop
0.00/0.03 c vbounds : 0.00 0.00 0.00
0.00/0.03 c rootredcost : 0.00 0.00 0.00
0.00/0.03 c pseudoobj : 0.00 0.00 0.00
0.00/0.03 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.00/0.03 c propagation : 0.00 13 12 57 18.3 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 1 0 0 0.0 0 0.0 -
0.00/0.03 c applied globally : - - - 14 11.5 - - -
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: 8)
0.00/0.03 c redcost : 0.00 1 0 0 0 0
0.00/0.03 c impliedbounds : 0.00 1 0 0 0 0
0.00/0.03 c intobj : 0.00 0 0 0 0 0
0.00/0.03 c gomory : 0.00 1 0 0 13 0
0.00/0.03 c cgmip : 0.00 0 0 0 0 0
0.00/0.03 c closecuts : 0.00 0 0 0 0 0
0.00/0.03 c strongcg : 0.00 1 0 0 13 0
0.00/0.03 c cmir : 0.00 1 0 0 2 0
0.00/0.03 c flowcover : 0.00 1 0 0 4 0
0.00/0.03 c clique : 0.00 1 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 1 0 0 0 0
0.00/0.03 c oddcycle : 0.00 0 0 0 0 0
0.00/0.03 c rapidlearning : 0.01 1 0 20 0 19
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 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 relpscost : 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 0 0
0.00/0.03 c trivial : 0.00 2 0
0.00/0.03 c shiftandpropagate: 0.00 1 0
0.00/0.03 c simplerounding : 0.00 0 0
0.00/0.03 c zirounding : 0.00 0 0
0.00/0.03 c rounding : 0.00 1 0
0.00/0.03 c shifting : 0.00 1 0
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 1 0
0.00/0.03 c clique : 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 vbounds : 0.00 0 0
0.00/0.03 c undercover : 0.00 1 0
0.00/0.03 c subnlp : 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 1 8 8.00 -
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 10 76 7.60 -
0.00/0.03 c strong branching : 0.00 0 0 0.00 -
0.00/0.03 c (at root node) : - 0 0 0.00 -
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 : 1
0.00/0.03 c nodes : 1
0.00/0.03 c nodes (total) : 1
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 : 1 (1 improvements)
0.00/0.03 c First Solution : +3.00000000000000e+00 (in run 1, after 1 nodes, 0.03 seconds, depth 0, found by <trysol>)
0.00/0.03 c Primal Bound : +3.00000000000000e+00 (in run 1, after 1 nodes, 0.03 seconds, depth 0, found by <trysol>)
0.00/0.03 c Dual Bound : +3.00000000000000e+00
0.00/0.03 c Gap : 0.00 %
0.00/0.03 c Root Dual Bound : +3.00000000000000e+00
0.00/0.03 c Root Iterations : 84
0.00/0.03 c Time complete: 0.03.
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-3452202-1307102510/watcher-3452202-1307102510 -o /tmp/evaluation-result-3452202-1307102510/solver-3452202-1307102510 -C 1800 -W 1900 -M 15500 HOME/scip-2.0.1.4.linux.x86_64.gnu.opt.spx -f HOME/instance-3452202-1307102510.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.06 2.05 2.00 3/429 25597
/proc/meminfo: memFree=29000952/32951124 swapFree=43324008/67111528
[pid=25597] ppid=25595 vsize=17880 CPUtime=0.01 cores=1,3,5,7
/proc/25597/stat : 25597 (scip-2.0.1.4.li) R 25595 25597 22076 0 -1 4202496 3684 0 0 0 1 0 0 0 18 0 1 0 821851464 18309120 3381 33554432000 4194304 9128323 140735790941616 18446744073709551615 7980987 0 0 4096 16384 0 0 0 17 3 0 0 0
/proc/25597/statm: 4470 3382 670 1205 0 3261 0
Solver just ended. Dumping a history of the last processes samples
Child status: 0
Real time (s): 0.036279
CPU time (s): 0.034994
CPU user time (s): 0.030995
CPU system time (s): 0.003999
CPU usage (%): 96.4579
Max. virtual memory (cumulated for all children) (KiB): 0
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 0.030995
system time used= 0.003999
maximum resident set size= 0
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 6339
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= 7
involuntary context switches= 1
runsolver used 0.002999 second user time and 0.015997 second system time
The end