0.00/0.00 c SCIP version 2.0.1.5 [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-3488472-1307778518.opb>
0.00/0.00 c original problem has 176 variables (176 bin, 0 int, 0 impl, 0 cont) and 135 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) 2 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 18 chg coeffs, 0 upgd conss, 560 impls, 0 clqs
0.00/0.01 c (round 2) 18 del vars, 29 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 32 chg coeffs, 3 upgd conss, 784 impls, 0 clqs
0.00/0.01 c (round 3) 34 del vars, 58 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 46 chg coeffs, 3 upgd conss, 784 impls, 0 clqs
0.00/0.01 c (0.0s) probing: 125/142 (88.0%) - 0 fixings, 0 aggregations, 4 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 (4 rounds):
0.00/0.01 c 34 deleted vars, 58 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 46 changed coefficients
0.00/0.01 c 792 implications, 0 cliques
0.00/0.01 c presolved problem has 142 variables (142 bin, 0 int, 0 impl, 0 cont) and 105 constraints
0.00/0.01 c 98 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 2 constraints of type <pseudoboolean>
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.5
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 = 1797
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 | 8 | - | 836k| 0 | 5 | 142 | 117 | 142 | 201 | 0 | 12 | 0 | 3.000000e+00 | -- | Inf
0.00/0.06 o 3
0.00/0.06 c U 0.1s| 1 | 0 | 117 | - | 846k| 0 | - | 142 | 117 | 142 | 201 | 0 | 12 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.00/0.07 c 0.1s| 1 | 0 | 117 | - | 844k| 0 | - | 142 | 118 | 142 | 201 | 0 | 12 | 0 | 3.000000e+00 | 3.000000e+00 | 0.00%
0.00/0.07 c
0.00/0.07 c SCIP Status : problem is solved [optimal solution found]
0.00/0.07 c Solving Time (sec) : 0.07
0.00/0.07 c Solving Nodes : 1
0.00/0.07 c Primal Bound : +3.00000000000000e+00 (1 solutions)
0.00/0.07 c Dual Bound : +3.00000000000000e+00
0.00/0.07 c Gap : 0.00 %
0.00/0.07 s OPTIMUM FOUND
0.00/0.07 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 -x22 -x21
0.00/0.07 v -x20 -x19 x18 x17 -x16 -x15 x14 x13 -x12 x11 -x10 x9 -x8 -x7 -x6 -x5 -x4 -x3 x2 x1
0.00/0.07 c SCIP Status : problem is solved [optimal solution found]
0.00/0.07 c Total Time : 0.07
0.00/0.07 c solving : 0.07
0.00/0.07 c presolving : 0.01 (included in solving)
0.00/0.07 c reading : 0.00 (included in solving)
0.00/0.07 c Original Problem :
0.00/0.07 c Problem name : HOME/instance-3488472-1307778518.opb
0.00/0.07 c Variables : 176 (176 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.07 c Constraints : 135 initial, 135 maximal
0.00/0.07 c Presolved Problem :
0.00/0.07 c Problem name : t_HOME/instance-3488472-1307778518.opb
0.00/0.07 c Variables : 142 (142 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.07 c Constraints : 105 initial, 118 maximal
0.00/0.07 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.00/0.07 c trivial : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.07 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.07 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.07 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.07 c pseudoobj : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.07 c implics : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.07 c probing : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.07 c and : 0.00 4 28 0 0 0 28 0 0 28
0.00/0.07 c linear : 0.00 1 1 0 0 0 0 0 0 18
0.00/0.07 c logicor : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.07 c pseudoboolean : 0.00 0 0 0 0 0 30 0 0 0
0.00/0.07 c root node : - 0 - - 0 - - - - -
0.00/0.07 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
0.00/0.07 c integral : 0 0 0 0 0 7 0 0 0 0 0 0
0.00/0.07 c and : 98 0 333 0 0 0 707 0 0 0 0 0
0.00/0.07 c linear : 2 0 333 0 0 4 121 7 0 0 0 0
0.00/0.07 c logicor : 3+ 0 69 0 0 1 18 6 0 0 0 0
0.00/0.07 c pseudoboolean : 2 0 0 0 0 1 0 0 0 0 0 0
0.00/0.07 c countsols : 0 0 0 0 0 3 0 0 0 0 0 0
0.00/0.07 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
0.00/0.07 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.07 c and : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.07 c linear : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.07 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.07 c pseudoboolean : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.07 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.07 c Propagators : #Propagate #Resprop Cutoffs DomReds
0.00/0.07 c vbounds : 0 0 0 0
0.00/0.07 c rootredcost : 0 0 0 0
0.00/0.07 c pseudoobj : 82 0 0 0
0.00/0.07 c Propagator Timings : TotalTime Propagate Resprop
0.00/0.07 c vbounds : 0.00 0.00 0.00
0.00/0.07 c rootredcost : 0.00 0.00 0.00
0.00/0.07 c pseudoobj : 0.00 0.00 0.00
0.00/0.07 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.00/0.07 c propagation : 0.00 12 12 118 51.7 1 60.0 -
0.00/0.07 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.07 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.07 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.07 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.00/0.07 c applied globally : - - - 12 19.6 - - -
0.00/0.07 c applied locally : - - - 0 0.0 - - -
0.00/0.07 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.00/0.07 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.00/0.07 c redcost : 0.00 0 0 0 0 0
0.00/0.07 c impliedbounds : 0.00 0 0 0 0 0
0.00/0.07 c intobj : 0.00 0 0 0 0 0
0.00/0.07 c gomory : 0.00 0 0 0 0 0
0.00/0.07 c cgmip : 0.00 0 0 0 0 0
0.00/0.07 c closecuts : 0.00 0 0 0 0 0
0.00/0.07 c strongcg : 0.00 0 0 0 0 0
0.00/0.07 c cmir : 0.00 0 0 0 0 0
0.00/0.07 c flowcover : 0.00 0 0 0 0 0
0.00/0.07 c clique : 0.00 0 0 0 0 0
0.00/0.07 c zerohalf : 0.00 0 0 0 0 0
0.00/0.07 c mcf : 0.00 0 0 0 0 0
0.00/0.07 c oddcycle : 0.00 0 0 0 0 0
0.00/0.07 c rapidlearning : 0.00 0 0 0 0 0
0.00/0.07 c Pricers : Time Calls Vars
0.00/0.07 c problem variables: 0.00 0 0
0.00/0.07 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.00/0.07 c pscost : 0.00 0 0 0 0 0 0
0.00/0.07 c inference : 0.00 0 0 0 0 0 0
0.00/0.07 c mostinf : 0.00 0 0 0 0 0 0
0.00/0.07 c leastinf : 0.00 0 0 0 0 0 0
0.00/0.07 c fullstrong : 0.00 0 0 0 0 0 0
0.00/0.07 c allfullstrong : 0.00 0 0 0 0 0 0
0.00/0.07 c random : 0.00 0 0 0 0 0 0
0.00/0.07 c relpscost : 0.00 0 0 0 0 0 0
0.00/0.07 c Primal Heuristics : Time Calls Found
0.00/0.07 c LP solutions : 0.00 - 0
0.00/0.07 c pseudo solutions : 0.00 - 0
0.00/0.07 c oneopt : 0.00 0 0
0.00/0.07 c trivial : 0.00 2 0
0.00/0.07 c shiftandpropagate: 0.00 1 0
0.00/0.07 c simplerounding : 0.00 0 0
0.00/0.07 c zirounding : 0.00 0 0
0.00/0.07 c rounding : 0.00 1 0
0.00/0.07 c shifting : 0.00 1 0
0.00/0.07 c intshifting : 0.00 0 0
0.00/0.07 c twoopt : 0.00 0 0
0.00/0.07 c fixandinfer : 0.00 0 0
0.00/0.07 c feaspump : 0.00 1 0
0.00/0.07 c clique : 0.00 0 0
0.00/0.07 c coefdiving : 0.00 0 0
0.00/0.07 c pscostdiving : 0.00 0 0
0.00/0.07 c fracdiving : 0.00 0 0
0.00/0.07 c veclendiving : 0.00 0 0
0.00/0.07 c intdiving : 0.00 0 0
0.00/0.07 c actconsdiving : 0.00 0 0
0.00/0.07 c objpscostdiving : 0.00 0 0
0.00/0.07 c rootsoldiving : 0.00 0 0
0.00/0.07 c linesearchdiving : 0.00 0 0
0.00/0.07 c guideddiving : 0.00 0 0
0.00/0.07 c octane : 0.00 0 0
0.00/0.07 c rens : 0.00 0 0
0.00/0.07 c rins : 0.00 0 0
0.00/0.07 c localbranching : 0.00 0 0
0.00/0.07 c mutation : 0.00 0 0
0.00/0.07 c crossover : 0.00 0 0
0.00/0.07 c dins : 0.00 0 0
0.00/0.07 c vbounds : 0.00 0 0
0.00/0.07 c undercover : 0.05 1 1
0.00/0.07 c subnlp : 0.00 0 0
0.00/0.07 c trysol : 0.00 0 0
0.00/0.07 c LP : Time Calls Iterations Iter/call Iter/sec
0.00/0.07 c primal LP : 0.00 0 0 0.00 -
0.00/0.07 c dual LP : 0.00 1 8 8.00 -
0.00/0.07 c lex dual LP : 0.00 0 0 0.00 -
0.00/0.07 c barrier LP : 0.00 0 0 0.00 -
0.00/0.07 c diving/probing LP: 0.00 9 109 12.11 -
0.00/0.07 c strong branching : 0.00 0 0 0.00 -
0.00/0.07 c (at root node) : - 0 0 0.00 -
0.00/0.07 c conflict analysis: 0.00 0 0 0.00 -
0.00/0.07 c B&B Tree :
0.00/0.07 c number of runs : 1
0.00/0.07 c nodes : 1
0.00/0.07 c nodes (total) : 1
0.00/0.07 c nodes left : 0
0.00/0.07 c max depth : 0
0.00/0.07 c max depth (total): 0
0.00/0.07 c backtracks : 0 (0.0%)
0.00/0.07 c delayed cutoffs : 0
0.00/0.07 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.00/0.07 c avg switch length: 2.00
0.00/0.07 c switching time : 0.00
0.00/0.07 c Solution :
0.00/0.07 c Solutions found : 1 (1 improvements)
0.00/0.07 c First Solution : +3.00000000000000e+00 (in run 1, after 1 nodes, 0.06 seconds, depth 0, found by <undercover>)
0.00/0.07 c Primal Bound : +3.00000000000000e+00 (in run 1, after 1 nodes, 0.06 seconds, depth 0, found by <undercover>)
0.00/0.07 c Dual Bound : +3.00000000000000e+00
0.00/0.07 c Gap : 0.00 %
0.00/0.07 c Root Dual Bound : +3.00000000000000e+00
0.00/0.07 c Root Iterations : 117
0.00/0.07 c Time complete: 0.07.
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-3488472-1307778518/watcher-3488472-1307778518 -o /tmp/evaluation-result-3488472-1307778518/solver-3488472-1307778518 -C 1800 -W 1900 -M 15500 HOME/scip-2.0.1.4b_2.linux.x86_64.gnu.opt.spx -f HOME/instance-3488472-1307778518.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: 2.00 1.99 1.91 2/177 3959
/proc/meminfo: memFree=31583564/32951124 swapFree=67056304/67111528
[pid=3959] ppid=3957 vsize=10944 CPUtime=0 cores=0,2,4,6
/proc/3959/stat : 3959 (scip-2.0.1.4b_2) R 3957 3959 30098 0 -1 4202496 1778 0 0 0 0 0 0 0 25 0 1 0 968082426 11206656 1732 33554432000 4194304 9016284 140735852257856 18446744073709551615 7870589 0 0 4096 0 0 0 0 17 0 0 0 0
/proc/3959/statm: 2736 1746 340 1178 0 1554 0
Solver just ended. Dumping a history of the last processes samples
Child status: 0
Real time (s): 0.0802321
CPU time (s): 0.078987
CPU user time (s): 0.06499
CPU system time (s): 0.013997
CPU usage (%): 98.4481
Max. virtual memory (cumulated for all children) (KiB): 0
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 0.06499
system time used= 0.013997
maximum resident set size= 0
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 10873
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= 2
involuntary context switches= 1
runsolver used 0.000999 second user time and 0.005999 second system time
The end