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-3453270-1307093144.opb>
0.00/0.01 c original problem has 100 variables (100 bin, 0 int, 0 impl, 0 cont) and 100 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.01 o 100
0.00/0.01 c feasible solution found by trivial heuristic, objective value 1.000000e+02
0.00/0.01 c presolving:
0.00/0.02 c (round 1) 0 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 100 upgd conss, 0 impls, 0 clqs
0.00/0.02 c presolving (2 rounds):
0.00/0.02 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.02 c 0 implications, 0 cliques
0.00/0.02 c presolved problem has 100 variables (100 bin, 0 int, 0 impl, 0 cont) and 100 constraints
0.00/0.02 c 100 constraints of type <logicor>
0.00/0.02 c transformed objective value is always integral (scale: 1)
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 # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c conflict/interconss = 0
0.00/0.02 c
0.00/0.02 c # should binary conflicts be preferred?
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c conflict/preferbinary = TRUE
0.00/0.02 c
0.00/0.02 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c constraints/agelimit = 1
0.00/0.02 c
0.00/0.02 c # should enforcement of pseudo solution be disabled?
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/disableenfops = TRUE
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 = 1800
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 # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02 c lp/solvefreq = 0
0.00/0.02 c
0.00/0.02 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.02 c # [type: char, range: {lafpsqd}, default: l]
0.00/0.02 c lp/pricing = a
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 # priority of node selection rule <dfs> in standard mode
0.00/0.02 c # [type: int, range: [-536870912,536870911], default: 0]
0.00/0.02 c nodeselection/dfs/stdpriority = 1000000
0.00/0.02 c
0.00/0.02 c -----------------------------------------------------------------------------------------------
0.00/0.02 c start solving
0.00/0.02 c
0.03/0.05 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.03/0.05 c t 0.1s| 1 | 0 | 603 | - |1255k| 0 | 61 | 100 | 100 | 100 | 100 | 0 | 0 | 0 | 1.092214e+00 | 1.000000e+02 |9055.71%
0.03/0.05 o 61
0.03/0.05 c r 0.1s| 1 | 0 | 603 | - |1258k| 0 | 61 | 100 | 100 | 100 | 100 | 0 | 0 | 0 | 1.092214e+00 | 6.100000e+01 |5484.99%
0.03/0.05 o 60
0.03/0.05 c R 0.1s| 1 | 0 | 603 | - |1261k| 0 | 61 | 100 | 100 | 100 | 100 | 0 | 0 | 0 | 1.092214e+00 | 6.000000e+01 |5393.43%
0.03/0.05 o 59
0.03/0.05 c s 0.1s| 1 | 0 | 603 | - |1264k| 0 | 61 | 100 | 100 | 100 | 100 | 0 | 0 | 0 | 1.092214e+00 | 5.900000e+01 |5301.87%
0.03/0.06 o 2
0.03/0.06 c z 0.1s| 1 | 0 | 603 | - |1266k| 0 | - | 100 | 100 | 100 | 100 | 0 | 0 | 0 | 1.092214e+00 | 2.000000e+00 | 83.11%
0.03/0.06 c 0.1s| 1 | 0 | 603 | - |1266k| 0 | - | 100 | 100 | 100 | 100 | 0 | 0 | 0 | 2.000000e+00 | 2.000000e+00 | 0.00%
0.03/0.06 c
0.03/0.06 c SCIP Status : problem is solved [optimal solution found]
0.03/0.06 c Solving Time (sec) : 0.06
0.03/0.06 c Solving Nodes : 1
0.03/0.06 c Primal Bound : +2.00000000000000e+00 (5 solutions)
0.03/0.06 c Dual Bound : +2.00000000000000e+00
0.03/0.06 c Gap : 0.00 %
0.03/0.06 s OPTIMUM FOUND
0.03/0.06 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.03/0.06 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.03/0.06 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.03/0.06 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.03/0.06 c SCIP Status : problem is solved [optimal solution found]
0.03/0.06 c Total Time : 0.06
0.03/0.06 c solving : 0.06
0.03/0.06 c presolving : 0.01 (included in solving)
0.03/0.06 c reading : 0.01 (included in solving)
0.03/0.06 c Original Problem :
0.03/0.06 c Problem name : HOME/instance-3453270-1307093144.opb
0.03/0.06 c Variables : 100 (100 binary, 0 integer, 0 implicit integer, 0 continuous)
0.03/0.06 c Constraints : 100 initial, 100 maximal
0.03/0.06 c Presolved Problem :
0.03/0.06 c Problem name : t_HOME/instance-3453270-1307093144.opb
0.03/0.06 c Variables : 100 (100 binary, 0 integer, 0 implicit integer, 0 continuous)
0.03/0.06 c Constraints : 100 initial, 100 maximal
0.03/0.06 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.03/0.06 c trivial : 0.00 0 0 0 0 0 0 0 0 0
0.03/0.06 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
0.03/0.06 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
0.03/0.06 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
0.03/0.06 c implics : 0.00 0 0 0 0 0 0 0 0 0
0.03/0.06 c probing : 0.00 0 0 0 0 0 0 0 0 0
0.03/0.06 c linear : 0.00 0 0 0 0 0 0 0 0 0
0.03/0.06 c logicor : 0.00 0 0 0 0 0 0 0 0 0
0.03/0.06 c root node : - 0 - - 0 - - - - -
0.03/0.06 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
0.03/0.06 c integral : 0 0 0 0 0 10 0 0 0 0 0 0
0.03/0.06 c logicor : 100 1 18 0 0 5 0 0 0 0 0 0
0.03/0.06 c countsols : 0 0 0 0 0 8 0 0 0 0 0 0
0.03/0.06 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
0.03/0.06 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.03/0.06 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.03/0.06 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.03/0.06 c Propagators : #Propagate #Resprop Cutoffs DomReds
0.03/0.06 c vbounds : 0 0 0 0
0.03/0.06 c rootredcost : 0 0 0 0
0.03/0.06 c pseudoobj : 2 0 0 0
0.03/0.06 c Propagator Timings : TotalTime Propagate Resprop
0.03/0.06 c vbounds : 0.00 0.00 0.00
0.03/0.06 c rootredcost : 0.00 0.00 0.00
0.03/0.06 c pseudoobj : 0.00 0.00 0.00
0.03/0.06 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.03/0.06 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.03/0.06 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.03/0.06 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.03/0.06 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.03/0.06 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.03/0.06 c applied globally : - - - 0 0.0 - - -
0.03/0.06 c applied locally : - - - 0 0.0 - - -
0.03/0.06 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.03/0.06 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.03/0.06 c redcost : 0.00 1 0 0 0 0
0.03/0.06 c impliedbounds : 0.00 1 0 0 0 0
0.03/0.06 c intobj : 0.00 0 0 0 0 0
0.03/0.06 c gomory : 0.00 1 0 0 0 0
0.03/0.06 c cgmip : 0.00 0 0 0 0 0
0.03/0.06 c closecuts : 0.00 0 0 0 0 0
0.03/0.06 c strongcg : 0.00 1 0 0 0 0
0.03/0.06 c cmir : 0.00 1 0 0 0 0
0.03/0.06 c flowcover : 0.00 1 0 0 0 0
0.03/0.06 c clique : 0.00 1 0 0 0 0
0.03/0.06 c zerohalf : 0.00 0 0 0 0 0
0.03/0.06 c mcf : 0.00 1 0 0 0 0
0.03/0.06 c oddcycle : 0.00 0 0 0 0 0
0.03/0.06 c rapidlearning : 0.00 0 0 0 0 0
0.03/0.06 c Pricers : Time Calls Vars
0.03/0.06 c problem variables: 0.00 0 0
0.03/0.06 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.03/0.06 c pscost : 0.00 0 0 0 0 0 0
0.03/0.06 c inference : 0.00 0 0 0 0 0 0
0.03/0.06 c mostinf : 0.00 0 0 0 0 0 0
0.03/0.06 c leastinf : 0.00 0 0 0 0 0 0
0.03/0.06 c fullstrong : 0.00 0 0 0 0 0 0
0.03/0.06 c allfullstrong : 0.00 0 0 0 0 0 0
0.03/0.06 c random : 0.00 0 0 0 0 0 0
0.03/0.06 c relpscost : 0.00 0 0 0 0 0 0
0.03/0.06 c Primal Heuristics : Time Calls Found
0.03/0.06 c LP solutions : 0.00 - 0
0.03/0.06 c pseudo solutions : 0.00 - 0
0.03/0.06 c oneopt : 0.00 0 0
0.03/0.06 c feaspump : 0.00 0 0
0.03/0.06 c rens : 0.00 0 0
0.03/0.06 c crossover : 0.00 0 0
0.03/0.06 c trivial : 0.00 2 1
0.03/0.06 c shiftandpropagate: 0.00 0 0
0.03/0.06 c simplerounding : 0.00 1 1
0.03/0.06 c zirounding : 0.00 1 1
0.03/0.06 c rounding : 0.00 1 1
0.03/0.06 c shifting : 0.00 1 1
0.03/0.06 c intshifting : 0.00 0 0
0.03/0.06 c twoopt : 0.00 0 0
0.03/0.06 c fixandinfer : 0.00 0 0
0.03/0.06 c clique : 0.00 0 0
0.03/0.06 c coefdiving : 0.00 0 0
0.03/0.06 c pscostdiving : 0.00 0 0
0.03/0.06 c fracdiving : 0.00 0 0
0.03/0.06 c veclendiving : 0.00 0 0
0.03/0.06 c intdiving : 0.00 0 0
0.03/0.06 c actconsdiving : 0.00 0 0
0.03/0.06 c objpscostdiving : 0.00 0 0
0.03/0.06 c rootsoldiving : 0.00 0 0
0.03/0.06 c linesearchdiving : 0.00 0 0
0.03/0.06 c guideddiving : 0.00 0 0
0.03/0.06 c octane : 0.00 0 0
0.03/0.06 c rins : 0.00 0 0
0.03/0.06 c localbranching : 0.00 0 0
0.03/0.06 c mutation : 0.00 0 0
0.03/0.06 c dins : 0.00 0 0
0.03/0.06 c vbounds : 0.00 0 0
0.03/0.06 c undercover : 0.00 0 0
0.03/0.06 c subnlp : 0.00 0 0
0.03/0.06 c trysol : 0.00 0 0
0.03/0.06 c LP : Time Calls Iterations Iter/call Iter/sec
0.03/0.06 c primal LP : 0.00 0 0 0.00 -
0.03/0.06 c dual LP : 0.03 1 603 603.00 18743.01
0.03/0.06 c lex dual LP : 0.00 0 0 0.00 -
0.03/0.06 c barrier LP : 0.00 0 0 0.00 -
0.03/0.06 c diving/probing LP: 0.00 0 0 0.00 -
0.03/0.06 c strong branching : 0.00 0 0 0.00 -
0.03/0.06 c (at root node) : - 0 0 0.00 -
0.03/0.06 c conflict analysis: 0.00 0 0 0.00 -
0.03/0.06 c B&B Tree :
0.03/0.06 c number of runs : 1
0.03/0.06 c nodes : 1
0.03/0.06 c nodes (total) : 1
0.03/0.06 c nodes left : 0
0.03/0.06 c max depth : 0
0.03/0.06 c max depth (total): 0
0.03/0.06 c backtracks : 0 (0.0%)
0.03/0.06 c delayed cutoffs : 0
0.03/0.06 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.03/0.06 c avg switch length: 2.00
0.03/0.06 c switching time : 0.00
0.03/0.06 c Solution :
0.03/0.06 c Solutions found : 5 (5 improvements)
0.03/0.06 c First Solution : +1.00000000000000e+02 (in run 1, after 0 nodes, 0.01 seconds, depth 0, found by <trivial>)
0.03/0.06 c Primal Bound : +2.00000000000000e+00 (in run 1, after 1 nodes, 0.06 seconds, depth 0, found by <zirounding>)
0.03/0.06 c Dual Bound : +2.00000000000000e+00
0.03/0.06 c Gap : 0.00 %
0.03/0.06 c Root Dual Bound : +2.00000000000000e+00
0.03/0.06 c Root Iterations : 603
0.03/0.07 c Time complete: 0.06.
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-3453270-1307093144/watcher-3453270-1307093144 -o /tmp/evaluation-result-3453270-1307093144/solver-3453270-1307093144 -C 1800 -W 1900 -M 15500 HOME/scip-2.0.1.4.linux.x86_64.gnu.opt.spx -f HOME/instance-3453270-1307093144.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: 0.92 1.01 1.24 3/524 5839
/proc/meminfo: memFree=25040680/32951124 swapFree=56241860/67111528
[pid=5839] ppid=5837 vsize=10116 CPUtime=0 cores=0,2,4,6
/proc/5839/stat : 5839 (scip-2.0.1.4.li) R 5837 5839 5807 0 -1 4202496 1543 0 0 0 0 0 0 0 25 0 1 0 899545087 10358784 1496 33554432000 4194304 9128323 140733520291232 18446744073709551615 8057568 0 0 4096 0 0 0 0 17 0 0 0 0
/proc/5839/statm: 2529 1496 400 1205 0 1320 0
[startup+0.0434931 s]
/proc/loadavg: 0.92 1.01 1.24 3/524 5839
/proc/meminfo: memFree=25040680/32951124 swapFree=56241860/67111528
[pid=5839] ppid=5837 vsize=20760 CPUtime=0.03 cores=0,2,4,6
/proc/5839/stat : 5839 (scip-2.0.1.4.li) R 5837 5839 5807 0 -1 4202496 4315 0 0 0 3 0 0 0 25 0 1 0 899545087 21258240 4007 33554432000 4194304 9128323 140733520291232 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 0 0 0 0
/proc/5839/statm: 5190 4007 619 1205 0 3981 0
Current children cumulated CPU time (s) 0.03
Current children cumulated vsize (KiB) 20760
Solver just ended. Dumping a history of the last processes samples
[startup+0.0434931 s]
/proc/loadavg: 0.92 1.01 1.24 3/524 5839
/proc/meminfo: memFree=25040680/32951124 swapFree=56241860/67111528
[pid=5839] ppid=5837 vsize=20760 CPUtime=0.03 cores=0,2,4,6
/proc/5839/stat : 5839 (scip-2.0.1.4.li) R 5837 5839 5807 0 -1 4202496 4315 0 0 0 3 0 0 0 25 0 1 0 899545087 21258240 4007 33554432000 4194304 9128323 140733520291232 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 0 0 0 0
/proc/5839/statm: 5190 4007 619 1205 0 3981 0
Current children cumulated CPU time (s) 0.03
Current children cumulated vsize (KiB) 20760
Child status: 0
Real time (s): 0.0713429
CPU time (s): 0.070988
CPU user time (s): 0.066989
CPU system time (s): 0.003999
CPU usage (%): 99.5025
Max. virtual memory (cumulated for all children) (KiB): 20760
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 0.066989
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= 4506
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.007998 second user time and 0.013997 second system time
The end