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