0.19/0.29 c SCIP version 1.1.0.7
0.19/0.29 c LP-Solver SoPlex 1.4.1
0.19/0.29 c user parameter file <scip.set> not found - using default parameters
0.19/0.29 c read problem <HOME/instance-1884927-1245260671.opb>
0.19/0.29 c original problem has 840 variables (840 bin, 0 int, 0 impl, 0 cont) and 23548 constraints
0.29/0.34 c No objective function, only one solution is needed.
0.29/0.34 c start presolving problem
0.29/0.34 c presolving:
0.49/0.58 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 23548 upgd conss, 47040 impls, 0 clqs
0.59/0.62 c presolving (2 rounds):
0.59/0.62 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.59/0.62 c 47040 implications, 0 cliques
0.59/0.62 c presolved problem has 840 variables (840 bin, 0 int, 0 impl, 0 cont) and 23548 constraints
0.59/0.62 c 23548 constraints of type <logicor>
0.59/0.62 c transformed objective value is always integral (scale: 1)
0.59/0.62 c Presolving Time: 0.21
0.59/0.62 c PURESAT
0.59/0.62 c -----------------------------------------------------------------------------------------------
0.59/0.62 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.59/0.62 c # [type: int, range: [-1,2147483647], default: 0]
0.59/0.62 c separating/flowcover/freq = c -1
0.59/0.62 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.59/0.62 c # [type: int, range: [-1,2147483647], default: 0]
0.59/0.62 c separating/cmir/freq = c -1
0.59/0.62 c # additional number of allowed LP iterations
0.59/0.62 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.62 c heuristics/veclendiving/maxlpiterofs = c 1500
0.59/0.62 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.62 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.59/0.62 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.59/0.62 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.59/0.62 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.62 c heuristics/veclendiving/freq = c -1
0.59/0.62 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.59/0.62 c # [type: int, range: [-1,2147483647], default: 1]
0.59/0.62 c heuristics/simplerounding/freq = c -1
0.59/0.62 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.59/0.62 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.62 c heuristics/shifting/freq = c -1
0.59/0.62 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.59/0.62 c # [type: int, range: [-1,2147483647], default: 1]
0.59/0.62 c heuristics/rounding/freq = c -1
0.59/0.62 c # additional number of allowed LP iterations
0.59/0.62 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.62 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.59/0.62 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.62 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.59/0.62 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.59/0.62 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.59/0.62 c # [type: int, range: [-1,2147483647], default: 20]
0.59/0.62 c heuristics/rootsoldiving/freq = c -1
0.59/0.62 c # number of nodes added to the contingent of the total nodes
0.59/0.62 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.59/0.62 c heuristics/rens/nodesofs = c 2000
0.59/0.62 c # minimum percentage of integer variables that have to be fixable
0.59/0.62 c # [type: real, range: [0,1], default: 0.5]
0.59/0.62 c heuristics/rens/minfixingrate = c 0.3
0.59/0.62 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.59/0.62 c # [type: int, range: [-1,2147483647], default: 0]
0.59/0.62 c heuristics/rens/freq = c -1
0.59/0.62 c # additional number of allowed LP iterations
0.59/0.62 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.62 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.59/0.62 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.62 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.59/0.62 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.59/0.62 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.59/0.62 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.62 c heuristics/pscostdiving/freq = c -1
0.59/0.62 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.59/0.62 c # [type: int, range: [-1,2147483647], default: 1]
0.59/0.62 c heuristics/oneopt/freq = c -1
0.59/0.62 c # additional number of allowed LP iterations
0.59/0.62 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.62 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.59/0.62 c # maximal fraction of diving LP iterations compared to total iteration number
0.59/0.62 c # [type: real, range: [0,1], default: 0.01]
0.59/0.62 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.59/0.62 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.59/0.62 c # [type: int, range: [-1,2147483647], default: 20]
0.59/0.62 c heuristics/objpscostdiving/freq = c -1
0.59/0.62 c # additional number of allowed LP iterations
0.59/0.62 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.62 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.59/0.62 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.62 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.59/0.62 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.59/0.62 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.59/0.62 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.62 c heuristics/linesearchdiving/freq = c -1
0.59/0.62 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.59/0.62 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.62 c heuristics/intshifting/freq = c -1
0.59/0.62 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.62 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.59/0.62 c heuristics/intdiving/maxlpiterquot = c 0.075
0.59/0.62 c # additional number of allowed LP iterations
0.59/0.62 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.62 c heuristics/guideddiving/maxlpiterofs = c 1500
0.59/0.62 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.62 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.59/0.62 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.59/0.62 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.59/0.62 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.62 c heuristics/guideddiving/freq = c -1
0.59/0.62 c # additional number of allowed LP iterations
0.59/0.62 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.62 c heuristics/fracdiving/maxlpiterofs = c 1500
0.59/0.62 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.62 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.59/0.62 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.59/0.62 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.59/0.62 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.62 c heuristics/fracdiving/freq = c -1
0.59/0.62 c # additional number of allowed LP iterations
0.59/0.62 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.62 c heuristics/feaspump/maxlpiterofs = c 2000
0.59/0.62 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.59/0.62 c # [type: int, range: [-1,2147483647], default: 20]
0.59/0.62 c heuristics/feaspump/freq = c -1
0.59/0.62 c # minimum percentage of integer variables that have to be fixed
0.59/0.62 c # [type: real, range: [0,1], default: 0.666]
0.59/0.62 c heuristics/crossover/minfixingrate = c 0.5
0.59/0.62 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.59/0.62 c # [type: real, range: [0,1], default: 0.1]
0.59/0.62 c heuristics/crossover/nodesquot = c 0.15
0.59/0.62 c # number of nodes without incumbent change that heuristic should wait
0.59/0.62 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.59/0.62 c heuristics/crossover/nwaitingnodes = c 100
0.59/0.62 c # number of nodes added to the contingent of the total nodes
0.59/0.62 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.59/0.62 c heuristics/crossover/nodesofs = c 750
0.59/0.62 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.59/0.62 c # [type: int, range: [-1,2147483647], default: 30]
0.59/0.62 c heuristics/crossover/freq = c -1
0.59/0.62 c # additional number of allowed LP iterations
0.59/0.62 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.62 c heuristics/coefdiving/maxlpiterofs = c 1500
0.59/0.62 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.62 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.59/0.62 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.59/0.62 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.59/0.62 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.62 c heuristics/coefdiving/freq = c -1
0.59/0.62 c # priority of node selection rule <dfs> in standard mode
0.59/0.62 c # [type: int, range: [-536870912,536870911], default: 0]
0.59/0.62 c nodeselection/dfs/stdpriority = c 1000000
0.59/0.62 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.59/0.62 c # [type: int, range: [-1,2147483647], default: -1]
0.59/0.62 c presolving/probing/maxrounds = c 0
0.59/0.62 c # should presolving try to simplify knapsacks
0.59/0.62 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.59/0.62 c constraints/knapsack/simplifyinequalities = c TRUE
0.59/0.62 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.59/0.62 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.59/0.62 c constraints/knapsack/disaggregation = c FALSE
0.59/0.62 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.59/0.62 c # [type: int, range: [-1,2147483647], default: -1]
0.59/0.62 c constraints/knapsack/maxnumcardlift = c 0
0.59/0.62 c # should presolving try to simplify inequalities
0.59/0.62 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.59/0.62 c constraints/linear/simplifyinequalities = c TRUE
0.59/0.62 c # maximal number of separation rounds in the root node (-1: unlimited)
0.59/0.62 c # [type: int, range: [-1,2147483647], default: -1]
0.59/0.62 c separating/maxroundsroot = c 5
0.59/0.62 c # maximal number of separation rounds per node (-1: unlimited)
0.59/0.62 c # [type: int, range: [-1,2147483647], default: 5]
0.59/0.62 c separating/maxrounds = c 1
0.59/0.62 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.59/0.62 c # [type: char, range: {lafpsqd}, default: l]
0.59/0.62 c lp/pricing = c a
0.59/0.62 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.59/0.62 c # [type: int, range: [-1,2147483647], default: 1]
0.59/0.62 c lp/solvefreq = c 0
0.59/0.62 c # solving stops, if the given number of solutions were found (-1: no limit)
0.59/0.62 c # [type: int, range: [-1,2147483647], default: -1]
0.59/0.62 c limits/solutions = c 1
0.59/0.62 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.59/0.62 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.59/0.62 c limits/memory = c 1620
0.59/0.62 c # maximal time in seconds to run
0.59/0.62 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.59/0.62 c limits/time = c 1791
0.59/0.62 c # frequency for displaying node information lines
0.59/0.62 c # [type: int, range: [-1,2147483647], default: 100]
0.59/0.62 c display/freq = c 10000
0.59/0.62 c # should enforcement of pseudo solution be disabled?
0.59/0.62 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.59/0.62 c constraints/disableenfops = c TRUE
0.59/0.62 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.59/0.62 c # [type: int, range: [-1,2147483647], default: 0]
0.59/0.62 c constraints/agelimit = c 1
0.59/0.62 c # should binary conflicts be preferred?
0.59/0.62 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.59/0.62 c conflict/preferbinary = c TRUE
0.59/0.62 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.59/0.62 c # [type: int, range: [-1,2147483647], default: -1]
0.59/0.62 c conflict/interconss = c 0
0.59/0.62 c -----------------------------------------------------------------------------------------------
0.59/0.62 c start solving problem
0.59/0.62 c
0.69/0.78 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.69/0.78 c 0.4s| 1 | 0 | 56 | 27M| 0 | 56 | 840 | 23k| 23k| 840 | 23k| 0 | 0 | 0 | 2.800000e+01 | -- | Inf
1.49/1.58 c 1.2s| 1 | 0 | 241 | 27M| 0 | 48 | 840 | 23k| 23k| 840 | 23k| 3 | 0 | 0 | 2.800000e+01 | -- | Inf
2.30/2.32 c 1.9s| 1 | 0 | 398 | 27M| 0 | 34 | 840 | 23k| 23k| 840 | 23k| 10 | 0 | 0 | 2.800000e+01 | -- | Inf
2.88/2.95 c 2.5s| 1 | 0 | 481 | 27M| 0 | 28 | 840 | 23k| 23k| 840 | 23k| 17 | 0 | 0 | 2.800000e+01 | -- | Inf
3.79/3.82 c 3.4s| 1 | 0 | 524 | 27M| 0 | 22 | 840 | 23k| 23k| 840 | 23k| 23 | 0 | 0 | 2.800000e+01 | -- | Inf
4.79/4.89 c 4.4s| 1 | 0 | 626 | 28M| 0 | 18 | 840 | 23k| 23k| 840 | 23k| 29 | 0 | 0 | 2.800000e+01 | -- | Inf
7.09/7.12 c 6.7s| 1 | 2 | 626 | 28M| 0 | 18 | 840 | 23k| 23k| 840 | 23k| 29 | 0 | 18 | 2.800000e+01 | -- | Inf
7.19/7.21 c * 6.7s| 535 | 0 | 626 | 28M| 533 | - | 840 | 23k| 21k| 0 | 0 | 29 | 1 | 18 | 2.800000e+01 | 2.800000e+01 | 0.00%
7.19/7.22 c
7.19/7.22 c SCIP Status : problem is solved [optimal solution found]
7.19/7.22 c Solving Time (sec) : 6.75
7.19/7.22 c Solving Nodes : 535
7.19/7.22 c Primal Bound : +2.80000000000000e+01 (1 solutions)
7.19/7.22 c Dual Bound : +2.80000000000000e+01
7.19/7.22 c Gap : 0.00 %
7.19/7.23 c NODE 535
7.19/7.23 c DUAL BOUND 28
7.19/7.23 c PRIMAL BOUND 28
7.19/7.23 c GAP 0
7.19/7.23 s SATISFIABLE
7.19/7.23 v -x840 -x839 -x838 -x837 -x836 -x835 -x834 -x833 -x832 x831 -x830 -x829 -x828 -x827 -x826 -x825 -x824 -x823 -x822 -x821 -x820 -x819
7.19/7.23 v -x818 -x817 -x816 -x815 -x814 -x813 -x812 -x811 -x810 -x809 -x808 x807 -x806 -x805 -x804 -x803 -x802 -x801 -x800 -x799 -x798
7.19/7.23 v -x797 -x796 -x795 -x794 -x793 -x792 -x791 -x790 -x789 -x788 -x787 -x786 -x785 -x784 -x783 -x782 -x781 -x780 -x779 -x778 -x777
7.19/7.23 v -x776 -x775 -x774 -x773 -x772 -x771 -x770 -x769 -x768 -x767 -x766 -x765 -x764 -x763 -x762 -x761 -x760 -x759 -x758 -x757
7.19/7.23 v -x756 -x755 -x754 -x753 -x752 x751 -x750 -x749 -x748 -x747 -x746 -x745 -x744 -x743 -x742 -x741 -x740 -x739 x738 -x737 -x736 -x735
7.19/7.23 v -x734 -x733 -x732 -x731 -x730 -x729 -x728 -x727 -x726 -x725 -x724 -x723 -x722 -x721 -x720 -x719 -x718 -x717 -x716 -x715
7.19/7.23 v -x714 -x713 -x712 -x711 -x710 -x709 -x708 -x707 -x706 -x705 -x704 -x703 -x702 -x701 -x700 -x699 -x698 -x697 -x696 -x695 -x694
7.19/7.23 v -x693 x692 -x691 x690 -x689 -x688 -x687 -x686 -x685 -x684 -x683 -x682 -x681 -x680 -x679 -x678 -x677 -x676 -x675 -x674 -x673
7.19/7.23 v -x672 -x671 -x670 -x669 -x668 -x667 -x666 -x665 -x664 -x663 -x662 -x661 -x660 -x659 -x658 -x657 -x656 -x655 -x654 -x653 -x652
7.19/7.23 v -x651 -x650 -x649 -x648 -x647 -x646 -x645 -x644 -x643 -x642 -x641 -x640 -x639 -x638 -x637 -x636 -x635 -x634 x633 -x632 -x631
7.19/7.23 v -x630 -x629 -x628 -x627 -x626 -x625 -x624 -x623 x622 -x621 -x620 -x619 -x618 -x617 -x616 -x615 -x614 -x613 -x612 -x611 -x610
7.19/7.23 v -x609 -x608 -x607 -x606 -x605 -x604 -x603 -x602 -x601 -x600 -x599 -x598 -x597 -x596 -x595 -x594 -x593 -x592 -x591 -x590 -x589
7.19/7.23 v -x588 -x587 -x586 -x585 -x584 -x583 -x582 -x581 -x580 -x579 -x578 -x577 -x576 -x575 x574 -x573 -x572 -x571 -x570 -x569 -x568
7.19/7.23 v -x567 -x566 -x565 -x564 -x563 -x562 -x561 -x560 -x559 -x558 x557 -x556 -x555 -x554 -x553 -x552 -x551 -x550 -x549 -x548 -x547
7.19/7.23 v -x546 -x545 -x544 -x543 -x542 -x541 -x540 -x539 -x538 -x537 -x536 -x535 -x534 -x533 -x532 -x531 -x530 -x529 -x528 -x527 -x526
7.19/7.23 v -x525 -x524 -x523 -x522 -x521 -x520 -x519 -x518 -x517 -x516 x515 -x514 -x513 -x512 -x511 -x510 -x509 -x508 -x507 -x506 -x505
7.19/7.23 v -x504 -x503 -x502 -x501 x500 -x499 -x498 -x497 -x496 -x495 -x494 -x493 -x492 -x491 -x490 -x489 -x488 -x487 -x486 -x485 -x484
7.19/7.23 v -x483 -x482 -x481 -x480 -x479 -x478 -x477 -x476 -x475 -x474 -x473 -x472 -x471 -x470 -x469 -x468 -x467 -x466 -x465 -x464 -x463
7.19/7.23 v -x462 -x461 -x460 -x459 -x458 -x457 x456 -x455 -x454 -x453 -x452 -x451 -x450 -x449 -x448 -x447 -x446 -x445 -x444 x443 -x442
7.19/7.23 v -x441 -x440 -x439 -x438 -x437 -x436 -x435 -x434 -x433 -x432 -x431 -x430 -x429 -x428 -x427 -x426 -x425 -x424 -x423 -x422 -x421
7.19/7.23 v -x420 -x419 -x418 -x417 -x416 -x415 -x414 -x413 -x412 -x411 -x410 -x409 -x408 -x407 -x406 -x405 -x404 -x403 -x402 -x401 -x400
7.19/7.23 v -x399 -x398 x397 -x396 -x395 -x394 -x393 -x392 -x391 -x390 -x389 -x388 -x387 x386 -x385 -x384 -x383 -x382 -x381 -x380 -x379
7.19/7.23 v -x378 -x377 -x376 -x375 -x374 -x373 -x372 -x371 -x370 -x369 -x368 -x367 -x366 -x365 -x364 -x363 -x362 -x361 -x360 -x359 -x358
7.19/7.23 v -x357 -x356 -x355 -x354 -x353 -x352 -x351 -x350 -x349 -x348 -x347 -x346 -x345 -x344 -x343 -x342 -x341 -x340 -x339 x338 -x337
7.19/7.23 v -x336 -x335 -x334 -x333 -x332 -x331 -x330 -x329 x328 -x327 -x326 -x325 -x324 -x323 -x322 -x321 -x320 -x319 -x318 -x317 -x316
7.19/7.23 v -x315 -x314 -x313 -x312 -x311 -x310 -x309 -x308 -x307 -x306 -x305 -x304 -x303 -x302 -x301 -x300 -x299 -x298 -x297 -x296
7.19/7.23 v -x295 -x294 -x293 -x292 -x291 -x290 -x289 -x288 -x287 -x286 -x285 -x284 -x283 -x282 -x281 x280 -x279 -x278 -x277 -x276 -x275
7.19/7.23 v -x274 -x273 -x272 -x271 -x270 x269 -x268 -x267 -x266 -x265 -x264 -x263 -x262 -x261 -x260 -x259 -x258 -x257 -x256 -x255 -x254
7.19/7.23 v -x253 -x252 -x251 -x250 -x249 -x248 -x247 -x246 -x245 -x244 -x243 -x242 -x241 -x240 -x239 -x238 -x237 -x236 -x235 x234 -x233
7.19/7.23 v -x232 -x231 -x230 -x229 -x228 -x227 -x226 -x225 -x224 -x223 -x222 -x221 -x220 -x219 -x218 -x217 -x216 -x215 -x214 -x213 -x212
7.19/7.23 v -x211 -x210 -x209 -x208 -x207 -x206 -x205 -x204 -x203 -x202 -x201 -x200 -x199 -x198 -x197 -x196 -x195 -x194 -x193 -x192 x191
7.19/7.23 v -x190 -x189 -x188 -x187 -x186 -x185 -x184 -x183 -x182 -x181 -x180 -x179 -x178 -x177 -x176 -x175 -x174 -x173 -x172 -x171 -x170
7.19/7.23 v -x169 -x168 -x167 -x166 -x165 -x164 -x163 x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 -x151 -x150 -x149
7.19/7.23 v -x148 -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134 x133 -x132 -x131 -x130 -x129 -x128
7.19/7.23 v -x127 -x126 -x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107
7.19/7.23 v -x106 -x105 x104 -x103 -x102 -x101 -x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92 -x91 -x90 -x89 -x88 -x87 -x86 -x85 -x84 -x83
7.19/7.23 v -x82 -x81 -x80 -x79 -x78 -x77 -x76 x75 -x74 -x73 -x72 -x71 -x70 -x69 -x68 -x67 -x66 -x65 -x64 -x63 -x62 -x61 -x60 -x59 -x58
7.19/7.23 v -x57 -x56 -x55 -x54 -x53 -x52 -x51 -x50 -x49 -x48 -x47 x46 -x45 -x44 -x43 -x42 -x41 -x40 -x39 -x38 -x37 -x36 -x35 -x34 -x33
7.19/7.23 v -x32 -x31 -x30 -x29 -x28 -x27 -x26 -x25 -x24 -x23 -x22 -x21 -x20 -x19 -x18 -x17 -x16 -x15 -x14 -x13 -x12 -x11 -x10 x9 -x8 -x7
7.19/7.23 v -x6 -x5 -x4 -x3 -x2 -x1
7.19/7.23 c SCIP Status : problem is solved [optimal solution found]
7.19/7.23 c Solving Time : 6.75
7.19/7.23 c Original Problem :
7.19/7.23 c Problem name : HOME/instance-1884927-1245260671.opb
7.19/7.23 c Variables : 840 (840 binary, 0 integer, 0 implicit integer, 0 continuous)
7.19/7.23 c Constraints : 23548 initial, 23548 maximal
7.19/7.23 c Presolved Problem :
7.19/7.23 c Problem name : t_HOME/instance-1884927-1245260671.opb
7.19/7.23 c Variables : 840 (840 binary, 0 integer, 0 implicit integer, 0 continuous)
7.19/7.23 c Constraints : 23548 initial, 23549 maximal
7.19/7.23 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
7.19/7.23 c trivial : 0.00 0 0 0 0 0 0 0 0
7.19/7.23 c dualfix : 0.00 0 0 0 0 0 0 0 0
7.19/7.23 c boundshift : 0.00 0 0 0 0 0 0 0 0
7.19/7.23 c inttobinary : 0.00 0 0 0 0 0 0 0 0
7.19/7.23 c implics : 0.00 0 0 0 0 0 0 0 0
7.19/7.23 c probing : 0.00 0 0 0 0 0 0 0 0
7.19/7.23 c logicor : 0.07 0 0 0 0 0 0 0 0
7.19/7.23 c root node : - 0 - - 0 - - - -
7.19/7.23 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
7.19/7.23 c integral : 0 0 0 1 0 0 0 0 0 2
7.19/7.23 c logicor : 23548+ 5 147 0 1 1 324 0 0 0
7.19/7.23 c countsols : 0 0 0 0 1 0 0 0 0 0
7.19/7.23 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
7.19/7.23 c integral : 2.23 0.00 0.00 2.23 0.00
7.19/7.23 c logicor : 0.02 0.01 0.01 0.00 0.00
7.19/7.23 c countsols : 0.00 0.00 0.00 0.00 0.00
7.19/7.23 c Propagators : Time Calls Cutoffs DomReds
7.19/7.23 c rootredcost : 0.00 0 0 0
7.19/7.23 c pseudoobj : 0.05 595 0 0
7.19/7.23 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
7.19/7.23 c propagation : 0.00 1 1 1 84.0 0 0.0 -
7.19/7.23 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
7.19/7.23 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
7.19/7.23 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
7.19/7.23 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
7.19/7.23 c applied globally : - - - 1 84.0 - - -
7.19/7.23 c applied locally : - - - 0 0.0 - - -
7.19/7.23 c Separators : Time Calls Cutoffs DomReds Cuts Conss
7.19/7.23 c cut pool : 0.00 4 - - 0 - (maximal pool size: 172)
7.19/7.23 c redcost : 0.00 5 0 0 0 0
7.19/7.23 c impliedbounds : 0.00 5 0 0 0 0
7.19/7.23 c intobj : 0.00 0 0 0 0 0
7.19/7.23 c gomory : 1.65 5 0 0 2500 0
7.19/7.23 c strongcg : 1.17 5 0 0 2500 0
7.19/7.23 c cmir : 0.00 0 0 0 0 0
7.19/7.23 c flowcover : 0.00 0 0 0 0 0
7.19/7.23 c clique : 0.04 5 0 0 10 0
7.19/7.23 c zerohalf : 0.00 0 0 0 0 0
7.19/7.23 c mcf : 0.03 1 0 0 0 0
7.19/7.23 c Pricers : Time Calls Vars
7.19/7.23 c problem variables: 0.00 0 0
7.19/7.23 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
7.19/7.23 c relpscost : 2.23 1 0 0 0 0 2
7.19/7.23 c pscost : 0.00 0 0 0 0 0 0
7.19/7.23 c inference : 0.02 532 0 0 0 0 1064
7.19/7.23 c mostinf : 0.00 0 0 0 0 0 0
7.19/7.23 c leastinf : 0.00 0 0 0 0 0 0
7.19/7.23 c fullstrong : 0.00 0 0 0 0 0 0
7.19/7.23 c allfullstrong : 0.00 0 0 0 0 0 0
7.19/7.23 c random : 0.00 0 0 0 0 0 0
7.19/7.23 c Primal Heuristics : Time Calls Found
7.19/7.23 c LP solutions : 0.00 - 0
7.19/7.23 c pseudo solutions : 0.00 - 1
7.19/7.23 c simplerounding : 0.00 0 0
7.19/7.23 c rounding : 0.00 0 0
7.19/7.23 c shifting : 0.00 0 0
7.19/7.23 c intshifting : 0.00 0 0
7.19/7.23 c oneopt : 0.00 0 0
7.19/7.23 c fixandinfer : 0.00 0 0
7.19/7.23 c feaspump : 0.00 0 0
7.19/7.23 c coefdiving : 0.00 0 0
7.19/7.23 c pscostdiving : 0.00 0 0
7.19/7.23 c fracdiving : 0.00 0 0
7.19/7.23 c veclendiving : 0.00 0 0
7.19/7.23 c intdiving : 0.00 0 0
7.19/7.23 c actconsdiving : 0.00 0 0
7.19/7.23 c objpscostdiving : 0.00 0 0
7.19/7.23 c rootsoldiving : 0.00 0 0
7.19/7.23 c linesearchdiving : 0.00 0 0
7.19/7.23 c guideddiving : 0.00 0 0
7.19/7.23 c octane : 0.00 0 0
7.19/7.23 c rens : 0.00 0 0
7.19/7.23 c rins : 0.00 0 0
7.19/7.23 c localbranching : 0.00 0 0
7.19/7.23 c mutation : 0.00 0 0
7.19/7.23 c crossover : 0.00 0 0
7.19/7.23 c dins : 0.00 0 0
7.19/7.23 c LP : Time Calls Iterations Iter/call Iter/sec
7.19/7.23 c primal LP : 0.01 0 0 0.00 0.00
7.19/7.23 c dual LP : 1.15 6 626 104.33 544.35
7.19/7.23 c barrier LP : 0.00 0 0 0.00 -
7.19/7.23 c diving/probing LP: 0.00 0 0 0.00 -
7.19/7.23 c strong branching : 2.23 18 808 44.89 362.33
7.19/7.23 c (at root node) : - 18 808 44.89 -
7.19/7.23 c conflict analysis: 0.00 0 0 0.00 -
7.19/7.23 c B&B Tree :
7.19/7.23 c number of runs : 1
7.19/7.23 c nodes : 535
7.19/7.23 c nodes (total) : 535
7.19/7.23 c nodes left : 0
7.19/7.23 c max depth : 533
7.19/7.23 c max depth (total): 533
7.19/7.23 c backtracks : 0 (0.0%)
7.19/7.23 c delayed cutoffs : 0
7.19/7.23 c repropagations : 1 (3 domain reductions, 0 cutoffs)
7.19/7.23 c avg switch length: 2.00
7.19/7.23 c switching time : 0.02
7.19/7.23 c Solution :
7.19/7.23 c Solutions found : 1 (1 improvements)
7.19/7.23 c Primal Bound : +2.80000000000000e+01 (in run 1, after 535 nodes, 6.74 seconds, depth 533, found by <relaxation>)
7.19/7.23 c Dual Bound : +2.80000000000000e+01
7.19/7.23 c Gap : 0.00 %
7.19/7.23 c Root Dual Bound : +2.80000000000000e+01
7.29/7.32 c Time complete: 7.31.