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-2704064-1278548345.opb>
0.00/0.01 c original problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 101 constraints
0.00/0.01 c problem read
0.00/0.01 c No objective function, only one solution is needed.
0.00/0.01 c presolving settings loaded
0.00/0.02 c presolving:
0.00/0.02 c (round 1) 0 del vars, 28 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 47 upgd conss, 8 impls, 68 clqs
0.00/0.03 c (round 2) 0 del vars, 28 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 73 upgd conss, 8 impls, 68 clqs
0.00/0.03 c presolving (3 rounds):
0.00/0.03 c 0 deleted vars, 28 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.03 c 8 implications, 68 cliques
0.00/0.03 c presolved problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 73 constraints
0.00/0.03 c 1 constraints of type <knapsack>
0.00/0.03 c 72 constraints of type <setppc>
0.00/0.03 c transformed objective value is always integral (scale: 1)
0.00/0.03 c Presolving Time: 0.01
0.00/0.03 c - non default parameters ----------------------------------------------------------------------
0.00/0.03 c # SCIP version 1.2.1.3
0.00/0.03 c
0.00/0.03 c # frequency for displaying node information lines
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.03 c display/freq = 10000
0.00/0.03 c
0.00/0.03 c # maximal time in seconds to run
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/time = 1790
0.00/0.03 c
0.00/0.03 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/memory = 1620
0.00/0.03 c
0.00/0.03 c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c limits/solutions = 1
0.00/0.03 c
0.00/0.03 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.03 c separating/maxrounds = 1
0.00/0.03 c
0.00/0.03 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c separating/maxroundsroot = 5
0.00/0.03 c
0.00/0.03 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.03 c # [type: int, range: [1,2], default: 1]
0.00/0.03 c timing/clocktype = 2
0.00/0.03 c
0.00/0.03 c # should presolving try to simplify inequalities
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/linear/simplifyinequalities = TRUE
0.00/0.03 c
0.00/0.03 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/indicator/addCouplingCons = TRUE
0.00/0.03 c
0.00/0.03 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.03 c constraints/knapsack/disaggregation = FALSE
0.00/0.03 c
0.00/0.03 c # should presolving try to simplify knapsacks
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.03 c
0.00/0.03 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c presolving/probing/maxrounds = 0
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/coefdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/coefdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/coefdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.03 c heuristics/crossover/freq = -1
0.00/0.03 c
0.00/0.03 c # number of nodes added to the contingent of the total nodes
0.00/0.03 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.03 c heuristics/crossover/nodesofs = 750
0.00/0.03 c
0.00/0.03 c # number of nodes without incumbent change that heuristic should wait
0.00/0.03 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.03 c heuristics/crossover/nwaitingnodes = 100
0.00/0.03 c
0.00/0.03 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.03 c # [type: real, range: [0,1], default: 0.1]
0.00/0.03 c heuristics/crossover/nodesquot = 0.15
0.00/0.03 c
0.00/0.03 c # minimum percentage of integer variables that have to be fixed
0.00/0.03 c # [type: real, range: [0,1], default: 0.666]
0.00/0.03 c heuristics/crossover/minfixingrate = 0.5
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.03 c heuristics/feaspump/freq = -1
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/feaspump/maxlpiterofs = 2000
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/fracdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/fracdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/fracdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/guideddiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/guideddiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/guideddiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/intdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/intshifting/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/linesearchdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/nlp/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.03 c heuristics/objpscostdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.03 c # [type: real, range: [0,1], default: 0.01]
0.00/0.03 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/oneopt/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/pscostdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/pscostdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c heuristics/rens/freq = -1
0.00/0.03 c
0.00/0.03 c # minimum percentage of integer variables that have to be fixable
0.00/0.03 c # [type: real, range: [0,1], default: 0.5]
0.00/0.03 c heuristics/rens/minfixingrate = 0.3
0.00/0.03 c
0.00/0.03 c # number of nodes added to the contingent of the total nodes
0.00/0.03 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.03 c heuristics/rens/nodesofs = 2000
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.03 c heuristics/rootsoldiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.03 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/rounding/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/shifting/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/simplerounding/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c heuristics/trivial/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/trysol/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/veclendiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/veclendiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/zirounding/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c separating/cmir/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c separating/flowcover/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c separating/rapidlearning/freq = 0
0.00/0.03 c
0.00/0.03 c -----------------------------------------------------------------------------------------------
0.00/0.03 c start solving
0.00/0.03 c
0.00/0.04 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.00/0.04 c 0.0s| 1 | 0 | 110 | - | 743k| 0 | 42 | 169 | 73 | 169 | 73 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.21 c 0.2s| 1 | 0 | 138 | - |1182k| 0 | 53 | 169 | 215 | 169 | 86 | 13 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.23 c 0.2s| 1 | 0 | 170 | - |1422k| 0 | 60 | 169 | 215 | 169 | 92 | 19 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.25 c 0.2s| 1 | 0 | 232 | - |1609k| 0 | 60 | 169 | 215 | 169 | 100 | 27 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.28 c 0.3s| 1 | 0 | 308 | - |1718k| 0 | 64 | 169 | 215 | 169 | 105 | 32 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.30 c 0.3s| 1 | 0 | 371 | - |1750k| 0 | 63 | 169 | 215 | 169 | 111 | 38 | 0 | 0 | 0.000000e+00 | -- | Inf
0.39/0.49 c 0.5s| 1 | 0 | 420 | - |1675k| 0 | 64 | 169 | 146 | 169 | 111 | 38 | 0 | 8 | 0.000000e+00 | -- | Inf
0.69/0.73 c 0.7s| 1 | 0 | 552 | - |1610k| 0 | 51 | 169 | 92 | 169 | 111 | 38 | 0 | 18 | 0.000000e+00 | -- | Inf
0.79/0.83 c 0.8s| 1 | 0 | 620 | - |1604k| 0 | 45 | 169 | 86 | 169 | 111 | 38 | 0 | 24 | 0.000000e+00 | -- | Inf
0.89/0.93 c 0.9s| 1 | 0 | 635 | - |1603k| 0 | 44 | 169 | 85 | 169 | 111 | 38 | 0 | 30 | 0.000000e+00 | -- | Inf
1.00/1.01 c 1.0s| 1 | 0 | 655 | - |1603k| 0 | 45 | 169 | 85 | 169 | 111 | 38 | 0 | 37 | 0.000000e+00 | -- | Inf
1.10/1.12 c 1.1s| 1 | 0 | 695 | - |1601k| 0 | 40 | 169 | 84 | 169 | 102 | 38 | 0 | 44 | 0.000000e+00 | -- | Inf
1.10/1.16 c 1.1s| 1 | 0 | 695 | - |1601k| 0 | - | 169 | 84 | 169 | 102 | 38 | 0 | 49 | 0.000000e+00 | -- | Inf
1.10/1.16 c (run 1, node 1) restarting after 35 global fixings of integer variables
1.10/1.16 c
1.10/1.16 c (restart) converted 29 cuts from the global cut pool into linear constraints
1.10/1.16 c
1.10/1.16 c presolving:
1.10/1.17 c (round 1) 35 del vars, 2 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 18 impls, 83 clqs
1.10/1.17 c (round 2) 35 del vars, 3 del conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 0 upgd conss, 18 impls, 83 clqs
1.10/1.17 c (round 3) 35 del vars, 3 del conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 39 upgd conss, 18 impls, 83 clqs
1.10/1.18 c (round 4) 35 del vars, 7 del conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 39 upgd conss, 18 impls, 83 clqs
1.10/1.18 c presolving (5 rounds):
1.10/1.18 c 35 deleted vars, 7 deleted constraints, 0 tightened bounds, 0 added holes, 1 changed sides, 0 changed coefficients
1.10/1.18 c 18 implications, 83 cliques
1.10/1.18 c presolved problem has 134 variables (134 bin, 0 int, 0 impl, 0 cont) and 106 constraints
1.10/1.18 c 9 constraints of type <knapsack>
1.10/1.18 c 85 constraints of type <setppc>
1.10/1.18 c 12 constraints of type <logicor>
1.10/1.18 c transformed objective value is always integral (scale: 1)
1.10/1.18 c Presolving Time: 0.03
1.10/1.18 c
1.10/1.19 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.10/1.19 c 1.2s| 1 | 0 | 865 | - | 897k| 0 | 42 | 134 | 106 | 134 | 94 | 0 | 0 | 49 | 0.000000e+00 | -- | Inf
1.19/1.22 c 1.2s| 1 | 0 | 900 | - |1325k| 0 | 48 | 134 | 106 | 134 | 104 | 10 | 0 | 49 | 0.000000e+00 | -- | Inf
1.29/1.33 c 1.3s| 1 | 0 | 932 | - |1323k| 0 | 43 | 134 | 99 | 134 | 104 | 10 | 0 | 59 | 0.000000e+00 | -- | Inf
1.29/1.38 c 1.4s| 1 | 0 | 932 | - |1323k| 0 | - | 134 | 99 | 134 | 104 | 10 | 0 | 64 | 0.000000e+00 | -- | Inf
1.29/1.38 c (run 2, node 1) restarting after 36 global fixings of integer variables
1.29/1.38 c
1.29/1.38 c (restart) converted 10 cuts from the global cut pool into linear constraints
1.29/1.38 c
1.29/1.38 c presolving:
1.29/1.39 c (round 1) 36 del vars, 12 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 32 impls, 74 clqs
1.29/1.39 c (round 2) 36 del vars, 12 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 9 upgd conss, 32 impls, 74 clqs
1.39/1.40 c presolving (3 rounds):
1.39/1.40 c 36 deleted vars, 12 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
1.39/1.40 c 32 implications, 74 cliques
1.39/1.40 c presolved problem has 98 variables (98 bin, 0 int, 0 impl, 0 cont) and 97 constraints
1.39/1.40 c 15 constraints of type <knapsack>
1.39/1.40 c 77 constraints of type <setppc>
1.39/1.40 c 5 constraints of type <logicor>
1.39/1.40 c transformed objective value is always integral (scale: 1)
1.39/1.40 c Presolving Time: 0.05
1.39/1.40 c
1.39/1.40 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.39/1.40 c 1.4s| 1 | 0 | 994 | - | 915k| 0 | 39 | 98 | 97 | 98 | 92 | 0 | 0 | 64 | 0.000000e+00 | -- | Inf
1.39/1.42 c 1.4s| 1 | 0 | 1033 | - |1176k| 0 | 48 | 98 | 97 | 98 | 109 | 17 | 0 | 64 | 0.000000e+00 | -- | Inf
1.49/1.53 c 1.5s| 1 | 0 | 1081 | - |1175k| 0 | 42 | 98 | 96 | 98 | 109 | 17 | 0 | 71 | 0.000000e+00 | -- | Inf
1.59/1.64 c 1.6s| 1 | 0 | 1144 | - |1168k| 0 | 31 | 98 | 77 | 98 | 109 | 17 | 0 | 78 | 0.000000e+00 | -- | Inf
1.59/1.65 c 1.6s| 1 | 0 | 1144 | - |1168k| 0 | 31 | 98 | 77 | 98 | 109 | 17 | 0 | 79 | -- | -- | 0.00%
1.59/1.65 c
1.59/1.65 c SCIP Status : problem is solved [infeasible]
1.59/1.65 c Solving Time (sec) : 1.64
1.59/1.65 c Solving Nodes : 1 (total of 3 nodes in 3 runs)
1.59/1.65 c Primal Bound : +1.00000000000000e+20 (0 solutions)
1.59/1.65 c Dual Bound : +1.00000000000000e+20
1.59/1.65 c Gap : 0.00 %
1.59/1.65 s UNSATISFIABLE
1.59/1.65 c SCIP Status : problem is solved [infeasible]
1.59/1.65 c Solving Time : 1.64
1.59/1.65 c Original Problem :
1.59/1.65 c Problem name : HOME/instance-2704064-1278548345.opb
1.59/1.65 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
1.59/1.65 c Constraints : 101 initial, 101 maximal
1.59/1.65 c Presolved Problem :
1.59/1.65 c Problem name : t_HOME/instance-2704064-1278548345.opb
1.59/1.65 c Variables : 98 (98 binary, 0 integer, 0 implicit integer, 0 continuous)
1.59/1.65 c Constraints : 97 initial, 97 maximal
1.59/1.65 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.59/1.65 c trivial : 0.00 71 0 0 0 0 0 0 0
1.59/1.65 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.59/1.65 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.59/1.65 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.59/1.65 c implics : 0.00 0 0 0 0 0 0 0 0
1.59/1.65 c probing : 0.00 0 0 0 0 0 0 0 0
1.59/1.65 c knapsack : 0.02 0 0 0 0 0 0 0 0
1.59/1.65 c setppc : 0.01 0 0 0 0 0 10 0 0
1.59/1.65 c linear : 0.01 0 0 0 0 0 32 1 0
1.59/1.65 c logicor : 0.00 0 0 0 0 0 5 0 0
1.59/1.65 c root node : - 115 - - 115 - - - -
1.59/1.65 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.59/1.65 c integral : 0 0 0 12 0 1 55 0 0 0
1.59/1.65 c knapsack : 15 7 15 0 0 0 0 0 0 0
1.59/1.65 c setppc : 77 7 15 0 0 0 60 0 0 0
1.59/1.65 c logicor : 5 2 6 0 0 0 0 0 0 0
1.59/1.65 c countsols : 0 0 0 0 0 0 0 0 0 0
1.59/1.65 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.59/1.65 c integral : 1.20 0.00 0.00 1.20 0.00
1.59/1.65 c knapsack : 0.01 0.01 0.00 0.00 0.00
1.59/1.65 c setppc : 0.00 0.00 0.00 0.00 0.00
1.59/1.65 c logicor : 0.00 0.00 0.00 0.00 0.00
1.59/1.65 c countsols : 0.00 0.00 0.00 0.00 0.00
1.59/1.65 c Propagators : Time Calls Cutoffs DomReds
1.59/1.65 c vbounds : 0.00 3 0 0
1.59/1.65 c rootredcost : 0.00 0 0 0
1.59/1.65 c pseudoobj : 0.00 0 0 0
1.59/1.65 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.59/1.65 c propagation : 0.00 0 0 0 0.0 0 0.0 -
1.59/1.65 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.59/1.65 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.59/1.65 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.59/1.65 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.59/1.65 c applied globally : - - - 0 0.0 - - -
1.59/1.65 c applied locally : - - - 0 0.0 - - -
1.59/1.65 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.59/1.65 c cut pool : 0.00 0 - - 0 - (maximal pool size: 102)
1.59/1.65 c redcost : 0.00 7 0 0 0 0
1.59/1.65 c impliedbounds : 0.00 7 0 0 0 0
1.59/1.65 c intobj : 0.00 0 0 0 0 0
1.59/1.65 c cgmip : 0.00 0 0 0 0 0
1.59/1.65 c gomory : 0.05 7 0 0 98 0
1.59/1.65 c strongcg : 0.06 7 0 0 325 0
1.59/1.65 c cmir : 0.00 0 0 0 0 0
1.59/1.65 c flowcover : 0.00 0 0 0 0 0
1.59/1.65 c clique : 0.00 7 0 0 37 0
1.59/1.65 c zerohalf : 0.00 0 0 0 0 0
1.59/1.65 c mcf : 0.00 3 0 0 0 0
1.59/1.65 c rapidlearning : 0.15 1 0 0 0 142
1.59/1.65 c Pricers : Time Calls Vars
1.59/1.65 c problem variables: 0.00 0 0
1.59/1.65 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.59/1.65 c relpscost : 1.20 12 1 55 0 0 0
1.59/1.65 c pscost : 0.00 0 0 0 0 0 0
1.59/1.65 c inference : 0.00 0 0 0 0 0 0
1.59/1.65 c mostinf : 0.00 0 0 0 0 0 0
1.59/1.65 c leastinf : 0.00 0 0 0 0 0 0
1.59/1.65 c fullstrong : 0.00 0 0 0 0 0 0
1.59/1.65 c allfullstrong : 0.00 0 0 0 0 0 0
1.59/1.65 c random : 0.00 0 0 0 0 0 0
1.59/1.65 c Primal Heuristics : Time Calls Found
1.59/1.65 c LP solutions : 0.00 - 0
1.59/1.65 c pseudo solutions : 0.00 - 0
1.59/1.65 c trivial : 0.00 1 0
1.59/1.65 c simplerounding : 0.00 0 0
1.59/1.65 c zirounding : 0.00 0 0
1.59/1.65 c rounding : 0.00 0 0
1.59/1.65 c shifting : 0.00 0 0
1.59/1.65 c intshifting : 0.00 0 0
1.59/1.65 c oneopt : 0.00 0 0
1.59/1.65 c twoopt : 0.00 0 0
1.59/1.65 c fixandinfer : 0.00 0 0
1.59/1.65 c feaspump : 0.00 0 0
1.59/1.65 c coefdiving : 0.00 0 0
1.59/1.65 c pscostdiving : 0.00 0 0
1.59/1.65 c fracdiving : 0.00 0 0
1.59/1.65 c veclendiving : 0.00 0 0
1.59/1.65 c intdiving : 0.00 0 0
1.59/1.65 c actconsdiving : 0.00 0 0
1.59/1.65 c objpscostdiving : 0.00 0 0
1.59/1.65 c rootsoldiving : 0.00 0 0
1.59/1.65 c linesearchdiving : 0.00 0 0
1.59/1.65 c guideddiving : 0.00 0 0
1.59/1.65 c octane : 0.00 0 0
1.59/1.65 c rens : 0.00 0 0
1.59/1.65 c rins : 0.00 0 0
1.59/1.65 c localbranching : 0.00 0 0
1.59/1.65 c mutation : 0.00 0 0
1.59/1.65 c crossover : 0.00 0 0
1.59/1.65 c dins : 0.00 0 0
1.59/1.65 c undercover : 0.00 0 0
1.59/1.65 c nlp : 0.00 0 0
1.59/1.65 c trysol : 0.00 0 0
1.59/1.65 c LP : Time Calls Iterations Iter/call Iter/sec
1.59/1.65 c primal LP : 0.00 0 0 0.00 -
1.59/1.65 c dual LP : 0.09 19 1144 60.21 13302.48
1.59/1.65 c lex dual LP : 0.00 0 0 0.00 -
1.59/1.65 c barrier LP : 0.00 0 0 0.00 -
1.59/1.65 c diving/probing LP: 0.00 0 0 0.00 -
1.59/1.65 c strong branching : 1.19 79 12537 158.70 10491.45
1.59/1.65 c (at root node) : - 79 12537 158.70 -
1.59/1.65 c conflict analysis: 0.00 0 0 0.00 -
1.59/1.65 c B&B Tree :
1.59/1.65 c number of runs : 3
1.59/1.65 c nodes : 1
1.59/1.65 c nodes (total) : 3
1.59/1.65 c nodes left : 0
1.59/1.65 c max depth : 0
1.59/1.65 c max depth (total): 0
1.59/1.65 c backtracks : 0 (0.0%)
1.59/1.65 c delayed cutoffs : 0
1.59/1.65 c repropagations : 0 (0 domain reductions, 0 cutoffs)
1.59/1.65 c avg switch length: 2.00
1.59/1.65 c switching time : 0.00
1.59/1.65 c Solution :
1.59/1.65 c Solutions found : 0 (0 improvements)
1.59/1.65 c Primal Bound : infeasible
1.59/1.65 c Dual Bound : -
1.59/1.65 c Gap : 0.00 %
1.59/1.65 c Root Dual Bound : -
1.59/1.65 c Root Iterations : 1144
1.59/1.66 c Time complete: 1.66.