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