0.00/0.00 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.00 c Copyright (c) 2002-2012 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-3692607-1338036614.opb>
0.00/0.01 c original problem has 3162 variables (100 bin, 0 int, 3062 impl, 0 cont) and 3262 constraints
0.00/0.01 c problem read in 0.01
0.00/0.02 o 100
0.00/0.03 c feasible solution found by trivial heuristic, objective value 1.000000e+02
0.00/0.03 c presolving:
0.00/0.08 c (round 1) 0 del vars, 3262 del conss, 100 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 6124 impls, 0 clqs
0.00/0.09 c (round 2) 3062 del vars, 3262 del conss, 100 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 100 upgd conss, 6124 impls, 0 clqs
0.00/0.09 c (0.1s) probing: 51/100 (51.0%) - 0 fixings, 0 aggregations, 0 implications, 0 bound changes
0.00/0.09 c (0.1s) probing aborted: 50/50 successive totally useless probings
0.00/0.09 c presolving (3 rounds):
0.00/0.09 c 3062 deleted vars, 3262 deleted constraints, 100 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.09 c 6124 implications, 0 cliques
0.00/0.09 c presolved problem has 100 variables (100 bin, 0 int, 0 impl, 0 cont) and 100 constraints
0.00/0.09 c 100 constraints of type <logicor>
0.00/0.09 c transformed objective value is always integral (scale: 1)
0.00/0.09 c Presolving Time: 0.07
0.00/0.09 c - non default parameters ----------------------------------------------------------------------
0.00/0.09 c # SCIP version 2.1.1.4
0.00/0.09 c
0.00/0.09 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.09 c conflict/interconss = 0
0.00/0.09 c
0.00/0.09 c # should binary conflicts be preferred?
0.00/0.09 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.09 c conflict/preferbinary = TRUE
0.00/0.09 c
0.00/0.09 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.09 c constraints/agelimit = 1
0.00/0.09 c
0.00/0.09 c # should enforcement of pseudo solution be disabled?
0.00/0.09 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.09 c constraints/disableenfops = TRUE
0.00/0.09 c
0.00/0.09 c # maximal time in seconds to run
0.00/0.09 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.09 c limits/time = 1797
0.00/0.09 c
0.00/0.09 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.09 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.09 c limits/memory = 13950
0.00/0.09 c
0.00/0.09 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.09 c # [type: int, range: [1,2], default: 1]
0.00/0.09 c timing/clocktype = 2
0.00/0.09 c
0.00/0.09 c # belongs reading time to solving time?
0.00/0.09 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.09 c timing/reading = TRUE
0.00/0.09 c
0.00/0.09 c -----------------------------------------------------------------------------------------------
0.00/0.09 c start solving
0.00/0.09 c
0.09/0.10 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.09/0.10 c t 0.1s| 1 | 0 | 320 | - |7433k| 0 | 54 | 100 | 100 | 100 | 100 | 0 | 0 | 0 | 3.178590e+00 | 1.000000e+02 |3046.05%
0.09/0.10 o 54
0.09/0.10 c r 0.1s| 1 | 0 | 320 | - |7436k| 0 | 54 | 100 | 100 | 100 | 100 | 0 | 0 | 0 | 3.178590e+00 | 5.400000e+01 |1598.87%
0.09/0.10 o 53
0.09/0.10 c R 0.1s| 1 | 0 | 320 | - |7439k| 0 | 54 | 100 | 100 | 100 | 100 | 0 | 0 | 0 | 3.178590e+00 | 5.300000e+01 |1567.41%
0.09/0.10 o 52
0.09/0.10 c s 0.1s| 1 | 0 | 320 | - |7442k| 0 | 54 | 100 | 100 | 100 | 100 | 0 | 0 | 0 | 3.178590e+00 | 5.200000e+01 |1535.95%
0.09/0.12 c 0.1s| 1 | 0 | 393 | - |7658k| 0 | 51 | 100 | 100 | 100 | 101 | 1 | 0 | 0 | 3.217410e+00 | 5.200000e+01 |1516.21%
0.09/0.12 o 8
0.09/0.12 c b 0.1s| 1 | 0 | 393 | - |7661k| 0 | 51 | 100 | 100 | 100 | 101 | 1 | 0 | 0 | 3.217410e+00 | 8.000000e+00 | 148.65%
0.09/0.12 o 8
0.09/0.12 c s 0.1s| 1 | 0 | 393 | - |7662k| 0 | 51 | 100 | 100 | 100 | 101 | 1 | 0 | 0 | 3.217410e+00 | 8.000000e+00 | 148.65%
0.09/0.13 c 0.1s| 1 | 0 | 435 | - |7756k| 0 | 46 | 100 | 100 | 100 | 102 | 2 | 0 | 0 | 3.235755e+00 | 8.000000e+00 | 147.24%
0.09/0.13 o 7
0.09/0.13 c R 0.1s| 1 | 0 | 435 | - |7759k| 0 | 46 | 100 | 100 | 100 | 102 | 2 | 0 | 0 | 3.235755e+00 | 7.000000e+00 | 116.33%
0.09/0.13 o 6
0.09/0.13 c b 0.1s| 1 | 0 | 435 | - |7762k| 0 | 46 | 100 | 100 | 100 | 102 | 2 | 0 | 0 | 3.235755e+00 | 6.000000e+00 | 85.43%
0.09/0.14 c 0.1s| 1 | 0 | 482 | - |7768k| 0 | 47 | 100 | 100 | 100 | 103 | 3 | 0 | 0 | 3.247353e+00 | 6.000000e+00 | 84.77%
0.09/0.15 c 0.2s| 1 | 0 | 512 | - |7777k| 0 | 43 | 100 | 100 | 100 | 104 | 4 | 0 | 0 | 3.251064e+00 | 6.000000e+00 | 84.55%
0.19/0.24 o 5
0.19/0.24 c E 0.2s| 1 | 0 | 512 | - |7781k| 0 | 43 | 100 | 100 | 100 | 104 | 4 | 0 | 0 | 3.251064e+00 | 5.000000e+00 | 53.80%
0.19/0.24 c 0.2s| 1 | 0 | 512 | - |7781k| 0 | 43 | 100 | 100 | 100 | 104 | 4 | 0 | 0 | 3.251064e+00 | 5.000000e+00 | 53.80%
0.39/0.46 c 0.5s| 1 | 0 | 548 | - |7781k| 0 | 44 | 100 | 100 | 100 | 104 | 4 | 0 | 20 | 3.254204e+00 | 5.000000e+00 | 53.65%
0.59/0.63 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.59/0.63 c 0.6s| 1 | 0 | 565 | - |7783k| 0 | 45 | 100 | 100 | 100 | 104 | 4 | 0 | 37 | 3.256458e+00 | 5.000000e+00 | 53.54%
0.59/0.64 c 0.6s| 1 | 0 | 618 | - |7789k| 0 | 44 | 100 | 100 | 100 | 105 | 5 | 0 | 37 | 3.268036e+00 | 5.000000e+00 | 53.00%
0.69/0.78 c 0.8s| 1 | 0 | 648 | - |7791k| 0 | 43 | 100 | 100 | 100 | 105 | 5 | 0 | 51 | 3.272191e+00 | 5.000000e+00 | 52.80%
0.69/0.79 c 0.8s| 1 | 0 | 712 | - |7798k| 0 | 46 | 100 | 100 | 100 | 106 | 6 | 0 | 51 | 3.301820e+00 | 5.000000e+00 | 51.43%
0.79/0.82 c 0.8s| 1 | 0 | 732 | - |7799k| 0 | 44 | 100 | 100 | 100 | 106 | 6 | 0 | 56 | 3.306619e+00 | 5.000000e+00 | 51.21%
0.79/0.84 c 0.8s| 1 | 0 | 756 | - |7850k| 0 | 42 | 100 | 100 | 100 | 107 | 7 | 0 | 56 | 3.320444e+00 | 5.000000e+00 | 50.58%
0.79/0.86 c 0.9s| 1 | 0 | 777 | - |7851k| 0 | 40 | 100 | 100 | 100 | 107 | 7 | 0 | 61 | 3.325797e+00 | 5.000000e+00 | 50.34%
0.79/0.87 c 0.9s| 1 | 0 | 807 | - |7858k| 0 | 40 | 100 | 100 | 100 | 108 | 8 | 0 | 61 | 3.336844e+00 | 5.000000e+00 | 49.84%
0.79/0.88 c 0.9s| 1 | 0 | 807 | - |7859k| 0 | - | 100 | 100 | 100 | 108 | 8 | 0 | 63 | 3.336844e+00 | 5.000000e+00 | 49.84%
0.79/0.88 c (run 1, node 1) restarting after 21 global fixings of integer variables
0.79/0.88 c
0.79/0.88 c (restart) converted 8 cuts from the global cut pool into linear constraints
0.79/0.88 c
0.79/0.89 c presolving:
0.79/0.89 c (round 1) 21 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 8 upgd conss, 6124 impls, 0 clqs
0.79/0.89 c presolving (2 rounds):
0.79/0.89 c 21 deleted vars, 0 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.79/0.89 c 6124 implications, 0 cliques
0.79/0.89 c presolved problem has 79 variables (79 bin, 0 int, 0 impl, 0 cont) and 108 constraints
0.79/0.89 c 8 constraints of type <knapsack>
0.79/0.89 c 100 constraints of type <logicor>
0.79/0.89 c transformed objective value is always integral (scale: 1)
0.79/0.89 c Presolving Time: 0.07
0.79/0.89 c
0.89/0.90 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.89/0.90 c 0.9s| 1 | 0 | 1004 | - |8126k| 0 | 40 | 79 | 108 | 79 | 108 | 0 | 0 | 63 | 3.336906e+00 | 5.000000e+00 | 49.84%
0.89/0.91 c 0.9s| 1 | 0 | 1057 | - |8135k| 0 | 36 | 79 | 108 | 79 | 109 | 1 | 0 | 63 | 3.388241e+00 | 5.000000e+00 | 47.57%
0.89/0.97 c 1.0s| 1 | 0 | 1166 | - |8136k| 0 | 36 | 79 | 108 | 79 | 109 | 1 | 0 | 73 | 3.477984e+00 | 5.000000e+00 | 43.76%
0.89/0.99 c 1.0s| 1 | 0 | 1219 | - |8138k| 0 | 35 | 79 | 108 | 79 | 109 | 1 | 0 | 78 | 3.580105e+00 | 5.000000e+00 | 39.66%
0.99/1.00 c 1.0s| 1 | 0 | 1272 | - |8139k| 0 | 43 | 79 | 108 | 79 | 109 | 1 | 0 | 83 | 3.614646e+00 | 5.000000e+00 | 38.33%
0.99/1.00 c 1.0s| 1 | 0 | 1272 | - |8141k| 0 | 43 | 79 | 108 | 79 | 109 | 1 | 0 | 83 | 3.614646e+00 | 5.000000e+00 | 38.33%
0.99/1.02 c 1.0s| 1 | 0 | 1272 | - |8141k| 0 | - | 79 | 108 | 79 | 109 | 1 | 0 | 88 | 3.614646e+00 | 5.000000e+00 | 38.33%
0.99/1.02 c (run 2, node 1) restarting after 21 global fixings of integer variables
0.99/1.02 c
0.99/1.02 c (restart) converted 1 cuts from the global cut pool into linear constraints
0.99/1.02 c
0.99/1.02 c presolving:
0.99/1.02 c (round 1) 21 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 1 upgd conss, 6124 impls, 0 clqs
0.99/1.02 c presolving (2 rounds):
0.99/1.02 c 21 deleted vars, 0 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.99/1.02 c 6124 implications, 0 cliques
0.99/1.02 c presolved problem has 58 variables (58 bin, 0 int, 0 impl, 0 cont) and 109 constraints
0.99/1.02 c 9 constraints of type <knapsack>
0.99/1.02 c 100 constraints of type <logicor>
0.99/1.02 c transformed objective value is always integral (scale: 1)
0.99/1.02 c Presolving Time: 0.07
0.99/1.02 c
0.99/1.03 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.99/1.03 c 1.0s| 1 | 0 | 1440 | - |8221k| 0 | 37 | 58 | 109 | 58 | 109 | 0 | 0 | 88 | 3.678178e+00 | 5.000000e+00 | 35.94%
0.99/1.03 c 1.0s| 1 | 0 | 1440 | - |8223k| 0 | 37 | 58 | 109 | 58 | 109 | 0 | 0 | 88 | 3.678178e+00 | 5.000000e+00 | 35.94%
0.99/1.04 c 1.0s| 1 | 0 | 1472 | - |8386k| 0 | 36 | 58 | 109 | 58 | 110 | 1 | 0 | 88 | 3.703558e+00 | 5.000000e+00 | 35.01%
0.99/1.04 c 1.0s| 1 | 0 | 1472 | - |8387k| 0 | 36 | 58 | 109 | 58 | 110 | 1 | 0 | 88 | 3.703558e+00 | 5.000000e+00 | 35.01%
0.99/1.05 c 1.1s| 1 | 0 | 1540 | - |8387k| 0 | 34 | 58 | 109 | 58 | 110 | 1 | 0 | 93 | 3.858654e+00 | 5.000000e+00 | 29.58%
0.99/1.05 c 1.1s| 1 | 0 | 1540 | - |8389k| 0 | 34 | 58 | 109 | 58 | 110 | 1 | 0 | 93 | 3.858654e+00 | 5.000000e+00 | 29.58%
0.99/1.06 c 1.1s| 1 | 0 | 1540 | - |8389k| 0 | - | 58 | 109 | 58 | 110 | 1 | 0 | 98 | 3.858654e+00 | 5.000000e+00 | 29.58%
0.99/1.06 c (run 3, node 1) restarting after 23 global fixings of integer variables
0.99/1.06 c
0.99/1.06 c (restart) converted 1 cuts from the global cut pool into linear constraints
0.99/1.06 c
0.99/1.06 c presolving:
0.99/1.06 c (round 1) 23 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 1 upgd conss, 6124 impls, 0 clqs
0.99/1.06 c presolving (2 rounds):
0.99/1.06 c 23 deleted vars, 0 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.99/1.06 c 6124 implications, 0 cliques
0.99/1.06 c presolved problem has 35 variables (35 bin, 0 int, 0 impl, 0 cont) and 110 constraints
0.99/1.06 c 10 constraints of type <knapsack>
0.99/1.06 c 100 constraints of type <logicor>
0.99/1.06 c transformed objective value is always integral (scale: 1)
0.99/1.06 c Presolving Time: 0.08
0.99/1.06 c
0.99/1.07 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.99/1.07 c 1.1s| 1 | 0 | 1705 | - |8256k| 0 | - | 35 | 110 | 35 | 110 | 0 | 0 | 98 | 5.000000e+00 | 5.000000e+00 | 0.00%
0.99/1.07 c
0.99/1.07 c SCIP Status : problem is solved [optimal solution found]
0.99/1.07 c Solving Time (sec) : 1.07
0.99/1.07 c Solving Nodes : 1 (total of 4 nodes in 4 runs)
0.99/1.07 c Primal Bound : +5.00000000000000e+00 (32 solutions)
0.99/1.07 c Dual Bound : +5.00000000000000e+00
0.99/1.07 c Gap : 0.00 %
0.99/1.07 s OPTIMUM FOUND
0.99/1.07 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.99/1.07 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.99/1.07 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.99/1.07 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.99/1.07 c SCIP Status : problem is solved [optimal solution found]
0.99/1.07 c Total Time : 1.07
0.99/1.07 c solving : 1.07
0.99/1.07 c presolving : 0.08 (included in solving)
0.99/1.07 c reading : 0.01 (included in solving)
0.99/1.07 c copying : 0.01 (1 #copies) (minimal 0.01, maximal 0.01, average 0.01)
0.99/1.07 c Original Problem :
0.99/1.07 c Problem name : HOME/instance-3692607-1338036614.opb
0.99/1.07 c Variables : 3162 (100 binary, 0 integer, 3062 implicit integer, 0 continuous)
0.99/1.07 c Constraints : 3262 initial, 3262 maximal
0.99/1.07 c Objective sense : minimize
0.99/1.07 c Presolved Problem :
0.99/1.07 c Problem name : t_HOME/instance-3692607-1338036614.opb
0.99/1.07 c Variables : 35 (35 binary, 0 integer, 0 implicit integer, 0 continuous)
0.99/1.07 c Constraints : 110 initial, 110 maximal
0.99/1.07 c Presolvers : ExecTime SetupTime FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.99/1.07 c domcol : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.99/1.07 c trivial : 0.00 0.00 65 0 0 0 0 0 0 0 0
0.99/1.07 c dualfix : 0.00 0.00 3062 0 0 0 0 0 0 0 0
0.99/1.07 c boundshift : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.99/1.07 c inttobinary : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.99/1.07 c convertinttobin : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.99/1.07 c gateextraction : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.99/1.07 c implics : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.99/1.07 c components : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.99/1.07 c pseudoobj : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.99/1.07 c probing : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.99/1.07 c knapsack : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.99/1.07 c linear : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.99/1.07 c logicor : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.99/1.07 c pseudoboolean : 0.00 0.00 0 0 0 0 0 3262 100 0 0
0.99/1.07 c root node : - - 65 - - 65 - - - - -
0.99/1.07 c Constraints : Number MaxNumber #Separate #Propagate #EnfoLP #EnfoPS #Check #ResProp Cutoffs DomReds Cuts Conss Children
0.99/1.07 c integral : 0 0 0 0 12 0 39 0 0 51 0 0 0
0.99/1.07 c knapsack : 10 10 2 7 0 0 0 0 0 0 0 0 0
0.99/1.07 c logicor : 100 100 12 11 0 0 32 0 0 0 0 0 0
0.99/1.07 c countsols : 0 0 0 0 0 0 35 0 0 0 0 0 0
0.99/1.07 c Constraint Timings : TotalTime SetupTime Separate Propagate EnfoLP EnfoPS Check ResProp
0.99/1.07 c integral : 0.68 0.00 0.00 0.00 0.68 0.00 0.00 0.00
0.99/1.07 c knapsack : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.99/1.07 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.99/1.07 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.99/1.07 c Propagators : #Propagate #ResProp Cutoffs DomReds
0.99/1.07 c rootredcost : 0 0 0 0
0.99/1.07 c pseudoobj : 27 0 0 0
0.99/1.07 c vbounds : 0 0 0 0
0.99/1.07 c redcost : 27 0 0 14
0.99/1.07 c probing : 0 0 0 0
0.99/1.07 c Propagator Timings : TotalTime SetupTime Presolve Propagate ResProp
0.99/1.07 c rootredcost : 0.00 0.00 0.00 0.00 0.00
0.99/1.07 c pseudoobj : 0.00 0.00 0.00 0.00 0.00
0.99/1.07 c vbounds : 0.00 0.00 0.00 0.00 0.00
0.99/1.07 c redcost : 0.00 0.00 0.00 0.00 0.00
0.99/1.07 c probing : 0.00 0.00 0.00 0.00 0.00
0.99/1.07 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.99/1.07 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.99/1.07 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.99/1.07 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.99/1.07 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.99/1.07 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.99/1.07 c applied globally : - - - 0 0.0 - - -
0.99/1.07 c applied locally : - - - 0 0.0 - - -
0.99/1.07 c Separators : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss
0.99/1.07 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.99/1.07 c closecuts : 0.00 0.00 0 0 0 0 0
0.99/1.07 c impliedbounds : 0.00 0.00 13 0 0 0 0
0.99/1.07 c intobj : 0.00 0.00 0 0 0 0 0
0.99/1.07 c gomory : 0.04 0.00 12 0 0 1 0
0.99/1.07 c cgmip : 0.00 0.00 0 0 0 0 0
0.99/1.07 c strongcg : 0.03 0.00 13 0 0 206 0
0.99/1.07 c cmir : 0.02 0.00 12 0 0 2 0
0.99/1.07 c flowcover : 0.03 0.00 12 0 0 0 0
0.99/1.07 c clique : 0.00 0.00 3 0 0 0 0
0.99/1.07 c zerohalf : 0.00 0.00 0 0 0 0 0
0.99/1.07 c mcf : 0.00 0.00 3 0 0 0 0
0.99/1.07 c oddcycle : 0.00 0.00 0 0 0 0 0
0.99/1.07 c rapidlearning : 0.00 0.00 0 0 0 0 0
0.99/1.07 c Pricers : ExecTime SetupTime Calls Vars
0.99/1.07 c problem variables: 0.00 - 0 0
0.99/1.07 c Branching Rules : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss Children
0.99/1.07 c relpscost : 0.68 0.00 12 0 51 0 0 0
0.99/1.07 c pscost : 0.00 0.00 0 0 0 0 0 0
0.99/1.07 c inference : 0.00 0.00 0 0 0 0 0 0
0.99/1.07 c mostinf : 0.00 0.00 0 0 0 0 0 0
0.99/1.07 c leastinf : 0.00 0.00 0 0 0 0 0 0
0.99/1.07 c fullstrong : 0.00 0.00 0 0 0 0 0 0
0.99/1.07 c allfullstrong : 0.00 0.00 0 0 0 0 0 0
0.99/1.07 c random : 0.00 0.00 0 0 0 0 0 0
0.99/1.07 c Primal Heuristics : ExecTime SetupTime Calls Found
0.99/1.07 c LP solutions : 0.00 - - 0
0.99/1.07 c pseudo solutions : 0.00 - - 0
0.99/1.07 c oneopt : 0.00 0.00 4 2
0.99/1.07 c smallcard : 0.00 0.00 0 0
0.99/1.07 c trivial : 0.00 0.00 2 2
0.99/1.07 c shiftandpropagate: 0.00 0.00 0 0
0.99/1.07 c simplerounding : 0.00 0.00 22 22
0.99/1.07 c zirounding : 0.00 0.00 1 1
0.99/1.07 c rounding : 0.00 0.00 22 2
0.99/1.07 c shifting : 0.00 0.00 22 2
0.99/1.07 c intshifting : 0.00 0.00 0 0
0.99/1.07 c twoopt : 0.00 0.00 0 0
0.99/1.07 c indtwoopt : 0.00 0.00 0 0
0.99/1.07 c indoneopt : 0.00 0.00 0 0
0.99/1.07 c fixandinfer : 0.00 0.00 0 0
0.99/1.07 c feaspump : 0.00 0.00 0 0
0.99/1.07 c clique : 0.00 0.00 0 0
0.99/1.07 c coefdiving : 0.00 0.00 0 0
0.99/1.07 c indrounding : 0.00 0.00 0 0
0.99/1.07 c indcoefdiving : 0.00 0.00 0 0
0.99/1.07 c pscostdiving : 0.00 0.00 0 0
0.99/1.07 c fracdiving : 0.00 0.00 0 0
0.99/1.07 c nlpdiving : 0.00 0.00 0 0
0.99/1.07 c veclendiving : 0.00 0.00 0 0
0.99/1.07 c intdiving : 0.00 0.00 0 0
0.99/1.07 c actconsdiving : 0.00 0.00 0 0
0.99/1.07 c objpscostdiving : 0.00 0.00 0 0
0.99/1.07 c rootsoldiving : 0.00 0.00 0 0
0.99/1.07 c linesearchdiving : 0.00 0.00 0 0
0.99/1.07 c guideddiving : 0.00 0.00 0 0
0.99/1.07 c octane : 0.00 0.00 0 0
0.99/1.07 c rens : 0.08 0.00 1 1
0.99/1.07 c rins : 0.00 0.00 0 0
0.99/1.07 c localbranching : 0.00 0.00 0 0
0.99/1.07 c mutation : 0.00 0.00 0 0
0.99/1.07 c crossover : 0.00 0.00 0 0
0.99/1.07 c dins : 0.00 0.00 0 0
0.99/1.07 c vbounds : 0.00 0.00 0 0
0.99/1.07 c undercover : 0.00 0.00 0 0
0.99/1.07 c subnlp : 0.00 0.00 0 0
0.99/1.07 c trysol : 0.00 0.00 0 0
0.99/1.07 c LP : Time Calls Iterations Iter/call Iter/sec Time-0-It Calls-0-It
0.99/1.07 c primal LP : 0.00 0 0 0.00 - 0.00 0
0.99/1.07 c dual LP : 0.07 27 1705 74.13 25285.86 0.00 4
0.99/1.07 c lex dual LP : 0.00 0 0 0.00 -
0.99/1.07 c barrier LP : 0.00 0 0 0.00 - 0.00 0
0.99/1.07 c diving/probing LP: 0.00 0 0 0.00 -
0.99/1.07 c strong branching : 0.68 98 16836 171.80 24833.32
0.99/1.07 c (at root node) : - 98 16836 171.80 -
0.99/1.07 c conflict analysis: 0.00 0 0 0.00 -
0.99/1.07 c B&B Tree :
0.99/1.07 c number of runs : 4
0.99/1.07 c nodes : 1
0.99/1.07 c nodes (total) : 4
0.99/1.07 c nodes left : 0
0.99/1.07 c max depth : 0
0.99/1.07 c max depth (total): 0
0.99/1.07 c backtracks : 0 (0.0%)
0.99/1.07 c delayed cutoffs : 0
0.99/1.07 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.99/1.07 c avg switch length: 2.00
0.99/1.07 c switching time : 0.00
0.99/1.07 c Solution :
0.99/1.07 c Solutions found : 32 (9 improvements)
0.99/1.07 c First Solution : +1.00000000000000e+02 (in run 1, after 0 nodes, 0.02 seconds, depth 0, found by <trivial>)
0.99/1.07 c Primal Bound : +5.00000000000000e+00 (in run 1, after 1 nodes, 0.24 seconds, depth 0, found by <rens>)
0.99/1.07 c Dual Bound : +5.00000000000000e+00
0.99/1.07 c Gap : 0.00 %
0.99/1.07 c Root Dual Bound : +5.00000000000000e+00
0.99/1.07 c Root Iterations : 1705
0.99/1.08 c Time complete: 1.07.
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-3692607-1338036614/watcher-3692607-1338036614 -o /tmp/evaluation-result-3692607-1338036614/solver-3692607-1338036614 -C 1800 -W 1900 -M 15500 HOME/scip-2.1.1.4expfix.linux.x86_64.gnu.opt.spx -f HOME/instance-3692607-1338036614.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 2.00 3/173 3379
/proc/meminfo: memFree=28405764/32873648 swapFree=6864/6864
[pid=3379] ppid=3376 vsize=13100 CPUtime=0 cores=0,2,4,6
/proc/3379/stat : 3379 (scip-2.1.1.4exp) R 3376 3379 1798 0 -1 4202496 2030 0 0 0 0 0 0 0 20 0 1 0 269787348 13414400 1984 33554432000 4194304 10219143 140736968366016 140736617339224 8844210 0 0 4096 0 0 0 0 17 0 0 0 0 0 0
/proc/3379/statm: 3275 1984 435 1471 0 1795 0
[startup+0.104884 s]
/proc/loadavg: 2.00 2.00 2.00 3/173 3379
/proc/meminfo: memFree=28405764/32873648 swapFree=6864/6864
[pid=3379] ppid=3376 vsize=29276 CPUtime=0.09 cores=0,2,4,6
/proc/3379/stat : 3379 (scip-2.1.1.4exp) R 3376 3379 1798 0 -1 4202496 6271 0 0 0 6 3 0 0 20 0 1 0 269787348 29978624 5966 33554432000 4194304 10219143 140736968366016 140736617339224 9026266 0 0 4096 16384 0 0 0 17 0 0 0 0 0 0
/proc/3379/statm: 7319 5967 750 1471 0 5839 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 29276
[startup+0.200208 s]
/proc/loadavg: 2.00 2.00 2.00 3/173 3379
/proc/meminfo: memFree=28405764/32873648 swapFree=6864/6864
[pid=3379] ppid=3376 vsize=41788 CPUtime=0.19 cores=0,2,4,6
/proc/3379/stat : 3379 (scip-2.1.1.4exp) R 3376 3379 1798 0 -1 4202496 9177 0 0 0 15 4 0 0 20 0 1 0 269787348 42790912 8872 33554432000 4194304 10219143 140736968366016 140736617339224 9026266 0 0 4096 16384 0 0 0 17 0 0 0 0 0 0
/proc/3379/statm: 10447 8872 823 1471 0 8967 0
Current children cumulated CPU time (s) 0.19
Current children cumulated vsize (KiB) 41788
[startup+0.300194 s]
/proc/loadavg: 2.00 2.00 2.00 3/173 3379
/proc/meminfo: memFree=28405764/32873648 swapFree=6864/6864
[pid=3379] ppid=3376 vsize=30340 CPUtime=0.29 cores=0,2,4,6
/proc/3379/stat : 3379 (scip-2.1.1.4exp) R 3376 3379 1798 0 -1 4202496 9236 0 0 0 25 4 0 0 20 0 1 0 269787348 31068160 6428 33554432000 4194304 10219143 140736968366016 140736968360472 9026266 0 0 4096 16384 0 0 0 17 0 0 0 0 0 0
/proc/3379/statm: 7585 6428 846 1471 0 6105 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 30340
[startup+0.700114 s]
/proc/loadavg: 2.00 2.00 2.00 3/173 3379
/proc/meminfo: memFree=28405764/32873648 swapFree=6864/6864
[pid=3379] ppid=3376 vsize=30340 CPUtime=0.69 cores=0,2,4,6
/proc/3379/stat : 3379 (scip-2.1.1.4exp) R 3376 3379 1798 0 -1 4202496 9236 0 0 0 64 5 0 0 20 0 1 0 269787348 31068160 6428 33554432000 4194304 10219143 140736968366016 140736968360472 9026266 0 0 4096 16384 0 0 0 17 0 0 0 0 0 0
/proc/3379/statm: 7585 6428 846 1471 0 6105 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 30340
Solver just ended. Dumping a history of the last processes samples
[startup+0.800137 s]
/proc/loadavg: 2.00 2.00 2.00 3/173 3379
/proc/meminfo: memFree=28405764/32873648 swapFree=6864/6864
[pid=3379] ppid=3376 vsize=30340 CPUtime=0.79 cores=0,2,4,6
/proc/3379/stat : 3379 (scip-2.1.1.4exp) R 3376 3379 1798 0 -1 4202496 9237 0 0 0 74 5 0 0 20 0 1 0 269787348 31068160 6429 33554432000 4194304 10219143 140736968366016 140736968360472 9026266 0 0 4096 16384 0 0 0 17 0 0 0 0 0 0
/proc/3379/statm: 7585 6429 846 1471 0 6105 0
Current children cumulated CPU time (s) 0.79
Current children cumulated vsize (KiB) 30340
[startup+1.00021 s]
/proc/loadavg: 2.00 2.00 2.00 3/173 3379
/proc/meminfo: memFree=28405764/32873648 swapFree=6864/6864
[pid=3379] ppid=3376 vsize=31244 CPUtime=0.99 cores=0,2,4,6
/proc/3379/stat : 3379 (scip-2.1.1.4exp) R 3376 3379 1798 0 -1 4202496 9565 0 0 0 94 5 0 0 20 0 1 0 269787348 31993856 6637 33554432000 4194304 10219143 140736968366016 140736968359464 8098763 0 0 4096 16384 0 0 0 17 0 0 0 0 0 0
/proc/3379/statm: 7811 6637 852 1471 0 6331 0
Current children cumulated CPU time (s) 0.99
Current children cumulated vsize (KiB) 31244
Child status: 0
Real time (s): 1.08111
CPU time (s): 1.08083
CPU user time (s): 1.01684
CPU system time (s): 0.06399
CPU usage (%): 99.9745
Max. virtual memory (cumulated for all children) (KiB): 41788
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 1.01684
system time used= 0.06399
maximum resident set size= 35704
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 9960
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= 3
runsolver used 0.002999 second user time and 0.010998 second system time
The end