0.00/0.00 c SCIP version 2.0.1.4 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.4]
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-3453261-1307092676.opb>
0.00/0.00 c original problem has 100 variables (100 bin, 0 int, 0 impl, 0 cont) and 50 constraints
0.00/0.00 c problem read
0.00/0.00 c presolving settings loaded
0.00/0.00 o 100
0.00/0.00 c feasible solution found by trivial heuristic, objective value 1.000000e+02
0.00/0.00 c presolving:
0.00/0.01 c (round 1) 0 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 50 upgd conss, 0 impls, 0 clqs
0.00/0.01 c presolving (2 rounds):
0.00/0.01 c 0 deleted vars, 0 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.01 c 0 implications, 0 cliques
0.00/0.01 c presolved problem has 100 variables (100 bin, 0 int, 0 impl, 0 cont) and 50 constraints
0.00/0.01 c 50 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.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 # 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 # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01 c lp/solvefreq = 0
0.00/0.01 c
0.00/0.01 c # LP pricing strategy ('l'pi default, 'a'uto, 'f'ull pricing, 'p'artial, 's'teepest edge pricing, 'q'uickstart steepest edge pricing, 'd'evex pricing)
0.00/0.01 c # [type: char, range: {lafpsqd}, default: l]
0.00/0.01 c lp/pricing = a
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 # priority of node selection rule <dfs> in standard mode
0.00/0.01 c # [type: int, range: [-536870912,536870911], default: 0]
0.00/0.01 c nodeselection/dfs/stdpriority = 1000000
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 t 0.0s| 1 | 0 | 210 | - | 703k| 0 | 39 | 100 | 50 | 100 | 50 | 0 | 0 | 0 | 1.341678e+00 | 1.000000e+02 |7353.36%
0.00/0.02 o 39
0.00/0.02 c r 0.0s| 1 | 0 | 210 | - | 706k| 0 | 39 | 100 | 50 | 100 | 50 | 0 | 0 | 0 | 1.341678e+00 | 3.900000e+01 |2806.81%
0.00/0.02 o 38
0.00/0.02 c R 0.0s| 1 | 0 | 210 | - | 709k| 0 | 39 | 100 | 50 | 100 | 50 | 0 | 0 | 0 | 1.341678e+00 | 3.800000e+01 |2732.28%
0.00/0.02 o 37
0.00/0.02 c s 0.0s| 1 | 0 | 210 | - | 711k| 0 | 39 | 100 | 50 | 100 | 50 | 0 | 0 | 0 | 1.341678e+00 | 3.700000e+01 |2657.74%
0.00/0.02 o 4
0.00/0.02 c z 0.0s| 1 | 0 | 210 | - | 714k| 0 | 39 | 100 | 50 | 100 | 50 | 0 | 0 | 0 | 1.341678e+00 | 4.000000e+00 | 198.13%
0.02/0.04 o 2
0.02/0.04 c E 0.0s| 1 | 0 | 210 | - | 715k| 0 | - | 100 | 50 | 100 | 50 | 0 | 0 | 0 | 1.341678e+00 | 2.000000e+00 | 49.07%
0.02/0.04 c 0.0s| 1 | 0 | 210 | - | 715k| 0 | - | 100 | 50 | 100 | 50 | 0 | 0 | 0 | 2.000000e+00 | 2.000000e+00 | 0.00%
0.02/0.04 c
0.02/0.04 c SCIP Status : problem is solved [optimal solution found]
0.02/0.04 c Solving Time (sec) : 0.04
0.02/0.04 c Solving Nodes : 1
0.02/0.04 c Primal Bound : +2.00000000000000e+00 (6 solutions)
0.02/0.04 c Dual Bound : +2.00000000000000e+00
0.02/0.04 c Gap : 0.00 %
0.02/0.04 s OPTIMUM FOUND
0.02/0.04 v -x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92 -x91 -x90 -x89 -x88 -x87 -x86 -x85 -x84 -x83 -x82 -x81 -x80 -x79 -x78 -x77 -x76 -x75
0.02/0.04 v -x74 -x73 -x72 -x71 -x70 -x69 -x68 x67 -x66 -x65 -x64 -x63 -x62 -x61 -x60 -x59 -x58 -x57 -x56 -x55 -x54 -x53 -x52 -x51 -x50
0.02/0.04 v -x49 -x48 -x47 -x46 -x45 -x44 -x43 -x42 -x41 -x40 x39 -x38 -x37 -x36 -x35 -x34 -x33 -x32 -x31 -x30 -x29 -x28 -x27 -x26 -x25
0.02/0.04 v -x24 -x23 -x22 -x21 -x20 -x19 -x18 -x17 -x16 -x15 -x14 -x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 -x1
0.02/0.04 c SCIP Status : problem is solved [optimal solution found]
0.02/0.04 c Total Time : 0.04
0.02/0.04 c solving : 0.04
0.02/0.04 c presolving : 0.00 (included in solving)
0.02/0.04 c reading : 0.00 (included in solving)
0.02/0.04 c Original Problem :
0.02/0.04 c Problem name : HOME/instance-3453261-1307092676.opb
0.02/0.04 c Variables : 100 (100 binary, 0 integer, 0 implicit integer, 0 continuous)
0.02/0.04 c Constraints : 50 initial, 50 maximal
0.02/0.04 c Presolved Problem :
0.02/0.04 c Problem name : t_HOME/instance-3453261-1307092676.opb
0.02/0.04 c Variables : 100 (100 binary, 0 integer, 0 implicit integer, 0 continuous)
0.02/0.04 c Constraints : 50 initial, 50 maximal
0.02/0.04 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.02/0.04 c trivial : 0.00 0 0 0 0 0 0 0 0 0
0.02/0.04 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
0.02/0.04 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
0.02/0.04 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
0.02/0.04 c implics : 0.00 0 0 0 0 0 0 0 0 0
0.02/0.04 c probing : 0.00 0 0 0 0 0 0 0 0 0
0.02/0.04 c linear : 0.00 0 0 0 0 0 0 0 0 0
0.02/0.04 c logicor : 0.00 0 0 0 0 0 0 0 0 0
0.02/0.04 c root node : - 0 - - 0 - - - - -
0.02/0.04 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
0.02/0.04 c integral : 0 0 0 0 0 11 0 0 0 0 0 0
0.02/0.04 c logicor : 50 1 26 0 0 6 0 0 0 0 0 0
0.02/0.04 c countsols : 0 0 0 0 0 9 0 0 0 0 0 0
0.02/0.04 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
0.02/0.04 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.02/0.04 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.02/0.04 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.02/0.04 c Propagators : #Propagate #Resprop Cutoffs DomReds
0.02/0.04 c vbounds : 0 0 0 0
0.02/0.04 c rootredcost : 0 0 0 0
0.02/0.04 c pseudoobj : 2 0 0 0
0.02/0.04 c Propagator Timings : TotalTime Propagate Resprop
0.02/0.04 c vbounds : 0.00 0.00 0.00
0.02/0.04 c rootredcost : 0.00 0.00 0.00
0.02/0.04 c pseudoobj : 0.00 0.00 0.00
0.02/0.04 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.02/0.04 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.02/0.04 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.02/0.04 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.02/0.04 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.02/0.04 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.02/0.04 c applied globally : - - - 0 0.0 - - -
0.02/0.04 c applied locally : - - - 0 0.0 - - -
0.02/0.04 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.02/0.04 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.02/0.04 c redcost : 0.00 1 0 0 0 0
0.02/0.04 c impliedbounds : 0.00 1 0 0 0 0
0.02/0.04 c intobj : 0.00 0 0 0 0 0
0.02/0.04 c gomory : 0.00 1 0 0 0 0
0.02/0.04 c cgmip : 0.00 0 0 0 0 0
0.02/0.04 c closecuts : 0.00 0 0 0 0 0
0.02/0.04 c strongcg : 0.00 1 0 0 0 0
0.02/0.04 c cmir : 0.00 1 0 0 0 0
0.02/0.04 c flowcover : 0.00 1 0 0 0 0
0.02/0.04 c clique : 0.00 1 0 0 0 0
0.02/0.04 c zerohalf : 0.00 0 0 0 0 0
0.02/0.04 c mcf : 0.00 1 0 0 0 0
0.02/0.04 c oddcycle : 0.00 0 0 0 0 0
0.02/0.04 c rapidlearning : 0.00 0 0 0 0 0
0.02/0.04 c Pricers : Time Calls Vars
0.02/0.04 c problem variables: 0.00 0 0
0.02/0.04 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.02/0.04 c relpscost : 0.00 0 0 0 0 0 0
0.02/0.04 c pscost : 0.00 0 0 0 0 0 0
0.02/0.04 c inference : 0.00 0 0 0 0 0 0
0.02/0.04 c mostinf : 0.00 0 0 0 0 0 0
0.02/0.04 c leastinf : 0.00 0 0 0 0 0 0
0.02/0.04 c fullstrong : 0.00 0 0 0 0 0 0
0.02/0.04 c allfullstrong : 0.00 0 0 0 0 0 0
0.02/0.04 c random : 0.00 0 0 0 0 0 0
0.02/0.04 c Primal Heuristics : Time Calls Found
0.02/0.04 c LP solutions : 0.00 - 0
0.02/0.04 c pseudo solutions : 0.00 - 0
0.02/0.04 c oneopt : 0.00 0 0
0.02/0.04 c crossover : 0.00 0 0
0.02/0.04 c trivial : 0.00 2 1
0.02/0.04 c shiftandpropagate: 0.00 0 0
0.02/0.04 c simplerounding : 0.00 1 1
0.02/0.04 c zirounding : 0.00 1 1
0.02/0.04 c rounding : 0.00 1 1
0.02/0.04 c shifting : 0.00 1 1
0.02/0.04 c intshifting : 0.00 0 0
0.02/0.04 c twoopt : 0.00 0 0
0.02/0.04 c fixandinfer : 0.00 0 0
0.02/0.04 c feaspump : 0.00 0 0
0.02/0.04 c clique : 0.00 0 0
0.02/0.04 c coefdiving : 0.00 0 0
0.02/0.04 c pscostdiving : 0.00 0 0
0.02/0.04 c fracdiving : 0.00 0 0
0.02/0.04 c veclendiving : 0.00 0 0
0.02/0.04 c intdiving : 0.00 0 0
0.02/0.04 c actconsdiving : 0.00 0 0
0.02/0.04 c objpscostdiving : 0.00 0 0
0.02/0.04 c rootsoldiving : 0.00 0 0
0.02/0.04 c linesearchdiving : 0.00 0 0
0.02/0.04 c guideddiving : 0.00 0 0
0.02/0.04 c octane : 0.00 0 0
0.02/0.04 c rens : 0.02 1 1
0.02/0.04 c rins : 0.00 0 0
0.02/0.04 c localbranching : 0.00 0 0
0.02/0.04 c mutation : 0.00 0 0
0.02/0.04 c dins : 0.00 0 0
0.02/0.04 c vbounds : 0.00 0 0
0.02/0.04 c undercover : 0.00 0 0
0.02/0.04 c subnlp : 0.00 0 0
0.02/0.04 c trysol : 0.00 0 0
0.02/0.04 c LP : Time Calls Iterations Iter/call Iter/sec
0.02/0.04 c primal LP : 0.00 0 0 0.00 -
0.02/0.04 c dual LP : 0.01 1 210 210.00 -
0.02/0.04 c lex dual LP : 0.00 0 0 0.00 -
0.02/0.04 c barrier LP : 0.00 0 0 0.00 -
0.02/0.04 c diving/probing LP: 0.00 0 0 0.00 -
0.02/0.04 c strong branching : 0.00 0 0 0.00 -
0.02/0.04 c (at root node) : - 0 0 0.00 -
0.02/0.04 c conflict analysis: 0.00 0 0 0.00 -
0.02/0.04 c B&B Tree :
0.02/0.04 c number of runs : 1
0.02/0.04 c nodes : 1
0.02/0.04 c nodes (total) : 1
0.02/0.04 c nodes left : 0
0.02/0.04 c max depth : 0
0.02/0.04 c max depth (total): 0
0.02/0.04 c backtracks : 0 (0.0%)
0.02/0.04 c delayed cutoffs : 0
0.02/0.04 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.02/0.04 c avg switch length: 2.00
0.02/0.04 c switching time : 0.00
0.02/0.04 c Solution :
0.02/0.04 c Solutions found : 6 (6 improvements)
0.02/0.04 c First Solution : +1.00000000000000e+02 (in run 1, after 0 nodes, 0.01 seconds, depth 0, found by <trivial>)
0.02/0.04 c Primal Bound : +2.00000000000000e+00 (in run 1, after 1 nodes, 0.04 seconds, depth 0, found by <rens>)
0.02/0.04 c Dual Bound : +2.00000000000000e+00
0.02/0.04 c Gap : 0.00 %
0.02/0.04 c Root Dual Bound : +2.00000000000000e+00
0.02/0.04 c Root Iterations : 210
0.02/0.04 c Time complete: 0.04.
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-3453261-1307092676/watcher-3453261-1307092676 -o /tmp/evaluation-result-3453261-1307092676/solver-3453261-1307092676 -C 1800 -W 1900 -M 15500 HOME/scip-2.0.1.4.linux.x86_64.gnu.opt.spx -f HOME/instance-3453261-1307092676.opb -t 1800 -m 15500
running on 4 cores: 1,3,5,7
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.93 2.00 1.99 4/463 5827
/proc/meminfo: memFree=30119812/32950928 swapFree=45617076/67111528
[pid=5827] ppid=5823 vsize=11332 CPUtime=0 cores=1,3,5,7
/proc/5827/stat : 5827 (scip-2.0.1.4.li) R 5823 5827 5789 0 -1 4202496 1680 0 0 0 0 0 0 0 20 0 1 0 820867426 11603968 1633 33554432000 4194304 9128323 140735815584384 18446744073709551615 8009021 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/5827/statm: 2833 1647 429 1205 0 1624 0
[startup+0.0333851 s]
/proc/loadavg: 1.93 2.00 1.99 4/463 5827
/proc/meminfo: memFree=30119812/32950928 swapFree=45617076/67111528
[pid=5827] ppid=5823 vsize=28000 CPUtime=0.02 cores=1,3,5,7
/proc/5827/stat : 5827 (scip-2.0.1.4.li) R 5823 5827 5789 0 -1 4202496 5901 0 0 0 2 0 0 0 20 0 1 0 820867426 28672000 5593 33554432000 4194304 9128323 140735815584384 18446744073709551615 7980987 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/5827/statm: 7000 5593 663 1205 0 5791 0
Current children cumulated CPU time (s) 0.02
Current children cumulated vsize (KiB) 28000
Solver just ended. Dumping a history of the last processes samples
[startup+0.0333851 s]
/proc/loadavg: 1.93 2.00 1.99 4/463 5827
/proc/meminfo: memFree=30119812/32950928 swapFree=45617076/67111528
[pid=5827] ppid=5823 vsize=28000 CPUtime=0.02 cores=1,3,5,7
/proc/5827/stat : 5827 (scip-2.0.1.4.li) R 5823 5827 5789 0 -1 4202496 5901 0 0 0 2 0 0 0 20 0 1 0 820867426 28672000 5593 33554432000 4194304 9128323 140735815584384 18446744073709551615 7980987 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/5827/statm: 7000 5593 663 1205 0 5791 0
Current children cumulated CPU time (s) 0.02
Current children cumulated vsize (KiB) 28000
Child status: 0
Real time (s): 0.0476781
CPU time (s): 0.047992
CPU user time (s): 0.041993
CPU system time (s): 0.005999
CPU usage (%): 100.658
Max. virtual memory (cumulated for all children) (KiB): 28000
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 0.041993
system time used= 0.005999
maximum resident set size= 0
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 6062
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.003999 second user time and 0.015997 second system time
The end