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