0.00/0.00 c SCIP version 2.0.1.5 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.5]
0.00/0.00 c Copyright (c) 2002-2011 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB)
0.00/0.00 c
0.00/0.00 c user parameter file <scip.set> not found - using default parameters
0.00/0.00 c reading problem <HOME/instance-3730314-1338688215.opb>
0.00/0.01 c original problem has 938 variables (938 bin, 0 int, 0 impl, 0 cont) and 700 constraints
0.00/0.01 c problem read
0.00/0.01 c No objective function, only one solution is needed.
0.00/0.01 c presolving settings loaded
0.00/0.02 c presolving:
0.02/0.04 c (round 1) 0 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 700 upgd conss, 0 impls, 50 clqs
0.02/0.04 c presolving (2 rounds):
0.02/0.04 c 0 deleted vars, 0 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.02/0.04 c 0 implications, 50 cliques
0.02/0.04 c presolved problem has 938 variables (938 bin, 0 int, 0 impl, 0 cont) and 700 constraints
0.02/0.04 c 50 constraints of type <setppc>
0.02/0.04 c 650 constraints of type <logicor>
0.02/0.04 c transformed objective value is always integral (scale: 1)
0.02/0.04 c Presolving Time: 0.03
0.02/0.04 c - non default parameters ----------------------------------------------------------------------
0.02/0.04 c # SCIP version 2.0.1.5
0.02/0.04 c
0.02/0.04 c # frequency for displaying node information lines
0.02/0.04 c # [type: int, range: [-1,2147483647], default: 100]
0.02/0.04 c display/freq = 10000
0.02/0.04 c
0.02/0.04 c # maximal time in seconds to run
0.02/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.02/0.04 c limits/time = 1797
0.02/0.04 c
0.02/0.04 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.02/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.02/0.04 c limits/memory = 13950
0.02/0.04 c
0.02/0.04 c # solving stops, if the given number of solutions were found (-1: no limit)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.04 c limits/solutions = 1
0.02/0.04 c
0.02/0.04 c # maximal number of separation rounds per node (-1: unlimited)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: 5]
0.02/0.04 c separating/maxrounds = 1
0.02/0.04 c
0.02/0.04 c # maximal number of separation rounds in the root node (-1: unlimited)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.04 c separating/maxroundsroot = 5
0.02/0.04 c
0.02/0.04 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.02/0.04 c # [type: int, range: [1,2], default: 1]
0.02/0.04 c timing/clocktype = 2
0.02/0.04 c
0.02/0.04 c # belongs reading time to solving time?
0.02/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.04 c timing/reading = TRUE
0.02/0.04 c
0.02/0.04 c # should presolving try to simplify inequalities
0.02/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.04 c constraints/linear/simplifyinequalities = TRUE
0.02/0.04 c
0.02/0.04 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.02/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.04 c constraints/indicator/addCouplingCons = TRUE
0.02/0.04 c
0.02/0.04 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.02/0.04 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.02/0.04 c constraints/knapsack/disaggregation = FALSE
0.02/0.04 c
0.02/0.04 c # should presolving try to simplify knapsacks
0.02/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.04 c constraints/knapsack/simplifyinequalities = TRUE
0.02/0.04 c
0.02/0.04 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.04 c presolving/probing/maxrounds = 0
0.02/0.04 c
0.02/0.04 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.04 c heuristics/coefdiving/freq = -1
0.02/0.04 c
0.02/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.04 c heuristics/coefdiving/maxlpiterquot = 0.075
0.02/0.04 c
0.02/0.04 c # additional number of allowed LP iterations
0.02/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.04 c heuristics/coefdiving/maxlpiterofs = 1500
0.02/0.04 c
0.02/0.04 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: 30]
0.02/0.04 c heuristics/crossover/freq = -1
0.02/0.04 c
0.02/0.04 c # number of nodes added to the contingent of the total nodes
0.02/0.04 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.02/0.04 c heuristics/crossover/nodesofs = 750
0.02/0.04 c
0.02/0.04 c # number of nodes without incumbent change that heuristic should wait
0.02/0.04 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.02/0.04 c heuristics/crossover/nwaitingnodes = 100
0.02/0.04 c
0.02/0.04 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.02/0.04 c # [type: real, range: [0,1], default: 0.1]
0.02/0.04 c heuristics/crossover/nodesquot = 0.15
0.02/0.04 c
0.02/0.04 c # minimum percentage of integer variables that have to be fixed
0.02/0.04 c # [type: real, range: [0,1], default: 0.666]
0.02/0.04 c heuristics/crossover/minfixingrate = 0.5
0.02/0.04 c
0.02/0.04 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: 20]
0.02/0.04 c heuristics/feaspump/freq = -1
0.02/0.04 c
0.02/0.04 c # additional number of allowed LP iterations
0.02/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.04 c heuristics/feaspump/maxlpiterofs = 2000
0.02/0.04 c
0.02/0.04 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.04 c heuristics/fracdiving/freq = -1
0.02/0.04 c
0.02/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.04 c heuristics/fracdiving/maxlpiterquot = 0.075
0.02/0.04 c
0.02/0.04 c # additional number of allowed LP iterations
0.02/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.04 c heuristics/fracdiving/maxlpiterofs = 1500
0.02/0.04 c
0.02/0.04 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.04 c heuristics/guideddiving/freq = -1
0.02/0.04 c
0.02/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.04 c heuristics/guideddiving/maxlpiterquot = 0.075
0.02/0.04 c
0.02/0.04 c # additional number of allowed LP iterations
0.02/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.04 c heuristics/guideddiving/maxlpiterofs = 1500
0.02/0.04 c
0.02/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.04 c heuristics/intdiving/maxlpiterquot = 0.075
0.02/0.04 c
0.02/0.04 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.04 c heuristics/intshifting/freq = -1
0.02/0.04 c
0.02/0.04 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.04 c heuristics/linesearchdiving/freq = -1
0.02/0.04 c
0.02/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.04 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.02/0.04 c
0.02/0.04 c # additional number of allowed LP iterations
0.02/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.04 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.02/0.04 c
0.02/0.04 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: 20]
0.02/0.04 c heuristics/objpscostdiving/freq = -1
0.02/0.04 c
0.02/0.04 c # maximal fraction of diving LP iterations compared to total iteration number
0.02/0.04 c # [type: real, range: [0,1], default: 0.01]
0.02/0.04 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.02/0.04 c
0.02/0.04 c # additional number of allowed LP iterations
0.02/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.04 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.02/0.04 c
0.02/0.04 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.04 c heuristics/oneopt/freq = -1
0.02/0.04 c
0.02/0.04 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.04 c heuristics/pscostdiving/freq = -1
0.02/0.04 c
0.02/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.04 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.02/0.04 c
0.02/0.04 c # additional number of allowed LP iterations
0.02/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.04 c heuristics/pscostdiving/maxlpiterofs = 1500
0.02/0.04 c
0.02/0.04 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: 0]
0.02/0.04 c heuristics/rens/freq = -1
0.02/0.04 c
0.02/0.04 c # minimum percentage of integer variables that have to be fixable
0.02/0.04 c # [type: real, range: [0,1], default: 0.5]
0.02/0.04 c heuristics/rens/minfixingrate = 0.3
0.02/0.04 c
0.02/0.04 c # number of nodes added to the contingent of the total nodes
0.02/0.04 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.02/0.04 c heuristics/rens/nodesofs = 2000
0.02/0.04 c
0.02/0.04 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: 20]
0.02/0.04 c heuristics/rootsoldiving/freq = -1
0.02/0.04 c
0.02/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.02/0.04 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.02/0.04 c
0.02/0.04 c # additional number of allowed LP iterations
0.02/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.04 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.02/0.04 c
0.02/0.04 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.04 c heuristics/rounding/freq = -1
0.02/0.04 c
0.02/0.04 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: 0]
0.02/0.04 c heuristics/shiftandpropagate/freq = -1
0.02/0.04 c
0.02/0.04 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.04 c heuristics/shifting/freq = -1
0.02/0.04 c
0.02/0.04 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.04 c heuristics/simplerounding/freq = -1
0.02/0.04 c
0.02/0.04 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.04 c heuristics/subnlp/freq = -1
0.02/0.04 c
0.02/0.04 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: 0]
0.02/0.04 c heuristics/trivial/freq = -1
0.02/0.04 c
0.02/0.04 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.04 c heuristics/trysol/freq = -1
0.02/0.04 c
0.02/0.04 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: 0]
0.02/0.04 c heuristics/undercover/freq = -1
0.02/0.04 c
0.02/0.04 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.04 c heuristics/veclendiving/freq = -1
0.02/0.04 c
0.02/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.04 c heuristics/veclendiving/maxlpiterquot = 0.075
0.02/0.04 c
0.02/0.04 c # additional number of allowed LP iterations
0.02/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.04 c heuristics/veclendiving/maxlpiterofs = 1500
0.02/0.04 c
0.02/0.04 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.04 c heuristics/zirounding/freq = -1
0.02/0.04 c
0.02/0.04 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: 0]
0.02/0.04 c separating/cmir/freq = -1
0.02/0.04 c
0.02/0.04 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: 0]
0.02/0.04 c separating/flowcover/freq = -1
0.02/0.04 c
0.02/0.04 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.02/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.04 c separating/rapidlearning/freq = 0
0.02/0.04 c
0.02/0.04 c -----------------------------------------------------------------------------------------------
0.02/0.04 c start solving
0.02/0.04 c
0.02/0.07 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.02/0.07 c 0.1s| 1 | 0 | 453 | - |3950k| 0 | 163 | 938 | 700 | 938 | 700 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.22 c 0.2s| 1 | 0 | 792 | - |4365k| 0 | 195 | 938 | 701 | 938 | 713 | 13 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.39 c 0.4s| 1 | 0 | 1165 | - |5008k| 0 | 167 | 938 | 701 | 938 | 723 | 23 | 0 | 0 | 0.000000e+00 | -- | Inf
0.39/0.49 c 0.5s| 1 | 0 | 1378 | - |5778k| 0 | 164 | 938 | 701 | 938 | 734 | 34 | 0 | 0 | 0.000000e+00 | -- | Inf
0.49/0.58 c 0.6s| 1 | 0 | 1784 | - |6317k| 0 | 202 | 938 | 701 | 938 | 751 | 51 | 0 | 0 | 0.000000e+00 | -- | Inf
0.59/0.69 c 0.7s| 1 | 0 | 2538 | - |6873k| 0 | 88 | 938 | 701 | 938 | 767 | 67 | 0 | 0 | 0.000000e+00 | -- | Inf
0.68/0.76 c 0.8s| 1 | 2 | 2538 | - |6873k| 0 | 88 | 938 | 701 | 938 | 767 | 67 | 0 | 16 | 0.000000e+00 | -- | Inf
2.19/2.25 c * 2.3s| 41 | 0 | 3167 | 15.7 |7068k| 23 | - | 938 | 701 | 938 | 724 | 67 | 0 | 825 | 0.000000e+00 | 0.000000e+00 | 0.00%
2.19/2.25 c
2.19/2.25 c SCIP Status : problem is solved [optimal solution found]
2.19/2.25 c Solving Time (sec) : 2.25
2.19/2.25 c Solving Nodes : 41
2.19/2.25 c Primal Bound : +0.00000000000000e+00 (1 solutions)
2.19/2.25 c Dual Bound : +0.00000000000000e+00
2.19/2.25 c Gap : 0.00 %
2.19/2.26 s SATISFIABLE
2.19/2.26 v -x435 -x431 -x366 -x124 -x102 -x449 -x448 -x108 -x136 -x134 -x128 -x358 -x441 -x146 -x147 -x372 x597 -x596 -x594 -x593 -x591 -x580
2.19/2.26 v -x579 -x65 -x62 x58 -x54 -x364 -x371 -x355 -x524 -x521 -x520 -x512 -x510 -x514 -x103 -x429 -x200 -x196 -x195 -x189 -x183
2.19/2.26 v -x179 -x176 -x598 -x192 -x75 -x399 -x398 -x393 -x392 -x391 -x390 -x388 -x387 -x385 -x383 -x381 -x379 -x378 -x377 -x132 -x351
2.19/2.26 v -x186 -x440 -x138 -x101 -x400 -x506 -x53 -x518 -x550 -x548 -x545 -x543 -x542 -x540 -x539 -x533 -x532 -x527 -x526 -x515 -x68 -x191
2.19/2.26 v -x386 -x584 -x576 x104 -x51 -x181 -x356 -x535 -x505 -x60 -x437 -x546 -x112 -x496 -x494 -x488 -x486 -x484 -x480 -x477 -x481
2.19/2.26 v -x57 -x129 -x187 -x111 -x72 -x493 -x525 -x541 -x384 -x530 -x507 -x107 -x511 -x491 -x534 -x590 -x325 -x324 -x322 -x321 -x315
2.19/2.26 v -x310 -x309 -x301 -x445 -x312 -x427 -x499 -x320 -x380 -x143 -x56 -x483 -x131 -x485 -x305 -x370 -x145 -x180 -x434 -x587 -x476
2.19/2.26 v -x70 x531 -x368 -x600 -x193 -x397 -x306 -x317 -x319 -x117 -x577 -x64 -x479 -x303 -x178 -x350 -x349 -x347 -x340 -x339 -x337
2.19/2.26 v -x335 -x334 -x333 -x332 -x331 x330 -x329 -x327 -x326 -x500 -x575 -x572 -x571 -x570 -x566 -x565 -x564 -x563 -x560 -x557 -x556
2.19/2.26 v -x554 -x553 -x552 -x341 -x439 -x599 -x376 -x122 -x529 -x472 -x470 -x469 -x463 -x462 -x460 -x459 -x457 -x456 -x452 -x451 -x561
2.19/2.26 v -x454 -x508 -x389 -x549 -x498 -x516 -x106 -x127 -x149 -x304 -x182 -x190 -x338 -x475 -x302 -x225 -x224 -x223 -x221 -x220 -x219
2.19/2.26 v -x218 -x217 x213 -x212 -x211 -x208 -x206 -x205 -x204 -x202 -x369 -x274 -x273 -x272 -x271 -x269 -x268 -x267 -x266 -x263 -x261
2.19/2.26 v -x259 -x258 -x257 -x256 -x255 -x251 -x482 -x270 -x264 -x121 -x141 -x194 -x323 -x209 -x313 -x513 -x467 -x318 -x522 -x365 -x625
2.19/2.26 v -x622 -x620 -x619 -x618 x617 -x616 -x615 -x612 -x611 -x610 -x607 -x605 -x603 -x602 -x601 -x144 -x497 -x133 -x595 -x344 -x135
2.19/2.26 v -x311 -x119 -x544 -x336 -x74 -x578 -x606 -x536 -x568 -x471 -x621 -x461 -x252 -x528 -x308 -x519 -x118 -x509 -x148 -x367 -x468
2.19/2.26 v -x222 -x608 -x438 -x110 -x450 -x100 -x98 -x97 -x96 -x93 -x92 -x91 -x90 -x89 -x88 -x87 -x85 -x84 -x82 -x79 -x78 -x77 -x114
2.19/2.26 v -x373 -x197 -x254 -x354 -x623 -x442 -x253 -x613 -x443 -x583 -x184 -x562 -x382 -x126 -x446 -x199 -x185 -x455 -x357 -x99 -x492
2.19/2.26 v -x262 -x487 -x76 -x555 -x198 -x432 -x83 -x67 -x214 -x547 -x466 -x201 -x425 -x424 -x422 -x421 -x420 -x419 x418 -x417 -x416 -x414
2.19/2.26 v -x413 -x412 -x410 -x409 -x408 -x407 -x406 -x405 -x404 -x402 -x81 -x260 -x69 -x343 -x502 -x490 -x411 -x362 -x574 -x188 -x504
2.19/2.26 v -x585 -x361 -x359 -x447 -x401 -x150 -x55 -x265 x569 -x588 -x314 -x346 -x478 -x123 x137 x474 -x142 -x458 -x59 -x130 -x624 -x430
2.19/2.26 v -x94 -x115 -x360 -x551 x396 x353 -x453 -x586 -x363 -x609 -x517 -x769 -x768 -x767 -x766 -x765 -x764 -x763 -x762 x761 -x760
2.19/2.26 v -x759 -x758 -x537 -x203 x523 -x503 -x61 -x120 x316 -x573 x426 -x558 -x473 -x50 -x49 -x48 -x47 -x46 -x45 -x44 -x43 -x42 -x41
2.19/2.26 v -x40 -x39 -x38 -x37 -x36 -x35 x34 -x33 -x31 -x30 -x29 -x28 -x27 -x26 -x495 -x415 -x125 -x925 x924 -x923 -x922 -x921 -x920 -x919
2.19/2.26 v -x918 -x917 -x916 -x915 -x914 -x913 -x374 x489 -x328 -x589 -x95 -x673 -x672 -x671 -x670 -x669 -x668 -x667 -x666 -x665 x664
2.19/2.26 v -x663 -x662 -x604 -x581 -x538 -x592 -x216 -x113 -x342 x86 -x300 -x299 -x298 -x296 -x295 -x294 -x293 -x292 -x291 -x289 -x288
2.19/2.26 v -x287 -x286 -x285 -x284 -x283 -x282 -x281 -x280 -x279 -x278 -x277 -x276 -x80 -x32 -x614 -x782 -x781 -x780 -x779 -x778 -x777 x776
2.19/2.26 v -x775 -x774 -x773 -x772 -x771 -x770 -x63 -x307 -x444 -x395 -x109 -x105 -x886 -x885 -x884 -x883 -x882 -x881 -x880 -x879 -x878
2.19/2.26 v -x877 -x876 -x875 x874 -x71 -x685 -x684 x683 -x682 -x681 -x680 -x679 -x678 -x677 -x676 -x675 -x674 -x352 -x697 -x696 -x695
2.19/2.26 v x694 -x693 -x692 -x691 -x690 -x689 -x688 -x687 -x686 -x745 -x744 -x743 -x742 -x741 -x740 -x739 -x738 -x737 -x736 x735 -x734
2.19/2.26 v -x210 -x140 -x52 -x428 -x834 -x833 -x832 -x831 -x830 x829 -x828 -x827 -x826 -x825 -x824 -x823 -x822 -x567 -x375 -x757 -x756
2.19/2.26 v -x755 -x754 x753 -x752 -x751 -x750 -x749 -x748 -x747 -x746 -x436 -x250 -x249 -x248 -x247 -x246 -x245 -x244 -x243 -x242 -x240
2.19/2.26 v -x239 -x238 -x237 -x236 -x235 -x234 -x233 x232 -x231 -x230 -x229 -x228 -x227 -x226 -x139 -x348 -x582 -x241 -x637 -x636 -x635
2.19/2.26 v -x634 -x633 -x632 x631 -x630 -x629 -x628 -x627 -x626 -x501 -x66 -x649 -x648 -x647 -x646 -x645 -x644 -x643 -x642 -x641 -x640 -x639
2.19/2.26 v x638 x177 -x860 -x859 -x858 -x857 -x856 -x855 -x854 -x853 -x852 -x851 x850 -x849 -x848 -x394 -x873 -x872 -x871 x870 -x869
2.19/2.26 v -x868 -x867 -x866 -x865 -x864 -x863 -x862 -x861 -x345 -x661 -x660 -x659 -x658 -x657 -x656 -x655 x654 -x653 -x652 -x651 -x650
2.19/2.26 v -x403 -x795 -x794 -x793 -x792 -x791 -x790 -x789 -x788 -x787 x786 -x785 -x784 -x783 -x464 -x821 -x820 x819 -x818 -x817 -x816
2.19/2.26 v -x815 -x814 -x813 -x812 -x811 -x810 -x809 -x116 -x465 -x709 -x708 -x707 -x706 -x705 x704 -x703 -x702 -x701 -x700 -x699 -x698
2.19/2.26 v -x207 -x25 -x24 -x23 -x22 -x21 -x20 -x19 -x18 -x17 -x16 -x15 -x14 -x13 -x12 -x11 x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 -x1 -x899
2.19/2.26 v -x898 -x897 -x896 -x895 -x894 -x893 x892 -x891 -x890 -x889 -x888 -x887 -x297 x733 -x732 -x731 -x730 -x729 -x728 -x727 -x726
2.19/2.26 v -x725 -x724 -x723 -x722 -x559 -x423 -x215 -x721 x720 -x719 -x718 -x717 -x716 -x715 -x714 -x713 -x712 -x711 -x710 -x433 -x808
2.19/2.26 v -x807 -x806 -x805 -x804 -x803 -x802 -x801 x800 -x799 -x798 -x797 -x796 x290 -x912 -x911 -x910 -x909 -x908 -x907 -x906 -x905
2.19/2.26 v -x904 -x903 -x902 x901 -x900 -x73 -x175 -x174 -x173 -x172 -x171 x170 -x169 -x167 -x166 -x165 -x164 -x163 -x162 -x161 -x160 -x159
2.19/2.26 v -x158 -x157 -x156 -x155 -x154 -x153 -x152 -x151 x847 -x846 -x845 -x844 -x843 -x842 -x841 -x840 -x839 -x838 -x837 -x836 -x835
2.19/2.26 v -x168 -x938 -x937 -x936 -x935 x934 -x933 -x932 -x931 -x930 -x929 -x928 -x927 -x926 x275
2.19/2.26 c SCIP Status : problem is solved [optimal solution found]
2.19/2.26 c Total Time : 2.25
2.19/2.26 c solving : 2.25
2.19/2.26 c presolving : 0.03 (included in solving)
2.19/2.26 c reading : 0.01 (included in solving)
2.19/2.26 c Original Problem :
2.19/2.26 c Problem name : HOME/instance-3730314-1338688215.opb
2.19/2.26 c Variables : 938 (938 binary, 0 integer, 0 implicit integer, 0 continuous)
2.19/2.26 c Constraints : 700 initial, 700 maximal
2.19/2.26 c Presolved Problem :
2.19/2.26 c Problem name : t_HOME/instance-3730314-1338688215.opb
2.19/2.26 c Variables : 938 (938 binary, 0 integer, 0 implicit integer, 0 continuous)
2.19/2.26 c Constraints : 700 initial, 701 maximal
2.19/2.26 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
2.19/2.26 c trivial : 0.00 0 0 0 0 0 0 0 0 0
2.19/2.26 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
2.19/2.26 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
2.19/2.26 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
2.19/2.26 c pseudoobj : 0.00 0 0 0 0 0 0 0 0 0
2.19/2.26 c implics : 0.00 0 0 0 0 0 0 0 0 0
2.19/2.26 c probing : 0.00 0 0 0 0 0 0 0 0 0
2.19/2.26 c setppc : 0.00 0 0 0 0 0 0 0 0 0
2.19/2.26 c linear : 0.01 0 0 0 0 0 0 0 0 0
2.19/2.26 c logicor : 0.01 0 0 0 0 0 0 0 0 0
2.19/2.26 c root node : - 0 - - 0 - - - - -
2.19/2.26 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
2.19/2.26 c integral : 0 0 0 41 0 3 0 0 0 0 0 80
2.19/2.26 c setppc : 50 5 79 1 0 0 0 0 766 0 0 0
2.19/2.26 c linear : 0+ 5 30 0 0 0 0 0 0 0 0 0
2.19/2.26 c logicor : 650 5 23 1 0 0 0 0 0 0 0 0
2.19/2.26 c countsols : 0 0 0 1 0 2 0 0 0 0 0 0
2.19/2.26 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
2.19/2.26 c integral : 1.50 0.00 0.00 1.50 0.00 0.00 0.00
2.19/2.26 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
2.19/2.26 c linear : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
2.19/2.26 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
2.19/2.26 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
2.19/2.26 c Propagators : #Propagate #Resprop Cutoffs DomReds
2.19/2.26 c vbounds : 0 0 0 0
2.19/2.26 c rootredcost : 0 0 0 0
2.19/2.26 c pseudoobj : 0 0 0 0
2.19/2.26 c Propagator Timings : TotalTime Propagate Resprop
2.19/2.26 c vbounds : 0.00 0.00 0.00
2.19/2.26 c rootredcost : 0.00 0.00 0.00
2.19/2.26 c pseudoobj : 0.00 0.00 0.00
2.19/2.26 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.19/2.26 c propagation : 0.00 0 0 0 0.0 0 0.0 -
2.19/2.26 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
2.19/2.26 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.19/2.26 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.19/2.26 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.19/2.26 c applied globally : - - - 0 0.0 - - -
2.19/2.26 c applied locally : - - - 0 0.0 - - -
2.19/2.26 c Separators : Time Calls Cutoffs DomReds Cuts Conss
2.19/2.26 c cut pool : 0.00 4 - - 0 - (maximal pool size: 440)
2.19/2.26 c redcost : 0.00 45 0 0 0 0
2.19/2.26 c impliedbounds : 0.00 5 0 0 0 0
2.19/2.26 c intobj : 0.00 0 0 0 0 0
2.19/2.26 c gomory : 0.21 5 0 0 1847 0
2.19/2.26 c cgmip : 0.00 0 0 0 0 0
2.19/2.26 c closecuts : 0.00 0 0 0 0 0
2.19/2.26 c strongcg : 0.21 5 0 0 2500 0
2.19/2.26 c cmir : 0.00 0 0 0 0 0
2.19/2.26 c flowcover : 0.00 0 0 0 0 0
2.19/2.26 c clique : 0.00 5 0 0 0 0
2.19/2.26 c zerohalf : 0.00 0 0 0 0 0
2.19/2.26 c mcf : 0.00 1 0 0 0 0
2.19/2.26 c oddcycle : 0.00 0 0 0 0 0
2.19/2.26 c rapidlearning : 0.04 1 0 0 0 1
2.19/2.26 c Pricers : Time Calls Vars
2.19/2.26 c problem variables: 0.00 0 0
2.19/2.26 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
2.19/2.26 c relpscost : 1.50 40 0 0 0 0 80
2.19/2.26 c pscost : 0.00 0 0 0 0 0 0
2.19/2.26 c inference : 0.00 0 0 0 0 0 0
2.19/2.26 c mostinf : 0.00 0 0 0 0 0 0
2.19/2.26 c leastinf : 0.00 0 0 0 0 0 0
2.19/2.26 c fullstrong : 0.00 0 0 0 0 0 0
2.19/2.26 c allfullstrong : 0.00 0 0 0 0 0 0
2.19/2.26 c random : 0.00 0 0 0 0 0 0
2.19/2.26 c Primal Heuristics : Time Calls Found
2.19/2.26 c LP solutions : 0.00 - 1
2.19/2.26 c pseudo solutions : 0.00 - 0
2.19/2.26 c trivial : 0.00 1 0
2.19/2.26 c shiftandpropagate: 0.00 0 0
2.19/2.26 c simplerounding : 0.00 0 0
2.19/2.26 c zirounding : 0.00 0 0
2.19/2.26 c rounding : 0.00 0 0
2.19/2.26 c shifting : 0.00 0 0
2.19/2.26 c intshifting : 0.00 0 0
2.19/2.26 c oneopt : 0.00 0 0
2.19/2.26 c twoopt : 0.00 0 0
2.19/2.26 c fixandinfer : 0.00 0 0
2.19/2.26 c feaspump : 0.00 0 0
2.19/2.26 c clique : 0.00 0 0
2.19/2.26 c coefdiving : 0.00 0 0
2.19/2.26 c pscostdiving : 0.00 0 0
2.19/2.26 c fracdiving : 0.00 0 0
2.19/2.26 c veclendiving : 0.00 0 0
2.19/2.26 c intdiving : 0.00 0 0
2.19/2.26 c actconsdiving : 0.00 0 0
2.19/2.26 c objpscostdiving : 0.00 0 0
2.19/2.26 c rootsoldiving : 0.00 0 0
2.19/2.26 c linesearchdiving : 0.00 0 0
2.19/2.26 c guideddiving : 0.00 0 0
2.19/2.26 c octane : 0.00 0 0
2.19/2.26 c rens : 0.00 0 0
2.19/2.26 c rins : 0.00 0 0
2.19/2.26 c localbranching : 0.00 0 0
2.19/2.26 c mutation : 0.00 0 0
2.19/2.26 c crossover : 0.00 0 0
2.19/2.26 c dins : 0.00 0 0
2.19/2.26 c vbounds : 0.00 0 0
2.19/2.26 c undercover : 0.00 0 0
2.19/2.26 c subnlp : 0.00 0 0
2.19/2.26 c trysol : 0.00 0 0
2.19/2.26 c LP : Time Calls Iterations Iter/call Iter/sec
2.19/2.26 c primal LP : 0.00 0 0 0.00 -
2.19/2.26 c dual LP : 0.21 46 3167 68.85 14781.31
2.19/2.26 c lex dual LP : 0.00 0 0 0.00 -
2.19/2.26 c barrier LP : 0.00 0 0 0.00 -
2.19/2.26 c diving/probing LP: 0.00 0 0 0.00 -
2.19/2.26 c strong branching : 1.50 825 17230 20.88 11509.41
2.19/2.26 c (at root node) : - 16 731 45.69 -
2.19/2.26 c conflict analysis: 0.00 0 0 0.00 -
2.19/2.26 c B&B Tree :
2.19/2.26 c number of runs : 1
2.19/2.26 c nodes : 41
2.19/2.26 c nodes (total) : 41
2.19/2.26 c nodes left : 0
2.19/2.26 c max depth : 23
2.19/2.26 c max depth (total): 23
2.19/2.26 c backtracks : 2 (4.9%)
2.19/2.26 c delayed cutoffs : 0
2.19/2.26 c repropagations : 0 (0 domain reductions, 0 cutoffs)
2.19/2.26 c avg switch length: 2.05
2.19/2.26 c switching time : 0.00
2.19/2.26 c Solution :
2.19/2.26 c Solutions found : 1 (1 improvements)
2.19/2.26 c First Solution : +0.00000000000000e+00 (in run 1, after 41 nodes, 2.25 seconds, depth 23, found by <relaxation>)
2.19/2.26 c Primal Bound : +0.00000000000000e+00 (in run 1, after 41 nodes, 2.25 seconds, depth 23, found by <relaxation>)
2.19/2.26 c Dual Bound : +0.00000000000000e+00
2.19/2.26 c Gap : 0.00 %
2.19/2.26 c Root Dual Bound : +0.00000000000000e+00
2.19/2.26 c Root Iterations : 2538
2.19/2.26 c Time complete: 2.26.