0.00/0.00 c SCIP version 2.0.1.4 [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-3485149-1307784591.opb>
0.00/0.00 c original problem has 10 variables (10 bin, 0 int, 0 impl, 0 cont) and 10 constraints
0.00/0.00 c problem read
0.00/0.00 c presolving settings loaded
0.00/0.00 o 0
0.00/0.00 c feasible solution found by trivial heuristic, objective value 0.000000e+00
0.00/0.00 c presolving:
0.00/0.00 c (round 1) 23 del vars, 10 del conss, 0 add conss, 23 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 92 impls, 0 clqs
0.00/0.00 c (round 2) 23 del vars, 10 del conss, 0 add conss, 23 chg bounds, 0 chg sides, 0 chg coeffs, 23 upgd conss, 138 impls, 0 clqs
0.00/0.00 c presolving (3 rounds):
0.00/0.00 c 23 deleted vars, 10 deleted constraints, 0 added constraints, 23 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.00 c 138 implications, 0 cliques
0.00/0.00 c presolved problem has 10 variables (10 bin, 0 int, 0 impl, 0 cont) and 23 constraints
0.00/0.00 c 23 constraints of type <logicor>
0.00/0.00 c transformed objective value is always integral (scale: 1)
0.00/0.00 c Presolving Time: 0.00
0.00/0.00 c - non default parameters ----------------------------------------------------------------------
0.00/0.00 c # SCIP version 2.0.1.4
0.00/0.00 c
0.00/0.00 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.00/0.00 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.00 c conflict/interconss = 0
0.00/0.00 c
0.00/0.00 c # should binary conflicts be preferred?
0.00/0.00 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.00 c conflict/preferbinary = TRUE
0.00/0.00 c
0.00/0.00 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.00/0.00 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.00 c constraints/agelimit = 1
0.00/0.00 c
0.00/0.00 c # should enforcement of pseudo solution be disabled?
0.00/0.00 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.00 c constraints/disableenfops = TRUE
0.00/0.00 c
0.00/0.00 c # frequency for displaying node information lines
0.00/0.00 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.00 c display/freq = 10000
0.00/0.00 c
0.00/0.00 c # maximal time in seconds to run
0.00/0.00 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.00 c limits/time = 1797
0.00/0.00 c
0.00/0.00 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.00 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.00 c limits/memory = 13950
0.00/0.00 c
0.00/0.00 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.00 c # [type: int, range: [1,2], default: 1]
0.00/0.00 c timing/clocktype = 2
0.00/0.00 c
0.00/0.00 c # belongs reading time to solving time?
0.00/0.00 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.00 c timing/reading = TRUE
0.00/0.00 c
0.00/0.00 c # should presolving try to simplify inequalities
0.00/0.00 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.00 c constraints/linear/simplifyinequalities = TRUE
0.00/0.00 c
0.00/0.00 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.00 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.00 c constraints/indicator/addCouplingCons = TRUE
0.00/0.00 c
0.00/0.00 c # should presolving try to simplify knapsacks
0.00/0.00 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.00 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.00 c
0.00/0.00 c -----------------------------------------------------------------------------------------------
0.00/0.00 c start solving
0.00/0.00 c
0.00/0.00 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.00 c t 0.0s| 1 | 0 | 10 | - | 192k| 0 | 10 | 10 | 23 | 10 | 23 | 0 | 0 | 0 |-5.000000e+00 | 0.000000e+00 | 100.00%
0.00/0.00 o -1
0.00/0.00 c R 0.0s| 1 | 0 | 10 | - | 192k| 0 | 10 | 10 | 23 | 10 | 23 | 0 | 0 | 0 |-5.000000e+00 |-1.000000e+00 | 80.00%
0.00/0.00 o -2
0.00/0.00 c s 0.0s| 1 | 0 | 10 | - | 193k| 0 | 10 | 10 | 23 | 10 | 23 | 0 | 0 | 0 |-5.000000e+00 |-2.000000e+00 | 60.00%
0.00/0.00 c 0.0s| 1 | 0 | 15 | - | 196k| 0 | 0 | 10 | 23 | 10 | 26 | 3 | 0 | 0 |-4.000000e+00 |-2.000000e+00 | 50.00%
0.00/0.00 o -3
0.00/0.00 c b 0.0s| 1 | 0 | 15 | - | 197k| 0 | 0 | 10 | 23 | 10 | 26 | 3 | 0 | 0 |-4.000000e+00 |-3.000000e+00 | 25.00%
0.00/0.00 o -4
0.00/0.00 c * 0.0s| 1 | 0 | 15 | - | 197k| 0 | - | 10 | 23 | 10 | 26 | 3 | 0 | 0 |-4.000000e+00 |-4.000000e+00 | 0.00%
0.00/0.00 c
0.00/0.00 c SCIP Status : problem is solved [optimal solution found]
0.00/0.00 c Solving Time (sec) : 0.01
0.00/0.00 c Solving Nodes : 1
0.00/0.00 c Primal Bound : -4.00000000000000e+00 (5 solutions)
0.00/0.00 c Dual Bound : -4.00000000000000e+00
0.00/0.00 c Gap : 0.00 %
0.00/0.00 s OPTIMUM FOUND
0.00/0.00 v x10 x9 -x8 x7 x6 -x5 -x4 -x3 -x2 -x1
0.00/0.00 c SCIP Status : problem is solved [optimal solution found]
0.00/0.00 c Total Time : 0.01
0.00/0.00 c solving : 0.01
0.00/0.00 c presolving : 0.00 (included in solving)
0.00/0.00 c reading : 0.00 (included in solving)
0.00/0.00 c Original Problem :
0.00/0.00 c Problem name : HOME/instance-3485149-1307784591.opb
0.00/0.00 c Variables : 10 (10 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.00 c Constraints : 10 initial, 10 maximal
0.00/0.00 c Presolved Problem :
0.00/0.00 c Problem name : t_HOME/instance-3485149-1307784591.opb
0.00/0.00 c Variables : 10 (10 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.00 c Constraints : 23 initial, 23 maximal
0.00/0.00 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.00/0.00 c trivial : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.00 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.00 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.00 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.00 c implics : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.00 c probing : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.00 c and : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.00 c linear : 0.00 23 0 0 23 0 10 0 0 0
0.00/0.00 c logicor : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.00 c root node : - 0 - - 0 - - - - -
0.00/0.00 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
0.00/0.00 c integral : 0 0 0 1 0 8 0 0 0 0 0 0
0.00/0.00 c logicor : 23 2 11 1 0 4 0 0 0 0 0 0
0.00/0.00 c countsols : 0 0 0 1 0 6 0 0 0 0 0 0
0.00/0.00 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
0.00/0.00 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.00 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.00 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.00 c Propagators : #Propagate #Resprop Cutoffs DomReds
0.00/0.00 c vbounds : 0 0 0 0
0.00/0.00 c rootredcost : 0 0 0 0
0.00/0.00 c pseudoobj : 3 0 0 0
0.00/0.00 c Propagator Timings : TotalTime Propagate Resprop
0.00/0.00 c vbounds : 0.00 0.00 0.00
0.00/0.00 c rootredcost : 0.00 0.00 0.00
0.00/0.00 c pseudoobj : 0.00 0.00 0.00
0.00/0.00 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.00/0.00 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.00/0.00 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.00 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.00 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.00 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.00/0.00 c applied globally : - - - 0 0.0 - - -
0.00/0.00 c applied locally : - - - 0 0.0 - - -
0.00/0.00 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.00/0.00 c cut pool : 0.00 1 - - 0 - (maximal pool size: 7)
0.00/0.00 c redcost : 0.00 2 0 0 0 0
0.00/0.00 c impliedbounds : 0.00 1 0 0 0 0
0.00/0.00 c intobj : 0.00 0 0 0 0 0
0.00/0.00 c gomory : 0.00 1 0 0 10 0
0.00/0.00 c cgmip : 0.00 0 0 0 0 0
0.00/0.00 c closecuts : 0.00 0 0 0 0 0
0.00/0.00 c strongcg : 0.00 1 0 0 10 0
0.00/0.00 c cmir : 0.00 1 0 0 0 0
0.00/0.00 c flowcover : 0.00 1 0 0 0 0
0.00/0.00 c clique : 0.00 1 0 0 6 0
0.00/0.00 c zerohalf : 0.00 0 0 0 0 0
0.00/0.00 c mcf : 0.00 1 0 0 0 0
0.00/0.00 c oddcycle : 0.00 0 0 0 0 0
0.00/0.00 c rapidlearning : 0.00 0 0 0 0 0
0.00/0.00 c Pricers : Time Calls Vars
0.00/0.00 c problem variables: 0.00 0 0
0.00/0.00 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.00/0.00 c pscost : 0.00 0 0 0 0 0 0
0.00/0.00 c inference : 0.00 0 0 0 0 0 0
0.00/0.00 c mostinf : 0.00 0 0 0 0 0 0
0.00/0.00 c leastinf : 0.00 0 0 0 0 0 0
0.00/0.00 c fullstrong : 0.00 0 0 0 0 0 0
0.00/0.00 c allfullstrong : 0.00 0 0 0 0 0 0
0.00/0.00 c random : 0.00 0 0 0 0 0 0
0.00/0.00 c relpscost : 0.00 0 0 0 0 0 0
0.00/0.00 c Primal Heuristics : Time Calls Found
0.00/0.00 c LP solutions : 0.00 - 1
0.00/0.00 c pseudo solutions : 0.00 - 0
0.00/0.00 c crossover : 0.00 0 0
0.00/0.00 c trivial : 0.00 2 1
0.00/0.00 c shiftandpropagate: 0.00 0 0
0.00/0.00 c simplerounding : 0.00 1 0
0.00/0.00 c zirounding : 0.00 0 0
0.00/0.00 c rounding : 0.00 1 1
0.00/0.00 c shifting : 0.00 1 1
0.00/0.00 c intshifting : 0.00 0 0
0.00/0.00 c oneopt : 0.00 1 1
0.00/0.00 c twoopt : 0.00 0 0
0.00/0.00 c fixandinfer : 0.00 0 0
0.00/0.00 c feaspump : 0.00 0 0
0.00/0.00 c clique : 0.00 0 0
0.00/0.00 c coefdiving : 0.00 0 0
0.00/0.00 c pscostdiving : 0.00 0 0
0.00/0.00 c fracdiving : 0.00 0 0
0.00/0.00 c veclendiving : 0.00 0 0
0.00/0.00 c intdiving : 0.00 0 0
0.00/0.00 c actconsdiving : 0.00 0 0
0.00/0.00 c objpscostdiving : 0.00 0 0
0.00/0.00 c rootsoldiving : 0.00 0 0
0.00/0.00 c linesearchdiving : 0.00 0 0
0.00/0.00 c guideddiving : 0.00 0 0
0.00/0.00 c octane : 0.00 0 0
0.00/0.00 c rens : 0.00 0 0
0.00/0.00 c rins : 0.00 0 0
0.00/0.00 c localbranching : 0.00 0 0
0.00/0.00 c mutation : 0.00 0 0
0.00/0.00 c dins : 0.00 0 0
0.00/0.00 c vbounds : 0.00 0 0
0.00/0.00 c undercover : 0.00 0 0
0.00/0.00 c subnlp : 0.00 0 0
0.00/0.00 c trysol : 0.00 0 0
0.00/0.00 c LP : Time Calls Iterations Iter/call Iter/sec
0.00/0.00 c primal LP : 0.00 0 0 0.00 -
0.00/0.00 c dual LP : 0.00 2 15 7.50 -
0.00/0.00 c lex dual LP : 0.00 0 0 0.00 -
0.00/0.00 c barrier LP : 0.00 0 0 0.00 -
0.00/0.00 c diving/probing LP: 0.00 0 0 0.00 -
0.00/0.00 c strong branching : 0.00 0 0 0.00 -
0.00/0.00 c (at root node) : - 0 0 0.00 -
0.00/0.00 c conflict analysis: 0.00 0 0 0.00 -
0.00/0.00 c B&B Tree :
0.00/0.00 c number of runs : 1
0.00/0.00 c nodes : 1
0.00/0.00 c nodes (total) : 1
0.00/0.00 c nodes left : 0
0.00/0.00 c max depth : 0
0.00/0.00 c max depth (total): 0
0.00/0.00 c backtracks : 0 (0.0%)
0.00/0.00 c delayed cutoffs : 0
0.00/0.00 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.00/0.00 c avg switch length: 2.00
0.00/0.00 c switching time : 0.00
0.00/0.00 c Solution :
0.00/0.00 c Solutions found : 5 (5 improvements)
0.00/0.00 c First Solution : +0.00000000000000e+00 (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
0.00/0.00 c Primal Bound : -4.00000000000000e+00 (in run 1, after 1 nodes, 0.01 seconds, depth 0, found by <relaxation>)
0.00/0.00 c Dual Bound : -4.00000000000000e+00
0.00/0.00 c Gap : 0.00 %
0.00/0.00 c Root Dual Bound : -4.00000000000000e+00
0.00/0.00 c Root Iterations : 15
0.00/0.01 c Time complete: 0.
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-3485149-1307784591/watcher-3485149-1307784591 -o /tmp/evaluation-result-3485149-1307784591/solver-3485149-1307784591 -C 1800 -W 1900 -M 15500 HOME/scip-2.0.1.4_2.linux.x86_64.gnu.opt.spx -f HOME/instance-3485149-1307784591.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 2.00 1.93 2/177 12175
/proc/meminfo: memFree=31272184/32951124 swapFree=67056684/67111528
[pid=12175] ppid=12173 vsize=13492 CPUtime=0 cores=0,2,4,6
/proc/12175/stat : 12175 (scip-2.0.1.4_2.) R 12173 12175 9145 0 -1 4202496 2201 0 0 0 0 0 0 0 25 0 1 0 890059895 13815808 2156 33554432000 4194304 8979876 140736053810784 18446744073709551615 7836189 0 0 4096 2 0 0 0 17 2 0 0 0
/proc/12175/statm: 3373 2169 423 1169 0 2200 0
Solver just ended. Dumping a history of the last processes samples
Child status: 0
Real time (s): 0.012217
CPU time (s): 0.011997
CPU user time (s): 0.007998
CPU system time (s): 0.003999
CPU usage (%): 98.1996
Max. virtual memory (cumulated for all children) (KiB): 0
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 0.007998
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= 3200
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= 4
involuntary context switches= 1
runsolver used 0.002999 second user time and 0.004999 second system time
The end