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