0.00/0.01 c SCIP version 2.0.1.5 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.4]
0.00/0.01 c Copyright (c) 2002-2011 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB)
0.00/0.01 c
0.00/0.01 c user parameter file <scip.set> not found - using default parameters
0.00/0.01 c reading problem <HOME/instance-3450642-1307104730.opb>
0.00/0.01 c original problem has 36 variables (36 bin, 0 int, 0 impl, 0 cont) and 46 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.01 o 0
0.00/0.01 c feasible solution found by trivial heuristic, objective value 0.000000e+00
0.00/0.01 c presolving:
0.00/0.01 c (round 1) 26 del vars, 20 del conss, 0 add conss, 26 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 104 impls, 0 clqs
0.00/0.01 c (round 2) 26 del vars, 20 del conss, 0 add conss, 26 chg bounds, 0 chg sides, 0 chg coeffs, 26 upgd conss, 156 impls, 0 clqs
0.00/0.01 c presolving (3 rounds):
0.00/0.01 c 26 deleted vars, 20 deleted constraints, 0 added constraints, 26 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.01 c 156 implications, 0 cliques
0.00/0.01 c presolved problem has 10 variables (10 bin, 0 int, 0 impl, 0 cont) and 26 constraints
0.00/0.01 c 26 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 2.0.1.5
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 = 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 -----------------------------------------------------------------------------------------------
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 | 10 | - | 231k| 0 | 10 | 10 | 26 | 10 | 26 | 0 | 0 | 0 |-5.000000e+00 | 0.000000e+00 | 100.00%
0.00/0.01 o -1
0.00/0.01 c R 0.0s| 1 | 0 | 10 | - | 232k| 0 | 10 | 10 | 26 | 10 | 26 | 0 | 0 | 0 |-5.000000e+00 |-1.000000e+00 | 80.00%
0.00/0.01 o -2
0.00/0.01 c s 0.0s| 1 | 0 | 10 | - | 232k| 0 | 10 | 10 | 26 | 10 | 26 | 0 | 0 | 0 |-5.000000e+00 |-2.000000e+00 | 60.00%
0.00/0.02 c 0.0s| 1 | 0 | 17 | - | 235k| 0 | 7 | 10 | 26 | 10 | 29 | 3 | 0 | 0 |-3.000000e+00 |-2.000000e+00 | 33.33%
0.00/0.02 o -3
0.00/0.02 c b 0.0s| 1 | 0 | 17 | - | 236k| 0 | - | 10 | 26 | 10 | 29 | 3 | 0 | 0 |-3.000000e+00 |-3.000000e+00 | 0.00%
0.00/0.02 c 0.0s| 1 | 0 | 17 | - | 236k| 0 | - | 10 | 26 | 10 | 29 | 3 | 0 | 0 |-3.000000e+00 |-3.000000e+00 | 0.00%
0.00/0.02 c
0.00/0.02 c SCIP Status : problem is solved [optimal solution found]
0.00/0.02 c Solving Time (sec) : 0.02
0.00/0.02 c Solving Nodes : 1
0.00/0.02 c Primal Bound : -3.00000000000000e+00 (4 solutions)
0.00/0.02 c Dual Bound : -3.00000000000000e+00
0.00/0.02 c Gap : 0.00 %
0.00/0.02 s OPTIMUM FOUND
0.00/0.02 v x10 -x9 x8 -x7 -x6 -x5 x4 -x3 -x2 -x1
0.00/0.02 c SCIP Status : problem is solved [optimal solution found]
0.00/0.02 c Total Time : 0.02
0.00/0.02 c solving : 0.02
0.00/0.02 c presolving : 0.00 (included in solving)
0.00/0.02 c reading : 0.00 (included in solving)
0.00/0.02 c Original Problem :
0.00/0.02 c Problem name : HOME/instance-3450642-1307104730.opb
0.00/0.02 c Variables : 36 (36 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.02 c Constraints : 46 initial, 46 maximal
0.00/0.02 c Presolved Problem :
0.00/0.02 c Problem name : t_HOME/instance-3450642-1307104730.opb
0.00/0.02 c Variables : 10 (10 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.02 c Constraints : 26 initial, 26 maximal
0.00/0.02 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.00/0.02 c trivial : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.02 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.02 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.02 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.02 c pseudoobj : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.02 c implics : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.02 c probing : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.02 c and : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.02 c linear : 0.00 26 0 0 26 0 10 0 0 0
0.00/0.02 c logicor : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.02 c pseudoboolean : 0.00 0 0 0 0 0 10 0 0 0
0.00/0.02 c root node : - 0 - - 0 - - - - -
0.00/0.02 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
0.00/0.02 c integral : 0 0 0 0 0 8 0 0 0 0 0 0
0.00/0.02 c logicor : 26 1 11 0 0 4 0 0 0 0 0 0
0.00/0.02 c countsols : 0 0 0 0 0 6 0 0 0 0 0 0
0.00/0.02 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
0.00/0.02 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.02 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.02 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.02 c Propagators : #Propagate #Resprop Cutoffs DomReds
0.00/0.02 c vbounds : 0 0 0 0
0.00/0.02 c rootredcost : 0 0 0 0
0.00/0.02 c pseudoobj : 3 0 0 0
0.00/0.02 c Propagator Timings : TotalTime Propagate Resprop
0.00/0.02 c vbounds : 0.00 0.00 0.00
0.00/0.02 c rootredcost : 0.00 0.00 0.00
0.00/0.02 c pseudoobj : 0.00 0.00 0.00
0.00/0.02 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.00/0.02 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.00/0.02 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.02 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.02 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.02 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.00/0.02 c applied globally : - - - 0 0.0 - - -
0.00/0.02 c applied locally : - - - 0 0.0 - - -
0.00/0.02 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.00/0.02 c cut pool : 0.00 0 - - 0 - (maximal pool size: 7)
0.00/0.02 c redcost : 0.00 1 0 0 0 0
0.00/0.02 c impliedbounds : 0.00 1 0 0 0 0
0.00/0.02 c intobj : 0.00 0 0 0 0 0
0.00/0.02 c gomory : 0.00 1 0 0 10 0
0.00/0.02 c cgmip : 0.00 0 0 0 0 0
0.00/0.02 c closecuts : 0.00 0 0 0 0 0
0.00/0.02 c strongcg : 0.00 1 0 0 10 0
0.00/0.02 c cmir : 0.00 1 0 0 0 0
0.00/0.02 c flowcover : 0.00 1 0 0 0 0
0.00/0.02 c clique : 0.00 1 0 0 6 0
0.00/0.02 c zerohalf : 0.00 0 0 0 0 0
0.00/0.02 c mcf : 0.00 1 0 0 0 0
0.00/0.02 c oddcycle : 0.00 0 0 0 0 0
0.00/0.02 c rapidlearning : 0.00 0 0 0 0 0
0.00/0.02 c Pricers : Time Calls Vars
0.00/0.02 c problem variables: 0.00 0 0
0.00/0.02 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.00/0.02 c pscost : 0.00 0 0 0 0 0 0
0.00/0.02 c inference : 0.00 0 0 0 0 0 0
0.00/0.02 c mostinf : 0.00 0 0 0 0 0 0
0.00/0.02 c leastinf : 0.00 0 0 0 0 0 0
0.00/0.02 c fullstrong : 0.00 0 0 0 0 0 0
0.00/0.02 c allfullstrong : 0.00 0 0 0 0 0 0
0.00/0.02 c random : 0.00 0 0 0 0 0 0
0.00/0.02 c relpscost : 0.00 0 0 0 0 0 0
0.00/0.02 c Primal Heuristics : Time Calls Found
0.00/0.02 c LP solutions : 0.00 - 0
0.00/0.02 c pseudo solutions : 0.00 - 0
0.00/0.02 c trivial : 0.00 2 1
0.00/0.02 c shiftandpropagate: 0.00 0 0
0.00/0.02 c simplerounding : 0.00 1 0
0.00/0.02 c zirounding : 0.00 0 0
0.00/0.02 c rounding : 0.00 1 1
0.00/0.02 c shifting : 0.00 1 1
0.00/0.02 c intshifting : 0.00 0 0
0.00/0.02 c oneopt : 0.00 1 1
0.00/0.02 c twoopt : 0.00 0 0
0.00/0.02 c fixandinfer : 0.00 0 0
0.00/0.02 c feaspump : 0.00 0 0
0.00/0.02 c clique : 0.00 0 0
0.00/0.02 c coefdiving : 0.00 0 0
0.00/0.02 c pscostdiving : 0.00 0 0
0.00/0.02 c fracdiving : 0.00 0 0
0.00/0.02 c veclendiving : 0.00 0 0
0.00/0.02 c intdiving : 0.00 0 0
0.00/0.02 c actconsdiving : 0.00 0 0
0.00/0.02 c objpscostdiving : 0.00 0 0
0.00/0.02 c rootsoldiving : 0.00 0 0
0.00/0.02 c linesearchdiving : 0.00 0 0
0.00/0.02 c guideddiving : 0.00 0 0
0.00/0.02 c octane : 0.00 0 0
0.00/0.02 c rens : 0.00 0 0
0.00/0.02 c rins : 0.00 0 0
0.00/0.02 c localbranching : 0.00 0 0
0.00/0.02 c mutation : 0.00 0 0
0.00/0.02 c crossover : 0.00 0 0
0.00/0.02 c dins : 0.00 0 0
0.00/0.02 c vbounds : 0.00 0 0
0.00/0.02 c undercover : 0.01 1 0
0.00/0.02 c subnlp : 0.00 0 0
0.00/0.02 c trysol : 0.00 0 0
0.00/0.02 c LP : Time Calls Iterations Iter/call Iter/sec
0.00/0.02 c primal LP : 0.00 0 0 0.00 -
0.00/0.02 c dual LP : 0.00 2 17 8.50 -
0.00/0.02 c lex dual LP : 0.00 0 0 0.00 -
0.00/0.02 c barrier LP : 0.00 0 0 0.00 -
0.00/0.02 c diving/probing LP: 0.00 0 0 0.00 -
0.00/0.02 c strong branching : 0.00 0 0 0.00 -
0.00/0.02 c (at root node) : - 0 0 0.00 -
0.00/0.02 c conflict analysis: 0.00 0 0 0.00 -
0.00/0.02 c B&B Tree :
0.00/0.02 c number of runs : 1
0.00/0.02 c nodes : 1
0.00/0.02 c nodes (total) : 1
0.00/0.02 c nodes left : 0
0.00/0.02 c max depth : 0
0.00/0.02 c max depth (total): 0
0.00/0.02 c backtracks : 0 (0.0%)
0.00/0.02 c delayed cutoffs : 0
0.00/0.02 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.00/0.02 c avg switch length: 2.00
0.00/0.02 c switching time : 0.00
0.00/0.02 c Solution :
0.00/0.02 c Solutions found : 4 (4 improvements)
0.00/0.02 c First Solution : +0.00000000000000e+00 (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
0.00/0.02 c Primal Bound : -3.00000000000000e+00 (in run 1, after 1 nodes, 0.02 seconds, depth 0, found by <oneopt>)
0.00/0.02 c Dual Bound : -3.00000000000000e+00
0.00/0.02 c Gap : 0.00 %
0.00/0.02 c Root Dual Bound : -3.00000000000000e+00
0.00/0.02 c Root Iterations : 17
0.00/0.02 c Time complete: 0.01.
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-3450642-1307104730/watcher-3450642-1307104730 -o /tmp/evaluation-result-3450642-1307104730/solver-3450642-1307104730 -C 1800 -W 1900 -M 15500 HOME/scip-2.0.1.4b.linux.x86_64.gnu.opt.spx -f HOME/instance-3450642-1307104730.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.05 2.03 2.00 3/498 21589
/proc/meminfo: memFree=26442284/32950928 swapFree=34421304/67111528
[pid=21589] ppid=21587 vsize=11092 CPUtime=0 cores=0,2,4,6
/proc/21589/stat : 21589 (scip-2.0.1.4b.l) R 21587 21589 20254 0 -1 4202496 1706 0 0 0 0 0 0 0 25 0 1 0 900703661 11358208 1659 33554432000 4194304 9163163 140734617007072 18446744073709551615 8041965 0 0 4096 0 0 0 0 17 0 0 0 0
/proc/21589/statm: 2773 1671 378 1214 0 1555 0
Solver just ended. Dumping a history of the last processes samples
Child status: 0
Real time (s): 0.0301619
CPU time (s): 0.025995
CPU user time (s): 0.017997
CPU system time (s): 0.007998
CPU usage (%): 86.1849
Max. virtual memory (cumulated for all children) (KiB): 0
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 0.017997
system time used= 0.007998
maximum resident set size= 0
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 6049
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.005999 second user time and 0.012998 second system time
The end