0.00/0.01 c SCIP version 2.1.1.4 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.6.0.3] [GitHash: 947bdb7-dirty]
0.00/0.01 c Copyright (c) 2002-2012 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-3692609-1338036111.opb>
0.00/0.01 c original problem has 58 variables (10 bin, 0 int, 48 impl, 0 cont) and 68 constraints
0.00/0.01 c problem read in 0.00
0.00/0.01 o 10
0.00/0.01 c feasible solution found by trivial heuristic, objective value 1.000000e+01
0.00/0.01 c presolving:
0.00/0.01 c (round 1) 0 del vars, 68 del conss, 10 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 96 impls, 0 clqs
0.00/0.01 c (round 2) 48 del vars, 69 del conss, 10 add conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 0 upgd conss, 96 impls, 0 clqs
0.00/0.01 c (round 3) 48 del vars, 69 del conss, 10 add conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 9 upgd conss, 96 impls, 0 clqs
0.00/0.01 c (0.0s) probing cycle finished: starting next cycle
0.00/0.01 c presolving (4 rounds):
0.00/0.01 c 48 deleted vars, 69 deleted constraints, 10 added constraints, 0 tightened bounds, 0 added holes, 1 changed sides, 0 changed coefficients
0.00/0.01 c 96 implications, 0 cliques
0.00/0.01 c presolved problem has 10 variables (10 bin, 0 int, 0 impl, 0 cont) and 9 constraints
0.00/0.01 c 9 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.1.1.4
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 # 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 -----------------------------------------------------------------------------------------------
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 | 8 | - | 295k| 0 | 8 | 10 | 9 | 10 | 9 | 0 | 0 | 0 | 1.636364e+00 | 1.000000e+01 | 511.11%
0.00/0.01 o 8
0.00/0.01 c r 0.0s| 1 | 0 | 8 | - | 295k| 0 | 8 | 10 | 9 | 10 | 9 | 0 | 0 | 0 | 1.636364e+00 | 8.000000e+00 | 388.89%
0.00/0.01 o 7
0.00/0.01 c R 0.0s| 1 | 0 | 8 | - | 296k| 0 | 8 | 10 | 9 | 10 | 9 | 0 | 0 | 0 | 1.636364e+00 | 7.000000e+00 | 327.78%
0.00/0.01 o 6
0.00/0.01 c s 0.0s| 1 | 0 | 8 | - | 296k| 0 | 8 | 10 | 9 | 10 | 9 | 0 | 0 | 0 | 1.636364e+00 | 6.000000e+00 | 266.67%
0.00/0.01 c 0.0s| 1 | 0 | 13 | - | 303k| 0 | 5 | 10 | 9 | 10 | 10 | 1 | 0 | 0 | 1.866667e+00 | 6.000000e+00 | 221.43%
0.00/0.01 o 3
0.00/0.01 c b 0.0s| 1 | 0 | 13 | - | 304k| 0 | 5 | 10 | 9 | 10 | 10 | 1 | 0 | 0 | 1.866667e+00 | 3.000000e+00 | 60.71%
0.00/0.01 o 2
0.00/0.01 c R 0.0s| 1 | 0 | 13 | - | 304k| 0 | - | 10 | 9 | 10 | 10 | 1 | 0 | 0 | 1.866667e+00 | 2.000000e+00 | 7.14%
0.00/0.01 c 0.0s| 1 | 0 | 13 | - | 304k| 0 | - | 10 | 9 | 10 | 10 | 1 | 0 | 0 | 2.000000e+00 | 2.000000e+00 | 0.00%
0.00/0.01 c
0.00/0.01 c SCIP Status : problem is solved [optimal solution found]
0.00/0.01 c Solving Time (sec) : 0.01
0.00/0.01 c Solving Nodes : 1
0.00/0.01 c Primal Bound : +2.00000000000000e+00 (8 solutions)
0.00/0.01 c Dual Bound : +2.00000000000000e+00
0.00/0.01 c Gap : 0.00 %
0.00/0.01 s OPTIMUM FOUND
0.00/0.01 v -x10 -x9 x8 -x7 -x6 -x5 -x4 -x3 -x2 x1
0.00/0.01 c SCIP Status : problem is solved [optimal solution found]
0.00/0.01 c Total Time : 0.01
0.00/0.01 c solving : 0.01
0.00/0.01 c presolving : 0.00 (included in solving)
0.00/0.01 c reading : 0.00 (included in solving)
0.00/0.01 c copying : 0.00 (0 times copied the problem)
0.00/0.01 c Original Problem :
0.00/0.01 c Problem name : HOME/instance-3692609-1338036111.opb
0.00/0.01 c Variables : 58 (10 binary, 0 integer, 48 implicit integer, 0 continuous)
0.00/0.01 c Constraints : 68 initial, 68 maximal
0.00/0.01 c Objective sense : minimize
0.00/0.01 c Presolved Problem :
0.00/0.01 c Problem name : t_HOME/instance-3692609-1338036111.opb
0.00/0.01 c Variables : 10 (10 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.01 c Constraints : 9 initial, 9 maximal
0.00/0.01 c Presolvers : ExecTime SetupTime FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.00/0.01 c domcol : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.01 c trivial : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.01 c dualfix : 0.00 0.00 48 0 0 0 0 0 0 0 0
0.00/0.01 c boundshift : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.01 c inttobinary : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.01 c convertinttobin : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.01 c gateextraction : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.01 c implics : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.01 c components : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.01 c pseudoobj : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.01 c probing : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.01 c linear : 0.00 0.00 0 0 0 0 0 1 0 1 0
0.00/0.01 c logicor : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.00/0.01 c pseudoboolean : 0.00 0.00 0 0 0 0 0 68 10 0 0
0.00/0.01 c root node : - - 0 - - 0 - - - - -
0.00/0.01 c Constraints : Number MaxNumber #Separate #Propagate #EnfoLP #EnfoPS #Check #ResProp Cutoffs DomReds Cuts Conss Children
0.00/0.01 c integral : 0 0 0 0 0 0 13 0 0 0 0 0 0
0.00/0.01 c logicor : 9 9 1 10 0 0 8 0 0 0 0 0 0
0.00/0.01 c countsols : 0 0 0 0 0 0 11 0 0 0 0 0 0
0.00/0.01 c Constraint Timings : TotalTime SetupTime Separate Propagate EnfoLP EnfoPS Check ResProp
0.00/0.01 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.01 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.01 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.01 c Propagators : #Propagate #ResProp Cutoffs DomReds
0.00/0.01 c rootredcost : 0 0 0 0
0.00/0.01 c pseudoobj : 1 0 0 0
0.00/0.01 c vbounds : 0 0 0 0
0.00/0.01 c redcost : 2 0 0 0
0.00/0.01 c probing : 0 0 0 0
0.00/0.01 c Propagator Timings : TotalTime SetupTime Presolve Propagate ResProp
0.00/0.01 c rootredcost : 0.00 0.00 0.00 0.00 0.00
0.00/0.01 c pseudoobj : 0.00 0.00 0.00 0.00 0.00
0.00/0.01 c vbounds : 0.00 0.00 0.00 0.00 0.00
0.00/0.01 c redcost : 0.00 0.00 0.00 0.00 0.00
0.00/0.01 c probing : 0.00 0.00 0.00 0.00 0.00
0.00/0.01 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.00/0.01 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.00/0.01 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.01 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.01 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.01 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.00/0.01 c applied globally : - - - 0 0.0 - - -
0.00/0.01 c applied locally : - - - 0 0.0 - - -
0.00/0.01 c Separators : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss
0.00/0.01 c cut pool : 0.00 0 - - 0 - (maximal pool size: 10)
0.00/0.01 c closecuts : 0.00 0.00 0 0 0 0 0
0.00/0.01 c impliedbounds : 0.00 0.00 1 0 0 0 0
0.00/0.01 c intobj : 0.00 0.00 0 0 0 0 0
0.00/0.01 c gomory : 0.00 0.00 1 0 0 8 0
0.00/0.01 c cgmip : 0.00 0.00 0 0 0 0 0
0.00/0.01 c strongcg : 0.00 0.00 1 0 0 8 0
0.00/0.01 c cmir : 0.00 0.00 1 0 0 0 0
0.00/0.01 c flowcover : 0.00 0.00 1 0 0 0 0
0.00/0.01 c clique : 0.00 0.00 1 0 0 0 0
0.00/0.01 c zerohalf : 0.00 0.00 0 0 0 0 0
0.00/0.01 c mcf : 0.00 0.00 1 0 0 0 0
0.00/0.01 c oddcycle : 0.00 0.00 0 0 0 0 0
0.00/0.01 c rapidlearning : 0.00 0.00 0 0 0 0 0
0.00/0.01 c Pricers : ExecTime SetupTime Calls Vars
0.00/0.01 c problem variables: 0.00 - 0 0
0.00/0.01 c Branching Rules : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss Children
0.00/0.01 c pscost : 0.00 0.00 0 0 0 0 0 0
0.00/0.01 c inference : 0.00 0.00 0 0 0 0 0 0
0.00/0.01 c mostinf : 0.00 0.00 0 0 0 0 0 0
0.00/0.01 c leastinf : 0.00 0.00 0 0 0 0 0 0
0.00/0.01 c fullstrong : 0.00 0.00 0 0 0 0 0 0
0.00/0.01 c allfullstrong : 0.00 0.00 0 0 0 0 0 0
0.00/0.01 c random : 0.00 0.00 0 0 0 0 0 0
0.00/0.01 c relpscost : 0.00 0.00 0 0 0 0 0 0
0.00/0.01 c Primal Heuristics : ExecTime SetupTime Calls Found
0.00/0.01 c LP solutions : 0.00 - - 0
0.00/0.01 c pseudo solutions : 0.00 - - 0
0.00/0.01 c smallcard : 0.00 0.00 0 0
0.00/0.01 c trivial : 0.00 0.00 2 2
0.00/0.01 c shiftandpropagate: 0.00 0.00 0 0
0.00/0.01 c simplerounding : 0.00 0.00 2 2
0.00/0.01 c zirounding : 0.00 0.00 0 0
0.00/0.01 c rounding : 0.00 0.00 2 2
0.00/0.01 c shifting : 0.00 0.00 1 1
0.00/0.01 c intshifting : 0.00 0.00 0 0
0.00/0.01 c oneopt : 0.00 0.00 1 1
0.00/0.01 c twoopt : 0.00 0.00 0 0
0.00/0.01 c indtwoopt : 0.00 0.00 0 0
0.00/0.01 c indoneopt : 0.00 0.00 0 0
0.00/0.01 c fixandinfer : 0.00 0.00 0 0
0.00/0.01 c feaspump : 0.00 0.00 0 0
0.00/0.01 c clique : 0.00 0.00 0 0
0.00/0.01 c indrounding : 0.00 0.00 0 0
0.00/0.01 c indcoefdiving : 0.00 0.00 0 0
0.00/0.01 c coefdiving : 0.00 0.00 0 0
0.00/0.01 c pscostdiving : 0.00 0.00 0 0
0.00/0.01 c nlpdiving : 0.00 0.00 0 0
0.00/0.01 c fracdiving : 0.00 0.00 0 0
0.00/0.01 c veclendiving : 0.00 0.00 0 0
0.00/0.01 c intdiving : 0.00 0.00 0 0
0.00/0.01 c actconsdiving : 0.00 0.00 0 0
0.00/0.01 c objpscostdiving : 0.00 0.00 0 0
0.00/0.01 c rootsoldiving : 0.00 0.00 0 0
0.00/0.01 c linesearchdiving : 0.00 0.00 0 0
0.00/0.01 c guideddiving : 0.00 0.00 0 0
0.00/0.01 c octane : 0.00 0.00 0 0
0.00/0.01 c rens : 0.00 0.00 0 0
0.00/0.01 c rins : 0.00 0.00 0 0
0.00/0.01 c localbranching : 0.00 0.00 0 0
0.00/0.01 c mutation : 0.00 0.00 0 0
0.00/0.01 c crossover : 0.00 0.00 0 0
0.00/0.01 c dins : 0.00 0.00 0 0
0.00/0.01 c vbounds : 0.00 0.00 0 0
0.00/0.01 c undercover : 0.00 0.00 0 0
0.00/0.01 c subnlp : 0.00 0.00 0 0
0.00/0.01 c trysol : 0.00 0.00 0 0
0.00/0.01 c LP : Time Calls Iterations Iter/call Iter/sec Time-0-It Calls-0-It
0.00/0.01 c primal LP : 0.00 0 0 0.00 - 0.00 0
0.00/0.01 c dual LP : 0.00 2 13 6.50 - 0.00 0
0.00/0.01 c lex dual LP : 0.00 0 0 0.00 -
0.00/0.01 c barrier LP : 0.00 0 0 0.00 - 0.00 0
0.00/0.01 c diving/probing LP: 0.00 0 0 0.00 -
0.00/0.01 c strong branching : 0.00 0 0 0.00 -
0.00/0.01 c (at root node) : - 0 0 0.00 -
0.00/0.01 c conflict analysis: 0.00 0 0 0.00 -
0.00/0.01 c B&B Tree :
0.00/0.01 c number of runs : 1
0.00/0.01 c nodes : 1
0.00/0.01 c nodes (total) : 1
0.00/0.01 c nodes left : 0
0.00/0.01 c max depth : 0
0.00/0.01 c max depth (total): 0
0.00/0.01 c backtracks : 0 (0.0%)
0.00/0.01 c delayed cutoffs : 0
0.00/0.01 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.00/0.01 c avg switch length: 2.00
0.00/0.01 c switching time : 0.00
0.00/0.01 c Solution :
0.00/0.01 c Solutions found : 8 (6 improvements)
0.00/0.01 c First Solution : +1.00000000000000e+01 (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
0.00/0.01 c Primal Bound : +2.00000000000000e+00 (in run 1, after 1 nodes, 0.01 seconds, depth 0, found by <rounding>)
0.00/0.01 c Dual Bound : +2.00000000000000e+00
0.00/0.01 c Gap : 0.00 %
0.00/0.01 c Root Dual Bound : +2.00000000000000e+00
0.00/0.01 c Root Iterations : 13
0.00/0.02 c Time complete: 0.
runsolver Copyright (C) 2010-2011 Olivier ROUSSEL
This is runsolver version 3.3.1 (svn: 989)
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-3692609-1338036111/watcher-3692609-1338036111 -o /tmp/evaluation-result-3692609-1338036111/solver-3692609-1338036111 -C 1800 -W 1900 -M 15500 HOME/scip-2.1.1.4expfix.linux.x86_64.gnu.opt.spx -f HOME/instance-3692609-1338036111.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: 1.97 2.00 2.00 3/174 16841
/proc/meminfo: memFree=28798200/32873852 swapFree=6848/6848
[pid=16841] ppid=16839 vsize=11812 CPUtime=0 cores=0,2,4,6
/proc/16841/stat : 16841 (runsolver) D 16839 16841 14609 0 -1 4202560 42 0 0 0 0 0 0 0 20 0 1 0 269736529 12095488 50 33554432000 4194304 5436572 140734697872448 140734697868744 4883175 0 0 4096 24578 18446744071579943789 0 0 17 0 0 0 0 0 0
/proc/16841/statm: 2953 50 31 304 0 2645 0
Solver just ended. Dumping a history of the last processes samples
Child status: 0
Real time (s): 0.0234161
CPU time (s): 0.016996
CPU user time (s): 0.006998
CPU system time (s): 0.009998
CPU usage (%): 72.5825
Max. virtual memory (cumulated for all children) (KiB): 0
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 0.006998
system time used= 0.009998
maximum resident set size= 12448
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 3428
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 second user time and 0.005999 second system time
The end