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