0.19/0.20 c SCIP version 1.1.0.7
0.19/0.20 c LP-Solver Clp 1.8.2
0.19/0.20 c user parameter file <scip.set> not found - using default parameters
0.19/0.20 c read problem <HOME/instance-1884888-1245260573.opb>
0.19/0.20 c original problem has 621 variables (621 bin, 0 int, 0 impl, 0 cont) and 14927 constraints
0.19/0.24 c No objective function, only one solution is needed.
0.19/0.24 c start presolving problem
0.19/0.24 c presolving:
0.39/0.40 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 14927 upgd conss, 29808 impls, 0 clqs
0.39/0.43 c presolving (2 rounds):
0.39/0.43 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.39/0.43 c 29808 implications, 0 cliques
0.39/0.43 c presolved problem has 621 variables (621 bin, 0 int, 0 impl, 0 cont) and 14927 constraints
0.39/0.43 c 14927 constraints of type <logicor>
0.39/0.43 c transformed objective value is always integral (scale: 1)
0.39/0.43 c Presolving Time: 0.16
0.39/0.43 c PURESAT
0.39/0.43 c -----------------------------------------------------------------------------------------------
0.39/0.43 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.43 c separating/flowcover/freq = c -1
0.39/0.43 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.43 c separating/cmir/freq = c -1
0.39/0.43 c # additional number of allowed LP iterations
0.39/0.43 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.43 c heuristics/veclendiving/maxlpiterofs = c 1500
0.39/0.43 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.43 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.43 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.39/0.43 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.43 c heuristics/veclendiving/freq = c -1
0.39/0.43 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.43 c heuristics/simplerounding/freq = c -1
0.39/0.43 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.43 c heuristics/shifting/freq = c -1
0.39/0.43 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.43 c heuristics/rounding/freq = c -1
0.39/0.43 c # additional number of allowed LP iterations
0.39/0.43 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.43 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.39/0.43 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.43 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.39/0.43 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.39/0.43 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 20]
0.39/0.43 c heuristics/rootsoldiving/freq = c -1
0.39/0.43 c # number of nodes added to the contingent of the total nodes
0.39/0.43 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.39/0.43 c heuristics/rens/nodesofs = c 2000
0.39/0.43 c # minimum percentage of integer variables that have to be fixable
0.39/0.43 c # [type: real, range: [0,1], default: 0.5]
0.39/0.43 c heuristics/rens/minfixingrate = c 0.3
0.39/0.43 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.43 c heuristics/rens/freq = c -1
0.39/0.43 c # additional number of allowed LP iterations
0.39/0.43 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.43 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.39/0.43 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.43 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.43 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.39/0.43 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.43 c heuristics/pscostdiving/freq = c -1
0.39/0.43 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.43 c heuristics/oneopt/freq = c -1
0.39/0.43 c # additional number of allowed LP iterations
0.39/0.43 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.43 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.39/0.43 c # maximal fraction of diving LP iterations compared to total iteration number
0.39/0.43 c # [type: real, range: [0,1], default: 0.01]
0.39/0.43 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.39/0.43 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 20]
0.39/0.43 c heuristics/objpscostdiving/freq = c -1
0.39/0.43 c # additional number of allowed LP iterations
0.39/0.43 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.43 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.39/0.43 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.43 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.43 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.39/0.43 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.43 c heuristics/linesearchdiving/freq = c -1
0.39/0.43 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.43 c heuristics/intshifting/freq = c -1
0.39/0.43 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.43 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.43 c heuristics/intdiving/maxlpiterquot = c 0.075
0.39/0.43 c # additional number of allowed LP iterations
0.39/0.43 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.43 c heuristics/guideddiving/maxlpiterofs = c 1500
0.39/0.43 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.43 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.43 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.39/0.43 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.43 c heuristics/guideddiving/freq = c -1
0.39/0.43 c # additional number of allowed LP iterations
0.39/0.43 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.43 c heuristics/fracdiving/maxlpiterofs = c 1500
0.39/0.43 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.43 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.43 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.39/0.43 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.43 c heuristics/fracdiving/freq = c -1
0.39/0.43 c # additional number of allowed LP iterations
0.39/0.43 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.43 c heuristics/feaspump/maxlpiterofs = c 2000
0.39/0.43 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 20]
0.39/0.43 c heuristics/feaspump/freq = c -1
0.39/0.43 c # minimum percentage of integer variables that have to be fixed
0.39/0.43 c # [type: real, range: [0,1], default: 0.666]
0.39/0.43 c heuristics/crossover/minfixingrate = c 0.5
0.39/0.43 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.39/0.43 c # [type: real, range: [0,1], default: 0.1]
0.39/0.43 c heuristics/crossover/nodesquot = c 0.15
0.39/0.43 c # number of nodes without incumbent change that heuristic should wait
0.39/0.43 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.39/0.43 c heuristics/crossover/nwaitingnodes = c 100
0.39/0.43 c # number of nodes added to the contingent of the total nodes
0.39/0.43 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.39/0.43 c heuristics/crossover/nodesofs = c 750
0.39/0.43 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 30]
0.39/0.43 c heuristics/crossover/freq = c -1
0.39/0.43 c # additional number of allowed LP iterations
0.39/0.43 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.43 c heuristics/coefdiving/maxlpiterofs = c 1500
0.39/0.43 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.43 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.43 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.39/0.43 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.43 c heuristics/coefdiving/freq = c -1
0.39/0.43 c # priority of node selection rule <dfs> in standard mode
0.39/0.43 c # [type: int, range: [-536870912,536870911], default: 0]
0.39/0.43 c nodeselection/dfs/stdpriority = c 1000000
0.39/0.43 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.43 c presolving/probing/maxrounds = c 0
0.39/0.43 c # should presolving try to simplify knapsacks
0.39/0.43 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.39/0.43 c constraints/knapsack/simplifyinequalities = c TRUE
0.39/0.43 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.39/0.43 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.39/0.43 c constraints/knapsack/disaggregation = c FALSE
0.39/0.43 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.43 c constraints/knapsack/maxnumcardlift = c 0
0.39/0.43 c # should presolving try to simplify inequalities
0.39/0.43 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.39/0.43 c constraints/linear/simplifyinequalities = c TRUE
0.39/0.43 c # maximal number of separation rounds in the root node (-1: unlimited)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.43 c separating/maxroundsroot = c 5
0.39/0.43 c # maximal number of separation rounds per node (-1: unlimited)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 5]
0.39/0.43 c separating/maxrounds = c 1
0.39/0.43 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.39/0.43 c # [type: char, range: {lafpsqd}, default: l]
0.39/0.43 c lp/pricing = c a
0.39/0.43 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.43 c lp/solvefreq = c 0
0.39/0.43 c # solving stops, if the given number of solutions were found (-1: no limit)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.43 c limits/solutions = c 1
0.39/0.43 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.39/0.43 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.39/0.43 c limits/memory = c 1620
0.39/0.43 c # maximal time in seconds to run
0.39/0.43 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.39/0.43 c limits/time = c 1791
0.39/0.43 c # frequency for displaying node information lines
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 100]
0.39/0.43 c display/freq = c 10000
0.39/0.43 c # should enforcement of pseudo solution be disabled?
0.39/0.43 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.39/0.43 c constraints/disableenfops = c TRUE
0.39/0.43 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.43 c constraints/agelimit = c 1
0.39/0.43 c # should binary conflicts be preferred?
0.39/0.43 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.39/0.43 c conflict/preferbinary = c TRUE
0.39/0.43 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.43 c conflict/interconss = c 0
0.39/0.43 c -----------------------------------------------------------------------------------------------
0.39/0.43 c start solving problem
0.39/0.43 c
0.49/0.52 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.49/0.52 c 0.3s| 1 | 0 | 46 | 18M| 0 | 46 | 621 | 14k| 14k| 621 | 14k| 0 | 0 | 0 | 2.300000e+01 | -- | Inf
0.79/0.89 c 0.6s| 1 | 0 | 186 | 18M| 0 | 42 | 621 | 14k| 14k| 621 | 14k| 3 | 0 | 0 | 2.300000e+01 | -- | Inf
1.19/1.29 c 1.0s| 1 | 0 | 356 | 18M| 0 | 36 | 621 | 14k| 14k| 621 | 14k| 9 | 0 | 0 | 2.300000e+01 | -- | Inf
1.79/1.83 c 1.6s| 1 | 0 | 662 | 18M| 0 | 28 | 621 | 14k| 14k| 621 | 14k| 16 | 0 | 0 | 2.300000e+01 | -- | Inf
2.29/2.31 c 2.0s| 1 | 0 | 842 | 18M| 0 | 16 | 621 | 14k| 14k| 621 | 14k| 26 | 0 | 0 | 2.300000e+01 | -- | Inf
2.89/2.95 c 2.6s| 1 | 0 | 922 | 18M| 0 | 0 | 621 | 14k| 14k| 621 | 14k| 33 | 0 | 0 | 2.300000e+01 | -- | Inf
2.89/2.95 c * 2.6s| 1 | 0 | 922 | 18M| 0 | - | 621 | 14k| 14k| 621 | 14k| 33 | 0 | 0 | 2.300000e+01 | 2.300000e+01 | 0.00%
2.89/2.95 c
2.89/2.95 c SCIP Status : problem is solved [optimal solution found]
2.89/2.95 c Solving Time (sec) : 2.65
2.89/2.95 c Solving Nodes : 1
2.89/2.95 c Primal Bound : +2.30000000000000e+01 (1 solutions)
2.89/2.95 c Dual Bound : +2.30000000000000e+01
2.89/2.95 c Gap : 0.00 %
2.89/2.96 c NODE 1
2.89/2.96 c DUAL BOUND 23
2.89/2.96 c PRIMAL BOUND 23
2.89/2.96 c GAP 0
2.89/2.96 s SATISFIABLE
2.89/2.96 v -x621 -x620 -x619 -x618 -x617 -x616 -x615 -x614 -x613 -x612 -x611 -x610 -x609 -x608 -x607 -x606 -x605 -x604 -x603 -x602 -x601 x600
2.89/2.96 v -x599 -x598 -x597 -x596 -x595 -x594 -x593 -x592 -x591 -x590 -x589 -x588 -x587 -x586 -x585 -x584 -x583 -x582 -x581 -x580 -x579
2.89/2.96 v -x578 -x577 -x576 -x575 -x574 -x573 -x572 -x571 -x570 x569 -x568 -x567 -x566 -x565 -x564 -x563 -x562 -x561 -x560 -x559 -x558
2.89/2.96 v -x557 -x556 -x555 -x554 -x553 -x552 -x551 -x550 -x549 -x548 -x547 -x546 x545 -x544 -x543 -x542 -x541 -x540 -x539 -x538 -x537
2.89/2.96 v -x536 x535 -x534 -x533 -x532 -x531 -x530 -x529 -x528 -x527 -x526 -x525 -x524 -x523 -x522 -x521 -x520 -x519 -x518 -x517 -x516
2.89/2.96 v -x515 -x514 -x513 -x512 -x511 -x510 -x509 -x508 -x507 -x506 -x505 -x504 -x503 -x502 -x501 -x500 -x499 -x498 x497 -x496 -x495
2.89/2.96 v -x494 -x493 -x492 -x491 -x490 -x489 -x488 -x487 -x486 -x485 -x484 -x483 -x482 -x481 -x480 -x479 -x478 -x477 -x476 -x475
2.89/2.96 v -x474 -x473 -x472 -x471 -x470 -x469 x468 -x467 -x466 -x465 -x464 -x463 -x462 -x461 -x460 -x459 -x458 -x457 -x456 -x455 -x454
2.89/2.96 v -x453 -x452 -x451 -x450 -x449 -x448 -x447 -x446 -x445 -x444 -x443 -x442 -x441 -x440 -x439 -x438 -x437 -x436 x435 -x434 -x433
2.89/2.96 v -x432 -x431 -x430 -x429 -x428 -x427 -x426 -x425 -x424 -x423 -x422 -x421 -x420 -x419 -x418 -x417 -x416 -x415 -x414 -x413 -x412
2.89/2.96 v -x411 -x410 x409 -x408 -x407 -x406 -x405 -x404 -x403 x402 -x401 -x400 -x399 -x398 -x397 -x396 -x395 -x394 -x393 -x392 -x391
2.89/2.96 v -x390 -x389 -x388 -x387 -x386 -x385 -x384 -x383 -x382 -x381 -x380 -x379 -x378 -x377 -x376 -x375 -x374 -x373 -x372 -x371 -x370
2.89/2.96 v x369 -x368 -x367 -x366 -x365 -x364 -x363 -x362 -x361 -x360 -x359 -x358 -x357 -x356 -x355 -x354 -x353 -x352 -x351 -x350 -x349
2.89/2.96 v -x348 -x347 -x346 -x345 -x344 -x343 -x342 -x341 -x340 -x339 -x338 -x337 -x336 -x335 x334 -x333 -x332 -x331 -x330 -x329 -x328
2.89/2.96 v -x327 -x326 -x325 -x324 -x323 -x322 -x321 x320 -x319 -x318 -x317 -x316 -x315 -x314 -x313 -x312 -x311 -x310 -x309 -x308 -x307
2.89/2.96 v -x306 -x305 -x304 -x303 -x302 -x301 -x300 -x299 -x298 -x297 -x296 -x295 -x294 -x293 -x292 -x291 -x290 -x289 -x288 -x287 -x286
2.89/2.96 v -x285 -x284 -x283 -x282 -x281 -x280 -x279 -x278 -x277 -x276 -x275 -x274 -x273 -x272 x271 -x270 -x269 -x268 -x267 -x266 -x265
2.89/2.96 v x264 -x263 -x262 -x261 -x260 -x259 -x258 -x257 -x256 -x255 -x254 -x253 -x252 -x251 -x250 -x249 -x248 -x247 -x246 -x245 -x244
2.89/2.96 v -x243 -x242 -x241 -x240 -x239 -x238 -x237 -x236 -x235 -x234 x233 -x232 -x231 -x230 -x229 -x228 -x227 -x226 -x225 -x224 -x223
2.89/2.96 v -x222 -x221 -x220 -x219 -x218 -x217 x216 -x215 -x214 -x213 -x212 -x211 -x210 -x209 -x208 -x207 -x206 -x205 -x204 -x203 -x202
2.89/2.96 v -x201 -x200 -x199 -x198 -x197 -x196 -x195 -x194 -x193 -x192 -x191 -x190 -x189 -x188 -x187 -x186 -x185 -x184 -x183 -x182 -x181
2.89/2.96 v -x180 -x179 x178 -x177 -x176 -x175 -x174 -x173 -x172 -x171 -x170 -x169 -x168 -x167 -x166 -x165 -x164 -x163 -x162 -x161 x160
2.89/2.96 v -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 -x151 -x150 -x149 -x148 -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139
2.89/2.96 v -x138 -x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127 -x126 -x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118
2.89/2.96 v -x117 -x116 x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 x107 -x106 -x105 -x104 -x103 -x102 -x101 -x100 -x99 -x98 -x97
2.89/2.96 v -x96 -x95 -x94 -x93 -x92 -x91 -x90 -x89 -x88 -x87 -x86 -x85 -x84 -x83 -x82 -x81 -x80 -x79 -x78 -x77 -x76 -x75 -x74 x73 -x72 -x71
2.89/2.96 v -x70 -x69 -x68 -x67 -x66 -x65 -x64 -x63 -x62 -x61 -x60 -x59 -x58 -x57 -x56 -x55 -x54 -x53 -x52 -x51 -x50 -x49 -x48 -x47 -x46
2.89/2.96 v -x45 -x44 -x43 -x42 -x41 -x40 -x39 -x38 -x37 -x36 x35 -x34 -x33 -x32 -x31 -x30 -x29 -x28 -x27 -x26 -x25 -x24 -x23 -x22 -x21
2.89/2.96 v x20 -x19 -x18 -x17 -x16 -x15 -x14 -x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 -x1
2.89/2.96 c SCIP Status : problem is solved [optimal solution found]
2.89/2.96 c Solving Time : 2.65
2.89/2.96 c Original Problem :
2.89/2.96 c Problem name : HOME/instance-1884888-1245260573.opb
2.89/2.96 c Variables : 621 (621 binary, 0 integer, 0 implicit integer, 0 continuous)
2.89/2.96 c Constraints : 14927 initial, 14927 maximal
2.89/2.96 c Presolved Problem :
2.89/2.96 c Problem name : t_HOME/instance-1884888-1245260573.opb
2.89/2.96 c Variables : 621 (621 binary, 0 integer, 0 implicit integer, 0 continuous)
2.89/2.96 c Constraints : 14927 initial, 14927 maximal
2.89/2.96 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
2.89/2.96 c trivial : 0.00 0 0 0 0 0 0 0 0
2.89/2.96 c dualfix : 0.00 0 0 0 0 0 0 0 0
2.89/2.96 c boundshift : 0.00 0 0 0 0 0 0 0 0
2.89/2.96 c inttobinary : 0.00 0 0 0 0 0 0 0 0
2.89/2.96 c implics : 0.00 0 0 0 0 0 0 0 0
2.89/2.96 c probing : 0.00 0 0 0 0 0 0 0 0
2.89/2.96 c logicor : 0.05 0 0 0 0 0 0 0 0
2.89/2.96 c root node : - 0 - - 0 - - - -
2.89/2.96 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
2.89/2.96 c integral : 0 0 0 1 0 0 0 0 0 0
2.89/2.96 c logicor : 14927 5 1 1 0 0 0 0 0 0
2.89/2.96 c countsols : 0 0 0 1 0 0 0 0 0 0
2.89/2.96 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
2.89/2.96 c integral : 0.00 0.00 0.00 0.00 0.00
2.89/2.96 c logicor : 0.02 0.01 0.01 0.00 0.00
2.89/2.96 c countsols : 0.00 0.00 0.00 0.00 0.00
2.89/2.96 c Propagators : Time Calls Cutoffs DomReds
2.89/2.96 c rootredcost : 0.00 0 0 0
2.89/2.96 c pseudoobj : 0.00 2 0 0
2.89/2.96 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.89/2.96 c propagation : 0.00 0 0 0 0.0 0 0.0 -
2.89/2.96 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
2.89/2.96 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.89/2.96 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.89/2.96 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.89/2.96 c applied globally : - - - 0 0.0 - - -
2.89/2.96 c applied locally : - - - 0 0.0 - - -
2.89/2.96 c Separators : Time Calls Cutoffs DomReds Cuts Conss
2.89/2.96 c cut pool : 0.00 4 - - 0 - (maximal pool size: 170)
2.89/2.96 c redcost : 0.00 5 0 0 0 0
2.89/2.96 c impliedbounds : 0.00 5 0 0 0 0
2.89/2.96 c intobj : 0.00 0 0 0 0 0
2.89/2.96 c gomory : 0.85 5 0 0 2234 0
2.89/2.96 c strongcg : 0.76 5 0 0 2500 0
2.89/2.96 c cmir : 0.00 0 0 0 0 0
2.89/2.96 c flowcover : 0.00 0 0 0 0 0
2.89/2.96 c clique : 0.03 5 0 0 17 0
2.89/2.96 c zerohalf : 0.00 0 0 0 0 0
2.89/2.96 c mcf : 0.01 1 0 0 0 0
2.89/2.96 c Pricers : Time Calls Vars
2.89/2.96 c problem variables: 0.00 0 0
2.89/2.96 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
2.89/2.96 c pscost : 0.00 0 0 0 0 0 0
2.89/2.96 c inference : 0.00 0 0 0 0 0 0
2.89/2.96 c mostinf : 0.00 0 0 0 0 0 0
2.89/2.96 c leastinf : 0.00 0 0 0 0 0 0
2.89/2.96 c fullstrong : 0.00 0 0 0 0 0 0
2.89/2.96 c allfullstrong : 0.00 0 0 0 0 0 0
2.89/2.96 c random : 0.00 0 0 0 0 0 0
2.89/2.96 c relpscost : 0.00 0 0 0 0 0 0
2.89/2.96 c Primal Heuristics : Time Calls Found
2.89/2.96 c LP solutions : 0.00 - 1
2.89/2.96 c pseudo solutions : 0.00 - 0
2.89/2.96 c simplerounding : 0.00 0 0
2.89/2.96 c rounding : 0.00 0 0
2.89/2.96 c shifting : 0.00 0 0
2.89/2.96 c intshifting : 0.00 0 0
2.89/2.96 c oneopt : 0.00 0 0
2.89/2.96 c fixandinfer : 0.00 0 0
2.89/2.96 c feaspump : 0.00 0 0
2.89/2.96 c coefdiving : 0.00 0 0
2.89/2.96 c pscostdiving : 0.00 0 0
2.89/2.96 c fracdiving : 0.00 0 0
2.89/2.96 c veclendiving : 0.00 0 0
2.89/2.96 c intdiving : 0.00 0 0
2.89/2.96 c actconsdiving : 0.00 0 0
2.89/2.96 c objpscostdiving : 0.00 0 0
2.89/2.96 c rootsoldiving : 0.00 0 0
2.89/2.96 c linesearchdiving : 0.00 0 0
2.89/2.96 c guideddiving : 0.00 0 0
2.89/2.96 c octane : 0.00 0 0
2.89/2.96 c rens : 0.00 0 0
2.89/2.96 c rins : 0.00 0 0
2.89/2.96 c localbranching : 0.00 0 0
2.89/2.96 c mutation : 0.00 0 0
2.89/2.96 c crossover : 0.00 0 0
2.89/2.96 c dins : 0.00 0 0
2.89/2.96 c LP : Time Calls Iterations Iter/call Iter/sec
2.89/2.96 c primal LP : 0.00 0 0 0.00 -
2.89/2.96 c dual LP : 0.71 6 922 153.67 1298.59
2.89/2.96 c barrier LP : 0.00 0 0 0.00 -
2.89/2.96 c diving/probing LP: 0.00 0 0 0.00 -
2.89/2.96 c strong branching : 0.00 0 0 0.00 -
2.89/2.96 c (at root node) : - 0 0 0.00 -
2.89/2.96 c conflict analysis: 0.00 0 0 0.00 -
2.89/2.96 c B&B Tree :
2.89/2.96 c number of runs : 1
2.89/2.96 c nodes : 1
2.89/2.96 c nodes (total) : 1
2.89/2.96 c nodes left : 0
2.89/2.96 c max depth : 0
2.89/2.96 c max depth (total): 0
2.89/2.96 c backtracks : 0 (0.0%)
2.89/2.96 c delayed cutoffs : 0
2.89/2.96 c repropagations : 0 (0 domain reductions, 0 cutoffs)
2.89/2.96 c avg switch length: 2.00
2.89/2.96 c switching time : 0.00
2.89/2.96 c Solution :
2.89/2.96 c Solutions found : 1 (1 improvements)
2.89/2.96 c Primal Bound : +2.30000000000000e+01 (in run 1, after 1 nodes, 2.65 seconds, depth 0, found by <relaxation>)
2.89/2.96 c Dual Bound : +2.30000000000000e+01
2.89/2.96 c Gap : 0.00 %
2.89/2.96 c Root Dual Bound : +2.30000000000000e+01
2.99/3.02 c Time complete: 3.01.