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