0.00/0.00 c SCIP version 2.0.1.5 [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-3451123-1307067322.opb>
0.00/0.00 c original problem has 266 variables (266 bin, 0 int, 0 impl, 0 cont) and 401 constraints
0.00/0.00 c problem read
0.00/0.00 c No objective function, only one solution is needed.
0.00/0.00 c presolving settings loaded
0.00/0.01 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, 401 upgd conss, 298 impls, 0 clqs
0.00/0.02 c (round 2) 8 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 401 upgd conss, 7146 impls, 0 clqs
0.00/0.02 c (round 3) 8 del vars, 8 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 401 upgd conss, 7146 impls, 0 clqs
0.00/0.02 c (round 4) 8 del vars, 12 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 401 upgd conss, 7146 impls, 0 clqs
0.00/0.02 c presolving (5 rounds):
0.00/0.02 c 8 deleted vars, 12 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.02 c 7146 implications, 0 cliques
0.00/0.02 c presolved problem has 258 variables (258 bin, 0 int, 0 impl, 0 cont) and 389 constraints
0.00/0.02 c 164 constraints of type <knapsack>
0.00/0.02 c 129 constraints of type <setppc>
0.00/0.02 c 96 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.5
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 # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c limits/solutions = 1
0.00/0.02 c
0.00/0.02 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.02 c separating/maxrounds = 1
0.00/0.02 c
0.00/0.02 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c separating/maxroundsroot = 5
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 disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.02 c constraints/knapsack/disaggregation = FALSE
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 # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c presolving/probing/maxrounds = 0
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/coefdiving/freq = -1
0.00/0.02 c
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/coefdiving/maxlpiterquot = 0.075
0.00/0.02 c
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/coefdiving/maxlpiterofs = 1500
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.02 c heuristics/crossover/freq = -1
0.00/0.02 c
0.00/0.02 c # number of nodes added to the contingent of the total nodes
0.00/0.02 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.02 c heuristics/crossover/nodesofs = 750
0.00/0.02 c
0.00/0.02 c # number of nodes without incumbent change that heuristic should wait
0.00/0.02 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.02 c heuristics/crossover/nwaitingnodes = 100
0.00/0.02 c
0.00/0.02 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.02 c # [type: real, range: [0,1], default: 0.1]
0.00/0.02 c heuristics/crossover/nodesquot = 0.15
0.00/0.02 c
0.00/0.02 c # minimum percentage of integer variables that have to be fixed
0.00/0.02 c # [type: real, range: [0,1], default: 0.666]
0.00/0.02 c heuristics/crossover/minfixingrate = 0.5
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.02 c heuristics/feaspump/freq = -1
0.00/0.02 c
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/feaspump/maxlpiterofs = 2000
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/fracdiving/freq = -1
0.00/0.02 c
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/fracdiving/maxlpiterquot = 0.075
0.00/0.02 c
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/fracdiving/maxlpiterofs = 1500
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/guideddiving/freq = -1
0.00/0.02 c
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/guideddiving/maxlpiterquot = 0.075
0.00/0.02 c
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/guideddiving/maxlpiterofs = 1500
0.00/0.02 c
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/intdiving/maxlpiterquot = 0.075
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/intshifting/freq = -1
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/linesearchdiving/freq = -1
0.00/0.02 c
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.00/0.02 c
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.02 c heuristics/objpscostdiving/freq = -1
0.00/0.02 c
0.00/0.02 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.02 c # [type: real, range: [0,1], default: 0.01]
0.00/0.02 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.00/0.02 c
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02 c heuristics/oneopt/freq = -1
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/pscostdiving/freq = -1
0.00/0.02 c
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.00/0.02 c
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/pscostdiving/maxlpiterofs = 1500
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c heuristics/rens/freq = -1
0.00/0.02 c
0.00/0.02 c # minimum percentage of integer variables that have to be fixable
0.00/0.02 c # [type: real, range: [0,1], default: 0.5]
0.00/0.02 c heuristics/rens/minfixingrate = 0.3
0.00/0.02 c
0.00/0.02 c # number of nodes added to the contingent of the total nodes
0.00/0.02 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.02 c heuristics/rens/nodesofs = 2000
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.02 c heuristics/rootsoldiving/freq = -1
0.00/0.02 c
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.02 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.00/0.02 c
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02 c heuristics/rounding/freq = -1
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c heuristics/shiftandpropagate/freq = -1
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/shifting/freq = -1
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02 c heuristics/simplerounding/freq = -1
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02 c heuristics/subnlp/freq = -1
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c heuristics/trivial/freq = -1
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02 c heuristics/trysol/freq = -1
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c heuristics/undercover/freq = -1
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/veclendiving/freq = -1
0.00/0.02 c
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/veclendiving/maxlpiterquot = 0.075
0.00/0.02 c
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02 c heuristics/zirounding/freq = -1
0.00/0.02 c
0.00/0.02 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c separating/cmir/freq = -1
0.00/0.02 c
0.00/0.02 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c separating/flowcover/freq = -1
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 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 0.0s| 1 | 0 | 133 | - |1665k| 0 | 71 | 258 | 389 | 258 | 389 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.02/0.08 c 0.1s| 1 | 0 | 457 | - |2088k| 0 | 127 | 258 | 390 | 258 | 576 | 187 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.17 c 0.2s| 1 | 0 | 695 | - |3627k| 0 | 169 | 258 | 390 | 258 | 781 | 392 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.25 c 0.3s| 1 | 0 | 742 | - |4861k| 0 | 163 | 258 | 390 | 258 | 834 | 445 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.33 c 0.3s| 1 | 0 | 775 | - |6338k| 0 | 170 | 258 | 390 | 258 | 880 | 491 | 0 | 0 | 0.000000e+00 | -- | Inf
0.39/0.40 c 0.4s| 1 | 0 | 816 | - |7685k| 0 | 171 | 258 | 390 | 258 | 882 | 493 | 0 | 0 | 0.000000e+00 | -- | Inf
0.59/0.63 c 0.6s| 1 | 2 | 816 | - |7685k| 0 | 171 | 258 | 390 | 258 | 882 | 493 | 0 | 9 | 0.000000e+00 | -- | Inf
6.89/6.93 c 6.9s| 10000 | 32 | 78386 | 7.8 |8042k| 35 | 33 | 258 | 803 | 258 | 510 | 493 | 637 |1686 | 0.000000e+00 | -- | Inf
11.59/11.68 c 11.7s| 20000 | 36 |155388 | 7.7 |8143k| 38 | - | 258 | 979 | 0 | 0 | 493 |1206 |1934 | 0.000000e+00 | -- | Inf
16.29/16.36 c 16.4s| 30000 | 38 |227273 | 7.5 |8270k| 38 | 25 | 258 |1273 | 258 | 510 | 493 |1783 |2364 | 0.000000e+00 | -- | Inf
21.29/21.38 c 21.4s| 40000 | 33 |304048 | 7.6 |8340k| 38 | - | 258 |1413 | 0 | 0 | 493 |2361 |2852 | 0.000000e+00 | -- | Inf
26.20/26.28 c 26.3s| 50000 | 36 |381580 | 7.6 |8397k| 43 | - | 258 |1495 | 258 | 510 | 493 |2937 |3208 | 0.000000e+00 | -- | Inf
29.49/29.53 c *29.5s| 56022 | 0 |431660 | 7.7 |8296k| 43 | - | 258 |1385 | 258 | 510 | 493 |3270 |3512 | 0.000000e+00 | 0.000000e+00 | 0.00%
29.49/29.53 c
29.49/29.53 c SCIP Status : problem is solved [optimal solution found]
29.49/29.53 c Solving Time (sec) : 29.53
29.49/29.53 c Solving Nodes : 56022
29.49/29.53 c Primal Bound : +0.00000000000000e+00 (1 solutions)
29.49/29.53 c Dual Bound : +0.00000000000000e+00
29.49/29.53 c Gap : 0.00 %
29.49/29.53 s SATISFIABLE
29.49/29.53 v -x265 x266 x263 -x264 -x261 x262 x259 -x260 -x257 x258 x255 -x256 -x253 x254 -x251 -x252 x249 -x250 -x247 -x248 x245 -x246 -x243
29.49/29.53 v -x244 x241 -x242 -x239 -x240 x237 -x238 -x235 x236 x233 -x234 -x231 x232 x229 -x230 -x227 x228 -x225 -x226 -x223 x224 -x221
29.49/29.53 v -x222 -x219 x220 -x217 -x218 -x215 -x216 -x213 x214 -x211 -x212 -x209 x210 x207 -x208 -x205 x206 x203 -x204 -x201 x202 x199
29.49/29.53 v -x200 x197 -x198 -x195 x196 x193 -x194 -x191 x192 x189 -x190 -x187 x188 -x185 x186 -x183 x184 -x181 x182 x179 -x180 -x177 x178
29.49/29.53 v x175 -x176 -x173 x174 x171 -x172 -x169 x170 x167 -x168 -x165 x166 -x163 x164 x162 -x160 x158 -x156 x154 -x152 -x150 -x148 -x146
29.49/29.53 v -x144 -x142 -x140 -x138 -x136 -x134 -x132 -x130 -x128 x126 -x124 x122 -x120 x118 -x116 -x114 -x112 -x110 -x108 -x106 -x104
29.49/29.53 v -x102 -x100 -x98 -x96 -x94 -x92 x90 -x88 x86 -x84 x82 -x80 -x78 -x76 -x74 -x72 -x70 -x68 -x66 -x64 -x62 -x60 -x58 -x56 x54
29.49/29.53 v -x52 x50 -x48 x46 -x44 -x42 -x40 -x38 -x36 -x34 -x32 -x30 -x28 -x26 -x24 -x22 -x20 -x18 -x16 -x14 -x12 -x10 -x8 -x6 -x4 -x2
29.49/29.53 v -x161 -x159 -x157 -x155 -x153 -x151 -x149 -x147 -x145 -x143 -x141 -x139 -x137 -x135 -x133 x131 -x129 x127 -x125 -x123 -x121 -x119
29.49/29.53 v -x117 -x115 -x113 -x111 -x109 -x107 -x105 -x103 -x101 -x99 -x97 x95 -x93 x91 -x89 -x87 -x85 -x83 -x81 -x79 -x77 -x75 -x73
29.49/29.53 v -x71 -x69 -x67 -x65 -x63 -x61 x59 -x57 x55 -x53 -x51 -x49 -x47 -x45 -x43 -x41 -x39 -x37 -x35 -x33 -x31 -x29 -x27 -x25 x23 -x21
29.49/29.53 v x19 -x17 x15 -x13 x11 -x9 x7 -x5 x3 -x1
29.49/29.53 c SCIP Status : problem is solved [optimal solution found]
29.49/29.53 c Total Time : 29.53
29.49/29.53 c solving : 29.53
29.49/29.53 c presolving : 0.01 (included in solving)
29.49/29.53 c reading : 0.00 (included in solving)
29.49/29.53 c Original Problem :
29.49/29.53 c Problem name : HOME/instance-3451123-1307067322.opb
29.49/29.53 c Variables : 266 (266 binary, 0 integer, 0 implicit integer, 0 continuous)
29.49/29.53 c Constraints : 401 initial, 401 maximal
29.49/29.53 c Presolved Problem :
29.49/29.53 c Problem name : t_HOME/instance-3451123-1307067322.opb
29.49/29.53 c Variables : 258 (258 binary, 0 integer, 0 implicit integer, 0 continuous)
29.49/29.53 c Constraints : 389 initial, 1526 maximal
29.49/29.53 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
29.49/29.53 c trivial : 0.00 0 0 0 0 0 0 0 0 0
29.49/29.53 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
29.49/29.53 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
29.49/29.53 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
29.49/29.53 c pseudoobj : 0.00 0 0 0 0 0 0 0 0 0
29.49/29.53 c implics : 0.00 0 8 0 0 0 0 0 0 0
29.49/29.53 c probing : 0.00 0 0 0 0 0 0 0 0 0
29.49/29.53 c knapsack : 0.01 0 0 0 0 0 0 0 0 0
29.49/29.53 c setppc : 0.00 0 0 0 0 0 12 0 0 0
29.49/29.53 c linear : 0.00 0 0 0 0 0 0 0 0 0
29.49/29.53 c logicor : 0.00 0 0 0 0 0 0 0 0 0
29.49/29.53 c root node : - 0 - - 0 - - - - -
29.49/29.53 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
29.49/29.53 c integral : 0 0 0 28724 0 3 0 133 504 0 0 56454
29.49/29.53 c knapsack : 164 5 145583 0 0 0 326391 20873 474421 538 0 0
29.49/29.53 c setppc : 129 5 122567 0 0 0 73316 87 141661 0 0 0
29.49/29.53 c linear : 0+ 5 19020 0 0 0 2 1 64 0 0 0
29.49/29.53 c logicor : 96+ 5 94674 0 0 0 2001 421 93885 0 0 0
29.49/29.53 c countsols : 0 0 0 1 0 2 0 0 0 0 0 0
29.49/29.53 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
29.49/29.53 c integral : 3.91 0.00 0.00 3.91 0.00 0.00 0.00
29.49/29.53 c knapsack : 1.17 0.01 1.06 0.00 0.00 0.00 0.11
29.49/29.53 c setppc : 0.21 0.00 0.20 0.00 0.00 0.00 0.02
29.49/29.53 c linear : 0.01 0.00 0.01 0.00 0.00 0.00 0.00
29.49/29.53 c logicor : 0.43 0.00 0.43 0.00 0.00 0.00 0.00
29.49/29.53 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
29.49/29.53 c Propagators : #Propagate #Resprop Cutoffs DomReds
29.49/29.53 c vbounds : 0 0 0 0
29.49/29.53 c rootredcost : 0 0 0 0
29.49/29.53 c pseudoobj : 0 0 0 0
29.49/29.53 c Propagator Timings : TotalTime Propagate Resprop
29.49/29.53 c vbounds : 0.02 0.02 0.00
29.49/29.53 c rootredcost : 0.02 0.02 0.00
29.49/29.53 c pseudoobj : 0.01 0.01 0.00
29.49/29.53 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
29.49/29.53 c propagation : 0.31 3686 3119 17169 55.1 63 62.5 -
29.49/29.53 c infeasible LP : 0.30 6650 0 0 0.0 0 0.0 0
29.49/29.53 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
29.49/29.53 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
29.49/29.53 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
29.49/29.53 c applied globally : - - - 3257 14.0 - - -
29.49/29.53 c applied locally : - - - 13 46.9 - - -
29.49/29.53 c Separators : Time Calls Cutoffs DomReds Cuts Conss
29.49/29.53 c cut pool : 0.00 4 - - 181 - (maximal pool size: 1806)
29.49/29.53 c redcost : 0.11 28548 0 0 0 0
29.49/29.53 c impliedbounds : 0.00 5 0 0 770 0
29.49/29.53 c intobj : 0.00 0 0 0 0 0
29.49/29.53 c gomory : 0.13 5 0 0 197 0
29.49/29.53 c cgmip : 0.00 0 0 0 0 0
29.49/29.53 c closecuts : 0.00 0 0 0 0 0
29.49/29.53 c strongcg : 0.15 5 0 0 1902 0
29.49/29.53 c cmir : 0.00 0 0 0 0 0
29.49/29.53 c flowcover : 0.00 0 0 0 0 0
29.49/29.53 c clique : 0.00 1 0 0 0 0
29.49/29.53 c zerohalf : 0.00 0 0 0 0 0
29.49/29.53 c mcf : 0.00 1 0 0 0 0
29.49/29.53 c oddcycle : 0.00 0 0 0 0 0
29.49/29.53 c rapidlearning : 0.02 1 0 0 0 1
29.49/29.53 c Pricers : Time Calls Vars
29.49/29.53 c problem variables: 0.00 0 0
29.49/29.53 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
29.49/29.53 c relpscost : 3.89 28723 133 504 0 0 56454
29.49/29.53 c pscost : 0.00 0 0 0 0 0 0
29.49/29.53 c inference : 0.00 0 0 0 0 0 0
29.49/29.53 c mostinf : 0.00 0 0 0 0 0 0
29.49/29.53 c leastinf : 0.00 0 0 0 0 0 0
29.49/29.53 c fullstrong : 0.00 0 0 0 0 0 0
29.49/29.53 c allfullstrong : 0.00 0 0 0 0 0 0
29.49/29.53 c random : 0.00 0 0 0 0 0 0
29.49/29.53 c Primal Heuristics : Time Calls Found
29.49/29.53 c LP solutions : 0.00 - 1
29.49/29.53 c pseudo solutions : 0.00 - 0
29.49/29.53 c trivial : 0.00 1 0
29.49/29.53 c shiftandpropagate: 0.00 0 0
29.49/29.53 c simplerounding : 0.00 0 0
29.49/29.53 c zirounding : 0.00 0 0
29.49/29.53 c rounding : 0.00 0 0
29.49/29.53 c shifting : 0.00 0 0
29.49/29.53 c intshifting : 0.00 0 0
29.49/29.53 c oneopt : 0.00 0 0
29.49/29.53 c twoopt : 0.00 0 0
29.49/29.53 c fixandinfer : 0.00 0 0
29.49/29.53 c feaspump : 0.00 0 0
29.49/29.53 c clique : 0.00 0 0
29.49/29.53 c coefdiving : 0.00 0 0
29.49/29.53 c pscostdiving : 0.00 0 0
29.49/29.53 c fracdiving : 0.00 0 0
29.49/29.53 c veclendiving : 0.00 0 0
29.49/29.53 c intdiving : 0.00 0 0
29.49/29.53 c actconsdiving : 0.00 0 0
29.49/29.53 c objpscostdiving : 0.00 0 0
29.49/29.53 c rootsoldiving : 0.00 0 0
29.49/29.53 c linesearchdiving : 0.00 0 0
29.49/29.53 c guideddiving : 0.00 0 0
29.49/29.53 c octane : 0.00 0 0
29.49/29.53 c rens : 0.00 0 0
29.49/29.53 c rins : 0.00 0 0
29.49/29.53 c localbranching : 0.00 0 0
29.49/29.53 c mutation : 0.00 0 0
29.49/29.53 c crossover : 0.00 0 0
29.49/29.53 c dins : 0.00 0 0
29.49/29.53 c vbounds : 0.00 0 0
29.49/29.53 c undercover : 0.00 0 0
29.49/29.53 c subnlp : 0.00 0 0
29.49/29.53 c trysol : 0.00 0 0
29.49/29.53 c LP : Time Calls Iterations Iter/call Iter/sec
29.49/29.53 c primal LP : 0.00 0 0 0.00 -
29.49/29.53 c dual LP : 19.03 35343 431660 12.21 22680.80
29.49/29.53 c lex dual LP : 0.00 0 0 0.00 -
29.49/29.53 c barrier LP : 0.00 0 0 0.00 -
29.49/29.53 c diving/probing LP: 0.00 0 0 0.00 -
29.49/29.53 c strong branching : 3.57 3512 60952 17.36 17097.03
29.49/29.53 c (at root node) : - 9 2481 275.67 -
29.49/29.53 c conflict analysis: 0.00 0 0 0.00 -
29.49/29.53 c B&B Tree :
29.49/29.53 c number of runs : 1
29.49/29.53 c nodes : 56022
29.49/29.53 c nodes (total) : 56022
29.49/29.53 c nodes left : 0
29.49/29.53 c max depth : 43
29.49/29.53 c max depth (total): 43
29.49/29.53 c backtracks : 7996 (14.3%)
29.49/29.53 c delayed cutoffs : 384
29.49/29.53 c repropagations : 6384 (18455 domain reductions, 371 cutoffs)
29.49/29.53 c avg switch length: 2.84
29.49/29.53 c switching time : 1.40
29.49/29.53 c Solution :
29.49/29.53 c Solutions found : 1 (1 improvements)
29.49/29.53 c First Solution : +0.00000000000000e+00 (in run 1, after 56022 nodes, 29.53 seconds, depth 24, found by <relaxation>)
29.49/29.53 c Primal Bound : +0.00000000000000e+00 (in run 1, after 56022 nodes, 29.53 seconds, depth 24, found by <relaxation>)
29.49/29.53 c Dual Bound : +0.00000000000000e+00
29.49/29.53 c Gap : 0.00 %
29.49/29.53 c Root Dual Bound : +0.00000000000000e+00
29.49/29.53 c Root Iterations : 816
29.49/29.53 c Time complete: 29.53.
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-3451123-1307067322/watcher-3451123-1307067322 -o /tmp/evaluation-result-3451123-1307067322/solver-3451123-1307067322 -C 1800 -W 1900 -M 15500 HOME/scip-2.0.1.4b.linux.x86_64.gnu.opt.spx -f HOME/instance-3451123-1307067322.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.98 1.52 1.22 2/327 16762
/proc/meminfo: memFree=24167664/32951124 swapFree=67056304/67111528
[pid=16762] ppid=16760 vsize=17664 CPUtime=0 cores=1,3,5,7
/proc/16762/stat : 16762 (scip-2.0.1.4b.l) R 16760 16762 15734 0 -1 4202496 3160 0 0 0 0 0 0 0 25 0 1 0 896962830 18087936 3113 33554432000 4194304 9163163 140735240203872 18446744073709551615 5177341 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/16762/statm: 4416 3117 489 1214 0 3198 0
[startup+0.038653 s]
/proc/loadavg: 1.98 1.52 1.22 2/327 16762
/proc/meminfo: memFree=24167664/32951124 swapFree=67056304/67111528
[pid=16762] ppid=16760 vsize=25392 CPUtime=0.02 cores=1,3,5,7
/proc/16762/stat : 16762 (scip-2.0.1.4b.l) R 16760 16762 15734 0 -1 4202496 5564 0 0 0 2 0 0 0 18 0 1 0 896962830 26001408 5260 33554432000 4194304 9163163 140735240203872 18446744073709551615 8013931 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/16762/statm: 6348 5261 681 1214 0 5130 0
Current children cumulated CPU time (s) 0.02
Current children cumulated vsize (KiB) 25392
[startup+0.100643 s]
/proc/loadavg: 1.98 1.52 1.22 2/327 16762
/proc/meminfo: memFree=24167664/32951124 swapFree=67056304/67111528
[pid=16762] ppid=16760 vsize=22556 CPUtime=0.09 cores=1,3,5,7
/proc/16762/stat : 16762 (scip-2.0.1.4b.l) R 16760 16762 15734 0 -1 4202496 7553 0 0 0 9 0 0 0 18 0 1 0 896962830 23097344 4613 33554432000 4194304 9163163 140735240203872 18446744073709551615 8087562 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/16762/statm: 5639 4613 707 1214 0 4421 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 22556
[startup+0.300603 s]
/proc/loadavg: 1.98 1.52 1.22 2/327 16762
/proc/meminfo: memFree=24167664/32951124 swapFree=67056304/67111528
[pid=16762] ppid=16760 vsize=28128 CPUtime=0.29 cores=1,3,5,7
/proc/16762/stat : 16762 (scip-2.0.1.4b.l) R 16760 16762 15734 0 -1 4202496 8791 0 0 0 28 1 0 0 18 0 1 0 896962830 28803072 5851 33554432000 4194304 9163163 140735240203872 18446744073709551615 8087562 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/16762/statm: 7032 5851 707 1214 0 5814 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 28128
[startup+0.700528 s]
/proc/loadavg: 1.98 1.52 1.22 2/327 16762
/proc/meminfo: memFree=24167664/32951124 swapFree=67056304/67111528
[pid=16762] ppid=16760 vsize=31584 CPUtime=0.69 cores=1,3,5,7
/proc/16762/stat : 16762 (scip-2.0.1.4b.l) R 16760 16762 15734 0 -1 4202496 9762 0 0 0 66 3 0 0 18 0 1 0 896962830 32342016 6822 33554432000 4194304 9163163 140735240203872 18446744073709551615 8087562 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/16762/statm: 7896 6822 710 1214 0 6678 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 31584
[startup+1.50038 s]
/proc/loadavg: 1.98 1.52 1.22 3/328 16763
/proc/meminfo: memFree=24142608/32951124 swapFree=67056304/67111528
[pid=16762] ppid=16760 vsize=31584 CPUtime=1.49 cores=1,3,5,7
/proc/16762/stat : 16762 (scip-2.0.1.4b.l) R 16760 16762 15734 0 -1 4202496 9763 0 0 0 139 10 0 0 20 0 1 0 896962830 32342016 6823 33554432000 4194304 9163163 140735240203872 18446744073709551615 7250545 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/16762/statm: 7896 6823 711 1214 0 6678 0
Current children cumulated CPU time (s) 1.49
Current children cumulated vsize (KiB) 31584
[startup+3.1011 s]
/proc/loadavg: 1.98 1.52 1.22 3/328 16763
/proc/meminfo: memFree=24141988/32951124 swapFree=67056304/67111528
[pid=16762] ppid=16760 vsize=31584 CPUtime=3.1 cores=1,3,5,7
/proc/16762/stat : 16762 (scip-2.0.1.4b.l) R 16760 16762 15734 0 -1 4202496 9763 0 0 0 285 25 0 0 25 0 1 0 896962830 32342016 6823 33554432000 4194304 9163163 140735240203872 18446744073709551615 8087562 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/16762/statm: 7896 6823 711 1214 0 6678 0
Current children cumulated CPU time (s) 3.1
Current children cumulated vsize (KiB) 31584
[startup+6.30051 s]
/proc/loadavg: 1.98 1.52 1.22 3/328 16763
/proc/meminfo: memFree=24141556/32951124 swapFree=67056304/67111528
[pid=16762] ppid=16760 vsize=31584 CPUtime=6.29 cores=1,3,5,7
/proc/16762/stat : 16762 (scip-2.0.1.4b.l) R 16760 16762 15734 0 -1 4202496 9764 0 0 0 577 52 0 0 25 0 1 0 896962830 32342016 6824 33554432000 4194304 9163163 140735240203872 18446744073709551615 8087562 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/16762/statm: 7896 6824 711 1214 0 6678 0
Current children cumulated CPU time (s) 6.29
Current children cumulated vsize (KiB) 31584
[startup+12.7003 s]
/proc/loadavg: 1.99 1.53 1.23 3/328 16764
/proc/meminfo: memFree=24141248/32951124 swapFree=67056304/67111528
[pid=16762] ppid=16760 vsize=31868 CPUtime=12.69 cores=1,3,5,7
/proc/16762/stat : 16762 (scip-2.0.1.4b.l) R 16760 16762 15734 0 -1 4202496 9840 0 0 0 1165 104 0 0 25 0 1 0 896962830 32632832 6899 33554432000 4194304 9163163 140735240203872 18446744073709551615 8087562 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/16762/statm: 7967 6899 711 1214 0 6749 0
Current children cumulated CPU time (s) 12.69
Current children cumulated vsize (KiB) 31868
[startup+25.501 s]
/proc/loadavg: 1.99 1.55 1.24 3/328 16764
/proc/meminfo: memFree=24141268/32951124 swapFree=67056304/67111528
[pid=16762] ppid=16760 vsize=32132 CPUtime=25.5 cores=1,3,5,7
/proc/16762/stat : 16762 (scip-2.0.1.4b.l) R 16760 16762 15734 0 -1 4202496 9897 0 0 0 2344 206 0 0 25 0 1 0 896962830 32903168 6956 33554432000 4194304 9163163 140735240203872 18446744073709551615 8087562 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/16762/statm: 8033 6956 711 1214 0 6815 0
Current children cumulated CPU time (s) 25.5
Current children cumulated vsize (KiB) 32132
Solver just ended. Dumping a history of the last processes samples
[startup+27.1007 s]
/proc/loadavg: 1.99 1.55 1.24 3/328 16764
/proc/meminfo: memFree=24141268/32951124 swapFree=67056304/67111528
[pid=16762] ppid=16760 vsize=32132 CPUtime=27.1 cores=1,3,5,7
/proc/16762/stat : 16762 (scip-2.0.1.4b.l) R 16760 16762 15734 0 -1 4202496 9946 0 0 0 2491 219 0 0 25 0 1 0 896962830 32903168 7005 33554432000 4194304 9163163 140735240203872 18446744073709551615 4793359 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/16762/statm: 8033 7005 711 1214 0 6815 0
Current children cumulated CPU time (s) 27.1
Current children cumulated vsize (KiB) 32132
[startup+28.7004 s]
/proc/loadavg: 1.99 1.56 1.24 3/328 16764
/proc/meminfo: memFree=24140772/32951124 swapFree=67056304/67111528
[pid=16762] ppid=16760 vsize=32280 CPUtime=28.69 cores=1,3,5,7
/proc/16762/stat : 16762 (scip-2.0.1.4b.l) R 16760 16762 15734 0 -1 4202496 9988 0 0 0 2636 233 0 0 25 0 1 0 896962830 33054720 7047 33554432000 4194304 9163163 140735240203872 18446744073709551615 8087562 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/16762/statm: 8070 7047 711 1214 0 6852 0
Current children cumulated CPU time (s) 28.69
Current children cumulated vsize (KiB) 32280
[startup+29.1003 s]
/proc/loadavg: 1.99 1.56 1.24 3/328 16764
/proc/meminfo: memFree=24140772/32951124 swapFree=67056304/67111528
[pid=16762] ppid=16760 vsize=32280 CPUtime=29.09 cores=1,3,5,7
/proc/16762/stat : 16762 (scip-2.0.1.4b.l) R 16760 16762 15734 0 -1 4202496 9988 0 0 0 2672 237 0 0 25 0 1 0 896962830 33054720 7047 33554432000 4194304 9163163 140735240203872 18446744073709551615 8087562 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/16762/statm: 8070 7047 711 1214 0 6852 0
Current children cumulated CPU time (s) 29.09
Current children cumulated vsize (KiB) 32280
[startup+29.5003 s]
/proc/loadavg: 1.99 1.56 1.24 3/328 16764
/proc/meminfo: memFree=24140772/32951124 swapFree=67056304/67111528
[pid=16762] ppid=16760 vsize=32280 CPUtime=29.49 cores=1,3,5,7
/proc/16762/stat : 16762 (scip-2.0.1.4b.l) R 16760 16762 15734 0 -1 4202496 9988 0 0 0 2708 241 0 0 25 0 1 0 896962830 33054720 7047 33554432000 4194304 9163163 140735240203872 18446744073709551615 8087562 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/16762/statm: 8070 7047 711 1214 0 6852 0
Current children cumulated CPU time (s) 29.49
Current children cumulated vsize (KiB) 32280
Child status: 0
Real time (s): 29.5389
CPU time (s): 29.5395
CPU user time (s): 27.1259
CPU system time (s): 2.41363
CPU usage (%): 100.002
Max. virtual memory (cumulated for all children) (KiB): 32280
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 27.1259
system time used= 2.41363
maximum resident set size= 0
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 9995
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= 365
runsolver used 0.106983 second user time and 0.205968 second system time
The end