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