0.39/0.41 c SCIP version 1.1.0.7
0.39/0.41 c LP-Solver SoPlex 1.4.1
0.39/0.41 c user parameter file <scip.set> not found - using default parameters
0.39/0.41 c read problem <HOME/instance-1870694-1245215821.opb>
0.39/0.41 c original problem has 38460 variables (38460 bin, 0 int, 0 impl, 0 cont) and 38962 constraints
0.69/0.79 c No objective function, only one solution is needed.
0.69/0.79 c start presolving problem
0.69/0.79 c presolving:
2.09/2.15 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 1501 upgd conss, 298608 impls, 1000 clqs
2.99/3.08 c presolving (2 rounds):
2.99/3.08 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
2.99/3.08 c 298608 implications, 1000 cliques
2.99/3.08 c presolved problem has 38460 variables (38460 bin, 0 int, 0 impl, 0 cont) and 38962 constraints
2.99/3.08 c 1 constraints of type <knapsack>
2.99/3.08 c 1000 constraints of type <setppc>
2.99/3.08 c 37460 constraints of type <and>
2.99/3.08 c 1 constraints of type <linear>
2.99/3.08 c 500 constraints of type <logicor>
2.99/3.08 c transformed objective value is always integral (scale: 1)
2.99/3.08 c Presolving Time: 2.20
2.99/3.08 c SATUNSAT-NLC
2.99/3.08 c -----------------------------------------------------------------------------------------------
2.99/3.08 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
2.99/3.08 c # [type: int, range: [-1,2147483647], default: 0]
2.99/3.08 c separating/flowcover/freq = c -1
2.99/3.08 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
2.99/3.08 c # [type: int, range: [-1,2147483647], default: 0]
2.99/3.08 c separating/cmir/freq = c -1
2.99/3.08 c # additional number of allowed LP iterations
2.99/3.08 c # [type: int, range: [0,2147483647], default: 1000]
2.99/3.08 c heuristics/veclendiving/maxlpiterofs = c 1500
2.99/3.08 c # maximal fraction of diving LP iterations compared to node LP iterations
2.99/3.08 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.99/3.08 c heuristics/veclendiving/maxlpiterquot = c 0.075
2.99/3.08 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
2.99/3.08 c # [type: int, range: [-1,2147483647], default: 10]
2.99/3.08 c heuristics/veclendiving/freq = c -1
2.99/3.08 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
2.99/3.08 c # [type: int, range: [-1,2147483647], default: 1]
2.99/3.08 c heuristics/simplerounding/freq = c -1
2.99/3.08 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
2.99/3.08 c # [type: int, range: [-1,2147483647], default: 10]
2.99/3.08 c heuristics/shifting/freq = c -1
2.99/3.08 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
2.99/3.08 c # [type: int, range: [-1,2147483647], default: 1]
2.99/3.08 c heuristics/rounding/freq = c -1
2.99/3.08 c # additional number of allowed LP iterations
2.99/3.08 c # [type: int, range: [0,2147483647], default: 1000]
2.99/3.08 c heuristics/rootsoldiving/maxlpiterofs = c 1500
2.99/3.08 c # maximal fraction of diving LP iterations compared to node LP iterations
2.99/3.08 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
2.99/3.08 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
2.99/3.08 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
2.99/3.08 c # [type: int, range: [-1,2147483647], default: 20]
2.99/3.08 c heuristics/rootsoldiving/freq = c -1
2.99/3.08 c # number of nodes added to the contingent of the total nodes
2.99/3.08 c # [type: longint, range: [0,9223372036854775807], default: 500]
2.99/3.08 c heuristics/rens/nodesofs = c 2000
2.99/3.08 c # minimum percentage of integer variables that have to be fixable
2.99/3.08 c # [type: real, range: [0,1], default: 0.5]
2.99/3.08 c heuristics/rens/minfixingrate = c 0.3
2.99/3.08 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
2.99/3.08 c # [type: int, range: [-1,2147483647], default: 0]
2.99/3.08 c heuristics/rens/freq = c -1
2.99/3.08 c # additional number of allowed LP iterations
2.99/3.08 c # [type: int, range: [0,2147483647], default: 1000]
2.99/3.08 c heuristics/pscostdiving/maxlpiterofs = c 1500
2.99/3.08 c # maximal fraction of diving LP iterations compared to node LP iterations
2.99/3.08 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.99/3.08 c heuristics/pscostdiving/maxlpiterquot = c 0.075
2.99/3.08 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
2.99/3.08 c # [type: int, range: [-1,2147483647], default: 10]
2.99/3.08 c heuristics/pscostdiving/freq = c -1
2.99/3.08 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
2.99/3.08 c # [type: int, range: [-1,2147483647], default: 1]
2.99/3.08 c heuristics/oneopt/freq = c -1
2.99/3.08 c # additional number of allowed LP iterations
2.99/3.08 c # [type: int, range: [0,2147483647], default: 1000]
2.99/3.08 c heuristics/objpscostdiving/maxlpiterofs = c 1500
2.99/3.08 c # maximal fraction of diving LP iterations compared to total iteration number
2.99/3.08 c # [type: real, range: [0,1], default: 0.01]
2.99/3.08 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
2.99/3.08 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
2.99/3.08 c # [type: int, range: [-1,2147483647], default: 20]
2.99/3.08 c heuristics/objpscostdiving/freq = c -1
2.99/3.08 c # additional number of allowed LP iterations
2.99/3.08 c # [type: int, range: [0,2147483647], default: 1000]
2.99/3.08 c heuristics/linesearchdiving/maxlpiterofs = c 1500
2.99/3.08 c # maximal fraction of diving LP iterations compared to node LP iterations
2.99/3.08 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.99/3.08 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
2.99/3.08 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
2.99/3.08 c # [type: int, range: [-1,2147483647], default: 10]
2.99/3.08 c heuristics/linesearchdiving/freq = c -1
2.99/3.08 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
2.99/3.08 c # [type: int, range: [-1,2147483647], default: 10]
2.99/3.08 c heuristics/intshifting/freq = c -1
2.99/3.08 c # maximal fraction of diving LP iterations compared to node LP iterations
2.99/3.08 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.99/3.08 c heuristics/intdiving/maxlpiterquot = c 0.075
2.99/3.08 c # additional number of allowed LP iterations
2.99/3.08 c # [type: int, range: [0,2147483647], default: 1000]
2.99/3.08 c heuristics/guideddiving/maxlpiterofs = c 1500
2.99/3.08 c # maximal fraction of diving LP iterations compared to node LP iterations
2.99/3.08 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.99/3.08 c heuristics/guideddiving/maxlpiterquot = c 0.075
2.99/3.08 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
2.99/3.08 c # [type: int, range: [-1,2147483647], default: 10]
2.99/3.08 c heuristics/guideddiving/freq = c -1
2.99/3.08 c # additional number of allowed LP iterations
2.99/3.08 c # [type: int, range: [0,2147483647], default: 1000]
2.99/3.08 c heuristics/fracdiving/maxlpiterofs = c 1500
2.99/3.08 c # maximal fraction of diving LP iterations compared to node LP iterations
2.99/3.08 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.99/3.08 c heuristics/fracdiving/maxlpiterquot = c 0.075
2.99/3.08 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
2.99/3.08 c # [type: int, range: [-1,2147483647], default: 10]
2.99/3.08 c heuristics/fracdiving/freq = c -1
2.99/3.08 c # additional number of allowed LP iterations
2.99/3.08 c # [type: int, range: [0,2147483647], default: 1000]
2.99/3.08 c heuristics/feaspump/maxlpiterofs = c 2000
2.99/3.08 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
2.99/3.08 c # [type: int, range: [-1,2147483647], default: 20]
2.99/3.08 c heuristics/feaspump/freq = c -1
2.99/3.08 c # minimum percentage of integer variables that have to be fixed
2.99/3.08 c # [type: real, range: [0,1], default: 0.666]
2.99/3.08 c heuristics/crossover/minfixingrate = c 0.5
2.99/3.08 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
2.99/3.08 c # [type: real, range: [0,1], default: 0.1]
2.99/3.08 c heuristics/crossover/nodesquot = c 0.15
2.99/3.08 c # number of nodes without incumbent change that heuristic should wait
2.99/3.08 c # [type: longint, range: [0,9223372036854775807], default: 200]
2.99/3.08 c heuristics/crossover/nwaitingnodes = c 100
2.99/3.08 c # number of nodes added to the contingent of the total nodes
2.99/3.08 c # [type: longint, range: [0,9223372036854775807], default: 500]
2.99/3.08 c heuristics/crossover/nodesofs = c 750
2.99/3.08 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
2.99/3.08 c # [type: int, range: [-1,2147483647], default: 30]
2.99/3.08 c heuristics/crossover/freq = c -1
2.99/3.08 c # additional number of allowed LP iterations
2.99/3.08 c # [type: int, range: [0,2147483647], default: 1000]
2.99/3.08 c heuristics/coefdiving/maxlpiterofs = c 1500
2.99/3.08 c # maximal fraction of diving LP iterations compared to node LP iterations
2.99/3.08 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.99/3.08 c heuristics/coefdiving/maxlpiterquot = c 0.075
2.99/3.08 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
2.99/3.08 c # [type: int, range: [-1,2147483647], default: 10]
2.99/3.08 c heuristics/coefdiving/freq = c -1
2.99/3.08 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
2.99/3.08 c # [type: int, range: [-1,2147483647], default: -1]
2.99/3.08 c presolving/probing/maxrounds = c 0
2.99/3.08 c # should presolving try to simplify knapsacks
2.99/3.08 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
2.99/3.08 c constraints/knapsack/simplifyinequalities = c TRUE
2.99/3.08 c # should disaggregation of knapsack constraints be allowed in preprocessing?
2.99/3.08 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
2.99/3.08 c constraints/knapsack/disaggregation = c FALSE
2.99/3.08 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
2.99/3.08 c # [type: int, range: [-1,2147483647], default: -1]
2.99/3.08 c constraints/knapsack/maxnumcardlift = c 0
2.99/3.08 c # should presolving try to simplify inequalities
3.09/3.11 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
3.09/3.11 c constraints/linear/simplifyinequalities = c TRUE
3.09/3.11 c # maximal number of separation rounds in the root node (-1: unlimited)
3.09/3.11 c # [type: int, range: [-1,2147483647], default: -1]
3.09/3.11 c separating/maxroundsroot = c 5
3.09/3.11 c # maximal number of separation rounds per node (-1: unlimited)
3.09/3.11 c # [type: int, range: [-1,2147483647], default: 5]
3.09/3.11 c separating/maxrounds = c 1
3.09/3.11 c # solving stops, if the given number of solutions were found (-1: no limit)
3.09/3.11 c # [type: int, range: [-1,2147483647], default: -1]
3.09/3.11 c limits/solutions = c 1
3.09/3.11 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
3.09/3.11 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
3.09/3.11 c limits/memory = c 1620
3.09/3.11 c # maximal time in seconds to run
3.09/3.11 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
3.09/3.11 c limits/time = c 1791
3.09/3.11 c # frequency for displaying node information lines
3.09/3.11 c # [type: int, range: [-1,2147483647], default: 100]
3.09/3.11 c display/freq = c 10000
3.09/3.11 c -----------------------------------------------------------------------------------------------
3.09/3.11 c start solving problem
3.09/3.11 c
4.29/4.30 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
4.29/4.30 c 3.5s| 1 | 0 | 103 | 171M| 0 | 60 | 38k| 38k| 38k| 38k| 76k| 0 | 0 | 0 | 3.000000e+01 | -- | Inf
9.79/9.85 c 8.9s| 1 | 0 | 107 | 171M| 0 | 60 | 38k| 38k| 38k| 38k| 76k| 1 | 0 | 0 | 3.000000e+01 | -- | Inf
13.49/13.52 c 12.6s| 1 | 0 | 123 | 172M| 0 | 62 | 38k| 38k| 38k| 38k| 76k| 2 | 0 | 0 | 3.000000e+01 | -- | Inf
46.98/47.03 c 46.0s| 1 | 0 | 137 | 172M| 0 | 62 | 38k| 38k| 38k| 38k| 76k| 3 | 0 | 0 | 3.000000e+01 | -- | Inf
79.47/79.59 c 78.5s| 1 | 0 | 239 | 172M| 0 | 63 | 38k| 38k| 38k| 38k| 76k| 4 | 0 | 0 | 3.000000e+01 | -- | Inf
142.96/143.01 c 142s| 1 | 0 | 273 | 172M| 0 | 63 | 38k| 38k| 38k| 38k| 76k| 5 | 0 | 0 | 3.000000e+01 | -- | Inf
209.84/209.90 c 209s| 1 | 2 | 273 | 172M| 0 | 63 | 38k| 38k| 38k| 38k| 76k| 5 | 0 | 33 | 3.000000e+01 | -- | Inf
227.03/227.14 c * 226s| 28 | 21 | 1260 | 179M| 26 | - | 38k| 38k| 16k| 38k|2062 |1051 | 1 | 316 | 3.000000e+01 | 3.200000e+01 | 6.67%
227.03/227.14 c
227.03/227.14 c SCIP Status : solving was interrupted [solution limit reached]
227.03/227.14 c Solving Time (sec) : 225.76
227.03/227.14 c Solving Nodes : 28
227.03/227.14 c Primal Bound : +3.20000000000000e+01 (1 solutions)
227.03/227.14 c Dual Bound : +3.00000000000000e+01
227.03/227.14 c Gap : 6.67 %
227.13/227.24 c NODE 28
227.13/227.24 c DUAL BOUND 30
227.13/227.24 c PRIMAL BOUND 32
227.13/227.24 c GAP 0.0666667
227.13/227.24 s SATISFIABLE
227.13/227.24 v -x966 -x847 -x693 -x861 -x953 -x972 -x991 -x684 -x902 -x911 -x980 -x679 -x744 -x933 -x826 -x960 -x848 -x593 -x552 -x890 -x803 -x824
227.13/227.24 v -x959 -x738 -x519 -x742 -x868 -x614 -x554 -x624 -x577 -x849 -x696 -x662 -x860 -x761 -x615 -x879 -x970 -x835 -x729 -x686
227.13/227.24 v -x888 -x820 -x546 -x794 -x913 -x853 -x776 -x697 -x655 -x638 -x594 -x901 -x971 -x710 -x942 -x671 -x608 -x531 -x525 -x865 -x527
227.13/227.24 v -x910 -x751 -x850 -x841 -x836 -x756 -x734 -x719 -x644 -x631 -x530 -x813 -x612 -x611 -x864 -x954 -x909 -x818 -x685 -x617 -x576
227.13/227.24 v -x875 -x873 -x650 -x915 -x937 -x965 -x946 -x885 -x508 -x934 -x867 -x801 -x737 -x725 -x636 -x788 x897 -x997 -x793 -x943 -x561
227.13/227.24 v -x604 -x904 -x857 -x529 -x600 -x560 -x982 -x606 -x884 -x628 -x652 -x995 -x961 -x929 -x880 -x767 -x760 -x658 -x654 -x621 -x605
227.13/227.24 v -x587 -x570 -x523 -x518 -x731 -x565 -x784 -x674 -x515 -x825 -x721 -x862 -x682 -x736 -x506 -x935 -x922 -x827 -x797 -x770 -x764
227.13/227.24 v -x718 -x698 -x680 -x651 -x632 -x609 -x583 -x540 -x895 -x599 -x831 -x903 -x763 -x619 -x722 -x855 -x957 -x524 -x947 -x627 -x510
227.13/227.24 v -x814 -x834 -x781 -x906 -x777 -x819 -x963 x713 -x575 -x635 -x996 -x987 -x977 -x930 -x829 -x798 -x749 -x735 -x730 -x699 -x678
227.13/227.24 v -x613 -x597 -x541 -x537 -x528 -x526 -x921 -x581 -x558 -x665 -x690 -x891 -x700 -x664 -x958 -x676 -x521 -x618 -x815 -x863
227.13/227.24 v -x908 -x675 -x998 -x578 -x709 -x981 -x887 -x792 -x596 -x839 -x504 -x979 -x920 -x919 -x892 -x870 -x758 x694 x688 -x633 -x629 -x582
227.13/227.24 v -x550 -x538 -x532 -x520 -x705 -x967 -x762 -x928 -x733 -x513 -x808 -x962 -x821 -x823 -x659 -x846 -x989 -x534 -x783 -x745
227.13/227.24 v -x639 -x645 -x601 -x692 -x660 -x974 -x956 x940 -x932 -x800 -x858 -x843 -x667 -x840 -x964 -x912 -x845 -x773 -x752 -x750 -x720
227.13/227.24 v -x670 -x647 -x620 -x595 -x585 x574 -x566 -x564 -x556 -x551 -x512 -x509 -x571 -x851 -x607 -x708 -x714 -x545 -x775 -x626 -x985
227.13/227.24 v -x657 -x548 -x590 -x844 x828 -x944 -x789 -x748 -x869 -x691 -x533 -x893 -x712 -x949 -x771 -x988 x732 -x586 -x536 -x723 -x746 -x716
227.13/227.24 v -x602 -x871 -x852 -x945 -x689 -x502 -x1000 -x990 -x952 -x866 -x832 -x811 -x785 -x778 -x772 -x766 -x755 -x753 -x726 -x711
227.13/227.24 v -x704 -x703 -x701 -x683 -x677 -x673 -x666 -x663 -x640 -x616 -x610 -x592 -x584 -x580 -x568 -x563 -x522 -x544 -x931 -x739 -x553
227.13/227.24 v -x950 -x973 -x795 -x882 -x681 -x804 -x623 -x728 -x661 x622 -x994 -x899 -x830 -x559 -x806 -x757 -x984 -x646 -x874 -x999 -x907
227.13/227.24 v -x927 -x914 -x992 -x741 -x727 -x707 -x905 -x978 -x807 -x567 -x854 -x517 -x816 -x743 -x591 -x796 -x503 -x951 -x924 -x809 -x883
227.13/227.24 v -x634 -x878 -x572 -x872 x501 -x968 -x918 -x917 -x881 -x876 -x856 -x833 -x822 -x817 -x812 -x810 -x787 -x780 -x779 -x769 -x768
227.13/227.24 v -x754 -x724 -x717 -x706 -x672 -x668 -x656 -x641 -x630 -x598 -x589 -x557 x555 -x547 -x543 -x542 -x539 -x535 x514 -x511 -x505
227.13/227.24 v -x642 -x936 -x805 -x687 -x786 -x837 -x898 -x549 -x838 x625 -x790 -x900 -x983 -x923 -x653 -x782 -x948 -x889 -x588 x993 -x649
227.13/227.24 v -x695 -x569 -x791 -x579 -x916 -x562 -x507 -x975 -x637 -x715 -x955 -x799 -x969 x938 -x886 -x648 -x774 -x759 -x939 -x643 -x516
227.13/227.24 v -x896 -x702 -x976 -x842 -x603 -x740 -x894 -x925 -x859 -x765 -x802 -x877 -x573 -x926 -x941 -x669 -x986 -x747 -x500 -x499 -x498
227.13/227.24 v -x497 -x496 -x495 -x494 -x493 -x492 -x491 -x490 -x489 -x488 -x487 -x486 -x485 -x484 -x483 -x482 -x481 -x480 -x479 -x478 -x477
227.13/227.24 v -x476 -x475 -x474 -x473 -x472 -x471 -x470 -x469 -x468 -x467 -x466 -x465 -x464 -x463 -x462 -x461 -x460 -x459 -x458 -x457 -x456
227.13/227.24 v -x455 -x454 -x453 -x452 -x451 -x450 -x449 -x448 -x447 -x446 -x445 -x444 -x443 -x442 -x441 -x440 -x439 -x438 -x437 -x436 -x435
227.13/227.24 v -x434 -x433 -x432 -x431 -x430 -x429 -x428 -x427 -x426 -x425 -x424 -x423 -x422 -x421 -x420 -x419 -x418 -x417 -x416 -x415
227.13/227.24 v -x414 -x413 -x412 -x411 -x410 -x409 -x408 -x407 -x406 -x405 -x404 -x403 -x402 -x401 -x400 -x399 -x398 -x397 -x396 -x395 -x394
227.13/227.24 v -x393 -x392 -x391 -x390 -x389 -x388 -x387 -x386 -x385 -x384 -x383 -x382 -x381 -x380 -x379 -x378 -x377 -x376 -x375 -x374 -x373
227.13/227.24 v -x372 -x371 -x370 -x369 -x368 -x367 -x366 -x365 -x364 -x363 -x362 -x361 -x360 -x359 -x358 -x357 -x356 -x355 -x354 -x353 -x352
227.13/227.24 v -x351 -x350 -x349 -x348 -x347 -x346 -x345 -x344 -x343 -x342 -x341 -x340 -x339 -x338 -x337 -x336 -x335 -x334 -x333 -x332 -x331
227.13/227.24 v -x330 -x329 -x328 -x327 -x326 -x325 -x324 -x323 -x322 -x321 -x320 -x319 -x318 -x317 -x316 -x315 -x314 -x313 -x312 -x311 -x310
227.13/227.24 v -x309 -x308 -x307 -x306 -x305 -x304 -x303 -x302 -x301 -x300 -x299 -x298 -x297 -x296 -x295 -x294 -x293 -x292 -x291 -x290
227.13/227.24 v -x289 -x288 -x287 -x286 -x285 -x284 -x283 -x282 -x281 -x280 -x279 -x278 -x277 -x276 -x275 -x274 -x273 -x272 -x271 -x270 -x269
227.13/227.24 v -x268 -x267 -x266 -x265 -x264 -x263 -x262 -x261 -x260 -x259 -x258 -x257 -x256 -x255 -x254 -x253 -x252 -x251 -x250 -x249 -x248
227.13/227.24 v -x247 -x246 -x245 -x244 -x243 -x242 -x241 -x240 -x239 -x238 -x237 -x236 -x235 -x234 -x233 -x232 -x231 -x230 -x229 -x228 -x227
227.13/227.24 v -x226 -x225 -x224 -x223 -x222 -x221 -x220 -x219 -x218 -x217 -x216 -x215 -x214 -x213 -x212 -x211 -x210 -x209 -x208 -x207 -x206
227.13/227.24 v -x205 -x204 -x203 -x202 -x201 -x200 -x199 -x198 -x197 -x196 -x195 -x194 -x193 x192 -x191 -x190 -x189 -x188 -x187 -x186 -x185
227.13/227.24 v -x184 -x183 -x182 -x181 -x180 -x179 -x178 -x177 -x176 -x175 -x174 -x173 -x172 -x171 -x170 -x169 -x168 -x167 -x166 -x165 -x164
227.13/227.24 v -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 -x151 -x150 -x149 -x148 -x147 -x146 -x145 -x144
227.13/227.24 v -x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127 -x126 -x125 -x124 -x123
227.13/227.24 v -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106 -x105 -x104 -x103 -x102
227.13/227.24 v -x101 -x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92 -x91 -x90 -x89 -x88 -x87 -x86 -x85 -x84 -x83 -x82 -x81 -x80 -x79 -x78 -x77
227.13/227.24 v -x76 -x75 -x74 -x73 -x72 -x71 -x70 -x69 -x68 -x67 -x66 -x65 -x64 -x63 -x62 -x61 x60 -x59 -x58 -x57 -x56 -x55 -x54 -x53 -x52
227.13/227.24 v -x51 x50 -x49 -x48 -x47 -x46 x45 -x44 -x43 -x42 -x41 x40 x39 -x38 x37 -x36 -x35 x34 -x33 -x32 x31 -x30 -x29 x28 x27 -x26 -x25
227.13/227.24 v x24 -x23 -x22 -x21 -x20 x19 -x18 -x17 -x16 x15 -x14 -x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 x2 -x1
227.13/227.24 c SCIP Status : solving was interrupted [solution limit reached]
227.13/227.24 c Solving Time : 225.76
227.13/227.24 c Original Problem :
227.13/227.24 c Problem name : HOME/instance-1870694-1245215821.opb
227.13/227.24 c Variables : 38460 (38460 binary, 0 integer, 0 implicit integer, 0 continuous)
227.13/227.24 c Constraints : 38962 initial, 38962 maximal
227.13/227.24 c Presolved Problem :
227.13/227.24 c Problem name : t_HOME/instance-1870694-1245215821.opb
227.13/227.24 c Variables : 38460 (38460 binary, 0 integer, 0 implicit integer, 0 continuous)
227.13/227.24 c Constraints : 38962 initial, 38963 maximal
227.13/227.24 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
227.13/227.24 c trivial : 0.02 0 0 0 0 0 0 0 0
227.13/227.24 c dualfix : 0.00 0 0 0 0 0 0 0 0
227.13/227.24 c boundshift : 0.00 0 0 0 0 0 0 0 0
227.13/227.24 c inttobinary : 0.00 0 0 0 0 0 0 0 0
227.13/227.24 c implics : 0.02 0 0 0 0 0 0 0 0
227.13/227.24 c probing : 0.00 0 0 0 0 0 0 0 0
227.13/227.24 c knapsack : 0.04 0 0 0 0 0 0 0 0
227.13/227.24 c setppc : 0.05 0 0 0 0 0 0 0 0
227.13/227.24 c and : 1.54 0 0 0 0 0 0 0 0
227.13/227.24 c linear : 0.30 0 0 0 0 0 0 0 0
227.13/227.24 c logicor : 0.01 0 0 0 0 0 0 0 0
227.13/227.24 c root node : - 0 - - 0 - - - -
227.13/227.24 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
227.13/227.24 c integral : 0 0 0 116 0 0 0 0 0 52
227.13/227.24 c knapsack : 1 5 78 90 0 0 0 0 0 0
227.13/227.24 c setppc : 1000 5 78 90 0 1 410 0 0 0
227.13/227.24 c and : 37460 31 77 90 0 0 22155 1046 0 0
227.13/227.24 c linear : 1 5 77 1 0 0 0 0 0 0
227.13/227.24 c logicor : 500+ 5 24 1 0 0 18 0 0 0
227.13/227.24 c countsols : 0 0 0 1 0 0 0 0 0 0
227.13/227.24 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
227.13/227.24 c integral : 74.23 0.00 0.00 74.23 0.00
227.13/227.24 c knapsack : 0.01 0.01 0.00 0.00 0.00
227.13/227.24 c setppc : 0.04 0.00 0.02 0.02 0.00
227.13/227.24 c and : 1.75 0.72 0.20 0.83 0.00
227.13/227.24 c linear : 0.02 0.02 0.00 0.00 0.00
227.13/227.24 c logicor : 0.00 0.00 0.00 0.00 0.00
227.13/227.24 c countsols : 0.00 0.00 0.00 0.00 0.00
227.13/227.24 c Propagators : Time Calls Cutoffs DomReds
227.13/227.24 c rootredcost : 0.00 0 0 0
227.13/227.24 c pseudoobj : 0.57 79 0 0
227.13/227.24 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
227.13/227.24 c propagation : 0.00 1 1 1 3.0 0 0.0 -
227.13/227.24 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
227.13/227.24 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
227.13/227.24 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
227.13/227.24 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
227.13/227.24 c applied globally : - - - 1 3.0 - - -
227.13/227.24 c applied locally : - - - 0 0.0 - - -
227.13/227.24 c Separators : Time Calls Cutoffs DomReds Cuts Conss
227.13/227.24 c cut pool : 0.00 4 - - 4 - (maximal pool size: 16)
227.13/227.24 c redcost : 0.21 31 0 0 0 0
227.13/227.24 c impliedbounds : 0.02 5 0 0 0 0
227.13/227.24 c intobj : 0.00 0 0 0 0 0
227.13/227.24 c gomory : 96.63 5 0 0 1688 0
227.13/227.24 c strongcg : 37.17 5 0 0 2003 0
227.13/227.24 c cmir : 0.00 0 0 0 0 0
227.13/227.24 c flowcover : 0.00 0 0 0 0 0
227.13/227.24 c clique : 0.25 5 0 0 0 0
227.13/227.24 c zerohalf : 0.00 0 0 0 0 0
227.13/227.24 c mcf : 3.81 2 0 0 0 0
227.13/227.24 c Pricers : Time Calls Vars
227.13/227.24 c problem variables: 0.00 0 0
227.13/227.24 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
227.13/227.24 c relpscost : 74.23 26 0 0 0 0 52
227.13/227.24 c pscost : 0.00 0 0 0 0 0 0
227.13/227.24 c inference : 0.00 0 0 0 0 0 0
227.13/227.24 c mostinf : 0.00 0 0 0 0 0 0
227.13/227.24 c leastinf : 0.00 0 0 0 0 0 0
227.13/227.24 c fullstrong : 0.00 0 0 0 0 0 0
227.13/227.24 c allfullstrong : 0.00 0 0 0 0 0 0
227.13/227.24 c random : 0.00 0 0 0 0 0 0
227.13/227.24 c Primal Heuristics : Time Calls Found
227.13/227.24 c LP solutions : 0.01 - 1
227.13/227.24 c pseudo solutions : 0.00 - 0
227.13/227.24 c simplerounding : 0.00 0 0
227.13/227.24 c rounding : 0.00 0 0
227.13/227.24 c shifting : 0.00 0 0
227.13/227.24 c intshifting : 0.00 0 0
227.13/227.24 c oneopt : 0.00 0 0
227.13/227.24 c fixandinfer : 0.00 0 0
227.13/227.24 c feaspump : 0.00 0 0
227.13/227.24 c coefdiving : 0.00 0 0
227.13/227.24 c pscostdiving : 0.00 0 0
227.13/227.24 c fracdiving : 0.00 0 0
227.13/227.24 c veclendiving : 0.00 0 0
227.13/227.24 c intdiving : 0.00 0 0
227.13/227.24 c actconsdiving : 0.00 0 0
227.13/227.24 c objpscostdiving : 0.00 0 0
227.13/227.24 c rootsoldiving : 0.00 0 0
227.13/227.24 c linesearchdiving : 0.00 0 0
227.13/227.24 c guideddiving : 0.00 0 0
227.13/227.24 c octane : 0.00 0 0
227.13/227.24 c rens : 0.00 0 0
227.13/227.24 c rins : 0.00 0 0
227.13/227.24 c localbranching : 0.00 0 0
227.13/227.24 c mutation : 0.00 0 0
227.13/227.24 c crossover : 0.00 0 0
227.13/227.24 c dins : 0.00 0 0
227.13/227.24 c LP : Time Calls Iterations Iter/call Iter/sec
227.13/227.24 c primal LP : 0.30 0 0 0.00 0.00
227.13/227.24 c dual LP : 4.62 147 1260 8.57 272.73
227.13/227.24 c barrier LP : 0.00 0 0 0.00 -
227.13/227.24 c diving/probing LP: 0.00 0 0 0.00 -
227.13/227.24 c strong branching : 74.23 316 10642 33.68 143.37
227.13/227.24 c (at root node) : - 33 7214 218.61 -
227.13/227.24 c conflict analysis: 0.00 0 0 0.00 -
227.13/227.24 c B&B Tree :
227.13/227.24 c number of runs : 1
227.13/227.24 c nodes : 28
227.13/227.24 c nodes (total) : 28
227.13/227.24 c nodes left : 21
227.13/227.24 c max depth : 26
227.13/227.24 c max depth (total): 26
227.13/227.24 c backtracks : 0 (0.0%)
227.13/227.24 c delayed cutoffs : 0
227.13/227.24 c repropagations : 5 (89 domain reductions, 0 cutoffs)
227.13/227.24 c avg switch length: 1.32
227.13/227.24 c switching time : 0.41
227.13/227.24 c Solution :
227.13/227.24 c Solutions found : 1 (1 improvements)
227.13/227.24 c Primal Bound : +3.20000000000000e+01 (in run 1, after 28 nodes, 225.75 seconds, depth 26, found by <relaxation>)
227.13/227.24 c Dual Bound : +3.00000000000000e+01
227.13/227.24 c Gap : 6.67 %
227.13/227.24 c Root Dual Bound : +3.00000000000000e+01
227.73/227.88 c Time complete: 227.83.