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-3484927-1307779563.opb>
0.00/0.00 c original problem has 96 variables (96 bin, 0 int, 0 impl, 0 cont) and 9 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) 4 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 30 chg coeffs, 0 upgd conss, 1264 impls, 0 clqs
0.00/0.01 c (round 2) 20 del vars, 14 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 44 chg coeffs, 5 upgd conss, 1936 impls, 0 clqs
0.00/0.01 c (round 3) 36 del vars, 28 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 58 chg coeffs, 5 upgd conss, 2384 impls, 0 clqs
0.00/0.01 c (round 4) 52 del vars, 42 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 72 chg coeffs, 5 upgd conss, 2608 impls, 0 clqs
0.00/0.01 c (round 5) 68 del vars, 56 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 86 chg coeffs, 5 upgd conss, 2608 impls, 0 clqs
0.00/0.02 c (0.0s) probing: 151/284 (53.2%) - 0 fixings, 0 aggregations, 8 implications, 0 bound changes
0.00/0.02 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.00/0.02 c presolving (6 rounds):
0.00/0.02 c 68 deleted vars, 56 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 86 changed coefficients
0.00/0.02 c 2624 implications, 0 cliques
0.00/0.02 c presolved problem has 284 variables (284 bin, 0 int, 0 impl, 0 cont) and 205 constraints
0.00/0.02 c 196 constraints of type <and>
0.00/0.02 c 4 constraints of type <linear>
0.00/0.02 c 5 constraints of type <logicor>
0.00/0.02 c transformed objective value is always integral (scale: 2)
0.00/0.02 c Presolving Time: 0.01
0.00/0.02 c - non default parameters ----------------------------------------------------------------------
0.00/0.02 c # SCIP version 2.0.1.4
0.00/0.02 c
0.00/0.02 c # frequency for displaying node information lines
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.02 c display/freq = 10000
0.00/0.02 c
0.00/0.02 c # maximal time in seconds to run
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.02 c limits/time = 1797
0.00/0.02 c
0.00/0.02 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.02 c limits/memory = 13950
0.00/0.02 c
0.00/0.02 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.02 c # [type: int, range: [1,2], default: 1]
0.00/0.02 c timing/clocktype = 2
0.00/0.02 c
0.00/0.02 c # belongs reading time to solving time?
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c timing/reading = TRUE
0.00/0.02 c
0.00/0.02 c # should presolving try to simplify inequalities
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/linear/simplifyinequalities = TRUE
0.00/0.02 c
0.00/0.02 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/indicator/addCouplingCons = TRUE
0.00/0.02 c
0.00/0.02 c # should presolving try to simplify knapsacks
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.02 c
0.00/0.02 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c separating/rapidlearning/freq = 0
0.00/0.02 c
0.00/0.02 c -----------------------------------------------------------------------------------------------
0.00/0.02 c start solving
0.00/0.02 c
0.00/0.02 o 3
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 T 0.0s| 1 | 0 | 0 | - |1300k| 0 | - | 284 | 205 | 284 | 401 | 0 | 0 | 0 | -- | 3.000000e+00 | Inf
0.00/0.02 c 0.0s| 1 | 0 | 0 | - |1201k| 0 | - | 284 | 156 | 284 | 401 | 0 | 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 (1 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 -x96 x95 -x94 x93 -x92 -x91 -x90 -x89 -x88 -x87 -x86 -x85 -x84 -x83 -x82 -x81 -x64 x63 -x62 x61 -x60 -x59 -x58 x57 -x80 -x79 -x78
0.00/0.02 v -x77 -x76 -x75 -x74 -x73 -x56 -x55 -x54 x53 x52 -x51 x50 x49 -x72 -x71 -x70 -x69 -x68 -x67 -x66 -x65 -x48 -x47 -x46 -x45 x44
0.00/0.02 v -x43 -x42 x41 x40 x39 x38 x37 x36 x35 x34 x33 -x32 -x31 -x30 -x29 -x28 -x27 x26 x25 -x24 -x23 -x22 -x21 -x20 -x19 x18 x17
0.00/0.02 v -x16 -x15 -x14 -x13 -x12 -x11 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.01 (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-3484927-1307779563.opb
0.00/0.02 c Variables : 96 (96 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.02 c Constraints : 9 initial, 9 maximal
0.00/0.02 c Presolved Problem :
0.00/0.02 c Problem name : t_HOME/instance-3484927-1307779563.opb
0.00/0.02 c Variables : 284 (284 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.02 c Constraints : 205 initial, 205 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 implics : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.02 c probing : 0.01 0 0 0 0 0 0 0 0 0
0.00/0.02 c and : 0.00 8 56 0 0 0 56 0 0 56
0.00/0.02 c linear : 0.00 1 3 0 0 0 0 0 0 30
0.00/0.02 c logicor : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.02 c root node : - 64 - - 64 - - - - -
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 6 0 0 0 0 0 0
0.00/0.02 c and : 196 0 371 0 0 4 0 0 49 0 0 0
0.00/0.02 c linear : 4 0 370 0 0 3 0 0 8 0 0 0
0.00/0.02 c logicor : 5 0 54 0 0 1 0 1 0 0 0 0
0.00/0.02 c countsols : 0 0 0 0 0 3 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 and : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.02 c linear : 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 : 63 0 0 7
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 1 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: 0)
0.00/0.02 c redcost : 0.00 0 0 0 0 0
0.00/0.02 c impliedbounds : 0.00 0 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 0 0 0 0 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 0 0 0 0 0
0.00/0.02 c cmir : 0.00 0 0 0 0 0
0.00/0.02 c flowcover : 0.00 0 0 0 0 0
0.00/0.02 c clique : 0.00 0 0 0 0 0
0.00/0.02 c zerohalf : 0.00 0 0 0 0 0
0.00/0.02 c mcf : 0.00 0 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 0
0.00/0.02 c shiftandpropagate: 0.00 1 1
0.00/0.02 c simplerounding : 0.00 0 0
0.00/0.02 c zirounding : 0.00 0 0
0.00/0.02 c rounding : 0.00 0 0
0.00/0.02 c shifting : 0.00 0 0
0.00/0.02 c intshifting : 0.00 0 0
0.00/0.02 c oneopt : 0.00 1 0
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.00 0 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 0 0 0.00 -
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 : 1 (1 improvements)
0.00/0.02 c First Solution : +3.00000000000000e+00 (in run 1, after 1 nodes, 0.02 seconds, depth 32, found by <shiftandpropagate>)
0.00/0.02 c Primal Bound : +3.00000000000000e+00 (in run 1, after 1 nodes, 0.02 seconds, depth 32, found by <shiftandpropagate>)
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 : 0
0.00/0.02 c Time complete: 0.02.
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-3484927-1307779563/watcher-3484927-1307779563 -o /tmp/evaluation-result-3484927-1307779563/solver-3484927-1307779563 -C 1800 -W 1900 -M 15500 HOME/scip-2.0.1.4_2.linux.x86_64.gnu.opt.spx -f HOME/instance-3484927-1307779563.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.12 2.03 1.99 2/177 6130
/proc/meminfo: memFree=31312144/32950928 swapFree=67054844/67111528
[pid=6130] ppid=6128 vsize=9844 CPUtime=0 cores=0,2,4,6
/proc/6130/stat : 6130 (scip-2.0.1.4_2.) R 6128 6130 32526 0 -1 4202496 1459 0 0 0 0 0 0 0 25 0 1 0 968187004 10080256 1414 33554432000 4194304 8979876 140734619054448 18446744073709551615 6779003 0 0 4096 0 0 0 0 17 2 0 0 0
/proc/6130/statm: 2461 1414 367 1169 0 1288 0
Solver just ended. Dumping a history of the last processes samples
Child status: 0
Real time (s): 0.0285671
CPU time (s): 0.027995
CPU user time (s): 0.022996
CPU system time (s): 0.004999
CPU usage (%): 97.9973
Max. virtual memory (cumulated for all children) (KiB): 0
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 0.022996
system time used= 0.004999
maximum resident set size= 0
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 3683
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= 5
involuntary context switches= 1
runsolver used 0.002999 second user time and 0.001999 second system time
The end