0.00/0.10 c SCIP version 1.1.0.7
0.00/0.10 c LP-Solver Clp 1.8.2
0.00/0.10 c user parameter file <scip.set> not found - using default parameters
0.00/0.10 c read problem <HOME/instance-1870659-1245215076.opb>
0.00/0.10 c original problem has 7326 variables (7326 bin, 0 int, 0 impl, 0 cont) and 7828 constraints
0.09/0.18 c No objective function, only one solution is needed.
0.09/0.18 c start presolving problem
0.09/0.18 c presolving:
0.39/0.43 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 1501 upgd conss, 51608 impls, 1000 clqs
0.59/0.63 c presolving (2 rounds):
0.59/0.63 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.59/0.63 c 51608 implications, 1000 cliques
0.59/0.63 c presolved problem has 7326 variables (7326 bin, 0 int, 0 impl, 0 cont) and 7828 constraints
0.59/0.63 c 1 constraints of type <knapsack>
0.59/0.63 c 1000 constraints of type <setppc>
0.59/0.63 c 6326 constraints of type <and>
0.59/0.63 c 1 constraints of type <linear>
0.59/0.63 c 500 constraints of type <logicor>
0.59/0.63 c transformed objective value is always integral (scale: 1)
0.59/0.63 c Presolving Time: 0.32
0.59/0.63 c SATUNSAT-NLC
0.59/0.63 c -----------------------------------------------------------------------------------------------
0.59/0.63 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.59/0.63 c # [type: int, range: [-1,2147483647], default: 0]
0.59/0.63 c separating/flowcover/freq = c -1
0.59/0.63 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.59/0.63 c # [type: int, range: [-1,2147483647], default: 0]
0.59/0.63 c separating/cmir/freq = c -1
0.59/0.63 c # additional number of allowed LP iterations
0.59/0.63 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.63 c heuristics/veclendiving/maxlpiterofs = c 1500
0.59/0.63 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.63 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.59/0.63 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.59/0.63 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.59/0.63 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.63 c heuristics/veclendiving/freq = c -1
0.59/0.63 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.59/0.63 c # [type: int, range: [-1,2147483647], default: 1]
0.59/0.63 c heuristics/simplerounding/freq = c -1
0.59/0.63 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.59/0.63 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.63 c heuristics/shifting/freq = c -1
0.59/0.63 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.59/0.63 c # [type: int, range: [-1,2147483647], default: 1]
0.59/0.63 c heuristics/rounding/freq = c -1
0.59/0.63 c # additional number of allowed LP iterations
0.59/0.63 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.63 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.59/0.63 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.63 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.59/0.63 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.59/0.63 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.59/0.63 c # [type: int, range: [-1,2147483647], default: 20]
0.59/0.63 c heuristics/rootsoldiving/freq = c -1
0.59/0.63 c # number of nodes added to the contingent of the total nodes
0.59/0.63 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.59/0.63 c heuristics/rens/nodesofs = c 2000
0.59/0.63 c # minimum percentage of integer variables that have to be fixable
0.59/0.63 c # [type: real, range: [0,1], default: 0.5]
0.59/0.63 c heuristics/rens/minfixingrate = c 0.3
0.59/0.63 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.59/0.63 c # [type: int, range: [-1,2147483647], default: 0]
0.59/0.63 c heuristics/rens/freq = c -1
0.59/0.63 c # additional number of allowed LP iterations
0.59/0.63 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.63 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.59/0.63 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.63 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.59/0.63 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.59/0.63 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.59/0.63 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.63 c heuristics/pscostdiving/freq = c -1
0.59/0.63 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.59/0.63 c # [type: int, range: [-1,2147483647], default: 1]
0.59/0.63 c heuristics/oneopt/freq = c -1
0.59/0.63 c # additional number of allowed LP iterations
0.59/0.63 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.63 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.59/0.63 c # maximal fraction of diving LP iterations compared to total iteration number
0.59/0.63 c # [type: real, range: [0,1], default: 0.01]
0.59/0.63 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.59/0.63 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.59/0.63 c # [type: int, range: [-1,2147483647], default: 20]
0.59/0.63 c heuristics/objpscostdiving/freq = c -1
0.59/0.63 c # additional number of allowed LP iterations
0.59/0.63 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.63 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.59/0.63 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.63 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.59/0.63 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.59/0.63 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.59/0.63 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.63 c heuristics/linesearchdiving/freq = c -1
0.59/0.63 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.59/0.63 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.63 c heuristics/intshifting/freq = c -1
0.59/0.63 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.63 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.59/0.63 c heuristics/intdiving/maxlpiterquot = c 0.075
0.59/0.63 c # additional number of allowed LP iterations
0.59/0.63 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.63 c heuristics/guideddiving/maxlpiterofs = c 1500
0.59/0.63 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.63 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.59/0.63 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.59/0.63 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.59/0.63 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.63 c heuristics/guideddiving/freq = c -1
0.59/0.63 c # additional number of allowed LP iterations
0.59/0.63 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.63 c heuristics/fracdiving/maxlpiterofs = c 1500
0.59/0.63 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.63 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.59/0.63 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.59/0.63 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.59/0.63 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.63 c heuristics/fracdiving/freq = c -1
0.59/0.63 c # additional number of allowed LP iterations
0.59/0.63 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.63 c heuristics/feaspump/maxlpiterofs = c 2000
0.59/0.63 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.59/0.63 c # [type: int, range: [-1,2147483647], default: 20]
0.59/0.63 c heuristics/feaspump/freq = c -1
0.59/0.63 c # minimum percentage of integer variables that have to be fixed
0.59/0.63 c # [type: real, range: [0,1], default: 0.666]
0.59/0.63 c heuristics/crossover/minfixingrate = c 0.5
0.59/0.63 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.59/0.63 c # [type: real, range: [0,1], default: 0.1]
0.59/0.63 c heuristics/crossover/nodesquot = c 0.15
0.59/0.63 c # number of nodes without incumbent change that heuristic should wait
0.59/0.63 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.59/0.63 c heuristics/crossover/nwaitingnodes = c 100
0.59/0.63 c # number of nodes added to the contingent of the total nodes
0.59/0.63 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.59/0.63 c heuristics/crossover/nodesofs = c 750
0.59/0.63 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.59/0.63 c # [type: int, range: [-1,2147483647], default: 30]
0.59/0.63 c heuristics/crossover/freq = c -1
0.59/0.63 c # additional number of allowed LP iterations
0.59/0.63 c # [type: int, range: [0,2147483647], default: 1000]
0.59/0.63 c heuristics/coefdiving/maxlpiterofs = c 1500
0.59/0.63 c # maximal fraction of diving LP iterations compared to node LP iterations
0.59/0.63 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.59/0.63 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.59/0.63 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.59/0.63 c # [type: int, range: [-1,2147483647], default: 10]
0.59/0.63 c heuristics/coefdiving/freq = c -1
0.59/0.63 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.59/0.63 c # [type: int, range: [-1,2147483647], default: -1]
0.59/0.63 c presolving/probing/maxrounds = c 0
0.59/0.63 c # should presolving try to simplify knapsacks
0.59/0.63 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.59/0.63 c constraints/knapsack/simplifyinequalities = c TRUE
0.59/0.63 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.59/0.63 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.59/0.63 c constraints/knapsack/disaggregation = c FALSE
0.59/0.63 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.59/0.63 c # [type: int, range: [-1,2147483647], default: -1]
0.59/0.63 c constraints/knapsack/maxnumcardlift = c 0
0.59/0.63 c # should presolving try to simplify inequalities
0.59/0.64 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.59/0.64 c constraints/linear/simplifyinequalities = c TRUE
0.59/0.64 c # maximal number of separation rounds in the root node (-1: unlimited)
0.59/0.64 c # [type: int, range: [-1,2147483647], default: -1]
0.59/0.64 c separating/maxroundsroot = c 5
0.59/0.64 c # maximal number of separation rounds per node (-1: unlimited)
0.59/0.64 c # [type: int, range: [-1,2147483647], default: 5]
0.59/0.64 c separating/maxrounds = c 1
0.59/0.64 c # solving stops, if the given number of solutions were found (-1: no limit)
0.59/0.64 c # [type: int, range: [-1,2147483647], default: -1]
0.59/0.64 c limits/solutions = c 1
0.59/0.64 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.59/0.64 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.59/0.64 c limits/memory = c 1620
0.59/0.64 c # maximal time in seconds to run
0.59/0.64 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.59/0.64 c limits/time = c 1791
0.59/0.64 c # frequency for displaying node information lines
0.59/0.64 c # [type: int, range: [-1,2147483647], default: 100]
0.59/0.64 c display/freq = c 10000
0.59/0.64 c -----------------------------------------------------------------------------------------------
0.59/0.64 c start solving problem
0.59/0.64 c
1.09/1.11 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.09/1.11 c 0.8s| 1 | 0 | 607 | 32M| 0 | 210 |7326 |7828 |7828 |7326 | 14k| 0 | 0 | 0 | 1.600000e+02 | -- | Inf
2.89/2.96 c 2.6s| 1 | 0 | 687 | 32M| 0 | 309 |7326 |7828 |7828 |7326 | 14k| 1 | 0 | 0 | 1.600000e+02 | -- | Inf
15.08/15.17 c 14.8s| 1 | 0 | 689 | 32M| 0 | 312 |7326 |7828 |7828 |7326 | 14k| 2 | 0 | 0 | 1.600000e+02 | -- | Inf
26.08/26.12 c 25.7s| 1 | 0 | 717 | 33M| 0 | 330 |7326 |7828 |7828 |7326 | 14k| 3 | 0 | 0 | 1.600000e+02 | -- | Inf
39.49/39.50 c 39.1s| 1 | 0 | 847 | 33M| 0 | 372 |7326 |7828 |7828 |7326 | 14k| 4 | 0 | 0 | 1.600000e+02 | -- | Inf
54.67/54.75 c 54.3s| 1 | 0 | 872 | 33M| 0 | 373 |7326 |7828 |7828 |7326 | 14k| 5 | 0 | 0 | 1.600000e+02 | -- | Inf
66.27/66.39 c 65.9s| 1 | 2 | 872 | 33M| 0 | 373 |7326 |7828 |7828 |7326 | 14k| 5 | 0 | 33 | 1.600000e+02 | -- | Inf
213.83/213.97 c * 213s| 823 | 764 | 50996 | 38M| 81 | - |7326 |7836 |4848 |7326 |2856 | 17k| 8 |3842 | 1.600000e+02 | 1.650000e+02 | 3.13%
213.83/213.97 c
213.83/213.97 c SCIP Status : solving was interrupted [solution limit reached]
213.83/213.97 c Solving Time (sec) : 213.30
213.83/213.97 c Solving Nodes : 823
213.83/213.97 c Primal Bound : +1.65000000000001e+02 (1 solutions)
213.83/213.97 c Dual Bound : +1.60000000000001e+02
213.83/213.97 c Gap : 3.13 %
213.83/213.99 c NODE 823
213.83/213.99 c DUAL BOUND 160
213.83/213.99 c PRIMAL BOUND 165
213.83/213.99 c GAP 0.03125
213.83/213.99 s SATISFIABLE
213.83/213.99 v -x774 -x830 -x914 -x753 x818 -x636 -x812 -x906 -x737 x923 -x729 -x684 -x946 -x993 -x964 x917 -x733 -x683 -x713 -x643 -x761 -x735
213.83/213.99 v -x723 -x829 -x726 -x804 -x615 -x797 -x859 -x846 -x580 -x659 -x828 -x611 -x594 -x995 -x744 x944 -x870 -x572 -x831 -x743 -x736
213.83/213.99 v -x998 -x931 -x835 -x567 -x861 -x971 -x680 -x576 -x656 -x895 -x740 x901 -x646 -x706 -x698 -x626 -x562 -x867 -x728 -x722 -x565
213.83/213.99 v -x929 -x789 -x686 -x658 x760 x838 -x814 -x558 -x691 -x666 -x862 -x925 x694 x709 -x952 -x891 -x677 -x759 -x734 -x552 x583 -x936
213.83/213.99 v -x582 -x796 -x834 -x913 -x654 -x619 -x960 -x875 -x564 -x911 -x782 -x618 -x621 -x662 -x857 -x793 -x710 -x872 x958 x751 x772
213.83/213.99 v x876 x788 -x672 -x937 -x881 -x652 -x651 -x863 -x550 -x839 -x791 -x767 -x588 -x561 -x675 x673 -x924 -x877 -x837 -x978 -x624
213.83/213.99 v -x1000 -x790 x918 -x750 -x935 -x548 x919 -x630 -x900 -x546 -x581 -x637 -x850 -x535 -x649 x786 -x832 x747 -x840 -x851 x534 -x898
213.83/213.99 v -x858 -x536 -x957 -x809 x968 -x533 -x951 -x941 x909 -x908 x856 -x720 -x977 -x604 -x833 -x916 -x799 -x540 -x953 -x600 -x593
213.83/213.99 v -x687 x617 -x824 -x554 -x836 -x606 -x975 -x644 -x991 -x887 -x930 -x642 -x934 x693 -x665 -x607 -x899 -x779 -x989 -x762 -x892
213.83/213.99 v x622 -x531 -x585 -x805 -x625 x586 -x551 -x928 -x841 -x685 -x739 -x525 -x704 -x689 -x579 -x549 -x669 x959 -x855 x890 -x667 x616
213.83/213.99 v -x871 x888 x696 -x976 -x523 -x792 -x629 -x566 -x596 -x956 x559 -x522 -x716 -x714 x553 -x702 x768 -x539 -x781 -x985 -x820 -x843
213.83/213.99 v -x543 -x813 -x922 -x794 -x563 -x530 -x520 x938 -x764 x610 -x758 -x614 x866 -x992 -x773 -x708 -x647 -x592 -x663 -x547 -x674
213.83/213.99 v -x730 -x896 -x979 -x518 -x798 x731 -x653 -x641 -x587 -x590 -x803 -x679 -x770 x860 -x682 -x785 -x608 -x577 -x639 -x655 -x578
213.83/213.99 v x516 -x893 x854 -x745 -x645 -x602 -x542 -x638 x849 -x921 x869 -x724 -x537 -x515 x598 -x852 x987 -x660 -x910 -x771 x514 x950
213.83/213.99 v -x882 -x842 x815 -x727 x711 -x670 -x632 -x556 -x927 -x884 x826 -x664 -x885 -x983 -x949 -x920 -x766 -x756 -x695 -x668 -x571 -x589
213.83/213.99 v -x945 -x712 -x981 -x697 -x765 -x980 -x521 -x512 -x954 -x819 -x808 -x776 -x717 -x865 -x897 -x853 -x678 -x627 -x513 -x879 x511
213.83/213.99 v -x816 -x810 -x763 -x699 -x544 x703 -x742 x707 -x967 -x681 -x671 -x609 -x986 x940 -x878 x847 x749 -x825 -x912 -x990 -x889
213.83/213.99 v -x746 -x705 -x528 -x524 -x657 -x806 -x661 -x868 -x933 -x988 -x800 x634 -x947 -x807 -x778 -x754 x752 -x612 x569 x939 -x974 -x603
213.83/213.99 v -x997 -x591 -x907 x970 -x966 -x783 -x628 -x575 -x527 -x508 -x640 -x692 x932 -x994 x573 -x732 -x738 -x506 -x999 -x633 -x509
213.83/213.99 v -x817 -x507 -x755 -x996 -x787 -x873 -x822 -x568 -x948 -x690 -x505 x972 -x963 -x701 x560 x517 -x748 -x844 -x973 -x599 -x943 -x532
213.83/213.99 v -x845 -x676 -x777 x880 -x504 -x926 x801 -x784 -x613 -x601 -x595 -x570 -x962 x984 -x725 -x795 -x620 -x700 x757 -x905 -x874
213.83/213.99 v -x503 -x848 -x688 x635 -x557 -x631 -x821 -x721 -x883 x823 -x719 -x574 -x780 x969 x605 -x502 -x961 -x894 x769 x741 -x648 -x597
213.83/213.99 v -x519 -x718 -x650 -x902 -x942 -x903 -x915 -x904 x965 -x715 x955 -x501 -x982 -x811 -x623 -x555 -x541 -x510 -x545 -x886 -x529
213.83/213.99 v -x526 -x538 -x864 -x827 -x775 -x584 -x802 -x500 -x499 -x498 -x497 -x496 -x495 -x494 -x493 -x492 -x491 x490 -x489 -x488 -x487
213.83/213.99 v -x486 -x485 -x484 -x483 -x482 -x481 -x480 -x479 -x478 -x477 -x476 -x475 x474 x473 -x472 -x471 -x470 -x469 -x468 -x467 -x466
213.83/213.99 v -x465 -x464 -x463 -x462 -x461 -x460 -x459 -x458 -x457 -x456 -x455 x454 x453 -x452 -x451 -x450 -x449 -x448 x447 -x446 x445 -x444
213.83/213.99 v -x443 -x442 -x441 -x440 -x439 -x438 -x437 x436 -x435 x434 -x433 -x432 -x431 x430 x429 -x428 -x427 -x426 -x425 -x424 -x423
213.83/213.99 v -x422 -x421 -x420 -x419 -x418 -x417 -x416 -x415 -x414 -x413 -x412 -x411 -x410 -x409 -x408 -x407 -x406 -x405 x404 -x403 -x402
213.83/213.99 v -x401 -x400 -x399 -x398 -x397 -x396 -x395 -x394 -x393 -x392 -x391 -x390 -x389 -x388 -x387 -x386 -x385 -x384 x383 -x382 -x381
213.83/213.99 v -x380 -x379 x378 -x377 -x376 -x375 -x374 -x373 -x372 -x371 -x370 -x369 -x368 -x367 -x366 -x365 -x364 -x363 -x362 -x361 -x360
213.83/213.99 v -x359 -x358 -x357 -x356 -x355 -x354 -x353 x352 -x351 -x350 -x349 -x348 -x347 -x346 -x345 -x344 -x343 -x342 -x341 -x340 -x339
213.83/213.99 v -x338 -x337 -x336 -x335 -x334 -x333 -x332 -x331 x330 -x329 -x328 -x327 -x326 -x325 -x324 -x323 x322 x321 -x320 -x319 -x318 -x317
213.83/213.99 v -x316 -x315 -x314 x313 -x312 -x311 -x310 -x309 -x308 -x307 -x306 -x305 -x304 -x303 x302 -x301 -x300 -x299 -x298 -x297 -x296
213.83/213.99 v -x295 -x294 -x293 -x292 -x291 -x290 -x289 -x288 -x287 -x286 -x285 -x284 -x283 -x282 -x281 -x280 -x279 -x278 -x277 -x276 -x275
213.83/213.99 v -x274 -x273 -x272 -x271 -x270 -x269 -x268 -x267 -x266 -x265 -x264 -x263 x262 -x261 -x260 -x259 -x258 -x257 -x256 -x255 x254
213.83/213.99 v -x253 -x252 -x251 -x250 -x249 -x248 -x247 x246 -x245 -x244 -x243 -x242 -x241 -x240 -x239 -x238 -x237 -x236 -x235 -x234 -x233
213.83/213.99 v -x232 -x231 -x230 -x229 -x228 -x227 -x226 -x225 -x224 -x223 -x222 -x221 -x220 -x219 -x218 -x217 -x216 -x215 -x214 -x213 -x212
213.83/213.99 v -x211 -x210 -x209 -x208 -x207 -x206 -x205 -x204 -x203 x202 -x201 -x200 -x199 x198 -x197 -x196 -x195 -x194 -x193 -x192 -x191
213.83/213.99 v -x190 -x189 x188 x187 -x186 x185 -x184 -x183 -x182 x181 -x180 -x179 -x178 -x177 -x176 x175 -x174 -x173 -x172 x171 -x170 -x169
213.83/213.99 v x168 x167 -x166 -x165 -x164 -x163 -x162 x161 x160 -x159 -x158 x157 -x156 -x155 -x154 x153 -x152 -x151 x150 x149 x148 -x147
213.83/213.99 v -x146 -x145 x144 x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134 x133 -x132 -x131 x130 x129 -x128 -x127 x126 x125
213.83/213.99 v -x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 x115 x114 x113 -x112 x111 -x110 -x109 -x108 x107 x106 -x105 x104 x103
213.83/213.99 v -x102 -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
213.83/213.99 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 -x51
213.83/213.99 v 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
213.83/213.99 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
213.83/213.99 c SCIP Status : solving was interrupted [solution limit reached]
213.83/213.99 c Solving Time : 213.30
213.83/213.99 c Original Problem :
213.83/213.99 c Problem name : HOME/instance-1870659-1245215076.opb
213.83/213.99 c Variables : 7326 (7326 binary, 0 integer, 0 implicit integer, 0 continuous)
213.83/213.99 c Constraints : 7828 initial, 7828 maximal
213.83/213.99 c Presolved Problem :
213.83/213.99 c Problem name : t_HOME/instance-1870659-1245215076.opb
213.83/213.99 c Variables : 7326 (7326 binary, 0 integer, 0 implicit integer, 0 continuous)
213.83/213.99 c Constraints : 7828 initial, 7836 maximal
213.83/213.99 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
213.83/213.99 c trivial : 0.01 0 0 0 0 0 0 0 0
213.83/213.99 c dualfix : 0.00 0 0 0 0 0 0 0 0
213.83/213.99 c boundshift : 0.00 0 0 0 0 0 0 0 0
213.83/213.99 c inttobinary : 0.00 0 0 0 0 0 0 0 0
213.83/213.99 c implics : 0.00 0 0 0 0 0 0 0 0
213.83/213.99 c probing : 0.00 0 0 0 0 0 0 0 0
213.83/213.99 c knapsack : 0.02 0 0 0 0 0 0 0 0
213.83/213.99 c setppc : 0.01 0 0 0 0 0 0 0 0
213.83/213.99 c and : 0.18 0 0 0 0 0 0 0 0
213.83/213.99 c linear : 0.06 0 0 0 0 0 0 0 0
213.83/213.99 c logicor : 0.01 0 0 0 0 0 0 0 0
213.83/213.99 c root node : - 0 - - 0 - - - -
213.83/213.99 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
213.83/213.99 c integral : 0 0 0 835 0 0 0 0 0 1628
213.83/213.99 c knapsack : 1 5 2214 21 0 0 0 0 0 0
213.83/213.99 c setppc : 1000 5 2214 21 0 8 1631 0 0 0
213.83/213.99 c and : 6326 819 2206 21 0 0 29581 17219 0 0
213.83/213.99 c linear : 1 5 2206 1 0 0 0 0 0 0
213.83/213.99 c logicor : 500+ 5 567 1 0 0 448 0 0 0
213.83/213.99 c countsols : 0 0 0 1 0 0 0 0 0 0
213.83/213.99 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
213.83/213.99 c integral : 57.32 0.00 0.00 57.32 0.00
213.83/213.99 c knapsack : 0.01 0.01 0.00 0.00 0.00
213.83/213.99 c setppc : 0.20 0.00 0.20 0.00 0.00
213.83/213.99 c and : 6.26 4.66 1.54 0.06 0.00
213.83/213.99 c linear : 0.31 0.00 0.31 0.00 0.00
213.83/213.99 c logicor : 0.02 0.00 0.02 0.00 0.00
213.83/213.99 c countsols : 0.00 0.00 0.00 0.00 0.00
213.83/213.99 c Propagators : Time Calls Cutoffs DomReds
213.83/213.99 c rootredcost : 0.00 0 0 0
213.83/213.99 c pseudoobj : 2.77 2215 0 0
213.83/213.99 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
213.83/213.99 c propagation : 0.00 8 8 8 3.0 0 0.0 -
213.83/213.99 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
213.83/213.99 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
213.83/213.99 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
213.83/213.99 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
213.83/213.99 c applied globally : - - - 8 3.0 - - -
213.83/213.99 c applied locally : - - - 0 0.0 - - -
213.83/213.99 c Separators : Time Calls Cutoffs DomReds Cuts Conss
213.83/213.99 c cut pool : 0.00 4 - - 1 - (maximal pool size: 20)
213.83/213.99 c redcost : 1.12 819 0 0 0 0
213.83/213.99 c impliedbounds : 0.00 5 0 0 0 0
213.83/213.99 c intobj : 0.00 0 0 0 0 0
213.83/213.99 c gomory : 45.12 5 0 0 500 0
213.83/213.99 c strongcg : 7.46 5 0 0 2500 0
213.83/213.99 c cmir : 0.00 0 0 0 0 0
213.83/213.99 c flowcover : 0.00 0 0 0 0 0
213.83/213.99 c clique : 0.14 5 0 0 0 0
213.83/213.99 c zerohalf : 0.00 0 0 0 0 0
213.83/213.99 c mcf : 0.04 1 0 0 0 0
213.83/213.99 c Pricers : Time Calls Vars
213.83/213.99 c problem variables: 0.00 0 0
213.83/213.99 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
213.83/213.99 c relpscost : 57.32 814 0 0 0 0 1628
213.83/213.99 c pscost : 0.00 0 0 0 0 0 0
213.83/213.99 c inference : 0.00 0 0 0 0 0 0
213.83/213.99 c mostinf : 0.00 0 0 0 0 0 0
213.83/213.99 c leastinf : 0.00 0 0 0 0 0 0
213.83/213.99 c fullstrong : 0.00 0 0 0 0 0 0
213.83/213.99 c allfullstrong : 0.00 0 0 0 0 0 0
213.83/213.99 c random : 0.00 0 0 0 0 0 0
213.83/213.99 c Primal Heuristics : Time Calls Found
213.83/213.99 c LP solutions : 0.00 - 1
213.83/213.99 c pseudo solutions : 0.00 - 0
213.83/213.99 c simplerounding : 0.00 0 0
213.83/213.99 c rounding : 0.00 0 0
213.83/213.99 c shifting : 0.00 0 0
213.83/213.99 c intshifting : 0.00 0 0
213.83/213.99 c oneopt : 0.00 0 0
213.83/213.99 c fixandinfer : 0.00 0 0
213.83/213.99 c feaspump : 0.00 0 0
213.83/213.99 c coefdiving : 0.00 0 0
213.83/213.99 c pscostdiving : 0.00 0 0
213.83/213.99 c fracdiving : 0.00 0 0
213.83/213.99 c veclendiving : 0.00 0 0
213.83/213.99 c intdiving : 0.00 0 0
213.83/213.99 c actconsdiving : 0.00 0 0
213.83/213.99 c objpscostdiving : 0.00 0 0
213.83/213.99 c rootsoldiving : 0.00 0 0
213.83/213.99 c linesearchdiving : 0.00 0 0
213.83/213.99 c guideddiving : 0.00 0 0
213.83/213.99 c octane : 0.00 0 0
213.83/213.99 c rens : 0.00 0 0
213.83/213.99 c rins : 0.00 0 0
213.83/213.99 c localbranching : 0.00 0 0
213.83/213.99 c mutation : 0.00 0 0
213.83/213.99 c crossover : 0.00 0 0
213.83/213.99 c dins : 0.00 0 0
213.83/213.99 c LP : Time Calls Iterations Iter/call Iter/sec
213.83/213.99 c primal LP : 51.73 0 0 0.00 0.00
213.83/213.99 c dual LP : 32.89 1628 50996 31.32 1550.50
213.83/213.99 c barrier LP : 0.00 0 0 0.00 -
213.83/213.99 c diving/probing LP: 0.00 0 0 0.00 -
213.83/213.99 c strong branching : 56.97 3842 90832 23.64 1594.38
213.83/213.99 c (at root node) : - 33 5082 154.00 -
213.83/213.99 c conflict analysis: 0.00 0 0 0.00 -
213.83/213.99 c B&B Tree :
213.83/213.99 c number of runs : 1
213.83/213.99 c nodes : 823
213.83/213.99 c nodes (total) : 823
213.83/213.99 c nodes left : 764
213.83/213.99 c max depth : 81
213.83/213.99 c max depth (total): 81
213.83/213.99 c backtracks : 27 (3.3%)
213.83/213.99 c delayed cutoffs : 0
213.83/213.99 c repropagations : 121 (130 domain reductions, 0 cutoffs)
213.83/213.99 c avg switch length: 2.36
213.83/213.99 c switching time : 52.48
213.83/213.99 c Solution :
213.83/213.99 c Solutions found : 1 (1 improvements)
213.83/213.99 c Primal Bound : +1.65000000000001e+02 (in run 1, after 823 nodes, 213.30 seconds, depth 77, found by <relaxation>)
213.83/213.99 c Dual Bound : +1.60000000000001e+02
213.83/213.99 c Gap : 3.13 %
213.83/213.99 c Root Dual Bound : +1.60000000000001e+02
214.03/214.12 c Time complete: 214.05.